| /utopia/UTPA2-700.0.x/projects/build/scripts/kconfig/ |
| H A D | conf.c | 234 struct menu *child; in conf_choice() local
269 for (child = menu->list; child; child = child->next) { in conf_choice()
270 if (!menu_is_visible(child)) in conf_choice()
272 if (!child->sym) { in conf_choice()
273 printf("%*c %s\n", indent, '*', _(menu_get_prompt(child))); in conf_choice()
277 if (child->sym == def_sym) { in conf_choice()
282 printf(" %d. %s", cnt, _(menu_get_prompt(child))); in conf_choice()
283 if (child->sym->name) in conf_choice()
284 printf(" (%s)", child->sym->name); in conf_choice()
285 if (!sym_has_value(child->sym)) in conf_choice()
[all …]
|
| H A D | mconf.c | 342 struct menu *child; in build_conf() local
406 for (child = menu->list; child; child = child->next) { in build_conf()
407 if (menu_is_visible(child) && child->sym == def_sym) in build_conf()
408 def_menu = child; in build_conf()
511 for (child = menu->list; child; child = child->next) in build_conf()
512 build_conf(child); in build_conf()
646 struct menu *child; in conf_choice() local
656 for (child = menu->list; child; child = child->next) { in conf_choice()
657 if (!menu_is_visible(child)) in conf_choice()
659 if (child->sym) in conf_choice()
[all …]
|
| H A D | nconf.c | 736 struct menu *child; in build_conf() local
797 for (child = menu->list; child; child = child->next) { in build_conf()
798 if (menu_is_visible(child) && child->sym == def_sym) in build_conf()
799 def_menu = child; in build_conf()
913 for (child = menu->list; child; child = child->next) in build_conf()
914 build_conf(child); in build_conf()
1246 struct menu *child = 0; in conf_choice() local
1262 for (i = 0, child = menu->list; child; child = child->next) { in conf_choice()
1263 if (!show_all_items && !menu_is_visible(child)) in conf_choice()
1266 if (child->sym == sym_get_choice_value(menu->sym)) in conf_choice()
[all …]
|
| H A D | gconf.c | 1149 struct menu *child; in fill_row() local
1155 for (child = menu->list; child; child = child->next) { in fill_row()
1156 if (menu_is_visible(child) in fill_row()
1157 && child->sym == def_sym) in fill_row()
1158 def_menu = child; in fill_row()
1275 GtkTreeIter *child = &iter; in gtktree_iter_find_node() local
1279 valid = gtk_tree_model_iter_children(model2, child, parent); in gtktree_iter_find_node()
1283 gtk_tree_model_get(model2, child, 6, &menu, -1); in gtktree_iter_find_node()
1286 memcpy(&found, child, sizeof(GtkTreeIter)); in gtktree_iter_find_node()
1290 ret = gtktree_iter_find_node(child, tofind); in gtktree_iter_find_node()
[all …]
|
| H A D | qconf.cc | 597 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 …]
|
| H A D | kxgettext.c | 174 struct menu *child; in menu_build_message_list() local
185 for (child = menu->list; child != NULL; child = child->next) in menu_build_message_list()
186 if (child->prompt != NULL) in menu_build_message_list()
187 menu_build_message_list(child); in menu_build_message_list()
|
| H A D | menu.c | 435 struct menu *child; in menu_is_visible() local
460 for (child = menu->list; child; child = child->next) { in menu_is_visible()
461 if (menu_is_visible(child)) { in menu_is_visible()
|
| /utopia/UTPA2-700.0.x/projects/build/scripts/dtc/ |
| H A D | livetree.c | 80 struct node *child; in build_node() local
87 for_each_child(new, child) { in build_node()
88 child->parent = new; in build_node()
191 void add_child(struct node *parent, struct node *child) in add_child() argument
195 child->next_sibling = NULL; in add_child()
196 child->parent = parent; in add_child()
202 *p = child; in add_child()
342 struct node *child; in get_subnode() local
344 for_each_child(node, child) in get_subnode()
345 if (streq(child->name, nodename)) in get_subnode()
[all …]
|
| H A D | checks.c | 116 struct node *child; in check_nodes_props() local
129 for_each_child(node, child) in check_nodes_props()
130 check_nodes_props(c, dt, child); in check_nodes_props()
220 struct node *child, *child2; in check_duplicate_node_names() local
222 for_each_child(node, child) in check_duplicate_node_names()
223 for (child2 = child->next_sibling; in check_duplicate_node_names()
226 if (streq(child->name, child2->name)) in check_duplicate_node_names()
228 child->fullpath); in check_duplicate_node_names()
|
| H A D | flattree.c | 263 struct node *child; in flatten_tree() local
306 for_each_child(tree, child) { in flatten_tree()
307 flatten_tree(child, emit, etarget, strbuf, vi); in flatten_tree()
761 struct node *child; in unflatten_tree() local
774 child = unflatten_tree(dtbuf,strbuf, flatname, flags); in unflatten_tree()
775 add_child(node, child); in unflatten_tree()
|
| H A D | dtc.c | 37 struct node *child; in fill_fullpaths() local
48 for_each_child(tree, child) in fill_fullpaths()
49 fill_fullpaths(child, tree->fullpath); in fill_fullpaths()
|
| H A D | treesource.c | 237 struct node *child; in write_tree_source_node() local
255 for_each_child(tree, child) { in write_tree_source_node()
257 write_tree_source_node(f, child, level+1); in write_tree_source_node()
|
| H A D | dtc.h | 180 void add_child(struct node *parent, struct node *child);
|
| /utopia/UTPA2-700.0.x/modules/msos/msos/ucos/ |
| H A D | dlmalloc.c | 1859 struct malloc_tree_chunk* child[2]; member
1869 #define leftmost_child(t) ((t)->child[0] != 0? (t)->child[0] : (t)->child[1])
2680 assert(u->child[0] == 0); in do_check_tree()
2681 assert(u->child[1] == 0); in do_check_tree()
2687 assert (u->parent->child[0] == u || in do_check_tree()
2688 u->parent->child[1] == u || in do_check_tree()
2690 if (u->child[0] != 0) { in do_check_tree()
2691 assert(u->child[0]->parent == u); in do_check_tree()
2692 assert(u->child[0] != u); in do_check_tree()
2693 do_check_tree(m, u->child[0]); in do_check_tree()
[all …]
|
| /utopia/UTPA2-700.0.x/modules/msos/msos/linux/ |
| H A D | dlmalloc.c | 2360 struct malloc_tree_chunk* child[2]; member
2370 #define leftmost_child(t) ((t)->child[0] != 0? (t)->child[0] : (t)->child[1])
3264 assert(u->child[0] == 0); in do_check_tree()
3265 assert(u->child[1] == 0); in do_check_tree()
3271 assert (u->parent->child[0] == u || in do_check_tree()
3272 u->parent->child[1] == u || in do_check_tree()
3274 if (u->child[0] != 0) { in do_check_tree()
3275 assert(u->child[0]->parent == u); in do_check_tree()
3276 assert(u->child[0] != u); in do_check_tree()
3277 do_check_tree(m, u->child[0]); in do_check_tree()
[all …]
|
| /utopia/UTPA2-700.0.x/projects/build/scripts/tracing/ |
| H A 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
|
| /utopia/UTPA2-700.0.x/modules/usb/drv/usb_ecos/usbhost/ |
| H A D | drvUSB.c | 2763 int child; in match_device() local
2809 for (child = 0; child < m_dev->maxchild; ++child) { in match_device()
2810 if (m_dev->children[child]) { in match_device()
2811 ret_dev = match_device(m_dev->children[child], in match_device()
3065 struct usb_device **child = dev->children + i; in usb_disconnect() local
3066 if (*child) in usb_disconnect()
3067 usb_disconnect(child); in usb_disconnect()
|
| /utopia/UTPA2-700.0.x/modules/usb/drv/usb_ecos/newhost/ |
| H A D | drvUSB.c | 493 struct usb_device **child = pUdev->children + i; in ms_usb_disconnect() local
494 if (*child) in ms_usb_disconnect()
495 ms_usb_disconnect(child); in ms_usb_disconnect()
|