next 28 core/action_stack.c struct _action_stack* next; // next action stack next 52 core/action_stack.c p = p->next; next 74 core/action_stack.c free_stacks = free_stacks->next; next 84 core/action_stack.c stack->next = action_stacks; next 114 core/action_stack.c action_stacks = action_stacks->next; next 119 core/action_stack.c while (prev && (prev->next != p)) next 121 core/action_stack.c prev = prev->next; next 125 core/action_stack.c prev->next = prev->next->next; next 137 core/action_stack.c p->next = free_stacks; next 153 core/action_stack.c p = p->next; next 473 core/action_stack.c action_stack_t *next = active_stack->next; next 478 core/action_stack.c active_stack = next; next 51 core/gui_script.c p = p->next; next 63 core/gui_script.c tail->next = p; next 413 core/gui_script.c p = p->next; next 659 core/gui_script.c p = p->next; next 700 core/gui_script.c p = p->next; next 720 core/gui_script.c p = p->next; next 905 core/gui_script.c for (i=f, p=script_params; p; i++, p=p->next) next 388 core/raw.c struct point *next; next 395 core/raw.c pixel=(*pixel).next; next 421 core/raw.c (*pixel).next=pixel_list; next 310 core/script.c p = p->next; next 34 core/suba.c struct _cell* next; // link to next cell in free list next 93 core/suba.c printf("%x %d %x, ", c, c->h.size, c->next); next 94 core/suba.c c = c->next; next 96 core/suba.c printf("%x %d %x\n", c, c->h.size, c->next); next 112 core/suba.c c = check_cell(suba, c->next, "suba_getmeminfo", __LINE__); next 157 core/suba.c sprintf(buf, "%x %d %x\n", c, c->h.size, c->next); next 159 core/suba.c c = c->next; next 161 core/suba.c sprintf(buf, "%x %d %x\n", c, c->h.size, c->next); next 177 core/suba.c c = check_cell(suba, c->next, "check_stats", __LINE__); next 219 core/suba.c c = check_cell(suba, c->next, "suba_getmeminfo", __LINE__); next 282 core/suba.c c2->next = 0; next 285 core/suba.c c1->next = c2; next 300 core/suba.c suba->head.next = c1; next 319 core/suba.c this_cell = check_cell(suba, prev_cell->next, "suba_alloc", __LINE__); next 322 core/suba.c this_cell = check_cell(suba, this_cell->next, "suba_alloc", __LINE__); next 339 core/suba.c prev_cell->next = this_cell->next; next 397 core/suba.c while (prev_cell->next < this_cell) { next 398 core/suba.c prev_cell = check_cell(suba, prev_cell->next, "suba_free", __LINE__); next 400 core/suba.c cell* next_cell = check_cell(suba, prev_cell->next, "suba_free", __LINE__); next 408 core/suba.c this_cell->next = prev_cell->next; next 409 core/suba.c prev_cell->next = this_cell; next 416 core/suba.c this_cell->next = next_cell->next; next 38 include/script.h struct _sc_param* next; // Next parameter in linked list next 153 lib/lua/lcode.c int next = getjump(fs, list); next 158 lib/lua/lcode.c list = next; next 191 lib/lua/lcode.c int next; next 192 lib/lua/lcode.c while ((next = getjump(fs, list)) != NO_JUMP) /* find last element */ next 193 lib/lua/lcode.c list = next; next 130 lib/lua/ldo.c for (up = L->openupval; up != NULL; up = up->gch.next) next 65 lib/lua/lfunc.c pp = &p->next; next 71 lib/lua/lfunc.c uv->next = *pp; /* chain it in the proper position */ next 74 lib/lua/lfunc.c uv->u.l.next = g->uvhead.u.l.next; next 75 lib/lua/lfunc.c uv->u.l.next->u.l.prev = uv; next 76 lib/lua/lfunc.c g->uvhead.u.l.next = uv; next 77 lib/lua/lfunc.c lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); next 83 lib/lua/lfunc.c lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); next 84 lib/lua/lfunc.c uv->u.l.next->u.l.prev = uv->u.l.prev; /* remove from `uvhead' list */ next 85 lib/lua/lfunc.c uv->u.l.prev->u.l.next = uv->u.l.next; next 102 lib/lua/lfunc.c L->openupval = uv->next; /* remove from `open' list */ next 119 lib/lua/lgc.c u = u->gch.next; next 131 lib/lua/lgc.c GCObject **p = &g->mainthread->next; next 135 lib/lua/lgc.c p = &curr->gch.next; /* don't bother with them */ next 138 lib/lua/lgc.c p = &curr->gch.next; next 143 lib/lua/lgc.c *p = curr->gch.next; next 146 lib/lua/lgc.c g->tmudata = curr->gch.next = curr; /* creates a circular list */ next 148 lib/lua/lgc.c curr->gch.next = g->tmudata->gch.next; next 149 lib/lua/lgc.c g->tmudata->gch.next = curr; next 417 lib/lua/lgc.c p = &curr->gch.next; next 421 lib/lua/lgc.c *p = curr->gch.next; next 423 lib/lua/lgc.c g->rootgc = curr->gch.next; /* adjust first */ next 447 lib/lua/lgc.c GCObject *o = g->tmudata->gch.next; /* get first element */ next 454 lib/lua/lgc.c g->tmudata->gch.next = udata->uv.next; next 455 lib/lua/lgc.c udata->uv.next = g->mainthread->next; /* return it to `root' list */ next 456 lib/lua/lgc.c g->mainthread->next = o; next 517 lib/lua/lgc.c for (uv = g->uvhead.u.l.next; uv != &g->uvhead; uv = uv->u.l.next) { next 518 lib/lua/lgc.c lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); next 687 lib/lua/lgc.c o->gch.next = g->rootgc; next 697 lib/lua/lgc.c o->gch.next = g->rootgc; /* link upvalue into `rootgc' list */ next 48 lib/lua/llex.c #define save_and_next(ls) (save(ls, ls->current), next(ls)) next 132 lib/lua/llex.c next(ls); /* skip `\n' or `\r' */ next 134 lib/lua/llex.c next(ls); /* skip `\n\r' or `\r\n' */ next 150 lib/lua/llex.c next(ls); /* read first char */ next 272 lib/lua/llex.c else next(ls); next 295 lib/lua/llex.c next(ls); /* do not save the `\' */ next 315 lib/lua/llex.c next(ls); next 325 lib/lua/llex.c next(ls); next 348 lib/lua/llex.c next(ls); next 351 lib/lua/llex.c next(ls); next 363 lib/lua/llex.c next(ls); next 376 lib/lua/llex.c next(ls); next 378 lib/lua/llex.c else { next(ls); return TK_EQ; } next 381 lib/lua/llex.c next(ls); next 383 lib/lua/llex.c else { next(ls); return TK_LE; } next 386 lib/lua/llex.c next(ls); next 388 lib/lua/llex.c else { next(ls); return TK_GE; } next 391 lib/lua/llex.c next(ls); next 393 lib/lua/llex.c else { next(ls); return TK_NE; } next 419 lib/lua/llex.c next(ls); next 443 lib/lua/llex.c next(ls); next 43 lib/lua/lobject.h #define CommonHeader GCObject *next; lu_byte tt; lu_byte marked next 281 lib/lua/lobject.h struct UpVal *next; next 326 lib/lua/lobject.h struct Node *next; /* for chaining */ next 151 lib/lua/lstate.c L->next = NULL; next 161 lib/lua/lstate.c g->uvhead.u.l.next = &g->uvhead; next 35 lib/lua/lstring.c GCObject *next = p->gch.next; /* save next */ next 39 lib/lua/lstring.c p->gch.next = newhash[h1]; /* chain it */ next 41 lib/lua/lstring.c p = next; next 66 lib/lua/lstring.c ts->tsv.next = tb->hash[h]; /* chain new entry */ next 84 lib/lua/lstring.c o = o->gch.next) { next 107 lib/lua/lstring.c u->uv.next = G(L)->mainthread->next; next 108 lib/lua/lstring.c G(L)->mainthread->next = obj2gco(u); next 16 lib/lua/ltable.h #define gnext(n) ((n)->i_key.nk.next) next 73 modules/gui_fselect.c struct _fitem *prev, *next; // Linked list of items in directory next 175 modules/gui_fselect.c ptr = ptr->next; next 199 modules/gui_fselect.c p->next = 0; next 202 modules/gui_fselect.c list->tail->next = p; next 264 modules/gui_fselect.c ptr = ptr->next; next 275 modules/gui_fselect.c sbuf[i]->next = sbuf[i+1]; next 279 modules/gui_fselect.c list->tail->next = 0; next 598 modules/gui_fselect.c if (selected->next) next 600 modules/gui_fselect.c selected = selected->next; // next line next 601 modules/gui_fselect.c if (((selected->n - top->n) == (BODY_LINES - 1)) && selected->next) next 602 modules/gui_fselect.c top = top->next; next 729 modules/gui_fselect.c p = p->next; next 775 modules/gui_fselect.c for (i=0, ptr=top; i<BODY_LINES && ptr; ++i, ptr=ptr->next, off_body_y += FONT_HEIGHT) next 1033 modules/gui_fselect.c for (ptr=items.head; ptr; ptr=ptr->next) next 1042 modules/gui_fselect.c for (ptr2=items.head; ptr2; ptr2=ptr2->next) next 1104 modules/gui_fselect.c for (ptr=items.head; ptr; ptr=ptr->next) next 1125 modules/gui_fselect.c for (ptr=marked_items.head; ptr; ptr=ptr->next) next 1160 modules/gui_fselect.c for (ptr=items.head; ptr; ptr=ptr->next) next 1191 modules/gui_fselect.c for (ptr=items.head; ptr; ptr=ptr->next) next 1227 modules/gui_fselect.c for (ptr=items.head; ptr; ptr=ptr->next) next 1241 modules/gui_fselect.c for (ptr=items.head; ptr; ptr=ptr->next) next 1258 modules/gui_fselect.c for (ptr=items.head; ptr; ptr=ptr->next) next 1275 modules/gui_fselect.c for (ptr=items.head, i=0; ptr; ptr=ptr->next) next 1310 modules/gui_fselect.c for (ptr=items.head; ptr; ptr=ptr->next) next 28 modules/gui_grid.c struct _gline *next; next 42 modules/gui_grid.c head = head->next; next 58 modules/gui_grid.c if (last) last->next = p; next 243 modules/gui_grid.c for (ptr = head; ptr; ptr = ptr->next) { next 22 tools/capdis.c struct lnode *next; next 58 tools/capdis.c n = p->next; next 79 tools/capdis.c node->next = 0; next 92 tools/capdis.c node = node->next ; next 111 tools/capdis.c node->next = ls->head; next 130 tools/capdis.c l->next = p->next; next 132 tools/capdis.c ls->head = p->next; next 137 tools/capdis.c p = p->next; next 137 tools/chdk_dasm.c struct lnode *next; next 173 tools/chdk_dasm.c n = p->next; next 194 tools/chdk_dasm.c node->next = 0; next 207 tools/chdk_dasm.c node = node->next ; next 226 tools/chdk_dasm.c node->next = ls->head; next 245 tools/chdk_dasm.c l->next = p->next; next 247 tools/chdk_dasm.c ls->head = p->next; next 252 tools/chdk_dasm.c p = p->next; next 1304 tools/chdk_dasm.c lptr = lptr->next ; next 435 tools/code_gen.c struct _op *next; next 518 tools/code_gen.c op_tail->next = p; next 526 tools/code_gen.c p->next = 0; next 855 tools/code_gen.c op *n = p->next; next 884 tools/code_gen.c n = n->next; next 1219 tools/code_gen.c p = p->next; next 206 tools/elf2flt/myio.c void* next; next 280 tools/elf2flt/myio.c record.next=stoplisthead; next 299 tools/elf2flt/myio.c for ( cur = stoplisthead; cur; cur = cur->next ) { next 3160 tools/finsig_dryos.c for (br = fw->br; br != 0; br = br->next) next 3184 tools/finsig_dryos.c for (br = fw->br; br != 0; br = br->next) next 3208 tools/finsig_dryos.c for (br = fw->br; br != 0; br = br->next) next 4155 tools/finsig_dryos.c for (n = fw->br; n != 0; n = n->next) next 2073 tools/finsig_vxworks.c for (br = fw->br; br != 0; br = br->next) next 2097 tools/finsig_vxworks.c for (br = fw->br; br != 0; br = br->next) next 2121 tools/finsig_vxworks.c for (br = fw->br; br != 0; br = br->next) next 3137 tools/finsig_vxworks.c for (n = fw->br; n != 0; n = n->next) next 59 tools/firmware_load.c n->next = 0; next 66 tools/firmware_load.c fw->last->next = n; next 660 tools/firmware_load.c br = br->next; next 684 tools/firmware_load.c p = p->next; next 893 tools/firmware_load.c p = p->next; next 914 tools/firmware_load.c p = p->next; next 27 tools/firmware_load.h struct bufrange* next; next 19 tools/firmware_load_ng.c n->next = 0; next 26 tools/firmware_load_ng.c fw->last->next = n; next 90 tools/firmware_load_ng.c br = br->next; next 117 tools/firmware_load_ng.c br = br->next; next 163 tools/firmware_load_ng.c p = p->next; next 1186 tools/firmware_load_ng.c br=br->next; next 2156 tools/firmware_load_ng.c p = p->next; next 40 tools/firmware_load_ng.h struct bufrange* next; next 172 tools/ghidra_scripts/datatypes/fw_types.h controller_t *next;