74     int inuse = cast_int(L->ci - L->base_ci);  in restore_stack_limit()
82   L->ci = L->base_ci;  in resetstack()
83   L->base = L->ci->base;  in resetstack()
127   CallInfo *ci;  in correctstack()  local
132   for (ci = L->base_ci; ci <= L->ci; ci++) {  in correctstack()
133     ci->top = (ci->top - oldstack) + L->stack;  in correctstack()
134     ci->base = (ci->base - oldstack) + L->stack;  in correctstack()
135     ci->func = (ci->func - oldstack) + L->stack;  in correctstack()
156   L->ci = (L->ci - oldci) + L->base_ci;  in luaD_reallocCI()
177   return ++L->ci;  in growCI()
185     ptrdiff_t ci_top = savestack(L, L->ci->top);  in luaD_callhook()
192       ar.i_ci = cast_int(L->ci - L->base_ci);  in luaD_callhook()
194     L->ci->top = L->top + LUA_MINSTACK;  in luaD_callhook()
195     lua_assert(L->ci->top <= L->stack_last);  in luaD_callhook()
202     L->ci->top = restorestack(L, ci_top);  in luaD_callhook()
261   ((L->ci == L->end_ci) ? growCI(L) : \
262    (condhardstacktests(luaD_reallocCI(L, L->size_ci)), ++L->ci))
272   L->ci->savedpc = L->savedpc;  in luaD_precall()
274     CallInfo *ci;  in luaD_precall()  local
289     ci = inc_ci(L);  /* now `enter' new function */  in luaD_precall()
290     ci->func = func;  in luaD_precall()
291     L->base = ci->base = base;  in luaD_precall()
292     ci->top = L->base + p->maxstacksize;  in luaD_precall()
293     lua_assert(ci->top <= L->stack_last);  in luaD_precall()
295     ci->tailcalls = 0;  in luaD_precall()
296     ci->nresults = nresults;  in luaD_precall()
297     for (st = L->top; st < ci->top; st++)  in luaD_precall()
299     L->top = ci->top;  in luaD_precall()
308     CallInfo *ci;  in luaD_precall()  local
311     ci = inc_ci(L);  /* now `enter' new function */  in luaD_precall()
312     ci->func = restorestack(L, funcr);  in luaD_precall()
313     L->base = ci->base = ci->func + 1;  in luaD_precall()
314     ci->top = L->top + LUA_MINSTACK;  in luaD_precall()
315     lua_assert(ci->top <= L->stack_last);  in luaD_precall()
316     ci->nresults = nresults;  in luaD_precall()
335   if (f_isLua(L->ci)) {  /* Lua function? */  in callrethooks()
336     while ((L->hookmask & LUA_MASKRET) && L->ci->tailcalls--) /* tail calls */  in callrethooks()
346   CallInfo *ci;  in luaD_poscall()  local
349   ci = L->ci--;  in luaD_poscall()
350   res = ci->func;  /* res == final position of 1st result */  in luaD_poscall()
351   wanted = ci->nresults;  in luaD_poscall()
352   L->base = (ci - 1)->base;  /* restore base */  in luaD_poscall()
353   L->savedpc = (ci - 1)->savedpc;  /* restore savedpc */  in luaD_poscall()
386   CallInfo *ci = L->ci;  in resume()  local
388     lua_assert(ci == L->base_ci && firstArg > L->base);  in resume()
395     if (!f_isLua(ci)) {  /* `common' yield? */  in resume()
397       lua_assert(GET_OPCODE(*((ci-1)->savedpc - 1)) == OP_CALL ||  in resume()
398                  GET_OPCODE(*((ci-1)->savedpc - 1)) == OP_TAILCALL);  in resume()
400         L->top = L->ci->top;  /* and correct top if not multiple results */  in resume()
403       L->base = L->ci->base;  in resume()
405   luaV_execute(L, cast_int(L->ci - L->base_ci));  in resume()
410   L->top = L->ci->base;  in resume_error()
421   if (L->status != LUA_YIELD && (L->status != 0 || L->ci != L->base_ci))  in lua_resume()
432     L->ci->top = L->top;  in lua_resume()
460   ptrdiff_t old_ci = saveci(L, L->ci);  in luaD_pcall()
470     L->ci = restoreci(L, old_ci);  in luaD_pcall()
471     L->base = L->ci->base;  in luaD_pcall()
472     L->savedpc = L->ci->savedpc;  in luaD_pcall()