Searched refs:stack_last (Results 1 – 14 of 14) sorted by relevance
248 lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK); in luaD_reallocstack()253 L->stack_last = L->stack + newsize - EXTRA_STACK; in luaD_reallocstack()281 lua_assert(ci->top <= L->stack_last); in stackinuse()312 lua_assert(ci->top <= L->stack_last); in luaD_hook()396 lua_assert(ci->top <= L->stack_last); in luaD_precall()428 lua_assert(ci->top <= L->stack_last); in luaD_precall()
16 #define luaD_checkstack(L,n) if (L->stack_last - L->top <= (n)) \
161 StkId stack_last; /* last free slot in the stack */ member
137 L1->stack_last = L1->stack + L1->stacksize - EXTRA_STACK; in stack_init()
92 if (L->stack_last - L->top > size) /* stack large enough? */ in lua_checkstack()165 api_check(L, idx <= L->stack_last - (func + 1), "new top too large"); in lua_settop()
147 #define stacksize(th) cast_int((th)->stack_last.p - (th)->stack.p)317 StkIdRel stack_last; /* end of stack (last element + 1) */ member
231 L->stack_last.p = L->stack.p + newsize; in luaD_reallocstack()283 lua_assert(lim <= L->stack_last.p + EXTRA_STACK); in stackinuse()523 lua_assert(ci->top.p <= L->stack_last.p); in precallC()564 lua_assert(ci->top.p <= L->stack_last.p); in luaD_pretailcall()608 lua_assert(ci->top.p <= L->stack_last.p); in luaD_precall()
27 if (l_unlikely(L->stack_last.p - L->top.p <= (n))) \
254 lua_assert(L->top.p <= ci->top.p && ci->top.p <= L->stack_last.p); in luaT_adjustvarargs()
188 L1->stack_last.p = L1->stack.p + BASIC_STACK_SIZE; in stack_init()
450 assert(L1->top.p <= L1->stack_last.p); in checkstack()453 assert(ci->top.p <= L1->stack_last.p); in checkstack()456 for (o = L1->stack.p; o < L1->stack_last.p; o++) in checkstack()
641 for (; o < th->stack_last.p + EXTRA_STACK; o++) in traversethread()
117 if (L->stack_last.p - L->top.p > n) /* stack large enough? */ in lua_checkstack()
1184 lua_assert(base <= L->top.p && L->top.p <= L->stack_last.p); in luaV_execute()