Home
last modified time | relevance | path

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

/scripts/kconfig/
A Dconf.c232 struct menu *child; in conf_choice() local
267 for (child = menu->list; child; child = child->next) { in conf_choice()
322 for (child = menu->list; child; child = child->next) { in conf_choice()
323 if (!child->sym || !menu_is_visible(child)) in conf_choice()
328 if (!child) in conf_choice()
335 for (child = child->list; child; child = child->next) { in conf_choice()
337 conf(child); in conf_choice()
348 struct menu *child; in conf() local
405 for (child = menu->list; child; child = child->next) in conf()
406 conf(child); in conf()
[all …]
A Dmconf.c469 struct menu *child; in build_conf() local
533 for (child = menu->list; child; child = child->next) { in build_conf()
534 if (menu_is_visible(child) && child->sym == def_sym) in build_conf()
535 def_menu = child; in build_conf()
638 for (child = menu->list; child; child = child->next) in build_conf()
639 build_conf(child); in build_conf()
798 struct menu *child; in conf_choice() local
808 for (child = menu->list; child; child = child->next) { in conf_choice()
811 if (child->sym) in conf_choice()
834 if (!child->sym) in conf_choice()
[all …]
A Dnconf.c737 struct menu *child; in build_conf() local
798 for (child = menu->list; child; child = child->next) { in build_conf()
799 if (menu_is_visible(child) && child->sym == def_sym) in build_conf()
800 def_menu = child; in build_conf()
914 for (child = menu->list; child; child = child->next) in build_conf()
915 build_conf(child); in build_conf()
1248 for (i = 0, child = menu->list; child; child = child->next) { in conf_choice()
1255 else if (child->sym) in conf_choice()
1326 child = item_data(); in conf_choice()
1327 if (!child || !menu_is_visible(child) || !child->sym) in conf_choice()
[all …]
A Dgconf.c1059 struct menu *child; in fill_row() local
1065 for (child = menu->list; child; child = child->next) { in fill_row()
1068 def_menu = child; in fill_row()
1301 struct menu *child; in display_tree() local
1309 for (child = menu->list; child; child = child->next) { in display_tree()
1310 prop = child->prompt; in display_tree()
1311 sym = child->sym; in display_tree()
1328 place_node(child, fill_row(child)); in display_tree()
1391 struct menu *child; in fixup_rootmenu() local
1395 for (child = menu->list; child; child = child->next) { in fixup_rootmenu()
[all …]
A Dqconf.cc579 struct menu* child; in updateMenuList() local
597 for (child = menu->list; child; child = child->next) { in updateMenuList()
599 type = child->prompt ? child->prompt->type : P_UNKNOWN; in updateMenuList()
616 if (!child->sym && !child->list && !child->prompt) in updateMenuList()
644 struct menu* child; in updateMenuList() local
662 for (child = menu->list; child; child = child->next) { in updateMenuList()
664 type = child->prompt ? child->prompt->type : P_UNKNOWN; in updateMenuList()
681 if (!child->sym && !child->list && !child->prompt) in updateMenuList()
1801 struct menu *child; in fixup_rootmenu() local
1805 for (child = menu->list; child; child = child->next) { in fixup_rootmenu()
[all …]
A Dmenu.c618 struct menu *child; in menu_is_empty() local
620 for (child = menu->list; child; child = child->next) { in menu_is_empty()
621 if (menu_is_visible(child)) in menu_is_empty()
629 struct menu *child; in menu_is_visible() local
654 for (child = menu->list; child; child = child->next) { in menu_is_visible()
655 if (menu_is_visible(child)) { in menu_is_visible()
A Dqconf.h152 return (ConfigItem *)Parent::child(0); in firstChild()
160 ret = (ConfigItem *)_parent->child(_parent->indexOfChild(this)+1); in nextSibling()
/scripts/dtc/
A Dlivetree.c103 struct node *child; in build_node() local
110 for_each_child(new, child) { in build_node()
111 child->parent = new; in build_node()
307 child->parent = parent; in add_child()
313 *p = child; in add_child()
332 struct node *child; in delete_node() local
336 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 Ddtc.c46 struct node *child; in fill_fullpaths() local
57 for_each_child(tree, child) in fill_fullpaths()
58 fill_fullpaths(child, tree->fullpath); in fill_fullpaths()
A Dchecks.c116 struct node *child; in check_nodes_props() local
122 for_each_child(node, child) in check_nodes_props()
250 struct node *child, *child2; in check_duplicate_node_names() local
252 for_each_child(node, child) in check_duplicate_node_names()
1017 struct node *child; in check_avoid_unnecessary_addr_size() local
1026 for_each_child(node, child) { in check_avoid_unnecessary_addr_size()
1417 struct node *child; in check_graph_nodes() local
1419 for_each_child(node, child) { in check_graph_nodes()
1420 if (!(strprefixeq(child->name, child->basenamelen, "endpoint") || in check_graph_nodes()
1441 struct node *child; in check_graph_child_address() local
[all …]
A Dtreesource.c239 struct node *child; in write_tree_source_node() local
257 for_each_child(tree, child) { in write_tree_source_node()
259 write_tree_source_node(f, child, level+1); in write_tree_source_node()
A Dflattree.c255 struct node *child; in flatten_tree() local
301 for_each_child(tree, child) { in flatten_tree()
302 flatten_tree(child, emit, etarget, strbuf, vi); in flatten_tree()
762 struct node *child; in unflatten_tree() local
775 child = unflatten_tree(dtbuf,strbuf, flatname, flags); in unflatten_tree()
776 add_child(node, child); in unflatten_tree()
A Ddtc.h214 void add_child(struct node *parent, struct node *child);
/scripts/dtc/libfdt/
A Dfdt_overlay.c159 int child; in overlay_adjust_node_phandles() local
170 fdt_for_each_subnode(child, fdto, node) { in overlay_adjust_node_phandles()
171 ret = overlay_adjust_node_phandles(fdto, child, delta); in overlay_adjust_node_phandles()
/scripts/
A Dspelling.txt330 chiled||child

Completed in 38 milliseconds