aboutsummaryrefslogtreecommitdiff
path: root/src/intercopycontext.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'src/intercopycontext.cpp')
-rw-r--r--src/intercopycontext.cpp29
1 files changed, 16 insertions, 13 deletions
diff --git a/src/intercopycontext.cpp b/src/intercopycontext.cpp
index 653eeb6..6e9b66c 100644
--- a/src/intercopycontext.cpp
+++ b/src/intercopycontext.cpp
@@ -178,9 +178,10 @@ static lua_Integer get_mt_id(Universe* const U_, lua_State* const L_, StackIndex
178// L2 has the cache key for this function at the top of the stack 178// L2 has the cache key for this function at the top of the stack
179void InterCopyContext::copyFunction() const 179void InterCopyContext::copyFunction() const
180{ 180{
181 LUA_ASSERT(L1, L2_cache_i != 0); // L2: ... {cache} ... p 181 LUA_ASSERT(L1, L2_cache_i != 0); // L1: ... f L2: ... {cache} ... p
182 STACK_GROW(L1, 2); 182 STACK_GROW(L1, 2);
183 STACK_CHECK_START_REL(L1, 0); 183 STACK_CHECK_START_REL(L1, 0);
184 STACK_CHECK_START_REL(L2, 0);
184 185
185 // 'luaW_dump()' needs the function at top of stack 186 // 'luaW_dump()' needs the function at top of stack
186 // if already on top of the stack, no need to push again 187 // if already on top of the stack, no need to push again
@@ -194,17 +195,16 @@ void InterCopyContext::copyFunction() const
194 // to the writer" (and we only return 0) 195 // to the writer" (and we only return 0)
195 // not sure this could ever fail but for memory shortage reasons 196 // not sure this could ever fail but for memory shortage reasons
196 // last argument is Lua 5.4-specific (no stripping) 197 // last argument is Lua 5.4-specific (no stripping)
197 if (tools::PushFunctionBytecode(L1, U->stripFunctions) != 0) { // L1: ... f "<bytecode>" 198 tools::PushFunctionBytecode(L1, L2, U->stripFunctions); // L1: ... f L2: ... {cache} ... p "<bytecode>"
198 raise_luaL_error(getErrL(), "internal error: function dump failed.");
199 }
200 199
201 // if pushed, we need to pop 200 // if pushed, we need to pop
202 if (_needToPush) { 201 if (_needToPush) {
203 lua_remove(L1, -2); // L1: ... "<bytecode>" 202 lua_pop(L1, 1); // L1: ...
204 } 203 }
205 204
206 // When we are done, the stack should be the original one, with the bytecode string added on top 205 // When we are done, the stack of L1 should be the original one, with the bytecode string added on top of L2
207 STACK_CHECK(L1, 1); 206 STACK_CHECK(L1, 0);
207 STACK_CHECK(L2, 1);
208 208
209 // transfer the bytecode, then the upvalues, to create a similar closure 209 // transfer the bytecode, then the upvalues, to create a similar closure
210 { 210 {
@@ -213,16 +213,16 @@ void InterCopyContext::copyFunction() const
213 if constexpr (LOG_FUNC_INFO) 213 if constexpr (LOG_FUNC_INFO)
214 { 214 {
215 lua_Debug _ar; 215 lua_Debug _ar;
216 lua_pushvalue(L1, L1_i); // L1: ... "<bytecode>" f 216 lua_pushvalue(L1, L1_i); // L1: ... f
217 // "To get information about a function you push it onto the stack and start the what string with the character '>'." 217 // "To get information about a function you push it onto the stack and start the what string with the character '>'."
218 // fills 'fname' 'namewhat' and 'linedefined', pops function 218 // fills 'fname' 'namewhat' and 'linedefined', pops function
219 lua_getinfo(L1, ">nS", &_ar); // L1: ... "<bytecode>" 219 lua_getinfo(L1, ">nS", &_ar); // L1: ...
220 _fname = _ar.namewhat; 220 _fname = _ar.namewhat;
221 DEBUGSPEW_CODE(DebugSpew(U) << "FNAME: " << _ar.short_src << " @ " << _ar.linedefined << std::endl); 221 DEBUGSPEW_CODE(DebugSpew(U) << "FNAME: " << _ar.short_src << " @ " << _ar.linedefined << std::endl);
222 } 222 }
223 223
224 { 224 {
225 std::string_view const _bytecode{ luaW_tostring(L1, kIdxTop) }; // L1: ... "<bytecode>" 225 std::string_view const _bytecode{ luaW_tostring(L2, kIdxTop) }; // L2: ... {cache} ... p "<bytecode>"
226 LUA_ASSERT(L1, !_bytecode.empty()); 226 LUA_ASSERT(L1, !_bytecode.empty());
227 STACK_GROW(L2, 2); 227 STACK_GROW(L2, 2);
228 // Note: Line numbers seem to be taken precisely from the 228 // Note: Line numbers seem to be taken precisely from the
@@ -231,15 +231,15 @@ void InterCopyContext::copyFunction() const
231 // 231 //
232 // TBD: Can we get the function's original name through, as well? 232 // TBD: Can we get the function's original name through, as well?
233 // 233 //
234 if (luaL_loadbuffer(L2, _bytecode.data(), _bytecode.size(), _fname) != 0) { // L2: ... {cache} ... p function 234 if (luaL_loadbuffer(L2, _bytecode.data(), _bytecode.size(), _fname) != 0) { // L2: ... {cache} ... p "<bytecode>" function
235 // chunk is precompiled so only LUA_ERRMEM can happen 235 // chunk is precompiled so only LUA_ERRMEM can happen
236 // "Otherwise, it pushes an error message" 236 // "Otherwise, it pushes an error message"
237 // 237 //
238 STACK_GROW(L1, 1); 238 STACK_GROW(L1, 1);
239 raise_luaL_error(getErrL(), "%s: %s", _fname, lua_tostring(L2, -1)); 239 raise_luaL_error(getErrL(), "%s: %s", _fname, lua_tostring(L2, kIdxTop));
240 } 240 }
241 // remove the dumped string 241 // remove the dumped string
242 lua_pop(L1, 1); // L1: ... 242 lua_replace(L2, -2); // L2: ... {cache} ... p function
243 // now set the cache as soon as we can. 243 // now set the cache as soon as we can.
244 // this is necessary if one of the function's upvalues references it indirectly 244 // this is necessary if one of the function's upvalues references it indirectly
245 // we need to find it in the cache even if it isn't fully transfered yet 245 // we need to find it in the cache even if it isn't fully transfered yet
@@ -249,6 +249,7 @@ void InterCopyContext::copyFunction() const
249 lua_rawset(L2, L2_cache_i); // L2: ... {cache} ... function 249 lua_rawset(L2, L2_cache_i); // L2: ... {cache} ... function
250 } 250 }
251 STACK_CHECK(L1, 0); 251 STACK_CHECK(L1, 0);
252 STACK_CHECK(L2, 0); // cache key is replaced by the function, so no stack level change
252 253
253 /* push over any upvalues; references to this function will come from 254 /* push over any upvalues; references to this function will come from
254 * cache so we don't end up in eternal loop. 255 * cache so we don't end up in eternal loop.
@@ -279,6 +280,7 @@ void InterCopyContext::copyFunction() const
279 lua_pop(L1, 1); // L1: ... 280 lua_pop(L1, 1); // L1: ...
280 } // L2: ... {cache} ... function + 'n' upvalues (>=0) 281 } // L2: ... {cache} ... function + 'n' upvalues (>=0)
281 STACK_CHECK(L1, 0); 282 STACK_CHECK(L1, 0);
283 STACK_CHECK(L2, _n);
282 284
283 // Set upvalues (originally set to 'nil' by 'lua_load') 285 // Set upvalues (originally set to 'nil' by 'lua_load')
284 for (StackIndex const _func_index{ lua_gettop(L2) - _n }; _n > 0; --_n) { 286 for (StackIndex const _func_index{ lua_gettop(L2) - _n }; _n > 0; --_n) {
@@ -289,6 +291,7 @@ void InterCopyContext::copyFunction() const
289 // once all upvalues have been set we are left 291 // once all upvalues have been set we are left
290 // with the function at the top of the stack // L2: ... {cache} ... function 292 // with the function at the top of the stack // L2: ... {cache} ... function
291 } 293 }
294 STACK_CHECK(L2, 0);
292 STACK_CHECK(L1, 0); 295 STACK_CHECK(L1, 0);
293} 296}
294 297