strt 390 lib/lua/lgc.c G(L)->strt.nuse--; strt 434 lib/lua/lgc.c if (g->strt.nuse < cast(lu_int32, g->strt.size/4) && strt 435 lib/lua/lgc.c g->strt.size > MINSTRTABSIZE*2) strt 436 lib/lua/lgc.c luaS_resize(L, g->strt.size/2); /* table is too big */ strt 488 lib/lua/lgc.c for (i = 0; i < g->strt.size; i++) /* free all string lists */ strt 489 lib/lua/lgc.c sweepwholelist(L, &g->strt.hash[i]); strt 574 lib/lua/lgc.c sweepwholelist(L, &g->strt.hash[g->sweepstrgc++]); strt 575 lib/lua/lgc.c if (g->sweepstrgc >= g->strt.size) /* nothing more to sweep? */ strt 110 lib/lua/lstate.c lua_assert(g->strt.nuse == 0); strt 111 lib/lua/lstate.c luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size, TString *); strt 163 lib/lua/lstate.c g->strt.size = 0; strt 164 lib/lua/lstate.c g->strt.nuse = 0; strt 165 lib/lua/lstate.c g->strt.hash = NULL; strt 69 lib/lua/lstate.h stringtable strt; /* hash table for strings */ strt 29 lib/lua/lstring.c tb = &G(L)->strt; strt 64 lib/lua/lstring.c tb = &G(L)->strt; strt 82 lib/lua/lstring.c for (o = G(L)->strt.hash[lmod(h, G(L)->strt.size)];