node 177 src/core/cgroup.c static int whitelist_device(const char *path, const char *node, const char *acc) { node 185 src/core/cgroup.c if (stat(node, &st) < 0) { node 186 src/core/cgroup.c log_warning("Couldn't stat device %s", node); node 191 src/core/cgroup.c log_warning("%s is not a device.", node); node 282 src/core/umount.c char *node; node 294 src/core/umount.c node = strdup(dn); node 295 src/core/umount.c if (!node) node 300 src/core/umount.c free(node); node 304 src/core/umount.c m->path = node; node 382 src/gpt-auto-generator/gpt-auto-generator.c const char *node, *pttype, *devtype; node 417 src/gpt-auto-generator/gpt-auto-generator.c node = udev_device_get_devnode(parent); node 418 src/gpt-auto-generator/gpt-auto-generator.c if (!node) { node 423 src/gpt-auto-generator/gpt-auto-generator.c log_debug("Root device %s.", node); node 430 src/gpt-auto-generator/gpt-auto-generator.c b = blkid_new_probe_from_filename(node); node 449 src/gpt-auto-generator/gpt-auto-generator.c log_error("Failed to probe %s: %m", node); node 458 src/gpt-auto-generator/gpt-auto-generator.c log_error("Failed to determine partition table type of %s: %m", node); node 474 src/gpt-auto-generator/gpt-auto-generator.c log_error("Failed to list partitions of %s: %m", node); node 492 src/gpt-auto-generator/gpt-auto-generator.c log_error("Failed to enumerate partitions on %s: %s", node, strerror(-r)); node 581 src/gpt-auto-generator/gpt-auto-generator.c srv = strdup(node); node 69 src/libsystemd/sd-bus/bus-internal.h struct node *parent; node 70 src/libsystemd/sd-bus/bus-internal.h LIST_HEAD(struct node, child); node 71 src/libsystemd/sd-bus/bus-internal.h LIST_FIELDS(struct node, siblings); node 80 src/libsystemd/sd-bus/bus-internal.h struct node *node; node 91 src/libsystemd/sd-bus/bus-internal.h struct node *node; node 101 src/libsystemd/sd-bus/bus-internal.h struct node *node; node 107 src/libsystemd/sd-bus/bus-internal.h struct node *node; node 59 src/libsystemd/sd-bus/bus-introspect.c char *node; node 64 src/libsystemd/sd-bus/bus-introspect.c while ((node = set_steal_first(s))) { node 67 src/libsystemd/sd-bus/bus-introspect.c e = object_path_startswith(node, prefix); node 71 src/libsystemd/sd-bus/bus-introspect.c free(node); node 74 src/libsystemd/sd-bus/bus-match.c static void bus_match_node_free(struct bus_match_node *node) { node 75 src/libsystemd/sd-bus/bus-match.c assert(node); node 76 src/libsystemd/sd-bus/bus-match.c assert(node->parent); node 77 src/libsystemd/sd-bus/bus-match.c assert(!node->child); node 78 src/libsystemd/sd-bus/bus-match.c assert(node->type != BUS_MATCH_ROOT); node 79 src/libsystemd/sd-bus/bus-match.c assert(node->type < _BUS_MATCH_NODE_TYPE_MAX); node 81 src/libsystemd/sd-bus/bus-match.c if (node->parent->child) { node 84 src/libsystemd/sd-bus/bus-match.c if (node->prev) { node 85 src/libsystemd/sd-bus/bus-match.c assert(node->prev->next == node); node 86 src/libsystemd/sd-bus/bus-match.c node->prev->next = node->next; node 88 src/libsystemd/sd-bus/bus-match.c assert(node->parent->child == node); node 89 src/libsystemd/sd-bus/bus-match.c node->parent->child = node->next; node 92 src/libsystemd/sd-bus/bus-match.c if (node->next) node 93 src/libsystemd/sd-bus/bus-match.c node->next->prev = node->prev; node 96 src/libsystemd/sd-bus/bus-match.c if (node->type == BUS_MATCH_VALUE) { node 100 src/libsystemd/sd-bus/bus-match.c if (node->parent->type == BUS_MATCH_MESSAGE_TYPE) node 101 src/libsystemd/sd-bus/bus-match.c hashmap_remove(node->parent->compare.children, UINT_TO_PTR(node->value.u8)); node 102 src/libsystemd/sd-bus/bus-match.c else if (BUS_MATCH_CAN_HASH(node->parent->type) && node->value.str) node 103 src/libsystemd/sd-bus/bus-match.c hashmap_remove(node->parent->compare.children, node->value.str); node 105 src/libsystemd/sd-bus/bus-match.c free(node->value.str); node 108 src/libsystemd/sd-bus/bus-match.c if (BUS_MATCH_IS_COMPARE(node->type)) { node 109 src/libsystemd/sd-bus/bus-match.c assert(hashmap_isempty(node->compare.children)); node 110 src/libsystemd/sd-bus/bus-match.c hashmap_free(node->compare.children); node 113 src/libsystemd/sd-bus/bus-match.c free(node); node 116 src/libsystemd/sd-bus/bus-match.c static bool bus_match_node_maybe_free(struct bus_match_node *node) { node 117 src/libsystemd/sd-bus/bus-match.c assert(node); node 119 src/libsystemd/sd-bus/bus-match.c if (node->type == BUS_MATCH_ROOT) node 122 src/libsystemd/sd-bus/bus-match.c if (node->child) node 125 src/libsystemd/sd-bus/bus-match.c if (BUS_MATCH_IS_COMPARE(node->type) && !hashmap_isempty(node->compare.children)) node 128 src/libsystemd/sd-bus/bus-match.c bus_match_node_free(node); node 133 src/libsystemd/sd-bus/bus-match.c struct bus_match_node *node, node 139 src/libsystemd/sd-bus/bus-match.c assert(node); node 140 src/libsystemd/sd-bus/bus-match.c assert(node->type == BUS_MATCH_VALUE); node 148 src/libsystemd/sd-bus/bus-match.c return node->value.u8 == value_u8; node 151 src/libsystemd/sd-bus/bus-match.c if (streq_ptr(node->value.str, value_str)) node 162 src/libsystemd/sd-bus/bus-match.c if (streq_ptr(node->value.str, *i)) node 172 src/libsystemd/sd-bus/bus-match.c if (node->value.str[0] != ':' && value_str && value_str[0] == ':') node 183 src/libsystemd/sd-bus/bus-match.c return streq_ptr(node->value.str, value_str); node 186 src/libsystemd/sd-bus/bus-match.c return namespace_simple_pattern(node->value.str, value_str); node 189 src/libsystemd/sd-bus/bus-match.c return path_simple_pattern(node->value.str, value_str); node 192 src/libsystemd/sd-bus/bus-match.c return path_complex_pattern(node->value.str, value_str); node 200 src/libsystemd/sd-bus/bus-match.c struct bus_match_node *node, node 209 src/libsystemd/sd-bus/bus-match.c assert(node); node 210 src/libsystemd/sd-bus/bus-match.c assert(node->type == BUS_MATCH_VALUE); node 215 src/libsystemd/sd-bus/bus-match.c return node->value.u8 == value_u8; node 226 src/libsystemd/sd-bus/bus-match.c return streq(node->value.str, value_str); node 235 src/libsystemd/sd-bus/bus-match.c struct bus_match_node *node, node 245 src/libsystemd/sd-bus/bus-match.c if (!node) node 258 src/libsystemd/sd-bus/bus-match.c switch (node->type) { node 266 src/libsystemd/sd-bus/bus-match.c return bus_match_run(bus, node->child, m); node 275 src/libsystemd/sd-bus/bus-match.c assert(node->child); node 276 src/libsystemd/sd-bus/bus-match.c return bus_match_run(bus, node->child, m); node 281 src/libsystemd/sd-bus/bus-match.c if (node->leaf.callback->last_iteration == bus->iteration_counter) node 284 src/libsystemd/sd-bus/bus-match.c node->leaf.callback->last_iteration = bus->iteration_counter; node 292 src/libsystemd/sd-bus/bus-match.c if (node->leaf.callback->callback) { node 296 src/libsystemd/sd-bus/bus-match.c slot = container_of(node->leaf.callback, sd_bus_slot, match_callback); node 299 src/libsystemd/sd-bus/bus-match.c bus->current_handler = node->leaf.callback->callback; node 302 src/libsystemd/sd-bus/bus-match.c r = node->leaf.callback->callback(bus, m, slot->userdata, &error_buffer); node 317 src/libsystemd/sd-bus/bus-match.c return bus_match_run(bus, node->next, m); node 346 src/libsystemd/sd-bus/bus-match.c test_str = bus_message_get_arg(m, node->type - BUS_MATCH_ARG); node 350 src/libsystemd/sd-bus/bus-match.c test_str = bus_message_get_arg(m, node->type - BUS_MATCH_ARG_PATH); node 354 src/libsystemd/sd-bus/bus-match.c test_str = bus_message_get_arg(m, node->type - BUS_MATCH_ARG_NAMESPACE); node 361 src/libsystemd/sd-bus/bus-match.c if (BUS_MATCH_CAN_HASH(node->type)) { node 367 src/libsystemd/sd-bus/bus-match.c found = hashmap_get(node->compare.children, test_str); node 368 src/libsystemd/sd-bus/bus-match.c else if (node->type == BUS_MATCH_MESSAGE_TYPE) node 369 src/libsystemd/sd-bus/bus-match.c found = hashmap_get(node->compare.children, UINT_TO_PTR(test_u8)); node 383 src/libsystemd/sd-bus/bus-match.c for (c = node->child; c; c = c->next) { node 384 src/libsystemd/sd-bus/bus-match.c if (!value_node_test(c, node->type, test_u8, test_str, m)) node 397 src/libsystemd/sd-bus/bus-match.c return bus_match_run(bus, node->next, m); node 936 src/libsystemd/sd-bus/bus-match.c struct bus_match_node *node, *pp; node 941 src/libsystemd/sd-bus/bus-match.c node = callback->match_node; node 942 src/libsystemd/sd-bus/bus-match.c if (!node) node 945 src/libsystemd/sd-bus/bus-match.c assert(node->type == BUS_MATCH_LEAF); node 950 src/libsystemd/sd-bus/bus-match.c pp = node->parent; node 951 src/libsystemd/sd-bus/bus-match.c bus_match_node_free(node); node 955 src/libsystemd/sd-bus/bus-match.c node = pp; node 956 src/libsystemd/sd-bus/bus-match.c pp = node->parent; node 958 src/libsystemd/sd-bus/bus-match.c if (!bus_match_node_maybe_free(node)) node 1002 src/libsystemd/sd-bus/bus-match.c void bus_match_free(struct bus_match_node *node) { node 1005 src/libsystemd/sd-bus/bus-match.c if (!node) node 1008 src/libsystemd/sd-bus/bus-match.c if (BUS_MATCH_CAN_HASH(node->type)) { node 1011 src/libsystemd/sd-bus/bus-match.c HASHMAP_FOREACH(c, node->compare.children, i) node 1014 src/libsystemd/sd-bus/bus-match.c assert(hashmap_isempty(node->compare.children)); node 1017 src/libsystemd/sd-bus/bus-match.c while ((c = node->child)) node 1020 src/libsystemd/sd-bus/bus-match.c if (node->type != BUS_MATCH_ROOT) node 1021 src/libsystemd/sd-bus/bus-match.c bus_match_node_free(node); node 1074 src/libsystemd/sd-bus/bus-match.c void bus_match_dump(struct bus_match_node *node, unsigned level) { node 1079 src/libsystemd/sd-bus/bus-match.c if (!node) node 1083 src/libsystemd/sd-bus/bus-match.c printf("%s[%s]", strempty(pfx), bus_match_node_type_to_string(node->type, buf, sizeof(buf))); node 1085 src/libsystemd/sd-bus/bus-match.c if (node->type == BUS_MATCH_VALUE) { node 1086 src/libsystemd/sd-bus/bus-match.c if (node->parent->type == BUS_MATCH_MESSAGE_TYPE) node 1087 src/libsystemd/sd-bus/bus-match.c printf(" <%u>\n", node->value.u8); node 1089 src/libsystemd/sd-bus/bus-match.c printf(" <%s>\n", node->value.str); node 1090 src/libsystemd/sd-bus/bus-match.c } else if (node->type == BUS_MATCH_ROOT) node 1092 src/libsystemd/sd-bus/bus-match.c else if (node->type == BUS_MATCH_LEAF) node 1093 src/libsystemd/sd-bus/bus-match.c printf(" %p/%p\n", node->leaf.callback->callback, container_of(node->leaf.callback, sd_bus_slot, match_callback)->userdata); node 1097 src/libsystemd/sd-bus/bus-match.c if (BUS_MATCH_CAN_HASH(node->type)) { node 1100 src/libsystemd/sd-bus/bus-match.c HASHMAP_FOREACH(c, node->compare.children, i) node 1104 src/libsystemd/sd-bus/bus-match.c for (c = node->child; c; c = c->next) node 83 src/libsystemd/sd-bus/bus-match.h void bus_match_free(struct bus_match_node *node); node 85 src/libsystemd/sd-bus/bus-match.h void bus_match_dump(struct bus_match_node *node, unsigned level); node 171 src/libsystemd/sd-bus/bus-objects.c struct node *n, node 175 src/libsystemd/sd-bus/bus-objects.c struct node *i; node 216 src/libsystemd/sd-bus/bus-objects.c struct node *n, node 835 src/libsystemd/sd-bus/bus-objects.c struct node *n, node 879 src/libsystemd/sd-bus/bus-objects.c struct node *n, node 996 src/libsystemd/sd-bus/bus-objects.c struct node *n; node 1140 src/libsystemd/sd-bus/bus-objects.c struct node *n, node 1204 src/libsystemd/sd-bus/bus-objects.c struct node *n; node 1388 src/libsystemd/sd-bus/bus-objects.c static struct node *bus_node_allocate(sd_bus *bus, const char *path) { node 1389 src/libsystemd/sd-bus/bus-objects.c struct node *n, *parent; node 1424 src/libsystemd/sd-bus/bus-objects.c n = new0(struct node, 1); node 1445 src/libsystemd/sd-bus/bus-objects.c void bus_node_gc(sd_bus *b, struct node *n) { node 1477 src/libsystemd/sd-bus/bus-objects.c struct node *n; node 1498 src/libsystemd/sd-bus/bus-objects.c s->node_callback.node = n; node 1591 src/libsystemd/sd-bus/bus-objects.c struct node *n; node 1748 src/libsystemd/sd-bus/bus-objects.c s->node_vtable.node = n; node 1795 src/libsystemd/sd-bus/bus-objects.c struct node *n; node 1815 src/libsystemd/sd-bus/bus-objects.c s->node_enumerator.node = n; node 1845 src/libsystemd/sd-bus/bus-objects.c struct node *n; node 2122 src/libsystemd/sd-bus/bus-objects.c struct node *n; node 2336 src/libsystemd/sd-bus/bus-objects.c struct node *n; node 2353 src/libsystemd/sd-bus/bus-objects.c s->node_object_manager.node = n; node 104 src/libsystemd/sd-bus/bus-slot.c if (slot->node_callback.node) { node 105 src/libsystemd/sd-bus/bus-slot.c LIST_REMOVE(callbacks, slot->node_callback.node->callbacks, &slot->node_callback); node 108 src/libsystemd/sd-bus/bus-slot.c bus_node_gc(slot->bus, slot->node_callback.node); node 115 src/libsystemd/sd-bus/bus-slot.c if (slot->node_enumerator.node) { node 116 src/libsystemd/sd-bus/bus-slot.c LIST_REMOVE(enumerators, slot->node_enumerator.node->enumerators, &slot->node_enumerator); node 119 src/libsystemd/sd-bus/bus-slot.c bus_node_gc(slot->bus, slot->node_enumerator.node); node 126 src/libsystemd/sd-bus/bus-slot.c if (slot->node_object_manager.node) { node 127 src/libsystemd/sd-bus/bus-slot.c LIST_REMOVE(object_managers, slot->node_object_manager.node->object_managers, &slot->node_object_manager); node 130 src/libsystemd/sd-bus/bus-slot.c bus_node_gc(slot->bus, slot->node_object_manager.node); node 137 src/libsystemd/sd-bus/bus-slot.c if (slot->node_vtable.node && slot->node_vtable.interface && slot->node_vtable.vtable) { node 148 src/libsystemd/sd-bus/bus-slot.c key.path = slot->node_vtable.node->path; node 160 src/libsystemd/sd-bus/bus-slot.c key.path = slot->node_vtable.node->path; node 175 src/libsystemd/sd-bus/bus-slot.c if (slot->node_vtable.node) { node 176 src/libsystemd/sd-bus/bus-slot.c LIST_REMOVE(vtables, slot->node_vtable.node->vtables, &slot->node_vtable); node 179 src/libsystemd/sd-bus/bus-slot.c bus_node_gc(slot->bus, slot->node_vtable.node); node 405 src/libsystemd/sd-resolve/sd-resolve.c const char *node, *service; node 416 src/libsystemd/sd-resolve/sd-resolve.c node = ai_req->node_len ? (const char*) ai_req + sizeof(AddrInfoRequest) : NULL; node 420 src/libsystemd/sd-resolve/sd-resolve.c node, service, node 1055 src/libsystemd/sd-resolve/sd-resolve.c const char *node, const char *service, node 1066 src/libsystemd/sd-resolve/sd-resolve.c assert_return(node || service, -EINVAL); node 1078 src/libsystemd/sd-resolve/sd-resolve.c req.node_len = node ? strlen(node)+1 : 0; node 1094 src/libsystemd/sd-resolve/sd-resolve.c if (node) node 1095 src/libsystemd/sd-resolve/sd-resolve.c iov[mh.msg_iovlen++] = (struct iovec) { .iov_base = (void*) node, .iov_len = req.node_len }; node 103 src/libudev/libudev-hwdb.c static const struct trie_child_entry_f *trie_node_children(struct udev_hwdb *hwdb, const struct trie_node_f *node) { node 104 src/libudev/libudev-hwdb.c return (const struct trie_child_entry_f *)((const char *)node + le64toh(hwdb->head->node_size)); node 107 src/libudev/libudev-hwdb.c static const struct trie_value_entry_f *trie_node_values(struct udev_hwdb *hwdb, const struct trie_node_f *node) { node 108 src/libudev/libudev-hwdb.c const char *base = (const char *)node; node 111 src/libudev/libudev-hwdb.c base += node->children_count * le64toh(hwdb->head->child_entry_size); node 130 src/libudev/libudev-hwdb.c static const struct trie_node_f *node_lookup_f(struct udev_hwdb *hwdb, const struct trie_node_f *node, uint8_t c) { node 135 src/libudev/libudev-hwdb.c child = bsearch(&search, trie_node_children(hwdb, node), node->children_count, node 155 src/libudev/libudev-hwdb.c static int trie_fnmatch_f(struct udev_hwdb *hwdb, const struct trie_node_f *node, size_t p, node 162 src/libudev/libudev-hwdb.c prefix = trie_string(hwdb, node->prefix_off); node 166 src/libudev/libudev-hwdb.c for (i = 0; i < node->children_count; i++) { node 167 src/libudev/libudev-hwdb.c const struct trie_child_entry_f *child = &trie_node_children(hwdb, node)[i]; node 176 src/libudev/libudev-hwdb.c if (le64toh(node->values_count) && fnmatch(linebuf_get(buf), search, 0) == 0) node 177 src/libudev/libudev-hwdb.c for (i = 0; i < le64toh(node->values_count); i++) { node 178 src/libudev/libudev-hwdb.c err = hwdb_add_property(hwdb, trie_string(hwdb, trie_node_values(hwdb, node)[i].key_off), node 179 src/libudev/libudev-hwdb.c trie_string(hwdb, trie_node_values(hwdb, node)[i].value_off)); node 190 src/libudev/libudev-hwdb.c const struct trie_node_f *node; node 196 src/libudev/libudev-hwdb.c node = trie_node_from_off(hwdb, hwdb->head->nodes_root_off); node 197 src/libudev/libudev-hwdb.c while (node) { node 201 src/libudev/libudev-hwdb.c if (node->prefix_off) { node 204 src/libudev/libudev-hwdb.c for (; (c = trie_string(hwdb, node->prefix_off)[p]); p++) { node 206 src/libudev/libudev-hwdb.c return trie_fnmatch_f(hwdb, node, p, &buf, search + i + p); node 213 src/libudev/libudev-hwdb.c child = node_lookup_f(hwdb, node, '*'); node 222 src/libudev/libudev-hwdb.c child = node_lookup_f(hwdb, node, '?'); node 231 src/libudev/libudev-hwdb.c child = node_lookup_f(hwdb, node, '['); node 243 src/libudev/libudev-hwdb.c for (n = 0; n < le64toh(node->values_count); n++) { node 244 src/libudev/libudev-hwdb.c err = hwdb_add_property(hwdb, trie_string(hwdb, trie_node_values(hwdb, node)[n].key_off), node 245 src/libudev/libudev-hwdb.c trie_string(hwdb, trie_node_values(hwdb, node)[n].value_off)); node 252 src/libudev/libudev-hwdb.c child = node_lookup_f(hwdb, node, search[i]); node 253 src/libudev/libudev-hwdb.c node = child; node 44 src/libudev/libudev-list.c struct udev_list_node node; node 91 src/libudev/libudev-list.c static inline struct udev_list_entry *list_node_to_entry(struct udev_list_node *node) node 93 src/libudev/libudev-list.c return container_of(node, struct udev_list_entry, node); node 101 src/libudev/libudev-list.c udev_list_node_init(&list->node); node 108 src/libudev/libudev-list.c udev_list_node_insert_between(&new->node, list->node.prev, &list->node); node 115 src/libudev/libudev-list.c udev_list_node_insert_between(&new->node, entry->node.prev, &entry->node); node 241 src/libudev/libudev-list.c udev_list_node_remove(&entry->node); node 262 src/libudev/libudev-list.c if (udev_list_node_is_empty(&list->node)) node 264 src/libudev/libudev-list.c return list_node_to_entry(list->node.next); node 281 src/libudev/libudev-list.c next = list_entry->node.next; node 283 src/libudev/libudev-list.c if (next == &list_entry->list->node) node 108 src/libudev/libudev-private.h struct udev_list_node node; node 119 src/libudev/libudev-private.h #define udev_list_node_foreach(node, list) \ node 120 src/libudev/libudev-private.h for (node = (list)->next; \ node 121 src/libudev/libudev-private.h node != list; \ node 122 src/libudev/libudev-private.h node = (node)->next) node 123 src/libudev/libudev-private.h #define udev_list_node_foreach_safe(node, tmp, list) \ node 124 src/libudev/libudev-private.h for (node = (list)->next, tmp = (node)->next; \ node 125 src/libudev/libudev-private.h node != list; \ node 126 src/libudev/libudev-private.h node = tmp, tmp = (tmp)->next) node 224 src/login/logind-acl.c const char *node, *sn; node 237 src/login/logind-acl.c node = udev_device_get_devnode(d); node 239 src/login/logind-acl.c if (!node) node 242 src/login/logind-acl.c n = strdup(node); node 152 src/login/logind-session-device.c fd = open(sd->node, O_RDWR|O_CLOEXEC|O_NOCTTY|O_NONBLOCK); node 276 src/login/logind-session-device.c const char *sp, *node; node 284 src/login/logind-session-device.c node = udev_device_get_devnode(dev); node 285 src/login/logind-session-device.c if (!node) { node 335 src/login/logind-session-device.c sd->node = strdup(node); node 336 src/login/logind-session-device.c if (!sd->node) { node 400 src/login/logind-session-device.c free(sd->node); node 416 src/login/logind-session-device.c free(sd->node); node 45 src/login/logind-session-device.h char *node; node 2369 src/nspawn/nspawn.c const char *stype, *node; node 2393 src/nspawn/nspawn.c node = udev_device_get_devnode(q); node 2394 src/nspawn/nspawn.c if (!node) node 2425 src/nspawn/nspawn.c home = strdup(node); node 2437 src/nspawn/nspawn.c srv = strdup(node); node 2451 src/nspawn/nspawn.c root = strdup(node); node 2467 src/nspawn/nspawn.c secondary_root = strdup(node); node 100 src/shared/generator.c _cleanup_free_ char *node = NULL, *unit = NULL, *timeout = NULL; node 116 src/shared/generator.c node = fstab_node_to_udev_node(what); node 117 src/shared/generator.c if (!node) node 120 src/shared/generator.c unit = unit_name_from_path(node, ".device"); node 70 src/shared/strbuf.c static void strbuf_node_cleanup(struct strbuf_node *node) { node 73 src/shared/strbuf.c for (i = 0; i < node->children_count; i++) node 74 src/shared/strbuf.c strbuf_node_cleanup(node->children[i].child); node 75 src/shared/strbuf.c free(node->children); node 76 src/shared/strbuf.c free(node); node 103 src/shared/strbuf.c static void bubbleinsert(struct strbuf_node *node, node 111 src/shared/strbuf.c int left = 0, right = node->children_count; node 115 src/shared/strbuf.c if (strbuf_children_cmp(&node->children[middle], &new) <= 0) node 121 src/shared/strbuf.c memmove(node->children + left + 1, node->children + left, node 122 src/shared/strbuf.c sizeof(struct strbuf_child_entry) * (node->children_count - left)); node 123 src/shared/strbuf.c node->children[left] = new; node 125 src/shared/strbuf.c node->children_count ++; node 131 src/shared/strbuf.c struct strbuf_node *node; node 147 src/shared/strbuf.c node = str->root; node 153 src/shared/strbuf.c off = node->value_off + node->value_len - len; node 154 src/shared/strbuf.c if (depth == len || (node->value_len >= len && memcmp(str->buf + off, s, len) == 0)) { node 163 src/shared/strbuf.c child = bsearch(&search, node->children, node->children_count, node 168 src/shared/strbuf.c node = child->child; node 189 src/shared/strbuf.c child = realloc(node->children, (node->children_count + 1) * sizeof(struct strbuf_child_entry)); node 197 src/shared/strbuf.c node->children = child; node 198 src/shared/strbuf.c bubbleinsert(node, c, node_child); node 415 src/socket-proxy/socket-proxyd.c const char *node, *service; node 442 src/socket-proxy/socket-proxyd.c node = strndupa(arg_remote_host, service - arg_remote_host); node 445 src/socket-proxy/socket-proxyd.c node = arg_remote_host; node 449 src/socket-proxy/socket-proxyd.c log_debug("Looking up address info for %s:%s", node, service); node 450 src/socket-proxy/socket-proxyd.c r = sd_resolve_getaddrinfo(c->context->resolve, &c->resolve_query, node, service, &hints, resolve_cb, c); node 92 src/systemd/sd-resolve.h int sd_resolve_getaddrinfo(sd_resolve *resolve, sd_resolve_query **q, const char *node, const char *service, const struct addrinfo *hints, sd_resolve_getaddrinfo_handler_t callback, void *userdata); node 281 src/udev/accelerometer/accelerometer.c const char *node; node 293 src/udev/accelerometer/accelerometer.c node = udev_device_get_devnode(device); node 294 src/udev/accelerometer/accelerometer.c if (node == NULL) { node 299 src/udev/accelerometer/accelerometer.c if (strstr(node, "/event") == NULL) { node 304 src/udev/accelerometer/accelerometer.c devnode = strdup(node); node 426 src/udev/ata_id/ata_id.c const char *node = NULL; node 466 src/udev/ata_id/ata_id.c node = argv[optind]; node 467 src/udev/ata_id/ata_id.c if (node == NULL) { node 473 src/udev/ata_id/ata_id.c fd = open(node, O_RDONLY|O_NONBLOCK|O_CLOEXEC); node 475 src/udev/ata_id/ata_id.c log_error("unable to open '%s'", node); node 507 src/udev/ata_id/ata_id.c log_debug("HDIO_GET_IDENTITY failed for '%s': %m", node); node 866 src/udev/cdrom_id/cdrom_id.c const char *node = NULL; node 917 src/udev/cdrom_id/cdrom_id.c node = argv[optind]; node 918 src/udev/cdrom_id/cdrom_id.c if (!node) { node 929 src/udev/cdrom_id/cdrom_id.c fd = open(node, O_RDONLY|O_NONBLOCK|O_CLOEXEC|(is_mounted(node) ? 0 : O_EXCL)); node 937 src/udev/cdrom_id/cdrom_id.c log_debug("unable to open '%s'", node); node 938 src/udev/cdrom_id/cdrom_id.c fprintf(stderr, "unable to open '%s'\n", node); node 942 src/udev/cdrom_id/cdrom_id.c log_debug("probing: '%s'", node); node 48 src/udev/collect/collect.c struct udev_list_node node; node 59 src/udev/collect/collect.c static inline struct _mate *node_to_mate(struct udev_list_node *node) node 61 src/udev/collect/collect.c return container_of(node, struct _mate, node); node 181 src/udev/collect/collect.c udev_list_node_append(&him->node, &bunch); node 268 src/udev/collect/collect.c udev_list_node_remove(&him->node); node 459 src/udev/collect/collect.c udev_list_node_append(&him->node, &bunch); node 131 src/udev/udev-builtin-keyboard.c const char *node; node 135 src/udev/udev-builtin-keyboard.c node = udev_device_get_devnode(dev); node 136 src/udev/udev-builtin-keyboard.c if (!node) { node 143 src/udev/udev-builtin-keyboard.c log_error("Error, opening device '%s': %m", node); node 152 src/udev/udev-builtin-keyboard.c log_error("Error calling EVIOCSKEYCODE on device node '%s' (scan code 0x%x, key code %d): %m", node, map[i].scan, map[i].key); node 35 src/udev/udev-node.c static int node_symlink(struct udev_device *dev, const char *node, const char *slink) { node 47 src/udev/udev-node.c while (node[i] && (node[i] == slink[i])) { node 48 src/udev/udev-node.c if (node[i] == '/') node 59 src/udev/udev-node.c l = strscpy(s, l, &node[tail]); node 68 src/udev/udev-node.c log_error("conflicting device node '%s' found, link to '%s' will not be created", slink, node); node 66 src/udev/udev.h struct udev_list_node node; node 86 src/udev/udevadm-hwdb.c static int node_add_child(struct trie *trie, struct trie_node *node, struct trie_node *node_child, uint8_t c) { node 90 src/udev/udevadm-hwdb.c child = realloc(node->children, (node->children_count + 1) * sizeof(struct trie_child_entry)); node 94 src/udev/udevadm-hwdb.c node->children = child; node 96 src/udev/udevadm-hwdb.c node->children[node->children_count].c = c; node 97 src/udev/udevadm-hwdb.c node->children[node->children_count].child = node_child; node 98 src/udev/udevadm-hwdb.c node->children_count++; node 99 src/udev/udevadm-hwdb.c qsort(node->children, node->children_count, sizeof(struct trie_child_entry), trie_children_cmp); node 105 src/udev/udevadm-hwdb.c static struct trie_node *node_lookup(const struct trie_node *node, uint8_t c) { node 110 src/udev/udevadm-hwdb.c child = bsearch(&search, node->children, node->children_count, sizeof(struct trie_child_entry), trie_children_cmp); node 116 src/udev/udevadm-hwdb.c static void trie_node_cleanup(struct trie_node *node) { node 119 src/udev/udevadm-hwdb.c for (i = 0; i < node->children_count; i++) node 120 src/udev/udevadm-hwdb.c trie_node_cleanup(node->children[i].child); node 121 src/udev/udevadm-hwdb.c free(node->children); node 122 src/udev/udevadm-hwdb.c free(node->values); node 123 src/udev/udevadm-hwdb.c free(node); node 135 src/udev/udevadm-hwdb.c static int trie_node_add_value(struct trie *trie, struct trie_node *node, node 147 src/udev/udevadm-hwdb.c if (node->values_count) { node 153 src/udev/udevadm-hwdb.c val = xbsearch_r(&search, node->values, node->values_count, sizeof(struct trie_value_entry), trie_values_cmp, trie); node 162 src/udev/udevadm-hwdb.c val = realloc(node->values, (node->values_count + 1) * sizeof(struct trie_value_entry)); node 166 src/udev/udevadm-hwdb.c node->values = val; node 167 src/udev/udevadm-hwdb.c node->values[node->values_count].key_off = k; node 168 src/udev/udevadm-hwdb.c node->values[node->values_count].value_off = v; node 169 src/udev/udevadm-hwdb.c node->values_count++; node 170 src/udev/udevadm-hwdb.c qsort_r(node->values, node->values_count, sizeof(struct trie_value_entry), trie_values_cmp, trie); node 174 src/udev/udevadm-hwdb.c static int trie_insert(struct trie *trie, struct trie_node *node, const char *search, node 184 src/udev/udevadm-hwdb.c for (p = 0; (c = trie->strings->buf[node->prefix_off + p]); p++) { node 198 src/udev/udevadm-hwdb.c new_child->prefix_off = node->prefix_off + p+1; node 199 src/udev/udevadm-hwdb.c new_child->children = node->children; node 200 src/udev/udevadm-hwdb.c new_child->children_count = node->children_count; node 201 src/udev/udevadm-hwdb.c new_child->values = node->values; node 202 src/udev/udevadm-hwdb.c new_child->values_count = node->values_count; node 205 src/udev/udevadm-hwdb.c s = strndup(trie->strings->buf + node->prefix_off, p); node 213 src/udev/udevadm-hwdb.c node->prefix_off = off; node 214 src/udev/udevadm-hwdb.c node->children = NULL; node 215 src/udev/udevadm-hwdb.c node->children_count = 0; node 216 src/udev/udevadm-hwdb.c node->values = NULL; node 217 src/udev/udevadm-hwdb.c node->values_count = 0; node 218 src/udev/udevadm-hwdb.c err = node_add_child(trie, node, new_child, c); node 229 src/udev/udevadm-hwdb.c return trie_node_add_value(trie, node, key, value); node 231 src/udev/udevadm-hwdb.c child = node_lookup(node, c); node 247 src/udev/udevadm-hwdb.c err = node_add_child(trie, node, child, c); node 256 src/udev/udevadm-hwdb.c node = child; node 272 src/udev/udevadm-hwdb.c static void trie_store_nodes_size(struct trie_f *trie, struct trie_node *node) { node 275 src/udev/udevadm-hwdb.c for (i = 0; i < node->children_count; i++) node 276 src/udev/udevadm-hwdb.c trie_store_nodes_size(trie, node->children[i].child); node 279 src/udev/udevadm-hwdb.c for (i = 0; i < node->children_count; i++) node 281 src/udev/udevadm-hwdb.c for (i = 0; i < node->values_count; i++) node 285 src/udev/udevadm-hwdb.c static int64_t trie_store_nodes(struct trie_f *trie, struct trie_node *node) { node 288 src/udev/udevadm-hwdb.c .prefix_off = htole64(trie->strings_off + node->prefix_off), node 289 src/udev/udevadm-hwdb.c .children_count = node->children_count, node 290 src/udev/udevadm-hwdb.c .values_count = htole64(node->values_count), node 295 src/udev/udevadm-hwdb.c if (node->children_count) { node 296 src/udev/udevadm-hwdb.c children = new0(struct trie_child_entry_f, node->children_count); node 302 src/udev/udevadm-hwdb.c for (i = 0; i < node->children_count; i++) { node 305 src/udev/udevadm-hwdb.c child_off = trie_store_nodes(trie, node->children[i].child); node 310 src/udev/udevadm-hwdb.c children[i].c = node->children[i].c; node 320 src/udev/udevadm-hwdb.c if (node->children_count) { node 321 src/udev/udevadm-hwdb.c fwrite(children, sizeof(struct trie_child_entry_f), node->children_count, trie->f); node 322 src/udev/udevadm-hwdb.c trie->children_count += node->children_count; node 327 src/udev/udevadm-hwdb.c for (i = 0; i < node->values_count; i++) { node 329 src/udev/udevadm-hwdb.c .key_off = htole64(trie->strings_off + node->values[i].key_off), node 330 src/udev/udevadm-hwdb.c .value_off = htole64(trie->strings_off + node->values[i].value_off), node 441 src/udev/udevadm-info.c const char *node = udev_device_get_devnode(device); node 443 src/udev/udevadm-info.c if (node == NULL) { node 93 src/udev/udevd.c struct udev_list_node node; node 108 src/udev/udevd.c static inline struct event *node_to_event(struct udev_list_node *node) { node 109 src/udev/udevd.c return container_of(node, struct event, node); node 122 src/udev/udevd.c struct udev_list_node node; node 139 src/udev/udevd.c static inline struct worker *node_to_worker(struct udev_list_node *node) { node 140 src/udev/udevd.c return container_of(node, struct worker, node); node 144 src/udev/udevd.c udev_list_node_remove(&event->node); node 155 src/udev/udevd.c udev_list_node_remove(&worker->node); node 412 src/udev/udevd.c udev_list_node_append(&worker->node, &worker_list); node 476 src/udev/udevd.c udev_list_node_append(&event->node, &event_list);