/device/linaro/bootloader/edk2/AppPkg/Applications/Lua/src/ |
ltable.c | 148 if (0 < i && i <= t->sizearray) /* is `key' inside array part? */ 159 return i + t->sizearray; 171 for (i++; i < t->sizearray; i++) { /* try first array part */ 178 for (i -= t->sizearray; i < sizenode(t); i++) { /* then hash part */ 237 if (lim > t->sizearray) { 238 lim = t->sizearray; /* adjust upper limit */ 272 luaM_reallocvector(L, t->array, t->sizearray, size, TValue); 273 for (i=t->sizearray; i<size; i++) 275 t->sizearray = size; 306 int oldasize = t->sizearray; [all...] |
lgc.c | 359 int hasclears = (h->sizearray > 0); 385 for (i = 0; i < h->sizearray; i++) { 419 for (i = 0; i < h->sizearray; i++) /* traverse array part */ 452 return sizeof(Table) + sizeof(TValue) * h->sizearray + 648 for (i = 0; i < h->sizearray; i++) { [all...] |
lobject.h | 569 int sizearray; /* size of `array' array */ member in struct:Table
|
lvm.c | 824 if (last > h->sizearray) /* needs more space? */
|
/external/skia/third_party/lua/src/ |
ltable.c | 148 if (0 < i && i <= t->sizearray) /* is `key' inside array part? */ 159 return i + t->sizearray; 171 for (i++; i < t->sizearray; i++) { /* try first array part */ 178 for (i -= t->sizearray; i < sizenode(t); i++) { /* then hash part */ 237 if (lim > t->sizearray) { 238 lim = t->sizearray; /* adjust upper limit */ 272 luaM_reallocvector(L, t->array, t->sizearray, size, TValue); 273 for (i=t->sizearray; i<size; i++) 275 t->sizearray = size; 306 int oldasize = t->sizearray; [all...] |
lgc.c | 359 int hasclears = (h->sizearray > 0); 385 for (i = 0; i < h->sizearray; i++) { 419 for (i = 0; i < h->sizearray; i++) /* traverse array part */ 452 return sizeof(Table) + sizeof(TValue) * h->sizearray + 641 for (i = 0; i < h->sizearray; i++) { [all...] |
lobject.h | 569 int sizearray; /* size of `array' array */ member in struct:Table
|
lvm.c | 824 if (last > h->sizearray) /* needs more space? */
|
/external/syslinux/com32/lua/src/ |
ltable.c | 149 if (0 < i && i <= t->sizearray) /* is `key' inside array part? */ 160 return i + t->sizearray; 172 for (i++; i < t->sizearray; i++) { /* try first array part */ 179 for (i -= t->sizearray; i < sizenode(t); i++) { /* then hash part */ 238 if (lim > t->sizearray) { 239 lim = t->sizearray; /* adjust upper limit */ 273 luaM_reallocvector(L, t->array, t->sizearray, size, TValue); 274 for (i=t->sizearray; i<size; i++) 276 t->sizearray = size; 307 int oldasize = t->sizearray; [all...] |
lgc.c | 359 int hasclears = (h->sizearray > 0); 385 for (i = 0; i < h->sizearray; i++) { 419 for (i = 0; i < h->sizearray; i++) /* traverse array part */ 452 return sizeof(Table) + sizeof(TValue) * h->sizearray + 648 for (i = 0; i < h->sizearray; i++) { [all...] |
lobject.h | 569 int sizearray; /* size of `array' array */ member in struct:Table
|
lvm.c | 847 if (last > h->sizearray) /* needs more space? */
|