NeoFlock/neonucleus
2
0
Fork 0
mirror of https://github.com/NeoFlock/neonucleus.git synced 2025-09-24 09:03:32 +02:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #5 from speedy-lex/main

Browse Source 
safe lua_pushstring
This commit is contained in:
Quantum Tomato 2025-07-01 18:54:06 +02:00 committed by GitHub
commit f350cfe24d
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 32 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

41
src/testLuaArch.c
View File

@ -32,6 +32,30 @@ typedef struct testLuaArch {
size_t memoryUsed; size_t memoryUsed;
} testLuaArch; } testLuaArch;
testLuaArch *testLuaArch_get(lua_State *L) {
lua_getfield(L, LUA_REGISTRYINDEX, "archPtr");
testLuaArch *arch = lua_touserdata(L, -1);
lua_pop(L, 1);
return arch;
}
const char *testLuaArch_pushlstring(lua_State *L, const char *s, size_t len) {
if (lua_checkstack(L, 1) == 0) {
return NULL;
}
testLuaArch* arch = testLuaArch_get(L);
size_t freeSpace = nn_getComputerMemoryTotal(arch->computer) - arch->memoryUsed;
if ((len * 2 + 64) > freeSpace) { // dk how much space this really needs and its unstable so :/
return NULL;
}
return lua_pushlstring(L, s, len);
}
const char *testLuaArch_pushstring(lua_State *L, const char *s) {
size_t len = strlen(s);
return testLuaArch_pushlstring(L, s, len);
}
void *testLuaArch_alloc(testLuaArch *arch, void *ptr, size_t osize, size_t nsize) { void *testLuaArch_alloc(testLuaArch *arch, void *ptr, size_t osize, size_t nsize) {
if(nsize == 0) { if(nsize == 0) {
arch->memoryUsed -= osize; arch->memoryUsed -= osize;
@ -49,13 +73,6 @@ void *testLuaArch_alloc(testLuaArch *arch, void *ptr, size_t osize, size_t nsize
} }
} }
testLuaArch *testLuaArch_get(lua_State *L) {
lua_getfield(L, LUA_REGISTRYINDEX, "archPtr");
testLuaArch *arch = lua_touserdata(L, -1);
lua_pop(L, 1);
return arch;
}
nn_computer *testLuaArch_getComputer(lua_State *L) { nn_computer *testLuaArch_getComputer(lua_State *L) {
return testLuaArch_get(L)->computer; return testLuaArch_get(L)->computer;
} }
@ -488,9 +505,12 @@ int testLuaArch_unicode_sub(lua_State *L) {
} }
char *sub = nn_unicode_char(points + start - 1, stop - start + 1); char *sub = nn_unicode_char(points + start - 1, stop - start + 1);
lua_pushstring(L, sub); // TODO: fix OOM here char *res = testLuaArch_pushstring(L, sub);
nn_free(sub); nn_free(sub);
nn_free(points); nn_free(points);
if (!res) {
luaL_error(L, "out of memory");
}
return 1; return 1;
} }
@ -511,9 +531,12 @@ int testLuaArch_unicode_char(lua_State *L) {
codepoints[i] = lua_tointeger(L, idx); codepoints[i] = lua_tointeger(L, idx);
} }
char *s = nn_unicode_char(codepoints, argc); char *s = nn_unicode_char(codepoints, argc);
lua_pushstring(L, s); char *res = testLuaArch_pushstring(L, s);
nn_free(s); nn_free(s);
nn_free(codepoints); nn_free(codepoints);
if (!res) {
luaL_error(L, "out of memory");
}
return 1; return 1;
} }