[英]Is there a lua-c api function which doesn't remove the complete stack?
My problem is that lua_pcall clears the stack, because i want to reuse the stack before the call again with just one change again. 我的问题是lua_pcall清除了堆栈,因为我想在再次调用之前重用堆栈,而只需一次更改。
Is there a way to either copy the complete stack and paste it in again or even a way to call a lua function without clearing the stack? 有没有办法复制整个堆栈并再次粘贴它,甚至有一种方法可以在不清除堆栈的情况下调用lua函数?
Lua: 卢阿:
function test(a)
print(a)
end
event.add("test", test)
event.add("test", test)
event.call("test", 42)
C++: C ++:
int Func_Event_call(Lua_State* L){
//Stack: String:Eventname, Arguments...
std::string name = luaL_checkstring(L, 1);
... Get array functions from name
for(...){
//load function into stack
lua_rawgeti(L, LUA_REGISTRYINDEX, functions[c]);
lua_replace(L, 1);
//Wanted Stack: Lua_Function, Arguments... <- works for the first function
//call function
lua_pcall(L, nummberArgs, 0, 0);
//stack is now empty because of lua_pcall <- problem
}
return 0;
}
//store stack in Registry
lua_createtable(L, nummberArgs, nummberArgs);
lua_insert(L, 1);
//fill table
for (int c = 0; c < nummberArgs; c++) {
lua_pushinteger(L, c);
lua_insert(L, -2);
lua_settable(L, 1);
}
//store it in Registry and clean up
int reg_key = luaL_ref(L, LUA_REGISTRYINDEX);
lua_remove(L, 1);
...
//restore stack from above
lua_rawgeti(L, LUA_REGISTRYINDEX, reg_key);
//iterate over the table to get all elements, the key is getting removed by lua_next
lua_pushnil(L);
while (lua_next(L, 1) != 0) {
/* uses 'key' (at index -2) and 'value' (at index -1) */
/* move 'value'; keeps 'key' for next iteration */
lua_insert(L, -2);
}
//remove table from stack
lua_remove(L, 1);
I solved the problem by using a table in the registry and put the complete stack in the table with numeric keys. 我通过在注册表中使用表解决了问题,并使用数字键将完整的堆栈放入表中。 After calling the second part i can go back to the stack when the first part was called, but multiple times. 调用第二部分后,我可以在调用第一部分时返回堆栈,但是可以多次。
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.