next              289 host/buildvm_asm.c     int32_t next = ctx->sym[i+1].ofs;
next              300 host/buildvm_asm.c     emit_asm_label(ctx, ctx->sym[i].name, next - ofs, 1);
next              301 host/buildvm_asm.c     while (rel < ctx->nreloc && ctx->reloc[rel].ofs <= next) {
next              320 host/buildvm_asm.c     emit_asm_bytes(ctx, ctx->code+ofs, next-ofs);
next              322 host/buildvm_asm.c     emit_asm_words(ctx, ctx->code+ofs, next-ofs);
next              223 host/minilua.c GCObject*next;lu_byte tt;lu_byte marked;
next              274 host/minilua.c GCObject*next;lu_byte tt;lu_byte marked;
next              285 host/minilua.c GCObject*next;lu_byte tt;lu_byte marked;
next              292 host/minilua.c GCObject*next;lu_byte tt;lu_byte marked;
next              320 host/minilua.c GCObject*next;lu_byte tt;lu_byte marked;
next              326 host/minilua.c struct UpVal*next;
next              331 host/minilua.c GCObject*next;lu_byte tt;lu_byte marked;lu_byte isC;lu_byte nupvalues;GCObject*gclist;struct Table*env;
next              336 host/minilua.c GCObject*next;lu_byte tt;lu_byte marked;lu_byte isC;lu_byte nupvalues;GCObject*gclist;struct Table*env;
next              348 host/minilua.c struct Node*next;
next              357 host/minilua.c GCObject*next;lu_byte tt;lu_byte marked;
next              462 host/minilua.c GCObject*next;lu_byte tt;lu_byte marked;
next              767 host/minilua.c #define gnext(n)((n)->i_key.nk.next)
next              850 host/minilua.c pp=&p->next;
next              856 host/minilua.c uv->next=*pp;
next              859 host/minilua.c uv->u.l.next=g->uvhead.u.l.next;
next              860 host/minilua.c uv->u.l.next->u.l.prev=uv;
next              861 host/minilua.c g->uvhead.u.l.next=uv;
next              865 host/minilua.c uv->u.l.next->u.l.prev=uv->u.l.prev;
next              866 host/minilua.c uv->u.l.prev->u.l.next=uv->u.l.next;
next              878 host/minilua.c L->openupval=uv->next;
next             1054 host/minilua.c for(up=L->openupval;up!=NULL;up=up->gch.next)
next             1271 host/minilua.c GCObject*next=p->gch.next;
next             1274 host/minilua.c p->gch.next=newhash[h1];
next             1276 host/minilua.c p=next;
next             1299 host/minilua.c ts->tsv.next=tb->hash[h];
next             1315 host/minilua.c o=o->gch.next){
next             1334 host/minilua.c u->uv.next=G(L)->mainthread->next;
next             1335 host/minilua.c G(L)->mainthread->next=obj2gco(u);
next             1779 host/minilua.c u=u->gch.next;
next             1788 host/minilua.c GCObject**p=&g->mainthread->next;
next             1792 host/minilua.c p=&curr->gch.next;
next             1795 host/minilua.c p=&curr->gch.next;
next             1800 host/minilua.c *p=curr->gch.next;
next             1802 host/minilua.c g->tmudata=curr->gch.next=curr;
next             1804 host/minilua.c curr->gch.next=g->tmudata->gch.next;
next             1805 host/minilua.c g->tmudata->gch.next=curr;
next             2020 host/minilua.c p=&curr->gch.next;
next             2023 host/minilua.c *p=curr->gch.next;
next             2025 host/minilua.c g->rootgc=curr->gch.next;
next             2043 host/minilua.c GCObject*o=g->tmudata->gch.next;
next             2049 host/minilua.c g->tmudata->gch.next=udata->uv.next;
next             2050 host/minilua.c udata->uv.next=g->mainthread->next;
next             2051 host/minilua.c g->mainthread->next=o;
next             2097 host/minilua.c for(uv=g->uvhead.u.l.next;uv!=&g->uvhead;uv=uv->u.l.next){
next             2213 host/minilua.c o->gch.next=g->rootgc;
next             2221 host/minilua.c o->gch.next=g->rootgc;
next             2334 host/minilua.c L->next=NULL;
next             2344 host/minilua.c g->uvhead.u.l.next=&g->uvhead;
next             2671 host/minilua.c #define save_and_next(ls)(save(ls,ls->current),next(ls))
next             2733 host/minilua.c next(ls);
next             2735 host/minilua.c next(ls);
next             2749 host/minilua.c next(ls);
next             2814 host/minilua.c else next(ls);
next             2835 host/minilua.c next(ls);
next             2855 host/minilua.c next(ls);
next             2865 host/minilua.c next(ls);
next             2886 host/minilua.c next(ls);
next             2888 host/minilua.c next(ls);
next             2899 host/minilua.c next(ls);
next             2912 host/minilua.c next(ls);
next             2914 host/minilua.c else{next(ls);return TK_EQ;}
next             2917 host/minilua.c next(ls);
next             2919 host/minilua.c else{next(ls);return TK_LE;}
next             2922 host/minilua.c next(ls);
next             2924 host/minilua.c else{next(ls);return TK_GE;}
next             2927 host/minilua.c next(ls);
next             2929 host/minilua.c else{next(ls);return TK_NE;}
next             2954 host/minilua.c next(ls);
next             2977 host/minilua.c next(ls);
next             3086 host/minilua.c int next=getjump(fs,list);
next             3091 host/minilua.c list=next;
next             3115 host/minilua.c int next;
next             3116 host/minilua.c while((next=getjump(fs,list))!=(-1))
next             3117 host/minilua.c list=next;
next              525 lj_alloc.c       struct malloc_segment *next;   /* ptr to next segment */
next              589 lj_alloc.c         if ((sp = sp->next) == 0)
next              601 lj_alloc.c         if ((sp = sp->next) == 0)
next              970 lj_alloc.c       m->seg.next = ss;
next             1022 lj_alloc.c           sp = sp->next;
next             1029 lj_alloc.c     	sp = sp->next;
next             1061 lj_alloc.c       msegmentptr sp = pred->next;
next             1065 lj_alloc.c         msegmentptr next = sp->next;
next             1083 lj_alloc.c     	  sp->next = next;
next             1090 lj_alloc.c         sp = next;
next             1268 lj_alloc.c         sp = sp->next;
next             1362 lj_alloc.c         mchunkptr next = chunk_plus_offset(p, psize);
next             1377 lj_alloc.c     	} else if ((next->head & INUSE_BITS) == INUSE_BITS) {
next             1379 lj_alloc.c     	  set_free_with_pinuse(p, psize, next);
next             1384 lj_alloc.c         if (!cinuse(next)) {  /* consolidate forward */
next             1385 lj_alloc.c           if (next == fm->top) {
next             1396 lj_alloc.c           } else if (next == fm->dv) {
next             1402 lj_alloc.c     	size_t nsize = chunksize(next);
next             1404 lj_alloc.c     	unlink_chunk(fm, next, nsize);
next             1412 lj_alloc.c           set_free_with_pinuse(p, psize, next);
next             1435 lj_alloc.c         mchunkptr next = chunk_plus_offset(oldp, oldsize);
next             1451 lj_alloc.c         } else if (next == m->top && oldsize + m->topsize > nb) {
next              796 lj_asm_arm.h     emit_lso(as, ARMI_LDR, dest, dest, (int32_t)offsetof(Node, next));
next              765 lj_asm_arm64.h   emit_lso(as, A64I_LDRx, dest, dest, offsetof(Node, next));
next              938 lj_asm_mips.h    emit_tsi(as, MIPSI_AL, tmp1, dest, (int32_t)offsetof(Node, next));
next              672 lj_asm_ppc.h     emit_tai(as, PPCI_LWZ, dest, dest, (int32_t)offsetof(Node, next));
next             1136 lj_asm_x86.h     emit_rmro(as, XO_MOV, dest|REX_GC64, dest, offsetof(Node, next));
next              741 lj_cparse.c      decl->stack[top].next = decl->stack[decl->pos].next;
next              742 lj_cparse.c      decl->stack[decl->pos].next = (CTypeID1)top;
next              825 lj_cparse.c        idx = ct->next;
next              847 lj_cparse.c    	idx = ctn->next;  /* Skip attribute. */
next              899 lj_cparse.c    	    idx = ctn->next;  /* Skip attribute. */
next              939 lj_cparse.c      decl->stack[decl->specpos].next = 0;
next             1463 lj_cparse.c      decl->stack[0].next = 0;
next              175 lj_ctype.c       ct->next = 0;
next              190 lj_ctype.c         id = ct->next;
next              201 lj_ctype.c       cts->tab[id].next = cts->hash[h];
next              211 lj_ctype.c       ct->next = cts->hash[h];
next              219 lj_ctype.c       ct->next = cts->hash[h];
next              234 lj_ctype.c         id = ct->next;
next              617 lj_ctype.c           ct->next = 0;
next              147 lj_ctype.h       CTypeID1 next;	/* Next element in hash chain. */
next               31 lj_func.c        setgcrefr(uvprev(uv)->next, uv->next);
next               61 lj_func.c        setgcrefr(uv->next, g->uvhead.next);
next               63 lj_func.c        setgcref(g->uvhead.next, obj2gco(uv));
next              163 lj_jit.h         MCode *next;		/* Next area. */
next              286 lj_mcode.c       ((MCLink *)J->mcarea)->next = oldarea;
next              298 lj_mcode.c         MCode *next = ((MCLink *)mc)->next;
next              300 lj_mcode.c         mc = next;
next              353 lj_mcode.c           mc = ((MCLink *)mc)->next;
next              424 lj_obj.h             GCRef next;
next              432 lj_obj.h       #define uvnext(uv_)	(&gcref((uv_)->next)->uv)
next              474 lj_obj.h         MRef next;		/* Hash chain. */
next              500 lj_obj.h       #define nextnode(n)	(mref((n)->next, Node))
next              364 lj_opt_narrow.c   NarrowIns *next = nc->stack;  /* List of instructions from backpropagation. */
next              367 lj_opt_narrow.c   while (next < last) {  /* Simple stack machine to process the ins. list. */
next              368 lj_opt_narrow.c     NarrowIns ref = *next++;
next              379 lj_opt_narrow.c       lua_assert(next < last);
next              381 lj_opt_narrow.c 	      lj_ir_kint64(J, (int64_t)(int32_t)*next++) :
next              382 lj_opt_narrow.c 	      lj_ir_kint(J, *next++);
next              389 lj_opt_narrow.c 	if (next == last && irref_isk(narrow_ref(sp[0])) &&
next              331 lj_parse.c         BCPos next;
next              332 lj_parse.c         while ((next = jmp_next(fs, list)) != NO_JMP)  /* Find last element. */
next              333 lj_parse.c           list = next;
next              343 lj_parse.c         BCPos next = jmp_next(fs, list);
next              348 lj_parse.c         list = next;
next             1184 lj_parse.c         BCPos next = jmp_next(fs, pc);
next             1185 lj_parse.c         if (next != NO_JMP) jmp_patch(fs, next, pc);  /* Jump to UCLO. */
next              205 lj_state.c       setgcref(g->uvhead.next, obj2gco(&g->uvhead));
next              109 lj_str.c             GCobj *next = gcnext(p);
next              113 lj_str.c             p = next;
next               84 lj_tab.c           setmref(n->next, NULL);
next              212 lj_tab.c             Node *next = nextnode(kn);
next              215 lj_tab.c             setmref(n->next, next == NULL? next : (Node *)((char *)next + d));
next              477 lj_tab.c             while (noderef(collide->next) != n)  /* Find predecessor. */
next              479 lj_tab.c             setmref(collide->next, freenode);  /* Relink chain. */
next              483 lj_tab.c             freenode->next = n->next;
next              484 lj_tab.c             setmref(n->next, NULL);
next              491 lj_tab.c       	  freenode->next = nn->next;
next              492 lj_tab.c       	  nn->next = n->next;
next              493 lj_tab.c       	  setmref(n->next, nn);
next              499 lj_tab.c             setmrefr(freenode->next, n->next);  /* Insert into chain. */
next              500 lj_tab.c             setmref(n->next, freenode);