trie_child_entry 59 src/udev/udevadm-hwdb.c struct trie_child_entry *children; trie_child_entry 80 src/udev/udevadm-hwdb.c const struct trie_child_entry *n1 = v1; trie_child_entry 81 src/udev/udevadm-hwdb.c const struct trie_child_entry *n2 = v2; trie_child_entry 87 src/udev/udevadm-hwdb.c struct trie_child_entry *child; trie_child_entry 90 src/udev/udevadm-hwdb.c child = realloc(node->children, (node->children_count + 1) * sizeof(struct trie_child_entry)); trie_child_entry 99 src/udev/udevadm-hwdb.c qsort(node->children, node->children_count, sizeof(struct trie_child_entry), trie_children_cmp); trie_child_entry 106 src/udev/udevadm-hwdb.c struct trie_child_entry *child; trie_child_entry 107 src/udev/udevadm-hwdb.c struct trie_child_entry search; trie_child_entry 110 src/udev/udevadm-hwdb.c child = bsearch(&search, node->children, node->children_count, sizeof(struct trie_child_entry), trie_children_cmp); trie_child_entry 641 src/udev/udevadm-hwdb.c trie->children_count * sizeof(struct trie_child_entry), trie->children_count);