Lines Matching +full:- +full:l
1 // SPDX-License-Identifier: MIT
60 lua_State l; member
68 LX l; member
74 #define fromstate(L) (cast(LX *, cast(lu_byte *, (L)) - offsetof(LX, l))) argument
86 static unsigned int makeseed (lua_State *L) { in makeseed() argument
90 addbuff(buff, p, L); /* heap variable */ in makeseed()
104 g->totalbytes -= (debt - g->GCdebt); in luaE_setdebt()
105 g->GCdebt = debt; in luaE_setdebt()
109 CallInfo *luaE_extendCI (lua_State *L) { in luaE_extendCI() argument
110 CallInfo *ci = luaM_new(L, CallInfo); in luaE_extendCI()
111 lua_assert(L->ci->next == NULL); in luaE_extendCI()
112 L->ci->next = ci; in luaE_extendCI()
113 ci->previous = L->ci; in luaE_extendCI()
114 ci->next = NULL; in luaE_extendCI()
119 void luaE_freeCI (lua_State *L) { in luaE_freeCI() argument
120 CallInfo *ci = L->ci; in luaE_freeCI()
121 CallInfo *next = ci->next; in luaE_freeCI()
122 ci->next = NULL; in luaE_freeCI()
124 next = ci->next; in luaE_freeCI()
125 luaM_free(L, ci); in luaE_freeCI()
130 static void stack_init (lua_State *L1, lua_State *L) { in stack_init() argument
133 L1->stack = luaM_newvector(L, BASIC_STACK_SIZE, TValue); in stack_init()
134 L1->stacksize = BASIC_STACK_SIZE; in stack_init()
136 setnilvalue(L1->stack + i); /* erase new stack */ in stack_init()
137 L1->top = L1->stack; in stack_init()
138 L1->stack_last = L1->stack + L1->stacksize - EXTRA_STACK; in stack_init()
140 ci = &L1->base_ci; in stack_init()
141 ci->next = ci->previous = NULL; in stack_init()
142 ci->callstatus = 0; in stack_init()
143 ci->func = L1->top; in stack_init()
144 setnilvalue(L1->top++); /* 'function' entry for this 'ci' */ in stack_init()
145 ci->top = L1->top + LUA_MINSTACK; in stack_init()
146 L1->ci = ci; in stack_init()
150 static void freestack (lua_State *L) { in freestack() argument
151 if (L->stack == NULL) in freestack()
153 L->ci = &L->base_ci; /* free the entire 'ci' list */ in freestack()
154 luaE_freeCI(L); in freestack()
155 luaM_freearray(L, L->stack, L->stacksize); /* free stack array */ in freestack()
162 static void init_registry (lua_State *L, global_State *g) { in init_registry() argument
165 Table *registry = luaH_new(L); in init_registry()
166 sethvalue(L, &g->l_registry, registry); in init_registry()
167 luaH_resize(L, registry, LUA_RIDX_LAST, 0); in init_registry()
168 /* registry[LUA_RIDX_MAINTHREAD] = L */ in init_registry()
169 setthvalue(L, &mt, L); in init_registry()
170 luaH_setint(L, registry, LUA_RIDX_MAINTHREAD, &mt); in init_registry()
172 sethvalue(L, &mt, luaH_new(L)); in init_registry()
173 luaH_setint(L, registry, LUA_RIDX_GLOBALS, &mt); in init_registry()
178 ** open parts of the state that may cause memory-allocation errors
180 static void f_luaopen (lua_State *L, void *ud) { in f_luaopen() argument
181 global_State *g = G(L); in f_luaopen()
183 stack_init(L, L); /* init stack */ in f_luaopen()
184 init_registry(L, g); in f_luaopen()
185 luaS_resize(L, MINSTRTABSIZE); /* initial size of string table */ in f_luaopen()
186 luaT_init(L); in f_luaopen()
187 luaX_init(L); in f_luaopen()
188 /* pre-create memory-error message */ in f_luaopen()
189 g->memerrmsg = luaS_newliteral(L, MEMERRMSG); in f_luaopen()
190 luaS_fix(g->memerrmsg); /* it should never be collected */ in f_luaopen()
191 g->gcrunning = 1; /* allow gc */ in f_luaopen()
192 g->version = lua_version(NULL); in f_luaopen()
193 luai_userstateopen(L); in f_luaopen()
201 static void preinit_state (lua_State *L, global_State *g) { in preinit_state() argument
202 G(L) = g; in preinit_state()
203 L->stack = NULL; in preinit_state()
204 L->ci = NULL; in preinit_state()
205 L->stacksize = 0; in preinit_state()
206 L->errorJmp = NULL; in preinit_state()
207 L->nCcalls = 0; in preinit_state()
208 L->hook = NULL; in preinit_state()
209 L->hookmask = 0; in preinit_state()
210 L->basehookcount = 0; in preinit_state()
211 L->allowhook = 1; in preinit_state()
212 resethookcount(L); in preinit_state()
213 L->openupval = NULL; in preinit_state()
214 L->nny = 1; in preinit_state()
215 L->status = LUA_OK; in preinit_state()
216 L->errfunc = 0; in preinit_state()
217 L->runerror = 0; in preinit_state()
221 static void close_state (lua_State *L) { in close_state() argument
222 global_State *g = G(L); in close_state()
223 luaF_close(L, L->stack); /* close all upvalues for this thread */ in close_state()
224 luaC_freeallobjects(L); /* collect all objects */ in close_state()
225 if (g->version) /* closing a fully built state? */ in close_state()
226 luai_userstateclose(L); in close_state()
227 luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size); in close_state()
228 luaZ_freebuffer(L, &g->buff); in close_state()
229 freestack(L); in close_state()
231 (*g->frealloc)(g->ud, fromstate(L), sizeof(LG), 0); /* free main block */ in close_state()
235 LUA_API lua_State *lua_newthread (lua_State *L) { in lua_newthread() argument
237 lua_lock(L); in lua_newthread()
238 luaC_checkGC(L); in lua_newthread()
239 L1 = &luaC_newobj(L, LUA_TTHREAD, sizeof(LX), NULL, offsetof(LX, l))->th; in lua_newthread()
240 setthvalue(L, L->top, L1); in lua_newthread()
241 api_incr_top(L); in lua_newthread()
242 preinit_state(L1, G(L)); in lua_newthread()
243 L1->hookmask = L->hookmask; in lua_newthread()
244 L1->basehookcount = L->basehookcount; in lua_newthread()
245 L1->hook = L->hook; in lua_newthread()
247 luai_userstatethread(L, L1); in lua_newthread()
248 stack_init(L1, L); /* init stack */ in lua_newthread()
249 lua_unlock(L); in lua_newthread()
254 void luaE_freethread (lua_State *L, lua_State *L1) { in luaE_freethread() argument
255 LX *l = fromstate(L1); in luaE_freethread() local
256 luaF_close(L1, L1->stack); /* close all upvalues for this thread */ in luaE_freethread()
257 lua_assert(L1->openupval == NULL); in luaE_freethread()
258 luai_userstatefree(L, L1); in luaE_freethread()
260 luaM_free(L, l); in luaE_freethread()
266 lua_State *L; in lua_newstate() local
268 LG *l = cast(LG *, (*f)(ud, NULL, LUA_TTHREAD, sizeof(LG))); in lua_newstate() local
269 if (l == NULL) return NULL; in lua_newstate()
270 L = &l->l.l; in lua_newstate()
271 g = &l->g; in lua_newstate()
272 L->next = NULL; in lua_newstate()
273 L->tt = LUA_TTHREAD; in lua_newstate()
274 g->currentwhite = bit2mask(WHITE0BIT, FIXEDBIT); in lua_newstate()
275 L->marked = luaC_white(g); in lua_newstate()
276 g->gckind = KGC_NORMAL; in lua_newstate()
277 preinit_state(L, g); in lua_newstate()
278 g->frealloc = f; in lua_newstate()
279 g->ud = ud; in lua_newstate()
280 g->mainthread = L; in lua_newstate()
281 g->seed = makeseed(L); in lua_newstate()
282 g->uvhead.u.l.prev = &g->uvhead; in lua_newstate()
283 g->uvhead.u.l.next = &g->uvhead; in lua_newstate()
284 g->gcrunning = 0; /* no GC while building state */ in lua_newstate()
285 g->GCestimate = 0; in lua_newstate()
286 g->strt.size = 0; in lua_newstate()
287 g->strt.nuse = 0; in lua_newstate()
288 g->strt.hash = NULL; in lua_newstate()
289 setnilvalue(&g->l_registry); in lua_newstate()
290 luaZ_initbuffer(L, &g->buff); in lua_newstate()
291 g->panic = NULL; in lua_newstate()
292 g->version = NULL; in lua_newstate()
293 g->gcstate = GCSpause; in lua_newstate()
294 g->allgc = NULL; in lua_newstate()
295 g->finobj = NULL; in lua_newstate()
296 g->tobefnz = NULL; in lua_newstate()
297 g->sweepgc = g->sweepfin = NULL; in lua_newstate()
298 g->gray = g->grayagain = NULL; in lua_newstate()
299 g->weak = g->ephemeron = g->allweak = NULL; in lua_newstate()
300 g->totalbytes = sizeof(LG); in lua_newstate()
301 g->GCdebt = 0; in lua_newstate()
302 g->gcpause = LUAI_GCPAUSE; in lua_newstate()
303 g->gcmajorinc = LUAI_GCMAJOR; in lua_newstate()
304 g->gcstepmul = LUAI_GCMUL; in lua_newstate()
305 for (i=0; i < LUA_NUMTAGS; i++) g->mt[i] = NULL; in lua_newstate()
306 if (luaD_rawrunprotected(L, f_luaopen, NULL) != LUA_OK) { in lua_newstate()
308 close_state(L); in lua_newstate()
309 L = NULL; in lua_newstate()
311 return L; in lua_newstate()
315 LUA_API void lua_close (lua_State *L) { in lua_close() argument
316 L = G(L)->mainthread; /* only the main thread can be closed */ in lua_close()
317 lua_lock(L); in lua_close()
318 close_state(L); in lua_close()