Home
last modified time | relevance | path

Searched refs:next (Results 1 – 24 of 24) sorted by relevance

/scripts/kconfig/
A Dlist.h24 struct list_head *next, *prev; member
61 n = list_entry(pos->member.next, typeof(*pos), member); \
71 return head->next == head; in list_empty()
82 struct list_head *next) in __list_add() argument
84 next->prev = _new; in __list_add()
85 _new->next = next; in __list_add()
87 prev->next = _new; in __list_add()
112 next->prev = prev; in __list_del()
113 prev->next = next; in __list_del()
126 __list_del(entry->prev, entry->next); in list_del()
[all …]
A Dmenu.c59 last_entry_ptr = &menu->next; in menu_add_entry()
73 last_entry_ptr = &current_menu->next; in menu_end_menu()
451 for (menu = parent->next; menu; menu = menu->next) { in menu_finalize()
458 goto next; in menu_finalize()
481 next: in menu_finalize()
488 parent->list = parent->next; in menu_finalize()
489 parent->next = last_menu->next; in menu_finalize()
490 last_menu->next = NULL; in menu_finalize()
567 if (!last_menu->next) in menu_finalize()
570 last_menu->next = menu->next; in menu_finalize()
[all …]
A Dexpr.h21 struct file *next; member
85 struct symbol *next; member
134 …= 0; i < SYMBOL_HASHSIZE; i++) for (sym = symbol_hash[i]; sym; sym = sym->next) if (sym->type != S…
192 struct property *next; /* next property - null if last */ member
206 for (st = sym->prop; st; st = st->next) \
211 for (st = sym->prop; st; st = st->next) \
222 struct menu *next; member
A Dconfdata.c762 menu = menu->next; in conf_write_defconfig()
765 if (menu->next != NULL) { in conf_write_defconfig()
766 menu = menu->next; in conf_write_defconfig()
829 goto next; in conf_write()
838 goto next; in conf_write()
844 next: in conf_write()
849 if (menu->next) in conf_write()
850 menu = menu->next; in conf_write()
852 if (menu->next) { in conf_write()
853 menu = menu->next; in conf_write()
[all …]
A Dutil.c18 for (file = file_list; file; file = file->next) { in file_lookup()
27 file->next = file_list; in file_lookup()
A Dmconf.c325 tmp = pos->next; in set_subtitle()
333 pos->next = xcalloc(1, sizeof(*pos)); in set_subtitle()
334 pos = pos->next; in set_subtitle()
350 tmp = pos->next; in reset_subtitle()
533 for (child = menu->list; child; child = child->next) { in build_conf()
638 for (child = menu->list; child; child = child->next) in build_conf()
808 for (child = menu->list; child; child = child->next) { in conf_choice()
A Dsymbol.c158 for (prop = sym->prop; prop; prop = prop->next) { in sym_set_changed()
840 symbol->next = symbol_hash[hash]; in sym_lookup()
863 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) { in sym_find()
1011 struct dep_stack *prev, *next; member
1021 check_top->next = stack; in dep_stack_insert()
1031 check_top->next = NULL; in dep_stack_remove()
1060 for (; stack; stack = stack->next) { in sym_check_print_recursive()
1062 next_sym = stack->next ? stack->next->sym : last_sym; in sym_check_print_recursive()
1069 for (prop = sym->prop; prop; prop = prop->next) { in sym_check_print_recursive()
1188 for (prop = sym->prop; prop; prop = prop->next) { in sym_check_sym_deps()
[all …]
A Dconf.c267 for (child = menu->list; child; child = child->next) { in conf_choice()
322 for (child = menu->list; child; child = child->next) { in conf_choice()
335 for (child = child->list; child; child = child->next) { in conf_choice()
405 for (child = menu->list; child; child = child->next) in conf()
446 for (child = menu->list; child; child = child->next) in check_conf()
A Dzconf.y675 for (prop = sym->prop; prop; prop = prop->next) { in print_symbol()
771 else if (menu->next) in zconfdump()
772 menu = menu->next; in zconfdump()
776 if (menu->next) { in zconfdump()
777 menu = menu->next; in zconfdump()
A Dnconf.c798 for (child = menu->list; child; child = child->next) { in build_conf()
914 for (child = menu->list; child; child = child->next) in build_conf()
1248 for (i = 0, child = menu->list; child; child = child->next) { in conf_choice()
A Dgconf.c1065 for (child = menu->list; child; child = child->next) { in fill_row()
1226 for (child1 = src->list; child1; child1 = child1->next) { in update_tree()
1309 for (child = menu->list; child; child = child->next) { in display_tree()
1395 for (child = menu->list; child; child = child->next) { in fixup_rootmenu()
A Dqconf.cc597 for (child = menu->list; child; child = child->next) { in updateMenuList()
662 for (child = menu->list; child; child = child->next) { in updateMenuList()
1141 for (struct property *prop = sym->prop; prop; prop = prop->next) { in debug_info()
1805 for (child = menu->list; child; child = child->next) { in fixup_rootmenu()
/scripts/dtc/
A Dlivetree.c41 new->next = *labels; in add_label()
81 first->next = list; in chain_property()
92 next = p->next; in reverse_properties()
93 p->next = head; in reverse_properties()
95 p = next; in reverse_properties()
274 prop->next = NULL; in add_property()
278 p = &((*p)->next); in add_property()
292 prop = prop->next; in delete_property_by_name()
385 new->next = NULL; in add_reserve_entry()
390 for (last = list; last->next; last = last->next) in add_reserve_entry()
[all …]
A Ddtc.h85 struct marker *next; member
97 for (; (m); (m) = (m)->next)
135 struct label *next; member
147 struct property *next; member
174 for ((l) = (l0); (l); (l) = (l)->next)
181 for ((p) = (n)->proplist; (p); (p) = (p)->next)
242 struct reserve_info *next; member
A Dtreesource.c75 m = m->next; in write_propval_string()
117 m = m->next; in write_propval_string()
150 m = m->next; in write_propval_cells()
178 m = m->next; in write_propval_bytes()
271 for (re = dti->reservelist; re; re = re->next) { in dt_to_source()
A Dsrcpos.c29 struct search_path *next; /* next node in list, NULL for end */ member
109 for (node = search_path_head; !*fp && node; node = node->next) in fopen_any_on_path()
187 node->next = NULL; in srcfile_add_search_path()
195 search_path_tail = &node->next; in srcfile_add_search_path()
A Ddata.c29 nm = m->next; in data_free()
137 m = m->next; in data_insert_at_marker()
149 mp = &((*mp)->next); in data_append_markers()
248 m->next = NULL; in data_add_marker()
A Dchecks.c267 for (prop2 = prop->next; prop2; prop2 = prop2->next) { in check_duplicate_property_names()
530 for (pp = &node->proplist; *pp; pp = &((*pp)->next)) in check_name_properties()
546 *pp = prop->next; in check_name_properties()
A Dflattree.c315 for (re = reservelist; re; re = re->next) { in flatten_reserve_list()
531 for (re = dti->reservelist; re; re = re->next) { in dt_to_asm()
/scripts/kconfig/lxdialog/
A Ddialog.h91 struct subtitle_list *next; member
163 struct dialog_list *next; member
178 item_cur && (item_cur != &item_nil); item_cur = item_cur->next)
A Dutil.c258 for (pos = dlg.subtitles; pos != NULL; pos = pos->next) { in dialog_clear()
270 for (pos = dlg.subtitles; pos != NULL; pos = pos->next) { in dialog_clear()
583 struct dialog_list *p, *next; in item_reset() local
585 for (p = item_head; p; p = next) { in item_reset()
586 next = p->next; in item_reset()
599 item_cur->next = p; in item_make()
661 for (p = item_head; p; p = p->next) in item_count()
679 for (p = item_head; p; p = p->next) { in item_n()
/scripts/basic/
A Dfixdep.c162 struct item *next; member
188 for (aux = hashtab[hash % HASHSZ]; aux; aux = aux->next) { in is_defined_config()
210 aux->next = hashtab[hash % HASHSZ]; in define_config()
/scripts/coccinelle/iterators/
A Dlist_entry_update.cocci2 /// the list to the next, so it is usually not a good idea to reassign it.
/scripts/dtc/pylibfdt/
A Dlibfdt.i_shipped157 """Find the next subnode
167 Offset of the next node, if any, else a -ve error
191 """Find the next subnode
198 The offset of the next subnode, if any
368 """Get the next property in a node
375 Offset of the next property

Completed in 598 milliseconds