Searched defs:children (Results 1 - 7 of 7) sorted by relevance
/systemd/src/basic/ |
H A D | strbuf.h | 42 struct strbuf_child_entry *children; member in struct:strbuf_node
|
/systemd/src/bootchart/ |
H A D | bootchart.h | 71 struct ps_struct *children; /* children */ member in struct:ps_struct
|
H A D | store.c | 323 * each parent has a LL of children, and a LL of siblings 344 if (!parent->children) { 346 parent->children = ps; 348 /* walk all children and append */ 349 struct ps_struct *children; local 350 children = parent->children; 351 while (children->next) 352 children = children [all...] |
/systemd/src/libsystemd/sd-bus/ |
H A D | bus-match.h | 65 Hashmap *children; member in struct:bus_match_node::__anon119::__anon122
|
H A D | bus-objects.c | 123 char **children = NULL, **k; local 133 r = c->callback(bus, prefix, slot->userdata, &children, error); 142 STRV_FOREACH(k, children) { 164 free(children);
|
/systemd/src/hwdb/ |
H A D | hwdb.c | 64 /* prefix, common part for all children of this node */ 67 /* sorted array of pointers to children nodes */ 68 struct trie_child_entry *children; member in struct:trie_node 76 /* children array item with char (0-255) index */ 99 child = realloc(node->children, (node->children_count + 1) * sizeof(struct trie_child_entry)); 103 node->children = child; 105 node->children[node->children_count].c = c; 106 node->children[node->children_count].child = node_child; 108 qsort(node->children, node->children_count, sizeof(struct trie_child_entry), trie_children_cmp); 119 child = bsearch(&search, node->children, nod 314 struct trie_child_entry_f *children = NULL; local [all...] |
/systemd/src/udev/ |
H A D | udevadm-hwdb.c | 58 /* prefix, common part for all children of this node */ 61 /* sorted array of pointers to children nodes */ 62 struct trie_child_entry *children; member in struct:trie_node 70 /* children array item with char (0-255) index */ 93 child = realloc(node->children, (node->children_count + 1) * sizeof(struct trie_child_entry)); 97 node->children = child; 99 node->children[node->children_count].c = c; 100 node->children[node->children_count].child = node_child; 102 qsort(node->children, node->children_count, sizeof(struct trie_child_entry), trie_children_cmp); 113 child = bsearch(&search, node->children, nod 295 struct trie_child_entry_f *children = NULL; local [all...] |
Completed in 1800 milliseconds