| /scripts/kconfig/ |
| D | mconf.c | 458 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()
612 if (!menu_is_visible(child)) in conf_choice()
614 if (child->sym) in conf_choice()
[all …]
|
| D | conf.c | 426 struct menu *child; in conf_choice() local
436 for (child = menu->list; child; child = child->next) { in conf_choice()
437 if (!menu_is_visible(child)) in conf_choice()
439 if (!child->sym) { in conf_choice()
440 printf("%*c %s\n", indent, '*', menu_get_prompt(child)); in conf_choice()
444 if (child->sym == def_sym) { in conf_choice()
449 printf(" %d. %s (%s)", cnt, menu_get_prompt(child), in conf_choice()
450 child->sym->name); in conf_choice()
451 if (!sym_has_value(child->sym)) { in conf_choice()
492 for (child = menu->list; child; child = child->next) { in conf_choice()
[all …]
|
| D | nconf.c | 765 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()
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_calc_choice(menu)) in conf_choice()
[all …]
|
| D | qconf.cc | 599 struct menu* child; in updateMenuList() local
617 for (child = menu->list; child; child = child->next) { in updateMenuList()
619 type = child->prompt ? child->prompt->type : P_UNKNOWN; in updateMenuList()
623 if (!(child->flags & MENU_ROOT)) in updateMenuList()
627 if (child->flags & MENU_ROOT) in updateMenuList()
634 visible = menu_is_visible(child); in updateMenuList()
635 if (!menuSkip(child)) { in updateMenuList()
636 if (!child->sym && !child->list && !child->prompt) in updateMenuList()
638 if (!item || item->menu != child) in updateMenuList()
639 item = new ConfigItem(parent, last, child, visible); in updateMenuList()
[all …]
|
| D | gconf.c | 1058 struct menu *child; in fill_row() local
1062 for (child = menu->list; child; child = child->next) { in fill_row()
1063 if (menu_is_visible(child) in fill_row()
1064 && child->sym == def_sym) in fill_row()
1065 def_menu = child; in fill_row()
1181 GtkTreeIter *child = &iter; in gtktree_iter_find_node() local
1185 valid = gtk_tree_model_iter_children(model2, child, parent); in gtktree_iter_find_node()
1189 gtk_tree_model_get(model2, child, 6, &menu, -1); in gtktree_iter_find_node()
1192 memcpy(&found, child, sizeof(GtkTreeIter)); in gtktree_iter_find_node()
1196 ret = gtktree_iter_find_node(child, tofind); in gtktree_iter_find_node()
[all …]
|
| D | menu.c | 525 struct menu *child; in menu_is_empty() local
527 for (child = menu->list; child; child = child->next) { in menu_is_empty()
528 if (menu_is_visible(child)) in menu_is_empty()
536 struct menu *child; in menu_is_visible() local
561 for (child = menu->list; child; child = child->next) in menu_is_visible()
562 if (menu_is_visible(child)) in menu_is_visible()
|
| D | qconf.h | 144 return (ConfigItem *)Parent::child(0); in firstChild()
152 ret = (ConfigItem *)_parent->child(_parent->indexOfChild(this)+1); in nextSibling()
|
| D | parser.y | 563 struct menu *child; in conf_parse() local
569 menu_for_each_sub_entry(child, menu) in conf_parse()
570 if (child->sym && choice_check_sanity(child)) in conf_parse()
|
| /scripts/gdb/linux/ |
| D | clk.py | 40 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)
|
| D | proc.py | 62 child = resource['child']
63 if child:
64 for res, deep in get_resources(child, depth + 1):
|
| D | device.py | 93 for child in device_for_each_child(dev):
94 _show_device(child, level + 1, recursive)
|
| /scripts/tracing/ |
| D | draw_functrace.py | 49 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/ |
| D | livetree.c | 92 struct node *child; in build_node() local
100 for_each_child(new, child) { in build_node()
101 child->parent = new; in build_node()
299 void add_child(struct node *parent, struct node *child) in add_child() argument
303 child->next_sibling = NULL; in add_child()
304 child->parent = parent; in add_child()
310 *p = child; in add_child()
329 struct node *child; in delete_node() local
332 for_each_child(node, child) in delete_node()
333 delete_node(child); in delete_node()
[all …]
|
| D | yamltree.c | 181 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()
|
| D | checks.c | 137 struct node *child; in check_nodes_props() local
143 for_each_child(node, child) in check_nodes_props()
144 check_nodes_props(c, dti, 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()
282 for (child2 = child->next_sibling; in check_duplicate_node_names()
285 if (streq(child->name, child2->name)) in check_duplicate_node_names()
1025 struct node *child; in check_i2c_bus_bridge() local
1026 for_each_child(node, child) { in check_i2c_bus_bridge()
1027 if (strprefixeq(child->name, node->basenamelen, "i2c-bus")) in check_i2c_bus_bridge()
[all …]
|
| D | dtc.c | 33 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()
|
| D | treesource.c | 302 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()
|
| D | flattree.c | 241 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()
|
| D | dtc.h | 282 void add_child(struct node *parent, struct node *child);
|
| /scripts/gendwarfksyms/ |
| D | types.c | 362 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()
|
| D | die.c | 156 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()
|
| D | gendwarfksyms.h | 200 void die_map_add_die(struct die *pd, struct die *child);
|
| D | dwarf.c | 808 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/ |
| D | fdt_overlay.c | 140 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/ |
| D | get_abi.pl | 615 my @child = keys(%{$v});
617 foreach my $c(@child) {
|