Home
last modified time | relevance | path

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

12

/scripts/include/
A Dlist.h53 list->next = list; in INIT_LIST_HEAD()
67 next->prev = new; in __list_add()
68 new->next = next; in __list_add()
70 prev->next = new; in __list_add()
108 next->prev = prev; in __list_del()
109 prev->next = next; in __list_del()
140 new->next = old->next; in list_replace()
324 h->next = NULL; in INIT_HLIST_NODE()
343 struct hlist_node *next = n->next; in __hlist_del() local
346 *pprev = next; in __hlist_del()
[all …]
A Dlist_types.h6 struct list_head *next, *prev; member
14 struct hlist_node *next, **pprev; member
/scripts/kconfig/
A Dmenu.c39 return menu->next; in menu_next()
416 for (menu = parent->next; menu; menu = menu->next) { in _menu_finalize()
423 goto next; in _menu_finalize()
443 next: in _menu_finalize()
450 parent->next = last_menu->next; in _menu_finalize()
451 last_menu->next = NULL; in _menu_finalize()
488 if (!last_menu->next) in _menu_finalize()
491 last_menu->next = menu->next; in _menu_finalize()
842 if (menu->next) in menu_dump()
857 menu = menu->next; in menu_dump()
[all …]
A Dexpr.h188 struct property *next; /* next property - null if last */ member
201 for (st = sym->prop; st; st = st->next) \
205 for (st = sym->prop; st; st = st->next) \
229 struct menu *next; member
A Dmconf.c320 tmp = pos->next; in set_subtitle()
328 pos->next = xcalloc(1, sizeof(*pos)); in set_subtitle()
329 pos = pos->next; in set_subtitle()
345 tmp = pos->next; in reset_subtitle()
522 for (child = menu->list; child; child = child->next) { in build_conf()
593 for (child = menu->list; child; child = child->next) in build_conf()
611 for (child = menu->list; child; child = child->next) { in conf_choice()
A Dparser.y497 for (prop = menu->sym->prop; prop; prop = prop->next) {
657 for (prop = sym->prop; prop; prop = prop->next) { in print_symbol()
746 else if (menu->next) in zconfdump()
747 menu = menu->next; in zconfdump()
751 if (menu->next) { in zconfdump()
752 menu = menu->next; in zconfdump()
A Dconf.c436 for (child = menu->list; child; child = child->next) { in conf_choice()
492 for (child = menu->list; child; child = child->next) { in conf_choice()
568 for (child = menu->list; child; child = child->next) in conf()
603 for (child = menu->list; child; child = child->next) in check_conf()
A Dconfdata.c852 goto next; in conf_write()
863 goto next; in conf_write()
872 next: in conf_write()
885 if (menu->next) { in conf_write()
886 menu = menu->next; in conf_write()
A Dsymbol.c1065 struct dep_stack *prev, *next; member
1075 check_top->next = stack; in dep_stack_insert()
1085 check_top->next = NULL; in dep_stack_remove()
1115 for (; stack; stack = stack->next) { in sym_check_print_recursive()
1117 next_sym = stack->next ? stack->next->sym : last_sym; in sym_check_print_recursive()
1221 for (prop = sym->prop; prop; prop = prop->next) { in sym_check_sym_deps()
/scripts/genksyms/
A Dgenksyms.c336 struct string_list *next = s->next; in free_list() local
338 s = next; in free_list()
349 newnode->next = NULL; in mk_node()
362 for (n2 = n; n2->next; n2 = n2->next) in concat_list()
364 n2->next = start; in concat_list()
390 for (start = start->next; start != end; start = start->next) { in copy_list_range()
392 n = n->next; in copy_list_range()
394 n->next = NULL; in copy_list_range()
403 a = a->next; in equal_list()
404 b = b->next; in equal_list()
[all …]
A Dparse.y31 *p = node->next; in remove_node()
58 r->next = (*keyw)->next; *body = r; (*keyw)->next = NULL; in record_compound()
146 struct string_list *decl = (*$3)->next;
147 (*$3)->next = NULL;
440 { remove_list($2, &(*$1)->next); $$ = $2; }
A Dlex.l104 next_node->next = cur_node; \
142 next_node->next = NULL;
446 yylval = &next_node->next;
A Dgenksyms.h30 struct string_list *next; member
/scripts/dtc/
A Dsrcpos.c17 struct search_path *next; /* next node in list, NULL for end */ member
142 for (node = search_path_head; !*fp && node; node = node->next) in fopen_any_on_path()
223 node->next = NULL; in srcfile_add_search_path()
231 search_path_tail = &node->next; in srcfile_add_search_path()
265 assert(pos->next == NULL); in srcpos_copy()
283 for (p = pos; p->next != NULL; p = p->next); in srcpos_extend()
284 p->next = newtail; in srcpos_extend()
353 if (pos->next != NULL) { in srcpos_string_comment()
354 rest = srcpos_string_comment(pos->next, first_line, level); in srcpos_string_comment()
A Ddtc.h131 struct marker *next; member
144 for (; (m); (m) = (m)->next)
159 struct marker *next = next_type_marker(m->next); in type_marker_length() local
161 if (next) in type_marker_length()
162 return next->offset - m->offset; in type_marker_length()
199 struct label *next; member
211 struct property *next; member
240 for ((l) = (l0); (l); (l) = (l)->next)
247 for ((p) = (n)->proplist; (p); (p) = (p)->next)
311 struct reserve_info *next; member
A Dlivetree.c27 new->next = *labels; in add_label()
69 first->next = list; in chain_property()
80 next = p->next; in reverse_properties()
81 p->next = head; in reverse_properties()
83 p = next; in reverse_properties()
271 prop->next = NULL; in add_property()
275 p = &((*p)->next); in add_property()
289 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 Dtreesource.c154 m->next = NULL; in add_string_markers()
159 nextp = &((*nextp)->next); in add_string_markers()
225 dummy_marker.next = prop->val.markers; in write_propval()
232 size_t chunk_len = (m->next ? m->next->offset : len) - m->offset; in write_propval()
352 for (re = dti->reservelist; re; re = re->next) { in dt_to_source()
A Dsrcpos.h63 struct srcpos *next; member
83 (Current).next = NULL; \
A 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/
A Dstackleak_plugin.c270 rtx_insn *insn, *next; in remove_stack_tracking_gcall() local
283 for (insn = get_insns(); insn; insn = next) { in remove_stack_tracking_gcall()
286 next = NEXT_INSN(insn); in remove_stack_tracking_gcall()
324 if (GET_CODE(next) == NOTE && in remove_stack_tracking_gcall()
325 NOTE_KIND(next) == NOTE_INSN_CALL_ARG_LOCATION) { in remove_stack_tracking_gcall()
326 insn = next; in remove_stack_tracking_gcall()
327 next = NEXT_INSN(insn); in remove_stack_tracking_gcall()
337 rtx_insn *insn, *next; in remove_stack_tracking_gasm() local
353 for (insn = get_insns(); insn; insn = next) { in remove_stack_tracking_gasm()
356 next = NEXT_INSN(insn); in remove_stack_tracking_gasm()
/scripts/kconfig/lxdialog/
A Ddialog.h75 struct subtitle_list *next; member
143 struct dialog_list *next; member
158 item_cur && (item_cur != &item_nil); item_cur = item_cur->next)
A Dutil.c231 for (pos = dlg.subtitles; pos != NULL; pos = pos->next) { in dialog_clear()
243 for (pos = dlg.subtitles; pos != NULL; pos = pos->next) { in dialog_clear()
555 struct dialog_list *p, *next; in item_reset() local
557 for (p = item_head; p; p = next) { in item_reset()
558 next = p->next; in item_reset()
571 item_cur->next = p; in item_make()
633 for (p = item_head; p; p = p->next) in item_count()
651 for (p = item_head; p; p = p->next) { in item_n()
/scripts/basic/
A Dfixdep.c111 struct item *next; member
142 aux->next = hashtab[hash % HASHSZ]; in add_to_hashtable()
155 for (aux = hashtab[hash % HASHSZ]; aux; aux = aux->next) { in in_hashtable()
/scripts/
A 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()
1338 for (action = action_list; action; action = action->next) in render()
1406 for (ce = e->children; ce; ce = ce->next) in render_out_of_line_list()
1549 for (ec = e->children; ec; ec = ec->next) in render_element()
[all …]
/scripts/coccinelle/iterators/
A Dlist_entry_update.cocci3 /// the list to the next, so it is usually not a good idea to reassign it.

Completed in 858 milliseconds

12