| /scripts/kconfig/ |
| D | conf.c | 238 struct menu *child; in conf_choice() local
273 for (child = menu->list; child; child = child->next) { in conf_choice()
274 if (!menu_is_visible(child)) in conf_choice()
276 if (!child->sym) { in conf_choice()
277 printf("%*c %s\n", indent, '*', _(menu_get_prompt(child))); in conf_choice()
281 if (child->sym == def_sym) { in conf_choice()
286 printf(" %d. %s", cnt, _(menu_get_prompt(child))); in conf_choice()
287 if (child->sym->name) in conf_choice()
288 printf(" (%s)", child->sym->name); in conf_choice()
289 if (!sym_has_value(child->sym)) in conf_choice()
[all …]
|
| D | mconf.c | 470 struct menu *child; in build_conf() local
535 for (child = menu->list; child; child = child->next) { in build_conf()
536 if (menu_is_visible(child) && child->sym == def_sym) in build_conf()
537 def_menu = child; in build_conf()
640 for (child = menu->list; child; child = child->next) in build_conf()
641 build_conf(child); in build_conf()
803 struct menu *child; in conf_choice() local
813 for (child = menu->list; child; child = child->next) { in conf_choice()
814 if (!menu_is_visible(child)) in conf_choice()
816 if (child->sym) in conf_choice()
[all …]
|
| D | nconf.c | 737 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()
1235 struct menu *child = 0; in conf_choice() local
1251 for (i = 0, child = menu->list; child; child = child->next) { in conf_choice()
1252 if (!show_all_items && !menu_is_visible(child)) in conf_choice()
1255 if (child->sym == sym_get_choice_value(menu->sym)) in conf_choice()
[all …]
|
| D | gconf.c | 1091 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 …]
|
| D | kxgettext.c | 173 struct menu *child; in menu_build_message_list() local
184 for (child = menu->list; child != NULL; child = child->next) in menu_build_message_list()
185 if (child->prompt != NULL) in menu_build_message_list()
186 menu_build_message_list(child); in menu_build_message_list()
|
| D | qconf.cc | 580 struct menu* child; in updateMenuList() local
598 for (child = menu->list; child; child = child->next) { in updateMenuList()
600 type = child->prompt ? child->prompt->type : P_UNKNOWN; in updateMenuList()
604 if (!(child->flags & MENU_ROOT)) in updateMenuList()
608 if (child->flags & MENU_ROOT) in updateMenuList()
615 visible = menu_is_visible(child); in updateMenuList()
616 if (!menuSkip(child)) { in updateMenuList()
617 if (!child->sym && !child->list && !child->prompt) in updateMenuList()
619 if (!item || item->menu != child) in updateMenuList()
620 item = new ConfigItem(parent, last, child, visible); in updateMenuList()
[all …]
|
| D | menu.c | 461 struct menu *child; in menu_is_empty() local
463 for (child = menu->list; child; child = child->next) { in menu_is_empty()
464 if (menu_is_visible(child)) in menu_is_empty()
472 struct menu *child; in menu_is_visible() local
497 for (child = menu->list; child; child = child->next) { in menu_is_visible()
498 if (menu_is_visible(child)) { in menu_is_visible()
|
| D | qconf.h | 152 return (ConfigItem *)Parent::child(0); in firstChild()
160 ret = (ConfigItem *)_parent->child(_parent->indexOfChild(this)+1); in nextSibling()
|
| /scripts/dtc/ |
| D | livetree.c | 103 struct node *child; in build_node() local
110 for_each_child(new, child) { in build_node()
111 child->parent = new; in build_node()
259 void add_child(struct node *parent, struct node *child) in add_child() argument
263 child->next_sibling = NULL; in add_child()
264 child->parent = parent; in add_child()
270 *p = child; in add_child()
289 struct node *child; in delete_node() local
292 for_each_child(node, child) in delete_node()
293 delete_node(child); in delete_node()
[all …]
|
| D | dtc.c | 46 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()
|
| D | checks.c | 102 struct node *child; in check_nodes_props() local
108 for_each_child(node, child) in check_nodes_props()
109 check_nodes_props(c, dti, child); in check_nodes_props()
209 struct node *child, *child2; in check_duplicate_node_names() local
211 for_each_child(node, child) in check_duplicate_node_names()
212 for (child2 = child->next_sibling; in check_duplicate_node_names()
215 if (streq(child->name, child2->name)) in check_duplicate_node_names()
217 child->fullpath); in check_duplicate_node_names()
|
| D | treesource.c | 239 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()
|
| D | flattree.c | 263 struct node *child; in flatten_tree() local
309 for_each_child(tree, child) { in flatten_tree()
310 flatten_tree(child, emit, etarget, strbuf, vi); in flatten_tree()
771 struct node *child; in unflatten_tree() local
784 child = unflatten_tree(dtbuf,strbuf, flatname, flags); in unflatten_tree()
785 add_child(node, child); in unflatten_tree()
|
| D | dtc.h | 205 void add_child(struct node *parent, struct node *child);
|
| /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/ |
| D | analyze_suspend.py | 519 for child in list:
520 if(list[child]['par'] == devname):
521 devlist.append(child)
526 for child in children:
527 family += self.deviceDescendants(child, phase)
2374 .pf:checked ~ *:not(:nth-child(2)) {display: none;}\n\
|
| D | spelling.txt | 214 chiled||child
|