newsize 141 lib/lua/ldo.c LUAI_FUNC void luaD_reallocstack (lua_State *L, int newsize) { newsize 143 lib/lua/ldo.c int realsize = newsize + 1 + EXTRA_STACK; newsize 147 lib/lua/ldo.c L->stack_last = L->stack+newsize; newsize 152 lib/lua/ldo.c LUAI_FUNC void luaD_reallocCI (lua_State *L, int newsize) { newsize 154 lib/lua/ldo.c luaM_reallocvector(L, L->base_ci, L->size_ci, newsize, CallInfo); newsize 155 lib/lua/ldo.c L->size_ci = newsize; newsize 47 lib/lua/ldo.h LUAI_FUNC void luaD_reallocCI (lua_State *L, int newsize); newsize 48 lib/lua/ldo.h LUAI_FUNC void luaD_reallocstack (lua_State *L, int newsize); newsize 439 lib/lua/lgc.c size_t newsize = luaZ_sizebuffer(&g->buff) / 2; newsize 440 lib/lua/lgc.c luaZ_resizebuffer(L, &g->buff, newsize); newsize 54 lib/lua/llex.c size_t newsize; newsize 57 lib/lua/llex.c newsize = b->buffsize * 2; newsize 58 lib/lua/llex.c luaZ_resizebuffer(ls->L, b, newsize); newsize 49 lib/lua/lmem.c int newsize; newsize 53 lib/lua/lmem.c newsize = limit; /* still have at least one free place */ newsize 56 lib/lua/lmem.c newsize = (*size)*2; newsize 57 lib/lua/lmem.c if (newsize < MINSIZEARRAY) newsize 58 lib/lua/lmem.c newsize = MINSIZEARRAY; /* minimum size */ newsize 60 lib/lua/lmem.c newblock = luaM_reallocv(L, block, *size, newsize, size_elems); newsize 61 lib/lua/lmem.c *size = newsize; /* update only when everything else is OK */ newsize 22 lib/lua/lstring.c LUAI_FUNC void luaS_resize (lua_State *L, int newsize) { newsize 28 lib/lua/lstring.c newhash = luaM_newvector(L, newsize, GCObject *); newsize 30 lib/lua/lstring.c for (i=0; i<newsize; i++) newhash[i] = NULL; newsize 37 lib/lua/lstring.c int h1 = lmod(h, newsize); /* new position */ newsize 38 lib/lua/lstring.c lua_assert(cast_int(h%newsize) == lmod(h, newsize)); newsize 45 lib/lua/lstring.c tb->size = newsize; newsize 26 lib/lua/lstring.h LUAI_FUNC void luaS_resize (lua_State *L, int newsize);