2017-11-10 06:41:46 +08:00
|
|
|
#define SOL_CHECK_ARGUMENTS 1
|
|
|
|
#define SOL_ENABLE_INTEROP 1
|
2016-03-14 14:34:02 +08:00
|
|
|
|
|
|
|
#include <sol.hpp>
|
|
|
|
|
2017-11-10 06:41:46 +08:00
|
|
|
#include <catch.hpp>
|
|
|
|
|
2017-08-06 07:20:28 +08:00
|
|
|
TEST_CASE("issues/stack overflow", "make sure various operations repeated don't trigger stack overflow") {
|
2016-06-07 03:46:53 +08:00
|
|
|
sol::state lua;
|
2017-08-22 03:25:43 +08:00
|
|
|
lua.safe_script("t = {};t[0]=20");
|
|
|
|
lua.safe_script("lua_function=function(i)return i;end");
|
2016-06-07 03:46:53 +08:00
|
|
|
|
|
|
|
sol::function f = lua["lua_function"];
|
|
|
|
std::string teststring = "testtext";
|
2017-09-17 02:18:45 +08:00
|
|
|
REQUIRE_NOTHROW([&] {
|
2016-06-07 03:46:53 +08:00
|
|
|
for (int i = 0; i < 1000000; ++i) {
|
|
|
|
std::string result = f(teststring);
|
2017-09-17 02:18:45 +08:00
|
|
|
if (result != teststring)
|
|
|
|
throw std::logic_error("RIP");
|
2016-06-07 03:46:53 +08:00
|
|
|
}
|
2017-02-18 10:29:55 +08:00
|
|
|
}());
|
2016-06-07 03:46:53 +08:00
|
|
|
sol::table t = lua["t"];
|
|
|
|
int expected = 20;
|
2017-09-17 02:18:45 +08:00
|
|
|
REQUIRE_NOTHROW([&] {
|
2016-06-07 03:46:53 +08:00
|
|
|
for (int i = 0; i < 1000000; ++i) {
|
|
|
|
int result = t[0];
|
|
|
|
t.size();
|
|
|
|
if (result != expected)
|
|
|
|
throw std::logic_error("RIP");
|
|
|
|
}
|
2017-02-18 10:29:55 +08:00
|
|
|
}());
|
2016-03-14 14:34:02 +08:00
|
|
|
}
|
2016-06-08 23:23:17 +08:00
|
|
|
|
2017-08-06 07:20:28 +08:00
|
|
|
TEST_CASE("issues/stack overflow 2", "make sure basic iterators clean up properly when they're not iterated through (e.g., with empty())") {
|
2016-06-08 23:23:17 +08:00
|
|
|
sol::state lua;
|
|
|
|
sol::table t = lua.create_table_with(1, "wut");
|
|
|
|
int MAX = 50000;
|
|
|
|
auto fx = [&]() {
|
|
|
|
int a = 50;
|
|
|
|
for (int i = 0; i < MAX; ++i) {
|
|
|
|
if (t.empty()) {
|
|
|
|
a += 4;
|
|
|
|
}
|
|
|
|
a += 2;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
REQUIRE_NOTHROW(fx());
|
|
|
|
}
|