| /systemd/src/test/ |
| H A D | test-uid-range.c | 30 uid_t search; local
42 search = UID_INVALID;
43 assert_se(uid_range_next_lower(p, n, &search));
44 assert_se(search == 999);
45 assert_se(uid_range_next_lower(p, n, &search));
46 assert_se(search == 998);
47 search = 501;
48 assert_se(uid_range_next_lower(p, n, &search));
49 assert_se(search == 500);
50 assert_se(uid_range_next_lower(p, n, &search)
[all...] |
| /systemd/src/basic/ |
| H A D | strbuf.c | 140 /* search string; start from last character to find possibly matching tails */
149 struct strbuf_child_entry search; local
161 search.c = c;
162 child = bsearch(&search, node->children, node->children_count,
|
| H A D | fileio.c | 943 static int search_and_fopen_internal(const char *path, const char *mode, const char *root, char **search, FILE **_f) { argument
950 if (!path_strv_resolve_uniq(search, root))
953 STRV_FOREACH(i, search) {
977 int search_and_fopen(const char *path, const char *mode, const char *root, const char **search, FILE **_f) { argument
996 copy = strv_copy((char**) search);
1003 int search_and_fopen_nulstr(const char *path, const char *mode, const char *root, const char *search, FILE **_f) { argument
1018 s = strv_split_nulstr(search);
|
| /systemd/src/libsystemd/sd-hwdb/ |
| H A D | sd-hwdb.c | 129 struct trie_child_entry_f search; local
131 search.c = c;
132 child = bsearch(&search, trie_node_children(hwdb, node), node->children_count,
169 struct linebuf *buf, const char *search) {
183 err = trie_fnmatch_f(hwdb, trie_node_from_off(hwdb, child->child_off), 0, buf, search);
189 if (le64toh(node->values_count) && fnmatch(linebuf_get(buf), search, 0) == 0)
201 static int trie_search_f(sd_hwdb *hwdb, const char *search) { argument
219 return trie_fnmatch_f(hwdb, node, p, &buf, search + i + p);
220 if (c != search[i + p])
229 err = trie_fnmatch_f(hwdb, child, 0, &buf, search
168 trie_fnmatch_f(sd_hwdb *hwdb, const struct trie_node_f *node, size_t p, struct linebuf *buf, const char *search) argument
[all...] |
| /systemd/src/hwdb/ |
| H A D | hwdb.c | 116 struct trie_child_entry search; local
118 search.c = c;
119 child = bsearch(&search, node->children, node->children_count, sizeof(struct trie_child_entry), trie_children_cmp);
170 struct trie_value_entry search = { local
175 val = xbsearch_r(&search, node->values, node->values_count, sizeof(struct trie_value_entry), trie_values_cmp, trie);
196 static int trie_insert(struct trie *trie, struct trie_node *node, const char *search, argument
211 if (c == search[i + p])
249 c = search[i];
262 off = strbuf_add_string(trie->strings, search + i+1, strlen(search
[all...] |
| /systemd/src/udev/ |
| H A D | udevadm-hwdb.c | 110 struct trie_child_entry search; local
112 search.c = c;
113 child = bsearch(&search, node->children, node->children_count, sizeof(struct trie_child_entry), trie_children_cmp);
151 struct trie_value_entry search = { local
156 val = xbsearch_r(&search, node->values, node->values_count, sizeof(struct trie_value_entry), trie_values_cmp, trie);
177 static int trie_insert(struct trie *trie, struct trie_node *node, const char *search, argument
192 if (c == search[i + p])
230 c = search[i];
243 off = strbuf_add_string(trie->strings, search + i+1, strlen(search
[all...] |
| /systemd/src/shared/ |
| H A D | install.c | 68 static int in_search_path(const char *path, char **search) { argument
78 STRV_FOREACH(i, search)
|