Home
last modified time | relevance | path

Searched refs:child (Results 1 – 25 of 25) sorted by relevance

/scripts/kconfig/
A Dmconf.c458 struct menu *child; in build_conf() local
522 for (child = menu->list; child; child = child->next) { in build_conf()
523 if (menu_is_visible(child) && child->sym == def_sym) in build_conf()
524 def_menu = child; in build_conf()
593 for (child = menu->list; child; child = child->next) in build_conf()
594 build_conf(child); in build_conf()
601 struct menu *child; in conf_choice() local
611 for (child = menu->list; child; child = child->next) { in conf_choice()
614 if (child->sym) in conf_choice()
637 if (!child->sym) in conf_choice()
[all …]
A Dconf.c426 struct menu *child; in conf_choice() local
436 for (child = menu->list; child; child = child->next) { in conf_choice()
492 for (child = menu->list; child; child = child->next) { in conf_choice()
493 if (!child->sym || !menu_is_visible(child)) in conf_choice()
498 if (!child) in conf_choice()
513 struct menu *child; in conf() local
568 for (child = menu->list; child; child = child->next) in conf()
569 conf(child); in conf()
577 struct menu *child; in check_conf() local
603 for (child = menu->list; child; child = child->next) in check_conf()
[all …]
A Dnconf.c765 struct menu *child; in build_conf() local
825 for (child = menu->list; child; child = child->next) { in build_conf()
826 if (menu_is_visible(child) && child->sym == def_sym) in build_conf()
827 def_menu = child; in build_conf()
900 for (child = menu->list; child; child = child->next) in build_conf()
901 build_conf(child); in build_conf()
1250 for (i = 0, child = menu->list; child; child = child->next) { in conf_choice()
1257 else if (child->sym) in conf_choice()
1330 child = item_data(); in conf_choice()
1331 if (!child || !menu_is_visible(child) || !child->sym) in conf_choice()
[all …]
A Dqconf.cc610 struct menu* child; in updateMenuList() local
627 for (child = menu->list; child; child = child->next) { in updateMenuList()
629 type = child->prompt ? child->prompt->type : P_UNKNOWN; in updateMenuList()
645 if (!child->sym && !child->list && !child->prompt) in updateMenuList()
673 struct menu* child; in updateMenuList() local
690 for (child = menu->list; child; child = child->next) { in updateMenuList()
692 type = child->prompt ? child->prompt->type : P_UNKNOWN; in updateMenuList()
708 if (!child->sym && !child->list && !child->prompt) in updateMenuList()
1788 struct menu *child; in fixup_rootmenu() local
1792 for (child = menu->list; child; child = child->next) { in fixup_rootmenu()
[all …]
A Dgconf.c182 for (struct menu *child = menu->list; child; child = child->next) { in set_node() local
183 if (menu_is_visible(child) && child->sym == def_sym) in set_node()
184 def_menu = child; in set_node()
895 struct menu *child; in _display_tree() local
898 for (child = menu->list; child; child = child->next) { in _display_tree()
905 if (child->type == M_IF) in _display_tree()
939 struct menu *child; in fixup_rootmenu() local
943 for (child = menu->list; child; child = child->next) { in fixup_rootmenu()
944 if (child->prompt && child->prompt->type == P_MENU) { in fixup_rootmenu()
946 fixup_rootmenu(child); in fixup_rootmenu()
[all …]
A Dmenu.c526 struct menu *child; in menu_is_empty() local
528 for (child = menu->list; child; child = child->next) { in menu_is_empty()
529 if (menu_is_visible(child)) in menu_is_empty()
537 struct menu *child; in menu_is_visible() local
562 for (child = menu->list; child; child = child->next) in menu_is_visible()
563 if (menu_is_visible(child)) in menu_is_visible()
A Dqconf.h143 return (ConfigItem *)Parent::child(0); in firstChild()
151 ret = (ConfigItem *)_parent->child(_parent->indexOfChild(this)+1); in nextSibling()
A Dparser.y556 struct menu *child; in conf_parse() local
562 menu_for_each_sub_entry(child, menu) in conf_parse()
563 if (child->sym && choice_check_sanity(child)) in conf_parse()
/scripts/gdb/linux/
A Dclk.py40 for child in clk_core_for_each_child(clk['children']):
41 self.show_subtree(child, level + 1)
65 for child in clk_core_for_each_child(hlist_head):
66 if child['name'].string() == name:
67 return child
68 result = self.lookup_hlist(child['children'], name)
A Dproc.py62 child = resource['child']
63 if child:
64 for res, deep in get_resources(child, depth + 1):
A Ddevice.py93 for child in device_for_each_child(dev):
94 _show_device(child, level + 1, recursive)
/scripts/dtc/
A Dlivetree.c92 struct node *child; in build_node() local
100 for_each_child(new, child) { in build_node()
101 child->parent = new; in build_node()
304 child->parent = parent; in add_child()
310 *p = child; in add_child()
329 struct node *child; in delete_node() local
333 delete_node(child); in delete_node()
504 struct node *child; in get_subnode() local
508 return child; in get_subnode()
516 struct node *child; in get_node_by_path() local
[all …]
A Dyamltree.c181 struct node *child; in yaml_tree() local
195 for_each_child(tree, child) { in yaml_tree()
197 (yaml_char_t *)YAML_STR_TAG, (yaml_char_t*)child->name, in yaml_tree()
198 strlen(child->name), 1, 0, YAML_PLAIN_SCALAR_STYLE); in yaml_tree()
200 yaml_tree(child, emitter); in yaml_tree()
A Dchecks.c137 struct node *child; in check_nodes_props() local
143 for_each_child(node, child) in check_nodes_props()
279 struct node *child, *child2; in check_duplicate_node_names() local
281 for_each_child(node, child) in check_duplicate_node_names()
1025 struct node *child; in check_i2c_bus_bridge() local
1105 struct node *child; in check_spi_bus_bridge() local
1221 struct node *child; in check_avoid_unnecessary_addr_size() local
1230 for_each_child(node, child) { in check_avoid_unnecessary_addr_size()
1767 struct node *child; in check_graph_nodes() local
1770 if (!(strprefixeq(child->name, child->basenamelen, "endpoint") || in check_graph_nodes()
[all …]
A Ddtc.c33 struct node *child; in fill_fullpaths() local
44 for_each_child(tree, child) in fill_fullpaths()
45 fill_fullpaths(child, tree->fullpath); in fill_fullpaths()
A Dtreesource.c302 struct node *child; in write_tree_source_node() local
330 for_each_child(tree, child) { in write_tree_source_node()
332 write_tree_source_node(f, child, level+1); in write_tree_source_node()
A Dflattree.c241 struct node *child; in flatten_tree() local
287 for_each_child(tree, child) { in flatten_tree()
288 flatten_tree(child, emit, etarget, strbuf, vi); in flatten_tree()
751 struct node *child; in unflatten_tree() local
764 child = unflatten_tree(dtbuf,strbuf, flatname, flags); in unflatten_tree()
765 add_child(node, child); in unflatten_tree()
A Ddtc.h282 void add_child(struct node *parent, struct node *child);
/scripts/gendwarfksyms/
A Dtypes.c362 struct die *child; in __type_expand() local
373 &child) && in __type_expand()
375 &child)) in __type_expand()
379 name = get_type_name(child); in __type_expand()
383 __type_expand(child, type); in __type_expand()
A Ddie.c156 void die_map_add_die(struct die *cd, struct die *child) in die_map_add_die() argument
164 df->data.addr = child->addr; in die_map_add_die()
A Dgendwarfksyms.h200 void die_map_add_die(struct die *pd, struct die *child);
A Ddwarf.c808 Dwarf_Die child; in process_cached() local
822 (void *)df->data.addr, &child)) in process_cached()
825 cache, df->data.addr, dwarf_tag(&child)); in process_cached()
826 check(process_type(state, NULL, &child)); in process_cached()
/scripts/dtc/libfdt/
A Dfdt_overlay.c140 int child; in overlay_adjust_node_phandles() local
151 fdt_for_each_subnode(child, fdto, node) { in overlay_adjust_node_phandles()
152 ret = overlay_adjust_node_phandles(fdto, child, delta); in overlay_adjust_node_phandles()
/scripts/coccinelle/iterators/
A Dfor_each_child.cocci2 …issing of_node_put() before return/break/goto statement within a for_each iterator for child nodes.
/scripts/
A Dspelling.txt330 chiled||child

Completed in 41 milliseconds