Home
last modified time | relevance | path

Searched refs:child_node (Results 1 – 5 of 5) sorted by relevance

/drivers/acpi/acpica/
Dnsalloc.c218 struct acpi_namespace_node *child_node; in acpi_ns_install_node() local
246 child_node = parent_node->child; in acpi_ns_install_node()
248 if (!child_node) { in acpi_ns_install_node()
253 while (child_node->peer) { in acpi_ns_install_node()
254 child_node = child_node->peer; in acpi_ns_install_node()
257 child_node->peer = node; in acpi_ns_install_node()
342 struct acpi_namespace_node *child_node = NULL; in acpi_ns_delete_namespace_subtree() local
367 child_node = acpi_ns_get_next_node(parent_node, child_node); in acpi_ns_delete_namespace_subtree()
368 if (child_node) { in acpi_ns_delete_namespace_subtree()
372 acpi_ns_detach_object(child_node); in acpi_ns_delete_namespace_subtree()
[all …]
Dnswalk.c71 *child_node) in acpi_ns_get_next_node()
75 if (!child_node) { in acpi_ns_get_next_node()
84 return (child_node->peer); in acpi_ns_get_next_node()
112 *child_node) in acpi_ns_get_next_node_typed()
118 next_node = acpi_ns_get_next_node(parent_node, child_node); in acpi_ns_get_next_node_typed()
194 struct acpi_namespace_node *child_node; in acpi_ns_walk_namespace() local
211 child_node = acpi_ns_get_next_node(parent_node, NULL); in acpi_ns_walk_namespace()
220 while (level > 0 && child_node) { in acpi_ns_walk_namespace()
226 child_type = child_node->type; in acpi_ns_walk_namespace()
237 if ((child_node->flags & ANOBJ_TEMPORARY) && in acpi_ns_walk_namespace()
[all …]
Dnsxfobj.c236 struct acpi_namespace_node *child_node = NULL; in ACPI_EXPORT_SYMBOL() local
264 child_node = acpi_ns_validate_handle(child); in ACPI_EXPORT_SYMBOL()
265 if (!child_node) { in ACPI_EXPORT_SYMBOL()
273 node = acpi_ns_get_next_node_typed(type, parent_node, child_node); in ACPI_EXPORT_SYMBOL()
/drivers/clk/
Dclk.c124 hlist_for_each_entry(child, &c->children, child_node) in clk_summary_show_subtree()
137 hlist_for_each_entry(c, &clk_root_list, child_node) in clk_summary_show()
140 hlist_for_each_entry(c, &clk_orphan_list, child_node) in clk_summary_show()
181 hlist_for_each_entry(child, &c->children, child_node) { in clk_dump_subtree()
198 hlist_for_each_entry(c, &clk_root_list, child_node) { in clk_dump()
205 hlist_for_each_entry(c, &clk_orphan_list, child_node) { in clk_dump()
294 hlist_for_each_entry(child, &clk->children, child_node) in clk_debug_create_subtree()
417 hlist_for_each_entry(clk, &clk_root_list, child_node) in clk_debug_init()
420 hlist_for_each_entry(clk, &clk_orphan_list, child_node) in clk_debug_init()
445 hlist_for_each_entry(child, &clk->children, child_node) in clk_unprepare_unused_subtree()
[all …]
/drivers/input/serio/
Dserio.c504 INIT_LIST_HEAD(&serio->child_node); in serio_init_port()
533 list_add_tail(&serio->child_node, &parent->children); in serio_add_port()
567 list_del_init(&serio->child_node); in serio_destroy_port()
616 struct serio, child_node); in serio_reconnect_subtree()
629 if (!list_is_last(&s->child_node, &parent->children)) { in serio_reconnect_subtree()
630 s = list_entry(s->child_node.next, in serio_reconnect_subtree()
631 struct serio, child_node); in serio_reconnect_subtree()
657 struct serio, child_node); in serio_disconnect_port()
722 list_for_each_entry_safe(s, next, &serio->children, child_node) { in serio_unregister_child_port()