Home
last modified time | relevance | path

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

12

/scripts/kconfig/
Dlist.h25 struct list_head *next, *prev; member
50 for (pos = list_entry((head)->next, typeof(*pos), member); \
52 pos = list_entry(pos->member.next, typeof(*pos), member))
62 for (pos = list_entry((head)->next, typeof(*pos), member), \
63 n = list_entry(pos->member.next, typeof(*pos), member); \
65 pos = n, n = list_entry(n->member.next, typeof(*n), member))
73 return head->next == head; in list_empty()
84 struct list_head *next) in __list_add() argument
86 next->prev = _new; in __list_add()
87 _new->next = next; in __list_add()
[all …]
Dmenu.c59 last_entry_ptr = &menu->next; in menu_add_entry()
73 last_entry_ptr = &current_menu->next; in menu_end_menu()
232 for (prop = sym->prop; prop; prop = prop->next) { in sym_check_prop()
308 for (menu = parent->list; menu; menu = menu->next) { in menu_finalize()
316 for (menu = parent->list; menu; menu = menu->next) { in menu_finalize()
337 for (menu = parent->list; menu; menu = menu->next) { in menu_finalize()
362 for (; prop; prop = prop->next) { in menu_finalize()
417 for (menu = parent->list; menu; menu = menu->next) in menu_finalize()
448 for (menu = parent->next; menu; menu = menu->next) { in menu_finalize()
455 goto next; in menu_finalize()
[all …]
Dexpr.h21 struct file *next; member
85 struct symbol *next; member
134 …bols(i, sym) for (i = 0; i < SYMBOL_HASHSIZE; i++) for (sym = symbol_hash[i]; sym; sym = sym->next)
193 struct property *next; /* next property - null if last */ member
207 for (st = sym->prop; st; st = st->next) \
212 for (st = sym->prop; st; st = st->next) \
223 struct menu *next; member
Dutil.c17 for (file = file_list; file; file = file->next) { in file_lookup()
26 file->next = file_list; in file_lookup()
Dconfdata.c828 else if (menu->next != NULL) { in conf_write_defconfig()
829 menu = menu->next; in conf_write_defconfig()
832 if (menu->next != NULL) { in conf_write_defconfig()
833 menu = menu->next; in conf_write_defconfig()
892 goto next; in conf_write()
903 goto next; in conf_write()
912 next: in conf_write()
917 if (menu->next) in conf_write()
918 menu = menu->next; in conf_write()
926 if (menu->next) { in conf_write()
[all …]
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()
Dsymbol.c156 for (prop = sym->prop; prop; prop = prop->next) { in sym_set_changed()
818 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) { in sym_lookup()
837 symbol->next = symbol_hash[hash]; in sym_lookup()
860 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) { in sym_find()
1008 struct dep_stack *prev, *next; member
1018 check_top->next = stack; in dep_stack_insert()
1028 check_top->next = NULL; in dep_stack_remove()
1057 for (; stack; stack = stack->next) { in sym_check_print_recursive()
1059 next_sym = stack->next ? stack->next->sym : last_sym; in sym_check_print_recursive()
1066 for (prop = sym->prop; prop; prop = prop->next) { in sym_check_print_recursive()
[all …]
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()
/scripts/genksyms/
Dgenksyms.c179 (defn = defn->next) && defn->tag == SYM_NORMAL && in is_unknown_symbol()
181 (defn = defn->next) && defn->tag == SYM_NORMAL && in is_unknown_symbol()
332 struct string_list *next = s->next; in free_list() local
334 s = next; in free_list()
345 newnode->next = NULL; in mk_node()
358 for (n2 = n; n2->next; n2 = n2->next) in concat_list()
360 n2->next = start; in concat_list()
386 for (start = start->next; start != end; start = start->next) { in copy_list_range()
387 n->next = copy_node(start); in copy_list_range()
388 n = n->next; in copy_list_range()
[all …]
Dparse.y30 *p = node->next; in remove_node()
57 r->next = (*keyw)->next; *body = r; (*keyw)->next = NULL; in record_compound()
140 struct string_list *decl = (*$3)->next;
141 (*$3)->next = NULL;
410 { remove_list($2, &(*$1)->next); $$ = $2; }
Dlex.l102 next_node->next = cur_node; \
135 next_node->next = NULL;
466 yylval = &next_node->next;
Dgenksyms.h27 struct string_list *next; member
/scripts/dtc/
Dsrcpos.c15 struct search_path *next; /* next node in list, NULL for end */ member
140 for (node = search_path_head; !*fp && node; node = node->next) in fopen_any_on_path()
221 node->next = NULL; in srcfile_add_search_path()
229 search_path_tail = &node->next; in srcfile_add_search_path()
263 assert(pos->next == NULL); in srcpos_copy()
281 for (p = pos; p->next != NULL; p = p->next); in srcpos_extend()
282 p->next = newtail; in srcpos_extend()
351 if (pos->next != NULL) { in srcpos_string_comment()
352 rest = srcpos_string_comment(pos->next, first_line, level); in srcpos_string_comment()
Dtreesource.c135 m = m->next; in next_type_marker()
141 struct marker *next = next_type_marker(m->next); in type_marker_length() local
143 if (next) in type_marker_length()
144 return next->offset - m->offset; in type_marker_length()
222 dummy_marker.next = prop->val.markers; in write_propval()
229 size_t chunk_len = (m->next ? m->next->offset : len) - m->offset; in write_propval()
334 for (re = dti->reservelist; re; re = re->next) { in dt_to_source()
Dlivetree.c27 new->next = *labels; in add_label()
67 assert(first->next == NULL); in chain_property()
69 first->next = list; in chain_property()
77 struct property *next; in reverse_properties() local
80 next = p->next; in reverse_properties()
81 p->next = head; in reverse_properties()
83 p = next; in reverse_properties()
159 new_node->proplist = new_prop->next; in merge_nodes()
160 new_prop->next = NULL; in merge_nodes()
270 prop->next = NULL; in add_property()
[all …]
Ddtc.h79 struct marker *next; member
92 for (; (m); (m) = (m)->next)
132 struct label *next; member
144 struct property *next; member
173 for ((l) = (l0); (l); (l) = (l)->next)
180 for ((p) = (n)->proplist; (p); (p) = (p)->next)
244 struct reserve_info *next; member
Dsrcpos.h63 struct srcpos *next; member
83 (Current).next = NULL; \
Ddata.c14 nm = m->next; in data_free()
124 m = m->next; in data_insert_at_marker()
136 mp = &((*mp)->next); in data_append_markers()
235 m->next = NULL; in data_add_marker()
/scripts/gcc-plugins/
Dstackleak_plugin.c193 rtx_insn *insn, *next; in stackleak_cleanup_execute() local
212 for (insn = get_insns(); insn; insn = next) { in stackleak_cleanup_execute()
215 next = NEXT_INSN(insn); in stackleak_cleanup_execute()
253 if (GET_CODE(next) == NOTE && in stackleak_cleanup_execute()
254 NOTE_KIND(next) == NOTE_INSN_CALL_ARG_LOCATION) { in stackleak_cleanup_execute()
255 insn = next; in stackleak_cleanup_execute()
256 next = NEXT_INSN(insn); in stackleak_cleanup_execute()
/scripts/kconfig/lxdialog/
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)
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/
Dfixdep.c165 struct item *next; member
191 for (aux = hashtab[hash % HASHSZ]; aux; aux = aux->next) { in is_defined_config()
213 aux->next = hashtab[hash % HASHSZ]; in define_config()
/scripts/mod/
Dmodpost.h113 struct namespace_list *next; member
118 struct module *next; member
Dmodpost.c129 for (mod = modules; mod; mod = mod->next) in find_module()
156 mod->next = modules; in new_module()
168 struct symbol *next; member
203 struct symbol *next) in alloc_symbol() argument
210 s->next = next; in alloc_symbol()
237 for (s = symbolhash[tdb_hash(name) % SYMBOL_HASH_SIZE]; s; s = s->next) { in find_symbol()
249 for (ns_entry = list; ns_entry != NULL; ns_entry = ns_entry->next) in contains_namespace()
264 ns_entry->next = *list; in add_namespace()
2205 for (s = mod->unres; s; s = s->next) { in check_exports()
2319 for (s = mod->unres; s; s = s->next) { in add_versions()
[all …]
/scripts/
Dasn1_compiler.c292 struct action *next; member
687 struct element *next; member
1098 ppaction = &(*ppaction)->next in parse_type()
1107 action->next = *ppaction; in parse_type()
1113 action->next = NULL; in parse_type()
1182 child_p = &element->next; in parse_compound()
1246 for (c = e->children; c; c = c->next) in dump_element()
1328 for (action = action_list; action; action = action->next) { in render()
1338 for (action = action_list; action; action = action->next) in render()
1347 for (action = action_list; action; action = action->next) in render()
[all …]

12