109   CallInfo *ci = luaM_new(L, CallInfo);  in luaE_extendCI()  local
110   lua_assert(L->ci->next == NULL);  in luaE_extendCI()
111   L->ci->next = ci;  in luaE_extendCI()
112   ci->previous = L->ci;  in luaE_extendCI()
113   ci->next = NULL;  in luaE_extendCI()
115   return ci;  in luaE_extendCI()
123   CallInfo *ci = L->ci;  in luaE_freeCI()  local
124   CallInfo *next = ci->next;  in luaE_freeCI()
125   ci->next = NULL;  in luaE_freeCI()
126   while ((ci = next) != NULL) {  in luaE_freeCI()
127     next = ci->next;  in luaE_freeCI()
128     luaM_free(L, ci);  in luaE_freeCI()
138   CallInfo *ci = L->ci;  in luaE_shrinkCI()  local
141   while (ci->next != NULL && (next2 = ci->next->next) != NULL) {  in luaE_shrinkCI()
142     luaM_free(L, ci->next);  /* free next */  in luaE_shrinkCI()
144     ci->next = next2;  /* remove 'next' from the list */  in luaE_shrinkCI()
145     next2->previous = ci;  in luaE_shrinkCI()
146     ci = next2;  /* keep next's next */  in luaE_shrinkCI()
152   int i; CallInfo *ci;  in stack_init()  local
161   ci = &L1->base_ci;  in stack_init()
162   ci->next = ci->previous = NULL;  in stack_init()
163   ci->callstatus = 0;  in stack_init()
164   ci->func = L1->top;  in stack_init()
166   ci->top = L1->top + LUA_MINSTACK;  in stack_init()
167   L1->ci = ci;  in stack_init()
174   L->ci = &L->base_ci;  /* free the entire 'ci' list */  in freestack()
224   L->ci = NULL;  in preinit_thread()