Home
last modified time | relevance | path

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

/scripts/kconfig/
Dconf.c235 struct menu *child; in conf_choice() local
270 for (child = menu->list; child; child = child->next) { in conf_choice()
271 if (!menu_is_visible(child)) in conf_choice()
273 if (!child->sym) { in conf_choice()
274 printf("%*c %s\n", indent, '*', menu_get_prompt(child)); in conf_choice()
278 if (child->sym == def_sym) { in conf_choice()
283 printf(" %d. %s", cnt, menu_get_prompt(child)); in conf_choice()
284 if (child->sym->name) in conf_choice()
285 printf(" (%s)", child->sym->name); in conf_choice()
286 if (!sym_has_value(child->sym)) in conf_choice()
[all …]
Dmconf.c470 struct menu *child; in build_conf() local
534 for (child = menu->list; child; child = child->next) { in build_conf()
535 if (menu_is_visible(child) && child->sym == def_sym) in build_conf()
536 def_menu = child; in build_conf()
639 for (child = menu->list; child; child = child->next) in build_conf()
640 build_conf(child); in build_conf()
799 struct menu *child; in conf_choice() local
809 for (child = menu->list; child; child = child->next) { in conf_choice()
810 if (!menu_is_visible(child)) in conf_choice()
812 if (child->sym) in conf_choice()
[all …]
Dnconf.c740 struct menu *child; in build_conf() local
800 for (child = menu->list; child; child = child->next) { in build_conf()
801 if (menu_is_visible(child) && child->sym == def_sym) in build_conf()
802 def_menu = child; in build_conf()
916 for (child = menu->list; child; child = child->next) in build_conf()
917 build_conf(child); in build_conf()
1234 struct menu *child = NULL; in conf_choice() local
1250 for (i = 0, child = menu->list; child; child = child->next) { in conf_choice()
1251 if (!show_all_items && !menu_is_visible(child)) in conf_choice()
1254 if (child->sym == sym_get_choice_value(menu->sym)) in conf_choice()
[all …]
Dgconf.c1091 struct menu *child; in fill_row() local
1097 for (child = menu->list; child; child = child->next) { in fill_row()
1098 if (menu_is_visible(child) in fill_row()
1099 && child->sym == def_sym) in fill_row()
1100 def_menu = child; in fill_row()
1218 GtkTreeIter *child = &iter; in gtktree_iter_find_node() local
1222 valid = gtk_tree_model_iter_children(model2, child, parent); in gtktree_iter_find_node()
1226 gtk_tree_model_get(model2, child, 6, &menu, -1); in gtktree_iter_find_node()
1229 memcpy(&found, child, sizeof(GtkTreeIter)); in gtktree_iter_find_node()
1233 ret = gtktree_iter_find_node(child, tofind); in gtktree_iter_find_node()
[all …]
Dqconf.cc594 struct menu* child; in updateMenuList() local
612 for (child = menu->list; child; child = child->next) { in updateMenuList()
614 type = child->prompt ? child->prompt->type : P_UNKNOWN; in updateMenuList()
618 if (!(child->flags & MENU_ROOT)) in updateMenuList()
622 if (child->flags & MENU_ROOT) in updateMenuList()
629 visible = menu_is_visible(child); in updateMenuList()
630 if (!menuSkip(child)) { in updateMenuList()
631 if (!child->sym && !child->list && !child->prompt) in updateMenuList()
633 if (!item || item->menu != child) in updateMenuList()
634 item = new ConfigItem(parent, last, child, visible); in updateMenuList()
[all …]
Dmenu.c629 struct menu *child; in menu_is_empty() local
631 for (child = menu->list; child; child = child->next) { in menu_is_empty()
632 if (menu_is_visible(child)) in menu_is_empty()
640 struct menu *child; in menu_is_visible() local
665 for (child = menu->list; child; child = child->next) { in menu_is_visible()
666 if (menu_is_visible(child)) { in menu_is_visible()
Dqconf.h144 return (ConfigItem *)Parent::child(0); in firstChild()
152 ret = (ConfigItem *)_parent->child(_parent->indexOfChild(this)+1); in nextSibling()
/scripts/gdb/linux/
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)
Dproc.py59 child = resource['child']
60 if child:
61 for res, deep in get_resources(child, depth + 1):
Ddevice.py93 for child in device_for_each_child(dev):
94 _show_device(child, level + 1, recursive)
/scripts/tracing/
Ddraw_functrace.py49 child = CallTree(func, calltime, self)
50 self._children.append(child)
51 return child
63 child = CallTree.ROOT.calls(func, None)
64 return child
/scripts/dtc/
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()
298 void add_child(struct node *parent, struct node *child) in add_child() argument
302 child->next_sibling = NULL; in add_child()
303 child->parent = parent; in add_child()
309 *p = child; in add_child()
328 struct node *child; in delete_node() local
331 for_each_child(node, child) in delete_node()
332 delete_node(child); in delete_node()
[all …]
Dyamltree.c179 struct node *child; in yaml_tree() local
193 for_each_child(tree, child) { in yaml_tree()
195 (yaml_char_t *)YAML_STR_TAG, (yaml_char_t*)child->name, in yaml_tree()
196 strlen(child->name), 1, 0, YAML_PLAIN_SCALAR_STYLE); in yaml_tree()
198 yaml_tree(child, emitter); in yaml_tree()
Dchecks.c136 struct node *child; in check_nodes_props() local
142 for_each_child(node, child) in check_nodes_props()
143 check_nodes_props(c, dti, child); in check_nodes_props()
270 struct node *child, *child2; in check_duplicate_node_names() local
272 for_each_child(node, child) in check_duplicate_node_names()
273 for (child2 = child->next_sibling; in check_duplicate_node_names()
276 if (streq(child->name, child2->name)) in check_duplicate_node_names()
1003 struct node *child; in check_i2c_bus_bridge() local
1004 for_each_child(node, child) { in check_i2c_bus_bridge()
1005 if (strprefixeq(child->name, node->basenamelen, "i2c-bus")) in check_i2c_bus_bridge()
[all …]
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()
Dtreesource.c284 struct node *child; in write_tree_source_node() local
312 for_each_child(tree, child) { in write_tree_source_node()
314 write_tree_source_node(f, child, level+1); in write_tree_source_node()
Dflattree.c240 struct node *child; in flatten_tree() local
286 for_each_child(tree, child) { in flatten_tree()
287 flatten_tree(child, emit, etarget, strbuf, vi); in flatten_tree()
749 struct node *child; in unflatten_tree() local
762 child = unflatten_tree(dtbuf,strbuf, flatname, flags); in unflatten_tree()
763 add_child(node, child); in unflatten_tree()
Ddtc.h246 void add_child(struct node *parent, struct node *child);
/scripts/
Dcheck-sysctl-docs143 /\.child[\t ]*=/ {
144 child = trimpunct($NF)
145 if (debug) print "Linking child " child " to table " curtable " entry " curentry
146 children[curtable][curentry] = child
Dspelling.txt292 chiled||child
/scripts/dtc/libfdt/
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/coccinelle/iterators/
Dfor_each_child.cocci2 …issing of_node_put() before return/break/goto statement within a for_each iterator for child nodes.