/device/linaro/bootloader/edk2/AppPkg/Applications/Lua/src/ |
lundump.c | 139 f->upvalues=luaM_newvector(S->L,n,Upvaldesc); 141 for (i=0; i<n; i++) f->upvalues[i].name=NULL; 144 f->upvalues[i].instack=LoadByte(S); 145 f->upvalues[i].idx=LoadByte(S); 168 for (i=0; i<n; i++) f->upvalues[i].name=LoadString(S);
|
ldump.c | 115 DumpChar(f->upvalues[i].instack,D); 116 DumpChar(f->upvalues[i].idx,D); 136 for (i=0; i<n; i++) DumpString(f->upvalues[i].name,D);
|
luac.c | 149 if (f->p[i]->sizeupvalues>0) f->p[i]->upvalues[0].instack=0; 274 #define UPVALNAME(x) ((f->upvalues[x].name) ? getstr(f->upvalues[x].name) : "-") 417 printf("upvalues (%d) for %p:\n",n,VOID(f)); 421 i,UPVALNAME(i),f->upvalues[i].instack,f->upvalues[i].idx);
|
lfunc.c | 121 f->upvalues = NULL; 141 luaM_freearray(L, f->upvalues, f->sizeupvalues);
|
lparser.c | 223 Upvaldesc *up = fs->f->upvalues; 234 checklimit(fs, fs->nups + 1, MAXUPVAL, "upvalues"); 235 luaM_growvector(fs->ls->L, f->upvalues, fs->nups, f->sizeupvalues, 236 Upvaldesc, MAXUPVAL, "upvalues"); 237 while (oldsize < f->sizeupvalues) f->upvalues[oldsize++].name = NULL; 238 f->upvalues[fs->nups].instack = (v->k == VLOCAL); 239 f->upvalues[fs->nups].idx = cast_byte(v->u.info); 240 f->upvalues[fs->nups].name = name; 282 else { /* not found as local at current level; try upvalues */ 283 int idx = searchupvalue(fs, n); /* try existing upvalues */ [all...] |
ldebug.c | 101 TString *s = check_exp(uv < p->sizeupvalues, p->upvalues[uv].name);
|
lobject.h | 474 Upvaldesc *upvalues; /* upvalue information */ member in struct:Proto 477 int sizeupvalues; /* size of 'upvalues' */ 494 ** Lua Upvalues 519 TValue upvalue[1]; /* list of upvalues */ 526 UpVal *upvals[1]; /* list of upvalues */
|
lvm.c | 376 ** whether there is a cached closure with the same upvalues needed by 383 Upvaldesc *uv = p->upvalues; 385 for (i = 0; i < nup; i++) { /* check whether it has right upvalues */ 397 ** its upvalues. Note that the call to 'luaC_barrierproto' must come 404 Upvaldesc *uv = p->upvalues; 409 for (i = 0; i < nup; i++) { /* fill in its upvalues */ 738 /* close all upvalues from previous call */
|
lgc.c | 192 lua_assert(!isblack(o)); /* open upvalues are never black */ 238 ** mark an object. Userdata, strings, and closed upvalues are visited 241 ** upvalues are already linked in 'headuv' list.) 263 return; /* open upvalues remain gray */ 321 ** mark all values stored in marked open upvalues. (See comment in 465 markobject(g, f->upvalues[i].name); 481 for (i = 0; i < cl->nupvalues; i++) /* mark its upvalues */ 489 for (i = 0; i < cl->nupvalues; i++) /* mark its upvalues */ 695 ** sweep the (open) upvalues of a thread and resize its stack and 700 sweepwholelist(L, &L1->openupval); /* sweep open upvalues */ [all...] |
lapi.c | 69 else { /* upvalues */ 73 return NONVALIDVALUE; /* it has no upvalues */ 1208 name = p->upvalues[n-1].name;
|
/external/lua/src/ |
lundump.c | 169 f->upvalues = luaM_newvector(S->L, n, Upvaldesc); 172 f->upvalues[i].name = NULL; 174 f->upvalues[i].instack = LoadByte(S); 175 f->upvalues[i].idx = LoadByte(S); 198 f->upvalues[i].name = LoadString(S);
|
ldump.c | 141 DumpByte(f->upvalues[i].instack, D); 142 DumpByte(f->upvalues[i].idx, D); 162 DumpString(f->upvalues[i].name, D);
|
luac.c | 152 if (f->p[i]->sizeupvalues>0) f->p[i]->upvalues[0].instack=0; 285 #define UPVALNAME(x) ((f->upvalues[x].name) ? getstr(f->upvalues[x].name) : "-") 435 printf("upvalues (%d) for %p:\n",n,VOID(f)); 439 i,UPVALNAME(i),f->upvalues[i].instack,f->upvalues[i].idx);
|
lfunc.c | 43 ** fill a closure with new closed upvalues 71 uv->u.open.next = *pp; /* link it to list of open upvalues */ 75 if (!isintwups(L)) { /* thread not in list of threads with upvalues? */ 111 f->upvalues = NULL; 131 luaM_freearray(L, f->upvalues, f->sizeupvalues);
|
lparser.c | 220 Upvaldesc *up = fs->f->upvalues; 231 checklimit(fs, fs->nups + 1, MAXUPVAL, "upvalues"); 232 luaM_growvector(fs->ls->L, f->upvalues, fs->nups, f->sizeupvalues, 233 Upvaldesc, MAXUPVAL, "upvalues"); 235 f->upvalues[oldsize++].name = NULL; 236 f->upvalues[fs->nups].instack = (v->k == VLOCAL); 237 f->upvalues[fs->nups].idx = cast_byte(v->u.info); 238 f->upvalues[fs->nups].name = name; 280 else { /* not found as local at current level; try upvalues */ 281 int idx = searchupvalue(fs, n); /* try existing upvalues */ [all...] |
lobject.h | 412 int sizeupvalues; /* size of 'upvalues' */ 425 Upvaldesc *upvalues; /* upvalue information */ member in struct:Proto 434 ** Lua Upvalues 449 TValue upvalue[1]; /* list of upvalues */ 456 UpVal *upvals[1]; /* list of upvalues */
|
lvm.c | 607 ** whether there is a cached closure with the same upvalues needed by 614 Upvaldesc *uv = p->upvalues; 616 for (i = 0; i < nup; i++) { /* check whether it has right upvalues */ 628 ** its upvalues. Note that the closure is not cached if prototype is 635 Upvaldesc *uv = p->upvalues; 640 for (i = 0; i < nup; i++) { /* fill in its upvalues */ [all...] |
ldebug.c | 128 TString *s = check_exp(uv < p->sizeupvalues, p->upvalues[uv].name); 555 ** upvalues.)
|
lgc.c | 180 ** barrier for assignments to closed upvalues. Because upvalues are 230 ** mark an object. Userdata, strings, and closed upvalues are visited 233 ** upvalues are already linked in 'headuv' list.) 307 ** Mark all values stored in marked open upvalues from non-marked threads. 309 ** thread.) Remove from the list threads that no longer have upvalues and 318 p = &thread->twups; /* keep marked thread with upvalues in the list */ 319 else { /* thread is not marked or without upvalues */ 487 markobjectN(g, f->upvalues[i].name); 503 for (i = 0; i < cl->nupvalues; i++) /* mark its upvalues */ [all...] |
lapi.c | 74 else { /* upvalues */ 78 return NONVALIDVALUE; /* it has no upvalues */ 1214 name = p->upvalues[n-1].name;
|
/external/bcc/src/lua/bpf/ |
bpf.lua | [all...] |