next              242 host/buildvm_asm.c     int32_t next = ctx->sym[i+1].ofs;
next              253 host/buildvm_asm.c     emit_asm_label(ctx, ctx->sym[i].name, next - ofs, 1);
next              254 host/buildvm_asm.c     while (rel < ctx->nreloc && ctx->reloc[rel].ofs <= next) {
next              272 host/buildvm_asm.c     emit_asm_bytes(ctx, ctx->code+ofs, next-ofs);
next              274 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              432 lj_alloc.c       struct malloc_segment *next;   /* ptr to next segment */
next              496 lj_alloc.c         if ((sp = sp->next) == 0)
next              508 lj_alloc.c         if ((sp = sp->next) == 0)
next              877 lj_alloc.c       m->seg.next = ss;
next              929 lj_alloc.c           sp = sp->next;
next              936 lj_alloc.c     	sp = sp->next;
next              968 lj_alloc.c       msegmentptr sp = pred->next;
next              972 lj_alloc.c         msegmentptr next = sp->next;
next              990 lj_alloc.c     	  sp->next = next;
next              997 lj_alloc.c         sp = next;
next             1175 lj_alloc.c         sp = sp->next;
next             1269 lj_alloc.c         mchunkptr next = chunk_plus_offset(p, psize);
next             1284 lj_alloc.c     	} else if ((next->head & INUSE_BITS) == INUSE_BITS) {
next             1286 lj_alloc.c     	  set_free_with_pinuse(p, psize, next);
next             1291 lj_alloc.c         if (!cinuse(next)) {  /* consolidate forward */
next             1292 lj_alloc.c           if (next == fm->top) {
next             1303 lj_alloc.c           } else if (next == fm->dv) {
next             1309 lj_alloc.c     	size_t nsize = chunksize(next);
next             1311 lj_alloc.c     	unlink_chunk(fm, next, nsize);
next             1319 lj_alloc.c           set_free_with_pinuse(p, psize, next);
next             1342 lj_alloc.c         mchunkptr next = chunk_plus_offset(oldp, oldsize);
next             1358 lj_alloc.c         } else if (next == m->top && oldsize + m->topsize > nb) {
next              849 lj_asm_arm.h     emit_lso(as, ARMI_LDR, dest, dest, (int32_t)offsetof(Node, next));
next              664 lj_asm_mips.h    emit_tsi(as, MIPSI_LW, tmp1, dest, (int32_t)offsetof(Node, next));
next              667 lj_asm_ppc.h     emit_tai(as, PPCI_LWZ, dest, dest, (int32_t)offsetof(Node, next));
next             1020 lj_asm_x86.h     emit_rmro(as, XO_MOV, dest, dest, offsetof(Node, next));
next              755 lj_cparse.c      decl->stack[top].next = decl->stack[decl->pos].next;
next              756 lj_cparse.c      decl->stack[decl->pos].next = (CTypeID1)top;
next              839 lj_cparse.c        idx = ct->next;
next              861 lj_cparse.c    	idx = ctn->next;  /* Skip attribute. */
next              913 lj_cparse.c    	    idx = ctn->next;  /* Skip attribute. */
next              953 lj_cparse.c      decl->stack[decl->specpos].next = 0;
next             1477 lj_cparse.c      decl->stack[0].next = 0;
next              171 lj_ctype.c       ct->next = 0;
next              186 lj_ctype.c         id = ct->next;
next              197 lj_ctype.c       cts->tab[id].next = cts->hash[h];
next              207 lj_ctype.c       ct->next = cts->hash[h];
next              215 lj_ctype.c       ct->next = cts->hash[h];
next              230 lj_ctype.c         id = ct->next;
next              614 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              196 lj_ir.c          MRef next;			/* Pointer to next list. */
next              206 lj_ir.c            K64Array *next = mref(k->next, K64Array);
next              208 lj_ir.c            k = next;
next              219 lj_ir.c          for (k = mref(J->k64, K64Array); k; k = mref(k->next, K64Array)) {
next              230 lj_ir.c            setmref(kn->next, NULL);
next              233 lj_ir.c              setmref(kp->next, kn);  /* Chain to the end of the list. */
next              160 lj_jit.h         MCode *next;		/* Next area. */
next               43 lj_lex.c       #define save_and_next(ls)	(save(ls, ls->current), next(ls))
next               79 lj_lex.c         next(ls);  /* skip `\n' or `\r' */
next               81 lj_lex.c           next(ls);  /* skip `\n\r' or `\r\n' */
next              174 lj_lex.c             else next(ls);
next              198 lj_lex.c             int c = next(ls);  /* Skip the '\\'. */
next              208 lj_lex.c       	c = (next(ls) & 15u) << 4;
next              213 lj_lex.c       	c += (next(ls) & 15u);
next              220 lj_lex.c       	next(ls);
next              222 lj_lex.c       	  if (currIsNewline(ls)) inclinenumber(ls); else next(ls);
next              231 lj_lex.c       	if (lj_char_isdigit(next(ls))) {
next              233 lj_lex.c       	  if (lj_char_isdigit(next(ls))) {
next              239 lj_lex.c       	    next(ls);
next              246 lj_lex.c             next(ls);
next              289 lj_lex.c             next(ls);
next              292 lj_lex.c             next(ls);
next              295 lj_lex.c             next(ls);
next              307 lj_lex.c       	next(ls);
next              322 lj_lex.c             next(ls);
next              323 lj_lex.c             if (ls->current != '=') return '='; else { next(ls); return TK_eq; }
next              325 lj_lex.c             next(ls);
next              326 lj_lex.c             if (ls->current != '=') return '<'; else { next(ls); return TK_le; }
next              328 lj_lex.c             next(ls);
next              329 lj_lex.c             if (ls->current != '=') return '>'; else { next(ls); return TK_ge; }
next              331 lj_lex.c             next(ls);
next              332 lj_lex.c             if (ls->current != '=') return '~'; else { next(ls); return TK_ne; }
next              334 lj_lex.c             next(ls);
next              335 lj_lex.c             if (ls->current != ':') return ':'; else { next(ls); return TK_label; }
next              343 lj_lex.c       	next(ls);
next              345 lj_lex.c       	  next(ls);
next              359 lj_lex.c             next(ls);
next              386 lj_lex.c         next(ls);  /* Read-ahead first char. */
next              391 lj_lex.c           next(ls);
next              396 lj_lex.c             next(ls);
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              354 lj_obj.h             GCRef next;
next              362 lj_obj.h       #define uvnext(uv_)	(&gcref((uv_)->next)->uv)
next              404 lj_obj.h         MRef next;		/* Hash chain. */
next              425 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              329 lj_parse.c         BCPos next;
next              330 lj_parse.c         while ((next = jmp_next(fs, list)) != NO_JMP)  /* Find last element. */
next              331 lj_parse.c           list = next;
next              341 lj_parse.c         BCPos next = jmp_next(fs, list);
next              346 lj_parse.c         list = next;
next             1182 lj_parse.c         BCPos next = jmp_next(fs, pc);
next             1183 lj_parse.c         if (next != NO_JMP) jmp_patch(fs, next, pc);  /* Jump to UCLO. */
next              200 lj_state.c       setgcref(g->uvhead.next, obj2gco(&g->uvhead));
next               81 lj_str.c             GCobj *next = gcnext(p);
next               85 lj_str.c             p = next;
next               80 lj_tab.c           setmref(n->next, NULL);
next              192 lj_tab.c             Node *next = nextnode(kn);
next              195 lj_tab.c             setmref(n->next, next == NULL? next : (Node *)((char *)next + d));
next              443 lj_tab.c             while (noderef(collide->next) != n)  /* Find predecessor. */
next              445 lj_tab.c             setmref(collide->next, freenode);  /* Relink chain. */
next              449 lj_tab.c             freenode->next = n->next;
next              450 lj_tab.c             setmref(n->next, NULL);
next              457 lj_tab.c       	  freenode->next = nn->next;
next              458 lj_tab.c       	  nn->next = n->next;
next              459 lj_tab.c       	  setmref(n->next, nn);
next              465 lj_tab.c             setmrefr(freenode->next, n->next);  /* Insert into chain. */
next              466 lj_tab.c             setmref(n->next, freenode);