diff --git a/.gitignore b/.gitignore index 84f3ebd..c60d37b 100644 --- a/.gitignore +++ b/.gitignore @@ -2,10 +2,21 @@ luaDoTheWorld *.d old +.TreinAiCache +.vscode main.c +dependencies doTheWorld.h teste.png +release teste.lua +src/imports/ +side_effect_copy +output_test +side_effect +LuaCembed.c +LuaCEmbed.h +teste.c # Object files *.o cache2 diff --git a/.idea/.gitignore b/.idea/.gitignore deleted file mode 100644 index 13566b8..0000000 --- a/.idea/.gitignore +++ /dev/null @@ -1,8 +0,0 @@ -# Default ignored files -/shelf/ -/workspace.xml -# Editor-based HTTP Client requests -/httpRequests/ -# Datasource local storage ignored files -/dataSources/ -/dataSources.local.xml diff --git a/.idea/LuaCEmbed.iml b/.idea/LuaCEmbed.iml deleted file mode 100644 index 4c94235..0000000 --- a/.idea/LuaCEmbed.iml +++ /dev/null @@ -1,2 +0,0 @@ - - \ No newline at end of file diff --git a/.idea/editor.xml b/.idea/editor.xml deleted file mode 100644 index 856140b..0000000 --- a/.idea/editor.xml +++ /dev/null @@ -1,104 +0,0 @@ - - - - - \ No newline at end of file diff --git a/.idea/modules.xml b/.idea/modules.xml deleted file mode 100644 index 851453e..0000000 --- a/.idea/modules.xml +++ /dev/null @@ -1,8 +0,0 @@ - - - - - - - - \ No newline at end of file diff --git a/.idea/vcs.xml b/.idea/vcs.xml deleted file mode 100644 index 35eb1dd..0000000 --- a/.idea/vcs.xml +++ /dev/null @@ -1,6 +0,0 @@ - - - - - - \ No newline at end of file diff --git a/.vscode/settings.json b/.vscode/settings.json deleted file mode 100644 index 335b01a..0000000 --- a/.vscode/settings.json +++ /dev/null @@ -1,9 +0,0 @@ -{ - "files.associations": { - "custom_math.h": "c", - "pthread.h": "c" - }, - "terminal.explorerKind": "external", - "terminal.integrated.accessibleViewFocusOnCommandExecution": true, - "terminal.integrated.accessibleViewPreserveCursorPosition": true -} \ No newline at end of file diff --git a/LuaCEmbed.h b/LuaCEmbed.h deleted file mode 100644 index d0e0761..0000000 --- a/LuaCEmbed.h +++ /dev/null @@ -1,32161 +0,0 @@ -//path: src/one.c - - -#ifndef LUACEMBED_H -//path: src/declaration.h -#ifdef _WIN32 -#include -#else -#include -#include -#endif - -#include -#include -#include -#include -//path: src/dependencies/dependencies.h -//path: src/dependencies/UniversalGarbage.h - - - -#ifndef UNIVERSAL_GARBAGE_H - - -#include -#include -#include -#include - - - - - -#define UniversalGarbage_create_empty_struct(name,element_type) \ -(element_type*)malloc(sizeof(element_type)); \ -*name = (element_type){0}; - - -#define UniversalGarbage_cast(value) ((void**)&value) - - -#define UniversalGarbage_add(garbage,deallocator_callback,value) \ - rawUniversalGarbage_add(garbage,(void*)deallocator_callback,UniversalGarbage_cast(value)) - -#define UniversalGarbage_add_simple(garbage,value) \ - UniversalGarbage_add(garbage,free,value) - - -#define UniversalGarbage_add_return(garbage,deallocator_callback,value) \ - UniversalGarbage_add(garbage->return_values,deallocator_callback,value) - - -#define UniversalGarbage_add_simple_return(garbage,value) \ - UniversalGarbage_add_simple(garbage->return_values,value) - - - -#define UniversalGarbage_remove(garbage,value) \ - rawUniversalGarbage_remove(garbage,UniversalGarbage_cast(value)); - - -#define UniversalGarbage_disconnect(garbage,value) \ - rawUniversalGarbage_disconnect(garbage,UniversalGarbage_cast(value)); - - - - -#define UniversalGarbage_reallocate(garbage,value) \ - rawUniversalGarbage_reallocate(garbage,UniversalGarbage_cast(value)) - - -#define UniversalGarbage_resset(garbage,value) \ - rawUniversalGarbage_resset(garbage,UniversalGarbage_cast(value)) - - - - - - -typedef struct privateUniversalGarbageElement{ - void **pointer; - void (*deallocator_callback)(void *element); - void *pointed_value; -}privateUniversalGarbageElement; - -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self); - - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self); - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer); - - - -typedef struct UniversalGarbage{ - - struct UniversalGarbage *return_values; - privateUniversalGarbageElement **elements; - int elements_size; - bool is_the_root; - -}UniversalGarbage; - -UniversalGarbage * newUniversalGarbage(); - -UniversalGarbage * private_new_MainUniversalGarbage(); - - - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer); - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self); - -void UniversalGarbage_free_including_return(UniversalGarbage *self); - -void UniversalGarbage_free(UniversalGarbage *self); - - - - - - - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer){ - - privateUniversalGarbageElement * self = UniversalGarbage_create_empty_struct( - self, - privateUniversalGarbageElement - ); - self->pointer = pointer; - self->deallocator_callback = dealocator_callback; - self->pointed_value = *pointer; - return self; -} -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self){ - if(self->pointed_value){ - self->deallocator_callback(self->pointed_value); - self->pointed_value = NULL; - } -} - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self){ - private_UniversalGarbageSimpleElement_free_pointed_value(self); - free(self); -} - - -UniversalGarbage * private_new_MainUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->is_the_root = false; - return self; -} - -UniversalGarbage * newUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->is_the_root = true; - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->return_values =private_new_MainUniversalGarbage(); - - return self; -} - - - - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - - if(rawUniversalGarbage_reallocate(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - - privateUniversalGarbageElement *current = self->elements[i]; - bool reallocate = current->pointer == pointer; - - if(reallocate){ - current->pointed_value = *pointer; - return true; - } - } - return false; -} - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - if(rawUniversalGarbage_resset(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - bool resset = current->pointer == pointer; - if(resset){ - private_UniversalGarbageSimpleElement_free_pointed_value(current); - current->pointed_value = *pointer; - return true; - } - } - return false; - -} -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_remove(self->return_values,pointer)){ - *pointer = NULL; - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - private_UniversalGarbageSimpleElement_free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - - } - *pointer = NULL; - return true; - } - } - return false; -} -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_disconnect(self->return_values,pointer)){ - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - } - return true; - } - } - return false; - - - -} -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer){ - - if(!pointer){ - return false; - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - return false; - } - } - - self->elements = (privateUniversalGarbageElement**)realloc( - self->elements, - (self->elements_size + 1) * sizeof(privateUniversalGarbageElement*) - ); - void (*dealocator_callback)(void *element); -#ifdef __cplusplus - dealocator_callback =reinterpret_cast(release_callback); -#else - dealocator_callback = (void*)(void*)release_callback; - -#endif - - - - self->elements[self->elements_size] = private_newUniversalGarbageSimpleElement(dealocator_callback, pointer); - self->elements_size+=1; - return true; -} - - - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self){ - for(int i = 0; i < self->elements_size; i++){ - private_UniversalGarbageSimpleElement_free(self->elements[i]); - } - free(self->elements); -} - -void UniversalGarbage_free_including_return(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - if(self->is_the_root){ - UniversalGarbage_free(self->return_values); - } - free(self); -} - -void UniversalGarbage_free(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - - if(self->is_the_root){ - - UniversalGarbage *return_garbage = self->return_values; - for(int i = 0; i < return_garbage->elements_size; i++){ - free(return_garbage->elements[i]); - } - - free(return_garbage->elements); - free(return_garbage); - } - - - free(self); -} - - - - -#define UNIVERSAL_GARBAGE_H -#endif - -//path: src/dependencies/lua/onelua.c - - - -#ifndef MAKE_LIB -#ifndef MAKE_LUAC -#ifndef MAKE_LUA -#define MAKE_LUA -#endif -#endif -#endif -#include -//path: src/dependencies/lua/custom_math/custom_math.h -double private_lua_cembed_ldexp(double x, int exp); - -double private_lua_cembed_frexp(double x, int *exp); - -double private_lua_cembed_asin(double x); - -double private_lua_cembed_acos(double x); - - -double private_lua_cembed_atan2(double y, double x); - - -double private_lua_cembed_ceil(double x); - - -double private_lua_cembed_sqrt(double x); - -double private_lua_cembed_exp(double x); - -double private_lua_cembed_fabs(double x); - - -double private_lua_cembed_factorial(int n); - -double private_lua_cembed_sin(double x); - - -double private_lua_cembed_cos(double x); - - -double private_lua_cembed_tan(double x); - -double private_lua_cembed_log(double x); - -double private_lua_cembed_log2(double x); - -double private_lua_embed_log10(double x); - -double private_lua_embed_fmod(double x, double y); - -double private_lua_embed_pow(double b, double e); - -double private_lua_embed_floor(double x); - -//path: src/dependencies/lua/custom_math/custom_math.c -double private_lua_cembed_ldexp(double x, int exp) { - if (x == 0.0) return x; - - while (exp > 0) { - x *= 2.0; - exp--; - } - while (exp < 0) { - x *= 0.5; - exp++; - } - - return x; -} - -double private_lua_cembed_frexp(double x, int *exp) { - *exp = 0; - if (x == 0.0) return x; - - while (x >= 1.0 || x < -1.0) { - x *= 0.5; - (*exp)++; - } - while (x < 0.5 && x != 0.0) { - x /= 0.5; - (*exp)--; - } - - return x; -} -double private_lua_cembed_asin(double x) { - if (x <= -1.0 || x >= 1.0) { - return x / 0.0; // Retorna NaN para x fora do intervalo [-1, 1] - } - - return private_lua_cembed_atan2(x, private_lua_cembed_sqrt(1.0 - x * x)); -} - -double private_lua_cembed_acos(double x) { - if (x <= -1.0 || x >= 1.0) { - return x / 0.0; // Retorna NaN para x fora do intervalo [-1, 1] - } - - return 1.5707963267948966 - private_lua_cembed_asin(x); -} - -double private_lua_cembed_atan2(double y, double x) { - if (x == 0.0 && y == 0.0) { - return y / x; // Retorna NaN para x = 0 e y = 0 - } - - double abs_y = private_lua_cembed_fabs(y); - double angle; - if (x >= 0.0) { - double r = (x - abs_y) / (x + abs_y); - angle = 0.7853981633974483 - 0.7853981633974483 * r; - } else { - double r = (x + abs_y) / (abs_y - x); - angle = 2.356194490192345 + 0.7853981633974483 * r; - } - if (y < 0.0) { - return -angle; - } else { - return angle; - } -} - -double private_lua_cembed_ceil(double x) { - double f = private_lua_embed_floor(x); - if (f >= x) { - return f; - } else { - return f + 1.0; - } -} - -double private_lua_cembed_sqrt(double x) { - if (x < 0.0) { - return x / 0.0; // Retorna NaN para x < 0 - } - - double x_half = 0.5 * x; - long i = *(long*)&x; - i = 0x5fe6ec85e7de30da - (i >> 1); - x = *(double*)&i; - x = x * (1.5 - x_half * x * x); - - return 1.0 / x; -} - -double private_lua_cembed_exp(double x) { - double result = 1.0; - double term = 1.0; - int i = 1; - - while (term > 1.0e-15) { - term *= x / i; - result += term; - i++; - } - - return result; -} - -double private_lua_cembed_fabs(double x) { - return x < 0.0 ? -x : x; -} - -double private_lua_cembed_factorial(int n) { - if (n <= 1) { - return 1.0; - } - double result = 1.0; - for (int i = 2; i <= n; ++i) { - result *= i; - } - return result; -} - -double private_lua_cembed_sin(double x) { - double result = 0.0; - int n = 0; - double term = x; - double current_term = term; - double term_squared = term * term; - - while (current_term > 1.0e-15) { - result += current_term; - n += 2; - term *= -term_squared / ((n + 1) * (n + 2)); - current_term = term / private_lua_cembed_factorial(n); - } - - return result; -} - -double private_lua_cembed_cos(double x) { - double result = 0.0; - int n = 0; - double term = 1.0; - double current_term = term; - double term_squared = term * term; - - while (current_term > 1.0e-15) { - result += current_term; - n += 2; - term *= -term_squared / (n * (n + 1)); - current_term = term / private_lua_cembed_factorial(n); - } - - return result; -} - -double private_lua_cembed_tan(double x) { - return private_lua_cembed_sin(x) / private_lua_cembed_cos(x); -} - -double private_lua_cembed_log(double x) { - if (x <= 0.0) { - return -1.0 / 0.0; - } - - double result = 0.0; - double term = (x - 1) / (x + 1); - double current_term = term; - double term_squared = term * term; - int n = 1; - - while (current_term > 1.0e-15) { - result += current_term / n; - current_term *= term_squared; - n += 2; - } - - result *= 2.302585092994046; - return result; -} - -double private_lua_cembed_log2(double x) { - if (x <= 0.0) { - return -1.0 / 0.0; - } - - return private_lua_cembed_log(x) / private_lua_cembed_log(2.0); -} - -double private_lua_embed_log10(double x) { - if (x <= 0.0) { - return -1.0 / 0.0; - } - - return private_lua_cembed_log(x) / private_lua_cembed_log(10.0); -} - -double private_lua_embed_fmod(double x, double y) { - while (y != 0.0) { - while (x >= y) { - x -= y; - } - if (x < y) { - return x; - } - } - return 0.0 / 0.0; -} - -double private_lua_embed_pow(double b, double e) { - double result = 1.0; - int i; - - if (e == 0.0) { - return 1.0; - } - if (e < 0.0) { - b = 1.0 / b; - e = -e; - } - - for (i = 0; i < e; i++) { - result *= b; - } - - return result; -} - -double private_lua_embed_floor(double x) { - int i = (int)x; - - if (x == (double)i) { - return x; - } - - if (x < 0.0) { - return (double)(i - 1); - } - - return (double)i; -} - - - -#if 0 -#define LUA_USE_LINUX -#define LUA_USE_MACOSX -#define LUA_USE_POSIX -#define LUA_ANSI -#endif - - - - -//path: src/dependencies/lua/lprefix.h - - -#ifndef lprefix_h -#define lprefix_h - - - -#if !defined(LUA_USE_C89) - -#if !defined(_XOPEN_SOURCE) -#define _XOPEN_SOURCE 600 -#elif _XOPEN_SOURCE == 0 -#undef _XOPEN_SOURCE -#endif - - -#if !defined(LUA_32BITS) && !defined(_FILE_OFFSET_BITS) -#define _LARGEFILE_SOURCE 1 -#define _FILE_OFFSET_BITS 64 -#endif - -#endif - - - -#if defined(_WIN32) - -#if !defined(_CRT_SECURE_NO_WARNINGS) -#define _CRT_SECURE_NO_WARNINGS -#endif - -#endif - -#endif - - - - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -#ifdef _WIN32 -#include -#else -#include -#include -#endif - - -#define LUA_CORE -#define LUA_LIB -#define ltable_c -#define lvm_c -//path: src/dependencies/lua/luaconf.h - - - -#ifndef luaconf_h -#define luaconf_h - -#include -#include - - - - - - - - - - - - -#if !defined(LUA_USE_C89) && defined(_WIN32) && !defined(_WIN32_WCE) -#define LUA_USE_WINDOWS -#endif - - -#if defined(LUA_USE_WINDOWS) -#define LUA_DL_DLL -#define LUA_USE_C89 -#endif - - -#if defined(LUA_USE_LINUX) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN -#endif - - -#if defined(LUA_USE_MACOSX) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN -#endif - - -#if defined(LUA_USE_IOS) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN -#endif - - - -#define LUAI_IS32INT ((UINT_MAX >> 30) >= 3) - - - - - - - - - - -#define LUA_INT_INT 1 -#define LUA_INT_LONG 2 -#define LUA_INT_LONGLONG 3 - - -#define LUA_FLOAT_FLOAT 1 -#define LUA_FLOAT_DOUBLE 2 -#define LUA_FLOAT_LONGDOUBLE 3 - - - -#define LUA_INT_DEFAULT LUA_INT_LONGLONG -#define LUA_FLOAT_DEFAULT LUA_FLOAT_DOUBLE - - - -#define LUA_32BITS 0 - - - -#if defined(LUA_USE_C89) && !defined(LUA_USE_WINDOWS) -#define LUA_C89_NUMBERS 1 -#else -#define LUA_C89_NUMBERS 0 -#endif - - -#if LUA_32BITS - -#if LUAI_IS32INT -#define LUA_INT_TYPE LUA_INT_INT -#else -#define LUA_INT_TYPE LUA_INT_LONG -#endif -#define LUA_FLOAT_TYPE LUA_FLOAT_FLOAT - -#elif LUA_C89_NUMBERS - -#define LUA_INT_TYPE LUA_INT_LONG -#define LUA_FLOAT_TYPE LUA_FLOAT_DOUBLE - -#else - - -#define LUA_INT_TYPE LUA_INT_DEFAULT -#define LUA_FLOAT_TYPE LUA_FLOAT_DEFAULT - -#endif - - - - - - - - - -#define LUA_PATH_SEP ";" -#define LUA_PATH_MARK "?" -#define LUA_EXEC_DIR "!" - - - - -#define LUA_VDIR LUA_VERSION_MAJOR "." LUA_VERSION_MINOR -#if defined(_WIN32) - -#define LUA_LDIR "!\\lua\\" -#define LUA_CDIR "!\\" -#define LUA_SHRDIR "!\\..\\share\\lua\\" LUA_VDIR "\\" - -#if !defined(LUA_PATH_DEFAULT) -#define LUA_PATH_DEFAULT \ - LUA_LDIR"?.lua;" LUA_LDIR"?\\init.lua;" \ - LUA_CDIR"?.lua;" LUA_CDIR"?\\init.lua;" \ - LUA_SHRDIR"?.lua;" LUA_SHRDIR"?\\init.lua;" \ - ".\\?.lua;" ".\\?\\init.lua" -#endif - -#if !defined(LUA_CPATH_DEFAULT) -#define LUA_CPATH_DEFAULT \ - LUA_CDIR"?.dll;" \ - LUA_CDIR"..\\lib\\lua\\" LUA_VDIR "\\?.dll;" \ - LUA_CDIR"loadall.dll;" ".\\?.dll" -#endif - -#else - -#define LUA_ROOT "/usr/local/" -#define LUA_LDIR LUA_ROOT "share/lua/" LUA_VDIR "/" -#define LUA_CDIR LUA_ROOT "lib/lua/" LUA_VDIR "/" - -#if !defined(LUA_PATH_DEFAULT) -#define LUA_PATH_DEFAULT \ - LUA_LDIR"?.lua;" LUA_LDIR"?/init.lua;" \ - LUA_CDIR"?.lua;" LUA_CDIR"?/init.lua;" \ - "./?.lua;" "./?/init.lua" -#endif - -#if !defined(LUA_CPATH_DEFAULT) -#define LUA_CPATH_DEFAULT \ - LUA_CDIR"?.so;" LUA_CDIR"loadall.so;" "./?.so" -#endif - -#endif - - - -#if !defined(LUA_DIRSEP) - -#if defined(_WIN32) -#define LUA_DIRSEP "\\" -#else -#define LUA_DIRSEP "/" -#endif - -#endif - - - -#define LUA_IGMARK "-" - - - - - - - -#if defined(LUA_BUILD_AS_DLL) - -#if defined(LUA_CORE) || defined(LUA_LIB) -#define LUA_API __declspec(dllexport) -#else -#define LUA_API __declspec(dllimport) -#endif - -#else - -#define LUA_API extern - -#endif - - - -#define LUALIB_API LUA_API -#define LUAMOD_API LUA_API - - - -#if defined(__GNUC__) && ((__GNUC__*100 + __GNUC_MINOR__) >= 302) && \ - defined(__ELF__) -#define LUAI_FUNC __attribute__((visibility("internal"))) extern -#else -#define LUAI_FUNC extern -#endif - -#define LUAI_DDEC(dec) LUAI_FUNC dec -#define LUAI_DDEF - - - - - - - -#if defined(LUA_COMPAT_5_3) - - -#define LUA_COMPAT_MATHLIB - - -#define LUA_COMPAT_APIINTCASTS - - - -#define LUA_COMPAT_LT_LE - - - -#define lua_strlen(L,i) lua_rawlen(L, (i)) - -#define lua_objlen(L,i) lua_rawlen(L, (i)) - -#define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ) -#define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT) - -#endif - - - - - - - - - - - - -#define l_floor(x) (l_mathop(private_lua_embed_floor)(x)) - -#define lua_number2str(s,sz,n) \ - l_sprintf((s), sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)(n)) - - -#define lua_numbertointeger(n,p) \ - ((n) >= (LUA_NUMBER)(LUA_MININTEGER) && \ - (n) < -(LUA_NUMBER)(LUA_MININTEGER) && \ - (*(p) = (LUA_INTEGER)(n), 1)) - - - - -#if LUA_FLOAT_TYPE == LUA_FLOAT_FLOAT - -#define LUA_NUMBER float - -#define l_floatatt(n) (FLT_##n) - -#define LUAI_UACNUMBER double - -#define LUA_NUMBER_FRMLEN "" -#define LUA_NUMBER_FMT "%.7g" - -#define l_mathop(op) op##f - -#define lua_str2number(s,p) strtof((s), (p)) - - -#elif LUA_FLOAT_TYPE == LUA_FLOAT_LONGDOUBLE - -#define LUA_NUMBER long double - -#define l_floatatt(n) (LDBL_##n) - -#define LUAI_UACNUMBER long double - -#define LUA_NUMBER_FRMLEN "L" -#define LUA_NUMBER_FMT "%.19Lg" - -#define l_mathop(op) op##l - -#define lua_str2number(s,p) strtold((s), (p)) - -#elif LUA_FLOAT_TYPE == LUA_FLOAT_DOUBLE - -#define LUA_NUMBER double - -#define l_floatatt(n) (DBL_##n) - -#define LUAI_UACNUMBER double - -#define LUA_NUMBER_FRMLEN "" -#define LUA_NUMBER_FMT "%.14g" - -#define l_mathop(op) op - -#define lua_str2number(s,p) strtod((s), (p)) - -#else - -#error "numeric float type not defined" - -#endif - - - - - - - - -#define LUA_INTEGER_FMT "%" LUA_INTEGER_FRMLEN "d" - -#define LUAI_UACINT LUA_INTEGER - -#define lua_integer2str(s,sz,n) \ - l_sprintf((s), sz, LUA_INTEGER_FMT, (LUAI_UACINT)(n)) - - -#define LUA_UNSIGNED unsigned LUAI_UACINT - - - - -#if LUA_INT_TYPE == LUA_INT_INT - -#define LUA_INTEGER int -#define LUA_INTEGER_FRMLEN "" - -#define LUA_MAXINTEGER INT_MAX -#define LUA_MININTEGER INT_MIN - -#define LUA_MAXUNSIGNED UINT_MAX - -#elif LUA_INT_TYPE == LUA_INT_LONG - -#define LUA_INTEGER long -#define LUA_INTEGER_FRMLEN "l" - -#define LUA_MAXINTEGER LONG_MAX -#define LUA_MININTEGER LONG_MIN - -#define LUA_MAXUNSIGNED ULONG_MAX - -#elif LUA_INT_TYPE == LUA_INT_LONGLONG - - -#if defined(LLONG_MAX) - - -#define LUA_INTEGER long long -#define LUA_INTEGER_FRMLEN "ll" - -#define LUA_MAXINTEGER LLONG_MAX -#define LUA_MININTEGER LLONG_MIN - -#define LUA_MAXUNSIGNED ULLONG_MAX - -#elif defined(LUA_USE_WINDOWS) - - -#define LUA_INTEGER __int64 -#define LUA_INTEGER_FRMLEN "I64" - -#define LUA_MAXINTEGER _I64_MAX -#define LUA_MININTEGER _I64_MIN - -#define LUA_MAXUNSIGNED _UI64_MAX - -#else - -#error "Compiler does not support 'long long'. Use option '-DLUA_32BITS' \ - or '-DLUA_C89_NUMBERS' (see file 'luaconf.h' for details)" - -#endif - -#else - -#error "numeric integer type not defined" - -#endif - - - - - - - -#if !defined(LUA_USE_C89) -#define l_sprintf(s,sz,f,i) snprintf(s,sz,f,i) -#else -#define l_sprintf(s,sz,f,i) ((void)(sz), sprintf(s,f,i)) -#endif - - - -#if !defined(LUA_USE_C89) -#define lua_strx2number(s,p) lua_str2number(s,p) -#endif - - - -#define lua_pointer2str(buff,sz,p) l_sprintf(buff,sz,"%p",p) - - - -#if !defined(LUA_USE_C89) -#define lua_number2strx(L,b,sz,f,n) \ - ((void)L, l_sprintf(b,sz,f,(LUAI_UACNUMBER)(n))) -#endif - - - -#if defined(LUA_USE_C89) || (defined(HUGE_VAL) && !defined(HUGE_VALF)) -#undef l_mathop -#undef lua_str2number -#define l_mathop(op) (lua_Number)op -#define lua_str2number(s,p) ((lua_Number)strtod((s), (p))) -#endif - - - -#define LUA_KCONTEXT ptrdiff_t - -#if !defined(LUA_USE_C89) && defined(__STDC_VERSION__) && \ - __STDC_VERSION__ >= 199901L -#include -#if defined(INTPTR_MAX) -#undef LUA_KCONTEXT -#define LUA_KCONTEXT intptr_t -#endif -#endif - - - -#if !defined(lua_getlocaledecpoint) -#define lua_getlocaledecpoint() (localeconv()->decimal_point[0]) -#endif - - - -#if !defined(luai_likely) - -#if defined(__GNUC__) && !defined(LUA_NOBUILTIN) -#define luai_likely(x) (__builtin_expect(((x) != 0), 1)) -#define luai_unlikely(x) (__builtin_expect(((x) != 0), 0)) -#else -#define luai_likely(x) (x) -#define luai_unlikely(x) (x) -#endif - -#endif - - -#if defined(LUA_CORE) || defined(LUA_LIB) - -#define l_likely(x) luai_likely(x) -#define l_unlikely(x) luai_unlikely(x) -#endif - - - - - - - - - - - - - - -#if defined(LUA_USE_APICHECK) -#include -#define luai_apicheck(l,e) assert(e) -#endif - - - - - - - -#if LUAI_IS32INT -#define LUAI_MAXSTACK 1000000 -#else -#define LUAI_MAXSTACK 15000 -#endif - - - -#define LUA_EXTRASPACE (sizeof(void *)) - - - -#define LUA_IDSIZE 60 - - - -#define LUAL_BUFFERSIZE ((int)(16 * sizeof(void*) * sizeof(lua_Number))) - - - -#define LUAI_MAXALIGN lua_Number n; double u; void *s; lua_Integer i; long l - - - - - - - - - - - - - - - -#endif - - - - - -#undef LUAI_FUNC -#undef LUAI_DDEC -#undef LUAI_DDEF -#define LUAI_FUNC static -#define LUAI_DDEC(def) -#define LUAI_DDEF static - - -//path: src/dependencies/lua/lzio.c - - -#define lzio_c -#define LUA_CORE - - - -#include - -//path: src/dependencies/lua/lua.h - - - -#ifndef lua_h -#define lua_h - -#include -#include - - -#define LUA_COPYRIGHT LUA_RELEASE " Copyright (C) 1994-2023 Lua.org, PUC-Rio" -#define LUA_AUTHORS "R. Ierusalimschy, L. H. de Figueiredo, W. Celes" - - -#define LUA_VERSION_MAJOR_N 5 -#define LUA_VERSION_MINOR_N 5 -#define LUA_VERSION_RELEASE_N 0 - -#define LUA_VERSION_NUM (LUA_VERSION_MAJOR_N * 100 + LUA_VERSION_MINOR_N) -#define LUA_VERSION_RELEASE_NUM (LUA_VERSION_NUM * 100 + LUA_VERSION_RELEASE_N) - - - - - - - -#define LUA_SIGNATURE "\x1bLua" - - -#define LUA_MULTRET (-1) - - - -#define LUA_REGISTRYINDEX (-LUAI_MAXSTACK - 1000) -#define lua_upvalueindex(i) (LUA_REGISTRYINDEX - (i)) - - - -#define LUA_OK 0 -#define LUA_YIELD 1 -#define LUA_ERRRUN 2 -#define LUA_ERRSYNTAX 3 -#define LUA_ERRMEM 4 -#define LUA_ERRERR 5 - - -typedef struct lua_State lua_State; - - - -#define LUA_TNONE (-1) - -#define LUA_TNIL 0 -#define LUA_TBOOLEAN 1 -#define LUA_TLIGHTUSERDATA 2 -#define LUA_TNUMBER 3 -#define LUA_TSTRING 4 -#define LUA_TTABLE 5 -#define LUA_TFUNCTION 6 -#define LUA_TUSERDATA 7 -#define LUA_TTHREAD 8 - -#define LUA_NUMTYPES 9 - - - - -#define LUA_MINSTACK 20 - - - - -#define LUA_RIDX_GLOBALS 2 -#define LUA_RIDX_MAINTHREAD 3 -#define LUA_RIDX_LAST 3 - - - -typedef LUA_NUMBER lua_Number; - - - -typedef LUA_INTEGER lua_Integer; - - -typedef LUA_UNSIGNED lua_Unsigned; - - -typedef LUA_KCONTEXT lua_KContext; - - - -typedef int (*lua_CFunction) (lua_State *L); - - -typedef int (*lua_KFunction) (lua_State *L, int status, lua_KContext ctx); - - - -typedef const char * (*lua_Reader) (lua_State *L, void *ud, size_t *sz); - -typedef int (*lua_Writer) (lua_State *L, const void *p, size_t sz, void *ud); - - - -typedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize); - - - -typedef void (*lua_WarnFunction) (void *ud, const char *msg, int tocont); - - - -typedef struct lua_Debug lua_Debug; - - - -typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar); - - - - -extern const char lua_ident[]; - - - -LUA_API lua_State *(lua_newstate) (lua_Alloc f, void *ud, unsigned seed); -LUA_API void (lua_close) (lua_State *L); -LUA_API lua_State *(lua_newthread) (lua_State *L); -LUA_API int (lua_closethread) (lua_State *L, lua_State *from); - -LUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf); - - -LUA_API lua_Number (lua_version) (lua_State *L); - - - -LUA_API int (lua_absindex) (lua_State *L, int idx); -LUA_API int (lua_gettop) (lua_State *L); -LUA_API void (lua_settop) (lua_State *L, int idx); -LUA_API void (lua_pushvalue) (lua_State *L, int idx); -LUA_API void (lua_rotate) (lua_State *L, int idx, int n); -LUA_API void (lua_copy) (lua_State *L, int fromidx, int toidx); -LUA_API int (lua_checkstack) (lua_State *L, int n); - -LUA_API void (lua_xmove) (lua_State *from, lua_State *to, int n); - - - - -LUA_API int (lua_isnumber) (lua_State *L, int idx); -LUA_API int (lua_isstring) (lua_State *L, int idx); -LUA_API int (lua_iscfunction) (lua_State *L, int idx); -LUA_API int (lua_isinteger) (lua_State *L, int idx); -LUA_API int (lua_isuserdata) (lua_State *L, int idx); -LUA_API int (lua_type) (lua_State *L, int idx); -LUA_API const char *(lua_typename) (lua_State *L, int tp); - -LUA_API lua_Number (lua_tonumberx) (lua_State *L, int idx, int *isnum); -LUA_API lua_Integer (lua_tointegerx) (lua_State *L, int idx, int *isnum); -LUA_API int (lua_toboolean) (lua_State *L, int idx); -LUA_API const char *(lua_tolstring) (lua_State *L, int idx, size_t *len); -LUA_API lua_Unsigned (lua_rawlen) (lua_State *L, int idx); -LUA_API lua_CFunction (lua_tocfunction) (lua_State *L, int idx); -LUA_API void *(lua_touserdata) (lua_State *L, int idx); -LUA_API lua_State *(lua_tothread) (lua_State *L, int idx); -LUA_API const void *(lua_topointer) (lua_State *L, int idx); - - - - -#define LUA_OPADD 0 -#define LUA_OPSUB 1 -#define LUA_OPMUL 2 -#define LUA_OPMOD 3 -#define LUA_OPPOW 4 -#define LUA_OPDIV 5 -#define LUA_OPIDIV 6 -#define LUA_OPBAND 7 -#define LUA_OPBOR 8 -#define LUA_OPBXOR 9 -#define LUA_OPSHL 10 -#define LUA_OPSHR 11 -#define LUA_OPUNM 12 -#define LUA_OPBNOT 13 - -LUA_API void (lua_arith) (lua_State *L, int op); - -#define LUA_OPEQ 0 -#define LUA_OPLT 1 -#define LUA_OPLE 2 - -LUA_API int (lua_rawequal) (lua_State *L, int idx1, int idx2); -LUA_API int (lua_compare) (lua_State *L, int idx1, int idx2, int op); - - - -LUA_API void (lua_pushnil) (lua_State *L); -LUA_API void (lua_pushnumber) (lua_State *L, lua_Number n); -LUA_API void (lua_pushinteger) (lua_State *L, lua_Integer n); -LUA_API const char *(lua_pushlstring) (lua_State *L, const char *s, size_t len); -LUA_API const char *(lua_pushextlstring) (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud); -LUA_API const char *(lua_pushstring) (lua_State *L, const char *s); -LUA_API const char *(lua_pushvfstring) (lua_State *L, const char *fmt, - va_list argp); -LUA_API const char *(lua_pushfstring) (lua_State *L, const char *fmt, ...); -LUA_API void (lua_pushcclosure) (lua_State *L, lua_CFunction fn, int n); -LUA_API void (lua_pushboolean) (lua_State *L, int b); -LUA_API void (lua_pushlightuserdata) (lua_State *L, void *p); -LUA_API int (lua_pushthread) (lua_State *L); - - - -LUA_API int (lua_getglobal) (lua_State *L, const char *name); -LUA_API int (lua_gettable) (lua_State *L, int idx); -LUA_API int (lua_getfield) (lua_State *L, int idx, const char *k); -LUA_API int (lua_geti) (lua_State *L, int idx, lua_Integer n); -LUA_API int (lua_rawget) (lua_State *L, int idx); -LUA_API int (lua_rawgeti) (lua_State *L, int idx, lua_Integer n); -LUA_API int (lua_rawgetp) (lua_State *L, int idx, const void *p); - -LUA_API void (lua_createtable) (lua_State *L, unsigned narr, unsigned nrec); -LUA_API void *(lua_newuserdatauv) (lua_State *L, size_t sz, int nuvalue); -LUA_API int (lua_getmetatable) (lua_State *L, int objindex); -LUA_API int (lua_getiuservalue) (lua_State *L, int idx, int n); - - - -LUA_API void (lua_setglobal) (lua_State *L, const char *name); -LUA_API void (lua_settable) (lua_State *L, int idx); -LUA_API void (lua_setfield) (lua_State *L, int idx, const char *k); -LUA_API void (lua_seti) (lua_State *L, int idx, lua_Integer n); -LUA_API void (lua_rawset) (lua_State *L, int idx); -LUA_API void (lua_rawseti) (lua_State *L, int idx, lua_Integer n); -LUA_API void (lua_rawsetp) (lua_State *L, int idx, const void *p); -LUA_API int (lua_setmetatable) (lua_State *L, int objindex); -LUA_API int (lua_setiuservalue) (lua_State *L, int idx, int n); - - - -LUA_API void (lua_callk) (lua_State *L, int nargs, int nresults, - lua_KContext ctx, lua_KFunction k); -#define lua_call(L,n,r) lua_callk(L, (n), (r), 0, NULL) - -LUA_API int (lua_pcallk) (lua_State *L, int nargs, int nresults, int errfunc, - lua_KContext ctx, lua_KFunction k); -#define lua_pcall(L,n,r,f) lua_pcallk(L, (n), (r), (f), 0, NULL) - -LUA_API int (lua_load) (lua_State *L, lua_Reader reader, void *dt, - const char *chunkname, const char *mode); - -LUA_API int (lua_dump) (lua_State *L, lua_Writer writer, void *data, int strip); - - - -LUA_API int (lua_yieldk) (lua_State *L, int nresults, lua_KContext ctx, - lua_KFunction k); -LUA_API int (lua_resume) (lua_State *L, lua_State *from, int narg, - int *nres); -LUA_API int (lua_status) (lua_State *L); -LUA_API int (lua_isyieldable) (lua_State *L); - -#define lua_yield(L,n) lua_yieldk(L, (n), 0, NULL) - - - -LUA_API void (lua_setwarnf) (lua_State *L, lua_WarnFunction f, void *ud); -LUA_API void (lua_warning) (lua_State *L, const char *msg, int tocont); - - - - -#define LUA_GCSTOP 0 -#define LUA_GCRESTART 1 -#define LUA_GCCOLLECT 2 -#define LUA_GCCOUNT 3 -#define LUA_GCCOUNTB 4 -#define LUA_GCSTEP 5 -#define LUA_GCISRUNNING 6 -#define LUA_GCGEN 7 -#define LUA_GCINC 8 -#define LUA_GCPARAM 9 - - - - -#define LUA_GCPMINORMUL 0 -#define LUA_GCPMAJORMINOR 1 -#define LUA_GCPMINORMAJOR 2 - - -#define LUA_GCPPAUSE 3 -#define LUA_GCPSTEPMUL 4 -#define LUA_GCPSTEPSIZE 5 - - -#define LUA_GCPN 6 - - -LUA_API int (lua_gc) (lua_State *L, int what, ...); - - - - -LUA_API int (lua_error) (lua_State *L); - -LUA_API int (lua_next) (lua_State *L, int idx); - -LUA_API void (lua_concat) (lua_State *L, int n); -LUA_API void (lua_len) (lua_State *L, int idx); - -LUA_API size_t (lua_stringtonumber) (lua_State *L, const char *s); - -LUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud); -LUA_API void (lua_setallocf) (lua_State *L, lua_Alloc f, void *ud); - -LUA_API void (lua_toclose) (lua_State *L, int idx); -LUA_API void (lua_closeslot) (lua_State *L, int idx); - - - - -#define lua_getextraspace(L) ((void *)((char *)(L) - LUA_EXTRASPACE)) - -#define lua_tonumber(L,i) lua_tonumberx(L,(i),NULL) -#define lua_tointeger(L,i) lua_tointegerx(L,(i),NULL) - -#define lua_pop(L,n) lua_settop(L, -(n)-1) - -#define lua_newtable(L) lua_createtable(L, 0, 0) - -#define lua_register(L,n,f) (lua_pushcfunction(L, (f)), lua_setglobal(L, (n))) - -#define lua_pushcfunction(L,f) lua_pushcclosure(L, (f), 0) - -#define lua_isfunction(L,n) (lua_type(L, (n)) == LUA_TFUNCTION) -#define lua_istable(L,n) (lua_type(L, (n)) == LUA_TTABLE) -#define lua_islightuserdata(L,n) (lua_type(L, (n)) == LUA_TLIGHTUSERDATA) -#define lua_isnil(L,n) (lua_type(L, (n)) == LUA_TNIL) -#define lua_isboolean(L,n) (lua_type(L, (n)) == LUA_TBOOLEAN) -#define lua_isthread(L,n) (lua_type(L, (n)) == LUA_TTHREAD) -#define lua_isnone(L,n) (lua_type(L, (n)) == LUA_TNONE) -#define lua_isnoneornil(L, n) (lua_type(L, (n)) <= 0) - -#define lua_pushliteral(L, s) lua_pushstring(L, "" s) - -#define lua_pushglobaltable(L) \ - ((void)lua_rawgeti(L, LUA_REGISTRYINDEX, LUA_RIDX_GLOBALS)) - -#define lua_tostring(L,i) lua_tolstring(L, (i), NULL) - - -#define lua_insert(L,idx) lua_rotate(L, (idx), 1) - -#define lua_remove(L,idx) (lua_rotate(L, (idx), -1), lua_pop(L, 1)) - -#define lua_replace(L,idx) (lua_copy(L, -1, (idx)), lua_pop(L, 1)) - - - - - -#if defined(LUA_COMPAT_APIINTCASTS) - -#define lua_pushunsigned(L,n) lua_pushinteger(L, (lua_Integer)(n)) -#define lua_tounsignedx(L,i,is) ((lua_Unsigned)lua_tointegerx(L,i,is)) -#define lua_tounsigned(L,i) lua_tounsignedx(L,(i),NULL) - -#endif - -#define lua_newuserdata(L,s) lua_newuserdatauv(L,s,1) -#define lua_getuservalue(L,idx) lua_getiuservalue(L,idx,1) -#define lua_setuservalue(L,idx) lua_setiuservalue(L,idx,1) - -#define lua_resetthread(L) lua_closethread(L,NULL) - - - - - - - -#define LUA_HOOKCALL 0 -#define LUA_HOOKRET 1 -#define LUA_HOOKLINE 2 -#define LUA_HOOKCOUNT 3 -#define LUA_HOOKTAILCALL 4 - - - -#define LUA_MASKCALL (1 << LUA_HOOKCALL) -#define LUA_MASKRET (1 << LUA_HOOKRET) -#define LUA_MASKLINE (1 << LUA_HOOKLINE) -#define LUA_MASKCOUNT (1 << LUA_HOOKCOUNT) - - -LUA_API int (lua_getstack) (lua_State *L, int level, lua_Debug *ar); -LUA_API int (lua_getinfo) (lua_State *L, const char *what, lua_Debug *ar); -LUA_API const char *(lua_getlocal) (lua_State *L, const lua_Debug *ar, int n); -LUA_API const char *(lua_setlocal) (lua_State *L, const lua_Debug *ar, int n); -LUA_API const char *(lua_getupvalue) (lua_State *L, int funcindex, int n); -LUA_API const char *(lua_setupvalue) (lua_State *L, int funcindex, int n); - -LUA_API void *(lua_upvalueid) (lua_State *L, int fidx, int n); -LUA_API void (lua_upvaluejoin) (lua_State *L, int fidx1, int n1, - int fidx2, int n2); - -LUA_API void (lua_sethook) (lua_State *L, lua_Hook func, int mask, int count); -LUA_API lua_Hook (lua_gethook) (lua_State *L); -LUA_API int (lua_gethookmask) (lua_State *L); -LUA_API int (lua_gethookcount) (lua_State *L); - - -struct lua_Debug { - int event; - const char *name; - const char *namewhat; - const char *what; - const char *source; - size_t srclen; - int currentline; - int linedefined; - int lastlinedefined; - unsigned char nups; - unsigned char nparams; - char isvararg; - char istailcall; - unsigned short ftransfer; - unsigned short ntransfer; - char short_src[LUA_IDSIZE]; - - struct CallInfo *i_ci; -}; - - - - -#define LUAI_TOSTRAUX(x) #x -#define LUAI_TOSTR(x) LUAI_TOSTRAUX(x) - -#define LUA_VERSION_MAJOR LUAI_TOSTR(LUA_VERSION_MAJOR_N) -#define LUA_VERSION_MINOR LUAI_TOSTR(LUA_VERSION_MINOR_N) -#define LUA_VERSION_RELEASE LUAI_TOSTR(LUA_VERSION_RELEASE_N) - -#define LUA_VERSION "Lua " LUA_VERSION_MAJOR "." LUA_VERSION_MINOR -#define LUA_RELEASE LUA_VERSION "." LUA_VERSION_RELEASE - - - - - -#endif - - - -//path: src/dependencies/lua/llimits.h - - -#ifndef llimits_h -#define llimits_h - - -#include -#include - - - - - - - -#if defined(LUAI_MEM) -typedef LUAI_UMEM lu_mem; -typedef LUAI_MEM l_obj; -#elif LUAI_IS32INT -typedef size_t lu_mem; -typedef ptrdiff_t l_obj; -#else -typedef unsigned long lu_mem; -typedef long l_obj; -#endif - -#define MAX_LOBJ \ - cast(l_obj, (cast(lu_mem, 1) << (sizeof(l_obj) * CHAR_BIT - 1)) - 1) - - - -typedef unsigned char lu_byte; -typedef signed char ls_byte; - - - -#define MAX_SIZET ((size_t)(~(size_t)0)) - - -#define MAX_SIZE (sizeof(size_t) < sizeof(lua_Integer) ? MAX_SIZET \ - : (size_t)(LUA_MAXINTEGER)) - - -#define MAX_INT INT_MAX - - - -#define log2maxs(t) cast_int(sizeof(t) * 8 - 2) - - - -#define ispow2(x) (((x) & ((x) - 1)) == 0) - - - -#define LL(x) (sizeof(x)/sizeof(char) - 1) - - - -#if !defined(LUA_USE_C89) && defined(__STDC_VERSION__) && \ - __STDC_VERSION__ >= 199901L -#include -#if defined(UINTPTR_MAX) -#define L_P2I uintptr_t -#else -#define L_P2I uintmax_t -#endif -#else -#define L_P2I size_t -#endif - -#define point2uint(p) cast_uint((L_P2I)(p) & UINT_MAX) - - - - -typedef LUAI_UACNUMBER l_uacNumber; -typedef LUAI_UACINT l_uacInt; - - - -#if defined LUAI_ASSERT -#undef NDEBUG -#include -#define lua_assert(c) assert(c) -#endif - -#if defined(lua_assert) -#define check_exp(c,e) (lua_assert(c), (e)) - -#define lua_longassert(c) ((c) ? (void)0 : lua_assert(0)) -#else -#define lua_assert(c) ((void)0) -#define check_exp(c,e) (e) -#define lua_longassert(c) ((void)0) -#endif - - -#if !defined(luai_apicheck) -#define luai_apicheck(l,e) ((void)l, lua_assert(e)) -#endif - -#define api_check(l,e,msg) luai_apicheck(l,(e) && msg) - - - -#if !defined(UNUSED) -#define UNUSED(x) ((void)(x)) -#endif - - - -#define cast(t, exp) ((t)(exp)) - -#define cast_void(i) cast(void, (i)) -#define cast_voidp(i) cast(void *, (i)) -#define cast_num(i) cast(lua_Number, (i)) -#define cast_int(i) cast(int, (i)) -#define cast_uint(i) cast(unsigned int, (i)) -#define cast_byte(i) cast(lu_byte, (i)) -#define cast_uchar(i) cast(unsigned char, (i)) -#define cast_char(i) cast(char, (i)) -#define cast_charp(i) cast(char *, (i)) -#define cast_sizet(i) cast(size_t, (i)) - - - -#if !defined(l_castS2U) -#define l_castS2U(i) ((lua_Unsigned)(i)) -#endif - - -#if !defined(l_castU2S) -#define l_castU2S(i) ((lua_Integer)(i)) -#endif - - - -#if !defined(l_noret) - -#if defined(__GNUC__) -#define l_noret void __attribute__((noreturn)) -#elif defined(_MSC_VER) && _MSC_VER >= 1200 -#define l_noret void __declspec(noreturn) -#else -#define l_noret void -#endif - -#endif - - - -#if !defined(LUA_USE_C89) -#define l_inline inline -#elif defined(__GNUC__) -#define l_inline __inline__ -#else -#define l_inline -#endif - -#define l_sinline static l_inline - - - -#if LUAI_IS32INT -typedef unsigned int l_uint32; -#else -typedef unsigned long l_uint32; -#endif - -typedef l_uint32 Instruction; - - - - -#if !defined(LUAI_MAXSHORTLEN) -#define LUAI_MAXSHORTLEN 40 -#endif - - - -#if !defined(MINSTRTABSIZE) -#define MINSTRTABSIZE 128 -#endif - - - -#if !defined(STRCACHE_N) -#define STRCACHE_N 53 -#define STRCACHE_M 2 -#endif - - - -#if !defined(LUA_MINBUFFER) -#define LUA_MINBUFFER 32 -#endif - - - -#if !defined(LUAI_MAXCCALLS) -#define LUAI_MAXCCALLS 200 -#endif - - - -#if !defined(lua_lock) -#define lua_lock(L) ((void) 0) -#define lua_unlock(L) ((void) 0) -#endif - - -#if !defined(luai_threadyield) -#define luai_threadyield(L) {lua_unlock(L); lua_lock(L);} -#endif - - - -#if !defined(luai_userstateopen) -#define luai_userstateopen(L) ((void)L) -#endif - -#if !defined(luai_userstateclose) -#define luai_userstateclose(L) ((void)L) -#endif - -#if !defined(luai_userstatethread) -#define luai_userstatethread(L,L1) ((void)L) -#endif - -#if !defined(luai_userstatefree) -#define luai_userstatefree(L,L1) ((void)L) -#endif - -#if !defined(luai_userstateresume) -#define luai_userstateresume(L,n) ((void)L) -#endif - -#if !defined(luai_userstateyield) -#define luai_userstateyield(L,n) ((void)L) -#endif - - - - - - -#if !defined(luai_numidiv) -#define luai_numidiv(L,a,b) ((void)L, l_floor(luai_numdiv(L,a,b))) -#endif - - -#if !defined(luai_numdiv) -#define luai_numdiv(L,a,b) ((a)/(b)) -#endif - - -#if !defined(luai_nummod) -#define luai_nummod(L,a,b,m) \ - { (void)L; (m) = l_mathop(private_lua_embed_fmod)(a,b); \ - if (((m) > 0) ? (b) < 0 : ((m) < 0 && (b) > 0)) (m) += (b); } -#endif - - -#if !defined(luai_numpow) -#define luai_numpow(L,a,b) \ - ((void)L, (b == 2) ? (a)*(a) : l_mathop(private_lua_embed_pow)(a,b)) -#endif - - -#if !defined(luai_numadd) -#define luai_numadd(L,a,b) ((a)+(b)) -#define luai_numsub(L,a,b) ((a)-(b)) -#define luai_nummul(L,a,b) ((a)*(b)) -#define luai_numunm(L,a) (-(a)) -#define luai_numeq(a,b) ((a)==(b)) -#define luai_numlt(a,b) ((a)<(b)) -#define luai_numle(a,b) ((a)<=(b)) -#define luai_numgt(a,b) ((a)>(b)) -#define luai_numge(a,b) ((a)>=(b)) -#define luai_numisnan(a) (!luai_numeq((a), (a))) -#endif - - - - - - -#if !defined(HARDSTACKTESTS) -#define condmovestack(L,pre,pos) ((void)0) -#else - -#define condmovestack(L,pre,pos) \ - { int sz_ = stacksize(L); pre; luaD_reallocstack((L), sz_, 0); pos; } -#endif - -#if !defined(HARDMEMTESTS) -#define condchangemem(L,pre,pos) ((void)0) -#else -#define condchangemem(L,pre,pos) \ - { if (gcrunning(G(L))) { pre; luaC_fullgc(L, 0); pos; } } -#endif - -#endif - - -//path: src/dependencies/lua/lmem.h - - -#ifndef lmem_h -#define lmem_h - - -#include - - - - - - - -#define luaM_error(L) luaD_throw(L, LUA_ERRMEM) - - - -#define luaM_testsize(n,e) \ - (sizeof(n) >= sizeof(size_t) && cast_sizet((n)) + 1 > MAX_SIZET/(e)) - -#define luaM_checksize(L,n,e) \ - (luaM_testsize(n,e) ? luaM_toobig(L) : cast_void(0)) - - - -#define luaM_limitN(n,t) \ - ((cast_sizet(n) <= MAX_SIZET/sizeof(t)) ? (n) : \ - cast_uint((MAX_SIZET/sizeof(t)))) - - - -#define luaM_reallocvchar(L,b,on,n) \ - cast_charp(luaM_saferealloc_(L, (b), (on)*sizeof(char), (n)*sizeof(char))) - -#define luaM_freemem(L, b, s) luaM_free_(L, (b), (s)) -#define luaM_free(L, b) luaM_free_(L, (b), sizeof(*(b))) -#define luaM_freearray(L, b, n) luaM_free_(L, (b), (n)*sizeof(*(b))) - -#define luaM_new(L,t) cast(t*, luaM_malloc_(L, sizeof(t), 0)) -#define luaM_newvector(L,n,t) cast(t*, luaM_malloc_(L, (n)*sizeof(t), 0)) -#define luaM_newvectorchecked(L,n,t) \ - (luaM_checksize(L,n,sizeof(t)), luaM_newvector(L,n,t)) - -#define luaM_newobject(L,tag,s) luaM_malloc_(L, (s), tag) - -#define luaM_newblock(L, size) luaM_newvector(L, size, char) - -#define luaM_growvector(L,v,nelems,size,t,limit,e) \ - ((v)=cast(t *, luaM_growaux_(L,v,nelems,&(size),sizeof(t), \ - luaM_limitN(limit,t),e))) - -#define luaM_reallocvector(L, v,oldn,n,t) \ - (cast(t *, luaM_realloc_(L, v, cast_sizet(oldn) * sizeof(t), \ - cast_sizet(n) * sizeof(t)))) - -#define luaM_shrinkvector(L,v,size,fs,t) \ - ((v)=cast(t *, luaM_shrinkvector_(L, v, &(size), fs, sizeof(t)))) - -LUAI_FUNC l_noret luaM_toobig (lua_State *L); - - -LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize, - size_t size); -LUAI_FUNC void *luaM_saferealloc_ (lua_State *L, void *block, size_t oldsize, - size_t size); -LUAI_FUNC void luaM_free_ (lua_State *L, void *block, size_t osize); -LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int nelems, - int *size, int size_elem, int limit, - const char *what); -LUAI_FUNC void *luaM_shrinkvector_ (lua_State *L, void *block, int *nelem, - int final_n, int size_elem); -LUAI_FUNC void *luaM_malloc_ (lua_State *L, size_t size, int tag); - -#endif - - - -//path: src/dependencies/lua/lstate.h - - -#ifndef lstate_h -#define lstate_h - - - - - - -typedef struct CallInfo CallInfo; - - -//path: src/dependencies/lua/lobject.h - - - -#ifndef lobject_h -#define lobject_h - - -#include - - - - - - - - - -#define LUA_TUPVAL LUA_NUMTYPES -#define LUA_TPROTO (LUA_NUMTYPES+1) -#define LUA_TDEADKEY (LUA_NUMTYPES+2) - - - - -#define LUA_TOTALTYPES (LUA_TPROTO + 2) - - - - - -#define makevariant(t,v) ((t) | ((v) << 4)) - - - - -typedef union Value { - struct GCObject *gc; - void *p; - lua_CFunction f; - lua_Integer i; - lua_Number n; - - lu_byte ub; -} Value; - - - - -#define TValuefields Value value_; lu_byte tt_ - -typedef struct TValue { - TValuefields; -} TValue; - - -#define val_(o) ((o)->value_) -#define valraw(o) (val_(o)) - - - -#define rawtt(o) ((o)->tt_) - - -#define novariant(t) ((t) & 0x0F) - - -#define withvariant(t) ((t) & 0x3F) -#define ttypetag(o) withvariant(rawtt(o)) - - -#define ttype(o) (novariant(rawtt(o))) - - - -#define checktag(o,t) (rawtt(o) == (t)) -#define checktype(o,t) (ttype(o) == (t)) - - - - - -#define righttt(obj) (ttypetag(obj) == gcvalue(obj)->tt) - - -#define checkliveness(L,obj) \ - ((void)L, lua_longassert(!iscollectable(obj) || \ - (righttt(obj) && (L == NULL || !isdead(G(L),gcvalue(obj)))))) - - - - - -#define settt_(o,t) ((o)->tt_=(t)) - - - -#define setobj(L,obj1,obj2) \ - { TValue *io1=(obj1); const TValue *io2=(obj2); \ - io1->value_ = io2->value_; settt_(io1, io2->tt_); \ - checkliveness(L,io1); lua_assert(!isnonstrictnil(io1)); } - - - - -#define setobjs2s(L,o1,o2) setobj(L,s2v(o1),s2v(o2)) - -#define setobj2s(L,o1,o2) setobj(L,s2v(o1),o2) - -#define setobjt2t setobj - -#define setobj2n setobj - -#define setobj2t setobj - - - -typedef union StackValue { - TValue val; - struct { - TValuefields; - unsigned short delta; - } tbclist; -} StackValue; - - - -typedef StackValue *StkId; - - - -typedef union { - StkId p; - ptrdiff_t offset; -} StkIdRel; - - - -#define s2v(o) (&(o)->val) - - - - - - -#define LUA_VNIL makevariant(LUA_TNIL, 0) - - -#define LUA_VEMPTY makevariant(LUA_TNIL, 1) - - -#define LUA_VABSTKEY makevariant(LUA_TNIL, 2) - - -#define LUA_VNOTABLE makevariant(LUA_TNIL, 3) - - - -#define ttisnil(v) checktype((v), LUA_TNIL) - - -#define tagisempty(tag) (novariant(tag) == LUA_TNIL) - - - -#define ttisstrictnil(o) checktag((o), LUA_VNIL) - - -#define setnilvalue(obj) settt_(obj, LUA_VNIL) - - -#define isabstkey(v) checktag((v), LUA_VABSTKEY) - - - -#define isnonstrictnil(v) (ttisnil(v) && !ttisstrictnil(v)) - - - -#define isempty(v) ttisnil(v) - - - -#define ABSTKEYCONSTANT {NULL}, LUA_VABSTKEY - - - -#define setempty(v) settt_(v, LUA_VEMPTY) - - - - - - - - - -#define LUA_VFALSE makevariant(LUA_TBOOLEAN, 0) -#define LUA_VTRUE makevariant(LUA_TBOOLEAN, 1) - -#define ttisboolean(o) checktype((o), LUA_TBOOLEAN) -#define ttisfalse(o) checktag((o), LUA_VFALSE) -#define ttistrue(o) checktag((o), LUA_VTRUE) - - -#define l_isfalse(o) (ttisfalse(o) || ttisnil(o)) -#define tagisfalse(t) ((t) == LUA_VFALSE || novariant(t) == LUA_TNIL) - - - -#define setbfvalue(obj) settt_(obj, LUA_VFALSE) -#define setbtvalue(obj) settt_(obj, LUA_VTRUE) - - - - - - -#define LUA_VTHREAD makevariant(LUA_TTHREAD, 0) - -#define ttisthread(o) checktag((o), ctb(LUA_VTHREAD)) - -#define thvalue(o) check_exp(ttisthread(o), gco2th(val_(o).gc)) - -#define setthvalue(L,obj,x) \ - { TValue *io = (obj); lua_State *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTHREAD)); \ - checkliveness(L,io); } - -#define setthvalue2s(L,o,t) setthvalue(L,s2v(o),t) - - - - - - - -#define CommonHeader struct GCObject *next; lu_byte tt; lu_byte marked - - - -typedef struct GCObject { - CommonHeader; -} GCObject; - - - -#define BIT_ISCOLLECTABLE (1 << 6) - -#define iscollectable(o) (rawtt(o) & BIT_ISCOLLECTABLE) - - -#define ctb(t) ((t) | BIT_ISCOLLECTABLE) - -#define gcvalue(o) check_exp(iscollectable(o), val_(o).gc) - -#define gcvalueraw(v) ((v).gc) - -#define setgcovalue(L,obj,x) \ - { TValue *io = (obj); GCObject *i_g=(x); \ - val_(io).gc = i_g; settt_(io, ctb(i_g->tt)); } - - - - - - - -#define LUA_VNUMINT makevariant(LUA_TNUMBER, 0) -#define LUA_VNUMFLT makevariant(LUA_TNUMBER, 1) - -#define ttisnumber(o) checktype((o), LUA_TNUMBER) -#define ttisfloat(o) checktag((o), LUA_VNUMFLT) -#define ttisinteger(o) checktag((o), LUA_VNUMINT) - -#define nvalue(o) check_exp(ttisnumber(o), \ - (ttisinteger(o) ? cast_num(ivalue(o)) : fltvalue(o))) -#define fltvalue(o) check_exp(ttisfloat(o), val_(o).n) -#define ivalue(o) check_exp(ttisinteger(o), val_(o).i) - -#define fltvalueraw(v) ((v).n) -#define ivalueraw(v) ((v).i) - -#define setfltvalue(obj,x) \ - { TValue *io=(obj); val_(io).n=(x); settt_(io, LUA_VNUMFLT); } - -#define chgfltvalue(obj,x) \ - { TValue *io=(obj); lua_assert(ttisfloat(io)); val_(io).n=(x); } - -#define setivalue(obj,x) \ - { TValue *io=(obj); val_(io).i=(x); settt_(io, LUA_VNUMINT); } - -#define chgivalue(obj,x) \ - { TValue *io=(obj); lua_assert(ttisinteger(io)); val_(io).i=(x); } - - - - - - - -#define LUA_VSHRSTR makevariant(LUA_TSTRING, 0) -#define LUA_VLNGSTR makevariant(LUA_TSTRING, 1) - -#define ttisstring(o) checktype((o), LUA_TSTRING) -#define ttisshrstring(o) checktag((o), ctb(LUA_VSHRSTR)) -#define ttislngstring(o) checktag((o), ctb(LUA_VLNGSTR)) - -#define tsvalueraw(v) (gco2ts((v).gc)) - -#define tsvalue(o) check_exp(ttisstring(o), gco2ts(val_(o).gc)) - -#define setsvalue(L,obj,x) \ - { TValue *io = (obj); TString *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(x_->tt)); \ - checkliveness(L,io); } - - -#define setsvalue2s(L,o,s) setsvalue(L,s2v(o),s) - - -#define setsvalue2n setsvalue - - - -#define LSTRREG -1 -#define LSTRFIX -2 -#define LSTRMEM -3 - - - -typedef struct TString { - CommonHeader; - lu_byte extra; - ls_byte shrlen; - unsigned int hash; - union { - size_t lnglen; - struct TString *hnext; - } u; - char *contents; - lua_Alloc falloc; - void *ud; -} TString; - - -#define strisshr(ts) ((ts)->shrlen >= 0) - - - -#define rawgetshrstr(ts) (cast_charp(&(ts)->contents)) -#define getshrstr(ts) check_exp(strisshr(ts), rawgetshrstr(ts)) -#define getlngstr(ts) check_exp(!strisshr(ts), (ts)->contents) -#define getstr(ts) (strisshr(ts) ? rawgetshrstr(ts) : (ts)->contents) - - - -#define tsslen(ts) \ - (strisshr(ts) ? cast_uint((ts)->shrlen) : (ts)->u.lnglen) - - -#define getlstr(ts, len) \ - (strisshr(ts) \ - ? (cast_void((len) = (ts)->shrlen), rawgetshrstr(ts)) \ - : (cast_void((len) = (ts)->u.lnglen), (ts)->contents)) - - - - - - - - -#define LUA_VLIGHTUSERDATA makevariant(LUA_TLIGHTUSERDATA, 0) - -#define LUA_VUSERDATA makevariant(LUA_TUSERDATA, 0) - -#define ttislightuserdata(o) checktag((o), LUA_VLIGHTUSERDATA) -#define ttisfulluserdata(o) checktag((o), ctb(LUA_VUSERDATA)) - -#define pvalue(o) check_exp(ttislightuserdata(o), val_(o).p) -#define uvalue(o) check_exp(ttisfulluserdata(o), gco2u(val_(o).gc)) - -#define pvalueraw(v) ((v).p) - -#define setpvalue(obj,x) \ - { TValue *io=(obj); val_(io).p=(x); settt_(io, LUA_VLIGHTUSERDATA); } - -#define setuvalue(L,obj,x) \ - { TValue *io = (obj); Udata *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VUSERDATA)); \ - checkliveness(L,io); } - - - -typedef union UValue { - TValue uv; - LUAI_MAXALIGN; -} UValue; - - - -typedef struct Udata { - CommonHeader; - unsigned short nuvalue; - size_t len; - struct Table *metatable; - GCObject *gclist; - UValue uv[1]; -} Udata; - - - -typedef struct Udata0 { - CommonHeader; - unsigned short nuvalue; - size_t len; - struct Table *metatable; - union {LUAI_MAXALIGN;} bindata; -} Udata0; - - - -#define udatamemoffset(nuv) \ - ((nuv) == 0 ? offsetof(Udata0, bindata) \ - : offsetof(Udata, uv) + (sizeof(UValue) * (nuv))) - - -#define getudatamem(u) (cast_charp(u) + udatamemoffset((u)->nuvalue)) - - -#define sizeudata(nuv,nb) (udatamemoffset(nuv) + (nb)) - - - - - - -#define LUA_VPROTO makevariant(LUA_TPROTO, 0) - - - -typedef struct Upvaldesc { - TString *name; - lu_byte instack; - lu_byte idx; - lu_byte kind; -} Upvaldesc; - - - -typedef struct LocVar { - TString *varname; - int startpc; - int endpc; -} LocVar; - - - -typedef struct AbsLineInfo { - int pc; - int line; -} AbsLineInfo; - - - -#define PF_ISVARARG 1 -#define PF_FIXED 2 - - - -typedef struct Proto { - CommonHeader; - lu_byte numparams; - lu_byte flag; - lu_byte maxstacksize; - int sizeupvalues; - int sizek; - int sizecode; - int sizelineinfo; - int sizep; - int sizelocvars; - int sizeabslineinfo; - int linedefined; - int lastlinedefined; - TValue *k; - Instruction *code; - struct Proto **p; - Upvaldesc *upvalues; - ls_byte *lineinfo; - AbsLineInfo *abslineinfo; - LocVar *locvars; - TString *source; - GCObject *gclist; -} Proto; - - - - - - -#define LUA_VUPVAL makevariant(LUA_TUPVAL, 0) - - - -#define LUA_VLCL makevariant(LUA_TFUNCTION, 0) -#define LUA_VLCF makevariant(LUA_TFUNCTION, 1) -#define LUA_VCCL makevariant(LUA_TFUNCTION, 2) - -#define ttisfunction(o) checktype(o, LUA_TFUNCTION) -#define ttisLclosure(o) checktag((o), ctb(LUA_VLCL)) -#define ttislcf(o) checktag((o), LUA_VLCF) -#define ttisCclosure(o) checktag((o), ctb(LUA_VCCL)) -#define ttisclosure(o) (ttisLclosure(o) || ttisCclosure(o)) - - -#define isLfunction(o) ttisLclosure(o) - -#define clvalue(o) check_exp(ttisclosure(o), gco2cl(val_(o).gc)) -#define clLvalue(o) check_exp(ttisLclosure(o), gco2lcl(val_(o).gc)) -#define fvalue(o) check_exp(ttislcf(o), val_(o).f) -#define clCvalue(o) check_exp(ttisCclosure(o), gco2ccl(val_(o).gc)) - -#define fvalueraw(v) ((v).f) - -#define setclLvalue(L,obj,x) \ - { TValue *io = (obj); LClosure *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VLCL)); \ - checkliveness(L,io); } - -#define setclLvalue2s(L,o,cl) setclLvalue(L,s2v(o),cl) - -#define setfvalue(obj,x) \ - { TValue *io=(obj); val_(io).f=(x); settt_(io, LUA_VLCF); } - -#define setclCvalue(L,obj,x) \ - { TValue *io = (obj); CClosure *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VCCL)); \ - checkliveness(L,io); } - - - -typedef struct UpVal { - CommonHeader; - union { - TValue *p; - ptrdiff_t offset; - } v; - union { - struct { - struct UpVal *next; - struct UpVal **previous; - } open; - TValue value; - } u; -} UpVal; - - - -#define ClosureHeader \ - CommonHeader; lu_byte nupvalues; GCObject *gclist - -typedef struct CClosure { - ClosureHeader; - lua_CFunction f; - TValue upvalue[1]; -} CClosure; - - -typedef struct LClosure { - ClosureHeader; - struct Proto *p; - UpVal *upvals[1]; -} LClosure; - - -typedef union Closure { - CClosure c; - LClosure l; -} Closure; - - -#define getproto(o) (clLvalue(o)->p) - - - - - - -#define LUA_VTABLE makevariant(LUA_TTABLE, 0) - -#define ttistable(o) checktag((o), ctb(LUA_VTABLE)) - -#define hvalue(o) check_exp(ttistable(o), gco2t(val_(o).gc)) - -#define sethvalue(L,obj,x) \ - { TValue *io = (obj); Table *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTABLE)); \ - checkliveness(L,io); } - -#define sethvalue2s(L,o,h) sethvalue(L,s2v(o),h) - - - -typedef union Node { - struct NodeKey { - TValuefields; - lu_byte key_tt; - int next; - Value key_val; - } u; - TValue i_val; -} Node; - - - -#define setnodekey(L,node,obj) \ - { Node *n_=(node); const TValue *io_=(obj); \ - n_->u.key_val = io_->value_; n_->u.key_tt = io_->tt_; \ - checkliveness(L,io_); } - - - -#define getnodekey(L,obj,node) \ - { TValue *io_=(obj); const Node *n_=(node); \ - io_->value_ = n_->u.key_val; io_->tt_ = n_->u.key_tt; \ - checkliveness(L,io_); } - - - - -#define BITRAS (1 << 7) -#define isrealasize(t) (!((t)->flags & BITRAS)) -#define setrealasize(t) ((t)->flags &= cast_byte(~BITRAS)) -#define setnorealasize(t) ((t)->flags |= BITRAS) - - -typedef struct ArrayCell ArrayCell; - - -typedef struct Table { - CommonHeader; - lu_byte flags; - lu_byte lsizenode; - unsigned int alimit; - ArrayCell *array; - Node *node; - struct Table *metatable; - GCObject *gclist; -} Table; - - - -#define keytt(node) ((node)->u.key_tt) -#define keyval(node) ((node)->u.key_val) - -#define keyisnil(node) (keytt(node) == LUA_TNIL) -#define keyisinteger(node) (keytt(node) == LUA_VNUMINT) -#define keyival(node) (keyval(node).i) -#define keyisshrstr(node) (keytt(node) == ctb(LUA_VSHRSTR)) -#define keystrval(node) (gco2ts(keyval(node).gc)) - -#define setnilkey(node) (keytt(node) = LUA_TNIL) - -#define keyiscollectable(n) (keytt(n) & BIT_ISCOLLECTABLE) - -#define gckey(n) (keyval(n).gc) -#define gckeyN(n) (keyiscollectable(n) ? gckey(n) : NULL) - - - -#define setdeadkey(node) (keytt(node) = LUA_TDEADKEY) -#define keyisdead(node) (keytt(node) == LUA_TDEADKEY) - - - - - - -#define lmod(s,size) \ - (check_exp((size&(size-1))==0, (cast_int((s) & ((size)-1))))) - - -#define twoto(x) (1<<(x)) -#define sizenode(t) (twoto((t)->lsizenode)) - - - -#define UTF8BUFFSZ 8 - -LUAI_FUNC int luaO_utf8esc (char *buff, unsigned long x); -LUAI_FUNC int luaO_ceillog2 (unsigned int x); -LUAI_FUNC unsigned int luaO_codeparam (unsigned int p); -LUAI_FUNC l_obj luaO_applyparam (unsigned int p, l_obj x); - -LUAI_FUNC int luaO_rawarith (lua_State *L, int op, const TValue *p1, - const TValue *p2, TValue *res); -LUAI_FUNC void luaO_arith (lua_State *L, int op, const TValue *p1, - const TValue *p2, StkId res); -LUAI_FUNC size_t luaO_str2num (const char *s, TValue *o); -LUAI_FUNC int luaO_hexavalue (int c); -LUAI_FUNC void luaO_tostring (lua_State *L, TValue *obj); -LUAI_FUNC const char *luaO_pushvfstring (lua_State *L, const char *fmt, - va_list argp); -LUAI_FUNC const char *luaO_pushfstring (lua_State *L, const char *fmt, ...); -LUAI_FUNC void luaO_chunkid (char *out, const char *source, size_t srclen); - - -#endif - - - -//path: src/dependencies/lua/ltm.h - - -#ifndef ltm_h -#define ltm_h - - - - - - - -typedef enum { - TM_INDEX, - TM_NEWINDEX, - TM_GC, - TM_MODE, - TM_LEN, - TM_EQ, - TM_ADD, - TM_SUB, - TM_MUL, - TM_MOD, - TM_POW, - TM_DIV, - TM_IDIV, - TM_BAND, - TM_BOR, - TM_BXOR, - TM_SHL, - TM_SHR, - TM_UNM, - TM_BNOT, - TM_LT, - TM_LE, - TM_CONCAT, - TM_CALL, - TM_CLOSE, - TM_N -} TMS; - - - -#define maskflags (~(~0u << (TM_EQ + 1))) - - - -#define notm(tm) ttisnil(tm) - -#define checknoTM(mt,e) ((mt) == NULL || (mt)->flags & (1u<<(e))) - -#define gfasttm(g,mt,e) \ - (checknoTM(mt, e) ? NULL : luaT_gettm(mt, e, (g)->tmname[e])) - -#define fasttm(l,mt,e) gfasttm(G(l), mt, e) - -#define ttypename(x) luaT_typenames_[(x) + 1] - -LUAI_DDEC(const char *const luaT_typenames_[LUA_TOTALTYPES];) - - -LUAI_FUNC const char *luaT_objtypename (lua_State *L, const TValue *o); - -LUAI_FUNC const TValue *luaT_gettm (Table *events, TMS event, TString *ename); -LUAI_FUNC const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, - TMS event); -LUAI_FUNC void luaT_init (lua_State *L); - -LUAI_FUNC void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, const TValue *p3); -LUAI_FUNC int luaT_callTMres (lua_State *L, const TValue *f, - const TValue *p1, const TValue *p2, StkId p3); -LUAI_FUNC void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event); -LUAI_FUNC void luaT_tryconcatTM (lua_State *L); -LUAI_FUNC void luaT_trybinassocTM (lua_State *L, const TValue *p1, - const TValue *p2, int inv, StkId res, TMS event); -LUAI_FUNC void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, - int inv, StkId res, TMS event); -LUAI_FUNC int luaT_callorderTM (lua_State *L, const TValue *p1, - const TValue *p2, TMS event); -LUAI_FUNC int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, - int inv, int isfloat, TMS event); - -LUAI_FUNC void luaT_adjustvarargs (lua_State *L, int nfixparams, - struct CallInfo *ci, const Proto *p); -LUAI_FUNC void luaT_getvarargs (lua_State *L, struct CallInfo *ci, - StkId where, int wanted); - - -#endif - - -//path: src/dependencies/lua/lzio.h - - - -#ifndef lzio_h -#define lzio_h - - - - - - - - -#define EOZ (-1) - -typedef struct Zio ZIO; - -#define zgetc(z) (((z)->n--)>0 ? cast_uchar(*(z)->p++) : luaZ_fill(z)) - - -typedef struct Mbuffer { - char *buffer; - size_t n; - size_t buffsize; -} Mbuffer; - -#define luaZ_initbuffer(L, buff) ((buff)->buffer = NULL, (buff)->buffsize = 0) - -#define luaZ_buffer(buff) ((buff)->buffer) -#define luaZ_sizebuffer(buff) ((buff)->buffsize) -#define luaZ_bufflen(buff) ((buff)->n) - -#define luaZ_buffremove(buff,i) ((buff)->n -= (i)) -#define luaZ_resetbuffer(buff) ((buff)->n = 0) - - -#define luaZ_resizebuffer(L, buff, size) \ - ((buff)->buffer = luaM_reallocvchar(L, (buff)->buffer, \ - (buff)->buffsize, size), \ - (buff)->buffsize = size) - -#define luaZ_freebuffer(L, buff) luaZ_resizebuffer(L, buff, 0) - - -LUAI_FUNC void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, - void *data); -LUAI_FUNC size_t luaZ_read (ZIO* z, void *b, size_t n); - -LUAI_FUNC const void *luaZ_getaddr (ZIO* z, size_t n); - - - - -struct Zio { - size_t n; - const char *p; - lua_Reader reader; - void *data; - lua_State *L; -}; - - -LUAI_FUNC int luaZ_fill (ZIO *z); - -#endif - - - - - - - - - - - - - - -#define yieldable(L) (((L)->nCcalls & 0xffff0000) == 0) - - -#define getCcalls(L) ((L)->nCcalls & 0xffff) - - - -#define incnny(L) ((L)->nCcalls += 0x10000) - - -#define decnny(L) ((L)->nCcalls -= 0x10000) - - -#define nyci (0x10000 | 1) - - - - -struct lua_longjmp; - - - -#if !defined(l_signalT) -#include -#define l_signalT sig_atomic_t -#endif - - - -#define EXTRA_STACK 5 - - -#define BASIC_STACK_SIZE (2*LUA_MINSTACK) - -#define stacksize(th) cast_int((th)->stack_last.p - (th)->stack.p) - - - -#define KGC_INC 0 -#define KGC_GENMINOR 1 -#define KGC_GENMAJOR 2 - - -typedef struct stringtable { - TString **hash; - int nuse; - int size; -} stringtable; - - - -struct CallInfo { - StkIdRel func; - StkIdRel top; - struct CallInfo *previous, *next; - union { - struct { - const Instruction *savedpc; - volatile l_signalT trap; - int nextraargs; - } l; - struct { - lua_KFunction k; - ptrdiff_t old_errfunc; - lua_KContext ctx; - } c; - } u; - union { - int funcidx; - int nyield; - int nres; - struct { - unsigned short ftransfer; - unsigned short ntransfer; - } transferinfo; - } u2; - short nresults; - unsigned short callstatus; -}; - - - -#define CIST_OAH (1<<0) -#define CIST_C (1<<1) -#define CIST_FRESH (1<<2) -#define CIST_HOOKED (1<<3) -#define CIST_YPCALL (1<<4) -#define CIST_TAIL (1<<5) -#define CIST_HOOKYIELD (1<<6) -#define CIST_FIN (1<<7) -#define CIST_TRAN (1<<8) -#define CIST_CLSRET (1<<9) - -#define CIST_RECST 10 -#if defined(LUA_COMPAT_LT_LE) -#define CIST_LEQ (1<<13) -#endif - - - -#define getcistrecst(ci) (((ci)->callstatus >> CIST_RECST) & 7) -#define setcistrecst(ci,st) \ - check_exp(((st) & 7) == (st), \ - ((ci)->callstatus = ((ci)->callstatus & ~(7 << CIST_RECST)) \ - | ((st) << CIST_RECST))) - - - -#define isLua(ci) (!((ci)->callstatus & CIST_C)) - - -#define isLuacode(ci) (!((ci)->callstatus & (CIST_C | CIST_HOOKED))) - - -#define setoah(st,v) ((st) = ((st) & ~CIST_OAH) | (v)) -#define getoah(st) ((st) & CIST_OAH) - - - -typedef struct global_State { - lua_Alloc frealloc; - void *ud; - lu_mem totalbytes; - l_obj totalobjs; - l_obj GCdebt; - l_obj marked; - l_obj GCmajorminor; - stringtable strt; - TValue l_registry; - TValue nilvalue; - unsigned int seed; - lu_byte gcparams[LUA_GCPN]; - lu_byte currentwhite; - lu_byte gcstate; - lu_byte gckind; - lu_byte gcstopem; - lu_byte gcstp; - lu_byte gcemergency; - GCObject *allgc; - GCObject **sweepgc; - GCObject *finobj; - GCObject *gray; - GCObject *grayagain; - GCObject *weak; - GCObject *ephemeron; - GCObject *allweak; - GCObject *tobefnz; - GCObject *fixedgc; - - GCObject *survival; - GCObject *old1; - GCObject *reallyold; - GCObject *firstold1; - GCObject *finobjsur; - GCObject *finobjold1; - GCObject *finobjrold; - struct lua_State *twups; - lua_CFunction panic; - struct lua_State *mainthread; - TString *memerrmsg; - TString *tmname[TM_N]; - struct Table *mt[LUA_NUMTYPES]; - TString *strcache[STRCACHE_N][STRCACHE_M]; - lua_WarnFunction warnf; - void *ud_warn; -} global_State; - - - -struct lua_State { - CommonHeader; - lu_byte status; - lu_byte allowhook; - unsigned short nci; - StkIdRel top; - global_State *l_G; - CallInfo *ci; - StkIdRel stack_last; - StkIdRel stack; - UpVal *openupval; - StkIdRel tbclist; - GCObject *gclist; - struct lua_State *twups; - struct lua_longjmp *errorJmp; - CallInfo base_ci; - volatile lua_Hook hook; - ptrdiff_t errfunc; - l_uint32 nCcalls; - int oldpc; - int basehookcount; - int hookcount; - volatile l_signalT hookmask; -}; - - -#define G(L) (L->l_G) - - -#define completestate(g) ttisnil(&g->nilvalue) - - - -union GCUnion { - GCObject gc; - struct TString ts; - struct Udata u; - union Closure cl; - struct Table h; - struct Proto p; - struct lua_State th; - struct UpVal upv; -}; - - - -#define cast_u(o) cast(union GCUnion *, (o)) - - -#define gco2ts(o) \ - check_exp(novariant((o)->tt) == LUA_TSTRING, &((cast_u(o))->ts)) -#define gco2u(o) check_exp((o)->tt == LUA_VUSERDATA, &((cast_u(o))->u)) -#define gco2lcl(o) check_exp((o)->tt == LUA_VLCL, &((cast_u(o))->cl.l)) -#define gco2ccl(o) check_exp((o)->tt == LUA_VCCL, &((cast_u(o))->cl.c)) -#define gco2cl(o) \ - check_exp(novariant((o)->tt) == LUA_TFUNCTION, &((cast_u(o))->cl)) -#define gco2t(o) check_exp((o)->tt == LUA_VTABLE, &((cast_u(o))->h)) -#define gco2p(o) check_exp((o)->tt == LUA_VPROTO, &((cast_u(o))->p)) -#define gco2th(o) check_exp((o)->tt == LUA_VTHREAD, &((cast_u(o))->th)) -#define gco2upv(o) check_exp((o)->tt == LUA_VUPVAL, &((cast_u(o))->upv)) - - - -#define obj2gco(v) check_exp((v)->tt >= LUA_TSTRING, &(cast_u(v)->gc)) - - - -#define gettotalobjs(g) ((g)->totalobjs - (g)->GCdebt) - - -LUAI_FUNC void luaE_setdebt (global_State *g, l_obj debt); -LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1); -LUAI_FUNC CallInfo *luaE_extendCI (lua_State *L); -LUAI_FUNC void luaE_shrinkCI (lua_State *L); -LUAI_FUNC void luaE_checkcstack (lua_State *L); -LUAI_FUNC void luaE_incCstack (lua_State *L); -LUAI_FUNC void luaE_warning (lua_State *L, const char *msg, int tocont); -LUAI_FUNC void luaE_warnerror (lua_State *L, const char *where); -LUAI_FUNC int luaE_resetthread (lua_State *L, int status); - - -#endif - - - - - - - -int luaZ_fill (ZIO *z) { - size_t size; - lua_State *L = z->L; - const char *buff; - lua_unlock(L); - buff = z->reader(L, z->data, &size); - lua_lock(L); - if (buff == NULL || size == 0) - return EOZ; - z->n = size - 1; - z->p = buff; - return cast_uchar(*(z->p++)); -} - - -void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, void *data) { - z->L = L; - z->reader = reader; - z->data = data; - z->n = 0; - z->p = NULL; -} - - - - -static int checkbuffer (ZIO *z) { - if (z->n == 0) { - if (luaZ_fill(z) == EOZ) - return 0; - else { - z->n++; - z->p--; - } - } - return 1; -} - - -size_t luaZ_read (ZIO *z, void *b, size_t n) { - while (n) { - size_t m; - if (!checkbuffer(z)) - return n; - m = (n <= z->n) ? n : z->n; - memcpy(b, z->p, m); - z->n -= m; - z->p += m; - b = (char *)b + m; - n -= m; - } - return 0; -} - - -const void *luaZ_getaddr (ZIO* z, size_t n) { - const void *res; - if (!checkbuffer(z)) - return NULL; - if (z->n < n) - return NULL; - res = z->p; - z->n -= n; - z->p += n; - return res; -} - - -//path: src/dependencies/lua/lctype.c - - -#define lctype_c -#define LUA_CORE - - - - - -//path: src/dependencies/lua/lctype.h - - -#ifndef lctype_h -#define lctype_h - - - - - - - -#if !defined(LUA_USE_CTYPE) - -#if 'A' == 65 && '0' == 48 - -#define LUA_USE_CTYPE 0 -#else - -#define LUA_USE_CTYPE 1 -#endif - -#endif - - -#if !LUA_USE_CTYPE - -#include - - - - - -#define ALPHABIT 0 -#define DIGITBIT 1 -#define PRINTBIT 2 -#define SPACEBIT 3 -#define XDIGITBIT 4 - - -#define MASK(B) (1 << (B)) - - - -#define testprop(c,p) (luai_ctype_[(c)+1] & (p)) - - -#define lislalpha(c) testprop(c, MASK(ALPHABIT)) -#define lislalnum(c) testprop(c, (MASK(ALPHABIT) | MASK(DIGITBIT))) -#define lisdigit(c) testprop(c, MASK(DIGITBIT)) -#define lisspace(c) testprop(c, MASK(SPACEBIT)) -#define lisprint(c) testprop(c, MASK(PRINTBIT)) -#define lisxdigit(c) testprop(c, MASK(XDIGITBIT)) - - - -#define ltolower(c) \ - check_exp(('A' <= (c) && (c) <= 'Z') || (c) == ((c) | ('A' ^ 'a')), \ - (c) | ('A' ^ 'a')) - - - -LUAI_DDEC(const lu_byte luai_ctype_[UCHAR_MAX + 2];) - - -#else - - - -#include - - -#define lislalpha(c) (isalpha(c) || (c) == '_') -#define lislalnum(c) (isalnum(c) || (c) == '_') -#define lisdigit(c) (isdigit(c)) -#define lisspace(c) (isspace(c)) -#define lisprint(c) (isprint(c)) -#define lisxdigit(c) (isxdigit(c)) - -#define ltolower(c) (tolower(c)) - -#endif - -#endif - - - - -#if !LUA_USE_CTYPE - -#include - - -#if defined (LUA_UCID) - -#define NONA 0x01 -#else -#define NONA 0x00 -#endif - - -LUAI_DDEF const lu_byte luai_ctype_[UCHAR_MAX + 2] = { - 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x00, 0x08, 0x08, 0x08, 0x08, 0x08, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x0c, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, - 0x16, 0x16, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x04, 0x15, 0x15, 0x15, 0x15, 0x15, 0x15, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x04, 0x04, 0x04, 0x04, 0x05, - 0x04, 0x15, 0x15, 0x15, 0x15, 0x15, 0x15, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x04, 0x04, 0x04, 0x04, 0x00, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - 0x00, 0x00, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, 0x00, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 -}; - -#endif - -//path: src/dependencies/lua/lopcodes.c - - -#define lopcodes_c -#define LUA_CORE - - - - - -//path: src/dependencies/lua/lopcodes.h - - -#ifndef lopcodes_h -#define lopcodes_h - - - - - - - - -enum OpMode {iABC, iABx, iAsBx, iAx, isJ}; - - - -#define SIZE_C 8 -#define SIZE_B 8 -#define SIZE_Bx (SIZE_C + SIZE_B + 1) -#define SIZE_A 8 -#define SIZE_Ax (SIZE_Bx + SIZE_A) -#define SIZE_sJ (SIZE_Bx + SIZE_A) - -#define SIZE_OP 7 - -#define POS_OP 0 - -#define POS_A (POS_OP + SIZE_OP) -#define POS_k (POS_A + SIZE_A) -#define POS_B (POS_k + 1) -#define POS_C (POS_B + SIZE_B) - -#define POS_Bx POS_k - -#define POS_Ax POS_A - -#define POS_sJ POS_A - - - - - -#define L_INTHASBITS(b) ((UINT_MAX >> ((b) - 1)) >= 1) - - -#if L_INTHASBITS(SIZE_Bx) -#define MAXARG_Bx ((1<>1) - - -#if L_INTHASBITS(SIZE_Ax) -#define MAXARG_Ax ((1<> 1) - - -#define MAXARG_A ((1<> 1) - -#define int2sC(i) ((i) + OFFSET_sC) -#define sC2int(i) ((i) - OFFSET_sC) - - - -#define MASK1(n,p) ((~((~(Instruction)0)<<(n)))<<(p)) - - -#define MASK0(n,p) (~MASK1(n,p)) - - - -#define GET_OPCODE(i) (cast(OpCode, ((i)>>POS_OP) & MASK1(SIZE_OP,0))) -#define SET_OPCODE(i,o) ((i) = (((i)&MASK0(SIZE_OP,POS_OP)) | \ - ((cast(Instruction, o)<>(pos)) & MASK1(size,0))) -#define setarg(i,v,pos,size) ((i) = (((i)&MASK0(size,pos)) | \ - ((cast(Instruction, v)< - - - - -//path: src/dependencies/lua/ldebug.h - - -#ifndef ldebug_h -#define ldebug_h - - - - - - -#define pcRel(pc, p) (cast_int((pc) - (p)->code) - 1) - - - -#define ci_func(ci) (clLvalue(s2v((ci)->func.p))) - - -#define resethookcount(L) (L->hookcount = L->basehookcount) - - -#define ABSLINEINFO (-0x80) - - - -#if !defined(MAXIWTHABS) -#define MAXIWTHABS 128 -#endif - - -LUAI_FUNC int luaG_getfuncline (const Proto *f, int pc); -LUAI_FUNC const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, - StkId *pos); -LUAI_FUNC l_noret luaG_typeerror (lua_State *L, const TValue *o, - const char *opname); -LUAI_FUNC l_noret luaG_callerror (lua_State *L, const TValue *o); -LUAI_FUNC l_noret luaG_forerror (lua_State *L, const TValue *o, - const char *what); -LUAI_FUNC l_noret luaG_concaterror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_opinterror (lua_State *L, const TValue *p1, - const TValue *p2, - const char *msg); -LUAI_FUNC l_noret luaG_tointerror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_ordererror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_runerror (lua_State *L, const char *fmt, ...); -LUAI_FUNC const char *luaG_addinfo (lua_State *L, const char *msg, - TString *src, int line); -LUAI_FUNC l_noret luaG_errormsg (lua_State *L); -LUAI_FUNC int luaG_traceexec (lua_State *L, const Instruction *pc); -LUAI_FUNC int luaG_tracecall (lua_State *L); - - -#endif - - -//path: src/dependencies/lua/ldo.h - - -#ifndef ldo_h -#define ldo_h - - - - - - - - - - - - - -#define luaD_checkstackaux(L,n,pre,pos) \ - if (l_unlikely(L->stack_last.p - L->top.p <= (n))) \ - { pre; luaD_growstack(L, n, 1); pos; } \ - else { condmovestack(L,pre,pos); } - - -#define luaD_checkstack(L,n) luaD_checkstackaux(L,n,(void)0,(void)0) - - - -#define savestack(L,pt) (cast_charp(pt) - cast_charp(L->stack.p)) -#define restorestack(L,n) cast(StkId, cast_charp(L->stack.p) + (n)) - - - -#define checkstackp(L,n,p) \ - luaD_checkstackaux(L, n, \ - ptrdiff_t t__ = savestack(L, p), \ - p = restorestack(L, t__)) - - - - -typedef void (*Pfunc) (lua_State *L, void *ud); - -LUAI_FUNC void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop); -LUAI_FUNC int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, - const char *mode); -LUAI_FUNC void luaD_hook (lua_State *L, int event, int line, - int fTransfer, int nTransfer); -LUAI_FUNC void luaD_hookcall (lua_State *L, CallInfo *ci); -LUAI_FUNC int luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, - int narg1, int delta); -LUAI_FUNC CallInfo *luaD_precall (lua_State *L, StkId func, int nResults); -LUAI_FUNC void luaD_call (lua_State *L, StkId func, int nResults); -LUAI_FUNC void luaD_callnoyield (lua_State *L, StkId func, int nResults); -LUAI_FUNC int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status); -LUAI_FUNC int luaD_pcall (lua_State *L, Pfunc func, void *u, - ptrdiff_t oldtop, ptrdiff_t ef); -LUAI_FUNC void luaD_poscall (lua_State *L, CallInfo *ci, int nres); -LUAI_FUNC int luaD_reallocstack (lua_State *L, int newsize, int raiseerror); -LUAI_FUNC int luaD_growstack (lua_State *L, int n, int raiseerror); -LUAI_FUNC void luaD_shrinkstack (lua_State *L); -LUAI_FUNC void luaD_inctop (lua_State *L); - -LUAI_FUNC l_noret luaD_throw (lua_State *L, int errcode); -LUAI_FUNC int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud); - -#endif - - - -//path: src/dependencies/lua/lgc.h - - -#ifndef lgc_h -#define lgc_h - - -#include - - - - - - - - - - - -#define GCSpropagate 0 -#define GCSenteratomic 1 -#define GCSatomic 2 -#define GCSswpallgc 3 -#define GCSswpfinobj 4 -#define GCSswptobefnz 5 -#define GCSswpend 6 -#define GCScallfin 7 -#define GCSpause 8 - - -#define issweepphase(g) \ - (GCSswpallgc <= (g)->gcstate && (g)->gcstate <= GCSswpend) - - - - -#define keepinvariant(g) ((g)->gcstate <= GCSatomic) - - - -#define resetbits(x,m) ((x) &= cast_byte(~(m))) -#define setbits(x,m) ((x) |= (m)) -#define testbits(x,m) ((x) & (m)) -#define bitmask(b) (1<<(b)) -#define bit2mask(b1,b2) (bitmask(b1) | bitmask(b2)) -#define l_setbit(x,b) setbits(x, bitmask(b)) -#define resetbit(x,b) resetbits(x, bitmask(b)) -#define testbit(x,b) testbits(x, bitmask(b)) - - - -#define WHITE0BIT 3 -#define WHITE1BIT 4 -#define BLACKBIT 5 -#define FINALIZEDBIT 6 - -#define TESTBIT 7 - - - -#define WHITEBITS bit2mask(WHITE0BIT, WHITE1BIT) - - -#define iswhite(x) testbits((x)->marked, WHITEBITS) -#define isblack(x) testbit((x)->marked, BLACKBIT) -#define isgray(x) \ - (!testbits((x)->marked, WHITEBITS | bitmask(BLACKBIT))) - -#define tofinalize(x) testbit((x)->marked, FINALIZEDBIT) - -#define otherwhite(g) ((g)->currentwhite ^ WHITEBITS) -#define isdeadm(ow,m) ((m) & (ow)) -#define isdead(g,v) isdeadm(otherwhite(g), (v)->marked) - -#define changewhite(x) ((x)->marked ^= WHITEBITS) -#define nw2black(x) \ - check_exp(!iswhite(x), l_setbit((x)->marked, BLACKBIT)) - -#define luaC_white(g) cast_byte((g)->currentwhite & WHITEBITS) - - - -#define G_NEW 0 -#define G_SURVIVAL 1 -#define G_OLD0 2 -#define G_OLD1 3 -#define G_OLD 4 -#define G_TOUCHED1 5 -#define G_TOUCHED2 6 - -#define AGEBITS 7 - -#define getage(o) ((o)->marked & AGEBITS) -#define setage(o,a) ((o)->marked = cast_byte(((o)->marked & (~AGEBITS)) | a)) -#define isold(o) (getage(o) > G_SURVIVAL) - - - - - - - - -#define LUAI_MINORMAJOR 100 - - -#define LUAI_MAJORMINOR 50 - - -#define LUAI_GENMINORMUL 25 - - - - - -#define LUAI_GCPAUSE 200 - - -#define LUAI_GCMUL 200 - - -#define LUAI_GCSTEPSIZE 250 - - -#define setgcparam(g,p,v) (g->gcparams[LUA_GCP##p] = luaO_codeparam(v)) -#define applygcparam(g,p,x) luaO_applyparam(g->gcparams[LUA_GCP##p], x) - - -#define GCSTPUSR 1 -#define GCSTPGC 2 -#define GCSTPCLS 4 -#define gcrunning(g) ((g)->gcstp == 0) - - - -#define luaC_condGC(L,pre,pos) \ - { if (G(L)->GCdebt <= 0) { pre; luaC_step(L); pos;}; \ - condchangemem(L,pre,pos); } - - -#define luaC_checkGC(L) luaC_condGC(L,(void)0,(void)0) - - -#define luaC_objbarrier(L,p,o) ( \ - (isblack(p) && iswhite(o)) ? \ - luaC_barrier_(L,obj2gco(p),obj2gco(o)) : cast_void(0)) - -#define luaC_barrier(L,p,v) ( \ - iscollectable(v) ? luaC_objbarrier(L,p,gcvalue(v)) : cast_void(0)) - -#define luaC_objbarrierback(L,p,o) ( \ - (isblack(p) && iswhite(o)) ? luaC_barrierback_(L,p) : cast_void(0)) - -#define luaC_barrierback(L,p,v) ( \ - iscollectable(v) ? luaC_objbarrierback(L, p, gcvalue(v)) : cast_void(0)) - -LUAI_FUNC void luaC_fix (lua_State *L, GCObject *o); -LUAI_FUNC void luaC_freeallobjects (lua_State *L); -LUAI_FUNC void luaC_step (lua_State *L); -LUAI_FUNC void luaC_runtilstate (lua_State *L, int state, int fast); -LUAI_FUNC void luaC_fullgc (lua_State *L, int isemergency); -LUAI_FUNC GCObject *luaC_newobj (lua_State *L, int tt, size_t sz); -LUAI_FUNC GCObject *luaC_newobjdt (lua_State *L, int tt, size_t sz, - size_t offset); -LUAI_FUNC void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v); -LUAI_FUNC void luaC_barrierback_ (lua_State *L, GCObject *o); -LUAI_FUNC void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt); -LUAI_FUNC void luaC_changemode (lua_State *L, int newmode); - - -#endif - - - - - - - - - - - - - - - -#define callfrealloc(g,block,os,ns) ((*g->frealloc)(g->ud, block, os, ns)) - - - -#define cantryagain(g) (completestate(g) && !g->gcstopem) - - - - -#if defined(EMERGENCYGCTESTS) - -static void *firsttry (global_State *g, void *block, size_t os, size_t ns) { - if (ns > 0 && cantryagain(g)) - return NULL; - else - return callfrealloc(g, block, os, ns); -} -#else -#define firsttry(g,block,os,ns) callfrealloc(g, block, os, ns) -#endif - - - - - - - - -#define MINSIZEARRAY 4 - - -void *luaM_growaux_ (lua_State *L, void *block, int nelems, int *psize, - int size_elems, int limit, const char *what) { - void *newblock; - int size = *psize; - if (nelems + 1 <= size) - return block; - if (size >= limit / 2) { - if (l_unlikely(size >= limit)) - luaG_runerror(L, "too many %s (limit is %d)", what, limit); - size = limit; - } - else { - size *= 2; - if (size < MINSIZEARRAY) - size = MINSIZEARRAY; - } - lua_assert(nelems + 1 <= size && size <= limit); - - newblock = luaM_saferealloc_(L, block, cast_sizet(*psize) * size_elems, - cast_sizet(size) * size_elems); - *psize = size; - return newblock; -} - - - -void *luaM_shrinkvector_ (lua_State *L, void *block, int *size, - int final_n, int size_elem) { - void *newblock; - size_t oldsize = cast_sizet((*size) * size_elem); - size_t newsize = cast_sizet(final_n * size_elem); - lua_assert(newsize <= oldsize); - newblock = luaM_saferealloc_(L, block, oldsize, newsize); - *size = final_n; - return newblock; -} - - - - -l_noret luaM_toobig (lua_State *L) { - luaG_runerror(L, "memory allocation private_lua_error: block too big"); -} - - - -void luaM_free_ (lua_State *L, void *block, size_t osize) { - global_State *g = G(L); - lua_assert((osize == 0) == (block == NULL)); - callfrealloc(g, block, osize, 0); - g->totalbytes -= osize; -} - - - -static void *tryagain (lua_State *L, void *block, - size_t osize, size_t nsize) { - global_State *g = G(L); - if (cantryagain(g)) { - luaC_fullgc(L, 1); - return callfrealloc(g, block, osize, nsize); - } - else return NULL; -} - - - -void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) { - void *newblock; - global_State *g = G(L); - lua_assert((osize == 0) == (block == NULL)); - newblock = firsttry(g, block, osize, nsize); - if (l_unlikely(newblock == NULL && nsize > 0)) { - newblock = tryagain(L, block, osize, nsize); - if (newblock == NULL) - return NULL; - } - lua_assert((nsize == 0) == (newblock == NULL)); - g->totalbytes += nsize - osize; - return newblock; -} - - -void *luaM_saferealloc_ (lua_State *L, void *block, size_t osize, - size_t nsize) { - void *newblock = luaM_realloc_(L, block, osize, nsize); - if (l_unlikely(newblock == NULL && nsize > 0)) - luaM_error(L); - return newblock; -} - - -void *luaM_malloc_ (lua_State *L, size_t size, int tag) { - if (size == 0) - return NULL; - else { - global_State *g = G(L); - void *newblock = firsttry(g, NULL, tag, size); - if (l_unlikely(newblock == NULL)) { - newblock = tryagain(L, NULL, tag, size); - if (newblock == NULL) - luaM_error(L); - } - g->totalbytes += size; - return newblock; - } -} - - -//path: src/dependencies/lua/lundump.c - - -#define lundump_c -#define LUA_CORE - - - - - -#include -#include - - - - - - - - -//path: src/dependencies/lua/lfunc.h - - -#ifndef lfunc_h -#define lfunc_h - - - - - - -#define sizeCclosure(n) (cast_int(offsetof(CClosure, upvalue)) + \ - cast_int(sizeof(TValue)) * (n)) - -#define sizeLclosure(n) (cast_int(offsetof(LClosure, upvals)) + \ - cast_int(sizeof(TValue *)) * (n)) - - - -#define isintwups(L) (L->twups != L) - - - -#define MAXUPVAL 255 - - -#define upisopen(up) ((up)->v.p != &(up)->u.value) - - -#define uplevel(up) check_exp(upisopen(up), cast(StkId, (up)->v.p)) - - - -#define MAXMISS 10 - - - - -#define CLOSEKTOP (-1) - - -LUAI_FUNC Proto *luaF_newproto (lua_State *L); -LUAI_FUNC CClosure *luaF_newCclosure (lua_State *L, int nupvals); -LUAI_FUNC LClosure *luaF_newLclosure (lua_State *L, int nupvals); -LUAI_FUNC void luaF_initupvals (lua_State *L, LClosure *cl); -LUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_newtbcupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_closeupval (lua_State *L, StkId level); -LUAI_FUNC StkId luaF_close (lua_State *L, StkId level, int status, int yy); -LUAI_FUNC void luaF_unlinkupval (UpVal *uv); -LUAI_FUNC void luaF_freeproto (lua_State *L, Proto *f); -LUAI_FUNC const char *luaF_getlocalname (const Proto *func, int local_number, - int pc); - - -#endif - - - - - - -//path: src/dependencies/lua/lstring.h - - -#ifndef lstring_h -#define lstring_h - - - - - - - - - - -#define MEMERRMSG "not enough memory" - - - -#define sizestrshr(l) \ - (offsetof(TString, contents) + ((l) + 1) * sizeof(char)) - - -#define luaS_newliteral(L, s) (luaS_newlstr(L, "" s, \ - (sizeof(s)/sizeof(char))-1)) - - - -#define isreserved(s) ((s)->tt == LUA_VSHRSTR && (s)->extra > 0) - - - -#define eqshrstr(a,b) check_exp((a)->tt == LUA_VSHRSTR, (a) == (b)) - - -LUAI_FUNC unsigned luaS_hash (const char *str, size_t l, unsigned seed); -LUAI_FUNC unsigned luaS_hashlongstr (TString *ts); -LUAI_FUNC int luaS_eqlngstr (TString *a, TString *b); -LUAI_FUNC void luaS_resize (lua_State *L, int newsize); -LUAI_FUNC void luaS_clearcache (global_State *g); -LUAI_FUNC void luaS_init (lua_State *L); -LUAI_FUNC void luaS_remove (lua_State *L, TString *ts); -LUAI_FUNC Udata *luaS_newudata (lua_State *L, size_t s, int nuvalue); -LUAI_FUNC TString *luaS_newlstr (lua_State *L, const char *str, size_t l); -LUAI_FUNC TString *luaS_new (lua_State *L, const char *str); -LUAI_FUNC TString *luaS_createlngstrobj (lua_State *L, size_t l); -LUAI_FUNC TString *luaS_newextlstr (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud); -LUAI_FUNC size_t luaS_sizelngstr (size_t len, int kind); - -#endif - - -//path: src/dependencies/lua/ltable.h - - -#ifndef ltable_h -#define ltable_h - - - - - -#define gnode(t,i) (&(t)->node[i]) -#define gval(n) (&(n)->i_val) -#define gnext(n) ((n)->u.next) - - - -#define invalidateTMcache(t) ((t)->flags &= ~maskflags) - - - - -#define BITDUMMY (1 << 6) -#define NOTBITDUMMY cast_byte(~BITDUMMY) -#define isdummy(t) ((t)->flags & BITDUMMY) - -#define setnodummy(t) ((t)->flags &= NOTBITDUMMY) -#define setdummy(t) ((t)->flags |= BITDUMMY) - - - - -#define allocsizenode(t) (isdummy(t) ? 0 : sizenode(t)) - - - -#define nodefromval(v) cast(Node *, (v)) - - - -#define luaH_fastgeti(t,k,res,tag) \ - { Table *h = t; lua_Unsigned u = l_castS2U(k); \ - if ((u - 1u < h->alimit)) { \ - tag = *getArrTag(h,(u)-1u); \ - if (!tagisempty(tag)) { farr2val(h, u, tag, res); }} \ - else { tag = luaH_getint(h, u, res); }} - - -#define luaH_fastseti(t,k,val,hres) \ - { Table *h = t; lua_Unsigned u = l_castS2U(k); \ - if ((u - 1u < h->alimit)) { \ - lu_byte *tag = getArrTag(h,(u)-1u); \ - if (tagisempty(*tag)) hres = ~cast_int(u); \ - else { fval2arr(h, u, tag, val); hres = HOK; }} \ - else { hres = luaH_psetint(h, u, val); }} - - - -#define HOK 0 -#define HNOTFOUND 1 -#define HNOTATABLE 2 -#define HFIRSTNODE 3 - - - - - -#define NM cast_uint(sizeof(Value)) - -struct ArrayCell { - lu_byte tag[NM]; - Value value[NM]; -}; - - - -#define getArrTag(t,k) (&(t)->array[(k)/NM].tag[(k)%NM]) - - -#define getArrVal(t,k) (&(t)->array[(k)/NM].value[(k)%NM]) - - - -#define arr2obj(h,k,val) \ - ((val)->tt_ = *getArrTag(h,(k)-1u), (val)->value_ = *getArrVal(h,(k)-1u)) - -#define obj2arr(h,k,val) \ - (*getArrTag(h,(k)-1u) = (val)->tt_, *getArrVal(h,(k)-1u) = (val)->value_) - - - -#define farr2val(h,k,tag,res) \ - ((res)->tt_ = tag, (res)->value_ = *getArrVal(h,(k)-1u)) - -#define fval2arr(h,k,tag,val) \ - (*tag = (val)->tt_, *getArrVal(h,(k)-1u) = (val)->value_) - - -LUAI_FUNC int luaH_get (Table *t, const TValue *key, TValue *res); -LUAI_FUNC int luaH_getshortstr (Table *t, TString *key, TValue *res); -LUAI_FUNC int luaH_getstr (Table *t, TString *key, TValue *res); -LUAI_FUNC int luaH_getint (Table *t, lua_Integer key, TValue *res); - - -LUAI_FUNC const TValue *luaH_Hgetshortstr (Table *t, TString *key); - -LUAI_FUNC TString *luaH_getstrkey (Table *t, TString *key); - -LUAI_FUNC int luaH_psetint (Table *t, lua_Integer key, TValue *val); -LUAI_FUNC int luaH_psetshortstr (Table *t, TString *key, TValue *val); -LUAI_FUNC int luaH_psetstr (Table *t, TString *key, TValue *val); -LUAI_FUNC int luaH_pset (Table *t, const TValue *key, TValue *val); - -LUAI_FUNC void luaH_setint (lua_State *L, Table *t, lua_Integer key, - TValue *value); -LUAI_FUNC void luaH_set (lua_State *L, Table *t, const TValue *key, - TValue *value); - -LUAI_FUNC void luaH_finishset (lua_State *L, Table *t, const TValue *key, - TValue *value, int hres); -LUAI_FUNC Table *luaH_new (lua_State *L); -LUAI_FUNC void luaH_resize (lua_State *L, Table *t, unsigned nasize, - unsigned nhsize); -LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, unsigned nasize); -LUAI_FUNC void luaH_free (lua_State *L, Table *t); -LUAI_FUNC int luaH_next (lua_State *L, Table *t, StkId key); -LUAI_FUNC lua_Unsigned luaH_getn (Table *t); -LUAI_FUNC unsigned luaH_realasize (const Table *t); - - -#if defined(LUA_DEBUG) -LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key); -#endif - - -#endif - - -//path: src/dependencies/lua/lundump.h - - -#ifndef lundump_h -#define lundump_h - -#include - - - - - - - - - - -#define LUAC_DATA "\x19\x93\r\n\x1a\n" - -#define LUAC_INT 0x5678 -#define LUAC_NUM cast_num(370.5) - - -#define LUAC_VERSION (LUA_VERSION_MAJOR_N*16+LUA_VERSION_MINOR_N) - -#define LUAC_FORMAT 0 - - - -LUAI_FUNC LClosure* luaU_undump (lua_State* L, ZIO* Z, const char* name, - int fixed); - - -LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, - void* data, int strip); - -#endif - - - - - - -#if !defined(luai_verifycode) -#define luai_verifycode(L,f) -#endif - - -typedef struct { - lua_State *L; - ZIO *Z; - const char *name; - Table *h; - lu_mem offset; - lua_Integer nstr; - lu_byte fixed; -} LoadState; - - -static l_noret private_lua_error (LoadState *S, const char *why) { - luaO_pushfstring(S->L, "%s: bad binary format (%s)", S->name, why); - luaD_throw(S->L, LUA_ERRSYNTAX); -} - - - -#define loadVector(S,b,n) loadBlock(S,b,(n)*sizeof((b)[0])) - -static void loadBlock (LoadState *S, void *b, size_t size) { - if (luaZ_read(S->Z, b, size) != 0) - private_lua_error(S, "truncated chunk"); - S->offset += size; -} - - -static void loadAlign (LoadState *S, int align) { - int padding = align - (S->offset % align); - if (padding < align) { - lua_Integer paddingContent; - loadBlock(S, &paddingContent, padding); - lua_assert(S->offset % align == 0); - } -} - - -#define getaddr(S,n,t) cast(t *, getaddr_(S,(n) * sizeof(t))) - -static const void *getaddr_ (LoadState *S, size_t size) { - const void *block = luaZ_getaddr(S->Z, size); - S->offset += size; - if (block == NULL) - private_lua_error(S, "truncated fixed buffer"); - return block; -} - - -#define loadVar(S,x) loadVector(S,&x,1) - - -static lu_byte loadByte (LoadState *S) { - int b = zgetc(S->Z); - if (b == EOZ) - private_lua_error(S, "truncated chunk"); - S->offset++; - return cast_byte(b); -} - - -static size_t loadVarint (LoadState *S, size_t limit) { - size_t x = 0; - int b; - limit >>= 7; - do { - b = loadByte(S); - if (x > limit) - private_lua_error(S, "integer overflow"); - x = (x << 7) | (b & 0x7f); - } while ((b & 0x80) != 0); - return x; -} - - -static size_t loadSize (LoadState *S) { - return loadVarint(S, MAX_SIZET); -} - - -static int loadInt (LoadState *S) { - return cast_int(loadVarint(S, cast_sizet(INT_MAX))); -} - - -static lua_Number loadNumber (LoadState *S) { - lua_Number x; - loadVar(S, x); - return x; -} - - -static lua_Integer loadInteger (LoadState *S) { - lua_Integer x; - loadVar(S, x); - return x; -} - - - -static void loadString (LoadState *S, Proto *p, TString **sl) { - lua_State *L = S->L; - TString *ts; - TValue sv; - size_t size = loadSize(S); - if (size == 0) { - lua_assert(*sl == NULL); - return; - } - else if (size == 1) { - lua_Integer idx = cast(lua_Integer, loadSize(S)); - TValue stv; - luaH_getint(S->h, idx, &stv); - *sl = ts = tsvalue(&stv); - luaC_objbarrier(L, p, ts); - return; - } - else if ((size -= 2) <= LUAI_MAXSHORTLEN) { - char buff[LUAI_MAXSHORTLEN + 1]; - loadVector(S, buff, size + 1); - *sl = ts = luaS_newlstr(L, buff, size); - luaC_objbarrier(L, p, ts); - } - else if (S->fixed) { - const char *s = getaddr(S, size + 1, char); - *sl = ts = luaS_newextlstr(L, s, size, NULL, NULL); - luaC_objbarrier(L, p, ts); - } - else { - *sl = ts = luaS_createlngstrobj(L, size); - luaC_objbarrier(L, p, ts); - loadVector(S, getlngstr(ts), size + 1); - } - - S->nstr++; - setsvalue(L, &sv, ts); - luaH_setint(L, S->h, S->nstr, &sv); - luaC_objbarrierback(L, obj2gco(S->h), ts); -} - - -static void loadCode (LoadState *S, Proto *f) { - int n = loadInt(S); - loadAlign(S, sizeof(f->code[0])); - if (S->fixed) { - f->code = getaddr(S, n, Instruction); - f->sizecode = n; - } - else { - f->code = luaM_newvectorchecked(S->L, n, Instruction); - f->sizecode = n; - loadVector(S, f->code, n); - } -} - - -static void loadFunction(LoadState *S, Proto *f); - - -static void loadConstants (LoadState *S, Proto *f) { - int i; - int n = loadInt(S); - f->k = luaM_newvectorchecked(S->L, n, TValue); - f->sizek = n; - for (i = 0; i < n; i++) - setnilvalue(&f->k[i]); - for (i = 0; i < n; i++) { - TValue *o = &f->k[i]; - int t = loadByte(S); - switch (t) { - case LUA_VNIL: - setnilvalue(o); - break; - case LUA_VFALSE: - setbfvalue(o); - break; - case LUA_VTRUE: - setbtvalue(o); - break; - case LUA_VNUMFLT: - setfltvalue(o, loadNumber(S)); - break; - case LUA_VNUMINT: - setivalue(o, loadInteger(S)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - lua_assert(f->source == NULL); - loadString(S, f, &f->source); - if (f->source == NULL) - private_lua_error(S, "bad format for constant string"); - setsvalue2n(S->L, o, f->source); - f->source = NULL; - break; - } - default: lua_assert(0); - } - } -} - - -static void loadProtos (LoadState *S, Proto *f) { - int i; - int n = loadInt(S); - f->p = luaM_newvectorchecked(S->L, n, Proto *); - f->sizep = n; - for (i = 0; i < n; i++) - f->p[i] = NULL; - for (i = 0; i < n; i++) { - f->p[i] = luaF_newproto(S->L); - luaC_objbarrier(S->L, f, f->p[i]); - loadFunction(S, f->p[i]); - } -} - - - -static void loadUpvalues (LoadState *S, Proto *f) { - int i, n; - n = loadInt(S); - f->upvalues = luaM_newvectorchecked(S->L, n, Upvaldesc); - f->sizeupvalues = n; - for (i = 0; i < n; i++) - f->upvalues[i].name = NULL; - for (i = 0; i < n; i++) { - f->upvalues[i].instack = loadByte(S); - f->upvalues[i].idx = loadByte(S); - f->upvalues[i].kind = loadByte(S); - } -} - - -static void loadDebug (LoadState *S, Proto *f) { - int i, n; - n = loadInt(S); - if (S->fixed) { - f->lineinfo = getaddr(S, n, ls_byte); - f->sizelineinfo = n; - } - else { - f->lineinfo = luaM_newvectorchecked(S->L, n, ls_byte); - f->sizelineinfo = n; - loadVector(S, f->lineinfo, n); - } - n = loadInt(S); - if (n > 0) { - loadAlign(S, sizeof(int)); - if (S->fixed) { - f->abslineinfo = getaddr(S, n, AbsLineInfo); - f->sizeabslineinfo = n; - } - else { - f->abslineinfo = luaM_newvectorchecked(S->L, n, AbsLineInfo); - f->sizeabslineinfo = n; - loadVector(S, f->abslineinfo, n); - } - } - n = loadInt(S); - f->locvars = luaM_newvectorchecked(S->L, n, LocVar); - f->sizelocvars = n; - for (i = 0; i < n; i++) - f->locvars[i].varname = NULL; - for (i = 0; i < n; i++) { - loadString(S, f, &f->locvars[i].varname); - f->locvars[i].startpc = loadInt(S); - f->locvars[i].endpc = loadInt(S); - } - n = loadInt(S); - if (n != 0) - n = f->sizeupvalues; - for (i = 0; i < n; i++) - loadString(S, f, &f->upvalues[i].name); -} - - -static void loadFunction (LoadState *S, Proto *f) { - f->linedefined = loadInt(S); - f->lastlinedefined = loadInt(S); - f->numparams = loadByte(S); - f->flag = loadByte(S) & PF_ISVARARG; - if (S->fixed) - f->flag |= PF_FIXED; - f->maxstacksize = loadByte(S); - loadCode(S, f); - loadConstants(S, f); - loadUpvalues(S, f); - loadProtos(S, f); - loadString(S, f, &f->source); - loadDebug(S, f); -} - - -static void checkliteral (LoadState *S, const char *s, const char *msg) { - char buff[sizeof(LUA_SIGNATURE) + sizeof(LUAC_DATA)]; - size_t len = strlen(s); - loadVector(S, buff, len); - if (memcmp(s, buff, len) != 0) - private_lua_error(S, msg); -} - - -static void fchecksize (LoadState *S, size_t size, const char *tname) { - if (loadByte(S) != size) - private_lua_error(S, luaO_pushfstring(S->L, "%s size mismatch", tname)); -} - - -#define checksize(S,t) fchecksize(S,sizeof(t),#t) - -static void checkHeader (LoadState *S) { - - checkliteral(S, &LUA_SIGNATURE[1], "not a binary chunk"); - if (loadByte(S) != LUAC_VERSION) - private_lua_error(S, "version mismatch"); - if (loadByte(S) != LUAC_FORMAT) - private_lua_error(S, "format mismatch"); - checkliteral(S, LUAC_DATA, "corrupted chunk"); - checksize(S, Instruction); - checksize(S, lua_Integer); - checksize(S, lua_Number); - if (loadInteger(S) != LUAC_INT) - private_lua_error(S, "integer format mismatch"); - if (loadNumber(S) != LUAC_NUM) - private_lua_error(S, "float format mismatch"); -} - - - -LClosure *luaU_undump (lua_State *L, ZIO *Z, const char *name, int fixed) { - LoadState S; - LClosure *cl; - if (*name == '@' || *name == '=') - S.name = name + 1; - else if (*name == LUA_SIGNATURE[0]) - S.name = "binary string"; - else - S.name = name; - S.L = L; - S.Z = Z; - S.fixed = fixed; - S.offset = 1; - checkHeader(&S); - cl = luaF_newLclosure(L, loadByte(&S)); - setclLvalue2s(L, L->top.p, cl); - luaD_inctop(L); - S.h = luaH_new(L); - S.nstr = 0; - sethvalue2s(L, L->top.p, S.h); - luaD_inctop(L); - cl->p = luaF_newproto(L); - luaC_objbarrier(L, cl, cl->p); - loadFunction(&S, cl->p); - lua_assert(cl->nupvalues == cl->p->sizeupvalues); - luai_verifycode(L, cl->p); - L->top.p--; - return cl; -} - - - -//path: src/dependencies/lua/ldump.c - - -#define ldump_c -#define LUA_CORE - - - - - -#include -#include - - - - - - - - - - - - - - - - -typedef struct { - lua_State *L; - lua_Writer writer; - void *data; - lu_mem offset; - int strip; - int status; - Table *h; - lua_Integer nstr; -} DumpState; - - - -#define dumpVector(D,v,n) dumpBlock(D,v,(n)*sizeof((v)[0])) - -#define dumpLiteral(D, s) dumpBlock(D,s,sizeof(s) - sizeof(char)) - - - -static void dumpBlock (DumpState *D, const void *b, size_t size) { - if (D->status == 0) { - lua_unlock(D->L); - D->status = (*D->writer)(D->L, b, size, D->data); - lua_lock(D->L); - D->offset += size; - } -} - - - -static void dumpAlign (DumpState *D, int align) { - int padding = align - (D->offset % align); - if (padding < align) { - static lua_Integer paddingContent = 0; - lua_assert(cast_uint(align) <= sizeof(lua_Integer)); - dumpBlock(D, &paddingContent, padding); - } - lua_assert(D->offset % align == 0); -} - - -#define dumpVar(D,x) dumpVector(D,&x,1) - - -static void dumpByte (DumpState *D, int y) { - lu_byte x = (lu_byte)y; - dumpVar(D, x); -} - - - -#define DIBS ((sizeof(size_t) * CHAR_BIT + 6) / 7) - - -static void dumpVarint (DumpState *D, size_t x) { - lu_byte buff[DIBS]; - int n = 1; - buff[DIBS - 1] = x & 0x7f; - while ((x >>= 7) != 0) - buff[DIBS - (++n)] = (x & 0x7f) | 0x80; - dumpVector(D, buff + DIBS - n, n); -} - - -static void dumpSize (DumpState *D, size_t sz) { - dumpVarint(D, sz); -} - -static void dumpInt (DumpState *D, int x) { - lua_assert(x >= 0); - dumpVarint(D, cast(size_t, x)); -} - - -static void dumpNumber (DumpState *D, lua_Number x) { - dumpVar(D, x); -} - - -static void dumpInteger (DumpState *D, lua_Integer x) { - dumpVar(D, x); -} - - - -static void dumpString (DumpState *D, TString *ts) { - if (ts == NULL) - dumpSize(D, 0); - else { - TValue idx; - int tag = luaH_getstr(D->h, ts, &idx); - if (!tagisempty(tag)) { - dumpSize(D, 1); - dumpSize(D, cast_sizet(ivalue(&idx))); - } - else { - TValue key, value; - size_t size; - const char *s = getlstr(ts, size); - dumpSize(D, size + 2); - dumpVector(D, s, size + 1); - D->nstr++; - setsvalue(D->L, &key, ts); - setivalue(&value, D->nstr); - luaH_set(D->L, D->h, &key, &value); - - } - } -} - - -static void dumpCode (DumpState *D, const Proto *f) { - dumpInt(D, f->sizecode); - dumpAlign(D, sizeof(f->code[0])); - lua_assert(f->code != NULL); - dumpVector(D, f->code, f->sizecode); -} - - -static void dumpFunction (DumpState *D, const Proto *f); - -static void dumpConstants (DumpState *D, const Proto *f) { - int i; - int n = f->sizek; - dumpInt(D, n); - for (i = 0; i < n; i++) { - const TValue *o = &f->k[i]; - int tt = ttypetag(o); - dumpByte(D, tt); - switch (tt) { - case LUA_VNUMFLT: - dumpNumber(D, fltvalue(o)); - break; - case LUA_VNUMINT: - dumpInteger(D, ivalue(o)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - dumpString(D, tsvalue(o)); - break; - default: - lua_assert(tt == LUA_VNIL || tt == LUA_VFALSE || tt == LUA_VTRUE); - } - } -} - - -static void dumpProtos (DumpState *D, const Proto *f) { - int i; - int n = f->sizep; - dumpInt(D, n); - for (i = 0; i < n; i++) - dumpFunction(D, f->p[i]); -} - - -static void dumpUpvalues (DumpState *D, const Proto *f) { - int i, n = f->sizeupvalues; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpByte(D, f->upvalues[i].instack); - dumpByte(D, f->upvalues[i].idx); - dumpByte(D, f->upvalues[i].kind); - } -} - - -static void dumpDebug (DumpState *D, const Proto *f) { - int i, n; - n = (D->strip) ? 0 : f->sizelineinfo; - dumpInt(D, n); - if (f->lineinfo != NULL) - dumpVector(D, f->lineinfo, n); - n = (D->strip) ? 0 : f->sizeabslineinfo; - dumpInt(D, n); - if (n > 0) { - - dumpAlign(D, sizeof(int)); - dumpVector(D, f->abslineinfo, n); - } - n = (D->strip) ? 0 : f->sizelocvars; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpString(D, f->locvars[i].varname); - dumpInt(D, f->locvars[i].startpc); - dumpInt(D, f->locvars[i].endpc); - } - n = (D->strip) ? 0 : f->sizeupvalues; - dumpInt(D, n); - for (i = 0; i < n; i++) - dumpString(D, f->upvalues[i].name); -} - - -static void dumpFunction (DumpState *D, const Proto *f) { - dumpInt(D, f->linedefined); - dumpInt(D, f->lastlinedefined); - dumpByte(D, f->numparams); - dumpByte(D, f->flag); - dumpByte(D, f->maxstacksize); - dumpCode(D, f); - dumpConstants(D, f); - dumpUpvalues(D, f); - dumpProtos(D, f); - dumpString(D, D->strip ? NULL : f->source); - dumpDebug(D, f); -} - - -static void dumpHeader (DumpState *D) { - dumpLiteral(D, LUA_SIGNATURE); - dumpByte(D, LUAC_VERSION); - dumpByte(D, LUAC_FORMAT); - dumpLiteral(D, LUAC_DATA); - dumpByte(D, sizeof(Instruction)); - dumpByte(D, sizeof(lua_Integer)); - dumpByte(D, sizeof(lua_Number)); - dumpInteger(D, LUAC_INT); - dumpNumber(D, LUAC_NUM); -} - - - -int luaU_dump (lua_State *L, const Proto *f, lua_Writer w, void *data, - int strip) { - DumpState D; - D.h = luaH_new(L); - sethvalue2s(L, L->top.p, D.h); - L->top.p++; - D.L = L; - D.writer = w; - D.offset = 0; - D.data = data; - D.strip = strip; - D.status = 0; - D.nstr = 0; - dumpHeader(&D); - dumpByte(&D, f->sizeupvalues); - dumpFunction(&D, f); - dumpBlock(&D, NULL, 0); - return D.status; -} - - - -//path: src/dependencies/lua/lstate.c - - -#define lstate_c -#define LUA_CORE - - - - - -#include -#include - - - - -//path: src/dependencies/lua/lapi.h - - -#ifndef lapi_h -#define lapi_h - - - - - - - - - -#define api_incr_top(L) \ - (L->top.p++, api_check(L, L->top.p <= L->ci->top.p, "stack overflow")) - - - -#define adjustresults(L,nres) \ - { if ((nres) <= LUA_MULTRET && L->ci->top.p < L->top.p) \ - L->ci->top.p = L->top.p; } - - - -#define api_checknelems(L,n) \ - api_check(L, (n) < (L->top.p - L->ci->func.p), \ - "not enough elements in the stack") - - - -#define api_checkpop(L,n) \ - api_check(L, (n) < L->top.p - L->ci->func.p && \ - L->tbclist.p < L->top.p - (n), \ - "not enough free elements in the stack") - - - - -#define hastocloseCfunc(n) ((n) < LUA_MULTRET) - - -#define codeNresults(n) (-(n) - 3) -#define decodeNresults(n) (-(n) - 3) - -#endif - - - - - - - - - - -//path: src/dependencies/lua/llex.h - - -#ifndef llex_h -#define llex_h - -#include - - - - - - - - -#define FIRST_RESERVED (UCHAR_MAX + 1) - - -#if !defined(LUA_ENV) -#define LUA_ENV "_ENV" -#endif - - - -enum RESERVED { - - TK_AND = FIRST_RESERVED, TK_BREAK, - TK_DO, TK_ELSE, TK_ELSEIF, TK_END, TK_FALSE, TK_FOR, TK_FUNCTION, - TK_GOTO, TK_IF, TK_IN, TK_LOCAL, TK_NIL, TK_NOT, TK_OR, TK_REPEAT, - TK_RETURN, TK_THEN, TK_TRUE, TK_UNTIL, TK_WHILE, - - TK_IDIV, TK_CONCAT, TK_DOTS, TK_EQ, TK_GE, TK_LE, TK_NE, - TK_SHL, TK_SHR, - TK_DBCOLON, TK_EOS, - TK_FLT, TK_INT, TK_NAME, TK_STRING -}; - - -#define NUM_RESERVED (cast_int(TK_WHILE-FIRST_RESERVED + 1)) - - -typedef union { - lua_Number r; - lua_Integer i; - TString *ts; -} SemInfo; - - -typedef struct Token { - int token; - SemInfo seminfo; -} Token; - - - -typedef struct LexState { - int current; - int linenumber; - int lastline; - Token t; - Token lookahead; - struct FuncState *fs; - struct lua_State *L; - ZIO *z; - Mbuffer *buff; - Table *h; - struct Dyndata *dyd; - TString *source; - TString *envn; -} LexState; - - -LUAI_FUNC void luaX_init (lua_State *L); -LUAI_FUNC void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, - TString *source, int firstchar); -LUAI_FUNC TString *luaX_newstring (LexState *ls, const char *str, size_t l); -LUAI_FUNC void luaX_next (LexState *ls); -LUAI_FUNC int luaX_lookahead (LexState *ls); -LUAI_FUNC l_noret luaX_syntaxerror (LexState *ls, const char *s); -LUAI_FUNC const char *luaX_token2str (LexState *ls, int token); - - -#endif - - - - - - - - - - - - - - - - -typedef struct LX { - lu_byte extra_[LUA_EXTRASPACE]; - lua_State l; -} LX; - - - -typedef struct LG { - LX l; - global_State g; -} LG; - - - -#define fromstate(L) (cast(LX *, cast(lu_byte *, (L)) - offsetof(LX, l))) - - - -void luaE_setdebt (global_State *g, l_obj debt) { - l_obj tb = gettotalobjs(g); - lua_assert(tb > 0); - if (debt > MAX_LOBJ - tb) - debt = MAX_LOBJ - tb; - g->totalobjs = tb + debt; - g->GCdebt = debt; -} - - -CallInfo *luaE_extendCI (lua_State *L) { - CallInfo *ci; - lua_assert(L->ci->next == NULL); - ci = luaM_new(L, CallInfo); - lua_assert(L->ci->next == NULL); - L->ci->next = ci; - ci->previous = L->ci; - ci->next = NULL; - ci->u.l.trap = 0; - L->nci++; - return ci; -} - - - -static void freeCI (lua_State *L) { - CallInfo *ci = L->ci; - CallInfo *next = ci->next; - ci->next = NULL; - while ((ci = next) != NULL) { - next = ci->next; - luaM_free(L, ci); - L->nci--; - } -} - - - -void luaE_shrinkCI (lua_State *L) { - CallInfo *ci = L->ci->next; - CallInfo *next; - if (ci == NULL) - return; - while ((next = ci->next) != NULL) { - CallInfo *next2 = next->next; - ci->next = next2; - L->nci--; - luaM_free(L, next); - if (next2 == NULL) - break; - else { - next2->previous = ci; - ci = next2; - } - } -} - - - -void luaE_checkcstack (lua_State *L) { - if (getCcalls(L) == LUAI_MAXCCALLS) - luaG_runerror(L, "C stack overflow"); - else if (getCcalls(L) >= (LUAI_MAXCCALLS / 10 * 11)) - luaD_throw(L, LUA_ERRERR); -} - - -LUAI_FUNC void luaE_incCstack (lua_State *L) { - L->nCcalls++; - if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) - luaE_checkcstack(L); -} - - -static void stack_init (lua_State *L1, lua_State *L) { - int i; CallInfo *ci; - - L1->stack.p = luaM_newvector(L, BASIC_STACK_SIZE + EXTRA_STACK, StackValue); - L1->tbclist.p = L1->stack.p; - for (i = 0; i < BASIC_STACK_SIZE + EXTRA_STACK; i++) - setnilvalue(s2v(L1->stack.p + i)); - L1->top.p = L1->stack.p; - L1->stack_last.p = L1->stack.p + BASIC_STACK_SIZE; - - ci = &L1->base_ci; - ci->next = ci->previous = NULL; - ci->callstatus = CIST_C; - ci->func.p = L1->top.p; - ci->u.c.k = NULL; - ci->nresults = 0; - setnilvalue(s2v(L1->top.p)); - L1->top.p++; - ci->top.p = L1->top.p + LUA_MINSTACK; - L1->ci = ci; -} - - -static void freestack (lua_State *L) { - if (L->stack.p == NULL) - return; - L->ci = &L->base_ci; - freeCI(L); - lua_assert(L->nci == 0); - luaM_freearray(L, L->stack.p, stacksize(L) + EXTRA_STACK); -} - - - -static void init_registry (lua_State *L, global_State *g) { - - TValue aux; - Table *registry = luaH_new(L); - sethvalue(L, &g->l_registry, registry); - luaH_resize(L, registry, LUA_RIDX_LAST, 0); - - setbfvalue(&aux); - luaH_setint(L, registry, 1, &aux); - - setthvalue(L, &aux, L); - luaH_setint(L, registry, LUA_RIDX_MAINTHREAD, &aux); - - sethvalue(L, &aux, luaH_new(L)); - luaH_setint(L, registry, LUA_RIDX_GLOBALS, &aux); -} - - - -static void f_luaopen (lua_State *L, void *ud) { - global_State *g = G(L); - UNUSED(ud); - stack_init(L, L); - init_registry(L, g); - luaS_init(L); - luaT_init(L); - luaX_init(L); - g->gcstp = 0; - setnilvalue(&g->nilvalue); - luai_userstateopen(L); -} - - - -static void preinit_thread (lua_State *L, global_State *g) { - G(L) = g; - L->stack.p = NULL; - L->ci = NULL; - L->nci = 0; - L->twups = L; - L->nCcalls = 0; - L->errorJmp = NULL; - L->hook = NULL; - L->hookmask = 0; - L->basehookcount = 0; - L->allowhook = 1; - resethookcount(L); - L->openupval = NULL; - L->status = LUA_OK; - L->errfunc = 0; - L->oldpc = 0; -} - - -static void close_state (lua_State *L) { - global_State *g = G(L); - if (!completestate(g)) - luaC_freeallobjects(L); - else { - L->ci = &L->base_ci; - luaD_closeprotected(L, 1, LUA_OK); - luaC_freeallobjects(L); - luai_userstateclose(L); - } - luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size); - freestack(L); - lua_assert(g->totalbytes == sizeof(LG)); - lua_assert(gettotalobjs(g) == 1); - (*g->frealloc)(g->ud, fromstate(L), sizeof(LG), 0); -} - - -LUA_API lua_State *lua_newthread (lua_State *L) { - global_State *g = G(L); - GCObject *o; - lua_State *L1; - lua_lock(L); - luaC_checkGC(L); - - o = luaC_newobjdt(L, LUA_TTHREAD, sizeof(LX), offsetof(LX, l)); - L1 = gco2th(o); - - setthvalue2s(L, L->top.p, L1); - api_incr_top(L); - preinit_thread(L1, g); - L1->hookmask = L->hookmask; - L1->basehookcount = L->basehookcount; - L1->hook = L->hook; - resethookcount(L1); - - memcpy(lua_getextraspace(L1), lua_getextraspace(g->mainthread), - LUA_EXTRASPACE); - luai_userstatethread(L, L1); - stack_init(L1, L); - lua_unlock(L); - return L1; -} - - -void luaE_freethread (lua_State *L, lua_State *L1) { - LX *l = fromstate(L1); - luaF_closeupval(L1, L1->stack.p); - lua_assert(L1->openupval == NULL); - luai_userstatefree(L, L1); - freestack(L1); - luaM_free(L, l); -} - - -int luaE_resetthread (lua_State *L, int status) { - CallInfo *ci = L->ci = &L->base_ci; - setnilvalue(s2v(L->stack.p)); - ci->func.p = L->stack.p; - ci->callstatus = CIST_C; - if (status == LUA_YIELD) - status = LUA_OK; - L->status = LUA_OK; - status = luaD_closeprotected(L, 1, status); - if (status != LUA_OK) - luaD_seterrorobj(L, status, L->stack.p + 1); - else - L->top.p = L->stack.p + 1; - ci->top.p = L->top.p + LUA_MINSTACK; - luaD_reallocstack(L, cast_int(ci->top.p - L->stack.p), 0); - return status; -} - - -LUA_API int lua_closethread (lua_State *L, lua_State *from) { - int status; - lua_lock(L); - L->nCcalls = (from) ? getCcalls(from) : 0; - status = luaE_resetthread(L, L->status); - lua_unlock(L); - return status; -} - - -LUA_API lua_State *lua_newstate (lua_Alloc f, void *ud, unsigned seed) { - int i; - lua_State *L; - global_State *g; - LG *l = cast(LG *, (*f)(ud, NULL, LUA_TTHREAD, sizeof(LG))); - if (l == NULL) return NULL; - L = &l->l.l; - g = &l->g; - L->tt = LUA_VTHREAD; - g->currentwhite = bitmask(WHITE0BIT); - L->marked = luaC_white(g); - preinit_thread(L, g); - g->allgc = obj2gco(L); - L->next = NULL; - incnny(L); - g->frealloc = f; - g->ud = ud; - g->warnf = NULL; - g->ud_warn = NULL; - g->mainthread = L; - g->seed = seed; - g->gcstp = GCSTPGC; - g->strt.size = g->strt.nuse = 0; - g->strt.hash = NULL; - setnilvalue(&g->l_registry); - g->panic = NULL; - g->gcstate = GCSpause; - g->gckind = KGC_INC; - g->gcstopem = 0; - g->gcemergency = 0; - g->finobj = g->tobefnz = g->fixedgc = NULL; - g->firstold1 = g->survival = g->old1 = g->reallyold = NULL; - g->finobjsur = g->finobjold1 = g->finobjrold = NULL; - g->sweepgc = NULL; - g->gray = g->grayagain = NULL; - g->weak = g->ephemeron = g->allweak = NULL; - g->twups = NULL; - g->totalbytes = sizeof(LG); - g->totalobjs = 1; - g->marked = 0; - g->GCdebt = 0; - setivalue(&g->nilvalue, 0); - setgcparam(g, PAUSE, LUAI_GCPAUSE); - setgcparam(g, STEPMUL, LUAI_GCMUL); - setgcparam(g, STEPSIZE, LUAI_GCSTEPSIZE); - setgcparam(g, MINORMUL, LUAI_GENMINORMUL); - setgcparam(g, MINORMAJOR, LUAI_MINORMAJOR); - setgcparam(g, MAJORMINOR, LUAI_MAJORMINOR); - for (i=0; i < LUA_NUMTYPES; i++) g->mt[i] = NULL; - if (luaD_rawrunprotected(L, f_luaopen, NULL) != LUA_OK) { - - close_state(L); - L = NULL; - } - return L; -} - - -LUA_API void lua_close (lua_State *L) { - lua_lock(L); - L = G(L)->mainthread; - close_state(L); -} - - -void luaE_warning (lua_State *L, const char *msg, int tocont) { - lua_WarnFunction wf = G(L)->warnf; - if (wf != NULL) - wf(G(L)->ud_warn, msg, tocont); -} - - - -void luaE_warnerror (lua_State *L, const char *where) { - TValue *errobj = s2v(L->top.p - 1); - const char *msg = (ttisstring(errobj)) - ? getstr(tsvalue(errobj)) - : "private_lua_error object is not a string"; - - luaE_warning(L, "private_lua_error in ", 1); - luaE_warning(L, where, 1); - luaE_warning(L, " (", 1); - luaE_warning(L, msg, 1); - luaE_warning(L, ")", 0); -} - - - -//path: src/dependencies/lua/lgc.c - - -#define lgc_c -#define LUA_CORE - - - - -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -#define NFIXED (TM_N + NUM_RESERVED + 2) - - - -#define GCSWEEPMAX 20 - - - -#define maskcolors (bitmask(BLACKBIT) | WHITEBITS) - - -#define maskgcbits (maskcolors | AGEBITS) - - - -#define makewhite(g,x) \ - (x->marked = cast_byte((x->marked & ~maskcolors) | luaC_white(g))) - - -#define set2gray(x) resetbits(x->marked, maskcolors) - - - -#define set2black(x) \ - (x->marked = cast_byte((x->marked & ~WHITEBITS) | bitmask(BLACKBIT))) - - -#define valiswhite(x) (iscollectable(x) && iswhite(gcvalue(x))) - -#define keyiswhite(n) (keyiscollectable(n) && iswhite(gckey(n))) - - - -#define gcvalueN(o) (iscollectable(o) ? gcvalue(o) : NULL) - - - -#define gcvalarr(t,i) \ - ((*getArrTag(t,i) & BIT_ISCOLLECTABLE) ? getArrVal(t,i)->gc : NULL) - - -#define markvalue(g,o) { checkliveness(g->mainthread,o); \ - if (valiswhite(o)) reallymarkobject(g,gcvalue(o)); } - -#define markkey(g, n) { if keyiswhite(n) reallymarkobject(g,gckey(n)); } - -#define markobject(g,t) { if (iswhite(t)) reallymarkobject(g, obj2gco(t)); } - - -#define markobjectN(g,t) { if (t) markobject(g,t); } - - -static void reallymarkobject (global_State *g, GCObject *o); -static l_obj atomic (lua_State *L); -static void entersweep (lua_State *L); - - - - - - -#define gnodelast(h) gnode(h, cast_sizet(sizenode(h))) - - -static GCObject **getgclist (GCObject *o) { - switch (o->tt) { - case LUA_VTABLE: return &gco2t(o)->gclist; - case LUA_VLCL: return &gco2lcl(o)->gclist; - case LUA_VCCL: return &gco2ccl(o)->gclist; - case LUA_VTHREAD: return &gco2th(o)->gclist; - case LUA_VPROTO: return &gco2p(o)->gclist; - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - lua_assert(u->nuvalue > 0); - return &u->gclist; - } - default: lua_assert(0); return 0; - } -} - - - -#define linkgclist(o,p) linkgclist_(obj2gco(o), &(o)->gclist, &(p)) - -static void linkgclist_ (GCObject *o, GCObject **pnext, GCObject **list) { - lua_assert(!isgray(o)); - *pnext = *list; - *list = o; - set2gray(o); -} - - - -#define linkobjgclist(o,p) linkgclist_(obj2gco(o), getgclist(o), &(p)) - - - - -static void clearkey (Node *n) { - lua_assert(isempty(gval(n))); - if (keyiscollectable(n)) - setdeadkey(n); -} - - - -static int iscleared (global_State *g, const GCObject *o) { - if (o == NULL) return 0; - else if (novariant(o->tt) == LUA_TSTRING) { - markobject(g, o); - return 0; - } - else return iswhite(o); -} - - - -void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v) { - global_State *g = G(L); - lua_assert(isblack(o) && iswhite(v) && !isdead(g, v) && !isdead(g, o)); - if (keepinvariant(g)) { - reallymarkobject(g, v); - if (isold(o)) { - lua_assert(!isold(v)); - setage(v, G_OLD0); - } - } - else { - lua_assert(issweepphase(g)); - if (g->gckind != KGC_GENMINOR) - makewhite(g, o); - } -} - - - -void luaC_barrierback_ (lua_State *L, GCObject *o) { - global_State *g = G(L); - lua_assert(isblack(o) && !isdead(g, o)); - lua_assert((g->gckind != KGC_GENMINOR) - || (isold(o) && getage(o) != G_TOUCHED1)); - if (getage(o) == G_TOUCHED2) - set2gray(o); - else - linkobjgclist(o, g->grayagain); - if (isold(o)) - setage(o, G_TOUCHED1); -} - - -void luaC_fix (lua_State *L, GCObject *o) { - global_State *g = G(L); - lua_assert(g->allgc == o); - set2gray(o); - setage(o, G_OLD); - g->allgc = o->next; - o->next = g->fixedgc; - g->fixedgc = o; -} - - - -GCObject *luaC_newobjdt (lua_State *L, int tt, size_t sz, size_t offset) { - global_State *g = G(L); - char *p = cast_charp(luaM_newobject(L, novariant(tt), sz)); - GCObject *o = cast(GCObject *, p + offset); - g->GCdebt--; - o->marked = luaC_white(g); - o->tt = tt; - o->next = g->allgc; - g->allgc = o; - return o; -} - - - -GCObject *luaC_newobj (lua_State *L, int tt, size_t sz) { - return luaC_newobjdt(L, tt, sz, 0); -} - - - - - - - - - -static void reallymarkobject (global_State *g, GCObject *o) { - g->marked++; - switch (o->tt) { - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - set2black(o); - break; - } - case LUA_VUPVAL: { - UpVal *uv = gco2upv(o); - if (upisopen(uv)) - set2gray(uv); - else - set2black(uv); - markvalue(g, uv->v.p); - break; - } - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - if (u->nuvalue == 0) { - markobjectN(g, u->metatable); - set2black(u); - break; - } - - } - case LUA_VLCL: case LUA_VCCL: case LUA_VTABLE: - case LUA_VTHREAD: case LUA_VPROTO: { - linkobjgclist(o, g->gray); - break; - } - default: lua_assert(0); break; - } -} - - - -static void markmt (global_State *g) { - int i; - for (i=0; i < LUA_NUMTYPES; i++) - markobjectN(g, g->mt[i]); -} - - - -static l_obj markbeingfnz (global_State *g) { - GCObject *o; - l_obj count = 0; - for (o = g->tobefnz; o != NULL; o = o->next) { - count++; - markobject(g, o); - } - return count; -} - - - -static l_obj remarkupvals (global_State *g) { - l_obj work = 0; - lua_State *thread; - lua_State **p = &g->twups; - while ((thread = *p) != NULL) { - if (!iswhite(thread) && thread->openupval != NULL) - p = &thread->twups; - else { - UpVal *uv; - lua_assert(!isold(thread) || thread->openupval == NULL); - *p = thread->twups; - thread->twups = thread; - for (uv = thread->openupval; uv != NULL; uv = uv->u.open.next) { - lua_assert(getage(uv) <= getage(thread)); - if (!iswhite(uv)) { - lua_assert(upisopen(uv) && isgray(uv)); - markvalue(g, uv->v.p); - } - } - } - work++; - } - return work; -} - - -static void cleargraylists (global_State *g) { - g->gray = g->grayagain = NULL; - g->weak = g->allweak = g->ephemeron = NULL; -} - - - -static void restartcollection (global_State *g) { - cleargraylists(g); - g->marked = NFIXED; - markobject(g, g->mainthread); - markvalue(g, &g->l_registry); - markmt(g); - markbeingfnz(g); -} - - - - - - - - -static void genlink (global_State *g, GCObject *o) { - lua_assert(isblack(o)); - if (getage(o) == G_TOUCHED1) { - linkobjgclist(o, g->grayagain); - } - else if (getage(o) == G_TOUCHED2) - setage(o, G_OLD); -} - - - -static void traverseweakvalue (global_State *g, Table *h) { - Node *n, *limit = gnodelast(h); - - int hasclears = (h->alimit > 0); - for (n = gnode(h, 0); n < limit; n++) { - if (isempty(gval(n))) - clearkey(n); - else { - lua_assert(!keyisnil(n)); - markkey(g, n); - if (!hasclears && iscleared(g, gcvalueN(gval(n)))) - hasclears = 1; - } - } - if (g->gcstate == GCSatomic && hasclears) - linkgclist(h, g->weak); - else - linkgclist(h, g->grayagain); -} - - - -static int traversearray (global_State *g, Table *h) { - unsigned asize = luaH_realasize(h); - int marked = 0; - unsigned i; - for (i = 0; i < asize; i++) { - GCObject *o = gcvalarr(h, i); - if (o != NULL && iswhite(o)) { - marked = 1; - reallymarkobject(g, o); - } - } - return marked; -} - - - -static int traverseephemeron (global_State *g, Table *h, int inv) { - int hasclears = 0; - int hasww = 0; - unsigned int i; - unsigned int nsize = sizenode(h); - int marked = traversearray(g, h); - - for (i = 0; i < nsize; i++) { - Node *n = inv ? gnode(h, nsize - 1 - i) : gnode(h, i); - if (isempty(gval(n))) - clearkey(n); - else if (iscleared(g, gckeyN(n))) { - hasclears = 1; - if (valiswhite(gval(n))) - hasww = 1; - } - else if (valiswhite(gval(n))) { - marked = 1; - reallymarkobject(g, gcvalue(gval(n))); - } - } - - if (g->gcstate == GCSpropagate) - linkgclist(h, g->grayagain); - else if (hasww) - linkgclist(h, g->ephemeron); - else if (hasclears) - linkgclist(h, g->allweak); - else - genlink(g, obj2gco(h)); - return marked; -} - - -static void traversestrongtable (global_State *g, Table *h) { - Node *n, *limit = gnodelast(h); - traversearray(g, h); - for (n = gnode(h, 0); n < limit; n++) { - if (isempty(gval(n))) - clearkey(n); - else { - lua_assert(!keyisnil(n)); - markkey(g, n); - markvalue(g, gval(n)); - } - } - genlink(g, obj2gco(h)); -} - - -static void traversetable (global_State *g, Table *h) { - const char *weakkey, *weakvalue; - const TValue *mode = gfasttm(g, h->metatable, TM_MODE); - TString *smode; - markobjectN(g, h->metatable); - if (mode && ttisshrstring(mode) && - (cast_void(smode = tsvalue(mode)), - cast_void(weakkey = strchr(getshrstr(smode), 'k')), - cast_void(weakvalue = strchr(getshrstr(smode), 'v')), - (weakkey || weakvalue))) { - if (!weakkey) - traverseweakvalue(g, h); - else if (!weakvalue) - traverseephemeron(g, h, 0); - else - linkgclist(h, g->allweak); - } - else - traversestrongtable(g, h); -} - - -static void traverseudata (global_State *g, Udata *u) { - int i; - markobjectN(g, u->metatable); - for (i = 0; i < u->nuvalue; i++) - markvalue(g, &u->uv[i].uv); - genlink(g, obj2gco(u)); -} - - - -static void traverseproto (global_State *g, Proto *f) { - int i; - markobjectN(g, f->source); - for (i = 0; i < f->sizek; i++) - markvalue(g, &f->k[i]); - for (i = 0; i < f->sizeupvalues; i++) - markobjectN(g, f->upvalues[i].name); - for (i = 0; i < f->sizep; i++) - markobjectN(g, f->p[i]); - for (i = 0; i < f->sizelocvars; i++) - markobjectN(g, f->locvars[i].varname); -} - - -static void traverseCclosure (global_State *g, CClosure *cl) { - int i; - for (i = 0; i < cl->nupvalues; i++) - markvalue(g, &cl->upvalue[i]); -} - - -static void traverseLclosure (global_State *g, LClosure *cl) { - int i; - markobjectN(g, cl->p); - for (i = 0; i < cl->nupvalues; i++) { - UpVal *uv = cl->upvals[i]; - markobjectN(g, uv); - } -} - - - -static void traversethread (global_State *g, lua_State *th) { - UpVal *uv; - StkId o = th->stack.p; - if (isold(th) || g->gcstate == GCSpropagate) - linkgclist(th, g->grayagain); - if (o == NULL) - return; - lua_assert(g->gcstate == GCSatomic || - th->openupval == NULL || isintwups(th)); - for (; o < th->top.p; o++) - markvalue(g, s2v(o)); - for (uv = th->openupval; uv != NULL; uv = uv->u.open.next) - markobject(g, uv); - if (g->gcstate == GCSatomic) { - if (!g->gcemergency) - luaD_shrinkstack(th); - for (o = th->top.p; o < th->stack_last.p + EXTRA_STACK; o++) - setnilvalue(s2v(o)); - - if (!isintwups(th) && th->openupval != NULL) { - th->twups = g->twups; - g->twups = th; - } - } -} - - - -static void propagatemark (global_State *g) { - GCObject *o = g->gray; - nw2black(o); - g->gray = *getgclist(o); - switch (o->tt) { - case LUA_VTABLE: traversetable(g, gco2t(o)); break; - case LUA_VUSERDATA: traverseudata(g, gco2u(o)); break; - case LUA_VLCL: traverseLclosure(g, gco2lcl(o)); break; - case LUA_VCCL: traverseCclosure(g, gco2ccl(o)); break; - case LUA_VPROTO: traverseproto(g, gco2p(o)); break; - case LUA_VTHREAD: traversethread(g, gco2th(o)); break; - default: lua_assert(0); - } -} - - -static l_obj propagateall (global_State *g) { - l_obj work = 0; - while (g->gray) { - propagatemark(g); - work++; - } - return work; -} - - - -static l_obj convergeephemerons (global_State *g) { - int changed; - l_obj work = 0; - int dir = 0; - do { - GCObject *w; - GCObject *next = g->ephemeron; - g->ephemeron = NULL; - changed = 0; - while ((w = next) != NULL) { - Table *h = gco2t(w); - next = h->gclist; - nw2black(h); - if (traverseephemeron(g, h, dir)) { - propagateall(g); - changed = 1; - } - work++; - } - dir = !dir; - } while (changed); - return work; -} - - - - - - - - -static l_obj clearbykeys (global_State *g, GCObject *l) { - l_obj work = 0; - for (; l; l = gco2t(l)->gclist) { - Table *h = gco2t(l); - Node *limit = gnodelast(h); - Node *n; - for (n = gnode(h, 0); n < limit; n++) { - if (iscleared(g, gckeyN(n))) - setempty(gval(n)); - if (isempty(gval(n))) - clearkey(n); - } - work++; - } - return work; -} - - - -static l_obj clearbyvalues (global_State *g, GCObject *l, GCObject *f) { - l_obj work = 0; - for (; l != f; l = gco2t(l)->gclist) { - Table *h = gco2t(l); - Node *n, *limit = gnodelast(h); - unsigned int i; - unsigned int asize = luaH_realasize(h); - for (i = 0; i < asize; i++) { - GCObject *o = gcvalarr(h, i); - if (iscleared(g, o)) - *getArrTag(h, i) = LUA_VEMPTY; - } - for (n = gnode(h, 0); n < limit; n++) { - if (iscleared(g, gcvalueN(gval(n)))) - setempty(gval(n)); - if (isempty(gval(n))) - clearkey(n); - } - work++; - } - return work; -} - - -static void freeupval (lua_State *L, UpVal *uv) { - if (upisopen(uv)) - luaF_unlinkupval(uv); - luaM_free(L, uv); -} - - -static void freeobj (lua_State *L, GCObject *o) { - G(L)->totalobjs--; - switch (o->tt) { - case LUA_VPROTO: - luaF_freeproto(L, gco2p(o)); - break; - case LUA_VUPVAL: - freeupval(L, gco2upv(o)); - break; - case LUA_VLCL: { - LClosure *cl = gco2lcl(o); - luaM_freemem(L, cl, sizeLclosure(cl->nupvalues)); - break; - } - case LUA_VCCL: { - CClosure *cl = gco2ccl(o); - luaM_freemem(L, cl, sizeCclosure(cl->nupvalues)); - break; - } - case LUA_VTABLE: - luaH_free(L, gco2t(o)); - break; - case LUA_VTHREAD: - luaE_freethread(L, gco2th(o)); - break; - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - luaM_freemem(L, o, sizeudata(u->nuvalue, u->len)); - break; - } - case LUA_VSHRSTR: { - TString *ts = gco2ts(o); - luaS_remove(L, ts); - luaM_freemem(L, ts, sizestrshr(ts->shrlen)); - break; - } - case LUA_VLNGSTR: { - TString *ts = gco2ts(o); - if (ts->shrlen == LSTRMEM) - (*ts->falloc)(ts->ud, ts->contents, ts->u.lnglen + 1, 0); - luaM_freemem(L, ts, luaS_sizelngstr(ts->u.lnglen, ts->shrlen)); - break; - } - default: lua_assert(0); - } -} - - - -static GCObject **sweeplist (lua_State *L, GCObject **p, l_obj countin) { - global_State *g = G(L); - int ow = otherwhite(g); - l_obj i; - int white = luaC_white(g); - for (i = 0; *p != NULL && i < countin; i++) { - GCObject *curr = *p; - int marked = curr->marked; - if (isdeadm(ow, marked)) { - *p = curr->next; - freeobj(L, curr); - } - else { - curr->marked = cast_byte((marked & ~maskgcbits) | white | G_NEW); - p = &curr->next; - } - } - return (*p == NULL) ? NULL : p; -} - - - -static GCObject **sweeptolive (lua_State *L, GCObject **p) { - GCObject **old = p; - do { - p = sweeplist(L, p, 1); - } while (p == old); - return p; -} - - - - - - - -static void checkSizes (lua_State *L, global_State *g) { - if (!g->gcemergency) { - if (g->strt.nuse < g->strt.size / 4) - luaS_resize(L, g->strt.size / 2); - } -} - - - -static GCObject *udata2finalize (global_State *g) { - GCObject *o = g->tobefnz; - lua_assert(tofinalize(o)); - g->tobefnz = o->next; - o->next = g->allgc; - g->allgc = o; - resetbit(o->marked, FINALIZEDBIT); - if (issweepphase(g)) - makewhite(g, o); - else if (getage(o) == G_OLD1) - g->firstold1 = o; - return o; -} - - -static void dothecall (lua_State *L, void *ud) { - UNUSED(ud); - luaD_callnoyield(L, L->top.p - 2, 0); -} - - -static void GCTM (lua_State *L) { - global_State *g = G(L); - const TValue *tm; - TValue v; - lua_assert(!g->gcemergency); - setgcovalue(L, &v, udata2finalize(g)); - tm = luaT_gettmbyobj(L, &v, TM_GC); - if (!notm(tm)) { - int status; - lu_byte oldah = L->allowhook; - int oldgcstp = g->gcstp; - g->gcstp |= GCSTPGC; - L->allowhook = 0; - setobj2s(L, L->top.p++, tm); - setobj2s(L, L->top.p++, &v); - L->ci->callstatus |= CIST_FIN; - status = luaD_pcall(L, dothecall, NULL, savestack(L, L->top.p - 2), 0); - L->ci->callstatus &= ~CIST_FIN; - L->allowhook = oldah; - g->gcstp = oldgcstp; - if (l_unlikely(status != LUA_OK)) { - luaE_warnerror(L, "__gc"); - L->top.p--; - } - } -} - - - -static void callallpendingfinalizers (lua_State *L) { - global_State *g = G(L); - while (g->tobefnz) - GCTM(L); -} - - - -static GCObject **findlast (GCObject **p) { - while (*p != NULL) - p = &(*p)->next; - return p; -} - - - -static void separatetobefnz (global_State *g, int all) { - GCObject *curr; - GCObject **p = &g->finobj; - GCObject **lastnext = findlast(&g->tobefnz); - while ((curr = *p) != g->finobjold1) { - lua_assert(tofinalize(curr)); - if (!(iswhite(curr) || all)) - p = &curr->next; - else { - if (curr == g->finobjsur) - g->finobjsur = curr->next; - *p = curr->next; - curr->next = *lastnext; - *lastnext = curr; - lastnext = &curr->next; - } - } -} - - - -static void checkpointer (GCObject **p, GCObject *o) { - if (o == *p) - *p = o->next; -} - - - -static void correctpointers (global_State *g, GCObject *o) { - checkpointer(&g->survival, o); - checkpointer(&g->old1, o); - checkpointer(&g->reallyold, o); - checkpointer(&g->firstold1, o); -} - - - -void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt) { - global_State *g = G(L); - if (tofinalize(o) || - gfasttm(g, mt, TM_GC) == NULL || - (g->gcstp & GCSTPCLS)) - return; - else { - GCObject **p; - if (issweepphase(g)) { - makewhite(g, o); - if (g->sweepgc == &o->next) - g->sweepgc = sweeptolive(L, g->sweepgc); - } - else - correctpointers(g, o); - - for (p = &g->allgc; *p != o; p = &(*p)->next) { } - *p = o->next; - o->next = g->finobj; - g->finobj = o; - l_setbit(o->marked, FINALIZEDBIT); - } -} - - - - - - - - -static void setpause (global_State *g) { - l_obj threshold = applygcparam(g, PAUSE, g->marked); - l_obj debt = threshold - gettotalobjs(g); - if (debt < 0) debt = 0; - luaE_setdebt(g, debt); -} - - - -static void sweep2old (lua_State *L, GCObject **p) { - GCObject *curr; - global_State *g = G(L); - while ((curr = *p) != NULL) { - if (iswhite(curr)) { - lua_assert(isdead(g, curr)); - *p = curr->next; - freeobj(L, curr); - } - else { - setage(curr, G_OLD); - if (curr->tt == LUA_VTHREAD) { - lua_State *th = gco2th(curr); - linkgclist(th, g->grayagain); - } - else if (curr->tt == LUA_VUPVAL && upisopen(gco2upv(curr))) - set2gray(curr); - else - nw2black(curr); - p = &curr->next; - } - } -} - - - -static GCObject **sweepgen (lua_State *L, global_State *g, GCObject **p, - GCObject *limit, GCObject **pfirstold1, - l_obj *paddedold) { - static const lu_byte nextage[] = { - G_SURVIVAL, - G_OLD1, - G_OLD1, - G_OLD, - G_OLD, - G_TOUCHED1, - G_TOUCHED2 - }; - l_obj addedold = 0; - int white = luaC_white(g); - GCObject *curr; - while ((curr = *p) != limit) { - if (iswhite(curr)) { - lua_assert(!isold(curr) && isdead(g, curr)); - *p = curr->next; - freeobj(L, curr); - } - else { - int age = getage(curr); - if (age == G_NEW) { - int marked = curr->marked & ~maskgcbits; - curr->marked = cast_byte(marked | G_SURVIVAL | white); - } - else { - lua_assert(age != G_OLD1); - setage(curr, nextage[age]); - if (getage(curr) == G_OLD1) { - addedold++; - if (*pfirstold1 == NULL) - *pfirstold1 = curr; - } - } - p = &curr->next; - } - } - *paddedold += addedold; - return p; -} - - - -static GCObject **correctgraylist (GCObject **p) { - GCObject *curr; - while ((curr = *p) != NULL) { - GCObject **next = getgclist(curr); - if (iswhite(curr)) - goto remove; - else if (getage(curr) == G_TOUCHED1) { - lua_assert(isgray(curr)); - nw2black(curr); - setage(curr, G_TOUCHED2); - goto remain; - } - else if (curr->tt == LUA_VTHREAD) { - lua_assert(isgray(curr)); - goto remain; - } - else { - lua_assert(isold(curr)); - if (getage(curr) == G_TOUCHED2) - setage(curr, G_OLD); - nw2black(curr); - goto remove; - } - remove: *p = *next; continue; - remain: p = next; continue; - } - return p; -} - - - -static void correctgraylists (global_State *g) { - GCObject **list = correctgraylist(&g->grayagain); - *list = g->weak; g->weak = NULL; - list = correctgraylist(list); - *list = g->allweak; g->allweak = NULL; - list = correctgraylist(list); - *list = g->ephemeron; g->ephemeron = NULL; - correctgraylist(list); -} - - - -static void markold (global_State *g, GCObject *from, GCObject *to) { - GCObject *p; - for (p = from; p != to; p = p->next) { - if (getage(p) == G_OLD1) { - lua_assert(!iswhite(p)); - setage(p, G_OLD); - if (isblack(p)) - reallymarkobject(g, p); - } - } -} - - - -static void finishgencycle (lua_State *L, global_State *g) { - correctgraylists(g); - checkSizes(L, g); - g->gcstate = GCSpropagate; - if (!g->gcemergency) - callallpendingfinalizers(L); -} - - - -static void minor2inc (lua_State *L, global_State *g, int kind) { - g->GCmajorminor = g->marked; - g->gckind = kind; - g->reallyold = g->old1 = g->survival = NULL; - g->finobjrold = g->finobjold1 = g->finobjsur = NULL; - entersweep(L); - - luaE_setdebt(g, applygcparam(g, STEPSIZE, 100)); -} - - - -static int checkminormajor (global_State *g, l_obj addedold1) { - l_obj step = applygcparam(g, MINORMUL, g->GCmajorminor); - l_obj limit = applygcparam(g, MINORMAJOR, g->GCmajorminor); - return (addedold1 >= (step >> 1) || g->marked >= limit); -} - - -static void youngcollection (lua_State *L, global_State *g) { - l_obj addedold1 = 0; - l_obj marked = g->marked; - GCObject **psurvival; - GCObject *dummy; - lua_assert(g->gcstate == GCSpropagate); - if (g->firstold1) { - markold(g, g->firstold1, g->reallyold); - g->firstold1 = NULL; - } - markold(g, g->finobj, g->finobjrold); - markold(g, g->tobefnz, NULL); - - atomic(L); - - - g->gcstate = GCSswpallgc; - psurvival = sweepgen(L, g, &g->allgc, g->survival, &g->firstold1, &addedold1); - - sweepgen(L, g, psurvival, g->old1, &g->firstold1, &addedold1); - g->reallyold = g->old1; - g->old1 = *psurvival; - g->survival = g->allgc; - - - dummy = NULL; - psurvival = sweepgen(L, g, &g->finobj, g->finobjsur, &dummy, &addedold1); - - sweepgen(L, g, psurvival, g->finobjold1, &dummy, &addedold1); - g->finobjrold = g->finobjold1; - g->finobjold1 = *psurvival; - g->finobjsur = g->finobj; - - sweepgen(L, g, &g->tobefnz, NULL, &dummy, &addedold1); - - - g->marked = marked + addedold1; - - - if (checkminormajor(g, addedold1)) { - minor2inc(L, g, KGC_GENMAJOR); - g->marked = 0; - } - else - finishgencycle(L, g); -} - - - -static void atomic2gen (lua_State *L, global_State *g) { - cleargraylists(g); - - g->gcstate = GCSswpallgc; - sweep2old(L, &g->allgc); - - g->reallyold = g->old1 = g->survival = g->allgc; - g->firstold1 = NULL; - - - sweep2old(L, &g->finobj); - g->finobjrold = g->finobjold1 = g->finobjsur = g->finobj; - - sweep2old(L, &g->tobefnz); - - g->gckind = KGC_GENMINOR; - g->GCmajorminor = g->marked; - g->marked = 0; - finishgencycle(L, g); -} - - - -static void setminordebt (global_State *g) { - luaE_setdebt(g, applygcparam(g, MINORMUL, g->GCmajorminor)); -} - - - -static void entergen (lua_State *L, global_State *g) { - luaC_runtilstate(L, GCSpause, 1); - luaC_runtilstate(L, GCSpropagate, 1); - atomic(L); - atomic2gen(L, g); - setminordebt(g); -} - - - -void luaC_changemode (lua_State *L, int newmode) { - global_State *g = G(L); - if (g->gckind == KGC_GENMAJOR) - g->gckind = KGC_INC; - if (newmode != g->gckind) { - if (newmode == KGC_INC) - minor2inc(L, g, KGC_INC); - else { - lua_assert(newmode == KGC_GENMINOR); - entergen(L, g); - } - } -} - - - -static void fullgen (lua_State *L, global_State *g) { - minor2inc(L, g, KGC_INC); - entergen(L, g); -} - - - -static int checkmajorminor (lua_State *L, global_State *g) { - if (g->gckind == KGC_GENMAJOR) { - l_obj numobjs = gettotalobjs(g); - l_obj addedobjs = numobjs - g->GCmajorminor; - l_obj limit = applygcparam(g, MAJORMINOR, addedobjs); - l_obj tobecollected = numobjs - g->marked; - if (tobecollected > limit) { - atomic2gen(L, g); - setminordebt(g); - return 0; - } - } - g->GCmajorminor = g->marked; - return 1; -} - - - - - - - - -static void entersweep (lua_State *L) { - global_State *g = G(L); - g->gcstate = GCSswpallgc; - lua_assert(g->sweepgc == NULL); - g->sweepgc = sweeptolive(L, &g->allgc); -} - - - -static void deletelist (lua_State *L, GCObject *p, GCObject *limit) { - while (p != limit) { - GCObject *next = p->next; - freeobj(L, p); - p = next; - } -} - - - -void luaC_freeallobjects (lua_State *L) { - global_State *g = G(L); - g->gcstp = GCSTPCLS; - luaC_changemode(L, KGC_INC); - separatetobefnz(g, 1); - lua_assert(g->finobj == NULL); - callallpendingfinalizers(L); - deletelist(L, g->allgc, obj2gco(g->mainthread)); - lua_assert(g->finobj == NULL); - deletelist(L, g->fixedgc, NULL); - lua_assert(g->strt.nuse == 0); -} - - -static l_obj atomic (lua_State *L) { - l_obj work = 0; - global_State *g = G(L); - GCObject *origweak, *origall; - GCObject *grayagain = g->grayagain; - g->grayagain = NULL; - lua_assert(g->ephemeron == NULL && g->weak == NULL); - lua_assert(!iswhite(g->mainthread)); - g->gcstate = GCSatomic; - markobject(g, L); - - markvalue(g, &g->l_registry); - markmt(g); - work += propagateall(g); - - work += remarkupvals(g); - work += propagateall(g); - g->gray = grayagain; - work += propagateall(g); - work += convergeephemerons(g); - - - work += clearbyvalues(g, g->weak, NULL); - work += clearbyvalues(g, g->allweak, NULL); - origweak = g->weak; origall = g->allweak; - separatetobefnz(g, 0); - work += markbeingfnz(g); - work += propagateall(g); - work += convergeephemerons(g); - - - work += clearbykeys(g, g->ephemeron); - work += clearbykeys(g, g->allweak); - - work += clearbyvalues(g, g->weak, origweak); - work += clearbyvalues(g, g->allweak, origall); - luaS_clearcache(g); - g->currentwhite = cast_byte(otherwhite(g)); - lua_assert(g->gray == NULL); - return work; -} - - - -static void sweepstep (lua_State *L, global_State *g, - int nextstate, GCObject **nextlist, int fast) { - if (g->sweepgc) - g->sweepgc = sweeplist(L, g->sweepgc, fast ? MAX_LOBJ : GCSWEEPMAX); - else { - g->gcstate = nextstate; - g->sweepgc = nextlist; - } -} - - - -static l_obj singlestep (lua_State *L, int fast) { - global_State *g = G(L); - l_obj work; - lua_assert(!g->gcstopem); - g->gcstopem = 1; - switch (g->gcstate) { - case GCSpause: { - restartcollection(g); - g->gcstate = GCSpropagate; - work = 1; - break; - } - case GCSpropagate: { - if (fast || g->gray == NULL) { - g->gcstate = GCSenteratomic; - work = 0; - } - else { - propagatemark(g); - work = 1; - } - break; - } - case GCSenteratomic: { - work = atomic(L); - if (checkmajorminor(L, g)) - entersweep(L); - break; - } - case GCSswpallgc: { - sweepstep(L, g, GCSswpfinobj, &g->finobj, fast); - work = GCSWEEPMAX; - break; - } - case GCSswpfinobj: { - sweepstep(L, g, GCSswptobefnz, &g->tobefnz, fast); - work = GCSWEEPMAX; - break; - } - case GCSswptobefnz: { - sweepstep(L, g, GCSswpend, NULL, fast); - work = GCSWEEPMAX; - break; - } - case GCSswpend: { - checkSizes(L, g); - g->gcstate = GCScallfin; - work = 0; - break; - } - case GCScallfin: { - if (g->tobefnz && !g->gcemergency) { - g->gcstopem = 0; - GCTM(L); - work = 1; - } - else { - g->gcstate = GCSpause; - work = 0; - } - break; - } - default: lua_assert(0); return 0; - } - g->gcstopem = 0; - return work; -} - - - -void luaC_runtilstate (lua_State *L, int state, int fast) { - global_State *g = G(L); - lua_assert(g->gckind == KGC_INC); - while (state != g->gcstate) - singlestep(L, fast); -} - - - - -static void incstep (lua_State *L, global_State *g) { - l_obj stepsize = applygcparam(g, STEPSIZE, 100); - l_obj work2do = applygcparam(g, STEPMUL, stepsize); - int fast = 0; - if (work2do == 0) { - work2do = MAX_LOBJ; - fast = 1; - } - do { - l_obj work = singlestep(L, fast); - if (g->gckind == KGC_GENMINOR) - return; - work2do -= work; - } while (work2do > 0 && g->gcstate != GCSpause); - if (g->gcstate == GCSpause) - setpause(g); - else - luaE_setdebt(g, stepsize); -} - - -void luaC_step (lua_State *L) { - global_State *g = G(L); - lua_assert(!g->gcemergency); - if (!gcrunning(g)) - luaE_setdebt(g, 2000); - else { - switch (g->gckind) { - case KGC_INC: case KGC_GENMAJOR: - incstep(L, g); - break; - case KGC_GENMINOR: - youngcollection(L, g); - setminordebt(g); - break; - } - } -} - - - -static void fullinc (lua_State *L, global_State *g) { - if (keepinvariant(g)) - entersweep(L); - - luaC_runtilstate(L, GCSpause, 1); - luaC_runtilstate(L, GCScallfin, 1); - - lua_assert(g->marked == gettotalobjs(g)); - luaC_runtilstate(L, GCSpause, 1); - setpause(g); -} - - - -void luaC_fullgc (lua_State *L, int isemergency) { - global_State *g = G(L); - lua_assert(!g->gcemergency); - g->gcemergency = isemergency; - switch (g->gckind) { - case KGC_GENMINOR: fullgen(L, g); break; - case KGC_INC: fullinc(L, g); break; - case KGC_GENMAJOR: - g->gckind = KGC_INC; - fullinc(L, g); - g->gckind = KGC_GENMAJOR; - break; - } - g->gcemergency = 0; -} - - - - - - -//path: src/dependencies/lua/llex.c - - -#define llex_c -#define LUA_CORE - - - - - -#include -#include - - - - - - - - - - - - - - - - -//path: src/dependencies/lua/lparser.h - - -#ifndef lparser_h -#define lparser_h - - - - - - - - - - - - -typedef enum { - VVOID, - VNIL, - VTRUE, - VFALSE, - VK, - VKFLT, - VKINT, - VKSTR, - VNONRELOC, - VLOCAL, - VUPVAL, - VCONST, - VINDEXED, - VINDEXUP, - VINDEXI, - VINDEXSTR, - VJMP, - VRELOC, - VCALL, - VVARARG -} expkind; - - -#define vkisvar(k) (VLOCAL <= (k) && (k) <= VINDEXSTR) -#define vkisindexed(k) (VINDEXED <= (k) && (k) <= VINDEXSTR) - - -typedef struct expdesc { - expkind k; - union { - lua_Integer ival; - lua_Number nval; - TString *strval; - int info; - struct { - short idx; - lu_byte t; - } ind; - struct { - lu_byte ridx; - unsigned short vidx; - } var; - } u; - int t; - int f; -} expdesc; - - - -#define VDKREG 0 -#define RDKCONST 1 -#define RDKTOCLOSE 2 -#define RDKCTC 3 - - -typedef union Vardesc { - struct { - TValuefields; - lu_byte kind; - lu_byte ridx; - short pidx; - TString *name; - } vd; - TValue k; -} Vardesc; - - - - -typedef struct Labeldesc { - TString *name; - int pc; - int line; - lu_byte nactvar; - lu_byte close; -} Labeldesc; - - - -typedef struct Labellist { - Labeldesc *arr; - int n; - int size; -} Labellist; - - - -typedef struct Dyndata { - struct { - Vardesc *arr; - int n; - int size; - } actvar; - Labellist gt; - Labellist label; -} Dyndata; - - - -struct BlockCnt; - - - -typedef struct FuncState { - Proto *f; - struct FuncState *prev; - struct LexState *ls; - struct BlockCnt *bl; - int pc; - int lasttarget; - int previousline; - int nk; - int np; - int nabslineinfo; - int firstlocal; - int firstlabel; - short ndebugvars; - lu_byte nactvar; - lu_byte nups; - lu_byte freereg; - lu_byte iwthabs; - lu_byte needclose; -} FuncState; - - -LUAI_FUNC int luaY_nvarstack (FuncState *fs); -LUAI_FUNC LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, - Dyndata *dyd, const char *name, int firstchar); - - -#endif - - - - - - - - - - - - - -#define next(ls) (ls->current = zgetc(ls->z)) - - - -#define currIsNewline(ls) (ls->current == '\n' || ls->current == '\r') - - - -static const char *const luaX_tokens [] = { - "and", "break", "do", "else", "elseif", - "end", "false", "for", "function", "goto", "if", - "in", "local", "nil", "not", "or", "repeat", - "return", "then", "true", "until", "while", - "//", "..", "...", "==", ">=", "<=", "~=", - "<<", ">>", "::", "", - "", "", "", "" -}; - - -#define save_and_next(ls) (save(ls, ls->current), next(ls)) - - -static l_noret lexerror (LexState *ls, const char *msg, int token); - - -static void save (LexState *ls, int c) { - Mbuffer *b = ls->buff; - if (luaZ_bufflen(b) + 1 > luaZ_sizebuffer(b)) { - size_t newsize; - if (luaZ_sizebuffer(b) >= MAX_SIZE/2) - lexerror(ls, "lexical element too long", 0); - newsize = luaZ_sizebuffer(b) * 2; - luaZ_resizebuffer(ls->L, b, newsize); - } - b->buffer[luaZ_bufflen(b)++] = cast_char(c); -} - - -void luaX_init (lua_State *L) { - int i; - TString *e = luaS_newliteral(L, LUA_ENV); - luaC_fix(L, obj2gco(e)); - for (i=0; iextra = cast_byte(i+1); - } -} - - -const char *luaX_token2str (LexState *ls, int token) { - if (token < FIRST_RESERVED) { - if (lisprint(token)) - return luaO_pushfstring(ls->L, "'%c'", token); - else - return luaO_pushfstring(ls->L, "'<\\%d>'", token); - } - else { - const char *s = luaX_tokens[token - FIRST_RESERVED]; - if (token < TK_EOS) - return luaO_pushfstring(ls->L, "'%s'", s); - else - return s; - } -} - - -static const char *txtToken (LexState *ls, int token) { - switch (token) { - case TK_NAME: case TK_STRING: - case TK_FLT: case TK_INT: - save(ls, '\0'); - return luaO_pushfstring(ls->L, "'%s'", luaZ_buffer(ls->buff)); - default: - return luaX_token2str(ls, token); - } -} - - -static l_noret lexerror (LexState *ls, const char *msg, int token) { - msg = luaG_addinfo(ls->L, msg, ls->source, ls->linenumber); - if (token) - luaO_pushfstring(ls->L, "%s near %s", msg, txtToken(ls, token)); - luaD_throw(ls->L, LUA_ERRSYNTAX); -} - - -l_noret luaX_syntaxerror (LexState *ls, const char *msg) { - lexerror(ls, msg, ls->t.token); -} - - - -TString *luaX_newstring (LexState *ls, const char *str, size_t l) { - lua_State *L = ls->L; - TString *ts = luaS_newlstr(L, str, l); - TString *oldts = luaH_getstrkey(ls->h, ts); - if (oldts != NULL) - return oldts; - else { - TValue *stv = s2v(L->top.p++); - setsvalue(L, stv, ts); - luaH_set(L, ls->h, stv, stv); - - luaC_checkGC(L); - L->top.p--; - } - return ts; -} - - - -static void inclinenumber (LexState *ls) { - int old = ls->current; - lua_assert(currIsNewline(ls)); - next(ls); - if (currIsNewline(ls) && ls->current != old) - next(ls); - if (++ls->linenumber >= MAX_INT) - lexerror(ls, "chunk has too many lines", 0); -} - - -void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source, - int firstchar) { - ls->t.token = 0; - ls->L = L; - ls->current = firstchar; - ls->lookahead.token = TK_EOS; - ls->z = z; - ls->fs = NULL; - ls->linenumber = 1; - ls->lastline = 1; - ls->source = source; - ls->envn = luaS_newliteral(L, LUA_ENV); - luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER); -} - - - - - - -static int check_next1 (LexState *ls, int c) { - if (ls->current == c) { - next(ls); - return 1; - } - else return 0; -} - - - -static int check_next2 (LexState *ls, const char *set) { - lua_assert(set[2] == '\0'); - if (ls->current == set[0] || ls->current == set[1]) { - save_and_next(ls); - return 1; - } - else return 0; -} - - - - -static int read_numeral (LexState *ls, SemInfo *seminfo) { - TValue obj; - const char *expo = "Ee"; - int first = ls->current; - lua_assert(lisdigit(ls->current)); - save_and_next(ls); - if (first == '0' && check_next2(ls, "xX")) - expo = "Pp"; - for (;;) { - if (check_next2(ls, expo)) - check_next2(ls, "-+"); - else if (lisxdigit(ls->current) || ls->current == '.') - save_and_next(ls); - else break; - } - if (lislalpha(ls->current)) - save_and_next(ls); - save(ls, '\0'); - if (luaO_str2num(luaZ_buffer(ls->buff), &obj) == 0) - lexerror(ls, "malformed number", TK_FLT); - if (ttisinteger(&obj)) { - seminfo->i = ivalue(&obj); - return TK_INT; - } - else { - lua_assert(ttisfloat(&obj)); - seminfo->r = fltvalue(&obj); - return TK_FLT; - } -} - - - -static size_t skip_sep (LexState *ls) { - size_t count = 0; - int s = ls->current; - lua_assert(s == '[' || s == ']'); - save_and_next(ls); - while (ls->current == '=') { - save_and_next(ls); - count++; - } - return (ls->current == s) ? count + 2 - : (count == 0) ? 1 - : 0; -} - - -static void read_long_string (LexState *ls, SemInfo *seminfo, size_t sep) { - int line = ls->linenumber; - save_and_next(ls); - if (currIsNewline(ls)) - inclinenumber(ls); - for (;;) { - switch (ls->current) { - case EOZ: { - const char *what = (seminfo ? "string" : "comment"); - const char *msg = luaO_pushfstring(ls->L, - "unfinished long %s (starting at line %d)", what, line); - lexerror(ls, msg, TK_EOS); - break; - } - case ']': { - if (skip_sep(ls) == sep) { - save_and_next(ls); - goto endloop; - } - break; - } - case '\n': case '\r': { - save(ls, '\n'); - inclinenumber(ls); - if (!seminfo) luaZ_resetbuffer(ls->buff); - break; - } - default: { - if (seminfo) save_and_next(ls); - else next(ls); - } - } - } endloop: - if (seminfo) - seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + sep, - luaZ_bufflen(ls->buff) - 2 * sep); -} - - -static void esccheck (LexState *ls, int c, const char *msg) { - if (!c) { - if (ls->current != EOZ) - save_and_next(ls); - lexerror(ls, msg, TK_STRING); - } -} - - -static int gethexa (LexState *ls) { - save_and_next(ls); - esccheck (ls, lisxdigit(ls->current), "hexadecimal digit expected"); - return luaO_hexavalue(ls->current); -} - - -static int readhexaesc (LexState *ls) { - int r = gethexa(ls); - r = (r << 4) + gethexa(ls); - luaZ_buffremove(ls->buff, 2); - return r; -} - - -static unsigned long readutf8esc (LexState *ls) { - unsigned long r; - int i = 4; - save_and_next(ls); - esccheck(ls, ls->current == '{', "missing '{'"); - r = gethexa(ls); - while (cast_void(save_and_next(ls)), lisxdigit(ls->current)) { - i++; - esccheck(ls, r <= (0x7FFFFFFFu >> 4), "UTF-8 value too large"); - r = (r << 4) + luaO_hexavalue(ls->current); - } - esccheck(ls, ls->current == '}', "missing '}'"); - next(ls); - luaZ_buffremove(ls->buff, i); - return r; -} - - -static void utf8esc (LexState *ls) { - char buff[UTF8BUFFSZ]; - int n = luaO_utf8esc(buff, readutf8esc(ls)); - for (; n > 0; n--) - save(ls, buff[UTF8BUFFSZ - n]); -} - - -static int readdecesc (LexState *ls) { - int i; - int r = 0; - for (i = 0; i < 3 && lisdigit(ls->current); i++) { - r = 10*r + ls->current - '0'; - save_and_next(ls); - } - esccheck(ls, r <= UCHAR_MAX, "decimal escape too large"); - luaZ_buffremove(ls->buff, i); - return r; -} - - -static void read_string (LexState *ls, int del, SemInfo *seminfo) { - save_and_next(ls); - while (ls->current != del) { - switch (ls->current) { - case EOZ: - lexerror(ls, "unfinished string", TK_EOS); - break; - case '\n': - case '\r': - lexerror(ls, "unfinished string", TK_STRING); - break; - case '\\': { - int c; - save_and_next(ls); - switch (ls->current) { - case 'a': c = '\a'; goto read_save; - case 'b': c = '\b'; goto read_save; - case 'f': c = '\f'; goto read_save; - case 'n': c = '\n'; goto read_save; - case 'r': c = '\r'; goto read_save; - case 't': c = '\t'; goto read_save; - case 'v': c = '\v'; goto read_save; - case 'x': c = readhexaesc(ls); goto read_save; - case 'u': utf8esc(ls); goto no_save; - case '\n': case '\r': - inclinenumber(ls); c = '\n'; goto only_save; - case '\\': case '\"': case '\'': - c = ls->current; goto read_save; - case EOZ: goto no_save; /* will raise an error next loop */ - case 'z': { /* zap following span of spaces */ - luaZ_buffremove(ls->buff, 1); /* remove '\\' */ - next(ls); /* skip the 'z' */ - while (lisspace(ls->current)) { - if (currIsNewline(ls)) inclinenumber(ls); - else next(ls); - } - goto no_save; - } - default: { - esccheck(ls, lisdigit(ls->current), "invalid escape sequence"); - c = readdecesc(ls); /* digital escape '\ddd' */ - goto only_save; - } - } - read_save: - next(ls); - /* go through */ - only_save: - luaZ_buffremove(ls->buff, 1); /* remove '\\' */ - save(ls, c); - /* go through */ - no_save: break; - } - default: - save_and_next(ls); - } - } - save_and_next(ls); /* skip delimiter */ - seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1, - luaZ_bufflen(ls->buff) - 2); -} - - -static int llex (LexState *ls, SemInfo *seminfo) { - luaZ_resetbuffer(ls->buff); - for (;;) { - switch (ls->current) { - case '\n': case '\r': { /* line breaks */ - inclinenumber(ls); - break; - } - case ' ': case '\f': case '\t': case '\v': { /* spaces */ - next(ls); - break; - } - case '-': { /* '-' or '--' (comment) */ - next(ls); - if (ls->current != '-') return '-'; - /* else is a comment */ - next(ls); - if (ls->current == '[') { /* long comment? */ - size_t sep = skip_sep(ls); - luaZ_resetbuffer(ls->buff); /* 'skip_sep' may dirty the buffer */ - if (sep >= 2) { - read_long_string(ls, NULL, sep); /* skip long comment */ - luaZ_resetbuffer(ls->buff); /* previous call may dirty the buff. */ - break; - } - } - /* else short comment */ - while (!currIsNewline(ls) && ls->current != EOZ) - next(ls); /* skip until end of line (or end of file) */ - break; - } - case '[': { /* long string or simply '[' */ - size_t sep = skip_sep(ls); - if (sep >= 2) { - read_long_string(ls, seminfo, sep); - return TK_STRING; - } - else if (sep == 0) /* '[=...' missing second bracket? */ - lexerror(ls, "invalid long string delimiter", TK_STRING); - return '['; - } - case '=': { - next(ls); - if (check_next1(ls, '=')) return TK_EQ; /* '==' */ - else return '='; - } - case '<': { - next(ls); - if (check_next1(ls, '=')) return TK_LE; /* '<=' */ - else if (check_next1(ls, '<')) return TK_SHL; /* '<<' */ - else return '<'; - } - case '>': { - next(ls); - if (check_next1(ls, '=')) return TK_GE; /* '>=' */ - else if (check_next1(ls, '>')) return TK_SHR; /* '>>' */ - else return '>'; - } - case '/': { - next(ls); - if (check_next1(ls, '/')) return TK_IDIV; /* '//' */ - else return '/'; - } - case '~': { - next(ls); - if (check_next1(ls, '=')) return TK_NE; /* '~=' */ - else return '~'; - } - case ':': { - next(ls); - if (check_next1(ls, ':')) return TK_DBCOLON; /* '::' */ - else return ':'; - } - case '"': case '\'': { - read_string(ls, ls->current, seminfo); - return TK_STRING; - } - case '.': { - save_and_next(ls); - if (check_next1(ls, '.')) { - if (check_next1(ls, '.')) - return TK_DOTS; - else return TK_CONCAT; - } - else if (!lisdigit(ls->current)) return '.'; - else return read_numeral(ls, seminfo); - } - case '0': case '1': case '2': case '3': case '4': - case '5': case '6': case '7': case '8': case '9': { - return read_numeral(ls, seminfo); - } - case EOZ: { - return TK_EOS; - } - default: { - if (lislalpha(ls->current)) { - TString *ts; - do { - save_and_next(ls); - } while (lislalnum(ls->current)); - ts = luaX_newstring(ls, luaZ_buffer(ls->buff), - luaZ_bufflen(ls->buff)); - seminfo->ts = ts; - if (isreserved(ts)) - return ts->extra - 1 + FIRST_RESERVED; - else { - return TK_NAME; - } - } - else { - int c = ls->current; - next(ls); - return c; - } - } - } - } -} - - -void luaX_next (LexState *ls) { - ls->lastline = ls->linenumber; - if (ls->lookahead.token != TK_EOS) { - ls->t = ls->lookahead; - ls->lookahead.token = TK_EOS; - } - else - ls->t.token = llex(ls, &ls->t.seminfo); -} - - -int luaX_lookahead (LexState *ls) { - lua_assert(ls->lookahead.token == TK_EOS); - ls->lookahead.token = llex(ls, &ls->lookahead.seminfo); - return ls->lookahead.token; -} - - - -//path: src/dependencies/lua/lcode.c - - -#define lcode_c -#define LUA_CORE - - - - - -#include -#include -#include - - - - -//path: src/dependencies/lua/lcode.h - - -#ifndef lcode_h -#define lcode_h - - - - - - - - - - - - -#define NO_JUMP (-1) - - - -typedef enum BinOpr { - - OPR_ADD, OPR_SUB, OPR_MUL, OPR_MOD, OPR_POW, - OPR_DIV, OPR_IDIV, - - OPR_BAND, OPR_BOR, OPR_BXOR, - OPR_SHL, OPR_SHR, - - OPR_CONCAT, - - OPR_EQ, OPR_LT, OPR_LE, - OPR_NE, OPR_GT, OPR_GE, - - OPR_AND, OPR_OR, - OPR_NOBINOPR -} BinOpr; - - - -#define foldbinop(op) ((op) <= OPR_SHR) - - -#define luaK_codeABC(fs,o,a,b,c) luaK_codeABCk(fs,o,a,b,c,0) - - -typedef enum UnOpr { OPR_MINUS, OPR_BNOT, OPR_NOT, OPR_LEN, OPR_NOUNOPR } UnOpr; - - - -#define getinstruction(fs,e) ((fs)->f->code[(e)->u.info]) - - -#define luaK_setmultret(fs,e) luaK_setreturns(fs, e, LUA_MULTRET) - -#define luaK_jumpto(fs,t) luaK_patchlist(fs, luaK_jump(fs), t) - -LUAI_FUNC int luaK_code (FuncState *fs, Instruction i); -LUAI_FUNC int luaK_codeABx (FuncState *fs, OpCode o, int A, unsigned Bx); -LUAI_FUNC int luaK_codeABCk (FuncState *fs, OpCode o, int A, - int B, int C, int k); -LUAI_FUNC int luaK_exp2const (FuncState *fs, const expdesc *e, TValue *v); -LUAI_FUNC void luaK_fixline (FuncState *fs, int line); -LUAI_FUNC void luaK_nil (FuncState *fs, int from, int n); -LUAI_FUNC void luaK_reserveregs (FuncState *fs, int n); -LUAI_FUNC void luaK_checkstack (FuncState *fs, int n); -LUAI_FUNC void luaK_int (FuncState *fs, int reg, lua_Integer n); -LUAI_FUNC void luaK_dischargevars (FuncState *fs, expdesc *e); -LUAI_FUNC int luaK_exp2anyreg (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2anyregup (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2nextreg (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2val (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_self (FuncState *fs, expdesc *e, expdesc *key); -LUAI_FUNC void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k); -LUAI_FUNC void luaK_goiftrue (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_goiffalse (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_storevar (FuncState *fs, expdesc *var, expdesc *e); -LUAI_FUNC void luaK_setreturns (FuncState *fs, expdesc *e, int nresults); -LUAI_FUNC void luaK_setoneret (FuncState *fs, expdesc *e); -LUAI_FUNC int luaK_jump (FuncState *fs); -LUAI_FUNC void luaK_ret (FuncState *fs, int first, int nret); -LUAI_FUNC void luaK_patchlist (FuncState *fs, int list, int target); -LUAI_FUNC void luaK_patchtohere (FuncState *fs, int list); -LUAI_FUNC void luaK_concat (FuncState *fs, int *l1, int l2); -LUAI_FUNC int luaK_getlabel (FuncState *fs); -LUAI_FUNC void luaK_prefix (FuncState *fs, UnOpr op, expdesc *v, int line); -LUAI_FUNC void luaK_infix (FuncState *fs, BinOpr op, expdesc *v); -LUAI_FUNC void luaK_posfix (FuncState *fs, BinOpr op, expdesc *v1, - expdesc *v2, int line); -LUAI_FUNC void luaK_settablesize (FuncState *fs, int pc, - int ra, int asize, int hsize); -LUAI_FUNC void luaK_setlist (FuncState *fs, int base, int nelems, int tostore); -LUAI_FUNC void luaK_finish (FuncState *fs); -LUAI_FUNC l_noret luaK_semerror (LexState *ls, const char *msg); - - -#endif - - - - - - - - - - - - - - - - - - - - - - -//path: src/dependencies/lua/lvm.h - - -#ifndef lvm_h -#define lvm_h - - - - - - - - - - -#if !defined(LUA_NOCVTN2S) -#define cvt2str(o) ttisnumber(o) -#else -#define cvt2str(o) 0 -#endif - - -#if !defined(LUA_NOCVTS2N) -#define cvt2num(o) ttisstring(o) -#else -#define cvt2num(o) 0 -#endif - - - -#if !defined(LUA_FLOORN2I) -#define LUA_FLOORN2I F2Ieq -#endif - - - -typedef enum { - F2Ieq, - F2Ifloor, - F2Iceil -} F2Imod; - - - -#define tonumber(o,n) \ - (ttisfloat(o) ? (*(n) = fltvalue(o), 1) : luaV_tonumber_(o,n)) - - - -#define tonumberns(o,n) \ - (ttisfloat(o) ? ((n) = fltvalue(o), 1) : \ - (ttisinteger(o) ? ((n) = cast_num(ivalue(o)), 1) : 0)) - - - -#define tointeger(o,i) \ - (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ - : luaV_tointeger(o,i,LUA_FLOORN2I)) - - - -#define tointegerns(o,i) \ - (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ - : luaV_tointegerns(o,i,LUA_FLOORN2I)) - - -#define intop(op,v1,v2) l_castU2S(l_castS2U(v1) op l_castS2U(v2)) - -#define luaV_rawequalobj(t1,t2) luaV_equalobj(NULL,t1,t2) - - - -#define luaV_fastget(t,k,res,f, tag) \ - (tag = (!ttistable(t) ? LUA_VNOTABLE : f(hvalue(t), k, res))) - - - -#define luaV_fastgeti(t,k,res,tag) \ - if (!ttistable(t)) tag = LUA_VNOTABLE; \ - else { luaH_fastgeti(hvalue(t), k, res, tag); } - - -#define luaV_fastset(t,k,val,hres,f) \ - (hres = (!ttistable(t) ? HNOTATABLE : f(hvalue(t), k, val))) - -#define luaV_fastseti(t,k,val,hres) \ - if (!ttistable(t)) hres = HNOTATABLE; \ - else { luaH_fastseti(hvalue(t), k, val, hres); } - - - -#define luaV_finishfastset(L,t,v) luaC_barrierback(L, gcvalue(t), v) - - - -#define luaV_shiftr(x,y) luaV_shiftl(x,intop(-, 0, y)) - - - -LUAI_FUNC int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2); -LUAI_FUNC int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r); -LUAI_FUNC int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r); -LUAI_FUNC int luaV_tonumber_ (const TValue *obj, lua_Number *n); -LUAI_FUNC int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode); -LUAI_FUNC int luaV_tointegerns (const TValue *obj, lua_Integer *p, - F2Imod mode); -LUAI_FUNC int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode); -LUAI_FUNC int luaV_finishget (lua_State *L, const TValue *t, TValue *key, - StkId val, int tag); -LUAI_FUNC void luaV_finishset (lua_State *L, const TValue *t, TValue *key, - TValue *val, int aux); -LUAI_FUNC void luaV_finishOp (lua_State *L); -LUAI_FUNC void luaV_execute (lua_State *L, CallInfo *ci); -LUAI_FUNC void luaV_concat (lua_State *L, int total); -LUAI_FUNC lua_Integer luaV_idiv (lua_State *L, lua_Integer x, lua_Integer y); -LUAI_FUNC lua_Integer luaV_mod (lua_State *L, lua_Integer x, lua_Integer y); -LUAI_FUNC lua_Number luaV_modf (lua_State *L, lua_Number x, lua_Number y); -LUAI_FUNC lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y); -LUAI_FUNC void luaV_objlen (lua_State *L, StkId ra, const TValue *rb); - -#endif - - - - - -#define MAXREGS 255 - - -#define hasjumps(e) ((e)->t != (e)->f) - - -static int codesJ (FuncState *fs, OpCode o, int sj, int k); - - - - -l_noret luaK_semerror (LexState *ls, const char *msg) { - ls->t.token = 0; - luaX_syntaxerror(ls, msg); -} - - - -static int tonumeral (const expdesc *e, TValue *v) { - if (hasjumps(e)) - return 0; - switch (e->k) { - case VKINT: - if (v) setivalue(v, e->u.ival); - return 1; - case VKFLT: - if (v) setfltvalue(v, e->u.nval); - return 1; - default: return 0; - } -} - - - -static TValue *const2val (FuncState *fs, const expdesc *e) { - lua_assert(e->k == VCONST); - return &fs->ls->dyd->actvar.arr[e->u.info].k; -} - - - -int luaK_exp2const (FuncState *fs, const expdesc *e, TValue *v) { - if (hasjumps(e)) - return 0; - switch (e->k) { - case VFALSE: - setbfvalue(v); - return 1; - case VTRUE: - setbtvalue(v); - return 1; - case VNIL: - setnilvalue(v); - return 1; - case VKSTR: { - setsvalue(fs->ls->L, v, e->u.strval); - return 1; - } - case VCONST: { - setobj(fs->ls->L, v, const2val(fs, e)); - return 1; - } - default: return tonumeral(e, v); - } -} - - - -static Instruction *previousinstruction (FuncState *fs) { - static const Instruction invalidinstruction = ~(Instruction)0; - if (fs->pc > fs->lasttarget) - return &fs->f->code[fs->pc - 1]; - else - return cast(Instruction*, &invalidinstruction); -} - - - -void luaK_nil (FuncState *fs, int from, int n) { - int l = from + n - 1; - Instruction *previous = previousinstruction(fs); - if (GET_OPCODE(*previous) == OP_LOADNIL) { - int pfrom = GETARG_A(*previous); - int pl = pfrom + GETARG_B(*previous); - if ((pfrom <= from && from <= pl + 1) || - (from <= pfrom && pfrom <= l + 1)) { - if (pfrom < from) from = pfrom; - if (pl > l) l = pl; - SETARG_A(*previous, from); - SETARG_B(*previous, l - from); - return; - } - } - luaK_codeABC(fs, OP_LOADNIL, from, n - 1, 0); -} - - - -static int getjump (FuncState *fs, int pc) { - int offset = GETARG_sJ(fs->f->code[pc]); - if (offset == NO_JUMP) - return NO_JUMP; - else - return (pc+1)+offset; -} - - - -static void fixjump (FuncState *fs, int pc, int dest) { - Instruction *jmp = &fs->f->code[pc]; - int offset = dest - (pc + 1); - lua_assert(dest != NO_JUMP); - if (!(-OFFSET_sJ <= offset && offset <= MAXARG_sJ - OFFSET_sJ)) - luaX_syntaxerror(fs->ls, "control structure too long"); - lua_assert(GET_OPCODE(*jmp) == OP_JMP); - SETARG_sJ(*jmp, offset); -} - - - -void luaK_concat (FuncState *fs, int *l1, int l2) { - if (l2 == NO_JUMP) return; - else if (*l1 == NO_JUMP) - *l1 = l2; - else { - int list = *l1; - int next; - while ((next = getjump(fs, list)) != NO_JUMP) - list = next; - fixjump(fs, list, l2); - } -} - - - -int luaK_jump (FuncState *fs) { - return codesJ(fs, OP_JMP, NO_JUMP, 0); -} - - - -void luaK_ret (FuncState *fs, int first, int nret) { - OpCode op; - switch (nret) { - case 0: op = OP_RETURN0; break; - case 1: op = OP_RETURN1; break; - default: op = OP_RETURN; break; - } - luaK_codeABC(fs, op, first, nret + 1, 0); -} - - - -static int condjump (FuncState *fs, OpCode op, int A, int B, int C, int k) { - luaK_codeABCk(fs, op, A, B, C, k); - return luaK_jump(fs); -} - - - -int luaK_getlabel (FuncState *fs) { - fs->lasttarget = fs->pc; - return fs->pc; -} - - - -static Instruction *getjumpcontrol (FuncState *fs, int pc) { - Instruction *pi = &fs->f->code[pc]; - if (pc >= 1 && testTMode(GET_OPCODE(*(pi-1)))) - return pi-1; - else - return pi; -} - - - -static int patchtestreg (FuncState *fs, int node, int reg) { - Instruction *i = getjumpcontrol(fs, node); - if (GET_OPCODE(*i) != OP_TESTSET) - return 0; - if (reg != NO_REG && reg != GETARG_B(*i)) - SETARG_A(*i, reg); - else { - - *i = CREATE_ABCk(OP_TEST, GETARG_B(*i), 0, 0, GETARG_k(*i)); - } - return 1; -} - - - -static void removevalues (FuncState *fs, int list) { - for (; list != NO_JUMP; list = getjump(fs, list)) - patchtestreg(fs, list, NO_REG); -} - - - -static void patchlistaux (FuncState *fs, int list, int vtarget, int reg, - int dtarget) { - while (list != NO_JUMP) { - int next = getjump(fs, list); - if (patchtestreg(fs, list, reg)) - fixjump(fs, list, vtarget); - else - fixjump(fs, list, dtarget); - list = next; - } -} - - - -void luaK_patchlist (FuncState *fs, int list, int target) { - lua_assert(target <= fs->pc); - patchlistaux(fs, list, target, NO_REG, target); -} - - -void luaK_patchtohere (FuncState *fs, int list) { - int hr = luaK_getlabel(fs); - luaK_patchlist(fs, list, hr); -} - - - -#define LIMLINEDIFF 0x80 - - - -static void savelineinfo (FuncState *fs, Proto *f, int line) { - int linedif = line - fs->previousline; - int pc = fs->pc - 1; - if (abs(linedif) >= LIMLINEDIFF || fs->iwthabs++ >= MAXIWTHABS) { - luaM_growvector(fs->ls->L, f->abslineinfo, fs->nabslineinfo, - f->sizeabslineinfo, AbsLineInfo, MAX_INT, "lines"); - f->abslineinfo[fs->nabslineinfo].pc = pc; - f->abslineinfo[fs->nabslineinfo++].line = line; - linedif = ABSLINEINFO; - fs->iwthabs = 1; - } - luaM_growvector(fs->ls->L, f->lineinfo, pc, f->sizelineinfo, ls_byte, - MAX_INT, "opcodes"); - f->lineinfo[pc] = linedif; - fs->previousline = line; -} - - - -static void removelastlineinfo (FuncState *fs) { - Proto *f = fs->f; - int pc = fs->pc - 1; - if (f->lineinfo[pc] != ABSLINEINFO) { - fs->previousline -= f->lineinfo[pc]; - fs->iwthabs--; - } - else { - lua_assert(f->abslineinfo[fs->nabslineinfo - 1].pc == pc); - fs->nabslineinfo--; - fs->iwthabs = MAXIWTHABS + 1; - } -} - - - -static void removelastinstruction (FuncState *fs) { - removelastlineinfo(fs); - fs->pc--; -} - - - -int luaK_code (FuncState *fs, Instruction i) { - Proto *f = fs->f; - - luaM_growvector(fs->ls->L, f->code, fs->pc, f->sizecode, Instruction, - MAX_INT, "opcodes"); - f->code[fs->pc++] = i; - savelineinfo(fs, f, fs->ls->lastline); - return fs->pc - 1; -} - - - -int luaK_codeABCk (FuncState *fs, OpCode o, int a, int b, int c, int k) { - lua_assert(getOpMode(o) == iABC); - lua_assert(a <= MAXARG_A && b <= MAXARG_B && - c <= MAXARG_C && (k & ~1) == 0); - return luaK_code(fs, CREATE_ABCk(o, a, b, c, k)); -} - - - -int luaK_codeABx (FuncState *fs, OpCode o, int a, unsigned int bc) { - lua_assert(getOpMode(o) == iABx); - lua_assert(a <= MAXARG_A && bc <= MAXARG_Bx); - return luaK_code(fs, CREATE_ABx(o, a, bc)); -} - - - -static int codeAsBx (FuncState *fs, OpCode o, int a, int bc) { - unsigned int b = bc + OFFSET_sBx; - lua_assert(getOpMode(o) == iAsBx); - lua_assert(a <= MAXARG_A && b <= MAXARG_Bx); - return luaK_code(fs, CREATE_ABx(o, a, b)); -} - - - -static int codesJ (FuncState *fs, OpCode o, int sj, int k) { - unsigned int j = sj + OFFSET_sJ; - lua_assert(getOpMode(o) == isJ); - lua_assert(j <= MAXARG_sJ && (k & ~1) == 0); - return luaK_code(fs, CREATE_sJ(o, j, k)); -} - - - -static int codeextraarg (FuncState *fs, int a) { - lua_assert(a <= MAXARG_Ax); - return luaK_code(fs, CREATE_Ax(OP_EXTRAARG, a)); -} - - - -static int luaK_codek (FuncState *fs, int reg, int k) { - if (k <= MAXARG_Bx) - return luaK_codeABx(fs, OP_LOADK, reg, k); - else { - int p = luaK_codeABx(fs, OP_LOADKX, reg, 0); - codeextraarg(fs, k); - return p; - } -} - - - -void luaK_checkstack (FuncState *fs, int n) { - int newstack = fs->freereg + n; - if (newstack > fs->f->maxstacksize) { - if (newstack >= MAXREGS) - luaX_syntaxerror(fs->ls, - "function or expression needs too many registers"); - fs->f->maxstacksize = cast_byte(newstack); - } -} - - - -void luaK_reserveregs (FuncState *fs, int n) { - luaK_checkstack(fs, n); - fs->freereg += n; -} - - - -static void freereg (FuncState *fs, int reg) { - if (reg >= luaY_nvarstack(fs)) { - fs->freereg--; - lua_assert(reg == fs->freereg); - } -} - - - -static void freeregs (FuncState *fs, int r1, int r2) { - if (r1 > r2) { - freereg(fs, r1); - freereg(fs, r2); - } - else { - freereg(fs, r2); - freereg(fs, r1); - } -} - - - -static void freeexp (FuncState *fs, expdesc *e) { - if (e->k == VNONRELOC) - freereg(fs, e->u.info); -} - - - -static void freeexps (FuncState *fs, expdesc *e1, expdesc *e2) { - int r1 = (e1->k == VNONRELOC) ? e1->u.info : -1; - int r2 = (e2->k == VNONRELOC) ? e2->u.info : -1; - freeregs(fs, r1, r2); -} - - - -static int addk (FuncState *fs, TValue *key, TValue *v) { - TValue val; - lua_State *L = fs->ls->L; - Proto *f = fs->f; - int tag = luaH_get(fs->ls->h, key, &val); - int k, oldsize; - if (tag == LUA_VNUMINT) { - k = cast_int(ivalue(&val)); - - if (k < fs->nk && ttypetag(&f->k[k]) == ttypetag(v) && - luaV_rawequalobj(&f->k[k], v)) - return k; - } - - oldsize = f->sizek; - k = fs->nk; - - setivalue(&val, k); - luaH_set(L, fs->ls->h, key, &val); - luaM_growvector(L, f->k, k, f->sizek, TValue, MAXARG_Ax, "constants"); - while (oldsize < f->sizek) setnilvalue(&f->k[oldsize++]); - setobj(L, &f->k[k], v); - fs->nk++; - luaC_barrier(L, f, v); - return k; -} - - - -static int stringK (FuncState *fs, TString *s) { - TValue o; - setsvalue(fs->ls->L, &o, s); - return addk(fs, &o, &o); -} - - - -static int luaK_intK (FuncState *fs, lua_Integer n) { - TValue o; - setivalue(&o, n); - return addk(fs, &o, &o); -} - - -static int luaK_numberK (FuncState *fs, lua_Number r) { - TValue o; - lua_Integer ik; - setfltvalue(&o, r); - if (!luaV_flttointeger(r, &ik, F2Ieq)) - return addk(fs, &o, &o); - else { - const int nbm = l_floatatt(MANT_DIG); - const lua_Number q = l_mathop(private_lua_cembed_ldexp)(l_mathop(1.0), -nbm + 1); - const lua_Number k = (ik == 0) ? q : r + r*q; - TValue kv; - setfltvalue(&kv, k); - - lua_assert(!luaV_flttointeger(k, &ik, F2Ieq) || - l_mathop(fabs)(r) >= l_mathop(1e6)); - return addk(fs, &kv, &o); - } -} - - - -static int boolF (FuncState *fs) { - TValue o; - setbfvalue(&o); - return addk(fs, &o, &o); -} - - - -static int boolT (FuncState *fs) { - TValue o; - setbtvalue(&o); - return addk(fs, &o, &o); -} - - - -static int nilK (FuncState *fs) { - TValue k, v; - setnilvalue(&v); - - sethvalue(fs->ls->L, &k, fs->ls->h); - return addk(fs, &k, &v); -} - - - -static int fitsC (lua_Integer i) { - return (l_castS2U(i) + OFFSET_sC <= cast_uint(MAXARG_C)); -} - - - -static int fitsBx (lua_Integer i) { - return (-OFFSET_sBx <= i && i <= MAXARG_Bx - OFFSET_sBx); -} - - -void luaK_int (FuncState *fs, int reg, lua_Integer i) { - if (fitsBx(i)) - codeAsBx(fs, OP_LOADI, reg, cast_int(i)); - else - luaK_codek(fs, reg, luaK_intK(fs, i)); -} - - -static void luaK_float (FuncState *fs, int reg, lua_Number f) { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ieq) && fitsBx(fi)) - codeAsBx(fs, OP_LOADF, reg, cast_int(fi)); - else - luaK_codek(fs, reg, luaK_numberK(fs, f)); -} - - - -static void const2exp (TValue *v, expdesc *e) { - switch (ttypetag(v)) { - case LUA_VNUMINT: - e->k = VKINT; e->u.ival = ivalue(v); - break; - case LUA_VNUMFLT: - e->k = VKFLT; e->u.nval = fltvalue(v); - break; - case LUA_VFALSE: - e->k = VFALSE; - break; - case LUA_VTRUE: - e->k = VTRUE; - break; - case LUA_VNIL: - e->k = VNIL; - break; - case LUA_VSHRSTR: case LUA_VLNGSTR: - e->k = VKSTR; e->u.strval = tsvalue(v); - break; - default: lua_assert(0); - } -} - - - -void luaK_setreturns (FuncState *fs, expdesc *e, int nresults) { - Instruction *pc = &getinstruction(fs, e); - if (e->k == VCALL) - SETARG_C(*pc, nresults + 1); - else { - lua_assert(e->k == VVARARG); - SETARG_C(*pc, nresults + 1); - SETARG_A(*pc, fs->freereg); - luaK_reserveregs(fs, 1); - } -} - - - -static void str2K (FuncState *fs, expdesc *e) { - lua_assert(e->k == VKSTR); - e->u.info = stringK(fs, e->u.strval); - e->k = VK; -} - - - -void luaK_setoneret (FuncState *fs, expdesc *e) { - if (e->k == VCALL) { - - lua_assert(GETARG_C(getinstruction(fs, e)) == 2); - e->k = VNONRELOC; - e->u.info = GETARG_A(getinstruction(fs, e)); - } - else if (e->k == VVARARG) { - SETARG_C(getinstruction(fs, e), 2); - e->k = VRELOC; - } -} - - - -void luaK_dischargevars (FuncState *fs, expdesc *e) { - switch (e->k) { - case VCONST: { - const2exp(const2val(fs, e), e); - break; - } - case VLOCAL: { - e->u.info = e->u.var.ridx; - e->k = VNONRELOC; - break; - } - case VUPVAL: { - e->u.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.info, 0); - e->k = VRELOC; - break; - } - case VINDEXUP: { - e->u.info = luaK_codeABC(fs, OP_GETTABUP, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXI: { - freereg(fs, e->u.ind.t); - e->u.info = luaK_codeABC(fs, OP_GETI, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXSTR: { - freereg(fs, e->u.ind.t); - e->u.info = luaK_codeABC(fs, OP_GETFIELD, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXED: { - freeregs(fs, e->u.ind.t, e->u.ind.idx); - e->u.info = luaK_codeABC(fs, OP_GETTABLE, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VVARARG: case VCALL: { - luaK_setoneret(fs, e); - break; - } - default: break; - } -} - - - -static void discharge2reg (FuncState *fs, expdesc *e, int reg) { - luaK_dischargevars(fs, e); - switch (e->k) { - case VNIL: { - luaK_nil(fs, reg, 1); - break; - } - case VFALSE: { - luaK_codeABC(fs, OP_LOADFALSE, reg, 0, 0); - break; - } - case VTRUE: { - luaK_codeABC(fs, OP_LOADTRUE, reg, 0, 0); - break; - } - case VKSTR: { - str2K(fs, e); - } - case VK: { - luaK_codek(fs, reg, e->u.info); - break; - } - case VKFLT: { - luaK_float(fs, reg, e->u.nval); - break; - } - case VKINT: { - luaK_int(fs, reg, e->u.ival); - break; - } - case VRELOC: { - Instruction *pc = &getinstruction(fs, e); - SETARG_A(*pc, reg); - break; - } - case VNONRELOC: { - if (reg != e->u.info) - luaK_codeABC(fs, OP_MOVE, reg, e->u.info, 0); - break; - } - default: { - lua_assert(e->k == VJMP); - return; - } - } - e->u.info = reg; - e->k = VNONRELOC; -} - - - -static void discharge2anyreg (FuncState *fs, expdesc *e) { - if (e->k != VNONRELOC) { - luaK_reserveregs(fs, 1); - discharge2reg(fs, e, fs->freereg-1); - } -} - - -static int code_loadbool (FuncState *fs, int A, OpCode op) { - luaK_getlabel(fs); - return luaK_codeABC(fs, op, A, 0, 0); -} - - - -static int need_value (FuncState *fs, int list) { - for (; list != NO_JUMP; list = getjump(fs, list)) { - Instruction i = *getjumpcontrol(fs, list); - if (GET_OPCODE(i) != OP_TESTSET) return 1; - } - return 0; -} - - - -static void exp2reg (FuncState *fs, expdesc *e, int reg) { - discharge2reg(fs, e, reg); - if (e->k == VJMP) - luaK_concat(fs, &e->t, e->u.info); - if (hasjumps(e)) { - int final; - int p_f = NO_JUMP; - int p_t = NO_JUMP; - if (need_value(fs, e->t) || need_value(fs, e->f)) { - int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs); - p_f = code_loadbool(fs, reg, OP_LFALSESKIP); - p_t = code_loadbool(fs, reg, OP_LOADTRUE); - - luaK_patchtohere(fs, fj); - } - final = luaK_getlabel(fs); - patchlistaux(fs, e->f, final, reg, p_f); - patchlistaux(fs, e->t, final, reg, p_t); - } - e->f = e->t = NO_JUMP; - e->u.info = reg; - e->k = VNONRELOC; -} - - - -void luaK_exp2nextreg (FuncState *fs, expdesc *e) { - luaK_dischargevars(fs, e); - freeexp(fs, e); - luaK_reserveregs(fs, 1); - exp2reg(fs, e, fs->freereg - 1); -} - - - -int luaK_exp2anyreg (FuncState *fs, expdesc *e) { - luaK_dischargevars(fs, e); - if (e->k == VNONRELOC) { - if (!hasjumps(e)) - return e->u.info; - if (e->u.info >= luaY_nvarstack(fs)) { - exp2reg(fs, e, e->u.info); - return e->u.info; - } - - } - luaK_exp2nextreg(fs, e); - return e->u.info; -} - - - -void luaK_exp2anyregup (FuncState *fs, expdesc *e) { - if (e->k != VUPVAL || hasjumps(e)) - luaK_exp2anyreg(fs, e); -} - - - -void luaK_exp2val (FuncState *fs, expdesc *e) { - if (hasjumps(e)) - luaK_exp2anyreg(fs, e); - else - luaK_dischargevars(fs, e); -} - - - -static int luaK_exp2K (FuncState *fs, expdesc *e) { - if (!hasjumps(e)) { - int info; - switch (e->k) { - case VTRUE: info = boolT(fs); break; - case VFALSE: info = boolF(fs); break; - case VNIL: info = nilK(fs); break; - case VKINT: info = luaK_intK(fs, e->u.ival); break; - case VKFLT: info = luaK_numberK(fs, e->u.nval); break; - case VKSTR: info = stringK(fs, e->u.strval); break; - case VK: info = e->u.info; break; - default: return 0; - } - if (info <= MAXINDEXRK) { - e->k = VK; - e->u.info = info; - return 1; - } - } - - return 0; -} - - - -static int exp2RK (FuncState *fs, expdesc *e) { - if (luaK_exp2K(fs, e)) - return 1; - else { - luaK_exp2anyreg(fs, e); - return 0; - } -} - - -static void codeABRK (FuncState *fs, OpCode o, int a, int b, - expdesc *ec) { - int k = exp2RK(fs, ec); - luaK_codeABCk(fs, o, a, b, ec->u.info, k); -} - - - -void luaK_storevar (FuncState *fs, expdesc *var, expdesc *ex) { - switch (var->k) { - case VLOCAL: { - freeexp(fs, ex); - exp2reg(fs, ex, var->u.var.ridx); - return; - } - case VUPVAL: { - int e = luaK_exp2anyreg(fs, ex); - luaK_codeABC(fs, OP_SETUPVAL, e, var->u.info, 0); - break; - } - case VINDEXUP: { - codeABRK(fs, OP_SETTABUP, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXI: { - codeABRK(fs, OP_SETI, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXSTR: { - codeABRK(fs, OP_SETFIELD, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXED: { - codeABRK(fs, OP_SETTABLE, var->u.ind.t, var->u.ind.idx, ex); - break; - } - default: lua_assert(0); - } - freeexp(fs, ex); -} - - - -void luaK_self (FuncState *fs, expdesc *e, expdesc *key) { - int ereg; - luaK_exp2anyreg(fs, e); - ereg = e->u.info; - freeexp(fs, e); - e->u.info = fs->freereg; - e->k = VNONRELOC; - luaK_reserveregs(fs, 2); - codeABRK(fs, OP_SELF, e->u.info, ereg, key); - freeexp(fs, key); -} - - - -static void negatecondition (FuncState *fs, expdesc *e) { - Instruction *pc = getjumpcontrol(fs, e->u.info); - lua_assert(testTMode(GET_OPCODE(*pc)) && GET_OPCODE(*pc) != OP_TESTSET && - GET_OPCODE(*pc) != OP_TEST); - SETARG_k(*pc, (GETARG_k(*pc) ^ 1)); -} - - - -static int jumponcond (FuncState *fs, expdesc *e, int cond) { - if (e->k == VRELOC) { - Instruction ie = getinstruction(fs, e); - if (GET_OPCODE(ie) == OP_NOT) { - removelastinstruction(fs); - return condjump(fs, OP_TEST, GETARG_B(ie), 0, 0, !cond); - } - - } - discharge2anyreg(fs, e); - freeexp(fs, e); - return condjump(fs, OP_TESTSET, NO_REG, e->u.info, 0, cond); -} - - - -void luaK_goiftrue (FuncState *fs, expdesc *e) { - int pc; - luaK_dischargevars(fs, e); - switch (e->k) { - case VJMP: { - negatecondition(fs, e); - pc = e->u.info; - break; - } - case VK: case VKFLT: case VKINT: case VKSTR: case VTRUE: { - pc = NO_JUMP; - break; - } - default: { - pc = jumponcond(fs, e, 0); - break; - } - } - luaK_concat(fs, &e->f, pc); - luaK_patchtohere(fs, e->t); - e->t = NO_JUMP; -} - - - -void luaK_goiffalse (FuncState *fs, expdesc *e) { - int pc; - luaK_dischargevars(fs, e); - switch (e->k) { - case VJMP: { - pc = e->u.info; - break; - } - case VNIL: case VFALSE: { - pc = NO_JUMP; - break; - } - default: { - pc = jumponcond(fs, e, 1); - break; - } - } - luaK_concat(fs, &e->t, pc); - luaK_patchtohere(fs, e->f); - e->f = NO_JUMP; -} - - - -static void codenot (FuncState *fs, expdesc *e) { - switch (e->k) { - case VNIL: case VFALSE: { - e->k = VTRUE; - break; - } - case VK: case VKFLT: case VKINT: case VKSTR: case VTRUE: { - e->k = VFALSE; - break; - } - case VJMP: { - negatecondition(fs, e); - break; - } - case VRELOC: - case VNONRELOC: { - discharge2anyreg(fs, e); - freeexp(fs, e); - e->u.info = luaK_codeABC(fs, OP_NOT, 0, e->u.info, 0); - e->k = VRELOC; - break; - } - default: lua_assert(0); - } - - { int temp = e->f; e->f = e->t; e->t = temp; } - removevalues(fs, e->f); - removevalues(fs, e->t); -} - - - -static int isKstr (FuncState *fs, expdesc *e) { - return (e->k == VK && !hasjumps(e) && e->u.info <= MAXARG_B && - ttisshrstring(&fs->f->k[e->u.info])); -} - - -static int isKint (expdesc *e) { - return (e->k == VKINT && !hasjumps(e)); -} - - - -static int isCint (expdesc *e) { - return isKint(e) && (l_castS2U(e->u.ival) <= l_castS2U(MAXARG_C)); -} - - - -static int isSCint (expdesc *e) { - return isKint(e) && fitsC(e->u.ival); -} - - - -static int isSCnumber (expdesc *e, int *pi, int *isfloat) { - lua_Integer i; - if (e->k == VKINT) - i = e->u.ival; - else if (e->k == VKFLT && luaV_flttointeger(e->u.nval, &i, F2Ieq)) - *isfloat = 1; - else - return 0; - if (!hasjumps(e) && fitsC(i)) { - *pi = int2sC(cast_int(i)); - return 1; - } - else - return 0; -} - - - -void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) { - if (k->k == VKSTR) - str2K(fs, k); - lua_assert(!hasjumps(t) && - (t->k == VLOCAL || t->k == VNONRELOC || t->k == VUPVAL)); - if (t->k == VUPVAL && !isKstr(fs, k)) - luaK_exp2anyreg(fs, t); - if (t->k == VUPVAL) { - lua_assert(isKstr(fs, k)); - t->u.ind.t = t->u.info; - t->u.ind.idx = k->u.info; - t->k = VINDEXUP; - } - else { - - t->u.ind.t = (t->k == VLOCAL) ? t->u.var.ridx: t->u.info; - if (isKstr(fs, k)) { - t->u.ind.idx = k->u.info; - t->k = VINDEXSTR; - } - else if (isCint(k)) { - t->u.ind.idx = cast_int(k->u.ival); - t->k = VINDEXI; - } - else { - t->u.ind.idx = luaK_exp2anyreg(fs, k); - t->k = VINDEXED; - } - } -} - - - -static int validop (int op, TValue *v1, TValue *v2) { - switch (op) { - case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: - case LUA_OPSHL: case LUA_OPSHR: case LUA_OPBNOT: { - lua_Integer i; - return (luaV_tointegerns(v1, &i, LUA_FLOORN2I) && - luaV_tointegerns(v2, &i, LUA_FLOORN2I)); - } - case LUA_OPDIV: case LUA_OPIDIV: case LUA_OPMOD: - return (nvalue(v2) != 0); - default: return 1; - } -} - - - -static int constfolding (FuncState *fs, int op, expdesc *e1, - const expdesc *e2) { - TValue v1, v2, res; - if (!tonumeral(e1, &v1) || !tonumeral(e2, &v2) || !validop(op, &v1, &v2)) - return 0; - luaO_rawarith(fs->ls->L, op, &v1, &v2, &res); - if (ttisinteger(&res)) { - e1->k = VKINT; - e1->u.ival = ivalue(&res); - } - else { - lua_Number n = fltvalue(&res); - if (luai_numisnan(n) || n == 0) - return 0; - e1->k = VKFLT; - e1->u.nval = n; - } - return 1; -} - - - -l_sinline OpCode binopr2op (BinOpr opr, BinOpr baser, OpCode base) { - lua_assert(baser <= opr && - ((baser == OPR_ADD && opr <= OPR_SHR) || - (baser == OPR_LT && opr <= OPR_LE))); - return cast(OpCode, (cast_int(opr) - cast_int(baser)) + cast_int(base)); -} - - - -l_sinline OpCode unopr2op (UnOpr opr) { - return cast(OpCode, (cast_int(opr) - cast_int(OPR_MINUS)) + - cast_int(OP_UNM)); -} - - - -l_sinline TMS binopr2TM (BinOpr opr) { - lua_assert(OPR_ADD <= opr && opr <= OPR_SHR); - return cast(TMS, (cast_int(opr) - cast_int(OPR_ADD)) + cast_int(TM_ADD)); -} - - - -static void codeunexpval (FuncState *fs, OpCode op, expdesc *e, int line) { - int r = luaK_exp2anyreg(fs, e); - freeexp(fs, e); - e->u.info = luaK_codeABC(fs, op, 0, r, 0); - e->k = VRELOC; - luaK_fixline(fs, line); -} - - - -static void finishbinexpval (FuncState *fs, expdesc *e1, expdesc *e2, - OpCode op, int v2, int flip, int line, - OpCode mmop, TMS event) { - int v1 = luaK_exp2anyreg(fs, e1); - int pc = luaK_codeABCk(fs, op, 0, v1, v2, 0); - freeexps(fs, e1, e2); - e1->u.info = pc; - e1->k = VRELOC; - luaK_fixline(fs, line); - luaK_codeABCk(fs, mmop, v1, v2, event, flip); - luaK_fixline(fs, line); -} - - - -static void codebinexpval (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - OpCode op = binopr2op(opr, OPR_ADD, OP_ADD); - int v2 = luaK_exp2anyreg(fs, e2); - - lua_assert((VNIL <= e1->k && e1->k <= VKSTR) || - e1->k == VNONRELOC || e1->k == VRELOC); - lua_assert(OP_ADD <= op && op <= OP_SHR); - finishbinexpval(fs, e1, e2, op, v2, 0, line, OP_MMBIN, binopr2TM(opr)); -} - - - -static void codebini (FuncState *fs, OpCode op, - expdesc *e1, expdesc *e2, int flip, int line, - TMS event) { - int v2 = int2sC(cast_int(e2->u.ival)); - lua_assert(e2->k == VKINT); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINI, event); -} - - - -static void codebinK (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - TMS event = binopr2TM(opr); - int v2 = e2->u.info; - OpCode op = binopr2op(opr, OPR_ADD, OP_ADDK); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINK, event); -} - - - -static int finishbinexpneg (FuncState *fs, expdesc *e1, expdesc *e2, - OpCode op, int line, TMS event) { - if (!isKint(e2)) - return 0; - else { - lua_Integer i2 = e2->u.ival; - if (!(fitsC(i2) && fitsC(-i2))) - return 0; - else { - int v2 = cast_int(i2); - finishbinexpval(fs, e1, e2, op, int2sC(-v2), 0, line, OP_MMBINI, event); - - SETARG_B(fs->f->code[fs->pc - 1], int2sC(v2)); - return 1; - } - } -} - - -static void swapexps (expdesc *e1, expdesc *e2) { - expdesc temp = *e1; *e1 = *e2; *e2 = temp; -} - - - -static void codebinNoK (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - if (flip) - swapexps(e1, e2); - codebinexpval(fs, opr, e1, e2, line); -} - - - -static void codearith (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - if (tonumeral(e2, NULL) && luaK_exp2K(fs, e2)) - codebinK(fs, opr, e1, e2, flip, line); - else - codebinNoK(fs, opr, e1, e2, flip, line); -} - - - -static void codecommutative (FuncState *fs, BinOpr op, - expdesc *e1, expdesc *e2, int line) { - int flip = 0; - if (tonumeral(e1, NULL)) { - swapexps(e1, e2); - flip = 1; - } - if (op == OPR_ADD && isSCint(e2)) - codebini(fs, OP_ADDI, e1, e2, flip, line, TM_ADD); - else - codearith(fs, op, e1, e2, flip, line); -} - - - -static void codebitwise (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - int flip = 0; - if (e1->k == VKINT) { - swapexps(e1, e2); - flip = 1; - } - if (e2->k == VKINT && luaK_exp2K(fs, e2)) - codebinK(fs, opr, e1, e2, flip, line); - else - codebinNoK(fs, opr, e1, e2, flip, line); -} - - - -static void codeorder (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { - int r1, r2; - int im; - int isfloat = 0; - OpCode op; - if (isSCnumber(e2, &im, &isfloat)) { - - r1 = luaK_exp2anyreg(fs, e1); - r2 = im; - op = binopr2op(opr, OPR_LT, OP_LTI); - } - else if (isSCnumber(e1, &im, &isfloat)) { - - r1 = luaK_exp2anyreg(fs, e2); - r2 = im; - op = binopr2op(opr, OPR_LT, OP_GTI); - } - else { - r1 = luaK_exp2anyreg(fs, e1); - r2 = luaK_exp2anyreg(fs, e2); - op = binopr2op(opr, OPR_LT, OP_LT); - } - freeexps(fs, e1, e2); - e1->u.info = condjump(fs, op, r1, r2, isfloat, 1); - e1->k = VJMP; -} - - - -static void codeeq (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { - int r1, r2; - int im; - int isfloat = 0; - OpCode op; - if (e1->k != VNONRELOC) { - lua_assert(e1->k == VK || e1->k == VKINT || e1->k == VKFLT); - swapexps(e1, e2); - } - r1 = luaK_exp2anyreg(fs, e1); - if (isSCnumber(e2, &im, &isfloat)) { - op = OP_EQI; - r2 = im; - } - else if (exp2RK(fs, e2)) { - op = OP_EQK; - r2 = e2->u.info; - } - else { - op = OP_EQ; - r2 = luaK_exp2anyreg(fs, e2); - } - freeexps(fs, e1, e2); - e1->u.info = condjump(fs, op, r1, r2, isfloat, (opr == OPR_EQ)); - e1->k = VJMP; -} - - - -void luaK_prefix (FuncState *fs, UnOpr opr, expdesc *e, int line) { - static const expdesc ef = {VKINT, {0}, NO_JUMP, NO_JUMP}; - luaK_dischargevars(fs, e); - switch (opr) { - case OPR_MINUS: case OPR_BNOT: - if (constfolding(fs, opr + LUA_OPUNM, e, &ef)) - break; - - case OPR_LEN: - codeunexpval(fs, unopr2op(opr), e, line); - break; - case OPR_NOT: codenot(fs, e); break; - default: lua_assert(0); - } -} - - - -void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) { - luaK_dischargevars(fs, v); - switch (op) { - case OPR_AND: { - luaK_goiftrue(fs, v); - break; - } - case OPR_OR: { - luaK_goiffalse(fs, v); - break; - } - case OPR_CONCAT: { - luaK_exp2nextreg(fs, v); - break; - } - case OPR_ADD: case OPR_SUB: - case OPR_MUL: case OPR_DIV: case OPR_IDIV: - case OPR_MOD: case OPR_POW: - case OPR_BAND: case OPR_BOR: case OPR_BXOR: - case OPR_SHL: case OPR_SHR: { - if (!tonumeral(v, NULL)) - luaK_exp2anyreg(fs, v); - - break; - } - case OPR_EQ: case OPR_NE: { - if (!tonumeral(v, NULL)) - exp2RK(fs, v); - - break; - } - case OPR_LT: case OPR_LE: - case OPR_GT: case OPR_GE: { - int dummy, dummy2; - if (!isSCnumber(v, &dummy, &dummy2)) - luaK_exp2anyreg(fs, v); - - break; - } - default: lua_assert(0); - } -} - - -static void codeconcat (FuncState *fs, expdesc *e1, expdesc *e2, int line) { - Instruction *ie2 = previousinstruction(fs); - if (GET_OPCODE(*ie2) == OP_CONCAT) { - int n = GETARG_B(*ie2); - lua_assert(e1->u.info + 1 == GETARG_A(*ie2)); - freeexp(fs, e2); - SETARG_A(*ie2, e1->u.info); - SETARG_B(*ie2, n + 1); - } - else { - luaK_codeABC(fs, OP_CONCAT, e1->u.info, 2, 0); - freeexp(fs, e2); - luaK_fixline(fs, line); - } -} - - - -void luaK_posfix (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - luaK_dischargevars(fs, e2); - if (foldbinop(opr) && constfolding(fs, opr + LUA_OPADD, e1, e2)) - return; - switch (opr) { - case OPR_AND: { - lua_assert(e1->t == NO_JUMP); - luaK_concat(fs, &e2->f, e1->f); - *e1 = *e2; - break; - } - case OPR_OR: { - lua_assert(e1->f == NO_JUMP); - luaK_concat(fs, &e2->t, e1->t); - *e1 = *e2; - break; - } - case OPR_CONCAT: { - luaK_exp2nextreg(fs, e2); - codeconcat(fs, e1, e2, line); - break; - } - case OPR_ADD: case OPR_MUL: { - codecommutative(fs, opr, e1, e2, line); - break; - } - case OPR_SUB: { - if (finishbinexpneg(fs, e1, e2, OP_ADDI, line, TM_SUB)) - break; - - } - case OPR_DIV: case OPR_IDIV: case OPR_MOD: case OPR_POW: { - codearith(fs, opr, e1, e2, 0, line); - break; - } - case OPR_BAND: case OPR_BOR: case OPR_BXOR: { - codebitwise(fs, opr, e1, e2, line); - break; - } - case OPR_SHL: { - if (isSCint(e1)) { - swapexps(e1, e2); - codebini(fs, OP_SHLI, e1, e2, 1, line, TM_SHL); - } - else if (finishbinexpneg(fs, e1, e2, OP_SHRI, line, TM_SHL)) { - ; - } - else - codebinexpval(fs, opr, e1, e2, line); - break; - } - case OPR_SHR: { - if (isSCint(e2)) - codebini(fs, OP_SHRI, e1, e2, 0, line, TM_SHR); - else - codebinexpval(fs, opr, e1, e2, line); - break; - } - case OPR_EQ: case OPR_NE: { - codeeq(fs, opr, e1, e2); - break; - } - case OPR_GT: case OPR_GE: { - - swapexps(e1, e2); - opr = cast(BinOpr, (opr - OPR_GT) + OPR_LT); - } - case OPR_LT: case OPR_LE: { - codeorder(fs, opr, e1, e2); - break; - } - default: lua_assert(0); - } -} - - - -void luaK_fixline (FuncState *fs, int line) { - removelastlineinfo(fs); - savelineinfo(fs, fs->f, line); -} - - -void luaK_settablesize (FuncState *fs, int pc, int ra, int asize, int hsize) { - Instruction *inst = &fs->f->code[pc]; - int rb = (hsize != 0) ? luaO_ceillog2(hsize) + 1 : 0; - int extra = asize / (MAXARG_C + 1); - int rc = asize % (MAXARG_C + 1); - int k = (extra > 0); - *inst = CREATE_ABCk(OP_NEWTABLE, ra, rb, rc, k); - *(inst + 1) = CREATE_Ax(OP_EXTRAARG, extra); -} - - - -void luaK_setlist (FuncState *fs, int base, int nelems, int tostore) { - lua_assert(tostore != 0 && tostore <= LFIELDS_PER_FLUSH); - if (tostore == LUA_MULTRET) - tostore = 0; - if (nelems <= MAXARG_C) - luaK_codeABC(fs, OP_SETLIST, base, tostore, nelems); - else { - int extra = nelems / (MAXARG_C + 1); - nelems %= (MAXARG_C + 1); - luaK_codeABCk(fs, OP_SETLIST, base, tostore, nelems, 1); - codeextraarg(fs, extra); - } - fs->freereg = base + 1; -} - - - -static int finaltarget (Instruction *code, int i) { - int count; - for (count = 0; count < 100; count++) { - Instruction pc = code[i]; - if (GET_OPCODE(pc) != OP_JMP) - break; - else - i += GETARG_sJ(pc) + 1; - } - return i; -} - - - -void luaK_finish (FuncState *fs) { - int i; - Proto *p = fs->f; - for (i = 0; i < fs->pc; i++) { - Instruction *pc = &p->code[i]; - lua_assert(i == 0 || isOT(*(pc - 1)) == isIT(*pc)); - switch (GET_OPCODE(*pc)) { - case OP_RETURN0: case OP_RETURN1: { - if (!(fs->needclose || (p->flag & PF_ISVARARG))) - break; - - SET_OPCODE(*pc, OP_RETURN); - } - case OP_RETURN: case OP_TAILCALL: { - if (fs->needclose) - SETARG_k(*pc, 1); - if (p->flag & PF_ISVARARG) - SETARG_C(*pc, p->numparams + 1); - break; - } - case OP_JMP: { - int target = finaltarget(p->code, i); - fixjump(fs, i, target); - break; - } - default: break; - } - } -} - - -//path: src/dependencies/lua/lparser.c - - -#define lparser_c -#define LUA_CORE - - - - - -#include -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -#define MAXVARS 200 - - -#define hasmultret(k) ((k) == VCALL || (k) == VVARARG) - - - -#define eqstr(a,b) ((a) == (b)) - - - -typedef struct BlockCnt { - struct BlockCnt *previous; - int firstlabel; - int firstgoto; - lu_byte nactvar; - lu_byte upval; - lu_byte isloop; - lu_byte insidetbc; -} BlockCnt; - - - - -static void statement (LexState *ls); -static void expr (LexState *ls, expdesc *v); - - -static l_noret error_expected (LexState *ls, int token) { - luaX_syntaxerror(ls, - luaO_pushfstring(ls->L, "%s expected", luaX_token2str(ls, token))); -} - - -static l_noret errorlimit (FuncState *fs, int limit, const char *what) { - lua_State *L = fs->ls->L; - const char *msg; - int line = fs->f->linedefined; - const char *where = (line == 0) - ? "main function" - : luaO_pushfstring(L, "function at line %d", line); - msg = luaO_pushfstring(L, "too many %s (limit is %d) in %s", - what, limit, where); - luaX_syntaxerror(fs->ls, msg); -} - - -static void checklimit (FuncState *fs, int v, int l, const char *what) { - if (v > l) errorlimit(fs, l, what); -} - - - -static int testnext (LexState *ls, int c) { - if (ls->t.token == c) { - luaX_next(ls); - return 1; - } - else return 0; -} - - - -static void check (LexState *ls, int c) { - if (ls->t.token != c) - error_expected(ls, c); -} - - - -static void checknext (LexState *ls, int c) { - check(ls, c); - luaX_next(ls); -} - - -#define check_condition(ls,c,msg) { if (!(c)) luaX_syntaxerror(ls, msg); } - - - -static void check_match (LexState *ls, int what, int who, int where) { - if (l_unlikely(!testnext(ls, what))) { - if (where == ls->linenumber) - error_expected(ls, what); - else { - luaX_syntaxerror(ls, luaO_pushfstring(ls->L, - "%s expected (to close %s at line %d)", - luaX_token2str(ls, what), luaX_token2str(ls, who), where)); - } - } -} - - -static TString *str_checkname (LexState *ls) { - TString *ts; - check(ls, TK_NAME); - ts = ls->t.seminfo.ts; - luaX_next(ls); - return ts; -} - - -static void init_exp (expdesc *e, expkind k, int i) { - e->f = e->t = NO_JUMP; - e->k = k; - e->u.info = i; -} - - -static void codestring (expdesc *e, TString *s) { - e->f = e->t = NO_JUMP; - e->k = VKSTR; - e->u.strval = s; -} - - -static void codename (LexState *ls, expdesc *e) { - codestring(e, str_checkname(ls)); -} - - - -static int registerlocalvar (LexState *ls, FuncState *fs, TString *varname) { - Proto *f = fs->f; - int oldsize = f->sizelocvars; - luaM_growvector(ls->L, f->locvars, fs->ndebugvars, f->sizelocvars, - LocVar, SHRT_MAX, "local variables"); - while (oldsize < f->sizelocvars) - f->locvars[oldsize++].varname = NULL; - f->locvars[fs->ndebugvars].varname = varname; - f->locvars[fs->ndebugvars].startpc = fs->pc; - luaC_objbarrier(ls->L, f, varname); - return fs->ndebugvars++; -} - - - -static int new_localvarkind (LexState *ls, TString *name, int kind) { - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Dyndata *dyd = ls->dyd; - Vardesc *var; - checklimit(fs, dyd->actvar.n + 1 - fs->firstlocal, - MAXVARS, "local variables"); - luaM_growvector(L, dyd->actvar.arr, dyd->actvar.n + 1, - dyd->actvar.size, Vardesc, USHRT_MAX, "local variables"); - var = &dyd->actvar.arr[dyd->actvar.n++]; - var->vd.kind = kind; - var->vd.name = name; - return dyd->actvar.n - 1 - fs->firstlocal; -} - - - -static int new_localvar (LexState *ls, TString *name) { - return new_localvarkind(ls, name, VDKREG); -} - -#define new_localvarliteral(ls,v) \ - new_localvar(ls, \ - luaX_newstring(ls, "" v, (sizeof(v)/sizeof(char)) - 1)); - - - - -static Vardesc *getlocalvardesc (FuncState *fs, int vidx) { - return &fs->ls->dyd->actvar.arr[fs->firstlocal + vidx]; -} - - - -static int reglevel (FuncState *fs, int nvar) { - while (nvar-- > 0) { - Vardesc *vd = getlocalvardesc(fs, nvar); - if (vd->vd.kind != RDKCTC) - return vd->vd.ridx + 1; - } - return 0; -} - - - -int luaY_nvarstack (FuncState *fs) { - return reglevel(fs, fs->nactvar); -} - - - -static LocVar *localdebuginfo (FuncState *fs, int vidx) { - Vardesc *vd = getlocalvardesc(fs, vidx); - if (vd->vd.kind == RDKCTC) - return NULL; - else { - int idx = vd->vd.pidx; - lua_assert(idx < fs->ndebugvars); - return &fs->f->locvars[idx]; - } -} - - - -static void init_var (FuncState *fs, expdesc *e, int vidx) { - e->f = e->t = NO_JUMP; - e->k = VLOCAL; - e->u.var.vidx = vidx; - e->u.var.ridx = getlocalvardesc(fs, vidx)->vd.ridx; -} - - - -static void check_readonly (LexState *ls, expdesc *e) { - FuncState *fs = ls->fs; - TString *varname = NULL; - switch (e->k) { - case VCONST: { - varname = ls->dyd->actvar.arr[e->u.info].vd.name; - break; - } - case VLOCAL: { - Vardesc *vardesc = getlocalvardesc(fs, e->u.var.vidx); - if (vardesc->vd.kind != VDKREG) - varname = vardesc->vd.name; - break; - } - case VUPVAL: { - Upvaldesc *up = &fs->f->upvalues[e->u.info]; - if (up->kind != VDKREG) - varname = up->name; - break; - } - default: - return; - } - if (varname) { - const char *msg = luaO_pushfstring(ls->L, - "attempt to assign to const variable '%s'", getstr(varname)); - luaK_semerror(ls, msg); - } -} - - - -static void adjustlocalvars (LexState *ls, int nvars) { - FuncState *fs = ls->fs; - int reglevel = luaY_nvarstack(fs); - int i; - for (i = 0; i < nvars; i++) { - int vidx = fs->nactvar++; - Vardesc *var = getlocalvardesc(fs, vidx); - var->vd.ridx = reglevel++; - var->vd.pidx = registerlocalvar(ls, fs, var->vd.name); - } -} - - - -static void removevars (FuncState *fs, int tolevel) { - fs->ls->dyd->actvar.n -= (fs->nactvar - tolevel); - while (fs->nactvar > tolevel) { - LocVar *var = localdebuginfo(fs, --fs->nactvar); - if (var) - var->endpc = fs->pc; - } -} - - - -static int searchupvalue (FuncState *fs, TString *name) { - int i; - Upvaldesc *up = fs->f->upvalues; - for (i = 0; i < fs->nups; i++) { - if (eqstr(up[i].name, name)) return i; - } - return -1; -} - - -static Upvaldesc *allocupvalue (FuncState *fs) { - Proto *f = fs->f; - int oldsize = f->sizeupvalues; - checklimit(fs, fs->nups + 1, MAXUPVAL, "upvalues"); - luaM_growvector(fs->ls->L, f->upvalues, fs->nups, f->sizeupvalues, - Upvaldesc, MAXUPVAL, "upvalues"); - while (oldsize < f->sizeupvalues) - f->upvalues[oldsize++].name = NULL; - return &f->upvalues[fs->nups++]; -} - - -static int newupvalue (FuncState *fs, TString *name, expdesc *v) { - Upvaldesc *up = allocupvalue(fs); - FuncState *prev = fs->prev; - if (v->k == VLOCAL) { - up->instack = 1; - up->idx = v->u.var.ridx; - up->kind = getlocalvardesc(prev, v->u.var.vidx)->vd.kind; - lua_assert(eqstr(name, getlocalvardesc(prev, v->u.var.vidx)->vd.name)); - } - else { - up->instack = 0; - up->idx = cast_byte(v->u.info); - up->kind = prev->f->upvalues[v->u.info].kind; - lua_assert(eqstr(name, prev->f->upvalues[v->u.info].name)); - } - up->name = name; - luaC_objbarrier(fs->ls->L, fs->f, name); - return fs->nups - 1; -} - - - -static int searchvar (FuncState *fs, TString *n, expdesc *var) { - int i; - for (i = cast_int(fs->nactvar) - 1; i >= 0; i--) { - Vardesc *vd = getlocalvardesc(fs, i); - if (eqstr(n, vd->vd.name)) { - if (vd->vd.kind == RDKCTC) - init_exp(var, VCONST, fs->firstlocal + i); - else - init_var(fs, var, i); - return var->k; - } - } - return -1; -} - - - -static void markupval (FuncState *fs, int level) { - BlockCnt *bl = fs->bl; - while (bl->nactvar > level) - bl = bl->previous; - bl->upval = 1; - fs->needclose = 1; -} - - - -static void marktobeclosed (FuncState *fs) { - BlockCnt *bl = fs->bl; - bl->upval = 1; - bl->insidetbc = 1; - fs->needclose = 1; -} - - - -static void singlevaraux (FuncState *fs, TString *n, expdesc *var, int base) { - if (fs == NULL) - init_exp(var, VVOID, 0); - else { - int v = searchvar(fs, n, var); - if (v >= 0) { - if (v == VLOCAL && !base) - markupval(fs, var->u.var.vidx); - } - else { - int idx = searchupvalue(fs, n); - if (idx < 0) { - singlevaraux(fs->prev, n, var, 0); - if (var->k == VLOCAL || var->k == VUPVAL) - idx = newupvalue(fs, n, var); - else - return; - } - init_exp(var, VUPVAL, idx); - } - } -} - - - -static void singlevar (LexState *ls, expdesc *var) { - TString *varname = str_checkname(ls); - FuncState *fs = ls->fs; - singlevaraux(fs, varname, var, 1); - if (var->k == VVOID) { - expdesc key; - singlevaraux(fs, ls->envn, var, 1); - lua_assert(var->k != VVOID); - luaK_exp2anyregup(fs, var); - codestring(&key, varname); - luaK_indexed(fs, var, &key); - } -} - - - -static void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) { - FuncState *fs = ls->fs; - int needed = nvars - nexps; - if (hasmultret(e->k)) { - int extra = needed + 1; - if (extra < 0) - extra = 0; - luaK_setreturns(fs, e, extra); - } - else { - if (e->k != VVOID) - luaK_exp2nextreg(fs, e); - if (needed > 0) - luaK_nil(fs, fs->freereg, needed); - } - if (needed > 0) - luaK_reserveregs(fs, needed); - else - fs->freereg += needed; -} - - -#define enterlevel(ls) luaE_incCstack(ls->L) - - -#define leavelevel(ls) ((ls)->L->nCcalls--) - - - -static l_noret jumpscopeerror (LexState *ls, Labeldesc *gt) { - TString *tsname = getlocalvardesc(ls->fs, gt->nactvar)->vd.name; - const char *varname = getstr(tsname); - const char *msg = " at line %d jumps into the scope of local '%s'"; - msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line, varname); - luaK_semerror(ls, msg); -} - - - -static void solvegoto (LexState *ls, int g, Labeldesc *label) { - int i; - Labellist *gl = &ls->dyd->gt; - Labeldesc *gt = &gl->arr[g]; - lua_assert(eqstr(gt->name, label->name)); - if (l_unlikely(gt->nactvar < label->nactvar)) - jumpscopeerror(ls, gt); - luaK_patchlist(ls->fs, gt->pc, label->pc); - for (i = g; i < gl->n - 1; i++) - gl->arr[i] = gl->arr[i + 1]; - gl->n--; -} - - - -static Labeldesc *findlabel (LexState *ls, TString *name) { - int i; - Dyndata *dyd = ls->dyd; - - for (i = ls->fs->firstlabel; i < dyd->label.n; i++) { - Labeldesc *lb = &dyd->label.arr[i]; - if (eqstr(lb->name, name)) - return lb; - } - return NULL; -} - - - -static int newlabelentry (LexState *ls, Labellist *l, TString *name, - int line, int pc) { - int n = l->n; - luaM_growvector(ls->L, l->arr, n, l->size, - Labeldesc, SHRT_MAX, "labels/gotos"); - l->arr[n].name = name; - l->arr[n].line = line; - l->arr[n].nactvar = ls->fs->nactvar; - l->arr[n].close = 0; - l->arr[n].pc = pc; - l->n = n + 1; - return n; -} - - -static int newgotoentry (LexState *ls, TString *name, int line, int pc) { - return newlabelentry(ls, &ls->dyd->gt, name, line, pc); -} - - - -static int solvegotos (LexState *ls, Labeldesc *lb) { - Labellist *gl = &ls->dyd->gt; - int i = ls->fs->bl->firstgoto; - int needsclose = 0; - while (i < gl->n) { - if (eqstr(gl->arr[i].name, lb->name)) { - needsclose |= gl->arr[i].close; - solvegoto(ls, i, lb); - } - else - i++; - } - return needsclose; -} - - - -static int createlabel (LexState *ls, TString *name, int line, - int last) { - FuncState *fs = ls->fs; - Labellist *ll = &ls->dyd->label; - int l = newlabelentry(ls, ll, name, line, luaK_getlabel(fs)); - if (last) { - - ll->arr[l].nactvar = fs->bl->nactvar; - } - if (solvegotos(ls, &ll->arr[l])) { - luaK_codeABC(fs, OP_CLOSE, luaY_nvarstack(fs), 0, 0); - return 1; - } - return 0; -} - - - -static void movegotosout (FuncState *fs, BlockCnt *bl) { - int i; - Labellist *gl = &fs->ls->dyd->gt; - - for (i = bl->firstgoto; i < gl->n; i++) { - Labeldesc *gt = &gl->arr[i]; - - if (reglevel(fs, gt->nactvar) > reglevel(fs, bl->nactvar)) - gt->close |= bl->upval; - gt->nactvar = bl->nactvar; - } -} - - -static void enterblock (FuncState *fs, BlockCnt *bl, lu_byte isloop) { - bl->isloop = isloop; - bl->nactvar = fs->nactvar; - bl->firstlabel = fs->ls->dyd->label.n; - bl->firstgoto = fs->ls->dyd->gt.n; - bl->upval = 0; - bl->insidetbc = (fs->bl != NULL && fs->bl->insidetbc); - bl->previous = fs->bl; - fs->bl = bl; - lua_assert(fs->freereg == luaY_nvarstack(fs)); -} - - - -static l_noret undefgoto (LexState *ls, Labeldesc *gt) { - const char *msg; - if (eqstr(gt->name, luaS_newliteral(ls->L, "break"))) { - msg = "break outside loop at line %d"; - msg = luaO_pushfstring(ls->L, msg, gt->line); - } - else { - msg = "no visible label '%s' for at line %d"; - msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line); - } - luaK_semerror(ls, msg); -} - - -static void leaveblock (FuncState *fs) { - BlockCnt *bl = fs->bl; - LexState *ls = fs->ls; - int hasclose = 0; - int stklevel = reglevel(fs, bl->nactvar); - removevars(fs, bl->nactvar); - lua_assert(bl->nactvar == fs->nactvar); - if (bl->isloop) - hasclose = createlabel(ls, luaS_newliteral(ls->L, "break"), 0, 0); - if (!hasclose && bl->previous && bl->upval) - luaK_codeABC(fs, OP_CLOSE, stklevel, 0, 0); - fs->freereg = stklevel; - ls->dyd->label.n = bl->firstlabel; - fs->bl = bl->previous; - if (bl->previous) - movegotosout(fs, bl); - else { - if (bl->firstgoto < ls->dyd->gt.n) - undefgoto(ls, &ls->dyd->gt.arr[bl->firstgoto]); - } -} - - - -static Proto *addprototype (LexState *ls) { - Proto *clp; - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Proto *f = fs->f; - if (fs->np >= f->sizep) { - int oldsize = f->sizep; - luaM_growvector(L, f->p, fs->np, f->sizep, Proto *, MAXARG_Bx, "functions"); - while (oldsize < f->sizep) - f->p[oldsize++] = NULL; - } - f->p[fs->np++] = clp = luaF_newproto(L); - luaC_objbarrier(L, f, clp); - return clp; -} - - - -static void codeclosure (LexState *ls, expdesc *v) { - FuncState *fs = ls->fs->prev; - init_exp(v, VRELOC, luaK_codeABx(fs, OP_CLOSURE, 0, fs->np - 1)); - luaK_exp2nextreg(fs, v); -} - - -static void open_func (LexState *ls, FuncState *fs, BlockCnt *bl) { - Proto *f = fs->f; - fs->prev = ls->fs; - fs->ls = ls; - ls->fs = fs; - fs->pc = 0; - fs->previousline = f->linedefined; - fs->iwthabs = 0; - fs->lasttarget = 0; - fs->freereg = 0; - fs->nk = 0; - fs->nabslineinfo = 0; - fs->np = 0; - fs->nups = 0; - fs->ndebugvars = 0; - fs->nactvar = 0; - fs->needclose = 0; - fs->firstlocal = ls->dyd->actvar.n; - fs->firstlabel = ls->dyd->label.n; - fs->bl = NULL; - f->source = ls->source; - luaC_objbarrier(ls->L, f, f->source); - f->maxstacksize = 2; - enterblock(fs, bl, 0); -} - - -static void close_func (LexState *ls) { - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Proto *f = fs->f; - luaK_ret(fs, luaY_nvarstack(fs), 0); - leaveblock(fs); - lua_assert(fs->bl == NULL); - luaK_finish(fs); - luaM_shrinkvector(L, f->code, f->sizecode, fs->pc, Instruction); - luaM_shrinkvector(L, f->lineinfo, f->sizelineinfo, fs->pc, ls_byte); - luaM_shrinkvector(L, f->abslineinfo, f->sizeabslineinfo, - fs->nabslineinfo, AbsLineInfo); - luaM_shrinkvector(L, f->k, f->sizek, fs->nk, TValue); - luaM_shrinkvector(L, f->p, f->sizep, fs->np, Proto *); - luaM_shrinkvector(L, f->locvars, f->sizelocvars, fs->ndebugvars, LocVar); - luaM_shrinkvector(L, f->upvalues, f->sizeupvalues, fs->nups, Upvaldesc); - ls->fs = fs->prev; - luaC_checkGC(L); -} - - - - - - - - - -static int block_follow (LexState *ls, int withuntil) { - switch (ls->t.token) { - case TK_ELSE: case TK_ELSEIF: - case TK_END: case TK_EOS: - return 1; - case TK_UNTIL: return withuntil; - default: return 0; - } -} - - -static void statlist (LexState *ls) { - - while (!block_follow(ls, 1)) { - if (ls->t.token == TK_RETURN) { - statement(ls); - return; - } - statement(ls); - } -} - - -static void fieldsel (LexState *ls, expdesc *v) { - - FuncState *fs = ls->fs; - expdesc key; - luaK_exp2anyregup(fs, v); - luaX_next(ls); - codename(ls, &key); - luaK_indexed(fs, v, &key); -} - - -static void yindex (LexState *ls, expdesc *v) { - - luaX_next(ls); - expr(ls, v); - luaK_exp2val(ls->fs, v); - checknext(ls, ']'); -} - - - - - -typedef struct ConsControl { - expdesc v; - expdesc *t; - int nh; - int na; - int tostore; -} ConsControl; - - -static void recfield (LexState *ls, ConsControl *cc) { - - FuncState *fs = ls->fs; - int reg = ls->fs->freereg; - expdesc tab, key, val; - if (ls->t.token == TK_NAME) { - checklimit(fs, cc->nh, MAX_INT, "items in a constructor"); - codename(ls, &key); - } - else - yindex(ls, &key); - cc->nh++; - checknext(ls, '='); - tab = *cc->t; - luaK_indexed(fs, &tab, &key); - expr(ls, &val); - luaK_storevar(fs, &tab, &val); - fs->freereg = reg; -} - - -static void closelistfield (FuncState *fs, ConsControl *cc) { - if (cc->v.k == VVOID) return; - luaK_exp2nextreg(fs, &cc->v); - cc->v.k = VVOID; - if (cc->tostore == LFIELDS_PER_FLUSH) { - luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); - cc->na += cc->tostore; - cc->tostore = 0; - } -} - - -static void lastlistfield (FuncState *fs, ConsControl *cc) { - if (cc->tostore == 0) return; - if (hasmultret(cc->v.k)) { - luaK_setmultret(fs, &cc->v); - luaK_setlist(fs, cc->t->u.info, cc->na, LUA_MULTRET); - cc->na--; - } - else { - if (cc->v.k != VVOID) - luaK_exp2nextreg(fs, &cc->v); - luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); - } - cc->na += cc->tostore; -} - - -static void listfield (LexState *ls, ConsControl *cc) { - - expr(ls, &cc->v); - cc->tostore++; -} - - -static void field (LexState *ls, ConsControl *cc) { - - switch(ls->t.token) { - case TK_NAME: { - if (luaX_lookahead(ls) != '=') - listfield(ls, cc); - else - recfield(ls, cc); - break; - } - case '[': { - recfield(ls, cc); - break; - } - default: { - listfield(ls, cc); - break; - } - } -} - - -static void constructor (LexState *ls, expdesc *t) { - - FuncState *fs = ls->fs; - int line = ls->linenumber; - int pc = luaK_codeABC(fs, OP_NEWTABLE, 0, 0, 0); - ConsControl cc; - luaK_code(fs, 0); - cc.na = cc.nh = cc.tostore = 0; - cc.t = t; - init_exp(t, VNONRELOC, fs->freereg); - luaK_reserveregs(fs, 1); - init_exp(&cc.v, VVOID, 0); - checknext(ls, '{'); - do { - lua_assert(cc.v.k == VVOID || cc.tostore > 0); - if (ls->t.token == '}') break; - closelistfield(fs, &cc); - field(ls, &cc); - } while (testnext(ls, ',') || testnext(ls, ';')); - check_match(ls, '}', '{', line); - lastlistfield(fs, &cc); - luaK_settablesize(fs, pc, t->u.info, cc.na, cc.nh); -} - - - - -static void setvararg (FuncState *fs, int nparams) { - fs->f->flag |= PF_ISVARARG; - luaK_codeABC(fs, OP_VARARGPREP, nparams, 0, 0); -} - - -static void parlist (LexState *ls) { - - FuncState *fs = ls->fs; - Proto *f = fs->f; - int nparams = 0; - int isvararg = 0; - if (ls->t.token != ')') { - do { - switch (ls->t.token) { - case TK_NAME: { - new_localvar(ls, str_checkname(ls)); - nparams++; - break; - } - case TK_DOTS: { - luaX_next(ls); - isvararg = 1; - break; - } - default: luaX_syntaxerror(ls, " or '...' expected"); - } - } while (!isvararg && testnext(ls, ',')); - } - adjustlocalvars(ls, nparams); - f->numparams = cast_byte(fs->nactvar); - if (isvararg) - setvararg(fs, f->numparams); - luaK_reserveregs(fs, fs->nactvar); -} - - -static void body (LexState *ls, expdesc *e, int ismethod, int line) { - - FuncState new_fs; - BlockCnt bl; - new_fs.f = addprototype(ls); - new_fs.f->linedefined = line; - open_func(ls, &new_fs, &bl); - checknext(ls, '('); - if (ismethod) { - new_localvarliteral(ls, "self"); - adjustlocalvars(ls, 1); - } - parlist(ls); - checknext(ls, ')'); - statlist(ls); - new_fs.f->lastlinedefined = ls->linenumber; - check_match(ls, TK_END, TK_FUNCTION, line); - codeclosure(ls, e); - close_func(ls); -} - - -static int explist (LexState *ls, expdesc *v) { - - int n = 1; - expr(ls, v); - while (testnext(ls, ',')) { - luaK_exp2nextreg(ls->fs, v); - expr(ls, v); - n++; - } - return n; -} - - -static void funcargs (LexState *ls, expdesc *f) { - FuncState *fs = ls->fs; - expdesc args; - int base, nparams; - int line = ls->linenumber; - switch (ls->t.token) { - case '(': { - luaX_next(ls); - if (ls->t.token == ')') - args.k = VVOID; - else { - explist(ls, &args); - if (hasmultret(args.k)) - luaK_setmultret(fs, &args); - } - check_match(ls, ')', '(', line); - break; - } - case '{': { - constructor(ls, &args); - break; - } - case TK_STRING: { - codestring(&args, ls->t.seminfo.ts); - luaX_next(ls); - break; - } - default: { - luaX_syntaxerror(ls, "function arguments expected"); - } - } - lua_assert(f->k == VNONRELOC); - base = f->u.info; - if (hasmultret(args.k)) - nparams = LUA_MULTRET; - else { - if (args.k != VVOID) - luaK_exp2nextreg(fs, &args); - nparams = fs->freereg - (base+1); - } - init_exp(f, VCALL, luaK_codeABC(fs, OP_CALL, base, nparams+1, 2)); - luaK_fixline(fs, line); - fs->freereg = base+1; -} - - - - - - - -static void primaryexp (LexState *ls, expdesc *v) { - - switch (ls->t.token) { - case '(': { - int line = ls->linenumber; - luaX_next(ls); - expr(ls, v); - check_match(ls, ')', '(', line); - luaK_dischargevars(ls->fs, v); - return; - } - case TK_NAME: { - singlevar(ls, v); - return; - } - default: { - luaX_syntaxerror(ls, "unexpected symbol"); - } - } -} - - -static void suffixedexp (LexState *ls, expdesc *v) { - - FuncState *fs = ls->fs; - primaryexp(ls, v); - for (;;) { - switch (ls->t.token) { - case '.': { - fieldsel(ls, v); - break; - } - case '[': { - expdesc key; - luaK_exp2anyregup(fs, v); - yindex(ls, &key); - luaK_indexed(fs, v, &key); - break; - } - case ':': { - expdesc key; - luaX_next(ls); - codename(ls, &key); - luaK_self(fs, v, &key); - funcargs(ls, v); - break; - } - case '(': case TK_STRING: case '{': { - luaK_exp2nextreg(fs, v); - funcargs(ls, v); - break; - } - default: return; - } - } -} - - -static void simpleexp (LexState *ls, expdesc *v) { - - switch (ls->t.token) { - case TK_FLT: { - init_exp(v, VKFLT, 0); - v->u.nval = ls->t.seminfo.r; - break; - } - case TK_INT: { - init_exp(v, VKINT, 0); - v->u.ival = ls->t.seminfo.i; - break; - } - case TK_STRING: { - codestring(v, ls->t.seminfo.ts); - break; - } - case TK_NIL: { - init_exp(v, VNIL, 0); - break; - } - case TK_TRUE: { - init_exp(v, VTRUE, 0); - break; - } - case TK_FALSE: { - init_exp(v, VFALSE, 0); - break; - } - case TK_DOTS: { - FuncState *fs = ls->fs; - check_condition(ls, fs->f->flag & PF_ISVARARG, - "cannot use '...' outside a vararg function"); - init_exp(v, VVARARG, luaK_codeABC(fs, OP_VARARG, 0, 0, 1)); - break; - } - case '{': { - constructor(ls, v); - return; - } - case TK_FUNCTION: { - luaX_next(ls); - body(ls, v, 0, ls->linenumber); - return; - } - default: { - suffixedexp(ls, v); - return; - } - } - luaX_next(ls); -} - - -static UnOpr getunopr (int op) { - switch (op) { - case TK_NOT: return OPR_NOT; - case '-': return OPR_MINUS; - case '~': return OPR_BNOT; - case '#': return OPR_LEN; - default: return OPR_NOUNOPR; - } -} - - -static BinOpr getbinopr (int op) { - switch (op) { - case '+': return OPR_ADD; - case '-': return OPR_SUB; - case '*': return OPR_MUL; - case '%': return OPR_MOD; - case '^': return OPR_POW; - case '/': return OPR_DIV; - case TK_IDIV: return OPR_IDIV; - case '&': return OPR_BAND; - case '|': return OPR_BOR; - case '~': return OPR_BXOR; - case TK_SHL: return OPR_SHL; - case TK_SHR: return OPR_SHR; - case TK_CONCAT: return OPR_CONCAT; - case TK_NE: return OPR_NE; - case TK_EQ: return OPR_EQ; - case '<': return OPR_LT; - case TK_LE: return OPR_LE; - case '>': return OPR_GT; - case TK_GE: return OPR_GE; - case TK_AND: return OPR_AND; - case TK_OR: return OPR_OR; - default: return OPR_NOBINOPR; - } -} - - - -static const struct { - lu_byte left; - lu_byte right; -} priority[] = { - {10, 10}, {10, 10}, - {11, 11}, {11, 11}, - {14, 13}, - {11, 11}, {11, 11}, - {6, 6}, {4, 4}, {5, 5}, - {7, 7}, {7, 7}, - {9, 8}, - {3, 3}, {3, 3}, {3, 3}, - {3, 3}, {3, 3}, {3, 3}, - {2, 2}, {1, 1} -}; - -#define UNARY_PRIORITY 12 - - - -static BinOpr subexpr (LexState *ls, expdesc *v, int limit) { - BinOpr op; - UnOpr uop; - enterlevel(ls); - uop = getunopr(ls->t.token); - if (uop != OPR_NOUNOPR) { - int line = ls->linenumber; - luaX_next(ls); - subexpr(ls, v, UNARY_PRIORITY); - luaK_prefix(ls->fs, uop, v, line); - } - else simpleexp(ls, v); - - op = getbinopr(ls->t.token); - while (op != OPR_NOBINOPR && priority[op].left > limit) { - expdesc v2; - BinOpr nextop; - int line = ls->linenumber; - luaX_next(ls); - luaK_infix(ls->fs, op, v); - - nextop = subexpr(ls, &v2, priority[op].right); - luaK_posfix(ls->fs, op, v, &v2, line); - op = nextop; - } - leavelevel(ls); - return op; -} - - -static void expr (LexState *ls, expdesc *v) { - subexpr(ls, v, 0); -} - - - - - - - - -static void block (LexState *ls) { - - FuncState *fs = ls->fs; - BlockCnt bl; - enterblock(fs, &bl, 0); - statlist(ls); - leaveblock(fs); -} - - - -struct LHS_assign { - struct LHS_assign *prev; - expdesc v; -}; - - - -static void check_conflict (LexState *ls, struct LHS_assign *lh, expdesc *v) { - FuncState *fs = ls->fs; - int extra = fs->freereg; - int conflict = 0; - for (; lh; lh = lh->prev) { - if (vkisindexed(lh->v.k)) { - if (lh->v.k == VINDEXUP) { - if (v->k == VUPVAL && lh->v.u.ind.t == v->u.info) { - conflict = 1; - lh->v.k = VINDEXSTR; - lh->v.u.ind.t = extra; - } - } - else { - if (v->k == VLOCAL && lh->v.u.ind.t == v->u.var.ridx) { - conflict = 1; - lh->v.u.ind.t = extra; - } - - if (lh->v.k == VINDEXED && v->k == VLOCAL && - lh->v.u.ind.idx == v->u.var.ridx) { - conflict = 1; - lh->v.u.ind.idx = extra; - } - } - } - } - if (conflict) { - - if (v->k == VLOCAL) - luaK_codeABC(fs, OP_MOVE, extra, v->u.var.ridx, 0); - else - luaK_codeABC(fs, OP_GETUPVAL, extra, v->u.info, 0); - luaK_reserveregs(fs, 1); - } -} - - -static void restassign (LexState *ls, struct LHS_assign *lh, int nvars) { - expdesc e; - check_condition(ls, vkisvar(lh->v.k), "syntax private_lua_error"); - check_readonly(ls, &lh->v); - if (testnext(ls, ',')) { - struct LHS_assign nv; - nv.prev = lh; - suffixedexp(ls, &nv.v); - if (!vkisindexed(nv.v.k)) - check_conflict(ls, lh, &nv.v); - enterlevel(ls); - restassign(ls, &nv, nvars+1); - leavelevel(ls); - } - else { - int nexps; - checknext(ls, '='); - nexps = explist(ls, &e); - if (nexps != nvars) - adjust_assign(ls, nvars, nexps, &e); - else { - luaK_setoneret(ls->fs, &e); - luaK_storevar(ls->fs, &lh->v, &e); - return; - } - } - init_exp(&e, VNONRELOC, ls->fs->freereg-1); - luaK_storevar(ls->fs, &lh->v, &e); -} - - -static int cond (LexState *ls) { - - expdesc v; - expr(ls, &v); - if (v.k == VNIL) v.k = VFALSE; - luaK_goiftrue(ls->fs, &v); - return v.f; -} - - -static void gotostat (LexState *ls) { - FuncState *fs = ls->fs; - int line = ls->linenumber; - TString *name = str_checkname(ls); - Labeldesc *lb = findlabel(ls, name); - if (lb == NULL) - - newgotoentry(ls, name, line, luaK_jump(fs)); - else { - - int lblevel = reglevel(fs, lb->nactvar); - if (luaY_nvarstack(fs) > lblevel) - luaK_codeABC(fs, OP_CLOSE, lblevel, 0, 0); - - luaK_patchlist(fs, luaK_jump(fs), lb->pc); - } -} - - - -static void breakstat (LexState *ls) { - int line = ls->linenumber; - luaX_next(ls); - newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, luaK_jump(ls->fs)); -} - - - -static void checkrepeated (LexState *ls, TString *name) { - Labeldesc *lb = findlabel(ls, name); - if (l_unlikely(lb != NULL)) { - const char *msg = "label '%s' already defined on line %d"; - msg = luaO_pushfstring(ls->L, msg, getstr(name), lb->line); - luaK_semerror(ls, msg); - } -} - - -static void labelstat (LexState *ls, TString *name, int line) { - - checknext(ls, TK_DBCOLON); - while (ls->t.token == ';' || ls->t.token == TK_DBCOLON) - statement(ls); - checkrepeated(ls, name); - createlabel(ls, name, line, block_follow(ls, 0)); -} - - -static void whilestat (LexState *ls, int line) { - - FuncState *fs = ls->fs; - int whileinit; - int condexit; - BlockCnt bl; - luaX_next(ls); - whileinit = luaK_getlabel(fs); - condexit = cond(ls); - enterblock(fs, &bl, 1); - checknext(ls, TK_DO); - block(ls); - luaK_jumpto(fs, whileinit); - check_match(ls, TK_END, TK_WHILE, line); - leaveblock(fs); - luaK_patchtohere(fs, condexit); -} - - -static void repeatstat (LexState *ls, int line) { - - int condexit; - FuncState *fs = ls->fs; - int repeat_init = luaK_getlabel(fs); - BlockCnt bl1, bl2; - enterblock(fs, &bl1, 1); - enterblock(fs, &bl2, 0); - luaX_next(ls); - statlist(ls); - check_match(ls, TK_UNTIL, TK_REPEAT, line); - condexit = cond(ls); - leaveblock(fs); - if (bl2.upval) { - int exit = luaK_jump(fs); - luaK_patchtohere(fs, condexit); - luaK_codeABC(fs, OP_CLOSE, reglevel(fs, bl2.nactvar), 0, 0); - condexit = luaK_jump(fs); - luaK_patchtohere(fs, exit); - } - luaK_patchlist(fs, condexit, repeat_init); - leaveblock(fs); -} - - - -static void exp1 (LexState *ls) { - expdesc e; - expr(ls, &e); - luaK_exp2nextreg(ls->fs, &e); - lua_assert(e.k == VNONRELOC); -} - - - -static void fixforjump (FuncState *fs, int pc, int dest, int back) { - Instruction *jmp = &fs->f->code[pc]; - int offset = dest - (pc + 1); - if (back) - offset = -offset; - if (l_unlikely(offset > MAXARG_Bx)) - luaX_syntaxerror(fs->ls, "control structure too long"); - SETARG_Bx(*jmp, offset); -} - - - -static void forbody (LexState *ls, int base, int line, int nvars, int isgen) { - - static const OpCode forprep[2] = {OP_FORPREP, OP_TFORPREP}; - static const OpCode forloop[2] = {OP_FORLOOP, OP_TFORLOOP}; - BlockCnt bl; - FuncState *fs = ls->fs; - int prep, endfor; - checknext(ls, TK_DO); - prep = luaK_codeABx(fs, forprep[isgen], base, 0); - fs->freereg--; - enterblock(fs, &bl, 0); - adjustlocalvars(ls, nvars); - luaK_reserveregs(fs, nvars); - block(ls); - leaveblock(fs); - fixforjump(fs, prep, luaK_getlabel(fs), 0); - if (isgen) { - luaK_codeABC(fs, OP_TFORCALL, base, 0, nvars); - luaK_fixline(fs, line); - } - endfor = luaK_codeABx(fs, forloop[isgen], base, 0); - fixforjump(fs, endfor, prep + 1, 1); - luaK_fixline(fs, line); -} - - -static void fornum (LexState *ls, TString *varname, int line) { - - FuncState *fs = ls->fs; - int base = fs->freereg; - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvarkind(ls, varname, RDKCONST); - checknext(ls, '='); - exp1(ls); - checknext(ls, ','); - exp1(ls); - if (testnext(ls, ',')) - exp1(ls); - else { - luaK_int(fs, fs->freereg, 1); - luaK_reserveregs(fs, 1); - } - adjustlocalvars(ls, 2); - forbody(ls, base, line, 1, 0); -} - - -static void forlist (LexState *ls, TString *indexname) { - - FuncState *fs = ls->fs; - expdesc e; - int nvars = 4; - int line; - int base = fs->freereg; - - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvarkind(ls, indexname, RDKCONST); - - while (testnext(ls, ',')) { - new_localvar(ls, str_checkname(ls)); - nvars++; - } - checknext(ls, TK_IN); - line = ls->linenumber; - adjust_assign(ls, 4, explist(ls, &e), &e); - adjustlocalvars(ls, 3); - marktobeclosed(fs); - luaK_checkstack(fs, 2); - forbody(ls, base, line, nvars - 3, 1); -} - - -static void forstat (LexState *ls, int line) { - - FuncState *fs = ls->fs; - TString *varname; - BlockCnt bl; - enterblock(fs, &bl, 1); - luaX_next(ls); - varname = str_checkname(ls); - switch (ls->t.token) { - case '=': fornum(ls, varname, line); break; - case ',': case TK_IN: forlist(ls, varname); break; - default: luaX_syntaxerror(ls, "'=' or 'in' expected"); - } - check_match(ls, TK_END, TK_FOR, line); - leaveblock(fs); -} - - -static void test_then_block (LexState *ls, int *escapelist) { - - BlockCnt bl; - FuncState *fs = ls->fs; - expdesc v; - int jf; - luaX_next(ls); - expr(ls, &v); - checknext(ls, TK_THEN); - if (ls->t.token == TK_BREAK) { - int line = ls->linenumber; - luaK_goiffalse(ls->fs, &v); - luaX_next(ls); - enterblock(fs, &bl, 0); - newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, v.t); - while (testnext(ls, ';')) {} - if (block_follow(ls, 0)) { - leaveblock(fs); - return; - } - else - jf = luaK_jump(fs); - } - else { - luaK_goiftrue(ls->fs, &v); - enterblock(fs, &bl, 0); - jf = v.f; - } - statlist(ls); - leaveblock(fs); - if (ls->t.token == TK_ELSE || - ls->t.token == TK_ELSEIF) - luaK_concat(fs, escapelist, luaK_jump(fs)); - luaK_patchtohere(fs, jf); -} - - -static void ifstat (LexState *ls, int line) { - - FuncState *fs = ls->fs; - int escapelist = NO_JUMP; - test_then_block(ls, &escapelist); - while (ls->t.token == TK_ELSEIF) - test_then_block(ls, &escapelist); - if (testnext(ls, TK_ELSE)) - block(ls); - check_match(ls, TK_END, TK_IF, line); - luaK_patchtohere(fs, escapelist); -} - - -static void localfunc (LexState *ls) { - expdesc b; - FuncState *fs = ls->fs; - int fvar = fs->nactvar; - new_localvar(ls, str_checkname(ls)); - adjustlocalvars(ls, 1); - body(ls, &b, 0, ls->linenumber); - - localdebuginfo(fs, fvar)->startpc = fs->pc; -} - - -static int getlocalattribute (LexState *ls) { - - if (testnext(ls, '<')) { - TString *ts = str_checkname(ls); - const char *attr = getstr(ts); - checknext(ls, '>'); - if (strcmp(attr, "const") == 0) - return RDKCONST; - else if (strcmp(attr, "close") == 0) - return RDKTOCLOSE; - else - luaK_semerror(ls, - luaO_pushfstring(ls->L, "unknown attribute '%s'", attr)); - } - return VDKREG; -} - - -static void checktoclose (FuncState *fs, int level) { - if (level != -1) { - marktobeclosed(fs); - luaK_codeABC(fs, OP_TBC, reglevel(fs, level), 0, 0); - } -} - - -static void localstat (LexState *ls) { - - FuncState *fs = ls->fs; - int toclose = -1; - Vardesc *var; - int vidx; - int nvars = 0; - int nexps; - expdesc e; - do { - TString *vname = str_checkname(ls); - int kind = getlocalattribute(ls); - vidx = new_localvarkind(ls, vname, kind); - if (kind == RDKTOCLOSE) { - if (toclose != -1) - luaK_semerror(ls, "multiple to-be-closed variables in local list"); - toclose = fs->nactvar + nvars; - } - nvars++; - } while (testnext(ls, ',')); - if (testnext(ls, '=')) - nexps = explist(ls, &e); - else { - e.k = VVOID; - nexps = 0; - } - var = getlocalvardesc(fs, vidx); - if (nvars == nexps && - var->vd.kind == RDKCONST && - luaK_exp2const(fs, &e, &var->k)) { - var->vd.kind = RDKCTC; - adjustlocalvars(ls, nvars - 1); - fs->nactvar++; - } - else { - adjust_assign(ls, nvars, nexps, &e); - adjustlocalvars(ls, nvars); - } - checktoclose(fs, toclose); -} - - -static int funcname (LexState *ls, expdesc *v) { - - int ismethod = 0; - singlevar(ls, v); - while (ls->t.token == '.') - fieldsel(ls, v); - if (ls->t.token == ':') { - ismethod = 1; - fieldsel(ls, v); - } - return ismethod; -} - - -static void funcstat (LexState *ls, int line) { - - int ismethod; - expdesc v, b; - luaX_next(ls); - ismethod = funcname(ls, &v); - body(ls, &b, ismethod, line); - check_readonly(ls, &v); - luaK_storevar(ls->fs, &v, &b); - luaK_fixline(ls->fs, line); -} - - -static void exprstat (LexState *ls) { - - FuncState *fs = ls->fs; - struct LHS_assign v; - suffixedexp(ls, &v.v); - if (ls->t.token == '=' || ls->t.token == ',') { - v.prev = NULL; - restassign(ls, &v, 1); - } - else { - Instruction *inst; - check_condition(ls, v.v.k == VCALL, "syntax private_lua_error"); - inst = &getinstruction(fs, &v.v); - SETARG_C(*inst, 1); - } -} - - -static void retstat (LexState *ls) { - - FuncState *fs = ls->fs; - expdesc e; - int nret; - int first = luaY_nvarstack(fs); - if (block_follow(ls, 1) || ls->t.token == ';') - nret = 0; - else { - nret = explist(ls, &e); - if (hasmultret(e.k)) { - luaK_setmultret(fs, &e); - if (e.k == VCALL && nret == 1 && !fs->bl->insidetbc) { - SET_OPCODE(getinstruction(fs,&e), OP_TAILCALL); - lua_assert(GETARG_A(getinstruction(fs,&e)) == luaY_nvarstack(fs)); - } - nret = LUA_MULTRET; - } - else { - if (nret == 1) - first = luaK_exp2anyreg(fs, &e); - else { - luaK_exp2nextreg(fs, &e); - lua_assert(nret == fs->freereg - first); - } - } - } - luaK_ret(fs, first, nret); - testnext(ls, ';'); -} - - -static void statement (LexState *ls) { - int line = ls->linenumber; - enterlevel(ls); - switch (ls->t.token) { - case ';': { - luaX_next(ls); - break; - } - case TK_IF: { - ifstat(ls, line); - break; - } - case TK_WHILE: { - whilestat(ls, line); - break; - } - case TK_DO: { - luaX_next(ls); - block(ls); - check_match(ls, TK_END, TK_DO, line); - break; - } - case TK_FOR: { - forstat(ls, line); - break; - } - case TK_REPEAT: { - repeatstat(ls, line); - break; - } - case TK_FUNCTION: { - funcstat(ls, line); - break; - } - case TK_LOCAL: { - luaX_next(ls); - if (testnext(ls, TK_FUNCTION)) - localfunc(ls); - else - localstat(ls); - break; - } - case TK_DBCOLON: { - luaX_next(ls); - labelstat(ls, str_checkname(ls), line); - break; - } - case TK_RETURN: { - luaX_next(ls); - retstat(ls); - break; - } - case TK_BREAK: { - breakstat(ls); - break; - } - case TK_GOTO: { - luaX_next(ls); - gotostat(ls); - break; - } - default: { - exprstat(ls); - break; - } - } - lua_assert(ls->fs->f->maxstacksize >= ls->fs->freereg && - ls->fs->freereg >= luaY_nvarstack(ls->fs)); - ls->fs->freereg = luaY_nvarstack(ls->fs); - leavelevel(ls); -} - - - - - -static void mainfunc (LexState *ls, FuncState *fs) { - BlockCnt bl; - Upvaldesc *env; - open_func(ls, fs, &bl); - setvararg(fs, 0); - env = allocupvalue(fs); - env->instack = 1; - env->idx = 0; - env->kind = VDKREG; - env->name = ls->envn; - luaC_objbarrier(ls->L, fs->f, env->name); - luaX_next(ls); - statlist(ls); - check(ls, TK_EOS); - close_func(ls); -} - - -LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, - Dyndata *dyd, const char *name, int firstchar) { - LexState lexstate; - FuncState funcstate; - LClosure *cl = luaF_newLclosure(L, 1); - setclLvalue2s(L, L->top.p, cl); - luaD_inctop(L); - lexstate.h = luaH_new(L); - sethvalue2s(L, L->top.p, lexstate.h); - luaD_inctop(L); - funcstate.f = cl->p = luaF_newproto(L); - luaC_objbarrier(L, cl, cl->p); - funcstate.f->source = luaS_new(L, name); - luaC_objbarrier(L, funcstate.f, funcstate.f->source); - lexstate.buff = buff; - lexstate.dyd = dyd; - dyd->actvar.n = dyd->gt.n = dyd->label.n = 0; - luaX_setinput(L, &lexstate, z, funcstate.f->source, firstchar); - mainfunc(&lexstate, &funcstate); - lua_assert(!funcstate.prev && funcstate.nups == 1 && !lexstate.fs); - - lua_assert(dyd->actvar.n == 0 && dyd->gt.n == 0 && dyd->label.n == 0); - L->top.p--; - return cl; -} - - - -//path: src/dependencies/lua/ldebug.c - - -#define ldebug_c -#define LUA_CORE - - - - - -#include -#include -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -#define noLuaClosure(f) ((f) == NULL || (f)->c.tt == LUA_VCCL) - - -static const char *funcnamefromcall (lua_State *L, CallInfo *ci, - const char **name); - - -static int currentpc (CallInfo *ci) { - lua_assert(isLua(ci)); - return pcRel(ci->u.l.savedpc, ci_func(ci)->p); -} - - - -static int getbaseline (const Proto *f, int pc, int *basepc) { - if (f->sizeabslineinfo == 0 || pc < f->abslineinfo[0].pc) { - *basepc = -1; - return f->linedefined; - } - else { - int i = cast_uint(pc) / MAXIWTHABS - 1; - - lua_assert(i < 0 || - (i < f->sizeabslineinfo && f->abslineinfo[i].pc <= pc)); - while (i + 1 < f->sizeabslineinfo && pc >= f->abslineinfo[i + 1].pc) - i++; - *basepc = f->abslineinfo[i].pc; - return f->abslineinfo[i].line; - } -} - - - -int luaG_getfuncline (const Proto *f, int pc) { - if (f->lineinfo == NULL) - return -1; - else { - int basepc; - int baseline = getbaseline(f, pc, &basepc); - while (basepc++ < pc) { - lua_assert(f->lineinfo[basepc] != ABSLINEINFO); - baseline += f->lineinfo[basepc]; - } - return baseline; - } -} - - -static int getcurrentline (CallInfo *ci) { - return luaG_getfuncline(ci_func(ci)->p, currentpc(ci)); -} - - - -static void settraps (CallInfo *ci) { - for (; ci != NULL; ci = ci->previous) - if (isLua(ci)) - ci->u.l.trap = 1; -} - - - -LUA_API void lua_sethook (lua_State *L, lua_Hook func, int mask, int count) { - if (func == NULL || mask == 0) { - mask = 0; - func = NULL; - } - L->hook = func; - L->basehookcount = count; - resethookcount(L); - L->hookmask = cast_byte(mask); - if (mask) - settraps(L->ci); -} - - -LUA_API lua_Hook lua_gethook (lua_State *L) { - return L->hook; -} - - -LUA_API int lua_gethookmask (lua_State *L) { - return L->hookmask; -} - - -LUA_API int lua_gethookcount (lua_State *L) { - return L->basehookcount; -} - - -LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar) { - int status; - CallInfo *ci; - if (level < 0) return 0; - lua_lock(L); - for (ci = L->ci; level > 0 && ci != &L->base_ci; ci = ci->previous) - level--; - if (level == 0 && ci != &L->base_ci) { - status = 1; - ar->i_ci = ci; - } - else status = 0; - lua_unlock(L); - return status; -} - - -static const char *upvalname (const Proto *p, int uv) { - TString *s = check_exp(uv < p->sizeupvalues, p->upvalues[uv].name); - if (s == NULL) return "?"; - else return getstr(s); -} - - -static const char *findvararg (CallInfo *ci, int n, StkId *pos) { - if (clLvalue(s2v(ci->func.p))->p->flag & PF_ISVARARG) { - int nextra = ci->u.l.nextraargs; - if (n >= -nextra) { - *pos = ci->func.p - nextra - (n + 1); - return "(vararg)"; - } - } - return NULL; -} - - -const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, StkId *pos) { - StkId base = ci->func.p + 1; - const char *name = NULL; - if (isLua(ci)) { - if (n < 0) - return findvararg(ci, n, pos); - else - name = luaF_getlocalname(ci_func(ci)->p, n, currentpc(ci)); - } - if (name == NULL) { - StkId limit = (ci == L->ci) ? L->top.p : ci->next->func.p; - if (limit - base >= n && n > 0) { - - name = isLua(ci) ? "(temporary)" : "(C temporary)"; - } - else - return NULL; - } - if (pos) - *pos = base + (n - 1); - return name; -} - - -LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) { - const char *name; - lua_lock(L); - if (ar == NULL) { - if (!isLfunction(s2v(L->top.p - 1))) - name = NULL; - else - name = luaF_getlocalname(clLvalue(s2v(L->top.p - 1))->p, n, 0); - } - else { - StkId pos = NULL; - name = luaG_findlocal(L, ar->i_ci, n, &pos); - if (name) { - setobjs2s(L, L->top.p, pos); - api_incr_top(L); - } - } - lua_unlock(L); - return name; -} - - -LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) { - StkId pos = NULL; - const char *name; - lua_lock(L); - name = luaG_findlocal(L, ar->i_ci, n, &pos); - if (name) { - api_checkpop(L, 1); - setobjs2s(L, pos, L->top.p - 1); - L->top.p--; - } - lua_unlock(L); - return name; -} - - -static void funcinfo (lua_Debug *ar, Closure *cl) { - if (noLuaClosure(cl)) { - ar->source = "=[C]"; - ar->srclen = LL("=[C]"); - ar->linedefined = -1; - ar->lastlinedefined = -1; - ar->what = "C"; - } - else { - const Proto *p = cl->l.p; - if (p->source) { - ar->source = getlstr(p->source, ar->srclen); - } - else { - ar->source = "=?"; - ar->srclen = LL("=?"); - } - ar->linedefined = p->linedefined; - ar->lastlinedefined = p->lastlinedefined; - ar->what = (ar->linedefined == 0) ? "main" : "Lua"; - } - luaO_chunkid(ar->short_src, ar->source, ar->srclen); -} - - -static int nextline (const Proto *p, int currentline, int pc) { - if (p->lineinfo[pc] != ABSLINEINFO) - return currentline + p->lineinfo[pc]; - else - return luaG_getfuncline(p, pc); -} - - -static void collectvalidlines (lua_State *L, Closure *f) { - if (noLuaClosure(f)) { - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - } - else { - int i; - TValue v; - const Proto *p = f->l.p; - int currentline = p->linedefined; - Table *t = luaH_new(L); - sethvalue2s(L, L->top.p, t); - api_incr_top(L); - setbtvalue(&v); - if (!(p->flag & PF_ISVARARG)) - i = 0; - else { - lua_assert(GET_OPCODE(p->code[0]) == OP_VARARGPREP); - currentline = nextline(p, currentline, 0); - i = 1; - } - for (; i < p->sizelineinfo; i++) { - currentline = nextline(p, currentline, i); - luaH_setint(L, t, currentline, &v); - } - } -} - - -static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name) { - - if (ci != NULL && !(ci->callstatus & CIST_TAIL)) - return funcnamefromcall(L, ci->previous, name); - else return NULL; -} - - -static int auxgetinfo (lua_State *L, const char *what, lua_Debug *ar, - Closure *f, CallInfo *ci) { - int status = 1; - for (; *what; what++) { - switch (*what) { - case 'S': { - funcinfo(ar, f); - break; - } - case 'l': { - ar->currentline = (ci && isLua(ci)) ? getcurrentline(ci) : -1; - break; - } - case 'u': { - ar->nups = (f == NULL) ? 0 : f->c.nupvalues; - if (noLuaClosure(f)) { - ar->isvararg = 1; - ar->nparams = 0; - } - else { - ar->isvararg = f->l.p->flag & PF_ISVARARG; - ar->nparams = f->l.p->numparams; - } - break; - } - case 't': { - ar->istailcall = (ci) ? ci->callstatus & CIST_TAIL : 0; - break; - } - case 'n': { - ar->namewhat = getfuncname(L, ci, &ar->name); - if (ar->namewhat == NULL) { - ar->namewhat = ""; - ar->name = NULL; - } - break; - } - case 'r': { - if (ci == NULL || !(ci->callstatus & CIST_TRAN)) - ar->ftransfer = ar->ntransfer = 0; - else { - ar->ftransfer = ci->u2.transferinfo.ftransfer; - ar->ntransfer = ci->u2.transferinfo.ntransfer; - } - break; - } - case 'L': - case 'f': - break; - default: status = 0; - } - } - return status; -} - - -LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) { - int status; - Closure *cl; - CallInfo *ci; - TValue *func; - lua_lock(L); - if (*what == '>') { - ci = NULL; - func = s2v(L->top.p - 1); - api_check(L, ttisfunction(func), "function expected"); - what++; - L->top.p--; - } - else { - ci = ar->i_ci; - func = s2v(ci->func.p); - lua_assert(ttisfunction(func)); - } - cl = ttisclosure(func) ? clvalue(func) : NULL; - status = auxgetinfo(L, what, ar, cl, ci); - if (strchr(what, 'f')) { - setobj2s(L, L->top.p, func); - api_incr_top(L); - } - if (strchr(what, 'L')) - collectvalidlines(L, cl); - lua_unlock(L); - return status; -} - - - - - -static int filterpc (int pc, int jmptarget) { - if (pc < jmptarget) - return -1; - else return pc; -} - - - -static int findsetreg (const Proto *p, int lastpc, int reg) { - int pc; - int setreg = -1; - int jmptarget = 0; - if (testMMMode(GET_OPCODE(p->code[lastpc]))) - lastpc--; - for (pc = 0; pc < lastpc; pc++) { - Instruction i = p->code[pc]; - OpCode op = GET_OPCODE(i); - int a = GETARG_A(i); - int change; - switch (op) { - case OP_LOADNIL: { - int b = GETARG_B(i); - change = (a <= reg && reg <= a + b); - break; - } - case OP_TFORCALL: { - change = (reg >= a + 2); - break; - } - case OP_CALL: - case OP_TAILCALL: { - change = (reg >= a); - break; - } - case OP_JMP: { - int b = GETARG_sJ(i); - int dest = pc + 1 + b; - - if (dest <= lastpc && dest > jmptarget) - jmptarget = dest; - change = 0; - break; - } - default: - change = (testAMode(op) && reg == a); - break; - } - if (change) - setreg = filterpc(pc, jmptarget); - } - return setreg; -} - - - -static const char *kname (const Proto *p, int index, const char **name) { - TValue *kvalue = &p->k[index]; - if (ttisstring(kvalue)) { - *name = getstr(tsvalue(kvalue)); - return "constant"; - } - else { - *name = "?"; - return NULL; - } -} - - -static const char *basicgetobjname (const Proto *p, int *ppc, int reg, - const char **name) { - int pc = *ppc; - *name = luaF_getlocalname(p, reg + 1, pc); - if (*name) - return "local"; - - *ppc = pc = findsetreg(p, pc, reg); - if (pc != -1) { - Instruction i = p->code[pc]; - OpCode op = GET_OPCODE(i); - switch (op) { - case OP_MOVE: { - int b = GETARG_B(i); - if (b < GETARG_A(i)) - return basicgetobjname(p, ppc, b, name); - break; - } - case OP_GETUPVAL: { - *name = upvalname(p, GETARG_B(i)); - return "upvalue"; - } - case OP_LOADK: return kname(p, GETARG_Bx(i), name); - case OP_LOADKX: return kname(p, GETARG_Ax(p->code[pc + 1]), name); - default: break; - } - } - return NULL; -} - - - -static void rname (const Proto *p, int pc, int c, const char **name) { - const char *what = basicgetobjname(p, &pc, c, name); - if (!(what && *what == 'c')) - *name = "?"; -} - - - -static void rkname (const Proto *p, int pc, Instruction i, const char **name) { - int c = GETARG_C(i); - if (GETARG_k(i)) - kname(p, c, name); - else - rname(p, pc, c, name); -} - - - -static const char *isEnv (const Proto *p, int pc, Instruction i, int isup) { - int t = GETARG_B(i); - const char *name; - if (isup) - name = upvalname(p, t); - else - basicgetobjname(p, &pc, t, &name); - return (name && strcmp(name, LUA_ENV) == 0) ? "global" : "field"; -} - - - -static const char *getobjname (const Proto *p, int lastpc, int reg, - const char **name) { - const char *kind = basicgetobjname(p, &lastpc, reg, name); - if (kind != NULL) - return kind; - else if (lastpc != -1) { - Instruction i = p->code[lastpc]; - OpCode op = GET_OPCODE(i); - switch (op) { - case OP_GETTABUP: { - int k = GETARG_C(i); - kname(p, k, name); - return isEnv(p, lastpc, i, 1); - } - case OP_GETTABLE: { - int k = GETARG_C(i); - rname(p, lastpc, k, name); - return isEnv(p, lastpc, i, 0); - } - case OP_GETI: { - *name = "integer index"; - return "field"; - } - case OP_GETFIELD: { - int k = GETARG_C(i); - kname(p, k, name); - return isEnv(p, lastpc, i, 0); - } - case OP_SELF: { - rkname(p, lastpc, i, name); - return "method"; - } - default: break; - } - } - return NULL; -} - - - -static const char *funcnamefromcode (lua_State *L, const Proto *p, - int pc, const char **name) { - TMS tm = (TMS)0; - Instruction i = p->code[pc]; - switch (GET_OPCODE(i)) { - case OP_CALL: - case OP_TAILCALL: - return getobjname(p, pc, GETARG_A(i), name); - case OP_TFORCALL: { - *name = "for iterator"; - return "for iterator"; - } - - case OP_SELF: case OP_GETTABUP: case OP_GETTABLE: - case OP_GETI: case OP_GETFIELD: - tm = TM_INDEX; - break; - case OP_SETTABUP: case OP_SETTABLE: case OP_SETI: case OP_SETFIELD: - tm = TM_NEWINDEX; - break; - case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { - tm = cast(TMS, GETARG_C(i)); - break; - } - case OP_UNM: tm = TM_UNM; break; - case OP_BNOT: tm = TM_BNOT; break; - case OP_LEN: tm = TM_LEN; break; - case OP_CONCAT: tm = TM_CONCAT; break; - case OP_EQ: tm = TM_EQ; break; - - case OP_LT: case OP_LTI: case OP_GTI: tm = TM_LT; break; - case OP_LE: case OP_LEI: case OP_GEI: tm = TM_LE; break; - case OP_CLOSE: case OP_RETURN: tm = TM_CLOSE; break; - default: - return NULL; - } - *name = getshrstr(G(L)->tmname[tm]) + 2; - return "metamethod"; -} - - - -static const char *funcnamefromcall (lua_State *L, CallInfo *ci, - const char **name) { - if (ci->callstatus & CIST_HOOKED) { - *name = "?"; - return "hook"; - } - else if (ci->callstatus & CIST_FIN) { - *name = "__gc"; - return "metamethod"; - } - else if (isLua(ci)) - return funcnamefromcode(L, ci_func(ci)->p, currentpc(ci), name); - else - return NULL; -} - - - - - - -static int instack (CallInfo *ci, const TValue *o) { - int pos; - StkId base = ci->func.p + 1; - for (pos = 0; base + pos < ci->top.p; pos++) { - if (o == s2v(base + pos)) - return pos; - } - return -1; -} - - - -static const char *getupvalname (CallInfo *ci, const TValue *o, - const char **name) { - LClosure *c = ci_func(ci); - int i; - for (i = 0; i < c->nupvalues; i++) { - if (c->upvals[i]->v.p == o) { - *name = upvalname(c->p, i); - return "upvalue"; - } - } - return NULL; -} - - -static const char *formatvarinfo (lua_State *L, const char *kind, - const char *name) { - if (kind == NULL) - return ""; - else - return luaO_pushfstring(L, " (%s '%s')", kind, name); -} - - -static const char *varinfo (lua_State *L, const TValue *o) { - CallInfo *ci = L->ci; - const char *name = NULL; - const char *kind = NULL; - if (isLua(ci)) { - kind = getupvalname(ci, o, &name); - if (!kind) { - int reg = instack(ci, o); - if (reg >= 0) - kind = getobjname(ci_func(ci)->p, currentpc(ci), reg, &name); - } - } - return formatvarinfo(L, kind, name); -} - - - -static l_noret typeerror (lua_State *L, const TValue *o, const char *op, - const char *extra) { - const char *t = luaT_objtypename(L, o); - luaG_runerror(L, "attempt to %s a %s value%s", op, t, extra); -} - - - -l_noret luaG_typeerror (lua_State *L, const TValue *o, const char *op) { - typeerror(L, o, op, varinfo(L, o)); -} - - - -l_noret luaG_callerror (lua_State *L, const TValue *o) { - CallInfo *ci = L->ci; - const char *name = NULL; - const char *kind = funcnamefromcall(L, ci, &name); - const char *extra = kind ? formatvarinfo(L, kind, name) : varinfo(L, o); - typeerror(L, o, "call", extra); -} - - -l_noret luaG_forerror (lua_State *L, const TValue *o, const char *what) { - luaG_runerror(L, "bad 'for' %s (number expected, got %s)", - what, luaT_objtypename(L, o)); -} - - -l_noret luaG_concaterror (lua_State *L, const TValue *p1, const TValue *p2) { - if (ttisstring(p1) || cvt2str(p1)) p1 = p2; - luaG_typeerror(L, p1, "concatenate"); -} - - -l_noret luaG_opinterror (lua_State *L, const TValue *p1, - const TValue *p2, const char *msg) { - if (!ttisnumber(p1)) - p2 = p1; - luaG_typeerror(L, p2, msg); -} - - - -l_noret luaG_tointerror (lua_State *L, const TValue *p1, const TValue *p2) { - lua_Integer temp; - if (!luaV_tointegerns(p1, &temp, LUA_FLOORN2I)) - p2 = p1; - luaG_runerror(L, "number%s has no integer representation", varinfo(L, p2)); -} - - -l_noret luaG_ordererror (lua_State *L, const TValue *p1, const TValue *p2) { - const char *t1 = luaT_objtypename(L, p1); - const char *t2 = luaT_objtypename(L, p2); - if (strcmp(t1, t2) == 0) - luaG_runerror(L, "attempt to compare two %s values", t1); - else - luaG_runerror(L, "attempt to compare %s with %s", t1, t2); -} - - - -const char *luaG_addinfo (lua_State *L, const char *msg, TString *src, - int line) { - char buff[LUA_IDSIZE]; - if (src) { - size_t idlen; - const char *id = getlstr(src, idlen); - luaO_chunkid(buff, id, idlen); - } - else { - buff[0] = '?'; buff[1] = '\0'; - } - return luaO_pushfstring(L, "%s:%d: %s", buff, line, msg); -} - - -l_noret luaG_errormsg (lua_State *L) { - if (L->errfunc != 0) { - StkId errfunc = restorestack(L, L->errfunc); - lua_assert(ttisfunction(s2v(errfunc))); - setobjs2s(L, L->top.p, L->top.p - 1); - setobjs2s(L, L->top.p - 1, errfunc); - L->top.p++; - luaD_callnoyield(L, L->top.p - 2, 1); - } - luaD_throw(L, LUA_ERRRUN); -} - - -l_noret luaG_runerror (lua_State *L, const char *fmt, ...) { - CallInfo *ci = L->ci; - const char *msg; - va_list argp; - luaC_checkGC(L); - va_start(argp, fmt); - msg = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - if (isLua(ci)) { - luaG_addinfo(L, msg, ci_func(ci)->p->source, getcurrentline(ci)); - setobjs2s(L, L->top.p - 2, L->top.p - 1); - L->top.p--; - } - luaG_errormsg(L); -} - - - -static int changedline (const Proto *p, int oldpc, int newpc) { - if (p->lineinfo == NULL) - return 0; - if (newpc - oldpc < MAXIWTHABS / 2) { - int delta = 0; - int pc = oldpc; - for (;;) { - int lineinfo = p->lineinfo[++pc]; - if (lineinfo == ABSLINEINFO) - break; - delta += lineinfo; - if (pc == newpc) - return (delta != 0); - } - } - - return (luaG_getfuncline(p, oldpc) != luaG_getfuncline(p, newpc)); -} - - - -int luaG_tracecall (lua_State *L) { - CallInfo *ci = L->ci; - Proto *p = ci_func(ci)->p; - ci->u.l.trap = 1; - if (ci->u.l.savedpc == p->code) { - if (p->flag & PF_ISVARARG) - return 0; - else if (!(ci->callstatus & CIST_HOOKYIELD)) - luaD_hookcall(L, ci); - } - return 1; -} - - - -int luaG_traceexec (lua_State *L, const Instruction *pc) { - CallInfo *ci = L->ci; - lu_byte mask = L->hookmask; - const Proto *p = ci_func(ci)->p; - int counthook; - if (!(mask & (LUA_MASKLINE | LUA_MASKCOUNT))) { - ci->u.l.trap = 0; - return 0; - } - pc++; - ci->u.l.savedpc = pc; - counthook = (mask & LUA_MASKCOUNT) && (--L->hookcount == 0); - if (counthook) - resethookcount(L); - else if (!(mask & LUA_MASKLINE)) - return 1; - if (ci->callstatus & CIST_HOOKYIELD) { - ci->callstatus &= ~CIST_HOOKYIELD; - return 1; - } - if (!isIT(*(ci->u.l.savedpc - 1))) - L->top.p = ci->top.p; - if (counthook) - luaD_hook(L, LUA_HOOKCOUNT, -1, 0, 0); - if (mask & LUA_MASKLINE) { - - int oldpc = (L->oldpc < p->sizecode) ? L->oldpc : 0; - int npci = pcRel(pc, p); - if (npci <= oldpc || - changedline(p, oldpc, npci)) { - int newline = luaG_getfuncline(p, npci); - luaD_hook(L, LUA_HOOKLINE, newline, 0, 0); - } - L->oldpc = npci; - } - if (L->status == LUA_YIELD) { - if (counthook) - L->hookcount = 1; - ci->callstatus |= CIST_HOOKYIELD; - luaD_throw(L, LUA_YIELD); - } - return 1; -} - - - -//path: src/dependencies/lua/lfunc.c - - -#define lfunc_c -#define LUA_CORE - - - - - -#include - - - - - - - - - - - - - - - - - - - - - -CClosure *luaF_newCclosure (lua_State *L, int nupvals) { - GCObject *o = luaC_newobj(L, LUA_VCCL, sizeCclosure(nupvals)); - CClosure *c = gco2ccl(o); - c->nupvalues = cast_byte(nupvals); - return c; -} - - -LClosure *luaF_newLclosure (lua_State *L, int nupvals) { - GCObject *o = luaC_newobj(L, LUA_VLCL, sizeLclosure(nupvals)); - LClosure *c = gco2lcl(o); - c->p = NULL; - c->nupvalues = cast_byte(nupvals); - while (nupvals--) c->upvals[nupvals] = NULL; - return c; -} - - - -void luaF_initupvals (lua_State *L, LClosure *cl) { - int i; - for (i = 0; i < cl->nupvalues; i++) { - GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); - UpVal *uv = gco2upv(o); - uv->v.p = &uv->u.value; - setnilvalue(uv->v.p); - cl->upvals[i] = uv; - luaC_objbarrier(L, cl, uv); - } -} - - - -static UpVal *newupval (lua_State *L, StkId level, UpVal **prev) { - GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); - UpVal *uv = gco2upv(o); - UpVal *next = *prev; - uv->v.p = s2v(level); - uv->u.open.next = next; - uv->u.open.previous = prev; - if (next) - next->u.open.previous = &uv->u.open.next; - *prev = uv; - if (!isintwups(L)) { - L->twups = G(L)->twups; - G(L)->twups = L; - } - return uv; -} - - - -UpVal *luaF_findupval (lua_State *L, StkId level) { - UpVal **pp = &L->openupval; - UpVal *p; - lua_assert(isintwups(L) || L->openupval == NULL); - while ((p = *pp) != NULL && uplevel(p) >= level) { - lua_assert(!isdead(G(L), p)); - if (uplevel(p) == level) - return p; - pp = &p->u.open.next; - } - - return newupval(L, level, pp); -} - - - -static void callclosemethod (lua_State *L, TValue *obj, TValue *err, int yy) { - StkId top = L->top.p; - const TValue *tm = luaT_gettmbyobj(L, obj, TM_CLOSE); - setobj2s(L, top, tm); - setobj2s(L, top + 1, obj); - setobj2s(L, top + 2, err); - L->top.p = top + 3; - if (yy) - luaD_call(L, top, 0); - else - luaD_callnoyield(L, top, 0); -} - - - -static void checkclosemth (lua_State *L, StkId level) { - const TValue *tm = luaT_gettmbyobj(L, s2v(level), TM_CLOSE); - if (ttisnil(tm)) { - int idx = cast_int(level - L->ci->func.p); - const char *vname = luaG_findlocal(L, L->ci, idx, NULL); - if (vname == NULL) vname = "?"; - luaG_runerror(L, "variable '%s' got a non-closable value", vname); - } -} - - - -static void prepcallclosemth (lua_State *L, StkId level, int status, int yy) { - TValue *uv = s2v(level); - TValue *errobj; - if (status == CLOSEKTOP) - errobj = &G(L)->nilvalue; - else { - errobj = s2v(level + 1); - luaD_seterrorobj(L, status, level + 1); - } - callclosemethod(L, uv, errobj, yy); -} - - - -#define MAXDELTA \ - ((256ul << ((sizeof(L->stack.p->tbclist.delta) - 1) * 8)) - 1) - - - -void luaF_newtbcupval (lua_State *L, StkId level) { - lua_assert(level > L->tbclist.p); - if (l_isfalse(s2v(level))) - return; - checkclosemth(L, level); - while (cast_uint(level - L->tbclist.p) > MAXDELTA) { - L->tbclist.p += MAXDELTA; - L->tbclist.p->tbclist.delta = 0; - } - level->tbclist.delta = cast(unsigned short, level - L->tbclist.p); - L->tbclist.p = level; -} - - -void luaF_unlinkupval (UpVal *uv) { - lua_assert(upisopen(uv)); - *uv->u.open.previous = uv->u.open.next; - if (uv->u.open.next) - uv->u.open.next->u.open.previous = uv->u.open.previous; -} - - - -void luaF_closeupval (lua_State *L, StkId level) { - UpVal *uv; - StkId upl; - while ((uv = L->openupval) != NULL && (upl = uplevel(uv)) >= level) { - TValue *slot = &uv->u.value; - lua_assert(uplevel(uv) < L->top.p); - luaF_unlinkupval(uv); - setobj(L, slot, uv->v.p); - uv->v.p = slot; - if (!iswhite(uv)) { - nw2black(uv); - luaC_barrier(L, uv, slot); - } - } -} - - - -static void poptbclist (lua_State *L) { - StkId tbc = L->tbclist.p; - lua_assert(tbc->tbclist.delta > 0); - tbc -= tbc->tbclist.delta; - while (tbc > L->stack.p && tbc->tbclist.delta == 0) - tbc -= MAXDELTA; - L->tbclist.p = tbc; -} - - - -StkId luaF_close (lua_State *L, StkId level, int status, int yy) { - ptrdiff_t levelrel = savestack(L, level); - luaF_closeupval(L, level); - while (L->tbclist.p >= level) { - StkId tbc = L->tbclist.p; - poptbclist(L); - prepcallclosemth(L, tbc, status, yy); - level = restorestack(L, levelrel); - } - return level; -} - - -Proto *luaF_newproto (lua_State *L) { - GCObject *o = luaC_newobj(L, LUA_VPROTO, sizeof(Proto)); - Proto *f = gco2p(o); - f->k = NULL; - f->sizek = 0; - f->p = NULL; - f->sizep = 0; - f->code = NULL; - f->sizecode = 0; - f->lineinfo = NULL; - f->sizelineinfo = 0; - f->abslineinfo = NULL; - f->sizeabslineinfo = 0; - f->upvalues = NULL; - f->sizeupvalues = 0; - f->numparams = 0; - f->flag = 0; - f->maxstacksize = 0; - f->locvars = NULL; - f->sizelocvars = 0; - f->linedefined = 0; - f->lastlinedefined = 0; - f->source = NULL; - return f; -} - - -void luaF_freeproto (lua_State *L, Proto *f) { - if (!(f->flag & PF_FIXED)) { - luaM_freearray(L, f->code, f->sizecode); - luaM_freearray(L, f->lineinfo, f->sizelineinfo); - luaM_freearray(L, f->abslineinfo, f->sizeabslineinfo); - } - luaM_freearray(L, f->p, f->sizep); - luaM_freearray(L, f->k, f->sizek); - luaM_freearray(L, f->locvars, f->sizelocvars); - luaM_freearray(L, f->upvalues, f->sizeupvalues); - luaM_free(L, f); -} - - - -const char *luaF_getlocalname (const Proto *f, int local_number, int pc) { - int i; - for (i = 0; isizelocvars && f->locvars[i].startpc <= pc; i++) { - if (pc < f->locvars[i].endpc) { - local_number--; - if (local_number == 0) - return getstr(f->locvars[i].varname); - } - } - return NULL; -} - - - -//path: src/dependencies/lua/lobject.c - - -#define lobject_c -#define LUA_CORE - - - - - -#include -#include -#include -#include -#include - - - - - - - - - - - - - - - - - - - - - - - -int luaO_ceillog2 (unsigned int x) { - static const lu_byte log_2[256] = { - 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, - 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, - 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, - 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8 - }; - int l = 0; - x--; - while (x >= 256) { l += 8; x >>= 8; } - return l + log_2[x]; -} - - -unsigned int luaO_codeparam (unsigned int p) { - if (p >= (cast(lu_mem, 0x1F) << (0xF - 7 - 1)) * 100u) - return 0xFF; - else { - p = (cast(l_uint32, p) * 128 + 99) / 100; - if (p < 0x10) - return p; - else { - int log = luaO_ceillog2(p + 1) - 5; - return ((p >> log) - 0x10) | ((log + 1) << 4); - } - } -} - - - -l_obj luaO_applyparam (unsigned int p, l_obj x) { - unsigned int m = p & 0xF; - int e = (p >> 4); - if (e > 0) { - e--; - m += 0x10; - } - e -= 7; - if (e >= 0) { - if (x < (MAX_LOBJ / 0x1F) >> e) - return (x * m) << e; - else - return MAX_LOBJ; - } - else { - e = -e; - if (x < MAX_LOBJ / 0x1F) - return (x * m) >> e; - else if ((x >> e) < MAX_LOBJ / 0x1F) - return (x >> e) * m; - else - return MAX_LOBJ; - } -} - - -static lua_Integer intarith (lua_State *L, int op, lua_Integer v1, - lua_Integer v2) { - switch (op) { - case LUA_OPADD: return intop(+, v1, v2); - case LUA_OPSUB:return intop(-, v1, v2); - case LUA_OPMUL:return intop(*, v1, v2); - case LUA_OPMOD: return luaV_mod(L, v1, v2); - case LUA_OPIDIV: return luaV_idiv(L, v1, v2); - case LUA_OPBAND: return intop(&, v1, v2); - case LUA_OPBOR: return intop(|, v1, v2); - case LUA_OPBXOR: return intop(^, v1, v2); - case LUA_OPSHL: return luaV_shiftl(v1, v2); - case LUA_OPSHR: return luaV_shiftr(v1, v2); - case LUA_OPUNM: return intop(-, 0, v1); - case LUA_OPBNOT: return intop(^, ~l_castS2U(0), v1); - default: lua_assert(0); return 0; - } -} - - -static lua_Number numarith (lua_State *L, int op, lua_Number v1, - lua_Number v2) { - switch (op) { - case LUA_OPADD: return luai_numadd(L, v1, v2); - case LUA_OPSUB: return luai_numsub(L, v1, v2); - case LUA_OPMUL: return luai_nummul(L, v1, v2); - case LUA_OPDIV: return luai_numdiv(L, v1, v2); - case LUA_OPPOW: return luai_numpow(L, v1, v2); - case LUA_OPIDIV: return luai_numidiv(L, v1, v2); - case LUA_OPUNM: return luai_numunm(L, v1); - case LUA_OPMOD: return luaV_modf(L, v1, v2); - default: lua_assert(0); return 0; - } -} - - -int luaO_rawarith (lua_State *L, int op, const TValue *p1, const TValue *p2, - TValue *res) { - switch (op) { - case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: - case LUA_OPSHL: case LUA_OPSHR: - case LUA_OPBNOT: { - lua_Integer i1; lua_Integer i2; - if (tointegerns(p1, &i1) && tointegerns(p2, &i2)) { - setivalue(res, intarith(L, op, i1, i2)); - return 1; - } - else return 0; - } - case LUA_OPDIV: case LUA_OPPOW: { - lua_Number n1; lua_Number n2; - if (tonumberns(p1, n1) && tonumberns(p2, n2)) { - setfltvalue(res, numarith(L, op, n1, n2)); - return 1; - } - else return 0; - } - default: { - lua_Number n1; lua_Number n2; - if (ttisinteger(p1) && ttisinteger(p2)) { - setivalue(res, intarith(L, op, ivalue(p1), ivalue(p2))); - return 1; - } - else if (tonumberns(p1, n1) && tonumberns(p2, n2)) { - setfltvalue(res, numarith(L, op, n1, n2)); - return 1; - } - else return 0; - } - } -} - - -void luaO_arith (lua_State *L, int op, const TValue *p1, const TValue *p2, - StkId res) { - if (!luaO_rawarith(L, op, p1, p2, s2v(res))) { - - luaT_trybinTM(L, p1, p2, res, cast(TMS, (op - LUA_OPADD) + TM_ADD)); - } -} - - -int luaO_hexavalue (int c) { - if (lisdigit(c)) return c - '0'; - else return (ltolower(c) - 'a') + 10; -} - - -static int isneg (const char **s) { - if (**s == '-') { (*s)++; return 1; } - else if (**s == '+') (*s)++; - return 0; -} - - - - - -#if !defined(lua_strx2number) - - -#define MAXSIGDIG 30 - - -static lua_Number lua_strx2number (const char *s, char **endptr) { - int dot = lua_getlocaledecpoint(); - lua_Number r = l_mathop(0.0); - int sigdig = 0; - int nosigdig = 0; - int e = 0; - int neg; - int hasdot = 0; - *endptr = cast_charp(s); - while (lisspace(cast_uchar(*s))) s++; - neg = isneg(&s); - if (!(*s == '0' && (*(s + 1) == 'x' || *(s + 1) == 'X'))) - return l_mathop(0.0); - for (s += 2; ; s++) { - if (*s == dot) { - if (hasdot) break; - else hasdot = 1; - } - else if (lisxdigit(cast_uchar(*s))) { - if (sigdig == 0 && *s == '0') - nosigdig++; - else if (++sigdig <= MAXSIGDIG) - r = (r * l_mathop(16.0)) + luaO_hexavalue(*s); - else e++; - if (hasdot) e--; - } - else break; - } - if (nosigdig + sigdig == 0) - return l_mathop(0.0); - *endptr = cast_charp(s); - e *= 4; - if (*s == 'p' || *s == 'P') { - int exp1 = 0; - int neg1; - s++; - neg1 = isneg(&s); - if (!lisdigit(cast_uchar(*s))) - return l_mathop(0.0); - while (lisdigit(cast_uchar(*s))) - exp1 = exp1 * 10 + *(s++) - '0'; - if (neg1) exp1 = -exp1; - e += exp1; - *endptr = cast_charp(s); - } - if (neg) r = -r; - return l_mathop(ldexp)(r, e); -} - -#endif - - - - -#if !defined (L_MAXLENNUM) -#define L_MAXLENNUM 200 -#endif - - -static const char *l_str2dloc (const char *s, lua_Number *result, int mode) { - char *endptr; - *result = (mode == 'x') ? lua_strx2number(s, &endptr) - : lua_str2number(s, &endptr); - if (endptr == s) return NULL; - while (lisspace(cast_uchar(*endptr))) endptr++; - return (*endptr == '\0') ? endptr : NULL; -} - - - -static const char *l_str2d (const char *s, lua_Number *result) { - const char *endptr; - const char *pmode = strpbrk(s, ".xXnN"); - int mode = pmode ? ltolower(cast_uchar(*pmode)) : 0; - if (mode == 'n') - return NULL; - endptr = l_str2dloc(s, result, mode); - if (endptr == NULL) { - char buff[L_MAXLENNUM + 1]; - const char *pdot = strchr(s, '.'); - if (pdot == NULL || strlen(s) > L_MAXLENNUM) - return NULL; - strcpy(buff, s); - buff[pdot - s] = lua_getlocaledecpoint(); - endptr = l_str2dloc(buff, result, mode); - if (endptr != NULL) - endptr = s + (endptr - buff); - } - return endptr; -} - - -#define MAXBY10 cast(lua_Unsigned, LUA_MAXINTEGER / 10) -#define MAXLASTD cast_int(LUA_MAXINTEGER % 10) - -static const char *l_str2int (const char *s, lua_Integer *result) { - lua_Unsigned a = 0; - int empty = 1; - int neg; - while (lisspace(cast_uchar(*s))) s++; - neg = isneg(&s); - if (s[0] == '0' && - (s[1] == 'x' || s[1] == 'X')) { - s += 2; - for (; lisxdigit(cast_uchar(*s)); s++) { - a = a * 16 + luaO_hexavalue(*s); - empty = 0; - } - } - else { - for (; lisdigit(cast_uchar(*s)); s++) { - int d = *s - '0'; - if (a >= MAXBY10 && (a > MAXBY10 || d > MAXLASTD + neg)) - return NULL; - a = a * 10 + d; - empty = 0; - } - } - while (lisspace(cast_uchar(*s))) s++; - if (empty || *s != '\0') return NULL; - else { - *result = l_castU2S((neg) ? 0u - a : a); - return s; - } -} - - -size_t luaO_str2num (const char *s, TValue *o) { - lua_Integer i; lua_Number n; - const char *e; - if ((e = l_str2int(s, &i)) != NULL) { - setivalue(o, i); - } - else if ((e = l_str2d(s, &n)) != NULL) { - setfltvalue(o, n); - } - else - return 0; - return (e - s) + 1; -} - - -int luaO_utf8esc (char *buff, unsigned long x) { - int n = 1; - lua_assert(x <= 0x7FFFFFFFu); - if (x < 0x80) - buff[UTF8BUFFSZ - 1] = cast_char(x); - else { - unsigned int mfb = 0x3f; - do { - buff[UTF8BUFFSZ - (n++)] = cast_char(0x80 | (x & 0x3f)); - x >>= 6; - mfb >>= 1; - } while (x > mfb); - buff[UTF8BUFFSZ - n] = cast_char((~mfb << 1) | x); - } - return n; -} - - - -#define MAXNUMBER2STR 44 - - - -static int tostringbuff (TValue *obj, char *buff) { - int len; - lua_assert(ttisnumber(obj)); - if (ttisinteger(obj)) - len = lua_integer2str(buff, MAXNUMBER2STR, ivalue(obj)); - else { - len = lua_number2str(buff, MAXNUMBER2STR, fltvalue(obj)); - if (buff[strspn(buff, "-0123456789")] == '\0') { - buff[len++] = lua_getlocaledecpoint(); - buff[len++] = '0'; - } - } - return len; -} - - - -void luaO_tostring (lua_State *L, TValue *obj) { - char buff[MAXNUMBER2STR]; - int len = tostringbuff(obj, buff); - setsvalue(L, obj, luaS_newlstr(L, buff, len)); -} - - - - - - - -#define BUFVFS (LUA_IDSIZE + MAXNUMBER2STR + 95) - - -typedef struct BuffFS { - lua_State *L; - int pushed; - int blen; - char space[BUFVFS]; -} BuffFS; - - - -static void pushstr (BuffFS *buff, const char *str, size_t lstr) { - lua_State *L = buff->L; - setsvalue2s(L, L->top.p, luaS_newlstr(L, str, lstr)); - L->top.p++; - if (!buff->pushed) - buff->pushed = 1; - else - luaV_concat(L, 2); -} - - - -static void clearbuff (BuffFS *buff) { - pushstr(buff, buff->space, buff->blen); - buff->blen = 0; -} - - - -static char *getbuff (BuffFS *buff, int sz) { - lua_assert(buff->blen <= BUFVFS); lua_assert(sz <= BUFVFS); - if (sz > BUFVFS - buff->blen) - clearbuff(buff); - return buff->space + buff->blen; -} - - -#define addsize(b,sz) ((b)->blen += (sz)) - - - -static void addstr2buff (BuffFS *buff, const char *str, size_t slen) { - if (slen <= BUFVFS) { - char *bf = getbuff(buff, cast_int(slen)); - memcpy(bf, str, slen); - addsize(buff, cast_int(slen)); - } - else { - clearbuff(buff); - pushstr(buff, str, slen); - } -} - - - -static void addnum2buff (BuffFS *buff, TValue *num) { - char *numbuff = getbuff(buff, MAXNUMBER2STR); - int len = tostringbuff(num, numbuff); - addsize(buff, len); -} - - - -const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) { - BuffFS buff; - const char *e; - buff.pushed = buff.blen = 0; - buff.L = L; - while ((e = strchr(fmt, '%')) != NULL) { - addstr2buff(&buff, fmt, e - fmt); - switch (*(e + 1)) { - case 's': { - const char *s = va_arg(argp, char *); - if (s == NULL) s = "(null)"; - addstr2buff(&buff, s, strlen(s)); - break; - } - case 'c': { - char c = cast_uchar(va_arg(argp, int)); - addstr2buff(&buff, &c, sizeof(char)); - break; - } - case 'd': { - TValue num; - setivalue(&num, va_arg(argp, int)); - addnum2buff(&buff, &num); - break; - } - case 'I': { - TValue num; - setivalue(&num, cast(lua_Integer, va_arg(argp, l_uacInt))); - addnum2buff(&buff, &num); - break; - } - case 'f': { - TValue num; - setfltvalue(&num, cast_num(va_arg(argp, l_uacNumber))); - addnum2buff(&buff, &num); - break; - } - case 'p': { - const int sz = 3 * sizeof(void*) + 8; - char *bf = getbuff(&buff, sz); - void *p = va_arg(argp, void *); - int len = lua_pointer2str(bf, sz, p); - addsize(&buff, len); - break; - } - case 'U': { - char bf[UTF8BUFFSZ]; - int len = luaO_utf8esc(bf, va_arg(argp, long)); - addstr2buff(&buff, bf + UTF8BUFFSZ - len, len); - break; - } - case '%': { - addstr2buff(&buff, "%", 1); - break; - } - default: { - luaG_runerror(L, "invalid option '%%%c' to 'lua_pushfstring'", - *(e + 1)); - } - } - fmt = e + 2; - } - addstr2buff(&buff, fmt, strlen(fmt)); - clearbuff(&buff); - lua_assert(buff.pushed == 1); - return getstr(tsvalue(s2v(L->top.p - 1))); -} - - -const char *luaO_pushfstring (lua_State *L, const char *fmt, ...) { - const char *msg; - va_list argp; - va_start(argp, fmt); - msg = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - return msg; -} - - - - -#define RETS "..." -#define PRE "[string \"" -#define POS "\"]" - -#define addstr(a,b,l) ( memcpy(a,b,(l) * sizeof(char)), a += (l) ) - -void luaO_chunkid (char *out, const char *source, size_t srclen) { - size_t bufflen = LUA_IDSIZE; - if (*source == '=') { - if (srclen <= bufflen) - memcpy(out, source + 1, srclen * sizeof(char)); - else { - addstr(out, source + 1, bufflen - 1); - *out = '\0'; - } - } - else if (*source == '@') { - if (srclen <= bufflen) - memcpy(out, source + 1, srclen * sizeof(char)); - else { - addstr(out, RETS, LL(RETS)); - bufflen -= LL(RETS); - memcpy(out, source + 1 + srclen - bufflen, bufflen * sizeof(char)); - } - } - else { - const char *nl = strchr(source, '\n'); - addstr(out, PRE, LL(PRE)); - bufflen -= LL(PRE RETS POS) + 1; - if (srclen < bufflen && nl == NULL) { - addstr(out, source, srclen); - } - else { - if (nl != NULL) srclen = nl - source; - if (srclen > bufflen) srclen = bufflen; - addstr(out, source, srclen); - addstr(out, RETS, LL(RETS)); - } - memcpy(out, POS, (LL(POS) + 1) * sizeof(char)); - } -} - - - -//path: src/dependencies/lua/ltm.c - - -#define ltm_c -#define LUA_CORE - - - - - -#include - - - - - - - - - - - - - - - - - - - - - - - - -static const char udatatypename[] = "userdata"; - -LUAI_DDEF const char *const luaT_typenames_[LUA_TOTALTYPES] = { - "no value", - "nil", "boolean", udatatypename, "number", - "string", "table", "function", udatatypename, "thread", - "upvalue", "proto" -}; - - -void luaT_init (lua_State *L) { - static const char *const luaT_eventname[] = { - "__index", "__newindex", - "__gc", "__mode", "__len", "__eq", - "__add", "__sub", "__mul", "__mod", "__pow", - "__div", "__idiv", - "__band", "__bor", "__bxor", "__shl", "__shr", - "__unm", "__bnot", "__lt", "__le", - "__concat", "__call", "__close" - }; - int i; - for (i=0; itmname[i] = luaS_new(L, luaT_eventname[i]); - luaC_fix(L, obj2gco(G(L)->tmname[i])); - } -} - - - -const TValue *luaT_gettm (Table *events, TMS event, TString *ename) { - const TValue *tm = luaH_Hgetshortstr(events, ename); - lua_assert(event <= TM_EQ); - if (notm(tm)) { - events->flags |= cast_byte(1u<metatable; - break; - case LUA_TUSERDATA: - mt = uvalue(o)->metatable; - break; - default: - mt = G(L)->mt[ttype(o)]; - } - return (mt ? luaH_Hgetshortstr(mt, G(L)->tmname[event]) : &G(L)->nilvalue); -} - - - -const char *luaT_objtypename (lua_State *L, const TValue *o) { - Table *mt; - if ((ttistable(o) && (mt = hvalue(o)->metatable) != NULL) || - (ttisfulluserdata(o) && (mt = uvalue(o)->metatable) != NULL)) { - const TValue *name = luaH_Hgetshortstr(mt, luaS_new(L, "__name")); - if (ttisstring(name)) - return getstr(tsvalue(name)); - } - return ttypename(ttype(o)); -} - - -void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, const TValue *p3) { - StkId func = L->top.p; - setobj2s(L, func, f); - setobj2s(L, func + 1, p1); - setobj2s(L, func + 2, p2); - setobj2s(L, func + 3, p3); - L->top.p = func + 4; - - if (isLuacode(L->ci)) - luaD_call(L, func, 0); - else - luaD_callnoyield(L, func, 0); -} - - -int luaT_callTMres (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, StkId res) { - ptrdiff_t result = savestack(L, res); - StkId func = L->top.p; - setobj2s(L, func, f); - setobj2s(L, func + 1, p1); - setobj2s(L, func + 2, p2); - L->top.p += 3; - - if (isLuacode(L->ci)) - luaD_call(L, func, 1); - else - luaD_callnoyield(L, func, 1); - res = restorestack(L, result); - setobjs2s(L, res, --L->top.p); - return ttypetag(s2v(res)); -} - - -static int callbinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event) { - const TValue *tm = luaT_gettmbyobj(L, p1, event); - if (notm(tm)) - tm = luaT_gettmbyobj(L, p2, event); - if (notm(tm)) - return -1; - else - return luaT_callTMres(L, tm, p1, p2, res); -} - - -void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event) { - if (l_unlikely(callbinTM(L, p1, p2, res, event) < 0)) { - switch (event) { - case TM_BAND: case TM_BOR: case TM_BXOR: - case TM_SHL: case TM_SHR: case TM_BNOT: { - if (ttisnumber(p1) && ttisnumber(p2)) - luaG_tointerror(L, p1, p2); - else - luaG_opinterror(L, p1, p2, "perform bitwise operation on"); - } - /* FALLTHROUGH */ - default: - luaG_opinterror(L, p1, p2, "perform arithmetic on"); - } - } -} - - - -void luaT_tryconcatTM (lua_State *L) { - StkId p1 = L->top.p - 2; - if (l_unlikely(callbinTM(L, s2v(p1), s2v(p1 + 1), p1, TM_CONCAT) < 0)) - luaG_concaterror(L, s2v(p1), s2v(p1 + 1)); -} - - -void luaT_trybinassocTM (lua_State *L, const TValue *p1, const TValue *p2, - int flip, StkId res, TMS event) { - if (flip) - luaT_trybinTM(L, p2, p1, res, event); - else - luaT_trybinTM(L, p1, p2, res, event); -} - - -void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, - int flip, StkId res, TMS event) { - TValue aux; - setivalue(&aux, i2); - luaT_trybinassocTM(L, p1, &aux, flip, res, event); -} - - - -int luaT_callorderTM (lua_State *L, const TValue *p1, const TValue *p2, - TMS event) { - int tag = callbinTM(L, p1, p2, L->top.p, event); - if (tag >= 0) - return !tagisfalse(tag); -#if defined(LUA_COMPAT_LT_LE) - else if (event == TM_LE) { - - L->ci->callstatus |= CIST_LEQ; - tag = callbinTM(L, p2, p1, L->top.p, TM_LT); - L->ci->callstatus ^= CIST_LEQ; - if (tag >= 0) - return tagisfalse(tag); - } -#endif - luaG_ordererror(L, p1, p2); - return 0; -} - - -int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, - int flip, int isfloat, TMS event) { - TValue aux; const TValue *p2; - if (isfloat) { - setfltvalue(&aux, cast_num(v2)); - } - else - setivalue(&aux, v2); - if (flip) { - p2 = p1; p1 = &aux; - } - else - p2 = &aux; - return luaT_callorderTM(L, p1, p2, event); -} - - -void luaT_adjustvarargs (lua_State *L, int nfixparams, CallInfo *ci, - const Proto *p) { - int i; - int actual = cast_int(L->top.p - ci->func.p) - 1; - int nextra = actual - nfixparams; - ci->u.l.nextraargs = nextra; - luaD_checkstack(L, p->maxstacksize + 1); - - setobjs2s(L, L->top.p++, ci->func.p); - - for (i = 1; i <= nfixparams; i++) { - setobjs2s(L, L->top.p++, ci->func.p + i); - setnilvalue(s2v(ci->func.p + i)); - } - ci->func.p += actual + 1; - ci->top.p += actual + 1; - lua_assert(L->top.p <= ci->top.p && ci->top.p <= L->stack_last.p); -} - - -void luaT_getvarargs (lua_State *L, CallInfo *ci, StkId where, int wanted) { - int i; - int nextra = ci->u.l.nextraargs; - if (wanted < 0) { - wanted = nextra; - checkstackp(L, nextra, where); - L->top.p = where + nextra; - } - for (i = 0; i < wanted && i < nextra; i++) - setobjs2s(L, where + i, ci->func.p - nextra + i); - for (; i < wanted; i++) - setnilvalue(s2v(where + i)); -} - - - -//path: src/dependencies/lua/lstring.c - - -#define lstring_c -#define LUA_CORE - - - - - -#include - - - - - - - - - - - - - - - - - - - -#define MAXSTRTB cast_int(luaM_limitN(MAX_INT, TString*)) - - - -int luaS_eqlngstr (TString *a, TString *b) { - size_t len = a->u.lnglen; - lua_assert(a->tt == LUA_VLNGSTR && b->tt == LUA_VLNGSTR); - return (a == b) || - ((len == b->u.lnglen) && - (memcmp(getlngstr(a), getlngstr(b), len) == 0)); -} - - -unsigned luaS_hash (const char *str, size_t l, unsigned seed) { - unsigned int h = seed ^ cast_uint(l); - for (; l > 0; l--) - h ^= ((h<<5) + (h>>2) + cast_byte(str[l - 1])); - return h; -} - - -unsigned luaS_hashlongstr (TString *ts) { - lua_assert(ts->tt == LUA_VLNGSTR); - if (ts->extra == 0) { - size_t len = ts->u.lnglen; - ts->hash = luaS_hash(getlngstr(ts), len, ts->hash); - ts->extra = 1; - } - return ts->hash; -} - - -static void tablerehash (TString **vect, int osize, int nsize) { - int i; - for (i = osize; i < nsize; i++) - vect[i] = NULL; - for (i = 0; i < osize; i++) { - TString *p = vect[i]; - vect[i] = NULL; - while (p) { - TString *hnext = p->u.hnext; - unsigned int h = lmod(p->hash, nsize); - p->u.hnext = vect[h]; - vect[h] = p; - p = hnext; - } - } -} - - - -void luaS_resize (lua_State *L, int nsize) { - stringtable *tb = &G(L)->strt; - int osize = tb->size; - TString **newvect; - if (nsize < osize) - tablerehash(tb->hash, osize, nsize); - newvect = luaM_reallocvector(L, tb->hash, osize, nsize, TString*); - if (l_unlikely(newvect == NULL)) { - if (nsize < osize) - tablerehash(tb->hash, nsize, osize); - - } - else { - tb->hash = newvect; - tb->size = nsize; - if (nsize > osize) - tablerehash(newvect, osize, nsize); - } -} - - - -void luaS_clearcache (global_State *g) { - int i, j; - for (i = 0; i < STRCACHE_N; i++) - for (j = 0; j < STRCACHE_M; j++) { - if (iswhite(g->strcache[i][j])) - g->strcache[i][j] = g->memerrmsg; - } -} - - - -void luaS_init (lua_State *L) { - global_State *g = G(L); - int i, j; - stringtable *tb = &G(L)->strt; - tb->hash = luaM_newvector(L, MINSTRTABSIZE, TString*); - tablerehash(tb->hash, 0, MINSTRTABSIZE); - tb->size = MINSTRTABSIZE; - - g->memerrmsg = luaS_newliteral(L, MEMERRMSG); - luaC_fix(L, obj2gco(g->memerrmsg)); - for (i = 0; i < STRCACHE_N; i++) - for (j = 0; j < STRCACHE_M; j++) - g->strcache[i][j] = g->memerrmsg; -} - - -size_t luaS_sizelngstr (size_t len, int kind) { - switch (kind) { - case LSTRREG: - - return offsetof(TString, falloc) + (len + 1) * sizeof(char); - case LSTRFIX: - - return offsetof(TString, falloc); - default: - lua_assert(kind == LSTRMEM); - return sizeof(TString); - } -} - - - -static TString *createstrobj (lua_State *L, size_t totalsize, int tag, - unsigned h) { - TString *ts; - GCObject *o; - o = luaC_newobj(L, tag, totalsize); - ts = gco2ts(o); - ts->hash = h; - ts->extra = 0; - return ts; -} - - -TString *luaS_createlngstrobj (lua_State *L, size_t l) { - size_t totalsize = luaS_sizelngstr(l, LSTRREG); - TString *ts = createstrobj(L, totalsize, LUA_VLNGSTR, G(L)->seed); - ts->u.lnglen = l; - ts->shrlen = LSTRREG; - ts->contents = cast_charp(ts) + offsetof(TString, falloc); - ts->contents[l] = '\0'; - return ts; -} - - -void luaS_remove (lua_State *L, TString *ts) { - stringtable *tb = &G(L)->strt; - TString **p = &tb->hash[lmod(ts->hash, tb->size)]; - while (*p != ts) - p = &(*p)->u.hnext; - *p = (*p)->u.hnext; - tb->nuse--; -} - - -static void growstrtab (lua_State *L, stringtable *tb) { - if (l_unlikely(tb->nuse == MAX_INT)) { - luaC_fullgc(L, 1); - if (tb->nuse == MAX_INT) - luaM_error(L); - } - if (tb->size <= MAXSTRTB / 2) - luaS_resize(L, tb->size * 2); -} - - - -static TString *internshrstr (lua_State *L, const char *str, size_t l) { - TString *ts; - global_State *g = G(L); - stringtable *tb = &g->strt; - unsigned int h = luaS_hash(str, l, g->seed); - TString **list = &tb->hash[lmod(h, tb->size)]; - lua_assert(str != NULL); - for (ts = *list; ts != NULL; ts = ts->u.hnext) { - if (l == cast_uint(ts->shrlen) && - (memcmp(str, getshrstr(ts), l * sizeof(char)) == 0)) { - - if (isdead(g, ts)) - changewhite(ts); - return ts; - } - } - - if (tb->nuse >= tb->size) { - growstrtab(L, tb); - list = &tb->hash[lmod(h, tb->size)]; - } - ts = createstrobj(L, sizestrshr(l), LUA_VSHRSTR, h); - ts->shrlen = cast_byte(l); - getshrstr(ts)[l] = '\0'; - memcpy(getshrstr(ts), str, l * sizeof(char)); - ts->u.hnext = *list; - *list = ts; - tb->nuse++; - return ts; -} - - - -TString *luaS_newlstr (lua_State *L, const char *str, size_t l) { - if (l <= LUAI_MAXSHORTLEN) - return internshrstr(L, str, l); - else { - TString *ts; - if (l_unlikely(l * sizeof(char) >= (MAX_SIZE - sizeof(TString)))) - luaM_toobig(L); - ts = luaS_createlngstrobj(L, l); - memcpy(getlngstr(ts), str, l * sizeof(char)); - return ts; - } -} - - - -TString *luaS_new (lua_State *L, const char *str) { - unsigned int i = point2uint(str) % STRCACHE_N; - int j; - TString **p = G(L)->strcache[i]; - for (j = 0; j < STRCACHE_M; j++) { - if (strcmp(str, getstr(p[j])) == 0) - return p[j]; - } - - for (j = STRCACHE_M - 1; j > 0; j--) - p[j] = p[j - 1]; - - p[0] = luaS_newlstr(L, str, strlen(str)); - return p[0]; -} - - -Udata *luaS_newudata (lua_State *L, size_t s, int nuvalue) { - Udata *u; - int i; - GCObject *o; - if (l_unlikely(s > MAX_SIZE - udatamemoffset(nuvalue))) - luaM_toobig(L); - o = luaC_newobj(L, LUA_VUSERDATA, sizeudata(nuvalue, s)); - u = gco2u(o); - u->len = s; - u->nuvalue = nuvalue; - u->metatable = NULL; - for (i = 0; i < nuvalue; i++) - setnilvalue(&u->uv[i].uv); - return u; -} - - -struct NewExt { - int kind; - const char *s; - size_t len; - TString *ts; -}; - - -static void f_newext (lua_State *L, void *ud) { - struct NewExt *ne = cast(struct NewExt *, ud); - size_t size = luaS_sizelngstr(0, ne->kind); - ne->ts = createstrobj(L, size, LUA_VLNGSTR, G(L)->seed); -} - - -static void f_pintern (lua_State *L, void *ud) { - struct NewExt *ne = cast(struct NewExt *, ud); - ne->ts = internshrstr(L, ne->s, ne->len); -} - - -TString *luaS_newextlstr (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud) { - struct NewExt ne; - if (len <= LUAI_MAXSHORTLEN) { - ne.s = s; ne.len = len; - if (!falloc) - f_pintern(L, &ne); - else { - int status = luaD_rawrunprotected(L, f_pintern, &ne); - (*falloc)(ud, cast_voidp(s), len + 1, 0); - if (status != LUA_OK) - luaM_error(L); - } - return ne.ts; - } - - if (!falloc) { - ne.kind = LSTRFIX; - f_newext(L, &ne); - } - else { - ne.kind = LSTRMEM; - if (luaD_rawrunprotected(L, f_newext, &ne) != LUA_OK) { - (*falloc)(ud, cast_voidp(s), len + 1, 0); - luaM_error(L); - } - ne.ts->falloc = falloc; - ne.ts->ud = ud; - } - ne.ts->shrlen = ne.kind; - ne.ts->u.lnglen = len; - ne.ts->contents = cast_charp(s); - return ne.ts; -} - - - - -//path: src/dependencies/lua/ltable.c - - -#define ltable_c -#define LUA_CORE - - - - - - - -#include - - - - - - - - - - - - - - - - - - - - - - - - - -#define LIMFORLAST 2 - - -typedef struct { Node *dummy; Node follows_pNode; } Limbox_aux; - -typedef union { - Node *lastfree; - char padding[offsetof(Limbox_aux, follows_pNode)]; -} Limbox; - -#define haslastfree(t) ((t)->lsizenode > LIMFORLAST) -#define getlastfree(t) ((cast(Limbox *, (t)->node) - 1)->lastfree) - - - -#define MAXABITS cast_int(sizeof(int) * CHAR_BIT - 1) - - - -#define MAXASIZEB ((MAX_SIZET/sizeof(ArrayCell)) * NM) - - - -#define MAXASIZE \ - (((1u << MAXABITS) < MAXASIZEB) ? (1u << MAXABITS) : cast_uint(MAXASIZEB)) - - -#define MAXHBITS (MAXABITS - 1) - - - -#define MAXHSIZE luaM_limitN(1u << MAXHBITS, Node) - - - -#define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t)))) - - -#define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1)))) - - -#define hashstr(t,str) hashpow2(t, (str)->hash) -#define hashboolean(t,p) hashpow2(t, p) - - -#define hashpointer(t,p) hashmod(t, point2uint(p)) - - -#define dummynode (&dummynode_) - -static const Node dummynode_ = { - {{NULL}, LUA_VEMPTY, - LUA_VNIL, 0, {NULL}} -}; - - -static const TValue absentkey = {ABSTKEYCONSTANT}; - - - -static Node *hashint (const Table *t, lua_Integer i) { - lua_Unsigned ui = l_castS2U(i); - if (ui <= cast_uint(INT_MAX)) - return hashmod(t, cast_int(ui)); - else - return hashmod(t, ui); -} - - - -#if !defined(l_hashfloat) -static int l_hashfloat (lua_Number n) { - int i; - lua_Integer ni; - n = l_mathop(private_lua_cembed_frexp)(n, &i) * -cast_num(INT_MIN); - if (!lua_numbertointeger(n, &ni)) { - lua_assert(luai_numisnan(n) || l_mathop(fabs)(n) == cast_num(HUGE_VAL)); - return 0; - } - else { - unsigned int u = cast_uint(i) + cast_uint(ni); - return cast_int(u <= cast_uint(INT_MAX) ? u : ~u); - } -} -#endif - - - -static Node *mainpositionTV (const Table *t, const TValue *key) { - switch (ttypetag(key)) { - case LUA_VNUMINT: { - lua_Integer i = ivalue(key); - return hashint(t, i); - } - case LUA_VNUMFLT: { - lua_Number n = fltvalue(key); - return hashmod(t, l_hashfloat(n)); - } - case LUA_VSHRSTR: { - TString *ts = tsvalue(key); - return hashstr(t, ts); - } - case LUA_VLNGSTR: { - TString *ts = tsvalue(key); - return hashpow2(t, luaS_hashlongstr(ts)); - } - case LUA_VFALSE: - return hashboolean(t, 0); - case LUA_VTRUE: - return hashboolean(t, 1); - case LUA_VLIGHTUSERDATA: { - void *p = pvalue(key); - return hashpointer(t, p); - } - case LUA_VLCF: { - lua_CFunction f = fvalue(key); - return hashpointer(t, f); - } - default: { - GCObject *o = gcvalue(key); - return hashpointer(t, o); - } - } -} - - -l_sinline Node *mainpositionfromnode (const Table *t, Node *nd) { - TValue key; - getnodekey(cast(lua_State *, NULL), &key, nd); - return mainpositionTV(t, &key); -} - - - -static int equalkey (const TValue *k1, const Node *n2, int deadok) { - if ((rawtt(k1) != keytt(n2)) && - !(deadok && keyisdead(n2) && iscollectable(k1))) - return 0; - switch (keytt(n2)) { - case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: - return 1; - case LUA_VNUMINT: - return (ivalue(k1) == keyival(n2)); - case LUA_VNUMFLT: - return luai_numeq(fltvalue(k1), fltvalueraw(keyval(n2))); - case LUA_VLIGHTUSERDATA: - return pvalue(k1) == pvalueraw(keyval(n2)); - case LUA_VLCF: - return fvalue(k1) == fvalueraw(keyval(n2)); - case ctb(LUA_VLNGSTR): - return luaS_eqlngstr(tsvalue(k1), keystrval(n2)); - default: - return gcvalue(k1) == gcvalueraw(keyval(n2)); - } -} - - - -#define limitequalsasize(t) (isrealasize(t) || ispow2((t)->alimit)) - - - -LUAI_FUNC unsigned int luaH_realasize (const Table *t) { - if (limitequalsasize(t)) - return t->alimit; - else { - unsigned int size = t->alimit; - - size |= (size >> 1); - size |= (size >> 2); - size |= (size >> 4); - size |= (size >> 8); -#if (UINT_MAX >> 14) > 3 - size |= (size >> 16); -#if (UINT_MAX >> 30) > 3 - size |= (size >> 32); -#endif -#endif - size++; - lua_assert(ispow2(size) && size/2 < t->alimit && t->alimit < size); - return size; - } -} - - - -static int ispow2realasize (const Table *t) { - return (!isrealasize(t) || ispow2(t->alimit)); -} - - -static unsigned int setlimittosize (Table *t) { - t->alimit = luaH_realasize(t); - setrealasize(t); - return t->alimit; -} - - -#define limitasasize(t) check_exp(isrealasize(t), t->alimit) - - - - -static const TValue *getgeneric (Table *t, const TValue *key, int deadok) { - Node *n = mainpositionTV(t, key); - for (;;) { - if (equalkey(key, n, deadok)) - return gval(n); - else { - int nx = gnext(n); - if (nx == 0) - return &absentkey; - n += nx; - } - } -} - - - -static unsigned int arrayindex (lua_Integer k) { - if (l_castS2U(k) - 1u < MAXASIZE) - return cast_uint(k); - else - return 0; -} - - - -static unsigned findindex (lua_State *L, Table *t, TValue *key, - unsigned asize) { - unsigned int i; - if (ttisnil(key)) return 0; - i = ttisinteger(key) ? arrayindex(ivalue(key)) : 0; - if (i - 1u < asize) - return i; - else { - const TValue *n = getgeneric(t, key, 1); - if (l_unlikely(isabstkey(n))) - luaG_runerror(L, "invalid key to 'next'"); - i = cast_int(nodefromval(n) - gnode(t, 0)); - - return (i + 1) + asize; - } -} - - -int luaH_next (lua_State *L, Table *t, StkId key) { - unsigned int asize = luaH_realasize(t); - unsigned int i = findindex(L, t, s2v(key), asize); - for (; i < asize; i++) { - int tag = *getArrTag(t, i); - if (!tagisempty(tag)) { - setivalue(s2v(key), i + 1); - farr2val(t, i + 1, tag, s2v(key + 1)); - return 1; - } - } - for (i -= asize; cast_int(i) < sizenode(t); i++) { - if (!isempty(gval(gnode(t, i)))) { - Node *n = gnode(t, i); - getnodekey(L, s2v(key), n); - setobj2s(L, key + 1, gval(n)); - return 1; - } - } - return 0; -} - - -static void freehash (lua_State *L, Table *t) { - if (!isdummy(t)) { - size_t bsize = sizenode(t) * sizeof(Node); - char *arr = cast_charp(t->node); - if (haslastfree(t)) { - bsize += sizeof(Limbox); - arr -= sizeof(Limbox); - } - luaM_freearray(L, arr, bsize); - } -} - - - -static int keyinarray (Table *t, lua_Integer key) { - lua_Unsigned alimit = t->alimit; - if (l_castS2U(key) - 1u < alimit) - return 1; - else if (!isrealasize(t) && - (((l_castS2U(key) - 1u) & ~(alimit - 1u)) < alimit)) { - t->alimit = cast_uint(key); - return 1; - } - else - return 0; -} - - - - - -static unsigned computesizes (unsigned nums[], unsigned *pna) { - int i; - unsigned int twotoi; - unsigned int a = 0; - unsigned int na = 0; - unsigned int optimal = 0; - - for (i = 0, twotoi = 1; - twotoi > 0 && *pna > twotoi / 2; - i++, twotoi *= 2) { - a += nums[i]; - if (a > twotoi/2) { - optimal = twotoi; - na = a; - } - } - lua_assert((optimal == 0 || optimal / 2 < na) && na <= optimal); - *pna = na; - return optimal; -} - - -static int countint (lua_Integer key, unsigned int *nums) { - unsigned int k = arrayindex(key); - if (k != 0) { - nums[luaO_ceillog2(k)]++; - return 1; - } - else - return 0; -} - - -l_sinline int arraykeyisempty (const Table *t, lua_Integer key) { - int tag = *getArrTag(t, key - 1); - return tagisempty(tag); -} - - - -static unsigned numusearray (const Table *t, unsigned *nums) { - int lg; - unsigned int ttlg; - unsigned int ause = 0; - unsigned int i = 1; - unsigned int asize = limitasasize(t); - - for (lg = 0, ttlg = 1; lg <= MAXABITS; lg++, ttlg *= 2) { - unsigned int lc = 0; - unsigned int lim = ttlg; - if (lim > asize) { - lim = asize; - if (i > lim) - break; - } - - for (; i <= lim; i++) { - if (!arraykeyisempty(t, i)) - lc++; - } - nums[lg] += lc; - ause += lc; - } - return ause; -} - - -static int numusehash (const Table *t, unsigned *nums, unsigned *pna) { - int totaluse = 0; - int ause = 0; - int i = sizenode(t); - while (i--) { - Node *n = &t->node[i]; - if (!isempty(gval(n))) { - if (keyisinteger(n)) - ause += countint(keyival(n), nums); - totaluse++; - } - } - *pna += ause; - return totaluse; -} - - - -static size_t concretesize (unsigned int size) { - unsigned int numcells = (size + NM - 1) / NM; - unsigned int extra = NM - 1 - ((size + NM - 1) % NM); - return numcells * sizeof(ArrayCell) - extra * sizeof(Value); -} - - -static ArrayCell *resizearray (lua_State *L , Table *t, - unsigned oldasize, - unsigned newasize) { - size_t oldasizeb = concretesize(oldasize); - size_t newasizeb = concretesize(newasize); - void *a = luaM_reallocvector(L, t->array, oldasizeb, newasizeb, lu_byte); - return cast(ArrayCell*, a); -} - - - -static void setnodevector (lua_State *L, Table *t, unsigned size) { - if (size == 0) { - t->node = cast(Node *, dummynode); - t->lsizenode = 0; - setdummy(t); - } - else { - int i; - int lsize = luaO_ceillog2(size); - if (lsize > MAXHBITS || (1u << lsize) > MAXHSIZE) - luaG_runerror(L, "table overflow"); - size = twoto(lsize); - if (lsize <= LIMFORLAST) - t->node = luaM_newvector(L, size, Node); - else { - size_t bsize = size * sizeof(Node) + sizeof(Limbox); - char *node = luaM_newblock(L, bsize); - t->node = cast(Node *, node + sizeof(Limbox)); - getlastfree(t) = gnode(t, size); - } - t->lsizenode = cast_byte(lsize); - setnodummy(t); - for (i = 0; i < cast_int(size); i++) { - Node *n = gnode(t, i); - gnext(n) = 0; - setnilkey(n); - setempty(gval(n)); - } - } -} - - - -static void reinsert (lua_State *L, Table *ot, Table *t) { - int j; - int size = sizenode(ot); - for (j = 0; j < size; j++) { - Node *old = gnode(ot, j); - if (!isempty(gval(old))) { - - TValue k; - getnodekey(L, &k, old); - luaH_set(L, t, &k, gval(old)); - } - } -} - - - -static void exchangehashpart (Table *t1, Table *t2) { - lu_byte lsizenode = t1->lsizenode; - Node *node = t1->node; - int bitdummy1 = t1->flags & BITDUMMY; - t1->lsizenode = t2->lsizenode; - t1->node = t2->node; - t1->flags = (t1->flags & NOTBITDUMMY) | (t2->flags & BITDUMMY); - t2->lsizenode = lsizenode; - t2->node = node; - t2->flags = (t2->flags & NOTBITDUMMY) | bitdummy1; -} - - - -static void reinsertOldSlice (lua_State *L, Table *t, unsigned oldasize, - unsigned newasize) { - unsigned i; - t->alimit = newasize; - for (i = newasize; i < oldasize; i++) { - int tag = *getArrTag(t, i); - if (!tagisempty(tag)) { - TValue aux; - farr2val(t, i + 1, tag, &aux); - luaH_setint(L, t, i + 1, &aux); - } - } - t->alimit = oldasize; -} - - - -static void clearNewSlice (Table *t, unsigned oldasize, unsigned newasize) { - for (; oldasize < newasize; oldasize++) - *getArrTag(t, oldasize) = LUA_VEMPTY; -} - - - -void luaH_resize (lua_State *L, Table *t, unsigned newasize, - unsigned nhsize) { - Table newt; - unsigned int oldasize = setlimittosize(t); - ArrayCell *newarray; - if (newasize > MAXASIZE) - luaG_runerror(L, "table overflow"); - - newt.flags = 0; - setnodevector(L, &newt, nhsize); - if (newasize < oldasize) { - - exchangehashpart(t, &newt); - reinsertOldSlice(L, t, oldasize, newasize); - exchangehashpart(t, &newt); - } - - newarray = resizearray(L, t, oldasize, newasize); - if (l_unlikely(newarray == NULL && newasize > 0)) { - freehash(L, &newt); - luaM_error(L); - } - - exchangehashpart(t, &newt); - t->array = newarray; - t->alimit = newasize; - clearNewSlice(t, oldasize, newasize); - - reinsert(L, &newt, t); - freehash(L, &newt); -} - - -void luaH_resizearray (lua_State *L, Table *t, unsigned int nasize) { - int nsize = allocsizenode(t); - luaH_resize(L, t, nasize, nsize); -} - - -static void rehash (lua_State *L, Table *t, const TValue *ek) { - unsigned int asize; - unsigned int na; - unsigned int nums[MAXABITS + 1]; - int i; - int totaluse; - for (i = 0; i <= MAXABITS; i++) nums[i] = 0; - setlimittosize(t); - na = numusearray(t, nums); - totaluse = na; - totaluse += numusehash(t, nums, &na); - - if (ttisinteger(ek)) - na += countint(ivalue(ek), nums); - totaluse++; - - asize = computesizes(nums, &na); - - luaH_resize(L, t, asize, totaluse - na); -} - - - - - - -Table *luaH_new (lua_State *L) { - GCObject *o = luaC_newobj(L, LUA_VTABLE, sizeof(Table)); - Table *t = gco2t(o); - t->metatable = NULL; - t->flags = cast_byte(maskflags); - t->array = NULL; - t->alimit = 0; - setnodevector(L, t, 0); - return t; -} - - - -void luaH_free (lua_State *L, Table *t) { - unsigned int realsize = luaH_realasize(t); - size_t sizeb = concretesize(realsize); - lua_assert((sizeb == 0 && realsize == 0) || - cast_charp(t->array) + sizeb - sizeof(Value) == - cast_charp(getArrVal(t, realsize - 1))); - freehash(L, t); - luaM_freemem(L, t->array, sizeb); - luaM_free(L, t); -} - - -static Node *getfreepos (Table *t) { - if (haslastfree(t)) { - - while (getlastfree(t) > t->node) { - Node *free = --getlastfree(t); - if (keyisnil(free)) - return free; - } - } - else { - if (!isdummy(t)) { - int i = sizenode(t); - while (i--) { - Node *free = gnode(t, i); - if (keyisnil(free)) - return free; - } - } - } - return NULL; -} - - - - -static void luaH_newkey (lua_State *L, Table *t, const TValue *key, - TValue *value) { - Node *mp; - TValue aux; - if (l_unlikely(ttisnil(key))) - luaG_runerror(L, "table index is nil"); - else if (ttisfloat(key)) { - lua_Number f = fltvalue(key); - lua_Integer k; - if (luaV_flttointeger(f, &k, F2Ieq)) { - setivalue(&aux, k); - key = &aux; - } - else if (l_unlikely(luai_numisnan(f))) - luaG_runerror(L, "table index is NaN"); - } - if (ttisnil(value)) - return; - mp = mainpositionTV(t, key); - if (!isempty(gval(mp)) || isdummy(t)) { - Node *othern; - Node *f = getfreepos(t); - if (f == NULL) { - rehash(L, t, key); - - luaH_set(L, t, key, value); - return; - } - lua_assert(!isdummy(t)); - othern = mainpositionfromnode(t, mp); - if (othern != mp) { - - while (othern + gnext(othern) != mp) - othern += gnext(othern); - gnext(othern) = cast_int(f - othern); - *f = *mp; - if (gnext(mp) != 0) { - gnext(f) += cast_int(mp - f); - gnext(mp) = 0; - } - setempty(gval(mp)); - } - else { - - if (gnext(mp) != 0) - gnext(f) = cast_int((mp + gnext(mp)) - f); - else lua_assert(gnext(f) == 0); - gnext(mp) = cast_int(f - mp); - mp = f; - } - } - setnodekey(L, mp, key); - luaC_barrierback(L, obj2gco(t), key); - lua_assert(isempty(gval(mp))); - setobj2t(L, gval(mp), value); -} - - -static const TValue *getintfromhash (Table *t, lua_Integer key) { - Node *n = hashint(t, key); - lua_assert(l_castS2U(key) - 1u >= luaH_realasize(t)); - for (;;) { - if (keyisinteger(n) && keyival(n) == key) - return gval(n); - else { - int nx = gnext(n); - if (nx == 0) break; - n += nx; - } - } - return &absentkey; -} - - -static int hashkeyisempty (Table *t, lua_Integer key) { - const TValue *val = getintfromhash(t, key); - return isempty(val); -} - - -static int finishnodeget (const TValue *val, TValue *res) { - if (!ttisnil(val)) { - setobj(((lua_State*)NULL), res, val); - } - return ttypetag(val); -} - - -int luaH_getint (Table *t, lua_Integer key, TValue *res) { - if (keyinarray(t, key)) { - int tag = *getArrTag(t, key - 1); - if (!tagisempty(tag)) - farr2val(t, key, tag, res); - return tag; - } - else - return finishnodeget(getintfromhash(t, key), res); -} - - - -const TValue *luaH_Hgetshortstr (Table *t, TString *key) { - Node *n = hashstr(t, key); - lua_assert(key->tt == LUA_VSHRSTR); - for (;;) { - if (keyisshrstr(n) && eqshrstr(keystrval(n), key)) - return gval(n); - else { - int nx = gnext(n); - if (nx == 0) - return &absentkey; - n += nx; - } - } -} - - -int luaH_getshortstr (Table *t, TString *key, TValue *res) { - return finishnodeget(luaH_Hgetshortstr(t, key), res); -} - - -static const TValue *Hgetstr (Table *t, TString *key) { - if (key->tt == LUA_VSHRSTR) - return luaH_Hgetshortstr(t, key); - else { - TValue ko; - setsvalue(cast(lua_State *, NULL), &ko, key); - return getgeneric(t, &ko, 0); - } -} - - -int luaH_getstr (Table *t, TString *key, TValue *res) { - return finishnodeget(Hgetstr(t, key), res); -} - - -TString *luaH_getstrkey (Table *t, TString *key) { - const TValue *o = Hgetstr(t, key); - if (!isabstkey(o)) - return keystrval(nodefromval(o)); - else - return NULL; -} - - - -int luaH_get (Table *t, const TValue *key, TValue *res) { - const TValue *slot; - switch (ttypetag(key)) { - case LUA_VSHRSTR: - slot = luaH_Hgetshortstr(t, tsvalue(key)); - break; - case LUA_VNUMINT: - return luaH_getint(t, ivalue(key), res); - case LUA_VNIL: - slot = &absentkey; - break; - case LUA_VNUMFLT: { - lua_Integer k; - if (luaV_flttointeger(fltvalue(key), &k, F2Ieq)) - return luaH_getint(t, k, res); - - } - default: - slot = getgeneric(t, key, 0); - break; - } - return finishnodeget(slot, res); -} - - -static int finishnodeset (Table *t, const TValue *slot, TValue *val) { - if (!ttisnil(slot)) { - setobj(((lua_State*)NULL), cast(TValue*, slot), val); - return HOK; - } - else if (isabstkey(slot)) - return HNOTFOUND; - else - return cast_int((cast(Node*, slot) - t->node)) + HFIRSTNODE; -} - - -static int rawfinishnodeset (const TValue *slot, TValue *val) { - if (isabstkey(slot)) - return 0; - else { - setobj(((lua_State*)NULL), cast(TValue*, slot), val); - return 1; - } -} - - -int luaH_psetint (Table *t, lua_Integer key, TValue *val) { - if (keyinarray(t, key)) { - lu_byte *tag = getArrTag(t, key - 1); - if (!tagisempty(*tag) || checknoTM(t->metatable, TM_NEWINDEX)) { - fval2arr(t, key, tag, val); - return HOK; - } - else - return ~cast_int(key); - } - else - return finishnodeset(t, getintfromhash(t, key), val); -} - - -int luaH_psetshortstr (Table *t, TString *key, TValue *val) { - return finishnodeset(t, luaH_Hgetshortstr(t, key), val); -} - - -int luaH_psetstr (Table *t, TString *key, TValue *val) { - return finishnodeset(t, Hgetstr(t, key), val); -} - - -int luaH_pset (Table *t, const TValue *key, TValue *val) { - switch (ttypetag(key)) { - case LUA_VSHRSTR: return luaH_psetshortstr(t, tsvalue(key), val); - case LUA_VNUMINT: return luaH_psetint(t, ivalue(key), val); - case LUA_VNIL: return HNOTFOUND; - case LUA_VNUMFLT: { - lua_Integer k; - if (luaV_flttointeger(fltvalue(key), &k, F2Ieq)) - return luaH_psetint(t, k, val); - - } - default: - return finishnodeset(t, getgeneric(t, key, 0), val); - } -} - - - - -void luaH_finishset (lua_State *L, Table *t, const TValue *key, - TValue *value, int hres) { - lua_assert(hres != HOK); - if (hres == HNOTFOUND) { - luaH_newkey(L, t, key, value); - } - else if (hres > 0) { - setobj2t(L, gval(gnode(t, hres - HFIRSTNODE)), value); - } - else { - hres = ~hres; - obj2arr(t, hres, value); - } -} - - - -void luaH_set (lua_State *L, Table *t, const TValue *key, TValue *value) { - int hres = luaH_pset(t, key, value); - if (hres != HOK) - luaH_finishset(L, t, key, value, hres); -} - - - -void luaH_setint (lua_State *L, Table *t, lua_Integer key, TValue *value) { - if (keyinarray(t, key)) - obj2arr(t, key, value); - else { - int ok = rawfinishnodeset(getintfromhash(t, key), value); - if (!ok) { - TValue k; - setivalue(&k, key); - luaH_newkey(L, t, &k, value); - } - } -} - - - -static lua_Unsigned hash_search (Table *t, lua_Unsigned j) { - lua_Unsigned i; - if (j == 0) j++; - do { - i = j; - if (j <= l_castS2U(LUA_MAXINTEGER) / 2) - j *= 2; - else { - j = LUA_MAXINTEGER; - if (hashkeyisempty(t, j)) - break; - else - return j; - } - } while (!hashkeyisempty(t, j)); - - while (j - i > 1u) { - lua_Unsigned m = (i + j) / 2; - if (hashkeyisempty(t, m)) j = m; - else i = m; - } - return i; -} - - -static unsigned int binsearch (Table *array, unsigned int i, unsigned int j) { - while (j - i > 1u) { - unsigned int m = (i + j) / 2; - if (arraykeyisempty(array, m)) j = m; - else i = m; - } - return i; -} - - - -lua_Unsigned luaH_getn (Table *t) { - unsigned int limit = t->alimit; - if (limit > 0 && arraykeyisempty(t, limit)) { - - if (limit >= 2 && !arraykeyisempty(t, limit - 1)) { - - if (ispow2realasize(t) && !ispow2(limit - 1)) { - t->alimit = limit - 1; - setnorealasize(t); - } - return limit - 1; - } - else { - unsigned int boundary = binsearch(t, 0, limit); - - if (ispow2realasize(t) && boundary > luaH_realasize(t) / 2) { - t->alimit = boundary; - setnorealasize(t); - } - return boundary; - } - } - - if (!limitequalsasize(t)) { - - if (arraykeyisempty(t, limit + 1)) - return limit; - - limit = luaH_realasize(t); - if (arraykeyisempty(t, limit)) { - - unsigned int boundary = binsearch(t, t->alimit, limit); - t->alimit = boundary; - return boundary; - } - - } - - lua_assert(limit == luaH_realasize(t) && - (limit == 0 || !arraykeyisempty(t, limit))); - if (isdummy(t) || hashkeyisempty(t, cast(lua_Integer, limit + 1))) - return limit; - else - return hash_search(t, limit); -} - - - -#if defined(LUA_DEBUG) - - - -Node *luaH_mainposition (const Table *t, const TValue *key) { - return mainpositionTV(t, key); -} - -#endif - - -//path: src/dependencies/lua/ldo.c - - -#define ldo_c -#define LUA_CORE - - - - - -#include -#include -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -#define errorstatus(s) ((s) > LUA_YIELD) - - - - - -#if !defined(LUAI_THROW) - -#if defined(__cplusplus) && !defined(LUA_USE_LONGJMP) - - -#define LUAI_THROW(L,c) throw(c) -#define LUAI_TRY(L,c,a) \ - try { a } catch(...) { if ((c)->status == 0) (c)->status = -1; } -#define luai_jmpbuf int - -#elif defined(LUA_USE_POSIX) - - -#define LUAI_THROW(L,c) _longjmp((c)->b, 1) -#define LUAI_TRY(L,c,a) if (_setjmp((c)->b) == 0) { a } -#define luai_jmpbuf jmp_buf - -#else - - -#define LUAI_THROW(L,c) longjmp((c)->b, 1) -#define LUAI_TRY(L,c,a) if (setjmp((c)->b) == 0) { a } -#define luai_jmpbuf jmp_buf - -#endif - -#endif - - - - -struct lua_longjmp { - struct lua_longjmp *previous; - luai_jmpbuf b; - volatile int status; -}; - - -void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop) { - switch (errcode) { - case LUA_ERRMEM: { - setsvalue2s(L, oldtop, G(L)->memerrmsg); - break; - } - case LUA_ERRERR: { - setsvalue2s(L, oldtop, luaS_newliteral(L, "error in private_lua_error handling")); - break; - } - case LUA_OK: { - setnilvalue(s2v(oldtop)); - break; - } - default: { - lua_assert(errorstatus(errcode)); - setobjs2s(L, oldtop, L->top.p - 1); - break; - } - } - L->top.p = oldtop + 1; -} - - -l_noret luaD_throw (lua_State *L, int errcode) { - if (L->errorJmp) { - L->errorJmp->status = errcode; - LUAI_THROW(L, L->errorJmp); - } - else { - global_State *g = G(L); - errcode = luaE_resetthread(L, errcode); - if (g->mainthread->errorJmp) { - setobjs2s(L, g->mainthread->top.p++, L->top.p - 1); - luaD_throw(g->mainthread, errcode); - } - else { - if (g->panic) { - lua_unlock(L); - g->panic(L); - } - abort(); - } - } -} - - -int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) { - l_uint32 oldnCcalls = L->nCcalls; - struct lua_longjmp lj; - lj.status = LUA_OK; - lj.previous = L->errorJmp; - L->errorJmp = &lj; - LUAI_TRY(L, &lj, - (*f)(L, ud); - ); - L->errorJmp = lj.previous; - L->nCcalls = oldnCcalls; - return lj.status; -} - - - - - - - - -static void relstack (lua_State *L) { - CallInfo *ci; - UpVal *up; - L->top.offset = savestack(L, L->top.p); - L->tbclist.offset = savestack(L, L->tbclist.p); - for (up = L->openupval; up != NULL; up = up->u.open.next) - up->v.offset = savestack(L, uplevel(up)); - for (ci = L->ci; ci != NULL; ci = ci->previous) { - ci->top.offset = savestack(L, ci->top.p); - ci->func.offset = savestack(L, ci->func.p); - } -} - - - -static void correctstack (lua_State *L) { - CallInfo *ci; - UpVal *up; - L->top.p = restorestack(L, L->top.offset); - L->tbclist.p = restorestack(L, L->tbclist.offset); - for (up = L->openupval; up != NULL; up = up->u.open.next) - up->v.p = s2v(restorestack(L, up->v.offset)); - for (ci = L->ci; ci != NULL; ci = ci->previous) { - ci->top.p = restorestack(L, ci->top.offset); - ci->func.p = restorestack(L, ci->func.offset); - if (isLua(ci)) - ci->u.l.trap = 1; - } -} - - - -#define ERRORSTACKSIZE (LUAI_MAXSTACK + 200) - - -int luaD_reallocstack (lua_State *L, int newsize, int raiseerror) { - int oldsize = stacksize(L); - int i; - StkId newstack; - int oldgcstop = G(L)->gcstopem; - lua_assert(newsize <= LUAI_MAXSTACK || newsize == ERRORSTACKSIZE); - relstack(L); - G(L)->gcstopem = 1; - newstack = luaM_reallocvector(L, L->stack.p, oldsize + EXTRA_STACK, - newsize + EXTRA_STACK, StackValue); - G(L)->gcstopem = oldgcstop; - if (l_unlikely(newstack == NULL)) { - correctstack(L); - if (raiseerror) - luaM_error(L); - else return 0; - } - L->stack.p = newstack; - correctstack(L); - L->stack_last.p = L->stack.p + newsize; - for (i = oldsize + EXTRA_STACK; i < newsize + EXTRA_STACK; i++) - setnilvalue(s2v(newstack + i)); - return 1; -} - - - -int luaD_growstack (lua_State *L, int n, int raiseerror) { - int size = stacksize(L); - if (l_unlikely(size > LUAI_MAXSTACK)) { - - lua_assert(stacksize(L) == ERRORSTACKSIZE); - if (raiseerror) - luaD_throw(L, LUA_ERRERR); - return 0; - } - else if (n < LUAI_MAXSTACK) { - int newsize = 2 * size; - int needed = cast_int(L->top.p - L->stack.p) + n; - if (newsize > LUAI_MAXSTACK) - newsize = LUAI_MAXSTACK; - if (newsize < needed) - newsize = needed; - if (l_likely(newsize <= LUAI_MAXSTACK)) - return luaD_reallocstack(L, newsize, raiseerror); - } - - - luaD_reallocstack(L, ERRORSTACKSIZE, raiseerror); - if (raiseerror) - luaG_runerror(L, "stack overflow"); - return 0; -} - - - -static int stackinuse (lua_State *L) { - CallInfo *ci; - int res; - StkId lim = L->top.p; - for (ci = L->ci; ci != NULL; ci = ci->previous) { - if (lim < ci->top.p) lim = ci->top.p; - } - lua_assert(lim <= L->stack_last.p + EXTRA_STACK); - res = cast_int(lim - L->stack.p) + 1; - if (res < LUA_MINSTACK) - res = LUA_MINSTACK; - return res; -} - - - -void luaD_shrinkstack (lua_State *L) { - int inuse = stackinuse(L); - int max = (inuse > LUAI_MAXSTACK / 3) ? LUAI_MAXSTACK : inuse * 3; - - if (inuse <= LUAI_MAXSTACK && stacksize(L) > max) { - int nsize = (inuse > LUAI_MAXSTACK / 2) ? LUAI_MAXSTACK : inuse * 2; - luaD_reallocstack(L, nsize, 0); - } - else - condmovestack(L,{},{}); - luaE_shrinkCI(L); -} - - -void luaD_inctop (lua_State *L) { - luaD_checkstack(L, 1); - L->top.p++; -} - - - - - -void luaD_hook (lua_State *L, int event, int line, - int ftransfer, int ntransfer) { - lua_Hook hook = L->hook; - if (hook && L->allowhook) { - int mask = CIST_HOOKED; - CallInfo *ci = L->ci; - ptrdiff_t top = savestack(L, L->top.p); - ptrdiff_t ci_top = savestack(L, ci->top.p); - lua_Debug ar; - ar.event = event; - ar.currentline = line; - ar.i_ci = ci; - if (ntransfer != 0) { - mask |= CIST_TRAN; - ci->u2.transferinfo.ftransfer = ftransfer; - ci->u2.transferinfo.ntransfer = ntransfer; - } - if (isLua(ci) && L->top.p < ci->top.p) - L->top.p = ci->top.p; - luaD_checkstack(L, LUA_MINSTACK); - if (ci->top.p < L->top.p + LUA_MINSTACK) - ci->top.p = L->top.p + LUA_MINSTACK; - L->allowhook = 0; - ci->callstatus |= mask; - lua_unlock(L); - (*hook)(L, &ar); - lua_lock(L); - lua_assert(!L->allowhook); - L->allowhook = 1; - ci->top.p = restorestack(L, ci_top); - L->top.p = restorestack(L, top); - ci->callstatus &= ~mask; - } -} - - - -void luaD_hookcall (lua_State *L, CallInfo *ci) { - L->oldpc = 0; - if (L->hookmask & LUA_MASKCALL) { - int event = (ci->callstatus & CIST_TAIL) ? LUA_HOOKTAILCALL - : LUA_HOOKCALL; - Proto *p = ci_func(ci)->p; - ci->u.l.savedpc++; - luaD_hook(L, event, -1, 1, p->numparams); - ci->u.l.savedpc--; - } -} - - - -static void rethook (lua_State *L, CallInfo *ci, int nres) { - if (L->hookmask & LUA_MASKRET) { - StkId firstres = L->top.p - nres; - int delta = 0; - int ftransfer; - if (isLua(ci)) { - Proto *p = ci_func(ci)->p; - if (p->flag & PF_ISVARARG) - delta = ci->u.l.nextraargs + p->numparams + 1; - } - ci->func.p += delta; - ftransfer = cast(unsigned short, firstres - ci->func.p); - luaD_hook(L, LUA_HOOKRET, -1, ftransfer, nres); - ci->func.p -= delta; - } - if (isLua(ci = ci->previous)) - L->oldpc = pcRel(ci->u.l.savedpc, ci_func(ci)->p); -} - - - -static StkId tryfuncTM (lua_State *L, StkId func) { - const TValue *tm; - StkId p; - checkstackp(L, 1, func); - tm = luaT_gettmbyobj(L, s2v(func), TM_CALL); - if (l_unlikely(ttisnil(tm))) - luaG_callerror(L, s2v(func)); - for (p = L->top.p; p > func; p--) - setobjs2s(L, p, p-1); - L->top.p++; - setobj2s(L, func, tm); - return func; -} - - - -l_sinline void moveresults (lua_State *L, StkId res, int nres, int wanted) { - StkId firstresult; - int i; - switch (wanted) { - case 0: - L->top.p = res; - return; - case 1: - if (nres == 0) - setnilvalue(s2v(res)); - else - setobjs2s(L, res, L->top.p - nres); - L->top.p = res + 1; - return; - case LUA_MULTRET: - wanted = nres; - break; - default: - if (hastocloseCfunc(wanted)) { - L->ci->callstatus |= CIST_CLSRET; - L->ci->u2.nres = nres; - res = luaF_close(L, res, CLOSEKTOP, 1); - L->ci->callstatus &= ~CIST_CLSRET; - if (L->hookmask) { - ptrdiff_t savedres = savestack(L, res); - rethook(L, L->ci, nres); - res = restorestack(L, savedres); - } - wanted = decodeNresults(wanted); - if (wanted == LUA_MULTRET) - wanted = nres; - } - break; - } - - firstresult = L->top.p - nres; - if (nres > wanted) - nres = wanted; - for (i = 0; i < nres; i++) - setobjs2s(L, res + i, firstresult + i); - for (; i < wanted; i++) - setnilvalue(s2v(res + i)); - L->top.p = res + wanted; -} - - - -void luaD_poscall (lua_State *L, CallInfo *ci, int nres) { - int wanted = ci->nresults; - if (l_unlikely(L->hookmask && !hastocloseCfunc(wanted))) - rethook(L, ci, nres); - - moveresults(L, ci->func.p, nres, wanted); - - lua_assert(!(ci->callstatus & - (CIST_HOOKED | CIST_YPCALL | CIST_FIN | CIST_TRAN | CIST_CLSRET))); - L->ci = ci->previous; -} - - - -#define next_ci(L) (L->ci->next ? L->ci->next : luaE_extendCI(L)) - - -l_sinline CallInfo *prepCallInfo (lua_State *L, StkId func, int nret, - int mask, StkId top) { - CallInfo *ci = L->ci = next_ci(L); - ci->func.p = func; - ci->nresults = nret; - ci->callstatus = mask; - ci->top.p = top; - return ci; -} - - - -l_sinline int precallC (lua_State *L, StkId func, int nresults, - lua_CFunction f) { - int n; - CallInfo *ci; - checkstackp(L, LUA_MINSTACK, func); - L->ci = ci = prepCallInfo(L, func, nresults, CIST_C, - L->top.p + LUA_MINSTACK); - lua_assert(ci->top.p <= L->stack_last.p); - if (l_unlikely(L->hookmask & LUA_MASKCALL)) { - int narg = cast_int(L->top.p - func) - 1; - luaD_hook(L, LUA_HOOKCALL, -1, 1, narg); - } - lua_unlock(L); - n = (*f)(L); - lua_lock(L); - api_checknelems(L, n); - luaD_poscall(L, ci, n); - return n; -} - - - -int luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, - int narg1, int delta) { - retry: - switch (ttypetag(s2v(func))) { - case LUA_VCCL: - return precallC(L, func, LUA_MULTRET, clCvalue(s2v(func))->f); - case LUA_VLCF: - return precallC(L, func, LUA_MULTRET, fvalue(s2v(func))); - case LUA_VLCL: { - Proto *p = clLvalue(s2v(func))->p; - int fsize = p->maxstacksize; - int nfixparams = p->numparams; - int i; - checkstackp(L, fsize - delta, func); - ci->func.p -= delta; - for (i = 0; i < narg1; i++) - setobjs2s(L, ci->func.p + i, func + i); - func = ci->func.p; - for (; narg1 <= nfixparams; narg1++) - setnilvalue(s2v(func + narg1)); - ci->top.p = func + 1 + fsize; - lua_assert(ci->top.p <= L->stack_last.p); - ci->u.l.savedpc = p->code; - ci->callstatus |= CIST_TAIL; - L->top.p = func + narg1; - return -1; - } - default: { - func = tryfuncTM(L, func); - - narg1++; - goto retry; - } - } -} - - - -CallInfo *luaD_precall (lua_State *L, StkId func, int nresults) { - retry: - switch (ttypetag(s2v(func))) { - case LUA_VCCL: - precallC(L, func, nresults, clCvalue(s2v(func))->f); - return NULL; - case LUA_VLCF: - precallC(L, func, nresults, fvalue(s2v(func))); - return NULL; - case LUA_VLCL: { - CallInfo *ci; - Proto *p = clLvalue(s2v(func))->p; - int narg = cast_int(L->top.p - func) - 1; - int nfixparams = p->numparams; - int fsize = p->maxstacksize; - checkstackp(L, fsize, func); - L->ci = ci = prepCallInfo(L, func, nresults, 0, func + 1 + fsize); - ci->u.l.savedpc = p->code; - for (; narg < nfixparams; narg++) - setnilvalue(s2v(L->top.p++)); - lua_assert(ci->top.p <= L->stack_last.p); - return ci; - } - default: { - func = tryfuncTM(L, func); - - goto retry; - } - } -} - - - -l_sinline void ccall (lua_State *L, StkId func, int nResults, l_uint32 inc) { - CallInfo *ci; - L->nCcalls += inc; - if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) { - checkstackp(L, 0, func); - luaE_checkcstack(L); - } - if ((ci = luaD_precall(L, func, nResults)) != NULL) { - ci->callstatus = CIST_FRESH; - luaV_execute(L, ci); - } - L->nCcalls -= inc; -} - - - -void luaD_call (lua_State *L, StkId func, int nResults) { - ccall(L, func, nResults, 1); -} - - - -void luaD_callnoyield (lua_State *L, StkId func, int nResults) { - ccall(L, func, nResults, nyci); -} - - - -static int finishpcallk (lua_State *L, CallInfo *ci) { - int status = getcistrecst(ci); - if (l_likely(status == LUA_OK)) - status = LUA_YIELD; - else { - StkId func = restorestack(L, ci->u2.funcidx); - L->allowhook = getoah(ci->callstatus); - func = luaF_close(L, func, status, 1); - luaD_seterrorobj(L, status, func); - luaD_shrinkstack(L); - setcistrecst(ci, LUA_OK); - } - ci->callstatus &= ~CIST_YPCALL; - L->errfunc = ci->u.c.old_errfunc; - - return status; -} - - - -static void finishCcall (lua_State *L, CallInfo *ci) { - int n; - if (ci->callstatus & CIST_CLSRET) { - lua_assert(hastocloseCfunc(ci->nresults)); - n = ci->u2.nres; - - } - else { - int status = LUA_YIELD; - - lua_assert(ci->u.c.k != NULL && yieldable(L)); - if (ci->callstatus & CIST_YPCALL) - status = finishpcallk(L, ci); - adjustresults(L, LUA_MULTRET); - lua_unlock(L); - n = (*ci->u.c.k)(L, status, ci->u.c.ctx); - lua_lock(L); - api_checknelems(L, n); - } - luaD_poscall(L, ci, n); -} - - - -static void unroll (lua_State *L, void *ud) { - CallInfo *ci; - UNUSED(ud); - while ((ci = L->ci) != &L->base_ci) { - if (!isLua(ci)) - finishCcall(L, ci); - else { - luaV_finishOp(L); - luaV_execute(L, ci); - } - } -} - - - -static CallInfo *findpcall (lua_State *L) { - CallInfo *ci; - for (ci = L->ci; ci != NULL; ci = ci->previous) { - if (ci->callstatus & CIST_YPCALL) - return ci; - } - return NULL; -} - - - -static int resume_error (lua_State *L, const char *msg, int narg) { - api_checkpop(L, narg); - L->top.p -= narg; - setsvalue2s(L, L->top.p, luaS_new(L, msg)); - api_incr_top(L); - lua_unlock(L); - return LUA_ERRRUN; -} - - - -static void resume (lua_State *L, void *ud) { - int n = *(cast(int*, ud)); - StkId firstArg = L->top.p - n; - CallInfo *ci = L->ci; - if (L->status == LUA_OK) - ccall(L, firstArg - 1, LUA_MULTRET, 0); - else { - lua_assert(L->status == LUA_YIELD); - L->status = LUA_OK; - if (isLua(ci)) { - - lua_assert(ci->callstatus & CIST_HOOKYIELD); - ci->u.l.savedpc--; - L->top.p = firstArg; - luaV_execute(L, ci); - } - else { - if (ci->u.c.k != NULL) { - lua_unlock(L); - n = (*ci->u.c.k)(L, LUA_YIELD, ci->u.c.ctx); - lua_lock(L); - api_checknelems(L, n); - } - luaD_poscall(L, ci, n); - } - unroll(L, NULL); - } -} - - - -static int precover (lua_State *L, int status) { - CallInfo *ci; - while (errorstatus(status) && (ci = findpcall(L)) != NULL) { - L->ci = ci; - setcistrecst(ci, status); - status = luaD_rawrunprotected(L, unroll, NULL); - } - return status; -} - - -LUA_API int lua_resume (lua_State *L, lua_State *from, int nargs, - int *nresults) { - int status; - lua_lock(L); - if (L->status == LUA_OK) { - if (L->ci != &L->base_ci) - return resume_error(L, "cannot resume non-suspended coroutine", nargs); - else if (L->top.p - (L->ci->func.p + 1) == nargs) - return resume_error(L, "cannot resume dead coroutine", nargs); - } - else if (L->status != LUA_YIELD) - return resume_error(L, "cannot resume dead coroutine", nargs); - L->nCcalls = (from) ? getCcalls(from) : 0; - if (getCcalls(L) >= LUAI_MAXCCALLS) - return resume_error(L, "C stack overflow", nargs); - L->nCcalls++; - luai_userstateresume(L, nargs); - api_checkpop(L, (L->status == LUA_OK) ? nargs + 1 : nargs); - status = luaD_rawrunprotected(L, resume, &nargs); - - status = precover(L, status); - if (l_likely(!errorstatus(status))) - lua_assert(status == L->status); - else { - L->status = cast_byte(status); - luaD_seterrorobj(L, status, L->top.p); - L->ci->top.p = L->top.p; - } - *nresults = (status == LUA_YIELD) ? L->ci->u2.nyield - : cast_int(L->top.p - (L->ci->func.p + 1)); - lua_unlock(L); - return status; -} - - -LUA_API int lua_isyieldable (lua_State *L) { - return yieldable(L); -} - - -LUA_API int lua_yieldk (lua_State *L, int nresults, lua_KContext ctx, - lua_KFunction k) { - CallInfo *ci; - luai_userstateyield(L, nresults); - lua_lock(L); - ci = L->ci; - api_checkpop(L, nresults); - if (l_unlikely(!yieldable(L))) { - if (L != G(L)->mainthread) - luaG_runerror(L, "attempt to yield across a C-call boundary"); - else - luaG_runerror(L, "attempt to yield from outside a coroutine"); - } - L->status = LUA_YIELD; - ci->u2.nyield = nresults; - if (isLua(ci)) { - lua_assert(!isLuacode(ci)); - api_check(L, nresults == 0, "hooks cannot yield values"); - api_check(L, k == NULL, "hooks cannot continue after yielding"); - } - else { - if ((ci->u.c.k = k) != NULL) - ci->u.c.ctx = ctx; - luaD_throw(L, LUA_YIELD); - } - lua_assert(ci->callstatus & CIST_HOOKED); - lua_unlock(L); - return 0; -} - - - -struct CloseP { - StkId level; - int status; -}; - - - -static void closepaux (lua_State *L, void *ud) { - struct CloseP *pcl = cast(struct CloseP *, ud); - luaF_close(L, pcl->level, pcl->status, 0); -} - - - -int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status) { - CallInfo *old_ci = L->ci; - lu_byte old_allowhooks = L->allowhook; - for (;;) { - struct CloseP pcl; - pcl.level = restorestack(L, level); pcl.status = status; - status = luaD_rawrunprotected(L, &closepaux, &pcl); - if (l_likely(status == LUA_OK)) - return pcl.status; - else { - L->ci = old_ci; - L->allowhook = old_allowhooks; - } - } -} - - - -int luaD_pcall (lua_State *L, Pfunc func, void *u, - ptrdiff_t old_top, ptrdiff_t ef) { - int status; - CallInfo *old_ci = L->ci; - lu_byte old_allowhooks = L->allowhook; - ptrdiff_t old_errfunc = L->errfunc; - L->errfunc = ef; - status = luaD_rawrunprotected(L, func, u); - if (l_unlikely(status != LUA_OK)) { - L->ci = old_ci; - L->allowhook = old_allowhooks; - status = luaD_closeprotected(L, old_top, status); - luaD_seterrorobj(L, status, restorestack(L, old_top)); - luaD_shrinkstack(L); - } - L->errfunc = old_errfunc; - return status; -} - - - - -struct SParser { - ZIO *z; - Mbuffer buff; - Dyndata dyd; - const char *mode; - const char *name; -}; - - -static void checkmode (lua_State *L, const char *mode, const char *x) { - if (strchr(mode, x[0]) == NULL) { - luaO_pushfstring(L, - "attempt to load a %s chunk (mode is '%s')", x, mode); - luaD_throw(L, LUA_ERRSYNTAX); - } -} - - -static void f_parser (lua_State *L, void *ud) { - LClosure *cl; - struct SParser *p = cast(struct SParser *, ud); - const char *mode = p->mode ? p->mode : "bt"; - int c = zgetc(p->z); - if (c == LUA_SIGNATURE[0]) { - int fixed = 0; - if (strchr(mode, 'B') != NULL) - fixed = 1; - else - checkmode(L, mode, "binary"); - cl = luaU_undump(L, p->z, p->name, fixed); - } - else { - checkmode(L, mode, "text"); - cl = luaY_parser(L, p->z, &p->buff, &p->dyd, p->name, c); - } - lua_assert(cl->nupvalues == cl->p->sizeupvalues); - luaF_initupvals(L, cl); -} - - -int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, - const char *mode) { - struct SParser p; - int status; - incnny(L); - p.z = z; p.name = name; p.mode = mode; - p.dyd.actvar.arr = NULL; p.dyd.actvar.size = 0; - p.dyd.gt.arr = NULL; p.dyd.gt.size = 0; - p.dyd.label.arr = NULL; p.dyd.label.size = 0; - luaZ_initbuffer(L, &p.buff); - status = luaD_pcall(L, f_parser, &p, savestack(L, L->top.p), L->errfunc); - luaZ_freebuffer(L, &p.buff); - luaM_freearray(L, p.dyd.actvar.arr, p.dyd.actvar.size); - luaM_freearray(L, p.dyd.gt.arr, p.dyd.gt.size); - luaM_freearray(L, p.dyd.label.arr, p.dyd.label.size); - decnny(L); - return status; -} - - - - -//path: src/dependencies/lua/lvm.c - - -#define lvm_c -#define LUA_CORE - - - - -#include -#include -#include -#include -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -#if !defined(LUA_USE_JUMPTABLE) -#if defined(__GNUC__) -#define LUA_USE_JUMPTABLE 1 -#else -#define LUA_USE_JUMPTABLE 0 -#endif -#endif - - - - -#define MAXTAGLOOP 2000 - - - - - -#define NBM (l_floatatt(MANT_DIG)) - - -#if ((((LUA_MAXINTEGER >> (NBM / 4)) >> (NBM / 4)) >> (NBM / 4)) \ - >> (NBM - (3 * (NBM / 4)))) > 0 - - -#define MAXINTFITSF ((lua_Unsigned)1 << NBM) - - -#define l_intfitsf(i) ((MAXINTFITSF + l_castS2U(i)) <= (2 * MAXINTFITSF)) - -#else - -#define l_intfitsf(i) 1 - -#endif - - - -static int l_strton (const TValue *obj, TValue *result) { - lua_assert(obj != result); - if (!cvt2num(obj)) - return 0; - else { - TString *st = tsvalue(obj); - size_t stlen; - const char *s = getlstr(st, stlen); - return (luaO_str2num(s, result) == stlen + 1); - } -} - - - -int luaV_tonumber_ (const TValue *obj, lua_Number *n) { - TValue v; - if (ttisinteger(obj)) { - *n = cast_num(ivalue(obj)); - return 1; - } - else if (l_strton(obj, &v)) { - *n = nvalue(&v); - return 1; - } - else - return 0; -} - - - -int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode) { - lua_Number f = l_floor(n); - if (n != f) { - if (mode == F2Ieq) return 0; - else if (mode == F2Iceil) - f += 1; - } - return lua_numbertointeger(f, p); -} - - - -int luaV_tointegerns (const TValue *obj, lua_Integer *p, F2Imod mode) { - if (ttisfloat(obj)) - return luaV_flttointeger(fltvalue(obj), p, mode); - else if (ttisinteger(obj)) { - *p = ivalue(obj); - return 1; - } - else - return 0; -} - - - -int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode) { - TValue v; - if (l_strton(obj, &v)) - obj = &v; - return luaV_tointegerns(obj, p, mode); -} - - - -static int forlimit (lua_State *L, lua_Integer init, const TValue *lim, - lua_Integer *p, lua_Integer step) { - if (!luaV_tointeger(lim, p, (step < 0 ? F2Iceil : F2Ifloor))) { - - lua_Number flim; - if (!tonumber(lim, &flim)) - luaG_forerror(L, lim, "limit"); - - if (luai_numlt(0, flim)) { - if (step < 0) return 1; - *p = LUA_MAXINTEGER; - } - else { - if (step > 0) return 1; - *p = LUA_MININTEGER; - } - } - return (step > 0 ? init > *p : init < *p); -} - - - -static int forprep (lua_State *L, StkId ra) { - TValue *pinit = s2v(ra); - TValue *plimit = s2v(ra + 1); - TValue *pstep = s2v(ra + 2); - if (ttisinteger(pinit) && ttisinteger(pstep)) { - lua_Integer init = ivalue(pinit); - lua_Integer step = ivalue(pstep); - lua_Integer limit; - if (step == 0) - luaG_runerror(L, "'for' step is zero"); - if (forlimit(L, init, plimit, &limit, step)) - return 1; - else { - lua_Unsigned count; - if (step > 0) { - count = l_castS2U(limit) - l_castS2U(init); - if (step != 1) - count /= l_castS2U(step); - } - else { - count = l_castS2U(init) - l_castS2U(limit); - - count /= l_castS2U(-(step + 1)) + 1u; - } - - chgivalue(s2v(ra), l_castU2S(count)); - setivalue(s2v(ra + 1), step); - chgivalue(s2v(ra + 2), init); - } - } - else { - lua_Number init; lua_Number limit; lua_Number step; - if (l_unlikely(!tonumber(plimit, &limit))) - luaG_forerror(L, plimit, "limit"); - if (l_unlikely(!tonumber(pstep, &step))) - luaG_forerror(L, pstep, "step"); - if (l_unlikely(!tonumber(pinit, &init))) - luaG_forerror(L, pinit, "initial value"); - if (step == 0) - luaG_runerror(L, "'for' step is zero"); - if (luai_numlt(0, step) ? luai_numlt(limit, init) - : luai_numlt(init, limit)) - return 1; - else { - - setfltvalue(s2v(ra), limit); - setfltvalue(s2v(ra + 1), step); - setfltvalue(s2v(ra + 2), init); - } - } - return 0; -} - - - -static int floatforloop (StkId ra) { - lua_Number step = fltvalue(s2v(ra + 1)); - lua_Number limit = fltvalue(s2v(ra)); - lua_Number idx = fltvalue(s2v(ra + 2)); - idx = luai_numadd(L, idx, step); - if (luai_numlt(0, step) ? luai_numle(idx, limit) - : luai_numle(limit, idx)) { - chgfltvalue(s2v(ra + 2), idx); - return 1; - } - else - return 0; -} - - - -int luaV_finishget (lua_State *L, const TValue *t, TValue *key, StkId val, - int tag) { - int loop; - const TValue *tm; - for (loop = 0; loop < MAXTAGLOOP; loop++) { - if (tag == LUA_VNOTABLE) { - lua_assert(!ttistable(t)); - tm = luaT_gettmbyobj(L, t, TM_INDEX); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, t, "index"); - - } - else { - tm = fasttm(L, hvalue(t)->metatable, TM_INDEX); - if (tm == NULL) { - setnilvalue(s2v(val)); - return LUA_VNIL; - } - - } - if (ttisfunction(tm)) { - tag = luaT_callTMres(L, tm, t, key, val); - return tag; - } - t = tm; - luaV_fastget(t, key, s2v(val), luaH_get, tag); - if (!tagisempty(tag)) - return tag; - - } - luaG_runerror(L, "'__index' chain too long; possible loop"); - return 0; -} - - - -void luaV_finishset (lua_State *L, const TValue *t, TValue *key, - TValue *val, int hres) { - int loop; - for (loop = 0; loop < MAXTAGLOOP; loop++) { - const TValue *tm; - if (hres != HNOTATABLE) { - Table *h = hvalue(t); - tm = fasttm(L, h->metatable, TM_NEWINDEX); - if (tm == NULL) { - luaH_finishset(L, h, key, val, hres); - invalidateTMcache(h); - luaC_barrierback(L, obj2gco(h), val); - return; - } - - } - else { - tm = luaT_gettmbyobj(L, t, TM_NEWINDEX); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, t, "index"); - } - - if (ttisfunction(tm)) { - luaT_callTM(L, tm, t, key, val); - return; - } - t = tm; - luaV_fastset(t, key, val, hres, luaH_pset); - if (hres == HOK) - return; - - } - luaG_runerror(L, "'__newindex' chain too long; possible loop"); -} - - - -static int l_strcmp (const TString *ts1, const TString *ts2) { - size_t rl1; - const char *s1 = getlstr(ts1, rl1); - size_t rl2; - const char *s2 = getlstr(ts2, rl2); - for (;;) { - int temp = strcoll(s1, s2); - if (temp != 0) - return temp; - else { - size_t zl1 = strlen(s1); - size_t zl2 = strlen(s2); - if (zl2 == rl2) - return (zl1 == rl1) ? 0 : 1; - else if (zl1 == rl1) - return -1; - - zl1++; zl2++; - s1 += zl1; rl1 -= zl1; s2 += zl2; rl2 -= zl2; - } - } -} - - - -l_sinline int LTintfloat (lua_Integer i, lua_Number f) { - if (l_intfitsf(i)) - return luai_numlt(cast_num(i), f); - else { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Iceil)) - return i < fi; - else - return f > 0; - } -} - - - -l_sinline int LEintfloat (lua_Integer i, lua_Number f) { - if (l_intfitsf(i)) - return luai_numle(cast_num(i), f); - else { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ifloor)) - return i <= fi; - else - return f > 0; - } -} - - - -l_sinline int LTfloatint (lua_Number f, lua_Integer i) { - if (l_intfitsf(i)) - return luai_numlt(f, cast_num(i)); - else { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ifloor)) - return fi < i; - else - return f < 0; - } -} - - - -l_sinline int LEfloatint (lua_Number f, lua_Integer i) { - if (l_intfitsf(i)) - return luai_numle(f, cast_num(i)); - else { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Iceil)) - return fi <= i; - else - return f < 0; - } -} - - - -l_sinline int LTnum (const TValue *l, const TValue *r) { - lua_assert(ttisnumber(l) && ttisnumber(r)); - if (ttisinteger(l)) { - lua_Integer li = ivalue(l); - if (ttisinteger(r)) - return li < ivalue(r); - else - return LTintfloat(li, fltvalue(r)); - } - else { - lua_Number lf = fltvalue(l); - if (ttisfloat(r)) - return luai_numlt(lf, fltvalue(r)); - else - return LTfloatint(lf, ivalue(r)); - } -} - - - -l_sinline int LEnum (const TValue *l, const TValue *r) { - lua_assert(ttisnumber(l) && ttisnumber(r)); - if (ttisinteger(l)) { - lua_Integer li = ivalue(l); - if (ttisinteger(r)) - return li <= ivalue(r); - else - return LEintfloat(li, fltvalue(r)); - } - else { - lua_Number lf = fltvalue(l); - if (ttisfloat(r)) - return luai_numle(lf, fltvalue(r)); - else - return LEfloatint(lf, ivalue(r)); - } -} - - - -static int lessthanothers (lua_State *L, const TValue *l, const TValue *r) { - lua_assert(!ttisnumber(l) || !ttisnumber(r)); - if (ttisstring(l) && ttisstring(r)) - return l_strcmp(tsvalue(l), tsvalue(r)) < 0; - else - return luaT_callorderTM(L, l, r, TM_LT); -} - - - -int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) { - if (ttisnumber(l) && ttisnumber(r)) - return LTnum(l, r); - else return lessthanothers(L, l, r); -} - - - -static int lessequalothers (lua_State *L, const TValue *l, const TValue *r) { - lua_assert(!ttisnumber(l) || !ttisnumber(r)); - if (ttisstring(l) && ttisstring(r)) - return l_strcmp(tsvalue(l), tsvalue(r)) <= 0; - else - return luaT_callorderTM(L, l, r, TM_LE); -} - - - -int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r) { - if (ttisnumber(l) && ttisnumber(r)) - return LEnum(l, r); - else return lessequalothers(L, l, r); -} - - - -int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2) { - const TValue *tm; - if (ttypetag(t1) != ttypetag(t2)) { - if (ttype(t1) != ttype(t2) || ttype(t1) != LUA_TNUMBER) - return 0; - else { - - lua_Integer i1, i2; - return (luaV_tointegerns(t1, &i1, F2Ieq) && - luaV_tointegerns(t2, &i2, F2Ieq) && - i1 == i2); - } - } - - switch (ttypetag(t1)) { - case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: return 1; - case LUA_VNUMINT: return (ivalue(t1) == ivalue(t2)); - case LUA_VNUMFLT: return luai_numeq(fltvalue(t1), fltvalue(t2)); - case LUA_VLIGHTUSERDATA: return pvalue(t1) == pvalue(t2); - case LUA_VLCF: return fvalue(t1) == fvalue(t2); - case LUA_VSHRSTR: return eqshrstr(tsvalue(t1), tsvalue(t2)); - case LUA_VLNGSTR: return luaS_eqlngstr(tsvalue(t1), tsvalue(t2)); - case LUA_VUSERDATA: { - if (uvalue(t1) == uvalue(t2)) return 1; - else if (L == NULL) return 0; - tm = fasttm(L, uvalue(t1)->metatable, TM_EQ); - if (tm == NULL) - tm = fasttm(L, uvalue(t2)->metatable, TM_EQ); - break; - } - case LUA_VTABLE: { - if (hvalue(t1) == hvalue(t2)) return 1; - else if (L == NULL) return 0; - tm = fasttm(L, hvalue(t1)->metatable, TM_EQ); - if (tm == NULL) - tm = fasttm(L, hvalue(t2)->metatable, TM_EQ); - break; - } - default: - return gcvalue(t1) == gcvalue(t2); - } - if (tm == NULL) - return 0; - else { - int tag = luaT_callTMres(L, tm, t1, t2, L->top.p); - return !tagisfalse(tag); - } -} - - - -#define tostring(L,o) \ - (ttisstring(o) || (cvt2str(o) && (luaO_tostring(L, o), 1))) - -#define isemptystr(o) (ttisshrstring(o) && tsvalue(o)->shrlen == 0) - - -static void copy2buff (StkId top, int n, char *buff) { - size_t tl = 0; - do { - TString *st = tsvalue(s2v(top - n)); - size_t l; - const char *s = getlstr(st, l); - memcpy(buff + tl, s, l * sizeof(char)); - tl += l; - } while (--n > 0); -} - - - -void luaV_concat (lua_State *L, int total) { - if (total == 1) - return; - do { - StkId top = L->top.p; - int n = 2; - if (!(ttisstring(s2v(top - 2)) || cvt2str(s2v(top - 2))) || - !tostring(L, s2v(top - 1))) - luaT_tryconcatTM(L); - else if (isemptystr(s2v(top - 1))) - cast_void(tostring(L, s2v(top - 2))); - else if (isemptystr(s2v(top - 2))) { - setobjs2s(L, top - 2, top - 1); - } - else { - - size_t tl = tsslen(tsvalue(s2v(top - 1))); - TString *ts; - - for (n = 1; n < total && tostring(L, s2v(top - n - 1)); n++) { - size_t l = tsslen(tsvalue(s2v(top - n - 1))); - if (l_unlikely(l >= MAX_SIZE - sizeof(TString) - tl)) { - L->top.p = top - total; - luaG_runerror(L, "string length overflow"); - } - tl += l; - } - if (tl <= LUAI_MAXSHORTLEN) { - char buff[LUAI_MAXSHORTLEN]; - copy2buff(top, n, buff); - ts = luaS_newlstr(L, buff, tl); - } - else { - ts = luaS_createlngstrobj(L, tl); - copy2buff(top, n, getlngstr(ts)); - } - setsvalue2s(L, top - n, ts); - } - total -= n - 1; - L->top.p -= n - 1; - } while (total > 1); -} - - - -void luaV_objlen (lua_State *L, StkId ra, const TValue *rb) { - const TValue *tm; - switch (ttypetag(rb)) { - case LUA_VTABLE: { - Table *h = hvalue(rb); - tm = fasttm(L, h->metatable, TM_LEN); - if (tm) break; - setivalue(s2v(ra), luaH_getn(h)); - return; - } - case LUA_VSHRSTR: { - setivalue(s2v(ra), tsvalue(rb)->shrlen); - return; - } - case LUA_VLNGSTR: { - setivalue(s2v(ra), tsvalue(rb)->u.lnglen); - return; - } - default: { - tm = luaT_gettmbyobj(L, rb, TM_LEN); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, rb, "get length of"); - break; - } - } - luaT_callTMres(L, tm, rb, rb, ra); -} - - - -lua_Integer luaV_idiv (lua_State *L, lua_Integer m, lua_Integer n) { - if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { - if (n == 0) - luaG_runerror(L, "attempt to divide by zero"); - return intop(-, 0, m); - } - else { - lua_Integer q = m / n; - if ((m ^ n) < 0 && m % n != 0) - q -= 1; - return q; - } -} - - - -lua_Integer luaV_mod (lua_State *L, lua_Integer m, lua_Integer n) { - if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { - if (n == 0) - luaG_runerror(L, "attempt to perform 'n%%0'"); - return 0; - } - else { - lua_Integer r = m % n; - if (r != 0 && (r ^ n) < 0) - r += n; - return r; - } -} - - - -lua_Number luaV_modf (lua_State *L, lua_Number m, lua_Number n) { - lua_Number r; - luai_nummod(L, m, n, r); - return r; -} - - - -#define NBITS cast_int(sizeof(lua_Integer) * CHAR_BIT) - - - -lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y) { - if (y < 0) { - if (y <= -NBITS) return 0; - else return intop(>>, x, -y); - } - else { - if (y >= NBITS) return 0; - else return intop(<<, x, y); - } -} - - - -static void pushclosure (lua_State *L, Proto *p, UpVal **encup, StkId base, - StkId ra) { - int nup = p->sizeupvalues; - Upvaldesc *uv = p->upvalues; - int i; - LClosure *ncl = luaF_newLclosure(L, nup); - ncl->p = p; - setclLvalue2s(L, ra, ncl); - for (i = 0; i < nup; i++) { - if (uv[i].instack) - ncl->upvals[i] = luaF_findupval(L, base + uv[i].idx); - else - ncl->upvals[i] = encup[uv[i].idx]; - luaC_objbarrier(L, ncl, ncl->upvals[i]); - } -} - - - -void luaV_finishOp (lua_State *L) { - CallInfo *ci = L->ci; - StkId base = ci->func.p + 1; - Instruction inst = *(ci->u.l.savedpc - 1); - OpCode op = GET_OPCODE(inst); - switch (op) { - case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { - setobjs2s(L, base + GETARG_A(*(ci->u.l.savedpc - 2)), --L->top.p); - break; - } - case OP_UNM: case OP_BNOT: case OP_LEN: - case OP_GETTABUP: case OP_GETTABLE: case OP_GETI: - case OP_GETFIELD: case OP_SELF: { - setobjs2s(L, base + GETARG_A(inst), --L->top.p); - break; - } - case OP_LT: case OP_LE: - case OP_LTI: case OP_LEI: - case OP_GTI: case OP_GEI: - case OP_EQ: { - int res = !l_isfalse(s2v(L->top.p - 1)); - L->top.p--; -#if defined(LUA_COMPAT_LT_LE) - if (ci->callstatus & CIST_LEQ) { - ci->callstatus ^= CIST_LEQ; - res = !res; - } -#endif - lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_JMP); - if (res != GETARG_k(inst)) - ci->u.l.savedpc++; - break; - } - case OP_CONCAT: { - StkId top = L->top.p - 1; - int a = GETARG_A(inst); - int total = cast_int(top - 1 - (base + a)); - setobjs2s(L, top - 2, top); - L->top.p = top - 1; - luaV_concat(L, total); - break; - } - case OP_CLOSE: { - ci->u.l.savedpc--; - break; - } - case OP_RETURN: { - StkId ra = base + GETARG_A(inst); - - L->top.p = ra + ci->u2.nres; - - ci->u.l.savedpc--; - break; - } - default: { - - lua_assert(op == OP_TFORCALL || op == OP_CALL || - op == OP_TAILCALL || op == OP_SETTABUP || op == OP_SETTABLE || - op == OP_SETI || op == OP_SETFIELD); - break; - } - } -} - - - - - - -#define l_addi(L,a,b) intop(+, a, b) -#define l_subi(L,a,b) intop(-, a, b) -#define l_muli(L,a,b) intop(*, a, b) -#define l_band(a,b) intop(&, a, b) -#define l_bor(a,b) intop(|, a, b) -#define l_bxor(a,b) intop(^, a, b) - -#define l_lti(a,b) (a < b) -#define l_lei(a,b) (a <= b) -#define l_gti(a,b) (a > b) -#define l_gei(a,b) (a >= b) - - - -#define op_arithI(L,iop,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - int imm = GETARG_sC(i); \ - if (ttisinteger(v1)) { \ - lua_Integer iv1 = ivalue(v1); \ - pc++; setivalue(s2v(ra), iop(L, iv1, imm)); \ - } \ - else if (ttisfloat(v1)) { \ - lua_Number nb = fltvalue(v1); \ - lua_Number fimm = cast_num(imm); \ - pc++; setfltvalue(s2v(ra), fop(L, nb, fimm)); \ - }} - - - -#define op_arithf_aux(L,v1,v2,fop) { \ - lua_Number n1; lua_Number n2; \ - if (tonumberns(v1, n1) && tonumberns(v2, n2)) { \ - pc++; setfltvalue(s2v(ra), fop(L, n1, n2)); \ - }} - - - -#define op_arithf(L,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - op_arithf_aux(L, v1, v2, fop); } - - - -#define op_arithfK(L,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ - op_arithf_aux(L, v1, v2, fop); } - - - -#define op_arith_aux(L,v1,v2,iop,fop) { \ - StkId ra = RA(i); \ - if (ttisinteger(v1) && ttisinteger(v2)) { \ - lua_Integer i1 = ivalue(v1); lua_Integer i2 = ivalue(v2); \ - pc++; setivalue(s2v(ra), iop(L, i1, i2)); \ - } \ - else op_arithf_aux(L, v1, v2, fop); } - - - -#define op_arith(L,iop,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - op_arith_aux(L, v1, v2, iop, fop); } - - - -#define op_arithK(L,iop,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ - op_arith_aux(L, v1, v2, iop, fop); } - - - -#define op_bitwiseK(L,op) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); \ - lua_Integer i1; \ - lua_Integer i2 = ivalue(v2); \ - if (tointegerns(v1, &i1)) { \ - pc++; setivalue(s2v(ra), op(i1, i2)); \ - }} - - - -#define op_bitwise(L,op) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - lua_Integer i1; lua_Integer i2; \ - if (tointegerns(v1, &i1) && tointegerns(v2, &i2)) { \ - pc++; setivalue(s2v(ra), op(i1, i2)); \ - }} - - - -#define op_order(L,opi,opn,other) { \ - StkId ra = RA(i); \ - int cond; \ - TValue *rb = vRB(i); \ - if (ttisinteger(s2v(ra)) && ttisinteger(rb)) { \ - lua_Integer ia = ivalue(s2v(ra)); \ - lua_Integer ib = ivalue(rb); \ - cond = opi(ia, ib); \ - } \ - else if (ttisnumber(s2v(ra)) && ttisnumber(rb)) \ - cond = opn(s2v(ra), rb); \ - else \ - Protect(cond = other(L, s2v(ra), rb)); \ - docondjump(); } - - - -#define op_orderI(L,opi,opf,inv,tm) { \ - StkId ra = RA(i); \ - int cond; \ - int im = GETARG_sB(i); \ - if (ttisinteger(s2v(ra))) \ - cond = opi(ivalue(s2v(ra)), im); \ - else if (ttisfloat(s2v(ra))) { \ - lua_Number fa = fltvalue(s2v(ra)); \ - lua_Number fim = cast_num(im); \ - cond = opf(fa, fim); \ - } \ - else { \ - int isf = GETARG_C(i); \ - Protect(cond = luaT_callorderiTM(L, s2v(ra), im, inv, isf, tm)); \ - } \ - docondjump(); } - - - - - - - - - -#define RA(i) (base+GETARG_A(i)) -#define RB(i) (base+GETARG_B(i)) -#define vRB(i) s2v(RB(i)) -#define KB(i) (k+GETARG_B(i)) -#define RC(i) (base+GETARG_C(i)) -#define vRC(i) s2v(RC(i)) -#define KC(i) (k+GETARG_C(i)) -#define RKC(i) ((TESTARG_k(i)) ? k + GETARG_C(i) : s2v(base + GETARG_C(i))) - - - -#define updatetrap(ci) (trap = ci->u.l.trap) - -#define updatebase(ci) (base = ci->func.p + 1) - - -#define updatestack(ci) \ - { if (l_unlikely(trap)) { updatebase(ci); ra = RA(i); } } - - - -#define dojump(ci,i,e) { pc += GETARG_sJ(i) + e; updatetrap(ci); } - - - -#define donextjump(ci) { Instruction ni = *pc; dojump(ci, ni, 1); } - - -#define docondjump() if (cond != GETARG_k(i)) pc++; else donextjump(ci); - - - -#define savepc(L) (ci->u.l.savedpc = pc) - - - -#define savestate(L,ci) (savepc(L), L->top.p = ci->top.p) - - - -#define Protect(exp) (savestate(L,ci), (exp), updatetrap(ci)) - - -#define ProtectNT(exp) (savepc(L), (exp), updatetrap(ci)) - - -#define halfProtect(exp) (savestate(L,ci), (exp)) - - -#define checkGC(L,c) \ - { luaC_condGC(L, (savepc(L), L->top.p = (c)), \ - updatetrap(ci)); \ - luai_threadyield(L); } - - - -#define vmfetch() { \ - if (l_unlikely(trap)) { \ - trap = luaG_traceexec(L, pc); \ - updatebase(ci); \ - } \ - i = *(pc++); \ -} - -#define vmdispatch(o) switch(o) -#define vmcase(l) case l: -#define vmbreak break - - -void luaV_execute (lua_State *L, CallInfo *ci) { - LClosure *cl; - TValue *k; - StkId base; - const Instruction *pc; - int trap; -#if LUA_USE_JUMPTABLE -//path: src/dependencies/lua/ljumptab.h - - - -#undef vmdispatch -#undef vmcase -#undef vmbreak - -#define vmdispatch(x) goto *disptab[x]; - -#define vmcase(l) L_##l: - -#define vmbreak vmfetch(); vmdispatch(GET_OPCODE(i)); - - -static const void *const disptab[NUM_OPCODES] = { - -#if 0 -** you can update the following list with this command: -** -** sed -n '/^OP_/\!d; s/OP_/\&\&L_OP_/ ; s/,.*/,/ ; s/\/.*// ; p' lopcodes.h -** -#endif - -&&L_OP_MOVE, -&&L_OP_LOADI, -&&L_OP_LOADF, -&&L_OP_LOADK, -&&L_OP_LOADKX, -&&L_OP_LOADFALSE, -&&L_OP_LFALSESKIP, -&&L_OP_LOADTRUE, -&&L_OP_LOADNIL, -&&L_OP_GETUPVAL, -&&L_OP_SETUPVAL, -&&L_OP_GETTABUP, -&&L_OP_GETTABLE, -&&L_OP_GETI, -&&L_OP_GETFIELD, -&&L_OP_SETTABUP, -&&L_OP_SETTABLE, -&&L_OP_SETI, -&&L_OP_SETFIELD, -&&L_OP_NEWTABLE, -&&L_OP_SELF, -&&L_OP_ADDI, -&&L_OP_ADDK, -&&L_OP_SUBK, -&&L_OP_MULK, -&&L_OP_MODK, -&&L_OP_POWK, -&&L_OP_DIVK, -&&L_OP_IDIVK, -&&L_OP_BANDK, -&&L_OP_BORK, -&&L_OP_BXORK, -&&L_OP_SHRI, -&&L_OP_SHLI, -&&L_OP_ADD, -&&L_OP_SUB, -&&L_OP_MUL, -&&L_OP_MOD, -&&L_OP_POW, -&&L_OP_DIV, -&&L_OP_IDIV, -&&L_OP_BAND, -&&L_OP_BOR, -&&L_OP_BXOR, -&&L_OP_SHL, -&&L_OP_SHR, -&&L_OP_MMBIN, -&&L_OP_MMBINI, -&&L_OP_MMBINK, -&&L_OP_UNM, -&&L_OP_BNOT, -&&L_OP_NOT, -&&L_OP_LEN, -&&L_OP_CONCAT, -&&L_OP_CLOSE, -&&L_OP_TBC, -&&L_OP_JMP, -&&L_OP_EQ, -&&L_OP_LT, -&&L_OP_LE, -&&L_OP_EQK, -&&L_OP_EQI, -&&L_OP_LTI, -&&L_OP_LEI, -&&L_OP_GTI, -&&L_OP_GEI, -&&L_OP_TEST, -&&L_OP_TESTSET, -&&L_OP_CALL, -&&L_OP_TAILCALL, -&&L_OP_RETURN, -&&L_OP_RETURN0, -&&L_OP_RETURN1, -&&L_OP_FORLOOP, -&&L_OP_FORPREP, -&&L_OP_TFORPREP, -&&L_OP_TFORCALL, -&&L_OP_TFORLOOP, -&&L_OP_SETLIST, -&&L_OP_CLOSURE, -&&L_OP_VARARG, -&&L_OP_VARARGPREP, -&&L_OP_EXTRAARG - -}; - - -#endif - startfunc: - trap = L->hookmask; - returning: - cl = ci_func(ci); - k = cl->p->k; - pc = ci->u.l.savedpc; - if (l_unlikely(trap)) - trap = luaG_tracecall(L); - base = ci->func.p + 1; - - for (;;) { - Instruction i; - vmfetch(); - #if 0 - - printf("line: %d\n", luaG_getfuncline(cl->p, pcRel(pc, cl->p))); - #endif - lua_assert(base == ci->func.p + 1); - lua_assert(base <= L->top.p && L->top.p <= L->stack_last.p); - - lua_assert(isIT(i) || (cast_void(L->top.p = base), 1)); - vmdispatch (GET_OPCODE(i)) { - vmcase(OP_MOVE) { - StkId ra = RA(i); - setobjs2s(L, ra, RB(i)); - vmbreak; - } - vmcase(OP_LOADI) { - StkId ra = RA(i); - lua_Integer b = GETARG_sBx(i); - setivalue(s2v(ra), b); - vmbreak; - } - vmcase(OP_LOADF) { - StkId ra = RA(i); - int b = GETARG_sBx(i); - setfltvalue(s2v(ra), cast_num(b)); - vmbreak; - } - vmcase(OP_LOADK) { - StkId ra = RA(i); - TValue *rb = k + GETARG_Bx(i); - setobj2s(L, ra, rb); - vmbreak; - } - vmcase(OP_LOADKX) { - StkId ra = RA(i); - TValue *rb; - rb = k + GETARG_Ax(*pc); pc++; - setobj2s(L, ra, rb); - vmbreak; - } - vmcase(OP_LOADFALSE) { - StkId ra = RA(i); - setbfvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LFALSESKIP) { - StkId ra = RA(i); - setbfvalue(s2v(ra)); - pc++; - vmbreak; - } - vmcase(OP_LOADTRUE) { - StkId ra = RA(i); - setbtvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LOADNIL) { - StkId ra = RA(i); - int b = GETARG_B(i); - do { - setnilvalue(s2v(ra++)); - } while (b--); - vmbreak; - } - vmcase(OP_GETUPVAL) { - StkId ra = RA(i); - int b = GETARG_B(i); - setobj2s(L, ra, cl->upvals[b]->v.p); - vmbreak; - } - vmcase(OP_SETUPVAL) { - StkId ra = RA(i); - UpVal *uv = cl->upvals[GETARG_B(i)]; - setobj(L, uv->v.p, s2v(ra)); - luaC_barrier(L, uv, s2v(ra)); - vmbreak; - } - vmcase(OP_GETTABUP) { - StkId ra = RA(i); - TValue *upval = cl->upvals[GETARG_B(i)]->v.p; - TValue *rc = KC(i); - TString *key = tsvalue(rc); - int tag; - luaV_fastget(upval, key, s2v(ra), luaH_getshortstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, upval, rc, ra, tag)); - vmbreak; - } - vmcase(OP_GETTABLE) { - StkId ra = RA(i); - TValue *rb = vRB(i); - TValue *rc = vRC(i); - int tag; - if (ttisinteger(rc)) { - luaV_fastgeti(rb, ivalue(rc), s2v(ra), tag); - } - else - luaV_fastget(rb, rc, s2v(ra), luaH_get, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_GETI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int c = GETARG_C(i); - int tag; - luaV_fastgeti(rb, c, s2v(ra), tag); - if (tagisempty(tag)) { - TValue key; - setivalue(&key, c); - Protect(luaV_finishget(L, rb, &key, ra, tag)); - } - vmbreak; - } - vmcase(OP_GETFIELD) { - StkId ra = RA(i); - TValue *rb = vRB(i); - TValue *rc = KC(i); - TString *key = tsvalue(rc); - int tag; - luaV_fastget(rb, key, s2v(ra), luaH_getshortstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_SETTABUP) { - int hres; - TValue *upval = cl->upvals[GETARG_A(i)]->v.p; - TValue *rb = KB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rb); - luaV_fastset(upval, key, rc, hres, luaH_psetshortstr); - if (hres == HOK) - luaV_finishfastset(L, upval, rc); - else - Protect(luaV_finishset(L, upval, rb, rc, hres)); - vmbreak; - } - vmcase(OP_SETTABLE) { - StkId ra = RA(i); - int hres; - TValue *rb = vRB(i); - TValue *rc = RKC(i); - if (ttisinteger(rb)) { - luaV_fastseti(s2v(ra), ivalue(rb), rc, hres); - } - else { - luaV_fastset(s2v(ra), rb, rc, hres, luaH_pset); - } - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else - Protect(luaV_finishset(L, s2v(ra), rb, rc, hres)); - vmbreak; - } - vmcase(OP_SETI) { - StkId ra = RA(i); - int hres; - int b = GETARG_B(i); - TValue *rc = RKC(i); - luaV_fastseti(s2v(ra), b, rc, hres); - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else { - TValue key; - setivalue(&key, b); - Protect(luaV_finishset(L, s2v(ra), &key, rc, hres)); - } - vmbreak; - } - vmcase(OP_SETFIELD) { - StkId ra = RA(i); - int hres; - TValue *rb = KB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rb); - luaV_fastset(s2v(ra), key, rc, hres, luaH_psetshortstr); - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else - Protect(luaV_finishset(L, s2v(ra), rb, rc, hres)); - vmbreak; - } - vmcase(OP_NEWTABLE) { - StkId ra = RA(i); - int b = GETARG_B(i); - int c = GETARG_C(i); - Table *t; - if (b > 0) - b = 1 << (b - 1); - lua_assert((!TESTARG_k(i)) == (GETARG_Ax(*pc) == 0)); - if (TESTARG_k(i)) - c += GETARG_Ax(*pc) * (MAXARG_C + 1); - pc++; - L->top.p = ra + 1; - t = luaH_new(L); - sethvalue2s(L, ra, t); - if (b != 0 || c != 0) - luaH_resize(L, t, c, b); - checkGC(L, ra + 1); - vmbreak; - } - vmcase(OP_SELF) { - StkId ra = RA(i); - int tag; - TValue *rb = vRB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rc); - setobj2s(L, ra + 1, rb); - luaV_fastget(rb, key, s2v(ra), luaH_getstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_ADDI) { - op_arithI(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_ADDK) { - op_arithK(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_SUBK) { - op_arithK(L, l_subi, luai_numsub); - vmbreak; - } - vmcase(OP_MULK) { - op_arithK(L, l_muli, luai_nummul); - vmbreak; - } - vmcase(OP_MODK) { - savestate(L, ci); - op_arithK(L, luaV_mod, luaV_modf); - vmbreak; - } - vmcase(OP_POWK) { - op_arithfK(L, luai_numpow); - vmbreak; - } - vmcase(OP_DIVK) { - op_arithfK(L, luai_numdiv); - vmbreak; - } - vmcase(OP_IDIVK) { - savestate(L, ci); - op_arithK(L, luaV_idiv, luai_numidiv); - vmbreak; - } - vmcase(OP_BANDK) { - op_bitwiseK(L, l_band); - vmbreak; - } - vmcase(OP_BORK) { - op_bitwiseK(L, l_bor); - vmbreak; - } - vmcase(OP_BXORK) { - op_bitwiseK(L, l_bxor); - vmbreak; - } - vmcase(OP_SHRI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int ic = GETARG_sC(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - pc++; setivalue(s2v(ra), luaV_shiftl(ib, -ic)); - } - vmbreak; - } - vmcase(OP_SHLI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int ic = GETARG_sC(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - pc++; setivalue(s2v(ra), luaV_shiftl(ic, ib)); - } - vmbreak; - } - vmcase(OP_ADD) { - op_arith(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_SUB) { - op_arith(L, l_subi, luai_numsub); - vmbreak; - } - vmcase(OP_MUL) { - op_arith(L, l_muli, luai_nummul); - vmbreak; - } - vmcase(OP_MOD) { - savestate(L, ci); - op_arith(L, luaV_mod, luaV_modf); - vmbreak; - } - vmcase(OP_POW) { - op_arithf(L, luai_numpow); - vmbreak; - } - vmcase(OP_DIV) { - op_arithf(L, luai_numdiv); - vmbreak; - } - vmcase(OP_IDIV) { - savestate(L, ci); - op_arith(L, luaV_idiv, luai_numidiv); - vmbreak; - } - vmcase(OP_BAND) { - op_bitwise(L, l_band); - vmbreak; - } - vmcase(OP_BOR) { - op_bitwise(L, l_bor); - vmbreak; - } - vmcase(OP_BXOR) { - op_bitwise(L, l_bxor); - vmbreak; - } - vmcase(OP_SHR) { - op_bitwise(L, luaV_shiftr); - vmbreak; - } - vmcase(OP_SHL) { - op_bitwise(L, luaV_shiftl); - vmbreak; - } - vmcase(OP_MMBIN) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); - TValue *rb = vRB(i); - TMS tm = (TMS)GETARG_C(i); - StkId result = RA(pi); - lua_assert(OP_ADD <= GET_OPCODE(pi) && GET_OPCODE(pi) <= OP_SHR); - Protect(luaT_trybinTM(L, s2v(ra), rb, result, tm)); - vmbreak; - } - vmcase(OP_MMBINI) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); - int imm = GETARG_sB(i); - TMS tm = (TMS)GETARG_C(i); - int flip = GETARG_k(i); - StkId result = RA(pi); - Protect(luaT_trybiniTM(L, s2v(ra), imm, flip, result, tm)); - vmbreak; - } - vmcase(OP_MMBINK) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); - TValue *imm = KB(i); - TMS tm = (TMS)GETARG_C(i); - int flip = GETARG_k(i); - StkId result = RA(pi); - Protect(luaT_trybinassocTM(L, s2v(ra), imm, flip, result, tm)); - vmbreak; - } - vmcase(OP_UNM) { - StkId ra = RA(i); - TValue *rb = vRB(i); - lua_Number nb; - if (ttisinteger(rb)) { - lua_Integer ib = ivalue(rb); - setivalue(s2v(ra), intop(-, 0, ib)); - } - else if (tonumberns(rb, nb)) { - setfltvalue(s2v(ra), luai_numunm(L, nb)); - } - else - Protect(luaT_trybinTM(L, rb, rb, ra, TM_UNM)); - vmbreak; - } - vmcase(OP_BNOT) { - StkId ra = RA(i); - TValue *rb = vRB(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - setivalue(s2v(ra), intop(^, ~l_castS2U(0), ib)); - } - else - Protect(luaT_trybinTM(L, rb, rb, ra, TM_BNOT)); - vmbreak; - } - vmcase(OP_NOT) { - StkId ra = RA(i); - TValue *rb = vRB(i); - if (l_isfalse(rb)) - setbtvalue(s2v(ra)); - else - setbfvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LEN) { - StkId ra = RA(i); - Protect(luaV_objlen(L, ra, vRB(i))); - vmbreak; - } - vmcase(OP_CONCAT) { - StkId ra = RA(i); - int n = GETARG_B(i); - L->top.p = ra + n; - ProtectNT(luaV_concat(L, n)); - checkGC(L, L->top.p); - vmbreak; - } - vmcase(OP_CLOSE) { - StkId ra = RA(i); - Protect(luaF_close(L, ra, LUA_OK, 1)); - vmbreak; - } - vmcase(OP_TBC) { - StkId ra = RA(i); - - halfProtect(luaF_newtbcupval(L, ra)); - vmbreak; - } - vmcase(OP_JMP) { - dojump(ci, i, 0); - vmbreak; - } - vmcase(OP_EQ) { - StkId ra = RA(i); - int cond; - TValue *rb = vRB(i); - Protect(cond = luaV_equalobj(L, s2v(ra), rb)); - docondjump(); - vmbreak; - } - vmcase(OP_LT) { - op_order(L, l_lti, LTnum, lessthanothers); - vmbreak; - } - vmcase(OP_LE) { - op_order(L, l_lei, LEnum, lessequalothers); - vmbreak; - } - vmcase(OP_EQK) { - StkId ra = RA(i); - TValue *rb = KB(i); - - int cond = luaV_rawequalobj(s2v(ra), rb); - docondjump(); - vmbreak; - } - vmcase(OP_EQI) { - StkId ra = RA(i); - int cond; - int im = GETARG_sB(i); - if (ttisinteger(s2v(ra))) - cond = (ivalue(s2v(ra)) == im); - else if (ttisfloat(s2v(ra))) - cond = luai_numeq(fltvalue(s2v(ra)), cast_num(im)); - else - cond = 0; - docondjump(); - vmbreak; - } - vmcase(OP_LTI) { - op_orderI(L, l_lti, luai_numlt, 0, TM_LT); - vmbreak; - } - vmcase(OP_LEI) { - op_orderI(L, l_lei, luai_numle, 0, TM_LE); - vmbreak; - } - vmcase(OP_GTI) { - op_orderI(L, l_gti, luai_numgt, 1, TM_LT); - vmbreak; - } - vmcase(OP_GEI) { - op_orderI(L, l_gei, luai_numge, 1, TM_LE); - vmbreak; - } - vmcase(OP_TEST) { - StkId ra = RA(i); - int cond = !l_isfalse(s2v(ra)); - docondjump(); - vmbreak; - } - vmcase(OP_TESTSET) { - StkId ra = RA(i); - TValue *rb = vRB(i); - if (l_isfalse(rb) == GETARG_k(i)) - pc++; - else { - setobj2s(L, ra, rb); - donextjump(ci); - } - vmbreak; - } - vmcase(OP_CALL) { - StkId ra = RA(i); - CallInfo *newci; - int b = GETARG_B(i); - int nresults = GETARG_C(i) - 1; - if (b != 0) - L->top.p = ra + b; - - savepc(L); - if ((newci = luaD_precall(L, ra, nresults)) == NULL) - updatetrap(ci); - else { - ci = newci; - goto startfunc; - } - vmbreak; - } - vmcase(OP_TAILCALL) { - StkId ra = RA(i); - int b = GETARG_B(i); - int n; - int nparams1 = GETARG_C(i); - - int delta = (nparams1) ? ci->u.l.nextraargs + nparams1 : 0; - if (b != 0) - L->top.p = ra + b; - else - b = cast_int(L->top.p - ra); - savepc(ci); - if (TESTARG_k(i)) { - luaF_closeupval(L, base); - lua_assert(L->tbclist.p < base); - lua_assert(base == ci->func.p + 1); - } - if ((n = luaD_pretailcall(L, ci, ra, b, delta)) < 0) - goto startfunc; - else { - ci->func.p -= delta; - luaD_poscall(L, ci, n); - updatetrap(ci); - goto ret; - } - } - vmcase(OP_RETURN) { - StkId ra = RA(i); - int n = GETARG_B(i) - 1; - int nparams1 = GETARG_C(i); - if (n < 0) - n = cast_int(L->top.p - ra); - savepc(ci); - if (TESTARG_k(i)) { - ci->u2.nres = n; - if (L->top.p < ci->top.p) - L->top.p = ci->top.p; - luaF_close(L, base, CLOSEKTOP, 1); - updatetrap(ci); - updatestack(ci); - } - if (nparams1) - ci->func.p -= ci->u.l.nextraargs + nparams1; - L->top.p = ra + n; - luaD_poscall(L, ci, n); - updatetrap(ci); - goto ret; - } - vmcase(OP_RETURN0) { - if (l_unlikely(L->hookmask)) { - StkId ra = RA(i); - L->top.p = ra; - savepc(ci); - luaD_poscall(L, ci, 0); - trap = 1; - } - else { - int nres; - L->ci = ci->previous; - L->top.p = base - 1; - for (nres = ci->nresults; l_unlikely(nres > 0); nres--) - setnilvalue(s2v(L->top.p++)); - } - goto ret; - } - vmcase(OP_RETURN1) { - if (l_unlikely(L->hookmask)) { - StkId ra = RA(i); - L->top.p = ra + 1; - savepc(ci); - luaD_poscall(L, ci, 1); - trap = 1; - } - else { - int nres = ci->nresults; - L->ci = ci->previous; - if (nres == 0) - L->top.p = base - 1; - else { - StkId ra = RA(i); - setobjs2s(L, base - 1, ra); - L->top.p = base; - for (; l_unlikely(nres > 1); nres--) - setnilvalue(s2v(L->top.p++)); - } - } - ret: - if (ci->callstatus & CIST_FRESH) - return; - else { - ci = ci->previous; - goto returning; - } - } - vmcase(OP_FORLOOP) { - StkId ra = RA(i); - if (ttisinteger(s2v(ra + 1))) { - lua_Unsigned count = l_castS2U(ivalue(s2v(ra))); - if (count > 0) { - lua_Integer step = ivalue(s2v(ra + 1)); - lua_Integer idx = ivalue(s2v(ra + 2)); - chgivalue(s2v(ra), count - 1); - idx = intop(+, idx, step); - chgivalue(s2v(ra + 2), idx); - pc -= GETARG_Bx(i); - } - } - else if (floatforloop(ra)) - pc -= GETARG_Bx(i); - updatetrap(ci); - vmbreak; - } - vmcase(OP_FORPREP) { - StkId ra = RA(i); - savestate(L, ci); - if (forprep(L, ra)) - pc += GETARG_Bx(i) + 1; - vmbreak; - } - vmcase(OP_TFORPREP) { - - StkId ra = RA(i); - TValue temp; - setobj(L, &temp, s2v(ra + 3)); - setobjs2s(L, ra + 3, ra + 2); - setobj2s(L, ra + 2, &temp); - - halfProtect(luaF_newtbcupval(L, ra + 2)); - pc += GETARG_Bx(i); - i = *(pc++); - lua_assert(GET_OPCODE(i) == OP_TFORCALL && ra == RA(i)); - goto l_tforcall; - } - vmcase(OP_TFORCALL) { - l_tforcall: { - - StkId ra = RA(i); - setobjs2s(L, ra + 5, ra + 3); - setobjs2s(L, ra + 4, ra + 1); - setobjs2s(L, ra + 3, ra); - L->top.p = ra + 3 + 3; - ProtectNT(luaD_call(L, ra + 3, GETARG_C(i))); - updatestack(ci); - i = *(pc++); - lua_assert(GET_OPCODE(i) == OP_TFORLOOP && ra == RA(i)); - goto l_tforloop; - }} - vmcase(OP_TFORLOOP) { - l_tforloop: { - StkId ra = RA(i); - if (!ttisnil(s2v(ra + 3))) - pc -= GETARG_Bx(i); - vmbreak; - }} - vmcase(OP_SETLIST) { - StkId ra = RA(i); - int n = GETARG_B(i); - unsigned int last = GETARG_C(i); - Table *h = hvalue(s2v(ra)); - if (n == 0) - n = cast_int(L->top.p - ra) - 1; - else - L->top.p = ci->top.p; - last += n; - if (TESTARG_k(i)) { - last += GETARG_Ax(*pc) * (MAXARG_C + 1); - pc++; - } - if (last > luaH_realasize(h)) - luaH_resizearray(L, h, last); - for (; n > 0; n--) { - TValue *val = s2v(ra + n); - obj2arr(h, last, val); - last--; - luaC_barrierback(L, obj2gco(h), val); - } - vmbreak; - } - vmcase(OP_CLOSURE) { - StkId ra = RA(i); - Proto *p = cl->p->p[GETARG_Bx(i)]; - halfProtect(pushclosure(L, p, cl->upvals, base, ra)); - checkGC(L, ra + 1); - vmbreak; - } - vmcase(OP_VARARG) { - StkId ra = RA(i); - int n = GETARG_C(i) - 1; - Protect(luaT_getvarargs(L, ci, ra, n)); - vmbreak; - } - vmcase(OP_VARARGPREP) { - ProtectNT(luaT_adjustvarargs(L, GETARG_A(i), ci, cl->p)); - if (l_unlikely(trap)) { - luaD_hookcall(L, ci); - L->oldpc = 1; - } - updatebase(ci); - vmbreak; - } - vmcase(OP_EXTRAARG) { - lua_assert(0); - vmbreak; - } - } - } -} - - - -//path: src/dependencies/lua/lapi.c - - -#define lapi_c -#define LUA_CORE - - - - - -#include -#include -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -const char lua_ident[] = - "$LuaVersion: " LUA_COPYRIGHT " $" - "$LuaAuthors: " LUA_AUTHORS " $"; - - - - -#define isvalid(L, o) (!ttisnil(o) || o != &G(L)->nilvalue) - - - -#define ispseudo(i) ((i) <= LUA_REGISTRYINDEX) - - -#define isupvalue(i) ((i) < LUA_REGISTRYINDEX) - - - -static void advancegc (lua_State *L, size_t delta) { - delta >>= 5; - if (delta > 0) { - global_State *g = G(L); - luaE_setdebt(g, g->GCdebt - delta); - } -} - - - -static TValue *index2value (lua_State *L, int idx) { - CallInfo *ci = L->ci; - if (idx > 0) { - StkId o = ci->func.p + idx; - api_check(L, idx <= ci->top.p - (ci->func.p + 1), "unacceptable index"); - if (o >= L->top.p) return &G(L)->nilvalue; - else return s2v(o); - } - else if (!ispseudo(idx)) { - api_check(L, idx != 0 && -idx <= L->top.p - (ci->func.p + 1), - "invalid index"); - return s2v(L->top.p + idx); - } - else if (idx == LUA_REGISTRYINDEX) - return &G(L)->l_registry; - else { - idx = LUA_REGISTRYINDEX - idx; - api_check(L, idx <= MAXUPVAL + 1, "upvalue index too large"); - if (ttisCclosure(s2v(ci->func.p))) { - CClosure *func = clCvalue(s2v(ci->func.p)); - return (idx <= func->nupvalues) ? &func->upvalue[idx-1] - : &G(L)->nilvalue; - } - else { - api_check(L, ttislcf(s2v(ci->func.p)), "caller not a C function"); - return &G(L)->nilvalue; - } - } -} - - - - -static StkId index2stack (lua_State *L, int idx) { - CallInfo *ci = L->ci; - if (idx > 0) { - StkId o = ci->func.p + idx; - api_check(L, o < L->top.p, "invalid index"); - return o; - } - else { - api_check(L, idx != 0 && -idx <= L->top.p - (ci->func.p + 1), - "invalid index"); - api_check(L, !ispseudo(idx), "invalid index"); - return L->top.p + idx; - } -} - - -LUA_API int lua_checkstack (lua_State *L, int n) { - int res; - CallInfo *ci; - lua_lock(L); - ci = L->ci; - api_check(L, n >= 0, "negative 'n'"); - if (L->stack_last.p - L->top.p > n) - res = 1; - else - res = luaD_growstack(L, n, 0); - if (res && ci->top.p < L->top.p + n) - ci->top.p = L->top.p + n; - lua_unlock(L); - return res; -} - - -LUA_API void lua_xmove (lua_State *from, lua_State *to, int n) { - int i; - if (from == to) return; - lua_lock(to); - api_checkpop(from, n); - api_check(from, G(from) == G(to), "moving among independent states"); - api_check(from, to->ci->top.p - to->top.p >= n, "stack overflow"); - from->top.p -= n; - for (i = 0; i < n; i++) { - setobjs2s(to, to->top.p, from->top.p + i); - to->top.p++; - } - lua_unlock(to); -} - - -LUA_API lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf) { - lua_CFunction old; - lua_lock(L); - old = G(L)->panic; - G(L)->panic = panicf; - lua_unlock(L); - return old; -} - - -LUA_API lua_Number lua_version (lua_State *L) { - UNUSED(L); - return LUA_VERSION_NUM; -} - - - - - - - -LUA_API int lua_absindex (lua_State *L, int idx) { - return (idx > 0 || ispseudo(idx)) - ? idx - : cast_int(L->top.p - L->ci->func.p) + idx; -} - - -LUA_API int lua_gettop (lua_State *L) { - return cast_int(L->top.p - (L->ci->func.p + 1)); -} - - -LUA_API void lua_settop (lua_State *L, int idx) { - CallInfo *ci; - StkId func, newtop; - ptrdiff_t diff; - lua_lock(L); - ci = L->ci; - func = ci->func.p; - if (idx >= 0) { - api_check(L, idx <= ci->top.p - (func + 1), "new top too large"); - diff = ((func + 1) + idx) - L->top.p; - for (; diff > 0; diff--) - setnilvalue(s2v(L->top.p++)); - } - else { - api_check(L, -(idx+1) <= (L->top.p - (func + 1)), "invalid new top"); - diff = idx + 1; - } - newtop = L->top.p + diff; - if (diff < 0 && L->tbclist.p >= newtop) { - lua_assert(hastocloseCfunc(ci->nresults)); - newtop = luaF_close(L, newtop, CLOSEKTOP, 0); - } - L->top.p = newtop; - lua_unlock(L); -} - - -LUA_API void lua_closeslot (lua_State *L, int idx) { - StkId level; - lua_lock(L); - level = index2stack(L, idx); - api_check(L, hastocloseCfunc(L->ci->nresults) && L->tbclist.p == level, - "no variable to close at given level"); - level = luaF_close(L, level, CLOSEKTOP, 0); - setnilvalue(s2v(level)); - lua_unlock(L); -} - - - -static void reverse (lua_State *L, StkId from, StkId to) { - for (; from < to; from++, to--) { - TValue temp; - setobj(L, &temp, s2v(from)); - setobjs2s(L, from, to); - setobj2s(L, to, &temp); - } -} - - - -LUA_API void lua_rotate (lua_State *L, int idx, int n) { - StkId p, t, m; - lua_lock(L); - t = L->top.p - 1; - p = index2stack(L, idx); - api_check(L, L->tbclist.p < p, "moving a to-be-closed slot"); - api_check(L, (n >= 0 ? n : -n) <= (t - p + 1), "invalid 'n'"); - m = (n >= 0 ? t - n : p - n - 1); - reverse(L, p, m); - reverse(L, m + 1, t); - reverse(L, p, t); - lua_unlock(L); -} - - -LUA_API void lua_copy (lua_State *L, int fromidx, int toidx) { - TValue *fr, *to; - lua_lock(L); - fr = index2value(L, fromidx); - to = index2value(L, toidx); - api_check(L, isvalid(L, to), "invalid index"); - setobj(L, to, fr); - if (isupvalue(toidx)) - luaC_barrier(L, clCvalue(s2v(L->ci->func.p)), fr); - - lua_unlock(L); -} - - -LUA_API void lua_pushvalue (lua_State *L, int idx) { - lua_lock(L); - setobj2s(L, L->top.p, index2value(L, idx)); - api_incr_top(L); - lua_unlock(L); -} - - - - - - -LUA_API int lua_type (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (isvalid(L, o) ? ttype(o) : LUA_TNONE); -} - - -LUA_API const char *lua_typename (lua_State *L, int t) { - UNUSED(L); - api_check(L, LUA_TNONE <= t && t < LUA_NUMTYPES, "invalid type"); - return ttypename(t); -} - - -LUA_API int lua_iscfunction (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttislcf(o) || (ttisCclosure(o))); -} - - -LUA_API int lua_isinteger (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return ttisinteger(o); -} - - -LUA_API int lua_isnumber (lua_State *L, int idx) { - lua_Number n; - const TValue *o = index2value(L, idx); - return tonumber(o, &n); -} - - -LUA_API int lua_isstring (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttisstring(o) || cvt2str(o)); -} - - -LUA_API int lua_isuserdata (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttisfulluserdata(o) || ttislightuserdata(o)); -} - - -LUA_API int lua_rawequal (lua_State *L, int index1, int index2) { - const TValue *o1 = index2value(L, index1); - const TValue *o2 = index2value(L, index2); - return (isvalid(L, o1) && isvalid(L, o2)) ? luaV_rawequalobj(o1, o2) : 0; -} - - -LUA_API void lua_arith (lua_State *L, int op) { - lua_lock(L); - if (op != LUA_OPUNM && op != LUA_OPBNOT) - api_checkpop(L, 2); - else { - api_checkpop(L, 1); - setobjs2s(L, L->top.p, L->top.p - 1); - api_incr_top(L); - } - - luaO_arith(L, op, s2v(L->top.p - 2), s2v(L->top.p - 1), L->top.p - 2); - L->top.p--; - lua_unlock(L); -} - - -LUA_API int lua_compare (lua_State *L, int index1, int index2, int op) { - const TValue *o1; - const TValue *o2; - int i = 0; - lua_lock(L); - o1 = index2value(L, index1); - o2 = index2value(L, index2); - if (isvalid(L, o1) && isvalid(L, o2)) { - switch (op) { - case LUA_OPEQ: i = luaV_equalobj(L, o1, o2); break; - case LUA_OPLT: i = luaV_lessthan(L, o1, o2); break; - case LUA_OPLE: i = luaV_lessequal(L, o1, o2); break; - default: api_check(L, 0, "invalid option"); - } - } - lua_unlock(L); - return i; -} - - -LUA_API size_t lua_stringtonumber (lua_State *L, const char *s) { - size_t sz = luaO_str2num(s, s2v(L->top.p)); - if (sz != 0) - api_incr_top(L); - return sz; -} - - -LUA_API lua_Number lua_tonumberx (lua_State *L, int idx, int *pisnum) { - lua_Number n = 0; - const TValue *o = index2value(L, idx); - int isnum = tonumber(o, &n); - if (pisnum) - *pisnum = isnum; - return n; -} - - -LUA_API lua_Integer lua_tointegerx (lua_State *L, int idx, int *pisnum) { - lua_Integer res = 0; - const TValue *o = index2value(L, idx); - int isnum = tointeger(o, &res); - if (pisnum) - *pisnum = isnum; - return res; -} - - -LUA_API int lua_toboolean (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return !l_isfalse(o); -} - - -LUA_API const char *lua_tolstring (lua_State *L, int idx, size_t *len) { - TValue *o; - lua_lock(L); - o = index2value(L, idx); - if (!ttisstring(o)) { - if (!cvt2str(o)) { - if (len != NULL) *len = 0; - lua_unlock(L); - return NULL; - } - luaO_tostring(L, o); - luaC_checkGC(L); - o = index2value(L, idx); - } - lua_unlock(L); - if (len != NULL) - return getlstr(tsvalue(o), *len); - else - return getstr(tsvalue(o)); -} - - -LUA_API lua_Unsigned lua_rawlen (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - switch (ttypetag(o)) { - case LUA_VSHRSTR: return tsvalue(o)->shrlen; - case LUA_VLNGSTR: return tsvalue(o)->u.lnglen; - case LUA_VUSERDATA: return uvalue(o)->len; - case LUA_VTABLE: return luaH_getn(hvalue(o)); - default: return 0; - } -} - - -LUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - if (ttislcf(o)) return fvalue(o); - else if (ttisCclosure(o)) - return clCvalue(o)->f; - else return NULL; -} - - -l_sinline void *touserdata (const TValue *o) { - switch (ttype(o)) { - case LUA_TUSERDATA: return getudatamem(uvalue(o)); - case LUA_TLIGHTUSERDATA: return pvalue(o); - default: return NULL; - } -} - - -LUA_API void *lua_touserdata (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return touserdata(o); -} - - -LUA_API lua_State *lua_tothread (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (!ttisthread(o)) ? NULL : thvalue(o); -} - - - -LUA_API const void *lua_topointer (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - switch (ttypetag(o)) { - case LUA_VLCF: return cast_voidp(cast_sizet(fvalue(o))); - case LUA_VUSERDATA: case LUA_VLIGHTUSERDATA: - return touserdata(o); - default: { - if (iscollectable(o)) - return gcvalue(o); - else - return NULL; - } - } -} - - - - - - -LUA_API void lua_pushnil (lua_State *L) { - lua_lock(L); - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushnumber (lua_State *L, lua_Number n) { - lua_lock(L); - setfltvalue(s2v(L->top.p), n); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushinteger (lua_State *L, lua_Integer n) { - lua_lock(L); - setivalue(s2v(L->top.p), n); - api_incr_top(L); - lua_unlock(L); -} - - - -LUA_API const char *lua_pushlstring (lua_State *L, const char *s, size_t len) { - TString *ts; - lua_lock(L); - ts = (len == 0) ? luaS_new(L, "") : luaS_newlstr(L, s, len); - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - advancegc(L, len); - luaC_checkGC(L); - lua_unlock(L); - return getstr(ts); -} - - -LUA_API const char *lua_pushextlstring (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud) { - TString *ts; - lua_lock(L); - api_check(L, s[len] == '\0', "string not ending with zero"); - ts = luaS_newextlstr (L, s, len, falloc, ud); - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - if (falloc != NULL) - advancegc(L, len); - luaC_checkGC(L); - lua_unlock(L); - return getstr(ts); -} - - -LUA_API const char *lua_pushstring (lua_State *L, const char *s) { - lua_lock(L); - if (s == NULL) - setnilvalue(s2v(L->top.p)); - else { - TString *ts; - ts = luaS_new(L, s); - setsvalue2s(L, L->top.p, ts); - s = getstr(ts); - } - api_incr_top(L); - luaC_checkGC(L); - lua_unlock(L); - return s; -} - - -LUA_API const char *lua_pushvfstring (lua_State *L, const char *fmt, - va_list argp) { - const char *ret; - lua_lock(L); - ret = luaO_pushvfstring(L, fmt, argp); - luaC_checkGC(L); - lua_unlock(L); - return ret; -} - - -LUA_API const char *lua_pushfstring (lua_State *L, const char *fmt, ...) { - const char *ret; - va_list argp; - lua_lock(L); - va_start(argp, fmt); - ret = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - luaC_checkGC(L); - lua_unlock(L); - return ret; -} - - -LUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) { - lua_lock(L); - if (n == 0) { - setfvalue(s2v(L->top.p), fn); - api_incr_top(L); - } - else { - int i; - CClosure *cl; - api_checkpop(L, n); - api_check(L, n <= MAXUPVAL, "upvalue index too large"); - cl = luaF_newCclosure(L, n); - cl->f = fn; - for (i = 0; i < n; i++) { - setobj2n(L, &cl->upvalue[i], s2v(L->top.p - n + i)); - - lua_assert(iswhite(cl)); - } - L->top.p -= n; - setclCvalue(L, s2v(L->top.p), cl); - api_incr_top(L); - luaC_checkGC(L); - } - lua_unlock(L); -} - - -LUA_API void lua_pushboolean (lua_State *L, int b) { - lua_lock(L); - if (b) - setbtvalue(s2v(L->top.p)); - else - setbfvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushlightuserdata (lua_State *L, void *p) { - lua_lock(L); - setpvalue(s2v(L->top.p), p); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API int lua_pushthread (lua_State *L) { - lua_lock(L); - setthvalue(L, s2v(L->top.p), L); - api_incr_top(L); - lua_unlock(L); - return (G(L)->mainthread == L); -} - - - - - - -static int auxgetstr (lua_State *L, const TValue *t, const char *k) { - int tag; - TString *str = luaS_new(L, k); - luaV_fastget(t, str, s2v(L->top.p), luaH_getstr, tag); - if (!tagisempty(tag)) { - api_incr_top(L); - } - else { - setsvalue2s(L, L->top.p, str); - api_incr_top(L); - tag = luaV_finishget(L, t, s2v(L->top.p - 1), L->top.p - 1, tag); - } - lua_unlock(L); - return novariant(tag); -} - - -static void getGlobalTable (lua_State *L, TValue *gt) { - Table *registry = hvalue(&G(L)->l_registry); - int tag = luaH_getint(registry, LUA_RIDX_GLOBALS, gt); - (void)tag; - api_check(L, novariant(tag) == LUA_TTABLE, "global table must exist"); -} - - -LUA_API int lua_getglobal (lua_State *L, const char *name) { - TValue gt; - lua_lock(L); - getGlobalTable(L, >); - return auxgetstr(L, >, name); -} - - -LUA_API int lua_gettable (lua_State *L, int idx) { - int tag; - TValue *t; - lua_lock(L); - api_checkpop(L, 1); - t = index2value(L, idx); - luaV_fastget(t, s2v(L->top.p - 1), s2v(L->top.p - 1), luaH_get, tag); - if (tagisempty(tag)) - tag = luaV_finishget(L, t, s2v(L->top.p - 1), L->top.p - 1, tag); - lua_unlock(L); - return novariant(tag); -} - - -LUA_API int lua_getfield (lua_State *L, int idx, const char *k) { - lua_lock(L); - return auxgetstr(L, index2value(L, idx), k); -} - - -LUA_API int lua_geti (lua_State *L, int idx, lua_Integer n) { - TValue *t; - int tag; - lua_lock(L); - t = index2value(L, idx); - luaV_fastgeti(t, n, s2v(L->top.p), tag); - if (tagisempty(tag)) { - TValue key; - setivalue(&key, n); - tag = luaV_finishget(L, t, &key, L->top.p, tag); - } - api_incr_top(L); - lua_unlock(L); - return novariant(tag); -} - - -static int finishrawget (lua_State *L, int tag) { - if (tagisempty(tag)) - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); - return novariant(tag); -} - - -l_sinline Table *gettable (lua_State *L, int idx) { - TValue *t = index2value(L, idx); - api_check(L, ttistable(t), "table expected"); - return hvalue(t); -} - - -LUA_API int lua_rawget (lua_State *L, int idx) { - Table *t; - int tag; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - tag = luaH_get(t, s2v(L->top.p - 1), s2v(L->top.p - 1)); - L->top.p--; - return finishrawget(L, tag); -} - - -LUA_API int lua_rawgeti (lua_State *L, int idx, lua_Integer n) { - Table *t; - int tag; - lua_lock(L); - t = gettable(L, idx); - luaH_fastgeti(t, n, s2v(L->top.p), tag); - return finishrawget(L, tag); -} - - -LUA_API int lua_rawgetp (lua_State *L, int idx, const void *p) { - Table *t; - TValue k; - lua_lock(L); - t = gettable(L, idx); - setpvalue(&k, cast_voidp(p)); - return finishrawget(L, luaH_get(t, &k, s2v(L->top.p))); -} - - -LUA_API void lua_createtable (lua_State *L, unsigned narray, unsigned nrec) { - Table *t; - lua_lock(L); - t = luaH_new(L); - sethvalue2s(L, L->top.p, t); - api_incr_top(L); - if (narray > 0 || nrec > 0) - luaH_resize(L, t, narray, nrec); - luaC_checkGC(L); - lua_unlock(L); -} - - -LUA_API int lua_getmetatable (lua_State *L, int objindex) { - const TValue *obj; - Table *mt; - int res = 0; - lua_lock(L); - obj = index2value(L, objindex); - switch (ttype(obj)) { - case LUA_TTABLE: - mt = hvalue(obj)->metatable; - break; - case LUA_TUSERDATA: - mt = uvalue(obj)->metatable; - break; - default: - mt = G(L)->mt[ttype(obj)]; - break; - } - if (mt != NULL) { - sethvalue2s(L, L->top.p, mt); - api_incr_top(L); - res = 1; - } - lua_unlock(L); - return res; -} - - -LUA_API int lua_getiuservalue (lua_State *L, int idx, int n) { - TValue *o; - int t; - lua_lock(L); - o = index2value(L, idx); - api_check(L, ttisfulluserdata(o), "full userdata expected"); - if (n <= 0 || n > uvalue(o)->nuvalue) { - setnilvalue(s2v(L->top.p)); - t = LUA_TNONE; - } - else { - setobj2s(L, L->top.p, &uvalue(o)->uv[n - 1].uv); - t = ttype(s2v(L->top.p)); - } - api_incr_top(L); - lua_unlock(L); - return t; -} - - - - - -static void auxsetstr (lua_State *L, const TValue *t, const char *k) { - int hres; - TString *str = luaS_new(L, k); - api_checkpop(L, 1); - luaV_fastset(t, str, s2v(L->top.p - 1), hres, luaH_psetstr); - if (hres == HOK) { - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - L->top.p--; - } - else { - setsvalue2s(L, L->top.p, str); - api_incr_top(L); - luaV_finishset(L, t, s2v(L->top.p - 1), s2v(L->top.p - 2), hres); - L->top.p -= 2; - } - lua_unlock(L); -} - - -LUA_API void lua_setglobal (lua_State *L, const char *name) { - TValue gt; - lua_lock(L); - getGlobalTable(L, >); - auxsetstr(L, >, name); -} - - -LUA_API void lua_settable (lua_State *L, int idx) { - TValue *t; - int hres; - lua_lock(L); - api_checkpop(L, 2); - t = index2value(L, idx); - luaV_fastset(t, s2v(L->top.p - 2), s2v(L->top.p - 1), hres, luaH_pset); - if (hres == HOK) { - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - } - else - luaV_finishset(L, t, s2v(L->top.p - 2), s2v(L->top.p - 1), hres); - L->top.p -= 2; - lua_unlock(L); -} - - -LUA_API void lua_setfield (lua_State *L, int idx, const char *k) { - lua_lock(L); - auxsetstr(L, index2value(L, idx), k); -} - - -LUA_API void lua_seti (lua_State *L, int idx, lua_Integer n) { - TValue *t; - int hres; - lua_lock(L); - api_checkpop(L, 1); - t = index2value(L, idx); - luaV_fastseti(t, n, s2v(L->top.p - 1), hres); - if (hres == HOK) - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - else { - TValue temp; - setivalue(&temp, n); - luaV_finishset(L, t, &temp, s2v(L->top.p - 1), hres); - } - L->top.p--; - lua_unlock(L); -} - - -static void aux_rawset (lua_State *L, int idx, TValue *key, int n) { - Table *t; - lua_lock(L); - api_checkpop(L, n); - t = gettable(L, idx); - luaH_set(L, t, key, s2v(L->top.p - 1)); - invalidateTMcache(t); - luaC_barrierback(L, obj2gco(t), s2v(L->top.p - 1)); - L->top.p -= n; - lua_unlock(L); -} - - -LUA_API void lua_rawset (lua_State *L, int idx) { - aux_rawset(L, idx, s2v(L->top.p - 2), 2); -} - - -LUA_API void lua_rawsetp (lua_State *L, int idx, const void *p) { - TValue k; - setpvalue(&k, cast_voidp(p)); - aux_rawset(L, idx, &k, 1); -} - - -LUA_API void lua_rawseti (lua_State *L, int idx, lua_Integer n) { - Table *t; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - luaH_setint(L, t, n, s2v(L->top.p - 1)); - luaC_barrierback(L, obj2gco(t), s2v(L->top.p - 1)); - L->top.p--; - lua_unlock(L); -} - - -LUA_API int lua_setmetatable (lua_State *L, int objindex) { - TValue *obj; - Table *mt; - lua_lock(L); - api_checkpop(L, 1); - obj = index2value(L, objindex); - if (ttisnil(s2v(L->top.p - 1))) - mt = NULL; - else { - api_check(L, ttistable(s2v(L->top.p - 1)), "table expected"); - mt = hvalue(s2v(L->top.p - 1)); - } - switch (ttype(obj)) { - case LUA_TTABLE: { - hvalue(obj)->metatable = mt; - if (mt) { - luaC_objbarrier(L, gcvalue(obj), mt); - luaC_checkfinalizer(L, gcvalue(obj), mt); - } - break; - } - case LUA_TUSERDATA: { - uvalue(obj)->metatable = mt; - if (mt) { - luaC_objbarrier(L, uvalue(obj), mt); - luaC_checkfinalizer(L, gcvalue(obj), mt); - } - break; - } - default: { - G(L)->mt[ttype(obj)] = mt; - break; - } - } - L->top.p--; - lua_unlock(L); - return 1; -} - - -LUA_API int lua_setiuservalue (lua_State *L, int idx, int n) { - TValue *o; - int res; - lua_lock(L); - api_checkpop(L, 1); - o = index2value(L, idx); - api_check(L, ttisfulluserdata(o), "full userdata expected"); - if (!(cast_uint(n) - 1u < cast_uint(uvalue(o)->nuvalue))) - res = 0; - else { - setobj(L, &uvalue(o)->uv[n - 1].uv, s2v(L->top.p - 1)); - luaC_barrierback(L, gcvalue(o), s2v(L->top.p - 1)); - res = 1; - } - L->top.p--; - lua_unlock(L); - return res; -} - - - - - -#define checkresults(L,na,nr) \ - api_check(L, (nr) == LUA_MULTRET \ - || (L->ci->top.p - L->top.p >= (nr) - (na)), \ - "results from function overflow current stack size") - - -LUA_API void lua_callk (lua_State *L, int nargs, int nresults, - lua_KContext ctx, lua_KFunction k) { - StkId func; - lua_lock(L); - api_check(L, k == NULL || !isLua(L->ci), - "cannot use continuations inside hooks"); - api_checkpop(L, nargs + 1); - api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); - checkresults(L, nargs, nresults); - func = L->top.p - (nargs+1); - if (k != NULL && yieldable(L)) { - L->ci->u.c.k = k; - L->ci->u.c.ctx = ctx; - luaD_call(L, func, nresults); - } - else - luaD_callnoyield(L, func, nresults); - adjustresults(L, nresults); - lua_unlock(L); -} - - - - -struct CallS { - StkId func; - int nresults; -}; - - -static void f_call (lua_State *L, void *ud) { - struct CallS *c = cast(struct CallS *, ud); - luaD_callnoyield(L, c->func, c->nresults); -} - - - -LUA_API int lua_pcallk (lua_State *L, int nargs, int nresults, int errfunc, - lua_KContext ctx, lua_KFunction k) { - struct CallS c; - int status; - ptrdiff_t func; - lua_lock(L); - api_check(L, k == NULL || !isLua(L->ci), - "cannot use continuations inside hooks"); - api_checkpop(L, nargs + 1); - api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); - checkresults(L, nargs, nresults); - if (errfunc == 0) - func = 0; - else { - StkId o = index2stack(L, errfunc); - api_check(L, ttisfunction(s2v(o)), "private_lua_error handler must be a function"); - func = savestack(L, o); - } - c.func = L->top.p - (nargs+1); - if (k == NULL || !yieldable(L)) { - c.nresults = nresults; - status = luaD_pcall(L, f_call, &c, savestack(L, c.func), func); - } - else { - CallInfo *ci = L->ci; - ci->u.c.k = k; - ci->u.c.ctx = ctx; - - ci->u2.funcidx = cast_int(savestack(L, c.func)); - ci->u.c.old_errfunc = L->errfunc; - L->errfunc = func; - setoah(ci->callstatus, L->allowhook); - ci->callstatus |= CIST_YPCALL; - luaD_call(L, c.func, nresults); - ci->callstatus &= ~CIST_YPCALL; - L->errfunc = ci->u.c.old_errfunc; - status = LUA_OK; - } - adjustresults(L, nresults); - lua_unlock(L); - return status; -} - - -LUA_API int lua_load (lua_State *L, lua_Reader reader, void *data, - const char *chunkname, const char *mode) { - ZIO z; - int status; - lua_lock(L); - if (!chunkname) chunkname = "?"; - luaZ_init(L, &z, reader, data); - status = luaD_protectedparser(L, &z, chunkname, mode); - if (status == LUA_OK) { - LClosure *f = clLvalue(s2v(L->top.p - 1)); - if (f->nupvalues >= 1) { - - TValue gt; - getGlobalTable(L, >); - - setobj(L, f->upvals[0]->v.p, >); - luaC_barrier(L, f->upvals[0], >); - } - } - lua_unlock(L); - return status; -} - - - -LUA_API int lua_dump (lua_State *L, lua_Writer writer, void *data, int strip) { - int status; - ptrdiff_t otop = savestack(L, L->top.p); - TValue *f = s2v(L->top.p - 1); - lua_lock(L); - api_checkpop(L, 1); - api_check(L, isLfunction(f), "Lua function expected"); - status = luaU_dump(L, clLvalue(f)->p, writer, data, strip); - L->top.p = restorestack(L, otop); - lua_unlock(L); - return status; -} - - -LUA_API int lua_status (lua_State *L) { - return L->status; -} - - - -LUA_API int lua_gc (lua_State *L, int what, ...) { - va_list argp; - int res = 0; - global_State *g = G(L); - if (g->gcstp & (GCSTPGC | GCSTPCLS)) - return -1; - lua_lock(L); - va_start(argp, what); - switch (what) { - case LUA_GCSTOP: { - g->gcstp = GCSTPUSR; - break; - } - case LUA_GCRESTART: { - luaE_setdebt(g, 0); - g->gcstp = 0; - break; - } - case LUA_GCCOLLECT: { - luaC_fullgc(L, 0); - break; - } - case LUA_GCCOUNT: { - - res = cast_int(g->totalbytes >> 10); - break; - } - case LUA_GCCOUNTB: { - res = cast_int(g->totalbytes & 0x3ff); - break; - } - case LUA_GCSTEP: { - lu_byte oldstp = g->gcstp; - l_obj n = va_arg(argp, int); - int work = 0; - g->gcstp = 0; - if (n <= 0) - n = g->GCdebt; - luaE_setdebt(g, g->GCdebt - n); - luaC_condGC(L, (void)0, work = 1); - if (work && g->gcstate == GCSpause) - res = 1; - g->gcstp = oldstp; - break; - } - case LUA_GCISRUNNING: { - res = gcrunning(g); - break; - } - case LUA_GCGEN: { - res = (g->gckind == KGC_INC) ? LUA_GCINC : LUA_GCGEN; - luaC_changemode(L, KGC_GENMINOR); - break; - } - case LUA_GCINC: { - res = (g->gckind == KGC_INC) ? LUA_GCINC : LUA_GCGEN; - luaC_changemode(L, KGC_INC); - break; - } - case LUA_GCPARAM: { - int param = va_arg(argp, int); - int value = va_arg(argp, int); - api_check(L, 0 <= param && param < LUA_GCPN, "invalid parameter"); - res = cast_int(luaO_applyparam(g->gcparams[param], 100)); - if (value >= 0) - g->gcparams[param] = luaO_codeparam(value); - break; - } - default: res = -1; - } - va_end(argp); - lua_unlock(L); - return res; -} - - - - - - -LUA_API int lua_error (lua_State *L) { - TValue *errobj; - lua_lock(L); - errobj = s2v(L->top.p - 1); - api_checkpop(L, 1); - - if (ttisshrstring(errobj) && eqshrstr(tsvalue(errobj), G(L)->memerrmsg)) - luaM_error(L); - else - luaG_errormsg(L); - - return 0; -} - - -LUA_API int lua_next (lua_State *L, int idx) { - Table *t; - int more; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - more = luaH_next(L, t, L->top.p - 1); - if (more) - api_incr_top(L); - else - L->top.p--; - lua_unlock(L); - return more; -} - - -LUA_API void lua_toclose (lua_State *L, int idx) { - int nresults; - StkId o; - lua_lock(L); - o = index2stack(L, idx); - nresults = L->ci->nresults; - api_check(L, L->tbclist.p < o, "given index below or equal a marked one"); - luaF_newtbcupval(L, o); - if (!hastocloseCfunc(nresults)) - L->ci->nresults = codeNresults(nresults); - lua_assert(hastocloseCfunc(L->ci->nresults)); - lua_unlock(L); -} - - -LUA_API void lua_concat (lua_State *L, int n) { - lua_lock(L); - api_checknelems(L, n); - if (n > 0) { - luaV_concat(L, n); - luaC_checkGC(L); - } - else { - setsvalue2s(L, L->top.p, luaS_newlstr(L, "", 0)); - api_incr_top(L); - } - lua_unlock(L); -} - - -LUA_API void lua_len (lua_State *L, int idx) { - TValue *t; - lua_lock(L); - t = index2value(L, idx); - luaV_objlen(L, L->top.p, t); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API lua_Alloc lua_getallocf (lua_State *L, void **ud) { - lua_Alloc f; - lua_lock(L); - if (ud) *ud = G(L)->ud; - f = G(L)->frealloc; - lua_unlock(L); - return f; -} - - -LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud) { - lua_lock(L); - G(L)->ud = ud; - G(L)->frealloc = f; - lua_unlock(L); -} - - -void lua_setwarnf (lua_State *L, lua_WarnFunction f, void *ud) { - lua_lock(L); - G(L)->ud_warn = ud; - G(L)->warnf = f; - lua_unlock(L); -} - - -void lua_warning (lua_State *L, const char *msg, int tocont) { - lua_lock(L); - luaE_warning(L, msg, tocont); - lua_unlock(L); -} - - - -LUA_API void *lua_newuserdatauv (lua_State *L, size_t size, int nuvalue) { - Udata *u; - lua_lock(L); - api_check(L, 0 <= nuvalue && nuvalue < USHRT_MAX, "invalid value"); - u = luaS_newudata(L, size, nuvalue); - setuvalue(L, s2v(L->top.p), u); - api_incr_top(L); - advancegc(L, size); - luaC_checkGC(L); - lua_unlock(L); - return getudatamem(u); -} - - - -static const char *aux_upvalue (TValue *fi, int n, TValue **val, - GCObject **owner) { - switch (ttypetag(fi)) { - case LUA_VCCL: { - CClosure *f = clCvalue(fi); - if (!(cast_uint(n) - 1u < cast_uint(f->nupvalues))) - return NULL; - *val = &f->upvalue[n-1]; - if (owner) *owner = obj2gco(f); - return ""; - } - case LUA_VLCL: { - LClosure *f = clLvalue(fi); - TString *name; - Proto *p = f->p; - if (!(cast_uint(n) - 1u < cast_uint(p->sizeupvalues))) - return NULL; - *val = f->upvals[n-1]->v.p; - if (owner) *owner = obj2gco(f->upvals[n - 1]); - name = p->upvalues[n-1].name; - return (name == NULL) ? "(no name)" : getstr(name); - } - default: return NULL; - } -} - - -LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n) { - const char *name; - TValue *val = NULL; - lua_lock(L); - name = aux_upvalue(index2value(L, funcindex), n, &val, NULL); - if (name) { - setobj2s(L, L->top.p, val); - api_incr_top(L); - } - lua_unlock(L); - return name; -} - - -LUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n) { - const char *name; - TValue *val = NULL; - GCObject *owner = NULL; - TValue *fi; - lua_lock(L); - fi = index2value(L, funcindex); - api_checknelems(L, 1); - name = aux_upvalue(fi, n, &val, &owner); - if (name) { - L->top.p--; - setobj(L, val, s2v(L->top.p)); - luaC_barrier(L, owner, val); - } - lua_unlock(L); - return name; -} - - -static UpVal **getupvalref (lua_State *L, int fidx, int n, LClosure **pf) { - static const UpVal *const nullup = NULL; - LClosure *f; - TValue *fi = index2value(L, fidx); - api_check(L, ttisLclosure(fi), "Lua function expected"); - f = clLvalue(fi); - if (pf) *pf = f; - if (1 <= n && n <= f->p->sizeupvalues) - return &f->upvals[n - 1]; - else - return (UpVal**)&nullup; -} - - -LUA_API void *lua_upvalueid (lua_State *L, int fidx, int n) { - TValue *fi = index2value(L, fidx); - switch (ttypetag(fi)) { - case LUA_VLCL: { - return *getupvalref(L, fidx, n, NULL); - } - case LUA_VCCL: { - CClosure *f = clCvalue(fi); - if (1 <= n && n <= f->nupvalues) - return &f->upvalue[n - 1]; - - } - case LUA_VLCF: - return NULL; - default: { - api_check(L, 0, "function expected"); - return NULL; - } - } -} - - -LUA_API void lua_upvaluejoin (lua_State *L, int fidx1, int n1, - int fidx2, int n2) { - LClosure *f1; - UpVal **up1 = getupvalref(L, fidx1, n1, &f1); - UpVal **up2 = getupvalref(L, fidx2, n2, NULL); - api_check(L, *up1 != NULL && *up2 != NULL, "invalid upvalue index"); - *up1 = *up2; - luaC_objbarrier(L, f1, *up1); -} - - - - - - -//path: src/dependencies/lua/lauxlib.c - - -#define lauxlib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include -#include - - - - - - - -//path: src/dependencies/lua/lauxlib.h - - - -#ifndef lauxlib_h -#define lauxlib_h - - -#include -#include - - - - - - - - -#define LUA_GNAME "_G" - - -typedef struct luaL_Buffer luaL_Buffer; - - - -#define LUA_ERRFILE (LUA_ERRERR+1) - - - -#define LUA_LOADED_TABLE "_LOADED" - - - -#define LUA_PRELOAD_TABLE "_PRELOAD" - - -typedef struct luaL_Reg { - const char *name; - lua_CFunction func; -} luaL_Reg; - - -#define LUAL_NUMSIZES (sizeof(lua_Integer)*16 + sizeof(lua_Number)) - -LUALIB_API void (luaL_checkversion_) (lua_State *L, lua_Number ver, size_t sz); -#define luaL_checkversion(L) \ - luaL_checkversion_(L, LUA_VERSION_NUM, LUAL_NUMSIZES) - -LUALIB_API int (luaL_getmetafield) (lua_State *L, int obj, const char *e); -LUALIB_API int (luaL_callmeta) (lua_State *L, int obj, const char *e); -LUALIB_API const char *(luaL_tolstring) (lua_State *L, int idx, size_t *len); -LUALIB_API int (luaL_argerror) (lua_State *L, int arg, const char *extramsg); -LUALIB_API int (luaL_typeerror) (lua_State *L, int arg, const char *tname); -LUALIB_API const char *(luaL_checklstring) (lua_State *L, int arg, - size_t *l); -LUALIB_API const char *(luaL_optlstring) (lua_State *L, int arg, - const char *def, size_t *l); -LUALIB_API lua_Number (luaL_checknumber) (lua_State *L, int arg); -LUALIB_API lua_Number (luaL_optnumber) (lua_State *L, int arg, lua_Number def); - -LUALIB_API lua_Integer (luaL_checkinteger) (lua_State *L, int arg); -LUALIB_API lua_Integer (luaL_optinteger) (lua_State *L, int arg, - lua_Integer def); - -LUALIB_API void (luaL_checkstack) (lua_State *L, int sz, const char *msg); -LUALIB_API void (luaL_checktype) (lua_State *L, int arg, int t); -LUALIB_API void (luaL_checkany) (lua_State *L, int arg); - -LUALIB_API int (luaL_newmetatable) (lua_State *L, const char *tname); -LUALIB_API void (luaL_setmetatable) (lua_State *L, const char *tname); -LUALIB_API void *(luaL_testudata) (lua_State *L, int ud, const char *tname); -LUALIB_API void *(luaL_checkudata) (lua_State *L, int ud, const char *tname); - -LUALIB_API void (luaL_where) (lua_State *L, int lvl); -LUALIB_API int (luaL_error) (lua_State *L, const char *fmt, ...); - -LUALIB_API int (luaL_checkoption) (lua_State *L, int arg, const char *def, - const char *const lst[]); - -LUALIB_API int (luaL_fileresult) (lua_State *L, int stat, const char *fname); -LUALIB_API int (luaL_execresult) (lua_State *L, int stat); - - - -#define LUA_NOREF (-2) -#define LUA_REFNIL (-1) - -LUALIB_API int (luaL_ref) (lua_State *L, int t); -LUALIB_API void (luaL_unref) (lua_State *L, int t, int ref); - -LUALIB_API int (luaL_loadfilex) (lua_State *L, const char *filename, - const char *mode); - -#define luaL_loadfile(L,f) luaL_loadfilex(L,f,NULL) - -LUALIB_API int (luaL_loadbufferx) (lua_State *L, const char *buff, size_t sz, - const char *name, const char *mode); -LUALIB_API int (luaL_loadstring) (lua_State *L, const char *s); - -LUALIB_API lua_State *(luaL_newstate) (void); - -LUALIB_API unsigned luaL_makeseed (lua_State *L); - -LUALIB_API lua_Integer (luaL_len) (lua_State *L, int idx); - -LUALIB_API void (luaL_addgsub) (luaL_Buffer *b, const char *s, - const char *p, const char *r); -LUALIB_API const char *(luaL_gsub) (lua_State *L, const char *s, - const char *p, const char *r); - -LUALIB_API void (luaL_setfuncs) (lua_State *L, const luaL_Reg *l, int nup); - -LUALIB_API int (luaL_getsubtable) (lua_State *L, int idx, const char *fname); - -LUALIB_API void (luaL_traceback) (lua_State *L, lua_State *L1, - const char *msg, int level); - -LUALIB_API void (luaL_requiref) (lua_State *L, const char *modname, - lua_CFunction openf, int glb); - - - - -#define luaL_newlibtable(L,l) \ - lua_createtable(L, 0, sizeof(l)/sizeof((l)[0]) - 1) - -#define luaL_newlib(L,l) \ - (luaL_checkversion(L), luaL_newlibtable(L,l), luaL_setfuncs(L,l,0)) - -#define luaL_argcheck(L, cond,arg,extramsg) \ - ((void)(luai_likely(cond) || luaL_argerror(L, (arg), (extramsg)))) - -#define luaL_argexpected(L,cond,arg,tname) \ - ((void)(luai_likely(cond) || luaL_typeerror(L, (arg), (tname)))) - -#define luaL_checkstring(L,n) (luaL_checklstring(L, (n), NULL)) -#define luaL_optstring(L,n,d) (luaL_optlstring(L, (n), (d), NULL)) - -#define luaL_typename(L,i) lua_typename(L, lua_type(L,(i))) - -#define luaL_dofile(L, fn) \ - (luaL_loadfile(L, fn) || lua_pcall(L, 0, LUA_MULTRET, 0)) - -#define luaL_dostring(L, s) \ - (luaL_loadstring(L, s) || lua_pcall(L, 0, LUA_MULTRET, 0)) - -#define luaL_getmetatable(L,n) (lua_getfield(L, LUA_REGISTRYINDEX, (n))) - -#define luaL_opt(L,f,n,d) (lua_isnoneornil(L,(n)) ? (d) : f(L,(n))) - -#define luaL_loadbuffer(L,s,sz,n) luaL_loadbufferx(L,s,sz,n,NULL) - - - -#define luaL_intop(op,v1,v2) \ - ((lua_Integer)((lua_Unsigned)(v1) op (lua_Unsigned)(v2))) - - - -#define luaL_pushfail(L) lua_pushnil(L) - - - -#if !defined(lua_assert) - -#if defined LUAI_ASSERT - #include - #define lua_assert(c) assert(c) -#else - #define lua_assert(c) ((void)0) -#endif - -#endif - - - - - -struct luaL_Buffer { - char *b; - size_t size; - size_t n; - lua_State *L; - union { - LUAI_MAXALIGN; - char b[LUAL_BUFFERSIZE]; - } init; -}; - - -#define luaL_bufflen(bf) ((bf)->n) -#define luaL_buffaddr(bf) ((bf)->b) - - -#define luaL_addchar(B,c) \ - ((void)((B)->n < (B)->size || luaL_prepbuffsize((B), 1)), \ - ((B)->b[(B)->n++] = (c))) - -#define luaL_addsize(B,s) ((B)->n += (s)) - -#define luaL_buffsub(B,s) ((B)->n -= (s)) - -LUALIB_API void (luaL_buffinit) (lua_State *L, luaL_Buffer *B); -LUALIB_API char *(luaL_prepbuffsize) (luaL_Buffer *B, size_t sz); -LUALIB_API void (luaL_addlstring) (luaL_Buffer *B, const char *s, size_t l); -LUALIB_API void (luaL_addstring) (luaL_Buffer *B, const char *s); -LUALIB_API void (luaL_addvalue) (luaL_Buffer *B); -LUALIB_API void (luaL_pushresult) (luaL_Buffer *B); -LUALIB_API void (luaL_pushresultsize) (luaL_Buffer *B, size_t sz); -LUALIB_API char *(luaL_buffinitsize) (lua_State *L, luaL_Buffer *B, size_t sz); - -#define luaL_prepbuffer(B) luaL_prepbuffsize(B, LUAL_BUFFERSIZE) - - - - - - - - - -#define LUA_FILEHANDLE "FILE*" - - -typedef struct luaL_Stream { - FILE *f; - lua_CFunction closef; -} luaL_Stream; - - - - - - -#if !defined(lua_writestring) -#define lua_writestring(s,l) fwrite((s), sizeof(char), (l), stdout) -#endif - - -#if !defined(lua_writeline) -#define lua_writeline() (lua_writestring("\n", 1), fflush(stdout)) -#endif - - -#if !defined(lua_writestringerror) -#define lua_writestringerror(s,p) \ - (fprintf(stderr, (s), (p)), fflush(stderr)) -#endif - - - - - -#if defined(LUA_COMPAT_APIINTCASTS) - -#define luaL_checkunsigned(L,a) ((lua_Unsigned)luaL_checkinteger(L,a)) -#define luaL_optunsigned(L,a,d) \ - ((lua_Unsigned)luaL_optinteger(L,a,(lua_Integer)(d))) - -#define luaL_checkint(L,n) ((int)luaL_checkinteger(L, (n))) -#define luaL_optint(L,n,d) ((int)luaL_optinteger(L, (n), (d))) - -#define luaL_checklong(L,n) ((long)luaL_checkinteger(L, (n))) -#define luaL_optlong(L,n,d) ((long)luaL_optinteger(L, (n), (d))) - -#endif - - - - -#endif - - - - - - -#if !defined(MAX_SIZET) - -#define MAX_SIZET ((size_t)(~(size_t)0)) -#endif - - - - - -#define LEVELS1 10 -#define LEVELS2 11 - - - - -static int findfield (lua_State *L, int objidx, int level) { - if (level == 0 || !lua_istable(L, -1)) - return 0; - lua_pushnil(L); - while (lua_next(L, -2)) { - if (lua_type(L, -2) == LUA_TSTRING) { - if (lua_rawequal(L, objidx, -1)) { - lua_pop(L, 1); - return 1; - } - else if (findfield(L, objidx, level - 1)) { - - lua_pushliteral(L, "."); - lua_replace(L, -3); - lua_concat(L, 3); - return 1; - } - } - lua_pop(L, 1); - } - return 0; -} - - - -static int pushglobalfuncname (lua_State *L, lua_Debug *ar) { - int top = lua_gettop(L); - lua_getinfo(L, "f", ar); - lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - if (findfield(L, top + 1, 2)) { - const char *name = lua_tostring(L, -1); - if (strncmp(name, LUA_GNAME ".", 3) == 0) { - lua_pushstring(L, name + 3); - lua_remove(L, -2); - } - lua_copy(L, -1, top + 1); - lua_settop(L, top + 1); - return 1; - } - else { - lua_settop(L, top); - return 0; - } -} - - -static void pushfuncname (lua_State *L, lua_Debug *ar) { - if (pushglobalfuncname(L, ar)) { - lua_pushfstring(L, "function '%s'", lua_tostring(L, -1)); - lua_remove(L, -2); - } - else if (*ar->namewhat != '\0') - lua_pushfstring(L, "%s '%s'", ar->namewhat, ar->name); - else if (*ar->what == 'm') - lua_pushliteral(L, "main chunk"); - else if (*ar->what != 'C') - lua_pushfstring(L, "function <%s:%d>", ar->short_src, ar->linedefined); - else - lua_pushliteral(L, "?"); -} - - -static int lastlevel (lua_State *L) { - lua_Debug ar; - int li = 1, le = 1; - - while (lua_getstack(L, le, &ar)) { li = le; le *= 2; } - - while (li < le) { - int m = (li + le)/2; - if (lua_getstack(L, m, &ar)) li = m + 1; - else le = m; - } - return le - 1; -} - - -LUALIB_API void luaL_traceback (lua_State *L, lua_State *L1, - const char *msg, int level) { - luaL_Buffer b; - lua_Debug ar; - int last = lastlevel(L1); - int limit2show = (last - level > LEVELS1 + LEVELS2) ? LEVELS1 : -1; - luaL_buffinit(L, &b); - if (msg) { - luaL_addstring(&b, msg); - luaL_addchar(&b, '\n'); - } - luaL_addstring(&b, "stack traceback:"); - while (lua_getstack(L1, level++, &ar)) { - if (limit2show-- == 0) { - int n = last - level - LEVELS2 + 1; - lua_pushfstring(L, "\n\t...\t(skipping %d levels)", n); - luaL_addvalue(&b); - level += n; - } - else { - lua_getinfo(L1, "Slnt", &ar); - if (ar.currentline <= 0) - lua_pushfstring(L, "\n\t%s: in ", ar.short_src); - else - lua_pushfstring(L, "\n\t%s:%d: in ", ar.short_src, ar.currentline); - luaL_addvalue(&b); - pushfuncname(L, &ar); - luaL_addvalue(&b); - if (ar.istailcall) - luaL_addstring(&b, "\n\t(...tail calls...)"); - } - } - luaL_pushresult(&b); -} - - - - - - -LUALIB_API int luaL_argerror (lua_State *L, int arg, const char *extramsg) { - lua_Debug ar; - if (!lua_getstack(L, 0, &ar)) - return luaL_error(L, "bad argument #%d (%s)", arg, extramsg); - lua_getinfo(L, "n", &ar); - if (strcmp(ar.namewhat, "method") == 0) { - arg--; - if (arg == 0) - return luaL_error(L, "calling '%s' on bad self (%s)", - ar.name, extramsg); - } - if (ar.name == NULL) - ar.name = (pushglobalfuncname(L, &ar)) ? lua_tostring(L, -1) : "?"; - return luaL_error(L, "bad argument #%d to '%s' (%s)", - arg, ar.name, extramsg); -} - - -LUALIB_API int luaL_typeerror (lua_State *L, int arg, const char *tname) { - const char *msg; - const char *typearg; - if (luaL_getmetafield(L, arg, "__name") == LUA_TSTRING) - typearg = lua_tostring(L, -1); - else if (lua_type(L, arg) == LUA_TLIGHTUSERDATA) - typearg = "light userdata"; - else - typearg = luaL_typename(L, arg); - msg = lua_pushfstring(L, "%s expected, got %s", tname, typearg); - return luaL_argerror(L, arg, msg); -} - - -static void tag_error (lua_State *L, int arg, int tag) { - luaL_typeerror(L, arg, lua_typename(L, tag)); -} - - - -LUALIB_API void luaL_where (lua_State *L, int level) { - lua_Debug ar; - if (lua_getstack(L, level, &ar)) { - lua_getinfo(L, "Sl", &ar); - if (ar.currentline > 0) { - lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline); - return; - } - } - lua_pushfstring(L, ""); -} - - - -LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) { - va_list argp; - va_start(argp, fmt); - luaL_where(L, 1); - lua_pushvfstring(L, fmt, argp); - va_end(argp); - lua_concat(L, 2); - return lua_error(L); -} - - -LUALIB_API int luaL_fileresult (lua_State *L, int stat, const char *fname) { - int en = errno; - if (stat) { - lua_pushboolean(L, 1); - return 1; - } - else { - luaL_pushfail(L); - if (fname) - lua_pushfstring(L, "%s: %s", fname, strerror(en)); - else - lua_pushstring(L, strerror(en)); - lua_pushinteger(L, en); - return 3; - } -} - - -#if !defined(l_inspectstat) - -#if defined(LUA_USE_POSIX) - -#include - - -#define l_inspectstat(stat,what) \ - if (WIFEXITED(stat)) { stat = WEXITSTATUS(stat); } \ - else if (WIFSIGNALED(stat)) { stat = WTERMSIG(stat); what = "signal"; } - -#else - -#define l_inspectstat(stat,what) - -#endif - -#endif - - -LUALIB_API int luaL_execresult (lua_State *L, int stat) { - if (stat != 0 && errno != 0) - return luaL_fileresult(L, 0, NULL); - else { - const char *what = "exit"; - l_inspectstat(stat, what); - if (*what == 'e' && stat == 0) - lua_pushboolean(L, 1); - else - luaL_pushfail(L); - lua_pushstring(L, what); - lua_pushinteger(L, stat); - return 3; - } -} - - - - - - - -LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) { - if (luaL_getmetatable(L, tname) != LUA_TNIL) - return 0; - lua_pop(L, 1); - lua_createtable(L, 0, 2); - lua_pushstring(L, tname); - lua_setfield(L, -2, "__name"); - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, tname); - return 1; -} - - -LUALIB_API void luaL_setmetatable (lua_State *L, const char *tname) { - luaL_getmetatable(L, tname); - lua_setmetatable(L, -2); -} - - -LUALIB_API void *luaL_testudata (lua_State *L, int ud, const char *tname) { - void *p = lua_touserdata(L, ud); - if (p != NULL) { - if (lua_getmetatable(L, ud)) { - luaL_getmetatable(L, tname); - if (!lua_rawequal(L, -1, -2)) - p = NULL; - lua_pop(L, 2); - return p; - } - } - return NULL; -} - - -LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) { - void *p = luaL_testudata(L, ud, tname); - luaL_argexpected(L, p != NULL, ud, tname); - return p; -} - - - - - - -LUALIB_API int luaL_checkoption (lua_State *L, int arg, const char *def, - const char *const lst[]) { - const char *name = (def) ? luaL_optstring(L, arg, def) : - luaL_checkstring(L, arg); - int i; - for (i=0; lst[i]; i++) - if (strcmp(lst[i], name) == 0) - return i; - return luaL_argerror(L, arg, - lua_pushfstring(L, "invalid option '%s'", name)); -} - - - -LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *msg) { - if (l_unlikely(!lua_checkstack(L, space))) { - if (msg) - luaL_error(L, "stack overflow (%s)", msg); - else - luaL_error(L, "stack overflow"); - } -} - - -LUALIB_API void luaL_checktype (lua_State *L, int arg, int t) { - if (l_unlikely(lua_type(L, arg) != t)) - tag_error(L, arg, t); -} - - -LUALIB_API void luaL_checkany (lua_State *L, int arg) { - if (l_unlikely(lua_type(L, arg) == LUA_TNONE)) - luaL_argerror(L, arg, "value expected"); -} - - -LUALIB_API const char *luaL_checklstring (lua_State *L, int arg, size_t *len) { - const char *s = lua_tolstring(L, arg, len); - if (l_unlikely(!s)) tag_error(L, arg, LUA_TSTRING); - return s; -} - - -LUALIB_API const char *luaL_optlstring (lua_State *L, int arg, - const char *def, size_t *len) { - if (lua_isnoneornil(L, arg)) { - if (len) - *len = (def ? strlen(def) : 0); - return def; - } - else return luaL_checklstring(L, arg, len); -} - - -LUALIB_API lua_Number luaL_checknumber (lua_State *L, int arg) { - int isnum; - lua_Number d = lua_tonumberx(L, arg, &isnum); - if (l_unlikely(!isnum)) - tag_error(L, arg, LUA_TNUMBER); - return d; -} - - -LUALIB_API lua_Number luaL_optnumber (lua_State *L, int arg, lua_Number def) { - return luaL_opt(L, luaL_checknumber, arg, def); -} - - -static void interror (lua_State *L, int arg) { - if (lua_isnumber(L, arg)) - luaL_argerror(L, arg, "number has no integer representation"); - else - tag_error(L, arg, LUA_TNUMBER); -} - - -LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int arg) { - int isnum; - lua_Integer d = lua_tointegerx(L, arg, &isnum); - if (l_unlikely(!isnum)) { - interror(L, arg); - } - return d; -} - - -LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int arg, - lua_Integer def) { - return luaL_opt(L, luaL_checkinteger, arg, def); -} - - - - - - - -typedef struct UBox { - void *box; - size_t bsize; -} UBox; - - - -static void *resizebox (lua_State *L, int idx, size_t newsize) { - UBox *box = (UBox *)lua_touserdata(L, idx); - if (box->bsize == newsize) - return box->box; - else { - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); - void *temp = allocf(ud, box->box, box->bsize, newsize); - if (l_unlikely(temp == NULL && newsize > 0)) { - lua_pushliteral(L, "not enough memory"); - lua_error(L); - } - box->box = temp; - box->bsize = newsize; - return temp; - } -} - - -static int boxgc (lua_State *L) { - resizebox(L, 1, 0); - return 0; -} - - -static const luaL_Reg boxmt[] = { - {"__gc", boxgc}, - {"__close", boxgc}, - {NULL, NULL} -}; - - -static void newbox (lua_State *L) { - UBox *box = (UBox *)lua_newuserdatauv(L, sizeof(UBox), 0); - box->box = NULL; - box->bsize = 0; - if (luaL_newmetatable(L, "_UBOX*")) - luaL_setfuncs(L, boxmt, 0); - lua_setmetatable(L, -2); -} - - - -#define buffonstack(B) ((B)->b != (B)->init.b) - - - -#define checkbufferlevel(B,idx) \ - lua_assert(buffonstack(B) ? lua_touserdata(B->L, idx) != NULL \ - : lua_touserdata(B->L, idx) == (void*)B) - - - -static size_t newbuffsize (luaL_Buffer *B, size_t sz) { - size_t newsize = (B->size / 2) * 3; - if (l_unlikely(MAX_SIZET - sz - 1 < B->n)) - return luaL_error(B->L, "buffer too large"); - if (newsize < B->n + sz + 1) - newsize = B->n + sz + 1; - return newsize; -} - - - -static char *prepbuffsize (luaL_Buffer *B, size_t sz, int boxidx) { - checkbufferlevel(B, boxidx); - if (B->size - B->n >= sz) - return B->b + B->n; - else { - lua_State *L = B->L; - char *newbuff; - size_t newsize = newbuffsize(B, sz); - - if (buffonstack(B)) - newbuff = (char *)resizebox(L, boxidx, newsize); - else { - lua_remove(L, boxidx); - newbox(L); - lua_insert(L, boxidx); - lua_toclose(L, boxidx); - newbuff = (char *)resizebox(L, boxidx, newsize); - memcpy(newbuff, B->b, B->n * sizeof(char)); - } - B->b = newbuff; - B->size = newsize; - return newbuff + B->n; - } -} - - -LUALIB_API char *luaL_prepbuffsize (luaL_Buffer *B, size_t sz) { - return prepbuffsize(B, sz, -1); -} - - -LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) { - if (l > 0) { - char *b = prepbuffsize(B, l, -1); - memcpy(b, s, l * sizeof(char)); - luaL_addsize(B, l); - } -} - - -LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) { - luaL_addlstring(B, s, strlen(s)); -} - - -LUALIB_API void luaL_pushresult (luaL_Buffer *B) { - lua_State *L = B->L; - checkbufferlevel(B, -1); - if (!buffonstack(B)) - lua_pushlstring(L, B->b, B->n); - else { - UBox *box = (UBox *)lua_touserdata(L, -1); - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); - size_t len = B->n; - char *s; - resizebox(L, -1, len + 1); - s = (char*)box->box; - s[len] = '\0'; - - box->bsize = 0; box->box = NULL; - lua_pushextlstring(L, s, len, allocf, ud); - lua_closeslot(L, -2); - } - lua_remove(L, -2); -} - - -LUALIB_API void luaL_pushresultsize (luaL_Buffer *B, size_t sz) { - luaL_addsize(B, sz); - luaL_pushresult(B); -} - - - -LUALIB_API void luaL_addvalue (luaL_Buffer *B) { - lua_State *L = B->L; - size_t len; - const char *s = lua_tolstring(L, -1, &len); - char *b = prepbuffsize(B, len, -2); - memcpy(b, s, len * sizeof(char)); - luaL_addsize(B, len); - lua_pop(L, 1); -} - - -LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) { - B->L = L; - B->b = B->init.b; - B->n = 0; - B->size = LUAL_BUFFERSIZE; - lua_pushlightuserdata(L, (void*)B); -} - - -LUALIB_API char *luaL_buffinitsize (lua_State *L, luaL_Buffer *B, size_t sz) { - luaL_buffinit(L, B); - return prepbuffsize(B, sz, -1); -} - - - - - - - -LUALIB_API int luaL_ref (lua_State *L, int t) { - int ref; - if (lua_isnil(L, -1)) { - lua_pop(L, 1); - return LUA_REFNIL; - } - t = lua_absindex(L, t); - if (lua_rawgeti(L, t, 1) == LUA_TNUMBER) - ref = (int)lua_tointeger(L, -1); - else { - lua_assert(!lua_toboolean(L, -1)); - ref = 0; - lua_pushinteger(L, 0); - lua_rawseti(L, t, 1); - } - lua_pop(L, 1); - if (ref != 0) { - lua_rawgeti(L, t, ref); - lua_rawseti(L, t, 1); - } - else - ref = (int)lua_rawlen(L, t) + 1; - lua_rawseti(L, t, ref); - return ref; -} - - -LUALIB_API void luaL_unref (lua_State *L, int t, int ref) { - if (ref >= 0) { - t = lua_absindex(L, t); - lua_rawgeti(L, t, 1); - lua_assert(lua_isinteger(L, -1)); - lua_rawseti(L, t, ref); - lua_pushinteger(L, ref); - lua_rawseti(L, t, 1); - } -} - - - - - - -typedef struct LoadF { - int n; - FILE *f; - char buff[BUFSIZ]; -} LoadF; - - -static const char *getF (lua_State *L, void *ud, size_t *size) { - LoadF *lf = (LoadF *)ud; - (void)L; - if (lf->n > 0) { - *size = lf->n; - lf->n = 0; - } - else { - - if (feof(lf->f)) return NULL; - *size = fread(lf->buff, 1, sizeof(lf->buff), lf->f); - } - return lf->buff; -} - - -static int errfile (lua_State *L, const char *what, int fnameindex) { - const char *serr = strerror(errno); - const char *filename = lua_tostring(L, fnameindex) + 1; - lua_pushfstring(L, "cannot %s %s: %s", what, filename, serr); - lua_remove(L, fnameindex); - return LUA_ERRFILE; -} - - - -static int skipBOM (FILE *f) { - int c = getc(f); - if (c == 0xEF && getc(f) == 0xBB && getc(f) == 0xBF) - return getc(f); - else - return c; -} - - - -static int skipcomment (FILE *f, int *cp) { - int c = *cp = skipBOM(f); - if (c == '#') { - do { - c = getc(f); - } while (c != EOF && c != '\n'); - *cp = getc(f); - return 1; - } - else return 0; -} - - -LUALIB_API int luaL_loadfilex (lua_State *L, const char *filename, - const char *mode) { - LoadF lf; - int status, readstatus; - int c; - int fnameindex = lua_gettop(L) + 1; - if (filename == NULL) { - lua_pushliteral(L, "=stdin"); - lf.f = stdin; - } - else { - lua_pushfstring(L, "@%s", filename); - lf.f = fopen(filename, "r"); - if (lf.f == NULL) return errfile(L, "open", fnameindex); - } - lf.n = 0; - if (skipcomment(lf.f, &c)) - lf.buff[lf.n++] = '\n'; - if (c == LUA_SIGNATURE[0]) { - lf.n = 0; - if (filename) { - lf.f = freopen(filename, "rb", lf.f); - if (lf.f == NULL) return errfile(L, "reopen", fnameindex); - skipcomment(lf.f, &c); - } - } - if (c != EOF) - lf.buff[lf.n++] = c; - status = lua_load(L, getF, &lf, lua_tostring(L, -1), mode); - readstatus = ferror(lf.f); - if (filename) fclose(lf.f); - if (readstatus) { - lua_settop(L, fnameindex); - return errfile(L, "read", fnameindex); - } - lua_remove(L, fnameindex); - return status; -} - - -typedef struct LoadS { - const char *s; - size_t size; -} LoadS; - - -static const char *getS (lua_State *L, void *ud, size_t *size) { - LoadS *ls = (LoadS *)ud; - (void)L; - if (ls->size == 0) return NULL; - *size = ls->size; - ls->size = 0; - return ls->s; -} - - -LUALIB_API int luaL_loadbufferx (lua_State *L, const char *buff, size_t size, - const char *name, const char *mode) { - LoadS ls; - ls.s = buff; - ls.size = size; - return lua_load(L, getS, &ls, name, mode); -} - - -LUALIB_API int luaL_loadstring (lua_State *L, const char *s) { - return luaL_loadbuffer(L, s, strlen(s), s); -} - - - - - -LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) { - if (!lua_getmetatable(L, obj)) - return LUA_TNIL; - else { - int tt; - lua_pushstring(L, event); - tt = lua_rawget(L, -2); - if (tt == LUA_TNIL) - lua_pop(L, 2); - else - lua_remove(L, -2); - return tt; - } -} - - -LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) { - obj = lua_absindex(L, obj); - if (luaL_getmetafield(L, obj, event) == LUA_TNIL) - return 0; - lua_pushvalue(L, obj); - lua_call(L, 1, 1); - return 1; -} - - -LUALIB_API lua_Integer luaL_len (lua_State *L, int idx) { - lua_Integer l; - int isnum; - lua_len(L, idx); - l = lua_tointegerx(L, -1, &isnum); - if (l_unlikely(!isnum)) - luaL_error(L, "object length is not an integer"); - lua_pop(L, 1); - return l; -} - - -LUALIB_API const char *luaL_tolstring (lua_State *L, int idx, size_t *len) { - idx = lua_absindex(L,idx); - if (luaL_callmeta(L, idx, "__tostring")) { - if (!lua_isstring(L, -1)) - luaL_error(L, "'__tostring' must return a string"); - } - else { - switch (lua_type(L, idx)) { - case LUA_TNUMBER: { - if (lua_isinteger(L, idx)) - lua_pushfstring(L, "%I", (LUAI_UACINT)lua_tointeger(L, idx)); - else - lua_pushfstring(L, "%f", (LUAI_UACNUMBER)lua_tonumber(L, idx)); - break; - } - case LUA_TSTRING: - lua_pushvalue(L, idx); - break; - case LUA_TBOOLEAN: - lua_pushstring(L, (lua_toboolean(L, idx) ? "true" : "false")); - break; - case LUA_TNIL: - lua_pushliteral(L, "nil"); - break; - default: { - int tt = luaL_getmetafield(L, idx, "__name"); - const char *kind = (tt == LUA_TSTRING) ? lua_tostring(L, -1) : - luaL_typename(L, idx); - lua_pushfstring(L, "%s: %p", kind, lua_topointer(L, idx)); - if (tt != LUA_TNIL) - lua_remove(L, -2); - break; - } - } - } - return lua_tolstring(L, -1, len); -} - - - -LUALIB_API void luaL_setfuncs (lua_State *L, const luaL_Reg *l, int nup) { - luaL_checkstack(L, nup, "too many upvalues"); - for (; l->name != NULL; l++) { - if (l->func == NULL) - lua_pushboolean(L, 0); - else { - int i; - for (i = 0; i < nup; i++) - lua_pushvalue(L, -nup); - lua_pushcclosure(L, l->func, nup); - } - lua_setfield(L, -(nup + 2), l->name); - } - lua_pop(L, nup); -} - - - -LUALIB_API int luaL_getsubtable (lua_State *L, int idx, const char *fname) { - if (lua_getfield(L, idx, fname) == LUA_TTABLE) - return 1; - else { - lua_pop(L, 1); - idx = lua_absindex(L, idx); - lua_newtable(L); - lua_pushvalue(L, -1); - lua_setfield(L, idx, fname); - return 0; - } -} - - - -LUALIB_API void luaL_requiref (lua_State *L, const char *modname, - lua_CFunction openf, int glb) { - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_getfield(L, -1, modname); - if (!lua_toboolean(L, -1)) { - lua_pop(L, 1); - lua_pushcfunction(L, openf); - lua_pushstring(L, modname); - lua_call(L, 1, 1); - lua_pushvalue(L, -1); - lua_setfield(L, -3, modname); - } - lua_remove(L, -2); - if (glb) { - lua_pushvalue(L, -1); - lua_setglobal(L, modname); - } -} - - -LUALIB_API void luaL_addgsub (luaL_Buffer *b, const char *s, - const char *p, const char *r) { - const char *wild; - size_t l = strlen(p); - while ((wild = strstr(s, p)) != NULL) { - luaL_addlstring(b, s, wild - s); - luaL_addstring(b, r); - s = wild + l; - } - luaL_addstring(b, s); -} - - -LUALIB_API const char *luaL_gsub (lua_State *L, const char *s, - const char *p, const char *r) { - luaL_Buffer b; - luaL_buffinit(L, &b); - luaL_addgsub(&b, s, p, r); - luaL_pushresult(&b); - return lua_tostring(L, -1); -} - - -static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) { - (void)ud; (void)osize; - if (nsize == 0) { - free(ptr); - return NULL; - } - else - return realloc(ptr, nsize); -} - - - -static int panic (lua_State *L) { - const char *msg = (lua_type(L, -1) == LUA_TSTRING) - ? lua_tostring(L, -1) - : "private_lua_error object is not a string"; - lua_writestringerror("PANIC: unprotected private_lua_error in call to Lua API (%s)\n", - msg); - return 0; -} - - - -static void warnfoff (void *ud, const char *message, int tocont); -static void warnfon (void *ud, const char *message, int tocont); -static void warnfcont (void *ud, const char *message, int tocont); - - - -static int checkcontrol (lua_State *L, const char *message, int tocont) { - if (tocont || *(message++) != '@') - return 0; - else { - if (strcmp(message, "off") == 0) - lua_setwarnf(L, warnfoff, L); - else if (strcmp(message, "on") == 0) - lua_setwarnf(L, warnfon, L); - return 1; - } -} - - -static void warnfoff (void *ud, const char *message, int tocont) { - checkcontrol((lua_State *)ud, message, tocont); -} - - - -static void warnfcont (void *ud, const char *message, int tocont) { - lua_State *L = (lua_State *)ud; - lua_writestringerror("%s", message); - if (tocont) - lua_setwarnf(L, warnfcont, L); - else { - lua_writestringerror("%s", "\n"); - lua_setwarnf(L, warnfon, L); - } -} - - -static void warnfon (void *ud, const char *message, int tocont) { - if (checkcontrol((lua_State *)ud, message, tocont)) - return; - lua_writestringerror("%s", "Lua warning: "); - warnfcont(ud, message, tocont); -} - - - - -#if !defined(luai_makeseed) - -#include - - - -#define BUFSEEDB (sizeof(void*) + sizeof(time_t)) - - -#define BUFSEED ((BUFSEEDB + sizeof(int) - 1) / sizeof(int)) - - -#define addbuff(b,v) (memcpy(&b[0], &(v), sizeof(v)), b += sizeof(v)) - - -static unsigned int luai_makeseed (void) { - unsigned int buff[BUFSEED]; - unsigned int res; - unsigned int i; - time_t t = time(NULL); - char *b = (char*)buff; - addbuff(b, b); - addbuff(b, t); - - memset(b, 0, sizeof(buff) - BUFSEEDB); - res = buff[0]; - for (i = 1; i < BUFSEED; i++) - res ^= (res >> 3) + (res << 7) + buff[i]; - return res; -} - -#endif - - -LUALIB_API unsigned int luaL_makeseed (lua_State *L) { - (void)L; - return luai_makeseed(); -} - - -LUALIB_API lua_State *luaL_newstate (void) { - lua_State *L = lua_newstate(l_alloc, NULL, luai_makeseed()); - if (l_likely(L)) { - lua_atpanic(L, &panic); - lua_setwarnf(L, warnfoff, L); - } - return L; -} - - -LUALIB_API void luaL_checkversion_ (lua_State *L, lua_Number ver, size_t sz) { - lua_Number v = lua_version(L); - if (sz != LUAL_NUMSIZES) - luaL_error(L, "core and library have incompatible numeric types"); - else if (v != ver) - luaL_error(L, "version mismatch: app. needs %f, Lua core provides %f", - (LUAI_UACNUMBER)ver, (LUAI_UACNUMBER)v); -} - - - - - - - -#ifndef MAKE_LUAC -//path: src/dependencies/lua/lbaselib.c - - -#define lbaselib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include - - - - - - -//path: src/dependencies/lua/lualib.h - - - -#ifndef lualib_h -#define lualib_h - - - - - - -#define LUA_VERSUFFIX "_" LUA_VERSION_MAJOR "_" LUA_VERSION_MINOR - -#define LUA_GLIBK 1 -LUAMOD_API int (luaopen_base) (lua_State *L); - -#define LUA_LOADLIBNAME "package" -#define LUA_LOADLIBK (LUA_GLIBK << 1) -LUAMOD_API int (luaopen_package) (lua_State *L); - - -#define LUA_COLIBNAME "coroutine" -#define LUA_COLIBK (LUA_LOADLIBK << 1) -LUAMOD_API int (luaopen_coroutine) (lua_State *L); - -#define LUA_DBLIBNAME "debug" -#define LUA_DBLIBK (LUA_COLIBK << 1) -LUAMOD_API int (luaopen_debug) (lua_State *L); - -#define LUA_IOLIBNAME "io" -#define LUA_IOLIBK (LUA_DBLIBK << 1) -LUAMOD_API int (luaopen_io) (lua_State *L); - -#define LUA_MATHLIBNAME "math" -#define LUA_MATHLIBK (LUA_IOLIBK << 1) -LUAMOD_API int (luaopen_math) (lua_State *L); - -#define LUA_OSLIBNAME "os" -#define LUA_OSLIBK (LUA_MATHLIBK << 1) -LUAMOD_API int (luaopen_os) (lua_State *L); - -#define LUA_STRLIBNAME "string" -#define LUA_STRLIBK (LUA_OSLIBK << 1) -LUAMOD_API int (luaopen_string) (lua_State *L); - -#define LUA_TABLIBNAME "table" -#define LUA_TABLIBK (LUA_STRLIBK << 1) -LUAMOD_API int (luaopen_table) (lua_State *L); - -#define LUA_UTF8LIBNAME "utf8" -#define LUA_UTF8LIBK (LUA_TABLIBK << 1) -LUAMOD_API int (luaopen_utf8) (lua_State *L); - - - -LUALIB_API void (luaL_openselectedlibs) (lua_State *L, int load, int preload); - - -#define luaL_openlibs(L) luaL_openselectedlibs(L, ~0, 0) - - -#endif - - - - -static int luaB_print (lua_State *L) { - int n = lua_gettop(L); - int i; - for (i = 1; i <= n; i++) { - size_t l; - const char *s = luaL_tolstring(L, i, &l); - if (i > 1) - lua_writestring("\t", 1); - lua_writestring(s, l); - lua_pop(L, 1); - } - lua_writeline(); - return 0; -} - - - -static int luaB_warn (lua_State *L) { - int n = lua_gettop(L); - int i; - luaL_checkstring(L, 1); - for (i = 2; i <= n; i++) - luaL_checkstring(L, i); - for (i = 1; i < n; i++) - lua_warning(L, lua_tostring(L, i), 1); - lua_warning(L, lua_tostring(L, n), 0); - return 0; -} - - -#define SPACECHARS " \f\n\r\t\v" - -static const char *b_str2int (const char *s, int base, lua_Integer *pn) { - lua_Unsigned n = 0; - int neg = 0; - s += strspn(s, SPACECHARS); - if (*s == '-') { s++; neg = 1; } - else if (*s == '+') s++; - if (!isalnum((unsigned char)*s)) - return NULL; - do { - int digit = (isdigit((unsigned char)*s)) ? *s - '0' - : (toupper((unsigned char)*s) - 'A') + 10; - if (digit >= base) return NULL; - n = n * base + digit; - s++; - } while (isalnum((unsigned char)*s)); - s += strspn(s, SPACECHARS); - *pn = (lua_Integer)((neg) ? (0u - n) : n); - return s; -} - - -static int luaB_tonumber (lua_State *L) { - if (lua_isnoneornil(L, 2)) { - if (lua_type(L, 1) == LUA_TNUMBER) { - lua_settop(L, 1); - return 1; - } - else { - size_t l; - const char *s = lua_tolstring(L, 1, &l); - if (s != NULL && lua_stringtonumber(L, s) == l + 1) - return 1; - - luaL_checkany(L, 1); - } - } - else { - size_t l; - const char *s; - lua_Integer n = 0; - lua_Integer base = luaL_checkinteger(L, 2); - luaL_checktype(L, 1, LUA_TSTRING); - s = lua_tolstring(L, 1, &l); - luaL_argcheck(L, 2 <= base && base <= 36, 2, "base out of range"); - if (b_str2int(s, (int)base, &n) == s + l) { - lua_pushinteger(L, n); - return 1; - } - } - luaL_pushfail(L); - return 1; -} - - -static int luaB_error (lua_State *L) { - int level = (int)luaL_optinteger(L, 2, 1); - lua_settop(L, 1); - if (lua_type(L, 1) == LUA_TSTRING && level > 0) { - luaL_where(L, level); - lua_pushvalue(L, 1); - lua_concat(L, 2); - } - return lua_error(L); -} - - -static int luaB_getmetatable (lua_State *L) { - luaL_checkany(L, 1); - if (!lua_getmetatable(L, 1)) { - lua_pushnil(L); - return 1; - } - luaL_getmetafield(L, 1, "__metatable"); - return 1; -} - - -static int luaB_setmetatable (lua_State *L) { - int t = lua_type(L, 2); - luaL_checktype(L, 1, LUA_TTABLE); - luaL_argexpected(L, t == LUA_TNIL || t == LUA_TTABLE, 2, "nil or table"); - if (l_unlikely(luaL_getmetafield(L, 1, "__metatable") != LUA_TNIL)) - return luaL_error(L, "cannot change a protected metatable"); - lua_settop(L, 2); - lua_setmetatable(L, 1); - return 1; -} - - -static int luaB_rawequal (lua_State *L) { - luaL_checkany(L, 1); - luaL_checkany(L, 2); - lua_pushboolean(L, lua_rawequal(L, 1, 2)); - return 1; -} - - -static int luaB_rawlen (lua_State *L) { - int t = lua_type(L, 1); - luaL_argexpected(L, t == LUA_TTABLE || t == LUA_TSTRING, 1, - "table or string"); - lua_pushinteger(L, lua_rawlen(L, 1)); - return 1; -} - - -static int luaB_rawget (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - luaL_checkany(L, 2); - lua_settop(L, 2); - lua_rawget(L, 1); - return 1; -} - -static int luaB_rawset (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - luaL_checkany(L, 2); - luaL_checkany(L, 3); - lua_settop(L, 3); - lua_rawset(L, 1); - return 1; -} - - -static int pushmode (lua_State *L, int oldmode) { - if (oldmode == -1) - luaL_pushfail(L); - else - lua_pushstring(L, (oldmode == LUA_GCINC) ? "incremental" - : "generational"); - return 1; -} - - - -#define checkvalres(res) { if (res == -1) break; } - -static int luaB_collectgarbage (lua_State *L) { - static const char *const opts[] = {"stop", "restart", "collect", - "count", "step", "isrunning", "generational", "incremental", - "param", NULL}; - static const char optsnum[] = {LUA_GCSTOP, LUA_GCRESTART, LUA_GCCOLLECT, - LUA_GCCOUNT, LUA_GCSTEP, LUA_GCISRUNNING, LUA_GCGEN, LUA_GCINC, - LUA_GCPARAM}; - int o = optsnum[luaL_checkoption(L, 1, "collect", opts)]; - switch (o) { - case LUA_GCCOUNT: { - int k = lua_gc(L, o); - int b = lua_gc(L, LUA_GCCOUNTB); - checkvalres(k); - lua_pushnumber(L, (lua_Number)k + ((lua_Number)b/1024)); - return 1; - } - case LUA_GCSTEP: { - lua_Integer n = luaL_optinteger(L, 2, 0); - int res = lua_gc(L, o, (int)n); - checkvalres(res); - lua_pushboolean(L, res); - return 1; - } - case LUA_GCISRUNNING: { - int res = lua_gc(L, o); - checkvalres(res); - lua_pushboolean(L, res); - return 1; - } - case LUA_GCGEN: { - return pushmode(L, lua_gc(L, o)); - } - case LUA_GCINC: { - return pushmode(L, lua_gc(L, o)); - } - case LUA_GCPARAM: { - static const char *const params[] = { - "minormul", "majorminor", "minormajor", - "pause", "stepmul", "stepsize", NULL}; - static const char pnum[] = { - LUA_GCPMINORMUL, LUA_GCPMAJORMINOR, LUA_GCPMINORMAJOR, - LUA_GCPPAUSE, LUA_GCPSTEPMUL, LUA_GCPSTEPSIZE}; - int p = pnum[luaL_checkoption(L, 2, NULL, params)]; - lua_Integer value = luaL_optinteger(L, 3, -1); - lua_pushinteger(L, lua_gc(L, o, p, (int)value)); - return 1; - } - default: { - int res = lua_gc(L, o); - checkvalres(res); - lua_pushinteger(L, res); - return 1; - } - } - luaL_pushfail(L); - return 1; -} - - -static int luaB_type (lua_State *L) { - int t = lua_type(L, 1); - luaL_argcheck(L, t != LUA_TNONE, 1, "value expected"); - lua_pushstring(L, lua_typename(L, t)); - return 1; -} - - -static int luaB_next (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - lua_settop(L, 2); - if (lua_next(L, 1)) - return 2; - else { - lua_pushnil(L); - return 1; - } -} - - -static int pairscont (lua_State *L, int status, lua_KContext k) { - (void)L; (void)status; (void)k; - return 3; -} - -static int luaB_pairs (lua_State *L) { - luaL_checkany(L, 1); - if (luaL_getmetafield(L, 1, "__pairs") == LUA_TNIL) { - lua_pushcfunction(L, luaB_next); - lua_pushvalue(L, 1); - lua_pushnil(L); - } - else { - lua_pushvalue(L, 1); - lua_callk(L, 1, 3, 0, pairscont); - } - return 3; -} - - - -static int ipairsaux (lua_State *L) { - lua_Integer i = luaL_checkinteger(L, 2); - i = luaL_intop(+, i, 1); - lua_pushinteger(L, i); - return (lua_geti(L, 1, i) == LUA_TNIL) ? 1 : 2; -} - - - -static int luaB_ipairs (lua_State *L) { - luaL_checkany(L, 1); - lua_pushcfunction(L, ipairsaux); - lua_pushvalue(L, 1); - lua_pushinteger(L, 0); - return 3; -} - - -static int load_aux (lua_State *L, int status, int envidx) { - if (l_likely(status == LUA_OK)) { - if (envidx != 0) { - lua_pushvalue(L, envidx); - if (!lua_setupvalue(L, -2, 1)) - lua_pop(L, 1); - } - return 1; - } - else { - luaL_pushfail(L); - lua_insert(L, -2); - return 2; - } -} - - -static const char *getmode (lua_State *L, int idx) { - const char *mode = luaL_optstring(L, idx, "bt"); - if (strchr(mode, 'B') != NULL) - luaL_argerror(L, idx, "invalid mode"); - return mode; -} - - -static int luaB_loadfile (lua_State *L) { - const char *fname = luaL_optstring(L, 1, NULL); - const char *mode = getmode(L, 2); - int env = (!lua_isnone(L, 3) ? 3 : 0); - int status = luaL_loadfilex(L, fname, mode); - return load_aux(L, status, env); -} - - - - - - -#define RESERVEDSLOT 5 - - - -static const char *generic_reader (lua_State *L, void *ud, size_t *size) { - (void)(ud); - luaL_checkstack(L, 2, "too many nested functions"); - lua_pushvalue(L, 1); - lua_call(L, 0, 1); - if (lua_isnil(L, -1)) { - lua_pop(L, 1); - *size = 0; - return NULL; - } - else if (l_unlikely(!lua_isstring(L, -1))) - luaL_error(L, "reader function must return a string"); - lua_replace(L, RESERVEDSLOT); - return lua_tolstring(L, RESERVEDSLOT, size); -} - - -static int luaB_load (lua_State *L) { - int status; - size_t l; - const char *s = lua_tolstring(L, 1, &l); - const char *mode = getmode(L, 3); - int env = (!lua_isnone(L, 4) ? 4 : 0); - if (s != NULL) { - const char *chunkname = luaL_optstring(L, 2, s); - status = luaL_loadbufferx(L, s, l, chunkname, mode); - } - else { - const char *chunkname = luaL_optstring(L, 2, "=(load)"); - luaL_checktype(L, 1, LUA_TFUNCTION); - lua_settop(L, RESERVEDSLOT); - status = lua_load(L, generic_reader, NULL, chunkname, mode); - } - return load_aux(L, status, env); -} - - - - -static int dofilecont (lua_State *L, int d1, lua_KContext d2) { - (void)d1; (void)d2; - return lua_gettop(L) - 1; -} - - -static int luaB_dofile (lua_State *L) { - const char *fname = luaL_optstring(L, 1, NULL); - lua_settop(L, 1); - if (l_unlikely(luaL_loadfile(L, fname) != LUA_OK)) - return lua_error(L); - lua_callk(L, 0, LUA_MULTRET, 0, dofilecont); - return dofilecont(L, 0, 0); -} - - -static int luaB_assert (lua_State *L) { - if (l_likely(lua_toboolean(L, 1))) - return lua_gettop(L); - else { - luaL_checkany(L, 1); - lua_remove(L, 1); - lua_pushliteral(L, "assertion failed!"); - lua_settop(L, 1); - return luaB_error(L); - } -} - - -static int luaB_select (lua_State *L) { - int n = lua_gettop(L); - if (lua_type(L, 1) == LUA_TSTRING && *lua_tostring(L, 1) == '#') { - lua_pushinteger(L, n-1); - return 1; - } - else { - lua_Integer i = luaL_checkinteger(L, 1); - if (i < 0) i = n + i; - else if (i > n) i = n; - luaL_argcheck(L, 1 <= i, 1, "index out of range"); - return n - (int)i; - } -} - - - -static int finishpcall (lua_State *L, int status, lua_KContext extra) { - if (l_unlikely(status != LUA_OK && status != LUA_YIELD)) { - lua_pushboolean(L, 0); - lua_pushvalue(L, -2); - return 2; - } - else - return lua_gettop(L) - (int)extra; -} - - -static int luaB_pcall (lua_State *L) { - int status; - luaL_checkany(L, 1); - lua_pushboolean(L, 1); - lua_insert(L, 1); - status = lua_pcallk(L, lua_gettop(L) - 2, LUA_MULTRET, 0, 0, finishpcall); - return finishpcall(L, status, 0); -} - - - -static int luaB_xpcall (lua_State *L) { - int status; - int n = lua_gettop(L); - luaL_checktype(L, 2, LUA_TFUNCTION); - lua_pushboolean(L, 1); - lua_pushvalue(L, 1); - lua_rotate(L, 3, 2); - status = lua_pcallk(L, n - 2, LUA_MULTRET, 2, 2, finishpcall); - return finishpcall(L, status, 2); -} - - -static int luaB_tostring (lua_State *L) { - luaL_checkany(L, 1); - luaL_tolstring(L, 1, NULL); - return 1; -} - - -static const luaL_Reg base_funcs[] = { - {"assert", luaB_assert}, - {"collectgarbage", luaB_collectgarbage}, - {"dofile", luaB_dofile}, - {"error", luaB_error}, - {"getmetatable", luaB_getmetatable}, - {"ipairs", luaB_ipairs}, - {"loadfile", luaB_loadfile}, - {"load", luaB_load}, - {"next", luaB_next}, - {"pairs", luaB_pairs}, - {"pcall", luaB_pcall}, - {"print", luaB_print}, - {"warn", luaB_warn}, - {"rawequal", luaB_rawequal}, - {"rawlen", luaB_rawlen}, - {"rawget", luaB_rawget}, - {"rawset", luaB_rawset}, - {"select", luaB_select}, - {"setmetatable", luaB_setmetatable}, - {"tonumber", luaB_tonumber}, - {"tostring", luaB_tostring}, - {"type", luaB_type}, - {"xpcall", luaB_xpcall}, - - {LUA_GNAME, NULL}, - {"_VERSION", NULL}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_base (lua_State *L) { - - lua_pushglobaltable(L); - luaL_setfuncs(L, base_funcs, 0); - - lua_pushvalue(L, -1); - lua_setfield(L, -2, LUA_GNAME); - - lua_pushliteral(L, LUA_VERSION); - lua_setfield(L, -2, "_VERSION"); - return 1; -} - - - -//path: src/dependencies/lua/lcorolib.c - - -#define lcorolib_c -#define LUA_LIB - - - - - -#include - - - - - - - - - - -static lua_State *getco (lua_State *L) { - lua_State *co = lua_tothread(L, 1); - luaL_argexpected(L, co, 1, "thread"); - return co; -} - - - -static int auxresume (lua_State *L, lua_State *co, int narg) { - int status, nres; - if (l_unlikely(!lua_checkstack(co, narg))) { - lua_pushliteral(L, "too many arguments to resume"); - return -1; - } - lua_xmove(L, co, narg); - status = lua_resume(co, L, narg, &nres); - if (l_likely(status == LUA_OK || status == LUA_YIELD)) { - if (l_unlikely(!lua_checkstack(L, nres + 1))) { - lua_pop(co, nres); - lua_pushliteral(L, "too many results to resume"); - return -1; - } - lua_xmove(co, L, nres); - return nres; - } - else { - lua_xmove(co, L, 1); - return -1; - } -} - - -static int luaB_coresume (lua_State *L) { - lua_State *co = getco(L); - int r; - r = auxresume(L, co, lua_gettop(L) - 1); - if (l_unlikely(r < 0)) { - lua_pushboolean(L, 0); - lua_insert(L, -2); - return 2; - } - else { - lua_pushboolean(L, 1); - lua_insert(L, -(r + 1)); - return r + 1; - } -} - - -static int luaB_auxwrap (lua_State *L) { - lua_State *co = lua_tothread(L, lua_upvalueindex(1)); - int r = auxresume(L, co, lua_gettop(L)); - if (l_unlikely(r < 0)) { - int stat = lua_status(co); - if (stat != LUA_OK && stat != LUA_YIELD) { - stat = lua_closethread(co, L); - lua_assert(stat != LUA_OK); - lua_xmove(co, L, 1); - } - if (stat != LUA_ERRMEM && - lua_type(L, -1) == LUA_TSTRING) { - luaL_where(L, 1); - lua_insert(L, -2); - lua_concat(L, 2); - } - return lua_error(L); - } - return r; -} - - -static int luaB_cocreate (lua_State *L) { - lua_State *NL; - luaL_checktype(L, 1, LUA_TFUNCTION); - NL = lua_newthread(L); - lua_pushvalue(L, 1); - lua_xmove(L, NL, 1); - return 1; -} - - -static int luaB_cowrap (lua_State *L) { - luaB_cocreate(L); - lua_pushcclosure(L, luaB_auxwrap, 1); - return 1; -} - - -static int luaB_yield (lua_State *L) { - return lua_yield(L, lua_gettop(L)); -} - - -#define COS_RUN 0 -#define COS_DEAD 1 -#define COS_YIELD 2 -#define COS_NORM 3 - - -static const char *const statname[] = - {"running", "dead", "suspended", "normal"}; - - -static int auxstatus (lua_State *L, lua_State *co) { - if (L == co) return COS_RUN; - else { - switch (lua_status(co)) { - case LUA_YIELD: - return COS_YIELD; - case LUA_OK: { - lua_Debug ar; - if (lua_getstack(co, 0, &ar)) - return COS_NORM; - else if (lua_gettop(co) == 0) - return COS_DEAD; - else - return COS_YIELD; - } - default: - return COS_DEAD; - } - } -} - - -static int luaB_costatus (lua_State *L) { - lua_State *co = getco(L); - lua_pushstring(L, statname[auxstatus(L, co)]); - return 1; -} - - -static int luaB_yieldable (lua_State *L) { - lua_State *co = lua_isnone(L, 1) ? L : getco(L); - lua_pushboolean(L, lua_isyieldable(co)); - return 1; -} - - -static int luaB_corunning (lua_State *L) { - int ismain = lua_pushthread(L); - lua_pushboolean(L, ismain); - return 2; -} - - -static int luaB_close (lua_State *L) { - lua_State *co = getco(L); - int status = auxstatus(L, co); - switch (status) { - case COS_DEAD: case COS_YIELD: { - status = lua_closethread(co, L); - if (status == LUA_OK) { - lua_pushboolean(L, 1); - return 1; - } - else { - lua_pushboolean(L, 0); - lua_xmove(co, L, 1); - return 2; - } - } - default: - return luaL_error(L, "cannot close a %s coroutine", statname[status]); - } -} - - -static const luaL_Reg co_funcs[] = { - {"create", luaB_cocreate}, - {"resume", luaB_coresume}, - {"running", luaB_corunning}, - {"status", luaB_costatus}, - {"wrap", luaB_cowrap}, - {"yield", luaB_yield}, - {"isyieldable", luaB_yieldable}, - {"close", luaB_close}, - {NULL, NULL} -}; - - - -LUAMOD_API int luaopen_coroutine (lua_State *L) { - luaL_newlib(L, co_funcs); - return 1; -} - - - -//path: src/dependencies/lua/ldblib.c - - -#define ldblib_c -#define LUA_LIB - - - - - -#include -#include -#include - - - - - - - - - - - -static const char *const HOOKKEY = "_HOOKKEY"; - - - -static void checkstack (lua_State *L, lua_State *L1, int n) { - if (l_unlikely(L != L1 && !lua_checkstack(L1, n))) - luaL_error(L, "stack overflow"); -} - - -static int db_getregistry (lua_State *L) { - lua_pushvalue(L, LUA_REGISTRYINDEX); - return 1; -} - - -static int db_getmetatable (lua_State *L) { - luaL_checkany(L, 1); - if (!lua_getmetatable(L, 1)) { - lua_pushnil(L); - } - return 1; -} - - -static int db_setmetatable (lua_State *L) { - int t = lua_type(L, 2); - luaL_argexpected(L, t == LUA_TNIL || t == LUA_TTABLE, 2, "nil or table"); - lua_settop(L, 2); - lua_setmetatable(L, 1); - return 1; -} - - -static int db_getuservalue (lua_State *L) { - int n = (int)luaL_optinteger(L, 2, 1); - if (lua_type(L, 1) != LUA_TUSERDATA) - luaL_pushfail(L); - else if (lua_getiuservalue(L, 1, n) != LUA_TNONE) { - lua_pushboolean(L, 1); - return 2; - } - return 1; -} - - -static int db_setuservalue (lua_State *L) { - int n = (int)luaL_optinteger(L, 3, 1); - luaL_checktype(L, 1, LUA_TUSERDATA); - luaL_checkany(L, 2); - lua_settop(L, 2); - if (!lua_setiuservalue(L, 1, n)) - luaL_pushfail(L); - return 1; -} - - - -static lua_State *getthread (lua_State *L, int *arg) { - if (lua_isthread(L, 1)) { - *arg = 1; - return lua_tothread(L, 1); - } - else { - *arg = 0; - return L; - } -} - - - -static void settabss (lua_State *L, const char *k, const char *v) { - lua_pushstring(L, v); - lua_setfield(L, -2, k); -} - -static void settabsi (lua_State *L, const char *k, int v) { - lua_pushinteger(L, v); - lua_setfield(L, -2, k); -} - -static void settabsb (lua_State *L, const char *k, int v) { - lua_pushboolean(L, v); - lua_setfield(L, -2, k); -} - - - -static void treatstackoption (lua_State *L, lua_State *L1, const char *fname) { - if (L == L1) - lua_rotate(L, -2, 1); - else - lua_xmove(L1, L, 1); - lua_setfield(L, -2, fname); -} - - - -static int db_getinfo (lua_State *L) { - lua_Debug ar; - int arg; - lua_State *L1 = getthread(L, &arg); - const char *options = luaL_optstring(L, arg+2, "flnSrtu"); - checkstack(L, L1, 3); - luaL_argcheck(L, options[0] != '>', arg + 2, "invalid option '>'"); - if (lua_isfunction(L, arg + 1)) { - options = lua_pushfstring(L, ">%s", options); - lua_pushvalue(L, arg + 1); - lua_xmove(L, L1, 1); - } - else { - if (!lua_getstack(L1, (int)luaL_checkinteger(L, arg + 1), &ar)) { - luaL_pushfail(L); - return 1; - } - } - if (!lua_getinfo(L1, options, &ar)) - return luaL_argerror(L, arg+2, "invalid option"); - lua_newtable(L); - if (strchr(options, 'S')) { - lua_pushlstring(L, ar.source, ar.srclen); - lua_setfield(L, -2, "source"); - settabss(L, "short_src", ar.short_src); - settabsi(L, "linedefined", ar.linedefined); - settabsi(L, "lastlinedefined", ar.lastlinedefined); - settabss(L, "what", ar.what); - } - if (strchr(options, 'l')) - settabsi(L, "currentline", ar.currentline); - if (strchr(options, 'u')) { - settabsi(L, "nups", ar.nups); - settabsi(L, "nparams", ar.nparams); - settabsb(L, "isvararg", ar.isvararg); - } - if (strchr(options, 'n')) { - settabss(L, "name", ar.name); - settabss(L, "namewhat", ar.namewhat); - } - if (strchr(options, 'r')) { - settabsi(L, "ftransfer", ar.ftransfer); - settabsi(L, "ntransfer", ar.ntransfer); - } - if (strchr(options, 't')) - settabsb(L, "istailcall", ar.istailcall); - if (strchr(options, 'L')) - treatstackoption(L, L1, "activelines"); - if (strchr(options, 'f')) - treatstackoption(L, L1, "func"); - return 1; -} - - -static int db_getlocal (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - int nvar = (int)luaL_checkinteger(L, arg + 2); - if (lua_isfunction(L, arg + 1)) { - lua_pushvalue(L, arg + 1); - lua_pushstring(L, lua_getlocal(L, NULL, nvar)); - return 1; - } - else { - lua_Debug ar; - const char *name; - int level = (int)luaL_checkinteger(L, arg + 1); - if (l_unlikely(!lua_getstack(L1, level, &ar))) - return luaL_argerror(L, arg+1, "level out of range"); - checkstack(L, L1, 1); - name = lua_getlocal(L1, &ar, nvar); - if (name) { - lua_xmove(L1, L, 1); - lua_pushstring(L, name); - lua_rotate(L, -2, 1); - return 2; - } - else { - luaL_pushfail(L); - return 1; - } - } -} - - -static int db_setlocal (lua_State *L) { - int arg; - const char *name; - lua_State *L1 = getthread(L, &arg); - lua_Debug ar; - int level = (int)luaL_checkinteger(L, arg + 1); - int nvar = (int)luaL_checkinteger(L, arg + 2); - if (l_unlikely(!lua_getstack(L1, level, &ar))) - return luaL_argerror(L, arg+1, "level out of range"); - luaL_checkany(L, arg+3); - lua_settop(L, arg+3); - checkstack(L, L1, 1); - lua_xmove(L, L1, 1); - name = lua_setlocal(L1, &ar, nvar); - if (name == NULL) - lua_pop(L1, 1); - lua_pushstring(L, name); - return 1; -} - - - -static int auxupvalue (lua_State *L, int get) { - const char *name; - int n = (int)luaL_checkinteger(L, 2); - luaL_checktype(L, 1, LUA_TFUNCTION); - name = get ? lua_getupvalue(L, 1, n) : lua_setupvalue(L, 1, n); - if (name == NULL) return 0; - lua_pushstring(L, name); - lua_insert(L, -(get+1)); - return get + 1; -} - - -static int db_getupvalue (lua_State *L) { - return auxupvalue(L, 1); -} - - -static int db_setupvalue (lua_State *L) { - luaL_checkany(L, 3); - return auxupvalue(L, 0); -} - - - -static void *checkupval (lua_State *L, int argf, int argnup, int *pnup) { - void *id; - int nup = (int)luaL_checkinteger(L, argnup); - luaL_checktype(L, argf, LUA_TFUNCTION); - id = lua_upvalueid(L, argf, nup); - if (pnup) { - luaL_argcheck(L, id != NULL, argnup, "invalid upvalue index"); - *pnup = nup; - } - return id; -} - - -static int db_upvalueid (lua_State *L) { - void *id = checkupval(L, 1, 2, NULL); - if (id != NULL) - lua_pushlightuserdata(L, id); - else - luaL_pushfail(L); - return 1; -} - - -static int db_upvaluejoin (lua_State *L) { - int n1, n2; - checkupval(L, 1, 2, &n1); - checkupval(L, 3, 4, &n2); - luaL_argcheck(L, !lua_iscfunction(L, 1), 1, "Lua function expected"); - luaL_argcheck(L, !lua_iscfunction(L, 3), 3, "Lua function expected"); - lua_upvaluejoin(L, 1, n1, 3, n2); - return 0; -} - - - -static void hookf (lua_State *L, lua_Debug *ar) { - static const char *const hooknames[] = - {"call", "return", "line", "count", "tail call"}; - lua_getfield(L, LUA_REGISTRYINDEX, HOOKKEY); - lua_pushthread(L); - if (lua_rawget(L, -2) == LUA_TFUNCTION) { - lua_pushstring(L, hooknames[(int)ar->event]); - if (ar->currentline >= 0) - lua_pushinteger(L, ar->currentline); - else lua_pushnil(L); - lua_assert(lua_getinfo(L, "lS", ar)); - lua_call(L, 2, 0); - } -} - - - -static int makemask (const char *smask, int count) { - int mask = 0; - if (strchr(smask, 'c')) mask |= LUA_MASKCALL; - if (strchr(smask, 'r')) mask |= LUA_MASKRET; - if (strchr(smask, 'l')) mask |= LUA_MASKLINE; - if (count > 0) mask |= LUA_MASKCOUNT; - return mask; -} - - - -static char *unmakemask (int mask, char *smask) { - int i = 0; - if (mask & LUA_MASKCALL) smask[i++] = 'c'; - if (mask & LUA_MASKRET) smask[i++] = 'r'; - if (mask & LUA_MASKLINE) smask[i++] = 'l'; - smask[i] = '\0'; - return smask; -} - - -static int db_sethook (lua_State *L) { - int arg, mask, count; - lua_Hook func; - lua_State *L1 = getthread(L, &arg); - if (lua_isnoneornil(L, arg+1)) { - lua_settop(L, arg+1); - func = NULL; mask = 0; count = 0; - } - else { - const char *smask = luaL_checkstring(L, arg+2); - luaL_checktype(L, arg+1, LUA_TFUNCTION); - count = (int)luaL_optinteger(L, arg + 3, 0); - func = hookf; mask = makemask(smask, count); - } - if (!luaL_getsubtable(L, LUA_REGISTRYINDEX, HOOKKEY)) { - - lua_pushliteral(L, "k"); - lua_setfield(L, -2, "__mode"); - lua_pushvalue(L, -1); - lua_setmetatable(L, -2); - } - checkstack(L, L1, 1); - lua_pushthread(L1); lua_xmove(L1, L, 1); - lua_pushvalue(L, arg + 1); - lua_rawset(L, -3); - lua_sethook(L1, func, mask, count); - return 0; -} - - -static int db_gethook (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - char buff[5]; - int mask = lua_gethookmask(L1); - lua_Hook hook = lua_gethook(L1); - if (hook == NULL) { - luaL_pushfail(L); - return 1; - } - else if (hook != hookf) - lua_pushliteral(L, "external hook"); - else { - lua_getfield(L, LUA_REGISTRYINDEX, HOOKKEY); - checkstack(L, L1, 1); - lua_pushthread(L1); lua_xmove(L1, L, 1); - lua_rawget(L, -2); - lua_remove(L, -2); - } - lua_pushstring(L, unmakemask(mask, buff)); - lua_pushinteger(L, lua_gethookcount(L1)); - return 3; -} - - -static int db_debug (lua_State *L) { - for (;;) { - char buffer[250]; - lua_writestringerror("%s", "lua_debug> "); - if (fgets(buffer, sizeof(buffer), stdin) == NULL || - strcmp(buffer, "cont\n") == 0) - return 0; - if (luaL_loadbuffer(L, buffer, strlen(buffer), "=(debug command)") || - lua_pcall(L, 0, 0, 0)) - lua_writestringerror("%s\n", luaL_tolstring(L, -1, NULL)); - lua_settop(L, 0); - } -} - - -static int db_traceback (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - const char *msg = lua_tostring(L, arg + 1); - if (msg == NULL && !lua_isnoneornil(L, arg + 1)) - lua_pushvalue(L, arg + 1); - else { - int level = (int)luaL_optinteger(L, arg + 2, (L == L1) ? 1 : 0); - luaL_traceback(L, L1, msg, level); - } - return 1; -} - - -static const luaL_Reg dblib[] = { - {"debug", db_debug}, - {"getuservalue", db_getuservalue}, - {"gethook", db_gethook}, - {"getinfo", db_getinfo}, - {"getlocal", db_getlocal}, - {"getregistry", db_getregistry}, - {"getmetatable", db_getmetatable}, - {"getupvalue", db_getupvalue}, - {"upvaluejoin", db_upvaluejoin}, - {"upvalueid", db_upvalueid}, - {"setuservalue", db_setuservalue}, - {"sethook", db_sethook}, - {"setlocal", db_setlocal}, - {"setmetatable", db_setmetatable}, - {"setupvalue", db_setupvalue}, - {"traceback", db_traceback}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_debug (lua_State *L) { - luaL_newlib(L, dblib); - return 1; -} - - - -//path: src/dependencies/lua/liolib.c - - -#define liolib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include -#include -#include - - - - - - - - - - - - - -#if !defined(l_checkmode) - - -#if !defined(L_MODEEXT) -#define L_MODEEXT "b" -#endif - - -static int l_checkmode (const char *mode) { - return (*mode != '\0' && strchr("rwa", *(mode++)) != NULL && - (*mode != '+' || ((void)(++mode), 1)) && - (strspn(mode, L_MODEEXT) == strlen(mode))); -} - -#endif - - - -#if !defined(l_popen) - -#if defined(LUA_USE_POSIX) - -#define l_popen(L,c,m) (fflush(NULL), popen(c,m)) -#define l_pclose(L,file) (pclose(file)) - -#elif defined(LUA_USE_WINDOWS) - -#define l_popen(L,c,m) (_popen(c,m)) -#define l_pclose(L,file) (_pclose(file)) - -#if !defined(l_checkmodep) - -#define l_checkmodep(m) ((m[0] == 'r' || m[0] == 'w') && \ - (m[1] == '\0' || ((m[1] == 'b' || m[1] == 't') && m[2] == '\0'))) -#endif - -#else - - -#define l_popen(L,c,m) \ - ((void)c, (void)m, \ - luaL_error(L, "'popen' not supported"), \ - (FILE*)0) -#define l_pclose(L,file) ((void)L, (void)file, -1) - -#endif - -#endif - - -#if !defined(l_checkmodep) - -#define l_checkmodep(m) ((m[0] == 'r' || m[0] == 'w') && m[1] == '\0') -#endif - - - - -#if !defined(l_getc) - -#if defined(LUA_USE_POSIX) -#define l_getc(f) getc_unlocked(f) -#define l_lockfile(f) flockfile(f) -#define l_unlockfile(f) funlockfile(f) -#else -#define l_getc(f) getc(f) -#define l_lockfile(f) ((void)0) -#define l_unlockfile(f) ((void)0) -#endif - -#endif - - - - -#if !defined(l_fseek) - -#if defined(LUA_USE_POSIX) - -#include - -#define l_fseek(f,o,w) fseeko(f,o,w) -#define l_ftell(f) ftello(f) -#define l_seeknum off_t - -#elif defined(LUA_USE_WINDOWS) && !defined(_CRTIMP_TYPEINFO) \ - && defined(_MSC_VER) && (_MSC_VER >= 1400) - - -#define l_fseek(f,o,w) _fseeki64(f,o,w) -#define l_ftell(f) _ftelli64(f) -#define l_seeknum __int64 - -#else - - -#define l_fseek(f,o,w) fseek(f,o,w) -#define l_ftell(f) ftell(f) -#define l_seeknum long - -#endif - -#endif - - - - - -#define IO_PREFIX "_IO_" -#define IOPREF_LEN (sizeof(IO_PREFIX)/sizeof(char) - 1) -#define IO_INPUT (IO_PREFIX "input") -#define IO_OUTPUT (IO_PREFIX "output") - - -typedef luaL_Stream LStream; - - -#define tolstream(L) ((LStream *)luaL_checkudata(L, 1, LUA_FILEHANDLE)) - -#define isclosed(p) ((p)->closef == NULL) - - -static int io_type (lua_State *L) { - LStream *p; - luaL_checkany(L, 1); - p = (LStream *)luaL_testudata(L, 1, LUA_FILEHANDLE); - if (p == NULL) - luaL_pushfail(L); - else if (isclosed(p)) - lua_pushliteral(L, "closed file"); - else - lua_pushliteral(L, "file"); - return 1; -} - - -static int f_tostring (lua_State *L) { - LStream *p = tolstream(L); - if (isclosed(p)) - lua_pushliteral(L, "file (closed)"); - else - lua_pushfstring(L, "file (%p)", p->f); - return 1; -} - - -static FILE *tofile (lua_State *L) { - LStream *p = tolstream(L); - if (l_unlikely(isclosed(p))) - luaL_error(L, "attempt to use a closed file"); - lua_assert(p->f); - return p->f; -} - - - -static LStream *newprefile (lua_State *L) { - LStream *p = (LStream *)lua_newuserdatauv(L, sizeof(LStream), 0); - p->closef = NULL; - luaL_setmetatable(L, LUA_FILEHANDLE); - return p; -} - - - -static int aux_close (lua_State *L) { - LStream *p = tolstream(L); - volatile lua_CFunction cf = p->closef; - p->closef = NULL; - return (*cf)(L); -} - - -static int f_close (lua_State *L) { - tofile(L); - return aux_close(L); -} - - -static int io_close (lua_State *L) { - if (lua_isnone(L, 1)) - lua_getfield(L, LUA_REGISTRYINDEX, IO_OUTPUT); - return f_close(L); -} - - -static int f_gc (lua_State *L) { - LStream *p = tolstream(L); - if (!isclosed(p) && p->f != NULL) - aux_close(L); - return 0; -} - - - -static int io_fclose (lua_State *L) { - LStream *p = tolstream(L); - int res = fclose(p->f); - return luaL_fileresult(L, (res == 0), NULL); -} - - -static LStream *newfile (lua_State *L) { - LStream *p = newprefile(L); - p->f = NULL; - p->closef = &io_fclose; - return p; -} - - -static void opencheck (lua_State *L, const char *fname, const char *mode) { - LStream *p = newfile(L); - p->f = fopen(fname, mode); - if (l_unlikely(p->f == NULL)) - luaL_error(L, "cannot open file '%s' (%s)", fname, strerror(errno)); -} - - -static int io_open (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - const char *mode = luaL_optstring(L, 2, "r"); - LStream *p = newfile(L); - const char *md = mode; - luaL_argcheck(L, l_checkmode(md), 2, "invalid mode"); - p->f = fopen(filename, mode); - return (p->f == NULL) ? luaL_fileresult(L, 0, filename) : 1; -} - - - -static int io_pclose (lua_State *L) { - LStream *p = tolstream(L); - errno = 0; - return luaL_execresult(L, l_pclose(L, p->f)); -} - - -static int io_popen (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - const char *mode = luaL_optstring(L, 2, "r"); - LStream *p = newprefile(L); - luaL_argcheck(L, l_checkmodep(mode), 2, "invalid mode"); - p->f = l_popen(L, filename, mode); - p->closef = &io_pclose; - return (p->f == NULL) ? luaL_fileresult(L, 0, filename) : 1; -} - - -static int io_tmpfile (lua_State *L) { - LStream *p = newfile(L); - p->f = tmpfile(); - return (p->f == NULL) ? luaL_fileresult(L, 0, NULL) : 1; -} - - -static FILE *getiofile (lua_State *L, const char *findex) { - LStream *p; - lua_getfield(L, LUA_REGISTRYINDEX, findex); - p = (LStream *)lua_touserdata(L, -1); - if (l_unlikely(isclosed(p))) - luaL_error(L, "default %s file is closed", findex + IOPREF_LEN); - return p->f; -} - - -static int g_iofile (lua_State *L, const char *f, const char *mode) { - if (!lua_isnoneornil(L, 1)) { - const char *filename = lua_tostring(L, 1); - if (filename) - opencheck(L, filename, mode); - else { - tofile(L); - lua_pushvalue(L, 1); - } - lua_setfield(L, LUA_REGISTRYINDEX, f); - } - - lua_getfield(L, LUA_REGISTRYINDEX, f); - return 1; -} - - -static int io_input (lua_State *L) { - return g_iofile(L, IO_INPUT, "r"); -} - - -static int io_output (lua_State *L) { - return g_iofile(L, IO_OUTPUT, "w"); -} - - -static int io_readline (lua_State *L); - - - -#define MAXARGLINE 250 - - -static void aux_lines (lua_State *L, int toclose) { - int n = lua_gettop(L) - 1; - luaL_argcheck(L, n <= MAXARGLINE, MAXARGLINE + 2, "too many arguments"); - lua_pushvalue(L, 1); - lua_pushinteger(L, n); - lua_pushboolean(L, toclose); - lua_rotate(L, 2, 3); - lua_pushcclosure(L, io_readline, 3 + n); -} - - -static int f_lines (lua_State *L) { - tofile(L); - aux_lines(L, 0); - return 1; -} - - - -static int io_lines (lua_State *L) { - int toclose; - if (lua_isnone(L, 1)) lua_pushnil(L); - if (lua_isnil(L, 1)) { - lua_getfield(L, LUA_REGISTRYINDEX, IO_INPUT); - lua_replace(L, 1); - tofile(L); - toclose = 0; - } - else { - const char *filename = luaL_checkstring(L, 1); - opencheck(L, filename, "r"); - lua_replace(L, 1); - toclose = 1; - } - aux_lines(L, toclose); - if (toclose) { - lua_pushnil(L); - lua_pushnil(L); - lua_pushvalue(L, 1); - return 4; - } - else - return 1; -} - - - - - - -#if !defined (L_MAXLENNUM) -#define L_MAXLENNUM 200 -#endif - - - -typedef struct { - FILE *f; - int c; - int n; - char buff[L_MAXLENNUM + 1]; -} RN; - - - -static int nextc (RN *rn) { - if (l_unlikely(rn->n >= L_MAXLENNUM)) { - rn->buff[0] = '\0'; - return 0; - } - else { - rn->buff[rn->n++] = rn->c; - rn->c = l_getc(rn->f); - return 1; - } -} - - - -static int test2 (RN *rn, const char *set) { - if (rn->c == set[0] || rn->c == set[1]) - return nextc(rn); - else return 0; -} - - - -static int readdigits (RN *rn, int hex) { - int count = 0; - while ((hex ? isxdigit(rn->c) : isdigit(rn->c)) && nextc(rn)) - count++; - return count; -} - - - -static int read_number (lua_State *L, FILE *f) { - RN rn; - int count = 0; - int hex = 0; - char decp[2]; - rn.f = f; rn.n = 0; - decp[0] = lua_getlocaledecpoint(); - decp[1] = '.'; - l_lockfile(rn.f); - do { rn.c = l_getc(rn.f); } while (isspace(rn.c)); - test2(&rn, "-+"); - if (test2(&rn, "00")) { - if (test2(&rn, "xX")) hex = 1; - else count = 1; - } - count += readdigits(&rn, hex); - if (test2(&rn, decp)) - count += readdigits(&rn, hex); - if (count > 0 && test2(&rn, (hex ? "pP" : "eE"))) { - test2(&rn, "-+"); - readdigits(&rn, 0); - } - ungetc(rn.c, rn.f); - l_unlockfile(rn.f); - rn.buff[rn.n] = '\0'; - if (l_likely(lua_stringtonumber(L, rn.buff))) - return 1; - else { - lua_pushnil(L); - return 0; - } -} - - -static int test_eof (lua_State *L, FILE *f) { - int c = getc(f); - ungetc(c, f); - lua_pushliteral(L, ""); - return (c != EOF); -} - - -static int read_line (lua_State *L, FILE *f, int chop) { - luaL_Buffer b; - int c; - luaL_buffinit(L, &b); - do { - char *buff = luaL_prepbuffer(&b); - int i = 0; - l_lockfile(f); - while (i < LUAL_BUFFERSIZE && (c = l_getc(f)) != EOF && c != '\n') - buff[i++] = c; - l_unlockfile(f); - luaL_addsize(&b, i); - } while (c != EOF && c != '\n'); - if (!chop && c == '\n') - luaL_addchar(&b, c); - luaL_pushresult(&b); - - return (c == '\n' || lua_rawlen(L, -1) > 0); -} - - -static void read_all (lua_State *L, FILE *f) { - size_t nr; - luaL_Buffer b; - luaL_buffinit(L, &b); - do { - char *p = luaL_prepbuffer(&b); - nr = fread(p, sizeof(char), LUAL_BUFFERSIZE, f); - luaL_addsize(&b, nr); - } while (nr == LUAL_BUFFERSIZE); - luaL_pushresult(&b); -} - - -static int read_chars (lua_State *L, FILE *f, size_t n) { - size_t nr; - char *p; - luaL_Buffer b; - luaL_buffinit(L, &b); - p = luaL_prepbuffsize(&b, n); - nr = fread(p, sizeof(char), n, f); - luaL_addsize(&b, nr); - luaL_pushresult(&b); - return (nr > 0); -} - - -static int g_read (lua_State *L, FILE *f, int first) { - int nargs = lua_gettop(L) - 1; - int n, success; - clearerr(f); - if (nargs == 0) { - success = read_line(L, f, 1); - n = first + 1; - } - else { - - luaL_checkstack(L, nargs+LUA_MINSTACK, "too many arguments"); - success = 1; - for (n = first; nargs-- && success; n++) { - if (lua_type(L, n) == LUA_TNUMBER) { - size_t l = (size_t)luaL_checkinteger(L, n); - success = (l == 0) ? test_eof(L, f) : read_chars(L, f, l); - } - else { - const char *p = luaL_checkstring(L, n); - if (*p == '*') p++; - switch (*p) { - case 'n': - success = read_number(L, f); - break; - case 'l': - success = read_line(L, f, 1); - break; - case 'L': - success = read_line(L, f, 0); - break; - case 'a': - read_all(L, f); - success = 1; - break; - default: - return luaL_argerror(L, n, "invalid format"); - } - } - } - } - if (ferror(f)) - return luaL_fileresult(L, 0, NULL); - if (!success) { - lua_pop(L, 1); - luaL_pushfail(L); - } - return n - first; -} - - -static int io_read (lua_State *L) { - return g_read(L, getiofile(L, IO_INPUT), 1); -} - - -static int f_read (lua_State *L) { - return g_read(L, tofile(L), 2); -} - - - -static int io_readline (lua_State *L) { - LStream *p = (LStream *)lua_touserdata(L, lua_upvalueindex(1)); - int i; - int n = (int)lua_tointeger(L, lua_upvalueindex(2)); - if (isclosed(p)) - return luaL_error(L, "file is already closed"); - lua_settop(L , 1); - luaL_checkstack(L, n, "too many arguments"); - for (i = 1; i <= n; i++) - lua_pushvalue(L, lua_upvalueindex(3 + i)); - n = g_read(L, p->f, 2); - lua_assert(n > 0); - if (lua_toboolean(L, -n)) - return n; - else { - if (n > 1) { - - return luaL_error(L, "%s", lua_tostring(L, -n + 1)); - } - if (lua_toboolean(L, lua_upvalueindex(3))) { - lua_settop(L, 0); - lua_pushvalue(L, lua_upvalueindex(1)); - aux_close(L); - } - return 0; - } -} - - - - -static int g_write (lua_State *L, FILE *f, int arg) { - int nargs = lua_gettop(L) - arg; - int status = 1; - for (; nargs--; arg++) { - if (lua_type(L, arg) == LUA_TNUMBER) { - - int len = lua_isinteger(L, arg) - ? fprintf(f, LUA_INTEGER_FMT, - (LUAI_UACINT)lua_tointeger(L, arg)) - : fprintf(f, LUA_NUMBER_FMT, - (LUAI_UACNUMBER)lua_tonumber(L, arg)); - status = status && (len > 0); - } - else { - size_t l; - const char *s = luaL_checklstring(L, arg, &l); - status = status && (fwrite(s, sizeof(char), l, f) == l); - } - } - if (l_likely(status)) - return 1; - else return luaL_fileresult(L, status, NULL); -} - - -static int io_write (lua_State *L) { - return g_write(L, getiofile(L, IO_OUTPUT), 1); -} - - -static int f_write (lua_State *L) { - FILE *f = tofile(L); - lua_pushvalue(L, 1); - return g_write(L, f, 2); -} - - -static int f_seek (lua_State *L) { - static const int mode[] = {SEEK_SET, SEEK_CUR, SEEK_END}; - static const char *const modenames[] = {"set", "cur", "end", NULL}; - FILE *f = tofile(L); - int op = luaL_checkoption(L, 2, "cur", modenames); - lua_Integer p3 = luaL_optinteger(L, 3, 0); - l_seeknum offset = (l_seeknum)p3; - luaL_argcheck(L, (lua_Integer)offset == p3, 3, - "not an integer in proper range"); - op = l_fseek(f, offset, mode[op]); - if (l_unlikely(op)) - return luaL_fileresult(L, 0, NULL); - else { - lua_pushinteger(L, (lua_Integer)l_ftell(f)); - return 1; - } -} - - -static int f_setvbuf (lua_State *L) { - static const int mode[] = {_IONBF, _IOFBF, _IOLBF}; - static const char *const modenames[] = {"no", "full", "line", NULL}; - FILE *f = tofile(L); - int op = luaL_checkoption(L, 2, NULL, modenames); - lua_Integer sz = luaL_optinteger(L, 3, LUAL_BUFFERSIZE); - int res = setvbuf(f, NULL, mode[op], (size_t)sz); - return luaL_fileresult(L, res == 0, NULL); -} - - - -static int io_flush (lua_State *L) { - return luaL_fileresult(L, fflush(getiofile(L, IO_OUTPUT)) == 0, NULL); -} - - -static int f_flush (lua_State *L) { - return luaL_fileresult(L, fflush(tofile(L)) == 0, NULL); -} - - - -static const luaL_Reg iolib[] = { - {"close", io_close}, - {"flush", io_flush}, - {"input", io_input}, - {"lines", io_lines}, - {"open", io_open}, - {"output", io_output}, - {"popen", io_popen}, - {"read", io_read}, - {"tmpfile", io_tmpfile}, - {"type", io_type}, - {"write", io_write}, - {NULL, NULL} -}; - - - -static const luaL_Reg meth[] = { - {"read", f_read}, - {"write", f_write}, - {"lines", f_lines}, - {"flush", f_flush}, - {"seek", f_seek}, - {"close", f_close}, - {"setvbuf", f_setvbuf}, - {NULL, NULL} -}; - - - -static const luaL_Reg metameth[] = { - {"__index", NULL}, - {"__gc", f_gc}, - {"__close", f_gc}, - {"__tostring", f_tostring}, - {NULL, NULL} -}; - - -static void createmeta (lua_State *L) { - luaL_newmetatable(L, LUA_FILEHANDLE); - luaL_setfuncs(L, metameth, 0); - luaL_newlibtable(L, meth); - luaL_setfuncs(L, meth, 0); - lua_setfield(L, -2, "__index"); - lua_pop(L, 1); -} - - - -static int io_noclose (lua_State *L) { - LStream *p = tolstream(L); - p->closef = &io_noclose; - luaL_pushfail(L); - lua_pushliteral(L, "cannot close standard file"); - return 2; -} - - -static void createstdfile (lua_State *L, FILE *f, const char *k, - const char *fname) { - LStream *p = newprefile(L); - p->f = f; - p->closef = &io_noclose; - if (k != NULL) { - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, k); - } - lua_setfield(L, -2, fname); -} - - -LUAMOD_API int luaopen_io (lua_State *L) { - luaL_newlib(L, iolib); - createmeta(L); - - createstdfile(L, stdin, IO_INPUT, "stdin"); - createstdfile(L, stdout, IO_OUTPUT, "stdout"); - createstdfile(L, stderr, NULL, "stderr"); - return 1; -} - - - -//path: src/dependencies/lua/lmathlib.c - -#define lmathlib_c -#define LUA_LIB - - - - -#include -#include -#include -#include - - - - - - - - - - -#undef PI -#define PI (l_mathop(3.141592653589793238462643383279502884)) - - -static int math_abs (lua_State *L) { - if (lua_isinteger(L, 1)) { - lua_Integer n = lua_tointeger(L, 1); - if (n < 0) n = (lua_Integer)(0u - (lua_Unsigned)n); - lua_pushinteger(L, n); - } - else - lua_pushnumber(L, l_mathop(private_lua_cembed_fabs)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_sin (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_sin)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_cos (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_cos)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_tan (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_tan)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_asin (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_asin)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_acos (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_acos)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_atan (lua_State *L) { - lua_Number y = luaL_checknumber(L, 1); - lua_Number x = luaL_optnumber(L, 2, 1); - lua_pushnumber(L, l_mathop(private_lua_cembed_atan2)(y, x)); - return 1; -} - - -static int math_toint (lua_State *L) { - int valid; - lua_Integer n = lua_tointegerx(L, 1, &valid); - if (l_likely(valid)) - lua_pushinteger(L, n); - else { - luaL_checkany(L, 1); - luaL_pushfail(L); - } - return 1; -} - - -static void pushnumint (lua_State *L, lua_Number d) { - lua_Integer n; - if (lua_numbertointeger(d, &n)) - lua_pushinteger(L, n); - else - lua_pushnumber(L, d); -} - - -static int math_floor (lua_State *L) { - if (lua_isinteger(L, 1)) - lua_settop(L, 1); - else { - lua_Number d = l_mathop(private_lua_embed_floor)(luaL_checknumber(L, 1)); - pushnumint(L, d); - } - return 1; -} - - -static int math_ceil (lua_State *L) { - if (lua_isinteger(L, 1)) - lua_settop(L, 1); - else { - lua_Number d = l_mathop(private_lua_cembed_ceil)(luaL_checknumber(L, 1)); - pushnumint(L, d); - } - return 1; -} - - -static int math_fmod (lua_State *L) { - if (lua_isinteger(L, 1) && lua_isinteger(L, 2)) { - lua_Integer d = lua_tointeger(L, 2); - if ((lua_Unsigned)d + 1u <= 1u) { - luaL_argcheck(L, d != 0, 2, "zero"); - lua_pushinteger(L, 0); - } - else - lua_pushinteger(L, lua_tointeger(L, 1) % d); - } - else - lua_pushnumber(L, l_mathop(private_lua_embed_fmod)(luaL_checknumber(L, 1), - luaL_checknumber(L, 2))); - return 1; -} - - - -static int math_modf (lua_State *L) { - if (lua_isinteger(L ,1)) { - lua_settop(L, 1); - lua_pushnumber(L, 0); - } - else { - lua_Number n = luaL_checknumber(L, 1); - - lua_Number ip = (n < 0) ? l_mathop(private_lua_cembed_ceil)(n) : l_mathop(private_lua_embed_floor)(n); - pushnumint(L, ip); - - lua_pushnumber(L, (n == ip) ? l_mathop(0.0) : (n - ip)); - } - return 2; -} - - -static int math_sqrt (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_sqrt)(luaL_checknumber(L, 1))); - return 1; -} - - -static int math_ult (lua_State *L) { - lua_Integer a = luaL_checkinteger(L, 1); - lua_Integer b = luaL_checkinteger(L, 2); - lua_pushboolean(L, (lua_Unsigned)a < (lua_Unsigned)b); - return 1; -} - -static int math_log (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - lua_Number res; - if (lua_isnoneornil(L, 2)) - res = l_mathop(private_lua_cembed_log)(x); - else { - lua_Number base = luaL_checknumber(L, 2); -#if !defined(LUA_USE_C89) - if (base == l_mathop(2.0)) - res = l_mathop(private_lua_cembed_log2)(x); - else -#endif - if (base == l_mathop(10.0)) - res = l_mathop(private_lua_embed_log10)(x); - else - res = l_mathop(private_lua_cembed_log)(x)/l_mathop(private_lua_cembed_log)(base); - } - lua_pushnumber(L, res); - return 1; -} - -static int math_exp (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_exp)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_deg (lua_State *L) { - lua_pushnumber(L, luaL_checknumber(L, 1) * (l_mathop(180.0) / PI)); - return 1; -} - -static int math_rad (lua_State *L) { - lua_pushnumber(L, luaL_checknumber(L, 1) * (PI / l_mathop(180.0))); - return 1; -} - - -static int math_min (lua_State *L) { - int n = lua_gettop(L); - int imin = 1; - int i; - luaL_argcheck(L, n >= 1, 1, "value expected"); - for (i = 2; i <= n; i++) { - if (lua_compare(L, i, imin, LUA_OPLT)) - imin = i; - } - lua_pushvalue(L, imin); - return 1; -} - - -static int math_max (lua_State *L) { - int n = lua_gettop(L); - int imax = 1; - int i; - luaL_argcheck(L, n >= 1, 1, "value expected"); - for (i = 2; i <= n; i++) { - if (lua_compare(L, imax, i, LUA_OPLT)) - imax = i; - } - lua_pushvalue(L, imax); - return 1; -} - - -static int math_type (lua_State *L) { - if (lua_type(L, 1) == LUA_TNUMBER) - lua_pushstring(L, (lua_isinteger(L, 1)) ? "integer" : "float"); - else { - luaL_checkany(L, 1); - luaL_pushfail(L); - } - return 1; -} - - - - - - - - - -#define FIGS l_floatatt(MANT_DIG) - -#if FIGS > 64 - -#undef FIGS -#define FIGS 64 -#endif - - - -#if !defined(LUA_RAND32) && !defined(Rand64) - - - -#if ((ULONG_MAX >> 31) >> 31) >= 3 - - -#define Rand64 unsigned long -#define SRand64 long - -#elif !defined(LUA_USE_C89) && defined(LLONG_MAX) - - -#define Rand64 unsigned long long -#define SRand64 long long - -#elif ((LUA_MAXUNSIGNED >> 31) >> 31) >= 3 - - -#define Rand64 lua_Unsigned -#define SRand64 lua_Integer - -#endif - -#endif - - -#if defined(Rand64) - - - - -#define trim64(x) ((x) & 0xffffffffffffffffu) - - - -static Rand64 rotl (Rand64 x, int n) { - return (x << n) | (trim64(x) >> (64 - n)); -} - -static Rand64 nextrand (Rand64 *state) { - Rand64 state0 = state[0]; - Rand64 state1 = state[1]; - Rand64 state2 = state[2] ^ state0; - Rand64 state3 = state[3] ^ state1; - Rand64 res = rotl(state1 * 5, 7) * 9; - state[0] = state0 ^ state3; - state[1] = state1 ^ state2; - state[2] = state2 ^ (state1 << 17); - state[3] = rotl(state3, 45); - return res; -} - - - - - -#define shift64_FIG (64 - FIGS) - - -#define scaleFIG (l_mathop(0.5) / ((Rand64)1 << (FIGS - 1))) - -static lua_Number I2d (Rand64 x) { - SRand64 sx = (SRand64)(trim64(x) >> shift64_FIG); - lua_Number res = (lua_Number)(sx) * scaleFIG; - if (sx < 0) - res += l_mathop(1.0); - lua_assert(0 <= res && res < 1); - return res; -} - - -#define I2UInt(x) ((lua_Unsigned)trim64(x)) - - -#define Int2I(x) ((Rand64)(x)) - - -#else - - -#if LUAI_IS32INT -typedef unsigned int lu_int32; -#else -typedef unsigned long lu_int32; -#endif - - - -typedef struct Rand64 { - lu_int32 h; - lu_int32 l; -} Rand64; - - - - - -#define trim32(x) ((x) & 0xffffffffu) - - - - - -static Rand64 packI (lu_int32 h, lu_int32 l) { - Rand64 result; - result.h = h; - result.l = l; - return result; -} - - -static Rand64 Ishl (Rand64 i, int n) { - lua_assert(n > 0 && n < 32); - return packI((i.h << n) | (trim32(i.l) >> (32 - n)), i.l << n); -} - - -static void Ixor (Rand64 *i1, Rand64 i2) { - i1->h ^= i2.h; - i1->l ^= i2.l; -} - - -static Rand64 Iadd (Rand64 i1, Rand64 i2) { - Rand64 result = packI(i1.h + i2.h, i1.l + i2.l); - if (trim32(result.l) < trim32(i1.l)) - result.h++; - return result; -} - - -static Rand64 times5 (Rand64 i) { - return Iadd(Ishl(i, 2), i); -} - - -static Rand64 times9 (Rand64 i) { - return Iadd(Ishl(i, 3), i); -} - - -static Rand64 rotl (Rand64 i, int n) { - lua_assert(n > 0 && n < 32); - return packI((i.h << n) | (trim32(i.l) >> (32 - n)), - (trim32(i.h) >> (32 - n)) | (i.l << n)); -} - - -static Rand64 rotl1 (Rand64 i, int n) { - lua_assert(n > 32 && n < 64); - n = 64 - n; - return packI((trim32(i.h) >> n) | (i.l << (32 - n)), - (i.h << (32 - n)) | (trim32(i.l) >> n)); -} - - -static Rand64 nextrand (Rand64 *state) { - Rand64 res = times9(rotl(times5(state[1]), 7)); - Rand64 t = Ishl(state[1], 17); - Ixor(&state[2], state[0]); - Ixor(&state[3], state[1]); - Ixor(&state[1], state[2]); - Ixor(&state[0], state[3]); - Ixor(&state[2], t); - state[3] = rotl1(state[3], 45); - return res; -} - - - - - -#define UONE ((lu_int32)1) - - -#if FIGS <= 32 - - -#define scaleFIG (l_mathop(0.5) / (UONE << (FIGS - 1))) - - -static lua_Number I2d (Rand64 x) { - lua_Number h = (lua_Number)(trim32(x.h) >> (32 - FIGS)); - return h * scaleFIG; -} - -#else - - -#define scaleFIG \ - (l_mathop(1.0) / (UONE << 30) / l_mathop(8.0) / (UONE << (FIGS - 33))) - - -#define shiftLOW (64 - FIGS) - - -#define shiftHI ((lua_Number)(UONE << (FIGS - 33)) * l_mathop(2.0)) - - -static lua_Number I2d (Rand64 x) { - lua_Number h = (lua_Number)trim32(x.h) * shiftHI; - lua_Number l = (lua_Number)(trim32(x.l) >> shiftLOW); - return (h + l) * scaleFIG; -} - -#endif - - - -static lua_Unsigned I2UInt (Rand64 x) { - return (((lua_Unsigned)trim32(x.h) << 31) << 1) | (lua_Unsigned)trim32(x.l); -} - - -static Rand64 Int2I (lua_Unsigned n) { - return packI((lu_int32)((n >> 31) >> 1), (lu_int32)n); -} - -#endif - - - -typedef struct { - Rand64 s[4]; -} RanState; - - - -static lua_Unsigned project (lua_Unsigned ran, lua_Unsigned n, - RanState *state) { - if ((n & (n + 1)) == 0) - return ran & n; - else { - lua_Unsigned lim = n; - - lim |= (lim >> 1); - lim |= (lim >> 2); - lim |= (lim >> 4); - lim |= (lim >> 8); - lim |= (lim >> 16); -#if (LUA_MAXUNSIGNED >> 31) >= 3 - lim |= (lim >> 32); -#endif - lua_assert((lim & (lim + 1)) == 0 - && lim >= n - && (lim >> 1) < n); - while ((ran &= lim) > n) - ran = I2UInt(nextrand(state->s)); - return ran; - } -} - - -static int math_random (lua_State *L) { - lua_Integer low, up; - lua_Unsigned p; - RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1)); - Rand64 rv = nextrand(state->s); - switch (lua_gettop(L)) { - case 0: { - lua_pushnumber(L, I2d(rv)); - return 1; - } - case 1: { - low = 1; - up = luaL_checkinteger(L, 1); - if (up == 0) { - lua_pushinteger(L, I2UInt(rv)); - return 1; - } - break; - } - case 2: { - low = luaL_checkinteger(L, 1); - up = luaL_checkinteger(L, 2); - break; - } - default: return luaL_error(L, "wrong number of arguments"); - } - - luaL_argcheck(L, low <= up, 1, "interval is empty"); - - p = project(I2UInt(rv), (lua_Unsigned)up - (lua_Unsigned)low, state); - lua_pushinteger(L, p + (lua_Unsigned)low); - return 1; -} - - -static void setseed (lua_State *L, Rand64 *state, - lua_Unsigned n1, lua_Unsigned n2) { - int i; - state[0] = Int2I(n1); - state[1] = Int2I(0xff); - state[2] = Int2I(n2); - state[3] = Int2I(0); - for (i = 0; i < 16; i++) - nextrand(state); - lua_pushinteger(L, n1); - lua_pushinteger(L, n2); -} - - -static int math_randomseed (lua_State *L) { - RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1)); - lua_Unsigned n1, n2; - if (lua_isnone(L, 1)) { - n1 = luaL_makeseed(L); - n2 = I2UInt(nextrand(state->s)); - } - else { - n1 = luaL_checkinteger(L, 1); - n2 = luaL_optinteger(L, 2, 0); - } - setseed(L, state->s, n1, n2); - return 2; -} - - -static const luaL_Reg randfuncs[] = { - {"random", math_random}, - {"randomseed", math_randomseed}, - {NULL, NULL} -}; - - - -static void setrandfunc (lua_State *L) { - RanState *state = (RanState *)lua_newuserdatauv(L, sizeof(RanState), 0); - setseed(L, state->s, luaL_makeseed(L), 0); - lua_pop(L, 2); - luaL_setfuncs(L, randfuncs, 1); -} - - - - - -#if defined(LUA_COMPAT_MATHLIB) - -static int math_cosh (lua_State *L) { - lua_pushnumber(L, l_mathop(cosh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_sinh (lua_State *L) { - lua_pushnumber(L, l_mathop(sinh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_tanh (lua_State *L) { - lua_pushnumber(L, l_mathop(tanh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_pow (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - lua_Number y = luaL_checknumber(L, 2); - lua_pushnumber(L, l_mathop(pow)(x, y)); - return 1; -} - -static int math_frexp (lua_State *L) { - int e; - lua_pushnumber(L, l_mathop(frexp)(luaL_checknumber(L, 1), &e)); - lua_pushinteger(L, e); - return 2; -} - -static int math_ldexp (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - int ep = (int)luaL_checkinteger(L, 2); - lua_pushnumber(L, l_mathop(ldexp)(x, ep)); - return 1; -} - -static int math_log10 (lua_State *L) { - lua_pushnumber(L, l_mathop(log10)(luaL_checknumber(L, 1))); - return 1; -} - -#endif - - - - -static const luaL_Reg mathlib[] = { - {"abs", math_abs}, - {"acos", math_acos}, - {"asin", math_asin}, - {"atan", math_atan}, - {"ceil", math_ceil}, - {"cos", math_cos}, - {"deg", math_deg}, - {"exp", math_exp}, - {"tointeger", math_toint}, - {"floor", math_floor}, - {"fmod", math_fmod}, - {"ult", math_ult}, - {"log", math_log}, - {"max", math_max}, - {"min", math_min}, - {"modf", math_modf}, - {"rad", math_rad}, - {"sin", math_sin}, - {"sqrt", math_sqrt}, - {"tan", math_tan}, - {"type", math_type}, -#if defined(LUA_COMPAT_MATHLIB) - {"atan2", math_atan}, - {"cosh", math_cosh}, - {"sinh", math_sinh}, - {"tanh", math_tanh}, - {"pow", math_pow}, - {"frexp", math_frexp}, - {"ldexp", math_ldexp}, - {"log10", math_log10}, -#endif - - {"random", NULL}, - {"randomseed", NULL}, - {"pi", NULL}, - {"huge", NULL}, - {"maxinteger", NULL}, - {"mininteger", NULL}, - {NULL, NULL} -}; - - - -LUAMOD_API int luaopen_math (lua_State *L) { - luaL_newlib(L, mathlib); - lua_pushnumber(L, PI); - lua_setfield(L, -2, "pi"); - lua_pushnumber(L, (lua_Number)HUGE_VAL); - lua_setfield(L, -2, "huge"); - lua_pushinteger(L, LUA_MAXINTEGER); - lua_setfield(L, -2, "maxinteger"); - lua_pushinteger(L, LUA_MININTEGER); - lua_setfield(L, -2, "mininteger"); - setrandfunc(L); - return 1; -} - - - -//path: src/dependencies/lua/loadlib.c - - -#define loadlib_c -#define LUA_LIB - - - - - -#include -#include -#include - - - - - - - - - - - -#if !defined(LUA_CSUBSEP) -#define LUA_CSUBSEP LUA_DIRSEP -#endif - -#if !defined(LUA_LSUBSEP) -#define LUA_LSUBSEP LUA_DIRSEP -#endif - - - -#define LUA_POF "luaopen_" - - -#define LUA_OFSEP "_" - - - -static const char *const CLIBS = "_CLIBS"; - -#define LIB_FAIL "open" - - -#define setprogdir(L) ((void)0) - - - -typedef void (*voidf)(void); - - - - - -static void lsys_unloadlib (void *lib); - - -static void *lsys_load (lua_State *L, const char *path, int seeglb); - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym); - - - - -#if defined(LUA_USE_DLOPEN) - - -#include - - -#if defined(__GNUC__) -#define cast_func(p) (__extension__ (lua_CFunction)(p)) -#else -#define cast_func(p) ((lua_CFunction)(p)) -#endif - - -static void lsys_unloadlib (void *lib) { - dlclose(lib); -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - void *lib = dlopen(path, RTLD_NOW | (seeglb ? RTLD_GLOBAL : RTLD_LOCAL)); - if (l_unlikely(lib == NULL)) - lua_pushstring(L, dlerror()); - return lib; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - lua_CFunction f = cast_func(dlsym(lib, sym)); - if (l_unlikely(f == NULL)) - lua_pushstring(L, dlerror()); - return f; -} - - - - - -#elif defined(LUA_DL_DLL) - - -#include - - - -#if !defined(LUA_LLE_FLAGS) -#define LUA_LLE_FLAGS 0 -#endif - - -#undef setprogdir - - - -static void setprogdir (lua_State *L) { - char buff[MAX_PATH + 1]; - char *lb; - DWORD nsize = sizeof(buff)/sizeof(char); - DWORD n = GetModuleFileNameA(NULL, buff, nsize); - if (n == 0 || n == nsize || (lb = strrchr(buff, '\\')) == NULL) - luaL_error(L, "unable to get ModuleFileName"); - else { - *lb = '\0'; - luaL_gsub(L, lua_tostring(L, -1), LUA_EXEC_DIR, buff); - lua_remove(L, -2); - } -} - - - - -static void pusherror (lua_State *L) { - int error = GetLastError(); - char buffer[128]; - if (FormatMessageA(FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM, - NULL, error, 0, buffer, sizeof(buffer)/sizeof(char), NULL)) - lua_pushstring(L, buffer); - else - lua_pushfstring(L, "system error %d\n", error); -} - -static void lsys_unloadlib (void *lib) { - FreeLibrary((HMODULE)lib); -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - HMODULE lib = LoadLibraryExA(path, NULL, LUA_LLE_FLAGS); - (void)(seeglb); - if (lib == NULL) pusherror(L); - return lib; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - lua_CFunction f = (lua_CFunction)(voidf)GetProcAddress((HMODULE)lib, sym); - if (f == NULL) pusherror(L); - return f; -} - - - - -#else - - -#undef LIB_FAIL -#define LIB_FAIL "absent" - - -#define DLMSG "dynamic libraries not enabled; check your Lua installation" - - -static void lsys_unloadlib (void *lib) { - (void)(lib); -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - (void)(path); (void)(seeglb); - lua_pushliteral(L, DLMSG); - return NULL; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - (void)(lib); (void)(sym); - lua_pushliteral(L, DLMSG); - return NULL; -} - - -#endif - - - - - -#if !defined(LUA_PATH_VAR) -#define LUA_PATH_VAR "LUA_PATH" -#endif - -#if !defined(LUA_CPATH_VAR) -#define LUA_CPATH_VAR "LUA_CPATH" -#endif - - - - -static int noenv (lua_State *L) { - int b; - lua_getfield(L, LUA_REGISTRYINDEX, "LUA_NOENV"); - b = lua_toboolean(L, -1); - lua_pop(L, 1); - return b; -} - - - -static void setpath (lua_State *L, const char *fieldname, - const char *envname, - const char *dft) { - const char *dftmark; - const char *nver = lua_pushfstring(L, "%s%s", envname, LUA_VERSUFFIX); - const char *path = getenv(nver); - if (path == NULL) - path = getenv(envname); - if (path == NULL || noenv(L)) - lua_pushextlstring(L, dft, strlen(dft), NULL, NULL); - else if ((dftmark = strstr(path, LUA_PATH_SEP LUA_PATH_SEP)) == NULL) - lua_pushstring(L, path); - else { - size_t len = strlen(path); - luaL_Buffer b; - luaL_buffinit(L, &b); - if (path < dftmark) { - luaL_addlstring(&b, path, dftmark - path); - luaL_addchar(&b, *LUA_PATH_SEP); - } - luaL_addstring(&b, dft); - if (dftmark < path + len - 2) { - luaL_addchar(&b, *LUA_PATH_SEP); - luaL_addlstring(&b, dftmark + 2, (path + len - 2) - dftmark); - } - luaL_pushresult(&b); - } - setprogdir(L); - lua_setfield(L, -3, fieldname); - lua_pop(L, 1); -} - - - - - -static void *checkclib (lua_State *L, const char *path) { - void *plib; - lua_getfield(L, LUA_REGISTRYINDEX, CLIBS); - lua_getfield(L, -1, path); - plib = lua_touserdata(L, -1); - lua_pop(L, 2); - return plib; -} - - - -static void addtoclib (lua_State *L, const char *path, void *plib) { - lua_getfield(L, LUA_REGISTRYINDEX, CLIBS); - lua_pushlightuserdata(L, plib); - lua_pushvalue(L, -1); - lua_setfield(L, -3, path); - lua_rawseti(L, -2, luaL_len(L, -2) + 1); - lua_pop(L, 1); -} - - - -static int gctm (lua_State *L) { - lua_Integer n = luaL_len(L, 1); - for (; n >= 1; n--) { - lua_rawgeti(L, 1, n); - lsys_unloadlib(lua_touserdata(L, -1)); - lua_pop(L, 1); - } - return 0; -} - - - - -#define ERRLIB 1 -#define ERRFUNC 2 - - -static int lookforfunc (lua_State *L, const char *path, const char *sym) { - void *reg = checkclib(L, path); - if (reg == NULL) { - reg = lsys_load(L, path, *sym == '*'); - if (reg == NULL) return ERRLIB; - addtoclib(L, path, reg); - } - if (*sym == '*') { - lua_pushboolean(L, 1); - return 0; - } - else { - lua_CFunction f = lsys_sym(L, reg, sym); - if (f == NULL) - return ERRFUNC; - lua_pushcfunction(L, f); - return 0; - } -} - - -static int ll_loadlib (lua_State *L) { - const char *path = luaL_checkstring(L, 1); - const char *init = luaL_checkstring(L, 2); - int stat = lookforfunc(L, path, init); - if (l_likely(stat == 0)) - return 1; - else { - luaL_pushfail(L); - lua_insert(L, -2); - lua_pushstring(L, (stat == ERRLIB) ? LIB_FAIL : "init"); - return 3; - } -} - - - - - - -static int readable (const char *filename) { - FILE *f = fopen(filename, "r"); - if (f == NULL) return 0; - fclose(f); - return 1; -} - - - -static const char *getnextfilename (char **path, char *end) { - char *sep; - char *name = *path; - if (name == end) - return NULL; - else if (*name == '\0') { - *name = *LUA_PATH_SEP; - name++; - } - sep = strchr(name, *LUA_PATH_SEP); - if (sep == NULL) - sep = end; - *sep = '\0'; - *path = sep; - return name; -} - - - -static void pusherrornotfound (lua_State *L, const char *path) { - luaL_Buffer b; - luaL_buffinit(L, &b); - luaL_addstring(&b, "no file '"); - luaL_addgsub(&b, path, LUA_PATH_SEP, "'\n\tno file '"); - luaL_addstring(&b, "'"); - luaL_pushresult(&b); -} - - -static const char *searchpath (lua_State *L, const char *name, - const char *path, - const char *sep, - const char *dirsep) { - luaL_Buffer buff; - char *pathname; - char *endpathname; - const char *filename; - - if (*sep != '\0' && strchr(name, *sep) != NULL) - name = luaL_gsub(L, name, sep, dirsep); - luaL_buffinit(L, &buff); - - luaL_addgsub(&buff, path, LUA_PATH_MARK, name); - luaL_addchar(&buff, '\0'); - pathname = luaL_buffaddr(&buff); - endpathname = pathname + luaL_bufflen(&buff) - 1; - while ((filename = getnextfilename(&pathname, endpathname)) != NULL) { - if (readable(filename)) - return lua_pushstring(L, filename); - } - luaL_pushresult(&buff); - pusherrornotfound(L, lua_tostring(L, -1)); - return NULL; -} - - -static int ll_searchpath (lua_State *L) { - const char *f = searchpath(L, luaL_checkstring(L, 1), - luaL_checkstring(L, 2), - luaL_optstring(L, 3, "."), - luaL_optstring(L, 4, LUA_DIRSEP)); - if (f != NULL) return 1; - else { - luaL_pushfail(L); - lua_insert(L, -2); - return 2; - } -} - - -static const char *findfile (lua_State *L, const char *name, - const char *pname, - const char *dirsep) { - const char *path; - lua_getfield(L, lua_upvalueindex(1), pname); - path = lua_tostring(L, -1); - if (l_unlikely(path == NULL)) - luaL_error(L, "'package.%s' must be a string", pname); - return searchpath(L, name, path, ".", dirsep); -} - - -static int checkload (lua_State *L, int stat, const char *filename) { - if (l_likely(stat)) { - lua_pushstring(L, filename); - return 2; - } - else - return luaL_error(L, "error loading module '%s' from file '%s':\n\t%s", - lua_tostring(L, 1), filename, lua_tostring(L, -1)); -} - - -static int searcher_Lua (lua_State *L) { - const char *filename; - const char *name = luaL_checkstring(L, 1); - filename = findfile(L, name, "path", LUA_LSUBSEP); - if (filename == NULL) return 1; - return checkload(L, (luaL_loadfile(L, filename) == LUA_OK), filename); -} - - - -static int loadfunc (lua_State *L, const char *filename, const char *modname) { - const char *openfunc; - const char *mark; - modname = luaL_gsub(L, modname, ".", LUA_OFSEP); - mark = strchr(modname, *LUA_IGMARK); - if (mark) { - int stat; - openfunc = lua_pushlstring(L, modname, mark - modname); - openfunc = lua_pushfstring(L, LUA_POF"%s", openfunc); - stat = lookforfunc(L, filename, openfunc); - if (stat != ERRFUNC) return stat; - modname = mark + 1; - } - openfunc = lua_pushfstring(L, LUA_POF"%s", modname); - return lookforfunc(L, filename, openfunc); -} - - -static int searcher_C (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - const char *filename = findfile(L, name, "cpath", LUA_CSUBSEP); - if (filename == NULL) return 1; - return checkload(L, (loadfunc(L, filename, name) == 0), filename); -} - - -static int searcher_Croot (lua_State *L) { - const char *filename; - const char *name = luaL_checkstring(L, 1); - const char *p = strchr(name, '.'); - int stat; - if (p == NULL) return 0; - lua_pushlstring(L, name, p - name); - filename = findfile(L, lua_tostring(L, -1), "cpath", LUA_CSUBSEP); - if (filename == NULL) return 1; - if ((stat = loadfunc(L, filename, name)) != 0) { - if (stat != ERRFUNC) - return checkload(L, 0, filename); - else { - lua_pushfstring(L, "no module '%s' in file '%s'", name, filename); - return 1; - } - } - lua_pushstring(L, filename); - return 2; -} - - -static int searcher_preload (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - lua_getfield(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - if (lua_getfield(L, -1, name) == LUA_TNIL) { - lua_pushfstring(L, "no field package.preload['%s']", name); - return 1; - } - else { - lua_pushliteral(L, ":preload:"); - return 2; - } -} - - -static void findloader (lua_State *L, const char *name) { - int i; - luaL_Buffer msg; - - if (l_unlikely(lua_getfield(L, lua_upvalueindex(1), "searchers") - != LUA_TTABLE)) - luaL_error(L, "'package.searchers' must be a table"); - luaL_buffinit(L, &msg); - - for (i = 1; ; i++) { - luaL_addstring(&msg, "\n\t"); - if (l_unlikely(lua_rawgeti(L, 3, i) == LUA_TNIL)) { - lua_pop(L, 1); - luaL_buffsub(&msg, 2); - luaL_pushresult(&msg); - luaL_error(L, "module '%s' not found:%s", name, lua_tostring(L, -1)); - } - lua_pushstring(L, name); - lua_call(L, 1, 2); - if (lua_isfunction(L, -2)) - return; - else if (lua_isstring(L, -2)) { - lua_pop(L, 1); - luaL_addvalue(&msg); - } - else { - lua_pop(L, 2); - luaL_buffsub(&msg, 2); - } - } -} - - -static int ll_require (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - lua_settop(L, 1); - lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_getfield(L, 2, name); - if (lua_toboolean(L, -1)) - return 1; - - lua_pop(L, 1); - findloader(L, name); - lua_rotate(L, -2, 1); - lua_pushvalue(L, 1); - lua_pushvalue(L, -3); - - lua_call(L, 2, 1); - - if (!lua_isnil(L, -1)) - lua_setfield(L, 2, name); - else - lua_pop(L, 1); - if (lua_getfield(L, 2, name) == LUA_TNIL) { - lua_pushboolean(L, 1); - lua_copy(L, -1, -2); - lua_setfield(L, 2, name); - } - lua_rotate(L, -2, 1); - return 2; -} - - - - - - -static const luaL_Reg pk_funcs[] = { - {"loadlib", ll_loadlib}, - {"searchpath", ll_searchpath}, - - {"preload", NULL}, - {"cpath", NULL}, - {"path", NULL}, - {"searchers", NULL}, - {"loaded", NULL}, - {NULL, NULL} -}; - - -static const luaL_Reg ll_funcs[] = { - {"require", ll_require}, - {NULL, NULL} -}; - - -static void createsearcherstable (lua_State *L) { - static const lua_CFunction searchers[] = { - searcher_preload, - searcher_Lua, - searcher_C, - searcher_Croot, - NULL - }; - int i; - - lua_createtable(L, sizeof(searchers)/sizeof(searchers[0]) - 1, 0); - - for (i=0; searchers[i] != NULL; i++) { - lua_pushvalue(L, -2); - lua_pushcclosure(L, searchers[i], 1); - lua_rawseti(L, -2, i+1); - } - lua_setfield(L, -2, "searchers"); -} - - - -static void createclibstable (lua_State *L) { - luaL_getsubtable(L, LUA_REGISTRYINDEX, CLIBS); - lua_createtable(L, 0, 1); - lua_pushcfunction(L, gctm); - lua_setfield(L, -2, "__gc"); - lua_setmetatable(L, -2); -} - - -LUAMOD_API int luaopen_package (lua_State *L) { - createclibstable(L); - luaL_newlib(L, pk_funcs); - createsearcherstable(L); - - setpath(L, "path", LUA_PATH_VAR, LUA_PATH_DEFAULT); - setpath(L, "cpath", LUA_CPATH_VAR, LUA_CPATH_DEFAULT); - - lua_pushliteral(L, LUA_DIRSEP "\n" LUA_PATH_SEP "\n" LUA_PATH_MARK "\n" - LUA_EXEC_DIR "\n" LUA_IGMARK "\n"); - lua_setfield(L, -2, "config"); - - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_setfield(L, -2, "loaded"); - - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - lua_setfield(L, -2, "preload"); - lua_pushglobaltable(L); - lua_pushvalue(L, -2); - luaL_setfuncs(L, ll_funcs, 1); - lua_pop(L, 1); - return 1; -} - - - -//path: src/dependencies/lua/loslib.c - - -#define loslib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include -#include - - - - - - - - - - - -#if !defined(LUA_STRFTIMEOPTIONS) - -#if defined(LUA_USE_WINDOWS) -#define LUA_STRFTIMEOPTIONS "aAbBcdHIjmMpSUwWxXyYzZ%" \ - "||" "#c#x#d#H#I#j#m#M#S#U#w#W#y#Y" -#elif defined(LUA_USE_C89) -#define LUA_STRFTIMEOPTIONS "aAbBcdHIjmMpSUwWxXyYZ%" -#else -#define LUA_STRFTIMEOPTIONS "aAbBcCdDeFgGhHIjmMnprRStTuUVwWxXyYzZ%" \ - "||" "EcECExEXEyEY" "OdOeOHOIOmOMOSOuOUOVOwOWOy" -#endif - -#endif - - - - - - -#if !defined(LUA_NUMTIME) - -#define l_timet lua_Integer -#define l_pushtime(L,t) lua_pushinteger(L,(lua_Integer)(t)) -#define l_gettime(L,arg) luaL_checkinteger(L, arg) - -#else - -#define l_timet lua_Number -#define l_pushtime(L,t) lua_pushnumber(L,(lua_Number)(t)) -#define l_gettime(L,arg) luaL_checknumber(L, arg) - -#endif - - -#if !defined(l_gmtime) - - -#if defined(LUA_USE_POSIX) - -#define l_gmtime(t,r) gmtime_r(t,r) -#define l_localtime(t,r) localtime_r(t,r) - -#else - - -#define l_gmtime(t,r) ((void)(r)->tm_sec, gmtime(t)) -#define l_localtime(t,r) ((void)(r)->tm_sec, localtime(t)) - -#endif - -#endif - - - - - -#if !defined(lua_tmpnam) - -#if defined(LUA_USE_POSIX) - -#include - -#define LUA_TMPNAMBUFSIZE 32 - -#if !defined(LUA_TMPNAMTEMPLATE) -#define LUA_TMPNAMTEMPLATE "/tmp/lua_XXXXXX" -#endif - -#define lua_tmpnam(b,e) { \ - strcpy(b, LUA_TMPNAMTEMPLATE); \ - e = mkstemp(b); \ - if (e != -1) close(e); \ - e = (e == -1); } - -#else - - -#define LUA_TMPNAMBUFSIZE L_tmpnam -#define lua_tmpnam(b,e) { e = (tmpnam(b) == NULL); } - -#endif - -#endif - - - -#if !defined(l_system) -#if defined(LUA_USE_IOS) - -#define l_system(cmd) ((cmd) == NULL ? 0 : -1) -#else -#define l_system(cmd) system(cmd) -#endif -#endif - - -static int os_execute (lua_State *L) { - const char *cmd = luaL_optstring(L, 1, NULL); - int stat; - errno = 0; - stat = l_system(cmd); - if (cmd != NULL) - return luaL_execresult(L, stat); - else { - lua_pushboolean(L, stat); - return 1; - } -} - - -static int os_remove (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - return luaL_fileresult(L, remove(filename) == 0, filename); -} - - -static int os_rename (lua_State *L) { - const char *fromname = luaL_checkstring(L, 1); - const char *toname = luaL_checkstring(L, 2); - return luaL_fileresult(L, rename(fromname, toname) == 0, NULL); -} -#ifdef __linux -static int os_tmpname(lua_State *L) { - char buff[100]; - const char *tmpdir = "/tmp/lua_XXXXXX"; - int fd = mkstemp(buff); - if (fd == -1) { - return luaL_error(L, "unable to generate a unique filename"); - } - - close(fd); - lua_pushstring(L, buff); - return 1; -} -#endif -#ifdef _WIN32 - -static int os_tmpname(lua_State *L) { - char buff[100] = {0}; - const char *template = "lua_XXXXXX"; - - GetTempPathA(sizeof(buff), buff); - - UINT fd = GetTempFileNameA(buff, template, 0, buff); - if (fd == -1) { - return luaL_error(L, "unable to generate a unique filename"); - } - close(fd); - // Empurrar o nome do arquivo temporário para a pilha Lua - lua_pushstring(L, buff); - return 1; -} -#endif -static int os_getenv (lua_State *L) { - lua_pushstring(L, getenv(luaL_checkstring(L, 1))); - return 1; -} - - -static int os_clock (lua_State *L) { - lua_pushnumber(L, ((lua_Number)clock())/(lua_Number)CLOCKS_PER_SEC); - return 1; -} - - - - - -static void setfield (lua_State *L, const char *key, int value, int delta) { - #if (defined(LUA_NUMTIME) && LUA_MAXINTEGER <= INT_MAX) - if (l_unlikely(value > LUA_MAXINTEGER - delta)) - luaL_error(L, "field '%s' is out-of-bound", key); - #endif - lua_pushinteger(L, (lua_Integer)value + delta); - lua_setfield(L, -2, key); -} - - -static void setboolfield (lua_State *L, const char *key, int value) { - if (value < 0) - return; - lua_pushboolean(L, value); - lua_setfield(L, -2, key); -} - - - -static void setallfields (lua_State *L, struct tm *stm) { - setfield(L, "year", stm->tm_year, 1900); - setfield(L, "month", stm->tm_mon, 1); - setfield(L, "day", stm->tm_mday, 0); - setfield(L, "hour", stm->tm_hour, 0); - setfield(L, "min", stm->tm_min, 0); - setfield(L, "sec", stm->tm_sec, 0); - setfield(L, "yday", stm->tm_yday, 1); - setfield(L, "wday", stm->tm_wday, 1); - setboolfield(L, "isdst", stm->tm_isdst); -} - - -static int getboolfield (lua_State *L, const char *key) { - int res; - res = (lua_getfield(L, -1, key) == LUA_TNIL) ? -1 : lua_toboolean(L, -1); - lua_pop(L, 1); - return res; -} - - -static int getfield (lua_State *L, const char *key, int d, int delta) { - int isnum; - int t = lua_getfield(L, -1, key); - lua_Integer res = lua_tointegerx(L, -1, &isnum); - if (!isnum) { - if (l_unlikely(t != LUA_TNIL)) - return luaL_error(L, "field '%s' is not an integer", key); - else if (l_unlikely(d < 0)) - return luaL_error(L, "field '%s' missing in date table", key); - res = d; - } - else { - if (!(res >= 0 ? res - delta <= INT_MAX : INT_MIN + delta <= res)) - return luaL_error(L, "field '%s' is out-of-bound", key); - res -= delta; - } - lua_pop(L, 1); - return (int)res; -} - - -static const char *checkoption (lua_State *L, const char *conv, - ptrdiff_t convlen, char *buff) { - const char *option = LUA_STRFTIMEOPTIONS; - int oplen = 1; - for (; *option != '\0' && oplen <= convlen; option += oplen) { - if (*option == '|') - oplen++; - else if (memcmp(conv, option, oplen) == 0) { - memcpy(buff, conv, oplen); - buff[oplen] = '\0'; - return conv + oplen; - } - } - luaL_argerror(L, 1, - lua_pushfstring(L, "invalid conversion specifier '%%%s'", conv)); - return conv; -} - - -static time_t l_checktime (lua_State *L, int arg) { - l_timet t = l_gettime(L, arg); - luaL_argcheck(L, (time_t)t == t, arg, "time out-of-bounds"); - return (time_t)t; -} - - - -#define SIZETIMEFMT 250 - - -static int os_date (lua_State *L) { - size_t slen; - const char *s = luaL_optlstring(L, 1, "%c", &slen); - time_t t = luaL_opt(L, l_checktime, 2, time(NULL)); - const char *se = s + slen; - struct tm tmr, *stm; - if (*s == '!') { - stm = l_gmtime(&t, &tmr); - s++; - } - else - stm = l_localtime(&t, &tmr); - if (stm == NULL) - return luaL_error(L, - "date result cannot be represented in this installation"); - if (strcmp(s, "*t") == 0) { - lua_createtable(L, 0, 9); - setallfields(L, stm); - } - else { - char cc[4]; - luaL_Buffer b; - cc[0] = '%'; - luaL_buffinit(L, &b); - while (s < se) { - if (*s != '%') - luaL_addchar(&b, *s++); - else { - size_t reslen; - char *buff = luaL_prepbuffsize(&b, SIZETIMEFMT); - s++; - s = checkoption(L, s, se - s, cc + 1); - reslen = strftime(buff, SIZETIMEFMT, cc, stm); - luaL_addsize(&b, reslen); - } - } - luaL_pushresult(&b); - } - return 1; -} - - -static int os_time (lua_State *L) { - time_t t; - if (lua_isnoneornil(L, 1)) - t = time(NULL); - else { - struct tm ts; - luaL_checktype(L, 1, LUA_TTABLE); - lua_settop(L, 1); - ts.tm_year = getfield(L, "year", -1, 1900); - ts.tm_mon = getfield(L, "month", -1, 1); - ts.tm_mday = getfield(L, "day", -1, 0); - ts.tm_hour = getfield(L, "hour", 12, 0); - ts.tm_min = getfield(L, "min", 0, 0); - ts.tm_sec = getfield(L, "sec", 0, 0); - ts.tm_isdst = getboolfield(L, "isdst"); - t = mktime(&ts); - setallfields(L, &ts); - } - if (t != (time_t)(l_timet)t || t == (time_t)(-1)) - return luaL_error(L, - "time result cannot be represented in this installation"); - l_pushtime(L, t); - return 1; -} - - -static int os_difftime (lua_State *L) { - time_t t1 = l_checktime(L, 1); - time_t t2 = l_checktime(L, 2); - lua_pushnumber(L, (lua_Number)difftime(t1, t2)); - return 1; -} - - - - -static int os_setlocale (lua_State *L) { - static const int cat[] = {LC_ALL, LC_COLLATE, LC_CTYPE, LC_MONETARY, - LC_NUMERIC, LC_TIME}; - static const char *const catnames[] = {"all", "collate", "ctype", "monetary", - "numeric", "time", NULL}; - const char *l = luaL_optstring(L, 1, NULL); - int op = luaL_checkoption(L, 2, "all", catnames); - lua_pushstring(L, setlocale(cat[op], l)); - return 1; -} - - -static int os_exit (lua_State *L) { - int status; - if (lua_isboolean(L, 1)) - status = (lua_toboolean(L, 1) ? EXIT_SUCCESS : EXIT_FAILURE); - else - status = (int)luaL_optinteger(L, 1, EXIT_SUCCESS); - if (lua_toboolean(L, 2)) - lua_close(L); - if (L) exit(status); - return 0; -} - - -static const luaL_Reg syslib[] = { - {"clock", os_clock}, - {"date", os_date}, - {"difftime", os_difftime}, - {"execute", os_execute}, - {"exit", os_exit}, - {"getenv", os_getenv}, - {"remove", os_remove}, - {"rename", os_rename}, - {"setlocale", os_setlocale}, - {"time", os_time}, - {"tmpname", os_tmpname}, - {NULL, NULL} -}; - - - - - -LUAMOD_API int luaopen_os (lua_State *L) { - luaL_newlib(L, syslib); - return 1; -} - - - -//path: src/dependencies/lua/lstrlib.c - - -#define lstrlib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include -#include -#include -#include -#include - - - - - - - - - - - -#if !defined(LUA_MAXCAPTURES) -#define LUA_MAXCAPTURES 32 -#endif - - - -#define uchar(c) ((unsigned char)(c)) - - - -#define MAX_SIZET ((size_t)(~(size_t)0)) - -#define MAXSIZE \ - (sizeof(size_t) < sizeof(int) ? MAX_SIZET : (size_t)(INT_MAX)) - - - - -static int str_len (lua_State *L) { - size_t l; - luaL_checklstring(L, 1, &l); - lua_pushinteger(L, (lua_Integer)l); - return 1; -} - - - -static size_t posrelatI (lua_Integer pos, size_t len) { - if (pos > 0) - return (size_t)pos; - else if (pos == 0) - return 1; - else if (pos < -(lua_Integer)len) - return 1; - else return len + (size_t)pos + 1; -} - - - -static size_t getendpos (lua_State *L, int arg, lua_Integer def, - size_t len) { - lua_Integer pos = luaL_optinteger(L, arg, def); - if (pos > (lua_Integer)len) - return len; - else if (pos >= 0) - return (size_t)pos; - else if (pos < -(lua_Integer)len) - return 0; - else return len + (size_t)pos + 1; -} - - -static int str_sub (lua_State *L) { - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - size_t start = posrelatI(luaL_checkinteger(L, 2), l); - size_t end = getendpos(L, 3, -1, l); - if (start <= end) - lua_pushlstring(L, s + start - 1, (end - start) + 1); - else lua_pushliteral(L, ""); - return 1; -} - - -static int str_reverse (lua_State *L) { - size_t l, i; - luaL_Buffer b; - const char *s = luaL_checklstring(L, 1, &l); - char *p = luaL_buffinitsize(L, &b, l); - for (i = 0; i < l; i++) - p[i] = s[l - i - 1]; - luaL_pushresultsize(&b, l); - return 1; -} - - -static int str_lower (lua_State *L) { - size_t l; - size_t i; - luaL_Buffer b; - const char *s = luaL_checklstring(L, 1, &l); - char *p = luaL_buffinitsize(L, &b, l); - for (i=0; i MAXSIZE / n)) - return luaL_error(L, "resulting string too large"); - else { - size_t totallen = (size_t)n * l + (size_t)(n - 1) * lsep; - luaL_Buffer b; - char *p = luaL_buffinitsize(L, &b, totallen); - while (n-- > 1) { - memcpy(p, s, l * sizeof(char)); p += l; - if (lsep > 0) { - memcpy(p, sep, lsep * sizeof(char)); - p += lsep; - } - } - memcpy(p, s, l * sizeof(char)); - luaL_pushresultsize(&b, totallen); - } - return 1; -} - - -static int str_byte (lua_State *L) { - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - lua_Integer pi = luaL_optinteger(L, 2, 1); - size_t posi = posrelatI(pi, l); - size_t pose = getendpos(L, 3, pi, l); - int n, i; - if (posi > pose) return 0; - if (l_unlikely(pose - posi >= (size_t)INT_MAX)) - return luaL_error(L, "string slice too long"); - n = (int)(pose - posi) + 1; - luaL_checkstack(L, n, "string slice too long"); - for (i=0; iinit) { - state->init = 1; - luaL_buffinit(L, &state->B); - } - if (b == NULL) { - luaL_pushresult(&state->B); - lua_replace(L, 1); - } - else - luaL_addlstring(&state->B, (const char *)b, size); - return 0; -} - - -static int str_dump (lua_State *L) { - struct str_Writer state; - int strip = lua_toboolean(L, 2); - luaL_argcheck(L, lua_type(L, 1) == LUA_TFUNCTION && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - - lua_pushvalue(L, 1); - state.init = 0; - lua_dump(L, writer, &state, strip); - lua_settop(L, 1); - return 1; -} - - - - - -#if defined(LUA_NOCVTS2N) - - - -static const luaL_Reg stringmetamethods[] = { - {"__index", NULL}, - {NULL, NULL} -}; - -#else - -static int tonum (lua_State *L, int arg) { - if (lua_type(L, arg) == LUA_TNUMBER) { - lua_pushvalue(L, arg); - return 1; - } - else { - size_t len; - const char *s = lua_tolstring(L, arg, &len); - return (s != NULL && lua_stringtonumber(L, s) == len + 1); - } -} - - -static void trymt (lua_State *L, const char *mtname) { - lua_settop(L, 2); - if (l_unlikely(lua_type(L, 2) == LUA_TSTRING || - !luaL_getmetafield(L, 2, mtname))) - luaL_error(L, "attempt to %s a '%s' with a '%s'", mtname + 2, - luaL_typename(L, -2), luaL_typename(L, -1)); - lua_insert(L, -3); - lua_call(L, 2, 1); -} - - -static int arith (lua_State *L, int op, const char *mtname) { - if (tonum(L, 1) && tonum(L, 2)) - lua_arith(L, op); - else - trymt(L, mtname); - return 1; -} - - -static int arith_add (lua_State *L) { - return arith(L, LUA_OPADD, "__add"); -} - -static int arith_sub (lua_State *L) { - return arith(L, LUA_OPSUB, "__sub"); -} - -static int arith_mul (lua_State *L) { - return arith(L, LUA_OPMUL, "__mul"); -} - -static int arith_mod (lua_State *L) { - return arith(L, LUA_OPMOD, "__mod"); -} - -static int arith_pow (lua_State *L) { - return arith(L, LUA_OPPOW, "__pow"); -} - -static int arith_div (lua_State *L) { - return arith(L, LUA_OPDIV, "__div"); -} - -static int arith_idiv (lua_State *L) { - return arith(L, LUA_OPIDIV, "__idiv"); -} - -static int arith_unm (lua_State *L) { - return arith(L, LUA_OPUNM, "__unm"); -} - - -static const luaL_Reg stringmetamethods[] = { - {"__add", arith_add}, - {"__sub", arith_sub}, - {"__mul", arith_mul}, - {"__mod", arith_mod}, - {"__pow", arith_pow}, - {"__div", arith_div}, - {"__idiv", arith_idiv}, - {"__unm", arith_unm}, - {"__index", NULL}, - {NULL, NULL} -}; - -#endif - - - - - - -#define CAP_UNFINISHED (-1) -#define CAP_POSITION (-2) - - -typedef struct MatchState { - const char *src_init; - const char *src_end; - const char *p_end; - lua_State *L; - int matchdepth; - unsigned char level; - struct { - const char *init; - ptrdiff_t len; - } capture[LUA_MAXCAPTURES]; -} MatchState; - - - -static const char *match (MatchState *ms, const char *s, const char *p); - - - -#if !defined(MAXCCALLS) -#define MAXCCALLS 200 -#endif - - -#define L_ESC '%' -#define SPECIALS "^$*+?.([%-" - - -static int check_capture (MatchState *ms, int l) { - l -= '1'; - if (l_unlikely(l < 0 || l >= ms->level || - ms->capture[l].len == CAP_UNFINISHED)) - return luaL_error(ms->L, "invalid capture index %%%d", l + 1); - return l; -} - - -static int capture_to_close (MatchState *ms) { - int level = ms->level; - for (level--; level>=0; level--) - if (ms->capture[level].len == CAP_UNFINISHED) return level; - return luaL_error(ms->L, "invalid pattern capture"); -} - - -static const char *classend (MatchState *ms, const char *p) { - switch (*p++) { - case L_ESC: { - if (l_unlikely(p == ms->p_end)) - luaL_error(ms->L, "malformed pattern (ends with '%%')"); - return p+1; - } - case '[': { - if (*p == '^') p++; - do { - if (l_unlikely(p == ms->p_end)) - luaL_error(ms->L, "malformed pattern (missing ']')"); - if (*(p++) == L_ESC && p < ms->p_end) - p++; - } while (*p != ']'); - return p+1; - } - default: { - return p; - } - } -} - - -static int match_class (int c, int cl) { - int res; - switch (tolower(cl)) { - case 'a' : res = isalpha(c); break; - case 'c' : res = iscntrl(c); break; - case 'd' : res = isdigit(c); break; - case 'g' : res = isgraph(c); break; - case 'l' : res = islower(c); break; - case 'p' : res = ispunct(c); break; - case 's' : res = isspace(c); break; - case 'u' : res = isupper(c); break; - case 'w' : res = isalnum(c); break; - case 'x' : res = isxdigit(c); break; - case 'z' : res = (c == 0); break; - default: return (cl == c); - } - return (islower(cl) ? res : !res); -} - - -static int matchbracketclass (int c, const char *p, const char *ec) { - int sig = 1; - if (*(p+1) == '^') { - sig = 0; - p++; - } - while (++p < ec) { - if (*p == L_ESC) { - p++; - if (match_class(c, uchar(*p))) - return sig; - } - else if ((*(p+1) == '-') && (p+2 < ec)) { - p+=2; - if (uchar(*(p-2)) <= c && c <= uchar(*p)) - return sig; - } - else if (uchar(*p) == c) return sig; - } - return !sig; -} - - -static int singlematch (MatchState *ms, const char *s, const char *p, - const char *ep) { - if (s >= ms->src_end) - return 0; - else { - int c = uchar(*s); - switch (*p) { - case '.': return 1; - case L_ESC: return match_class(c, uchar(*(p+1))); - case '[': return matchbracketclass(c, p, ep-1); - default: return (uchar(*p) == c); - } - } -} - - -static const char *matchbalance (MatchState *ms, const char *s, - const char *p) { - if (l_unlikely(p >= ms->p_end - 1)) - luaL_error(ms->L, "malformed pattern (missing arguments to '%%b')"); - if (*s != *p) return NULL; - else { - int b = *p; - int e = *(p+1); - int cont = 1; - while (++s < ms->src_end) { - if (*s == e) { - if (--cont == 0) return s+1; - } - else if (*s == b) cont++; - } - } - return NULL; -} - - -static const char *max_expand (MatchState *ms, const char *s, - const char *p, const char *ep) { - ptrdiff_t i = 0; - while (singlematch(ms, s + i, p, ep)) - i++; - - while (i>=0) { - const char *res = match(ms, (s+i), ep+1); - if (res) return res; - i--; - } - return NULL; -} - - -static const char *min_expand (MatchState *ms, const char *s, - const char *p, const char *ep) { - for (;;) { - const char *res = match(ms, s, ep+1); - if (res != NULL) - return res; - else if (singlematch(ms, s, p, ep)) - s++; - else return NULL; - } -} - - -static const char *start_capture (MatchState *ms, const char *s, - const char *p, int what) { - const char *res; - int level = ms->level; - if (level >= LUA_MAXCAPTURES) luaL_error(ms->L, "too many captures"); - ms->capture[level].init = s; - ms->capture[level].len = what; - ms->level = level+1; - if ((res=match(ms, s, p)) == NULL) - ms->level--; - return res; -} - - -static const char *end_capture (MatchState *ms, const char *s, - const char *p) { - int l = capture_to_close(ms); - const char *res; - ms->capture[l].len = s - ms->capture[l].init; - if ((res = match(ms, s, p)) == NULL) - ms->capture[l].len = CAP_UNFINISHED; - return res; -} - - -static const char *match_capture (MatchState *ms, const char *s, int l) { - size_t len; - l = check_capture(ms, l); - len = ms->capture[l].len; - if ((size_t)(ms->src_end-s) >= len && - memcmp(ms->capture[l].init, s, len) == 0) - return s+len; - else return NULL; -} - - -static const char *match (MatchState *ms, const char *s, const char *p) { - if (l_unlikely(ms->matchdepth-- == 0)) - luaL_error(ms->L, "pattern too complex"); - init: - if (p != ms->p_end) { - switch (*p) { - case '(': { - if (*(p + 1) == ')') - s = start_capture(ms, s, p + 2, CAP_POSITION); - else - s = start_capture(ms, s, p + 1, CAP_UNFINISHED); - break; - } - case ')': { - s = end_capture(ms, s, p + 1); - break; - } - case '$': { - if ((p + 1) != ms->p_end) - goto dflt; - s = (s == ms->src_end) ? s : NULL; - break; - } - case L_ESC: { - switch (*(p + 1)) { - case 'b': { - s = matchbalance(ms, s, p + 2); - if (s != NULL) { - p += 4; goto init; - } - break; - } - case 'f': { - const char *ep; char previous; - p += 2; - if (l_unlikely(*p != '[')) - luaL_error(ms->L, "missing '[' after '%%f' in pattern"); - ep = classend(ms, p); - previous = (s == ms->src_init) ? '\0' : *(s - 1); - if (!matchbracketclass(uchar(previous), p, ep - 1) && - matchbracketclass(uchar(*s), p, ep - 1)) { - p = ep; goto init; - } - s = NULL; - break; - } - case '0': case '1': case '2': case '3': - case '4': case '5': case '6': case '7': - case '8': case '9': { - s = match_capture(ms, s, uchar(*(p + 1))); - if (s != NULL) { - p += 2; goto init; - } - break; - } - default: goto dflt; - } - break; - } - default: dflt: { - const char *ep = classend(ms, p); - - if (!singlematch(ms, s, p, ep)) { - if (*ep == '*' || *ep == '?' || *ep == '-') { - p = ep + 1; goto init; - } - else - s = NULL; - } - else { - switch (*ep) { - case '?': { - const char *res; - if ((res = match(ms, s + 1, ep + 1)) != NULL) - s = res; - else { - p = ep + 1; goto init; - } - break; - } - case '+': - s++; - - case '*': - s = max_expand(ms, s, p, ep); - break; - case '-': - s = min_expand(ms, s, p, ep); - break; - default: - s++; p = ep; goto init; - } - } - break; - } - } - } - ms->matchdepth++; - return s; -} - - - -static const char *lmemfind (const char *s1, size_t l1, - const char *s2, size_t l2) { - if (l2 == 0) return s1; - else if (l2 > l1) return NULL; - else { - const char *init; - l2--; - l1 = l1-l2; - while (l1 > 0 && (init = (const char *)memchr(s1, *s2, l1)) != NULL) { - init++; - if (memcmp(init, s2+1, l2) == 0) - return init-1; - else { - l1 -= init-s1; - s1 = init; - } - } - return NULL; - } -} - - - -static size_t get_onecapture (MatchState *ms, int i, const char *s, - const char *e, const char **cap) { - if (i >= ms->level) { - if (l_unlikely(i != 0)) - luaL_error(ms->L, "invalid capture index %%%d", i + 1); - *cap = s; - return e - s; - } - else { - ptrdiff_t capl = ms->capture[i].len; - *cap = ms->capture[i].init; - if (l_unlikely(capl == CAP_UNFINISHED)) - luaL_error(ms->L, "unfinished capture"); - else if (capl == CAP_POSITION) - lua_pushinteger(ms->L, (ms->capture[i].init - ms->src_init) + 1); - return capl; - } -} - - - -static void push_onecapture (MatchState *ms, int i, const char *s, - const char *e) { - const char *cap; - ptrdiff_t l = get_onecapture(ms, i, s, e, &cap); - if (l != CAP_POSITION) - lua_pushlstring(ms->L, cap, l); - -} - - -static int push_captures (MatchState *ms, const char *s, const char *e) { - int i; - int nlevels = (ms->level == 0 && s) ? 1 : ms->level; - luaL_checkstack(ms->L, nlevels, "too many captures"); - for (i = 0; i < nlevels; i++) - push_onecapture(ms, i, s, e); - return nlevels; -} - - - -static int nospecials (const char *p, size_t l) { - size_t upto = 0; - do { - if (strpbrk(p + upto, SPECIALS)) - return 0; - upto += strlen(p + upto) + 1; - } while (upto <= l); - return 1; -} - - -static void prepstate (MatchState *ms, lua_State *L, - const char *s, size_t ls, const char *p, size_t lp) { - ms->L = L; - ms->matchdepth = MAXCCALLS; - ms->src_init = s; - ms->src_end = s + ls; - ms->p_end = p + lp; -} - - -static void reprepstate (MatchState *ms) { - ms->level = 0; - lua_assert(ms->matchdepth == MAXCCALLS); -} - - -static int str_find_aux (lua_State *L, int find) { - size_t ls, lp; - const char *s = luaL_checklstring(L, 1, &ls); - const char *p = luaL_checklstring(L, 2, &lp); - size_t init = posrelatI(luaL_optinteger(L, 3, 1), ls) - 1; - if (init > ls) { - luaL_pushfail(L); - return 1; - } - - if (find && (lua_toboolean(L, 4) || nospecials(p, lp))) { - - const char *s2 = lmemfind(s + init, ls - init, p, lp); - if (s2) { - lua_pushinteger(L, (s2 - s) + 1); - lua_pushinteger(L, (s2 - s) + lp); - return 2; - } - } - else { - MatchState ms; - const char *s1 = s + init; - int anchor = (*p == '^'); - if (anchor) { - p++; lp--; - } - prepstate(&ms, L, s, ls, p, lp); - do { - const char *res; - reprepstate(&ms); - if ((res=match(&ms, s1, p)) != NULL) { - if (find) { - lua_pushinteger(L, (s1 - s) + 1); - lua_pushinteger(L, res - s); - return push_captures(&ms, NULL, 0) + 2; - } - else - return push_captures(&ms, s1, res); - } - } while (s1++ < ms.src_end && !anchor); - } - luaL_pushfail(L); - return 1; -} - - -static int str_find (lua_State *L) { - return str_find_aux(L, 1); -} - - -static int str_match (lua_State *L) { - return str_find_aux(L, 0); -} - - - -typedef struct GMatchState { - const char *src; - const char *p; - const char *lastmatch; - MatchState ms; -} GMatchState; - - -static int gmatch_aux (lua_State *L) { - GMatchState *gm = (GMatchState *)lua_touserdata(L, lua_upvalueindex(3)); - const char *src; - gm->ms.L = L; - for (src = gm->src; src <= gm->ms.src_end; src++) { - const char *e; - reprepstate(&gm->ms); - if ((e = match(&gm->ms, src, gm->p)) != NULL && e != gm->lastmatch) { - gm->src = gm->lastmatch = e; - return push_captures(&gm->ms, src, e); - } - } - return 0; -} - - -static int gmatch (lua_State *L) { - size_t ls, lp; - const char *s = luaL_checklstring(L, 1, &ls); - const char *p = luaL_checklstring(L, 2, &lp); - size_t init = posrelatI(luaL_optinteger(L, 3, 1), ls) - 1; - GMatchState *gm; - lua_settop(L, 2); - gm = (GMatchState *)lua_newuserdatauv(L, sizeof(GMatchState), 0); - if (init > ls) - init = ls + 1; - prepstate(&gm->ms, L, s, ls, p, lp); - gm->src = s + init; gm->p = p; gm->lastmatch = NULL; - lua_pushcclosure(L, gmatch_aux, 3); - return 1; -} - - -static void add_s (MatchState *ms, luaL_Buffer *b, const char *s, - const char *e) { - size_t l; - lua_State *L = ms->L; - const char *news = lua_tolstring(L, 3, &l); - const char *p; - while ((p = (char *)memchr(news, L_ESC, l)) != NULL) { - luaL_addlstring(b, news, p - news); - p++; - if (*p == L_ESC) - luaL_addchar(b, *p); - else if (*p == '0') - luaL_addlstring(b, s, e - s); - else if (isdigit(uchar(*p))) { - const char *cap; - ptrdiff_t resl = get_onecapture(ms, *p - '1', s, e, &cap); - if (resl == CAP_POSITION) - luaL_addvalue(b); - else - luaL_addlstring(b, cap, resl); - } - else - luaL_error(L, "invalid use of '%c' in replacement string", L_ESC); - l -= p + 1 - news; - news = p + 1; - } - luaL_addlstring(b, news, l); -} - - - -static int add_value (MatchState *ms, luaL_Buffer *b, const char *s, - const char *e, int tr) { - lua_State *L = ms->L; - switch (tr) { - case LUA_TFUNCTION: { - int n; - lua_pushvalue(L, 3); - n = push_captures(ms, s, e); - lua_call(L, n, 1); - break; - } - case LUA_TTABLE: { - push_onecapture(ms, 0, s, e); - lua_gettable(L, 3); - break; - } - default: { - add_s(ms, b, s, e); - return 1; - } - } - if (!lua_toboolean(L, -1)) { - lua_pop(L, 1); - luaL_addlstring(b, s, e - s); - return 0; - } - else if (l_unlikely(!lua_isstring(L, -1))) - return luaL_error(L, "invalid replacement value (a %s)", - luaL_typename(L, -1)); - else { - luaL_addvalue(b); - return 1; - } -} - - -static int str_gsub (lua_State *L) { - size_t srcl, lp; - const char *src = luaL_checklstring(L, 1, &srcl); - const char *p = luaL_checklstring(L, 2, &lp); - const char *lastmatch = NULL; - int tr = lua_type(L, 3); - lua_Integer max_s = luaL_optinteger(L, 4, srcl + 1); - int anchor = (*p == '^'); - lua_Integer n = 0; - int changed = 0; - MatchState ms; - luaL_Buffer b; - luaL_argexpected(L, tr == LUA_TNUMBER || tr == LUA_TSTRING || - tr == LUA_TFUNCTION || tr == LUA_TTABLE, 3, - "string/function/table"); - luaL_buffinit(L, &b); - if (anchor) { - p++; lp--; - } - prepstate(&ms, L, src, srcl, p, lp); - while (n < max_s) { - const char *e; - reprepstate(&ms); - if ((e = match(&ms, src, p)) != NULL && e != lastmatch) { - n++; - changed = add_value(&ms, &b, src, e, tr) | changed; - src = lastmatch = e; - } - else if (src < ms.src_end) - luaL_addchar(&b, *src++); - else break; - if (anchor) break; - } - if (!changed) - lua_pushvalue(L, 1); - else { - luaL_addlstring(&b, src, ms.src_end-src); - luaL_pushresult(&b); - } - lua_pushinteger(L, n); - return 2; -} - - - - - - - -#if !defined(lua_number2strx) - - - -#define SIZELENMOD (sizeof(LUA_NUMBER_FRMLEN)/sizeof(char)) - - - -#define L_NBFD ((l_floatatt(MANT_DIG) - 1)%4 + 1) - - - -static lua_Number adddigit (char *buff, int n, lua_Number x) { - lua_Number dd = l_mathop(floor)(x); - int d = (int)dd; - buff[n] = (d < 10 ? d + '0' : d - 10 + 'a'); - return x - dd; -} - - -static int num2straux (char *buff, int sz, lua_Number x) { - - if (x != x || x == (lua_Number)HUGE_VAL || x == -(lua_Number)HUGE_VAL) - return l_sprintf(buff, sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)x); - else if (x == 0) { - - return l_sprintf(buff, sz, LUA_NUMBER_FMT "x0p+0", (LUAI_UACNUMBER)x); - } - else { - int e; - lua_Number m = l_mathop(frexp)(x, &e); - int n = 0; - if (m < 0) { - buff[n++] = '-'; - m = -m; - } - buff[n++] = '0'; buff[n++] = 'x'; - m = adddigit(buff, n++, m * (1 << L_NBFD)); - e -= L_NBFD; - if (m > 0) { - buff[n++] = lua_getlocaledecpoint(); - do { - m = adddigit(buff, n++, m * 16); - } while (m > 0); - } - n += l_sprintf(buff + n, sz - n, "p%+d", e); - lua_assert(n < sz); - return n; - } -} - - -static int lua_number2strx (lua_State *L, char *buff, int sz, - const char *fmt, lua_Number x) { - int n = num2straux(buff, sz, x); - if (fmt[SIZELENMOD] == 'A') { - int i; - for (i = 0; i < n; i++) - buff[i] = toupper(uchar(buff[i])); - } - else if (l_unlikely(fmt[SIZELENMOD] != 'a')) - return luaL_error(L, "modifiers for format '%%a'/'%%A' not implemented"); - return n; -} - -#endif - - - -#define MAX_ITEMF (110 + l_floatatt(MAX_10_EXP)) - - - -#define MAX_ITEM 120 - - - -#if !defined(L_FMTFLAGSF) - - -#define L_FMTFLAGSF "-+#0 " - - -#define L_FMTFLAGSX "-#0" - - -#define L_FMTFLAGSI "-+0 " - - -#define L_FMTFLAGSU "-0" - - -#define L_FMTFLAGSC "-" - -#endif - - - -#define MAX_FORMAT 32 - - -static void addquoted (luaL_Buffer *b, const char *s, size_t len) { - luaL_addchar(b, '"'); - while (len--) { - if (*s == '"' || *s == '\\' || *s == '\n') { - luaL_addchar(b, '\\'); - luaL_addchar(b, *s); - } - else if (iscntrl(uchar(*s))) { - char buff[10]; - if (!isdigit(uchar(*(s+1)))) - l_sprintf(buff, sizeof(buff), "\\%d", (int)uchar(*s)); - else - l_sprintf(buff, sizeof(buff), "\\%03d", (int)uchar(*s)); - luaL_addstring(b, buff); - } - else - luaL_addchar(b, *s); - s++; - } - luaL_addchar(b, '"'); -} - - - -static int quotefloat (lua_State *L, char *buff, lua_Number n) { - const char *s; - if (n == (lua_Number)HUGE_VAL) - s = "1e9999"; - else if (n == -(lua_Number)HUGE_VAL) - s = "-1e9999"; - else if (n != n) - s = "(0/0)"; - else { - int nb = lua_number2strx(L, buff, MAX_ITEM, - "%" LUA_NUMBER_FRMLEN "a", n); - - if (memchr(buff, '.', nb) == NULL) { - char point = lua_getlocaledecpoint(); - char *ppoint = (char *)memchr(buff, point, nb); - if (ppoint) *ppoint = '.'; - } - return nb; - } - - return l_sprintf(buff, MAX_ITEM, "%s", s); -} - - -static void addliteral (lua_State *L, luaL_Buffer *b, int arg) { - switch (lua_type(L, arg)) { - case LUA_TSTRING: { - size_t len; - const char *s = lua_tolstring(L, arg, &len); - addquoted(b, s, len); - break; - } - case LUA_TNUMBER: { - char *buff = luaL_prepbuffsize(b, MAX_ITEM); - int nb; - if (!lua_isinteger(L, arg)) - nb = quotefloat(L, buff, lua_tonumber(L, arg)); - else { - lua_Integer n = lua_tointeger(L, arg); - const char *format = (n == LUA_MININTEGER) - ? "0x%" LUA_INTEGER_FRMLEN "x" - : LUA_INTEGER_FMT; - nb = l_sprintf(buff, MAX_ITEM, format, (LUAI_UACINT)n); - } - luaL_addsize(b, nb); - break; - } - case LUA_TNIL: case LUA_TBOOLEAN: { - luaL_tolstring(L, arg, NULL); - luaL_addvalue(b); - break; - } - default: { - luaL_argerror(L, arg, "value has no literal form"); - } - } -} - - -static const char *get2digits (const char *s) { - if (isdigit(uchar(*s))) { - s++; - if (isdigit(uchar(*s))) s++; - } - return s; -} - - - -static void checkformat (lua_State *L, const char *form, const char *flags, - int precision) { - const char *spec = form + 1; - spec += strspn(spec, flags); - if (*spec != '0') { - spec = get2digits(spec); - if (*spec == '.' && precision) { - spec++; - spec = get2digits(spec); - } - } - if (!isalpha(uchar(*spec))) - luaL_error(L, "invalid conversion specification: '%s'", form); -} - - - -static const char *getformat (lua_State *L, const char *strfrmt, - char *form) { - - size_t len = strspn(strfrmt, L_FMTFLAGSF "123456789."); - len++; - - if (len >= MAX_FORMAT - 10) - luaL_error(L, "invalid format (too long)"); - *(form++) = '%'; - memcpy(form, strfrmt, len * sizeof(char)); - *(form + len) = '\0'; - return strfrmt + len - 1; -} - - - -static void addlenmod (char *form, const char *lenmod) { - size_t l = strlen(form); - size_t lm = strlen(lenmod); - char spec = form[l - 1]; - strcpy(form + l - 1, lenmod); - form[l + lm - 1] = spec; - form[l + lm] = '\0'; -} - - -static int str_format (lua_State *L) { - int top = lua_gettop(L); - int arg = 1; - size_t sfl; - const char *strfrmt = luaL_checklstring(L, arg, &sfl); - const char *strfrmt_end = strfrmt+sfl; - const char *flags; - luaL_Buffer b; - luaL_buffinit(L, &b); - while (strfrmt < strfrmt_end) { - if (*strfrmt != L_ESC) - luaL_addchar(&b, *strfrmt++); - else if (*++strfrmt == L_ESC) - luaL_addchar(&b, *strfrmt++); - else { - char form[MAX_FORMAT]; - int maxitem = MAX_ITEM; - char *buff = luaL_prepbuffsize(&b, maxitem); - int nb = 0; - if (++arg > top) - return luaL_argerror(L, arg, "no value"); - strfrmt = getformat(L, strfrmt, form); - switch (*strfrmt++) { - case 'c': { - checkformat(L, form, L_FMTFLAGSC, 0); - nb = l_sprintf(buff, maxitem, form, (int)luaL_checkinteger(L, arg)); - break; - } - case 'd': case 'i': - flags = L_FMTFLAGSI; - goto intcase; - case 'u': - flags = L_FMTFLAGSU; - goto intcase; - case 'o': case 'x': case 'X': - flags = L_FMTFLAGSX; - intcase: { - lua_Integer n = luaL_checkinteger(L, arg); - checkformat(L, form, flags, 1); - addlenmod(form, LUA_INTEGER_FRMLEN); - nb = l_sprintf(buff, maxitem, form, (LUAI_UACINT)n); - break; - } - case 'a': case 'A': - checkformat(L, form, L_FMTFLAGSF, 1); - addlenmod(form, LUA_NUMBER_FRMLEN); - nb = lua_number2strx(L, buff, maxitem, form, - luaL_checknumber(L, arg)); - break; - case 'f': - maxitem = MAX_ITEMF; - buff = luaL_prepbuffsize(&b, maxitem); - - case 'e': case 'E': case 'g': case 'G': { - lua_Number n = luaL_checknumber(L, arg); - checkformat(L, form, L_FMTFLAGSF, 1); - addlenmod(form, LUA_NUMBER_FRMLEN); - nb = l_sprintf(buff, maxitem, form, (LUAI_UACNUMBER)n); - break; - } - case 'p': { - const void *p = lua_topointer(L, arg); - checkformat(L, form, L_FMTFLAGSC, 0); - if (p == NULL) { - p = "(null)"; - form[strlen(form) - 1] = 's'; - } - nb = l_sprintf(buff, maxitem, form, p); - break; - } - case 'q': { - if (form[2] != '\0') - return luaL_error(L, "specifier '%%q' cannot have modifiers"); - addliteral(L, &b, arg); - break; - } - case 's': { - size_t l; - const char *s = luaL_tolstring(L, arg, &l); - if (form[2] == '\0') - luaL_addvalue(&b); - else { - luaL_argcheck(L, l == strlen(s), arg, "string contains zeros"); - checkformat(L, form, L_FMTFLAGSC, 1); - if (strchr(form, '.') == NULL && l >= 100) { - - luaL_addvalue(&b); - } - else { - nb = l_sprintf(buff, maxitem, form, s); - lua_pop(L, 1); - } - } - break; - } - default: { - return luaL_error(L, "invalid conversion '%s' to 'format'", form); - } - } - lua_assert(nb < maxitem); - luaL_addsize(&b, nb); - } - } - luaL_pushresult(&b); - return 1; -} - - - - - - - - -#if !defined(LUAL_PACKPADBYTE) -#define LUAL_PACKPADBYTE 0x00 -#endif - - -#define MAXINTSIZE 16 - - -#define NB CHAR_BIT - - -#define MC ((1 << NB) - 1) - - -#define SZINT ((int)sizeof(lua_Integer)) - - - -static const union { - int dummy; - char little; -} nativeendian = {1}; - - - -typedef struct Header { - lua_State *L; - int islittle; - int maxalign; -} Header; - - - -typedef enum KOption { - Kint, - Kuint, - Kfloat, - Knumber, - Kdouble, - Kchar, - Kstring, - Kzstr, - Kpadding, - Kpaddalign, - Knop -} KOption; - - - -static int digit (int c) { return '0' <= c && c <= '9'; } - -static int getnum (const char **fmt, int df) { - if (!digit(**fmt)) - return df; - else { - int a = 0; - do { - a = a*10 + (*((*fmt)++) - '0'); - } while (digit(**fmt) && a <= ((int)MAXSIZE - 9)/10); - return a; - } -} - - - -static int getnumlimit (Header *h, const char **fmt, int df) { - int sz = getnum(fmt, df); - if (l_unlikely(sz > MAXINTSIZE || sz <= 0)) - return luaL_error(h->L, "integral size (%d) out of limits [1,%d]", - sz, MAXINTSIZE); - return sz; -} - - - -static void initheader (lua_State *L, Header *h) { - h->L = L; - h->islittle = nativeendian.little; - h->maxalign = 1; -} - - - -static KOption getoption (Header *h, const char **fmt, int *size) { - - struct cD { char c; union { LUAI_MAXALIGN; } u; }; - int opt = *((*fmt)++); - *size = 0; - switch (opt) { - case 'b': *size = sizeof(char); return Kint; - case 'B': *size = sizeof(char); return Kuint; - case 'h': *size = sizeof(short); return Kint; - case 'H': *size = sizeof(short); return Kuint; - case 'l': *size = sizeof(long); return Kint; - case 'L': *size = sizeof(long); return Kuint; - case 'j': *size = sizeof(lua_Integer); return Kint; - case 'J': *size = sizeof(lua_Integer); return Kuint; - case 'T': *size = sizeof(size_t); return Kuint; - case 'f': *size = sizeof(float); return Kfloat; - case 'n': *size = sizeof(lua_Number); return Knumber; - case 'd': *size = sizeof(double); return Kdouble; - case 'i': *size = getnumlimit(h, fmt, sizeof(int)); return Kint; - case 'I': *size = getnumlimit(h, fmt, sizeof(int)); return Kuint; - case 's': *size = getnumlimit(h, fmt, sizeof(size_t)); return Kstring; - case 'c': - *size = getnum(fmt, -1); - if (l_unlikely(*size == -1)) - luaL_error(h->L, "missing size for format option 'c'"); - return Kchar; - case 'z': return Kzstr; - case 'x': *size = 1; return Kpadding; - case 'X': return Kpaddalign; - case ' ': break; - case '<': h->islittle = 1; break; - case '>': h->islittle = 0; break; - case '=': h->islittle = nativeendian.little; break; - case '!': { - const int maxalign = offsetof(struct cD, u); - h->maxalign = getnumlimit(h, fmt, maxalign); - break; - } - default: luaL_error(h->L, "invalid format option '%c'", opt); - } - return Knop; -} - - - -static KOption getdetails (Header *h, size_t totalsize, - const char **fmt, int *psize, int *ntoalign) { - KOption opt = getoption(h, fmt, psize); - int align = *psize; - if (opt == Kpaddalign) { - if (**fmt == '\0' || getoption(h, fmt, &align) == Kchar || align == 0) - luaL_argerror(h->L, 1, "invalid next option for option 'X'"); - } - if (align <= 1 || opt == Kchar) - *ntoalign = 0; - else { - if (align > h->maxalign) - align = h->maxalign; - if (l_unlikely((align & (align - 1)) != 0)) - luaL_argerror(h->L, 1, "format asks for alignment not power of 2"); - *ntoalign = (align - (int)(totalsize & (align - 1))) & (align - 1); - } - return opt; -} - - - -static void packint (luaL_Buffer *b, lua_Unsigned n, - int islittle, int size, int neg) { - char *buff = luaL_prepbuffsize(b, size); - int i; - buff[islittle ? 0 : size - 1] = (char)(n & MC); - for (i = 1; i < size; i++) { - n >>= NB; - buff[islittle ? i : size - 1 - i] = (char)(n & MC); - } - if (neg && size > SZINT) { - for (i = SZINT; i < size; i++) - buff[islittle ? i : size - 1 - i] = (char)MC; - } - luaL_addsize(b, size); -} - - - -static void copywithendian (char *dest, const char *src, - int size, int islittle) { - if (islittle == nativeendian.little) - memcpy(dest, src, size); - else { - dest += size - 1; - while (size-- != 0) - *(dest--) = *(src++); - } -} - - -static int str_pack (lua_State *L) { - luaL_Buffer b; - Header h; - const char *fmt = luaL_checkstring(L, 1); - int arg = 1; - size_t totalsize = 0; - initheader(L, &h); - lua_pushnil(L); - luaL_buffinit(L, &b); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, totalsize, &fmt, &size, &ntoalign); - totalsize += ntoalign + size; - while (ntoalign-- > 0) - luaL_addchar(&b, LUAL_PACKPADBYTE); - arg++; - switch (opt) { - case Kint: { - lua_Integer n = luaL_checkinteger(L, arg); - if (size < SZINT) { - lua_Integer lim = (lua_Integer)1 << ((size * NB) - 1); - luaL_argcheck(L, -lim <= n && n < lim, arg, "integer overflow"); - } - packint(&b, (lua_Unsigned)n, h.islittle, size, (n < 0)); - break; - } - case Kuint: { - lua_Integer n = luaL_checkinteger(L, arg); - if (size < SZINT) - luaL_argcheck(L, (lua_Unsigned)n < ((lua_Unsigned)1 << (size * NB)), - arg, "unsigned overflow"); - packint(&b, (lua_Unsigned)n, h.islittle, size, 0); - break; - } - case Kfloat: { - float f = (float)luaL_checknumber(L, arg); - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Knumber: { - lua_Number f = luaL_checknumber(L, arg); - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Kdouble: { - double f = (double)luaL_checknumber(L, arg); - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Kchar: { - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, len <= (size_t)size, arg, - "string longer than given size"); - luaL_addlstring(&b, s, len); - while (len++ < (size_t)size) - luaL_addchar(&b, LUAL_PACKPADBYTE); - break; - } - case Kstring: { - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, size >= (int)sizeof(size_t) || - len < ((size_t)1 << (size * NB)), - arg, "string length does not fit in given size"); - packint(&b, (lua_Unsigned)len, h.islittle, size, 0); - luaL_addlstring(&b, s, len); - totalsize += len; - break; - } - case Kzstr: { - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, strlen(s) == len, arg, "string contains zeros"); - luaL_addlstring(&b, s, len); - luaL_addchar(&b, '\0'); - totalsize += len + 1; - break; - } - case Kpadding: luaL_addchar(&b, LUAL_PACKPADBYTE); - case Kpaddalign: case Knop: - arg--; - break; - } - } - luaL_pushresult(&b); - return 1; -} - - -static int str_packsize (lua_State *L) { - Header h; - const char *fmt = luaL_checkstring(L, 1); - size_t totalsize = 0; - initheader(L, &h); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, totalsize, &fmt, &size, &ntoalign); - luaL_argcheck(L, opt != Kstring && opt != Kzstr, 1, - "variable-length format"); - size += ntoalign; - luaL_argcheck(L, totalsize <= MAXSIZE - size, 1, - "format result too large"); - totalsize += size; - } - lua_pushinteger(L, (lua_Integer)totalsize); - return 1; -} - - - -static lua_Integer unpackint (lua_State *L, const char *str, - int islittle, int size, int issigned) { - lua_Unsigned res = 0; - int i; - int limit = (size <= SZINT) ? size : SZINT; - for (i = limit - 1; i >= 0; i--) { - res <<= NB; - res |= (lua_Unsigned)(unsigned char)str[islittle ? i : size - 1 - i]; - } - if (size < SZINT) { - if (issigned) { - lua_Unsigned mask = (lua_Unsigned)1 << (size*NB - 1); - res = ((res ^ mask) - mask); - } - } - else if (size > SZINT) { - int mask = (!issigned || (lua_Integer)res >= 0) ? 0 : MC; - for (i = limit; i < size; i++) { - if (l_unlikely((unsigned char)str[islittle ? i : size - 1 - i] != mask)) - luaL_error(L, "%d-byte integer does not fit into Lua Integer", size); - } - } - return (lua_Integer)res; -} - - -static int str_unpack (lua_State *L) { - Header h; - const char *fmt = luaL_checkstring(L, 1); - size_t ld; - const char *data = luaL_checklstring(L, 2, &ld); - size_t pos = posrelatI(luaL_optinteger(L, 3, 1), ld) - 1; - int n = 0; - luaL_argcheck(L, pos <= ld, 3, "initial position out of string"); - initheader(L, &h); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, pos, &fmt, &size, &ntoalign); - luaL_argcheck(L, (size_t)ntoalign + size <= ld - pos, 2, - "data string too short"); - pos += ntoalign; - - luaL_checkstack(L, 2, "too many results"); - n++; - switch (opt) { - case Kint: - case Kuint: { - lua_Integer res = unpackint(L, data + pos, h.islittle, size, - (opt == Kint)); - lua_pushinteger(L, res); - break; - } - case Kfloat: { - float f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, (lua_Number)f); - break; - } - case Knumber: { - lua_Number f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, f); - break; - } - case Kdouble: { - double f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, (lua_Number)f); - break; - } - case Kchar: { - lua_pushlstring(L, data + pos, size); - break; - } - case Kstring: { - size_t len = (size_t)unpackint(L, data + pos, h.islittle, size, 0); - luaL_argcheck(L, len <= ld - pos - size, 2, "data string too short"); - lua_pushlstring(L, data + pos + size, len); - pos += len; - break; - } - case Kzstr: { - size_t len = strlen(data + pos); - luaL_argcheck(L, pos + len < ld, 2, - "unfinished string for format 'z'"); - lua_pushlstring(L, data + pos, len); - pos += len + 1; - break; - } - case Kpaddalign: case Kpadding: case Knop: - n--; - break; - } - pos += size; - } - lua_pushinteger(L, pos + 1); - return n + 1; -} - - - - -static const luaL_Reg strlib[] = { - {"byte", str_byte}, - {"char", str_char}, - {"dump", str_dump}, - {"find", str_find}, - {"format", str_format}, - {"gmatch", gmatch}, - {"gsub", str_gsub}, - {"len", str_len}, - {"lower", str_lower}, - {"match", str_match}, - {"rep", str_rep}, - {"reverse", str_reverse}, - {"sub", str_sub}, - {"upper", str_upper}, - {"pack", str_pack}, - {"packsize", str_packsize}, - {"unpack", str_unpack}, - {NULL, NULL} -}; - - -static void createmetatable (lua_State *L) { - - luaL_newlibtable(L, stringmetamethods); - luaL_setfuncs(L, stringmetamethods, 0); - lua_pushliteral(L, ""); - lua_pushvalue(L, -2); - lua_setmetatable(L, -2); - lua_pop(L, 1); - lua_pushvalue(L, -2); - lua_setfield(L, -2, "__index"); - lua_pop(L, 1); -} - - - -LUAMOD_API int luaopen_string (lua_State *L) { - luaL_newlib(L, strlib); - createmetatable(L); - return 1; -} - - - -//path: src/dependencies/lua/ltablib.c - - -#define ltablib_c -#define LUA_LIB - - - - - -#include -#include -#include - - - - - - - - - - - -#define TAB_R 1 -#define TAB_W 2 -#define TAB_L 4 -#define TAB_RW (TAB_R | TAB_W) - - -#define aux_getn(L,n,w) (checktab(L, n, (w) | TAB_L), luaL_len(L, n)) - - -static int checkfield (lua_State *L, const char *key, int n) { - lua_pushstring(L, key); - return (lua_rawget(L, -n) != LUA_TNIL); -} - - - -static void checktab (lua_State *L, int arg, int what) { - if (lua_type(L, arg) != LUA_TTABLE) { - int n = 1; - if (lua_getmetatable(L, arg) && - (!(what & TAB_R) || checkfield(L, "__index", ++n)) && - (!(what & TAB_W) || checkfield(L, "__newindex", ++n)) && - (!(what & TAB_L) || checkfield(L, "__len", ++n))) { - lua_pop(L, n); - } - else - luaL_checktype(L, arg, LUA_TTABLE); - } -} - - -static int tcreate (lua_State *L) { - lua_Unsigned sizeseq = (lua_Unsigned)luaL_checkinteger(L, 1); - lua_Unsigned sizerest = (lua_Unsigned)luaL_optinteger(L, 2, 0); - luaL_argcheck(L, sizeseq <= UINT_MAX, 1, "out of range"); - luaL_argcheck(L, sizerest <= UINT_MAX, 2, "out of range"); - lua_createtable(L, (unsigned)sizeseq, (unsigned)sizerest); - return 1; -} - - -static int tinsert (lua_State *L) { - lua_Integer pos; - lua_Integer e = aux_getn(L, 1, TAB_RW); - e = luaL_intop(+, e, 1); - switch (lua_gettop(L)) { - case 2: { - pos = e; - break; - } - case 3: { - lua_Integer i; - pos = luaL_checkinteger(L, 2); - - luaL_argcheck(L, (lua_Unsigned)pos - 1u < (lua_Unsigned)e, 2, - "position out of bounds"); - for (i = e; i > pos; i--) { - lua_geti(L, 1, i - 1); - lua_seti(L, 1, i); - } - break; - } - default: { - return luaL_error(L, "wrong number of arguments to 'insert'"); - } - } - lua_seti(L, 1, pos); - return 0; -} - - -static int tremove (lua_State *L) { - lua_Integer size = aux_getn(L, 1, TAB_RW); - lua_Integer pos = luaL_optinteger(L, 2, size); - if (pos != size) - - luaL_argcheck(L, (lua_Unsigned)pos - 1u <= (lua_Unsigned)size, 2, - "position out of bounds"); - lua_geti(L, 1, pos); - for ( ; pos < size; pos++) { - lua_geti(L, 1, pos + 1); - lua_seti(L, 1, pos); - } - lua_pushnil(L); - lua_seti(L, 1, pos); - return 1; -} - - - -static int tmove (lua_State *L) { - lua_Integer f = luaL_checkinteger(L, 2); - lua_Integer e = luaL_checkinteger(L, 3); - lua_Integer t = luaL_checkinteger(L, 4); - int tt = !lua_isnoneornil(L, 5) ? 5 : 1; - checktab(L, 1, TAB_R); - checktab(L, tt, TAB_W); - if (e >= f) { - lua_Integer n, i; - luaL_argcheck(L, f > 0 || e < LUA_MAXINTEGER + f, 3, - "too many elements to move"); - n = e - f + 1; - luaL_argcheck(L, t <= LUA_MAXINTEGER - n + 1, 4, - "destination wrap around"); - if (t > e || t <= f || (tt != 1 && !lua_compare(L, 1, tt, LUA_OPEQ))) { - for (i = 0; i < n; i++) { - lua_geti(L, 1, f + i); - lua_seti(L, tt, t + i); - } - } - else { - for (i = n - 1; i >= 0; i--) { - lua_geti(L, 1, f + i); - lua_seti(L, tt, t + i); - } - } - } - lua_pushvalue(L, tt); - return 1; -} - - -static void addfield (lua_State *L, luaL_Buffer *b, lua_Integer i) { - lua_geti(L, 1, i); - if (l_unlikely(!lua_isstring(L, -1))) - luaL_error(L, "invalid value (%s) at index %I in table for 'concat'", - luaL_typename(L, -1), (LUAI_UACINT)i); - luaL_addvalue(b); -} - - -static int tconcat (lua_State *L) { - luaL_Buffer b; - lua_Integer last = aux_getn(L, 1, TAB_R); - size_t lsep; - const char *sep = luaL_optlstring(L, 2, "", &lsep); - lua_Integer i = luaL_optinteger(L, 3, 1); - last = luaL_optinteger(L, 4, last); - luaL_buffinit(L, &b); - for (; i < last; i++) { - addfield(L, &b, i); - luaL_addlstring(&b, sep, lsep); - } - if (i == last) - addfield(L, &b, i); - luaL_pushresult(&b); - return 1; -} - - - - -static int tpack (lua_State *L) { - int i; - int n = lua_gettop(L); - lua_createtable(L, n, 1); - lua_insert(L, 1); - for (i = n; i >= 1; i--) - lua_seti(L, 1, i); - lua_pushinteger(L, n); - lua_setfield(L, 1, "n"); - return 1; -} - - -static int tunpack (lua_State *L) { - lua_Unsigned n; - lua_Integer i = luaL_optinteger(L, 2, 1); - lua_Integer e = luaL_opt(L, luaL_checkinteger, 3, luaL_len(L, 1)); - if (i > e) return 0; - n = (lua_Unsigned)e - i; - if (l_unlikely(n >= (unsigned int)INT_MAX || - !lua_checkstack(L, (int)(++n)))) - return luaL_error(L, "too many results to unpack"); - for (; i < e; i++) { - lua_geti(L, 1, i); - } - lua_geti(L, 1, e); - return (int)n; -} - - - - - - - - - -typedef unsigned int IdxT; - - - -#if !defined(l_randomizePivot) -#define l_randomizePivot(L) luaL_makeseed(L) -#endif - - - -#define RANLIMIT 100u - - -static void set2 (lua_State *L, IdxT i, IdxT j) { - lua_seti(L, 1, i); - lua_seti(L, 1, j); -} - - - -static int sort_comp (lua_State *L, int a, int b) { - if (lua_isnil(L, 2)) - return lua_compare(L, a, b, LUA_OPLT); - else { - int res; - lua_pushvalue(L, 2); - lua_pushvalue(L, a-1); - lua_pushvalue(L, b-2); - lua_call(L, 2, 1); - res = lua_toboolean(L, -1); - lua_pop(L, 1); - return res; - } -} - - - -static IdxT partition (lua_State *L, IdxT lo, IdxT up) { - IdxT i = lo; - IdxT j = up - 1; - - for (;;) { - - while ((void)lua_geti(L, 1, ++i), sort_comp(L, -1, -2)) { - if (l_unlikely(i == up - 1)) - luaL_error(L, "invalid order function for sorting"); - lua_pop(L, 1); - } - - - while ((void)lua_geti(L, 1, --j), sort_comp(L, -3, -1)) { - if (l_unlikely(j < i)) - luaL_error(L, "invalid order function for sorting"); - lua_pop(L, 1); - } - - if (j < i) { - - lua_pop(L, 1); - - set2(L, up - 1, i); - return i; - } - - set2(L, i, j); - } -} - - - -static IdxT choosePivot (IdxT lo, IdxT up, unsigned int rnd) { - IdxT r4 = (up - lo) / 4; - IdxT p = (rnd ^ lo ^ up) % (r4 * 2) + (lo + r4); - lua_assert(lo + r4 <= p && p <= up - r4); - return p; -} - - - -static void auxsort (lua_State *L, IdxT lo, IdxT up, unsigned rnd) { - while (lo < up) { - IdxT p; - IdxT n; - - lua_geti(L, 1, lo); - lua_geti(L, 1, up); - if (sort_comp(L, -1, -2)) - set2(L, lo, up); - else - lua_pop(L, 2); - if (up - lo == 1) - return; - if (up - lo < RANLIMIT || rnd == 0) - p = (lo + up)/2; - else - p = choosePivot(lo, up, rnd); - lua_geti(L, 1, p); - lua_geti(L, 1, lo); - if (sort_comp(L, -2, -1)) - set2(L, p, lo); - else { - lua_pop(L, 1); - lua_geti(L, 1, up); - if (sort_comp(L, -1, -2)) - set2(L, p, up); - else - lua_pop(L, 2); - } - if (up - lo == 2) - return; - lua_geti(L, 1, p); - lua_pushvalue(L, -1); - lua_geti(L, 1, up - 1); - set2(L, p, up - 1); - p = partition(L, lo, up); - - if (p - lo < up - p) { - auxsort(L, lo, p - 1, rnd); - n = p - lo; - lo = p + 1; - } - else { - auxsort(L, p + 1, up, rnd); - n = up - p; - up = p - 1; - } - if ((up - lo) / 128 > n) - rnd = l_randomizePivot(L); - } -} - - -static int sort (lua_State *L) { - lua_Integer n = aux_getn(L, 1, TAB_RW); - if (n > 1) { - luaL_argcheck(L, n < INT_MAX, 1, "array too big"); - if (!lua_isnoneornil(L, 2)) - luaL_checktype(L, 2, LUA_TFUNCTION); - lua_settop(L, 2); - auxsort(L, 1, (IdxT)n, 0); - } - return 0; -} - - - - -static const luaL_Reg tab_funcs[] = { - {"concat", tconcat}, - {"create", tcreate}, - {"insert", tinsert}, - {"pack", tpack}, - {"unpack", tunpack}, - {"remove", tremove}, - {"move", tmove}, - {"sort", sort}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_table (lua_State *L) { - luaL_newlib(L, tab_funcs); - return 1; -} - - - -//path: src/dependencies/lua/lutf8lib.c - - -#define lutf8lib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include - - - - - - - - - - -#define MAXUNICODE 0x10FFFFu - -#define MAXUTF 0x7FFFFFFFu - - -#define MSGInvalid "invalid UTF-8 code" - - -#if (UINT_MAX >> 30) >= 1 -typedef unsigned int utfint; -#else -typedef unsigned long utfint; -#endif - - -#define iscont(c) (((c) & 0xC0) == 0x80) -#define iscontp(p) iscont(*(p)) - - - - -static lua_Integer u_posrelat (lua_Integer pos, size_t len) { - if (pos >= 0) return pos; - else if (0u - (size_t)pos > len) return 0; - else return (lua_Integer)len + pos + 1; -} - - - -static const char *utf8_decode (const char *s, utfint *val, int strict) { - static const utfint limits[] = - {~(utfint)0, 0x80, 0x800, 0x10000u, 0x200000u, 0x4000000u}; - unsigned int c = (unsigned char)s[0]; - utfint res = 0; - if (c < 0x80) - res = c; - else { - int count = 0; - for (; c & 0x40; c <<= 1) { - unsigned int cc = (unsigned char)s[++count]; - if (!iscont(cc)) - return NULL; - res = (res << 6) | (cc & 0x3F); - } - res |= ((utfint)(c & 0x7F) << (count * 5)); - if (count > 5 || res > MAXUTF || res < limits[count]) - return NULL; - s += count; - } - if (strict) { - - if (res > MAXUNICODE || (0xD800u <= res && res <= 0xDFFFu)) - return NULL; - } - if (val) *val = res; - return s + 1; -} - - - -static int utflen (lua_State *L) { - lua_Integer n = 0; - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer posi = u_posrelat(luaL_optinteger(L, 2, 1), len); - lua_Integer posj = u_posrelat(luaL_optinteger(L, 3, -1), len); - int lax = lua_toboolean(L, 4); - luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 2, - "initial position out of bounds"); - luaL_argcheck(L, --posj < (lua_Integer)len, 3, - "final position out of bounds"); - while (posi <= posj) { - const char *s1 = utf8_decode(s + posi, NULL, !lax); - if (s1 == NULL) { - luaL_pushfail(L); - lua_pushinteger(L, posi + 1); - return 2; - } - posi = s1 - s; - n++; - } - lua_pushinteger(L, n); - return 1; -} - - - -static int codepoint (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer posi = u_posrelat(luaL_optinteger(L, 2, 1), len); - lua_Integer pose = u_posrelat(luaL_optinteger(L, 3, posi), len); - int lax = lua_toboolean(L, 4); - int n; - const char *se; - luaL_argcheck(L, posi >= 1, 2, "out of bounds"); - luaL_argcheck(L, pose <= (lua_Integer)len, 3, "out of bounds"); - if (posi > pose) return 0; - if (pose - posi >= INT_MAX) - return luaL_error(L, "string slice too long"); - n = (int)(pose - posi) + 1; - luaL_checkstack(L, n, "string slice too long"); - n = 0; - se = s + pose; - for (s += posi - 1; s < se;) { - utfint code; - s = utf8_decode(s, &code, !lax); - if (s == NULL) - return luaL_error(L, MSGInvalid); - lua_pushinteger(L, code); - n++; - } - return n; -} - - -static void pushutfchar (lua_State *L, int arg) { - lua_Unsigned code = (lua_Unsigned)luaL_checkinteger(L, arg); - luaL_argcheck(L, code <= MAXUTF, arg, "value out of range"); - lua_pushfstring(L, "%U", (long)code); -} - - - -static int utfchar (lua_State *L) { - int n = lua_gettop(L); - if (n == 1) - pushutfchar(L, 1); - else { - int i; - luaL_Buffer b; - luaL_buffinit(L, &b); - for (i = 1; i <= n; i++) { - pushutfchar(L, i); - luaL_addvalue(&b); - } - luaL_pushresult(&b); - } - return 1; -} - - - -static int byteoffset (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer n = luaL_checkinteger(L, 2); - lua_Integer posi = (n >= 0) ? 1 : len + 1; - posi = u_posrelat(luaL_optinteger(L, 3, posi), len); - luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 3, - "position out of bounds"); - if (n == 0) { - - while (posi > 0 && iscontp(s + posi)) posi--; - } - else { - if (iscontp(s + posi)) - return luaL_error(L, "initial position is a continuation byte"); - if (n < 0) { - while (n < 0 && posi > 0) { - do { - posi--; - } while (posi > 0 && iscontp(s + posi)); - n++; - } - } - else { - n--; - while (n > 0 && posi < (lua_Integer)len) { - do { - posi++; - } while (iscontp(s + posi)); - n--; - } - } - } - if (n == 0) - lua_pushinteger(L, posi + 1); - else - luaL_pushfail(L); - return 1; -} - - -static int iter_aux (lua_State *L, int strict) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Unsigned n = (lua_Unsigned)lua_tointeger(L, 2); - if (n < len) { - while (iscontp(s + n)) n++; - } - if (n >= len) - return 0; - else { - utfint code; - const char *next = utf8_decode(s + n, &code, strict); - if (next == NULL || iscontp(next)) - return luaL_error(L, MSGInvalid); - lua_pushinteger(L, n + 1); - lua_pushinteger(L, code); - return 2; - } -} - - -static int iter_auxstrict (lua_State *L) { - return iter_aux(L, 1); -} - -static int iter_auxlax (lua_State *L) { - return iter_aux(L, 0); -} - - -static int iter_codes (lua_State *L) { - int lax = lua_toboolean(L, 2); - const char *s = luaL_checkstring(L, 1); - luaL_argcheck(L, !iscontp(s), 1, MSGInvalid); - lua_pushcfunction(L, lax ? iter_auxlax : iter_auxstrict); - lua_pushvalue(L, 1); - lua_pushinteger(L, 0); - return 3; -} - - - -#define UTF8PATT "[\0-\x7F\xC2-\xFD][\x80-\xBF]*" - - -static const luaL_Reg funcs[] = { - {"offset", byteoffset}, - {"codepoint", codepoint}, - {"char", utfchar}, - {"len", utflen}, - {"codes", iter_codes}, - - {"charpattern", NULL}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_utf8 (lua_State *L) { - luaL_newlib(L, funcs); - lua_pushlstring(L, UTF8PATT, sizeof(UTF8PATT)/sizeof(char) - 1); - lua_setfield(L, -2, "charpattern"); - return 1; -} - - - -//path: src/dependencies/lua/linit.c - - - -#define linit_c -#define LUA_LIB - - - - - - -#include - - - - - - - - - - - -static const luaL_Reg stdlibs[] = { - {LUA_GNAME, luaopen_base}, - {LUA_LOADLIBNAME, luaopen_package}, - {LUA_COLIBNAME, luaopen_coroutine}, - {LUA_DBLIBNAME, luaopen_debug}, - {LUA_IOLIBNAME, luaopen_io}, - {LUA_MATHLIBNAME, luaopen_math}, - {LUA_OSLIBNAME, luaopen_os}, - {LUA_STRLIBNAME, luaopen_string}, - {LUA_TABLIBNAME, luaopen_table}, - {LUA_UTF8LIBNAME, luaopen_utf8}, - {NULL, NULL} -}; - - - -LUALIB_API void luaL_openselectedlibs (lua_State *L, int load, int preload) { - int mask; - const luaL_Reg *lib; - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - for (lib = stdlibs, mask = 1; lib->name != NULL; lib++, mask <<= 1) { - if (load & mask) { - luaL_requiref(L, lib->name, lib->func, 1); - lua_pop(L, 1); - } - else if (preload & mask) { - lua_pushcfunction(L, lib->func); - lua_setfield(L, -2, lib->name); - } - } - lua_assert((mask >> 1) == LUA_UTF8LIBK); - lua_pop(L, 1); -} - - - -#endif - - -#ifdef MAKE_LUA -//path: src/dependencies/lua/lua.c - - -#define lua_c - - - - - -#include -#include -#include - -#include - - - - - - - - - - -#if !defined(LUA_PROGNAME) -#define LUA_PROGNAME "lua" -#endif - -#if !defined(LUA_INIT_VAR) -#define LUA_INIT_VAR "LUA_INIT" -#endif - -#define LUA_INITVARVERSION LUA_INIT_VAR LUA_VERSUFFIX - - -static lua_State *globalL = NULL; - -static const char *progname = LUA_PROGNAME; - - -#if defined(LUA_USE_POSIX) - - -static void setsignal (int sig, void (*handler)(int)) { - struct sigaction sa; - sa.sa_handler = handler; - sa.sa_flags = 0; - sigemptyset(&sa.sa_mask); - sigaction(sig, &sa, NULL); -} - -#else - -#define setsignal signal - -#endif - - - -static void lstop (lua_State *L, lua_Debug *ar) { - (void)ar; - lua_sethook(L, NULL, 0, 0); - luaL_error(L, "interrupted!"); -} - - - -static void laction (int i) { - int flag = LUA_MASKCALL | LUA_MASKRET | LUA_MASKLINE | LUA_MASKCOUNT; - setsignal(i, SIG_DFL); - lua_sethook(globalL, lstop, flag, 1); -} - - -static void print_usage (const char *badoption) { - lua_writestringerror("%s: ", progname); - if (badoption[1] == 'e' || badoption[1] == 'l') - lua_writestringerror("'%s' needs argument\n", badoption); - else - lua_writestringerror("unrecognized option '%s'\n", badoption); - lua_writestringerror( - "usage: %s [options] [script [args]]\n" - "Available options are:\n" - " -e stat execute string 'stat'\n" - " -i enter interactive mode after executing 'script'\n" - " -l mod require library 'mod' into global 'mod'\n" - " -l g=mod require library 'mod' into global 'g'\n" - " -v show version information\n" - " -E ignore environment variables\n" - " -W turn warnings on\n" - " -- stop handling options\n" - " - stop handling options and execute stdin\n" - , - progname); -} - - - -static void l_message (const char *pname, const char *msg) { - if (pname) lua_writestringerror("%s: ", pname); - lua_writestringerror("%s\n", msg); -} - - - -static int report (lua_State *L, int status) { - if (status != LUA_OK) { - const char *msg = lua_tostring(L, -1); - l_message(progname, msg); - lua_pop(L, 1); - } - return status; -} - - - -static int msghandler (lua_State *L) { - const char *msg = lua_tostring(L, 1); - if (msg == NULL) { - if (luaL_callmeta(L, 1, "__tostring") && - lua_type(L, -1) == LUA_TSTRING) - return 1; - else - msg = lua_pushfstring(L, "(error object is a %s value)", - luaL_typename(L, 1)); - } - luaL_traceback(L, L, msg, 1); - return 1; -} - - - -static int docall (lua_State *L, int narg, int nres) { - int status; - int base = lua_gettop(L) - narg; - lua_pushcfunction(L, msghandler); - lua_insert(L, base); - globalL = L; - setsignal(SIGINT, laction); - status = lua_pcall(L, narg, nres, base); - setsignal(SIGINT, SIG_DFL); - lua_remove(L, base); - return status; -} - - -static void print_version (void) { - lua_writestring(LUA_COPYRIGHT, strlen(LUA_COPYRIGHT)); - lua_writeline(); -} - - - -static void createargtable (lua_State *L, char **argv, int argc, int script) { - int i, narg; - narg = argc - (script + 1); - lua_createtable(L, narg, script + 1); - for (i = 0; i < argc; i++) { - lua_pushstring(L, argv[i]); - lua_rawseti(L, -2, i - script); - } - lua_setglobal(L, "arg"); -} - - -static int dochunk (lua_State *L, int status) { - if (status == LUA_OK) status = docall(L, 0, 0); - return report(L, status); -} - - -static int dofile (lua_State *L, const char *name) { - return dochunk(L, luaL_loadfile(L, name)); -} - - -static int dostring (lua_State *L, const char *s, const char *name) { - return dochunk(L, luaL_loadbuffer(L, s, strlen(s), name)); -} - - - -static int dolibrary (lua_State *L, char *globname) { - int status; - char *suffix = NULL; - char *modname = strchr(globname, '='); - if (modname == NULL) { - modname = globname; - suffix = strchr(modname, *LUA_IGMARK); - } - else { - *modname = '\0'; - modname++; - } - lua_getglobal(L, "require"); - lua_pushstring(L, modname); - status = docall(L, 1, 1); - if (status == LUA_OK) { - if (suffix != NULL) - *suffix = '\0'; - lua_setglobal(L, globname); - } - return report(L, status); -} - - - -static int pushargs (lua_State *L) { - int i, n; - if (lua_getglobal(L, "arg") != LUA_TTABLE) - luaL_error(L, "'arg' is not a table"); - n = (int)luaL_len(L, -1); - luaL_checkstack(L, n + 3, "too many arguments to script"); - for (i = 1; i <= n; i++) - lua_rawgeti(L, -i, i); - lua_remove(L, -i); - return n; -} - - -static int handle_script (lua_State *L, char **argv) { - int status; - const char *fname = argv[0]; - if (strcmp(fname, "-") == 0 && strcmp(argv[-1], "--") != 0) - fname = NULL; - status = luaL_loadfile(L, fname); - if (status == LUA_OK) { - int n = pushargs(L); - status = docall(L, n, LUA_MULTRET); - } - return report(L, status); -} - - - -#define has_error 1 -#define has_i 2 -#define has_v 4 -#define has_e 8 -#define has_E 16 - - - -static int collectargs (char **argv, int *first) { - int args = 0; - int i; - if (argv[0] != NULL) { - if (argv[0][0]) - progname = argv[0]; - } - else { - *first = -1; - return 0; - } - for (i = 1; argv[i] != NULL; i++) { - *first = i; - if (argv[i][0] != '-') - return args; - switch (argv[i][1]) { - case '-': - if (argv[i][2] != '\0') - return has_error; - *first = i + 1; - return args; - case '\0': - return args; - case 'E': - if (argv[i][2] != '\0') - return has_error; - args |= has_E; - break; - case 'W': - if (argv[i][2] != '\0') - return has_error; - break; - case 'i': - args |= has_i; /* FALLTHROUGH */ - case 'v': - if (argv[i][2] != '\0') - return has_error; - args |= has_v; - break; - case 'e': - args |= has_e; - case 'l': - if (argv[i][2] == '\0') { - i++; - if (argv[i] == NULL || argv[i][0] == '-') - return has_error; - } - break; - default: - return has_error; - } - } - *first = 0; - return args; -} - - - -static int runargs (lua_State *L, char **argv, int n) { - int i; - for (i = 1; i < n; i++) { - int option = argv[i][1]; - lua_assert(argv[i][0] == '-'); - switch (option) { - case 'e': case 'l': { - int status; - char *extra = argv[i] + 2; - if (*extra == '\0') extra = argv[++i]; - lua_assert(extra != NULL); - status = (option == 'e') - ? dostring(L, extra, "=(command line)") - : dolibrary(L, extra); - if (status != LUA_OK) return 0; - break; - } - case 'W': - lua_warning(L, "@on", 0); - break; - } - } - return 1; -} - - -static int handle_luainit (lua_State *L) { - const char *name = "=" LUA_INITVARVERSION; - const char *init = getenv(name + 1); - if (init == NULL) { - name = "=" LUA_INIT_VAR; - init = getenv(name + 1); - } - if (init == NULL) return LUA_OK; - else if (init[0] == '@') - return dofile(L, init+1); - else - return dostring(L, init, name); -} - - - - -#if !defined(LUA_PROMPT) -#define LUA_PROMPT "> " -#define LUA_PROMPT2 ">> " -#endif - -#if !defined(LUA_MAXINPUT) -#define LUA_MAXINPUT 512 -#endif - - - -#if !defined(lua_stdin_is_tty) - -#if defined(LUA_USE_POSIX) - -#include -#define lua_stdin_is_tty() isatty(0) - -#elif defined(LUA_USE_WINDOWS) - -#include -#include - -#define lua_stdin_is_tty() _isatty(_fileno(stdin)) - -#else - - -#define lua_stdin_is_tty() 1 - -#endif - -#endif - - - -#if !defined(lua_readline) - -#if defined(LUA_USE_READLINE) - -#include -#include -#define lua_initreadline(L) ((void)L, rl_readline_name="lua") -#define lua_readline(L,b,p) ((void)L, ((b)=readline(p)) != NULL) -#define lua_saveline(L,line) ((void)L, add_history(line)) -#define lua_freeline(L,b) ((void)L, free(b)) - -#else - -#define lua_initreadline(L) ((void)L) -#define lua_readline(L,b,p) \ - ((void)L, fputs(p, stdout), fflush(stdout), \ - fgets(b, LUA_MAXINPUT, stdin) != NULL) -#define lua_saveline(L,line) { (void)L; (void)line; } -#define lua_freeline(L,b) { (void)L; (void)b; } - -#endif - -#endif - - - -static const char *get_prompt (lua_State *L, int firstline) { - if (lua_getglobal(L, firstline ? "_PROMPT" : "_PROMPT2") == LUA_TNIL) - return (firstline ? LUA_PROMPT : LUA_PROMPT2); - else { - const char *p = luaL_tolstring(L, -1, NULL); - lua_remove(L, -2); - return p; - } -} - - -#define EOFMARK "" -#define marklen (sizeof(EOFMARK)/sizeof(char) - 1) - - - -static int incomplete (lua_State *L, int status) { - if (status == LUA_ERRSYNTAX) { - size_t lmsg; - const char *msg = lua_tolstring(L, -1, &lmsg); - if (lmsg >= marklen && strcmp(msg + lmsg - marklen, EOFMARK) == 0) { - lua_pop(L, 1); - return 1; - } - } - return 0; -} - - - -static int pushline (lua_State *L, int firstline) { - char buffer[LUA_MAXINPUT]; - char *b = buffer; - size_t l; - const char *prmt = get_prompt(L, firstline); - int readstatus = lua_readline(L, b, prmt); - if (readstatus == 0) - return 0; - lua_pop(L, 1); - l = strlen(b); - if (l > 0 && b[l-1] == '\n') - b[--l] = '\0'; - if (firstline && b[0] == '=') - lua_pushfstring(L, "return %s", b + 1); - else - lua_pushlstring(L, b, l); - lua_freeline(L, b); - return 1; -} - - - -static int addreturn (lua_State *L) { - const char *line = lua_tostring(L, -1); - const char *retline = lua_pushfstring(L, "return %s;", line); - int status = luaL_loadbuffer(L, retline, strlen(retline), "=stdin"); - if (status == LUA_OK) { - lua_remove(L, -2); - if (line[0] != '\0') - lua_saveline(L, line); - } - else - lua_pop(L, 2); - return status; -} - - - -static int multiline (lua_State *L) { - for (;;) { - size_t len; - const char *line = lua_tolstring(L, 1, &len); - int status = luaL_loadbuffer(L, line, len, "=stdin"); - if (!incomplete(L, status) || !pushline(L, 0)) { - lua_saveline(L, line); - return status; - } - lua_pushliteral(L, "\n"); - lua_insert(L, -2); - lua_concat(L, 3); - } -} - - - -static int loadline (lua_State *L) { - int status; - lua_settop(L, 0); - if (!pushline(L, 1)) - return -1; - if ((status = addreturn(L)) != LUA_OK) - status = multiline(L); - lua_remove(L, 1); - lua_assert(lua_gettop(L) == 1); - return status; -} - - - -static void l_print (lua_State *L) { - int n = lua_gettop(L); - if (n > 0) { - luaL_checkstack(L, LUA_MINSTACK, "too many results to print"); - lua_getglobal(L, "print"); - lua_insert(L, 1); - if (lua_pcall(L, n, 0, 0) != LUA_OK) - l_message(progname, lua_pushfstring(L, "error calling 'print' (%s)", - lua_tostring(L, -1))); - } -} - - - -static void doREPL (lua_State *L) { - int status; - const char *oldprogname = progname; - progname = NULL; - lua_initreadline(L); - while ((status = loadline(L)) != -1) { - if (status == LUA_OK) - status = docall(L, 0, LUA_MULTRET); - if (status == LUA_OK) l_print(L); - else report(L, status); - } - lua_settop(L, 0); - lua_writeline(); - progname = oldprogname; -} - - - -#if !defined(luai_openlibs) -#define luai_openlibs(L) luaL_openselectedlibs(L, ~0, 0) -#endif - - - -static int pmain (lua_State *L) { - int argc = (int)lua_tointeger(L, 1); - char **argv = (char **)lua_touserdata(L, 2); - int script; - int args = collectargs(argv, &script); - int optlim = (script > 0) ? script : argc; - luaL_checkversion(L); - if (args == has_error) { - print_usage(argv[script]); - return 0; - } - if (args & has_v) - print_version(); - if (args & has_E) { - lua_pushboolean(L, 1); - lua_setfield(L, LUA_REGISTRYINDEX, "LUA_NOENV"); - } - luai_openlibs(L); - createargtable(L, argv, argc, script); - lua_gc(L, LUA_GCRESTART); - lua_gc(L, LUA_GCGEN); - if (!(args & has_E)) { - if (handle_luainit(L) != LUA_OK) - return 0; - } - if (!runargs(L, argv, optlim)) - return 0; - if (script > 0) { - if (handle_script(L, argv + script) != LUA_OK) - return 0; - } - if (args & has_i) - doREPL(L); - else if (script < 1 && !(args & (has_e | has_v))) { - if (lua_stdin_is_tty()) { - print_version(); - doREPL(L); - } - else dofile(L, NULL); - } - lua_pushboolean(L, 1); - return 1; -} - - - - -#endif - - -#ifdef MAKE_LUAC -//path: src/dependencies/lua/luac.c - - - -#define luac_c -#define LUA_CORE - - - - -#include -#include -#include -#include -#include - - - - - - - - - - - - -//path: src/dependencies/lua/lopnames.h - - -#if !defined(lopnames_h) -#define lopnames_h - -#include - - - - -static const char *const opnames[] = { - "MOVE", - "LOADI", - "LOADF", - "LOADK", - "LOADKX", - "LOADFALSE", - "LFALSESKIP", - "LOADTRUE", - "LOADNIL", - "GETUPVAL", - "SETUPVAL", - "GETTABUP", - "GETTABLE", - "GETI", - "GETFIELD", - "SETTABUP", - "SETTABLE", - "SETI", - "SETFIELD", - "NEWTABLE", - "SELF", - "ADDI", - "ADDK", - "SUBK", - "MULK", - "MODK", - "POWK", - "DIVK", - "IDIVK", - "BANDK", - "BORK", - "BXORK", - "SHRI", - "SHLI", - "ADD", - "SUB", - "MUL", - "MOD", - "POW", - "DIV", - "IDIV", - "BAND", - "BOR", - "BXOR", - "SHL", - "SHR", - "MMBIN", - "MMBINI", - "MMBINK", - "UNM", - "BNOT", - "NOT", - "LEN", - "CONCAT", - "CLOSE", - "TBC", - "JMP", - "EQ", - "LT", - "LE", - "EQK", - "EQI", - "LTI", - "LEI", - "GTI", - "GEI", - "TEST", - "TESTSET", - "CALL", - "TAILCALL", - "RETURN", - "RETURN0", - "RETURN1", - "FORLOOP", - "FORPREP", - "TFORPREP", - "TFORCALL", - "TFORLOOP", - "SETLIST", - "CLOSURE", - "VARARG", - "VARARGPREP", - "EXTRAARG", - NULL -}; - -#endif - - - - - - - - -static void PrintFunction(const Proto* f, int full); -#define luaU_print PrintFunction - -#define PROGNAME "luac" -#define OUTPUT PROGNAME ".out" - -static int listing=0; -static int dumping=1; -static int stripping=0; -static char Output[]={ OUTPUT }; -static const char* output=Output; -static const char* progname=PROGNAME; -static TString **tmname; - -static void fatal(const char* message) -{ - fprintf(stderr,"%s: %s\n",progname,message); - exit(EXIT_FAILURE); -} - -static void cannot(const char* what) -{ - fprintf(stderr,"%s: cannot %s %s: %s\n",progname,what,output,strerror(errno)); - exit(EXIT_FAILURE); -} - -static void usage(const char* message) -{ - if (*message=='-') - fprintf(stderr,"%s: unrecognized option '%s'\n",progname,message); - else - fprintf(stderr,"%s: %s\n",progname,message); - fprintf(stderr, - "usage: %s [options] [filenames]\n" - "Available options are:\n" - " -l list (use -l -l for full listing)\n" - " -o name output to file 'name' (default is \"%s\")\n" - " -p parse only\n" - " -s strip debug information\n" - " -v show version information\n" - " -- stop handling options\n" - " - stop handling options and process stdin\n" - ,progname,Output); - exit(EXIT_FAILURE); -} - -#define IS(s) (strcmp(argv[i],s)==0) - -static int doargs(int argc, char* argv[]) -{ - int i; - int version=0; - if (argv[0]!=NULL && *argv[0]!=0) progname=argv[0]; - for (i=1; itop.p+(i))) - -static const Proto* combine(lua_State* L, int n) -{ - if (n==1) - return toproto(L,-1); - else - { - Proto* f; - int i=n; - if (lua_load(L,reader,&i,"=(" PROGNAME ")",NULL)!=LUA_OK) fatal(lua_tostring(L,-1)); - f=toproto(L,-1); - for (i=0; ip[i]=toproto(L,i-n-1); - if (f->p[i]->sizeupvalues>0) f->p[i]->upvalues[0].instack=0; - } - return f; - } -} - -static int writer(lua_State* L, const void* p, size_t size, void* u) -{ - UNUSED(L); - return (fwrite(p,size,1,(FILE*)u)!=1) && (size!=0); -} - -static int pmain(lua_State* L) -{ - int argc=(int)lua_tointeger(L,1); - char** argv=(char**)lua_touserdata(L,2); - const Proto* f; - int i; - tmname=G(L)->tmname; - if (!lua_checkstack(L,argc)) fatal("too many input files"); - for (i=0; i1); - if (dumping) - { - FILE* D= (output==NULL) ? stdout : fopen(output,"wb"); - if (D==NULL) cannot("open"); - lua_lock(L); - luaU_dump(L,f,writer,D,stripping); - lua_unlock(L); - if (ferror(D)) cannot("write"); - if (fclose(D)) cannot("close"); - } - return 0; -} - -int main(int argc, char* argv[]) -{ - lua_State* L; - int i=doargs(argc,argv); - argc-=i; argv+=i; - if (argc<=0) usage("no input files given"); - L=luaL_newstate(); - if (L==NULL) fatal("cannot create state: not enough memory"); - lua_pushcfunction(L,&pmain); - lua_pushinteger(L,argc); - lua_pushlightuserdata(L,argv); - if (lua_pcall(L,2,0,0)!=LUA_OK) fatal(lua_tostring(L,-1)); - lua_close(L); - return EXIT_SUCCESS; -} - - - -#define UPVALNAME(x) ((f->upvalues[x].name) ? getstr(f->upvalues[x].name) : "-") -#define VOID(p) ((const void*)(p)) -#define eventname(i) (getstr(tmname[i])) - -static void PrintString(const TString* ts) -{ - const char* s=getstr(ts); - size_t i,n=tsslen(ts); - printf("\""); - for (i=0; ik[i]; - switch (ttypetag(o)) - { - case LUA_VNIL: - printf("N"); - break; - case LUA_VFALSE: - case LUA_VTRUE: - printf("B"); - break; - case LUA_VNUMFLT: - printf("F"); - break; - case LUA_VNUMINT: - printf("I"); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - printf("S"); - break; - default: - printf("?%d",ttypetag(o)); - break; - } - printf("\t"); -} - -static void PrintConstant(const Proto* f, int i) -{ - const TValue* o=&f->k[i]; - switch (ttypetag(o)) - { - case LUA_VNIL: - printf("nil"); - break; - case LUA_VFALSE: - printf("false"); - break; - case LUA_VTRUE: - printf("true"); - break; - case LUA_VNUMFLT: - { - char buff[100]; - sprintf(buff,LUA_NUMBER_FMT,fltvalue(o)); - printf("%s",buff); - if (buff[strspn(buff,"-0123456789")]=='\0') printf(".0"); - break; - } - case LUA_VNUMINT: - printf(LUA_INTEGER_FMT,ivalue(o)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - PrintString(tsvalue(o)); - break; - default: - printf("?%d",ttypetag(o)); - break; - } -} - -#define COMMENT "\t; " -#define EXTRAARG GETARG_Ax(code[pc+1]) -#define EXTRAARGC (EXTRAARG*(MAXARG_C+1)) -#define ISK (isk ? "k" : "") - -static void PrintCode(const Proto* f) -{ - const Instruction* code=f->code; - int pc,n=f->sizecode; - for (pc=0; pc0) printf("[%d]\t",line); else printf("[-]\t"); - printf("%-9s\t",opnames[o]); - switch (o) - { - case OP_MOVE: - printf("%d %d",a,b); - break; - case OP_LOADI: - printf("%d %d",a,sbx); - break; - case OP_LOADF: - printf("%d %d",a,sbx); - break; - case OP_LOADK: - printf("%d %d",a,bx); - printf(COMMENT); PrintConstant(f,bx); - break; - case OP_LOADKX: - printf("%d",a); - printf(COMMENT); PrintConstant(f,EXTRAARG); - break; - case OP_LOADFALSE: - printf("%d",a); - break; - case OP_LFALSESKIP: - printf("%d",a); - break; - case OP_LOADTRUE: - printf("%d",a); - break; - case OP_LOADNIL: - printf("%d %d",a,b); - printf(COMMENT "%d out",b+1); - break; - case OP_GETUPVAL: - printf("%d %d",a,b); - printf(COMMENT "%s",UPVALNAME(b)); - break; - case OP_SETUPVAL: - printf("%d %d",a,b); - printf(COMMENT "%s",UPVALNAME(b)); - break; - case OP_GETTABUP: - printf("%d %d %d",a,b,c); - printf(COMMENT "%s",UPVALNAME(b)); - printf(" "); PrintConstant(f,c); - break; - case OP_GETTABLE: - printf("%d %d %d",a,b,c); - break; - case OP_GETI: - printf("%d %d %d",a,b,c); - break; - case OP_GETFIELD: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_SETTABUP: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT "%s",UPVALNAME(a)); - printf(" "); PrintConstant(f,b); - if (isk) { printf(" "); PrintConstant(f,c); } - break; - case OP_SETTABLE: - printf("%d %d %d%s",a,b,c,ISK); - if (isk) { printf(COMMENT); PrintConstant(f,c); } - break; - case OP_SETI: - printf("%d %d %d%s",a,b,c,ISK); - if (isk) { printf(COMMENT); PrintConstant(f,c); } - break; - case OP_SETFIELD: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT); PrintConstant(f,b); - if (isk) { printf(" "); PrintConstant(f,c); } - break; - case OP_NEWTABLE: - printf("%d %d %d",a,b,c); - printf(COMMENT "%d",c+EXTRAARGC); - break; - case OP_SELF: - printf("%d %d %d%s",a,b,c,ISK); - if (isk) { printf(COMMENT); PrintConstant(f,c); } - break; - case OP_ADDI: - printf("%d %d %d",a,b,sc); - break; - case OP_ADDK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_SUBK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_MULK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_MODK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_POWK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_DIVK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_IDIVK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_BANDK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_BORK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_BXORK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_SHRI: - printf("%d %d %d",a,b,sc); - break; - case OP_SHLI: - printf("%d %d %d",a,b,sc); - break; - case OP_ADD: - printf("%d %d %d",a,b,c); - break; - case OP_SUB: - printf("%d %d %d",a,b,c); - break; - case OP_MUL: - printf("%d %d %d",a,b,c); - break; - case OP_MOD: - printf("%d %d %d",a,b,c); - break; - case OP_POW: - printf("%d %d %d",a,b,c); - break; - case OP_DIV: - printf("%d %d %d",a,b,c); - break; - case OP_IDIV: - printf("%d %d %d",a,b,c); - break; - case OP_BAND: - printf("%d %d %d",a,b,c); - break; - case OP_BOR: - printf("%d %d %d",a,b,c); - break; - case OP_BXOR: - printf("%d %d %d",a,b,c); - break; - case OP_SHL: - printf("%d %d %d",a,b,c); - break; - case OP_SHR: - printf("%d %d %d",a,b,c); - break; - case OP_MMBIN: - printf("%d %d %d",a,b,c); - printf(COMMENT "%s",eventname(c)); - break; - case OP_MMBINI: - printf("%d %d %d %d",a,sb,c,isk); - printf(COMMENT "%s",eventname(c)); - if (isk) printf(" flip"); - break; - case OP_MMBINK: - printf("%d %d %d %d",a,b,c,isk); - printf(COMMENT "%s ",eventname(c)); PrintConstant(f,b); - if (isk) printf(" flip"); - break; - case OP_UNM: - printf("%d %d",a,b); - break; - case OP_BNOT: - printf("%d %d",a,b); - break; - case OP_NOT: - printf("%d %d",a,b); - break; - case OP_LEN: - printf("%d %d",a,b); - break; - case OP_CONCAT: - printf("%d %d",a,b); - break; - case OP_CLOSE: - printf("%d",a); - break; - case OP_TBC: - printf("%d",a); - break; - case OP_JMP: - printf("%d",GETARG_sJ(i)); - printf(COMMENT "to %d",GETARG_sJ(i)+pc+2); - break; - case OP_EQ: - printf("%d %d %d",a,b,isk); - break; - case OP_LT: - printf("%d %d %d",a,b,isk); - break; - case OP_LE: - printf("%d %d %d",a,b,isk); - break; - case OP_EQK: - printf("%d %d %d",a,b,isk); - printf(COMMENT); PrintConstant(f,b); - break; - case OP_EQI: - printf("%d %d %d",a,sb,isk); - break; - case OP_LTI: - printf("%d %d %d",a,sb,isk); - break; - case OP_LEI: - printf("%d %d %d",a,sb,isk); - break; - case OP_GTI: - printf("%d %d %d",a,sb,isk); - break; - case OP_GEI: - printf("%d %d %d",a,sb,isk); - break; - case OP_TEST: - printf("%d %d",a,isk); - break; - case OP_TESTSET: - printf("%d %d %d",a,b,isk); - break; - case OP_CALL: - printf("%d %d %d",a,b,c); - printf(COMMENT); - if (b==0) printf("all in "); else printf("%d in ",b-1); - if (c==0) printf("all out"); else printf("%d out",c-1); - break; - case OP_TAILCALL: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT "%d in",b-1); - break; - case OP_RETURN: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT); - if (b==0) printf("all out"); else printf("%d out",b-1); - break; - case OP_RETURN0: - break; - case OP_RETURN1: - printf("%d",a); - break; - case OP_FORLOOP: - printf("%d %d",a,bx); - printf(COMMENT "to %d",pc-bx+2); - break; - case OP_FORPREP: - printf("%d %d",a,bx); - printf(COMMENT "exit to %d",pc+bx+3); - break; - case OP_TFORPREP: - printf("%d %d",a,bx); - printf(COMMENT "to %d",pc+bx+2); - break; - case OP_TFORCALL: - printf("%d %d",a,c); - break; - case OP_TFORLOOP: - printf("%d %d",a,bx); - printf(COMMENT "to %d",pc-bx+2); - break; - case OP_SETLIST: - printf("%d %d %d",a,b,c); - if (isk) printf(COMMENT "%d",c+EXTRAARGC); - break; - case OP_CLOSURE: - printf("%d %d",a,bx); - printf(COMMENT "%p",VOID(f->p[bx])); - break; - case OP_VARARG: - printf("%d %d",a,c); - printf(COMMENT); - if (c==0) printf("all out"); else printf("%d out",c-1); - break; - case OP_VARARGPREP: - printf("%d",a); - break; - case OP_EXTRAARG: - printf("%d",ax); - break; -#if 0 - default: - printf("%d %d %d",a,b,c); - printf(COMMENT "not handled"); - break; -#endif - } - printf("\n"); - } -} - - -#define SS(x) ((x==1)?"":"s") -#define S(x) (int)(x),SS(x) - -static void PrintHeader(const Proto* f) -{ - const char* s=f->source ? getstr(f->source) : "=?"; - if (*s=='@' || *s=='=') - s++; - else if (*s==LUA_SIGNATURE[0]) - s="(bstring)"; - else - s="(string)"; - printf("\n%s <%s:%d,%d> (%d instruction%s at %p)\n", - (f->linedefined==0)?"main":"function",s, - f->linedefined,f->lastlinedefined, - S(f->sizecode),VOID(f)); - printf("%d%s param%s, %d slot%s, %d upvalue%s, ", - (int)(f->numparams),f->is_vararg?"+":"",SS(f->numparams), - S(f->maxstacksize),S(f->sizeupvalues)); - printf("%d local%s, %d constant%s, %d function%s\n", - S(f->sizelocvars),S(f->sizek),S(f->sizep)); -} - -static void PrintDebug(const Proto* f) -{ - int i,n; - n=f->sizek; - printf("constants (%d) for %p:\n",n,VOID(f)); - for (i=0; isizelocvars; - printf("locals (%d) for %p:\n",n,VOID(f)); - for (i=0; ilocvars[i].varname),f->locvars[i].startpc+1,f->locvars[i].endpc+1); - } - n=f->sizeupvalues; - printf("upvalues (%d) for %p:\n",n,VOID(f)); - for (i=0; iupvalues[i].instack,f->upvalues[i].idx); - } -} - -static void PrintFunction(const Proto* f, int full) -{ - int i,n=f->sizep; - PrintHeader(f); - PrintCode(f); - if (full) PrintDebug(f); - for (i=0; ip[i],full); -} - -#endif - - - -//path: src/constants/all.h -//path: src/constants/main_callback.h - -#define PRIVATE_LUACEMBED_NO_RETURN 0 -#define PRIVATE_LUACEMBED_ONE_RETURN 1 - - - -//path: src/constants/types.h -#define LUA_CEMBED_NOT_FOUND LUA_TNONE -#define LUA_CEMBED_STRING LUA_TSTRING -#define LUA_CEMBED_NUMBER LUA_TNUMBER -#define LUA_CEMBED_BOOL LUA_TBOOLEAN -#define LUA_CEMBED_NIL LUA_TNIL -#define LUA_CEMBED_FUNCTION LUA_TFUNCTION -#define LUA_CEMBED_TABLE LUA_TTABLE - -#define PRIVATE_LUA_CEMBED_NOT_FOUND_STRING "not Found" -#define PRIVATE_LUA_CEMBED_STRING_STRING "string" -#define PRIVATE_LUA_CEMBED_NUMBER_STRING "number" -#define PRIVATE_LUA_CEMBED_BOOL_STRING "boolean" -#define PRIVATE_LUA_CEMBED_NIL_STRING "nil" -#define PRIVATE_LUA_CEMBED_TABLE_STRING "table" -#define PRIVATE_LUA_CEMBED_FUNCTION_STRING "function" - -#define PRIVATE_LUA_CEMBED_UNKNOW_STRING "unknow" - -//path: src/constants/responses.h -#define PRIVATE_LUA_CEMBED_STRING_RESPONSE 1 -#define PRIVATE_LUA_CEMBED_LONG_RESPONSE 2 -#define PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE 3 -#define PRIVATE_LUA_CEMBED_BOOL_RESPONSE 4 -#define PRIVATE_LUA_CEMBED_TABLE_RESPONSE 5 - -#define PRIVATE_LUA_CEMBED_EVALUATION 6 -#define PRIVATE_LUA_CEMBED_ERROR_RESPONSE 7 -#define PRIVATE_LUA_CEMBED_MULTI_RESPONSE 8 - -#define LUA_CEMBED_OK 0 -#define LUA_CEMBED_GENERIC_ERROR (-1) - -//path: src/constants/lua_code.h - -#define PRIVATE_LUA_CEMBED_TOTAL_LIBS "private_lua_c_embed_total_running_libs" -#define PRIVATE_LUA_CEMBED_STACK_LEVEL "private_lua_c_embed_stack_level" - -#define PRIVATE_LUA_CEMBED_EVALUATION_NAME "private_lua_c_embed_evaluation" -#define PRIVATE_LUA_CEMBED_DEL_PREFIX "__gc" -#define PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE "%s = %s\n" - - - - -#define PRIVATE_LUA_CEMBED_SELFNAME "private_lua_c_embed_self" -#define PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE "private_lua_c_embed_stage_area_table" -#define PRIVATE_LUA_CEMBED_TABLE_RETURN "private_lua_embed_table_return" - -#define PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__ "private_lua_c_embed_main_lib_table_%d" -#define PRIVATE_LUA_CEMBED_MAIN_LIB_SUB_TABLE "private_lua_c_embed_main_lib_table_%d_%s" - -#define PRIVATE_LUA_CEMBED_MAIN_META_TABLE__ "private_lua_c_embed_main_meta_table_%d" -#define PRIVATE_LUA_CEMBED_ANONYMOUS_TABLE_ "private_lua_c_embed_anononymous_table_%d_%d" -#define PRIVATE_LUA_CEMBED_ANONYMOUS_FUNC_TABLE_ "private_lua_c_embed_anononymous_func_table_%d_%d" -#define PRIVATE_LUA_CEMBED_ARGS_ "private_lua_c_embed_args_%d_%d" -#define PRIVATE_LUA_CEMBED_MULTIRETURN_ "private_lua_c_embed_multi_return_%d_%d" - -//path: src/constants/errors.h - - -#define PRIVATE_LUA_CEMBED_TIMEOUT_ERROR "timeout error" -#define PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED "arg %ld at function:%s not provided" -#define PRIVATE_LUA_CEMBED_ARG_WRONG_TYPE "arg %d at function:%s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_GLOBAL_WRONG_TYPE "global variable:%s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_RESULT_EVALUATION_WRONG_TYPE "result evaluation its:%s instead of %s" -#define PRIVATE_LUA_CEMBED_RESULT_EVALUATION_ARG_WRONG_TYPE "result evaluation of function %s at index %d its:%s instead of %s" - -#define PRIVATE_LUA_CEMBED_CODE_ITS_NOT_A_FUNCTION "value %s its not a function" -#define PRIVATE_LUA_CEMBED_WRONG_TYPE_PROPETY "propety %s at object %s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX "index %d at object %s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_ELEMENT_DOES_NOT_HAVE_KEY "index %d at object %s not have a key" -#define PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR "timeout error" -#define PRIVATE_LUA_CEMBED_LIB_PROP_WRONG_TYPE "lib prop %s its %s insteadd of %s" - -//path: src/constants/aplication.h -#ifndef LUA_CEMBED_INDEX_DIF -#define LUA_CEMBED_INDEX_DIF 1 -#endif - -#define PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE 1 -#define PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE 2 -#define LUA_CEMBED_DEFAULT_TIMEOUT 10 -#define LUA_CEMBED_DEFAULT_MEMORY_LIMIT 100 - -#define PRIVATE_LUA_CEMBED_ONE_MB (1024 * 1024) - - - - -//path: src/LuaCEmbedResponse/LuaCEmbedResponse.h - -typedef struct { - - int type; - double num_val; - bool its_string_ref; - long string_size; - char *string_val; - -}LuaCEmbedResponse; - -LuaCEmbedResponse *private_LuaCEmbedReturn_raw(); - - -LuaCEmbedResponse * LuaCEmbed_send_str(const char *text); - -LuaCEmbedResponse * LuaCEmbed_send_raw_string(const char *text,long size); - -LuaCEmbedResponse * LuaCEmbed_send_str_reference( const char *text); - -LuaCEmbedResponse * LuaCEmbed_send_raw_string_reference(const char *text,long size); - -LuaCEmbedResponse * LuaCEmbed_send_error(const char *format,...); - - -LuaCEmbedResponse * LuaCEmbed_send_evaluation(const char *code); - - - - - -LuaCEmbedResponse * LuaCEmbed_send_double(double value); - -LuaCEmbedResponse * LuaCEmbed_send_bool(bool value); - - -LuaCEmbedResponse * LuaCEmbed_send_long(long value); - - -void private_LuaCEmbedResponse_free(LuaCEmbedResponse *self); - - -//path: src/LuaCEmbed/declaration.h -typedef long private_lua_cembed_incremented_arg ; -//path: src/LuaCEmbed/LuaCEmbed.h - -typedef struct LuaCEmbed{ - lua_State *state; - const char *current_function; - bool is_lib; - int total_args; - char *error_msg; - void (*delete_function)(struct LuaCEmbed *self); - void *global_tables; - void *func_tables; - int lib_identifier; - int stack_leve; - char *main_lib_table; - bool field_protection; -}LuaCEmbed; - -int lua_cembed_timeout = -1; -LuaCEmbed *global_current_lua_embed_object; - - - -//path: src/LuaCEmbed/memory/memory.h - - -long lua_cembed_used_memory = 0; -long lua_cembed_memory_limit = -1; - -void LuaCEmbed_set_memory_limit(LuaCEmbed *self, double limit); - - -static void *private_LuaCembed_custom_allocator(void *ud, void *ptr, size_t osize, size_t nsize) ; - - - - -//path: src/LuaCEmbed/lib_start/lib_start.h - -int private_LuaCemb_internal_free(lua_State *L); - -LuaCEmbed * newLuaCEmbedLib(lua_State *state); - -int LuaCembed_perform(LuaCEmbed *self); - - -//path: src/LuaCEmbed/basic/basic.h - - - -LuaCEmbed * newLuaCEmbedEvaluation(); - - -int private_LuaCemb_internal_free(lua_State *L); - -void LuaCEmbed_load_lib_from_c(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name); - -void LuaCEmbed_load_native_libs(LuaCEmbed *self); - -void LuaCembed_set_delete_function(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)); - -char * LuaCEmbed_get_error_message(LuaCEmbed *self); - - -bool LuaCEmbed_has_errors(LuaCEmbed *self); - -void LuaCEmbed_clear_errors(LuaCEmbed *self); - -void privateLuaCEmbd_get_field_protected(LuaCEmbed *self,const char *name); - -void privateLuaCEmbed_raise_error_not_jumping(LuaCEmbed *self, const char *error, ...); - -void * privateLuaCEmbed_get_current_table_array(LuaCEmbed *self); - - -void LuaCEmbed_set_timeout(int seconds); - - - -void privata_LuaCEmbed_increment_stack_(LuaCEmbed *self); - - -void privata_LuaCEmbed_decrement_stack(LuaCEmbed *self); - -void LuaCEmbed_free(LuaCEmbed *self); - - - - -//path: src/LuaCEmbed/table/declaration.h -//path: src/LuaCEmbed/table/table/declaration.h -//path: src/LuaCEmbed/table/table/table.h - - -typedef struct { - LuaCEmbed *main_object; - char *prop_name; - char *global_name; - void *sub_tables; - long index; - -}LuaCEmbedTable; - - -//path: src/LuaCEmbed/table/table/basic/basic.h - - -LuaCEmbedTable * private_newLuaCembedTable(LuaCEmbed *main_embed, const char *format, ...); - -int private_lua_cEmbed_unpack(LuaCEmbedTable *self,const char * previews_function); - -void privateLuaCEmbedTable_free(LuaCEmbedTable *self); - -void privateLuaCEmbedTable_free_setting_nill(LuaCEmbedTable *self); - -//path: src/LuaCEmbed/table/table/getters/declaration.h -//path: src/LuaCEmbed/table/table/getters/index/index.h - - -char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, long index); - -bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, long index); - -long LuaCEmbedTable_get_full_size(LuaCEmbedTable *self); - -long LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self); - - -long privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cembed_incremented_arg index); - -int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, int index); - -long long LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, int index); - -double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, int index); - -char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, int index); - -bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, int index); - - - - -//path: src/LuaCEmbed/table/table/getters/keys/keys.h - - - -char* LuaCembedTable_get_string_prop(LuaCEmbedTable *self, const char *name); - -long long LuaCembedTable_get_long_prop(LuaCEmbedTable *self, const char *name); - -double LuaCembedTable_get_double_prop(LuaCEmbedTable *self, const char *name); - -bool LuaCembedTable_get_bool_prop(LuaCEmbedTable *self, const char *name); - -int LuaCEmbedTable_get_type_prop(LuaCEmbedTable *self, const char *name); - - - -//path: src/LuaCEmbed/table/table/setters/declaration.h -//path: src/LuaCEmbed/table/table/setters/index/index.h - -void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, long index, const char *value); - -void LuaCEmbedTable_set_long_by_index(LuaCEmbedTable *self, long long index, long value); - -void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, long index, double value); - -void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, long index, bool value); - - -void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, long index, const char *code, ...); - - -//path: src/LuaCEmbed/table/table/setters/keys/keys.h - - - - - -void LuaCEmbedTable_set_method(LuaCEmbedTable *self, const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)); - -void LuaCEmbedTable_set_string_prop(LuaCEmbedTable *self, const char *name, const char *value); - -void LuaCEmbedTable_set_long_prop(LuaCEmbedTable *self, const char *name, long long value); - -void LuaCEmbedTable_set_double_prop(LuaCEmbedTable *self, const char *name, double value); - -void LuaCEmbedTable_set_bool_prop(LuaCEmbedTable *self, const char *name, bool value); - - -void LuaCEmbedTable_set_evaluation_prop(LuaCEmbedTable *self, const char *name, const char *code, ...); - - - -//path: src/LuaCEmbed/table/table/setters/insert/insert.h - - -void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, long formatted_index); - -void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, long index, const char *value); - -void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, long index,bool value); - -void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, long long index,long value); - -void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, long index,double value); - -void LuaCEmbedTable_insert_table_at_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *table); - - - - -//path: src/LuaCEmbed/table/table/errors/errors.h - -int privateLuaCEmbedTable_ensure_type_with_key(LuaCEmbedTable *self, const char *name, int expected_type); - -int privateLuaCEmbedTable_ensure_type_with_index(LuaCEmbedTable *self, long index, int expected_type); - - -//path: src/LuaCEmbed/table/table/sub_tables/declaration.h -//path: src/LuaCEmbed/table/table/sub_tables/key/key.h - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_by_key(LuaCEmbedTable *self, const char *name); - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_key(LuaCEmbedTable *self, const char *name); - -void LuaCEmbedTable_set_sub_table_prop(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table); - -//path: src/LuaCEmbed/table/table/sub_tables/index/index.h - - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_appending(LuaCEmbedTable *self); - - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, long index); - - -void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table); - - - - - - -//path: src/LuaCEmbed/table/table/append/append.h - - -void LuaCEmbedTable_append_table(LuaCEmbedTable *self, LuaCEmbedTable *table); - - -void LuaCEmbedTable_append_evaluation(LuaCEmbedTable *self, const char *code, ...); - -void LuaCEmbedTable_append_string(LuaCEmbedTable *self, const char *value); - -void LuaCEmbedTable_append_long(LuaCEmbedTable *self, long long value); - -void LuaCEmbedTable_append_double(LuaCEmbedTable *self, double value); - -void LuaCEmbedTable_append_bool(LuaCEmbedTable *self, bool value); - -//path: src/LuaCEmbed/table/table/destroy/destroy.h - - -void LuaCembedTable_destroy_prop(LuaCEmbedTable *self, const char *name); - -void LuaCEmbedTable_destroy_by_index(LuaCEmbedTable *self, long index); - - - -//path: src/LuaCEmbed/table/table_array/table_array.h - - -typedef struct { - - LuaCEmbedTable **tables; - long size; - -}privateLuaCEmbedTableArray; - -privateLuaCEmbedTableArray *newprivateLuaCEmbedTableArray(); - -void privateLuaCEmbedTableArray_append(privateLuaCEmbedTableArray *self,LuaCEmbedTable *element); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_global_name(privateLuaCEmbedTableArray *self, const char *name); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_prop_name(privateLuaCEmbedTableArray *self, const char *name); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_internal_index(privateLuaCEmbedTableArray *self, long internal_index); - -void privateLuaCEmbedTableArray_free(privateLuaCEmbedTableArray *self); - - -//path: src/LuaCEmbed/table/protection_macros.h -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID \ - if(!self){ \ - return; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM \ - if(!self){ \ - return LUA_CEMBED_GENERIC_ERROR; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL \ - if(!self){ \ - return false; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL \ - if(!self){ \ - return NULL; \ - } - - - -//path: src/LuaCEmbed/args/declaration.h -//path: src/LuaCEmbed/args/args_error/args_error.h - - -int LuaCEmbed_ensure_arg_exist(LuaCEmbed *self, private_lua_cembed_incremented_arg index); - -int private_LuaCEmbed_ensure_top_stack_arg_type(LuaCEmbed *self, int index,int arg_type); - - -//path: src/LuaCEmbed/args/basic/basic.h - -int privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, int index); - -int LuaCEmbed_get_total_args(LuaCEmbed *self); - -int LuaCEmbed_get_arg_type(LuaCEmbed *self,int index); - - - -long long LuaCEmbed_get_long_arg(LuaCEmbed *self, int index); - -double LuaCEmbed_get_double_arg(LuaCEmbed *self, int index); - -bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, int index); - -char * LuaCEmbed_get_str_arg(LuaCEmbed *self, int index); - -char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,long *size, int index); - -LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,int index); - -LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call, int total_returns); - - - -//path: src/LuaCEmbed/args/evaluation/evaluation.h - - -int private_LuaCembed_run_code_with_args(LuaCEmbed *self,int index,const char *code,va_list args); - -int privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,int index,int expected_type); - -int LuaCEmbed_get_type_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -int LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -long long LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - - -double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - - - - -//path: src/LuaCEmbed/globals/declaration.h -//path: src/LuaCEmbed/globals/errors/errors.h - - - -int LuaCEmbed_ensure_global_type(LuaCEmbed *self, const char *name,int expected_type); - - -//path: src/LuaCEmbed/globals/getters/getters.h - - -int LuaCEmbed_get_global_type(LuaCEmbed *self,const char *name); - -long long LuaCEmbed_get_global_long(LuaCEmbed *self,const char *name); - -double LuaCEmbed_get_global_double(LuaCEmbed *self,const char *name); - -bool LuaCEmbed_get_global_bool(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_global_string(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_global_raw_string(LuaCEmbed *self,const char *name,long *size); - - -LuaCEmbedTable * LuaCembed_new_anonymous_table(LuaCEmbed *self); - -LuaCEmbedTable* LuaCEmbed_run_global_lambda(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns); - -LuaCEmbedTable * LuaCembed_get_global_table(LuaCEmbed *self, const char *name); - -LuaCEmbedTable * LuaCembed_new_global_table(LuaCEmbed *self, const char *name); - - -//path: src/LuaCEmbed/globals/setters/setters.h - -void LuaCEmbed_set_global_string(LuaCEmbed *self, const char *name, const char *value); - -void LuaCEmbed_set_global_raw_string(LuaCEmbed *self, const char *name, const char *value,long size); - -void LuaCEmbed_set_global_long(LuaCEmbed *self, const char *name, long long value); - -void LuaCEmbed_set_global_double(LuaCEmbed *self, const char *name, double value); - -void LuaCEmbed_set_global_bool(LuaCEmbed *self, const char *name, bool value); - -void LuaCEmbed_set_global_table(LuaCEmbed *self, const char *name, LuaCEmbedTable *table); - - - - -//path: src/LuaCEmbed/callback_handle/callback_handle.h - - -int privateLuaCEmbed_main_callback_handler(lua_State *L); - -void private_LuaCEmbed_add_lib_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args),bool global_functions ); - -void private_LuaCEmbed_add_evaluation_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - -void LuaCEmbed_add_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - - -void LuaCEmbed_add_global_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args)); - - - -//path: src/LuaCEmbed/evaluation/evaluation.h - - -#ifdef _WIN32 -VOID CALLBACK TimerHandler(HWND hwnd, UINT uMsg, UINT_PTR idEvent, DWORD dwTime); -#else - -void private_LuaCembed_handle_timeout(int signum); - -#endif - -int privateLuaCEmbed_start_func_evaluation(lua_State *state); - -int LuaCEmbed_evaluate(LuaCEmbed *self, const char *code, ...); - -int LuaCEmbed_evaluete_file(LuaCEmbed *self, const char *file); - - -int private_LuaCEmbed_ensure_evaluation_type(LuaCEmbed *self,int type); - -int private_LuaCEmbed_evaluate_puting_on_top_of_stack(LuaCEmbed *self,const char *code, va_list args); - -char * LuaCEmbed_get_evaluation_string(LuaCEmbed *self,const char *code, ...); - - -int LuaCEmbed_get_evaluation_type(LuaCEmbed *self,const char *code, ...); - - -long LuaCEmbed_get_evaluation_table_size(LuaCEmbed *self,const char *code, ...); - -long long LuaCEmbed_get_evaluation_long(LuaCEmbed *self,const char *code, ...); - -double LuaCEmbed_get_evaluation_double(LuaCEmbed *self,const char *code, ...); - -bool LuaCEmbed_get_evaluation_bool(LuaCEmbed *self,const char *code, ...); - - - - -//path: src/LuaCEmbed/protection_macros.h -#define PRIVATE_LUA_CEMBED_PROTECT_VOID \ - if(!self){ \ - return; \ - } - - -#define PRIVATE_LUA_CEMBED_PROTECT_NUM \ - if(!self){ \ - return LUA_CEMBED_GENERIC_ERROR; \ - } - -#define PRIVATE_LUA_CEMBED_PROTECT_BOOL \ - if(!self){ \ - return false; \ - } - -#define PRIVATE_LUA_CEMBED_PROTECT_NULL \ - if(!self){ \ - return NULL; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK if(lua_gettop(self->main_object->state)){lua_settop(self->main_object->state,0);} - -#define PRIVATE_LUA_CEMBED_CLEAR_STACK if(lua_gettop(self->state)){lua_settop(self->state,0);} - - -//path: src/LuaCEmbed/lib_props/lib_props.h - - -void LuaCEmbed_set_long_lib_prop(LuaCEmbed *self,const char *name,long long value); - -void LuaCEmbed_set_double_lib_prop(LuaCEmbed *self,const char *name,double value); - -void LuaCEmbed_set_bool_lib_prop(LuaCEmbed *self,const char *name,bool value); - -void LuaCEmbed_set_string_lib_prop(LuaCEmbed *self,const char *name,const char * value); - -void LuaCEmbed_set_table_lib_prop(LuaCEmbed *self,const char *name,LuaCEmbedTable *value); - -int private_LuaCEmbed_ensure_lib_prop_type(LuaCEmbed *self,const char *name,int expected_type);; - - -long long LuaCEmbed_get_long_lib_prop(LuaCEmbed *self,const char *name); - -double LuaCEmbed_get_double_lib_prop(LuaCEmbed *self,const char *name); - -bool LuaCEmbed_get_bool_lib_prop(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_string_lib_prop(LuaCEmbed *self,const char *name); - -LuaCEmbedTable *LuaCEmbed_get_table_lib_prop(LuaCEmbed *self,const char *name); - - - - - -//path: src/LuaCEmbedResponse/LuaCembedResponse_pt2.h - - -LuaCEmbedResponse * LuaCEmbed_send_table(LuaCEmbedTable *table); - - -LuaCEmbedResponse * LuaCEmbed_send_multi_return(LuaCEmbedTable *table); - - - -//path: src/extra/extra.h - - -const char * LuaCembed_convert_arg_code(int arg_code); - - -char * private_LuaCembed_format_vaarg(const char *expresion, va_list args); - -char * private_LuaCembed_format(const char *expresion, ...); - - - - -//path: src/namespace/declaration.h - -//path: src/namespace/types/types.h - - -typedef struct { - int NOT_FOUND; - int STRING; - int NUMBER; - int BOOL; - int NILL; - int TABLE; - int FUNCTION; - - -}LuaCEmbedTypeModule; - -LuaCEmbedTypeModule newLuaCEmbedTypeModule(); - -//path: src/namespace/response/response.h - - -typedef struct { - LuaCEmbedResponse * (*send_multi_return)(LuaCEmbedTable *table); - LuaCEmbedResponse * (*send_str)(const char *text); - LuaCEmbedResponse * (*send_raw_string)(const char *text,long size); - LuaCEmbedResponse * (*send_str_reference)( const char *text); - LuaCEmbedResponse * (*send_raw_string_reference)(const char *text,long size); - LuaCEmbedResponse * (*send_table)(LuaCEmbedTable *table); - LuaCEmbedResponse * (*send_evaluation_function)(const char *function); - LuaCEmbedResponse * (*send_double)(double value); - LuaCEmbedResponse * (*send_bool)(bool value); - LuaCEmbedResponse * (*send_long)(long value); - LuaCEmbedResponse * (*send_error)(const char *format,...); - -}LuaCEmbedResponseModule; - -LuaCEmbedResponseModule newLuaCEmbedResponseModule(); - -//path: src/namespace/globals/globals.h - - -typedef struct { - - int (*ensure_type)(LuaCEmbed *self, const char *name,int expected_type); - int (*get_type)(LuaCEmbed *self,const char *name); - long long (*get_long)(LuaCEmbed *self,const char *name); - double (*get_double)(LuaCEmbed *self,const char *name); - bool (*get_bool)(LuaCEmbed *self,const char *name); - char * (*get_string)(LuaCEmbed *self,const char *name); - LuaCEmbedTable* (*run_global_lambda)(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns); - void (*set_table)(LuaCEmbed *self, const char *name, LuaCEmbedTable *table); - void (*set_raw_string)(LuaCEmbed *self, const char *name, const char *value, long size); - char * (*get_raw_string)(LuaCEmbed *self, const char *name, long *size); - - - void (*set_string)(LuaCEmbed *self,const char *name,const char *value); - void (*set_long)(LuaCEmbed *self,const char *name,long long value); - void (*set_double)(LuaCEmbed *self,const char *name,double value); - void (*set_bool)(LuaCEmbed *self,const char *name,bool value); - - LuaCEmbedTable * (*get_table)(LuaCEmbed *self, const char *name); - LuaCEmbedTable * (*new_table)(LuaCEmbed *self, const char *name); - - -}LuaCEmbedGlobalModule; - -LuaCEmbedGlobalModule newLuaCEmbedGlobalModule(); - -//path: src/namespace/args/args.h - -typedef struct { - - - int (*size)(LuaCEmbed *self); - int (*get_type)(LuaCEmbed *self,int index); - long long (*get_long)(LuaCEmbed *self, int index); - double (*get_double)(LuaCEmbed *self, int index); - bool (*get_bool)(LuaCEmbed *self, int index); - char * (*get_raw_str)(LuaCEmbed *self, long *size, int index); - char * (*get_str)(LuaCEmbed *self, int index); - LuaCEmbedTable * (*get_table)(LuaCEmbed *self,int index); - int (*generate_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - int (*get_type_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - long long (*get_long_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - double (*get_double_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - bool (*get_bool_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - char* (*get_string_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - LuaCEmbedTable* (*run_lambda)(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call,int total_returns); - - - - -} LuaCembedArgsModule; - -LuaCembedArgsModule newLuaCembedArgsModule(); - -//path: src/namespace/table/table.h - -typedef struct { - - void (*append_string)(LuaCEmbedTable *self, const char *value); - void (*append_long)(LuaCEmbedTable *self, long long value); - void (*append_double)(LuaCEmbedTable *self, double value); - void (*append_bool)(LuaCEmbedTable *self, bool value); - void (*append_table)(LuaCEmbedTable *self, LuaCEmbedTable *table); - void (*set_evaluation_prop)(LuaCEmbedTable *self, const char *name, const char *code, ...); - void (*append_evaluation)(LuaCEmbedTable *self, const char *code, ...); - - void (*insert_string_at_index)(LuaCEmbedTable *self, long index, const char *value); - void (*insert_bool_at_index)(LuaCEmbedTable *self, long index,bool value); - void (*insert_long_at_index)(LuaCEmbedTable *self, long long index,long value); - void (*insert_double_at_index)(LuaCEmbedTable *self, long index,double value); - void (*insert_table_at_index)(LuaCEmbedTable *self, long index,LuaCEmbedTable *table); - - - - void (*set_sub_table_by_index)(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table); - void (*set_string_by_index)(LuaCEmbedTable *self, long index, const char *value); - void (*set_long_by_index)(LuaCEmbedTable *self, long long index, long value); - void (*set_double_by_index)(LuaCEmbedTable *self, long index, double value); - void (*set_bool_by_index)(LuaCEmbedTable *self, long index, bool value); - void (*set_evaluation_by_index)(LuaCEmbedTable *self, long index, const char *code, ...); - long (*get_listable_size)(LuaCEmbedTable *self); - LuaCEmbedTable *(*get_sub_table_by_index)(LuaCEmbedTable *self, long index); - - LuaCEmbedTable *(*new_sub_table_appending)(LuaCEmbedTable *self); - - void (*set_method)(LuaCEmbedTable *self , const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)); - void (*set_string_prop)(LuaCEmbedTable *self , const char *name, const char *value); - void (*set_long_prop)(LuaCEmbedTable *self , const char *name, long long value); - void (*set_double_prop)(LuaCEmbedTable *self , const char *name, double value); - void (*set_bool_prop)(LuaCEmbedTable *self , const char *name, bool value); - int (*get_type_prop)(LuaCEmbedTable *self, const char *name); - char* (*get_string_prop)(LuaCEmbedTable *self , const char *name); - long long (*get_long_prop)(LuaCEmbedTable *self , const char *name); - double (*get_double_prop)(LuaCEmbedTable *self , const char *name); - bool (*get_bool_prop)(LuaCEmbedTable *self , const char *name); - LuaCEmbedTable * (*new_anonymous_table)(LuaCEmbed *self); - void (*destroy_prop)(LuaCEmbedTable *self, const char *name); - - LuaCEmbedTable *(*get_sub_table_prop)(LuaCEmbedTable *self, const char *name); - LuaCEmbedTable *(*new_sub_table_prop)(LuaCEmbedTable *self, const char *name); - void (*set_sub_table_prop)(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table); - char *(*get_key_by_index)(LuaCEmbedTable *self, long index); - bool (*has_key)(LuaCEmbedTable *self,long index); - - long (*get_size)(LuaCEmbedTable *self); - int (*get_type_by_index)(LuaCEmbedTable *self, int index); - long long (*get_long_by_index)(LuaCEmbedTable *self, int index); - double (*get_double_by_index)(LuaCEmbedTable *self, int index); - char * (*get_string_by_index)(LuaCEmbedTable *self, int index); - bool (*get_bool_by_index)(LuaCEmbedTable *self, int index); - -}LuaCembedTableModule; - -LuaCembedTableModule newLuaCembedTableModule(); - - -//path: src/namespace/LuaCEmbedNamespace/LuaCEmbedNamespace.h - - -typedef struct{ - LuaCEmbedTypeModule types; - LuaCEmbedResponseModule response; - LuaCembedArgsModule args; - LuaCEmbedGlobalModule globals; - LuaCembedTableModule tables; - void (*clear_errors)(LuaCEmbed *self); - LuaCEmbed * (*newLuaLib)(lua_State *state); - void (*set_delete_function)(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)); - LuaCEmbed * (*newLuaEvaluation)(); - void (*load_native_libs)(LuaCEmbed *self); - void (*load_lib_from_c)(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name); - int (*perform)(LuaCEmbed *self); - const char * (*convert_arg_code)(int arg_code); - void (*set_memory_limit)(LuaCEmbed *self, double limit); - - char * (*get_error_message)(LuaCEmbed *self); - bool (*has_errors)(LuaCEmbed *self); - void (*set_timeout)(int seconds); - int (*evaluate)(LuaCEmbed *self, const char *code, ...); - char * (*get_string_evaluation)(LuaCEmbed *self,const char *code, ...); - int (*get_evaluation_type)(LuaCEmbed *self,const char *code,...); - long (*get_evaluation_size)(LuaCEmbed *self,const char *code,...); - long long (*get_evaluation_long)(LuaCEmbed *self,const char *code,...); - double (*get_evaluation_double)(LuaCEmbed *self,const char *code,...); - bool (*get_evaluation_bool)(LuaCEmbed *self, const char *code,...); - - void (*set_long_lib_prop)(LuaCEmbed *self,const char *name,long long value); - - void (*set_double_lib_prop)(LuaCEmbed *self,const char *name,double value); - void (*set_bool_lib_prop)(LuaCEmbed *self,const char *name,bool value); - void (*set_string_lib_prop)(LuaCEmbed *self,const char *name,const char * value); - void (*set_table_lib_prop)(LuaCEmbed *self,const char *name,LuaCEmbedTable *value); - - long long (*get_long_lib_prop)(LuaCEmbed *self,const char *name); - double (*get_double_lib_prop)(LuaCEmbed *self,const char *name); - bool (*get_bool_lib_prop)(LuaCEmbed *self,const char *name); - char * (*get_string_lib_prop)(LuaCEmbed *self,const char *name); - LuaCEmbedTable *(*get_table_lib_prop)(LuaCEmbed *self,const char *name); - - int (*evaluete_file)(LuaCEmbed *self, const char *file); - void (*add_callback)(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - void (*add_global_callback)(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - - void (*free)(LuaCEmbed *self); - -} LuaCEmbedNamespace; - -LuaCEmbedNamespace newLuaCEmbedNamespace(); - - - - - -//path: src/definition.h -//path: src/LuaCEmbedResponse/LuaCEmbedResponse.c - - - -LuaCEmbedResponse *private_LuaCEmbedReturn_raw(){ - LuaCEmbedResponse *self = (LuaCEmbedResponse*)malloc(sizeof(LuaCEmbedResponse)); - *self = (LuaCEmbedResponse){0}; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_bool(bool value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_BOOL_RESPONSE; - self->num_val = (double)value; - return self; -} - - -LuaCEmbedResponse * LuaCEmbed_send_str(const char *text){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = (long)strlen(text); - self->string_val = (char*)malloc(sizeof(char) * self->string_size +1); - memcpy(self->string_val,text,self->string_size); - self->string_val[self->string_size] = '\0'; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_raw_string(const char *text,long size){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = size; - self->string_val = (char*)malloc(sizeof(char) * self->string_size +1); - memcpy(self->string_val,text,self->string_size); - self->string_val[self->string_size] = '\0'; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_str_reference(const char *text){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = (long)strlen(text); - self->string_val = (char*)text; - self->its_string_ref = true; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_raw_string_reference(const char *text,long size){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = size; - self->string_val = (char*)text; - self->its_string_ref = true; - return self; -} - - - -LuaCEmbedResponse * LuaCEmbed_send_error(const char *format,...){ - - va_list args; - va_start(args,format); - char *error = private_LuaCembed_format_vaarg(format,args); - va_end(args); - - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_ERROR_RESPONSE; - self->string_val = error; - return self; -} - - -LuaCEmbedResponse * LuaCEmbed_send_multi_return(LuaCEmbedTable *table){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_MULTI_RESPONSE; - lua_getglobal(table->main_object->state,table->global_name); - lua_setglobal(table->main_object->state,PRIVATE_LUA_CEMBED_TABLE_RETURN); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_table(LuaCEmbedTable *table){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_TABLE_RESPONSE; - lua_getglobal(table->main_object->state,table->global_name); - lua_setglobal(table->main_object->state,PRIVATE_LUA_CEMBED_TABLE_RETURN); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_evaluation(const char *code){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_EVALUATION; - self->string_val = strdup(code); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_double(double value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE; - self->num_val = value; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_long(long value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_LONG_RESPONSE; - self->num_val = (double)value; - return self; -} - - - -void private_LuaCEmbedResponse_free(LuaCEmbedResponse *self){ - - if(self->string_val && self->its_string_ref == false){ - free(self->string_val); - } - free(self); -} - - -//path: src/LuaCEmbed/definition.h -//path: src/LuaCEmbed/memory/memory.c - - -void LuaCEmbed_set_memory_limit(LuaCEmbed *self, double limit){ - lua_setallocf(self->state, private_LuaCembed_custom_allocator, &lua_cembed_used_memory); - lua_cembed_memory_limit = limit; -} -static void *private_LuaCembed_custom_allocator(void *ud, void *ptr, size_t osize, size_t nsize) { - int *used = (int *)ud; - - if (ptr == NULL) { - osize = 0; - } - - if (nsize == 0) { - free(ptr); - *used -= osize; - return NULL; - } else { - long custom_limit = (long)(lua_cembed_memory_limit * PRIVATE_LUA_CEMBED_ONE_MB); - if (*used + (nsize - osize) > custom_limit) - return NULL; - ptr = realloc(ptr, nsize); - if (ptr) - *used += (nsize - osize); - return ptr; - } -} - - - -//path: src/LuaCEmbed/lib_start/lib_start.c - -int private_LuaCemb_internal_free(lua_State *L){ - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(L, lua_upvalueindex(1)); - if(self->delete_function){ - self->delete_function(self); - } - LuaCEmbed_free(self); - return 0; -} -LuaCEmbed * newLuaCEmbedLib(lua_State *state){ - LuaCEmbed *self = (LuaCEmbed*) malloc(sizeof (LuaCEmbed)); - *self = (LuaCEmbed){0}; - - self->state = state; - - self->lib_identifier = 0; - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_TOTAL_LIBS); - if(lua_type(self->state,-1) == LUA_CEMBED_NIL){ - self->lib_identifier = lua_tointeger(self->state,-1); - } - - self->lib_identifier +=1; - - self->main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - lua_pushinteger(self->state,self->lib_identifier); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_TOTAL_LIBS); - - - self->is_lib = true; - self->global_tables = (void*)newprivateLuaCEmbedTableArray(); - - - UniversalGarbage *garbage = newUniversalGarbage(); - char *lib_meta_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_META_TABLE__,self->lib_identifier); - UniversalGarbage_add_simple(garbage,lib_meta_table); - //creating the metatable - luaL_newmetatable(self->state, lib_meta_table); - //seting the clojure key - lua_pushstring(self->state,PRIVATE_LUA_CEMBED_DEL_PREFIX); - //set self as first clojure argument - lua_pushlightuserdata(self->state,(void*)self); - lua_pushcclosure(self->state,private_LuaCemb_internal_free,1); - lua_settable(self->state, -3); - - - char *lib_main_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - UniversalGarbage_add_simple(garbage,lib_main_table); - //creating the global table to store the elements - lua_newtable(self->state); - lua_setglobal(self->state,lib_main_table); - luaL_setmetatable(self->state, lib_meta_table); - - UniversalGarbage_free(garbage); - return self; -} - -int LuaCembed_perform(LuaCEmbed *self){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - char *lib_main_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - lua_getglobal(self->state,lib_main_table); - free(lib_main_table); - return 1; -} - - -//path: src/LuaCEmbed/basic/basic.c - - -LuaCEmbed * newLuaCEmbedEvaluation(){ - LuaCEmbed *self = (LuaCEmbed*) malloc(sizeof (LuaCEmbed)); - *self = (LuaCEmbed){0}; - self->state = luaL_newstate(); - - self->global_tables = (void*)newprivateLuaCEmbedTableArray(); - - return self; -} -void LuaCEmbed_load_lib_from_c(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name){ - int result = callback(self->state); - if(result > 0){ - lua_setglobal(self->state,name); - } -} -void LuaCEmbed_load_native_libs(LuaCEmbed *self) { - luaL_openlibs(self->state); -} - - - - -void LuaCembed_set_delete_function(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)){ - self->delete_function = delelte_function; -} - - - - -void LuaCEmbed_set_timeout(int seconds){ - lua_cembed_timeout = seconds; -} - -char * LuaCEmbed_get_error_message(LuaCEmbed *self){ - if(!self){ - return NULL; - } - - return self->error_msg; -} -void LuaCEmbed_clear_errors(LuaCEmbed *self){ - if(!self){ - return; - } - - if(self->error_msg){ - free(self->error_msg); - self->error_msg = NULL; - } -} -void * privateLuaCEmbed_get_current_table_array(LuaCEmbed *self){ - if(self->current_function){ - return self->func_tables; - } - return self->global_tables; -} -void privateLuaCEmbed_raise_error_not_jumping(LuaCEmbed *self, const char *error_msg, ...){ - - if(LuaCEmbed_has_errors(self)){ - return; - } - - va_list args; - va_start(args,error_msg); - self->error_msg = private_LuaCembed_format_vaarg(error_msg, args); - va_end(args); - -} - - - -bool LuaCEmbed_has_errors(LuaCEmbed *self){ - if(!self){ - return true; - } - - if(self->error_msg){ - return true; - } - - return false; -} - - - - - - -void privata_LuaCEmbed_increment_stack_(LuaCEmbed *self){ - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - int value = 0; - if(lua_type(self->state,-1) == LUA_CEMBED_NUMBER){ - value = lua_tonumber(self->state,-1); - } - int new_value = value+1; - lua_pushinteger(self->state,new_value); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve =new_value; -} - - -void privata_LuaCEmbed_decrement_stack(LuaCEmbed *self){ - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - int value = 0; - if(lua_type(self->state,-1) == LUA_CEMBED_NUMBER){ - value = lua_tointeger(self->state,-1); - } - if(value> 0){ - int new_value = value -1; - lua_pushinteger(self->state,new_value); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve = new_value; - } - -} - -void privateLuaCEmbd_get_field_protected(LuaCEmbed *self,const char *name){ - bool old_field_proection = self->field_protection; - self->field_protection = true; - lua_getfield(self->state,-1,name); - self->field_protection = old_field_proection; -} - -void LuaCEmbed_free(LuaCEmbed *self){ - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->global_tables); - if(!self->is_lib){ //se for do próprio lua, o lua cuidará de limpar - lua_close(self->state); // Fecha o estado Lua - } - if(self->error_msg){ - free(self->error_msg); - } - if(self->main_lib_table){ - free(self->main_lib_table); - } - free(self); -} - - -//path: src/LuaCEmbed/args/definition.h -//path: src/LuaCEmbed/args/args_error/args_error.c - - -int LuaCEmbed_ensure_arg_exist(LuaCEmbed *self, private_lua_cembed_incremented_arg index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(index > self->total_args){ - - privateLuaCEmbed_raise_error_not_jumping(self, PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,index,self->current_function); - return LUA_CEMBED_GENERIC_ERROR; - } - return LUA_CEMBED_OK; - -} - -int private_LuaCEmbed_ensure_top_stack_arg_type(LuaCEmbed *self, int index,int arg_type) { - PRIVATE_LUA_CEMBED_PROTECT_NUM - int type = lua_type(self->state, -1); - if (type != arg_type) { - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_ARG_WRONG_TYPE, - index + LUA_CEMBED_INDEX_DIF, - self->current_function, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(arg_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - - return LUA_CEMBED_OK; - -} - - - -//path: src/LuaCEmbed/args/basic/basic.c - -int privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(formatted_index > self->total_args){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,formatted_index,self->current_function); - return LUA_CEMBED_GENERIC_ERROR; - } - - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - lua_getglobal(self->state,formated_arg); - int type = lua_type(self->state,-1); - if(type == LUA_CEMBED_NOT_FOUND || type == LUA_CEMBED_NIL){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,formatted_index,self->current_function); - free(formated_arg); - return LUA_CEMBED_GENERIC_ERROR; - } - - free(formated_arg); - return LUA_OK; -} - -int LuaCEmbed_get_total_args(LuaCEmbed *self){ - return self->total_args; -} - - - -int LuaCEmbed_get_arg_type(LuaCEmbed *self,int index){ - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(formatted_index > self->total_args){ - return LUA_CEMBED_NIL; - } - - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - lua_getglobal(self->state,formated_arg); - int type = lua_type(self->state, -1); - free(formated_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return type; -} - - -long long LuaCEmbed_get_long_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_NUMBER)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - - long long result = (long long)lua_tonumber(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - - -double LuaCEmbed_get_double_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_NUMBER)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - double result = lua_tonumber(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - -bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_BOOL)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - bool result = lua_toboolean(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - - -char * LuaCEmbed_get_str_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - PRIVATE_LUA_CEMBED_CLEAR_STACK - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_STRING)){ - return NULL; - } - char *result = (char*)lua_tostring(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} -char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,long *size, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - PRIVATE_LUA_CEMBED_CLEAR_STACK - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_STRING)){ - return NULL; - } - char *result = (char*)lua_tolstring(self->state,-1,(size_t*)size); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - -LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_TABLE)){ - return NULL; - } - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - LuaCEmbedTable *created = LuaCembed_get_global_table(self,formated_arg); - free(formated_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return created; - -} - -LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call, int total_returns){ - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - char *formatted_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - free(formatted_arg); - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_FUNCTION)){ - free(formatted_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - int total_args = private_lua_cEmbed_unpack(args_to_call,formatted_arg); - if(lua_pcall(self->state,total_args,total_returns,0)){ - - privateLuaCEmbed_raise_error_not_jumping(self, lua_tostring(self->state,-1)); - free(formatted_arg); - - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - - for(int i = 0; i < total_returns; i++){ - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - int position = (i +1) * -1; - lua_pushvalue(self->state,position); - lua_setglobal(self->state,formatted); - free(formatted); - } - - - - LuaCEmbedTable *result = LuaCembed_new_anonymous_table(self); - for(int i = 0; i < total_returns; i++){ - lua_getglobal(self->state,result->global_name); - lua_pushinteger(self->state,i+1); - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - lua_getglobal(self->state,formatted); - lua_settable(self->state,-3); - free(formatted); - } - free(formatted_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; - -} - - - -//path: src/LuaCEmbed/args/evaluation/evaluation.c - - -int private_LuaCembed_run_code_with_args(LuaCEmbed *self,int index,const char *code,va_list args){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(LuaCEmbed_ensure_arg_exist(self,formatted_index)){ - return LUA_CEMBED_GENERIC_ERROR; - } - - char *formated_expresion = private_LuaCembed_format_vaarg(code,args); - - char *buffer = private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - formated_expresion - ); - - if(LuaCEmbed_evaluate(self, buffer)){ - free(formated_expresion); - free(buffer); - return LUA_CEMBED_GENERIC_ERROR; - } - free(buffer); - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - - int type = lua_type(self->state,-1); - - if(type != LUA_CEMBED_FUNCTION){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_CODE_ITS_NOT_A_FUNCTION,formated_expresion); - free(formated_expresion); - return LUA_CEMBED_GENERIC_ERROR; - } - - free(formated_expresion); - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - privateLuaCEmbed_put_arg_on_top(self,index); - - if(lua_pcall(self->state,1,1,0)){ - const char *generated_error = lua_tostring(self->state,-1); - privateLuaCEmbed_raise_error_not_jumping(self, generated_error); - } - return LUA_CEMBED_OK; -} - -int privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,int index,int expected_type){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - int actual_type = lua_type(self->state,-1); - if(actual_type== expected_type){ - return LUA_CEMBED_OK; - } - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_RESULT_EVALUATION_ARG_WRONG_TYPE, - self->current_function, - index, - LuaCembed_convert_arg_code(actual_type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} -int LuaCEmbed_get_type_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - return lua_type(self->state,-1); -} -int LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - return LUA_CEMBED_OK; -} -long long LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (long long) lua_tonumber(self->state,-1); - -} - - -double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (double ) lua_tonumber(self->state,-1); - -} - -bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return false; - } - return lua_toboolean(self->state,-1); - -} - -char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return NULL; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); - -} - - - - -//path: src/LuaCEmbed/table/definition.h -//path: src/LuaCEmbed/table/table/definition.h - -//path: src/LuaCEmbed/table/table/basic/basic.c - - - - -LuaCEmbedTable * private_newLuaCembedTable(LuaCEmbed *main_embed, const char *format, ...){ - - LuaCEmbedTable *self = (LuaCEmbedTable*)malloc(sizeof (LuaCEmbedTable)); - *self = (LuaCEmbedTable){0}; - self->main_object =main_embed; - - va_list args; - va_start(args,format); - self->global_name = private_LuaCembed_format_vaarg(format,args); - va_end(args); - - self->sub_tables = (void*)newprivateLuaCEmbedTableArray(); - - return self; -} - - int private_lua_cEmbed_unpack(LuaCEmbedTable *self,const char * previews_function){ - - long size = LuaCEmbedTable_get_listable_size(self); - lua_settop(self->main_object->state, 0); - - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - int total = 0; - - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - - lua_pushvalue(self->main_object->state,-1); - char *formated = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->main_object->stack_leve,total); - - lua_setglobal(self->main_object->state,formated); - free(formated); - lua_pop(self->main_object->state,1); - total+=1; - } - if(previews_function){ - lua_getglobal(self->main_object->state,previews_function); - } - for(int i = 0; i < size; i++){ - char *formated = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->main_object->stack_leve,i); - lua_getglobal(self->main_object->state,formated); - free(formated); - } - - return (int)size; -} -void privateLuaCEmbedTable_free(LuaCEmbedTable *self){ - - free(self->global_name); - - if(self->prop_name){ - free(self->prop_name); - } - - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->sub_tables); - free(self); -} - - - -//path: src/LuaCEmbed/table/table/getters/definition.h -//path: src/LuaCEmbed/table/table/getters/index/index.c - - -long LuaCEmbedTable_get_full_size(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - - - lua_getglobal(self->main_object->state,self->global_name); - int index = lua_gettop(self->main_object->state); - long total = 0; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,index)){ - total+=1; - lua_pop(self->main_object->state,1); - } - - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return total; -} - -long LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - lua_getglobal(self->main_object->state,self->global_name); - return (long)lua_rawlen(self->main_object->state,-1); -} - - -long privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cembed_incremented_arg index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - if(index >= 0){ - return index; - } - - return LuaCEmbedTable_get_full_size(self) + index; -} - -int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - int type = lua_type(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return type; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_NOT_FOUND; -} -char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - - if(total == converted_index){ - if(lua_type(self->main_object->state,-2) != LUA_CEMBED_STRING ){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - char* result = (char*)lua_tostring(self->main_object->state,-2); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - - lua_pop(self->main_object->state,1); - total+=1; - - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} -bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - lua_settop(self->main_object->state,0); - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - bool has_key =lua_type(self->main_object->state,-2) == LUA_CEMBED_STRING; - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return has_key; - } - - lua_pop(self->main_object->state,1); - total+=1; - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return false; -} - -long long LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - lua_settop(self->main_object->state,0); - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_NUMBER)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - long result = (long)lua_tonumber(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_NUMBER) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} - -double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_NUMBER)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - double result = (double )lua_tonumber(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_NUMBER) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} - -char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_STRING)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - char * result = (char*)lua_tostring(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_STRING) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} - -bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_BOOL)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - bool result = lua_toboolean(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - converted_index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_BOOL) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} - -//path: src/LuaCEmbed/table/table/getters/keys/keys.c - -int LuaCEmbedTable_get_type_prop(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - return lua_type(self->main_object->state,-1); - -} - -char* LuaCembedTable_get_string_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_STRING)){ - return NULL; - } - - char *value = (char*)lua_tostring(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - - -long long LuaCembedTable_get_long_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - long long value = (long long)lua_tonumber(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - -double LuaCembedTable_get_double_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - double value = (double )lua_tonumber(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - -bool LuaCembedTable_get_bool_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - bool value = lua_toboolean(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - - - -//path: src/LuaCEmbed/table/table/setters/definition.h -//path: src/LuaCEmbed/table/table/setters/index/index.c - - -void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, long index, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_string_prop(self,possible_key,value); - return; - } - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushstring(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_long_by_index(LuaCEmbedTable *self, long long index, long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_long_prop(self,possible_key,value); - return; - } - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushnumber(self->main_object->state,(double )value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, long index, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_double_prop(self,possible_key,value); - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushnumber(self->main_object->state,(double )value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, long index, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_bool_prop(self,possible_key,value); - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushboolean(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - - -void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, long index, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - va_list args; - va_start(args,code); - char * buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate(self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - - -//path: src/LuaCEmbed/table/table/setters/keys/keys.c - - - - -void LuaCEmbedTable_set_method(LuaCEmbedTable *self , const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - bool is_meta = false; - - if(strlen(name) > 3){ - if(name[0] == '_' && name[1] == '_' ){ - is_meta = true; - } - } - lua_getglobal(self->main_object->state,self->global_name); - - if(is_meta){ - - - int found =lua_getmetatable(self->main_object->state,-1); - if(!found){ - - //equivalent of meta ={} ;setmetatable(table,meta) - lua_getglobal(self->main_object->state,self->global_name); - lua_newtable(self->main_object->state); - lua_setmetatable(self->main_object->state,-2); - - lua_getglobal(self->main_object->state,self->global_name); - lua_getmetatable(self->main_object->state,-1); - } - } - - - lua_pushstring(self->main_object->state,name); - //creating the clojure - - lua_pushboolean(self->main_object->state,true);//is a method - - lua_pushlightuserdata(self->main_object->state,(void*)self->main_object); //self - lua_pushstring(self->main_object->state,name);//calback name - lua_getglobal(self->main_object->state,self->global_name);//table - lua_pushlightuserdata(self->main_object->state,(void*)callback); - - //add these clojure to be handled by the callbacks - lua_pushcclosure(self->main_object->state,privateLuaCEmbed_main_callback_handler,5); - lua_settable(self->main_object->state,-3); - - if(is_meta){ - //equivalent of meta ={} ;setmetatable(table,meta) - lua_getglobal(self->main_object->state,self->global_name); - lua_getmetatable(self->main_object->state,-1); - lua_setmetatable(self->main_object->state,-2); - } - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_string_prop(LuaCEmbedTable *self , const char *name, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushstring(self->main_object->state,value); - - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_long_prop(LuaCEmbedTable *self , const char *name, long long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnumber(self->main_object->state,(double)value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_double_prop(LuaCEmbedTable *self , const char *name, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnumber(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_bool_prop(LuaCEmbedTable *self , const char *name, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushboolean(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_evaluation_prop(LuaCEmbedTable *self, const char *name, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - va_list args; - va_start(args,code); - char *buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate(self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -//path: src/LuaCEmbed/table/table/setters/insert/insert.c - -void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, long formatted_index){ - - - lua_newtable(self->main_object->state); - lua_setglobal(self->main_object->state,PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - - lua_getglobal(self->main_object->state, self->global_name); - int table_index = lua_gettop(self->main_object->state); - int total = 1; - lua_pushnil(self->main_object->state); // Empilhando o primeiro par chave-valor - while (lua_next(self->main_object->state, table_index)) { - - if (total >= formatted_index) { - lua_getglobal(self->main_object->state, PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - lua_pushinteger(self->main_object->state, total + 1); - lua_pushvalue(self->main_object->state, -3); - lua_settable(self->main_object->state, -3); - lua_pop(self->main_object->state, 1); - } - lua_pop(self->main_object->state, 1); // Removendo o valor atual - total+=1; - } - - lua_getglobal(self->main_object->state, PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - table_index = lua_gettop(self->main_object->state); - lua_pushnil(self->main_object->state); - - while (lua_next(self->main_object->state, table_index)) { - lua_getglobal(self->main_object->state,self->global_name); - lua_pushvalue(self->main_object->state,-3); //table[index] = stage_area[index] - lua_pushvalue(self->main_object->state,-3); //table[index] = stage_area[index] - lua_settable(self->main_object->state,-3); - lua_pop(self->main_object->state, 2); // Removendo o valor atual - } - - lua_getglobal(self->main_object->state, "stage_arrea"); - lua_pushnil(self->main_object->state); -} - -void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, long index, const char *value) { - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushstring(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - - -void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, long index,bool value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushboolean(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, long long index,long value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushinteger(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, long index,double value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushnumber(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_table_at_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *table){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_getglobal(self->main_object->state,table->global_name); - lua_settable(self->main_object->state, -3); - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - - - -//path: src/LuaCEmbed/table/table/errors/errors.c - - - -int privateLuaCEmbedTable_ensure_type_with_key(LuaCEmbedTable *self, const char *name, int expected_type){ - if(!self){ - return LUA_CEMBED_GENERIC_ERROR; - } - - int type = lua_type(self->main_object->state,-1); - if(type == expected_type){ - return LUA_CEMBED_OK; - } - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_PROPETY, - name, - self->global_name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} - -int privateLuaCEmbedTable_ensure_type_with_index(LuaCEmbedTable *self, long index, int expected_type){ - if(!self){ - return LUA_CEMBED_GENERIC_ERROR; - } - - int type = lua_type(self->main_object->state,-1); - if(type == expected_type){ - return LUA_CEMBED_OK; - } - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} - -//path: src/LuaCEmbed/table/table/sub_tables/definition.h -//path: src/LuaCEmbed/table/table/sub_tables/key/key.c - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_by_key(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - //equivalent of: table.sub_table = {} - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_newtable(self->main_object->state); - lua_settable(self->main_object->state,-3); - - - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state, name); - lua_gettable(self->main_object->state, -2); - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_prop_name( - (privateLuaCEmbedTableArray *) self->sub_tables, - name - ); - - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->prop_name = strdup(name); - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; -} - - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_key(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_TABLE)){ - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_prop_name( - (privateLuaCEmbedTableArray *) self->sub_tables, - name - ); - - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->prop_name = strdup(name); - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; - -} - - - -void LuaCEmbedTable_set_sub_table_prop(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - //equivalent of table.name = sub_table; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_getglobal(self->main_object->state,sub_table->global_name); - lua_settable(self->main_object->state,-3); - - - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK -} - -//path: src/LuaCEmbed/table/table/sub_tables/index/index.c - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_appending(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - - //equivalent of: full_sub_table_name = {} - long index= LuaCEmbedTable_get_listable_size(self) +1; - char *full_sub_table_name = private_LuaCembed_format("%s_%d", self->global_name, index); - lua_newtable(self->main_object->state); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - //equivalent of: table[index] = full_sub_table_name - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,index); - lua_getglobal(self->main_object->state,full_sub_table_name); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_internal_index( - (privateLuaCEmbedTableArray *) self->sub_tables, - index - ); - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->index = index; - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; -} - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, long index){ - - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_TABLE)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - - //equivalent of full_sub_table_name = table[index] - char *full_sub_table_name = private_LuaCembed_format("%s_%d", self->global_name, index); - lua_setglobal(self->main_object->state,full_sub_table_name); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_internal_index( - (privateLuaCEmbedTableArray *) self->sub_tables, - index - ); - - if(possible){ - free(full_sub_table_name); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->index = index; - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_TABLE) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} - -void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_sub_table_prop(self,possible_key,sub_table); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,formatted_index); - lua_getglobal(self->main_object->state,sub_table->global_name); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK -} - - - -//path: src/LuaCEmbed/table/table/append/append.c -void LuaCEmbedTable_append_table(LuaCEmbedTable *self, LuaCEmbedTable *table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_getglobal(self->main_object->state,table->global_name); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_string(LuaCEmbedTable *self, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushstring(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_long(LuaCEmbedTable *self, long long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushnumber(self->main_object->state,(double)value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_double(LuaCEmbedTable *self, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushnumber(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_bool(LuaCEmbedTable *self, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushboolean(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_evaluation(LuaCEmbedTable *self, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - va_list args; - va_start(args,code); - char *buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate( - self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); -} - -//path: src/LuaCEmbed/table/table/destroy/destroy.c - - -void LuaCembedTable_destroy_prop(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnil(self->main_object->state); - lua_settable(self->main_object->state,-3); -} -void LuaCEmbedTable_destroy_by_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(LuaCembedTable_has_key_at_index(self,index)){ - char *key = LuaCembedTable_get_key_by_index(self,index); - LuaCembedTable_destroy_prop(self,key); - return; - } - - lua_getglobal(self->main_object->state,self->global_name); - - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int table_index = lua_gettop(self->main_object->state); - int total = 0; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total >= converted_index){ - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)(total)); - lua_pushvalue(self->main_object->state,-3); - lua_settable(self->main_object->state,-3); - lua_pop(self->main_object->state,1); - - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,total); - lua_pushnil(self->main_object->state); - lua_settable(self->main_object->state,-3); - - - -} - - -//path: src/LuaCEmbed/table/table_array/table_array.c - - -privateLuaCEmbedTableArray *newprivateLuaCEmbedTableArray(){ - privateLuaCEmbedTableArray *self = (privateLuaCEmbedTableArray*) malloc(sizeof (privateLuaCEmbedTableArray)); - *self = (privateLuaCEmbedTableArray){0}; - self->tables = (LuaCEmbedTable**)malloc(0); - return self; -} - -void privateLuaCEmbedTableArray_append(privateLuaCEmbedTableArray *self,LuaCEmbedTable *element){ - - self->tables = (LuaCEmbedTable **)realloc( - self->tables, - (self->size+1)* sizeof (LuaCEmbedTable**) - ); - self->tables[self->size] = element; - self->size+=1; -} - - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_prop_name(privateLuaCEmbedTableArray *self, const char *name){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(current_table->prop_name){ - if(strcmp(current_table->prop_name,name) ==0){ - return current_table; - } - } - } - return NULL; -} - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_global_name(privateLuaCEmbedTableArray *self, const char *name){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(strcmp(current_table->global_name,name) ==0){ - return current_table; - } - } - return NULL; -} - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_internal_index(privateLuaCEmbedTableArray *self, long internal_index){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(current_table->index == internal_index){ - return current_table; - } - } - return NULL; -} - -void privateLuaCEmbedTableArray_free(privateLuaCEmbedTableArray *self){ - - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - privateLuaCEmbedTable_free(current_table); - } - - free(self->tables); - free(self); -} - - - -//path: src/LuaCEmbed/globals/definition.h -//path: src/LuaCEmbed/globals/errors/errors.c - - - - -int LuaCEmbed_ensure_global_type(LuaCEmbed *self, const char *name,int expected_type){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - lua_getglobal(self->state,name); - int type = lua_type(self->state,-1); - - if(type != expected_type){ - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_GLOBAL_WRONG_TYPE, - name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - - return LUA_CEMBED_OK; - -} - -//path: src/LuaCEmbed/globals/getters/getters.c - - -int LuaCEmbed_get_global_type(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - lua_getglobal(self->state, name); - return lua_type(self->state,-1); -} - -long long LuaCEmbed_get_global_long(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return (long )lua_tonumber(self->state,-1); -} - -double LuaCEmbed_get_global_double(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return (double )lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_global_bool(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return lua_toboolean(self->state,-1); -} - -char * LuaCEmbed_get_global_raw_string(LuaCEmbed *self,const char *name,long *size){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - lua_getglobal(self->state, name); - return (char*)lua_tolstring(self->state,-1,(size_t*)size); -} - -char * LuaCEmbed_get_global_string(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - lua_getglobal(self->state, name); - return (char*)lua_tostring(self->state,-1); -} - -LuaCEmbedTable * LuaCembed_new_anonymous_table(LuaCEmbed *self){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - - const char *format_raw = PRIVATE_LUA_CEMBED_ANONYMOUS_TABLE_; - if(self->current_function){ - format_raw =PRIVATE_LUA_CEMBED_ANONYMOUS_FUNC_TABLE_; - } - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - char *buffer= private_LuaCembed_format(format_raw, self->stack_leve, target->size); - LuaCEmbedTable *created_table =LuaCembed_new_global_table(self,buffer); - - free(buffer); - return created_table; -} - - - -LuaCEmbedTable * LuaCembed_get_global_table(LuaCEmbed *self, const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_TABLE)){ - return NULL; - } - - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,name); - if(possible){ - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s", name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} - -LuaCEmbedTable * LuaCembed_new_global_table(LuaCEmbed *self, const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - lua_newtable(self->state); - lua_setglobal(self->state,name); - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,name); - if(possible){ - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s", name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} - -LuaCEmbedTable* LuaCEmbed_run_global_lambda(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns){ - - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_FUNCTION)){ - return NULL; - } - - int total_args = private_lua_cEmbed_unpack(args_to_call,name); - if(lua_pcall(self->state,total_args,total_returns,0)){ - privateLuaCEmbed_raise_error_not_jumping(self, lua_tostring(self->state,-1)); - return NULL; - } - - for(int i = 0; i < total_returns; i++){ - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_, self->stack_leve, i); - int position = (i +1) * -1; - lua_pushvalue(self->state,position); - lua_setglobal(self->state,formatted); - free(formatted); - } - - LuaCEmbedTable *result = LuaCembed_new_anonymous_table(self); - for(int i = 0; i < total_returns; i++){ - lua_getglobal(self->state,result->global_name); - lua_pushinteger(self->state,i+1); - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - lua_getglobal(self->state,formatted); - lua_settable(self->state,-3); - free(formatted); - } - - return result; -} - - - -//path: src/LuaCEmbed/globals/setters/setters.c - - -void LuaCEmbed_set_global_string(LuaCEmbed *self, const char *name, const char *value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushstring(self->state,value); - lua_setglobal(self->state,name); -} -void LuaCEmbed_set_global_raw_string(LuaCEmbed *self, const char *name, const char *value,long size){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushlstring(self->state,value,size); - lua_setglobal(self->state,name); -} - - -void LuaCEmbed_set_global_long(LuaCEmbed *self, const char *name, long long value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushnumber(self->state,(double )value); - lua_setglobal(self->state,name); -} - -void LuaCEmbed_set_global_double(LuaCEmbed *self, const char *name, double value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushnumber(self->state,(double )value); - lua_setglobal(self->state,name); -} - -void LuaCEmbed_set_global_bool(LuaCEmbed *self, const char *name, bool value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - lua_pushboolean(self->state,value); - lua_setglobal(self->state,name); -} - - -void LuaCEmbed_set_global_table(LuaCEmbed *self, const char *name, LuaCEmbedTable *table){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_getglobal(self->state,table->global_name); - lua_setglobal(self->state,name); -} - - - -//path: src/LuaCEmbed/callback_handle/callback_handle.c - - -int privateLuaCEmbed_main_callback_handler(lua_State *L){ - - bool is_a_method = lua_toboolean(L, lua_upvalueindex(1)); - bool is_a_function = !is_a_method; - LuaCEmbedResponse *possible_return = NULL; - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(L,lua_upvalueindex(2)); - int old_total_args = self->total_args; - self->total_args = lua_gettop(self->state); - privata_LuaCEmbed_increment_stack_(self); - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve = (int)lua_tonumber(self->state,-1); - - for(int i = 0; i < self->total_args; i++){ - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,i); - lua_pushvalue(L,i+1); - lua_setglobal(L,formated_arg); - free(formated_arg); - } - - const char *func_name = lua_tostring(L,lua_upvalueindex(3)); - self->current_function = func_name; - void *old_funct_tables = self->func_tables; - self->func_tables = (void*)newprivateLuaCEmbedTableArray(); - if(is_a_method){ - LuaCEmbedResponse *(*method_callback)(LuaCEmbedTable *tb, LuaCEmbed *self); - - //equivalent of PRIVATE_LUA_CEMBED_SELFNAME = index[4] - lua_pushvalue(L, lua_upvalueindex(4)); - lua_setglobal(L,PRIVATE_LUA_CEMBED_SELFNAME); - - LuaCEmbedTable *table = private_newLuaCembedTable(self, PRIVATE_LUA_CEMBED_SELFNAME); - method_callback = (LuaCEmbedResponse *(*)(LuaCEmbedTable *tb, LuaCEmbed *self))lua_touserdata(L, lua_upvalueindex(5)); - possible_return = method_callback(table,self); - privateLuaCEmbedTable_free(table); - } - - if(is_a_function){ - LuaCEmbedResponse *(*function_callback)(LuaCEmbed *self); - function_callback = (LuaCEmbedResponse *(*)(LuaCEmbed *self))lua_touserdata(L, lua_upvalueindex(4)); - possible_return = function_callback(self); - } - - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->func_tables); - self->func_tables = old_funct_tables; - self->total_args = old_total_args; - privata_LuaCEmbed_decrement_stack(self); - PRIVATE_LUA_CEMBED_CLEAR_STACK - self->current_function = NULL; - - if(possible_return==NULL){ - return PRIVATE_LUACEMBED_NO_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_ERROR_RESPONSE){ - - if(self->field_protection){ - private_LuaCEmbedResponse_free(possible_return); - if(self->error_msg){ - free(self->error_msg); - self->error_msg = NULL; - } - - return PRIVATE_LUACEMBED_NO_RETURN; - } - - lua_pushstring(L, possible_return->string_val); - privateLuaCEmbed_raise_error_not_jumping(self,possible_return->string_val); - private_LuaCEmbedResponse_free(possible_return); - lua_error(L); - return PRIVATE_LUACEMBED_NO_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_LONG_RESPONSE){ - lua_pushinteger(L, (int)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_BOOL_RESPONSE){ - lua_pushboolean(L, (bool)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE){ - lua_pushnumber(L, possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_STRING_RESPONSE){ - lua_pushlstring(self->state,possible_return->string_val,possible_return->string_size); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE){ - lua_pushboolean(L, (bool)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_TABLE_RESPONSE){ - lua_getglobal(self->state, PRIVATE_LUA_CEMBED_TABLE_RETURN); - lua_pushvalue(self->state,-1); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_MULTI_RESPONSE){ - LuaCEmbedTable *table = private_newLuaCembedTable(self, PRIVATE_LUA_CEMBED_TABLE_RETURN); - int size =private_lua_cEmbed_unpack(table,NULL); - private_LuaCEmbedResponse_free(possible_return); - privateLuaCEmbedTable_free(table); - - return size; - } - - - if(possible_return->type == PRIVATE_LUA_CEMBED_EVALUATION){ - char *formated_function =private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - possible_return->string_val - ); - - int error_code = LuaCEmbed_evaluate(self, formated_function); - free(formated_function); - - if(error_code){ - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - } - - lua_getglobal(self->state, PRIVATE_LUA_CEMBED_EVALUATION_NAME); - int v_type = lua_type(self->state,-1); - if(v_type == LUA_CEMBED_FUNCTION){ - const int TOTAL_ARGS =0; - const int TOTAL_RETURNS =1; - if(lua_pcall(self->state,TOTAL_ARGS,TOTAL_RETURNS,0)){ - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - } - } - - lua_pushvalue(self->state,-1); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - - } - - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - -} - - -void private_LuaCEmbed_add_lib_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args),bool global_functions ){ - - char *main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - //get the table - lua_getglobal(self->state,main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,callback_name); - - //creating the clojure - - //creating the clojure - lua_pushboolean(self->state,false);//is a method - lua_pushlightuserdata(self->state,(void*)self); //self - lua_pushstring(self->state,callback_name);//calback name - lua_pushlightuserdata(self->state,(void*)callback);//calback - - lua_pushcclosure(self->state,privateLuaCEmbed_main_callback_handler,4); - - - lua_settable(self->state,-3); - if(global_functions){ - //it points the function to a global function - //like: callback = private_lua_c_embed_main_lib_table.callback - lua_getglobal(self->state, main_lib_table); - lua_getfield(self->state,-1,callback_name); - lua_setglobal(self->state, callback_name); - } - - lua_settop(self->state, 0); - free(main_lib_table); - -} - -void private_LuaCEmbed_add_evaluation_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - //creating the clojure - lua_pushboolean(self->state,false);//is a method - lua_pushlightuserdata(self->state,(void*)self); //self - lua_pushstring(self->state,callback_name);//calback name - lua_pushlightuserdata(self->state,(void*)callback);//calback - - lua_pushcclosure(self->state,privateLuaCEmbed_main_callback_handler,4); - lua_setglobal(self->state, callback_name); - lua_settop(self->state, 0); - -} - - -void LuaCEmbed_add_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - if(self->is_lib){ - private_LuaCEmbed_add_lib_callback(self,callback_name,callback,false); - return; - } - private_LuaCEmbed_add_evaluation_callback(self,callback_name,callback); - -} - -void LuaCEmbed_add_global_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args)){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - if(self->is_lib){ - private_LuaCEmbed_add_lib_callback(self,callback_name,callback,true); - return; - } - private_LuaCEmbed_add_evaluation_callback(self,callback_name,callback); -} - -//path: src/LuaCEmbed/evaluation/evaluation.c - - -#ifdef _WIN32 -VOID CALLBACK TimerHandler(HWND hwnd, UINT uMsg, UINT_PTR idEvent, DWORD dwTime) { - - privateLuaCEmbed_raise_error_not_jumping(global_current_lua_embed_object, PRIVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_pushstring(global_current_lua_embed_object->state,PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_error(global_current_lua_embed_object->state); -} - -#else - -void private_LuaCembed_handle_timeout(int signum) { - - privateLuaCEmbed_raise_error_not_jumping(global_current_lua_embed_object, PRIVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_pushstring(global_current_lua_embed_object->state,PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_error(global_current_lua_embed_object->state); -} - -#endif - - - -int privateLuaCEmbed_start_func_evaluation(lua_State *state){ - - int evaluation_type = lua_tointeger(state, lua_upvalueindex(1)); - char *text_value = (char*)lua_touserdata(state,lua_upvalueindex(2)); - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(state,lua_upvalueindex(3)); - global_current_lua_embed_object = self; - #ifdef _WIN32 - if (lua_cembed_timeout > 0) { - SetTimer(NULL, 0,lua_cembed_timeout > 0 * 1000, TimerHandler); - } - #else - if (lua_cembed_timeout > 0) { - signal(SIGALRM, private_LuaCembed_handle_timeout); - alarm(lua_cembed_timeout); - } - #endif - - int error = 0; - if(evaluation_type == PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE){ - error =luaL_dofile(self->state,text_value); - } - if(evaluation_type == PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE){ - error = luaL_dostring(self->state,text_value); - } - if(error){ - privateLuaCEmbed_raise_error_not_jumping(self,lua_tostring(self->state,-1)); - } - lua_pushinteger(self->state,error); - - return 1; - -} -int LuaCEmbed_evaluate(LuaCEmbed *self, const char *code, ...){ - - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - char * formated_expresion = private_LuaCembed_format_vaarg(code,args); - va_end(args); - lua_pushinteger(self->state,PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE); - lua_pushlightuserdata(self->state,(void*)formated_expresion); //code - lua_pushlightuserdata(self->state,(void*)self); //code - lua_pushcclosure(self->state,privateLuaCEmbed_start_func_evaluation,3); - lua_pcall(self->state,0,1,0); - int error = lua_tointeger(self->state,-1); - free(formated_expresion); - - return error; - -} - -int LuaCEmbed_evaluete_file(LuaCEmbed *self, const char *file){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - - lua_pushinteger(self->state,PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE); - lua_pushlightuserdata(self->state,(void*)file); //code - lua_pushlightuserdata(self->state,(void*)self); //code - lua_pushcclosure(self->state,privateLuaCEmbed_start_func_evaluation,3); - lua_pcall(self->state,0,1,0); - int error = lua_tointeger(self->state,-1); - return error; - -} - -int private_LuaCEmbed_evaluate_puting_on_top_of_stack(LuaCEmbed *self,const char *code, va_list args){ - - char * formated_expresion =private_LuaCembed_format_vaarg(code,args); - - char * buffer =private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - formated_expresion - ); - - if(LuaCEmbed_evaluate(self, buffer)){ - free(formated_expresion); - free(buffer); - return LUA_CEMBED_GENERIC_ERROR; - } - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - - int type = lua_type(self->state,-1); - - if(type == LUA_CEMBED_FUNCTION){ - if(lua_pcall(self->state,0,1,0)){ - const char *generated_error = lua_tostring(self->state,-1); - privateLuaCEmbed_raise_error_not_jumping(self, generated_error); - } - } - free(formated_expresion); - free(buffer); - return LUA_CEMBED_OK; - -} -int private_LuaCEmbed_ensure_evaluation_type(LuaCEmbed *self,int type){ - - int actual_type = lua_type(self->state,-1); - if(actual_type== type){ - return LUA_CEMBED_OK; - } - - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_RESULT_EVALUATION_WRONG_TYPE, - LuaCembed_convert_arg_code(actual_type), - LuaCembed_convert_arg_code(type) - ); - - return LUA_CEMBED_GENERIC_ERROR; -} - -char * LuaCEmbed_get_evaluation_string(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return NULL; - } - - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_STRING)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); - -} - - -int LuaCEmbed_get_evaluation_type(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - - return lua_type(self->state,-1); -} - - -long LuaCEmbed_get_evaluation_table_size(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_TABLE)){ - return LUA_CEMBED_GENERIC_ERROR; - } - - - return (long)lua_rawlen(self->state,-1); -} - - - -long long LuaCEmbed_get_evaluation_long(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (long)lua_tonumber(self->state,-1); - -} - -double LuaCEmbed_get_evaluation_double(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (double)lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_evaluation_bool(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (bool)lua_toboolean(self->state,-1); -} - - - -//path: src/LuaCEmbed/lib_props/lib_props.c - - -void LuaCEmbed_set_long_lib_prop(LuaCEmbed *self,const char *name,long long value){ - char *main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - lua_getglobal(self->state,main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushinteger(self->state,value); - lua_settable(self->state,-3); - free(main_lib_table); -} - -void LuaCEmbed_set_double_lib_prop(LuaCEmbed *self,const char *name,double value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushnumber(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_bool_lib_prop(LuaCEmbed *self,const char *name,bool value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushboolean(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_string_lib_prop(LuaCEmbed *self,const char *name,const char * value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushstring(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_table_lib_prop(LuaCEmbed *self,const char *name,LuaCEmbedTable *value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - lua_pushstring(self->state,name); - lua_getglobal(self->state,value->global_name); - lua_settable(self->state,-3); - -} - -int private_LuaCEmbed_ensure_lib_prop_type(LuaCEmbed *self,const char *name,int expected_type){ - int type = lua_type(self->state,-1); - if(type!= expected_type){ - privateLuaCEmbed_raise_error_not_jumping( - self, - PRIVATE_LUA_CEMBED_LIB_PROP_WRONG_TYPE, - name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - return LUA_CEMBED_OK; -} - -long long LuaCEmbed_get_long_lib_prop(LuaCEmbed *self,const char *name){ - lua_getglobal(self->state,self->main_lib_table); - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_tointeger(self->state,-1); - -} - -double LuaCEmbed_get_double_lib_prop(LuaCEmbed *self,const char *name){ - - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_bool_lib_prop(LuaCEmbed *self,const char *name){ - - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_toboolean(self->state,-1); -} - -char * LuaCEmbed_get_string_lib_prop(LuaCEmbed *self,const char *name){ - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); -} - -LuaCEmbedTable *LuaCEmbed_get_table_lib_prop(LuaCEmbed *self,const char *name){ -; - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_TABLE)){ - return NULL; - } - - char *global_sub_table_name = private_LuaCembed_format( - PRIVATE_LUA_CEMBED_MAIN_LIB_SUB_TABLE, - self->lib_identifier, - name - ); - lua_setglobal(self->state,global_sub_table_name); - - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,global_sub_table_name); - if(possible){ - free(global_sub_table_name); - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s",global_sub_table_name); - free(global_sub_table_name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} - - - -//path: src/extra/extra.c - - -const char * LuaCembed_convert_arg_code(int arg_code){ - if(arg_code == LUA_CEMBED_NOT_FOUND){ - return PRIVATE_LUA_CEMBED_NOT_FOUND_STRING; - } - - if(arg_code == LUA_CEMBED_STRING){ - return PRIVATE_LUA_CEMBED_STRING_STRING; - - } - if(arg_code == LUA_CEMBED_NUMBER){ - return PRIVATE_LUA_CEMBED_NUMBER_STRING; - } - if(arg_code == LUA_CEMBED_BOOL){ - return PRIVATE_LUA_CEMBED_BOOL_STRING; - } - if(arg_code == LUA_CEMBED_NIL){ - return PRIVATE_LUA_CEMBED_NIL_STRING; - } - if(arg_code == LUA_CEMBED_TABLE){ - return PRIVATE_LUA_CEMBED_TABLE_STRING; - } - if(arg_code == LUA_CEMBED_FUNCTION){ - return PRIVATE_LUA_CEMBED_FUNCTION_STRING; - } - - return PRIVATE_LUA_CEMBED_UNKNOW_STRING; -} - -char * private_LuaCembed_format_vaarg(const char *expresion, va_list args){ - - va_list args_copy; - va_copy(args_copy, args); - long required_size = vsnprintf(NULL, 0,expresion,args_copy); - va_end(args_copy); - char *buffer = (char*)malloc(sizeof(char) * required_size + 2); - vsnprintf(buffer,sizeof (char) * required_size+1,expresion,args); - return buffer; -} -char * private_LuaCembed_format(const char *expresion, ...){ - va_list args; - va_start(args,expresion); - char *result = private_LuaCembed_format_vaarg(expresion,args); - va_end(args); - return result; -} - -//path: src/namespace/definition.h - -//path: src/namespace/types/types.c - -LuaCEmbedTypeModule newLuaCEmbedTypeModule(){ - LuaCEmbedTypeModule self = {0}; - self.NOT_FOUND = LUA_CEMBED_NOT_FOUND; - self.STRING = LUA_CEMBED_STRING; - self.NUMBER = LUA_CEMBED_NUMBER; - self.BOOL = LUA_CEMBED_BOOL; - self.NILL = LUA_CEMBED_NIL; - self.TABLE = LUA_CEMBED_TABLE; - self.FUNCTION = LUA_CEMBED_FUNCTION; - return self; -} - -//path: src/namespace/response/response.c - - -LuaCEmbedResponseModule newLuaCEmbedResponseModule(){ - LuaCEmbedResponseModule self = {0}; - self.send_multi_return = LuaCEmbed_send_multi_return; - self.send_str = LuaCEmbed_send_str; - self.send_str_reference = LuaCEmbed_send_str_reference; - self.send_raw_string = LuaCEmbed_send_raw_string; - self.send_raw_string_reference = LuaCEmbed_send_raw_string_reference; - self.send_bool = LuaCEmbed_send_bool; - self.send_double = LuaCEmbed_send_double; - self.send_evaluation_function = LuaCEmbed_send_evaluation; - self.send_long = LuaCEmbed_send_long; - self.send_table = LuaCEmbed_send_table; - self.send_error = LuaCEmbed_send_error; - return self; -} - - -//path: src/namespace/globals/globals.c - - -LuaCEmbedGlobalModule newLuaCEmbedGlobalModule(){ - LuaCEmbedGlobalModule self = {0}; - self.ensure_type = LuaCEmbed_ensure_global_type; - self.get_double = LuaCEmbed_get_global_double; - self.get_string = LuaCEmbed_get_global_string; - self.get_long = LuaCEmbed_get_global_long; - self.get_raw_string = LuaCEmbed_get_global_raw_string; - self.set_raw_string = LuaCEmbed_set_global_raw_string; - self.get_bool = LuaCEmbed_get_global_bool; - self.get_type = LuaCEmbed_get_global_type; - self.run_global_lambda = LuaCEmbed_run_global_lambda; - self.set_table = LuaCEmbed_set_global_table; - self.set_string = LuaCEmbed_set_global_string; - self.set_bool = LuaCEmbed_set_global_bool; - self.set_double = LuaCEmbed_set_global_double; - self.set_long = LuaCEmbed_set_global_long; - self.new_table = LuaCembed_new_global_table; - self.get_table = LuaCembed_get_global_table; - - return self; -} - -//path: src/namespace/args/args.c - - -LuaCembedArgsModule newLuaCembedArgsModule(){ - LuaCembedArgsModule self = {0}; - self.get_bool = LuaCEmbed_get_bool_arg; - self.get_long = LuaCEmbed_get_long_arg; - self.get_double = LuaCEmbed_get_double_arg; - self.get_str = LuaCEmbed_get_str_arg; - self.get_raw_str = LuaCEmbed_get_raw_str_arg; - self.get_type = LuaCEmbed_get_arg_type; - self.get_table = LuaCEmbed_get_arg_table; - self.size = LuaCEmbed_get_total_args; - self.get_type_clojure_evalation = LuaCEmbed_get_type_clojure_evalation; - self.generate_arg_clojure_evalation = LuaCEmbed_generate_arg_clojure_evalation; - self.get_bool_arg_clojure_evalation = LuaCEmbed_get_bool_arg_clojure_evalation; - self.get_long_arg_clojure_evalation = LuaCEmbed_get_long_arg_clojure_evalation; - self.get_double_arg_clojure_evalation = LuaCEmbed_get_double_arg_clojure_evalation; - self.get_string_arg_clojure_evalation = LuaCEmbed_get_string_arg_clojure_evalation; - self.run_lambda = LuaCEmbed_run_args_lambda; - return self; -} - -//path: src/namespace/table/table.c - - -LuaCembedTableModule newLuaCembedTableModule(){ - LuaCembedTableModule self ={0}; - - self.append_string = LuaCEmbedTable_append_string; - self.append_bool = LuaCEmbedTable_append_bool; - self.append_double = LuaCEmbedTable_append_double; - self.append_long = LuaCEmbedTable_append_long; - self.append_table = LuaCEmbedTable_append_table; - self.append_evaluation = LuaCEmbedTable_append_evaluation; - - self.insert_string_at_index = LuaCEmbedTable_insert_string_at_index; - self.insert_double_at_index = LuaCEmbedTable_insert_double_at_index; - self.insert_long_at_index = LuaCEmbedTable_insert_long_at_index; - self.insert_table_at_index = LuaCEmbedTable_insert_table_at_index; - - self.set_evaluation_prop = LuaCEmbedTable_set_evaluation_prop; - self.set_method = LuaCEmbedTable_set_method; - self.set_method = LuaCEmbedTable_set_method; - self.set_bool_prop = LuaCEmbedTable_set_bool_prop; - self.set_double_prop = LuaCEmbedTable_set_double_prop; - self.set_long_prop = LuaCEmbedTable_set_long_prop; - self.set_string_prop = LuaCEmbedTable_set_string_prop; - - self.get_sub_table_prop = LuaCEmbedTable_get_sub_table_by_key; - self.new_sub_table_prop = LuaCEmbedTable_new_sub_table_by_key; - self.set_sub_table_prop = LuaCEmbedTable_set_sub_table_prop; - self.new_anonymous_table = LuaCembed_new_anonymous_table; - - self.set_sub_table_by_index = LuaCEmbedTable_set_sub_table_by_index; - self.get_bool_prop = LuaCembedTable_get_bool_prop; - self.get_double_prop = LuaCembedTable_get_double_prop; - self.get_long_prop = LuaCembedTable_get_long_prop; - self.get_string_prop = LuaCembedTable_get_string_prop; - self.get_type_prop = LuaCEmbedTable_get_type_prop; - self.destroy_prop = LuaCembedTable_destroy_prop; - - self.set_long_by_index = LuaCEmbedTable_set_long_by_index; - self.set_bool_by_index= LuaCEmbedTable_set_bool_by_index; - self.set_double_by_index =LuaCEmbedTable_set_double_by_index; - self.set_string_by_index = LuaCEmbedTable_set_string_by_index; - self.set_evaluation_by_index = LuaCEmbedTable_set_evaluation_by_index; - - self.get_listable_size = LuaCEmbedTable_get_listable_size; - - self.new_sub_table_appending = LuaCEmbedTable_new_sub_table_appending; - self.has_key = LuaCembedTable_has_key_at_index; - self.get_key_by_index = LuaCembedTable_get_key_by_index; - self.get_size = LuaCEmbedTable_get_full_size; - self.get_type_by_index = LuaCEmbedTable_get_type_by_index; - self.get_long_by_index = LuaCEmbedTable_get_long_by_index; - self.get_double_by_index = LuaCEmbedTable_get_double_by_index; - self.get_bool_by_index = LuaCEmbedTable_get_bool_by_index; - self.get_string_by_index= LuaCEmbedTable_get_string_by_index; - self.get_sub_table_by_index = LuaCEmbedTable_get_sub_table_by_index; - return self; -} - - -//path: src/namespace/LuaCEmbedNamespace/LuaCEmbedNamespace.c - - - - - -LuaCEmbedNamespace newLuaCEmbedNamespace(){ - LuaCEmbedNamespace self = {0}; - self.newLuaLib = newLuaCEmbedLib; - self.load_lib_from_c = LuaCEmbed_load_lib_from_c; - self.newLuaEvaluation = newLuaCEmbedEvaluation; - self.set_delete_function = LuaCembed_set_delete_function; - self.perform = LuaCembed_perform; - self.load_native_libs = LuaCEmbed_load_native_libs; - self.set_memory_limit = LuaCEmbed_set_memory_limit; - self.clear_errors = LuaCEmbed_clear_errors; - self.convert_arg_code = LuaCembed_convert_arg_code; - self.tables = newLuaCembedTableModule(); - self.args = newLuaCembedArgsModule(); - self.types = newLuaCEmbedTypeModule(); - self.globals = newLuaCEmbedGlobalModule(); - self.response = newLuaCEmbedResponseModule(); - self.get_error_message = LuaCEmbed_get_error_message; - self.has_errors = LuaCEmbed_has_errors; - self.set_timeout = LuaCEmbed_set_timeout; - self.evaluate = LuaCEmbed_evaluate; - self.get_string_evaluation = LuaCEmbed_get_evaluation_string; - self.get_evaluation_type = LuaCEmbed_get_evaluation_type; - self.get_evaluation_size = LuaCEmbed_get_evaluation_table_size; - self.get_evaluation_long = LuaCEmbed_get_evaluation_long; - self.get_evaluation_double = LuaCEmbed_get_evaluation_double; - self.get_evaluation_bool = LuaCEmbed_get_evaluation_bool; - self.evaluete_file = LuaCEmbed_evaluete_file; - self.add_callback = LuaCEmbed_add_callback; - self.add_global_callback = LuaCEmbed_add_global_callback; - self.set_bool_lib_prop = LuaCEmbed_set_bool_lib_prop; - self.set_long_lib_prop = LuaCEmbed_set_long_lib_prop; - self.set_double_lib_prop = LuaCEmbed_set_double_lib_prop; - self.set_string_lib_prop = LuaCEmbed_set_string_lib_prop; - self.set_table_lib_prop = LuaCEmbed_set_table_lib_prop; - self.get_long_lib_prop = LuaCEmbed_get_long_lib_prop; - self.get_double_lib_prop = LuaCEmbed_get_double_lib_prop; - self.get_bool_lib_prop = LuaCEmbed_get_bool_lib_prop; - self.get_string_lib_prop = LuaCEmbed_get_string_lib_prop; - self.get_table_lib_prop = LuaCEmbed_get_table_lib_prop; - - self.free = LuaCEmbed_free; - return self; -} - - - - - - -#define LUACEMBED_H -#endif \ No newline at end of file diff --git a/LuaCembed.h b/LuaCembed.h deleted file mode 100644 index 659de13..0000000 --- a/LuaCembed.h +++ /dev/null @@ -1,32362 +0,0 @@ -//path: src/one.c - -#ifndef LUACEMBED_H -//path: src/imports/imports.fdefine.h -//path: src/imports/imports.fdeclare.h -//path: src/imports/imports.typesD.h -//path: src/imports/imports.typesC.h -//path: src/imports/imports.typesB.h -//path: src/imports/imports.types.h -//path: src/imports/imports.macros.h -//path: src/imports/imports.consts.h -//path: src/imports/imports.dependencies.h -#ifndef privateluacembed_dependencies -#define privateluacembed_dependencies -//path: src/imports/../dependencies.native.h -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -#ifdef _WIN32 -#include -#else -#include -#include -#endif - - -//path: src/imports/../dependencies/dependencies.all.h -//path: src/imports/../dependencies/UniversalGarbage.h - - - -#ifndef UNIVERSAL_GARBAGE_H - - -#include -#include -#include -#include - - - - - -#define UniversalGarbage_create_empty_struct(name,element_type) \ -(element_type*)malloc(sizeof(element_type)); \ -*name = (element_type){0}; - - -#define UniversalGarbage_cast(value) ((void**)&value) - - -#define UniversalGarbage_add(garbage,deallocator_callback,value) \ - rawUniversalGarbage_add(garbage,(void*)deallocator_callback,UniversalGarbage_cast(value)) - -#define UniversalGarbage_add_simple(garbage,value) \ - UniversalGarbage_add(garbage,free,value) - - -#define UniversalGarbage_add_return(garbage,deallocator_callback,value) \ - UniversalGarbage_add(garbage->return_values,deallocator_callback,value) - - -#define UniversalGarbage_add_simple_return(garbage,value) \ - UniversalGarbage_add_simple(garbage->return_values,value) - - - -#define UniversalGarbage_remove(garbage,value) \ - rawUniversalGarbage_remove(garbage,UniversalGarbage_cast(value)); - - -#define UniversalGarbage_disconnect(garbage,value) \ - rawUniversalGarbage_disconnect(garbage,UniversalGarbage_cast(value)); - - - - -#define UniversalGarbage_reallocate(garbage,value) \ - rawUniversalGarbage_reallocate(garbage,UniversalGarbage_cast(value)) - - -#define UniversalGarbage_resset(garbage,value) \ - rawUniversalGarbage_resset(garbage,UniversalGarbage_cast(value)) - - - - - - -typedef struct privateUniversalGarbageElement{ - void **pointer; - void (*deallocator_callback)(void *element); - void *pointed_value; -}privateUniversalGarbageElement; - -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self); - - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self); - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer); - - - -typedef struct UniversalGarbage{ - - struct UniversalGarbage *return_values; - privateUniversalGarbageElement **elements; - int elements_size; - bool is_the_root; - -}UniversalGarbage; - -UniversalGarbage * newUniversalGarbage(); - -UniversalGarbage * private_new_MainUniversalGarbage(); - - - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer); - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self); - -void UniversalGarbage_free_including_return(UniversalGarbage *self); - -void UniversalGarbage_free(UniversalGarbage *self); - - - - - - - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer){ - - privateUniversalGarbageElement * self = UniversalGarbage_create_empty_struct( - self, - privateUniversalGarbageElement - ); - self->pointer = pointer; - self->deallocator_callback = dealocator_callback; - self->pointed_value = *pointer; - return self; -} -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self){ - if(self->pointed_value){ - self->deallocator_callback(self->pointed_value); - self->pointed_value = NULL; - } -} - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self){ - private_UniversalGarbageSimpleElement_free_pointed_value(self); - free(self); -} - - -UniversalGarbage * private_new_MainUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->is_the_root = false; - return self; -} - -UniversalGarbage * newUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->is_the_root = true; - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->return_values =private_new_MainUniversalGarbage(); - - return self; -} - - - - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - - if(rawUniversalGarbage_reallocate(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - - privateUniversalGarbageElement *current = self->elements[i]; - bool reallocate = current->pointer == pointer; - - if(reallocate){ - current->pointed_value = *pointer; - return true; - } - } - return false; -} - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - if(rawUniversalGarbage_resset(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - bool resset = current->pointer == pointer; - if(resset){ - private_UniversalGarbageSimpleElement_free_pointed_value(current); - current->pointed_value = *pointer; - return true; - } - } - return false; - -} -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_remove(self->return_values,pointer)){ - *pointer = NULL; - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - private_UniversalGarbageSimpleElement_free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - - } - *pointer = NULL; - return true; - } - } - return false; -} -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_disconnect(self->return_values,pointer)){ - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - } - return true; - } - } - return false; - - - -} -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer){ - - if(!pointer){ - return false; - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - return false; - } - } - - self->elements = (privateUniversalGarbageElement**)realloc( - self->elements, - (self->elements_size + 1) * sizeof(privateUniversalGarbageElement*) - ); - void (*dealocator_callback)(void *element); -#ifdef __cplusplus - dealocator_callback =reinterpret_cast(release_callback); -#else - dealocator_callback = (void*)(void*)release_callback; - -#endif - - - - self->elements[self->elements_size] = private_newUniversalGarbageSimpleElement(dealocator_callback, pointer); - self->elements_size+=1; - return true; -} - - - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self){ - for(int i = 0; i < self->elements_size; i++){ - private_UniversalGarbageSimpleElement_free(self->elements[i]); - } - free(self->elements); -} - -void UniversalGarbage_free_including_return(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - if(self->is_the_root){ - UniversalGarbage_free(self->return_values); - } - free(self); -} - -void UniversalGarbage_free(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - - if(self->is_the_root){ - - UniversalGarbage *return_garbage = self->return_values; - for(int i = 0; i < return_garbage->elements_size; i++){ - free(return_garbage->elements[i]); - } - - free(return_garbage->elements); - free(return_garbage); - } - - - free(self); -} - - - - -#define UNIVERSAL_GARBAGE_H -#endif - - - -//path: src/imports/../dependencies/lua/onelua.c - - - -#ifndef MAKE_LIB -#ifndef MAKE_LUAC -#ifndef MAKE_LUA -#define MAKE_LUA -#endif -#endif -#endif -#include -//path: src/imports/../dependencies/lua/custom_math/custom_math.h -double private_lua_cembed_ldexp(double x, int exp); - -double private_lua_cembed_frexp(double x, int *exp); - -double private_lua_cembed_asin(double x); - -double private_lua_cembed_acos(double x); - - -double private_lua_cembed_atan2(double y, double x); - - -double private_lua_cembed_ceil(double x); - - -double private_lua_cembed_sqrt(double x); - -double private_lua_cembed_exp(double x); - -double private_lua_cembed_fabs(double x); - - -double private_lua_cembed_factorial(int n); - -double private_lua_cembed_sin(double x); - - -double private_lua_cembed_cos(double x); - - -double private_lua_cembed_tan(double x); - -double private_lua_cembed_log(double x); - -double private_lua_cembed_log2(double x); - -double private_lua_embed_log10(double x); - -double private_lua_embed_fmod(double x, double y); - -double private_lua_embed_pow(double b, double e); - -double private_lua_embed_floor(double x); - -//path: src/imports/../dependencies/lua/custom_math/custom_math.c -double private_lua_cembed_ldexp(double x, int exp) { - if (x == 0.0) return x; - - while (exp > 0) { - x *= 2.0; - exp--; - } - while (exp < 0) { - x *= 0.5; - exp++; - } - - return x; -} - -double private_lua_cembed_frexp(double x, int *exp) { - *exp = 0; - if (x == 0.0) return x; - - while (x >= 1.0 || x < -1.0) { - x *= 0.5; - (*exp)++; - } - while (x < 0.5 && x != 0.0) { - x /= 0.5; - (*exp)--; - } - - return x; -} -double private_lua_cembed_asin(double x) { - if (x <= -1.0 || x >= 1.0) { - return x / 0.0; // Retorna NaN para x fora do intervalo [-1, 1] - } - - return private_lua_cembed_atan2(x, private_lua_cembed_sqrt(1.0 - x * x)); -} - -double private_lua_cembed_acos(double x) { - if (x <= -1.0 || x >= 1.0) { - return x / 0.0; // Retorna NaN para x fora do intervalo [-1, 1] - } - - return 1.5707963267948966 - private_lua_cembed_asin(x); -} - -double private_lua_cembed_atan2(double y, double x) { - if (x == 0.0 && y == 0.0) { - return y / x; // Retorna NaN para x = 0 e y = 0 - } - - double abs_y = private_lua_cembed_fabs(y); - double angle; - if (x >= 0.0) { - double r = (x - abs_y) / (x + abs_y); - angle = 0.7853981633974483 - 0.7853981633974483 * r; - } else { - double r = (x + abs_y) / (abs_y - x); - angle = 2.356194490192345 + 0.7853981633974483 * r; - } - if (y < 0.0) { - return -angle; - } else { - return angle; - } -} - -double private_lua_cembed_ceil(double x) { - double f = private_lua_embed_floor(x); - if (f >= x) { - return f; - } else { - return f + 1.0; - } -} - -double private_lua_cembed_sqrt(double x) { - if (x < 0.0) { - return x / 0.0; // Retorna NaN para x < 0 - } - - double x_half = 0.5 * x; - long i = *(long*)&x; - i = 0x5fe6ec85e7de30da - (i >> 1); - x = *(double*)&i; - x = x * (1.5 - x_half * x * x); - - return 1.0 / x; -} - -double private_lua_cembed_exp(double x) { - double result = 1.0; - double term = 1.0; - int i = 1; - - while (term > 1.0e-15) { - term *= x / i; - result += term; - i++; - } - - return result; -} - -double private_lua_cembed_fabs(double x) { - return x < 0.0 ? -x : x; -} - -double private_lua_cembed_factorial(int n) { - if (n <= 1) { - return 1.0; - } - double result = 1.0; - for (int i = 2; i <= n; ++i) { - result *= i; - } - return result; -} - -double private_lua_cembed_sin(double x) { - double result = 0.0; - int n = 0; - double term = x; - double current_term = term; - double term_squared = term * term; - - while (current_term > 1.0e-15) { - result += current_term; - n += 2; - term *= -term_squared / ((n + 1) * (n + 2)); - current_term = term / private_lua_cembed_factorial(n); - } - - return result; -} - -double private_lua_cembed_cos(double x) { - double result = 0.0; - int n = 0; - double term = 1.0; - double current_term = term; - double term_squared = term * term; - - while (current_term > 1.0e-15) { - result += current_term; - n += 2; - term *= -term_squared / (n * (n + 1)); - current_term = term / private_lua_cembed_factorial(n); - } - - return result; -} - -double private_lua_cembed_tan(double x) { - return private_lua_cembed_sin(x) / private_lua_cembed_cos(x); -} - -double private_lua_cembed_log(double x) { - if (x <= 0.0) { - return -1.0 / 0.0; - } - - double result = 0.0; - double term = (x - 1) / (x + 1); - double current_term = term; - double term_squared = term * term; - int n = 1; - - while (current_term > 1.0e-15) { - result += current_term / n; - current_term *= term_squared; - n += 2; - } - - result *= 2.302585092994046; - return result; -} - -double private_lua_cembed_log2(double x) { - if (x <= 0.0) { - return -1.0 / 0.0; - } - - return private_lua_cembed_log(x) / private_lua_cembed_log(2.0); -} - -double private_lua_embed_log10(double x) { - if (x <= 0.0) { - return -1.0 / 0.0; - } - - return private_lua_cembed_log(x) / private_lua_cembed_log(10.0); -} - -double private_lua_embed_fmod(double x, double y) { - while (y != 0.0) { - while (x >= y) { - x -= y; - } - if (x < y) { - return x; - } - } - return 0.0 / 0.0; -} - -double private_lua_embed_pow(double b, double e) { - double result = 1.0; - int i; - - if (e == 0.0) { - return 1.0; - } - if (e < 0.0) { - b = 1.0 / b; - e = -e; - } - - for (i = 0; i < e; i++) { - result *= b; - } - - return result; -} - -double private_lua_embed_floor(double x) { - int i = (int)x; - - if (x == (double)i) { - return x; - } - - if (x < 0.0) { - return (double)(i - 1); - } - - return (double)i; -} - - - -#if 0 -#define LUA_USE_LINUX -#define LUA_USE_MACOSX -#define LUA_USE_POSIX -#define LUA_ANSI -#endif - - - - -//path: src/imports/../dependencies/lua/lprefix.h - - -#ifndef lprefix_h -#define lprefix_h - - - -#if !defined(LUA_USE_C89) - -#if !defined(_XOPEN_SOURCE) -#define _XOPEN_SOURCE 600 -#elif _XOPEN_SOURCE == 0 -#undef _XOPEN_SOURCE -#endif - - -#if !defined(LUA_32BITS) && !defined(_FILE_OFFSET_BITS) -#define _LARGEFILE_SOURCE 1 -#define _FILE_OFFSET_BITS 64 -#endif - -#endif - - - -#if defined(_WIN32) - -#if !defined(_CRT_SECURE_NO_WARNINGS) -#define _CRT_SECURE_NO_WARNINGS -#endif - -#endif - -#endif - - - - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -#ifdef _WIN32 -#include -#else -#include -#include -#endif - - -#define LUA_CORE -#define LUA_LIB -#define ltable_c -#define lvm_c -//path: src/imports/../dependencies/lua/luaconf.h - - - -#ifndef luaconf_h -#define luaconf_h - -#include -#include - - - - - - - - - - - - -#if !defined(LUA_USE_C89) && defined(_WIN32) && !defined(_WIN32_WCE) -#define LUA_USE_WINDOWS -#endif - - -#if defined(LUA_USE_WINDOWS) -#define LUA_DL_DLL -#define LUA_USE_C89 -#endif - - -#if defined(LUA_USE_LINUX) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN -#endif - - -#if defined(LUA_USE_MACOSX) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN -#endif - - -#if defined(LUA_USE_IOS) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN -#endif - - - -#define LUAI_IS32INT ((UINT_MAX >> 30) >= 3) - - - - - - - - - - -#define LUA_INT_INT 1 -#define LUA_INT_LONG 2 -#define LUA_INT_LONGLONG 3 - - -#define LUA_FLOAT_FLOAT 1 -#define LUA_FLOAT_DOUBLE 2 -#define LUA_FLOAT_LONGDOUBLE 3 - - - -#define LUA_INT_DEFAULT LUA_INT_LONGLONG -#define LUA_FLOAT_DEFAULT LUA_FLOAT_DOUBLE - - - -#define LUA_32BITS 0 - - - -#if defined(LUA_USE_C89) && !defined(LUA_USE_WINDOWS) -#define LUA_C89_NUMBERS 1 -#else -#define LUA_C89_NUMBERS 0 -#endif - - -#if LUA_32BITS - -#if LUAI_IS32INT -#define LUA_INT_TYPE LUA_INT_INT -#else -#define LUA_INT_TYPE LUA_INT_LONG -#endif -#define LUA_FLOAT_TYPE LUA_FLOAT_FLOAT - -#elif LUA_C89_NUMBERS - -#define LUA_INT_TYPE LUA_INT_LONG -#define LUA_FLOAT_TYPE LUA_FLOAT_DOUBLE - -#else - - -#define LUA_INT_TYPE LUA_INT_DEFAULT -#define LUA_FLOAT_TYPE LUA_FLOAT_DEFAULT - -#endif - - - - - - - - - -#define LUA_PATH_SEP ";" -#define LUA_PATH_MARK "?" -#define LUA_EXEC_DIR "!" - - - - -#define LUA_VDIR LUA_VERSION_MAJOR "." LUA_VERSION_MINOR -#if defined(_WIN32) - -#define LUA_LDIR "!\\lua\\" -#define LUA_CDIR "!\\" -#define LUA_SHRDIR "!\\..\\share\\lua\\" LUA_VDIR "\\" - -#if !defined(LUA_PATH_DEFAULT) -#define LUA_PATH_DEFAULT \ - LUA_LDIR"?.lua;" LUA_LDIR"?\\init.lua;" \ - LUA_CDIR"?.lua;" LUA_CDIR"?\\init.lua;" \ - LUA_SHRDIR"?.lua;" LUA_SHRDIR"?\\init.lua;" \ - ".\\?.lua;" ".\\?\\init.lua" -#endif - -#if !defined(LUA_CPATH_DEFAULT) -#define LUA_CPATH_DEFAULT \ - LUA_CDIR"?.dll;" \ - LUA_CDIR"..\\lib\\lua\\" LUA_VDIR "\\?.dll;" \ - LUA_CDIR"loadall.dll;" ".\\?.dll" -#endif - -#else - -#define LUA_ROOT "/usr/local/" -#define LUA_LDIR LUA_ROOT "share/lua/" LUA_VDIR "/" -#define LUA_CDIR LUA_ROOT "lib/lua/" LUA_VDIR "/" - -#if !defined(LUA_PATH_DEFAULT) -#define LUA_PATH_DEFAULT \ - LUA_LDIR"?.lua;" LUA_LDIR"?/init.lua;" \ - LUA_CDIR"?.lua;" LUA_CDIR"?/init.lua;" \ - "./?.lua;" "./?/init.lua" -#endif - -#if !defined(LUA_CPATH_DEFAULT) -#define LUA_CPATH_DEFAULT \ - LUA_CDIR"?.so;" LUA_CDIR"loadall.so;" "./?.so" -#endif - -#endif - - - -#if !defined(LUA_DIRSEP) - -#if defined(_WIN32) -#define LUA_DIRSEP "\\" -#else -#define LUA_DIRSEP "/" -#endif - -#endif - - - -#define LUA_IGMARK "-" - - - - - - - -#if defined(LUA_BUILD_AS_DLL) - -#if defined(LUA_CORE) || defined(LUA_LIB) -#define LUA_API __declspec(dllexport) -#else -#define LUA_API __declspec(dllimport) -#endif - -#else - -#define LUA_API extern - -#endif - - - -#define LUALIB_API LUA_API -#define LUAMOD_API LUA_API - - - -#if defined(__GNUC__) && ((__GNUC__*100 + __GNUC_MINOR__) >= 302) && \ - defined(__ELF__) -#define LUAI_FUNC __attribute__((visibility("internal"))) extern -#else -#define LUAI_FUNC extern -#endif - -#define LUAI_DDEC(dec) LUAI_FUNC dec -#define LUAI_DDEF - - - - - - - -#if defined(LUA_COMPAT_5_3) - - -#define LUA_COMPAT_MATHLIB - - -#define LUA_COMPAT_APIINTCASTS - - - -#define LUA_COMPAT_LT_LE - - - -#define lua_strlen(L,i) lua_rawlen(L, (i)) - -#define lua_objlen(L,i) lua_rawlen(L, (i)) - -#define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ) -#define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT) - -#endif - - - - - - - - - - - - -#define l_floor(x) (l_mathop(private_lua_embed_floor)(x)) - -#define lua_number2str(s,sz,n) \ - l_sprintf((s), sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)(n)) - - -#define lua_numbertointeger(n,p) \ - ((n) >= (LUA_NUMBER)(LUA_MININTEGER) && \ - (n) < -(LUA_NUMBER)(LUA_MININTEGER) && \ - (*(p) = (LUA_INTEGER)(n), 1)) - - - - -#if LUA_FLOAT_TYPE == LUA_FLOAT_FLOAT - -#define LUA_NUMBER float - -#define l_floatatt(n) (FLT_##n) - -#define LUAI_UACNUMBER double - -#define LUA_NUMBER_FRMLEN "" -#define LUA_NUMBER_FMT "%.7g" - -#define l_mathop(op) op##f - -#define lua_str2number(s,p) strtof((s), (p)) - - -#elif LUA_FLOAT_TYPE == LUA_FLOAT_LONGDOUBLE - -#define LUA_NUMBER long double - -#define l_floatatt(n) (LDBL_##n) - -#define LUAI_UACNUMBER long double - -#define LUA_NUMBER_FRMLEN "L" -#define LUA_NUMBER_FMT "%.19Lg" - -#define l_mathop(op) op##l - -#define lua_str2number(s,p) strtold((s), (p)) - -#elif LUA_FLOAT_TYPE == LUA_FLOAT_DOUBLE - -#define LUA_NUMBER double - -#define l_floatatt(n) (DBL_##n) - -#define LUAI_UACNUMBER double - -#define LUA_NUMBER_FRMLEN "" -#define LUA_NUMBER_FMT "%.14g" - -#define l_mathop(op) op - -#define lua_str2number(s,p) strtod((s), (p)) - -#else - -#error "numeric float type not defined" - -#endif - - - - - - - - -#define LUA_INTEGER_FMT "%" LUA_INTEGER_FRMLEN "d" - -#define LUAI_UACINT LUA_INTEGER - -#define lua_integer2str(s,sz,n) \ - l_sprintf((s), sz, LUA_INTEGER_FMT, (LUAI_UACINT)(n)) - - -#define LUA_UNSIGNED unsigned LUAI_UACINT - - - - -#if LUA_INT_TYPE == LUA_INT_INT - -#define LUA_INTEGER int -#define LUA_INTEGER_FRMLEN "" - -#define LUA_MAXINTEGER INT_MAX -#define LUA_MININTEGER INT_MIN - -#define LUA_MAXUNSIGNED UINT_MAX - -#elif LUA_INT_TYPE == LUA_INT_LONG - -#define LUA_INTEGER long -#define LUA_INTEGER_FRMLEN "l" - -#define LUA_MAXINTEGER LONG_MAX -#define LUA_MININTEGER LONG_MIN - -#define LUA_MAXUNSIGNED ULONG_MAX - -#elif LUA_INT_TYPE == LUA_INT_LONGLONG - - -#if defined(LLONG_MAX) - - -#define LUA_INTEGER long long -#define LUA_INTEGER_FRMLEN "ll" - -#define LUA_MAXINTEGER LLONG_MAX -#define LUA_MININTEGER LLONG_MIN - -#define LUA_MAXUNSIGNED ULLONG_MAX - -#elif defined(LUA_USE_WINDOWS) - - -#define LUA_INTEGER __int64 -#define LUA_INTEGER_FRMLEN "I64" - -#define LUA_MAXINTEGER _I64_MAX -#define LUA_MININTEGER _I64_MIN - -#define LUA_MAXUNSIGNED _UI64_MAX - -#else - -#error "Compiler does not support 'long long'. Use option '-DLUA_32BITS' \ - or '-DLUA_C89_NUMBERS' (see file 'luaconf.h' for details)" - -#endif - -#else - -#error "numeric integer type not defined" - -#endif - - - - - - - -#if !defined(LUA_USE_C89) -#define l_sprintf(s,sz,f,i) snprintf(s,sz,f,i) -#else -#define l_sprintf(s,sz,f,i) ((void)(sz), sprintf(s,f,i)) -#endif - - - -#if !defined(LUA_USE_C89) -#define lua_strx2number(s,p) lua_str2number(s,p) -#endif - - - -#define lua_pointer2str(buff,sz,p) l_sprintf(buff,sz,"%p",p) - - - -#if !defined(LUA_USE_C89) -#define lua_number2strx(L,b,sz,f,n) \ - ((void)L, l_sprintf(b,sz,f,(LUAI_UACNUMBER)(n))) -#endif - - - -#if defined(LUA_USE_C89) || (defined(HUGE_VAL) && !defined(HUGE_VALF)) -#undef l_mathop -#undef lua_str2number -#define l_mathop(op) (lua_Number)op -#define lua_str2number(s,p) ((lua_Number)strtod((s), (p))) -#endif - - - -#define LUA_KCONTEXT ptrdiff_t - -#if !defined(LUA_USE_C89) && defined(__STDC_VERSION__) && \ - __STDC_VERSION__ >= 199901L -#include -#if defined(INTPTR_MAX) -#undef LUA_KCONTEXT -#define LUA_KCONTEXT intptr_t -#endif -#endif - - - -#if !defined(lua_getlocaledecpoint) -#define lua_getlocaledecpoint() (localeconv()->decimal_point[0]) -#endif - - - -#if !defined(luai_likely) - -#if defined(__GNUC__) && !defined(LUA_NOBUILTIN) -#define luai_likely(x) (__builtin_expect(((x) != 0), 1)) -#define luai_unlikely(x) (__builtin_expect(((x) != 0), 0)) -#else -#define luai_likely(x) (x) -#define luai_unlikely(x) (x) -#endif - -#endif - - -#if defined(LUA_CORE) || defined(LUA_LIB) - -#define l_likely(x) luai_likely(x) -#define l_unlikely(x) luai_unlikely(x) -#endif - - - - - - - - - - - - - - -#if defined(LUA_USE_APICHECK) -#include -#define luai_apicheck(l,e) assert(e) -#endif - - - - - - - -#if LUAI_IS32INT -#define LUAI_MAXSTACK 1000000 -#else -#define LUAI_MAXSTACK 15000 -#endif - - - -#define LUA_EXTRASPACE (sizeof(void *)) - - - -#define LUA_IDSIZE 60 - - - -#define LUAL_BUFFERSIZE ((int)(16 * sizeof(void*) * sizeof(lua_Number))) - - - -#define LUAI_MAXALIGN lua_Number n; double u; void *s; lua_Integer i; long l - - - - - - - - - - - - - - - -#endif - - - - - -#undef LUAI_FUNC -#undef LUAI_DDEC -#undef LUAI_DDEF -#define LUAI_FUNC static -#define LUAI_DDEC(def) -#define LUAI_DDEF static - - -//path: src/imports/../dependencies/lua/lzio.c - - -#define lzio_c -#define LUA_CORE - - - -#include - -//path: src/imports/../dependencies/lua/lua.h - - - -#ifndef lua_h -#define lua_h - -#include -#include - - -#define LUA_COPYRIGHT LUA_RELEASE " Copyright (C) 1994-2023 Lua.org, PUC-Rio" -#define LUA_AUTHORS "R. Ierusalimschy, L. H. de Figueiredo, W. Celes" - - -#define LUA_VERSION_MAJOR_N 5 -#define LUA_VERSION_MINOR_N 5 -#define LUA_VERSION_RELEASE_N 0 - -#define LUA_VERSION_NUM (LUA_VERSION_MAJOR_N * 100 + LUA_VERSION_MINOR_N) -#define LUA_VERSION_RELEASE_NUM (LUA_VERSION_NUM * 100 + LUA_VERSION_RELEASE_N) - - - - - - - -#define LUA_SIGNATURE "\x1bLua" - - -#define LUA_MULTRET (-1) - - - -#define LUA_REGISTRYINDEX (-LUAI_MAXSTACK - 1000) -#define lua_upvalueindex(i) (LUA_REGISTRYINDEX - (i)) - - - -#define LUA_OK 0 -#define LUA_YIELD 1 -#define LUA_ERRRUN 2 -#define LUA_ERRSYNTAX 3 -#define LUA_ERRMEM 4 -#define LUA_ERRERR 5 - - -typedef struct lua_State lua_State; - - - -#define LUA_TNONE (-1) - -#define LUA_TNIL 0 -#define LUA_TBOOLEAN 1 -#define LUA_TLIGHTUSERDATA 2 -#define LUA_TNUMBER 3 -#define LUA_TSTRING 4 -#define LUA_TTABLE 5 -#define LUA_TFUNCTION 6 -#define LUA_TUSERDATA 7 -#define LUA_TTHREAD 8 - -#define LUA_NUMTYPES 9 - - - - -#define LUA_MINSTACK 20 - - - - -#define LUA_RIDX_GLOBALS 2 -#define LUA_RIDX_MAINTHREAD 3 -#define LUA_RIDX_LAST 3 - - - -typedef LUA_NUMBER lua_Number; - - - -typedef LUA_INTEGER lua_Integer; - - -typedef LUA_UNSIGNED lua_Unsigned; - - -typedef LUA_KCONTEXT lua_KContext; - - - -typedef int (*lua_CFunction) (lua_State *L); - - -typedef int (*lua_KFunction) (lua_State *L, int status, lua_KContext ctx); - - - -typedef const char * (*lua_Reader) (lua_State *L, void *ud, size_t *sz); - -typedef int (*lua_Writer) (lua_State *L, const void *p, size_t sz, void *ud); - - - -typedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize); - - - -typedef void (*lua_WarnFunction) (void *ud, const char *msg, int tocont); - - - -typedef struct lua_Debug lua_Debug; - - - -typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar); - - - - -extern const char lua_ident[]; - - - -LUA_API lua_State *(lua_newstate) (lua_Alloc f, void *ud, unsigned seed); -LUA_API void (lua_close) (lua_State *L); -LUA_API lua_State *(lua_newthread) (lua_State *L); -LUA_API int (lua_closethread) (lua_State *L, lua_State *from); - -LUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf); - - -LUA_API lua_Number (lua_version) (lua_State *L); - - - -LUA_API int (lua_absindex) (lua_State *L, int idx); -LUA_API int (lua_gettop) (lua_State *L); -LUA_API void (lua_settop) (lua_State *L, int idx); -LUA_API void (lua_pushvalue) (lua_State *L, int idx); -LUA_API void (lua_rotate) (lua_State *L, int idx, int n); -LUA_API void (lua_copy) (lua_State *L, int fromidx, int toidx); -LUA_API int (lua_checkstack) (lua_State *L, int n); - -LUA_API void (lua_xmove) (lua_State *from, lua_State *to, int n); - - - - -LUA_API int (lua_isnumber) (lua_State *L, int idx); -LUA_API int (lua_isstring) (lua_State *L, int idx); -LUA_API int (lua_iscfunction) (lua_State *L, int idx); -LUA_API int (lua_isinteger) (lua_State *L, int idx); -LUA_API int (lua_isuserdata) (lua_State *L, int idx); -LUA_API int (lua_type) (lua_State *L, int idx); -LUA_API const char *(lua_typename) (lua_State *L, int tp); - -LUA_API lua_Number (lua_tonumberx) (lua_State *L, int idx, int *isnum); -LUA_API lua_Integer (lua_tointegerx) (lua_State *L, int idx, int *isnum); -LUA_API int (lua_toboolean) (lua_State *L, int idx); -LUA_API const char *(lua_tolstring) (lua_State *L, int idx, size_t *len); -LUA_API lua_Unsigned (lua_rawlen) (lua_State *L, int idx); -LUA_API lua_CFunction (lua_tocfunction) (lua_State *L, int idx); -LUA_API void *(lua_touserdata) (lua_State *L, int idx); -LUA_API lua_State *(lua_tothread) (lua_State *L, int idx); -LUA_API const void *(lua_topointer) (lua_State *L, int idx); - - - - -#define LUA_OPADD 0 -#define LUA_OPSUB 1 -#define LUA_OPMUL 2 -#define LUA_OPMOD 3 -#define LUA_OPPOW 4 -#define LUA_OPDIV 5 -#define LUA_OPIDIV 6 -#define LUA_OPBAND 7 -#define LUA_OPBOR 8 -#define LUA_OPBXOR 9 -#define LUA_OPSHL 10 -#define LUA_OPSHR 11 -#define LUA_OPUNM 12 -#define LUA_OPBNOT 13 - -LUA_API void (lua_arith) (lua_State *L, int op); - -#define LUA_OPEQ 0 -#define LUA_OPLT 1 -#define LUA_OPLE 2 - -LUA_API int (lua_rawequal) (lua_State *L, int idx1, int idx2); -LUA_API int (lua_compare) (lua_State *L, int idx1, int idx2, int op); - - - -LUA_API void (lua_pushnil) (lua_State *L); -LUA_API void (lua_pushnumber) (lua_State *L, lua_Number n); -LUA_API void (lua_pushinteger) (lua_State *L, lua_Integer n); -LUA_API const char *(lua_pushlstring) (lua_State *L, const char *s, size_t len); -LUA_API const char *(lua_pushextlstring) (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud); -LUA_API const char *(lua_pushstring) (lua_State *L, const char *s); -LUA_API const char *(lua_pushvfstring) (lua_State *L, const char *fmt, - va_list argp); -LUA_API const char *(lua_pushfstring) (lua_State *L, const char *fmt, ...); -LUA_API void (lua_pushcclosure) (lua_State *L, lua_CFunction fn, int n); -LUA_API void (lua_pushboolean) (lua_State *L, int b); -LUA_API void (lua_pushlightuserdata) (lua_State *L, void *p); -LUA_API int (lua_pushthread) (lua_State *L); - - - -LUA_API int (lua_getglobal) (lua_State *L, const char *name); -LUA_API int (lua_gettable) (lua_State *L, int idx); -LUA_API int (lua_getfield) (lua_State *L, int idx, const char *k); -LUA_API int (lua_geti) (lua_State *L, int idx, lua_Integer n); -LUA_API int (lua_rawget) (lua_State *L, int idx); -LUA_API int (lua_rawgeti) (lua_State *L, int idx, lua_Integer n); -LUA_API int (lua_rawgetp) (lua_State *L, int idx, const void *p); - -LUA_API void (lua_createtable) (lua_State *L, unsigned narr, unsigned nrec); -LUA_API void *(lua_newuserdatauv) (lua_State *L, size_t sz, int nuvalue); -LUA_API int (lua_getmetatable) (lua_State *L, int objindex); -LUA_API int (lua_getiuservalue) (lua_State *L, int idx, int n); - - - -LUA_API void (lua_setglobal) (lua_State *L, const char *name); -LUA_API void (lua_settable) (lua_State *L, int idx); -LUA_API void (lua_setfield) (lua_State *L, int idx, const char *k); -LUA_API void (lua_seti) (lua_State *L, int idx, lua_Integer n); -LUA_API void (lua_rawset) (lua_State *L, int idx); -LUA_API void (lua_rawseti) (lua_State *L, int idx, lua_Integer n); -LUA_API void (lua_rawsetp) (lua_State *L, int idx, const void *p); -LUA_API int (lua_setmetatable) (lua_State *L, int objindex); -LUA_API int (lua_setiuservalue) (lua_State *L, int idx, int n); - - - -LUA_API void (lua_callk) (lua_State *L, int nargs, int nresults, - lua_KContext ctx, lua_KFunction k); -#define lua_call(L,n,r) lua_callk(L, (n), (r), 0, NULL) - -LUA_API int (lua_pcallk) (lua_State *L, int nargs, int nresults, int errfunc, - lua_KContext ctx, lua_KFunction k); -#define lua_pcall(L,n,r,f) lua_pcallk(L, (n), (r), (f), 0, NULL) - -LUA_API int (lua_load) (lua_State *L, lua_Reader reader, void *dt, - const char *chunkname, const char *mode); - -LUA_API int (lua_dump) (lua_State *L, lua_Writer writer, void *data, int strip); - - - -LUA_API int (lua_yieldk) (lua_State *L, int nresults, lua_KContext ctx, - lua_KFunction k); -LUA_API int (lua_resume) (lua_State *L, lua_State *from, int narg, - int *nres); -LUA_API int (lua_status) (lua_State *L); -LUA_API int (lua_isyieldable) (lua_State *L); - -#define lua_yield(L,n) lua_yieldk(L, (n), 0, NULL) - - - -LUA_API void (lua_setwarnf) (lua_State *L, lua_WarnFunction f, void *ud); -LUA_API void (lua_warning) (lua_State *L, const char *msg, int tocont); - - - - -#define LUA_GCSTOP 0 -#define LUA_GCRESTART 1 -#define LUA_GCCOLLECT 2 -#define LUA_GCCOUNT 3 -#define LUA_GCCOUNTB 4 -#define LUA_GCSTEP 5 -#define LUA_GCISRUNNING 6 -#define LUA_GCGEN 7 -#define LUA_GCINC 8 -#define LUA_GCPARAM 9 - - - - -#define LUA_GCPMINORMUL 0 -#define LUA_GCPMAJORMINOR 1 -#define LUA_GCPMINORMAJOR 2 - - -#define LUA_GCPPAUSE 3 -#define LUA_GCPSTEPMUL 4 -#define LUA_GCPSTEPSIZE 5 - - -#define LUA_GCPN 6 - - -LUA_API int (lua_gc) (lua_State *L, int what, ...); - - - - -LUA_API int (lua_error) (lua_State *L); - -LUA_API int (lua_next) (lua_State *L, int idx); - -LUA_API void (lua_concat) (lua_State *L, int n); -LUA_API void (lua_len) (lua_State *L, int idx); - -LUA_API size_t (lua_stringtonumber) (lua_State *L, const char *s); - -LUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud); -LUA_API void (lua_setallocf) (lua_State *L, lua_Alloc f, void *ud); - -LUA_API void (lua_toclose) (lua_State *L, int idx); -LUA_API void (lua_closeslot) (lua_State *L, int idx); - - - - -#define lua_getextraspace(L) ((void *)((char *)(L) - LUA_EXTRASPACE)) - -#define lua_tonumber(L,i) lua_tonumberx(L,(i),NULL) -#define lua_tointeger(L,i) lua_tointegerx(L,(i),NULL) - -#define lua_pop(L,n) lua_settop(L, -(n)-1) - -#define lua_newtable(L) lua_createtable(L, 0, 0) - -#define lua_register(L,n,f) (lua_pushcfunction(L, (f)), lua_setglobal(L, (n))) - -#define lua_pushcfunction(L,f) lua_pushcclosure(L, (f), 0) - -#define lua_isfunction(L,n) (lua_type(L, (n)) == LUA_TFUNCTION) -#define lua_istable(L,n) (lua_type(L, (n)) == LUA_TTABLE) -#define lua_islightuserdata(L,n) (lua_type(L, (n)) == LUA_TLIGHTUSERDATA) -#define lua_isnil(L,n) (lua_type(L, (n)) == LUA_TNIL) -#define lua_isboolean(L,n) (lua_type(L, (n)) == LUA_TBOOLEAN) -#define lua_isthread(L,n) (lua_type(L, (n)) == LUA_TTHREAD) -#define lua_isnone(L,n) (lua_type(L, (n)) == LUA_TNONE) -#define lua_isnoneornil(L, n) (lua_type(L, (n)) <= 0) - -#define lua_pushliteral(L, s) lua_pushstring(L, "" s) - -#define lua_pushglobaltable(L) \ - ((void)lua_rawgeti(L, LUA_REGISTRYINDEX, LUA_RIDX_GLOBALS)) - -#define lua_tostring(L,i) lua_tolstring(L, (i), NULL) - - -#define lua_insert(L,idx) lua_rotate(L, (idx), 1) - -#define lua_remove(L,idx) (lua_rotate(L, (idx), -1), lua_pop(L, 1)) - -#define lua_replace(L,idx) (lua_copy(L, -1, (idx)), lua_pop(L, 1)) - - - - - -#if defined(LUA_COMPAT_APIINTCASTS) - -#define lua_pushunsigned(L,n) lua_pushinteger(L, (lua_Integer)(n)) -#define lua_tounsignedx(L,i,is) ((lua_Unsigned)lua_tointegerx(L,i,is)) -#define lua_tounsigned(L,i) lua_tounsignedx(L,(i),NULL) - -#endif - -#define lua_newuserdata(L,s) lua_newuserdatauv(L,s,1) -#define lua_getuservalue(L,idx) lua_getiuservalue(L,idx,1) -#define lua_setuservalue(L,idx) lua_setiuservalue(L,idx,1) - -#define lua_resetthread(L) lua_closethread(L,NULL) - - - - - - - -#define LUA_HOOKCALL 0 -#define LUA_HOOKRET 1 -#define LUA_HOOKLINE 2 -#define LUA_HOOKCOUNT 3 -#define LUA_HOOKTAILCALL 4 - - - -#define LUA_MASKCALL (1 << LUA_HOOKCALL) -#define LUA_MASKRET (1 << LUA_HOOKRET) -#define LUA_MASKLINE (1 << LUA_HOOKLINE) -#define LUA_MASKCOUNT (1 << LUA_HOOKCOUNT) - - -LUA_API int (lua_getstack) (lua_State *L, int level, lua_Debug *ar); -LUA_API int (lua_getinfo) (lua_State *L, const char *what, lua_Debug *ar); -LUA_API const char *(lua_getlocal) (lua_State *L, const lua_Debug *ar, int n); -LUA_API const char *(lua_setlocal) (lua_State *L, const lua_Debug *ar, int n); -LUA_API const char *(lua_getupvalue) (lua_State *L, int funcindex, int n); -LUA_API const char *(lua_setupvalue) (lua_State *L, int funcindex, int n); - -LUA_API void *(lua_upvalueid) (lua_State *L, int fidx, int n); -LUA_API void (lua_upvaluejoin) (lua_State *L, int fidx1, int n1, - int fidx2, int n2); - -LUA_API void (lua_sethook) (lua_State *L, lua_Hook func, int mask, int count); -LUA_API lua_Hook (lua_gethook) (lua_State *L); -LUA_API int (lua_gethookmask) (lua_State *L); -LUA_API int (lua_gethookcount) (lua_State *L); - - -struct lua_Debug { - int event; - const char *name; - const char *namewhat; - const char *what; - const char *source; - size_t srclen; - int currentline; - int linedefined; - int lastlinedefined; - unsigned char nups; - unsigned char nparams; - char isvararg; - char istailcall; - unsigned short ftransfer; - unsigned short ntransfer; - char short_src[LUA_IDSIZE]; - - struct CallInfo *i_ci; -}; - - - - -#define LUAI_TOSTRAUX(x) #x -#define LUAI_TOSTR(x) LUAI_TOSTRAUX(x) - -#define LUA_VERSION_MAJOR LUAI_TOSTR(LUA_VERSION_MAJOR_N) -#define LUA_VERSION_MINOR LUAI_TOSTR(LUA_VERSION_MINOR_N) -#define LUA_VERSION_RELEASE LUAI_TOSTR(LUA_VERSION_RELEASE_N) - -#define LUA_VERSION "Lua " LUA_VERSION_MAJOR "." LUA_VERSION_MINOR -#define LUA_RELEASE LUA_VERSION "." LUA_VERSION_RELEASE - - - - - -#endif - - - -//path: src/imports/../dependencies/lua/llimits.h - - -#ifndef llimits_h -#define llimits_h - - -#include -#include - - - - - - - -#if defined(LUAI_MEM) -typedef LUAI_UMEM lu_mem; -typedef LUAI_MEM l_obj; -#elif LUAI_IS32INT -typedef size_t lu_mem; -typedef ptrdiff_t l_obj; -#else -typedef unsigned long lu_mem; -typedef long l_obj; -#endif - -#define MAX_LOBJ \ - cast(l_obj, (cast(lu_mem, 1) << (sizeof(l_obj) * CHAR_BIT - 1)) - 1) - - - -typedef unsigned char lu_byte; -typedef signed char ls_byte; - - - -#define MAX_SIZET ((size_t)(~(size_t)0)) - - -#define MAX_SIZE (sizeof(size_t) < sizeof(lua_Integer) ? MAX_SIZET \ - : (size_t)(LUA_MAXINTEGER)) - - -#define MAX_INT INT_MAX - - - -#define log2maxs(t) cast_int(sizeof(t) * 8 - 2) - - - -#define ispow2(x) (((x) & ((x) - 1)) == 0) - - - -#define LL(x) (sizeof(x)/sizeof(char) - 1) - - - -#if !defined(LUA_USE_C89) && defined(__STDC_VERSION__) && \ - __STDC_VERSION__ >= 199901L -#include -#if defined(UINTPTR_MAX) -#define L_P2I uintptr_t -#else -#define L_P2I uintmax_t -#endif -#else -#define L_P2I size_t -#endif - -#define point2uint(p) cast_uint((L_P2I)(p) & UINT_MAX) - - - - -typedef LUAI_UACNUMBER l_uacNumber; -typedef LUAI_UACINT l_uacInt; - - - -#if defined LUAI_ASSERT -#undef NDEBUG -#include -#define lua_assert(c) assert(c) -#endif - -#if defined(lua_assert) -#define check_exp(c,e) (lua_assert(c), (e)) - -#define lua_longassert(c) ((c) ? (void)0 : lua_assert(0)) -#else -#define lua_assert(c) ((void)0) -#define check_exp(c,e) (e) -#define lua_longassert(c) ((void)0) -#endif - - -#if !defined(luai_apicheck) -#define luai_apicheck(l,e) ((void)l, lua_assert(e)) -#endif - -#define api_check(l,e,msg) luai_apicheck(l,(e) && msg) - - - -#if !defined(UNUSED) -#define UNUSED(x) ((void)(x)) -#endif - - - -#define cast(t, exp) ((t)(exp)) - -#define cast_void(i) cast(void, (i)) -#define cast_voidp(i) cast(void *, (i)) -#define cast_num(i) cast(lua_Number, (i)) -#define cast_int(i) cast(int, (i)) -#define cast_uint(i) cast(unsigned int, (i)) -#define cast_byte(i) cast(lu_byte, (i)) -#define cast_uchar(i) cast(unsigned char, (i)) -#define cast_char(i) cast(char, (i)) -#define cast_charp(i) cast(char *, (i)) -#define cast_sizet(i) cast(size_t, (i)) - - - -#if !defined(l_castS2U) -#define l_castS2U(i) ((lua_Unsigned)(i)) -#endif - - -#if !defined(l_castU2S) -#define l_castU2S(i) ((lua_Integer)(i)) -#endif - - - -#if !defined(l_noret) - -#if defined(__GNUC__) -#define l_noret void __attribute__((noreturn)) -#elif defined(_MSC_VER) && _MSC_VER >= 1200 -#define l_noret void __declspec(noreturn) -#else -#define l_noret void -#endif - -#endif - - - -#if !defined(LUA_USE_C89) -#define l_inline inline -#elif defined(__GNUC__) -#define l_inline __inline__ -#else -#define l_inline -#endif - -#define l_sinline static l_inline - - - -#if LUAI_IS32INT -typedef unsigned int l_uint32; -#else -typedef unsigned long l_uint32; -#endif - -typedef l_uint32 Instruction; - - - - -#if !defined(LUAI_MAXSHORTLEN) -#define LUAI_MAXSHORTLEN 40 -#endif - - - -#if !defined(MINSTRTABSIZE) -#define MINSTRTABSIZE 128 -#endif - - - -#if !defined(STRCACHE_N) -#define STRCACHE_N 53 -#define STRCACHE_M 2 -#endif - - - -#if !defined(LUA_MINBUFFER) -#define LUA_MINBUFFER 32 -#endif - - - -#if !defined(LUAI_MAXCCALLS) -#define LUAI_MAXCCALLS 200 -#endif - - - -#if !defined(lua_lock) -#define lua_lock(L) ((void) 0) -#define lua_unlock(L) ((void) 0) -#endif - - -#if !defined(luai_threadyield) -#define luai_threadyield(L) {lua_unlock(L); lua_lock(L);} -#endif - - - -#if !defined(luai_userstateopen) -#define luai_userstateopen(L) ((void)L) -#endif - -#if !defined(luai_userstateclose) -#define luai_userstateclose(L) ((void)L) -#endif - -#if !defined(luai_userstatethread) -#define luai_userstatethread(L,L1) ((void)L) -#endif - -#if !defined(luai_userstatefree) -#define luai_userstatefree(L,L1) ((void)L) -#endif - -#if !defined(luai_userstateresume) -#define luai_userstateresume(L,n) ((void)L) -#endif - -#if !defined(luai_userstateyield) -#define luai_userstateyield(L,n) ((void)L) -#endif - - - - - - -#if !defined(luai_numidiv) -#define luai_numidiv(L,a,b) ((void)L, l_floor(luai_numdiv(L,a,b))) -#endif - - -#if !defined(luai_numdiv) -#define luai_numdiv(L,a,b) ((a)/(b)) -#endif - - -#if !defined(luai_nummod) -#define luai_nummod(L,a,b,m) \ - { (void)L; (m) = l_mathop(private_lua_embed_fmod)(a,b); \ - if (((m) > 0) ? (b) < 0 : ((m) < 0 && (b) > 0)) (m) += (b); } -#endif - - -#if !defined(luai_numpow) -#define luai_numpow(L,a,b) \ - ((void)L, (b == 2) ? (a)*(a) : l_mathop(private_lua_embed_pow)(a,b)) -#endif - - -#if !defined(luai_numadd) -#define luai_numadd(L,a,b) ((a)+(b)) -#define luai_numsub(L,a,b) ((a)-(b)) -#define luai_nummul(L,a,b) ((a)*(b)) -#define luai_numunm(L,a) (-(a)) -#define luai_numeq(a,b) ((a)==(b)) -#define luai_numlt(a,b) ((a)<(b)) -#define luai_numle(a,b) ((a)<=(b)) -#define luai_numgt(a,b) ((a)>(b)) -#define luai_numge(a,b) ((a)>=(b)) -#define luai_numisnan(a) (!luai_numeq((a), (a))) -#endif - - - - - - -#if !defined(HARDSTACKTESTS) -#define condmovestack(L,pre,pos) ((void)0) -#else - -#define condmovestack(L,pre,pos) \ - { int sz_ = stacksize(L); pre; luaD_reallocstack((L), sz_, 0); pos; } -#endif - -#if !defined(HARDMEMTESTS) -#define condchangemem(L,pre,pos) ((void)0) -#else -#define condchangemem(L,pre,pos) \ - { if (gcrunning(G(L))) { pre; luaC_fullgc(L, 0); pos; } } -#endif - -#endif - - -//path: src/imports/../dependencies/lua/lmem.h - - -#ifndef lmem_h -#define lmem_h - - -#include - - - - - - - -#define luaM_error(L) luaD_throw(L, LUA_ERRMEM) - - - -#define luaM_testsize(n,e) \ - (sizeof(n) >= sizeof(size_t) && cast_sizet((n)) + 1 > MAX_SIZET/(e)) - -#define luaM_checksize(L,n,e) \ - (luaM_testsize(n,e) ? luaM_toobig(L) : cast_void(0)) - - - -#define luaM_limitN(n,t) \ - ((cast_sizet(n) <= MAX_SIZET/sizeof(t)) ? (n) : \ - cast_uint((MAX_SIZET/sizeof(t)))) - - - -#define luaM_reallocvchar(L,b,on,n) \ - cast_charp(luaM_saferealloc_(L, (b), (on)*sizeof(char), (n)*sizeof(char))) - -#define luaM_freemem(L, b, s) luaM_free_(L, (b), (s)) -#define luaM_free(L, b) luaM_free_(L, (b), sizeof(*(b))) -#define luaM_freearray(L, b, n) luaM_free_(L, (b), (n)*sizeof(*(b))) - -#define luaM_new(L,t) cast(t*, luaM_malloc_(L, sizeof(t), 0)) -#define luaM_newvector(L,n,t) cast(t*, luaM_malloc_(L, (n)*sizeof(t), 0)) -#define luaM_newvectorchecked(L,n,t) \ - (luaM_checksize(L,n,sizeof(t)), luaM_newvector(L,n,t)) - -#define luaM_newobject(L,tag,s) luaM_malloc_(L, (s), tag) - -#define luaM_newblock(L, size) luaM_newvector(L, size, char) - -#define luaM_growvector(L,v,nelems,size,t,limit,e) \ - ((v)=cast(t *, luaM_growaux_(L,v,nelems,&(size),sizeof(t), \ - luaM_limitN(limit,t),e))) - -#define luaM_reallocvector(L, v,oldn,n,t) \ - (cast(t *, luaM_realloc_(L, v, cast_sizet(oldn) * sizeof(t), \ - cast_sizet(n) * sizeof(t)))) - -#define luaM_shrinkvector(L,v,size,fs,t) \ - ((v)=cast(t *, luaM_shrinkvector_(L, v, &(size), fs, sizeof(t)))) - -LUAI_FUNC l_noret luaM_toobig (lua_State *L); - - -LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize, - size_t size); -LUAI_FUNC void *luaM_saferealloc_ (lua_State *L, void *block, size_t oldsize, - size_t size); -LUAI_FUNC void luaM_free_ (lua_State *L, void *block, size_t osize); -LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int nelems, - int *size, int size_elem, int limit, - const char *what); -LUAI_FUNC void *luaM_shrinkvector_ (lua_State *L, void *block, int *nelem, - int final_n, int size_elem); -LUAI_FUNC void *luaM_malloc_ (lua_State *L, size_t size, int tag); - -#endif - - - -//path: src/imports/../dependencies/lua/lstate.h - - -#ifndef lstate_h -#define lstate_h - - - - - - -typedef struct CallInfo CallInfo; - - -//path: src/imports/../dependencies/lua/lobject.h - - - -#ifndef lobject_h -#define lobject_h - - -#include - - - - - - - - - -#define LUA_TUPVAL LUA_NUMTYPES -#define LUA_TPROTO (LUA_NUMTYPES+1) -#define LUA_TDEADKEY (LUA_NUMTYPES+2) - - - - -#define LUA_TOTALTYPES (LUA_TPROTO + 2) - - - - - -#define makevariant(t,v) ((t) | ((v) << 4)) - - - - -typedef union Value { - struct GCObject *gc; - void *p; - lua_CFunction f; - lua_Integer i; - lua_Number n; - - lu_byte ub; -} Value; - - - - -#define TValuefields Value value_; lu_byte tt_ - -typedef struct TValue { - TValuefields; -} TValue; - - -#define val_(o) ((o)->value_) -#define valraw(o) (val_(o)) - - - -#define rawtt(o) ((o)->tt_) - - -#define novariant(t) ((t) & 0x0F) - - -#define withvariant(t) ((t) & 0x3F) -#define ttypetag(o) withvariant(rawtt(o)) - - -#define ttype(o) (novariant(rawtt(o))) - - - -#define checktag(o,t) (rawtt(o) == (t)) -#define checktype(o,t) (ttype(o) == (t)) - - - - - -#define righttt(obj) (ttypetag(obj) == gcvalue(obj)->tt) - - -#define checkliveness(L,obj) \ - ((void)L, lua_longassert(!iscollectable(obj) || \ - (righttt(obj) && (L == NULL || !isdead(G(L),gcvalue(obj)))))) - - - - - -#define settt_(o,t) ((o)->tt_=(t)) - - - -#define setobj(L,obj1,obj2) \ - { TValue *io1=(obj1); const TValue *io2=(obj2); \ - io1->value_ = io2->value_; settt_(io1, io2->tt_); \ - checkliveness(L,io1); lua_assert(!isnonstrictnil(io1)); } - - - - -#define setobjs2s(L,o1,o2) setobj(L,s2v(o1),s2v(o2)) - -#define setobj2s(L,o1,o2) setobj(L,s2v(o1),o2) - -#define setobjt2t setobj - -#define setobj2n setobj - -#define setobj2t setobj - - - -typedef union StackValue { - TValue val; - struct { - TValuefields; - unsigned short delta; - } tbclist; -} StackValue; - - - -typedef StackValue *StkId; - - - -typedef union { - StkId p; - ptrdiff_t offset; -} StkIdRel; - - - -#define s2v(o) (&(o)->val) - - - - - - -#define LUA_VNIL makevariant(LUA_TNIL, 0) - - -#define LUA_VEMPTY makevariant(LUA_TNIL, 1) - - -#define LUA_VABSTKEY makevariant(LUA_TNIL, 2) - - -#define LUA_VNOTABLE makevariant(LUA_TNIL, 3) - - - -#define ttisnil(v) checktype((v), LUA_TNIL) - - -#define tagisempty(tag) (novariant(tag) == LUA_TNIL) - - - -#define ttisstrictnil(o) checktag((o), LUA_VNIL) - - -#define setnilvalue(obj) settt_(obj, LUA_VNIL) - - -#define isabstkey(v) checktag((v), LUA_VABSTKEY) - - - -#define isnonstrictnil(v) (ttisnil(v) && !ttisstrictnil(v)) - - - -#define isempty(v) ttisnil(v) - - - -#define ABSTKEYCONSTANT {NULL}, LUA_VABSTKEY - - - -#define setempty(v) settt_(v, LUA_VEMPTY) - - - - - - - - - -#define LUA_VFALSE makevariant(LUA_TBOOLEAN, 0) -#define LUA_VTRUE makevariant(LUA_TBOOLEAN, 1) - -#define ttisboolean(o) checktype((o), LUA_TBOOLEAN) -#define ttisfalse(o) checktag((o), LUA_VFALSE) -#define ttistrue(o) checktag((o), LUA_VTRUE) - - -#define l_isfalse(o) (ttisfalse(o) || ttisnil(o)) -#define tagisfalse(t) ((t) == LUA_VFALSE || novariant(t) == LUA_TNIL) - - - -#define setbfvalue(obj) settt_(obj, LUA_VFALSE) -#define setbtvalue(obj) settt_(obj, LUA_VTRUE) - - - - - - -#define LUA_VTHREAD makevariant(LUA_TTHREAD, 0) - -#define ttisthread(o) checktag((o), ctb(LUA_VTHREAD)) - -#define thvalue(o) check_exp(ttisthread(o), gco2th(val_(o).gc)) - -#define setthvalue(L,obj,x) \ - { TValue *io = (obj); lua_State *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTHREAD)); \ - checkliveness(L,io); } - -#define setthvalue2s(L,o,t) setthvalue(L,s2v(o),t) - - - - - - - -#define CommonHeader struct GCObject *next; lu_byte tt; lu_byte marked - - - -typedef struct GCObject { - CommonHeader; -} GCObject; - - - -#define BIT_ISCOLLECTABLE (1 << 6) - -#define iscollectable(o) (rawtt(o) & BIT_ISCOLLECTABLE) - - -#define ctb(t) ((t) | BIT_ISCOLLECTABLE) - -#define gcvalue(o) check_exp(iscollectable(o), val_(o).gc) - -#define gcvalueraw(v) ((v).gc) - -#define setgcovalue(L,obj,x) \ - { TValue *io = (obj); GCObject *i_g=(x); \ - val_(io).gc = i_g; settt_(io, ctb(i_g->tt)); } - - - - - - - -#define LUA_VNUMINT makevariant(LUA_TNUMBER, 0) -#define LUA_VNUMFLT makevariant(LUA_TNUMBER, 1) - -#define ttisnumber(o) checktype((o), LUA_TNUMBER) -#define ttisfloat(o) checktag((o), LUA_VNUMFLT) -#define ttisinteger(o) checktag((o), LUA_VNUMINT) - -#define nvalue(o) check_exp(ttisnumber(o), \ - (ttisinteger(o) ? cast_num(ivalue(o)) : fltvalue(o))) -#define fltvalue(o) check_exp(ttisfloat(o), val_(o).n) -#define ivalue(o) check_exp(ttisinteger(o), val_(o).i) - -#define fltvalueraw(v) ((v).n) -#define ivalueraw(v) ((v).i) - -#define setfltvalue(obj,x) \ - { TValue *io=(obj); val_(io).n=(x); settt_(io, LUA_VNUMFLT); } - -#define chgfltvalue(obj,x) \ - { TValue *io=(obj); lua_assert(ttisfloat(io)); val_(io).n=(x); } - -#define setivalue(obj,x) \ - { TValue *io=(obj); val_(io).i=(x); settt_(io, LUA_VNUMINT); } - -#define chgivalue(obj,x) \ - { TValue *io=(obj); lua_assert(ttisinteger(io)); val_(io).i=(x); } - - - - - - - -#define LUA_VSHRSTR makevariant(LUA_TSTRING, 0) -#define LUA_VLNGSTR makevariant(LUA_TSTRING, 1) - -#define ttisstring(o) checktype((o), LUA_TSTRING) -#define ttisshrstring(o) checktag((o), ctb(LUA_VSHRSTR)) -#define ttislngstring(o) checktag((o), ctb(LUA_VLNGSTR)) - -#define tsvalueraw(v) (gco2ts((v).gc)) - -#define tsvalue(o) check_exp(ttisstring(o), gco2ts(val_(o).gc)) - -#define setsvalue(L,obj,x) \ - { TValue *io = (obj); TString *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(x_->tt)); \ - checkliveness(L,io); } - - -#define setsvalue2s(L,o,s) setsvalue(L,s2v(o),s) - - -#define setsvalue2n setsvalue - - - -#define LSTRREG -1 -#define LSTRFIX -2 -#define LSTRMEM -3 - - - -typedef struct TString { - CommonHeader; - lu_byte extra; - ls_byte shrlen; - unsigned int hash; - union { - size_t lnglen; - struct TString *hnext; - } u; - char *contents; - lua_Alloc falloc; - void *ud; -} TString; - - -#define strisshr(ts) ((ts)->shrlen >= 0) - - - -#define rawgetshrstr(ts) (cast_charp(&(ts)->contents)) -#define getshrstr(ts) check_exp(strisshr(ts), rawgetshrstr(ts)) -#define getlngstr(ts) check_exp(!strisshr(ts), (ts)->contents) -#define getstr(ts) (strisshr(ts) ? rawgetshrstr(ts) : (ts)->contents) - - - -#define tsslen(ts) \ - (strisshr(ts) ? cast_uint((ts)->shrlen) : (ts)->u.lnglen) - - -#define getlstr(ts, len) \ - (strisshr(ts) \ - ? (cast_void((len) = (ts)->shrlen), rawgetshrstr(ts)) \ - : (cast_void((len) = (ts)->u.lnglen), (ts)->contents)) - - - - - - - - -#define LUA_VLIGHTUSERDATA makevariant(LUA_TLIGHTUSERDATA, 0) - -#define LUA_VUSERDATA makevariant(LUA_TUSERDATA, 0) - -#define ttislightuserdata(o) checktag((o), LUA_VLIGHTUSERDATA) -#define ttisfulluserdata(o) checktag((o), ctb(LUA_VUSERDATA)) - -#define pvalue(o) check_exp(ttislightuserdata(o), val_(o).p) -#define uvalue(o) check_exp(ttisfulluserdata(o), gco2u(val_(o).gc)) - -#define pvalueraw(v) ((v).p) - -#define setpvalue(obj,x) \ - { TValue *io=(obj); val_(io).p=(x); settt_(io, LUA_VLIGHTUSERDATA); } - -#define setuvalue(L,obj,x) \ - { TValue *io = (obj); Udata *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VUSERDATA)); \ - checkliveness(L,io); } - - - -typedef union UValue { - TValue uv; - LUAI_MAXALIGN; -} UValue; - - - -typedef struct Udata { - CommonHeader; - unsigned short nuvalue; - size_t len; - struct Table *metatable; - GCObject *gclist; - UValue uv[1]; -} Udata; - - - -typedef struct Udata0 { - CommonHeader; - unsigned short nuvalue; - size_t len; - struct Table *metatable; - union {LUAI_MAXALIGN;} bindata; -} Udata0; - - - -#define udatamemoffset(nuv) \ - ((nuv) == 0 ? offsetof(Udata0, bindata) \ - : offsetof(Udata, uv) + (sizeof(UValue) * (nuv))) - - -#define getudatamem(u) (cast_charp(u) + udatamemoffset((u)->nuvalue)) - - -#define sizeudata(nuv,nb) (udatamemoffset(nuv) + (nb)) - - - - - - -#define LUA_VPROTO makevariant(LUA_TPROTO, 0) - - - -typedef struct Upvaldesc { - TString *name; - lu_byte instack; - lu_byte idx; - lu_byte kind; -} Upvaldesc; - - - -typedef struct LocVar { - TString *varname; - int startpc; - int endpc; -} LocVar; - - - -typedef struct AbsLineInfo { - int pc; - int line; -} AbsLineInfo; - - - -#define PF_ISVARARG 1 -#define PF_FIXED 2 - - - -typedef struct Proto { - CommonHeader; - lu_byte numparams; - lu_byte flag; - lu_byte maxstacksize; - int sizeupvalues; - int sizek; - int sizecode; - int sizelineinfo; - int sizep; - int sizelocvars; - int sizeabslineinfo; - int linedefined; - int lastlinedefined; - TValue *k; - Instruction *code; - struct Proto **p; - Upvaldesc *upvalues; - ls_byte *lineinfo; - AbsLineInfo *abslineinfo; - LocVar *locvars; - TString *source; - GCObject *gclist; -} Proto; - - - - - - -#define LUA_VUPVAL makevariant(LUA_TUPVAL, 0) - - - -#define LUA_VLCL makevariant(LUA_TFUNCTION, 0) -#define LUA_VLCF makevariant(LUA_TFUNCTION, 1) -#define LUA_VCCL makevariant(LUA_TFUNCTION, 2) - -#define ttisfunction(o) checktype(o, LUA_TFUNCTION) -#define ttisLclosure(o) checktag((o), ctb(LUA_VLCL)) -#define ttislcf(o) checktag((o), LUA_VLCF) -#define ttisCclosure(o) checktag((o), ctb(LUA_VCCL)) -#define ttisclosure(o) (ttisLclosure(o) || ttisCclosure(o)) - - -#define isLfunction(o) ttisLclosure(o) - -#define clvalue(o) check_exp(ttisclosure(o), gco2cl(val_(o).gc)) -#define clLvalue(o) check_exp(ttisLclosure(o), gco2lcl(val_(o).gc)) -#define fvalue(o) check_exp(ttislcf(o), val_(o).f) -#define clCvalue(o) check_exp(ttisCclosure(o), gco2ccl(val_(o).gc)) - -#define fvalueraw(v) ((v).f) - -#define setclLvalue(L,obj,x) \ - { TValue *io = (obj); LClosure *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VLCL)); \ - checkliveness(L,io); } - -#define setclLvalue2s(L,o,cl) setclLvalue(L,s2v(o),cl) - -#define setfvalue(obj,x) \ - { TValue *io=(obj); val_(io).f=(x); settt_(io, LUA_VLCF); } - -#define setclCvalue(L,obj,x) \ - { TValue *io = (obj); CClosure *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VCCL)); \ - checkliveness(L,io); } - - - -typedef struct UpVal { - CommonHeader; - union { - TValue *p; - ptrdiff_t offset; - } v; - union { - struct { - struct UpVal *next; - struct UpVal **previous; - } open; - TValue value; - } u; -} UpVal; - - - -#define ClosureHeader \ - CommonHeader; lu_byte nupvalues; GCObject *gclist - -typedef struct CClosure { - ClosureHeader; - lua_CFunction f; - TValue upvalue[1]; -} CClosure; - - -typedef struct LClosure { - ClosureHeader; - struct Proto *p; - UpVal *upvals[1]; -} LClosure; - - -typedef union Closure { - CClosure c; - LClosure l; -} Closure; - - -#define getproto(o) (clLvalue(o)->p) - - - - - - -#define LUA_VTABLE makevariant(LUA_TTABLE, 0) - -#define ttistable(o) checktag((o), ctb(LUA_VTABLE)) - -#define hvalue(o) check_exp(ttistable(o), gco2t(val_(o).gc)) - -#define sethvalue(L,obj,x) \ - { TValue *io = (obj); Table *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTABLE)); \ - checkliveness(L,io); } - -#define sethvalue2s(L,o,h) sethvalue(L,s2v(o),h) - - - -typedef union Node { - struct NodeKey { - TValuefields; - lu_byte key_tt; - int next; - Value key_val; - } u; - TValue i_val; -} Node; - - - -#define setnodekey(L,node,obj) \ - { Node *n_=(node); const TValue *io_=(obj); \ - n_->u.key_val = io_->value_; n_->u.key_tt = io_->tt_; \ - checkliveness(L,io_); } - - - -#define getnodekey(L,obj,node) \ - { TValue *io_=(obj); const Node *n_=(node); \ - io_->value_ = n_->u.key_val; io_->tt_ = n_->u.key_tt; \ - checkliveness(L,io_); } - - - - -#define BITRAS (1 << 7) -#define isrealasize(t) (!((t)->flags & BITRAS)) -#define setrealasize(t) ((t)->flags &= cast_byte(~BITRAS)) -#define setnorealasize(t) ((t)->flags |= BITRAS) - - -typedef struct ArrayCell ArrayCell; - - -typedef struct Table { - CommonHeader; - lu_byte flags; - lu_byte lsizenode; - unsigned int alimit; - ArrayCell *array; - Node *node; - struct Table *metatable; - GCObject *gclist; -} Table; - - - -#define keytt(node) ((node)->u.key_tt) -#define keyval(node) ((node)->u.key_val) - -#define keyisnil(node) (keytt(node) == LUA_TNIL) -#define keyisinteger(node) (keytt(node) == LUA_VNUMINT) -#define keyival(node) (keyval(node).i) -#define keyisshrstr(node) (keytt(node) == ctb(LUA_VSHRSTR)) -#define keystrval(node) (gco2ts(keyval(node).gc)) - -#define setnilkey(node) (keytt(node) = LUA_TNIL) - -#define keyiscollectable(n) (keytt(n) & BIT_ISCOLLECTABLE) - -#define gckey(n) (keyval(n).gc) -#define gckeyN(n) (keyiscollectable(n) ? gckey(n) : NULL) - - - -#define setdeadkey(node) (keytt(node) = LUA_TDEADKEY) -#define keyisdead(node) (keytt(node) == LUA_TDEADKEY) - - - - - - -#define lmod(s,size) \ - (check_exp((size&(size-1))==0, (cast_int((s) & ((size)-1))))) - - -#define twoto(x) (1<<(x)) -#define sizenode(t) (twoto((t)->lsizenode)) - - - -#define UTF8BUFFSZ 8 - -LUAI_FUNC int luaO_utf8esc (char *buff, unsigned long x); -LUAI_FUNC int luaO_ceillog2 (unsigned int x); -LUAI_FUNC unsigned int luaO_codeparam (unsigned int p); -LUAI_FUNC l_obj luaO_applyparam (unsigned int p, l_obj x); - -LUAI_FUNC int luaO_rawarith (lua_State *L, int op, const TValue *p1, - const TValue *p2, TValue *res); -LUAI_FUNC void luaO_arith (lua_State *L, int op, const TValue *p1, - const TValue *p2, StkId res); -LUAI_FUNC size_t luaO_str2num (const char *s, TValue *o); -LUAI_FUNC int luaO_hexavalue (int c); -LUAI_FUNC void luaO_tostring (lua_State *L, TValue *obj); -LUAI_FUNC const char *luaO_pushvfstring (lua_State *L, const char *fmt, - va_list argp); -LUAI_FUNC const char *luaO_pushfstring (lua_State *L, const char *fmt, ...); -LUAI_FUNC void luaO_chunkid (char *out, const char *source, size_t srclen); - - -#endif - - - -//path: src/imports/../dependencies/lua/ltm.h - - -#ifndef ltm_h -#define ltm_h - - - - - - - -typedef enum { - TM_INDEX, - TM_NEWINDEX, - TM_GC, - TM_MODE, - TM_LEN, - TM_EQ, - TM_ADD, - TM_SUB, - TM_MUL, - TM_MOD, - TM_POW, - TM_DIV, - TM_IDIV, - TM_BAND, - TM_BOR, - TM_BXOR, - TM_SHL, - TM_SHR, - TM_UNM, - TM_BNOT, - TM_LT, - TM_LE, - TM_CONCAT, - TM_CALL, - TM_CLOSE, - TM_N -} TMS; - - - -#define maskflags (~(~0u << (TM_EQ + 1))) - - - -#define notm(tm) ttisnil(tm) - -#define checknoTM(mt,e) ((mt) == NULL || (mt)->flags & (1u<<(e))) - -#define gfasttm(g,mt,e) \ - (checknoTM(mt, e) ? NULL : luaT_gettm(mt, e, (g)->tmname[e])) - -#define fasttm(l,mt,e) gfasttm(G(l), mt, e) - -#define ttypename(x) luaT_typenames_[(x) + 1] - -LUAI_DDEC(const char *const luaT_typenames_[LUA_TOTALTYPES];) - - -LUAI_FUNC const char *luaT_objtypename (lua_State *L, const TValue *o); - -LUAI_FUNC const TValue *luaT_gettm (Table *events, TMS event, TString *ename); -LUAI_FUNC const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, - TMS event); -LUAI_FUNC void luaT_init (lua_State *L); - -LUAI_FUNC void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, const TValue *p3); -LUAI_FUNC int luaT_callTMres (lua_State *L, const TValue *f, - const TValue *p1, const TValue *p2, StkId p3); -LUAI_FUNC void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event); -LUAI_FUNC void luaT_tryconcatTM (lua_State *L); -LUAI_FUNC void luaT_trybinassocTM (lua_State *L, const TValue *p1, - const TValue *p2, int inv, StkId res, TMS event); -LUAI_FUNC void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, - int inv, StkId res, TMS event); -LUAI_FUNC int luaT_callorderTM (lua_State *L, const TValue *p1, - const TValue *p2, TMS event); -LUAI_FUNC int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, - int inv, int isfloat, TMS event); - -LUAI_FUNC void luaT_adjustvarargs (lua_State *L, int nfixparams, - struct CallInfo *ci, const Proto *p); -LUAI_FUNC void luaT_getvarargs (lua_State *L, struct CallInfo *ci, - StkId where, int wanted); - - -#endif - - -//path: src/imports/../dependencies/lua/lzio.h - - - -#ifndef lzio_h -#define lzio_h - - - - - - - - -#define EOZ (-1) - -typedef struct Zio ZIO; - -#define zgetc(z) (((z)->n--)>0 ? cast_uchar(*(z)->p++) : luaZ_fill(z)) - - -typedef struct Mbuffer { - char *buffer; - size_t n; - size_t buffsize; -} Mbuffer; - -#define luaZ_initbuffer(L, buff) ((buff)->buffer = NULL, (buff)->buffsize = 0) - -#define luaZ_buffer(buff) ((buff)->buffer) -#define luaZ_sizebuffer(buff) ((buff)->buffsize) -#define luaZ_bufflen(buff) ((buff)->n) - -#define luaZ_buffremove(buff,i) ((buff)->n -= (i)) -#define luaZ_resetbuffer(buff) ((buff)->n = 0) - - -#define luaZ_resizebuffer(L, buff, size) \ - ((buff)->buffer = luaM_reallocvchar(L, (buff)->buffer, \ - (buff)->buffsize, size), \ - (buff)->buffsize = size) - -#define luaZ_freebuffer(L, buff) luaZ_resizebuffer(L, buff, 0) - - -LUAI_FUNC void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, - void *data); -LUAI_FUNC size_t luaZ_read (ZIO* z, void *b, size_t n); - -LUAI_FUNC const void *luaZ_getaddr (ZIO* z, size_t n); - - - - -struct Zio { - size_t n; - const char *p; - lua_Reader reader; - void *data; - lua_State *L; -}; - - -LUAI_FUNC int luaZ_fill (ZIO *z); - -#endif - - - - - - - - - - - - - - -#define yieldable(L) (((L)->nCcalls & 0xffff0000) == 0) - - -#define getCcalls(L) ((L)->nCcalls & 0xffff) - - - -#define incnny(L) ((L)->nCcalls += 0x10000) - - -#define decnny(L) ((L)->nCcalls -= 0x10000) - - -#define nyci (0x10000 | 1) - - - - -struct lua_longjmp; - - - -#if !defined(l_signalT) -#include -#define l_signalT sig_atomic_t -#endif - - - -#define EXTRA_STACK 5 - - -#define BASIC_STACK_SIZE (2*LUA_MINSTACK) - -#define stacksize(th) cast_int((th)->stack_last.p - (th)->stack.p) - - - -#define KGC_INC 0 -#define KGC_GENMINOR 1 -#define KGC_GENMAJOR 2 - - -typedef struct stringtable { - TString **hash; - int nuse; - int size; -} stringtable; - - - -struct CallInfo { - StkIdRel func; - StkIdRel top; - struct CallInfo *previous, *next; - union { - struct { - const Instruction *savedpc; - volatile l_signalT trap; - int nextraargs; - } l; - struct { - lua_KFunction k; - ptrdiff_t old_errfunc; - lua_KContext ctx; - } c; - } u; - union { - int funcidx; - int nyield; - int nres; - struct { - unsigned short ftransfer; - unsigned short ntransfer; - } transferinfo; - } u2; - short nresults; - unsigned short callstatus; -}; - - - -#define CIST_OAH (1<<0) -#define CIST_C (1<<1) -#define CIST_FRESH (1<<2) -#define CIST_HOOKED (1<<3) -#define CIST_YPCALL (1<<4) -#define CIST_TAIL (1<<5) -#define CIST_HOOKYIELD (1<<6) -#define CIST_FIN (1<<7) -#define CIST_TRAN (1<<8) -#define CIST_CLSRET (1<<9) - -#define CIST_RECST 10 -#if defined(LUA_COMPAT_LT_LE) -#define CIST_LEQ (1<<13) -#endif - - - -#define getcistrecst(ci) (((ci)->callstatus >> CIST_RECST) & 7) -#define setcistrecst(ci,st) \ - check_exp(((st) & 7) == (st), \ - ((ci)->callstatus = ((ci)->callstatus & ~(7 << CIST_RECST)) \ - | ((st) << CIST_RECST))) - - - -#define isLua(ci) (!((ci)->callstatus & CIST_C)) - - -#define isLuacode(ci) (!((ci)->callstatus & (CIST_C | CIST_HOOKED))) - - -#define setoah(st,v) ((st) = ((st) & ~CIST_OAH) | (v)) -#define getoah(st) ((st) & CIST_OAH) - - - -typedef struct global_State { - lua_Alloc frealloc; - void *ud; - lu_mem totalbytes; - l_obj totalobjs; - l_obj GCdebt; - l_obj marked; - l_obj GCmajorminor; - stringtable strt; - TValue l_registry; - TValue nilvalue; - unsigned int seed; - lu_byte gcparams[LUA_GCPN]; - lu_byte currentwhite; - lu_byte gcstate; - lu_byte gckind; - lu_byte gcstopem; - lu_byte gcstp; - lu_byte gcemergency; - GCObject *allgc; - GCObject **sweepgc; - GCObject *finobj; - GCObject *gray; - GCObject *grayagain; - GCObject *weak; - GCObject *ephemeron; - GCObject *allweak; - GCObject *tobefnz; - GCObject *fixedgc; - - GCObject *survival; - GCObject *old1; - GCObject *reallyold; - GCObject *firstold1; - GCObject *finobjsur; - GCObject *finobjold1; - GCObject *finobjrold; - struct lua_State *twups; - lua_CFunction panic; - struct lua_State *mainthread; - TString *memerrmsg; - TString *tmname[TM_N]; - struct Table *mt[LUA_NUMTYPES]; - TString *strcache[STRCACHE_N][STRCACHE_M]; - lua_WarnFunction warnf; - void *ud_warn; -} global_State; - - - -struct lua_State { - CommonHeader; - lu_byte status; - lu_byte allowhook; - unsigned short nci; - StkIdRel top; - global_State *l_G; - CallInfo *ci; - StkIdRel stack_last; - StkIdRel stack; - UpVal *openupval; - StkIdRel tbclist; - GCObject *gclist; - struct lua_State *twups; - struct lua_longjmp *errorJmp; - CallInfo base_ci; - volatile lua_Hook hook; - ptrdiff_t errfunc; - l_uint32 nCcalls; - int oldpc; - int basehookcount; - int hookcount; - volatile l_signalT hookmask; -}; - - -#define G(L) (L->l_G) - - -#define completestate(g) ttisnil(&g->nilvalue) - - - -union GCUnion { - GCObject gc; - struct TString ts; - struct Udata u; - union Closure cl; - struct Table h; - struct Proto p; - struct lua_State th; - struct UpVal upv; -}; - - - -#define cast_u(o) cast(union GCUnion *, (o)) - - -#define gco2ts(o) \ - check_exp(novariant((o)->tt) == LUA_TSTRING, &((cast_u(o))->ts)) -#define gco2u(o) check_exp((o)->tt == LUA_VUSERDATA, &((cast_u(o))->u)) -#define gco2lcl(o) check_exp((o)->tt == LUA_VLCL, &((cast_u(o))->cl.l)) -#define gco2ccl(o) check_exp((o)->tt == LUA_VCCL, &((cast_u(o))->cl.c)) -#define gco2cl(o) \ - check_exp(novariant((o)->tt) == LUA_TFUNCTION, &((cast_u(o))->cl)) -#define gco2t(o) check_exp((o)->tt == LUA_VTABLE, &((cast_u(o))->h)) -#define gco2p(o) check_exp((o)->tt == LUA_VPROTO, &((cast_u(o))->p)) -#define gco2th(o) check_exp((o)->tt == LUA_VTHREAD, &((cast_u(o))->th)) -#define gco2upv(o) check_exp((o)->tt == LUA_VUPVAL, &((cast_u(o))->upv)) - - - -#define obj2gco(v) check_exp((v)->tt >= LUA_TSTRING, &(cast_u(v)->gc)) - - - -#define gettotalobjs(g) ((g)->totalobjs - (g)->GCdebt) - - -LUAI_FUNC void luaE_setdebt (global_State *g, l_obj debt); -LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1); -LUAI_FUNC CallInfo *luaE_extendCI (lua_State *L); -LUAI_FUNC void luaE_shrinkCI (lua_State *L); -LUAI_FUNC void luaE_checkcstack (lua_State *L); -LUAI_FUNC void luaE_incCstack (lua_State *L); -LUAI_FUNC void luaE_warning (lua_State *L, const char *msg, int tocont); -LUAI_FUNC void luaE_warnerror (lua_State *L, const char *where); -LUAI_FUNC int luaE_resetthread (lua_State *L, int status); - - -#endif - - - - - - - -int luaZ_fill (ZIO *z) { - size_t size; - lua_State *L = z->L; - const char *buff; - lua_unlock(L); - buff = z->reader(L, z->data, &size); - lua_lock(L); - if (buff == NULL || size == 0) - return EOZ; - z->n = size - 1; - z->p = buff; - return cast_uchar(*(z->p++)); -} - - -void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, void *data) { - z->L = L; - z->reader = reader; - z->data = data; - z->n = 0; - z->p = NULL; -} - - - - -static int checkbuffer (ZIO *z) { - if (z->n == 0) { - if (luaZ_fill(z) == EOZ) - return 0; - else { - z->n++; - z->p--; - } - } - return 1; -} - - -size_t luaZ_read (ZIO *z, void *b, size_t n) { - while (n) { - size_t m; - if (!checkbuffer(z)) - return n; - m = (n <= z->n) ? n : z->n; - memcpy(b, z->p, m); - z->n -= m; - z->p += m; - b = (char *)b + m; - n -= m; - } - return 0; -} - - -const void *luaZ_getaddr (ZIO* z, size_t n) { - const void *res; - if (!checkbuffer(z)) - return NULL; - if (z->n < n) - return NULL; - res = z->p; - z->n -= n; - z->p += n; - return res; -} - - -//path: src/imports/../dependencies/lua/lctype.c - - -#define lctype_c -#define LUA_CORE - - - - - -//path: src/imports/../dependencies/lua/lctype.h - - -#ifndef lctype_h -#define lctype_h - - - - - - - -#if !defined(LUA_USE_CTYPE) - -#if 'A' == 65 && '0' == 48 - -#define LUA_USE_CTYPE 0 -#else - -#define LUA_USE_CTYPE 1 -#endif - -#endif - - -#if !LUA_USE_CTYPE - -#include - - - - - -#define ALPHABIT 0 -#define DIGITBIT 1 -#define PRINTBIT 2 -#define SPACEBIT 3 -#define XDIGITBIT 4 - - -#define MASK(B) (1 << (B)) - - - -#define testprop(c,p) (luai_ctype_[(c)+1] & (p)) - - -#define lislalpha(c) testprop(c, MASK(ALPHABIT)) -#define lislalnum(c) testprop(c, (MASK(ALPHABIT) | MASK(DIGITBIT))) -#define lisdigit(c) testprop(c, MASK(DIGITBIT)) -#define lisspace(c) testprop(c, MASK(SPACEBIT)) -#define lisprint(c) testprop(c, MASK(PRINTBIT)) -#define lisxdigit(c) testprop(c, MASK(XDIGITBIT)) - - - -#define ltolower(c) \ - check_exp(('A' <= (c) && (c) <= 'Z') || (c) == ((c) | ('A' ^ 'a')), \ - (c) | ('A' ^ 'a')) - - - -LUAI_DDEC(const lu_byte luai_ctype_[UCHAR_MAX + 2];) - - -#else - - - -#include - - -#define lislalpha(c) (isalpha(c) || (c) == '_') -#define lislalnum(c) (isalnum(c) || (c) == '_') -#define lisdigit(c) (isdigit(c)) -#define lisspace(c) (isspace(c)) -#define lisprint(c) (isprint(c)) -#define lisxdigit(c) (isxdigit(c)) - -#define ltolower(c) (tolower(c)) - -#endif - -#endif - - - - -#if !LUA_USE_CTYPE - -#include - - -#if defined (LUA_UCID) - -#define NONA 0x01 -#else -#define NONA 0x00 -#endif - - -LUAI_DDEF const lu_byte luai_ctype_[UCHAR_MAX + 2] = { - 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x00, 0x08, 0x08, 0x08, 0x08, 0x08, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x0c, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, - 0x16, 0x16, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x04, 0x15, 0x15, 0x15, 0x15, 0x15, 0x15, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x04, 0x04, 0x04, 0x04, 0x05, - 0x04, 0x15, 0x15, 0x15, 0x15, 0x15, 0x15, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x04, 0x04, 0x04, 0x04, 0x00, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - 0x00, 0x00, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, 0x00, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 -}; - -#endif - -//path: src/imports/../dependencies/lua/lopcodes.c - - -#define lopcodes_c -#define LUA_CORE - - - - - -//path: src/imports/../dependencies/lua/lopcodes.h - - -#ifndef lopcodes_h -#define lopcodes_h - - - - - - - - -enum OpMode {iABC, iABx, iAsBx, iAx, isJ}; - - - -#define SIZE_C 8 -#define SIZE_B 8 -#define SIZE_Bx (SIZE_C + SIZE_B + 1) -#define SIZE_A 8 -#define SIZE_Ax (SIZE_Bx + SIZE_A) -#define SIZE_sJ (SIZE_Bx + SIZE_A) - -#define SIZE_OP 7 - -#define POS_OP 0 - -#define POS_A (POS_OP + SIZE_OP) -#define POS_k (POS_A + SIZE_A) -#define POS_B (POS_k + 1) -#define POS_C (POS_B + SIZE_B) - -#define POS_Bx POS_k - -#define POS_Ax POS_A - -#define POS_sJ POS_A - - - - - -#define L_INTHASBITS(b) ((UINT_MAX >> ((b) - 1)) >= 1) - - -#if L_INTHASBITS(SIZE_Bx) -#define MAXARG_Bx ((1<>1) - - -#if L_INTHASBITS(SIZE_Ax) -#define MAXARG_Ax ((1<> 1) - - -#define MAXARG_A ((1<> 1) - -#define int2sC(i) ((i) + OFFSET_sC) -#define sC2int(i) ((i) - OFFSET_sC) - - - -#define MASK1(n,p) ((~((~(Instruction)0)<<(n)))<<(p)) - - -#define MASK0(n,p) (~MASK1(n,p)) - - - -#define GET_OPCODE(i) (cast(OpCode, ((i)>>POS_OP) & MASK1(SIZE_OP,0))) -#define SET_OPCODE(i,o) ((i) = (((i)&MASK0(SIZE_OP,POS_OP)) | \ - ((cast(Instruction, o)<>(pos)) & MASK1(size,0))) -#define setarg(i,v,pos,size) ((i) = (((i)&MASK0(size,pos)) | \ - ((cast(Instruction, v)< - - - - -//path: src/imports/../dependencies/lua/ldebug.h - - -#ifndef ldebug_h -#define ldebug_h - - - - - - -#define pcRel(pc, p) (cast_int((pc) - (p)->code) - 1) - - - -#define ci_func(ci) (clLvalue(s2v((ci)->func.p))) - - -#define resethookcount(L) (L->hookcount = L->basehookcount) - - -#define ABSLINEINFO (-0x80) - - - -#if !defined(MAXIWTHABS) -#define MAXIWTHABS 128 -#endif - - -LUAI_FUNC int luaG_getfuncline (const Proto *f, int pc); -LUAI_FUNC const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, - StkId *pos); -LUAI_FUNC l_noret luaG_typeerror (lua_State *L, const TValue *o, - const char *opname); -LUAI_FUNC l_noret luaG_callerror (lua_State *L, const TValue *o); -LUAI_FUNC l_noret luaG_forerror (lua_State *L, const TValue *o, - const char *what); -LUAI_FUNC l_noret luaG_concaterror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_opinterror (lua_State *L, const TValue *p1, - const TValue *p2, - const char *msg); -LUAI_FUNC l_noret luaG_tointerror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_ordererror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_runerror (lua_State *L, const char *fmt, ...); -LUAI_FUNC const char *luaG_addinfo (lua_State *L, const char *msg, - TString *src, int line); -LUAI_FUNC l_noret luaG_errormsg (lua_State *L); -LUAI_FUNC int luaG_traceexec (lua_State *L, const Instruction *pc); -LUAI_FUNC int luaG_tracecall (lua_State *L); - - -#endif - - -//path: src/imports/../dependencies/lua/ldo.h - - -#ifndef ldo_h -#define ldo_h - - - - - - - - - - - - - -#define luaD_checkstackaux(L,n,pre,pos) \ - if (l_unlikely(L->stack_last.p - L->top.p <= (n))) \ - { pre; luaD_growstack(L, n, 1); pos; } \ - else { condmovestack(L,pre,pos); } - - -#define luaD_checkstack(L,n) luaD_checkstackaux(L,n,(void)0,(void)0) - - - -#define savestack(L,pt) (cast_charp(pt) - cast_charp(L->stack.p)) -#define restorestack(L,n) cast(StkId, cast_charp(L->stack.p) + (n)) - - - -#define checkstackp(L,n,p) \ - luaD_checkstackaux(L, n, \ - ptrdiff_t t__ = savestack(L, p), \ - p = restorestack(L, t__)) - - - - -typedef void (*Pfunc) (lua_State *L, void *ud); - -LUAI_FUNC void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop); -LUAI_FUNC int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, - const char *mode); -LUAI_FUNC void luaD_hook (lua_State *L, int event, int line, - int fTransfer, int nTransfer); -LUAI_FUNC void luaD_hookcall (lua_State *L, CallInfo *ci); -LUAI_FUNC int luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, - int narg1, int delta); -LUAI_FUNC CallInfo *luaD_precall (lua_State *L, StkId func, int nResults); -LUAI_FUNC void luaD_call (lua_State *L, StkId func, int nResults); -LUAI_FUNC void luaD_callnoyield (lua_State *L, StkId func, int nResults); -LUAI_FUNC int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status); -LUAI_FUNC int luaD_pcall (lua_State *L, Pfunc func, void *u, - ptrdiff_t oldtop, ptrdiff_t ef); -LUAI_FUNC void luaD_poscall (lua_State *L, CallInfo *ci, int nres); -LUAI_FUNC int luaD_reallocstack (lua_State *L, int newsize, int raiseerror); -LUAI_FUNC int luaD_growstack (lua_State *L, int n, int raiseerror); -LUAI_FUNC void luaD_shrinkstack (lua_State *L); -LUAI_FUNC void luaD_inctop (lua_State *L); - -LUAI_FUNC l_noret luaD_throw (lua_State *L, int errcode); -LUAI_FUNC int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud); - -#endif - - - -//path: src/imports/../dependencies/lua/lgc.h - - -#ifndef lgc_h -#define lgc_h - - -#include - - - - - - - - - - - -#define GCSpropagate 0 -#define GCSenteratomic 1 -#define GCSatomic 2 -#define GCSswpallgc 3 -#define GCSswpfinobj 4 -#define GCSswptobefnz 5 -#define GCSswpend 6 -#define GCScallfin 7 -#define GCSpause 8 - - -#define issweepphase(g) \ - (GCSswpallgc <= (g)->gcstate && (g)->gcstate <= GCSswpend) - - - - -#define keepinvariant(g) ((g)->gcstate <= GCSatomic) - - - -#define resetbits(x,m) ((x) &= cast_byte(~(m))) -#define setbits(x,m) ((x) |= (m)) -#define testbits(x,m) ((x) & (m)) -#define bitmask(b) (1<<(b)) -#define bit2mask(b1,b2) (bitmask(b1) | bitmask(b2)) -#define l_setbit(x,b) setbits(x, bitmask(b)) -#define resetbit(x,b) resetbits(x, bitmask(b)) -#define testbit(x,b) testbits(x, bitmask(b)) - - - -#define WHITE0BIT 3 -#define WHITE1BIT 4 -#define BLACKBIT 5 -#define FINALIZEDBIT 6 - -#define TESTBIT 7 - - - -#define WHITEBITS bit2mask(WHITE0BIT, WHITE1BIT) - - -#define iswhite(x) testbits((x)->marked, WHITEBITS) -#define isblack(x) testbit((x)->marked, BLACKBIT) -#define isgray(x) \ - (!testbits((x)->marked, WHITEBITS | bitmask(BLACKBIT))) - -#define tofinalize(x) testbit((x)->marked, FINALIZEDBIT) - -#define otherwhite(g) ((g)->currentwhite ^ WHITEBITS) -#define isdeadm(ow,m) ((m) & (ow)) -#define isdead(g,v) isdeadm(otherwhite(g), (v)->marked) - -#define changewhite(x) ((x)->marked ^= WHITEBITS) -#define nw2black(x) \ - check_exp(!iswhite(x), l_setbit((x)->marked, BLACKBIT)) - -#define luaC_white(g) cast_byte((g)->currentwhite & WHITEBITS) - - - -#define G_NEW 0 -#define G_SURVIVAL 1 -#define G_OLD0 2 -#define G_OLD1 3 -#define G_OLD 4 -#define G_TOUCHED1 5 -#define G_TOUCHED2 6 - -#define AGEBITS 7 - -#define getage(o) ((o)->marked & AGEBITS) -#define setage(o,a) ((o)->marked = cast_byte(((o)->marked & (~AGEBITS)) | a)) -#define isold(o) (getage(o) > G_SURVIVAL) - - - - - - - - -#define LUAI_MINORMAJOR 100 - - -#define LUAI_MAJORMINOR 50 - - -#define LUAI_GENMINORMUL 25 - - - - - -#define LUAI_GCPAUSE 200 - - -#define LUAI_GCMUL 200 - - -#define LUAI_GCSTEPSIZE 250 - - -#define setgcparam(g,p,v) (g->gcparams[LUA_GCP##p] = luaO_codeparam(v)) -#define applygcparam(g,p,x) luaO_applyparam(g->gcparams[LUA_GCP##p], x) - - -#define GCSTPUSR 1 -#define GCSTPGC 2 -#define GCSTPCLS 4 -#define gcrunning(g) ((g)->gcstp == 0) - - - -#define luaC_condGC(L,pre,pos) \ - { if (G(L)->GCdebt <= 0) { pre; luaC_step(L); pos;}; \ - condchangemem(L,pre,pos); } - - -#define luaC_checkGC(L) luaC_condGC(L,(void)0,(void)0) - - -#define luaC_objbarrier(L,p,o) ( \ - (isblack(p) && iswhite(o)) ? \ - luaC_barrier_(L,obj2gco(p),obj2gco(o)) : cast_void(0)) - -#define luaC_barrier(L,p,v) ( \ - iscollectable(v) ? luaC_objbarrier(L,p,gcvalue(v)) : cast_void(0)) - -#define luaC_objbarrierback(L,p,o) ( \ - (isblack(p) && iswhite(o)) ? luaC_barrierback_(L,p) : cast_void(0)) - -#define luaC_barrierback(L,p,v) ( \ - iscollectable(v) ? luaC_objbarrierback(L, p, gcvalue(v)) : cast_void(0)) - -LUAI_FUNC void luaC_fix (lua_State *L, GCObject *o); -LUAI_FUNC void luaC_freeallobjects (lua_State *L); -LUAI_FUNC void luaC_step (lua_State *L); -LUAI_FUNC void luaC_runtilstate (lua_State *L, int state, int fast); -LUAI_FUNC void luaC_fullgc (lua_State *L, int isemergency); -LUAI_FUNC GCObject *luaC_newobj (lua_State *L, int tt, size_t sz); -LUAI_FUNC GCObject *luaC_newobjdt (lua_State *L, int tt, size_t sz, - size_t offset); -LUAI_FUNC void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v); -LUAI_FUNC void luaC_barrierback_ (lua_State *L, GCObject *o); -LUAI_FUNC void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt); -LUAI_FUNC void luaC_changemode (lua_State *L, int newmode); - - -#endif - - - - - - - - - - - - - - - -#define callfrealloc(g,block,os,ns) ((*g->frealloc)(g->ud, block, os, ns)) - - - -#define cantryagain(g) (completestate(g) && !g->gcstopem) - - - - -#if defined(EMERGENCYGCTESTS) - -static void *firsttry (global_State *g, void *block, size_t os, size_t ns) { - if (ns > 0 && cantryagain(g)) - return NULL; - else - return callfrealloc(g, block, os, ns); -} -#else -#define firsttry(g,block,os,ns) callfrealloc(g, block, os, ns) -#endif - - - - - - - - -#define MINSIZEARRAY 4 - - -void *luaM_growaux_ (lua_State *L, void *block, int nelems, int *psize, - int size_elems, int limit, const char *what) { - void *newblock; - int size = *psize; - if (nelems + 1 <= size) - return block; - if (size >= limit / 2) { - if (l_unlikely(size >= limit)) - luaG_runerror(L, "too many %s (limit is %d)", what, limit); - size = limit; - } - else { - size *= 2; - if (size < MINSIZEARRAY) - size = MINSIZEARRAY; - } - lua_assert(nelems + 1 <= size && size <= limit); - - newblock = luaM_saferealloc_(L, block, cast_sizet(*psize) * size_elems, - cast_sizet(size) * size_elems); - *psize = size; - return newblock; -} - - - -void *luaM_shrinkvector_ (lua_State *L, void *block, int *size, - int final_n, int size_elem) { - void *newblock; - size_t oldsize = cast_sizet((*size) * size_elem); - size_t newsize = cast_sizet(final_n * size_elem); - lua_assert(newsize <= oldsize); - newblock = luaM_saferealloc_(L, block, oldsize, newsize); - *size = final_n; - return newblock; -} - - - - -l_noret luaM_toobig (lua_State *L) { - luaG_runerror(L, "memory allocation private_lua_error: block too big"); -} - - - -void luaM_free_ (lua_State *L, void *block, size_t osize) { - global_State *g = G(L); - lua_assert((osize == 0) == (block == NULL)); - callfrealloc(g, block, osize, 0); - g->totalbytes -= osize; -} - - - -static void *tryagain (lua_State *L, void *block, - size_t osize, size_t nsize) { - global_State *g = G(L); - if (cantryagain(g)) { - luaC_fullgc(L, 1); - return callfrealloc(g, block, osize, nsize); - } - else return NULL; -} - - - -void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) { - void *newblock; - global_State *g = G(L); - lua_assert((osize == 0) == (block == NULL)); - newblock = firsttry(g, block, osize, nsize); - if (l_unlikely(newblock == NULL && nsize > 0)) { - newblock = tryagain(L, block, osize, nsize); - if (newblock == NULL) - return NULL; - } - lua_assert((nsize == 0) == (newblock == NULL)); - g->totalbytes += nsize - osize; - return newblock; -} - - -void *luaM_saferealloc_ (lua_State *L, void *block, size_t osize, - size_t nsize) { - void *newblock = luaM_realloc_(L, block, osize, nsize); - if (l_unlikely(newblock == NULL && nsize > 0)) - luaM_error(L); - return newblock; -} - - -void *luaM_malloc_ (lua_State *L, size_t size, int tag) { - if (size == 0) - return NULL; - else { - global_State *g = G(L); - void *newblock = firsttry(g, NULL, tag, size); - if (l_unlikely(newblock == NULL)) { - newblock = tryagain(L, NULL, tag, size); - if (newblock == NULL) - luaM_error(L); - } - g->totalbytes += size; - return newblock; - } -} - - -//path: src/imports/../dependencies/lua/lundump.c - - -#define lundump_c -#define LUA_CORE - - - - - -#include -#include - - - - - - - - -//path: src/imports/../dependencies/lua/lfunc.h - - -#ifndef lfunc_h -#define lfunc_h - - - - - - -#define sizeCclosure(n) (cast_int(offsetof(CClosure, upvalue)) + \ - cast_int(sizeof(TValue)) * (n)) - -#define sizeLclosure(n) (cast_int(offsetof(LClosure, upvals)) + \ - cast_int(sizeof(TValue *)) * (n)) - - - -#define isintwups(L) (L->twups != L) - - - -#define MAXUPVAL 255 - - -#define upisopen(up) ((up)->v.p != &(up)->u.value) - - -#define uplevel(up) check_exp(upisopen(up), cast(StkId, (up)->v.p)) - - - -#define MAXMISS 10 - - - - -#define CLOSEKTOP (-1) - - -LUAI_FUNC Proto *luaF_newproto (lua_State *L); -LUAI_FUNC CClosure *luaF_newCclosure (lua_State *L, int nupvals); -LUAI_FUNC LClosure *luaF_newLclosure (lua_State *L, int nupvals); -LUAI_FUNC void luaF_initupvals (lua_State *L, LClosure *cl); -LUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_newtbcupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_closeupval (lua_State *L, StkId level); -LUAI_FUNC StkId luaF_close (lua_State *L, StkId level, int status, int yy); -LUAI_FUNC void luaF_unlinkupval (UpVal *uv); -LUAI_FUNC void luaF_freeproto (lua_State *L, Proto *f); -LUAI_FUNC const char *luaF_getlocalname (const Proto *func, int local_number, - int pc); - - -#endif - - - - - - -//path: src/imports/../dependencies/lua/lstring.h - - -#ifndef lstring_h -#define lstring_h - - - - - - - - - - -#define MEMERRMSG "not enough memory" - - - -#define sizestrshr(l) \ - (offsetof(TString, contents) + ((l) + 1) * sizeof(char)) - - -#define luaS_newliteral(L, s) (luaS_newlstr(L, "" s, \ - (sizeof(s)/sizeof(char))-1)) - - - -#define isreserved(s) ((s)->tt == LUA_VSHRSTR && (s)->extra > 0) - - - -#define eqshrstr(a,b) check_exp((a)->tt == LUA_VSHRSTR, (a) == (b)) - - -LUAI_FUNC unsigned luaS_hash (const char *str, size_t l, unsigned seed); -LUAI_FUNC unsigned luaS_hashlongstr (TString *ts); -LUAI_FUNC int luaS_eqlngstr (TString *a, TString *b); -LUAI_FUNC void luaS_resize (lua_State *L, int newsize); -LUAI_FUNC void luaS_clearcache (global_State *g); -LUAI_FUNC void luaS_init (lua_State *L); -LUAI_FUNC void luaS_remove (lua_State *L, TString *ts); -LUAI_FUNC Udata *luaS_newudata (lua_State *L, size_t s, int nuvalue); -LUAI_FUNC TString *luaS_newlstr (lua_State *L, const char *str, size_t l); -LUAI_FUNC TString *luaS_new (lua_State *L, const char *str); -LUAI_FUNC TString *luaS_createlngstrobj (lua_State *L, size_t l); -LUAI_FUNC TString *luaS_newextlstr (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud); -LUAI_FUNC size_t luaS_sizelngstr (size_t len, int kind); - -#endif - - -//path: src/imports/../dependencies/lua/ltable.h - - -#ifndef ltable_h -#define ltable_h - - - - - -#define gnode(t,i) (&(t)->node[i]) -#define gval(n) (&(n)->i_val) -#define gnext(n) ((n)->u.next) - - - -#define invalidateTMcache(t) ((t)->flags &= ~maskflags) - - - - -#define BITDUMMY (1 << 6) -#define NOTBITDUMMY cast_byte(~BITDUMMY) -#define isdummy(t) ((t)->flags & BITDUMMY) - -#define setnodummy(t) ((t)->flags &= NOTBITDUMMY) -#define setdummy(t) ((t)->flags |= BITDUMMY) - - - - -#define allocsizenode(t) (isdummy(t) ? 0 : sizenode(t)) - - - -#define nodefromval(v) cast(Node *, (v)) - - - -#define luaH_fastgeti(t,k,res,tag) \ - { Table *h = t; lua_Unsigned u = l_castS2U(k); \ - if ((u - 1u < h->alimit)) { \ - tag = *getArrTag(h,(u)-1u); \ - if (!tagisempty(tag)) { farr2val(h, u, tag, res); }} \ - else { tag = luaH_getint(h, u, res); }} - - -#define luaH_fastseti(t,k,val,hres) \ - { Table *h = t; lua_Unsigned u = l_castS2U(k); \ - if ((u - 1u < h->alimit)) { \ - lu_byte *tag = getArrTag(h,(u)-1u); \ - if (tagisempty(*tag)) hres = ~cast_int(u); \ - else { fval2arr(h, u, tag, val); hres = HOK; }} \ - else { hres = luaH_psetint(h, u, val); }} - - - -#define HOK 0 -#define HNOTFOUND 1 -#define HNOTATABLE 2 -#define HFIRSTNODE 3 - - - - - -#define NM cast_uint(sizeof(Value)) - -struct ArrayCell { - lu_byte tag[NM]; - Value value[NM]; -}; - - - -#define getArrTag(t,k) (&(t)->array[(k)/NM].tag[(k)%NM]) - - -#define getArrVal(t,k) (&(t)->array[(k)/NM].value[(k)%NM]) - - - -#define arr2obj(h,k,val) \ - ((val)->tt_ = *getArrTag(h,(k)-1u), (val)->value_ = *getArrVal(h,(k)-1u)) - -#define obj2arr(h,k,val) \ - (*getArrTag(h,(k)-1u) = (val)->tt_, *getArrVal(h,(k)-1u) = (val)->value_) - - - -#define farr2val(h,k,tag,res) \ - ((res)->tt_ = tag, (res)->value_ = *getArrVal(h,(k)-1u)) - -#define fval2arr(h,k,tag,val) \ - (*tag = (val)->tt_, *getArrVal(h,(k)-1u) = (val)->value_) - - -LUAI_FUNC int luaH_get (Table *t, const TValue *key, TValue *res); -LUAI_FUNC int luaH_getshortstr (Table *t, TString *key, TValue *res); -LUAI_FUNC int luaH_getstr (Table *t, TString *key, TValue *res); -LUAI_FUNC int luaH_getint (Table *t, lua_Integer key, TValue *res); - - -LUAI_FUNC const TValue *luaH_Hgetshortstr (Table *t, TString *key); - -LUAI_FUNC TString *luaH_getstrkey (Table *t, TString *key); - -LUAI_FUNC int luaH_psetint (Table *t, lua_Integer key, TValue *val); -LUAI_FUNC int luaH_psetshortstr (Table *t, TString *key, TValue *val); -LUAI_FUNC int luaH_psetstr (Table *t, TString *key, TValue *val); -LUAI_FUNC int luaH_pset (Table *t, const TValue *key, TValue *val); - -LUAI_FUNC void luaH_setint (lua_State *L, Table *t, lua_Integer key, - TValue *value); -LUAI_FUNC void luaH_set (lua_State *L, Table *t, const TValue *key, - TValue *value); - -LUAI_FUNC void luaH_finishset (lua_State *L, Table *t, const TValue *key, - TValue *value, int hres); -LUAI_FUNC Table *luaH_new (lua_State *L); -LUAI_FUNC void luaH_resize (lua_State *L, Table *t, unsigned nasize, - unsigned nhsize); -LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, unsigned nasize); -LUAI_FUNC void luaH_free (lua_State *L, Table *t); -LUAI_FUNC int luaH_next (lua_State *L, Table *t, StkId key); -LUAI_FUNC lua_Unsigned luaH_getn (Table *t); -LUAI_FUNC unsigned luaH_realasize (const Table *t); - - -#if defined(LUA_DEBUG) -LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key); -#endif - - -#endif - - -//path: src/imports/../dependencies/lua/lundump.h - - -#ifndef lundump_h -#define lundump_h - -#include - - - - - - - - - - -#define LUAC_DATA "\x19\x93\r\n\x1a\n" - -#define LUAC_INT 0x5678 -#define LUAC_NUM cast_num(370.5) - - -#define LUAC_VERSION (LUA_VERSION_MAJOR_N*16+LUA_VERSION_MINOR_N) - -#define LUAC_FORMAT 0 - - - -LUAI_FUNC LClosure* luaU_undump (lua_State* L, ZIO* Z, const char* name, - int fixed); - - -LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, - void* data, int strip); - -#endif - - - - - - -#if !defined(luai_verifycode) -#define luai_verifycode(L,f) -#endif - - -typedef struct { - lua_State *L; - ZIO *Z; - const char *name; - Table *h; - lu_mem offset; - lua_Integer nstr; - lu_byte fixed; -} LoadState; - - -static l_noret private_lua_error (LoadState *S, const char *why) { - luaO_pushfstring(S->L, "%s: bad binary format (%s)", S->name, why); - luaD_throw(S->L, LUA_ERRSYNTAX); -} - - - -#define loadVector(S,b,n) loadBlock(S,b,(n)*sizeof((b)[0])) - -static void loadBlock (LoadState *S, void *b, size_t size) { - if (luaZ_read(S->Z, b, size) != 0) - private_lua_error(S, "truncated chunk"); - S->offset += size; -} - - -static void loadAlign (LoadState *S, int align) { - int padding = align - (S->offset % align); - if (padding < align) { - lua_Integer paddingContent; - loadBlock(S, &paddingContent, padding); - lua_assert(S->offset % align == 0); - } -} - - -#define getaddr(S,n,t) cast(t *, getaddr_(S,(n) * sizeof(t))) - -static const void *getaddr_ (LoadState *S, size_t size) { - const void *block = luaZ_getaddr(S->Z, size); - S->offset += size; - if (block == NULL) - private_lua_error(S, "truncated fixed buffer"); - return block; -} - - -#define loadVar(S,x) loadVector(S,&x,1) - - -static lu_byte loadByte (LoadState *S) { - int b = zgetc(S->Z); - if (b == EOZ) - private_lua_error(S, "truncated chunk"); - S->offset++; - return cast_byte(b); -} - - -static size_t loadVarint (LoadState *S, size_t limit) { - size_t x = 0; - int b; - limit >>= 7; - do { - b = loadByte(S); - if (x > limit) - private_lua_error(S, "integer overflow"); - x = (x << 7) | (b & 0x7f); - } while ((b & 0x80) != 0); - return x; -} - - -static size_t loadSize (LoadState *S) { - return loadVarint(S, MAX_SIZET); -} - - -static int loadInt (LoadState *S) { - return cast_int(loadVarint(S, cast_sizet(INT_MAX))); -} - - -static lua_Number loadNumber (LoadState *S) { - lua_Number x; - loadVar(S, x); - return x; -} - - -static lua_Integer loadInteger (LoadState *S) { - lua_Integer x; - loadVar(S, x); - return x; -} - - - -static void loadString (LoadState *S, Proto *p, TString **sl) { - lua_State *L = S->L; - TString *ts; - TValue sv; - size_t size = loadSize(S); - if (size == 0) { - lua_assert(*sl == NULL); - return; - } - else if (size == 1) { - lua_Integer idx = cast(lua_Integer, loadSize(S)); - TValue stv; - luaH_getint(S->h, idx, &stv); - *sl = ts = tsvalue(&stv); - luaC_objbarrier(L, p, ts); - return; - } - else if ((size -= 2) <= LUAI_MAXSHORTLEN) { - char buff[LUAI_MAXSHORTLEN + 1]; - loadVector(S, buff, size + 1); - *sl = ts = luaS_newlstr(L, buff, size); - luaC_objbarrier(L, p, ts); - } - else if (S->fixed) { - const char *s = getaddr(S, size + 1, char); - *sl = ts = luaS_newextlstr(L, s, size, NULL, NULL); - luaC_objbarrier(L, p, ts); - } - else { - *sl = ts = luaS_createlngstrobj(L, size); - luaC_objbarrier(L, p, ts); - loadVector(S, getlngstr(ts), size + 1); - } - - S->nstr++; - setsvalue(L, &sv, ts); - luaH_setint(L, S->h, S->nstr, &sv); - luaC_objbarrierback(L, obj2gco(S->h), ts); -} - - -static void loadCode (LoadState *S, Proto *f) { - int n = loadInt(S); - loadAlign(S, sizeof(f->code[0])); - if (S->fixed) { - f->code = getaddr(S, n, Instruction); - f->sizecode = n; - } - else { - f->code = luaM_newvectorchecked(S->L, n, Instruction); - f->sizecode = n; - loadVector(S, f->code, n); - } -} - - -static void loadFunction(LoadState *S, Proto *f); - - -static void loadConstants (LoadState *S, Proto *f) { - int i; - int n = loadInt(S); - f->k = luaM_newvectorchecked(S->L, n, TValue); - f->sizek = n; - for (i = 0; i < n; i++) - setnilvalue(&f->k[i]); - for (i = 0; i < n; i++) { - TValue *o = &f->k[i]; - int t = loadByte(S); - switch (t) { - case LUA_VNIL: - setnilvalue(o); - break; - case LUA_VFALSE: - setbfvalue(o); - break; - case LUA_VTRUE: - setbtvalue(o); - break; - case LUA_VNUMFLT: - setfltvalue(o, loadNumber(S)); - break; - case LUA_VNUMINT: - setivalue(o, loadInteger(S)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - lua_assert(f->source == NULL); - loadString(S, f, &f->source); - if (f->source == NULL) - private_lua_error(S, "bad format for constant string"); - setsvalue2n(S->L, o, f->source); - f->source = NULL; - break; - } - default: lua_assert(0); - } - } -} - - -static void loadProtos (LoadState *S, Proto *f) { - int i; - int n = loadInt(S); - f->p = luaM_newvectorchecked(S->L, n, Proto *); - f->sizep = n; - for (i = 0; i < n; i++) - f->p[i] = NULL; - for (i = 0; i < n; i++) { - f->p[i] = luaF_newproto(S->L); - luaC_objbarrier(S->L, f, f->p[i]); - loadFunction(S, f->p[i]); - } -} - - - -static void loadUpvalues (LoadState *S, Proto *f) { - int i, n; - n = loadInt(S); - f->upvalues = luaM_newvectorchecked(S->L, n, Upvaldesc); - f->sizeupvalues = n; - for (i = 0; i < n; i++) - f->upvalues[i].name = NULL; - for (i = 0; i < n; i++) { - f->upvalues[i].instack = loadByte(S); - f->upvalues[i].idx = loadByte(S); - f->upvalues[i].kind = loadByte(S); - } -} - - -static void loadDebug (LoadState *S, Proto *f) { - int i, n; - n = loadInt(S); - if (S->fixed) { - f->lineinfo = getaddr(S, n, ls_byte); - f->sizelineinfo = n; - } - else { - f->lineinfo = luaM_newvectorchecked(S->L, n, ls_byte); - f->sizelineinfo = n; - loadVector(S, f->lineinfo, n); - } - n = loadInt(S); - if (n > 0) { - loadAlign(S, sizeof(int)); - if (S->fixed) { - f->abslineinfo = getaddr(S, n, AbsLineInfo); - f->sizeabslineinfo = n; - } - else { - f->abslineinfo = luaM_newvectorchecked(S->L, n, AbsLineInfo); - f->sizeabslineinfo = n; - loadVector(S, f->abslineinfo, n); - } - } - n = loadInt(S); - f->locvars = luaM_newvectorchecked(S->L, n, LocVar); - f->sizelocvars = n; - for (i = 0; i < n; i++) - f->locvars[i].varname = NULL; - for (i = 0; i < n; i++) { - loadString(S, f, &f->locvars[i].varname); - f->locvars[i].startpc = loadInt(S); - f->locvars[i].endpc = loadInt(S); - } - n = loadInt(S); - if (n != 0) - n = f->sizeupvalues; - for (i = 0; i < n; i++) - loadString(S, f, &f->upvalues[i].name); -} - - -static void loadFunction (LoadState *S, Proto *f) { - f->linedefined = loadInt(S); - f->lastlinedefined = loadInt(S); - f->numparams = loadByte(S); - f->flag = loadByte(S) & PF_ISVARARG; - if (S->fixed) - f->flag |= PF_FIXED; - f->maxstacksize = loadByte(S); - loadCode(S, f); - loadConstants(S, f); - loadUpvalues(S, f); - loadProtos(S, f); - loadString(S, f, &f->source); - loadDebug(S, f); -} - - -static void checkliteral (LoadState *S, const char *s, const char *msg) { - char buff[sizeof(LUA_SIGNATURE) + sizeof(LUAC_DATA)]; - size_t len = strlen(s); - loadVector(S, buff, len); - if (memcmp(s, buff, len) != 0) - private_lua_error(S, msg); -} - - -static void fchecksize (LoadState *S, size_t size, const char *tname) { - if (loadByte(S) != size) - private_lua_error(S, luaO_pushfstring(S->L, "%s size mismatch", tname)); -} - - -#define checksize(S,t) fchecksize(S,sizeof(t),#t) - -static void checkHeader (LoadState *S) { - - checkliteral(S, &LUA_SIGNATURE[1], "not a binary chunk"); - if (loadByte(S) != LUAC_VERSION) - private_lua_error(S, "version mismatch"); - if (loadByte(S) != LUAC_FORMAT) - private_lua_error(S, "format mismatch"); - checkliteral(S, LUAC_DATA, "corrupted chunk"); - checksize(S, Instruction); - checksize(S, lua_Integer); - checksize(S, lua_Number); - if (loadInteger(S) != LUAC_INT) - private_lua_error(S, "integer format mismatch"); - if (loadNumber(S) != LUAC_NUM) - private_lua_error(S, "float format mismatch"); -} - - - -LClosure *luaU_undump (lua_State *L, ZIO *Z, const char *name, int fixed) { - LoadState S; - LClosure *cl; - if (*name == '@' || *name == '=') - S.name = name + 1; - else if (*name == LUA_SIGNATURE[0]) - S.name = "binary string"; - else - S.name = name; - S.L = L; - S.Z = Z; - S.fixed = fixed; - S.offset = 1; - checkHeader(&S); - cl = luaF_newLclosure(L, loadByte(&S)); - setclLvalue2s(L, L->top.p, cl); - luaD_inctop(L); - S.h = luaH_new(L); - S.nstr = 0; - sethvalue2s(L, L->top.p, S.h); - luaD_inctop(L); - cl->p = luaF_newproto(L); - luaC_objbarrier(L, cl, cl->p); - loadFunction(&S, cl->p); - lua_assert(cl->nupvalues == cl->p->sizeupvalues); - luai_verifycode(L, cl->p); - L->top.p--; - return cl; -} - - - -//path: src/imports/../dependencies/lua/ldump.c - - -#define ldump_c -#define LUA_CORE - - - - - -#include -#include - - - - - - - - - - - - - - - - -typedef struct { - lua_State *L; - lua_Writer writer; - void *data; - lu_mem offset; - int strip; - int status; - Table *h; - lua_Integer nstr; -} DumpState; - - - -#define dumpVector(D,v,n) dumpBlock(D,v,(n)*sizeof((v)[0])) - -#define dumpLiteral(D, s) dumpBlock(D,s,sizeof(s) - sizeof(char)) - - - -static void dumpBlock (DumpState *D, const void *b, size_t size) { - if (D->status == 0) { - lua_unlock(D->L); - D->status = (*D->writer)(D->L, b, size, D->data); - lua_lock(D->L); - D->offset += size; - } -} - - - -static void dumpAlign (DumpState *D, int align) { - int padding = align - (D->offset % align); - if (padding < align) { - static lua_Integer paddingContent = 0; - lua_assert(cast_uint(align) <= sizeof(lua_Integer)); - dumpBlock(D, &paddingContent, padding); - } - lua_assert(D->offset % align == 0); -} - - -#define dumpVar(D,x) dumpVector(D,&x,1) - - -static void dumpByte (DumpState *D, int y) { - lu_byte x = (lu_byte)y; - dumpVar(D, x); -} - - - -#define DIBS ((sizeof(size_t) * CHAR_BIT + 6) / 7) - - -static void dumpVarint (DumpState *D, size_t x) { - lu_byte buff[DIBS]; - int n = 1; - buff[DIBS - 1] = x & 0x7f; - while ((x >>= 7) != 0) - buff[DIBS - (++n)] = (x & 0x7f) | 0x80; - dumpVector(D, buff + DIBS - n, n); -} - - -static void dumpSize (DumpState *D, size_t sz) { - dumpVarint(D, sz); -} - -static void dumpInt (DumpState *D, int x) { - lua_assert(x >= 0); - dumpVarint(D, cast(size_t, x)); -} - - -static void dumpNumber (DumpState *D, lua_Number x) { - dumpVar(D, x); -} - - -static void dumpInteger (DumpState *D, lua_Integer x) { - dumpVar(D, x); -} - - - -static void dumpString (DumpState *D, TString *ts) { - if (ts == NULL) - dumpSize(D, 0); - else { - TValue idx; - int tag = luaH_getstr(D->h, ts, &idx); - if (!tagisempty(tag)) { - dumpSize(D, 1); - dumpSize(D, cast_sizet(ivalue(&idx))); - } - else { - TValue key, value; - size_t size; - const char *s = getlstr(ts, size); - dumpSize(D, size + 2); - dumpVector(D, s, size + 1); - D->nstr++; - setsvalue(D->L, &key, ts); - setivalue(&value, D->nstr); - luaH_set(D->L, D->h, &key, &value); - - } - } -} - - -static void dumpCode (DumpState *D, const Proto *f) { - dumpInt(D, f->sizecode); - dumpAlign(D, sizeof(f->code[0])); - lua_assert(f->code != NULL); - dumpVector(D, f->code, f->sizecode); -} - - -static void dumpFunction (DumpState *D, const Proto *f); - -static void dumpConstants (DumpState *D, const Proto *f) { - int i; - int n = f->sizek; - dumpInt(D, n); - for (i = 0; i < n; i++) { - const TValue *o = &f->k[i]; - int tt = ttypetag(o); - dumpByte(D, tt); - switch (tt) { - case LUA_VNUMFLT: - dumpNumber(D, fltvalue(o)); - break; - case LUA_VNUMINT: - dumpInteger(D, ivalue(o)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - dumpString(D, tsvalue(o)); - break; - default: - lua_assert(tt == LUA_VNIL || tt == LUA_VFALSE || tt == LUA_VTRUE); - } - } -} - - -static void dumpProtos (DumpState *D, const Proto *f) { - int i; - int n = f->sizep; - dumpInt(D, n); - for (i = 0; i < n; i++) - dumpFunction(D, f->p[i]); -} - - -static void dumpUpvalues (DumpState *D, const Proto *f) { - int i, n = f->sizeupvalues; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpByte(D, f->upvalues[i].instack); - dumpByte(D, f->upvalues[i].idx); - dumpByte(D, f->upvalues[i].kind); - } -} - - -static void dumpDebug (DumpState *D, const Proto *f) { - int i, n; - n = (D->strip) ? 0 : f->sizelineinfo; - dumpInt(D, n); - if (f->lineinfo != NULL) - dumpVector(D, f->lineinfo, n); - n = (D->strip) ? 0 : f->sizeabslineinfo; - dumpInt(D, n); - if (n > 0) { - - dumpAlign(D, sizeof(int)); - dumpVector(D, f->abslineinfo, n); - } - n = (D->strip) ? 0 : f->sizelocvars; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpString(D, f->locvars[i].varname); - dumpInt(D, f->locvars[i].startpc); - dumpInt(D, f->locvars[i].endpc); - } - n = (D->strip) ? 0 : f->sizeupvalues; - dumpInt(D, n); - for (i = 0; i < n; i++) - dumpString(D, f->upvalues[i].name); -} - - -static void dumpFunction (DumpState *D, const Proto *f) { - dumpInt(D, f->linedefined); - dumpInt(D, f->lastlinedefined); - dumpByte(D, f->numparams); - dumpByte(D, f->flag); - dumpByte(D, f->maxstacksize); - dumpCode(D, f); - dumpConstants(D, f); - dumpUpvalues(D, f); - dumpProtos(D, f); - dumpString(D, D->strip ? NULL : f->source); - dumpDebug(D, f); -} - - -static void dumpHeader (DumpState *D) { - dumpLiteral(D, LUA_SIGNATURE); - dumpByte(D, LUAC_VERSION); - dumpByte(D, LUAC_FORMAT); - dumpLiteral(D, LUAC_DATA); - dumpByte(D, sizeof(Instruction)); - dumpByte(D, sizeof(lua_Integer)); - dumpByte(D, sizeof(lua_Number)); - dumpInteger(D, LUAC_INT); - dumpNumber(D, LUAC_NUM); -} - - - -int luaU_dump (lua_State *L, const Proto *f, lua_Writer w, void *data, - int strip) { - DumpState D; - D.h = luaH_new(L); - sethvalue2s(L, L->top.p, D.h); - L->top.p++; - D.L = L; - D.writer = w; - D.offset = 0; - D.data = data; - D.strip = strip; - D.status = 0; - D.nstr = 0; - dumpHeader(&D); - dumpByte(&D, f->sizeupvalues); - dumpFunction(&D, f); - dumpBlock(&D, NULL, 0); - return D.status; -} - - - -//path: src/imports/../dependencies/lua/lstate.c - - -#define lstate_c -#define LUA_CORE - - - - - -#include -#include - - - - -//path: src/imports/../dependencies/lua/lapi.h - - -#ifndef lapi_h -#define lapi_h - - - - - - - - - -#define api_incr_top(L) \ - (L->top.p++, api_check(L, L->top.p <= L->ci->top.p, "stack overflow")) - - - -#define adjustresults(L,nres) \ - { if ((nres) <= LUA_MULTRET && L->ci->top.p < L->top.p) \ - L->ci->top.p = L->top.p; } - - - -#define api_checknelems(L,n) \ - api_check(L, (n) < (L->top.p - L->ci->func.p), \ - "not enough elements in the stack") - - - -#define api_checkpop(L,n) \ - api_check(L, (n) < L->top.p - L->ci->func.p && \ - L->tbclist.p < L->top.p - (n), \ - "not enough free elements in the stack") - - - - -#define hastocloseCfunc(n) ((n) < LUA_MULTRET) - - -#define codeNresults(n) (-(n) - 3) -#define decodeNresults(n) (-(n) - 3) - -#endif - - - - - - - - - - -//path: src/imports/../dependencies/lua/llex.h - - -#ifndef llex_h -#define llex_h - -#include - - - - - - - - -#define FIRST_RESERVED (UCHAR_MAX + 1) - - -#if !defined(LUA_ENV) -#define LUA_ENV "_ENV" -#endif - - - -enum RESERVED { - - TK_AND = FIRST_RESERVED, TK_BREAK, - TK_DO, TK_ELSE, TK_ELSEIF, TK_END, TK_FALSE, TK_FOR, TK_FUNCTION, - TK_GOTO, TK_IF, TK_IN, TK_LOCAL, TK_NIL, TK_NOT, TK_OR, TK_REPEAT, - TK_RETURN, TK_THEN, TK_TRUE, TK_UNTIL, TK_WHILE, - - TK_IDIV, TK_CONCAT, TK_DOTS, TK_EQ, TK_GE, TK_LE, TK_NE, - TK_SHL, TK_SHR, - TK_DBCOLON, TK_EOS, - TK_FLT, TK_INT, TK_NAME, TK_STRING -}; - - -#define NUM_RESERVED (cast_int(TK_WHILE-FIRST_RESERVED + 1)) - - -typedef union { - lua_Number r; - lua_Integer i; - TString *ts; -} SemInfo; - - -typedef struct Token { - int token; - SemInfo seminfo; -} Token; - - - -typedef struct LexState { - int current; - int linenumber; - int lastline; - Token t; - Token lookahead; - struct FuncState *fs; - struct lua_State *L; - ZIO *z; - Mbuffer *buff; - Table *h; - struct Dyndata *dyd; - TString *source; - TString *envn; -} LexState; - - -LUAI_FUNC void luaX_init (lua_State *L); -LUAI_FUNC void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, - TString *source, int firstchar); -LUAI_FUNC TString *luaX_newstring (LexState *ls, const char *str, size_t l); -LUAI_FUNC void luaX_next (LexState *ls); -LUAI_FUNC int luaX_lookahead (LexState *ls); -LUAI_FUNC l_noret luaX_syntaxerror (LexState *ls, const char *s); -LUAI_FUNC const char *luaX_token2str (LexState *ls, int token); - - -#endif - - - - - - - - - - - - - - - - -typedef struct LX { - lu_byte extra_[LUA_EXTRASPACE]; - lua_State l; -} LX; - - - -typedef struct LG { - LX l; - global_State g; -} LG; - - - -#define fromstate(L) (cast(LX *, cast(lu_byte *, (L)) - offsetof(LX, l))) - - - -void luaE_setdebt (global_State *g, l_obj debt) { - l_obj tb = gettotalobjs(g); - lua_assert(tb > 0); - if (debt > MAX_LOBJ - tb) - debt = MAX_LOBJ - tb; - g->totalobjs = tb + debt; - g->GCdebt = debt; -} - - -CallInfo *luaE_extendCI (lua_State *L) { - CallInfo *ci; - lua_assert(L->ci->next == NULL); - ci = luaM_new(L, CallInfo); - lua_assert(L->ci->next == NULL); - L->ci->next = ci; - ci->previous = L->ci; - ci->next = NULL; - ci->u.l.trap = 0; - L->nci++; - return ci; -} - - - -static void freeCI (lua_State *L) { - CallInfo *ci = L->ci; - CallInfo *next = ci->next; - ci->next = NULL; - while ((ci = next) != NULL) { - next = ci->next; - luaM_free(L, ci); - L->nci--; - } -} - - - -void luaE_shrinkCI (lua_State *L) { - CallInfo *ci = L->ci->next; - CallInfo *next; - if (ci == NULL) - return; - while ((next = ci->next) != NULL) { - CallInfo *next2 = next->next; - ci->next = next2; - L->nci--; - luaM_free(L, next); - if (next2 == NULL) - break; - else { - next2->previous = ci; - ci = next2; - } - } -} - - - -void luaE_checkcstack (lua_State *L) { - if (getCcalls(L) == LUAI_MAXCCALLS) - luaG_runerror(L, "C stack overflow"); - else if (getCcalls(L) >= (LUAI_MAXCCALLS / 10 * 11)) - luaD_throw(L, LUA_ERRERR); -} - - -LUAI_FUNC void luaE_incCstack (lua_State *L) { - L->nCcalls++; - if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) - luaE_checkcstack(L); -} - - -static void stack_init (lua_State *L1, lua_State *L) { - int i; CallInfo *ci; - - L1->stack.p = luaM_newvector(L, BASIC_STACK_SIZE + EXTRA_STACK, StackValue); - L1->tbclist.p = L1->stack.p; - for (i = 0; i < BASIC_STACK_SIZE + EXTRA_STACK; i++) - setnilvalue(s2v(L1->stack.p + i)); - L1->top.p = L1->stack.p; - L1->stack_last.p = L1->stack.p + BASIC_STACK_SIZE; - - ci = &L1->base_ci; - ci->next = ci->previous = NULL; - ci->callstatus = CIST_C; - ci->func.p = L1->top.p; - ci->u.c.k = NULL; - ci->nresults = 0; - setnilvalue(s2v(L1->top.p)); - L1->top.p++; - ci->top.p = L1->top.p + LUA_MINSTACK; - L1->ci = ci; -} - - -static void freestack (lua_State *L) { - if (L->stack.p == NULL) - return; - L->ci = &L->base_ci; - freeCI(L); - lua_assert(L->nci == 0); - luaM_freearray(L, L->stack.p, stacksize(L) + EXTRA_STACK); -} - - - -static void init_registry (lua_State *L, global_State *g) { - - TValue aux; - Table *registry = luaH_new(L); - sethvalue(L, &g->l_registry, registry); - luaH_resize(L, registry, LUA_RIDX_LAST, 0); - - setbfvalue(&aux); - luaH_setint(L, registry, 1, &aux); - - setthvalue(L, &aux, L); - luaH_setint(L, registry, LUA_RIDX_MAINTHREAD, &aux); - - sethvalue(L, &aux, luaH_new(L)); - luaH_setint(L, registry, LUA_RIDX_GLOBALS, &aux); -} - - - -static void f_luaopen (lua_State *L, void *ud) { - global_State *g = G(L); - UNUSED(ud); - stack_init(L, L); - init_registry(L, g); - luaS_init(L); - luaT_init(L); - luaX_init(L); - g->gcstp = 0; - setnilvalue(&g->nilvalue); - luai_userstateopen(L); -} - - - -static void preinit_thread (lua_State *L, global_State *g) { - G(L) = g; - L->stack.p = NULL; - L->ci = NULL; - L->nci = 0; - L->twups = L; - L->nCcalls = 0; - L->errorJmp = NULL; - L->hook = NULL; - L->hookmask = 0; - L->basehookcount = 0; - L->allowhook = 1; - resethookcount(L); - L->openupval = NULL; - L->status = LUA_OK; - L->errfunc = 0; - L->oldpc = 0; -} - - -static void close_state (lua_State *L) { - global_State *g = G(L); - if (!completestate(g)) - luaC_freeallobjects(L); - else { - L->ci = &L->base_ci; - luaD_closeprotected(L, 1, LUA_OK); - luaC_freeallobjects(L); - luai_userstateclose(L); - } - luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size); - freestack(L); - lua_assert(g->totalbytes == sizeof(LG)); - lua_assert(gettotalobjs(g) == 1); - (*g->frealloc)(g->ud, fromstate(L), sizeof(LG), 0); -} - - -LUA_API lua_State *lua_newthread (lua_State *L) { - global_State *g = G(L); - GCObject *o; - lua_State *L1; - lua_lock(L); - luaC_checkGC(L); - - o = luaC_newobjdt(L, LUA_TTHREAD, sizeof(LX), offsetof(LX, l)); - L1 = gco2th(o); - - setthvalue2s(L, L->top.p, L1); - api_incr_top(L); - preinit_thread(L1, g); - L1->hookmask = L->hookmask; - L1->basehookcount = L->basehookcount; - L1->hook = L->hook; - resethookcount(L1); - - memcpy(lua_getextraspace(L1), lua_getextraspace(g->mainthread), - LUA_EXTRASPACE); - luai_userstatethread(L, L1); - stack_init(L1, L); - lua_unlock(L); - return L1; -} - - -void luaE_freethread (lua_State *L, lua_State *L1) { - LX *l = fromstate(L1); - luaF_closeupval(L1, L1->stack.p); - lua_assert(L1->openupval == NULL); - luai_userstatefree(L, L1); - freestack(L1); - luaM_free(L, l); -} - - -int luaE_resetthread (lua_State *L, int status) { - CallInfo *ci = L->ci = &L->base_ci; - setnilvalue(s2v(L->stack.p)); - ci->func.p = L->stack.p; - ci->callstatus = CIST_C; - if (status == LUA_YIELD) - status = LUA_OK; - L->status = LUA_OK; - status = luaD_closeprotected(L, 1, status); - if (status != LUA_OK) - luaD_seterrorobj(L, status, L->stack.p + 1); - else - L->top.p = L->stack.p + 1; - ci->top.p = L->top.p + LUA_MINSTACK; - luaD_reallocstack(L, cast_int(ci->top.p - L->stack.p), 0); - return status; -} - - -LUA_API int lua_closethread (lua_State *L, lua_State *from) { - int status; - lua_lock(L); - L->nCcalls = (from) ? getCcalls(from) : 0; - status = luaE_resetthread(L, L->status); - lua_unlock(L); - return status; -} - - -LUA_API lua_State *lua_newstate (lua_Alloc f, void *ud, unsigned seed) { - int i; - lua_State *L; - global_State *g; - LG *l = cast(LG *, (*f)(ud, NULL, LUA_TTHREAD, sizeof(LG))); - if (l == NULL) return NULL; - L = &l->l.l; - g = &l->g; - L->tt = LUA_VTHREAD; - g->currentwhite = bitmask(WHITE0BIT); - L->marked = luaC_white(g); - preinit_thread(L, g); - g->allgc = obj2gco(L); - L->next = NULL; - incnny(L); - g->frealloc = f; - g->ud = ud; - g->warnf = NULL; - g->ud_warn = NULL; - g->mainthread = L; - g->seed = seed; - g->gcstp = GCSTPGC; - g->strt.size = g->strt.nuse = 0; - g->strt.hash = NULL; - setnilvalue(&g->l_registry); - g->panic = NULL; - g->gcstate = GCSpause; - g->gckind = KGC_INC; - g->gcstopem = 0; - g->gcemergency = 0; - g->finobj = g->tobefnz = g->fixedgc = NULL; - g->firstold1 = g->survival = g->old1 = g->reallyold = NULL; - g->finobjsur = g->finobjold1 = g->finobjrold = NULL; - g->sweepgc = NULL; - g->gray = g->grayagain = NULL; - g->weak = g->ephemeron = g->allweak = NULL; - g->twups = NULL; - g->totalbytes = sizeof(LG); - g->totalobjs = 1; - g->marked = 0; - g->GCdebt = 0; - setivalue(&g->nilvalue, 0); - setgcparam(g, PAUSE, LUAI_GCPAUSE); - setgcparam(g, STEPMUL, LUAI_GCMUL); - setgcparam(g, STEPSIZE, LUAI_GCSTEPSIZE); - setgcparam(g, MINORMUL, LUAI_GENMINORMUL); - setgcparam(g, MINORMAJOR, LUAI_MINORMAJOR); - setgcparam(g, MAJORMINOR, LUAI_MAJORMINOR); - for (i=0; i < LUA_NUMTYPES; i++) g->mt[i] = NULL; - if (luaD_rawrunprotected(L, f_luaopen, NULL) != LUA_OK) { - - close_state(L); - L = NULL; - } - return L; -} - - -LUA_API void lua_close (lua_State *L) { - lua_lock(L); - L = G(L)->mainthread; - close_state(L); -} - - -void luaE_warning (lua_State *L, const char *msg, int tocont) { - lua_WarnFunction wf = G(L)->warnf; - if (wf != NULL) - wf(G(L)->ud_warn, msg, tocont); -} - - - -void luaE_warnerror (lua_State *L, const char *where) { - TValue *errobj = s2v(L->top.p - 1); - const char *msg = (ttisstring(errobj)) - ? getstr(tsvalue(errobj)) - : "private_lua_error object is not a string"; - - luaE_warning(L, "private_lua_error in ", 1); - luaE_warning(L, where, 1); - luaE_warning(L, " (", 1); - luaE_warning(L, msg, 1); - luaE_warning(L, ")", 0); -} - - - -//path: src/imports/../dependencies/lua/lgc.c - - -#define lgc_c -#define LUA_CORE - - - - -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -#define NFIXED (TM_N + NUM_RESERVED + 2) - - - -#define GCSWEEPMAX 20 - - - -#define maskcolors (bitmask(BLACKBIT) | WHITEBITS) - - -#define maskgcbits (maskcolors | AGEBITS) - - - -#define makewhite(g,x) \ - (x->marked = cast_byte((x->marked & ~maskcolors) | luaC_white(g))) - - -#define set2gray(x) resetbits(x->marked, maskcolors) - - - -#define set2black(x) \ - (x->marked = cast_byte((x->marked & ~WHITEBITS) | bitmask(BLACKBIT))) - - -#define valiswhite(x) (iscollectable(x) && iswhite(gcvalue(x))) - -#define keyiswhite(n) (keyiscollectable(n) && iswhite(gckey(n))) - - - -#define gcvalueN(o) (iscollectable(o) ? gcvalue(o) : NULL) - - - -#define gcvalarr(t,i) \ - ((*getArrTag(t,i) & BIT_ISCOLLECTABLE) ? getArrVal(t,i)->gc : NULL) - - -#define markvalue(g,o) { checkliveness(g->mainthread,o); \ - if (valiswhite(o)) reallymarkobject(g,gcvalue(o)); } - -#define markkey(g, n) { if keyiswhite(n) reallymarkobject(g,gckey(n)); } - -#define markobject(g,t) { if (iswhite(t)) reallymarkobject(g, obj2gco(t)); } - - -#define markobjectN(g,t) { if (t) markobject(g,t); } - - -static void reallymarkobject (global_State *g, GCObject *o); -static l_obj atomic (lua_State *L); -static void entersweep (lua_State *L); - - - - - - -#define gnodelast(h) gnode(h, cast_sizet(sizenode(h))) - - -static GCObject **getgclist (GCObject *o) { - switch (o->tt) { - case LUA_VTABLE: return &gco2t(o)->gclist; - case LUA_VLCL: return &gco2lcl(o)->gclist; - case LUA_VCCL: return &gco2ccl(o)->gclist; - case LUA_VTHREAD: return &gco2th(o)->gclist; - case LUA_VPROTO: return &gco2p(o)->gclist; - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - lua_assert(u->nuvalue > 0); - return &u->gclist; - } - default: lua_assert(0); return 0; - } -} - - - -#define linkgclist(o,p) linkgclist_(obj2gco(o), &(o)->gclist, &(p)) - -static void linkgclist_ (GCObject *o, GCObject **pnext, GCObject **list) { - lua_assert(!isgray(o)); - *pnext = *list; - *list = o; - set2gray(o); -} - - - -#define linkobjgclist(o,p) linkgclist_(obj2gco(o), getgclist(o), &(p)) - - - - -static void clearkey (Node *n) { - lua_assert(isempty(gval(n))); - if (keyiscollectable(n)) - setdeadkey(n); -} - - - -static int iscleared (global_State *g, const GCObject *o) { - if (o == NULL) return 0; - else if (novariant(o->tt) == LUA_TSTRING) { - markobject(g, o); - return 0; - } - else return iswhite(o); -} - - - -void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v) { - global_State *g = G(L); - lua_assert(isblack(o) && iswhite(v) && !isdead(g, v) && !isdead(g, o)); - if (keepinvariant(g)) { - reallymarkobject(g, v); - if (isold(o)) { - lua_assert(!isold(v)); - setage(v, G_OLD0); - } - } - else { - lua_assert(issweepphase(g)); - if (g->gckind != KGC_GENMINOR) - makewhite(g, o); - } -} - - - -void luaC_barrierback_ (lua_State *L, GCObject *o) { - global_State *g = G(L); - lua_assert(isblack(o) && !isdead(g, o)); - lua_assert((g->gckind != KGC_GENMINOR) - || (isold(o) && getage(o) != G_TOUCHED1)); - if (getage(o) == G_TOUCHED2) - set2gray(o); - else - linkobjgclist(o, g->grayagain); - if (isold(o)) - setage(o, G_TOUCHED1); -} - - -void luaC_fix (lua_State *L, GCObject *o) { - global_State *g = G(L); - lua_assert(g->allgc == o); - set2gray(o); - setage(o, G_OLD); - g->allgc = o->next; - o->next = g->fixedgc; - g->fixedgc = o; -} - - - -GCObject *luaC_newobjdt (lua_State *L, int tt, size_t sz, size_t offset) { - global_State *g = G(L); - char *p = cast_charp(luaM_newobject(L, novariant(tt), sz)); - GCObject *o = cast(GCObject *, p + offset); - g->GCdebt--; - o->marked = luaC_white(g); - o->tt = tt; - o->next = g->allgc; - g->allgc = o; - return o; -} - - - -GCObject *luaC_newobj (lua_State *L, int tt, size_t sz) { - return luaC_newobjdt(L, tt, sz, 0); -} - - - - - - - - - -static void reallymarkobject (global_State *g, GCObject *o) { - g->marked++; - switch (o->tt) { - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - set2black(o); - break; - } - case LUA_VUPVAL: { - UpVal *uv = gco2upv(o); - if (upisopen(uv)) - set2gray(uv); - else - set2black(uv); - markvalue(g, uv->v.p); - break; - } - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - if (u->nuvalue == 0) { - markobjectN(g, u->metatable); - set2black(u); - break; - } - - } - case LUA_VLCL: case LUA_VCCL: case LUA_VTABLE: - case LUA_VTHREAD: case LUA_VPROTO: { - linkobjgclist(o, g->gray); - break; - } - default: lua_assert(0); break; - } -} - - - -static void markmt (global_State *g) { - int i; - for (i=0; i < LUA_NUMTYPES; i++) - markobjectN(g, g->mt[i]); -} - - - -static l_obj markbeingfnz (global_State *g) { - GCObject *o; - l_obj count = 0; - for (o = g->tobefnz; o != NULL; o = o->next) { - count++; - markobject(g, o); - } - return count; -} - - - -static l_obj remarkupvals (global_State *g) { - l_obj work = 0; - lua_State *thread; - lua_State **p = &g->twups; - while ((thread = *p) != NULL) { - if (!iswhite(thread) && thread->openupval != NULL) - p = &thread->twups; - else { - UpVal *uv; - lua_assert(!isold(thread) || thread->openupval == NULL); - *p = thread->twups; - thread->twups = thread; - for (uv = thread->openupval; uv != NULL; uv = uv->u.open.next) { - lua_assert(getage(uv) <= getage(thread)); - if (!iswhite(uv)) { - lua_assert(upisopen(uv) && isgray(uv)); - markvalue(g, uv->v.p); - } - } - } - work++; - } - return work; -} - - -static void cleargraylists (global_State *g) { - g->gray = g->grayagain = NULL; - g->weak = g->allweak = g->ephemeron = NULL; -} - - - -static void restartcollection (global_State *g) { - cleargraylists(g); - g->marked = NFIXED; - markobject(g, g->mainthread); - markvalue(g, &g->l_registry); - markmt(g); - markbeingfnz(g); -} - - - - - - - - -static void genlink (global_State *g, GCObject *o) { - lua_assert(isblack(o)); - if (getage(o) == G_TOUCHED1) { - linkobjgclist(o, g->grayagain); - } - else if (getage(o) == G_TOUCHED2) - setage(o, G_OLD); -} - - - -static void traverseweakvalue (global_State *g, Table *h) { - Node *n, *limit = gnodelast(h); - - int hasclears = (h->alimit > 0); - for (n = gnode(h, 0); n < limit; n++) { - if (isempty(gval(n))) - clearkey(n); - else { - lua_assert(!keyisnil(n)); - markkey(g, n); - if (!hasclears && iscleared(g, gcvalueN(gval(n)))) - hasclears = 1; - } - } - if (g->gcstate == GCSatomic && hasclears) - linkgclist(h, g->weak); - else - linkgclist(h, g->grayagain); -} - - - -static int traversearray (global_State *g, Table *h) { - unsigned asize = luaH_realasize(h); - int marked = 0; - unsigned i; - for (i = 0; i < asize; i++) { - GCObject *o = gcvalarr(h, i); - if (o != NULL && iswhite(o)) { - marked = 1; - reallymarkobject(g, o); - } - } - return marked; -} - - - -static int traverseephemeron (global_State *g, Table *h, int inv) { - int hasclears = 0; - int hasww = 0; - unsigned int i; - unsigned int nsize = sizenode(h); - int marked = traversearray(g, h); - - for (i = 0; i < nsize; i++) { - Node *n = inv ? gnode(h, nsize - 1 - i) : gnode(h, i); - if (isempty(gval(n))) - clearkey(n); - else if (iscleared(g, gckeyN(n))) { - hasclears = 1; - if (valiswhite(gval(n))) - hasww = 1; - } - else if (valiswhite(gval(n))) { - marked = 1; - reallymarkobject(g, gcvalue(gval(n))); - } - } - - if (g->gcstate == GCSpropagate) - linkgclist(h, g->grayagain); - else if (hasww) - linkgclist(h, g->ephemeron); - else if (hasclears) - linkgclist(h, g->allweak); - else - genlink(g, obj2gco(h)); - return marked; -} - - -static void traversestrongtable (global_State *g, Table *h) { - Node *n, *limit = gnodelast(h); - traversearray(g, h); - for (n = gnode(h, 0); n < limit; n++) { - if (isempty(gval(n))) - clearkey(n); - else { - lua_assert(!keyisnil(n)); - markkey(g, n); - markvalue(g, gval(n)); - } - } - genlink(g, obj2gco(h)); -} - - -static void traversetable (global_State *g, Table *h) { - const char *weakkey, *weakvalue; - const TValue *mode = gfasttm(g, h->metatable, TM_MODE); - TString *smode; - markobjectN(g, h->metatable); - if (mode && ttisshrstring(mode) && - (cast_void(smode = tsvalue(mode)), - cast_void(weakkey = strchr(getshrstr(smode), 'k')), - cast_void(weakvalue = strchr(getshrstr(smode), 'v')), - (weakkey || weakvalue))) { - if (!weakkey) - traverseweakvalue(g, h); - else if (!weakvalue) - traverseephemeron(g, h, 0); - else - linkgclist(h, g->allweak); - } - else - traversestrongtable(g, h); -} - - -static void traverseudata (global_State *g, Udata *u) { - int i; - markobjectN(g, u->metatable); - for (i = 0; i < u->nuvalue; i++) - markvalue(g, &u->uv[i].uv); - genlink(g, obj2gco(u)); -} - - - -static void traverseproto (global_State *g, Proto *f) { - int i; - markobjectN(g, f->source); - for (i = 0; i < f->sizek; i++) - markvalue(g, &f->k[i]); - for (i = 0; i < f->sizeupvalues; i++) - markobjectN(g, f->upvalues[i].name); - for (i = 0; i < f->sizep; i++) - markobjectN(g, f->p[i]); - for (i = 0; i < f->sizelocvars; i++) - markobjectN(g, f->locvars[i].varname); -} - - -static void traverseCclosure (global_State *g, CClosure *cl) { - int i; - for (i = 0; i < cl->nupvalues; i++) - markvalue(g, &cl->upvalue[i]); -} - - -static void traverseLclosure (global_State *g, LClosure *cl) { - int i; - markobjectN(g, cl->p); - for (i = 0; i < cl->nupvalues; i++) { - UpVal *uv = cl->upvals[i]; - markobjectN(g, uv); - } -} - - - -static void traversethread (global_State *g, lua_State *th) { - UpVal *uv; - StkId o = th->stack.p; - if (isold(th) || g->gcstate == GCSpropagate) - linkgclist(th, g->grayagain); - if (o == NULL) - return; - lua_assert(g->gcstate == GCSatomic || - th->openupval == NULL || isintwups(th)); - for (; o < th->top.p; o++) - markvalue(g, s2v(o)); - for (uv = th->openupval; uv != NULL; uv = uv->u.open.next) - markobject(g, uv); - if (g->gcstate == GCSatomic) { - if (!g->gcemergency) - luaD_shrinkstack(th); - for (o = th->top.p; o < th->stack_last.p + EXTRA_STACK; o++) - setnilvalue(s2v(o)); - - if (!isintwups(th) && th->openupval != NULL) { - th->twups = g->twups; - g->twups = th; - } - } -} - - - -static void propagatemark (global_State *g) { - GCObject *o = g->gray; - nw2black(o); - g->gray = *getgclist(o); - switch (o->tt) { - case LUA_VTABLE: traversetable(g, gco2t(o)); break; - case LUA_VUSERDATA: traverseudata(g, gco2u(o)); break; - case LUA_VLCL: traverseLclosure(g, gco2lcl(o)); break; - case LUA_VCCL: traverseCclosure(g, gco2ccl(o)); break; - case LUA_VPROTO: traverseproto(g, gco2p(o)); break; - case LUA_VTHREAD: traversethread(g, gco2th(o)); break; - default: lua_assert(0); - } -} - - -static l_obj propagateall (global_State *g) { - l_obj work = 0; - while (g->gray) { - propagatemark(g); - work++; - } - return work; -} - - - -static l_obj convergeephemerons (global_State *g) { - int changed; - l_obj work = 0; - int dir = 0; - do { - GCObject *w; - GCObject *next = g->ephemeron; - g->ephemeron = NULL; - changed = 0; - while ((w = next) != NULL) { - Table *h = gco2t(w); - next = h->gclist; - nw2black(h); - if (traverseephemeron(g, h, dir)) { - propagateall(g); - changed = 1; - } - work++; - } - dir = !dir; - } while (changed); - return work; -} - - - - - - - - -static l_obj clearbykeys (global_State *g, GCObject *l) { - l_obj work = 0; - for (; l; l = gco2t(l)->gclist) { - Table *h = gco2t(l); - Node *limit = gnodelast(h); - Node *n; - for (n = gnode(h, 0); n < limit; n++) { - if (iscleared(g, gckeyN(n))) - setempty(gval(n)); - if (isempty(gval(n))) - clearkey(n); - } - work++; - } - return work; -} - - - -static l_obj clearbyvalues (global_State *g, GCObject *l, GCObject *f) { - l_obj work = 0; - for (; l != f; l = gco2t(l)->gclist) { - Table *h = gco2t(l); - Node *n, *limit = gnodelast(h); - unsigned int i; - unsigned int asize = luaH_realasize(h); - for (i = 0; i < asize; i++) { - GCObject *o = gcvalarr(h, i); - if (iscleared(g, o)) - *getArrTag(h, i) = LUA_VEMPTY; - } - for (n = gnode(h, 0); n < limit; n++) { - if (iscleared(g, gcvalueN(gval(n)))) - setempty(gval(n)); - if (isempty(gval(n))) - clearkey(n); - } - work++; - } - return work; -} - - -static void freeupval (lua_State *L, UpVal *uv) { - if (upisopen(uv)) - luaF_unlinkupval(uv); - luaM_free(L, uv); -} - - -static void freeobj (lua_State *L, GCObject *o) { - G(L)->totalobjs--; - switch (o->tt) { - case LUA_VPROTO: - luaF_freeproto(L, gco2p(o)); - break; - case LUA_VUPVAL: - freeupval(L, gco2upv(o)); - break; - case LUA_VLCL: { - LClosure *cl = gco2lcl(o); - luaM_freemem(L, cl, sizeLclosure(cl->nupvalues)); - break; - } - case LUA_VCCL: { - CClosure *cl = gco2ccl(o); - luaM_freemem(L, cl, sizeCclosure(cl->nupvalues)); - break; - } - case LUA_VTABLE: - luaH_free(L, gco2t(o)); - break; - case LUA_VTHREAD: - luaE_freethread(L, gco2th(o)); - break; - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - luaM_freemem(L, o, sizeudata(u->nuvalue, u->len)); - break; - } - case LUA_VSHRSTR: { - TString *ts = gco2ts(o); - luaS_remove(L, ts); - luaM_freemem(L, ts, sizestrshr(ts->shrlen)); - break; - } - case LUA_VLNGSTR: { - TString *ts = gco2ts(o); - if (ts->shrlen == LSTRMEM) - (*ts->falloc)(ts->ud, ts->contents, ts->u.lnglen + 1, 0); - luaM_freemem(L, ts, luaS_sizelngstr(ts->u.lnglen, ts->shrlen)); - break; - } - default: lua_assert(0); - } -} - - - -static GCObject **sweeplist (lua_State *L, GCObject **p, l_obj countin) { - global_State *g = G(L); - int ow = otherwhite(g); - l_obj i; - int white = luaC_white(g); - for (i = 0; *p != NULL && i < countin; i++) { - GCObject *curr = *p; - int marked = curr->marked; - if (isdeadm(ow, marked)) { - *p = curr->next; - freeobj(L, curr); - } - else { - curr->marked = cast_byte((marked & ~maskgcbits) | white | G_NEW); - p = &curr->next; - } - } - return (*p == NULL) ? NULL : p; -} - - - -static GCObject **sweeptolive (lua_State *L, GCObject **p) { - GCObject **old = p; - do { - p = sweeplist(L, p, 1); - } while (p == old); - return p; -} - - - - - - - -static void checkSizes (lua_State *L, global_State *g) { - if (!g->gcemergency) { - if (g->strt.nuse < g->strt.size / 4) - luaS_resize(L, g->strt.size / 2); - } -} - - - -static GCObject *udata2finalize (global_State *g) { - GCObject *o = g->tobefnz; - lua_assert(tofinalize(o)); - g->tobefnz = o->next; - o->next = g->allgc; - g->allgc = o; - resetbit(o->marked, FINALIZEDBIT); - if (issweepphase(g)) - makewhite(g, o); - else if (getage(o) == G_OLD1) - g->firstold1 = o; - return o; -} - - -static void dothecall (lua_State *L, void *ud) { - UNUSED(ud); - luaD_callnoyield(L, L->top.p - 2, 0); -} - - -static void GCTM (lua_State *L) { - global_State *g = G(L); - const TValue *tm; - TValue v; - lua_assert(!g->gcemergency); - setgcovalue(L, &v, udata2finalize(g)); - tm = luaT_gettmbyobj(L, &v, TM_GC); - if (!notm(tm)) { - int status; - lu_byte oldah = L->allowhook; - int oldgcstp = g->gcstp; - g->gcstp |= GCSTPGC; - L->allowhook = 0; - setobj2s(L, L->top.p++, tm); - setobj2s(L, L->top.p++, &v); - L->ci->callstatus |= CIST_FIN; - status = luaD_pcall(L, dothecall, NULL, savestack(L, L->top.p - 2), 0); - L->ci->callstatus &= ~CIST_FIN; - L->allowhook = oldah; - g->gcstp = oldgcstp; - if (l_unlikely(status != LUA_OK)) { - luaE_warnerror(L, "__gc"); - L->top.p--; - } - } -} - - - -static void callallpendingfinalizers (lua_State *L) { - global_State *g = G(L); - while (g->tobefnz) - GCTM(L); -} - - - -static GCObject **findlast (GCObject **p) { - while (*p != NULL) - p = &(*p)->next; - return p; -} - - - -static void separatetobefnz (global_State *g, int all) { - GCObject *curr; - GCObject **p = &g->finobj; - GCObject **lastnext = findlast(&g->tobefnz); - while ((curr = *p) != g->finobjold1) { - lua_assert(tofinalize(curr)); - if (!(iswhite(curr) || all)) - p = &curr->next; - else { - if (curr == g->finobjsur) - g->finobjsur = curr->next; - *p = curr->next; - curr->next = *lastnext; - *lastnext = curr; - lastnext = &curr->next; - } - } -} - - - -static void checkpointer (GCObject **p, GCObject *o) { - if (o == *p) - *p = o->next; -} - - - -static void correctpointers (global_State *g, GCObject *o) { - checkpointer(&g->survival, o); - checkpointer(&g->old1, o); - checkpointer(&g->reallyold, o); - checkpointer(&g->firstold1, o); -} - - - -void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt) { - global_State *g = G(L); - if (tofinalize(o) || - gfasttm(g, mt, TM_GC) == NULL || - (g->gcstp & GCSTPCLS)) - return; - else { - GCObject **p; - if (issweepphase(g)) { - makewhite(g, o); - if (g->sweepgc == &o->next) - g->sweepgc = sweeptolive(L, g->sweepgc); - } - else - correctpointers(g, o); - - for (p = &g->allgc; *p != o; p = &(*p)->next) { } - *p = o->next; - o->next = g->finobj; - g->finobj = o; - l_setbit(o->marked, FINALIZEDBIT); - } -} - - - - - - - - -static void setpause (global_State *g) { - l_obj threshold = applygcparam(g, PAUSE, g->marked); - l_obj debt = threshold - gettotalobjs(g); - if (debt < 0) debt = 0; - luaE_setdebt(g, debt); -} - - - -static void sweep2old (lua_State *L, GCObject **p) { - GCObject *curr; - global_State *g = G(L); - while ((curr = *p) != NULL) { - if (iswhite(curr)) { - lua_assert(isdead(g, curr)); - *p = curr->next; - freeobj(L, curr); - } - else { - setage(curr, G_OLD); - if (curr->tt == LUA_VTHREAD) { - lua_State *th = gco2th(curr); - linkgclist(th, g->grayagain); - } - else if (curr->tt == LUA_VUPVAL && upisopen(gco2upv(curr))) - set2gray(curr); - else - nw2black(curr); - p = &curr->next; - } - } -} - - - -static GCObject **sweepgen (lua_State *L, global_State *g, GCObject **p, - GCObject *limit, GCObject **pfirstold1, - l_obj *paddedold) { - static const lu_byte nextage[] = { - G_SURVIVAL, - G_OLD1, - G_OLD1, - G_OLD, - G_OLD, - G_TOUCHED1, - G_TOUCHED2 - }; - l_obj addedold = 0; - int white = luaC_white(g); - GCObject *curr; - while ((curr = *p) != limit) { - if (iswhite(curr)) { - lua_assert(!isold(curr) && isdead(g, curr)); - *p = curr->next; - freeobj(L, curr); - } - else { - int age = getage(curr); - if (age == G_NEW) { - int marked = curr->marked & ~maskgcbits; - curr->marked = cast_byte(marked | G_SURVIVAL | white); - } - else { - lua_assert(age != G_OLD1); - setage(curr, nextage[age]); - if (getage(curr) == G_OLD1) { - addedold++; - if (*pfirstold1 == NULL) - *pfirstold1 = curr; - } - } - p = &curr->next; - } - } - *paddedold += addedold; - return p; -} - - - -static GCObject **correctgraylist (GCObject **p) { - GCObject *curr; - while ((curr = *p) != NULL) { - GCObject **next = getgclist(curr); - if (iswhite(curr)) - goto remove; - else if (getage(curr) == G_TOUCHED1) { - lua_assert(isgray(curr)); - nw2black(curr); - setage(curr, G_TOUCHED2); - goto remain; - } - else if (curr->tt == LUA_VTHREAD) { - lua_assert(isgray(curr)); - goto remain; - } - else { - lua_assert(isold(curr)); - if (getage(curr) == G_TOUCHED2) - setage(curr, G_OLD); - nw2black(curr); - goto remove; - } - remove: *p = *next; continue; - remain: p = next; continue; - } - return p; -} - - - -static void correctgraylists (global_State *g) { - GCObject **list = correctgraylist(&g->grayagain); - *list = g->weak; g->weak = NULL; - list = correctgraylist(list); - *list = g->allweak; g->allweak = NULL; - list = correctgraylist(list); - *list = g->ephemeron; g->ephemeron = NULL; - correctgraylist(list); -} - - - -static void markold (global_State *g, GCObject *from, GCObject *to) { - GCObject *p; - for (p = from; p != to; p = p->next) { - if (getage(p) == G_OLD1) { - lua_assert(!iswhite(p)); - setage(p, G_OLD); - if (isblack(p)) - reallymarkobject(g, p); - } - } -} - - - -static void finishgencycle (lua_State *L, global_State *g) { - correctgraylists(g); - checkSizes(L, g); - g->gcstate = GCSpropagate; - if (!g->gcemergency) - callallpendingfinalizers(L); -} - - - -static void minor2inc (lua_State *L, global_State *g, int kind) { - g->GCmajorminor = g->marked; - g->gckind = kind; - g->reallyold = g->old1 = g->survival = NULL; - g->finobjrold = g->finobjold1 = g->finobjsur = NULL; - entersweep(L); - - luaE_setdebt(g, applygcparam(g, STEPSIZE, 100)); -} - - - -static int checkminormajor (global_State *g, l_obj addedold1) { - l_obj step = applygcparam(g, MINORMUL, g->GCmajorminor); - l_obj limit = applygcparam(g, MINORMAJOR, g->GCmajorminor); - return (addedold1 >= (step >> 1) || g->marked >= limit); -} - - -static void youngcollection (lua_State *L, global_State *g) { - l_obj addedold1 = 0; - l_obj marked = g->marked; - GCObject **psurvival; - GCObject *dummy; - lua_assert(g->gcstate == GCSpropagate); - if (g->firstold1) { - markold(g, g->firstold1, g->reallyold); - g->firstold1 = NULL; - } - markold(g, g->finobj, g->finobjrold); - markold(g, g->tobefnz, NULL); - - atomic(L); - - - g->gcstate = GCSswpallgc; - psurvival = sweepgen(L, g, &g->allgc, g->survival, &g->firstold1, &addedold1); - - sweepgen(L, g, psurvival, g->old1, &g->firstold1, &addedold1); - g->reallyold = g->old1; - g->old1 = *psurvival; - g->survival = g->allgc; - - - dummy = NULL; - psurvival = sweepgen(L, g, &g->finobj, g->finobjsur, &dummy, &addedold1); - - sweepgen(L, g, psurvival, g->finobjold1, &dummy, &addedold1); - g->finobjrold = g->finobjold1; - g->finobjold1 = *psurvival; - g->finobjsur = g->finobj; - - sweepgen(L, g, &g->tobefnz, NULL, &dummy, &addedold1); - - - g->marked = marked + addedold1; - - - if (checkminormajor(g, addedold1)) { - minor2inc(L, g, KGC_GENMAJOR); - g->marked = 0; - } - else - finishgencycle(L, g); -} - - - -static void atomic2gen (lua_State *L, global_State *g) { - cleargraylists(g); - - g->gcstate = GCSswpallgc; - sweep2old(L, &g->allgc); - - g->reallyold = g->old1 = g->survival = g->allgc; - g->firstold1 = NULL; - - - sweep2old(L, &g->finobj); - g->finobjrold = g->finobjold1 = g->finobjsur = g->finobj; - - sweep2old(L, &g->tobefnz); - - g->gckind = KGC_GENMINOR; - g->GCmajorminor = g->marked; - g->marked = 0; - finishgencycle(L, g); -} - - - -static void setminordebt (global_State *g) { - luaE_setdebt(g, applygcparam(g, MINORMUL, g->GCmajorminor)); -} - - - -static void entergen (lua_State *L, global_State *g) { - luaC_runtilstate(L, GCSpause, 1); - luaC_runtilstate(L, GCSpropagate, 1); - atomic(L); - atomic2gen(L, g); - setminordebt(g); -} - - - -void luaC_changemode (lua_State *L, int newmode) { - global_State *g = G(L); - if (g->gckind == KGC_GENMAJOR) - g->gckind = KGC_INC; - if (newmode != g->gckind) { - if (newmode == KGC_INC) - minor2inc(L, g, KGC_INC); - else { - lua_assert(newmode == KGC_GENMINOR); - entergen(L, g); - } - } -} - - - -static void fullgen (lua_State *L, global_State *g) { - minor2inc(L, g, KGC_INC); - entergen(L, g); -} - - - -static int checkmajorminor (lua_State *L, global_State *g) { - if (g->gckind == KGC_GENMAJOR) { - l_obj numobjs = gettotalobjs(g); - l_obj addedobjs = numobjs - g->GCmajorminor; - l_obj limit = applygcparam(g, MAJORMINOR, addedobjs); - l_obj tobecollected = numobjs - g->marked; - if (tobecollected > limit) { - atomic2gen(L, g); - setminordebt(g); - return 0; - } - } - g->GCmajorminor = g->marked; - return 1; -} - - - - - - - - -static void entersweep (lua_State *L) { - global_State *g = G(L); - g->gcstate = GCSswpallgc; - lua_assert(g->sweepgc == NULL); - g->sweepgc = sweeptolive(L, &g->allgc); -} - - - -static void deletelist (lua_State *L, GCObject *p, GCObject *limit) { - while (p != limit) { - GCObject *next = p->next; - freeobj(L, p); - p = next; - } -} - - - -void luaC_freeallobjects (lua_State *L) { - global_State *g = G(L); - g->gcstp = GCSTPCLS; - luaC_changemode(L, KGC_INC); - separatetobefnz(g, 1); - lua_assert(g->finobj == NULL); - callallpendingfinalizers(L); - deletelist(L, g->allgc, obj2gco(g->mainthread)); - lua_assert(g->finobj == NULL); - deletelist(L, g->fixedgc, NULL); - lua_assert(g->strt.nuse == 0); -} - - -static l_obj atomic (lua_State *L) { - l_obj work = 0; - global_State *g = G(L); - GCObject *origweak, *origall; - GCObject *grayagain = g->grayagain; - g->grayagain = NULL; - lua_assert(g->ephemeron == NULL && g->weak == NULL); - lua_assert(!iswhite(g->mainthread)); - g->gcstate = GCSatomic; - markobject(g, L); - - markvalue(g, &g->l_registry); - markmt(g); - work += propagateall(g); - - work += remarkupvals(g); - work += propagateall(g); - g->gray = grayagain; - work += propagateall(g); - work += convergeephemerons(g); - - - work += clearbyvalues(g, g->weak, NULL); - work += clearbyvalues(g, g->allweak, NULL); - origweak = g->weak; origall = g->allweak; - separatetobefnz(g, 0); - work += markbeingfnz(g); - work += propagateall(g); - work += convergeephemerons(g); - - - work += clearbykeys(g, g->ephemeron); - work += clearbykeys(g, g->allweak); - - work += clearbyvalues(g, g->weak, origweak); - work += clearbyvalues(g, g->allweak, origall); - luaS_clearcache(g); - g->currentwhite = cast_byte(otherwhite(g)); - lua_assert(g->gray == NULL); - return work; -} - - - -static void sweepstep (lua_State *L, global_State *g, - int nextstate, GCObject **nextlist, int fast) { - if (g->sweepgc) - g->sweepgc = sweeplist(L, g->sweepgc, fast ? MAX_LOBJ : GCSWEEPMAX); - else { - g->gcstate = nextstate; - g->sweepgc = nextlist; - } -} - - - -static l_obj singlestep (lua_State *L, int fast) { - global_State *g = G(L); - l_obj work; - lua_assert(!g->gcstopem); - g->gcstopem = 1; - switch (g->gcstate) { - case GCSpause: { - restartcollection(g); - g->gcstate = GCSpropagate; - work = 1; - break; - } - case GCSpropagate: { - if (fast || g->gray == NULL) { - g->gcstate = GCSenteratomic; - work = 0; - } - else { - propagatemark(g); - work = 1; - } - break; - } - case GCSenteratomic: { - work = atomic(L); - if (checkmajorminor(L, g)) - entersweep(L); - break; - } - case GCSswpallgc: { - sweepstep(L, g, GCSswpfinobj, &g->finobj, fast); - work = GCSWEEPMAX; - break; - } - case GCSswpfinobj: { - sweepstep(L, g, GCSswptobefnz, &g->tobefnz, fast); - work = GCSWEEPMAX; - break; - } - case GCSswptobefnz: { - sweepstep(L, g, GCSswpend, NULL, fast); - work = GCSWEEPMAX; - break; - } - case GCSswpend: { - checkSizes(L, g); - g->gcstate = GCScallfin; - work = 0; - break; - } - case GCScallfin: { - if (g->tobefnz && !g->gcemergency) { - g->gcstopem = 0; - GCTM(L); - work = 1; - } - else { - g->gcstate = GCSpause; - work = 0; - } - break; - } - default: lua_assert(0); return 0; - } - g->gcstopem = 0; - return work; -} - - - -void luaC_runtilstate (lua_State *L, int state, int fast) { - global_State *g = G(L); - lua_assert(g->gckind == KGC_INC); - while (state != g->gcstate) - singlestep(L, fast); -} - - - - -static void incstep (lua_State *L, global_State *g) { - l_obj stepsize = applygcparam(g, STEPSIZE, 100); - l_obj work2do = applygcparam(g, STEPMUL, stepsize); - int fast = 0; - if (work2do == 0) { - work2do = MAX_LOBJ; - fast = 1; - } - do { - l_obj work = singlestep(L, fast); - if (g->gckind == KGC_GENMINOR) - return; - work2do -= work; - } while (work2do > 0 && g->gcstate != GCSpause); - if (g->gcstate == GCSpause) - setpause(g); - else - luaE_setdebt(g, stepsize); -} - - -void luaC_step (lua_State *L) { - global_State *g = G(L); - lua_assert(!g->gcemergency); - if (!gcrunning(g)) - luaE_setdebt(g, 2000); - else { - switch (g->gckind) { - case KGC_INC: case KGC_GENMAJOR: - incstep(L, g); - break; - case KGC_GENMINOR: - youngcollection(L, g); - setminordebt(g); - break; - } - } -} - - - -static void fullinc (lua_State *L, global_State *g) { - if (keepinvariant(g)) - entersweep(L); - - luaC_runtilstate(L, GCSpause, 1); - luaC_runtilstate(L, GCScallfin, 1); - - lua_assert(g->marked == gettotalobjs(g)); - luaC_runtilstate(L, GCSpause, 1); - setpause(g); -} - - - -void luaC_fullgc (lua_State *L, int isemergency) { - global_State *g = G(L); - lua_assert(!g->gcemergency); - g->gcemergency = isemergency; - switch (g->gckind) { - case KGC_GENMINOR: fullgen(L, g); break; - case KGC_INC: fullinc(L, g); break; - case KGC_GENMAJOR: - g->gckind = KGC_INC; - fullinc(L, g); - g->gckind = KGC_GENMAJOR; - break; - } - g->gcemergency = 0; -} - - - - - - -//path: src/imports/../dependencies/lua/llex.c - - -#define llex_c -#define LUA_CORE - - - - - -#include -#include - - - - - - - - - - - - - - - - -//path: src/imports/../dependencies/lua/lparser.h - - -#ifndef lparser_h -#define lparser_h - - - - - - - - - - - - -typedef enum { - VVOID, - VNIL, - VTRUE, - VFALSE, - VK, - VKFLT, - VKINT, - VKSTR, - VNONRELOC, - VLOCAL, - VUPVAL, - VCONST, - VINDEXED, - VINDEXUP, - VINDEXI, - VINDEXSTR, - VJMP, - VRELOC, - VCALL, - VVARARG -} expkind; - - -#define vkisvar(k) (VLOCAL <= (k) && (k) <= VINDEXSTR) -#define vkisindexed(k) (VINDEXED <= (k) && (k) <= VINDEXSTR) - - -typedef struct expdesc { - expkind k; - union { - lua_Integer ival; - lua_Number nval; - TString *strval; - int info; - struct { - short idx; - lu_byte t; - } ind; - struct { - lu_byte ridx; - unsigned short vidx; - } var; - } u; - int t; - int f; -} expdesc; - - - -#define VDKREG 0 -#define RDKCONST 1 -#define RDKTOCLOSE 2 -#define RDKCTC 3 - - -typedef union Vardesc { - struct { - TValuefields; - lu_byte kind; - lu_byte ridx; - short pidx; - TString *name; - } vd; - TValue k; -} Vardesc; - - - - -typedef struct Labeldesc { - TString *name; - int pc; - int line; - lu_byte nactvar; - lu_byte close; -} Labeldesc; - - - -typedef struct Labellist { - Labeldesc *arr; - int n; - int size; -} Labellist; - - - -typedef struct Dyndata { - struct { - Vardesc *arr; - int n; - int size; - } actvar; - Labellist gt; - Labellist label; -} Dyndata; - - - -struct BlockCnt; - - - -typedef struct FuncState { - Proto *f; - struct FuncState *prev; - struct LexState *ls; - struct BlockCnt *bl; - int pc; - int lasttarget; - int previousline; - int nk; - int np; - int nabslineinfo; - int firstlocal; - int firstlabel; - short ndebugvars; - lu_byte nactvar; - lu_byte nups; - lu_byte freereg; - lu_byte iwthabs; - lu_byte needclose; -} FuncState; - - -LUAI_FUNC int luaY_nvarstack (FuncState *fs); -LUAI_FUNC LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, - Dyndata *dyd, const char *name, int firstchar); - - -#endif - - - - - - - - - - - - - -#define next(ls) (ls->current = zgetc(ls->z)) - - - -#define currIsNewline(ls) (ls->current == '\n' || ls->current == '\r') - - - -static const char *const luaX_tokens [] = { - "and", "break", "do", "else", "elseif", - "end", "false", "for", "function", "goto", "if", - "in", "local", "nil", "not", "or", "repeat", - "return", "then", "true", "until", "while", - "//", "..", "...", "==", ">=", "<=", "~=", - "<<", ">>", "::", "", - "", "", "", "" -}; - - -#define save_and_next(ls) (save(ls, ls->current), next(ls)) - - -static l_noret lexerror (LexState *ls, const char *msg, int token); - - -static void save (LexState *ls, int c) { - Mbuffer *b = ls->buff; - if (luaZ_bufflen(b) + 1 > luaZ_sizebuffer(b)) { - size_t newsize; - if (luaZ_sizebuffer(b) >= MAX_SIZE/2) - lexerror(ls, "lexical element too long", 0); - newsize = luaZ_sizebuffer(b) * 2; - luaZ_resizebuffer(ls->L, b, newsize); - } - b->buffer[luaZ_bufflen(b)++] = cast_char(c); -} - - -void luaX_init (lua_State *L) { - int i; - TString *e = luaS_newliteral(L, LUA_ENV); - luaC_fix(L, obj2gco(e)); - for (i=0; iextra = cast_byte(i+1); - } -} - - -const char *luaX_token2str (LexState *ls, int token) { - if (token < FIRST_RESERVED) { - if (lisprint(token)) - return luaO_pushfstring(ls->L, "'%c'", token); - else - return luaO_pushfstring(ls->L, "'<\\%d>'", token); - } - else { - const char *s = luaX_tokens[token - FIRST_RESERVED]; - if (token < TK_EOS) - return luaO_pushfstring(ls->L, "'%s'", s); - else - return s; - } -} - - -static const char *txtToken (LexState *ls, int token) { - switch (token) { - case TK_NAME: case TK_STRING: - case TK_FLT: case TK_INT: - save(ls, '\0'); - return luaO_pushfstring(ls->L, "'%s'", luaZ_buffer(ls->buff)); - default: - return luaX_token2str(ls, token); - } -} - - -static l_noret lexerror (LexState *ls, const char *msg, int token) { - msg = luaG_addinfo(ls->L, msg, ls->source, ls->linenumber); - if (token) - luaO_pushfstring(ls->L, "%s near %s", msg, txtToken(ls, token)); - luaD_throw(ls->L, LUA_ERRSYNTAX); -} - - -l_noret luaX_syntaxerror (LexState *ls, const char *msg) { - lexerror(ls, msg, ls->t.token); -} - - - -TString *luaX_newstring (LexState *ls, const char *str, size_t l) { - lua_State *L = ls->L; - TString *ts = luaS_newlstr(L, str, l); - TString *oldts = luaH_getstrkey(ls->h, ts); - if (oldts != NULL) - return oldts; - else { - TValue *stv = s2v(L->top.p++); - setsvalue(L, stv, ts); - luaH_set(L, ls->h, stv, stv); - - luaC_checkGC(L); - L->top.p--; - } - return ts; -} - - - -static void inclinenumber (LexState *ls) { - int old = ls->current; - lua_assert(currIsNewline(ls)); - next(ls); - if (currIsNewline(ls) && ls->current != old) - next(ls); - if (++ls->linenumber >= MAX_INT) - lexerror(ls, "chunk has too many lines", 0); -} - - -void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source, - int firstchar) { - ls->t.token = 0; - ls->L = L; - ls->current = firstchar; - ls->lookahead.token = TK_EOS; - ls->z = z; - ls->fs = NULL; - ls->linenumber = 1; - ls->lastline = 1; - ls->source = source; - ls->envn = luaS_newliteral(L, LUA_ENV); - luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER); -} - - - - - - -static int check_next1 (LexState *ls, int c) { - if (ls->current == c) { - next(ls); - return 1; - } - else return 0; -} - - - -static int check_next2 (LexState *ls, const char *set) { - lua_assert(set[2] == '\0'); - if (ls->current == set[0] || ls->current == set[1]) { - save_and_next(ls); - return 1; - } - else return 0; -} - - - - -static int read_numeral (LexState *ls, SemInfo *seminfo) { - TValue obj; - const char *expo = "Ee"; - int first = ls->current; - lua_assert(lisdigit(ls->current)); - save_and_next(ls); - if (first == '0' && check_next2(ls, "xX")) - expo = "Pp"; - for (;;) { - if (check_next2(ls, expo)) - check_next2(ls, "-+"); - else if (lisxdigit(ls->current) || ls->current == '.') - save_and_next(ls); - else break; - } - if (lislalpha(ls->current)) - save_and_next(ls); - save(ls, '\0'); - if (luaO_str2num(luaZ_buffer(ls->buff), &obj) == 0) - lexerror(ls, "malformed number", TK_FLT); - if (ttisinteger(&obj)) { - seminfo->i = ivalue(&obj); - return TK_INT; - } - else { - lua_assert(ttisfloat(&obj)); - seminfo->r = fltvalue(&obj); - return TK_FLT; - } -} - - - -static size_t skip_sep (LexState *ls) { - size_t count = 0; - int s = ls->current; - lua_assert(s == '[' || s == ']'); - save_and_next(ls); - while (ls->current == '=') { - save_and_next(ls); - count++; - } - return (ls->current == s) ? count + 2 - : (count == 0) ? 1 - : 0; -} - - -static void read_long_string (LexState *ls, SemInfo *seminfo, size_t sep) { - int line = ls->linenumber; - save_and_next(ls); - if (currIsNewline(ls)) - inclinenumber(ls); - for (;;) { - switch (ls->current) { - case EOZ: { - const char *what = (seminfo ? "string" : "comment"); - const char *msg = luaO_pushfstring(ls->L, - "unfinished long %s (starting at line %d)", what, line); - lexerror(ls, msg, TK_EOS); - break; - } - case ']': { - if (skip_sep(ls) == sep) { - save_and_next(ls); - goto endloop; - } - break; - } - case '\n': case '\r': { - save(ls, '\n'); - inclinenumber(ls); - if (!seminfo) luaZ_resetbuffer(ls->buff); - break; - } - default: { - if (seminfo) save_and_next(ls); - else next(ls); - } - } - } endloop: - if (seminfo) - seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + sep, - luaZ_bufflen(ls->buff) - 2 * sep); -} - - -static void esccheck (LexState *ls, int c, const char *msg) { - if (!c) { - if (ls->current != EOZ) - save_and_next(ls); - lexerror(ls, msg, TK_STRING); - } -} - - -static int gethexa (LexState *ls) { - save_and_next(ls); - esccheck (ls, lisxdigit(ls->current), "hexadecimal digit expected"); - return luaO_hexavalue(ls->current); -} - - -static int readhexaesc (LexState *ls) { - int r = gethexa(ls); - r = (r << 4) + gethexa(ls); - luaZ_buffremove(ls->buff, 2); - return r; -} - - -static unsigned long readutf8esc (LexState *ls) { - unsigned long r; - int i = 4; - save_and_next(ls); - esccheck(ls, ls->current == '{', "missing '{'"); - r = gethexa(ls); - while (cast_void(save_and_next(ls)), lisxdigit(ls->current)) { - i++; - esccheck(ls, r <= (0x7FFFFFFFu >> 4), "UTF-8 value too large"); - r = (r << 4) + luaO_hexavalue(ls->current); - } - esccheck(ls, ls->current == '}', "missing '}'"); - next(ls); - luaZ_buffremove(ls->buff, i); - return r; -} - - -static void utf8esc (LexState *ls) { - char buff[UTF8BUFFSZ]; - int n = luaO_utf8esc(buff, readutf8esc(ls)); - for (; n > 0; n--) - save(ls, buff[UTF8BUFFSZ - n]); -} - - -static int readdecesc (LexState *ls) { - int i; - int r = 0; - for (i = 0; i < 3 && lisdigit(ls->current); i++) { - r = 10*r + ls->current - '0'; - save_and_next(ls); - } - esccheck(ls, r <= UCHAR_MAX, "decimal escape too large"); - luaZ_buffremove(ls->buff, i); - return r; -} - - -static void read_string (LexState *ls, int del, SemInfo *seminfo) { - save_and_next(ls); - while (ls->current != del) { - switch (ls->current) { - case EOZ: - lexerror(ls, "unfinished string", TK_EOS); - break; - case '\n': - case '\r': - lexerror(ls, "unfinished string", TK_STRING); - break; - case '\\': { - int c; - save_and_next(ls); - switch (ls->current) { - case 'a': c = '\a'; goto read_save; - case 'b': c = '\b'; goto read_save; - case 'f': c = '\f'; goto read_save; - case 'n': c = '\n'; goto read_save; - case 'r': c = '\r'; goto read_save; - case 't': c = '\t'; goto read_save; - case 'v': c = '\v'; goto read_save; - case 'x': c = readhexaesc(ls); goto read_save; - case 'u': utf8esc(ls); goto no_save; - case '\n': case '\r': - inclinenumber(ls); c = '\n'; goto only_save; - case '\\': case '\"': case '\'': - c = ls->current; goto read_save; - case EOZ: goto no_save; /* will raise an error next loop */ - case 'z': { /* zap following span of spaces */ - luaZ_buffremove(ls->buff, 1); /* remove '\\' */ - next(ls); /* skip the 'z' */ - while (lisspace(ls->current)) { - if (currIsNewline(ls)) inclinenumber(ls); - else next(ls); - } - goto no_save; - } - default: { - esccheck(ls, lisdigit(ls->current), "invalid escape sequence"); - c = readdecesc(ls); /* digital escape '\ddd' */ - goto only_save; - } - } - read_save: - next(ls); - /* go through */ - only_save: - luaZ_buffremove(ls->buff, 1); /* remove '\\' */ - save(ls, c); - /* go through */ - no_save: break; - } - default: - save_and_next(ls); - } - } - save_and_next(ls); /* skip delimiter */ - seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1, - luaZ_bufflen(ls->buff) - 2); -} - - -static int llex (LexState *ls, SemInfo *seminfo) { - luaZ_resetbuffer(ls->buff); - for (;;) { - switch (ls->current) { - case '\n': case '\r': { /* line breaks */ - inclinenumber(ls); - break; - } - case ' ': case '\f': case '\t': case '\v': { /* spaces */ - next(ls); - break; - } - case '-': { /* '-' or '--' (comment) */ - next(ls); - if (ls->current != '-') return '-'; - /* else is a comment */ - next(ls); - if (ls->current == '[') { /* long comment? */ - size_t sep = skip_sep(ls); - luaZ_resetbuffer(ls->buff); /* 'skip_sep' may dirty the buffer */ - if (sep >= 2) { - read_long_string(ls, NULL, sep); /* skip long comment */ - luaZ_resetbuffer(ls->buff); /* previous call may dirty the buff. */ - break; - } - } - /* else short comment */ - while (!currIsNewline(ls) && ls->current != EOZ) - next(ls); /* skip until end of line (or end of file) */ - break; - } - case '[': { /* long string or simply '[' */ - size_t sep = skip_sep(ls); - if (sep >= 2) { - read_long_string(ls, seminfo, sep); - return TK_STRING; - } - else if (sep == 0) /* '[=...' missing second bracket? */ - lexerror(ls, "invalid long string delimiter", TK_STRING); - return '['; - } - case '=': { - next(ls); - if (check_next1(ls, '=')) return TK_EQ; /* '==' */ - else return '='; - } - case '<': { - next(ls); - if (check_next1(ls, '=')) return TK_LE; /* '<=' */ - else if (check_next1(ls, '<')) return TK_SHL; /* '<<' */ - else return '<'; - } - case '>': { - next(ls); - if (check_next1(ls, '=')) return TK_GE; /* '>=' */ - else if (check_next1(ls, '>')) return TK_SHR; /* '>>' */ - else return '>'; - } - case '/': { - next(ls); - if (check_next1(ls, '/')) return TK_IDIV; /* '//' */ - else return '/'; - } - case '~': { - next(ls); - if (check_next1(ls, '=')) return TK_NE; /* '~=' */ - else return '~'; - } - case ':': { - next(ls); - if (check_next1(ls, ':')) return TK_DBCOLON; /* '::' */ - else return ':'; - } - case '"': case '\'': { - read_string(ls, ls->current, seminfo); - return TK_STRING; - } - case '.': { - save_and_next(ls); - if (check_next1(ls, '.')) { - if (check_next1(ls, '.')) - return TK_DOTS; - else return TK_CONCAT; - } - else if (!lisdigit(ls->current)) return '.'; - else return read_numeral(ls, seminfo); - } - case '0': case '1': case '2': case '3': case '4': - case '5': case '6': case '7': case '8': case '9': { - return read_numeral(ls, seminfo); - } - case EOZ: { - return TK_EOS; - } - default: { - if (lislalpha(ls->current)) { - TString *ts; - do { - save_and_next(ls); - } while (lislalnum(ls->current)); - ts = luaX_newstring(ls, luaZ_buffer(ls->buff), - luaZ_bufflen(ls->buff)); - seminfo->ts = ts; - if (isreserved(ts)) - return ts->extra - 1 + FIRST_RESERVED; - else { - return TK_NAME; - } - } - else { - int c = ls->current; - next(ls); - return c; - } - } - } - } -} - - -void luaX_next (LexState *ls) { - ls->lastline = ls->linenumber; - if (ls->lookahead.token != TK_EOS) { - ls->t = ls->lookahead; - ls->lookahead.token = TK_EOS; - } - else - ls->t.token = llex(ls, &ls->t.seminfo); -} - - -int luaX_lookahead (LexState *ls) { - lua_assert(ls->lookahead.token == TK_EOS); - ls->lookahead.token = llex(ls, &ls->lookahead.seminfo); - return ls->lookahead.token; -} - - - -//path: src/imports/../dependencies/lua/lcode.c - - -#define lcode_c -#define LUA_CORE - - - - - -#include -#include -#include - - - - -//path: src/imports/../dependencies/lua/lcode.h - - -#ifndef lcode_h -#define lcode_h - - - - - - - - - - - - -#define NO_JUMP (-1) - - - -typedef enum BinOpr { - - OPR_ADD, OPR_SUB, OPR_MUL, OPR_MOD, OPR_POW, - OPR_DIV, OPR_IDIV, - - OPR_BAND, OPR_BOR, OPR_BXOR, - OPR_SHL, OPR_SHR, - - OPR_CONCAT, - - OPR_EQ, OPR_LT, OPR_LE, - OPR_NE, OPR_GT, OPR_GE, - - OPR_AND, OPR_OR, - OPR_NOBINOPR -} BinOpr; - - - -#define foldbinop(op) ((op) <= OPR_SHR) - - -#define luaK_codeABC(fs,o,a,b,c) luaK_codeABCk(fs,o,a,b,c,0) - - -typedef enum UnOpr { OPR_MINUS, OPR_BNOT, OPR_NOT, OPR_LEN, OPR_NOUNOPR } UnOpr; - - - -#define getinstruction(fs,e) ((fs)->f->code[(e)->u.info]) - - -#define luaK_setmultret(fs,e) luaK_setreturns(fs, e, LUA_MULTRET) - -#define luaK_jumpto(fs,t) luaK_patchlist(fs, luaK_jump(fs), t) - -LUAI_FUNC int luaK_code (FuncState *fs, Instruction i); -LUAI_FUNC int luaK_codeABx (FuncState *fs, OpCode o, int A, unsigned Bx); -LUAI_FUNC int luaK_codeABCk (FuncState *fs, OpCode o, int A, - int B, int C, int k); -LUAI_FUNC int luaK_exp2const (FuncState *fs, const expdesc *e, TValue *v); -LUAI_FUNC void luaK_fixline (FuncState *fs, int line); -LUAI_FUNC void luaK_nil (FuncState *fs, int from, int n); -LUAI_FUNC void luaK_reserveregs (FuncState *fs, int n); -LUAI_FUNC void luaK_checkstack (FuncState *fs, int n); -LUAI_FUNC void luaK_int (FuncState *fs, int reg, lua_Integer n); -LUAI_FUNC void luaK_dischargevars (FuncState *fs, expdesc *e); -LUAI_FUNC int luaK_exp2anyreg (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2anyregup (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2nextreg (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2val (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_self (FuncState *fs, expdesc *e, expdesc *key); -LUAI_FUNC void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k); -LUAI_FUNC void luaK_goiftrue (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_goiffalse (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_storevar (FuncState *fs, expdesc *var, expdesc *e); -LUAI_FUNC void luaK_setreturns (FuncState *fs, expdesc *e, int nresults); -LUAI_FUNC void luaK_setoneret (FuncState *fs, expdesc *e); -LUAI_FUNC int luaK_jump (FuncState *fs); -LUAI_FUNC void luaK_ret (FuncState *fs, int first, int nret); -LUAI_FUNC void luaK_patchlist (FuncState *fs, int list, int target); -LUAI_FUNC void luaK_patchtohere (FuncState *fs, int list); -LUAI_FUNC void luaK_concat (FuncState *fs, int *l1, int l2); -LUAI_FUNC int luaK_getlabel (FuncState *fs); -LUAI_FUNC void luaK_prefix (FuncState *fs, UnOpr op, expdesc *v, int line); -LUAI_FUNC void luaK_infix (FuncState *fs, BinOpr op, expdesc *v); -LUAI_FUNC void luaK_posfix (FuncState *fs, BinOpr op, expdesc *v1, - expdesc *v2, int line); -LUAI_FUNC void luaK_settablesize (FuncState *fs, int pc, - int ra, int asize, int hsize); -LUAI_FUNC void luaK_setlist (FuncState *fs, int base, int nelems, int tostore); -LUAI_FUNC void luaK_finish (FuncState *fs); -LUAI_FUNC l_noret luaK_semerror (LexState *ls, const char *msg); - - -#endif - - - - - - - - - - - - - - - - - - - - - - -//path: src/imports/../dependencies/lua/lvm.h - - -#ifndef lvm_h -#define lvm_h - - - - - - - - - - -#if !defined(LUA_NOCVTN2S) -#define cvt2str(o) ttisnumber(o) -#else -#define cvt2str(o) 0 -#endif - - -#if !defined(LUA_NOCVTS2N) -#define cvt2num(o) ttisstring(o) -#else -#define cvt2num(o) 0 -#endif - - - -#if !defined(LUA_FLOORN2I) -#define LUA_FLOORN2I F2Ieq -#endif - - - -typedef enum { - F2Ieq, - F2Ifloor, - F2Iceil -} F2Imod; - - - -#define tonumber(o,n) \ - (ttisfloat(o) ? (*(n) = fltvalue(o), 1) : luaV_tonumber_(o,n)) - - - -#define tonumberns(o,n) \ - (ttisfloat(o) ? ((n) = fltvalue(o), 1) : \ - (ttisinteger(o) ? ((n) = cast_num(ivalue(o)), 1) : 0)) - - - -#define tointeger(o,i) \ - (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ - : luaV_tointeger(o,i,LUA_FLOORN2I)) - - - -#define tointegerns(o,i) \ - (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ - : luaV_tointegerns(o,i,LUA_FLOORN2I)) - - -#define intop(op,v1,v2) l_castU2S(l_castS2U(v1) op l_castS2U(v2)) - -#define luaV_rawequalobj(t1,t2) luaV_equalobj(NULL,t1,t2) - - - -#define luaV_fastget(t,k,res,f, tag) \ - (tag = (!ttistable(t) ? LUA_VNOTABLE : f(hvalue(t), k, res))) - - - -#define luaV_fastgeti(t,k,res,tag) \ - if (!ttistable(t)) tag = LUA_VNOTABLE; \ - else { luaH_fastgeti(hvalue(t), k, res, tag); } - - -#define luaV_fastset(t,k,val,hres,f) \ - (hres = (!ttistable(t) ? HNOTATABLE : f(hvalue(t), k, val))) - -#define luaV_fastseti(t,k,val,hres) \ - if (!ttistable(t)) hres = HNOTATABLE; \ - else { luaH_fastseti(hvalue(t), k, val, hres); } - - - -#define luaV_finishfastset(L,t,v) luaC_barrierback(L, gcvalue(t), v) - - - -#define luaV_shiftr(x,y) luaV_shiftl(x,intop(-, 0, y)) - - - -LUAI_FUNC int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2); -LUAI_FUNC int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r); -LUAI_FUNC int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r); -LUAI_FUNC int luaV_tonumber_ (const TValue *obj, lua_Number *n); -LUAI_FUNC int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode); -LUAI_FUNC int luaV_tointegerns (const TValue *obj, lua_Integer *p, - F2Imod mode); -LUAI_FUNC int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode); -LUAI_FUNC int luaV_finishget (lua_State *L, const TValue *t, TValue *key, - StkId val, int tag); -LUAI_FUNC void luaV_finishset (lua_State *L, const TValue *t, TValue *key, - TValue *val, int aux); -LUAI_FUNC void luaV_finishOp (lua_State *L); -LUAI_FUNC void luaV_execute (lua_State *L, CallInfo *ci); -LUAI_FUNC void luaV_concat (lua_State *L, int total); -LUAI_FUNC lua_Integer luaV_idiv (lua_State *L, lua_Integer x, lua_Integer y); -LUAI_FUNC lua_Integer luaV_mod (lua_State *L, lua_Integer x, lua_Integer y); -LUAI_FUNC lua_Number luaV_modf (lua_State *L, lua_Number x, lua_Number y); -LUAI_FUNC lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y); -LUAI_FUNC void luaV_objlen (lua_State *L, StkId ra, const TValue *rb); - -#endif - - - - - -#define MAXREGS 255 - - -#define hasjumps(e) ((e)->t != (e)->f) - - -static int codesJ (FuncState *fs, OpCode o, int sj, int k); - - - - -l_noret luaK_semerror (LexState *ls, const char *msg) { - ls->t.token = 0; - luaX_syntaxerror(ls, msg); -} - - - -static int tonumeral (const expdesc *e, TValue *v) { - if (hasjumps(e)) - return 0; - switch (e->k) { - case VKINT: - if (v) setivalue(v, e->u.ival); - return 1; - case VKFLT: - if (v) setfltvalue(v, e->u.nval); - return 1; - default: return 0; - } -} - - - -static TValue *const2val (FuncState *fs, const expdesc *e) { - lua_assert(e->k == VCONST); - return &fs->ls->dyd->actvar.arr[e->u.info].k; -} - - - -int luaK_exp2const (FuncState *fs, const expdesc *e, TValue *v) { - if (hasjumps(e)) - return 0; - switch (e->k) { - case VFALSE: - setbfvalue(v); - return 1; - case VTRUE: - setbtvalue(v); - return 1; - case VNIL: - setnilvalue(v); - return 1; - case VKSTR: { - setsvalue(fs->ls->L, v, e->u.strval); - return 1; - } - case VCONST: { - setobj(fs->ls->L, v, const2val(fs, e)); - return 1; - } - default: return tonumeral(e, v); - } -} - - - -static Instruction *previousinstruction (FuncState *fs) { - static const Instruction invalidinstruction = ~(Instruction)0; - if (fs->pc > fs->lasttarget) - return &fs->f->code[fs->pc - 1]; - else - return cast(Instruction*, &invalidinstruction); -} - - - -void luaK_nil (FuncState *fs, int from, int n) { - int l = from + n - 1; - Instruction *previous = previousinstruction(fs); - if (GET_OPCODE(*previous) == OP_LOADNIL) { - int pfrom = GETARG_A(*previous); - int pl = pfrom + GETARG_B(*previous); - if ((pfrom <= from && from <= pl + 1) || - (from <= pfrom && pfrom <= l + 1)) { - if (pfrom < from) from = pfrom; - if (pl > l) l = pl; - SETARG_A(*previous, from); - SETARG_B(*previous, l - from); - return; - } - } - luaK_codeABC(fs, OP_LOADNIL, from, n - 1, 0); -} - - - -static int getjump (FuncState *fs, int pc) { - int offset = GETARG_sJ(fs->f->code[pc]); - if (offset == NO_JUMP) - return NO_JUMP; - else - return (pc+1)+offset; -} - - - -static void fixjump (FuncState *fs, int pc, int dest) { - Instruction *jmp = &fs->f->code[pc]; - int offset = dest - (pc + 1); - lua_assert(dest != NO_JUMP); - if (!(-OFFSET_sJ <= offset && offset <= MAXARG_sJ - OFFSET_sJ)) - luaX_syntaxerror(fs->ls, "control structure too long"); - lua_assert(GET_OPCODE(*jmp) == OP_JMP); - SETARG_sJ(*jmp, offset); -} - - - -void luaK_concat (FuncState *fs, int *l1, int l2) { - if (l2 == NO_JUMP) return; - else if (*l1 == NO_JUMP) - *l1 = l2; - else { - int list = *l1; - int next; - while ((next = getjump(fs, list)) != NO_JUMP) - list = next; - fixjump(fs, list, l2); - } -} - - - -int luaK_jump (FuncState *fs) { - return codesJ(fs, OP_JMP, NO_JUMP, 0); -} - - - -void luaK_ret (FuncState *fs, int first, int nret) { - OpCode op; - switch (nret) { - case 0: op = OP_RETURN0; break; - case 1: op = OP_RETURN1; break; - default: op = OP_RETURN; break; - } - luaK_codeABC(fs, op, first, nret + 1, 0); -} - - - -static int condjump (FuncState *fs, OpCode op, int A, int B, int C, int k) { - luaK_codeABCk(fs, op, A, B, C, k); - return luaK_jump(fs); -} - - - -int luaK_getlabel (FuncState *fs) { - fs->lasttarget = fs->pc; - return fs->pc; -} - - - -static Instruction *getjumpcontrol (FuncState *fs, int pc) { - Instruction *pi = &fs->f->code[pc]; - if (pc >= 1 && testTMode(GET_OPCODE(*(pi-1)))) - return pi-1; - else - return pi; -} - - - -static int patchtestreg (FuncState *fs, int node, int reg) { - Instruction *i = getjumpcontrol(fs, node); - if (GET_OPCODE(*i) != OP_TESTSET) - return 0; - if (reg != NO_REG && reg != GETARG_B(*i)) - SETARG_A(*i, reg); - else { - - *i = CREATE_ABCk(OP_TEST, GETARG_B(*i), 0, 0, GETARG_k(*i)); - } - return 1; -} - - - -static void removevalues (FuncState *fs, int list) { - for (; list != NO_JUMP; list = getjump(fs, list)) - patchtestreg(fs, list, NO_REG); -} - - - -static void patchlistaux (FuncState *fs, int list, int vtarget, int reg, - int dtarget) { - while (list != NO_JUMP) { - int next = getjump(fs, list); - if (patchtestreg(fs, list, reg)) - fixjump(fs, list, vtarget); - else - fixjump(fs, list, dtarget); - list = next; - } -} - - - -void luaK_patchlist (FuncState *fs, int list, int target) { - lua_assert(target <= fs->pc); - patchlistaux(fs, list, target, NO_REG, target); -} - - -void luaK_patchtohere (FuncState *fs, int list) { - int hr = luaK_getlabel(fs); - luaK_patchlist(fs, list, hr); -} - - - -#define LIMLINEDIFF 0x80 - - - -static void savelineinfo (FuncState *fs, Proto *f, int line) { - int linedif = line - fs->previousline; - int pc = fs->pc - 1; - if (abs(linedif) >= LIMLINEDIFF || fs->iwthabs++ >= MAXIWTHABS) { - luaM_growvector(fs->ls->L, f->abslineinfo, fs->nabslineinfo, - f->sizeabslineinfo, AbsLineInfo, MAX_INT, "lines"); - f->abslineinfo[fs->nabslineinfo].pc = pc; - f->abslineinfo[fs->nabslineinfo++].line = line; - linedif = ABSLINEINFO; - fs->iwthabs = 1; - } - luaM_growvector(fs->ls->L, f->lineinfo, pc, f->sizelineinfo, ls_byte, - MAX_INT, "opcodes"); - f->lineinfo[pc] = linedif; - fs->previousline = line; -} - - - -static void removelastlineinfo (FuncState *fs) { - Proto *f = fs->f; - int pc = fs->pc - 1; - if (f->lineinfo[pc] != ABSLINEINFO) { - fs->previousline -= f->lineinfo[pc]; - fs->iwthabs--; - } - else { - lua_assert(f->abslineinfo[fs->nabslineinfo - 1].pc == pc); - fs->nabslineinfo--; - fs->iwthabs = MAXIWTHABS + 1; - } -} - - - -static void removelastinstruction (FuncState *fs) { - removelastlineinfo(fs); - fs->pc--; -} - - - -int luaK_code (FuncState *fs, Instruction i) { - Proto *f = fs->f; - - luaM_growvector(fs->ls->L, f->code, fs->pc, f->sizecode, Instruction, - MAX_INT, "opcodes"); - f->code[fs->pc++] = i; - savelineinfo(fs, f, fs->ls->lastline); - return fs->pc - 1; -} - - - -int luaK_codeABCk (FuncState *fs, OpCode o, int a, int b, int c, int k) { - lua_assert(getOpMode(o) == iABC); - lua_assert(a <= MAXARG_A && b <= MAXARG_B && - c <= MAXARG_C && (k & ~1) == 0); - return luaK_code(fs, CREATE_ABCk(o, a, b, c, k)); -} - - - -int luaK_codeABx (FuncState *fs, OpCode o, int a, unsigned int bc) { - lua_assert(getOpMode(o) == iABx); - lua_assert(a <= MAXARG_A && bc <= MAXARG_Bx); - return luaK_code(fs, CREATE_ABx(o, a, bc)); -} - - - -static int codeAsBx (FuncState *fs, OpCode o, int a, int bc) { - unsigned int b = bc + OFFSET_sBx; - lua_assert(getOpMode(o) == iAsBx); - lua_assert(a <= MAXARG_A && b <= MAXARG_Bx); - return luaK_code(fs, CREATE_ABx(o, a, b)); -} - - - -static int codesJ (FuncState *fs, OpCode o, int sj, int k) { - unsigned int j = sj + OFFSET_sJ; - lua_assert(getOpMode(o) == isJ); - lua_assert(j <= MAXARG_sJ && (k & ~1) == 0); - return luaK_code(fs, CREATE_sJ(o, j, k)); -} - - - -static int codeextraarg (FuncState *fs, int a) { - lua_assert(a <= MAXARG_Ax); - return luaK_code(fs, CREATE_Ax(OP_EXTRAARG, a)); -} - - - -static int luaK_codek (FuncState *fs, int reg, int k) { - if (k <= MAXARG_Bx) - return luaK_codeABx(fs, OP_LOADK, reg, k); - else { - int p = luaK_codeABx(fs, OP_LOADKX, reg, 0); - codeextraarg(fs, k); - return p; - } -} - - - -void luaK_checkstack (FuncState *fs, int n) { - int newstack = fs->freereg + n; - if (newstack > fs->f->maxstacksize) { - if (newstack >= MAXREGS) - luaX_syntaxerror(fs->ls, - "function or expression needs too many registers"); - fs->f->maxstacksize = cast_byte(newstack); - } -} - - - -void luaK_reserveregs (FuncState *fs, int n) { - luaK_checkstack(fs, n); - fs->freereg += n; -} - - - -static void freereg (FuncState *fs, int reg) { - if (reg >= luaY_nvarstack(fs)) { - fs->freereg--; - lua_assert(reg == fs->freereg); - } -} - - - -static void freeregs (FuncState *fs, int r1, int r2) { - if (r1 > r2) { - freereg(fs, r1); - freereg(fs, r2); - } - else { - freereg(fs, r2); - freereg(fs, r1); - } -} - - - -static void freeexp (FuncState *fs, expdesc *e) { - if (e->k == VNONRELOC) - freereg(fs, e->u.info); -} - - - -static void freeexps (FuncState *fs, expdesc *e1, expdesc *e2) { - int r1 = (e1->k == VNONRELOC) ? e1->u.info : -1; - int r2 = (e2->k == VNONRELOC) ? e2->u.info : -1; - freeregs(fs, r1, r2); -} - - - -static int addk (FuncState *fs, TValue *key, TValue *v) { - TValue val; - lua_State *L = fs->ls->L; - Proto *f = fs->f; - int tag = luaH_get(fs->ls->h, key, &val); - int k, oldsize; - if (tag == LUA_VNUMINT) { - k = cast_int(ivalue(&val)); - - if (k < fs->nk && ttypetag(&f->k[k]) == ttypetag(v) && - luaV_rawequalobj(&f->k[k], v)) - return k; - } - - oldsize = f->sizek; - k = fs->nk; - - setivalue(&val, k); - luaH_set(L, fs->ls->h, key, &val); - luaM_growvector(L, f->k, k, f->sizek, TValue, MAXARG_Ax, "constants"); - while (oldsize < f->sizek) setnilvalue(&f->k[oldsize++]); - setobj(L, &f->k[k], v); - fs->nk++; - luaC_barrier(L, f, v); - return k; -} - - - -static int stringK (FuncState *fs, TString *s) { - TValue o; - setsvalue(fs->ls->L, &o, s); - return addk(fs, &o, &o); -} - - - -static int luaK_intK (FuncState *fs, lua_Integer n) { - TValue o; - setivalue(&o, n); - return addk(fs, &o, &o); -} - - -static int luaK_numberK (FuncState *fs, lua_Number r) { - TValue o; - lua_Integer ik; - setfltvalue(&o, r); - if (!luaV_flttointeger(r, &ik, F2Ieq)) - return addk(fs, &o, &o); - else { - const int nbm = l_floatatt(MANT_DIG); - const lua_Number q = l_mathop(private_lua_cembed_ldexp)(l_mathop(1.0), -nbm + 1); - const lua_Number k = (ik == 0) ? q : r + r*q; - TValue kv; - setfltvalue(&kv, k); - - lua_assert(!luaV_flttointeger(k, &ik, F2Ieq) || - l_mathop(fabs)(r) >= l_mathop(1e6)); - return addk(fs, &kv, &o); - } -} - - - -static int boolF (FuncState *fs) { - TValue o; - setbfvalue(&o); - return addk(fs, &o, &o); -} - - - -static int boolT (FuncState *fs) { - TValue o; - setbtvalue(&o); - return addk(fs, &o, &o); -} - - - -static int nilK (FuncState *fs) { - TValue k, v; - setnilvalue(&v); - - sethvalue(fs->ls->L, &k, fs->ls->h); - return addk(fs, &k, &v); -} - - - -static int fitsC (lua_Integer i) { - return (l_castS2U(i) + OFFSET_sC <= cast_uint(MAXARG_C)); -} - - - -static int fitsBx (lua_Integer i) { - return (-OFFSET_sBx <= i && i <= MAXARG_Bx - OFFSET_sBx); -} - - -void luaK_int (FuncState *fs, int reg, lua_Integer i) { - if (fitsBx(i)) - codeAsBx(fs, OP_LOADI, reg, cast_int(i)); - else - luaK_codek(fs, reg, luaK_intK(fs, i)); -} - - -static void luaK_float (FuncState *fs, int reg, lua_Number f) { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ieq) && fitsBx(fi)) - codeAsBx(fs, OP_LOADF, reg, cast_int(fi)); - else - luaK_codek(fs, reg, luaK_numberK(fs, f)); -} - - - -static void const2exp (TValue *v, expdesc *e) { - switch (ttypetag(v)) { - case LUA_VNUMINT: - e->k = VKINT; e->u.ival = ivalue(v); - break; - case LUA_VNUMFLT: - e->k = VKFLT; e->u.nval = fltvalue(v); - break; - case LUA_VFALSE: - e->k = VFALSE; - break; - case LUA_VTRUE: - e->k = VTRUE; - break; - case LUA_VNIL: - e->k = VNIL; - break; - case LUA_VSHRSTR: case LUA_VLNGSTR: - e->k = VKSTR; e->u.strval = tsvalue(v); - break; - default: lua_assert(0); - } -} - - - -void luaK_setreturns (FuncState *fs, expdesc *e, int nresults) { - Instruction *pc = &getinstruction(fs, e); - if (e->k == VCALL) - SETARG_C(*pc, nresults + 1); - else { - lua_assert(e->k == VVARARG); - SETARG_C(*pc, nresults + 1); - SETARG_A(*pc, fs->freereg); - luaK_reserveregs(fs, 1); - } -} - - - -static void str2K (FuncState *fs, expdesc *e) { - lua_assert(e->k == VKSTR); - e->u.info = stringK(fs, e->u.strval); - e->k = VK; -} - - - -void luaK_setoneret (FuncState *fs, expdesc *e) { - if (e->k == VCALL) { - - lua_assert(GETARG_C(getinstruction(fs, e)) == 2); - e->k = VNONRELOC; - e->u.info = GETARG_A(getinstruction(fs, e)); - } - else if (e->k == VVARARG) { - SETARG_C(getinstruction(fs, e), 2); - e->k = VRELOC; - } -} - - - -void luaK_dischargevars (FuncState *fs, expdesc *e) { - switch (e->k) { - case VCONST: { - const2exp(const2val(fs, e), e); - break; - } - case VLOCAL: { - e->u.info = e->u.var.ridx; - e->k = VNONRELOC; - break; - } - case VUPVAL: { - e->u.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.info, 0); - e->k = VRELOC; - break; - } - case VINDEXUP: { - e->u.info = luaK_codeABC(fs, OP_GETTABUP, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXI: { - freereg(fs, e->u.ind.t); - e->u.info = luaK_codeABC(fs, OP_GETI, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXSTR: { - freereg(fs, e->u.ind.t); - e->u.info = luaK_codeABC(fs, OP_GETFIELD, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXED: { - freeregs(fs, e->u.ind.t, e->u.ind.idx); - e->u.info = luaK_codeABC(fs, OP_GETTABLE, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VVARARG: case VCALL: { - luaK_setoneret(fs, e); - break; - } - default: break; - } -} - - - -static void discharge2reg (FuncState *fs, expdesc *e, int reg) { - luaK_dischargevars(fs, e); - switch (e->k) { - case VNIL: { - luaK_nil(fs, reg, 1); - break; - } - case VFALSE: { - luaK_codeABC(fs, OP_LOADFALSE, reg, 0, 0); - break; - } - case VTRUE: { - luaK_codeABC(fs, OP_LOADTRUE, reg, 0, 0); - break; - } - case VKSTR: { - str2K(fs, e); - } - case VK: { - luaK_codek(fs, reg, e->u.info); - break; - } - case VKFLT: { - luaK_float(fs, reg, e->u.nval); - break; - } - case VKINT: { - luaK_int(fs, reg, e->u.ival); - break; - } - case VRELOC: { - Instruction *pc = &getinstruction(fs, e); - SETARG_A(*pc, reg); - break; - } - case VNONRELOC: { - if (reg != e->u.info) - luaK_codeABC(fs, OP_MOVE, reg, e->u.info, 0); - break; - } - default: { - lua_assert(e->k == VJMP); - return; - } - } - e->u.info = reg; - e->k = VNONRELOC; -} - - - -static void discharge2anyreg (FuncState *fs, expdesc *e) { - if (e->k != VNONRELOC) { - luaK_reserveregs(fs, 1); - discharge2reg(fs, e, fs->freereg-1); - } -} - - -static int code_loadbool (FuncState *fs, int A, OpCode op) { - luaK_getlabel(fs); - return luaK_codeABC(fs, op, A, 0, 0); -} - - - -static int need_value (FuncState *fs, int list) { - for (; list != NO_JUMP; list = getjump(fs, list)) { - Instruction i = *getjumpcontrol(fs, list); - if (GET_OPCODE(i) != OP_TESTSET) return 1; - } - return 0; -} - - - -static void exp2reg (FuncState *fs, expdesc *e, int reg) { - discharge2reg(fs, e, reg); - if (e->k == VJMP) - luaK_concat(fs, &e->t, e->u.info); - if (hasjumps(e)) { - int final; - int p_f = NO_JUMP; - int p_t = NO_JUMP; - if (need_value(fs, e->t) || need_value(fs, e->f)) { - int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs); - p_f = code_loadbool(fs, reg, OP_LFALSESKIP); - p_t = code_loadbool(fs, reg, OP_LOADTRUE); - - luaK_patchtohere(fs, fj); - } - final = luaK_getlabel(fs); - patchlistaux(fs, e->f, final, reg, p_f); - patchlistaux(fs, e->t, final, reg, p_t); - } - e->f = e->t = NO_JUMP; - e->u.info = reg; - e->k = VNONRELOC; -} - - - -void luaK_exp2nextreg (FuncState *fs, expdesc *e) { - luaK_dischargevars(fs, e); - freeexp(fs, e); - luaK_reserveregs(fs, 1); - exp2reg(fs, e, fs->freereg - 1); -} - - - -int luaK_exp2anyreg (FuncState *fs, expdesc *e) { - luaK_dischargevars(fs, e); - if (e->k == VNONRELOC) { - if (!hasjumps(e)) - return e->u.info; - if (e->u.info >= luaY_nvarstack(fs)) { - exp2reg(fs, e, e->u.info); - return e->u.info; - } - - } - luaK_exp2nextreg(fs, e); - return e->u.info; -} - - - -void luaK_exp2anyregup (FuncState *fs, expdesc *e) { - if (e->k != VUPVAL || hasjumps(e)) - luaK_exp2anyreg(fs, e); -} - - - -void luaK_exp2val (FuncState *fs, expdesc *e) { - if (hasjumps(e)) - luaK_exp2anyreg(fs, e); - else - luaK_dischargevars(fs, e); -} - - - -static int luaK_exp2K (FuncState *fs, expdesc *e) { - if (!hasjumps(e)) { - int info; - switch (e->k) { - case VTRUE: info = boolT(fs); break; - case VFALSE: info = boolF(fs); break; - case VNIL: info = nilK(fs); break; - case VKINT: info = luaK_intK(fs, e->u.ival); break; - case VKFLT: info = luaK_numberK(fs, e->u.nval); break; - case VKSTR: info = stringK(fs, e->u.strval); break; - case VK: info = e->u.info; break; - default: return 0; - } - if (info <= MAXINDEXRK) { - e->k = VK; - e->u.info = info; - return 1; - } - } - - return 0; -} - - - -static int exp2RK (FuncState *fs, expdesc *e) { - if (luaK_exp2K(fs, e)) - return 1; - else { - luaK_exp2anyreg(fs, e); - return 0; - } -} - - -static void codeABRK (FuncState *fs, OpCode o, int a, int b, - expdesc *ec) { - int k = exp2RK(fs, ec); - luaK_codeABCk(fs, o, a, b, ec->u.info, k); -} - - - -void luaK_storevar (FuncState *fs, expdesc *var, expdesc *ex) { - switch (var->k) { - case VLOCAL: { - freeexp(fs, ex); - exp2reg(fs, ex, var->u.var.ridx); - return; - } - case VUPVAL: { - int e = luaK_exp2anyreg(fs, ex); - luaK_codeABC(fs, OP_SETUPVAL, e, var->u.info, 0); - break; - } - case VINDEXUP: { - codeABRK(fs, OP_SETTABUP, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXI: { - codeABRK(fs, OP_SETI, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXSTR: { - codeABRK(fs, OP_SETFIELD, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXED: { - codeABRK(fs, OP_SETTABLE, var->u.ind.t, var->u.ind.idx, ex); - break; - } - default: lua_assert(0); - } - freeexp(fs, ex); -} - - - -void luaK_self (FuncState *fs, expdesc *e, expdesc *key) { - int ereg; - luaK_exp2anyreg(fs, e); - ereg = e->u.info; - freeexp(fs, e); - e->u.info = fs->freereg; - e->k = VNONRELOC; - luaK_reserveregs(fs, 2); - codeABRK(fs, OP_SELF, e->u.info, ereg, key); - freeexp(fs, key); -} - - - -static void negatecondition (FuncState *fs, expdesc *e) { - Instruction *pc = getjumpcontrol(fs, e->u.info); - lua_assert(testTMode(GET_OPCODE(*pc)) && GET_OPCODE(*pc) != OP_TESTSET && - GET_OPCODE(*pc) != OP_TEST); - SETARG_k(*pc, (GETARG_k(*pc) ^ 1)); -} - - - -static int jumponcond (FuncState *fs, expdesc *e, int cond) { - if (e->k == VRELOC) { - Instruction ie = getinstruction(fs, e); - if (GET_OPCODE(ie) == OP_NOT) { - removelastinstruction(fs); - return condjump(fs, OP_TEST, GETARG_B(ie), 0, 0, !cond); - } - - } - discharge2anyreg(fs, e); - freeexp(fs, e); - return condjump(fs, OP_TESTSET, NO_REG, e->u.info, 0, cond); -} - - - -void luaK_goiftrue (FuncState *fs, expdesc *e) { - int pc; - luaK_dischargevars(fs, e); - switch (e->k) { - case VJMP: { - negatecondition(fs, e); - pc = e->u.info; - break; - } - case VK: case VKFLT: case VKINT: case VKSTR: case VTRUE: { - pc = NO_JUMP; - break; - } - default: { - pc = jumponcond(fs, e, 0); - break; - } - } - luaK_concat(fs, &e->f, pc); - luaK_patchtohere(fs, e->t); - e->t = NO_JUMP; -} - - - -void luaK_goiffalse (FuncState *fs, expdesc *e) { - int pc; - luaK_dischargevars(fs, e); - switch (e->k) { - case VJMP: { - pc = e->u.info; - break; - } - case VNIL: case VFALSE: { - pc = NO_JUMP; - break; - } - default: { - pc = jumponcond(fs, e, 1); - break; - } - } - luaK_concat(fs, &e->t, pc); - luaK_patchtohere(fs, e->f); - e->f = NO_JUMP; -} - - - -static void codenot (FuncState *fs, expdesc *e) { - switch (e->k) { - case VNIL: case VFALSE: { - e->k = VTRUE; - break; - } - case VK: case VKFLT: case VKINT: case VKSTR: case VTRUE: { - e->k = VFALSE; - break; - } - case VJMP: { - negatecondition(fs, e); - break; - } - case VRELOC: - case VNONRELOC: { - discharge2anyreg(fs, e); - freeexp(fs, e); - e->u.info = luaK_codeABC(fs, OP_NOT, 0, e->u.info, 0); - e->k = VRELOC; - break; - } - default: lua_assert(0); - } - - { int temp = e->f; e->f = e->t; e->t = temp; } - removevalues(fs, e->f); - removevalues(fs, e->t); -} - - - -static int isKstr (FuncState *fs, expdesc *e) { - return (e->k == VK && !hasjumps(e) && e->u.info <= MAXARG_B && - ttisshrstring(&fs->f->k[e->u.info])); -} - - -static int isKint (expdesc *e) { - return (e->k == VKINT && !hasjumps(e)); -} - - - -static int isCint (expdesc *e) { - return isKint(e) && (l_castS2U(e->u.ival) <= l_castS2U(MAXARG_C)); -} - - - -static int isSCint (expdesc *e) { - return isKint(e) && fitsC(e->u.ival); -} - - - -static int isSCnumber (expdesc *e, int *pi, int *isfloat) { - lua_Integer i; - if (e->k == VKINT) - i = e->u.ival; - else if (e->k == VKFLT && luaV_flttointeger(e->u.nval, &i, F2Ieq)) - *isfloat = 1; - else - return 0; - if (!hasjumps(e) && fitsC(i)) { - *pi = int2sC(cast_int(i)); - return 1; - } - else - return 0; -} - - - -void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) { - if (k->k == VKSTR) - str2K(fs, k); - lua_assert(!hasjumps(t) && - (t->k == VLOCAL || t->k == VNONRELOC || t->k == VUPVAL)); - if (t->k == VUPVAL && !isKstr(fs, k)) - luaK_exp2anyreg(fs, t); - if (t->k == VUPVAL) { - lua_assert(isKstr(fs, k)); - t->u.ind.t = t->u.info; - t->u.ind.idx = k->u.info; - t->k = VINDEXUP; - } - else { - - t->u.ind.t = (t->k == VLOCAL) ? t->u.var.ridx: t->u.info; - if (isKstr(fs, k)) { - t->u.ind.idx = k->u.info; - t->k = VINDEXSTR; - } - else if (isCint(k)) { - t->u.ind.idx = cast_int(k->u.ival); - t->k = VINDEXI; - } - else { - t->u.ind.idx = luaK_exp2anyreg(fs, k); - t->k = VINDEXED; - } - } -} - - - -static int validop (int op, TValue *v1, TValue *v2) { - switch (op) { - case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: - case LUA_OPSHL: case LUA_OPSHR: case LUA_OPBNOT: { - lua_Integer i; - return (luaV_tointegerns(v1, &i, LUA_FLOORN2I) && - luaV_tointegerns(v2, &i, LUA_FLOORN2I)); - } - case LUA_OPDIV: case LUA_OPIDIV: case LUA_OPMOD: - return (nvalue(v2) != 0); - default: return 1; - } -} - - - -static int constfolding (FuncState *fs, int op, expdesc *e1, - const expdesc *e2) { - TValue v1, v2, res; - if (!tonumeral(e1, &v1) || !tonumeral(e2, &v2) || !validop(op, &v1, &v2)) - return 0; - luaO_rawarith(fs->ls->L, op, &v1, &v2, &res); - if (ttisinteger(&res)) { - e1->k = VKINT; - e1->u.ival = ivalue(&res); - } - else { - lua_Number n = fltvalue(&res); - if (luai_numisnan(n) || n == 0) - return 0; - e1->k = VKFLT; - e1->u.nval = n; - } - return 1; -} - - - -l_sinline OpCode binopr2op (BinOpr opr, BinOpr baser, OpCode base) { - lua_assert(baser <= opr && - ((baser == OPR_ADD && opr <= OPR_SHR) || - (baser == OPR_LT && opr <= OPR_LE))); - return cast(OpCode, (cast_int(opr) - cast_int(baser)) + cast_int(base)); -} - - - -l_sinline OpCode unopr2op (UnOpr opr) { - return cast(OpCode, (cast_int(opr) - cast_int(OPR_MINUS)) + - cast_int(OP_UNM)); -} - - - -l_sinline TMS binopr2TM (BinOpr opr) { - lua_assert(OPR_ADD <= opr && opr <= OPR_SHR); - return cast(TMS, (cast_int(opr) - cast_int(OPR_ADD)) + cast_int(TM_ADD)); -} - - - -static void codeunexpval (FuncState *fs, OpCode op, expdesc *e, int line) { - int r = luaK_exp2anyreg(fs, e); - freeexp(fs, e); - e->u.info = luaK_codeABC(fs, op, 0, r, 0); - e->k = VRELOC; - luaK_fixline(fs, line); -} - - - -static void finishbinexpval (FuncState *fs, expdesc *e1, expdesc *e2, - OpCode op, int v2, int flip, int line, - OpCode mmop, TMS event) { - int v1 = luaK_exp2anyreg(fs, e1); - int pc = luaK_codeABCk(fs, op, 0, v1, v2, 0); - freeexps(fs, e1, e2); - e1->u.info = pc; - e1->k = VRELOC; - luaK_fixline(fs, line); - luaK_codeABCk(fs, mmop, v1, v2, event, flip); - luaK_fixline(fs, line); -} - - - -static void codebinexpval (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - OpCode op = binopr2op(opr, OPR_ADD, OP_ADD); - int v2 = luaK_exp2anyreg(fs, e2); - - lua_assert((VNIL <= e1->k && e1->k <= VKSTR) || - e1->k == VNONRELOC || e1->k == VRELOC); - lua_assert(OP_ADD <= op && op <= OP_SHR); - finishbinexpval(fs, e1, e2, op, v2, 0, line, OP_MMBIN, binopr2TM(opr)); -} - - - -static void codebini (FuncState *fs, OpCode op, - expdesc *e1, expdesc *e2, int flip, int line, - TMS event) { - int v2 = int2sC(cast_int(e2->u.ival)); - lua_assert(e2->k == VKINT); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINI, event); -} - - - -static void codebinK (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - TMS event = binopr2TM(opr); - int v2 = e2->u.info; - OpCode op = binopr2op(opr, OPR_ADD, OP_ADDK); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINK, event); -} - - - -static int finishbinexpneg (FuncState *fs, expdesc *e1, expdesc *e2, - OpCode op, int line, TMS event) { - if (!isKint(e2)) - return 0; - else { - lua_Integer i2 = e2->u.ival; - if (!(fitsC(i2) && fitsC(-i2))) - return 0; - else { - int v2 = cast_int(i2); - finishbinexpval(fs, e1, e2, op, int2sC(-v2), 0, line, OP_MMBINI, event); - - SETARG_B(fs->f->code[fs->pc - 1], int2sC(v2)); - return 1; - } - } -} - - -static void swapexps (expdesc *e1, expdesc *e2) { - expdesc temp = *e1; *e1 = *e2; *e2 = temp; -} - - - -static void codebinNoK (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - if (flip) - swapexps(e1, e2); - codebinexpval(fs, opr, e1, e2, line); -} - - - -static void codearith (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - if (tonumeral(e2, NULL) && luaK_exp2K(fs, e2)) - codebinK(fs, opr, e1, e2, flip, line); - else - codebinNoK(fs, opr, e1, e2, flip, line); -} - - - -static void codecommutative (FuncState *fs, BinOpr op, - expdesc *e1, expdesc *e2, int line) { - int flip = 0; - if (tonumeral(e1, NULL)) { - swapexps(e1, e2); - flip = 1; - } - if (op == OPR_ADD && isSCint(e2)) - codebini(fs, OP_ADDI, e1, e2, flip, line, TM_ADD); - else - codearith(fs, op, e1, e2, flip, line); -} - - - -static void codebitwise (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - int flip = 0; - if (e1->k == VKINT) { - swapexps(e1, e2); - flip = 1; - } - if (e2->k == VKINT && luaK_exp2K(fs, e2)) - codebinK(fs, opr, e1, e2, flip, line); - else - codebinNoK(fs, opr, e1, e2, flip, line); -} - - - -static void codeorder (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { - int r1, r2; - int im; - int isfloat = 0; - OpCode op; - if (isSCnumber(e2, &im, &isfloat)) { - - r1 = luaK_exp2anyreg(fs, e1); - r2 = im; - op = binopr2op(opr, OPR_LT, OP_LTI); - } - else if (isSCnumber(e1, &im, &isfloat)) { - - r1 = luaK_exp2anyreg(fs, e2); - r2 = im; - op = binopr2op(opr, OPR_LT, OP_GTI); - } - else { - r1 = luaK_exp2anyreg(fs, e1); - r2 = luaK_exp2anyreg(fs, e2); - op = binopr2op(opr, OPR_LT, OP_LT); - } - freeexps(fs, e1, e2); - e1->u.info = condjump(fs, op, r1, r2, isfloat, 1); - e1->k = VJMP; -} - - - -static void codeeq (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { - int r1, r2; - int im; - int isfloat = 0; - OpCode op; - if (e1->k != VNONRELOC) { - lua_assert(e1->k == VK || e1->k == VKINT || e1->k == VKFLT); - swapexps(e1, e2); - } - r1 = luaK_exp2anyreg(fs, e1); - if (isSCnumber(e2, &im, &isfloat)) { - op = OP_EQI; - r2 = im; - } - else if (exp2RK(fs, e2)) { - op = OP_EQK; - r2 = e2->u.info; - } - else { - op = OP_EQ; - r2 = luaK_exp2anyreg(fs, e2); - } - freeexps(fs, e1, e2); - e1->u.info = condjump(fs, op, r1, r2, isfloat, (opr == OPR_EQ)); - e1->k = VJMP; -} - - - -void luaK_prefix (FuncState *fs, UnOpr opr, expdesc *e, int line) { - static const expdesc ef = {VKINT, {0}, NO_JUMP, NO_JUMP}; - luaK_dischargevars(fs, e); - switch (opr) { - case OPR_MINUS: case OPR_BNOT: - if (constfolding(fs, opr + LUA_OPUNM, e, &ef)) - break; - - case OPR_LEN: - codeunexpval(fs, unopr2op(opr), e, line); - break; - case OPR_NOT: codenot(fs, e); break; - default: lua_assert(0); - } -} - - - -void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) { - luaK_dischargevars(fs, v); - switch (op) { - case OPR_AND: { - luaK_goiftrue(fs, v); - break; - } - case OPR_OR: { - luaK_goiffalse(fs, v); - break; - } - case OPR_CONCAT: { - luaK_exp2nextreg(fs, v); - break; - } - case OPR_ADD: case OPR_SUB: - case OPR_MUL: case OPR_DIV: case OPR_IDIV: - case OPR_MOD: case OPR_POW: - case OPR_BAND: case OPR_BOR: case OPR_BXOR: - case OPR_SHL: case OPR_SHR: { - if (!tonumeral(v, NULL)) - luaK_exp2anyreg(fs, v); - - break; - } - case OPR_EQ: case OPR_NE: { - if (!tonumeral(v, NULL)) - exp2RK(fs, v); - - break; - } - case OPR_LT: case OPR_LE: - case OPR_GT: case OPR_GE: { - int dummy, dummy2; - if (!isSCnumber(v, &dummy, &dummy2)) - luaK_exp2anyreg(fs, v); - - break; - } - default: lua_assert(0); - } -} - - -static void codeconcat (FuncState *fs, expdesc *e1, expdesc *e2, int line) { - Instruction *ie2 = previousinstruction(fs); - if (GET_OPCODE(*ie2) == OP_CONCAT) { - int n = GETARG_B(*ie2); - lua_assert(e1->u.info + 1 == GETARG_A(*ie2)); - freeexp(fs, e2); - SETARG_A(*ie2, e1->u.info); - SETARG_B(*ie2, n + 1); - } - else { - luaK_codeABC(fs, OP_CONCAT, e1->u.info, 2, 0); - freeexp(fs, e2); - luaK_fixline(fs, line); - } -} - - - -void luaK_posfix (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - luaK_dischargevars(fs, e2); - if (foldbinop(opr) && constfolding(fs, opr + LUA_OPADD, e1, e2)) - return; - switch (opr) { - case OPR_AND: { - lua_assert(e1->t == NO_JUMP); - luaK_concat(fs, &e2->f, e1->f); - *e1 = *e2; - break; - } - case OPR_OR: { - lua_assert(e1->f == NO_JUMP); - luaK_concat(fs, &e2->t, e1->t); - *e1 = *e2; - break; - } - case OPR_CONCAT: { - luaK_exp2nextreg(fs, e2); - codeconcat(fs, e1, e2, line); - break; - } - case OPR_ADD: case OPR_MUL: { - codecommutative(fs, opr, e1, e2, line); - break; - } - case OPR_SUB: { - if (finishbinexpneg(fs, e1, e2, OP_ADDI, line, TM_SUB)) - break; - - } - case OPR_DIV: case OPR_IDIV: case OPR_MOD: case OPR_POW: { - codearith(fs, opr, e1, e2, 0, line); - break; - } - case OPR_BAND: case OPR_BOR: case OPR_BXOR: { - codebitwise(fs, opr, e1, e2, line); - break; - } - case OPR_SHL: { - if (isSCint(e1)) { - swapexps(e1, e2); - codebini(fs, OP_SHLI, e1, e2, 1, line, TM_SHL); - } - else if (finishbinexpneg(fs, e1, e2, OP_SHRI, line, TM_SHL)) { - ; - } - else - codebinexpval(fs, opr, e1, e2, line); - break; - } - case OPR_SHR: { - if (isSCint(e2)) - codebini(fs, OP_SHRI, e1, e2, 0, line, TM_SHR); - else - codebinexpval(fs, opr, e1, e2, line); - break; - } - case OPR_EQ: case OPR_NE: { - codeeq(fs, opr, e1, e2); - break; - } - case OPR_GT: case OPR_GE: { - - swapexps(e1, e2); - opr = cast(BinOpr, (opr - OPR_GT) + OPR_LT); - } - case OPR_LT: case OPR_LE: { - codeorder(fs, opr, e1, e2); - break; - } - default: lua_assert(0); - } -} - - - -void luaK_fixline (FuncState *fs, int line) { - removelastlineinfo(fs); - savelineinfo(fs, fs->f, line); -} - - -void luaK_settablesize (FuncState *fs, int pc, int ra, int asize, int hsize) { - Instruction *inst = &fs->f->code[pc]; - int rb = (hsize != 0) ? luaO_ceillog2(hsize) + 1 : 0; - int extra = asize / (MAXARG_C + 1); - int rc = asize % (MAXARG_C + 1); - int k = (extra > 0); - *inst = CREATE_ABCk(OP_NEWTABLE, ra, rb, rc, k); - *(inst + 1) = CREATE_Ax(OP_EXTRAARG, extra); -} - - - -void luaK_setlist (FuncState *fs, int base, int nelems, int tostore) { - lua_assert(tostore != 0 && tostore <= LFIELDS_PER_FLUSH); - if (tostore == LUA_MULTRET) - tostore = 0; - if (nelems <= MAXARG_C) - luaK_codeABC(fs, OP_SETLIST, base, tostore, nelems); - else { - int extra = nelems / (MAXARG_C + 1); - nelems %= (MAXARG_C + 1); - luaK_codeABCk(fs, OP_SETLIST, base, tostore, nelems, 1); - codeextraarg(fs, extra); - } - fs->freereg = base + 1; -} - - - -static int finaltarget (Instruction *code, int i) { - int count; - for (count = 0; count < 100; count++) { - Instruction pc = code[i]; - if (GET_OPCODE(pc) != OP_JMP) - break; - else - i += GETARG_sJ(pc) + 1; - } - return i; -} - - - -void luaK_finish (FuncState *fs) { - int i; - Proto *p = fs->f; - for (i = 0; i < fs->pc; i++) { - Instruction *pc = &p->code[i]; - lua_assert(i == 0 || isOT(*(pc - 1)) == isIT(*pc)); - switch (GET_OPCODE(*pc)) { - case OP_RETURN0: case OP_RETURN1: { - if (!(fs->needclose || (p->flag & PF_ISVARARG))) - break; - - SET_OPCODE(*pc, OP_RETURN); - } - case OP_RETURN: case OP_TAILCALL: { - if (fs->needclose) - SETARG_k(*pc, 1); - if (p->flag & PF_ISVARARG) - SETARG_C(*pc, p->numparams + 1); - break; - } - case OP_JMP: { - int target = finaltarget(p->code, i); - fixjump(fs, i, target); - break; - } - default: break; - } - } -} - - -//path: src/imports/../dependencies/lua/lparser.c - - -#define lparser_c -#define LUA_CORE - - - - - -#include -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -#define MAXVARS 200 - - -#define hasmultret(k) ((k) == VCALL || (k) == VVARARG) - - - -#define eqstr(a,b) ((a) == (b)) - - - -typedef struct BlockCnt { - struct BlockCnt *previous; - int firstlabel; - int firstgoto; - lu_byte nactvar; - lu_byte upval; - lu_byte isloop; - lu_byte insidetbc; -} BlockCnt; - - - - -static void statement (LexState *ls); -static void expr (LexState *ls, expdesc *v); - - -static l_noret error_expected (LexState *ls, int token) { - luaX_syntaxerror(ls, - luaO_pushfstring(ls->L, "%s expected", luaX_token2str(ls, token))); -} - - -static l_noret errorlimit (FuncState *fs, int limit, const char *what) { - lua_State *L = fs->ls->L; - const char *msg; - int line = fs->f->linedefined; - const char *where = (line == 0) - ? "main function" - : luaO_pushfstring(L, "function at line %d", line); - msg = luaO_pushfstring(L, "too many %s (limit is %d) in %s", - what, limit, where); - luaX_syntaxerror(fs->ls, msg); -} - - -static void checklimit (FuncState *fs, int v, int l, const char *what) { - if (v > l) errorlimit(fs, l, what); -} - - - -static int testnext (LexState *ls, int c) { - if (ls->t.token == c) { - luaX_next(ls); - return 1; - } - else return 0; -} - - - -static void check (LexState *ls, int c) { - if (ls->t.token != c) - error_expected(ls, c); -} - - - -static void checknext (LexState *ls, int c) { - check(ls, c); - luaX_next(ls); -} - - -#define check_condition(ls,c,msg) { if (!(c)) luaX_syntaxerror(ls, msg); } - - - -static void check_match (LexState *ls, int what, int who, int where) { - if (l_unlikely(!testnext(ls, what))) { - if (where == ls->linenumber) - error_expected(ls, what); - else { - luaX_syntaxerror(ls, luaO_pushfstring(ls->L, - "%s expected (to close %s at line %d)", - luaX_token2str(ls, what), luaX_token2str(ls, who), where)); - } - } -} - - -static TString *str_checkname (LexState *ls) { - TString *ts; - check(ls, TK_NAME); - ts = ls->t.seminfo.ts; - luaX_next(ls); - return ts; -} - - -static void init_exp (expdesc *e, expkind k, int i) { - e->f = e->t = NO_JUMP; - e->k = k; - e->u.info = i; -} - - -static void codestring (expdesc *e, TString *s) { - e->f = e->t = NO_JUMP; - e->k = VKSTR; - e->u.strval = s; -} - - -static void codename (LexState *ls, expdesc *e) { - codestring(e, str_checkname(ls)); -} - - - -static int registerlocalvar (LexState *ls, FuncState *fs, TString *varname) { - Proto *f = fs->f; - int oldsize = f->sizelocvars; - luaM_growvector(ls->L, f->locvars, fs->ndebugvars, f->sizelocvars, - LocVar, SHRT_MAX, "local variables"); - while (oldsize < f->sizelocvars) - f->locvars[oldsize++].varname = NULL; - f->locvars[fs->ndebugvars].varname = varname; - f->locvars[fs->ndebugvars].startpc = fs->pc; - luaC_objbarrier(ls->L, f, varname); - return fs->ndebugvars++; -} - - - -static int new_localvarkind (LexState *ls, TString *name, int kind) { - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Dyndata *dyd = ls->dyd; - Vardesc *var; - checklimit(fs, dyd->actvar.n + 1 - fs->firstlocal, - MAXVARS, "local variables"); - luaM_growvector(L, dyd->actvar.arr, dyd->actvar.n + 1, - dyd->actvar.size, Vardesc, USHRT_MAX, "local variables"); - var = &dyd->actvar.arr[dyd->actvar.n++]; - var->vd.kind = kind; - var->vd.name = name; - return dyd->actvar.n - 1 - fs->firstlocal; -} - - - -static int new_localvar (LexState *ls, TString *name) { - return new_localvarkind(ls, name, VDKREG); -} - -#define new_localvarliteral(ls,v) \ - new_localvar(ls, \ - luaX_newstring(ls, "" v, (sizeof(v)/sizeof(char)) - 1)); - - - - -static Vardesc *getlocalvardesc (FuncState *fs, int vidx) { - return &fs->ls->dyd->actvar.arr[fs->firstlocal + vidx]; -} - - - -static int reglevel (FuncState *fs, int nvar) { - while (nvar-- > 0) { - Vardesc *vd = getlocalvardesc(fs, nvar); - if (vd->vd.kind != RDKCTC) - return vd->vd.ridx + 1; - } - return 0; -} - - - -int luaY_nvarstack (FuncState *fs) { - return reglevel(fs, fs->nactvar); -} - - - -static LocVar *localdebuginfo (FuncState *fs, int vidx) { - Vardesc *vd = getlocalvardesc(fs, vidx); - if (vd->vd.kind == RDKCTC) - return NULL; - else { - int idx = vd->vd.pidx; - lua_assert(idx < fs->ndebugvars); - return &fs->f->locvars[idx]; - } -} - - - -static void init_var (FuncState *fs, expdesc *e, int vidx) { - e->f = e->t = NO_JUMP; - e->k = VLOCAL; - e->u.var.vidx = vidx; - e->u.var.ridx = getlocalvardesc(fs, vidx)->vd.ridx; -} - - - -static void check_readonly (LexState *ls, expdesc *e) { - FuncState *fs = ls->fs; - TString *varname = NULL; - switch (e->k) { - case VCONST: { - varname = ls->dyd->actvar.arr[e->u.info].vd.name; - break; - } - case VLOCAL: { - Vardesc *vardesc = getlocalvardesc(fs, e->u.var.vidx); - if (vardesc->vd.kind != VDKREG) - varname = vardesc->vd.name; - break; - } - case VUPVAL: { - Upvaldesc *up = &fs->f->upvalues[e->u.info]; - if (up->kind != VDKREG) - varname = up->name; - break; - } - default: - return; - } - if (varname) { - const char *msg = luaO_pushfstring(ls->L, - "attempt to assign to const variable '%s'", getstr(varname)); - luaK_semerror(ls, msg); - } -} - - - -static void adjustlocalvars (LexState *ls, int nvars) { - FuncState *fs = ls->fs; - int reglevel = luaY_nvarstack(fs); - int i; - for (i = 0; i < nvars; i++) { - int vidx = fs->nactvar++; - Vardesc *var = getlocalvardesc(fs, vidx); - var->vd.ridx = reglevel++; - var->vd.pidx = registerlocalvar(ls, fs, var->vd.name); - } -} - - - -static void removevars (FuncState *fs, int tolevel) { - fs->ls->dyd->actvar.n -= (fs->nactvar - tolevel); - while (fs->nactvar > tolevel) { - LocVar *var = localdebuginfo(fs, --fs->nactvar); - if (var) - var->endpc = fs->pc; - } -} - - - -static int searchupvalue (FuncState *fs, TString *name) { - int i; - Upvaldesc *up = fs->f->upvalues; - for (i = 0; i < fs->nups; i++) { - if (eqstr(up[i].name, name)) return i; - } - return -1; -} - - -static Upvaldesc *allocupvalue (FuncState *fs) { - Proto *f = fs->f; - int oldsize = f->sizeupvalues; - checklimit(fs, fs->nups + 1, MAXUPVAL, "upvalues"); - luaM_growvector(fs->ls->L, f->upvalues, fs->nups, f->sizeupvalues, - Upvaldesc, MAXUPVAL, "upvalues"); - while (oldsize < f->sizeupvalues) - f->upvalues[oldsize++].name = NULL; - return &f->upvalues[fs->nups++]; -} - - -static int newupvalue (FuncState *fs, TString *name, expdesc *v) { - Upvaldesc *up = allocupvalue(fs); - FuncState *prev = fs->prev; - if (v->k == VLOCAL) { - up->instack = 1; - up->idx = v->u.var.ridx; - up->kind = getlocalvardesc(prev, v->u.var.vidx)->vd.kind; - lua_assert(eqstr(name, getlocalvardesc(prev, v->u.var.vidx)->vd.name)); - } - else { - up->instack = 0; - up->idx = cast_byte(v->u.info); - up->kind = prev->f->upvalues[v->u.info].kind; - lua_assert(eqstr(name, prev->f->upvalues[v->u.info].name)); - } - up->name = name; - luaC_objbarrier(fs->ls->L, fs->f, name); - return fs->nups - 1; -} - - - -static int searchvar (FuncState *fs, TString *n, expdesc *var) { - int i; - for (i = cast_int(fs->nactvar) - 1; i >= 0; i--) { - Vardesc *vd = getlocalvardesc(fs, i); - if (eqstr(n, vd->vd.name)) { - if (vd->vd.kind == RDKCTC) - init_exp(var, VCONST, fs->firstlocal + i); - else - init_var(fs, var, i); - return var->k; - } - } - return -1; -} - - - -static void markupval (FuncState *fs, int level) { - BlockCnt *bl = fs->bl; - while (bl->nactvar > level) - bl = bl->previous; - bl->upval = 1; - fs->needclose = 1; -} - - - -static void marktobeclosed (FuncState *fs) { - BlockCnt *bl = fs->bl; - bl->upval = 1; - bl->insidetbc = 1; - fs->needclose = 1; -} - - - -static void singlevaraux (FuncState *fs, TString *n, expdesc *var, int base) { - if (fs == NULL) - init_exp(var, VVOID, 0); - else { - int v = searchvar(fs, n, var); - if (v >= 0) { - if (v == VLOCAL && !base) - markupval(fs, var->u.var.vidx); - } - else { - int idx = searchupvalue(fs, n); - if (idx < 0) { - singlevaraux(fs->prev, n, var, 0); - if (var->k == VLOCAL || var->k == VUPVAL) - idx = newupvalue(fs, n, var); - else - return; - } - init_exp(var, VUPVAL, idx); - } - } -} - - - -static void singlevar (LexState *ls, expdesc *var) { - TString *varname = str_checkname(ls); - FuncState *fs = ls->fs; - singlevaraux(fs, varname, var, 1); - if (var->k == VVOID) { - expdesc key; - singlevaraux(fs, ls->envn, var, 1); - lua_assert(var->k != VVOID); - luaK_exp2anyregup(fs, var); - codestring(&key, varname); - luaK_indexed(fs, var, &key); - } -} - - - -static void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) { - FuncState *fs = ls->fs; - int needed = nvars - nexps; - if (hasmultret(e->k)) { - int extra = needed + 1; - if (extra < 0) - extra = 0; - luaK_setreturns(fs, e, extra); - } - else { - if (e->k != VVOID) - luaK_exp2nextreg(fs, e); - if (needed > 0) - luaK_nil(fs, fs->freereg, needed); - } - if (needed > 0) - luaK_reserveregs(fs, needed); - else - fs->freereg += needed; -} - - -#define enterlevel(ls) luaE_incCstack(ls->L) - - -#define leavelevel(ls) ((ls)->L->nCcalls--) - - - -static l_noret jumpscopeerror (LexState *ls, Labeldesc *gt) { - TString *tsname = getlocalvardesc(ls->fs, gt->nactvar)->vd.name; - const char *varname = getstr(tsname); - const char *msg = " at line %d jumps into the scope of local '%s'"; - msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line, varname); - luaK_semerror(ls, msg); -} - - - -static void solvegoto (LexState *ls, int g, Labeldesc *label) { - int i; - Labellist *gl = &ls->dyd->gt; - Labeldesc *gt = &gl->arr[g]; - lua_assert(eqstr(gt->name, label->name)); - if (l_unlikely(gt->nactvar < label->nactvar)) - jumpscopeerror(ls, gt); - luaK_patchlist(ls->fs, gt->pc, label->pc); - for (i = g; i < gl->n - 1; i++) - gl->arr[i] = gl->arr[i + 1]; - gl->n--; -} - - - -static Labeldesc *findlabel (LexState *ls, TString *name) { - int i; - Dyndata *dyd = ls->dyd; - - for (i = ls->fs->firstlabel; i < dyd->label.n; i++) { - Labeldesc *lb = &dyd->label.arr[i]; - if (eqstr(lb->name, name)) - return lb; - } - return NULL; -} - - - -static int newlabelentry (LexState *ls, Labellist *l, TString *name, - int line, int pc) { - int n = l->n; - luaM_growvector(ls->L, l->arr, n, l->size, - Labeldesc, SHRT_MAX, "labels/gotos"); - l->arr[n].name = name; - l->arr[n].line = line; - l->arr[n].nactvar = ls->fs->nactvar; - l->arr[n].close = 0; - l->arr[n].pc = pc; - l->n = n + 1; - return n; -} - - -static int newgotoentry (LexState *ls, TString *name, int line, int pc) { - return newlabelentry(ls, &ls->dyd->gt, name, line, pc); -} - - - -static int solvegotos (LexState *ls, Labeldesc *lb) { - Labellist *gl = &ls->dyd->gt; - int i = ls->fs->bl->firstgoto; - int needsclose = 0; - while (i < gl->n) { - if (eqstr(gl->arr[i].name, lb->name)) { - needsclose |= gl->arr[i].close; - solvegoto(ls, i, lb); - } - else - i++; - } - return needsclose; -} - - - -static int createlabel (LexState *ls, TString *name, int line, - int last) { - FuncState *fs = ls->fs; - Labellist *ll = &ls->dyd->label; - int l = newlabelentry(ls, ll, name, line, luaK_getlabel(fs)); - if (last) { - - ll->arr[l].nactvar = fs->bl->nactvar; - } - if (solvegotos(ls, &ll->arr[l])) { - luaK_codeABC(fs, OP_CLOSE, luaY_nvarstack(fs), 0, 0); - return 1; - } - return 0; -} - - - -static void movegotosout (FuncState *fs, BlockCnt *bl) { - int i; - Labellist *gl = &fs->ls->dyd->gt; - - for (i = bl->firstgoto; i < gl->n; i++) { - Labeldesc *gt = &gl->arr[i]; - - if (reglevel(fs, gt->nactvar) > reglevel(fs, bl->nactvar)) - gt->close |= bl->upval; - gt->nactvar = bl->nactvar; - } -} - - -static void enterblock (FuncState *fs, BlockCnt *bl, lu_byte isloop) { - bl->isloop = isloop; - bl->nactvar = fs->nactvar; - bl->firstlabel = fs->ls->dyd->label.n; - bl->firstgoto = fs->ls->dyd->gt.n; - bl->upval = 0; - bl->insidetbc = (fs->bl != NULL && fs->bl->insidetbc); - bl->previous = fs->bl; - fs->bl = bl; - lua_assert(fs->freereg == luaY_nvarstack(fs)); -} - - - -static l_noret undefgoto (LexState *ls, Labeldesc *gt) { - const char *msg; - if (eqstr(gt->name, luaS_newliteral(ls->L, "break"))) { - msg = "break outside loop at line %d"; - msg = luaO_pushfstring(ls->L, msg, gt->line); - } - else { - msg = "no visible label '%s' for at line %d"; - msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line); - } - luaK_semerror(ls, msg); -} - - -static void leaveblock (FuncState *fs) { - BlockCnt *bl = fs->bl; - LexState *ls = fs->ls; - int hasclose = 0; - int stklevel = reglevel(fs, bl->nactvar); - removevars(fs, bl->nactvar); - lua_assert(bl->nactvar == fs->nactvar); - if (bl->isloop) - hasclose = createlabel(ls, luaS_newliteral(ls->L, "break"), 0, 0); - if (!hasclose && bl->previous && bl->upval) - luaK_codeABC(fs, OP_CLOSE, stklevel, 0, 0); - fs->freereg = stklevel; - ls->dyd->label.n = bl->firstlabel; - fs->bl = bl->previous; - if (bl->previous) - movegotosout(fs, bl); - else { - if (bl->firstgoto < ls->dyd->gt.n) - undefgoto(ls, &ls->dyd->gt.arr[bl->firstgoto]); - } -} - - - -static Proto *addprototype (LexState *ls) { - Proto *clp; - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Proto *f = fs->f; - if (fs->np >= f->sizep) { - int oldsize = f->sizep; - luaM_growvector(L, f->p, fs->np, f->sizep, Proto *, MAXARG_Bx, "functions"); - while (oldsize < f->sizep) - f->p[oldsize++] = NULL; - } - f->p[fs->np++] = clp = luaF_newproto(L); - luaC_objbarrier(L, f, clp); - return clp; -} - - - -static void codeclosure (LexState *ls, expdesc *v) { - FuncState *fs = ls->fs->prev; - init_exp(v, VRELOC, luaK_codeABx(fs, OP_CLOSURE, 0, fs->np - 1)); - luaK_exp2nextreg(fs, v); -} - - -static void open_func (LexState *ls, FuncState *fs, BlockCnt *bl) { - Proto *f = fs->f; - fs->prev = ls->fs; - fs->ls = ls; - ls->fs = fs; - fs->pc = 0; - fs->previousline = f->linedefined; - fs->iwthabs = 0; - fs->lasttarget = 0; - fs->freereg = 0; - fs->nk = 0; - fs->nabslineinfo = 0; - fs->np = 0; - fs->nups = 0; - fs->ndebugvars = 0; - fs->nactvar = 0; - fs->needclose = 0; - fs->firstlocal = ls->dyd->actvar.n; - fs->firstlabel = ls->dyd->label.n; - fs->bl = NULL; - f->source = ls->source; - luaC_objbarrier(ls->L, f, f->source); - f->maxstacksize = 2; - enterblock(fs, bl, 0); -} - - -static void close_func (LexState *ls) { - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Proto *f = fs->f; - luaK_ret(fs, luaY_nvarstack(fs), 0); - leaveblock(fs); - lua_assert(fs->bl == NULL); - luaK_finish(fs); - luaM_shrinkvector(L, f->code, f->sizecode, fs->pc, Instruction); - luaM_shrinkvector(L, f->lineinfo, f->sizelineinfo, fs->pc, ls_byte); - luaM_shrinkvector(L, f->abslineinfo, f->sizeabslineinfo, - fs->nabslineinfo, AbsLineInfo); - luaM_shrinkvector(L, f->k, f->sizek, fs->nk, TValue); - luaM_shrinkvector(L, f->p, f->sizep, fs->np, Proto *); - luaM_shrinkvector(L, f->locvars, f->sizelocvars, fs->ndebugvars, LocVar); - luaM_shrinkvector(L, f->upvalues, f->sizeupvalues, fs->nups, Upvaldesc); - ls->fs = fs->prev; - luaC_checkGC(L); -} - - - - - - - - - -static int block_follow (LexState *ls, int withuntil) { - switch (ls->t.token) { - case TK_ELSE: case TK_ELSEIF: - case TK_END: case TK_EOS: - return 1; - case TK_UNTIL: return withuntil; - default: return 0; - } -} - - -static void statlist (LexState *ls) { - - while (!block_follow(ls, 1)) { - if (ls->t.token == TK_RETURN) { - statement(ls); - return; - } - statement(ls); - } -} - - -static void fieldsel (LexState *ls, expdesc *v) { - - FuncState *fs = ls->fs; - expdesc key; - luaK_exp2anyregup(fs, v); - luaX_next(ls); - codename(ls, &key); - luaK_indexed(fs, v, &key); -} - - -static void yindex (LexState *ls, expdesc *v) { - - luaX_next(ls); - expr(ls, v); - luaK_exp2val(ls->fs, v); - checknext(ls, ']'); -} - - - - - -typedef struct ConsControl { - expdesc v; - expdesc *t; - int nh; - int na; - int tostore; -} ConsControl; - - -static void recfield (LexState *ls, ConsControl *cc) { - - FuncState *fs = ls->fs; - int reg = ls->fs->freereg; - expdesc tab, key, val; - if (ls->t.token == TK_NAME) { - checklimit(fs, cc->nh, MAX_INT, "items in a constructor"); - codename(ls, &key); - } - else - yindex(ls, &key); - cc->nh++; - checknext(ls, '='); - tab = *cc->t; - luaK_indexed(fs, &tab, &key); - expr(ls, &val); - luaK_storevar(fs, &tab, &val); - fs->freereg = reg; -} - - -static void closelistfield (FuncState *fs, ConsControl *cc) { - if (cc->v.k == VVOID) return; - luaK_exp2nextreg(fs, &cc->v); - cc->v.k = VVOID; - if (cc->tostore == LFIELDS_PER_FLUSH) { - luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); - cc->na += cc->tostore; - cc->tostore = 0; - } -} - - -static void lastlistfield (FuncState *fs, ConsControl *cc) { - if (cc->tostore == 0) return; - if (hasmultret(cc->v.k)) { - luaK_setmultret(fs, &cc->v); - luaK_setlist(fs, cc->t->u.info, cc->na, LUA_MULTRET); - cc->na--; - } - else { - if (cc->v.k != VVOID) - luaK_exp2nextreg(fs, &cc->v); - luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); - } - cc->na += cc->tostore; -} - - -static void listfield (LexState *ls, ConsControl *cc) { - - expr(ls, &cc->v); - cc->tostore++; -} - - -static void field (LexState *ls, ConsControl *cc) { - - switch(ls->t.token) { - case TK_NAME: { - if (luaX_lookahead(ls) != '=') - listfield(ls, cc); - else - recfield(ls, cc); - break; - } - case '[': { - recfield(ls, cc); - break; - } - default: { - listfield(ls, cc); - break; - } - } -} - - -static void constructor (LexState *ls, expdesc *t) { - - FuncState *fs = ls->fs; - int line = ls->linenumber; - int pc = luaK_codeABC(fs, OP_NEWTABLE, 0, 0, 0); - ConsControl cc; - luaK_code(fs, 0); - cc.na = cc.nh = cc.tostore = 0; - cc.t = t; - init_exp(t, VNONRELOC, fs->freereg); - luaK_reserveregs(fs, 1); - init_exp(&cc.v, VVOID, 0); - checknext(ls, '{'); - do { - lua_assert(cc.v.k == VVOID || cc.tostore > 0); - if (ls->t.token == '}') break; - closelistfield(fs, &cc); - field(ls, &cc); - } while (testnext(ls, ',') || testnext(ls, ';')); - check_match(ls, '}', '{', line); - lastlistfield(fs, &cc); - luaK_settablesize(fs, pc, t->u.info, cc.na, cc.nh); -} - - - - -static void setvararg (FuncState *fs, int nparams) { - fs->f->flag |= PF_ISVARARG; - luaK_codeABC(fs, OP_VARARGPREP, nparams, 0, 0); -} - - -static void parlist (LexState *ls) { - - FuncState *fs = ls->fs; - Proto *f = fs->f; - int nparams = 0; - int isvararg = 0; - if (ls->t.token != ')') { - do { - switch (ls->t.token) { - case TK_NAME: { - new_localvar(ls, str_checkname(ls)); - nparams++; - break; - } - case TK_DOTS: { - luaX_next(ls); - isvararg = 1; - break; - } - default: luaX_syntaxerror(ls, " or '...' expected"); - } - } while (!isvararg && testnext(ls, ',')); - } - adjustlocalvars(ls, nparams); - f->numparams = cast_byte(fs->nactvar); - if (isvararg) - setvararg(fs, f->numparams); - luaK_reserveregs(fs, fs->nactvar); -} - - -static void body (LexState *ls, expdesc *e, int ismethod, int line) { - - FuncState new_fs; - BlockCnt bl; - new_fs.f = addprototype(ls); - new_fs.f->linedefined = line; - open_func(ls, &new_fs, &bl); - checknext(ls, '('); - if (ismethod) { - new_localvarliteral(ls, "self"); - adjustlocalvars(ls, 1); - } - parlist(ls); - checknext(ls, ')'); - statlist(ls); - new_fs.f->lastlinedefined = ls->linenumber; - check_match(ls, TK_END, TK_FUNCTION, line); - codeclosure(ls, e); - close_func(ls); -} - - -static int explist (LexState *ls, expdesc *v) { - - int n = 1; - expr(ls, v); - while (testnext(ls, ',')) { - luaK_exp2nextreg(ls->fs, v); - expr(ls, v); - n++; - } - return n; -} - - -static void funcargs (LexState *ls, expdesc *f) { - FuncState *fs = ls->fs; - expdesc args; - int base, nparams; - int line = ls->linenumber; - switch (ls->t.token) { - case '(': { - luaX_next(ls); - if (ls->t.token == ')') - args.k = VVOID; - else { - explist(ls, &args); - if (hasmultret(args.k)) - luaK_setmultret(fs, &args); - } - check_match(ls, ')', '(', line); - break; - } - case '{': { - constructor(ls, &args); - break; - } - case TK_STRING: { - codestring(&args, ls->t.seminfo.ts); - luaX_next(ls); - break; - } - default: { - luaX_syntaxerror(ls, "function arguments expected"); - } - } - lua_assert(f->k == VNONRELOC); - base = f->u.info; - if (hasmultret(args.k)) - nparams = LUA_MULTRET; - else { - if (args.k != VVOID) - luaK_exp2nextreg(fs, &args); - nparams = fs->freereg - (base+1); - } - init_exp(f, VCALL, luaK_codeABC(fs, OP_CALL, base, nparams+1, 2)); - luaK_fixline(fs, line); - fs->freereg = base+1; -} - - - - - - - -static void primaryexp (LexState *ls, expdesc *v) { - - switch (ls->t.token) { - case '(': { - int line = ls->linenumber; - luaX_next(ls); - expr(ls, v); - check_match(ls, ')', '(', line); - luaK_dischargevars(ls->fs, v); - return; - } - case TK_NAME: { - singlevar(ls, v); - return; - } - default: { - luaX_syntaxerror(ls, "unexpected symbol"); - } - } -} - - -static void suffixedexp (LexState *ls, expdesc *v) { - - FuncState *fs = ls->fs; - primaryexp(ls, v); - for (;;) { - switch (ls->t.token) { - case '.': { - fieldsel(ls, v); - break; - } - case '[': { - expdesc key; - luaK_exp2anyregup(fs, v); - yindex(ls, &key); - luaK_indexed(fs, v, &key); - break; - } - case ':': { - expdesc key; - luaX_next(ls); - codename(ls, &key); - luaK_self(fs, v, &key); - funcargs(ls, v); - break; - } - case '(': case TK_STRING: case '{': { - luaK_exp2nextreg(fs, v); - funcargs(ls, v); - break; - } - default: return; - } - } -} - - -static void simpleexp (LexState *ls, expdesc *v) { - - switch (ls->t.token) { - case TK_FLT: { - init_exp(v, VKFLT, 0); - v->u.nval = ls->t.seminfo.r; - break; - } - case TK_INT: { - init_exp(v, VKINT, 0); - v->u.ival = ls->t.seminfo.i; - break; - } - case TK_STRING: { - codestring(v, ls->t.seminfo.ts); - break; - } - case TK_NIL: { - init_exp(v, VNIL, 0); - break; - } - case TK_TRUE: { - init_exp(v, VTRUE, 0); - break; - } - case TK_FALSE: { - init_exp(v, VFALSE, 0); - break; - } - case TK_DOTS: { - FuncState *fs = ls->fs; - check_condition(ls, fs->f->flag & PF_ISVARARG, - "cannot use '...' outside a vararg function"); - init_exp(v, VVARARG, luaK_codeABC(fs, OP_VARARG, 0, 0, 1)); - break; - } - case '{': { - constructor(ls, v); - return; - } - case TK_FUNCTION: { - luaX_next(ls); - body(ls, v, 0, ls->linenumber); - return; - } - default: { - suffixedexp(ls, v); - return; - } - } - luaX_next(ls); -} - - -static UnOpr getunopr (int op) { - switch (op) { - case TK_NOT: return OPR_NOT; - case '-': return OPR_MINUS; - case '~': return OPR_BNOT; - case '#': return OPR_LEN; - default: return OPR_NOUNOPR; - } -} - - -static BinOpr getbinopr (int op) { - switch (op) { - case '+': return OPR_ADD; - case '-': return OPR_SUB; - case '*': return OPR_MUL; - case '%': return OPR_MOD; - case '^': return OPR_POW; - case '/': return OPR_DIV; - case TK_IDIV: return OPR_IDIV; - case '&': return OPR_BAND; - case '|': return OPR_BOR; - case '~': return OPR_BXOR; - case TK_SHL: return OPR_SHL; - case TK_SHR: return OPR_SHR; - case TK_CONCAT: return OPR_CONCAT; - case TK_NE: return OPR_NE; - case TK_EQ: return OPR_EQ; - case '<': return OPR_LT; - case TK_LE: return OPR_LE; - case '>': return OPR_GT; - case TK_GE: return OPR_GE; - case TK_AND: return OPR_AND; - case TK_OR: return OPR_OR; - default: return OPR_NOBINOPR; - } -} - - - -static const struct { - lu_byte left; - lu_byte right; -} priority[] = { - {10, 10}, {10, 10}, - {11, 11}, {11, 11}, - {14, 13}, - {11, 11}, {11, 11}, - {6, 6}, {4, 4}, {5, 5}, - {7, 7}, {7, 7}, - {9, 8}, - {3, 3}, {3, 3}, {3, 3}, - {3, 3}, {3, 3}, {3, 3}, - {2, 2}, {1, 1} -}; - -#define UNARY_PRIORITY 12 - - - -static BinOpr subexpr (LexState *ls, expdesc *v, int limit) { - BinOpr op; - UnOpr uop; - enterlevel(ls); - uop = getunopr(ls->t.token); - if (uop != OPR_NOUNOPR) { - int line = ls->linenumber; - luaX_next(ls); - subexpr(ls, v, UNARY_PRIORITY); - luaK_prefix(ls->fs, uop, v, line); - } - else simpleexp(ls, v); - - op = getbinopr(ls->t.token); - while (op != OPR_NOBINOPR && priority[op].left > limit) { - expdesc v2; - BinOpr nextop; - int line = ls->linenumber; - luaX_next(ls); - luaK_infix(ls->fs, op, v); - - nextop = subexpr(ls, &v2, priority[op].right); - luaK_posfix(ls->fs, op, v, &v2, line); - op = nextop; - } - leavelevel(ls); - return op; -} - - -static void expr (LexState *ls, expdesc *v) { - subexpr(ls, v, 0); -} - - - - - - - - -static void block (LexState *ls) { - - FuncState *fs = ls->fs; - BlockCnt bl; - enterblock(fs, &bl, 0); - statlist(ls); - leaveblock(fs); -} - - - -struct LHS_assign { - struct LHS_assign *prev; - expdesc v; -}; - - - -static void check_conflict (LexState *ls, struct LHS_assign *lh, expdesc *v) { - FuncState *fs = ls->fs; - int extra = fs->freereg; - int conflict = 0; - for (; lh; lh = lh->prev) { - if (vkisindexed(lh->v.k)) { - if (lh->v.k == VINDEXUP) { - if (v->k == VUPVAL && lh->v.u.ind.t == v->u.info) { - conflict = 1; - lh->v.k = VINDEXSTR; - lh->v.u.ind.t = extra; - } - } - else { - if (v->k == VLOCAL && lh->v.u.ind.t == v->u.var.ridx) { - conflict = 1; - lh->v.u.ind.t = extra; - } - - if (lh->v.k == VINDEXED && v->k == VLOCAL && - lh->v.u.ind.idx == v->u.var.ridx) { - conflict = 1; - lh->v.u.ind.idx = extra; - } - } - } - } - if (conflict) { - - if (v->k == VLOCAL) - luaK_codeABC(fs, OP_MOVE, extra, v->u.var.ridx, 0); - else - luaK_codeABC(fs, OP_GETUPVAL, extra, v->u.info, 0); - luaK_reserveregs(fs, 1); - } -} - - -static void restassign (LexState *ls, struct LHS_assign *lh, int nvars) { - expdesc e; - check_condition(ls, vkisvar(lh->v.k), "syntax private_lua_error"); - check_readonly(ls, &lh->v); - if (testnext(ls, ',')) { - struct LHS_assign nv; - nv.prev = lh; - suffixedexp(ls, &nv.v); - if (!vkisindexed(nv.v.k)) - check_conflict(ls, lh, &nv.v); - enterlevel(ls); - restassign(ls, &nv, nvars+1); - leavelevel(ls); - } - else { - int nexps; - checknext(ls, '='); - nexps = explist(ls, &e); - if (nexps != nvars) - adjust_assign(ls, nvars, nexps, &e); - else { - luaK_setoneret(ls->fs, &e); - luaK_storevar(ls->fs, &lh->v, &e); - return; - } - } - init_exp(&e, VNONRELOC, ls->fs->freereg-1); - luaK_storevar(ls->fs, &lh->v, &e); -} - - -static int cond (LexState *ls) { - - expdesc v; - expr(ls, &v); - if (v.k == VNIL) v.k = VFALSE; - luaK_goiftrue(ls->fs, &v); - return v.f; -} - - -static void gotostat (LexState *ls) { - FuncState *fs = ls->fs; - int line = ls->linenumber; - TString *name = str_checkname(ls); - Labeldesc *lb = findlabel(ls, name); - if (lb == NULL) - - newgotoentry(ls, name, line, luaK_jump(fs)); - else { - - int lblevel = reglevel(fs, lb->nactvar); - if (luaY_nvarstack(fs) > lblevel) - luaK_codeABC(fs, OP_CLOSE, lblevel, 0, 0); - - luaK_patchlist(fs, luaK_jump(fs), lb->pc); - } -} - - - -static void breakstat (LexState *ls) { - int line = ls->linenumber; - luaX_next(ls); - newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, luaK_jump(ls->fs)); -} - - - -static void checkrepeated (LexState *ls, TString *name) { - Labeldesc *lb = findlabel(ls, name); - if (l_unlikely(lb != NULL)) { - const char *msg = "label '%s' already defined on line %d"; - msg = luaO_pushfstring(ls->L, msg, getstr(name), lb->line); - luaK_semerror(ls, msg); - } -} - - -static void labelstat (LexState *ls, TString *name, int line) { - - checknext(ls, TK_DBCOLON); - while (ls->t.token == ';' || ls->t.token == TK_DBCOLON) - statement(ls); - checkrepeated(ls, name); - createlabel(ls, name, line, block_follow(ls, 0)); -} - - -static void whilestat (LexState *ls, int line) { - - FuncState *fs = ls->fs; - int whileinit; - int condexit; - BlockCnt bl; - luaX_next(ls); - whileinit = luaK_getlabel(fs); - condexit = cond(ls); - enterblock(fs, &bl, 1); - checknext(ls, TK_DO); - block(ls); - luaK_jumpto(fs, whileinit); - check_match(ls, TK_END, TK_WHILE, line); - leaveblock(fs); - luaK_patchtohere(fs, condexit); -} - - -static void repeatstat (LexState *ls, int line) { - - int condexit; - FuncState *fs = ls->fs; - int repeat_init = luaK_getlabel(fs); - BlockCnt bl1, bl2; - enterblock(fs, &bl1, 1); - enterblock(fs, &bl2, 0); - luaX_next(ls); - statlist(ls); - check_match(ls, TK_UNTIL, TK_REPEAT, line); - condexit = cond(ls); - leaveblock(fs); - if (bl2.upval) { - int exit = luaK_jump(fs); - luaK_patchtohere(fs, condexit); - luaK_codeABC(fs, OP_CLOSE, reglevel(fs, bl2.nactvar), 0, 0); - condexit = luaK_jump(fs); - luaK_patchtohere(fs, exit); - } - luaK_patchlist(fs, condexit, repeat_init); - leaveblock(fs); -} - - - -static void exp1 (LexState *ls) { - expdesc e; - expr(ls, &e); - luaK_exp2nextreg(ls->fs, &e); - lua_assert(e.k == VNONRELOC); -} - - - -static void fixforjump (FuncState *fs, int pc, int dest, int back) { - Instruction *jmp = &fs->f->code[pc]; - int offset = dest - (pc + 1); - if (back) - offset = -offset; - if (l_unlikely(offset > MAXARG_Bx)) - luaX_syntaxerror(fs->ls, "control structure too long"); - SETARG_Bx(*jmp, offset); -} - - - -static void forbody (LexState *ls, int base, int line, int nvars, int isgen) { - - static const OpCode forprep[2] = {OP_FORPREP, OP_TFORPREP}; - static const OpCode forloop[2] = {OP_FORLOOP, OP_TFORLOOP}; - BlockCnt bl; - FuncState *fs = ls->fs; - int prep, endfor; - checknext(ls, TK_DO); - prep = luaK_codeABx(fs, forprep[isgen], base, 0); - fs->freereg--; - enterblock(fs, &bl, 0); - adjustlocalvars(ls, nvars); - luaK_reserveregs(fs, nvars); - block(ls); - leaveblock(fs); - fixforjump(fs, prep, luaK_getlabel(fs), 0); - if (isgen) { - luaK_codeABC(fs, OP_TFORCALL, base, 0, nvars); - luaK_fixline(fs, line); - } - endfor = luaK_codeABx(fs, forloop[isgen], base, 0); - fixforjump(fs, endfor, prep + 1, 1); - luaK_fixline(fs, line); -} - - -static void fornum (LexState *ls, TString *varname, int line) { - - FuncState *fs = ls->fs; - int base = fs->freereg; - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvarkind(ls, varname, RDKCONST); - checknext(ls, '='); - exp1(ls); - checknext(ls, ','); - exp1(ls); - if (testnext(ls, ',')) - exp1(ls); - else { - luaK_int(fs, fs->freereg, 1); - luaK_reserveregs(fs, 1); - } - adjustlocalvars(ls, 2); - forbody(ls, base, line, 1, 0); -} - - -static void forlist (LexState *ls, TString *indexname) { - - FuncState *fs = ls->fs; - expdesc e; - int nvars = 4; - int line; - int base = fs->freereg; - - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvarkind(ls, indexname, RDKCONST); - - while (testnext(ls, ',')) { - new_localvar(ls, str_checkname(ls)); - nvars++; - } - checknext(ls, TK_IN); - line = ls->linenumber; - adjust_assign(ls, 4, explist(ls, &e), &e); - adjustlocalvars(ls, 3); - marktobeclosed(fs); - luaK_checkstack(fs, 2); - forbody(ls, base, line, nvars - 3, 1); -} - - -static void forstat (LexState *ls, int line) { - - FuncState *fs = ls->fs; - TString *varname; - BlockCnt bl; - enterblock(fs, &bl, 1); - luaX_next(ls); - varname = str_checkname(ls); - switch (ls->t.token) { - case '=': fornum(ls, varname, line); break; - case ',': case TK_IN: forlist(ls, varname); break; - default: luaX_syntaxerror(ls, "'=' or 'in' expected"); - } - check_match(ls, TK_END, TK_FOR, line); - leaveblock(fs); -} - - -static void test_then_block (LexState *ls, int *escapelist) { - - BlockCnt bl; - FuncState *fs = ls->fs; - expdesc v; - int jf; - luaX_next(ls); - expr(ls, &v); - checknext(ls, TK_THEN); - if (ls->t.token == TK_BREAK) { - int line = ls->linenumber; - luaK_goiffalse(ls->fs, &v); - luaX_next(ls); - enterblock(fs, &bl, 0); - newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, v.t); - while (testnext(ls, ';')) {} - if (block_follow(ls, 0)) { - leaveblock(fs); - return; - } - else - jf = luaK_jump(fs); - } - else { - luaK_goiftrue(ls->fs, &v); - enterblock(fs, &bl, 0); - jf = v.f; - } - statlist(ls); - leaveblock(fs); - if (ls->t.token == TK_ELSE || - ls->t.token == TK_ELSEIF) - luaK_concat(fs, escapelist, luaK_jump(fs)); - luaK_patchtohere(fs, jf); -} - - -static void ifstat (LexState *ls, int line) { - - FuncState *fs = ls->fs; - int escapelist = NO_JUMP; - test_then_block(ls, &escapelist); - while (ls->t.token == TK_ELSEIF) - test_then_block(ls, &escapelist); - if (testnext(ls, TK_ELSE)) - block(ls); - check_match(ls, TK_END, TK_IF, line); - luaK_patchtohere(fs, escapelist); -} - - -static void localfunc (LexState *ls) { - expdesc b; - FuncState *fs = ls->fs; - int fvar = fs->nactvar; - new_localvar(ls, str_checkname(ls)); - adjustlocalvars(ls, 1); - body(ls, &b, 0, ls->linenumber); - - localdebuginfo(fs, fvar)->startpc = fs->pc; -} - - -static int getlocalattribute (LexState *ls) { - - if (testnext(ls, '<')) { - TString *ts = str_checkname(ls); - const char *attr = getstr(ts); - checknext(ls, '>'); - if (strcmp(attr, "const") == 0) - return RDKCONST; - else if (strcmp(attr, "close") == 0) - return RDKTOCLOSE; - else - luaK_semerror(ls, - luaO_pushfstring(ls->L, "unknown attribute '%s'", attr)); - } - return VDKREG; -} - - -static void checktoclose (FuncState *fs, int level) { - if (level != -1) { - marktobeclosed(fs); - luaK_codeABC(fs, OP_TBC, reglevel(fs, level), 0, 0); - } -} - - -static void localstat (LexState *ls) { - - FuncState *fs = ls->fs; - int toclose = -1; - Vardesc *var; - int vidx; - int nvars = 0; - int nexps; - expdesc e; - do { - TString *vname = str_checkname(ls); - int kind = getlocalattribute(ls); - vidx = new_localvarkind(ls, vname, kind); - if (kind == RDKTOCLOSE) { - if (toclose != -1) - luaK_semerror(ls, "multiple to-be-closed variables in local list"); - toclose = fs->nactvar + nvars; - } - nvars++; - } while (testnext(ls, ',')); - if (testnext(ls, '=')) - nexps = explist(ls, &e); - else { - e.k = VVOID; - nexps = 0; - } - var = getlocalvardesc(fs, vidx); - if (nvars == nexps && - var->vd.kind == RDKCONST && - luaK_exp2const(fs, &e, &var->k)) { - var->vd.kind = RDKCTC; - adjustlocalvars(ls, nvars - 1); - fs->nactvar++; - } - else { - adjust_assign(ls, nvars, nexps, &e); - adjustlocalvars(ls, nvars); - } - checktoclose(fs, toclose); -} - - -static int funcname (LexState *ls, expdesc *v) { - - int ismethod = 0; - singlevar(ls, v); - while (ls->t.token == '.') - fieldsel(ls, v); - if (ls->t.token == ':') { - ismethod = 1; - fieldsel(ls, v); - } - return ismethod; -} - - -static void funcstat (LexState *ls, int line) { - - int ismethod; - expdesc v, b; - luaX_next(ls); - ismethod = funcname(ls, &v); - body(ls, &b, ismethod, line); - check_readonly(ls, &v); - luaK_storevar(ls->fs, &v, &b); - luaK_fixline(ls->fs, line); -} - - -static void exprstat (LexState *ls) { - - FuncState *fs = ls->fs; - struct LHS_assign v; - suffixedexp(ls, &v.v); - if (ls->t.token == '=' || ls->t.token == ',') { - v.prev = NULL; - restassign(ls, &v, 1); - } - else { - Instruction *inst; - check_condition(ls, v.v.k == VCALL, "syntax private_lua_error"); - inst = &getinstruction(fs, &v.v); - SETARG_C(*inst, 1); - } -} - - -static void retstat (LexState *ls) { - - FuncState *fs = ls->fs; - expdesc e; - int nret; - int first = luaY_nvarstack(fs); - if (block_follow(ls, 1) || ls->t.token == ';') - nret = 0; - else { - nret = explist(ls, &e); - if (hasmultret(e.k)) { - luaK_setmultret(fs, &e); - if (e.k == VCALL && nret == 1 && !fs->bl->insidetbc) { - SET_OPCODE(getinstruction(fs,&e), OP_TAILCALL); - lua_assert(GETARG_A(getinstruction(fs,&e)) == luaY_nvarstack(fs)); - } - nret = LUA_MULTRET; - } - else { - if (nret == 1) - first = luaK_exp2anyreg(fs, &e); - else { - luaK_exp2nextreg(fs, &e); - lua_assert(nret == fs->freereg - first); - } - } - } - luaK_ret(fs, first, nret); - testnext(ls, ';'); -} - - -static void statement (LexState *ls) { - int line = ls->linenumber; - enterlevel(ls); - switch (ls->t.token) { - case ';': { - luaX_next(ls); - break; - } - case TK_IF: { - ifstat(ls, line); - break; - } - case TK_WHILE: { - whilestat(ls, line); - break; - } - case TK_DO: { - luaX_next(ls); - block(ls); - check_match(ls, TK_END, TK_DO, line); - break; - } - case TK_FOR: { - forstat(ls, line); - break; - } - case TK_REPEAT: { - repeatstat(ls, line); - break; - } - case TK_FUNCTION: { - funcstat(ls, line); - break; - } - case TK_LOCAL: { - luaX_next(ls); - if (testnext(ls, TK_FUNCTION)) - localfunc(ls); - else - localstat(ls); - break; - } - case TK_DBCOLON: { - luaX_next(ls); - labelstat(ls, str_checkname(ls), line); - break; - } - case TK_RETURN: { - luaX_next(ls); - retstat(ls); - break; - } - case TK_BREAK: { - breakstat(ls); - break; - } - case TK_GOTO: { - luaX_next(ls); - gotostat(ls); - break; - } - default: { - exprstat(ls); - break; - } - } - lua_assert(ls->fs->f->maxstacksize >= ls->fs->freereg && - ls->fs->freereg >= luaY_nvarstack(ls->fs)); - ls->fs->freereg = luaY_nvarstack(ls->fs); - leavelevel(ls); -} - - - - - -static void mainfunc (LexState *ls, FuncState *fs) { - BlockCnt bl; - Upvaldesc *env; - open_func(ls, fs, &bl); - setvararg(fs, 0); - env = allocupvalue(fs); - env->instack = 1; - env->idx = 0; - env->kind = VDKREG; - env->name = ls->envn; - luaC_objbarrier(ls->L, fs->f, env->name); - luaX_next(ls); - statlist(ls); - check(ls, TK_EOS); - close_func(ls); -} - - -LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, - Dyndata *dyd, const char *name, int firstchar) { - LexState lexstate; - FuncState funcstate; - LClosure *cl = luaF_newLclosure(L, 1); - setclLvalue2s(L, L->top.p, cl); - luaD_inctop(L); - lexstate.h = luaH_new(L); - sethvalue2s(L, L->top.p, lexstate.h); - luaD_inctop(L); - funcstate.f = cl->p = luaF_newproto(L); - luaC_objbarrier(L, cl, cl->p); - funcstate.f->source = luaS_new(L, name); - luaC_objbarrier(L, funcstate.f, funcstate.f->source); - lexstate.buff = buff; - lexstate.dyd = dyd; - dyd->actvar.n = dyd->gt.n = dyd->label.n = 0; - luaX_setinput(L, &lexstate, z, funcstate.f->source, firstchar); - mainfunc(&lexstate, &funcstate); - lua_assert(!funcstate.prev && funcstate.nups == 1 && !lexstate.fs); - - lua_assert(dyd->actvar.n == 0 && dyd->gt.n == 0 && dyd->label.n == 0); - L->top.p--; - return cl; -} - - - -//path: src/imports/../dependencies/lua/ldebug.c - - -#define ldebug_c -#define LUA_CORE - - - - - -#include -#include -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -#define noLuaClosure(f) ((f) == NULL || (f)->c.tt == LUA_VCCL) - - -static const char *funcnamefromcall (lua_State *L, CallInfo *ci, - const char **name); - - -static int currentpc (CallInfo *ci) { - lua_assert(isLua(ci)); - return pcRel(ci->u.l.savedpc, ci_func(ci)->p); -} - - - -static int getbaseline (const Proto *f, int pc, int *basepc) { - if (f->sizeabslineinfo == 0 || pc < f->abslineinfo[0].pc) { - *basepc = -1; - return f->linedefined; - } - else { - int i = cast_uint(pc) / MAXIWTHABS - 1; - - lua_assert(i < 0 || - (i < f->sizeabslineinfo && f->abslineinfo[i].pc <= pc)); - while (i + 1 < f->sizeabslineinfo && pc >= f->abslineinfo[i + 1].pc) - i++; - *basepc = f->abslineinfo[i].pc; - return f->abslineinfo[i].line; - } -} - - - -int luaG_getfuncline (const Proto *f, int pc) { - if (f->lineinfo == NULL) - return -1; - else { - int basepc; - int baseline = getbaseline(f, pc, &basepc); - while (basepc++ < pc) { - lua_assert(f->lineinfo[basepc] != ABSLINEINFO); - baseline += f->lineinfo[basepc]; - } - return baseline; - } -} - - -static int getcurrentline (CallInfo *ci) { - return luaG_getfuncline(ci_func(ci)->p, currentpc(ci)); -} - - - -static void settraps (CallInfo *ci) { - for (; ci != NULL; ci = ci->previous) - if (isLua(ci)) - ci->u.l.trap = 1; -} - - - -LUA_API void lua_sethook (lua_State *L, lua_Hook func, int mask, int count) { - if (func == NULL || mask == 0) { - mask = 0; - func = NULL; - } - L->hook = func; - L->basehookcount = count; - resethookcount(L); - L->hookmask = cast_byte(mask); - if (mask) - settraps(L->ci); -} - - -LUA_API lua_Hook lua_gethook (lua_State *L) { - return L->hook; -} - - -LUA_API int lua_gethookmask (lua_State *L) { - return L->hookmask; -} - - -LUA_API int lua_gethookcount (lua_State *L) { - return L->basehookcount; -} - - -LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar) { - int status; - CallInfo *ci; - if (level < 0) return 0; - lua_lock(L); - for (ci = L->ci; level > 0 && ci != &L->base_ci; ci = ci->previous) - level--; - if (level == 0 && ci != &L->base_ci) { - status = 1; - ar->i_ci = ci; - } - else status = 0; - lua_unlock(L); - return status; -} - - -static const char *upvalname (const Proto *p, int uv) { - TString *s = check_exp(uv < p->sizeupvalues, p->upvalues[uv].name); - if (s == NULL) return "?"; - else return getstr(s); -} - - -static const char *findvararg (CallInfo *ci, int n, StkId *pos) { - if (clLvalue(s2v(ci->func.p))->p->flag & PF_ISVARARG) { - int nextra = ci->u.l.nextraargs; - if (n >= -nextra) { - *pos = ci->func.p - nextra - (n + 1); - return "(vararg)"; - } - } - return NULL; -} - - -const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, StkId *pos) { - StkId base = ci->func.p + 1; - const char *name = NULL; - if (isLua(ci)) { - if (n < 0) - return findvararg(ci, n, pos); - else - name = luaF_getlocalname(ci_func(ci)->p, n, currentpc(ci)); - } - if (name == NULL) { - StkId limit = (ci == L->ci) ? L->top.p : ci->next->func.p; - if (limit - base >= n && n > 0) { - - name = isLua(ci) ? "(temporary)" : "(C temporary)"; - } - else - return NULL; - } - if (pos) - *pos = base + (n - 1); - return name; -} - - -LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) { - const char *name; - lua_lock(L); - if (ar == NULL) { - if (!isLfunction(s2v(L->top.p - 1))) - name = NULL; - else - name = luaF_getlocalname(clLvalue(s2v(L->top.p - 1))->p, n, 0); - } - else { - StkId pos = NULL; - name = luaG_findlocal(L, ar->i_ci, n, &pos); - if (name) { - setobjs2s(L, L->top.p, pos); - api_incr_top(L); - } - } - lua_unlock(L); - return name; -} - - -LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) { - StkId pos = NULL; - const char *name; - lua_lock(L); - name = luaG_findlocal(L, ar->i_ci, n, &pos); - if (name) { - api_checkpop(L, 1); - setobjs2s(L, pos, L->top.p - 1); - L->top.p--; - } - lua_unlock(L); - return name; -} - - -static void funcinfo (lua_Debug *ar, Closure *cl) { - if (noLuaClosure(cl)) { - ar->source = "=[C]"; - ar->srclen = LL("=[C]"); - ar->linedefined = -1; - ar->lastlinedefined = -1; - ar->what = "C"; - } - else { - const Proto *p = cl->l.p; - if (p->source) { - ar->source = getlstr(p->source, ar->srclen); - } - else { - ar->source = "=?"; - ar->srclen = LL("=?"); - } - ar->linedefined = p->linedefined; - ar->lastlinedefined = p->lastlinedefined; - ar->what = (ar->linedefined == 0) ? "main" : "Lua"; - } - luaO_chunkid(ar->short_src, ar->source, ar->srclen); -} - - -static int nextline (const Proto *p, int currentline, int pc) { - if (p->lineinfo[pc] != ABSLINEINFO) - return currentline + p->lineinfo[pc]; - else - return luaG_getfuncline(p, pc); -} - - -static void collectvalidlines (lua_State *L, Closure *f) { - if (noLuaClosure(f)) { - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - } - else { - int i; - TValue v; - const Proto *p = f->l.p; - int currentline = p->linedefined; - Table *t = luaH_new(L); - sethvalue2s(L, L->top.p, t); - api_incr_top(L); - setbtvalue(&v); - if (!(p->flag & PF_ISVARARG)) - i = 0; - else { - lua_assert(GET_OPCODE(p->code[0]) == OP_VARARGPREP); - currentline = nextline(p, currentline, 0); - i = 1; - } - for (; i < p->sizelineinfo; i++) { - currentline = nextline(p, currentline, i); - luaH_setint(L, t, currentline, &v); - } - } -} - - -static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name) { - - if (ci != NULL && !(ci->callstatus & CIST_TAIL)) - return funcnamefromcall(L, ci->previous, name); - else return NULL; -} - - -static int auxgetinfo (lua_State *L, const char *what, lua_Debug *ar, - Closure *f, CallInfo *ci) { - int status = 1; - for (; *what; what++) { - switch (*what) { - case 'S': { - funcinfo(ar, f); - break; - } - case 'l': { - ar->currentline = (ci && isLua(ci)) ? getcurrentline(ci) : -1; - break; - } - case 'u': { - ar->nups = (f == NULL) ? 0 : f->c.nupvalues; - if (noLuaClosure(f)) { - ar->isvararg = 1; - ar->nparams = 0; - } - else { - ar->isvararg = f->l.p->flag & PF_ISVARARG; - ar->nparams = f->l.p->numparams; - } - break; - } - case 't': { - ar->istailcall = (ci) ? ci->callstatus & CIST_TAIL : 0; - break; - } - case 'n': { - ar->namewhat = getfuncname(L, ci, &ar->name); - if (ar->namewhat == NULL) { - ar->namewhat = ""; - ar->name = NULL; - } - break; - } - case 'r': { - if (ci == NULL || !(ci->callstatus & CIST_TRAN)) - ar->ftransfer = ar->ntransfer = 0; - else { - ar->ftransfer = ci->u2.transferinfo.ftransfer; - ar->ntransfer = ci->u2.transferinfo.ntransfer; - } - break; - } - case 'L': - case 'f': - break; - default: status = 0; - } - } - return status; -} - - -LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) { - int status; - Closure *cl; - CallInfo *ci; - TValue *func; - lua_lock(L); - if (*what == '>') { - ci = NULL; - func = s2v(L->top.p - 1); - api_check(L, ttisfunction(func), "function expected"); - what++; - L->top.p--; - } - else { - ci = ar->i_ci; - func = s2v(ci->func.p); - lua_assert(ttisfunction(func)); - } - cl = ttisclosure(func) ? clvalue(func) : NULL; - status = auxgetinfo(L, what, ar, cl, ci); - if (strchr(what, 'f')) { - setobj2s(L, L->top.p, func); - api_incr_top(L); - } - if (strchr(what, 'L')) - collectvalidlines(L, cl); - lua_unlock(L); - return status; -} - - - - - -static int filterpc (int pc, int jmptarget) { - if (pc < jmptarget) - return -1; - else return pc; -} - - - -static int findsetreg (const Proto *p, int lastpc, int reg) { - int pc; - int setreg = -1; - int jmptarget = 0; - if (testMMMode(GET_OPCODE(p->code[lastpc]))) - lastpc--; - for (pc = 0; pc < lastpc; pc++) { - Instruction i = p->code[pc]; - OpCode op = GET_OPCODE(i); - int a = GETARG_A(i); - int change; - switch (op) { - case OP_LOADNIL: { - int b = GETARG_B(i); - change = (a <= reg && reg <= a + b); - break; - } - case OP_TFORCALL: { - change = (reg >= a + 2); - break; - } - case OP_CALL: - case OP_TAILCALL: { - change = (reg >= a); - break; - } - case OP_JMP: { - int b = GETARG_sJ(i); - int dest = pc + 1 + b; - - if (dest <= lastpc && dest > jmptarget) - jmptarget = dest; - change = 0; - break; - } - default: - change = (testAMode(op) && reg == a); - break; - } - if (change) - setreg = filterpc(pc, jmptarget); - } - return setreg; -} - - - -static const char *kname (const Proto *p, int index, const char **name) { - TValue *kvalue = &p->k[index]; - if (ttisstring(kvalue)) { - *name = getstr(tsvalue(kvalue)); - return "constant"; - } - else { - *name = "?"; - return NULL; - } -} - - -static const char *basicgetobjname (const Proto *p, int *ppc, int reg, - const char **name) { - int pc = *ppc; - *name = luaF_getlocalname(p, reg + 1, pc); - if (*name) - return "local"; - - *ppc = pc = findsetreg(p, pc, reg); - if (pc != -1) { - Instruction i = p->code[pc]; - OpCode op = GET_OPCODE(i); - switch (op) { - case OP_MOVE: { - int b = GETARG_B(i); - if (b < GETARG_A(i)) - return basicgetobjname(p, ppc, b, name); - break; - } - case OP_GETUPVAL: { - *name = upvalname(p, GETARG_B(i)); - return "upvalue"; - } - case OP_LOADK: return kname(p, GETARG_Bx(i), name); - case OP_LOADKX: return kname(p, GETARG_Ax(p->code[pc + 1]), name); - default: break; - } - } - return NULL; -} - - - -static void rname (const Proto *p, int pc, int c, const char **name) { - const char *what = basicgetobjname(p, &pc, c, name); - if (!(what && *what == 'c')) - *name = "?"; -} - - - -static void rkname (const Proto *p, int pc, Instruction i, const char **name) { - int c = GETARG_C(i); - if (GETARG_k(i)) - kname(p, c, name); - else - rname(p, pc, c, name); -} - - - -static const char *isEnv (const Proto *p, int pc, Instruction i, int isup) { - int t = GETARG_B(i); - const char *name; - if (isup) - name = upvalname(p, t); - else - basicgetobjname(p, &pc, t, &name); - return (name && strcmp(name, LUA_ENV) == 0) ? "global" : "field"; -} - - - -static const char *getobjname (const Proto *p, int lastpc, int reg, - const char **name) { - const char *kind = basicgetobjname(p, &lastpc, reg, name); - if (kind != NULL) - return kind; - else if (lastpc != -1) { - Instruction i = p->code[lastpc]; - OpCode op = GET_OPCODE(i); - switch (op) { - case OP_GETTABUP: { - int k = GETARG_C(i); - kname(p, k, name); - return isEnv(p, lastpc, i, 1); - } - case OP_GETTABLE: { - int k = GETARG_C(i); - rname(p, lastpc, k, name); - return isEnv(p, lastpc, i, 0); - } - case OP_GETI: { - *name = "integer index"; - return "field"; - } - case OP_GETFIELD: { - int k = GETARG_C(i); - kname(p, k, name); - return isEnv(p, lastpc, i, 0); - } - case OP_SELF: { - rkname(p, lastpc, i, name); - return "method"; - } - default: break; - } - } - return NULL; -} - - - -static const char *funcnamefromcode (lua_State *L, const Proto *p, - int pc, const char **name) { - TMS tm = (TMS)0; - Instruction i = p->code[pc]; - switch (GET_OPCODE(i)) { - case OP_CALL: - case OP_TAILCALL: - return getobjname(p, pc, GETARG_A(i), name); - case OP_TFORCALL: { - *name = "for iterator"; - return "for iterator"; - } - - case OP_SELF: case OP_GETTABUP: case OP_GETTABLE: - case OP_GETI: case OP_GETFIELD: - tm = TM_INDEX; - break; - case OP_SETTABUP: case OP_SETTABLE: case OP_SETI: case OP_SETFIELD: - tm = TM_NEWINDEX; - break; - case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { - tm = cast(TMS, GETARG_C(i)); - break; - } - case OP_UNM: tm = TM_UNM; break; - case OP_BNOT: tm = TM_BNOT; break; - case OP_LEN: tm = TM_LEN; break; - case OP_CONCAT: tm = TM_CONCAT; break; - case OP_EQ: tm = TM_EQ; break; - - case OP_LT: case OP_LTI: case OP_GTI: tm = TM_LT; break; - case OP_LE: case OP_LEI: case OP_GEI: tm = TM_LE; break; - case OP_CLOSE: case OP_RETURN: tm = TM_CLOSE; break; - default: - return NULL; - } - *name = getshrstr(G(L)->tmname[tm]) + 2; - return "metamethod"; -} - - - -static const char *funcnamefromcall (lua_State *L, CallInfo *ci, - const char **name) { - if (ci->callstatus & CIST_HOOKED) { - *name = "?"; - return "hook"; - } - else if (ci->callstatus & CIST_FIN) { - *name = "__gc"; - return "metamethod"; - } - else if (isLua(ci)) - return funcnamefromcode(L, ci_func(ci)->p, currentpc(ci), name); - else - return NULL; -} - - - - - - -static int instack (CallInfo *ci, const TValue *o) { - int pos; - StkId base = ci->func.p + 1; - for (pos = 0; base + pos < ci->top.p; pos++) { - if (o == s2v(base + pos)) - return pos; - } - return -1; -} - - - -static const char *getupvalname (CallInfo *ci, const TValue *o, - const char **name) { - LClosure *c = ci_func(ci); - int i; - for (i = 0; i < c->nupvalues; i++) { - if (c->upvals[i]->v.p == o) { - *name = upvalname(c->p, i); - return "upvalue"; - } - } - return NULL; -} - - -static const char *formatvarinfo (lua_State *L, const char *kind, - const char *name) { - if (kind == NULL) - return ""; - else - return luaO_pushfstring(L, " (%s '%s')", kind, name); -} - - -static const char *varinfo (lua_State *L, const TValue *o) { - CallInfo *ci = L->ci; - const char *name = NULL; - const char *kind = NULL; - if (isLua(ci)) { - kind = getupvalname(ci, o, &name); - if (!kind) { - int reg = instack(ci, o); - if (reg >= 0) - kind = getobjname(ci_func(ci)->p, currentpc(ci), reg, &name); - } - } - return formatvarinfo(L, kind, name); -} - - - -static l_noret typeerror (lua_State *L, const TValue *o, const char *op, - const char *extra) { - const char *t = luaT_objtypename(L, o); - luaG_runerror(L, "attempt to %s a %s value%s", op, t, extra); -} - - - -l_noret luaG_typeerror (lua_State *L, const TValue *o, const char *op) { - typeerror(L, o, op, varinfo(L, o)); -} - - - -l_noret luaG_callerror (lua_State *L, const TValue *o) { - CallInfo *ci = L->ci; - const char *name = NULL; - const char *kind = funcnamefromcall(L, ci, &name); - const char *extra = kind ? formatvarinfo(L, kind, name) : varinfo(L, o); - typeerror(L, o, "call", extra); -} - - -l_noret luaG_forerror (lua_State *L, const TValue *o, const char *what) { - luaG_runerror(L, "bad 'for' %s (number expected, got %s)", - what, luaT_objtypename(L, o)); -} - - -l_noret luaG_concaterror (lua_State *L, const TValue *p1, const TValue *p2) { - if (ttisstring(p1) || cvt2str(p1)) p1 = p2; - luaG_typeerror(L, p1, "concatenate"); -} - - -l_noret luaG_opinterror (lua_State *L, const TValue *p1, - const TValue *p2, const char *msg) { - if (!ttisnumber(p1)) - p2 = p1; - luaG_typeerror(L, p2, msg); -} - - - -l_noret luaG_tointerror (lua_State *L, const TValue *p1, const TValue *p2) { - lua_Integer temp; - if (!luaV_tointegerns(p1, &temp, LUA_FLOORN2I)) - p2 = p1; - luaG_runerror(L, "number%s has no integer representation", varinfo(L, p2)); -} - - -l_noret luaG_ordererror (lua_State *L, const TValue *p1, const TValue *p2) { - const char *t1 = luaT_objtypename(L, p1); - const char *t2 = luaT_objtypename(L, p2); - if (strcmp(t1, t2) == 0) - luaG_runerror(L, "attempt to compare two %s values", t1); - else - luaG_runerror(L, "attempt to compare %s with %s", t1, t2); -} - - - -const char *luaG_addinfo (lua_State *L, const char *msg, TString *src, - int line) { - char buff[LUA_IDSIZE]; - if (src) { - size_t idlen; - const char *id = getlstr(src, idlen); - luaO_chunkid(buff, id, idlen); - } - else { - buff[0] = '?'; buff[1] = '\0'; - } - return luaO_pushfstring(L, "%s:%d: %s", buff, line, msg); -} - - -l_noret luaG_errormsg (lua_State *L) { - if (L->errfunc != 0) { - StkId errfunc = restorestack(L, L->errfunc); - lua_assert(ttisfunction(s2v(errfunc))); - setobjs2s(L, L->top.p, L->top.p - 1); - setobjs2s(L, L->top.p - 1, errfunc); - L->top.p++; - luaD_callnoyield(L, L->top.p - 2, 1); - } - luaD_throw(L, LUA_ERRRUN); -} - - -l_noret luaG_runerror (lua_State *L, const char *fmt, ...) { - CallInfo *ci = L->ci; - const char *msg; - va_list argp; - luaC_checkGC(L); - va_start(argp, fmt); - msg = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - if (isLua(ci)) { - luaG_addinfo(L, msg, ci_func(ci)->p->source, getcurrentline(ci)); - setobjs2s(L, L->top.p - 2, L->top.p - 1); - L->top.p--; - } - luaG_errormsg(L); -} - - - -static int changedline (const Proto *p, int oldpc, int newpc) { - if (p->lineinfo == NULL) - return 0; - if (newpc - oldpc < MAXIWTHABS / 2) { - int delta = 0; - int pc = oldpc; - for (;;) { - int lineinfo = p->lineinfo[++pc]; - if (lineinfo == ABSLINEINFO) - break; - delta += lineinfo; - if (pc == newpc) - return (delta != 0); - } - } - - return (luaG_getfuncline(p, oldpc) != luaG_getfuncline(p, newpc)); -} - - - -int luaG_tracecall (lua_State *L) { - CallInfo *ci = L->ci; - Proto *p = ci_func(ci)->p; - ci->u.l.trap = 1; - if (ci->u.l.savedpc == p->code) { - if (p->flag & PF_ISVARARG) - return 0; - else if (!(ci->callstatus & CIST_HOOKYIELD)) - luaD_hookcall(L, ci); - } - return 1; -} - - - -int luaG_traceexec (lua_State *L, const Instruction *pc) { - CallInfo *ci = L->ci; - lu_byte mask = L->hookmask; - const Proto *p = ci_func(ci)->p; - int counthook; - if (!(mask & (LUA_MASKLINE | LUA_MASKCOUNT))) { - ci->u.l.trap = 0; - return 0; - } - pc++; - ci->u.l.savedpc = pc; - counthook = (mask & LUA_MASKCOUNT) && (--L->hookcount == 0); - if (counthook) - resethookcount(L); - else if (!(mask & LUA_MASKLINE)) - return 1; - if (ci->callstatus & CIST_HOOKYIELD) { - ci->callstatus &= ~CIST_HOOKYIELD; - return 1; - } - if (!isIT(*(ci->u.l.savedpc - 1))) - L->top.p = ci->top.p; - if (counthook) - luaD_hook(L, LUA_HOOKCOUNT, -1, 0, 0); - if (mask & LUA_MASKLINE) { - - int oldpc = (L->oldpc < p->sizecode) ? L->oldpc : 0; - int npci = pcRel(pc, p); - if (npci <= oldpc || - changedline(p, oldpc, npci)) { - int newline = luaG_getfuncline(p, npci); - luaD_hook(L, LUA_HOOKLINE, newline, 0, 0); - } - L->oldpc = npci; - } - if (L->status == LUA_YIELD) { - if (counthook) - L->hookcount = 1; - ci->callstatus |= CIST_HOOKYIELD; - luaD_throw(L, LUA_YIELD); - } - return 1; -} - - - -//path: src/imports/../dependencies/lua/lfunc.c - - -#define lfunc_c -#define LUA_CORE - - - - - -#include - - - - - - - - - - - - - - - - - - - - - -CClosure *luaF_newCclosure (lua_State *L, int nupvals) { - GCObject *o = luaC_newobj(L, LUA_VCCL, sizeCclosure(nupvals)); - CClosure *c = gco2ccl(o); - c->nupvalues = cast_byte(nupvals); - return c; -} - - -LClosure *luaF_newLclosure (lua_State *L, int nupvals) { - GCObject *o = luaC_newobj(L, LUA_VLCL, sizeLclosure(nupvals)); - LClosure *c = gco2lcl(o); - c->p = NULL; - c->nupvalues = cast_byte(nupvals); - while (nupvals--) c->upvals[nupvals] = NULL; - return c; -} - - - -void luaF_initupvals (lua_State *L, LClosure *cl) { - int i; - for (i = 0; i < cl->nupvalues; i++) { - GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); - UpVal *uv = gco2upv(o); - uv->v.p = &uv->u.value; - setnilvalue(uv->v.p); - cl->upvals[i] = uv; - luaC_objbarrier(L, cl, uv); - } -} - - - -static UpVal *newupval (lua_State *L, StkId level, UpVal **prev) { - GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); - UpVal *uv = gco2upv(o); - UpVal *next = *prev; - uv->v.p = s2v(level); - uv->u.open.next = next; - uv->u.open.previous = prev; - if (next) - next->u.open.previous = &uv->u.open.next; - *prev = uv; - if (!isintwups(L)) { - L->twups = G(L)->twups; - G(L)->twups = L; - } - return uv; -} - - - -UpVal *luaF_findupval (lua_State *L, StkId level) { - UpVal **pp = &L->openupval; - UpVal *p; - lua_assert(isintwups(L) || L->openupval == NULL); - while ((p = *pp) != NULL && uplevel(p) >= level) { - lua_assert(!isdead(G(L), p)); - if (uplevel(p) == level) - return p; - pp = &p->u.open.next; - } - - return newupval(L, level, pp); -} - - - -static void callclosemethod (lua_State *L, TValue *obj, TValue *err, int yy) { - StkId top = L->top.p; - const TValue *tm = luaT_gettmbyobj(L, obj, TM_CLOSE); - setobj2s(L, top, tm); - setobj2s(L, top + 1, obj); - setobj2s(L, top + 2, err); - L->top.p = top + 3; - if (yy) - luaD_call(L, top, 0); - else - luaD_callnoyield(L, top, 0); -} - - - -static void checkclosemth (lua_State *L, StkId level) { - const TValue *tm = luaT_gettmbyobj(L, s2v(level), TM_CLOSE); - if (ttisnil(tm)) { - int idx = cast_int(level - L->ci->func.p); - const char *vname = luaG_findlocal(L, L->ci, idx, NULL); - if (vname == NULL) vname = "?"; - luaG_runerror(L, "variable '%s' got a non-closable value", vname); - } -} - - - -static void prepcallclosemth (lua_State *L, StkId level, int status, int yy) { - TValue *uv = s2v(level); - TValue *errobj; - if (status == CLOSEKTOP) - errobj = &G(L)->nilvalue; - else { - errobj = s2v(level + 1); - luaD_seterrorobj(L, status, level + 1); - } - callclosemethod(L, uv, errobj, yy); -} - - - -#define MAXDELTA \ - ((256ul << ((sizeof(L->stack.p->tbclist.delta) - 1) * 8)) - 1) - - - -void luaF_newtbcupval (lua_State *L, StkId level) { - lua_assert(level > L->tbclist.p); - if (l_isfalse(s2v(level))) - return; - checkclosemth(L, level); - while (cast_uint(level - L->tbclist.p) > MAXDELTA) { - L->tbclist.p += MAXDELTA; - L->tbclist.p->tbclist.delta = 0; - } - level->tbclist.delta = cast(unsigned short, level - L->tbclist.p); - L->tbclist.p = level; -} - - -void luaF_unlinkupval (UpVal *uv) { - lua_assert(upisopen(uv)); - *uv->u.open.previous = uv->u.open.next; - if (uv->u.open.next) - uv->u.open.next->u.open.previous = uv->u.open.previous; -} - - - -void luaF_closeupval (lua_State *L, StkId level) { - UpVal *uv; - StkId upl; - while ((uv = L->openupval) != NULL && (upl = uplevel(uv)) >= level) { - TValue *slot = &uv->u.value; - lua_assert(uplevel(uv) < L->top.p); - luaF_unlinkupval(uv); - setobj(L, slot, uv->v.p); - uv->v.p = slot; - if (!iswhite(uv)) { - nw2black(uv); - luaC_barrier(L, uv, slot); - } - } -} - - - -static void poptbclist (lua_State *L) { - StkId tbc = L->tbclist.p; - lua_assert(tbc->tbclist.delta > 0); - tbc -= tbc->tbclist.delta; - while (tbc > L->stack.p && tbc->tbclist.delta == 0) - tbc -= MAXDELTA; - L->tbclist.p = tbc; -} - - - -StkId luaF_close (lua_State *L, StkId level, int status, int yy) { - ptrdiff_t levelrel = savestack(L, level); - luaF_closeupval(L, level); - while (L->tbclist.p >= level) { - StkId tbc = L->tbclist.p; - poptbclist(L); - prepcallclosemth(L, tbc, status, yy); - level = restorestack(L, levelrel); - } - return level; -} - - -Proto *luaF_newproto (lua_State *L) { - GCObject *o = luaC_newobj(L, LUA_VPROTO, sizeof(Proto)); - Proto *f = gco2p(o); - f->k = NULL; - f->sizek = 0; - f->p = NULL; - f->sizep = 0; - f->code = NULL; - f->sizecode = 0; - f->lineinfo = NULL; - f->sizelineinfo = 0; - f->abslineinfo = NULL; - f->sizeabslineinfo = 0; - f->upvalues = NULL; - f->sizeupvalues = 0; - f->numparams = 0; - f->flag = 0; - f->maxstacksize = 0; - f->locvars = NULL; - f->sizelocvars = 0; - f->linedefined = 0; - f->lastlinedefined = 0; - f->source = NULL; - return f; -} - - -void luaF_freeproto (lua_State *L, Proto *f) { - if (!(f->flag & PF_FIXED)) { - luaM_freearray(L, f->code, f->sizecode); - luaM_freearray(L, f->lineinfo, f->sizelineinfo); - luaM_freearray(L, f->abslineinfo, f->sizeabslineinfo); - } - luaM_freearray(L, f->p, f->sizep); - luaM_freearray(L, f->k, f->sizek); - luaM_freearray(L, f->locvars, f->sizelocvars); - luaM_freearray(L, f->upvalues, f->sizeupvalues); - luaM_free(L, f); -} - - - -const char *luaF_getlocalname (const Proto *f, int local_number, int pc) { - int i; - for (i = 0; isizelocvars && f->locvars[i].startpc <= pc; i++) { - if (pc < f->locvars[i].endpc) { - local_number--; - if (local_number == 0) - return getstr(f->locvars[i].varname); - } - } - return NULL; -} - - - -//path: src/imports/../dependencies/lua/lobject.c - - -#define lobject_c -#define LUA_CORE - - - - - -#include -#include -#include -#include -#include - - - - - - - - - - - - - - - - - - - - - - - -int luaO_ceillog2 (unsigned int x) { - static const lu_byte log_2[256] = { - 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, - 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, - 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, - 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8 - }; - int l = 0; - x--; - while (x >= 256) { l += 8; x >>= 8; } - return l + log_2[x]; -} - - -unsigned int luaO_codeparam (unsigned int p) { - if (p >= (cast(lu_mem, 0x1F) << (0xF - 7 - 1)) * 100u) - return 0xFF; - else { - p = (cast(l_uint32, p) * 128 + 99) / 100; - if (p < 0x10) - return p; - else { - int log = luaO_ceillog2(p + 1) - 5; - return ((p >> log) - 0x10) | ((log + 1) << 4); - } - } -} - - - -l_obj luaO_applyparam (unsigned int p, l_obj x) { - unsigned int m = p & 0xF; - int e = (p >> 4); - if (e > 0) { - e--; - m += 0x10; - } - e -= 7; - if (e >= 0) { - if (x < (MAX_LOBJ / 0x1F) >> e) - return (x * m) << e; - else - return MAX_LOBJ; - } - else { - e = -e; - if (x < MAX_LOBJ / 0x1F) - return (x * m) >> e; - else if ((x >> e) < MAX_LOBJ / 0x1F) - return (x >> e) * m; - else - return MAX_LOBJ; - } -} - - -static lua_Integer intarith (lua_State *L, int op, lua_Integer v1, - lua_Integer v2) { - switch (op) { - case LUA_OPADD: return intop(+, v1, v2); - case LUA_OPSUB:return intop(-, v1, v2); - case LUA_OPMUL:return intop(*, v1, v2); - case LUA_OPMOD: return luaV_mod(L, v1, v2); - case LUA_OPIDIV: return luaV_idiv(L, v1, v2); - case LUA_OPBAND: return intop(&, v1, v2); - case LUA_OPBOR: return intop(|, v1, v2); - case LUA_OPBXOR: return intop(^, v1, v2); - case LUA_OPSHL: return luaV_shiftl(v1, v2); - case LUA_OPSHR: return luaV_shiftr(v1, v2); - case LUA_OPUNM: return intop(-, 0, v1); - case LUA_OPBNOT: return intop(^, ~l_castS2U(0), v1); - default: lua_assert(0); return 0; - } -} - - -static lua_Number numarith (lua_State *L, int op, lua_Number v1, - lua_Number v2) { - switch (op) { - case LUA_OPADD: return luai_numadd(L, v1, v2); - case LUA_OPSUB: return luai_numsub(L, v1, v2); - case LUA_OPMUL: return luai_nummul(L, v1, v2); - case LUA_OPDIV: return luai_numdiv(L, v1, v2); - case LUA_OPPOW: return luai_numpow(L, v1, v2); - case LUA_OPIDIV: return luai_numidiv(L, v1, v2); - case LUA_OPUNM: return luai_numunm(L, v1); - case LUA_OPMOD: return luaV_modf(L, v1, v2); - default: lua_assert(0); return 0; - } -} - - -int luaO_rawarith (lua_State *L, int op, const TValue *p1, const TValue *p2, - TValue *res) { - switch (op) { - case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: - case LUA_OPSHL: case LUA_OPSHR: - case LUA_OPBNOT: { - lua_Integer i1; lua_Integer i2; - if (tointegerns(p1, &i1) && tointegerns(p2, &i2)) { - setivalue(res, intarith(L, op, i1, i2)); - return 1; - } - else return 0; - } - case LUA_OPDIV: case LUA_OPPOW: { - lua_Number n1; lua_Number n2; - if (tonumberns(p1, n1) && tonumberns(p2, n2)) { - setfltvalue(res, numarith(L, op, n1, n2)); - return 1; - } - else return 0; - } - default: { - lua_Number n1; lua_Number n2; - if (ttisinteger(p1) && ttisinteger(p2)) { - setivalue(res, intarith(L, op, ivalue(p1), ivalue(p2))); - return 1; - } - else if (tonumberns(p1, n1) && tonumberns(p2, n2)) { - setfltvalue(res, numarith(L, op, n1, n2)); - return 1; - } - else return 0; - } - } -} - - -void luaO_arith (lua_State *L, int op, const TValue *p1, const TValue *p2, - StkId res) { - if (!luaO_rawarith(L, op, p1, p2, s2v(res))) { - - luaT_trybinTM(L, p1, p2, res, cast(TMS, (op - LUA_OPADD) + TM_ADD)); - } -} - - -int luaO_hexavalue (int c) { - if (lisdigit(c)) return c - '0'; - else return (ltolower(c) - 'a') + 10; -} - - -static int isneg (const char **s) { - if (**s == '-') { (*s)++; return 1; } - else if (**s == '+') (*s)++; - return 0; -} - - - - - -#if !defined(lua_strx2number) - - -#define MAXSIGDIG 30 - - -static lua_Number lua_strx2number (const char *s, char **endptr) { - int dot = lua_getlocaledecpoint(); - lua_Number r = l_mathop(0.0); - int sigdig = 0; - int nosigdig = 0; - int e = 0; - int neg; - int hasdot = 0; - *endptr = cast_charp(s); - while (lisspace(cast_uchar(*s))) s++; - neg = isneg(&s); - if (!(*s == '0' && (*(s + 1) == 'x' || *(s + 1) == 'X'))) - return l_mathop(0.0); - for (s += 2; ; s++) { - if (*s == dot) { - if (hasdot) break; - else hasdot = 1; - } - else if (lisxdigit(cast_uchar(*s))) { - if (sigdig == 0 && *s == '0') - nosigdig++; - else if (++sigdig <= MAXSIGDIG) - r = (r * l_mathop(16.0)) + luaO_hexavalue(*s); - else e++; - if (hasdot) e--; - } - else break; - } - if (nosigdig + sigdig == 0) - return l_mathop(0.0); - *endptr = cast_charp(s); - e *= 4; - if (*s == 'p' || *s == 'P') { - int exp1 = 0; - int neg1; - s++; - neg1 = isneg(&s); - if (!lisdigit(cast_uchar(*s))) - return l_mathop(0.0); - while (lisdigit(cast_uchar(*s))) - exp1 = exp1 * 10 + *(s++) - '0'; - if (neg1) exp1 = -exp1; - e += exp1; - *endptr = cast_charp(s); - } - if (neg) r = -r; - return l_mathop(ldexp)(r, e); -} - -#endif - - - - -#if !defined (L_MAXLENNUM) -#define L_MAXLENNUM 200 -#endif - - -static const char *l_str2dloc (const char *s, lua_Number *result, int mode) { - char *endptr; - *result = (mode == 'x') ? lua_strx2number(s, &endptr) - : lua_str2number(s, &endptr); - if (endptr == s) return NULL; - while (lisspace(cast_uchar(*endptr))) endptr++; - return (*endptr == '\0') ? endptr : NULL; -} - - - -static const char *l_str2d (const char *s, lua_Number *result) { - const char *endptr; - const char *pmode = strpbrk(s, ".xXnN"); - int mode = pmode ? ltolower(cast_uchar(*pmode)) : 0; - if (mode == 'n') - return NULL; - endptr = l_str2dloc(s, result, mode); - if (endptr == NULL) { - char buff[L_MAXLENNUM + 1]; - const char *pdot = strchr(s, '.'); - if (pdot == NULL || strlen(s) > L_MAXLENNUM) - return NULL; - strcpy(buff, s); - buff[pdot - s] = lua_getlocaledecpoint(); - endptr = l_str2dloc(buff, result, mode); - if (endptr != NULL) - endptr = s + (endptr - buff); - } - return endptr; -} - - -#define MAXBY10 cast(lua_Unsigned, LUA_MAXINTEGER / 10) -#define MAXLASTD cast_int(LUA_MAXINTEGER % 10) - -static const char *l_str2int (const char *s, lua_Integer *result) { - lua_Unsigned a = 0; - int empty = 1; - int neg; - while (lisspace(cast_uchar(*s))) s++; - neg = isneg(&s); - if (s[0] == '0' && - (s[1] == 'x' || s[1] == 'X')) { - s += 2; - for (; lisxdigit(cast_uchar(*s)); s++) { - a = a * 16 + luaO_hexavalue(*s); - empty = 0; - } - } - else { - for (; lisdigit(cast_uchar(*s)); s++) { - int d = *s - '0'; - if (a >= MAXBY10 && (a > MAXBY10 || d > MAXLASTD + neg)) - return NULL; - a = a * 10 + d; - empty = 0; - } - } - while (lisspace(cast_uchar(*s))) s++; - if (empty || *s != '\0') return NULL; - else { - *result = l_castU2S((neg) ? 0u - a : a); - return s; - } -} - - -size_t luaO_str2num (const char *s, TValue *o) { - lua_Integer i; lua_Number n; - const char *e; - if ((e = l_str2int(s, &i)) != NULL) { - setivalue(o, i); - } - else if ((e = l_str2d(s, &n)) != NULL) { - setfltvalue(o, n); - } - else - return 0; - return (e - s) + 1; -} - - -int luaO_utf8esc (char *buff, unsigned long x) { - int n = 1; - lua_assert(x <= 0x7FFFFFFFu); - if (x < 0x80) - buff[UTF8BUFFSZ - 1] = cast_char(x); - else { - unsigned int mfb = 0x3f; - do { - buff[UTF8BUFFSZ - (n++)] = cast_char(0x80 | (x & 0x3f)); - x >>= 6; - mfb >>= 1; - } while (x > mfb); - buff[UTF8BUFFSZ - n] = cast_char((~mfb << 1) | x); - } - return n; -} - - - -#define MAXNUMBER2STR 44 - - - -static int tostringbuff (TValue *obj, char *buff) { - int len; - lua_assert(ttisnumber(obj)); - if (ttisinteger(obj)) - len = lua_integer2str(buff, MAXNUMBER2STR, ivalue(obj)); - else { - len = lua_number2str(buff, MAXNUMBER2STR, fltvalue(obj)); - if (buff[strspn(buff, "-0123456789")] == '\0') { - buff[len++] = lua_getlocaledecpoint(); - buff[len++] = '0'; - } - } - return len; -} - - - -void luaO_tostring (lua_State *L, TValue *obj) { - char buff[MAXNUMBER2STR]; - int len = tostringbuff(obj, buff); - setsvalue(L, obj, luaS_newlstr(L, buff, len)); -} - - - - - - - -#define BUFVFS (LUA_IDSIZE + MAXNUMBER2STR + 95) - - -typedef struct BuffFS { - lua_State *L; - int pushed; - int blen; - char space[BUFVFS]; -} BuffFS; - - - -static void pushstr (BuffFS *buff, const char *str, size_t lstr) { - lua_State *L = buff->L; - setsvalue2s(L, L->top.p, luaS_newlstr(L, str, lstr)); - L->top.p++; - if (!buff->pushed) - buff->pushed = 1; - else - luaV_concat(L, 2); -} - - - -static void clearbuff (BuffFS *buff) { - pushstr(buff, buff->space, buff->blen); - buff->blen = 0; -} - - - -static char *getbuff (BuffFS *buff, int sz) { - lua_assert(buff->blen <= BUFVFS); lua_assert(sz <= BUFVFS); - if (sz > BUFVFS - buff->blen) - clearbuff(buff); - return buff->space + buff->blen; -} - - -#define addsize(b,sz) ((b)->blen += (sz)) - - - -static void addstr2buff (BuffFS *buff, const char *str, size_t slen) { - if (slen <= BUFVFS) { - char *bf = getbuff(buff, cast_int(slen)); - memcpy(bf, str, slen); - addsize(buff, cast_int(slen)); - } - else { - clearbuff(buff); - pushstr(buff, str, slen); - } -} - - - -static void addnum2buff (BuffFS *buff, TValue *num) { - char *numbuff = getbuff(buff, MAXNUMBER2STR); - int len = tostringbuff(num, numbuff); - addsize(buff, len); -} - - - -const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) { - BuffFS buff; - const char *e; - buff.pushed = buff.blen = 0; - buff.L = L; - while ((e = strchr(fmt, '%')) != NULL) { - addstr2buff(&buff, fmt, e - fmt); - switch (*(e + 1)) { - case 's': { - const char *s = va_arg(argp, char *); - if (s == NULL) s = "(null)"; - addstr2buff(&buff, s, strlen(s)); - break; - } - case 'c': { - char c = cast_uchar(va_arg(argp, int)); - addstr2buff(&buff, &c, sizeof(char)); - break; - } - case 'd': { - TValue num; - setivalue(&num, va_arg(argp, int)); - addnum2buff(&buff, &num); - break; - } - case 'I': { - TValue num; - setivalue(&num, cast(lua_Integer, va_arg(argp, l_uacInt))); - addnum2buff(&buff, &num); - break; - } - case 'f': { - TValue num; - setfltvalue(&num, cast_num(va_arg(argp, l_uacNumber))); - addnum2buff(&buff, &num); - break; - } - case 'p': { - const int sz = 3 * sizeof(void*) + 8; - char *bf = getbuff(&buff, sz); - void *p = va_arg(argp, void *); - int len = lua_pointer2str(bf, sz, p); - addsize(&buff, len); - break; - } - case 'U': { - char bf[UTF8BUFFSZ]; - int len = luaO_utf8esc(bf, va_arg(argp, long)); - addstr2buff(&buff, bf + UTF8BUFFSZ - len, len); - break; - } - case '%': { - addstr2buff(&buff, "%", 1); - break; - } - default: { - luaG_runerror(L, "invalid option '%%%c' to 'lua_pushfstring'", - *(e + 1)); - } - } - fmt = e + 2; - } - addstr2buff(&buff, fmt, strlen(fmt)); - clearbuff(&buff); - lua_assert(buff.pushed == 1); - return getstr(tsvalue(s2v(L->top.p - 1))); -} - - -const char *luaO_pushfstring (lua_State *L, const char *fmt, ...) { - const char *msg; - va_list argp; - va_start(argp, fmt); - msg = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - return msg; -} - - - - -#define RETS "..." -#define PRE "[string \"" -#define POS "\"]" - -#define addstr(a,b,l) ( memcpy(a,b,(l) * sizeof(char)), a += (l) ) - -void luaO_chunkid (char *out, const char *source, size_t srclen) { - size_t bufflen = LUA_IDSIZE; - if (*source == '=') { - if (srclen <= bufflen) - memcpy(out, source + 1, srclen * sizeof(char)); - else { - addstr(out, source + 1, bufflen - 1); - *out = '\0'; - } - } - else if (*source == '@') { - if (srclen <= bufflen) - memcpy(out, source + 1, srclen * sizeof(char)); - else { - addstr(out, RETS, LL(RETS)); - bufflen -= LL(RETS); - memcpy(out, source + 1 + srclen - bufflen, bufflen * sizeof(char)); - } - } - else { - const char *nl = strchr(source, '\n'); - addstr(out, PRE, LL(PRE)); - bufflen -= LL(PRE RETS POS) + 1; - if (srclen < bufflen && nl == NULL) { - addstr(out, source, srclen); - } - else { - if (nl != NULL) srclen = nl - source; - if (srclen > bufflen) srclen = bufflen; - addstr(out, source, srclen); - addstr(out, RETS, LL(RETS)); - } - memcpy(out, POS, (LL(POS) + 1) * sizeof(char)); - } -} - - - -//path: src/imports/../dependencies/lua/ltm.c - - -#define ltm_c -#define LUA_CORE - - - - - -#include - - - - - - - - - - - - - - - - - - - - - - - - -static const char udatatypename[] = "userdata"; - -LUAI_DDEF const char *const luaT_typenames_[LUA_TOTALTYPES] = { - "no value", - "nil", "boolean", udatatypename, "number", - "string", "table", "function", udatatypename, "thread", - "upvalue", "proto" -}; - - -void luaT_init (lua_State *L) { - static const char *const luaT_eventname[] = { - "__index", "__newindex", - "__gc", "__mode", "__len", "__eq", - "__add", "__sub", "__mul", "__mod", "__pow", - "__div", "__idiv", - "__band", "__bor", "__bxor", "__shl", "__shr", - "__unm", "__bnot", "__lt", "__le", - "__concat", "__call", "__close" - }; - int i; - for (i=0; itmname[i] = luaS_new(L, luaT_eventname[i]); - luaC_fix(L, obj2gco(G(L)->tmname[i])); - } -} - - - -const TValue *luaT_gettm (Table *events, TMS event, TString *ename) { - const TValue *tm = luaH_Hgetshortstr(events, ename); - lua_assert(event <= TM_EQ); - if (notm(tm)) { - events->flags |= cast_byte(1u<metatable; - break; - case LUA_TUSERDATA: - mt = uvalue(o)->metatable; - break; - default: - mt = G(L)->mt[ttype(o)]; - } - return (mt ? luaH_Hgetshortstr(mt, G(L)->tmname[event]) : &G(L)->nilvalue); -} - - - -const char *luaT_objtypename (lua_State *L, const TValue *o) { - Table *mt; - if ((ttistable(o) && (mt = hvalue(o)->metatable) != NULL) || - (ttisfulluserdata(o) && (mt = uvalue(o)->metatable) != NULL)) { - const TValue *name = luaH_Hgetshortstr(mt, luaS_new(L, "__name")); - if (ttisstring(name)) - return getstr(tsvalue(name)); - } - return ttypename(ttype(o)); -} - - -void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, const TValue *p3) { - StkId func = L->top.p; - setobj2s(L, func, f); - setobj2s(L, func + 1, p1); - setobj2s(L, func + 2, p2); - setobj2s(L, func + 3, p3); - L->top.p = func + 4; - - if (isLuacode(L->ci)) - luaD_call(L, func, 0); - else - luaD_callnoyield(L, func, 0); -} - - -int luaT_callTMres (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, StkId res) { - ptrdiff_t result = savestack(L, res); - StkId func = L->top.p; - setobj2s(L, func, f); - setobj2s(L, func + 1, p1); - setobj2s(L, func + 2, p2); - L->top.p += 3; - - if (isLuacode(L->ci)) - luaD_call(L, func, 1); - else - luaD_callnoyield(L, func, 1); - res = restorestack(L, result); - setobjs2s(L, res, --L->top.p); - return ttypetag(s2v(res)); -} - - -static int callbinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event) { - const TValue *tm = luaT_gettmbyobj(L, p1, event); - if (notm(tm)) - tm = luaT_gettmbyobj(L, p2, event); - if (notm(tm)) - return -1; - else - return luaT_callTMres(L, tm, p1, p2, res); -} - - -void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event) { - if (l_unlikely(callbinTM(L, p1, p2, res, event) < 0)) { - switch (event) { - case TM_BAND: case TM_BOR: case TM_BXOR: - case TM_SHL: case TM_SHR: case TM_BNOT: { - if (ttisnumber(p1) && ttisnumber(p2)) - luaG_tointerror(L, p1, p2); - else - luaG_opinterror(L, p1, p2, "perform bitwise operation on"); - } - /* FALLTHROUGH */ - default: - luaG_opinterror(L, p1, p2, "perform arithmetic on"); - } - } -} - - - -void luaT_tryconcatTM (lua_State *L) { - StkId p1 = L->top.p - 2; - if (l_unlikely(callbinTM(L, s2v(p1), s2v(p1 + 1), p1, TM_CONCAT) < 0)) - luaG_concaterror(L, s2v(p1), s2v(p1 + 1)); -} - - -void luaT_trybinassocTM (lua_State *L, const TValue *p1, const TValue *p2, - int flip, StkId res, TMS event) { - if (flip) - luaT_trybinTM(L, p2, p1, res, event); - else - luaT_trybinTM(L, p1, p2, res, event); -} - - -void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, - int flip, StkId res, TMS event) { - TValue aux; - setivalue(&aux, i2); - luaT_trybinassocTM(L, p1, &aux, flip, res, event); -} - - - -int luaT_callorderTM (lua_State *L, const TValue *p1, const TValue *p2, - TMS event) { - int tag = callbinTM(L, p1, p2, L->top.p, event); - if (tag >= 0) - return !tagisfalse(tag); -#if defined(LUA_COMPAT_LT_LE) - else if (event == TM_LE) { - - L->ci->callstatus |= CIST_LEQ; - tag = callbinTM(L, p2, p1, L->top.p, TM_LT); - L->ci->callstatus ^= CIST_LEQ; - if (tag >= 0) - return tagisfalse(tag); - } -#endif - luaG_ordererror(L, p1, p2); - return 0; -} - - -int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, - int flip, int isfloat, TMS event) { - TValue aux; const TValue *p2; - if (isfloat) { - setfltvalue(&aux, cast_num(v2)); - } - else - setivalue(&aux, v2); - if (flip) { - p2 = p1; p1 = &aux; - } - else - p2 = &aux; - return luaT_callorderTM(L, p1, p2, event); -} - - -void luaT_adjustvarargs (lua_State *L, int nfixparams, CallInfo *ci, - const Proto *p) { - int i; - int actual = cast_int(L->top.p - ci->func.p) - 1; - int nextra = actual - nfixparams; - ci->u.l.nextraargs = nextra; - luaD_checkstack(L, p->maxstacksize + 1); - - setobjs2s(L, L->top.p++, ci->func.p); - - for (i = 1; i <= nfixparams; i++) { - setobjs2s(L, L->top.p++, ci->func.p + i); - setnilvalue(s2v(ci->func.p + i)); - } - ci->func.p += actual + 1; - ci->top.p += actual + 1; - lua_assert(L->top.p <= ci->top.p && ci->top.p <= L->stack_last.p); -} - - -void luaT_getvarargs (lua_State *L, CallInfo *ci, StkId where, int wanted) { - int i; - int nextra = ci->u.l.nextraargs; - if (wanted < 0) { - wanted = nextra; - checkstackp(L, nextra, where); - L->top.p = where + nextra; - } - for (i = 0; i < wanted && i < nextra; i++) - setobjs2s(L, where + i, ci->func.p - nextra + i); - for (; i < wanted; i++) - setnilvalue(s2v(where + i)); -} - - - -//path: src/imports/../dependencies/lua/lstring.c - - -#define lstring_c -#define LUA_CORE - - - - - -#include - - - - - - - - - - - - - - - - - - - -#define MAXSTRTB cast_int(luaM_limitN(MAX_INT, TString*)) - - - -int luaS_eqlngstr (TString *a, TString *b) { - size_t len = a->u.lnglen; - lua_assert(a->tt == LUA_VLNGSTR && b->tt == LUA_VLNGSTR); - return (a == b) || - ((len == b->u.lnglen) && - (memcmp(getlngstr(a), getlngstr(b), len) == 0)); -} - - -unsigned luaS_hash (const char *str, size_t l, unsigned seed) { - unsigned int h = seed ^ cast_uint(l); - for (; l > 0; l--) - h ^= ((h<<5) + (h>>2) + cast_byte(str[l - 1])); - return h; -} - - -unsigned luaS_hashlongstr (TString *ts) { - lua_assert(ts->tt == LUA_VLNGSTR); - if (ts->extra == 0) { - size_t len = ts->u.lnglen; - ts->hash = luaS_hash(getlngstr(ts), len, ts->hash); - ts->extra = 1; - } - return ts->hash; -} - - -static void tablerehash (TString **vect, int osize, int nsize) { - int i; - for (i = osize; i < nsize; i++) - vect[i] = NULL; - for (i = 0; i < osize; i++) { - TString *p = vect[i]; - vect[i] = NULL; - while (p) { - TString *hnext = p->u.hnext; - unsigned int h = lmod(p->hash, nsize); - p->u.hnext = vect[h]; - vect[h] = p; - p = hnext; - } - } -} - - - -void luaS_resize (lua_State *L, int nsize) { - stringtable *tb = &G(L)->strt; - int osize = tb->size; - TString **newvect; - if (nsize < osize) - tablerehash(tb->hash, osize, nsize); - newvect = luaM_reallocvector(L, tb->hash, osize, nsize, TString*); - if (l_unlikely(newvect == NULL)) { - if (nsize < osize) - tablerehash(tb->hash, nsize, osize); - - } - else { - tb->hash = newvect; - tb->size = nsize; - if (nsize > osize) - tablerehash(newvect, osize, nsize); - } -} - - - -void luaS_clearcache (global_State *g) { - int i, j; - for (i = 0; i < STRCACHE_N; i++) - for (j = 0; j < STRCACHE_M; j++) { - if (iswhite(g->strcache[i][j])) - g->strcache[i][j] = g->memerrmsg; - } -} - - - -void luaS_init (lua_State *L) { - global_State *g = G(L); - int i, j; - stringtable *tb = &G(L)->strt; - tb->hash = luaM_newvector(L, MINSTRTABSIZE, TString*); - tablerehash(tb->hash, 0, MINSTRTABSIZE); - tb->size = MINSTRTABSIZE; - - g->memerrmsg = luaS_newliteral(L, MEMERRMSG); - luaC_fix(L, obj2gco(g->memerrmsg)); - for (i = 0; i < STRCACHE_N; i++) - for (j = 0; j < STRCACHE_M; j++) - g->strcache[i][j] = g->memerrmsg; -} - - -size_t luaS_sizelngstr (size_t len, int kind) { - switch (kind) { - case LSTRREG: - - return offsetof(TString, falloc) + (len + 1) * sizeof(char); - case LSTRFIX: - - return offsetof(TString, falloc); - default: - lua_assert(kind == LSTRMEM); - return sizeof(TString); - } -} - - - -static TString *createstrobj (lua_State *L, size_t totalsize, int tag, - unsigned h) { - TString *ts; - GCObject *o; - o = luaC_newobj(L, tag, totalsize); - ts = gco2ts(o); - ts->hash = h; - ts->extra = 0; - return ts; -} - - -TString *luaS_createlngstrobj (lua_State *L, size_t l) { - size_t totalsize = luaS_sizelngstr(l, LSTRREG); - TString *ts = createstrobj(L, totalsize, LUA_VLNGSTR, G(L)->seed); - ts->u.lnglen = l; - ts->shrlen = LSTRREG; - ts->contents = cast_charp(ts) + offsetof(TString, falloc); - ts->contents[l] = '\0'; - return ts; -} - - -void luaS_remove (lua_State *L, TString *ts) { - stringtable *tb = &G(L)->strt; - TString **p = &tb->hash[lmod(ts->hash, tb->size)]; - while (*p != ts) - p = &(*p)->u.hnext; - *p = (*p)->u.hnext; - tb->nuse--; -} - - -static void growstrtab (lua_State *L, stringtable *tb) { - if (l_unlikely(tb->nuse == MAX_INT)) { - luaC_fullgc(L, 1); - if (tb->nuse == MAX_INT) - luaM_error(L); - } - if (tb->size <= MAXSTRTB / 2) - luaS_resize(L, tb->size * 2); -} - - - -static TString *internshrstr (lua_State *L, const char *str, size_t l) { - TString *ts; - global_State *g = G(L); - stringtable *tb = &g->strt; - unsigned int h = luaS_hash(str, l, g->seed); - TString **list = &tb->hash[lmod(h, tb->size)]; - lua_assert(str != NULL); - for (ts = *list; ts != NULL; ts = ts->u.hnext) { - if (l == cast_uint(ts->shrlen) && - (memcmp(str, getshrstr(ts), l * sizeof(char)) == 0)) { - - if (isdead(g, ts)) - changewhite(ts); - return ts; - } - } - - if (tb->nuse >= tb->size) { - growstrtab(L, tb); - list = &tb->hash[lmod(h, tb->size)]; - } - ts = createstrobj(L, sizestrshr(l), LUA_VSHRSTR, h); - ts->shrlen = cast_byte(l); - getshrstr(ts)[l] = '\0'; - memcpy(getshrstr(ts), str, l * sizeof(char)); - ts->u.hnext = *list; - *list = ts; - tb->nuse++; - return ts; -} - - - -TString *luaS_newlstr (lua_State *L, const char *str, size_t l) { - if (l <= LUAI_MAXSHORTLEN) - return internshrstr(L, str, l); - else { - TString *ts; - if (l_unlikely(l * sizeof(char) >= (MAX_SIZE - sizeof(TString)))) - luaM_toobig(L); - ts = luaS_createlngstrobj(L, l); - memcpy(getlngstr(ts), str, l * sizeof(char)); - return ts; - } -} - - - -TString *luaS_new (lua_State *L, const char *str) { - unsigned int i = point2uint(str) % STRCACHE_N; - int j; - TString **p = G(L)->strcache[i]; - for (j = 0; j < STRCACHE_M; j++) { - if (strcmp(str, getstr(p[j])) == 0) - return p[j]; - } - - for (j = STRCACHE_M - 1; j > 0; j--) - p[j] = p[j - 1]; - - p[0] = luaS_newlstr(L, str, strlen(str)); - return p[0]; -} - - -Udata *luaS_newudata (lua_State *L, size_t s, int nuvalue) { - Udata *u; - int i; - GCObject *o; - if (l_unlikely(s > MAX_SIZE - udatamemoffset(nuvalue))) - luaM_toobig(L); - o = luaC_newobj(L, LUA_VUSERDATA, sizeudata(nuvalue, s)); - u = gco2u(o); - u->len = s; - u->nuvalue = nuvalue; - u->metatable = NULL; - for (i = 0; i < nuvalue; i++) - setnilvalue(&u->uv[i].uv); - return u; -} - - -struct NewExt { - int kind; - const char *s; - size_t len; - TString *ts; -}; - - -static void f_newext (lua_State *L, void *ud) { - struct NewExt *ne = cast(struct NewExt *, ud); - size_t size = luaS_sizelngstr(0, ne->kind); - ne->ts = createstrobj(L, size, LUA_VLNGSTR, G(L)->seed); -} - - -static void f_pintern (lua_State *L, void *ud) { - struct NewExt *ne = cast(struct NewExt *, ud); - ne->ts = internshrstr(L, ne->s, ne->len); -} - - -TString *luaS_newextlstr (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud) { - struct NewExt ne; - if (len <= LUAI_MAXSHORTLEN) { - ne.s = s; ne.len = len; - if (!falloc) - f_pintern(L, &ne); - else { - int status = luaD_rawrunprotected(L, f_pintern, &ne); - (*falloc)(ud, cast_voidp(s), len + 1, 0); - if (status != LUA_OK) - luaM_error(L); - } - return ne.ts; - } - - if (!falloc) { - ne.kind = LSTRFIX; - f_newext(L, &ne); - } - else { - ne.kind = LSTRMEM; - if (luaD_rawrunprotected(L, f_newext, &ne) != LUA_OK) { - (*falloc)(ud, cast_voidp(s), len + 1, 0); - luaM_error(L); - } - ne.ts->falloc = falloc; - ne.ts->ud = ud; - } - ne.ts->shrlen = ne.kind; - ne.ts->u.lnglen = len; - ne.ts->contents = cast_charp(s); - return ne.ts; -} - - - - -//path: src/imports/../dependencies/lua/ltable.c - - -#define ltable_c -#define LUA_CORE - - - - - - - -#include - - - - - - - - - - - - - - - - - - - - - - - - - -#define LIMFORLAST 2 - - -typedef struct { Node *dummy; Node follows_pNode; } Limbox_aux; - -typedef union { - Node *lastfree; - char padding[offsetof(Limbox_aux, follows_pNode)]; -} Limbox; - -#define haslastfree(t) ((t)->lsizenode > LIMFORLAST) -#define getlastfree(t) ((cast(Limbox *, (t)->node) - 1)->lastfree) - - - -#define MAXABITS cast_int(sizeof(int) * CHAR_BIT - 1) - - - -#define MAXASIZEB ((MAX_SIZET/sizeof(ArrayCell)) * NM) - - - -#define MAXASIZE \ - (((1u << MAXABITS) < MAXASIZEB) ? (1u << MAXABITS) : cast_uint(MAXASIZEB)) - - -#define MAXHBITS (MAXABITS - 1) - - - -#define MAXHSIZE luaM_limitN(1u << MAXHBITS, Node) - - - -#define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t)))) - - -#define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1)))) - - -#define hashstr(t,str) hashpow2(t, (str)->hash) -#define hashboolean(t,p) hashpow2(t, p) - - -#define hashpointer(t,p) hashmod(t, point2uint(p)) - - -#define dummynode (&dummynode_) - -static const Node dummynode_ = { - {{NULL}, LUA_VEMPTY, - LUA_VNIL, 0, {NULL}} -}; - - -static const TValue absentkey = {ABSTKEYCONSTANT}; - - - -static Node *hashint (const Table *t, lua_Integer i) { - lua_Unsigned ui = l_castS2U(i); - if (ui <= cast_uint(INT_MAX)) - return hashmod(t, cast_int(ui)); - else - return hashmod(t, ui); -} - - - -#if !defined(l_hashfloat) -static int l_hashfloat (lua_Number n) { - int i; - lua_Integer ni; - n = l_mathop(private_lua_cembed_frexp)(n, &i) * -cast_num(INT_MIN); - if (!lua_numbertointeger(n, &ni)) { - lua_assert(luai_numisnan(n) || l_mathop(fabs)(n) == cast_num(HUGE_VAL)); - return 0; - } - else { - unsigned int u = cast_uint(i) + cast_uint(ni); - return cast_int(u <= cast_uint(INT_MAX) ? u : ~u); - } -} -#endif - - - -static Node *mainpositionTV (const Table *t, const TValue *key) { - switch (ttypetag(key)) { - case LUA_VNUMINT: { - lua_Integer i = ivalue(key); - return hashint(t, i); - } - case LUA_VNUMFLT: { - lua_Number n = fltvalue(key); - return hashmod(t, l_hashfloat(n)); - } - case LUA_VSHRSTR: { - TString *ts = tsvalue(key); - return hashstr(t, ts); - } - case LUA_VLNGSTR: { - TString *ts = tsvalue(key); - return hashpow2(t, luaS_hashlongstr(ts)); - } - case LUA_VFALSE: - return hashboolean(t, 0); - case LUA_VTRUE: - return hashboolean(t, 1); - case LUA_VLIGHTUSERDATA: { - void *p = pvalue(key); - return hashpointer(t, p); - } - case LUA_VLCF: { - lua_CFunction f = fvalue(key); - return hashpointer(t, f); - } - default: { - GCObject *o = gcvalue(key); - return hashpointer(t, o); - } - } -} - - -l_sinline Node *mainpositionfromnode (const Table *t, Node *nd) { - TValue key; - getnodekey(cast(lua_State *, NULL), &key, nd); - return mainpositionTV(t, &key); -} - - - -static int equalkey (const TValue *k1, const Node *n2, int deadok) { - if ((rawtt(k1) != keytt(n2)) && - !(deadok && keyisdead(n2) && iscollectable(k1))) - return 0; - switch (keytt(n2)) { - case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: - return 1; - case LUA_VNUMINT: - return (ivalue(k1) == keyival(n2)); - case LUA_VNUMFLT: - return luai_numeq(fltvalue(k1), fltvalueraw(keyval(n2))); - case LUA_VLIGHTUSERDATA: - return pvalue(k1) == pvalueraw(keyval(n2)); - case LUA_VLCF: - return fvalue(k1) == fvalueraw(keyval(n2)); - case ctb(LUA_VLNGSTR): - return luaS_eqlngstr(tsvalue(k1), keystrval(n2)); - default: - return gcvalue(k1) == gcvalueraw(keyval(n2)); - } -} - - - -#define limitequalsasize(t) (isrealasize(t) || ispow2((t)->alimit)) - - - -LUAI_FUNC unsigned int luaH_realasize (const Table *t) { - if (limitequalsasize(t)) - return t->alimit; - else { - unsigned int size = t->alimit; - - size |= (size >> 1); - size |= (size >> 2); - size |= (size >> 4); - size |= (size >> 8); -#if (UINT_MAX >> 14) > 3 - size |= (size >> 16); -#if (UINT_MAX >> 30) > 3 - size |= (size >> 32); -#endif -#endif - size++; - lua_assert(ispow2(size) && size/2 < t->alimit && t->alimit < size); - return size; - } -} - - - -static int ispow2realasize (const Table *t) { - return (!isrealasize(t) || ispow2(t->alimit)); -} - - -static unsigned int setlimittosize (Table *t) { - t->alimit = luaH_realasize(t); - setrealasize(t); - return t->alimit; -} - - -#define limitasasize(t) check_exp(isrealasize(t), t->alimit) - - - - -static const TValue *getgeneric (Table *t, const TValue *key, int deadok) { - Node *n = mainpositionTV(t, key); - for (;;) { - if (equalkey(key, n, deadok)) - return gval(n); - else { - int nx = gnext(n); - if (nx == 0) - return &absentkey; - n += nx; - } - } -} - - - -static unsigned int arrayindex (lua_Integer k) { - if (l_castS2U(k) - 1u < MAXASIZE) - return cast_uint(k); - else - return 0; -} - - - -static unsigned findindex (lua_State *L, Table *t, TValue *key, - unsigned asize) { - unsigned int i; - if (ttisnil(key)) return 0; - i = ttisinteger(key) ? arrayindex(ivalue(key)) : 0; - if (i - 1u < asize) - return i; - else { - const TValue *n = getgeneric(t, key, 1); - if (l_unlikely(isabstkey(n))) - luaG_runerror(L, "invalid key to 'next'"); - i = cast_int(nodefromval(n) - gnode(t, 0)); - - return (i + 1) + asize; - } -} - - -int luaH_next (lua_State *L, Table *t, StkId key) { - unsigned int asize = luaH_realasize(t); - unsigned int i = findindex(L, t, s2v(key), asize); - for (; i < asize; i++) { - int tag = *getArrTag(t, i); - if (!tagisempty(tag)) { - setivalue(s2v(key), i + 1); - farr2val(t, i + 1, tag, s2v(key + 1)); - return 1; - } - } - for (i -= asize; cast_int(i) < sizenode(t); i++) { - if (!isempty(gval(gnode(t, i)))) { - Node *n = gnode(t, i); - getnodekey(L, s2v(key), n); - setobj2s(L, key + 1, gval(n)); - return 1; - } - } - return 0; -} - - -static void freehash (lua_State *L, Table *t) { - if (!isdummy(t)) { - size_t bsize = sizenode(t) * sizeof(Node); - char *arr = cast_charp(t->node); - if (haslastfree(t)) { - bsize += sizeof(Limbox); - arr -= sizeof(Limbox); - } - luaM_freearray(L, arr, bsize); - } -} - - - -static int keyinarray (Table *t, lua_Integer key) { - lua_Unsigned alimit = t->alimit; - if (l_castS2U(key) - 1u < alimit) - return 1; - else if (!isrealasize(t) && - (((l_castS2U(key) - 1u) & ~(alimit - 1u)) < alimit)) { - t->alimit = cast_uint(key); - return 1; - } - else - return 0; -} - - - - - -static unsigned computesizes (unsigned nums[], unsigned *pna) { - int i; - unsigned int twotoi; - unsigned int a = 0; - unsigned int na = 0; - unsigned int optimal = 0; - - for (i = 0, twotoi = 1; - twotoi > 0 && *pna > twotoi / 2; - i++, twotoi *= 2) { - a += nums[i]; - if (a > twotoi/2) { - optimal = twotoi; - na = a; - } - } - lua_assert((optimal == 0 || optimal / 2 < na) && na <= optimal); - *pna = na; - return optimal; -} - - -static int countint (lua_Integer key, unsigned int *nums) { - unsigned int k = arrayindex(key); - if (k != 0) { - nums[luaO_ceillog2(k)]++; - return 1; - } - else - return 0; -} - - -l_sinline int arraykeyisempty (const Table *t, lua_Integer key) { - int tag = *getArrTag(t, key - 1); - return tagisempty(tag); -} - - - -static unsigned numusearray (const Table *t, unsigned *nums) { - int lg; - unsigned int ttlg; - unsigned int ause = 0; - unsigned int i = 1; - unsigned int asize = limitasasize(t); - - for (lg = 0, ttlg = 1; lg <= MAXABITS; lg++, ttlg *= 2) { - unsigned int lc = 0; - unsigned int lim = ttlg; - if (lim > asize) { - lim = asize; - if (i > lim) - break; - } - - for (; i <= lim; i++) { - if (!arraykeyisempty(t, i)) - lc++; - } - nums[lg] += lc; - ause += lc; - } - return ause; -} - - -static int numusehash (const Table *t, unsigned *nums, unsigned *pna) { - int totaluse = 0; - int ause = 0; - int i = sizenode(t); - while (i--) { - Node *n = &t->node[i]; - if (!isempty(gval(n))) { - if (keyisinteger(n)) - ause += countint(keyival(n), nums); - totaluse++; - } - } - *pna += ause; - return totaluse; -} - - - -static size_t concretesize (unsigned int size) { - unsigned int numcells = (size + NM - 1) / NM; - unsigned int extra = NM - 1 - ((size + NM - 1) % NM); - return numcells * sizeof(ArrayCell) - extra * sizeof(Value); -} - - -static ArrayCell *resizearray (lua_State *L , Table *t, - unsigned oldasize, - unsigned newasize) { - size_t oldasizeb = concretesize(oldasize); - size_t newasizeb = concretesize(newasize); - void *a = luaM_reallocvector(L, t->array, oldasizeb, newasizeb, lu_byte); - return cast(ArrayCell*, a); -} - - - -static void setnodevector (lua_State *L, Table *t, unsigned size) { - if (size == 0) { - t->node = cast(Node *, dummynode); - t->lsizenode = 0; - setdummy(t); - } - else { - int i; - int lsize = luaO_ceillog2(size); - if (lsize > MAXHBITS || (1u << lsize) > MAXHSIZE) - luaG_runerror(L, "table overflow"); - size = twoto(lsize); - if (lsize <= LIMFORLAST) - t->node = luaM_newvector(L, size, Node); - else { - size_t bsize = size * sizeof(Node) + sizeof(Limbox); - char *node = luaM_newblock(L, bsize); - t->node = cast(Node *, node + sizeof(Limbox)); - getlastfree(t) = gnode(t, size); - } - t->lsizenode = cast_byte(lsize); - setnodummy(t); - for (i = 0; i < cast_int(size); i++) { - Node *n = gnode(t, i); - gnext(n) = 0; - setnilkey(n); - setempty(gval(n)); - } - } -} - - - -static void reinsert (lua_State *L, Table *ot, Table *t) { - int j; - int size = sizenode(ot); - for (j = 0; j < size; j++) { - Node *old = gnode(ot, j); - if (!isempty(gval(old))) { - - TValue k; - getnodekey(L, &k, old); - luaH_set(L, t, &k, gval(old)); - } - } -} - - - -static void exchangehashpart (Table *t1, Table *t2) { - lu_byte lsizenode = t1->lsizenode; - Node *node = t1->node; - int bitdummy1 = t1->flags & BITDUMMY; - t1->lsizenode = t2->lsizenode; - t1->node = t2->node; - t1->flags = (t1->flags & NOTBITDUMMY) | (t2->flags & BITDUMMY); - t2->lsizenode = lsizenode; - t2->node = node; - t2->flags = (t2->flags & NOTBITDUMMY) | bitdummy1; -} - - - -static void reinsertOldSlice (lua_State *L, Table *t, unsigned oldasize, - unsigned newasize) { - unsigned i; - t->alimit = newasize; - for (i = newasize; i < oldasize; i++) { - int tag = *getArrTag(t, i); - if (!tagisempty(tag)) { - TValue aux; - farr2val(t, i + 1, tag, &aux); - luaH_setint(L, t, i + 1, &aux); - } - } - t->alimit = oldasize; -} - - - -static void clearNewSlice (Table *t, unsigned oldasize, unsigned newasize) { - for (; oldasize < newasize; oldasize++) - *getArrTag(t, oldasize) = LUA_VEMPTY; -} - - - -void luaH_resize (lua_State *L, Table *t, unsigned newasize, - unsigned nhsize) { - Table newt; - unsigned int oldasize = setlimittosize(t); - ArrayCell *newarray; - if (newasize > MAXASIZE) - luaG_runerror(L, "table overflow"); - - newt.flags = 0; - setnodevector(L, &newt, nhsize); - if (newasize < oldasize) { - - exchangehashpart(t, &newt); - reinsertOldSlice(L, t, oldasize, newasize); - exchangehashpart(t, &newt); - } - - newarray = resizearray(L, t, oldasize, newasize); - if (l_unlikely(newarray == NULL && newasize > 0)) { - freehash(L, &newt); - luaM_error(L); - } - - exchangehashpart(t, &newt); - t->array = newarray; - t->alimit = newasize; - clearNewSlice(t, oldasize, newasize); - - reinsert(L, &newt, t); - freehash(L, &newt); -} - - -void luaH_resizearray (lua_State *L, Table *t, unsigned int nasize) { - int nsize = allocsizenode(t); - luaH_resize(L, t, nasize, nsize); -} - - -static void rehash (lua_State *L, Table *t, const TValue *ek) { - unsigned int asize; - unsigned int na; - unsigned int nums[MAXABITS + 1]; - int i; - int totaluse; - for (i = 0; i <= MAXABITS; i++) nums[i] = 0; - setlimittosize(t); - na = numusearray(t, nums); - totaluse = na; - totaluse += numusehash(t, nums, &na); - - if (ttisinteger(ek)) - na += countint(ivalue(ek), nums); - totaluse++; - - asize = computesizes(nums, &na); - - luaH_resize(L, t, asize, totaluse - na); -} - - - - - - -Table *luaH_new (lua_State *L) { - GCObject *o = luaC_newobj(L, LUA_VTABLE, sizeof(Table)); - Table *t = gco2t(o); - t->metatable = NULL; - t->flags = cast_byte(maskflags); - t->array = NULL; - t->alimit = 0; - setnodevector(L, t, 0); - return t; -} - - - -void luaH_free (lua_State *L, Table *t) { - unsigned int realsize = luaH_realasize(t); - size_t sizeb = concretesize(realsize); - lua_assert((sizeb == 0 && realsize == 0) || - cast_charp(t->array) + sizeb - sizeof(Value) == - cast_charp(getArrVal(t, realsize - 1))); - freehash(L, t); - luaM_freemem(L, t->array, sizeb); - luaM_free(L, t); -} - - -static Node *getfreepos (Table *t) { - if (haslastfree(t)) { - - while (getlastfree(t) > t->node) { - Node *free = --getlastfree(t); - if (keyisnil(free)) - return free; - } - } - else { - if (!isdummy(t)) { - int i = sizenode(t); - while (i--) { - Node *free = gnode(t, i); - if (keyisnil(free)) - return free; - } - } - } - return NULL; -} - - - - -static void luaH_newkey (lua_State *L, Table *t, const TValue *key, - TValue *value) { - Node *mp; - TValue aux; - if (l_unlikely(ttisnil(key))) - luaG_runerror(L, "table index is nil"); - else if (ttisfloat(key)) { - lua_Number f = fltvalue(key); - lua_Integer k; - if (luaV_flttointeger(f, &k, F2Ieq)) { - setivalue(&aux, k); - key = &aux; - } - else if (l_unlikely(luai_numisnan(f))) - luaG_runerror(L, "table index is NaN"); - } - if (ttisnil(value)) - return; - mp = mainpositionTV(t, key); - if (!isempty(gval(mp)) || isdummy(t)) { - Node *othern; - Node *f = getfreepos(t); - if (f == NULL) { - rehash(L, t, key); - - luaH_set(L, t, key, value); - return; - } - lua_assert(!isdummy(t)); - othern = mainpositionfromnode(t, mp); - if (othern != mp) { - - while (othern + gnext(othern) != mp) - othern += gnext(othern); - gnext(othern) = cast_int(f - othern); - *f = *mp; - if (gnext(mp) != 0) { - gnext(f) += cast_int(mp - f); - gnext(mp) = 0; - } - setempty(gval(mp)); - } - else { - - if (gnext(mp) != 0) - gnext(f) = cast_int((mp + gnext(mp)) - f); - else lua_assert(gnext(f) == 0); - gnext(mp) = cast_int(f - mp); - mp = f; - } - } - setnodekey(L, mp, key); - luaC_barrierback(L, obj2gco(t), key); - lua_assert(isempty(gval(mp))); - setobj2t(L, gval(mp), value); -} - - -static const TValue *getintfromhash (Table *t, lua_Integer key) { - Node *n = hashint(t, key); - lua_assert(l_castS2U(key) - 1u >= luaH_realasize(t)); - for (;;) { - if (keyisinteger(n) && keyival(n) == key) - return gval(n); - else { - int nx = gnext(n); - if (nx == 0) break; - n += nx; - } - } - return &absentkey; -} - - -static int hashkeyisempty (Table *t, lua_Integer key) { - const TValue *val = getintfromhash(t, key); - return isempty(val); -} - - -static int finishnodeget (const TValue *val, TValue *res) { - if (!ttisnil(val)) { - setobj(((lua_State*)NULL), res, val); - } - return ttypetag(val); -} - - -int luaH_getint (Table *t, lua_Integer key, TValue *res) { - if (keyinarray(t, key)) { - int tag = *getArrTag(t, key - 1); - if (!tagisempty(tag)) - farr2val(t, key, tag, res); - return tag; - } - else - return finishnodeget(getintfromhash(t, key), res); -} - - - -const TValue *luaH_Hgetshortstr (Table *t, TString *key) { - Node *n = hashstr(t, key); - lua_assert(key->tt == LUA_VSHRSTR); - for (;;) { - if (keyisshrstr(n) && eqshrstr(keystrval(n), key)) - return gval(n); - else { - int nx = gnext(n); - if (nx == 0) - return &absentkey; - n += nx; - } - } -} - - -int luaH_getshortstr (Table *t, TString *key, TValue *res) { - return finishnodeget(luaH_Hgetshortstr(t, key), res); -} - - -static const TValue *Hgetstr (Table *t, TString *key) { - if (key->tt == LUA_VSHRSTR) - return luaH_Hgetshortstr(t, key); - else { - TValue ko; - setsvalue(cast(lua_State *, NULL), &ko, key); - return getgeneric(t, &ko, 0); - } -} - - -int luaH_getstr (Table *t, TString *key, TValue *res) { - return finishnodeget(Hgetstr(t, key), res); -} - - -TString *luaH_getstrkey (Table *t, TString *key) { - const TValue *o = Hgetstr(t, key); - if (!isabstkey(o)) - return keystrval(nodefromval(o)); - else - return NULL; -} - - - -int luaH_get (Table *t, const TValue *key, TValue *res) { - const TValue *slot; - switch (ttypetag(key)) { - case LUA_VSHRSTR: - slot = luaH_Hgetshortstr(t, tsvalue(key)); - break; - case LUA_VNUMINT: - return luaH_getint(t, ivalue(key), res); - case LUA_VNIL: - slot = &absentkey; - break; - case LUA_VNUMFLT: { - lua_Integer k; - if (luaV_flttointeger(fltvalue(key), &k, F2Ieq)) - return luaH_getint(t, k, res); - - } - default: - slot = getgeneric(t, key, 0); - break; - } - return finishnodeget(slot, res); -} - - -static int finishnodeset (Table *t, const TValue *slot, TValue *val) { - if (!ttisnil(slot)) { - setobj(((lua_State*)NULL), cast(TValue*, slot), val); - return HOK; - } - else if (isabstkey(slot)) - return HNOTFOUND; - else - return cast_int((cast(Node*, slot) - t->node)) + HFIRSTNODE; -} - - -static int rawfinishnodeset (const TValue *slot, TValue *val) { - if (isabstkey(slot)) - return 0; - else { - setobj(((lua_State*)NULL), cast(TValue*, slot), val); - return 1; - } -} - - -int luaH_psetint (Table *t, lua_Integer key, TValue *val) { - if (keyinarray(t, key)) { - lu_byte *tag = getArrTag(t, key - 1); - if (!tagisempty(*tag) || checknoTM(t->metatable, TM_NEWINDEX)) { - fval2arr(t, key, tag, val); - return HOK; - } - else - return ~cast_int(key); - } - else - return finishnodeset(t, getintfromhash(t, key), val); -} - - -int luaH_psetshortstr (Table *t, TString *key, TValue *val) { - return finishnodeset(t, luaH_Hgetshortstr(t, key), val); -} - - -int luaH_psetstr (Table *t, TString *key, TValue *val) { - return finishnodeset(t, Hgetstr(t, key), val); -} - - -int luaH_pset (Table *t, const TValue *key, TValue *val) { - switch (ttypetag(key)) { - case LUA_VSHRSTR: return luaH_psetshortstr(t, tsvalue(key), val); - case LUA_VNUMINT: return luaH_psetint(t, ivalue(key), val); - case LUA_VNIL: return HNOTFOUND; - case LUA_VNUMFLT: { - lua_Integer k; - if (luaV_flttointeger(fltvalue(key), &k, F2Ieq)) - return luaH_psetint(t, k, val); - - } - default: - return finishnodeset(t, getgeneric(t, key, 0), val); - } -} - - - - -void luaH_finishset (lua_State *L, Table *t, const TValue *key, - TValue *value, int hres) { - lua_assert(hres != HOK); - if (hres == HNOTFOUND) { - luaH_newkey(L, t, key, value); - } - else if (hres > 0) { - setobj2t(L, gval(gnode(t, hres - HFIRSTNODE)), value); - } - else { - hres = ~hres; - obj2arr(t, hres, value); - } -} - - - -void luaH_set (lua_State *L, Table *t, const TValue *key, TValue *value) { - int hres = luaH_pset(t, key, value); - if (hres != HOK) - luaH_finishset(L, t, key, value, hres); -} - - - -void luaH_setint (lua_State *L, Table *t, lua_Integer key, TValue *value) { - if (keyinarray(t, key)) - obj2arr(t, key, value); - else { - int ok = rawfinishnodeset(getintfromhash(t, key), value); - if (!ok) { - TValue k; - setivalue(&k, key); - luaH_newkey(L, t, &k, value); - } - } -} - - - -static lua_Unsigned hash_search (Table *t, lua_Unsigned j) { - lua_Unsigned i; - if (j == 0) j++; - do { - i = j; - if (j <= l_castS2U(LUA_MAXINTEGER) / 2) - j *= 2; - else { - j = LUA_MAXINTEGER; - if (hashkeyisempty(t, j)) - break; - else - return j; - } - } while (!hashkeyisempty(t, j)); - - while (j - i > 1u) { - lua_Unsigned m = (i + j) / 2; - if (hashkeyisempty(t, m)) j = m; - else i = m; - } - return i; -} - - -static unsigned int binsearch (Table *array, unsigned int i, unsigned int j) { - while (j - i > 1u) { - unsigned int m = (i + j) / 2; - if (arraykeyisempty(array, m)) j = m; - else i = m; - } - return i; -} - - - -lua_Unsigned luaH_getn (Table *t) { - unsigned int limit = t->alimit; - if (limit > 0 && arraykeyisempty(t, limit)) { - - if (limit >= 2 && !arraykeyisempty(t, limit - 1)) { - - if (ispow2realasize(t) && !ispow2(limit - 1)) { - t->alimit = limit - 1; - setnorealasize(t); - } - return limit - 1; - } - else { - unsigned int boundary = binsearch(t, 0, limit); - - if (ispow2realasize(t) && boundary > luaH_realasize(t) / 2) { - t->alimit = boundary; - setnorealasize(t); - } - return boundary; - } - } - - if (!limitequalsasize(t)) { - - if (arraykeyisempty(t, limit + 1)) - return limit; - - limit = luaH_realasize(t); - if (arraykeyisempty(t, limit)) { - - unsigned int boundary = binsearch(t, t->alimit, limit); - t->alimit = boundary; - return boundary; - } - - } - - lua_assert(limit == luaH_realasize(t) && - (limit == 0 || !arraykeyisempty(t, limit))); - if (isdummy(t) || hashkeyisempty(t, cast(lua_Integer, limit + 1))) - return limit; - else - return hash_search(t, limit); -} - - - -#if defined(LUA_DEBUG) - - - -Node *luaH_mainposition (const Table *t, const TValue *key) { - return mainpositionTV(t, key); -} - -#endif - - -//path: src/imports/../dependencies/lua/ldo.c - - -#define ldo_c -#define LUA_CORE - - - - - -#include -#include -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -#define errorstatus(s) ((s) > LUA_YIELD) - - - - - -#if !defined(LUAI_THROW) - -#if defined(__cplusplus) && !defined(LUA_USE_LONGJMP) - - -#define LUAI_THROW(L,c) throw(c) -#define LUAI_TRY(L,c,a) \ - try { a } catch(...) { if ((c)->status == 0) (c)->status = -1; } -#define luai_jmpbuf int - -#elif defined(LUA_USE_POSIX) - - -#define LUAI_THROW(L,c) _longjmp((c)->b, 1) -#define LUAI_TRY(L,c,a) if (_setjmp((c)->b) == 0) { a } -#define luai_jmpbuf jmp_buf - -#else - - -#define LUAI_THROW(L,c) longjmp((c)->b, 1) -#define LUAI_TRY(L,c,a) if (setjmp((c)->b) == 0) { a } -#define luai_jmpbuf jmp_buf - -#endif - -#endif - - - - -struct lua_longjmp { - struct lua_longjmp *previous; - luai_jmpbuf b; - volatile int status; -}; - - -void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop) { - switch (errcode) { - case LUA_ERRMEM: { - setsvalue2s(L, oldtop, G(L)->memerrmsg); - break; - } - case LUA_ERRERR: { - setsvalue2s(L, oldtop, luaS_newliteral(L, "error in private_lua_error handling")); - break; - } - case LUA_OK: { - setnilvalue(s2v(oldtop)); - break; - } - default: { - lua_assert(errorstatus(errcode)); - setobjs2s(L, oldtop, L->top.p - 1); - break; - } - } - L->top.p = oldtop + 1; -} - - -l_noret luaD_throw (lua_State *L, int errcode) { - if (L->errorJmp) { - L->errorJmp->status = errcode; - LUAI_THROW(L, L->errorJmp); - } - else { - global_State *g = G(L); - errcode = luaE_resetthread(L, errcode); - if (g->mainthread->errorJmp) { - setobjs2s(L, g->mainthread->top.p++, L->top.p - 1); - luaD_throw(g->mainthread, errcode); - } - else { - if (g->panic) { - lua_unlock(L); - g->panic(L); - } - abort(); - } - } -} - - -int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) { - l_uint32 oldnCcalls = L->nCcalls; - struct lua_longjmp lj; - lj.status = LUA_OK; - lj.previous = L->errorJmp; - L->errorJmp = &lj; - LUAI_TRY(L, &lj, - (*f)(L, ud); - ); - L->errorJmp = lj.previous; - L->nCcalls = oldnCcalls; - return lj.status; -} - - - - - - - - -static void relstack (lua_State *L) { - CallInfo *ci; - UpVal *up; - L->top.offset = savestack(L, L->top.p); - L->tbclist.offset = savestack(L, L->tbclist.p); - for (up = L->openupval; up != NULL; up = up->u.open.next) - up->v.offset = savestack(L, uplevel(up)); - for (ci = L->ci; ci != NULL; ci = ci->previous) { - ci->top.offset = savestack(L, ci->top.p); - ci->func.offset = savestack(L, ci->func.p); - } -} - - - -static void correctstack (lua_State *L) { - CallInfo *ci; - UpVal *up; - L->top.p = restorestack(L, L->top.offset); - L->tbclist.p = restorestack(L, L->tbclist.offset); - for (up = L->openupval; up != NULL; up = up->u.open.next) - up->v.p = s2v(restorestack(L, up->v.offset)); - for (ci = L->ci; ci != NULL; ci = ci->previous) { - ci->top.p = restorestack(L, ci->top.offset); - ci->func.p = restorestack(L, ci->func.offset); - if (isLua(ci)) - ci->u.l.trap = 1; - } -} - - - -#define ERRORSTACKSIZE (LUAI_MAXSTACK + 200) - - -int luaD_reallocstack (lua_State *L, int newsize, int raiseerror) { - int oldsize = stacksize(L); - int i; - StkId newstack; - int oldgcstop = G(L)->gcstopem; - lua_assert(newsize <= LUAI_MAXSTACK || newsize == ERRORSTACKSIZE); - relstack(L); - G(L)->gcstopem = 1; - newstack = luaM_reallocvector(L, L->stack.p, oldsize + EXTRA_STACK, - newsize + EXTRA_STACK, StackValue); - G(L)->gcstopem = oldgcstop; - if (l_unlikely(newstack == NULL)) { - correctstack(L); - if (raiseerror) - luaM_error(L); - else return 0; - } - L->stack.p = newstack; - correctstack(L); - L->stack_last.p = L->stack.p + newsize; - for (i = oldsize + EXTRA_STACK; i < newsize + EXTRA_STACK; i++) - setnilvalue(s2v(newstack + i)); - return 1; -} - - - -int luaD_growstack (lua_State *L, int n, int raiseerror) { - int size = stacksize(L); - if (l_unlikely(size > LUAI_MAXSTACK)) { - - lua_assert(stacksize(L) == ERRORSTACKSIZE); - if (raiseerror) - luaD_throw(L, LUA_ERRERR); - return 0; - } - else if (n < LUAI_MAXSTACK) { - int newsize = 2 * size; - int needed = cast_int(L->top.p - L->stack.p) + n; - if (newsize > LUAI_MAXSTACK) - newsize = LUAI_MAXSTACK; - if (newsize < needed) - newsize = needed; - if (l_likely(newsize <= LUAI_MAXSTACK)) - return luaD_reallocstack(L, newsize, raiseerror); - } - - - luaD_reallocstack(L, ERRORSTACKSIZE, raiseerror); - if (raiseerror) - luaG_runerror(L, "stack overflow"); - return 0; -} - - - -static int stackinuse (lua_State *L) { - CallInfo *ci; - int res; - StkId lim = L->top.p; - for (ci = L->ci; ci != NULL; ci = ci->previous) { - if (lim < ci->top.p) lim = ci->top.p; - } - lua_assert(lim <= L->stack_last.p + EXTRA_STACK); - res = cast_int(lim - L->stack.p) + 1; - if (res < LUA_MINSTACK) - res = LUA_MINSTACK; - return res; -} - - - -void luaD_shrinkstack (lua_State *L) { - int inuse = stackinuse(L); - int max = (inuse > LUAI_MAXSTACK / 3) ? LUAI_MAXSTACK : inuse * 3; - - if (inuse <= LUAI_MAXSTACK && stacksize(L) > max) { - int nsize = (inuse > LUAI_MAXSTACK / 2) ? LUAI_MAXSTACK : inuse * 2; - luaD_reallocstack(L, nsize, 0); - } - else - condmovestack(L,{},{}); - luaE_shrinkCI(L); -} - - -void luaD_inctop (lua_State *L) { - luaD_checkstack(L, 1); - L->top.p++; -} - - - - - -void luaD_hook (lua_State *L, int event, int line, - int ftransfer, int ntransfer) { - lua_Hook hook = L->hook; - if (hook && L->allowhook) { - int mask = CIST_HOOKED; - CallInfo *ci = L->ci; - ptrdiff_t top = savestack(L, L->top.p); - ptrdiff_t ci_top = savestack(L, ci->top.p); - lua_Debug ar; - ar.event = event; - ar.currentline = line; - ar.i_ci = ci; - if (ntransfer != 0) { - mask |= CIST_TRAN; - ci->u2.transferinfo.ftransfer = ftransfer; - ci->u2.transferinfo.ntransfer = ntransfer; - } - if (isLua(ci) && L->top.p < ci->top.p) - L->top.p = ci->top.p; - luaD_checkstack(L, LUA_MINSTACK); - if (ci->top.p < L->top.p + LUA_MINSTACK) - ci->top.p = L->top.p + LUA_MINSTACK; - L->allowhook = 0; - ci->callstatus |= mask; - lua_unlock(L); - (*hook)(L, &ar); - lua_lock(L); - lua_assert(!L->allowhook); - L->allowhook = 1; - ci->top.p = restorestack(L, ci_top); - L->top.p = restorestack(L, top); - ci->callstatus &= ~mask; - } -} - - - -void luaD_hookcall (lua_State *L, CallInfo *ci) { - L->oldpc = 0; - if (L->hookmask & LUA_MASKCALL) { - int event = (ci->callstatus & CIST_TAIL) ? LUA_HOOKTAILCALL - : LUA_HOOKCALL; - Proto *p = ci_func(ci)->p; - ci->u.l.savedpc++; - luaD_hook(L, event, -1, 1, p->numparams); - ci->u.l.savedpc--; - } -} - - - -static void rethook (lua_State *L, CallInfo *ci, int nres) { - if (L->hookmask & LUA_MASKRET) { - StkId firstres = L->top.p - nres; - int delta = 0; - int ftransfer; - if (isLua(ci)) { - Proto *p = ci_func(ci)->p; - if (p->flag & PF_ISVARARG) - delta = ci->u.l.nextraargs + p->numparams + 1; - } - ci->func.p += delta; - ftransfer = cast(unsigned short, firstres - ci->func.p); - luaD_hook(L, LUA_HOOKRET, -1, ftransfer, nres); - ci->func.p -= delta; - } - if (isLua(ci = ci->previous)) - L->oldpc = pcRel(ci->u.l.savedpc, ci_func(ci)->p); -} - - - -static StkId tryfuncTM (lua_State *L, StkId func) { - const TValue *tm; - StkId p; - checkstackp(L, 1, func); - tm = luaT_gettmbyobj(L, s2v(func), TM_CALL); - if (l_unlikely(ttisnil(tm))) - luaG_callerror(L, s2v(func)); - for (p = L->top.p; p > func; p--) - setobjs2s(L, p, p-1); - L->top.p++; - setobj2s(L, func, tm); - return func; -} - - - -l_sinline void moveresults (lua_State *L, StkId res, int nres, int wanted) { - StkId firstresult; - int i; - switch (wanted) { - case 0: - L->top.p = res; - return; - case 1: - if (nres == 0) - setnilvalue(s2v(res)); - else - setobjs2s(L, res, L->top.p - nres); - L->top.p = res + 1; - return; - case LUA_MULTRET: - wanted = nres; - break; - default: - if (hastocloseCfunc(wanted)) { - L->ci->callstatus |= CIST_CLSRET; - L->ci->u2.nres = nres; - res = luaF_close(L, res, CLOSEKTOP, 1); - L->ci->callstatus &= ~CIST_CLSRET; - if (L->hookmask) { - ptrdiff_t savedres = savestack(L, res); - rethook(L, L->ci, nres); - res = restorestack(L, savedres); - } - wanted = decodeNresults(wanted); - if (wanted == LUA_MULTRET) - wanted = nres; - } - break; - } - - firstresult = L->top.p - nres; - if (nres > wanted) - nres = wanted; - for (i = 0; i < nres; i++) - setobjs2s(L, res + i, firstresult + i); - for (; i < wanted; i++) - setnilvalue(s2v(res + i)); - L->top.p = res + wanted; -} - - - -void luaD_poscall (lua_State *L, CallInfo *ci, int nres) { - int wanted = ci->nresults; - if (l_unlikely(L->hookmask && !hastocloseCfunc(wanted))) - rethook(L, ci, nres); - - moveresults(L, ci->func.p, nres, wanted); - - lua_assert(!(ci->callstatus & - (CIST_HOOKED | CIST_YPCALL | CIST_FIN | CIST_TRAN | CIST_CLSRET))); - L->ci = ci->previous; -} - - - -#define next_ci(L) (L->ci->next ? L->ci->next : luaE_extendCI(L)) - - -l_sinline CallInfo *prepCallInfo (lua_State *L, StkId func, int nret, - int mask, StkId top) { - CallInfo *ci = L->ci = next_ci(L); - ci->func.p = func; - ci->nresults = nret; - ci->callstatus = mask; - ci->top.p = top; - return ci; -} - - - -l_sinline int precallC (lua_State *L, StkId func, int nresults, - lua_CFunction f) { - int n; - CallInfo *ci; - checkstackp(L, LUA_MINSTACK, func); - L->ci = ci = prepCallInfo(L, func, nresults, CIST_C, - L->top.p + LUA_MINSTACK); - lua_assert(ci->top.p <= L->stack_last.p); - if (l_unlikely(L->hookmask & LUA_MASKCALL)) { - int narg = cast_int(L->top.p - func) - 1; - luaD_hook(L, LUA_HOOKCALL, -1, 1, narg); - } - lua_unlock(L); - n = (*f)(L); - lua_lock(L); - api_checknelems(L, n); - luaD_poscall(L, ci, n); - return n; -} - - - -int luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, - int narg1, int delta) { - retry: - switch (ttypetag(s2v(func))) { - case LUA_VCCL: - return precallC(L, func, LUA_MULTRET, clCvalue(s2v(func))->f); - case LUA_VLCF: - return precallC(L, func, LUA_MULTRET, fvalue(s2v(func))); - case LUA_VLCL: { - Proto *p = clLvalue(s2v(func))->p; - int fsize = p->maxstacksize; - int nfixparams = p->numparams; - int i; - checkstackp(L, fsize - delta, func); - ci->func.p -= delta; - for (i = 0; i < narg1; i++) - setobjs2s(L, ci->func.p + i, func + i); - func = ci->func.p; - for (; narg1 <= nfixparams; narg1++) - setnilvalue(s2v(func + narg1)); - ci->top.p = func + 1 + fsize; - lua_assert(ci->top.p <= L->stack_last.p); - ci->u.l.savedpc = p->code; - ci->callstatus |= CIST_TAIL; - L->top.p = func + narg1; - return -1; - } - default: { - func = tryfuncTM(L, func); - - narg1++; - goto retry; - } - } -} - - - -CallInfo *luaD_precall (lua_State *L, StkId func, int nresults) { - retry: - switch (ttypetag(s2v(func))) { - case LUA_VCCL: - precallC(L, func, nresults, clCvalue(s2v(func))->f); - return NULL; - case LUA_VLCF: - precallC(L, func, nresults, fvalue(s2v(func))); - return NULL; - case LUA_VLCL: { - CallInfo *ci; - Proto *p = clLvalue(s2v(func))->p; - int narg = cast_int(L->top.p - func) - 1; - int nfixparams = p->numparams; - int fsize = p->maxstacksize; - checkstackp(L, fsize, func); - L->ci = ci = prepCallInfo(L, func, nresults, 0, func + 1 + fsize); - ci->u.l.savedpc = p->code; - for (; narg < nfixparams; narg++) - setnilvalue(s2v(L->top.p++)); - lua_assert(ci->top.p <= L->stack_last.p); - return ci; - } - default: { - func = tryfuncTM(L, func); - - goto retry; - } - } -} - - - -l_sinline void ccall (lua_State *L, StkId func, int nResults, l_uint32 inc) { - CallInfo *ci; - L->nCcalls += inc; - if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) { - checkstackp(L, 0, func); - luaE_checkcstack(L); - } - if ((ci = luaD_precall(L, func, nResults)) != NULL) { - ci->callstatus = CIST_FRESH; - luaV_execute(L, ci); - } - L->nCcalls -= inc; -} - - - -void luaD_call (lua_State *L, StkId func, int nResults) { - ccall(L, func, nResults, 1); -} - - - -void luaD_callnoyield (lua_State *L, StkId func, int nResults) { - ccall(L, func, nResults, nyci); -} - - - -static int finishpcallk (lua_State *L, CallInfo *ci) { - int status = getcistrecst(ci); - if (l_likely(status == LUA_OK)) - status = LUA_YIELD; - else { - StkId func = restorestack(L, ci->u2.funcidx); - L->allowhook = getoah(ci->callstatus); - func = luaF_close(L, func, status, 1); - luaD_seterrorobj(L, status, func); - luaD_shrinkstack(L); - setcistrecst(ci, LUA_OK); - } - ci->callstatus &= ~CIST_YPCALL; - L->errfunc = ci->u.c.old_errfunc; - - return status; -} - - - -static void finishCcall (lua_State *L, CallInfo *ci) { - int n; - if (ci->callstatus & CIST_CLSRET) { - lua_assert(hastocloseCfunc(ci->nresults)); - n = ci->u2.nres; - - } - else { - int status = LUA_YIELD; - - lua_assert(ci->u.c.k != NULL && yieldable(L)); - if (ci->callstatus & CIST_YPCALL) - status = finishpcallk(L, ci); - adjustresults(L, LUA_MULTRET); - lua_unlock(L); - n = (*ci->u.c.k)(L, status, ci->u.c.ctx); - lua_lock(L); - api_checknelems(L, n); - } - luaD_poscall(L, ci, n); -} - - - -static void unroll (lua_State *L, void *ud) { - CallInfo *ci; - UNUSED(ud); - while ((ci = L->ci) != &L->base_ci) { - if (!isLua(ci)) - finishCcall(L, ci); - else { - luaV_finishOp(L); - luaV_execute(L, ci); - } - } -} - - - -static CallInfo *findpcall (lua_State *L) { - CallInfo *ci; - for (ci = L->ci; ci != NULL; ci = ci->previous) { - if (ci->callstatus & CIST_YPCALL) - return ci; - } - return NULL; -} - - - -static int resume_error (lua_State *L, const char *msg, int narg) { - api_checkpop(L, narg); - L->top.p -= narg; - setsvalue2s(L, L->top.p, luaS_new(L, msg)); - api_incr_top(L); - lua_unlock(L); - return LUA_ERRRUN; -} - - - -static void resume (lua_State *L, void *ud) { - int n = *(cast(int*, ud)); - StkId firstArg = L->top.p - n; - CallInfo *ci = L->ci; - if (L->status == LUA_OK) - ccall(L, firstArg - 1, LUA_MULTRET, 0); - else { - lua_assert(L->status == LUA_YIELD); - L->status = LUA_OK; - if (isLua(ci)) { - - lua_assert(ci->callstatus & CIST_HOOKYIELD); - ci->u.l.savedpc--; - L->top.p = firstArg; - luaV_execute(L, ci); - } - else { - if (ci->u.c.k != NULL) { - lua_unlock(L); - n = (*ci->u.c.k)(L, LUA_YIELD, ci->u.c.ctx); - lua_lock(L); - api_checknelems(L, n); - } - luaD_poscall(L, ci, n); - } - unroll(L, NULL); - } -} - - - -static int precover (lua_State *L, int status) { - CallInfo *ci; - while (errorstatus(status) && (ci = findpcall(L)) != NULL) { - L->ci = ci; - setcistrecst(ci, status); - status = luaD_rawrunprotected(L, unroll, NULL); - } - return status; -} - - -LUA_API int lua_resume (lua_State *L, lua_State *from, int nargs, - int *nresults) { - int status; - lua_lock(L); - if (L->status == LUA_OK) { - if (L->ci != &L->base_ci) - return resume_error(L, "cannot resume non-suspended coroutine", nargs); - else if (L->top.p - (L->ci->func.p + 1) == nargs) - return resume_error(L, "cannot resume dead coroutine", nargs); - } - else if (L->status != LUA_YIELD) - return resume_error(L, "cannot resume dead coroutine", nargs); - L->nCcalls = (from) ? getCcalls(from) : 0; - if (getCcalls(L) >= LUAI_MAXCCALLS) - return resume_error(L, "C stack overflow", nargs); - L->nCcalls++; - luai_userstateresume(L, nargs); - api_checkpop(L, (L->status == LUA_OK) ? nargs + 1 : nargs); - status = luaD_rawrunprotected(L, resume, &nargs); - - status = precover(L, status); - if (l_likely(!errorstatus(status))) - lua_assert(status == L->status); - else { - L->status = cast_byte(status); - luaD_seterrorobj(L, status, L->top.p); - L->ci->top.p = L->top.p; - } - *nresults = (status == LUA_YIELD) ? L->ci->u2.nyield - : cast_int(L->top.p - (L->ci->func.p + 1)); - lua_unlock(L); - return status; -} - - -LUA_API int lua_isyieldable (lua_State *L) { - return yieldable(L); -} - - -LUA_API int lua_yieldk (lua_State *L, int nresults, lua_KContext ctx, - lua_KFunction k) { - CallInfo *ci; - luai_userstateyield(L, nresults); - lua_lock(L); - ci = L->ci; - api_checkpop(L, nresults); - if (l_unlikely(!yieldable(L))) { - if (L != G(L)->mainthread) - luaG_runerror(L, "attempt to yield across a C-call boundary"); - else - luaG_runerror(L, "attempt to yield from outside a coroutine"); - } - L->status = LUA_YIELD; - ci->u2.nyield = nresults; - if (isLua(ci)) { - lua_assert(!isLuacode(ci)); - api_check(L, nresults == 0, "hooks cannot yield values"); - api_check(L, k == NULL, "hooks cannot continue after yielding"); - } - else { - if ((ci->u.c.k = k) != NULL) - ci->u.c.ctx = ctx; - luaD_throw(L, LUA_YIELD); - } - lua_assert(ci->callstatus & CIST_HOOKED); - lua_unlock(L); - return 0; -} - - - -struct CloseP { - StkId level; - int status; -}; - - - -static void closepaux (lua_State *L, void *ud) { - struct CloseP *pcl = cast(struct CloseP *, ud); - luaF_close(L, pcl->level, pcl->status, 0); -} - - - -int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status) { - CallInfo *old_ci = L->ci; - lu_byte old_allowhooks = L->allowhook; - for (;;) { - struct CloseP pcl; - pcl.level = restorestack(L, level); pcl.status = status; - status = luaD_rawrunprotected(L, &closepaux, &pcl); - if (l_likely(status == LUA_OK)) - return pcl.status; - else { - L->ci = old_ci; - L->allowhook = old_allowhooks; - } - } -} - - - -int luaD_pcall (lua_State *L, Pfunc func, void *u, - ptrdiff_t old_top, ptrdiff_t ef) { - int status; - CallInfo *old_ci = L->ci; - lu_byte old_allowhooks = L->allowhook; - ptrdiff_t old_errfunc = L->errfunc; - L->errfunc = ef; - status = luaD_rawrunprotected(L, func, u); - if (l_unlikely(status != LUA_OK)) { - L->ci = old_ci; - L->allowhook = old_allowhooks; - status = luaD_closeprotected(L, old_top, status); - luaD_seterrorobj(L, status, restorestack(L, old_top)); - luaD_shrinkstack(L); - } - L->errfunc = old_errfunc; - return status; -} - - - - -struct SParser { - ZIO *z; - Mbuffer buff; - Dyndata dyd; - const char *mode; - const char *name; -}; - - -static void checkmode (lua_State *L, const char *mode, const char *x) { - if (strchr(mode, x[0]) == NULL) { - luaO_pushfstring(L, - "attempt to load a %s chunk (mode is '%s')", x, mode); - luaD_throw(L, LUA_ERRSYNTAX); - } -} - - -static void f_parser (lua_State *L, void *ud) { - LClosure *cl; - struct SParser *p = cast(struct SParser *, ud); - const char *mode = p->mode ? p->mode : "bt"; - int c = zgetc(p->z); - if (c == LUA_SIGNATURE[0]) { - int fixed = 0; - if (strchr(mode, 'B') != NULL) - fixed = 1; - else - checkmode(L, mode, "binary"); - cl = luaU_undump(L, p->z, p->name, fixed); - } - else { - checkmode(L, mode, "text"); - cl = luaY_parser(L, p->z, &p->buff, &p->dyd, p->name, c); - } - lua_assert(cl->nupvalues == cl->p->sizeupvalues); - luaF_initupvals(L, cl); -} - - -int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, - const char *mode) { - struct SParser p; - int status; - incnny(L); - p.z = z; p.name = name; p.mode = mode; - p.dyd.actvar.arr = NULL; p.dyd.actvar.size = 0; - p.dyd.gt.arr = NULL; p.dyd.gt.size = 0; - p.dyd.label.arr = NULL; p.dyd.label.size = 0; - luaZ_initbuffer(L, &p.buff); - status = luaD_pcall(L, f_parser, &p, savestack(L, L->top.p), L->errfunc); - luaZ_freebuffer(L, &p.buff); - luaM_freearray(L, p.dyd.actvar.arr, p.dyd.actvar.size); - luaM_freearray(L, p.dyd.gt.arr, p.dyd.gt.size); - luaM_freearray(L, p.dyd.label.arr, p.dyd.label.size); - decnny(L); - return status; -} - - - - -//path: src/imports/../dependencies/lua/lvm.c - - -#define lvm_c -#define LUA_CORE - - - - -#include -#include -#include -#include -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -#if !defined(LUA_USE_JUMPTABLE) -#if defined(__GNUC__) -#define LUA_USE_JUMPTABLE 1 -#else -#define LUA_USE_JUMPTABLE 0 -#endif -#endif - - - - -#define MAXTAGLOOP 2000 - - - - - -#define NBM (l_floatatt(MANT_DIG)) - - -#if ((((LUA_MAXINTEGER >> (NBM / 4)) >> (NBM / 4)) >> (NBM / 4)) \ - >> (NBM - (3 * (NBM / 4)))) > 0 - - -#define MAXINTFITSF ((lua_Unsigned)1 << NBM) - - -#define l_intfitsf(i) ((MAXINTFITSF + l_castS2U(i)) <= (2 * MAXINTFITSF)) - -#else - -#define l_intfitsf(i) 1 - -#endif - - - -static int l_strton (const TValue *obj, TValue *result) { - lua_assert(obj != result); - if (!cvt2num(obj)) - return 0; - else { - TString *st = tsvalue(obj); - size_t stlen; - const char *s = getlstr(st, stlen); - return (luaO_str2num(s, result) == stlen + 1); - } -} - - - -int luaV_tonumber_ (const TValue *obj, lua_Number *n) { - TValue v; - if (ttisinteger(obj)) { - *n = cast_num(ivalue(obj)); - return 1; - } - else if (l_strton(obj, &v)) { - *n = nvalue(&v); - return 1; - } - else - return 0; -} - - - -int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode) { - lua_Number f = l_floor(n); - if (n != f) { - if (mode == F2Ieq) return 0; - else if (mode == F2Iceil) - f += 1; - } - return lua_numbertointeger(f, p); -} - - - -int luaV_tointegerns (const TValue *obj, lua_Integer *p, F2Imod mode) { - if (ttisfloat(obj)) - return luaV_flttointeger(fltvalue(obj), p, mode); - else if (ttisinteger(obj)) { - *p = ivalue(obj); - return 1; - } - else - return 0; -} - - - -int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode) { - TValue v; - if (l_strton(obj, &v)) - obj = &v; - return luaV_tointegerns(obj, p, mode); -} - - - -static int forlimit (lua_State *L, lua_Integer init, const TValue *lim, - lua_Integer *p, lua_Integer step) { - if (!luaV_tointeger(lim, p, (step < 0 ? F2Iceil : F2Ifloor))) { - - lua_Number flim; - if (!tonumber(lim, &flim)) - luaG_forerror(L, lim, "limit"); - - if (luai_numlt(0, flim)) { - if (step < 0) return 1; - *p = LUA_MAXINTEGER; - } - else { - if (step > 0) return 1; - *p = LUA_MININTEGER; - } - } - return (step > 0 ? init > *p : init < *p); -} - - - -static int forprep (lua_State *L, StkId ra) { - TValue *pinit = s2v(ra); - TValue *plimit = s2v(ra + 1); - TValue *pstep = s2v(ra + 2); - if (ttisinteger(pinit) && ttisinteger(pstep)) { - lua_Integer init = ivalue(pinit); - lua_Integer step = ivalue(pstep); - lua_Integer limit; - if (step == 0) - luaG_runerror(L, "'for' step is zero"); - if (forlimit(L, init, plimit, &limit, step)) - return 1; - else { - lua_Unsigned count; - if (step > 0) { - count = l_castS2U(limit) - l_castS2U(init); - if (step != 1) - count /= l_castS2U(step); - } - else { - count = l_castS2U(init) - l_castS2U(limit); - - count /= l_castS2U(-(step + 1)) + 1u; - } - - chgivalue(s2v(ra), l_castU2S(count)); - setivalue(s2v(ra + 1), step); - chgivalue(s2v(ra + 2), init); - } - } - else { - lua_Number init; lua_Number limit; lua_Number step; - if (l_unlikely(!tonumber(plimit, &limit))) - luaG_forerror(L, plimit, "limit"); - if (l_unlikely(!tonumber(pstep, &step))) - luaG_forerror(L, pstep, "step"); - if (l_unlikely(!tonumber(pinit, &init))) - luaG_forerror(L, pinit, "initial value"); - if (step == 0) - luaG_runerror(L, "'for' step is zero"); - if (luai_numlt(0, step) ? luai_numlt(limit, init) - : luai_numlt(init, limit)) - return 1; - else { - - setfltvalue(s2v(ra), limit); - setfltvalue(s2v(ra + 1), step); - setfltvalue(s2v(ra + 2), init); - } - } - return 0; -} - - - -static int floatforloop (StkId ra) { - lua_Number step = fltvalue(s2v(ra + 1)); - lua_Number limit = fltvalue(s2v(ra)); - lua_Number idx = fltvalue(s2v(ra + 2)); - idx = luai_numadd(L, idx, step); - if (luai_numlt(0, step) ? luai_numle(idx, limit) - : luai_numle(limit, idx)) { - chgfltvalue(s2v(ra + 2), idx); - return 1; - } - else - return 0; -} - - - -int luaV_finishget (lua_State *L, const TValue *t, TValue *key, StkId val, - int tag) { - int loop; - const TValue *tm; - for (loop = 0; loop < MAXTAGLOOP; loop++) { - if (tag == LUA_VNOTABLE) { - lua_assert(!ttistable(t)); - tm = luaT_gettmbyobj(L, t, TM_INDEX); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, t, "index"); - - } - else { - tm = fasttm(L, hvalue(t)->metatable, TM_INDEX); - if (tm == NULL) { - setnilvalue(s2v(val)); - return LUA_VNIL; - } - - } - if (ttisfunction(tm)) { - tag = luaT_callTMres(L, tm, t, key, val); - return tag; - } - t = tm; - luaV_fastget(t, key, s2v(val), luaH_get, tag); - if (!tagisempty(tag)) - return tag; - - } - luaG_runerror(L, "'__index' chain too long; possible loop"); - return 0; -} - - - -void luaV_finishset (lua_State *L, const TValue *t, TValue *key, - TValue *val, int hres) { - int loop; - for (loop = 0; loop < MAXTAGLOOP; loop++) { - const TValue *tm; - if (hres != HNOTATABLE) { - Table *h = hvalue(t); - tm = fasttm(L, h->metatable, TM_NEWINDEX); - if (tm == NULL) { - luaH_finishset(L, h, key, val, hres); - invalidateTMcache(h); - luaC_barrierback(L, obj2gco(h), val); - return; - } - - } - else { - tm = luaT_gettmbyobj(L, t, TM_NEWINDEX); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, t, "index"); - } - - if (ttisfunction(tm)) { - luaT_callTM(L, tm, t, key, val); - return; - } - t = tm; - luaV_fastset(t, key, val, hres, luaH_pset); - if (hres == HOK) - return; - - } - luaG_runerror(L, "'__newindex' chain too long; possible loop"); -} - - - -static int l_strcmp (const TString *ts1, const TString *ts2) { - size_t rl1; - const char *s1 = getlstr(ts1, rl1); - size_t rl2; - const char *s2 = getlstr(ts2, rl2); - for (;;) { - int temp = strcoll(s1, s2); - if (temp != 0) - return temp; - else { - size_t zl1 = strlen(s1); - size_t zl2 = strlen(s2); - if (zl2 == rl2) - return (zl1 == rl1) ? 0 : 1; - else if (zl1 == rl1) - return -1; - - zl1++; zl2++; - s1 += zl1; rl1 -= zl1; s2 += zl2; rl2 -= zl2; - } - } -} - - - -l_sinline int LTintfloat (lua_Integer i, lua_Number f) { - if (l_intfitsf(i)) - return luai_numlt(cast_num(i), f); - else { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Iceil)) - return i < fi; - else - return f > 0; - } -} - - - -l_sinline int LEintfloat (lua_Integer i, lua_Number f) { - if (l_intfitsf(i)) - return luai_numle(cast_num(i), f); - else { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ifloor)) - return i <= fi; - else - return f > 0; - } -} - - - -l_sinline int LTfloatint (lua_Number f, lua_Integer i) { - if (l_intfitsf(i)) - return luai_numlt(f, cast_num(i)); - else { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ifloor)) - return fi < i; - else - return f < 0; - } -} - - - -l_sinline int LEfloatint (lua_Number f, lua_Integer i) { - if (l_intfitsf(i)) - return luai_numle(f, cast_num(i)); - else { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Iceil)) - return fi <= i; - else - return f < 0; - } -} - - - -l_sinline int LTnum (const TValue *l, const TValue *r) { - lua_assert(ttisnumber(l) && ttisnumber(r)); - if (ttisinteger(l)) { - lua_Integer li = ivalue(l); - if (ttisinteger(r)) - return li < ivalue(r); - else - return LTintfloat(li, fltvalue(r)); - } - else { - lua_Number lf = fltvalue(l); - if (ttisfloat(r)) - return luai_numlt(lf, fltvalue(r)); - else - return LTfloatint(lf, ivalue(r)); - } -} - - - -l_sinline int LEnum (const TValue *l, const TValue *r) { - lua_assert(ttisnumber(l) && ttisnumber(r)); - if (ttisinteger(l)) { - lua_Integer li = ivalue(l); - if (ttisinteger(r)) - return li <= ivalue(r); - else - return LEintfloat(li, fltvalue(r)); - } - else { - lua_Number lf = fltvalue(l); - if (ttisfloat(r)) - return luai_numle(lf, fltvalue(r)); - else - return LEfloatint(lf, ivalue(r)); - } -} - - - -static int lessthanothers (lua_State *L, const TValue *l, const TValue *r) { - lua_assert(!ttisnumber(l) || !ttisnumber(r)); - if (ttisstring(l) && ttisstring(r)) - return l_strcmp(tsvalue(l), tsvalue(r)) < 0; - else - return luaT_callorderTM(L, l, r, TM_LT); -} - - - -int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) { - if (ttisnumber(l) && ttisnumber(r)) - return LTnum(l, r); - else return lessthanothers(L, l, r); -} - - - -static int lessequalothers (lua_State *L, const TValue *l, const TValue *r) { - lua_assert(!ttisnumber(l) || !ttisnumber(r)); - if (ttisstring(l) && ttisstring(r)) - return l_strcmp(tsvalue(l), tsvalue(r)) <= 0; - else - return luaT_callorderTM(L, l, r, TM_LE); -} - - - -int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r) { - if (ttisnumber(l) && ttisnumber(r)) - return LEnum(l, r); - else return lessequalothers(L, l, r); -} - - - -int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2) { - const TValue *tm; - if (ttypetag(t1) != ttypetag(t2)) { - if (ttype(t1) != ttype(t2) || ttype(t1) != LUA_TNUMBER) - return 0; - else { - - lua_Integer i1, i2; - return (luaV_tointegerns(t1, &i1, F2Ieq) && - luaV_tointegerns(t2, &i2, F2Ieq) && - i1 == i2); - } - } - - switch (ttypetag(t1)) { - case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: return 1; - case LUA_VNUMINT: return (ivalue(t1) == ivalue(t2)); - case LUA_VNUMFLT: return luai_numeq(fltvalue(t1), fltvalue(t2)); - case LUA_VLIGHTUSERDATA: return pvalue(t1) == pvalue(t2); - case LUA_VLCF: return fvalue(t1) == fvalue(t2); - case LUA_VSHRSTR: return eqshrstr(tsvalue(t1), tsvalue(t2)); - case LUA_VLNGSTR: return luaS_eqlngstr(tsvalue(t1), tsvalue(t2)); - case LUA_VUSERDATA: { - if (uvalue(t1) == uvalue(t2)) return 1; - else if (L == NULL) return 0; - tm = fasttm(L, uvalue(t1)->metatable, TM_EQ); - if (tm == NULL) - tm = fasttm(L, uvalue(t2)->metatable, TM_EQ); - break; - } - case LUA_VTABLE: { - if (hvalue(t1) == hvalue(t2)) return 1; - else if (L == NULL) return 0; - tm = fasttm(L, hvalue(t1)->metatable, TM_EQ); - if (tm == NULL) - tm = fasttm(L, hvalue(t2)->metatable, TM_EQ); - break; - } - default: - return gcvalue(t1) == gcvalue(t2); - } - if (tm == NULL) - return 0; - else { - int tag = luaT_callTMres(L, tm, t1, t2, L->top.p); - return !tagisfalse(tag); - } -} - - - -#define tostring(L,o) \ - (ttisstring(o) || (cvt2str(o) && (luaO_tostring(L, o), 1))) - -#define isemptystr(o) (ttisshrstring(o) && tsvalue(o)->shrlen == 0) - - -static void copy2buff (StkId top, int n, char *buff) { - size_t tl = 0; - do { - TString *st = tsvalue(s2v(top - n)); - size_t l; - const char *s = getlstr(st, l); - memcpy(buff + tl, s, l * sizeof(char)); - tl += l; - } while (--n > 0); -} - - - -void luaV_concat (lua_State *L, int total) { - if (total == 1) - return; - do { - StkId top = L->top.p; - int n = 2; - if (!(ttisstring(s2v(top - 2)) || cvt2str(s2v(top - 2))) || - !tostring(L, s2v(top - 1))) - luaT_tryconcatTM(L); - else if (isemptystr(s2v(top - 1))) - cast_void(tostring(L, s2v(top - 2))); - else if (isemptystr(s2v(top - 2))) { - setobjs2s(L, top - 2, top - 1); - } - else { - - size_t tl = tsslen(tsvalue(s2v(top - 1))); - TString *ts; - - for (n = 1; n < total && tostring(L, s2v(top - n - 1)); n++) { - size_t l = tsslen(tsvalue(s2v(top - n - 1))); - if (l_unlikely(l >= MAX_SIZE - sizeof(TString) - tl)) { - L->top.p = top - total; - luaG_runerror(L, "string length overflow"); - } - tl += l; - } - if (tl <= LUAI_MAXSHORTLEN) { - char buff[LUAI_MAXSHORTLEN]; - copy2buff(top, n, buff); - ts = luaS_newlstr(L, buff, tl); - } - else { - ts = luaS_createlngstrobj(L, tl); - copy2buff(top, n, getlngstr(ts)); - } - setsvalue2s(L, top - n, ts); - } - total -= n - 1; - L->top.p -= n - 1; - } while (total > 1); -} - - - -void luaV_objlen (lua_State *L, StkId ra, const TValue *rb) { - const TValue *tm; - switch (ttypetag(rb)) { - case LUA_VTABLE: { - Table *h = hvalue(rb); - tm = fasttm(L, h->metatable, TM_LEN); - if (tm) break; - setivalue(s2v(ra), luaH_getn(h)); - return; - } - case LUA_VSHRSTR: { - setivalue(s2v(ra), tsvalue(rb)->shrlen); - return; - } - case LUA_VLNGSTR: { - setivalue(s2v(ra), tsvalue(rb)->u.lnglen); - return; - } - default: { - tm = luaT_gettmbyobj(L, rb, TM_LEN); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, rb, "get length of"); - break; - } - } - luaT_callTMres(L, tm, rb, rb, ra); -} - - - -lua_Integer luaV_idiv (lua_State *L, lua_Integer m, lua_Integer n) { - if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { - if (n == 0) - luaG_runerror(L, "attempt to divide by zero"); - return intop(-, 0, m); - } - else { - lua_Integer q = m / n; - if ((m ^ n) < 0 && m % n != 0) - q -= 1; - return q; - } -} - - - -lua_Integer luaV_mod (lua_State *L, lua_Integer m, lua_Integer n) { - if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { - if (n == 0) - luaG_runerror(L, "attempt to perform 'n%%0'"); - return 0; - } - else { - lua_Integer r = m % n; - if (r != 0 && (r ^ n) < 0) - r += n; - return r; - } -} - - - -lua_Number luaV_modf (lua_State *L, lua_Number m, lua_Number n) { - lua_Number r; - luai_nummod(L, m, n, r); - return r; -} - - - -#define NBITS cast_int(sizeof(lua_Integer) * CHAR_BIT) - - - -lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y) { - if (y < 0) { - if (y <= -NBITS) return 0; - else return intop(>>, x, -y); - } - else { - if (y >= NBITS) return 0; - else return intop(<<, x, y); - } -} - - - -static void pushclosure (lua_State *L, Proto *p, UpVal **encup, StkId base, - StkId ra) { - int nup = p->sizeupvalues; - Upvaldesc *uv = p->upvalues; - int i; - LClosure *ncl = luaF_newLclosure(L, nup); - ncl->p = p; - setclLvalue2s(L, ra, ncl); - for (i = 0; i < nup; i++) { - if (uv[i].instack) - ncl->upvals[i] = luaF_findupval(L, base + uv[i].idx); - else - ncl->upvals[i] = encup[uv[i].idx]; - luaC_objbarrier(L, ncl, ncl->upvals[i]); - } -} - - - -void luaV_finishOp (lua_State *L) { - CallInfo *ci = L->ci; - StkId base = ci->func.p + 1; - Instruction inst = *(ci->u.l.savedpc - 1); - OpCode op = GET_OPCODE(inst); - switch (op) { - case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { - setobjs2s(L, base + GETARG_A(*(ci->u.l.savedpc - 2)), --L->top.p); - break; - } - case OP_UNM: case OP_BNOT: case OP_LEN: - case OP_GETTABUP: case OP_GETTABLE: case OP_GETI: - case OP_GETFIELD: case OP_SELF: { - setobjs2s(L, base + GETARG_A(inst), --L->top.p); - break; - } - case OP_LT: case OP_LE: - case OP_LTI: case OP_LEI: - case OP_GTI: case OP_GEI: - case OP_EQ: { - int res = !l_isfalse(s2v(L->top.p - 1)); - L->top.p--; -#if defined(LUA_COMPAT_LT_LE) - if (ci->callstatus & CIST_LEQ) { - ci->callstatus ^= CIST_LEQ; - res = !res; - } -#endif - lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_JMP); - if (res != GETARG_k(inst)) - ci->u.l.savedpc++; - break; - } - case OP_CONCAT: { - StkId top = L->top.p - 1; - int a = GETARG_A(inst); - int total = cast_int(top - 1 - (base + a)); - setobjs2s(L, top - 2, top); - L->top.p = top - 1; - luaV_concat(L, total); - break; - } - case OP_CLOSE: { - ci->u.l.savedpc--; - break; - } - case OP_RETURN: { - StkId ra = base + GETARG_A(inst); - - L->top.p = ra + ci->u2.nres; - - ci->u.l.savedpc--; - break; - } - default: { - - lua_assert(op == OP_TFORCALL || op == OP_CALL || - op == OP_TAILCALL || op == OP_SETTABUP || op == OP_SETTABLE || - op == OP_SETI || op == OP_SETFIELD); - break; - } - } -} - - - - - - -#define l_addi(L,a,b) intop(+, a, b) -#define l_subi(L,a,b) intop(-, a, b) -#define l_muli(L,a,b) intop(*, a, b) -#define l_band(a,b) intop(&, a, b) -#define l_bor(a,b) intop(|, a, b) -#define l_bxor(a,b) intop(^, a, b) - -#define l_lti(a,b) (a < b) -#define l_lei(a,b) (a <= b) -#define l_gti(a,b) (a > b) -#define l_gei(a,b) (a >= b) - - - -#define op_arithI(L,iop,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - int imm = GETARG_sC(i); \ - if (ttisinteger(v1)) { \ - lua_Integer iv1 = ivalue(v1); \ - pc++; setivalue(s2v(ra), iop(L, iv1, imm)); \ - } \ - else if (ttisfloat(v1)) { \ - lua_Number nb = fltvalue(v1); \ - lua_Number fimm = cast_num(imm); \ - pc++; setfltvalue(s2v(ra), fop(L, nb, fimm)); \ - }} - - - -#define op_arithf_aux(L,v1,v2,fop) { \ - lua_Number n1; lua_Number n2; \ - if (tonumberns(v1, n1) && tonumberns(v2, n2)) { \ - pc++; setfltvalue(s2v(ra), fop(L, n1, n2)); \ - }} - - - -#define op_arithf(L,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - op_arithf_aux(L, v1, v2, fop); } - - - -#define op_arithfK(L,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ - op_arithf_aux(L, v1, v2, fop); } - - - -#define op_arith_aux(L,v1,v2,iop,fop) { \ - StkId ra = RA(i); \ - if (ttisinteger(v1) && ttisinteger(v2)) { \ - lua_Integer i1 = ivalue(v1); lua_Integer i2 = ivalue(v2); \ - pc++; setivalue(s2v(ra), iop(L, i1, i2)); \ - } \ - else op_arithf_aux(L, v1, v2, fop); } - - - -#define op_arith(L,iop,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - op_arith_aux(L, v1, v2, iop, fop); } - - - -#define op_arithK(L,iop,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ - op_arith_aux(L, v1, v2, iop, fop); } - - - -#define op_bitwiseK(L,op) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); \ - lua_Integer i1; \ - lua_Integer i2 = ivalue(v2); \ - if (tointegerns(v1, &i1)) { \ - pc++; setivalue(s2v(ra), op(i1, i2)); \ - }} - - - -#define op_bitwise(L,op) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - lua_Integer i1; lua_Integer i2; \ - if (tointegerns(v1, &i1) && tointegerns(v2, &i2)) { \ - pc++; setivalue(s2v(ra), op(i1, i2)); \ - }} - - - -#define op_order(L,opi,opn,other) { \ - StkId ra = RA(i); \ - int cond; \ - TValue *rb = vRB(i); \ - if (ttisinteger(s2v(ra)) && ttisinteger(rb)) { \ - lua_Integer ia = ivalue(s2v(ra)); \ - lua_Integer ib = ivalue(rb); \ - cond = opi(ia, ib); \ - } \ - else if (ttisnumber(s2v(ra)) && ttisnumber(rb)) \ - cond = opn(s2v(ra), rb); \ - else \ - Protect(cond = other(L, s2v(ra), rb)); \ - docondjump(); } - - - -#define op_orderI(L,opi,opf,inv,tm) { \ - StkId ra = RA(i); \ - int cond; \ - int im = GETARG_sB(i); \ - if (ttisinteger(s2v(ra))) \ - cond = opi(ivalue(s2v(ra)), im); \ - else if (ttisfloat(s2v(ra))) { \ - lua_Number fa = fltvalue(s2v(ra)); \ - lua_Number fim = cast_num(im); \ - cond = opf(fa, fim); \ - } \ - else { \ - int isf = GETARG_C(i); \ - Protect(cond = luaT_callorderiTM(L, s2v(ra), im, inv, isf, tm)); \ - } \ - docondjump(); } - - - - - - - - - -#define RA(i) (base+GETARG_A(i)) -#define RB(i) (base+GETARG_B(i)) -#define vRB(i) s2v(RB(i)) -#define KB(i) (k+GETARG_B(i)) -#define RC(i) (base+GETARG_C(i)) -#define vRC(i) s2v(RC(i)) -#define KC(i) (k+GETARG_C(i)) -#define RKC(i) ((TESTARG_k(i)) ? k + GETARG_C(i) : s2v(base + GETARG_C(i))) - - - -#define updatetrap(ci) (trap = ci->u.l.trap) - -#define updatebase(ci) (base = ci->func.p + 1) - - -#define updatestack(ci) \ - { if (l_unlikely(trap)) { updatebase(ci); ra = RA(i); } } - - - -#define dojump(ci,i,e) { pc += GETARG_sJ(i) + e; updatetrap(ci); } - - - -#define donextjump(ci) { Instruction ni = *pc; dojump(ci, ni, 1); } - - -#define docondjump() if (cond != GETARG_k(i)) pc++; else donextjump(ci); - - - -#define savepc(L) (ci->u.l.savedpc = pc) - - - -#define savestate(L,ci) (savepc(L), L->top.p = ci->top.p) - - - -#define Protect(exp) (savestate(L,ci), (exp), updatetrap(ci)) - - -#define ProtectNT(exp) (savepc(L), (exp), updatetrap(ci)) - - -#define halfProtect(exp) (savestate(L,ci), (exp)) - - -#define checkGC(L,c) \ - { luaC_condGC(L, (savepc(L), L->top.p = (c)), \ - updatetrap(ci)); \ - luai_threadyield(L); } - - - -#define vmfetch() { \ - if (l_unlikely(trap)) { \ - trap = luaG_traceexec(L, pc); \ - updatebase(ci); \ - } \ - i = *(pc++); \ -} - -#define vmdispatch(o) switch(o) -#define vmcase(l) case l: -#define vmbreak break - - -void luaV_execute (lua_State *L, CallInfo *ci) { - LClosure *cl; - TValue *k; - StkId base; - const Instruction *pc; - int trap; -#if LUA_USE_JUMPTABLE -//path: src/imports/../dependencies/lua/ljumptab.h - - - -#undef vmdispatch -#undef vmcase -#undef vmbreak - -#define vmdispatch(x) goto *disptab[x]; - -#define vmcase(l) L_##l: - -#define vmbreak vmfetch(); vmdispatch(GET_OPCODE(i)); - - -static const void *const disptab[NUM_OPCODES] = { - -#if 0 -** you can update the following list with this command: -** -** sed -n '/^OP_/\!d; s/OP_/\&\&L_OP_/ ; s/,.*/,/ ; s/\/.*// ; p' lopcodes.h -** -#endif - -&&L_OP_MOVE, -&&L_OP_LOADI, -&&L_OP_LOADF, -&&L_OP_LOADK, -&&L_OP_LOADKX, -&&L_OP_LOADFALSE, -&&L_OP_LFALSESKIP, -&&L_OP_LOADTRUE, -&&L_OP_LOADNIL, -&&L_OP_GETUPVAL, -&&L_OP_SETUPVAL, -&&L_OP_GETTABUP, -&&L_OP_GETTABLE, -&&L_OP_GETI, -&&L_OP_GETFIELD, -&&L_OP_SETTABUP, -&&L_OP_SETTABLE, -&&L_OP_SETI, -&&L_OP_SETFIELD, -&&L_OP_NEWTABLE, -&&L_OP_SELF, -&&L_OP_ADDI, -&&L_OP_ADDK, -&&L_OP_SUBK, -&&L_OP_MULK, -&&L_OP_MODK, -&&L_OP_POWK, -&&L_OP_DIVK, -&&L_OP_IDIVK, -&&L_OP_BANDK, -&&L_OP_BORK, -&&L_OP_BXORK, -&&L_OP_SHRI, -&&L_OP_SHLI, -&&L_OP_ADD, -&&L_OP_SUB, -&&L_OP_MUL, -&&L_OP_MOD, -&&L_OP_POW, -&&L_OP_DIV, -&&L_OP_IDIV, -&&L_OP_BAND, -&&L_OP_BOR, -&&L_OP_BXOR, -&&L_OP_SHL, -&&L_OP_SHR, -&&L_OP_MMBIN, -&&L_OP_MMBINI, -&&L_OP_MMBINK, -&&L_OP_UNM, -&&L_OP_BNOT, -&&L_OP_NOT, -&&L_OP_LEN, -&&L_OP_CONCAT, -&&L_OP_CLOSE, -&&L_OP_TBC, -&&L_OP_JMP, -&&L_OP_EQ, -&&L_OP_LT, -&&L_OP_LE, -&&L_OP_EQK, -&&L_OP_EQI, -&&L_OP_LTI, -&&L_OP_LEI, -&&L_OP_GTI, -&&L_OP_GEI, -&&L_OP_TEST, -&&L_OP_TESTSET, -&&L_OP_CALL, -&&L_OP_TAILCALL, -&&L_OP_RETURN, -&&L_OP_RETURN0, -&&L_OP_RETURN1, -&&L_OP_FORLOOP, -&&L_OP_FORPREP, -&&L_OP_TFORPREP, -&&L_OP_TFORCALL, -&&L_OP_TFORLOOP, -&&L_OP_SETLIST, -&&L_OP_CLOSURE, -&&L_OP_VARARG, -&&L_OP_VARARGPREP, -&&L_OP_EXTRAARG - -}; - - -#endif - startfunc: - trap = L->hookmask; - returning: - cl = ci_func(ci); - k = cl->p->k; - pc = ci->u.l.savedpc; - if (l_unlikely(trap)) - trap = luaG_tracecall(L); - base = ci->func.p + 1; - - for (;;) { - Instruction i; - vmfetch(); - #if 0 - - printf("line: %d\n", luaG_getfuncline(cl->p, pcRel(pc, cl->p))); - #endif - lua_assert(base == ci->func.p + 1); - lua_assert(base <= L->top.p && L->top.p <= L->stack_last.p); - - lua_assert(isIT(i) || (cast_void(L->top.p = base), 1)); - vmdispatch (GET_OPCODE(i)) { - vmcase(OP_MOVE) { - StkId ra = RA(i); - setobjs2s(L, ra, RB(i)); - vmbreak; - } - vmcase(OP_LOADI) { - StkId ra = RA(i); - lua_Integer b = GETARG_sBx(i); - setivalue(s2v(ra), b); - vmbreak; - } - vmcase(OP_LOADF) { - StkId ra = RA(i); - int b = GETARG_sBx(i); - setfltvalue(s2v(ra), cast_num(b)); - vmbreak; - } - vmcase(OP_LOADK) { - StkId ra = RA(i); - TValue *rb = k + GETARG_Bx(i); - setobj2s(L, ra, rb); - vmbreak; - } - vmcase(OP_LOADKX) { - StkId ra = RA(i); - TValue *rb; - rb = k + GETARG_Ax(*pc); pc++; - setobj2s(L, ra, rb); - vmbreak; - } - vmcase(OP_LOADFALSE) { - StkId ra = RA(i); - setbfvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LFALSESKIP) { - StkId ra = RA(i); - setbfvalue(s2v(ra)); - pc++; - vmbreak; - } - vmcase(OP_LOADTRUE) { - StkId ra = RA(i); - setbtvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LOADNIL) { - StkId ra = RA(i); - int b = GETARG_B(i); - do { - setnilvalue(s2v(ra++)); - } while (b--); - vmbreak; - } - vmcase(OP_GETUPVAL) { - StkId ra = RA(i); - int b = GETARG_B(i); - setobj2s(L, ra, cl->upvals[b]->v.p); - vmbreak; - } - vmcase(OP_SETUPVAL) { - StkId ra = RA(i); - UpVal *uv = cl->upvals[GETARG_B(i)]; - setobj(L, uv->v.p, s2v(ra)); - luaC_barrier(L, uv, s2v(ra)); - vmbreak; - } - vmcase(OP_GETTABUP) { - StkId ra = RA(i); - TValue *upval = cl->upvals[GETARG_B(i)]->v.p; - TValue *rc = KC(i); - TString *key = tsvalue(rc); - int tag; - luaV_fastget(upval, key, s2v(ra), luaH_getshortstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, upval, rc, ra, tag)); - vmbreak; - } - vmcase(OP_GETTABLE) { - StkId ra = RA(i); - TValue *rb = vRB(i); - TValue *rc = vRC(i); - int tag; - if (ttisinteger(rc)) { - luaV_fastgeti(rb, ivalue(rc), s2v(ra), tag); - } - else - luaV_fastget(rb, rc, s2v(ra), luaH_get, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_GETI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int c = GETARG_C(i); - int tag; - luaV_fastgeti(rb, c, s2v(ra), tag); - if (tagisempty(tag)) { - TValue key; - setivalue(&key, c); - Protect(luaV_finishget(L, rb, &key, ra, tag)); - } - vmbreak; - } - vmcase(OP_GETFIELD) { - StkId ra = RA(i); - TValue *rb = vRB(i); - TValue *rc = KC(i); - TString *key = tsvalue(rc); - int tag; - luaV_fastget(rb, key, s2v(ra), luaH_getshortstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_SETTABUP) { - int hres; - TValue *upval = cl->upvals[GETARG_A(i)]->v.p; - TValue *rb = KB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rb); - luaV_fastset(upval, key, rc, hres, luaH_psetshortstr); - if (hres == HOK) - luaV_finishfastset(L, upval, rc); - else - Protect(luaV_finishset(L, upval, rb, rc, hres)); - vmbreak; - } - vmcase(OP_SETTABLE) { - StkId ra = RA(i); - int hres; - TValue *rb = vRB(i); - TValue *rc = RKC(i); - if (ttisinteger(rb)) { - luaV_fastseti(s2v(ra), ivalue(rb), rc, hres); - } - else { - luaV_fastset(s2v(ra), rb, rc, hres, luaH_pset); - } - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else - Protect(luaV_finishset(L, s2v(ra), rb, rc, hres)); - vmbreak; - } - vmcase(OP_SETI) { - StkId ra = RA(i); - int hres; - int b = GETARG_B(i); - TValue *rc = RKC(i); - luaV_fastseti(s2v(ra), b, rc, hres); - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else { - TValue key; - setivalue(&key, b); - Protect(luaV_finishset(L, s2v(ra), &key, rc, hres)); - } - vmbreak; - } - vmcase(OP_SETFIELD) { - StkId ra = RA(i); - int hres; - TValue *rb = KB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rb); - luaV_fastset(s2v(ra), key, rc, hres, luaH_psetshortstr); - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else - Protect(luaV_finishset(L, s2v(ra), rb, rc, hres)); - vmbreak; - } - vmcase(OP_NEWTABLE) { - StkId ra = RA(i); - int b = GETARG_B(i); - int c = GETARG_C(i); - Table *t; - if (b > 0) - b = 1 << (b - 1); - lua_assert((!TESTARG_k(i)) == (GETARG_Ax(*pc) == 0)); - if (TESTARG_k(i)) - c += GETARG_Ax(*pc) * (MAXARG_C + 1); - pc++; - L->top.p = ra + 1; - t = luaH_new(L); - sethvalue2s(L, ra, t); - if (b != 0 || c != 0) - luaH_resize(L, t, c, b); - checkGC(L, ra + 1); - vmbreak; - } - vmcase(OP_SELF) { - StkId ra = RA(i); - int tag; - TValue *rb = vRB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rc); - setobj2s(L, ra + 1, rb); - luaV_fastget(rb, key, s2v(ra), luaH_getstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_ADDI) { - op_arithI(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_ADDK) { - op_arithK(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_SUBK) { - op_arithK(L, l_subi, luai_numsub); - vmbreak; - } - vmcase(OP_MULK) { - op_arithK(L, l_muli, luai_nummul); - vmbreak; - } - vmcase(OP_MODK) { - savestate(L, ci); - op_arithK(L, luaV_mod, luaV_modf); - vmbreak; - } - vmcase(OP_POWK) { - op_arithfK(L, luai_numpow); - vmbreak; - } - vmcase(OP_DIVK) { - op_arithfK(L, luai_numdiv); - vmbreak; - } - vmcase(OP_IDIVK) { - savestate(L, ci); - op_arithK(L, luaV_idiv, luai_numidiv); - vmbreak; - } - vmcase(OP_BANDK) { - op_bitwiseK(L, l_band); - vmbreak; - } - vmcase(OP_BORK) { - op_bitwiseK(L, l_bor); - vmbreak; - } - vmcase(OP_BXORK) { - op_bitwiseK(L, l_bxor); - vmbreak; - } - vmcase(OP_SHRI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int ic = GETARG_sC(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - pc++; setivalue(s2v(ra), luaV_shiftl(ib, -ic)); - } - vmbreak; - } - vmcase(OP_SHLI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int ic = GETARG_sC(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - pc++; setivalue(s2v(ra), luaV_shiftl(ic, ib)); - } - vmbreak; - } - vmcase(OP_ADD) { - op_arith(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_SUB) { - op_arith(L, l_subi, luai_numsub); - vmbreak; - } - vmcase(OP_MUL) { - op_arith(L, l_muli, luai_nummul); - vmbreak; - } - vmcase(OP_MOD) { - savestate(L, ci); - op_arith(L, luaV_mod, luaV_modf); - vmbreak; - } - vmcase(OP_POW) { - op_arithf(L, luai_numpow); - vmbreak; - } - vmcase(OP_DIV) { - op_arithf(L, luai_numdiv); - vmbreak; - } - vmcase(OP_IDIV) { - savestate(L, ci); - op_arith(L, luaV_idiv, luai_numidiv); - vmbreak; - } - vmcase(OP_BAND) { - op_bitwise(L, l_band); - vmbreak; - } - vmcase(OP_BOR) { - op_bitwise(L, l_bor); - vmbreak; - } - vmcase(OP_BXOR) { - op_bitwise(L, l_bxor); - vmbreak; - } - vmcase(OP_SHR) { - op_bitwise(L, luaV_shiftr); - vmbreak; - } - vmcase(OP_SHL) { - op_bitwise(L, luaV_shiftl); - vmbreak; - } - vmcase(OP_MMBIN) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); - TValue *rb = vRB(i); - TMS tm = (TMS)GETARG_C(i); - StkId result = RA(pi); - lua_assert(OP_ADD <= GET_OPCODE(pi) && GET_OPCODE(pi) <= OP_SHR); - Protect(luaT_trybinTM(L, s2v(ra), rb, result, tm)); - vmbreak; - } - vmcase(OP_MMBINI) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); - int imm = GETARG_sB(i); - TMS tm = (TMS)GETARG_C(i); - int flip = GETARG_k(i); - StkId result = RA(pi); - Protect(luaT_trybiniTM(L, s2v(ra), imm, flip, result, tm)); - vmbreak; - } - vmcase(OP_MMBINK) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); - TValue *imm = KB(i); - TMS tm = (TMS)GETARG_C(i); - int flip = GETARG_k(i); - StkId result = RA(pi); - Protect(luaT_trybinassocTM(L, s2v(ra), imm, flip, result, tm)); - vmbreak; - } - vmcase(OP_UNM) { - StkId ra = RA(i); - TValue *rb = vRB(i); - lua_Number nb; - if (ttisinteger(rb)) { - lua_Integer ib = ivalue(rb); - setivalue(s2v(ra), intop(-, 0, ib)); - } - else if (tonumberns(rb, nb)) { - setfltvalue(s2v(ra), luai_numunm(L, nb)); - } - else - Protect(luaT_trybinTM(L, rb, rb, ra, TM_UNM)); - vmbreak; - } - vmcase(OP_BNOT) { - StkId ra = RA(i); - TValue *rb = vRB(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - setivalue(s2v(ra), intop(^, ~l_castS2U(0), ib)); - } - else - Protect(luaT_trybinTM(L, rb, rb, ra, TM_BNOT)); - vmbreak; - } - vmcase(OP_NOT) { - StkId ra = RA(i); - TValue *rb = vRB(i); - if (l_isfalse(rb)) - setbtvalue(s2v(ra)); - else - setbfvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LEN) { - StkId ra = RA(i); - Protect(luaV_objlen(L, ra, vRB(i))); - vmbreak; - } - vmcase(OP_CONCAT) { - StkId ra = RA(i); - int n = GETARG_B(i); - L->top.p = ra + n; - ProtectNT(luaV_concat(L, n)); - checkGC(L, L->top.p); - vmbreak; - } - vmcase(OP_CLOSE) { - StkId ra = RA(i); - Protect(luaF_close(L, ra, LUA_OK, 1)); - vmbreak; - } - vmcase(OP_TBC) { - StkId ra = RA(i); - - halfProtect(luaF_newtbcupval(L, ra)); - vmbreak; - } - vmcase(OP_JMP) { - dojump(ci, i, 0); - vmbreak; - } - vmcase(OP_EQ) { - StkId ra = RA(i); - int cond; - TValue *rb = vRB(i); - Protect(cond = luaV_equalobj(L, s2v(ra), rb)); - docondjump(); - vmbreak; - } - vmcase(OP_LT) { - op_order(L, l_lti, LTnum, lessthanothers); - vmbreak; - } - vmcase(OP_LE) { - op_order(L, l_lei, LEnum, lessequalothers); - vmbreak; - } - vmcase(OP_EQK) { - StkId ra = RA(i); - TValue *rb = KB(i); - - int cond = luaV_rawequalobj(s2v(ra), rb); - docondjump(); - vmbreak; - } - vmcase(OP_EQI) { - StkId ra = RA(i); - int cond; - int im = GETARG_sB(i); - if (ttisinteger(s2v(ra))) - cond = (ivalue(s2v(ra)) == im); - else if (ttisfloat(s2v(ra))) - cond = luai_numeq(fltvalue(s2v(ra)), cast_num(im)); - else - cond = 0; - docondjump(); - vmbreak; - } - vmcase(OP_LTI) { - op_orderI(L, l_lti, luai_numlt, 0, TM_LT); - vmbreak; - } - vmcase(OP_LEI) { - op_orderI(L, l_lei, luai_numle, 0, TM_LE); - vmbreak; - } - vmcase(OP_GTI) { - op_orderI(L, l_gti, luai_numgt, 1, TM_LT); - vmbreak; - } - vmcase(OP_GEI) { - op_orderI(L, l_gei, luai_numge, 1, TM_LE); - vmbreak; - } - vmcase(OP_TEST) { - StkId ra = RA(i); - int cond = !l_isfalse(s2v(ra)); - docondjump(); - vmbreak; - } - vmcase(OP_TESTSET) { - StkId ra = RA(i); - TValue *rb = vRB(i); - if (l_isfalse(rb) == GETARG_k(i)) - pc++; - else { - setobj2s(L, ra, rb); - donextjump(ci); - } - vmbreak; - } - vmcase(OP_CALL) { - StkId ra = RA(i); - CallInfo *newci; - int b = GETARG_B(i); - int nresults = GETARG_C(i) - 1; - if (b != 0) - L->top.p = ra + b; - - savepc(L); - if ((newci = luaD_precall(L, ra, nresults)) == NULL) - updatetrap(ci); - else { - ci = newci; - goto startfunc; - } - vmbreak; - } - vmcase(OP_TAILCALL) { - StkId ra = RA(i); - int b = GETARG_B(i); - int n; - int nparams1 = GETARG_C(i); - - int delta = (nparams1) ? ci->u.l.nextraargs + nparams1 : 0; - if (b != 0) - L->top.p = ra + b; - else - b = cast_int(L->top.p - ra); - savepc(ci); - if (TESTARG_k(i)) { - luaF_closeupval(L, base); - lua_assert(L->tbclist.p < base); - lua_assert(base == ci->func.p + 1); - } - if ((n = luaD_pretailcall(L, ci, ra, b, delta)) < 0) - goto startfunc; - else { - ci->func.p -= delta; - luaD_poscall(L, ci, n); - updatetrap(ci); - goto ret; - } - } - vmcase(OP_RETURN) { - StkId ra = RA(i); - int n = GETARG_B(i) - 1; - int nparams1 = GETARG_C(i); - if (n < 0) - n = cast_int(L->top.p - ra); - savepc(ci); - if (TESTARG_k(i)) { - ci->u2.nres = n; - if (L->top.p < ci->top.p) - L->top.p = ci->top.p; - luaF_close(L, base, CLOSEKTOP, 1); - updatetrap(ci); - updatestack(ci); - } - if (nparams1) - ci->func.p -= ci->u.l.nextraargs + nparams1; - L->top.p = ra + n; - luaD_poscall(L, ci, n); - updatetrap(ci); - goto ret; - } - vmcase(OP_RETURN0) { - if (l_unlikely(L->hookmask)) { - StkId ra = RA(i); - L->top.p = ra; - savepc(ci); - luaD_poscall(L, ci, 0); - trap = 1; - } - else { - int nres; - L->ci = ci->previous; - L->top.p = base - 1; - for (nres = ci->nresults; l_unlikely(nres > 0); nres--) - setnilvalue(s2v(L->top.p++)); - } - goto ret; - } - vmcase(OP_RETURN1) { - if (l_unlikely(L->hookmask)) { - StkId ra = RA(i); - L->top.p = ra + 1; - savepc(ci); - luaD_poscall(L, ci, 1); - trap = 1; - } - else { - int nres = ci->nresults; - L->ci = ci->previous; - if (nres == 0) - L->top.p = base - 1; - else { - StkId ra = RA(i); - setobjs2s(L, base - 1, ra); - L->top.p = base; - for (; l_unlikely(nres > 1); nres--) - setnilvalue(s2v(L->top.p++)); - } - } - ret: - if (ci->callstatus & CIST_FRESH) - return; - else { - ci = ci->previous; - goto returning; - } - } - vmcase(OP_FORLOOP) { - StkId ra = RA(i); - if (ttisinteger(s2v(ra + 1))) { - lua_Unsigned count = l_castS2U(ivalue(s2v(ra))); - if (count > 0) { - lua_Integer step = ivalue(s2v(ra + 1)); - lua_Integer idx = ivalue(s2v(ra + 2)); - chgivalue(s2v(ra), count - 1); - idx = intop(+, idx, step); - chgivalue(s2v(ra + 2), idx); - pc -= GETARG_Bx(i); - } - } - else if (floatforloop(ra)) - pc -= GETARG_Bx(i); - updatetrap(ci); - vmbreak; - } - vmcase(OP_FORPREP) { - StkId ra = RA(i); - savestate(L, ci); - if (forprep(L, ra)) - pc += GETARG_Bx(i) + 1; - vmbreak; - } - vmcase(OP_TFORPREP) { - - StkId ra = RA(i); - TValue temp; - setobj(L, &temp, s2v(ra + 3)); - setobjs2s(L, ra + 3, ra + 2); - setobj2s(L, ra + 2, &temp); - - halfProtect(luaF_newtbcupval(L, ra + 2)); - pc += GETARG_Bx(i); - i = *(pc++); - lua_assert(GET_OPCODE(i) == OP_TFORCALL && ra == RA(i)); - goto l_tforcall; - } - vmcase(OP_TFORCALL) { - l_tforcall: { - - StkId ra = RA(i); - setobjs2s(L, ra + 5, ra + 3); - setobjs2s(L, ra + 4, ra + 1); - setobjs2s(L, ra + 3, ra); - L->top.p = ra + 3 + 3; - ProtectNT(luaD_call(L, ra + 3, GETARG_C(i))); - updatestack(ci); - i = *(pc++); - lua_assert(GET_OPCODE(i) == OP_TFORLOOP && ra == RA(i)); - goto l_tforloop; - }} - vmcase(OP_TFORLOOP) { - l_tforloop: { - StkId ra = RA(i); - if (!ttisnil(s2v(ra + 3))) - pc -= GETARG_Bx(i); - vmbreak; - }} - vmcase(OP_SETLIST) { - StkId ra = RA(i); - int n = GETARG_B(i); - unsigned int last = GETARG_C(i); - Table *h = hvalue(s2v(ra)); - if (n == 0) - n = cast_int(L->top.p - ra) - 1; - else - L->top.p = ci->top.p; - last += n; - if (TESTARG_k(i)) { - last += GETARG_Ax(*pc) * (MAXARG_C + 1); - pc++; - } - if (last > luaH_realasize(h)) - luaH_resizearray(L, h, last); - for (; n > 0; n--) { - TValue *val = s2v(ra + n); - obj2arr(h, last, val); - last--; - luaC_barrierback(L, obj2gco(h), val); - } - vmbreak; - } - vmcase(OP_CLOSURE) { - StkId ra = RA(i); - Proto *p = cl->p->p[GETARG_Bx(i)]; - halfProtect(pushclosure(L, p, cl->upvals, base, ra)); - checkGC(L, ra + 1); - vmbreak; - } - vmcase(OP_VARARG) { - StkId ra = RA(i); - int n = GETARG_C(i) - 1; - Protect(luaT_getvarargs(L, ci, ra, n)); - vmbreak; - } - vmcase(OP_VARARGPREP) { - ProtectNT(luaT_adjustvarargs(L, GETARG_A(i), ci, cl->p)); - if (l_unlikely(trap)) { - luaD_hookcall(L, ci); - L->oldpc = 1; - } - updatebase(ci); - vmbreak; - } - vmcase(OP_EXTRAARG) { - lua_assert(0); - vmbreak; - } - } - } -} - - - -//path: src/imports/../dependencies/lua/lapi.c - - -#define lapi_c -#define LUA_CORE - - - - - -#include -#include -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -const char lua_ident[] = - "$LuaVersion: " LUA_COPYRIGHT " $" - "$LuaAuthors: " LUA_AUTHORS " $"; - - - - -#define isvalid(L, o) (!ttisnil(o) || o != &G(L)->nilvalue) - - - -#define ispseudo(i) ((i) <= LUA_REGISTRYINDEX) - - -#define isupvalue(i) ((i) < LUA_REGISTRYINDEX) - - - -static void advancegc (lua_State *L, size_t delta) { - delta >>= 5; - if (delta > 0) { - global_State *g = G(L); - luaE_setdebt(g, g->GCdebt - delta); - } -} - - - -static TValue *index2value (lua_State *L, int idx) { - CallInfo *ci = L->ci; - if (idx > 0) { - StkId o = ci->func.p + idx; - api_check(L, idx <= ci->top.p - (ci->func.p + 1), "unacceptable index"); - if (o >= L->top.p) return &G(L)->nilvalue; - else return s2v(o); - } - else if (!ispseudo(idx)) { - api_check(L, idx != 0 && -idx <= L->top.p - (ci->func.p + 1), - "invalid index"); - return s2v(L->top.p + idx); - } - else if (idx == LUA_REGISTRYINDEX) - return &G(L)->l_registry; - else { - idx = LUA_REGISTRYINDEX - idx; - api_check(L, idx <= MAXUPVAL + 1, "upvalue index too large"); - if (ttisCclosure(s2v(ci->func.p))) { - CClosure *func = clCvalue(s2v(ci->func.p)); - return (idx <= func->nupvalues) ? &func->upvalue[idx-1] - : &G(L)->nilvalue; - } - else { - api_check(L, ttislcf(s2v(ci->func.p)), "caller not a C function"); - return &G(L)->nilvalue; - } - } -} - - - - -static StkId index2stack (lua_State *L, int idx) { - CallInfo *ci = L->ci; - if (idx > 0) { - StkId o = ci->func.p + idx; - api_check(L, o < L->top.p, "invalid index"); - return o; - } - else { - api_check(L, idx != 0 && -idx <= L->top.p - (ci->func.p + 1), - "invalid index"); - api_check(L, !ispseudo(idx), "invalid index"); - return L->top.p + idx; - } -} - - -LUA_API int lua_checkstack (lua_State *L, int n) { - int res; - CallInfo *ci; - lua_lock(L); - ci = L->ci; - api_check(L, n >= 0, "negative 'n'"); - if (L->stack_last.p - L->top.p > n) - res = 1; - else - res = luaD_growstack(L, n, 0); - if (res && ci->top.p < L->top.p + n) - ci->top.p = L->top.p + n; - lua_unlock(L); - return res; -} - - -LUA_API void lua_xmove (lua_State *from, lua_State *to, int n) { - int i; - if (from == to) return; - lua_lock(to); - api_checkpop(from, n); - api_check(from, G(from) == G(to), "moving among independent states"); - api_check(from, to->ci->top.p - to->top.p >= n, "stack overflow"); - from->top.p -= n; - for (i = 0; i < n; i++) { - setobjs2s(to, to->top.p, from->top.p + i); - to->top.p++; - } - lua_unlock(to); -} - - -LUA_API lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf) { - lua_CFunction old; - lua_lock(L); - old = G(L)->panic; - G(L)->panic = panicf; - lua_unlock(L); - return old; -} - - -LUA_API lua_Number lua_version (lua_State *L) { - UNUSED(L); - return LUA_VERSION_NUM; -} - - - - - - - -LUA_API int lua_absindex (lua_State *L, int idx) { - return (idx > 0 || ispseudo(idx)) - ? idx - : cast_int(L->top.p - L->ci->func.p) + idx; -} - - -LUA_API int lua_gettop (lua_State *L) { - return cast_int(L->top.p - (L->ci->func.p + 1)); -} - - -LUA_API void lua_settop (lua_State *L, int idx) { - CallInfo *ci; - StkId func, newtop; - ptrdiff_t diff; - lua_lock(L); - ci = L->ci; - func = ci->func.p; - if (idx >= 0) { - api_check(L, idx <= ci->top.p - (func + 1), "new top too large"); - diff = ((func + 1) + idx) - L->top.p; - for (; diff > 0; diff--) - setnilvalue(s2v(L->top.p++)); - } - else { - api_check(L, -(idx+1) <= (L->top.p - (func + 1)), "invalid new top"); - diff = idx + 1; - } - newtop = L->top.p + diff; - if (diff < 0 && L->tbclist.p >= newtop) { - lua_assert(hastocloseCfunc(ci->nresults)); - newtop = luaF_close(L, newtop, CLOSEKTOP, 0); - } - L->top.p = newtop; - lua_unlock(L); -} - - -LUA_API void lua_closeslot (lua_State *L, int idx) { - StkId level; - lua_lock(L); - level = index2stack(L, idx); - api_check(L, hastocloseCfunc(L->ci->nresults) && L->tbclist.p == level, - "no variable to close at given level"); - level = luaF_close(L, level, CLOSEKTOP, 0); - setnilvalue(s2v(level)); - lua_unlock(L); -} - - - -static void reverse (lua_State *L, StkId from, StkId to) { - for (; from < to; from++, to--) { - TValue temp; - setobj(L, &temp, s2v(from)); - setobjs2s(L, from, to); - setobj2s(L, to, &temp); - } -} - - - -LUA_API void lua_rotate (lua_State *L, int idx, int n) { - StkId p, t, m; - lua_lock(L); - t = L->top.p - 1; - p = index2stack(L, idx); - api_check(L, L->tbclist.p < p, "moving a to-be-closed slot"); - api_check(L, (n >= 0 ? n : -n) <= (t - p + 1), "invalid 'n'"); - m = (n >= 0 ? t - n : p - n - 1); - reverse(L, p, m); - reverse(L, m + 1, t); - reverse(L, p, t); - lua_unlock(L); -} - - -LUA_API void lua_copy (lua_State *L, int fromidx, int toidx) { - TValue *fr, *to; - lua_lock(L); - fr = index2value(L, fromidx); - to = index2value(L, toidx); - api_check(L, isvalid(L, to), "invalid index"); - setobj(L, to, fr); - if (isupvalue(toidx)) - luaC_barrier(L, clCvalue(s2v(L->ci->func.p)), fr); - - lua_unlock(L); -} - - -LUA_API void lua_pushvalue (lua_State *L, int idx) { - lua_lock(L); - setobj2s(L, L->top.p, index2value(L, idx)); - api_incr_top(L); - lua_unlock(L); -} - - - - - - -LUA_API int lua_type (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (isvalid(L, o) ? ttype(o) : LUA_TNONE); -} - - -LUA_API const char *lua_typename (lua_State *L, int t) { - UNUSED(L); - api_check(L, LUA_TNONE <= t && t < LUA_NUMTYPES, "invalid type"); - return ttypename(t); -} - - -LUA_API int lua_iscfunction (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttislcf(o) || (ttisCclosure(o))); -} - - -LUA_API int lua_isinteger (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return ttisinteger(o); -} - - -LUA_API int lua_isnumber (lua_State *L, int idx) { - lua_Number n; - const TValue *o = index2value(L, idx); - return tonumber(o, &n); -} - - -LUA_API int lua_isstring (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttisstring(o) || cvt2str(o)); -} - - -LUA_API int lua_isuserdata (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttisfulluserdata(o) || ttislightuserdata(o)); -} - - -LUA_API int lua_rawequal (lua_State *L, int index1, int index2) { - const TValue *o1 = index2value(L, index1); - const TValue *o2 = index2value(L, index2); - return (isvalid(L, o1) && isvalid(L, o2)) ? luaV_rawequalobj(o1, o2) : 0; -} - - -LUA_API void lua_arith (lua_State *L, int op) { - lua_lock(L); - if (op != LUA_OPUNM && op != LUA_OPBNOT) - api_checkpop(L, 2); - else { - api_checkpop(L, 1); - setobjs2s(L, L->top.p, L->top.p - 1); - api_incr_top(L); - } - - luaO_arith(L, op, s2v(L->top.p - 2), s2v(L->top.p - 1), L->top.p - 2); - L->top.p--; - lua_unlock(L); -} - - -LUA_API int lua_compare (lua_State *L, int index1, int index2, int op) { - const TValue *o1; - const TValue *o2; - int i = 0; - lua_lock(L); - o1 = index2value(L, index1); - o2 = index2value(L, index2); - if (isvalid(L, o1) && isvalid(L, o2)) { - switch (op) { - case LUA_OPEQ: i = luaV_equalobj(L, o1, o2); break; - case LUA_OPLT: i = luaV_lessthan(L, o1, o2); break; - case LUA_OPLE: i = luaV_lessequal(L, o1, o2); break; - default: api_check(L, 0, "invalid option"); - } - } - lua_unlock(L); - return i; -} - - -LUA_API size_t lua_stringtonumber (lua_State *L, const char *s) { - size_t sz = luaO_str2num(s, s2v(L->top.p)); - if (sz != 0) - api_incr_top(L); - return sz; -} - - -LUA_API lua_Number lua_tonumberx (lua_State *L, int idx, int *pisnum) { - lua_Number n = 0; - const TValue *o = index2value(L, idx); - int isnum = tonumber(o, &n); - if (pisnum) - *pisnum = isnum; - return n; -} - - -LUA_API lua_Integer lua_tointegerx (lua_State *L, int idx, int *pisnum) { - lua_Integer res = 0; - const TValue *o = index2value(L, idx); - int isnum = tointeger(o, &res); - if (pisnum) - *pisnum = isnum; - return res; -} - - -LUA_API int lua_toboolean (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return !l_isfalse(o); -} - - -LUA_API const char *lua_tolstring (lua_State *L, int idx, size_t *len) { - TValue *o; - lua_lock(L); - o = index2value(L, idx); - if (!ttisstring(o)) { - if (!cvt2str(o)) { - if (len != NULL) *len = 0; - lua_unlock(L); - return NULL; - } - luaO_tostring(L, o); - luaC_checkGC(L); - o = index2value(L, idx); - } - lua_unlock(L); - if (len != NULL) - return getlstr(tsvalue(o), *len); - else - return getstr(tsvalue(o)); -} - - -LUA_API lua_Unsigned lua_rawlen (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - switch (ttypetag(o)) { - case LUA_VSHRSTR: return tsvalue(o)->shrlen; - case LUA_VLNGSTR: return tsvalue(o)->u.lnglen; - case LUA_VUSERDATA: return uvalue(o)->len; - case LUA_VTABLE: return luaH_getn(hvalue(o)); - default: return 0; - } -} - - -LUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - if (ttislcf(o)) return fvalue(o); - else if (ttisCclosure(o)) - return clCvalue(o)->f; - else return NULL; -} - - -l_sinline void *touserdata (const TValue *o) { - switch (ttype(o)) { - case LUA_TUSERDATA: return getudatamem(uvalue(o)); - case LUA_TLIGHTUSERDATA: return pvalue(o); - default: return NULL; - } -} - - -LUA_API void *lua_touserdata (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return touserdata(o); -} - - -LUA_API lua_State *lua_tothread (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (!ttisthread(o)) ? NULL : thvalue(o); -} - - - -LUA_API const void *lua_topointer (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - switch (ttypetag(o)) { - case LUA_VLCF: return cast_voidp(cast_sizet(fvalue(o))); - case LUA_VUSERDATA: case LUA_VLIGHTUSERDATA: - return touserdata(o); - default: { - if (iscollectable(o)) - return gcvalue(o); - else - return NULL; - } - } -} - - - - - - -LUA_API void lua_pushnil (lua_State *L) { - lua_lock(L); - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushnumber (lua_State *L, lua_Number n) { - lua_lock(L); - setfltvalue(s2v(L->top.p), n); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushinteger (lua_State *L, lua_Integer n) { - lua_lock(L); - setivalue(s2v(L->top.p), n); - api_incr_top(L); - lua_unlock(L); -} - - - -LUA_API const char *lua_pushlstring (lua_State *L, const char *s, size_t len) { - TString *ts; - lua_lock(L); - ts = (len == 0) ? luaS_new(L, "") : luaS_newlstr(L, s, len); - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - advancegc(L, len); - luaC_checkGC(L); - lua_unlock(L); - return getstr(ts); -} - - -LUA_API const char *lua_pushextlstring (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud) { - TString *ts; - lua_lock(L); - api_check(L, s[len] == '\0', "string not ending with zero"); - ts = luaS_newextlstr (L, s, len, falloc, ud); - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - if (falloc != NULL) - advancegc(L, len); - luaC_checkGC(L); - lua_unlock(L); - return getstr(ts); -} - - -LUA_API const char *lua_pushstring (lua_State *L, const char *s) { - lua_lock(L); - if (s == NULL) - setnilvalue(s2v(L->top.p)); - else { - TString *ts; - ts = luaS_new(L, s); - setsvalue2s(L, L->top.p, ts); - s = getstr(ts); - } - api_incr_top(L); - luaC_checkGC(L); - lua_unlock(L); - return s; -} - - -LUA_API const char *lua_pushvfstring (lua_State *L, const char *fmt, - va_list argp) { - const char *ret; - lua_lock(L); - ret = luaO_pushvfstring(L, fmt, argp); - luaC_checkGC(L); - lua_unlock(L); - return ret; -} - - -LUA_API const char *lua_pushfstring (lua_State *L, const char *fmt, ...) { - const char *ret; - va_list argp; - lua_lock(L); - va_start(argp, fmt); - ret = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - luaC_checkGC(L); - lua_unlock(L); - return ret; -} - - -LUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) { - lua_lock(L); - if (n == 0) { - setfvalue(s2v(L->top.p), fn); - api_incr_top(L); - } - else { - int i; - CClosure *cl; - api_checkpop(L, n); - api_check(L, n <= MAXUPVAL, "upvalue index too large"); - cl = luaF_newCclosure(L, n); - cl->f = fn; - for (i = 0; i < n; i++) { - setobj2n(L, &cl->upvalue[i], s2v(L->top.p - n + i)); - - lua_assert(iswhite(cl)); - } - L->top.p -= n; - setclCvalue(L, s2v(L->top.p), cl); - api_incr_top(L); - luaC_checkGC(L); - } - lua_unlock(L); -} - - -LUA_API void lua_pushboolean (lua_State *L, int b) { - lua_lock(L); - if (b) - setbtvalue(s2v(L->top.p)); - else - setbfvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushlightuserdata (lua_State *L, void *p) { - lua_lock(L); - setpvalue(s2v(L->top.p), p); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API int lua_pushthread (lua_State *L) { - lua_lock(L); - setthvalue(L, s2v(L->top.p), L); - api_incr_top(L); - lua_unlock(L); - return (G(L)->mainthread == L); -} - - - - - - -static int auxgetstr (lua_State *L, const TValue *t, const char *k) { - int tag; - TString *str = luaS_new(L, k); - luaV_fastget(t, str, s2v(L->top.p), luaH_getstr, tag); - if (!tagisempty(tag)) { - api_incr_top(L); - } - else { - setsvalue2s(L, L->top.p, str); - api_incr_top(L); - tag = luaV_finishget(L, t, s2v(L->top.p - 1), L->top.p - 1, tag); - } - lua_unlock(L); - return novariant(tag); -} - - -static void getGlobalTable (lua_State *L, TValue *gt) { - Table *registry = hvalue(&G(L)->l_registry); - int tag = luaH_getint(registry, LUA_RIDX_GLOBALS, gt); - (void)tag; - api_check(L, novariant(tag) == LUA_TTABLE, "global table must exist"); -} - - -LUA_API int lua_getglobal (lua_State *L, const char *name) { - TValue gt; - lua_lock(L); - getGlobalTable(L, >); - return auxgetstr(L, >, name); -} - - -LUA_API int lua_gettable (lua_State *L, int idx) { - int tag; - TValue *t; - lua_lock(L); - api_checkpop(L, 1); - t = index2value(L, idx); - luaV_fastget(t, s2v(L->top.p - 1), s2v(L->top.p - 1), luaH_get, tag); - if (tagisempty(tag)) - tag = luaV_finishget(L, t, s2v(L->top.p - 1), L->top.p - 1, tag); - lua_unlock(L); - return novariant(tag); -} - - -LUA_API int lua_getfield (lua_State *L, int idx, const char *k) { - lua_lock(L); - return auxgetstr(L, index2value(L, idx), k); -} - - -LUA_API int lua_geti (lua_State *L, int idx, lua_Integer n) { - TValue *t; - int tag; - lua_lock(L); - t = index2value(L, idx); - luaV_fastgeti(t, n, s2v(L->top.p), tag); - if (tagisempty(tag)) { - TValue key; - setivalue(&key, n); - tag = luaV_finishget(L, t, &key, L->top.p, tag); - } - api_incr_top(L); - lua_unlock(L); - return novariant(tag); -} - - -static int finishrawget (lua_State *L, int tag) { - if (tagisempty(tag)) - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); - return novariant(tag); -} - - -l_sinline Table *gettable (lua_State *L, int idx) { - TValue *t = index2value(L, idx); - api_check(L, ttistable(t), "table expected"); - return hvalue(t); -} - - -LUA_API int lua_rawget (lua_State *L, int idx) { - Table *t; - int tag; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - tag = luaH_get(t, s2v(L->top.p - 1), s2v(L->top.p - 1)); - L->top.p--; - return finishrawget(L, tag); -} - - -LUA_API int lua_rawgeti (lua_State *L, int idx, lua_Integer n) { - Table *t; - int tag; - lua_lock(L); - t = gettable(L, idx); - luaH_fastgeti(t, n, s2v(L->top.p), tag); - return finishrawget(L, tag); -} - - -LUA_API int lua_rawgetp (lua_State *L, int idx, const void *p) { - Table *t; - TValue k; - lua_lock(L); - t = gettable(L, idx); - setpvalue(&k, cast_voidp(p)); - return finishrawget(L, luaH_get(t, &k, s2v(L->top.p))); -} - - -LUA_API void lua_createtable (lua_State *L, unsigned narray, unsigned nrec) { - Table *t; - lua_lock(L); - t = luaH_new(L); - sethvalue2s(L, L->top.p, t); - api_incr_top(L); - if (narray > 0 || nrec > 0) - luaH_resize(L, t, narray, nrec); - luaC_checkGC(L); - lua_unlock(L); -} - - -LUA_API int lua_getmetatable (lua_State *L, int objindex) { - const TValue *obj; - Table *mt; - int res = 0; - lua_lock(L); - obj = index2value(L, objindex); - switch (ttype(obj)) { - case LUA_TTABLE: - mt = hvalue(obj)->metatable; - break; - case LUA_TUSERDATA: - mt = uvalue(obj)->metatable; - break; - default: - mt = G(L)->mt[ttype(obj)]; - break; - } - if (mt != NULL) { - sethvalue2s(L, L->top.p, mt); - api_incr_top(L); - res = 1; - } - lua_unlock(L); - return res; -} - - -LUA_API int lua_getiuservalue (lua_State *L, int idx, int n) { - TValue *o; - int t; - lua_lock(L); - o = index2value(L, idx); - api_check(L, ttisfulluserdata(o), "full userdata expected"); - if (n <= 0 || n > uvalue(o)->nuvalue) { - setnilvalue(s2v(L->top.p)); - t = LUA_TNONE; - } - else { - setobj2s(L, L->top.p, &uvalue(o)->uv[n - 1].uv); - t = ttype(s2v(L->top.p)); - } - api_incr_top(L); - lua_unlock(L); - return t; -} - - - - - -static void auxsetstr (lua_State *L, const TValue *t, const char *k) { - int hres; - TString *str = luaS_new(L, k); - api_checkpop(L, 1); - luaV_fastset(t, str, s2v(L->top.p - 1), hres, luaH_psetstr); - if (hres == HOK) { - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - L->top.p--; - } - else { - setsvalue2s(L, L->top.p, str); - api_incr_top(L); - luaV_finishset(L, t, s2v(L->top.p - 1), s2v(L->top.p - 2), hres); - L->top.p -= 2; - } - lua_unlock(L); -} - - -LUA_API void lua_setglobal (lua_State *L, const char *name) { - TValue gt; - lua_lock(L); - getGlobalTable(L, >); - auxsetstr(L, >, name); -} - - -LUA_API void lua_settable (lua_State *L, int idx) { - TValue *t; - int hres; - lua_lock(L); - api_checkpop(L, 2); - t = index2value(L, idx); - luaV_fastset(t, s2v(L->top.p - 2), s2v(L->top.p - 1), hres, luaH_pset); - if (hres == HOK) { - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - } - else - luaV_finishset(L, t, s2v(L->top.p - 2), s2v(L->top.p - 1), hres); - L->top.p -= 2; - lua_unlock(L); -} - - -LUA_API void lua_setfield (lua_State *L, int idx, const char *k) { - lua_lock(L); - auxsetstr(L, index2value(L, idx), k); -} - - -LUA_API void lua_seti (lua_State *L, int idx, lua_Integer n) { - TValue *t; - int hres; - lua_lock(L); - api_checkpop(L, 1); - t = index2value(L, idx); - luaV_fastseti(t, n, s2v(L->top.p - 1), hres); - if (hres == HOK) - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - else { - TValue temp; - setivalue(&temp, n); - luaV_finishset(L, t, &temp, s2v(L->top.p - 1), hres); - } - L->top.p--; - lua_unlock(L); -} - - -static void aux_rawset (lua_State *L, int idx, TValue *key, int n) { - Table *t; - lua_lock(L); - api_checkpop(L, n); - t = gettable(L, idx); - luaH_set(L, t, key, s2v(L->top.p - 1)); - invalidateTMcache(t); - luaC_barrierback(L, obj2gco(t), s2v(L->top.p - 1)); - L->top.p -= n; - lua_unlock(L); -} - - -LUA_API void lua_rawset (lua_State *L, int idx) { - aux_rawset(L, idx, s2v(L->top.p - 2), 2); -} - - -LUA_API void lua_rawsetp (lua_State *L, int idx, const void *p) { - TValue k; - setpvalue(&k, cast_voidp(p)); - aux_rawset(L, idx, &k, 1); -} - - -LUA_API void lua_rawseti (lua_State *L, int idx, lua_Integer n) { - Table *t; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - luaH_setint(L, t, n, s2v(L->top.p - 1)); - luaC_barrierback(L, obj2gco(t), s2v(L->top.p - 1)); - L->top.p--; - lua_unlock(L); -} - - -LUA_API int lua_setmetatable (lua_State *L, int objindex) { - TValue *obj; - Table *mt; - lua_lock(L); - api_checkpop(L, 1); - obj = index2value(L, objindex); - if (ttisnil(s2v(L->top.p - 1))) - mt = NULL; - else { - api_check(L, ttistable(s2v(L->top.p - 1)), "table expected"); - mt = hvalue(s2v(L->top.p - 1)); - } - switch (ttype(obj)) { - case LUA_TTABLE: { - hvalue(obj)->metatable = mt; - if (mt) { - luaC_objbarrier(L, gcvalue(obj), mt); - luaC_checkfinalizer(L, gcvalue(obj), mt); - } - break; - } - case LUA_TUSERDATA: { - uvalue(obj)->metatable = mt; - if (mt) { - luaC_objbarrier(L, uvalue(obj), mt); - luaC_checkfinalizer(L, gcvalue(obj), mt); - } - break; - } - default: { - G(L)->mt[ttype(obj)] = mt; - break; - } - } - L->top.p--; - lua_unlock(L); - return 1; -} - - -LUA_API int lua_setiuservalue (lua_State *L, int idx, int n) { - TValue *o; - int res; - lua_lock(L); - api_checkpop(L, 1); - o = index2value(L, idx); - api_check(L, ttisfulluserdata(o), "full userdata expected"); - if (!(cast_uint(n) - 1u < cast_uint(uvalue(o)->nuvalue))) - res = 0; - else { - setobj(L, &uvalue(o)->uv[n - 1].uv, s2v(L->top.p - 1)); - luaC_barrierback(L, gcvalue(o), s2v(L->top.p - 1)); - res = 1; - } - L->top.p--; - lua_unlock(L); - return res; -} - - - - - -#define checkresults(L,na,nr) \ - api_check(L, (nr) == LUA_MULTRET \ - || (L->ci->top.p - L->top.p >= (nr) - (na)), \ - "results from function overflow current stack size") - - -LUA_API void lua_callk (lua_State *L, int nargs, int nresults, - lua_KContext ctx, lua_KFunction k) { - StkId func; - lua_lock(L); - api_check(L, k == NULL || !isLua(L->ci), - "cannot use continuations inside hooks"); - api_checkpop(L, nargs + 1); - api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); - checkresults(L, nargs, nresults); - func = L->top.p - (nargs+1); - if (k != NULL && yieldable(L)) { - L->ci->u.c.k = k; - L->ci->u.c.ctx = ctx; - luaD_call(L, func, nresults); - } - else - luaD_callnoyield(L, func, nresults); - adjustresults(L, nresults); - lua_unlock(L); -} - - - - -struct CallS { - StkId func; - int nresults; -}; - - -static void f_call (lua_State *L, void *ud) { - struct CallS *c = cast(struct CallS *, ud); - luaD_callnoyield(L, c->func, c->nresults); -} - - - -LUA_API int lua_pcallk (lua_State *L, int nargs, int nresults, int errfunc, - lua_KContext ctx, lua_KFunction k) { - struct CallS c; - int status; - ptrdiff_t func; - lua_lock(L); - api_check(L, k == NULL || !isLua(L->ci), - "cannot use continuations inside hooks"); - api_checkpop(L, nargs + 1); - api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); - checkresults(L, nargs, nresults); - if (errfunc == 0) - func = 0; - else { - StkId o = index2stack(L, errfunc); - api_check(L, ttisfunction(s2v(o)), "private_lua_error handler must be a function"); - func = savestack(L, o); - } - c.func = L->top.p - (nargs+1); - if (k == NULL || !yieldable(L)) { - c.nresults = nresults; - status = luaD_pcall(L, f_call, &c, savestack(L, c.func), func); - } - else { - CallInfo *ci = L->ci; - ci->u.c.k = k; - ci->u.c.ctx = ctx; - - ci->u2.funcidx = cast_int(savestack(L, c.func)); - ci->u.c.old_errfunc = L->errfunc; - L->errfunc = func; - setoah(ci->callstatus, L->allowhook); - ci->callstatus |= CIST_YPCALL; - luaD_call(L, c.func, nresults); - ci->callstatus &= ~CIST_YPCALL; - L->errfunc = ci->u.c.old_errfunc; - status = LUA_OK; - } - adjustresults(L, nresults); - lua_unlock(L); - return status; -} - - -LUA_API int lua_load (lua_State *L, lua_Reader reader, void *data, - const char *chunkname, const char *mode) { - ZIO z; - int status; - lua_lock(L); - if (!chunkname) chunkname = "?"; - luaZ_init(L, &z, reader, data); - status = luaD_protectedparser(L, &z, chunkname, mode); - if (status == LUA_OK) { - LClosure *f = clLvalue(s2v(L->top.p - 1)); - if (f->nupvalues >= 1) { - - TValue gt; - getGlobalTable(L, >); - - setobj(L, f->upvals[0]->v.p, >); - luaC_barrier(L, f->upvals[0], >); - } - } - lua_unlock(L); - return status; -} - - - -LUA_API int lua_dump (lua_State *L, lua_Writer writer, void *data, int strip) { - int status; - ptrdiff_t otop = savestack(L, L->top.p); - TValue *f = s2v(L->top.p - 1); - lua_lock(L); - api_checkpop(L, 1); - api_check(L, isLfunction(f), "Lua function expected"); - status = luaU_dump(L, clLvalue(f)->p, writer, data, strip); - L->top.p = restorestack(L, otop); - lua_unlock(L); - return status; -} - - -LUA_API int lua_status (lua_State *L) { - return L->status; -} - - - -LUA_API int lua_gc (lua_State *L, int what, ...) { - va_list argp; - int res = 0; - global_State *g = G(L); - if (g->gcstp & (GCSTPGC | GCSTPCLS)) - return -1; - lua_lock(L); - va_start(argp, what); - switch (what) { - case LUA_GCSTOP: { - g->gcstp = GCSTPUSR; - break; - } - case LUA_GCRESTART: { - luaE_setdebt(g, 0); - g->gcstp = 0; - break; - } - case LUA_GCCOLLECT: { - luaC_fullgc(L, 0); - break; - } - case LUA_GCCOUNT: { - - res = cast_int(g->totalbytes >> 10); - break; - } - case LUA_GCCOUNTB: { - res = cast_int(g->totalbytes & 0x3ff); - break; - } - case LUA_GCSTEP: { - lu_byte oldstp = g->gcstp; - l_obj n = va_arg(argp, int); - int work = 0; - g->gcstp = 0; - if (n <= 0) - n = g->GCdebt; - luaE_setdebt(g, g->GCdebt - n); - luaC_condGC(L, (void)0, work = 1); - if (work && g->gcstate == GCSpause) - res = 1; - g->gcstp = oldstp; - break; - } - case LUA_GCISRUNNING: { - res = gcrunning(g); - break; - } - case LUA_GCGEN: { - res = (g->gckind == KGC_INC) ? LUA_GCINC : LUA_GCGEN; - luaC_changemode(L, KGC_GENMINOR); - break; - } - case LUA_GCINC: { - res = (g->gckind == KGC_INC) ? LUA_GCINC : LUA_GCGEN; - luaC_changemode(L, KGC_INC); - break; - } - case LUA_GCPARAM: { - int param = va_arg(argp, int); - int value = va_arg(argp, int); - api_check(L, 0 <= param && param < LUA_GCPN, "invalid parameter"); - res = cast_int(luaO_applyparam(g->gcparams[param], 100)); - if (value >= 0) - g->gcparams[param] = luaO_codeparam(value); - break; - } - default: res = -1; - } - va_end(argp); - lua_unlock(L); - return res; -} - - - - - - -LUA_API int lua_error (lua_State *L) { - TValue *errobj; - lua_lock(L); - errobj = s2v(L->top.p - 1); - api_checkpop(L, 1); - - if (ttisshrstring(errobj) && eqshrstr(tsvalue(errobj), G(L)->memerrmsg)) - luaM_error(L); - else - luaG_errormsg(L); - - return 0; -} - - -LUA_API int lua_next (lua_State *L, int idx) { - Table *t; - int more; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - more = luaH_next(L, t, L->top.p - 1); - if (more) - api_incr_top(L); - else - L->top.p--; - lua_unlock(L); - return more; -} - - -LUA_API void lua_toclose (lua_State *L, int idx) { - int nresults; - StkId o; - lua_lock(L); - o = index2stack(L, idx); - nresults = L->ci->nresults; - api_check(L, L->tbclist.p < o, "given index below or equal a marked one"); - luaF_newtbcupval(L, o); - if (!hastocloseCfunc(nresults)) - L->ci->nresults = codeNresults(nresults); - lua_assert(hastocloseCfunc(L->ci->nresults)); - lua_unlock(L); -} - - -LUA_API void lua_concat (lua_State *L, int n) { - lua_lock(L); - api_checknelems(L, n); - if (n > 0) { - luaV_concat(L, n); - luaC_checkGC(L); - } - else { - setsvalue2s(L, L->top.p, luaS_newlstr(L, "", 0)); - api_incr_top(L); - } - lua_unlock(L); -} - - -LUA_API void lua_len (lua_State *L, int idx) { - TValue *t; - lua_lock(L); - t = index2value(L, idx); - luaV_objlen(L, L->top.p, t); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API lua_Alloc lua_getallocf (lua_State *L, void **ud) { - lua_Alloc f; - lua_lock(L); - if (ud) *ud = G(L)->ud; - f = G(L)->frealloc; - lua_unlock(L); - return f; -} - - -LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud) { - lua_lock(L); - G(L)->ud = ud; - G(L)->frealloc = f; - lua_unlock(L); -} - - -void lua_setwarnf (lua_State *L, lua_WarnFunction f, void *ud) { - lua_lock(L); - G(L)->ud_warn = ud; - G(L)->warnf = f; - lua_unlock(L); -} - - -void lua_warning (lua_State *L, const char *msg, int tocont) { - lua_lock(L); - luaE_warning(L, msg, tocont); - lua_unlock(L); -} - - - -LUA_API void *lua_newuserdatauv (lua_State *L, size_t size, int nuvalue) { - Udata *u; - lua_lock(L); - api_check(L, 0 <= nuvalue && nuvalue < USHRT_MAX, "invalid value"); - u = luaS_newudata(L, size, nuvalue); - setuvalue(L, s2v(L->top.p), u); - api_incr_top(L); - advancegc(L, size); - luaC_checkGC(L); - lua_unlock(L); - return getudatamem(u); -} - - - -static const char *aux_upvalue (TValue *fi, int n, TValue **val, - GCObject **owner) { - switch (ttypetag(fi)) { - case LUA_VCCL: { - CClosure *f = clCvalue(fi); - if (!(cast_uint(n) - 1u < cast_uint(f->nupvalues))) - return NULL; - *val = &f->upvalue[n-1]; - if (owner) *owner = obj2gco(f); - return ""; - } - case LUA_VLCL: { - LClosure *f = clLvalue(fi); - TString *name; - Proto *p = f->p; - if (!(cast_uint(n) - 1u < cast_uint(p->sizeupvalues))) - return NULL; - *val = f->upvals[n-1]->v.p; - if (owner) *owner = obj2gco(f->upvals[n - 1]); - name = p->upvalues[n-1].name; - return (name == NULL) ? "(no name)" : getstr(name); - } - default: return NULL; - } -} - - -LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n) { - const char *name; - TValue *val = NULL; - lua_lock(L); - name = aux_upvalue(index2value(L, funcindex), n, &val, NULL); - if (name) { - setobj2s(L, L->top.p, val); - api_incr_top(L); - } - lua_unlock(L); - return name; -} - - -LUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n) { - const char *name; - TValue *val = NULL; - GCObject *owner = NULL; - TValue *fi; - lua_lock(L); - fi = index2value(L, funcindex); - api_checknelems(L, 1); - name = aux_upvalue(fi, n, &val, &owner); - if (name) { - L->top.p--; - setobj(L, val, s2v(L->top.p)); - luaC_barrier(L, owner, val); - } - lua_unlock(L); - return name; -} - - -static UpVal **getupvalref (lua_State *L, int fidx, int n, LClosure **pf) { - static const UpVal *const nullup = NULL; - LClosure *f; - TValue *fi = index2value(L, fidx); - api_check(L, ttisLclosure(fi), "Lua function expected"); - f = clLvalue(fi); - if (pf) *pf = f; - if (1 <= n && n <= f->p->sizeupvalues) - return &f->upvals[n - 1]; - else - return (UpVal**)&nullup; -} - - -LUA_API void *lua_upvalueid (lua_State *L, int fidx, int n) { - TValue *fi = index2value(L, fidx); - switch (ttypetag(fi)) { - case LUA_VLCL: { - return *getupvalref(L, fidx, n, NULL); - } - case LUA_VCCL: { - CClosure *f = clCvalue(fi); - if (1 <= n && n <= f->nupvalues) - return &f->upvalue[n - 1]; - - } - case LUA_VLCF: - return NULL; - default: { - api_check(L, 0, "function expected"); - return NULL; - } - } -} - - -LUA_API void lua_upvaluejoin (lua_State *L, int fidx1, int n1, - int fidx2, int n2) { - LClosure *f1; - UpVal **up1 = getupvalref(L, fidx1, n1, &f1); - UpVal **up2 = getupvalref(L, fidx2, n2, NULL); - api_check(L, *up1 != NULL && *up2 != NULL, "invalid upvalue index"); - *up1 = *up2; - luaC_objbarrier(L, f1, *up1); -} - - - - - - -//path: src/imports/../dependencies/lua/lauxlib.c - - -#define lauxlib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include -#include - - - - - - - -//path: src/imports/../dependencies/lua/lauxlib.h - - - -#ifndef lauxlib_h -#define lauxlib_h - - -#include -#include - - - - - - - - -#define LUA_GNAME "_G" - - -typedef struct luaL_Buffer luaL_Buffer; - - - -#define LUA_ERRFILE (LUA_ERRERR+1) - - - -#define LUA_LOADED_TABLE "_LOADED" - - - -#define LUA_PRELOAD_TABLE "_PRELOAD" - - -typedef struct luaL_Reg { - const char *name; - lua_CFunction func; -} luaL_Reg; - - -#define LUAL_NUMSIZES (sizeof(lua_Integer)*16 + sizeof(lua_Number)) - -LUALIB_API void (luaL_checkversion_) (lua_State *L, lua_Number ver, size_t sz); -#define luaL_checkversion(L) \ - luaL_checkversion_(L, LUA_VERSION_NUM, LUAL_NUMSIZES) - -LUALIB_API int (luaL_getmetafield) (lua_State *L, int obj, const char *e); -LUALIB_API int (luaL_callmeta) (lua_State *L, int obj, const char *e); -LUALIB_API const char *(luaL_tolstring) (lua_State *L, int idx, size_t *len); -LUALIB_API int (luaL_argerror) (lua_State *L, int arg, const char *extramsg); -LUALIB_API int (luaL_typeerror) (lua_State *L, int arg, const char *tname); -LUALIB_API const char *(luaL_checklstring) (lua_State *L, int arg, - size_t *l); -LUALIB_API const char *(luaL_optlstring) (lua_State *L, int arg, - const char *def, size_t *l); -LUALIB_API lua_Number (luaL_checknumber) (lua_State *L, int arg); -LUALIB_API lua_Number (luaL_optnumber) (lua_State *L, int arg, lua_Number def); - -LUALIB_API lua_Integer (luaL_checkinteger) (lua_State *L, int arg); -LUALIB_API lua_Integer (luaL_optinteger) (lua_State *L, int arg, - lua_Integer def); - -LUALIB_API void (luaL_checkstack) (lua_State *L, int sz, const char *msg); -LUALIB_API void (luaL_checktype) (lua_State *L, int arg, int t); -LUALIB_API void (luaL_checkany) (lua_State *L, int arg); - -LUALIB_API int (luaL_newmetatable) (lua_State *L, const char *tname); -LUALIB_API void (luaL_setmetatable) (lua_State *L, const char *tname); -LUALIB_API void *(luaL_testudata) (lua_State *L, int ud, const char *tname); -LUALIB_API void *(luaL_checkudata) (lua_State *L, int ud, const char *tname); - -LUALIB_API void (luaL_where) (lua_State *L, int lvl); -LUALIB_API int (luaL_error) (lua_State *L, const char *fmt, ...); - -LUALIB_API int (luaL_checkoption) (lua_State *L, int arg, const char *def, - const char *const lst[]); - -LUALIB_API int (luaL_fileresult) (lua_State *L, int stat, const char *fname); -LUALIB_API int (luaL_execresult) (lua_State *L, int stat); - - - -#define LUA_NOREF (-2) -#define LUA_REFNIL (-1) - -LUALIB_API int (luaL_ref) (lua_State *L, int t); -LUALIB_API void (luaL_unref) (lua_State *L, int t, int ref); - -LUALIB_API int (luaL_loadfilex) (lua_State *L, const char *filename, - const char *mode); - -#define luaL_loadfile(L,f) luaL_loadfilex(L,f,NULL) - -LUALIB_API int (luaL_loadbufferx) (lua_State *L, const char *buff, size_t sz, - const char *name, const char *mode); -LUALIB_API int (luaL_loadstring) (lua_State *L, const char *s); - -LUALIB_API lua_State *(luaL_newstate) (void); - -LUALIB_API unsigned luaL_makeseed (lua_State *L); - -LUALIB_API lua_Integer (luaL_len) (lua_State *L, int idx); - -LUALIB_API void (luaL_addgsub) (luaL_Buffer *b, const char *s, - const char *p, const char *r); -LUALIB_API const char *(luaL_gsub) (lua_State *L, const char *s, - const char *p, const char *r); - -LUALIB_API void (luaL_setfuncs) (lua_State *L, const luaL_Reg *l, int nup); - -LUALIB_API int (luaL_getsubtable) (lua_State *L, int idx, const char *fname); - -LUALIB_API void (luaL_traceback) (lua_State *L, lua_State *L1, - const char *msg, int level); - -LUALIB_API void (luaL_requiref) (lua_State *L, const char *modname, - lua_CFunction openf, int glb); - - - - -#define luaL_newlibtable(L,l) \ - lua_createtable(L, 0, sizeof(l)/sizeof((l)[0]) - 1) - -#define luaL_newlib(L,l) \ - (luaL_checkversion(L), luaL_newlibtable(L,l), luaL_setfuncs(L,l,0)) - -#define luaL_argcheck(L, cond,arg,extramsg) \ - ((void)(luai_likely(cond) || luaL_argerror(L, (arg), (extramsg)))) - -#define luaL_argexpected(L,cond,arg,tname) \ - ((void)(luai_likely(cond) || luaL_typeerror(L, (arg), (tname)))) - -#define luaL_checkstring(L,n) (luaL_checklstring(L, (n), NULL)) -#define luaL_optstring(L,n,d) (luaL_optlstring(L, (n), (d), NULL)) - -#define luaL_typename(L,i) lua_typename(L, lua_type(L,(i))) - -#define luaL_dofile(L, fn) \ - (luaL_loadfile(L, fn) || lua_pcall(L, 0, LUA_MULTRET, 0)) - -#define luaL_dostring(L, s) \ - (luaL_loadstring(L, s) || lua_pcall(L, 0, LUA_MULTRET, 0)) - -#define luaL_getmetatable(L,n) (lua_getfield(L, LUA_REGISTRYINDEX, (n))) - -#define luaL_opt(L,f,n,d) (lua_isnoneornil(L,(n)) ? (d) : f(L,(n))) - -#define luaL_loadbuffer(L,s,sz,n) luaL_loadbufferx(L,s,sz,n,NULL) - - - -#define luaL_intop(op,v1,v2) \ - ((lua_Integer)((lua_Unsigned)(v1) op (lua_Unsigned)(v2))) - - - -#define luaL_pushfail(L) lua_pushnil(L) - - - -#if !defined(lua_assert) - -#if defined LUAI_ASSERT - #include - #define lua_assert(c) assert(c) -#else - #define lua_assert(c) ((void)0) -#endif - -#endif - - - - - -struct luaL_Buffer { - char *b; - size_t size; - size_t n; - lua_State *L; - union { - LUAI_MAXALIGN; - char b[LUAL_BUFFERSIZE]; - } init; -}; - - -#define luaL_bufflen(bf) ((bf)->n) -#define luaL_buffaddr(bf) ((bf)->b) - - -#define luaL_addchar(B,c) \ - ((void)((B)->n < (B)->size || luaL_prepbuffsize((B), 1)), \ - ((B)->b[(B)->n++] = (c))) - -#define luaL_addsize(B,s) ((B)->n += (s)) - -#define luaL_buffsub(B,s) ((B)->n -= (s)) - -LUALIB_API void (luaL_buffinit) (lua_State *L, luaL_Buffer *B); -LUALIB_API char *(luaL_prepbuffsize) (luaL_Buffer *B, size_t sz); -LUALIB_API void (luaL_addlstring) (luaL_Buffer *B, const char *s, size_t l); -LUALIB_API void (luaL_addstring) (luaL_Buffer *B, const char *s); -LUALIB_API void (luaL_addvalue) (luaL_Buffer *B); -LUALIB_API void (luaL_pushresult) (luaL_Buffer *B); -LUALIB_API void (luaL_pushresultsize) (luaL_Buffer *B, size_t sz); -LUALIB_API char *(luaL_buffinitsize) (lua_State *L, luaL_Buffer *B, size_t sz); - -#define luaL_prepbuffer(B) luaL_prepbuffsize(B, LUAL_BUFFERSIZE) - - - - - - - - - -#define LUA_FILEHANDLE "FILE*" - - -typedef struct luaL_Stream { - FILE *f; - lua_CFunction closef; -} luaL_Stream; - - - - - - -#if !defined(lua_writestring) -#define lua_writestring(s,l) fwrite((s), sizeof(char), (l), stdout) -#endif - - -#if !defined(lua_writeline) -#define lua_writeline() (lua_writestring("\n", 1), fflush(stdout)) -#endif - - -#if !defined(lua_writestringerror) -#define lua_writestringerror(s,p) \ - (fprintf(stderr, (s), (p)), fflush(stderr)) -#endif - - - - - -#if defined(LUA_COMPAT_APIINTCASTS) - -#define luaL_checkunsigned(L,a) ((lua_Unsigned)luaL_checkinteger(L,a)) -#define luaL_optunsigned(L,a,d) \ - ((lua_Unsigned)luaL_optinteger(L,a,(lua_Integer)(d))) - -#define luaL_checkint(L,n) ((int)luaL_checkinteger(L, (n))) -#define luaL_optint(L,n,d) ((int)luaL_optinteger(L, (n), (d))) - -#define luaL_checklong(L,n) ((long)luaL_checkinteger(L, (n))) -#define luaL_optlong(L,n,d) ((long)luaL_optinteger(L, (n), (d))) - -#endif - - - - -#endif - - - - - - -#if !defined(MAX_SIZET) - -#define MAX_SIZET ((size_t)(~(size_t)0)) -#endif - - - - - -#define LEVELS1 10 -#define LEVELS2 11 - - - - -static int findfield (lua_State *L, int objidx, int level) { - if (level == 0 || !lua_istable(L, -1)) - return 0; - lua_pushnil(L); - while (lua_next(L, -2)) { - if (lua_type(L, -2) == LUA_TSTRING) { - if (lua_rawequal(L, objidx, -1)) { - lua_pop(L, 1); - return 1; - } - else if (findfield(L, objidx, level - 1)) { - - lua_pushliteral(L, "."); - lua_replace(L, -3); - lua_concat(L, 3); - return 1; - } - } - lua_pop(L, 1); - } - return 0; -} - - - -static int pushglobalfuncname (lua_State *L, lua_Debug *ar) { - int top = lua_gettop(L); - lua_getinfo(L, "f", ar); - lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - if (findfield(L, top + 1, 2)) { - const char *name = lua_tostring(L, -1); - if (strncmp(name, LUA_GNAME ".", 3) == 0) { - lua_pushstring(L, name + 3); - lua_remove(L, -2); - } - lua_copy(L, -1, top + 1); - lua_settop(L, top + 1); - return 1; - } - else { - lua_settop(L, top); - return 0; - } -} - - -static void pushfuncname (lua_State *L, lua_Debug *ar) { - if (pushglobalfuncname(L, ar)) { - lua_pushfstring(L, "function '%s'", lua_tostring(L, -1)); - lua_remove(L, -2); - } - else if (*ar->namewhat != '\0') - lua_pushfstring(L, "%s '%s'", ar->namewhat, ar->name); - else if (*ar->what == 'm') - lua_pushliteral(L, "main chunk"); - else if (*ar->what != 'C') - lua_pushfstring(L, "function <%s:%d>", ar->short_src, ar->linedefined); - else - lua_pushliteral(L, "?"); -} - - -static int lastlevel (lua_State *L) { - lua_Debug ar; - int li = 1, le = 1; - - while (lua_getstack(L, le, &ar)) { li = le; le *= 2; } - - while (li < le) { - int m = (li + le)/2; - if (lua_getstack(L, m, &ar)) li = m + 1; - else le = m; - } - return le - 1; -} - - -LUALIB_API void luaL_traceback (lua_State *L, lua_State *L1, - const char *msg, int level) { - luaL_Buffer b; - lua_Debug ar; - int last = lastlevel(L1); - int limit2show = (last - level > LEVELS1 + LEVELS2) ? LEVELS1 : -1; - luaL_buffinit(L, &b); - if (msg) { - luaL_addstring(&b, msg); - luaL_addchar(&b, '\n'); - } - luaL_addstring(&b, "stack traceback:"); - while (lua_getstack(L1, level++, &ar)) { - if (limit2show-- == 0) { - int n = last - level - LEVELS2 + 1; - lua_pushfstring(L, "\n\t...\t(skipping %d levels)", n); - luaL_addvalue(&b); - level += n; - } - else { - lua_getinfo(L1, "Slnt", &ar); - if (ar.currentline <= 0) - lua_pushfstring(L, "\n\t%s: in ", ar.short_src); - else - lua_pushfstring(L, "\n\t%s:%d: in ", ar.short_src, ar.currentline); - luaL_addvalue(&b); - pushfuncname(L, &ar); - luaL_addvalue(&b); - if (ar.istailcall) - luaL_addstring(&b, "\n\t(...tail calls...)"); - } - } - luaL_pushresult(&b); -} - - - - - - -LUALIB_API int luaL_argerror (lua_State *L, int arg, const char *extramsg) { - lua_Debug ar; - if (!lua_getstack(L, 0, &ar)) - return luaL_error(L, "bad argument #%d (%s)", arg, extramsg); - lua_getinfo(L, "n", &ar); - if (strcmp(ar.namewhat, "method") == 0) { - arg--; - if (arg == 0) - return luaL_error(L, "calling '%s' on bad self (%s)", - ar.name, extramsg); - } - if (ar.name == NULL) - ar.name = (pushglobalfuncname(L, &ar)) ? lua_tostring(L, -1) : "?"; - return luaL_error(L, "bad argument #%d to '%s' (%s)", - arg, ar.name, extramsg); -} - - -LUALIB_API int luaL_typeerror (lua_State *L, int arg, const char *tname) { - const char *msg; - const char *typearg; - if (luaL_getmetafield(L, arg, "__name") == LUA_TSTRING) - typearg = lua_tostring(L, -1); - else if (lua_type(L, arg) == LUA_TLIGHTUSERDATA) - typearg = "light userdata"; - else - typearg = luaL_typename(L, arg); - msg = lua_pushfstring(L, "%s expected, got %s", tname, typearg); - return luaL_argerror(L, arg, msg); -} - - -static void tag_error (lua_State *L, int arg, int tag) { - luaL_typeerror(L, arg, lua_typename(L, tag)); -} - - - -LUALIB_API void luaL_where (lua_State *L, int level) { - lua_Debug ar; - if (lua_getstack(L, level, &ar)) { - lua_getinfo(L, "Sl", &ar); - if (ar.currentline > 0) { - lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline); - return; - } - } - lua_pushfstring(L, ""); -} - - - -LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) { - va_list argp; - va_start(argp, fmt); - luaL_where(L, 1); - lua_pushvfstring(L, fmt, argp); - va_end(argp); - lua_concat(L, 2); - return lua_error(L); -} - - -LUALIB_API int luaL_fileresult (lua_State *L, int stat, const char *fname) { - int en = errno; - if (stat) { - lua_pushboolean(L, 1); - return 1; - } - else { - luaL_pushfail(L); - if (fname) - lua_pushfstring(L, "%s: %s", fname, strerror(en)); - else - lua_pushstring(L, strerror(en)); - lua_pushinteger(L, en); - return 3; - } -} - - -#if !defined(l_inspectstat) - -#if defined(LUA_USE_POSIX) - -#include - - -#define l_inspectstat(stat,what) \ - if (WIFEXITED(stat)) { stat = WEXITSTATUS(stat); } \ - else if (WIFSIGNALED(stat)) { stat = WTERMSIG(stat); what = "signal"; } - -#else - -#define l_inspectstat(stat,what) - -#endif - -#endif - - -LUALIB_API int luaL_execresult (lua_State *L, int stat) { - if (stat != 0 && errno != 0) - return luaL_fileresult(L, 0, NULL); - else { - const char *what = "exit"; - l_inspectstat(stat, what); - if (*what == 'e' && stat == 0) - lua_pushboolean(L, 1); - else - luaL_pushfail(L); - lua_pushstring(L, what); - lua_pushinteger(L, stat); - return 3; - } -} - - - - - - - -LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) { - if (luaL_getmetatable(L, tname) != LUA_TNIL) - return 0; - lua_pop(L, 1); - lua_createtable(L, 0, 2); - lua_pushstring(L, tname); - lua_setfield(L, -2, "__name"); - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, tname); - return 1; -} - - -LUALIB_API void luaL_setmetatable (lua_State *L, const char *tname) { - luaL_getmetatable(L, tname); - lua_setmetatable(L, -2); -} - - -LUALIB_API void *luaL_testudata (lua_State *L, int ud, const char *tname) { - void *p = lua_touserdata(L, ud); - if (p != NULL) { - if (lua_getmetatable(L, ud)) { - luaL_getmetatable(L, tname); - if (!lua_rawequal(L, -1, -2)) - p = NULL; - lua_pop(L, 2); - return p; - } - } - return NULL; -} - - -LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) { - void *p = luaL_testudata(L, ud, tname); - luaL_argexpected(L, p != NULL, ud, tname); - return p; -} - - - - - - -LUALIB_API int luaL_checkoption (lua_State *L, int arg, const char *def, - const char *const lst[]) { - const char *name = (def) ? luaL_optstring(L, arg, def) : - luaL_checkstring(L, arg); - int i; - for (i=0; lst[i]; i++) - if (strcmp(lst[i], name) == 0) - return i; - return luaL_argerror(L, arg, - lua_pushfstring(L, "invalid option '%s'", name)); -} - - - -LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *msg) { - if (l_unlikely(!lua_checkstack(L, space))) { - if (msg) - luaL_error(L, "stack overflow (%s)", msg); - else - luaL_error(L, "stack overflow"); - } -} - - -LUALIB_API void luaL_checktype (lua_State *L, int arg, int t) { - if (l_unlikely(lua_type(L, arg) != t)) - tag_error(L, arg, t); -} - - -LUALIB_API void luaL_checkany (lua_State *L, int arg) { - if (l_unlikely(lua_type(L, arg) == LUA_TNONE)) - luaL_argerror(L, arg, "value expected"); -} - - -LUALIB_API const char *luaL_checklstring (lua_State *L, int arg, size_t *len) { - const char *s = lua_tolstring(L, arg, len); - if (l_unlikely(!s)) tag_error(L, arg, LUA_TSTRING); - return s; -} - - -LUALIB_API const char *luaL_optlstring (lua_State *L, int arg, - const char *def, size_t *len) { - if (lua_isnoneornil(L, arg)) { - if (len) - *len = (def ? strlen(def) : 0); - return def; - } - else return luaL_checklstring(L, arg, len); -} - - -LUALIB_API lua_Number luaL_checknumber (lua_State *L, int arg) { - int isnum; - lua_Number d = lua_tonumberx(L, arg, &isnum); - if (l_unlikely(!isnum)) - tag_error(L, arg, LUA_TNUMBER); - return d; -} - - -LUALIB_API lua_Number luaL_optnumber (lua_State *L, int arg, lua_Number def) { - return luaL_opt(L, luaL_checknumber, arg, def); -} - - -static void interror (lua_State *L, int arg) { - if (lua_isnumber(L, arg)) - luaL_argerror(L, arg, "number has no integer representation"); - else - tag_error(L, arg, LUA_TNUMBER); -} - - -LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int arg) { - int isnum; - lua_Integer d = lua_tointegerx(L, arg, &isnum); - if (l_unlikely(!isnum)) { - interror(L, arg); - } - return d; -} - - -LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int arg, - lua_Integer def) { - return luaL_opt(L, luaL_checkinteger, arg, def); -} - - - - - - - -typedef struct UBox { - void *box; - size_t bsize; -} UBox; - - - -static void *resizebox (lua_State *L, int idx, size_t newsize) { - UBox *box = (UBox *)lua_touserdata(L, idx); - if (box->bsize == newsize) - return box->box; - else { - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); - void *temp = allocf(ud, box->box, box->bsize, newsize); - if (l_unlikely(temp == NULL && newsize > 0)) { - lua_pushliteral(L, "not enough memory"); - lua_error(L); - } - box->box = temp; - box->bsize = newsize; - return temp; - } -} - - -static int boxgc (lua_State *L) { - resizebox(L, 1, 0); - return 0; -} - - -static const luaL_Reg boxmt[] = { - {"__gc", boxgc}, - {"__close", boxgc}, - {NULL, NULL} -}; - - -static void newbox (lua_State *L) { - UBox *box = (UBox *)lua_newuserdatauv(L, sizeof(UBox), 0); - box->box = NULL; - box->bsize = 0; - if (luaL_newmetatable(L, "_UBOX*")) - luaL_setfuncs(L, boxmt, 0); - lua_setmetatable(L, -2); -} - - - -#define buffonstack(B) ((B)->b != (B)->init.b) - - - -#define checkbufferlevel(B,idx) \ - lua_assert(buffonstack(B) ? lua_touserdata(B->L, idx) != NULL \ - : lua_touserdata(B->L, idx) == (void*)B) - - - -static size_t newbuffsize (luaL_Buffer *B, size_t sz) { - size_t newsize = (B->size / 2) * 3; - if (l_unlikely(MAX_SIZET - sz - 1 < B->n)) - return luaL_error(B->L, "buffer too large"); - if (newsize < B->n + sz + 1) - newsize = B->n + sz + 1; - return newsize; -} - - - -static char *prepbuffsize (luaL_Buffer *B, size_t sz, int boxidx) { - checkbufferlevel(B, boxidx); - if (B->size - B->n >= sz) - return B->b + B->n; - else { - lua_State *L = B->L; - char *newbuff; - size_t newsize = newbuffsize(B, sz); - - if (buffonstack(B)) - newbuff = (char *)resizebox(L, boxidx, newsize); - else { - lua_remove(L, boxidx); - newbox(L); - lua_insert(L, boxidx); - lua_toclose(L, boxidx); - newbuff = (char *)resizebox(L, boxidx, newsize); - memcpy(newbuff, B->b, B->n * sizeof(char)); - } - B->b = newbuff; - B->size = newsize; - return newbuff + B->n; - } -} - - -LUALIB_API char *luaL_prepbuffsize (luaL_Buffer *B, size_t sz) { - return prepbuffsize(B, sz, -1); -} - - -LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) { - if (l > 0) { - char *b = prepbuffsize(B, l, -1); - memcpy(b, s, l * sizeof(char)); - luaL_addsize(B, l); - } -} - - -LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) { - luaL_addlstring(B, s, strlen(s)); -} - - -LUALIB_API void luaL_pushresult (luaL_Buffer *B) { - lua_State *L = B->L; - checkbufferlevel(B, -1); - if (!buffonstack(B)) - lua_pushlstring(L, B->b, B->n); - else { - UBox *box = (UBox *)lua_touserdata(L, -1); - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); - size_t len = B->n; - char *s; - resizebox(L, -1, len + 1); - s = (char*)box->box; - s[len] = '\0'; - - box->bsize = 0; box->box = NULL; - lua_pushextlstring(L, s, len, allocf, ud); - lua_closeslot(L, -2); - } - lua_remove(L, -2); -} - - -LUALIB_API void luaL_pushresultsize (luaL_Buffer *B, size_t sz) { - luaL_addsize(B, sz); - luaL_pushresult(B); -} - - - -LUALIB_API void luaL_addvalue (luaL_Buffer *B) { - lua_State *L = B->L; - size_t len; - const char *s = lua_tolstring(L, -1, &len); - char *b = prepbuffsize(B, len, -2); - memcpy(b, s, len * sizeof(char)); - luaL_addsize(B, len); - lua_pop(L, 1); -} - - -LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) { - B->L = L; - B->b = B->init.b; - B->n = 0; - B->size = LUAL_BUFFERSIZE; - lua_pushlightuserdata(L, (void*)B); -} - - -LUALIB_API char *luaL_buffinitsize (lua_State *L, luaL_Buffer *B, size_t sz) { - luaL_buffinit(L, B); - return prepbuffsize(B, sz, -1); -} - - - - - - - -LUALIB_API int luaL_ref (lua_State *L, int t) { - int ref; - if (lua_isnil(L, -1)) { - lua_pop(L, 1); - return LUA_REFNIL; - } - t = lua_absindex(L, t); - if (lua_rawgeti(L, t, 1) == LUA_TNUMBER) - ref = (int)lua_tointeger(L, -1); - else { - lua_assert(!lua_toboolean(L, -1)); - ref = 0; - lua_pushinteger(L, 0); - lua_rawseti(L, t, 1); - } - lua_pop(L, 1); - if (ref != 0) { - lua_rawgeti(L, t, ref); - lua_rawseti(L, t, 1); - } - else - ref = (int)lua_rawlen(L, t) + 1; - lua_rawseti(L, t, ref); - return ref; -} - - -LUALIB_API void luaL_unref (lua_State *L, int t, int ref) { - if (ref >= 0) { - t = lua_absindex(L, t); - lua_rawgeti(L, t, 1); - lua_assert(lua_isinteger(L, -1)); - lua_rawseti(L, t, ref); - lua_pushinteger(L, ref); - lua_rawseti(L, t, 1); - } -} - - - - - - -typedef struct LoadF { - int n; - FILE *f; - char buff[BUFSIZ]; -} LoadF; - - -static const char *getF (lua_State *L, void *ud, size_t *size) { - LoadF *lf = (LoadF *)ud; - (void)L; - if (lf->n > 0) { - *size = lf->n; - lf->n = 0; - } - else { - - if (feof(lf->f)) return NULL; - *size = fread(lf->buff, 1, sizeof(lf->buff), lf->f); - } - return lf->buff; -} - - -static int errfile (lua_State *L, const char *what, int fnameindex) { - const char *serr = strerror(errno); - const char *filename = lua_tostring(L, fnameindex) + 1; - lua_pushfstring(L, "cannot %s %s: %s", what, filename, serr); - lua_remove(L, fnameindex); - return LUA_ERRFILE; -} - - - -static int skipBOM (FILE *f) { - int c = getc(f); - if (c == 0xEF && getc(f) == 0xBB && getc(f) == 0xBF) - return getc(f); - else - return c; -} - - - -static int skipcomment (FILE *f, int *cp) { - int c = *cp = skipBOM(f); - if (c == '#') { - do { - c = getc(f); - } while (c != EOF && c != '\n'); - *cp = getc(f); - return 1; - } - else return 0; -} - - -LUALIB_API int luaL_loadfilex (lua_State *L, const char *filename, - const char *mode) { - LoadF lf; - int status, readstatus; - int c; - int fnameindex = lua_gettop(L) + 1; - if (filename == NULL) { - lua_pushliteral(L, "=stdin"); - lf.f = stdin; - } - else { - lua_pushfstring(L, "@%s", filename); - lf.f = fopen(filename, "r"); - if (lf.f == NULL) return errfile(L, "open", fnameindex); - } - lf.n = 0; - if (skipcomment(lf.f, &c)) - lf.buff[lf.n++] = '\n'; - if (c == LUA_SIGNATURE[0]) { - lf.n = 0; - if (filename) { - lf.f = freopen(filename, "rb", lf.f); - if (lf.f == NULL) return errfile(L, "reopen", fnameindex); - skipcomment(lf.f, &c); - } - } - if (c != EOF) - lf.buff[lf.n++] = c; - status = lua_load(L, getF, &lf, lua_tostring(L, -1), mode); - readstatus = ferror(lf.f); - if (filename) fclose(lf.f); - if (readstatus) { - lua_settop(L, fnameindex); - return errfile(L, "read", fnameindex); - } - lua_remove(L, fnameindex); - return status; -} - - -typedef struct LoadS { - const char *s; - size_t size; -} LoadS; - - -static const char *getS (lua_State *L, void *ud, size_t *size) { - LoadS *ls = (LoadS *)ud; - (void)L; - if (ls->size == 0) return NULL; - *size = ls->size; - ls->size = 0; - return ls->s; -} - - -LUALIB_API int luaL_loadbufferx (lua_State *L, const char *buff, size_t size, - const char *name, const char *mode) { - LoadS ls; - ls.s = buff; - ls.size = size; - return lua_load(L, getS, &ls, name, mode); -} - - -LUALIB_API int luaL_loadstring (lua_State *L, const char *s) { - return luaL_loadbuffer(L, s, strlen(s), s); -} - - - - - -LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) { - if (!lua_getmetatable(L, obj)) - return LUA_TNIL; - else { - int tt; - lua_pushstring(L, event); - tt = lua_rawget(L, -2); - if (tt == LUA_TNIL) - lua_pop(L, 2); - else - lua_remove(L, -2); - return tt; - } -} - - -LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) { - obj = lua_absindex(L, obj); - if (luaL_getmetafield(L, obj, event) == LUA_TNIL) - return 0; - lua_pushvalue(L, obj); - lua_call(L, 1, 1); - return 1; -} - - -LUALIB_API lua_Integer luaL_len (lua_State *L, int idx) { - lua_Integer l; - int isnum; - lua_len(L, idx); - l = lua_tointegerx(L, -1, &isnum); - if (l_unlikely(!isnum)) - luaL_error(L, "object length is not an integer"); - lua_pop(L, 1); - return l; -} - - -LUALIB_API const char *luaL_tolstring (lua_State *L, int idx, size_t *len) { - idx = lua_absindex(L,idx); - if (luaL_callmeta(L, idx, "__tostring")) { - if (!lua_isstring(L, -1)) - luaL_error(L, "'__tostring' must return a string"); - } - else { - switch (lua_type(L, idx)) { - case LUA_TNUMBER: { - if (lua_isinteger(L, idx)) - lua_pushfstring(L, "%I", (LUAI_UACINT)lua_tointeger(L, idx)); - else - lua_pushfstring(L, "%f", (LUAI_UACNUMBER)lua_tonumber(L, idx)); - break; - } - case LUA_TSTRING: - lua_pushvalue(L, idx); - break; - case LUA_TBOOLEAN: - lua_pushstring(L, (lua_toboolean(L, idx) ? "true" : "false")); - break; - case LUA_TNIL: - lua_pushliteral(L, "nil"); - break; - default: { - int tt = luaL_getmetafield(L, idx, "__name"); - const char *kind = (tt == LUA_TSTRING) ? lua_tostring(L, -1) : - luaL_typename(L, idx); - lua_pushfstring(L, "%s: %p", kind, lua_topointer(L, idx)); - if (tt != LUA_TNIL) - lua_remove(L, -2); - break; - } - } - } - return lua_tolstring(L, -1, len); -} - - - -LUALIB_API void luaL_setfuncs (lua_State *L, const luaL_Reg *l, int nup) { - luaL_checkstack(L, nup, "too many upvalues"); - for (; l->name != NULL; l++) { - if (l->func == NULL) - lua_pushboolean(L, 0); - else { - int i; - for (i = 0; i < nup; i++) - lua_pushvalue(L, -nup); - lua_pushcclosure(L, l->func, nup); - } - lua_setfield(L, -(nup + 2), l->name); - } - lua_pop(L, nup); -} - - - -LUALIB_API int luaL_getsubtable (lua_State *L, int idx, const char *fname) { - if (lua_getfield(L, idx, fname) == LUA_TTABLE) - return 1; - else { - lua_pop(L, 1); - idx = lua_absindex(L, idx); - lua_newtable(L); - lua_pushvalue(L, -1); - lua_setfield(L, idx, fname); - return 0; - } -} - - - -LUALIB_API void luaL_requiref (lua_State *L, const char *modname, - lua_CFunction openf, int glb) { - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_getfield(L, -1, modname); - if (!lua_toboolean(L, -1)) { - lua_pop(L, 1); - lua_pushcfunction(L, openf); - lua_pushstring(L, modname); - lua_call(L, 1, 1); - lua_pushvalue(L, -1); - lua_setfield(L, -3, modname); - } - lua_remove(L, -2); - if (glb) { - lua_pushvalue(L, -1); - lua_setglobal(L, modname); - } -} - - -LUALIB_API void luaL_addgsub (luaL_Buffer *b, const char *s, - const char *p, const char *r) { - const char *wild; - size_t l = strlen(p); - while ((wild = strstr(s, p)) != NULL) { - luaL_addlstring(b, s, wild - s); - luaL_addstring(b, r); - s = wild + l; - } - luaL_addstring(b, s); -} - - -LUALIB_API const char *luaL_gsub (lua_State *L, const char *s, - const char *p, const char *r) { - luaL_Buffer b; - luaL_buffinit(L, &b); - luaL_addgsub(&b, s, p, r); - luaL_pushresult(&b); - return lua_tostring(L, -1); -} - - -static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) { - (void)ud; (void)osize; - if (nsize == 0) { - free(ptr); - return NULL; - } - else - return realloc(ptr, nsize); -} - - - -static int panic (lua_State *L) { - const char *msg = (lua_type(L, -1) == LUA_TSTRING) - ? lua_tostring(L, -1) - : "private_lua_error object is not a string"; - lua_writestringerror("PANIC: unprotected private_lua_error in call to Lua API (%s)\n", - msg); - return 0; -} - - - -static void warnfoff (void *ud, const char *message, int tocont); -static void warnfon (void *ud, const char *message, int tocont); -static void warnfcont (void *ud, const char *message, int tocont); - - - -static int checkcontrol (lua_State *L, const char *message, int tocont) { - if (tocont || *(message++) != '@') - return 0; - else { - if (strcmp(message, "off") == 0) - lua_setwarnf(L, warnfoff, L); - else if (strcmp(message, "on") == 0) - lua_setwarnf(L, warnfon, L); - return 1; - } -} - - -static void warnfoff (void *ud, const char *message, int tocont) { - checkcontrol((lua_State *)ud, message, tocont); -} - - - -static void warnfcont (void *ud, const char *message, int tocont) { - lua_State *L = (lua_State *)ud; - lua_writestringerror("%s", message); - if (tocont) - lua_setwarnf(L, warnfcont, L); - else { - lua_writestringerror("%s", "\n"); - lua_setwarnf(L, warnfon, L); - } -} - - -static void warnfon (void *ud, const char *message, int tocont) { - if (checkcontrol((lua_State *)ud, message, tocont)) - return; - lua_writestringerror("%s", "Lua warning: "); - warnfcont(ud, message, tocont); -} - - - - -#if !defined(luai_makeseed) - -#include - - - -#define BUFSEEDB (sizeof(void*) + sizeof(time_t)) - - -#define BUFSEED ((BUFSEEDB + sizeof(int) - 1) / sizeof(int)) - - -#define addbuff(b,v) (memcpy(&b[0], &(v), sizeof(v)), b += sizeof(v)) - - -static unsigned int luai_makeseed (void) { - unsigned int buff[BUFSEED]; - unsigned int res; - unsigned int i; - time_t t = time(NULL); - char *b = (char*)buff; - addbuff(b, b); - addbuff(b, t); - - memset(b, 0, sizeof(buff) - BUFSEEDB); - res = buff[0]; - for (i = 1; i < BUFSEED; i++) - res ^= (res >> 3) + (res << 7) + buff[i]; - return res; -} - -#endif - - -LUALIB_API unsigned int luaL_makeseed (lua_State *L) { - (void)L; - return luai_makeseed(); -} - - -LUALIB_API lua_State *luaL_newstate (void) { - lua_State *L = lua_newstate(l_alloc, NULL, luai_makeseed()); - if (l_likely(L)) { - lua_atpanic(L, &panic); - lua_setwarnf(L, warnfoff, L); - } - return L; -} - - -LUALIB_API void luaL_checkversion_ (lua_State *L, lua_Number ver, size_t sz) { - lua_Number v = lua_version(L); - if (sz != LUAL_NUMSIZES) - luaL_error(L, "core and library have incompatible numeric types"); - else if (v != ver) - luaL_error(L, "version mismatch: app. needs %f, Lua core provides %f", - (LUAI_UACNUMBER)ver, (LUAI_UACNUMBER)v); -} - - - - - - - -#ifndef MAKE_LUAC -//path: src/imports/../dependencies/lua/lbaselib.c - - -#define lbaselib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include - - - - - - -//path: src/imports/../dependencies/lua/lualib.h - - - -#ifndef lualib_h -#define lualib_h - - - - - - -#define LUA_VERSUFFIX "_" LUA_VERSION_MAJOR "_" LUA_VERSION_MINOR - -#define LUA_GLIBK 1 -LUAMOD_API int (luaopen_base) (lua_State *L); - -#define LUA_LOADLIBNAME "package" -#define LUA_LOADLIBK (LUA_GLIBK << 1) -LUAMOD_API int (luaopen_package) (lua_State *L); - - -#define LUA_COLIBNAME "coroutine" -#define LUA_COLIBK (LUA_LOADLIBK << 1) -LUAMOD_API int (luaopen_coroutine) (lua_State *L); - -#define LUA_DBLIBNAME "debug" -#define LUA_DBLIBK (LUA_COLIBK << 1) -LUAMOD_API int (luaopen_debug) (lua_State *L); - -#define LUA_IOLIBNAME "io" -#define LUA_IOLIBK (LUA_DBLIBK << 1) -LUAMOD_API int (luaopen_io) (lua_State *L); - -#define LUA_MATHLIBNAME "math" -#define LUA_MATHLIBK (LUA_IOLIBK << 1) -LUAMOD_API int (luaopen_math) (lua_State *L); - -#define LUA_OSLIBNAME "os" -#define LUA_OSLIBK (LUA_MATHLIBK << 1) -LUAMOD_API int (luaopen_os) (lua_State *L); - -#define LUA_STRLIBNAME "string" -#define LUA_STRLIBK (LUA_OSLIBK << 1) -LUAMOD_API int (luaopen_string) (lua_State *L); - -#define LUA_TABLIBNAME "table" -#define LUA_TABLIBK (LUA_STRLIBK << 1) -LUAMOD_API int (luaopen_table) (lua_State *L); - -#define LUA_UTF8LIBNAME "utf8" -#define LUA_UTF8LIBK (LUA_TABLIBK << 1) -LUAMOD_API int (luaopen_utf8) (lua_State *L); - - - -LUALIB_API void (luaL_openselectedlibs) (lua_State *L, int load, int preload); - - -#define luaL_openlibs(L) luaL_openselectedlibs(L, ~0, 0) - - -#endif - - - - -static int luaB_print (lua_State *L) { - int n = lua_gettop(L); - int i; - for (i = 1; i <= n; i++) { - size_t l; - const char *s = luaL_tolstring(L, i, &l); - if (i > 1) - lua_writestring("\t", 1); - lua_writestring(s, l); - lua_pop(L, 1); - } - lua_writeline(); - return 0; -} - - - -static int luaB_warn (lua_State *L) { - int n = lua_gettop(L); - int i; - luaL_checkstring(L, 1); - for (i = 2; i <= n; i++) - luaL_checkstring(L, i); - for (i = 1; i < n; i++) - lua_warning(L, lua_tostring(L, i), 1); - lua_warning(L, lua_tostring(L, n), 0); - return 0; -} - - -#define SPACECHARS " \f\n\r\t\v" - -static const char *b_str2int (const char *s, int base, lua_Integer *pn) { - lua_Unsigned n = 0; - int neg = 0; - s += strspn(s, SPACECHARS); - if (*s == '-') { s++; neg = 1; } - else if (*s == '+') s++; - if (!isalnum((unsigned char)*s)) - return NULL; - do { - int digit = (isdigit((unsigned char)*s)) ? *s - '0' - : (toupper((unsigned char)*s) - 'A') + 10; - if (digit >= base) return NULL; - n = n * base + digit; - s++; - } while (isalnum((unsigned char)*s)); - s += strspn(s, SPACECHARS); - *pn = (lua_Integer)((neg) ? (0u - n) : n); - return s; -} - - -static int luaB_tonumber (lua_State *L) { - if (lua_isnoneornil(L, 2)) { - if (lua_type(L, 1) == LUA_TNUMBER) { - lua_settop(L, 1); - return 1; - } - else { - size_t l; - const char *s = lua_tolstring(L, 1, &l); - if (s != NULL && lua_stringtonumber(L, s) == l + 1) - return 1; - - luaL_checkany(L, 1); - } - } - else { - size_t l; - const char *s; - lua_Integer n = 0; - lua_Integer base = luaL_checkinteger(L, 2); - luaL_checktype(L, 1, LUA_TSTRING); - s = lua_tolstring(L, 1, &l); - luaL_argcheck(L, 2 <= base && base <= 36, 2, "base out of range"); - if (b_str2int(s, (int)base, &n) == s + l) { - lua_pushinteger(L, n); - return 1; - } - } - luaL_pushfail(L); - return 1; -} - - -static int luaB_error (lua_State *L) { - int level = (int)luaL_optinteger(L, 2, 1); - lua_settop(L, 1); - if (lua_type(L, 1) == LUA_TSTRING && level > 0) { - luaL_where(L, level); - lua_pushvalue(L, 1); - lua_concat(L, 2); - } - return lua_error(L); -} - - -static int luaB_getmetatable (lua_State *L) { - luaL_checkany(L, 1); - if (!lua_getmetatable(L, 1)) { - lua_pushnil(L); - return 1; - } - luaL_getmetafield(L, 1, "__metatable"); - return 1; -} - - -static int luaB_setmetatable (lua_State *L) { - int t = lua_type(L, 2); - luaL_checktype(L, 1, LUA_TTABLE); - luaL_argexpected(L, t == LUA_TNIL || t == LUA_TTABLE, 2, "nil or table"); - if (l_unlikely(luaL_getmetafield(L, 1, "__metatable") != LUA_TNIL)) - return luaL_error(L, "cannot change a protected metatable"); - lua_settop(L, 2); - lua_setmetatable(L, 1); - return 1; -} - - -static int luaB_rawequal (lua_State *L) { - luaL_checkany(L, 1); - luaL_checkany(L, 2); - lua_pushboolean(L, lua_rawequal(L, 1, 2)); - return 1; -} - - -static int luaB_rawlen (lua_State *L) { - int t = lua_type(L, 1); - luaL_argexpected(L, t == LUA_TTABLE || t == LUA_TSTRING, 1, - "table or string"); - lua_pushinteger(L, lua_rawlen(L, 1)); - return 1; -} - - -static int luaB_rawget (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - luaL_checkany(L, 2); - lua_settop(L, 2); - lua_rawget(L, 1); - return 1; -} - -static int luaB_rawset (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - luaL_checkany(L, 2); - luaL_checkany(L, 3); - lua_settop(L, 3); - lua_rawset(L, 1); - return 1; -} - - -static int pushmode (lua_State *L, int oldmode) { - if (oldmode == -1) - luaL_pushfail(L); - else - lua_pushstring(L, (oldmode == LUA_GCINC) ? "incremental" - : "generational"); - return 1; -} - - - -#define checkvalres(res) { if (res == -1) break; } - -static int luaB_collectgarbage (lua_State *L) { - static const char *const opts[] = {"stop", "restart", "collect", - "count", "step", "isrunning", "generational", "incremental", - "param", NULL}; - static const char optsnum[] = {LUA_GCSTOP, LUA_GCRESTART, LUA_GCCOLLECT, - LUA_GCCOUNT, LUA_GCSTEP, LUA_GCISRUNNING, LUA_GCGEN, LUA_GCINC, - LUA_GCPARAM}; - int o = optsnum[luaL_checkoption(L, 1, "collect", opts)]; - switch (o) { - case LUA_GCCOUNT: { - int k = lua_gc(L, o); - int b = lua_gc(L, LUA_GCCOUNTB); - checkvalres(k); - lua_pushnumber(L, (lua_Number)k + ((lua_Number)b/1024)); - return 1; - } - case LUA_GCSTEP: { - lua_Integer n = luaL_optinteger(L, 2, 0); - int res = lua_gc(L, o, (int)n); - checkvalres(res); - lua_pushboolean(L, res); - return 1; - } - case LUA_GCISRUNNING: { - int res = lua_gc(L, o); - checkvalres(res); - lua_pushboolean(L, res); - return 1; - } - case LUA_GCGEN: { - return pushmode(L, lua_gc(L, o)); - } - case LUA_GCINC: { - return pushmode(L, lua_gc(L, o)); - } - case LUA_GCPARAM: { - static const char *const params[] = { - "minormul", "majorminor", "minormajor", - "pause", "stepmul", "stepsize", NULL}; - static const char pnum[] = { - LUA_GCPMINORMUL, LUA_GCPMAJORMINOR, LUA_GCPMINORMAJOR, - LUA_GCPPAUSE, LUA_GCPSTEPMUL, LUA_GCPSTEPSIZE}; - int p = pnum[luaL_checkoption(L, 2, NULL, params)]; - lua_Integer value = luaL_optinteger(L, 3, -1); - lua_pushinteger(L, lua_gc(L, o, p, (int)value)); - return 1; - } - default: { - int res = lua_gc(L, o); - checkvalres(res); - lua_pushinteger(L, res); - return 1; - } - } - luaL_pushfail(L); - return 1; -} - - -static int luaB_type (lua_State *L) { - int t = lua_type(L, 1); - luaL_argcheck(L, t != LUA_TNONE, 1, "value expected"); - lua_pushstring(L, lua_typename(L, t)); - return 1; -} - - -static int luaB_next (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - lua_settop(L, 2); - if (lua_next(L, 1)) - return 2; - else { - lua_pushnil(L); - return 1; - } -} - - -static int pairscont (lua_State *L, int status, lua_KContext k) { - (void)L; (void)status; (void)k; - return 3; -} - -static int luaB_pairs (lua_State *L) { - luaL_checkany(L, 1); - if (luaL_getmetafield(L, 1, "__pairs") == LUA_TNIL) { - lua_pushcfunction(L, luaB_next); - lua_pushvalue(L, 1); - lua_pushnil(L); - } - else { - lua_pushvalue(L, 1); - lua_callk(L, 1, 3, 0, pairscont); - } - return 3; -} - - - -static int ipairsaux (lua_State *L) { - lua_Integer i = luaL_checkinteger(L, 2); - i = luaL_intop(+, i, 1); - lua_pushinteger(L, i); - return (lua_geti(L, 1, i) == LUA_TNIL) ? 1 : 2; -} - - - -static int luaB_ipairs (lua_State *L) { - luaL_checkany(L, 1); - lua_pushcfunction(L, ipairsaux); - lua_pushvalue(L, 1); - lua_pushinteger(L, 0); - return 3; -} - - -static int load_aux (lua_State *L, int status, int envidx) { - if (l_likely(status == LUA_OK)) { - if (envidx != 0) { - lua_pushvalue(L, envidx); - if (!lua_setupvalue(L, -2, 1)) - lua_pop(L, 1); - } - return 1; - } - else { - luaL_pushfail(L); - lua_insert(L, -2); - return 2; - } -} - - -static const char *getmode (lua_State *L, int idx) { - const char *mode = luaL_optstring(L, idx, "bt"); - if (strchr(mode, 'B') != NULL) - luaL_argerror(L, idx, "invalid mode"); - return mode; -} - - -static int luaB_loadfile (lua_State *L) { - const char *fname = luaL_optstring(L, 1, NULL); - const char *mode = getmode(L, 2); - int env = (!lua_isnone(L, 3) ? 3 : 0); - int status = luaL_loadfilex(L, fname, mode); - return load_aux(L, status, env); -} - - - - - - -#define RESERVEDSLOT 5 - - - -static const char *generic_reader (lua_State *L, void *ud, size_t *size) { - (void)(ud); - luaL_checkstack(L, 2, "too many nested functions"); - lua_pushvalue(L, 1); - lua_call(L, 0, 1); - if (lua_isnil(L, -1)) { - lua_pop(L, 1); - *size = 0; - return NULL; - } - else if (l_unlikely(!lua_isstring(L, -1))) - luaL_error(L, "reader function must return a string"); - lua_replace(L, RESERVEDSLOT); - return lua_tolstring(L, RESERVEDSLOT, size); -} - - -static int luaB_load (lua_State *L) { - int status; - size_t l; - const char *s = lua_tolstring(L, 1, &l); - const char *mode = getmode(L, 3); - int env = (!lua_isnone(L, 4) ? 4 : 0); - if (s != NULL) { - const char *chunkname = luaL_optstring(L, 2, s); - status = luaL_loadbufferx(L, s, l, chunkname, mode); - } - else { - const char *chunkname = luaL_optstring(L, 2, "=(load)"); - luaL_checktype(L, 1, LUA_TFUNCTION); - lua_settop(L, RESERVEDSLOT); - status = lua_load(L, generic_reader, NULL, chunkname, mode); - } - return load_aux(L, status, env); -} - - - - -static int dofilecont (lua_State *L, int d1, lua_KContext d2) { - (void)d1; (void)d2; - return lua_gettop(L) - 1; -} - - -static int luaB_dofile (lua_State *L) { - const char *fname = luaL_optstring(L, 1, NULL); - lua_settop(L, 1); - if (l_unlikely(luaL_loadfile(L, fname) != LUA_OK)) - return lua_error(L); - lua_callk(L, 0, LUA_MULTRET, 0, dofilecont); - return dofilecont(L, 0, 0); -} - - -static int luaB_assert (lua_State *L) { - if (l_likely(lua_toboolean(L, 1))) - return lua_gettop(L); - else { - luaL_checkany(L, 1); - lua_remove(L, 1); - lua_pushliteral(L, "assertion failed!"); - lua_settop(L, 1); - return luaB_error(L); - } -} - - -static int luaB_select (lua_State *L) { - int n = lua_gettop(L); - if (lua_type(L, 1) == LUA_TSTRING && *lua_tostring(L, 1) == '#') { - lua_pushinteger(L, n-1); - return 1; - } - else { - lua_Integer i = luaL_checkinteger(L, 1); - if (i < 0) i = n + i; - else if (i > n) i = n; - luaL_argcheck(L, 1 <= i, 1, "index out of range"); - return n - (int)i; - } -} - - - -static int finishpcall (lua_State *L, int status, lua_KContext extra) { - if (l_unlikely(status != LUA_OK && status != LUA_YIELD)) { - lua_pushboolean(L, 0); - lua_pushvalue(L, -2); - return 2; - } - else - return lua_gettop(L) - (int)extra; -} - - -static int luaB_pcall (lua_State *L) { - int status; - luaL_checkany(L, 1); - lua_pushboolean(L, 1); - lua_insert(L, 1); - status = lua_pcallk(L, lua_gettop(L) - 2, LUA_MULTRET, 0, 0, finishpcall); - return finishpcall(L, status, 0); -} - - - -static int luaB_xpcall (lua_State *L) { - int status; - int n = lua_gettop(L); - luaL_checktype(L, 2, LUA_TFUNCTION); - lua_pushboolean(L, 1); - lua_pushvalue(L, 1); - lua_rotate(L, 3, 2); - status = lua_pcallk(L, n - 2, LUA_MULTRET, 2, 2, finishpcall); - return finishpcall(L, status, 2); -} - - -static int luaB_tostring (lua_State *L) { - luaL_checkany(L, 1); - luaL_tolstring(L, 1, NULL); - return 1; -} - - -static const luaL_Reg base_funcs[] = { - {"assert", luaB_assert}, - {"collectgarbage", luaB_collectgarbage}, - {"dofile", luaB_dofile}, - {"error", luaB_error}, - {"getmetatable", luaB_getmetatable}, - {"ipairs", luaB_ipairs}, - {"loadfile", luaB_loadfile}, - {"load", luaB_load}, - {"next", luaB_next}, - {"pairs", luaB_pairs}, - {"pcall", luaB_pcall}, - {"print", luaB_print}, - {"warn", luaB_warn}, - {"rawequal", luaB_rawequal}, - {"rawlen", luaB_rawlen}, - {"rawget", luaB_rawget}, - {"rawset", luaB_rawset}, - {"select", luaB_select}, - {"setmetatable", luaB_setmetatable}, - {"tonumber", luaB_tonumber}, - {"tostring", luaB_tostring}, - {"type", luaB_type}, - {"xpcall", luaB_xpcall}, - - {LUA_GNAME, NULL}, - {"_VERSION", NULL}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_base (lua_State *L) { - - lua_pushglobaltable(L); - luaL_setfuncs(L, base_funcs, 0); - - lua_pushvalue(L, -1); - lua_setfield(L, -2, LUA_GNAME); - - lua_pushliteral(L, LUA_VERSION); - lua_setfield(L, -2, "_VERSION"); - return 1; -} - - - -//path: src/imports/../dependencies/lua/lcorolib.c - - -#define lcorolib_c -#define LUA_LIB - - - - - -#include - - - - - - - - - - -static lua_State *getco (lua_State *L) { - lua_State *co = lua_tothread(L, 1); - luaL_argexpected(L, co, 1, "thread"); - return co; -} - - - -static int auxresume (lua_State *L, lua_State *co, int narg) { - int status, nres; - if (l_unlikely(!lua_checkstack(co, narg))) { - lua_pushliteral(L, "too many arguments to resume"); - return -1; - } - lua_xmove(L, co, narg); - status = lua_resume(co, L, narg, &nres); - if (l_likely(status == LUA_OK || status == LUA_YIELD)) { - if (l_unlikely(!lua_checkstack(L, nres + 1))) { - lua_pop(co, nres); - lua_pushliteral(L, "too many results to resume"); - return -1; - } - lua_xmove(co, L, nres); - return nres; - } - else { - lua_xmove(co, L, 1); - return -1; - } -} - - -static int luaB_coresume (lua_State *L) { - lua_State *co = getco(L); - int r; - r = auxresume(L, co, lua_gettop(L) - 1); - if (l_unlikely(r < 0)) { - lua_pushboolean(L, 0); - lua_insert(L, -2); - return 2; - } - else { - lua_pushboolean(L, 1); - lua_insert(L, -(r + 1)); - return r + 1; - } -} - - -static int luaB_auxwrap (lua_State *L) { - lua_State *co = lua_tothread(L, lua_upvalueindex(1)); - int r = auxresume(L, co, lua_gettop(L)); - if (l_unlikely(r < 0)) { - int stat = lua_status(co); - if (stat != LUA_OK && stat != LUA_YIELD) { - stat = lua_closethread(co, L); - lua_assert(stat != LUA_OK); - lua_xmove(co, L, 1); - } - if (stat != LUA_ERRMEM && - lua_type(L, -1) == LUA_TSTRING) { - luaL_where(L, 1); - lua_insert(L, -2); - lua_concat(L, 2); - } - return lua_error(L); - } - return r; -} - - -static int luaB_cocreate (lua_State *L) { - lua_State *NL; - luaL_checktype(L, 1, LUA_TFUNCTION); - NL = lua_newthread(L); - lua_pushvalue(L, 1); - lua_xmove(L, NL, 1); - return 1; -} - - -static int luaB_cowrap (lua_State *L) { - luaB_cocreate(L); - lua_pushcclosure(L, luaB_auxwrap, 1); - return 1; -} - - -static int luaB_yield (lua_State *L) { - return lua_yield(L, lua_gettop(L)); -} - - -#define COS_RUN 0 -#define COS_DEAD 1 -#define COS_YIELD 2 -#define COS_NORM 3 - - -static const char *const statname[] = - {"running", "dead", "suspended", "normal"}; - - -static int auxstatus (lua_State *L, lua_State *co) { - if (L == co) return COS_RUN; - else { - switch (lua_status(co)) { - case LUA_YIELD: - return COS_YIELD; - case LUA_OK: { - lua_Debug ar; - if (lua_getstack(co, 0, &ar)) - return COS_NORM; - else if (lua_gettop(co) == 0) - return COS_DEAD; - else - return COS_YIELD; - } - default: - return COS_DEAD; - } - } -} - - -static int luaB_costatus (lua_State *L) { - lua_State *co = getco(L); - lua_pushstring(L, statname[auxstatus(L, co)]); - return 1; -} - - -static int luaB_yieldable (lua_State *L) { - lua_State *co = lua_isnone(L, 1) ? L : getco(L); - lua_pushboolean(L, lua_isyieldable(co)); - return 1; -} - - -static int luaB_corunning (lua_State *L) { - int ismain = lua_pushthread(L); - lua_pushboolean(L, ismain); - return 2; -} - - -static int luaB_close (lua_State *L) { - lua_State *co = getco(L); - int status = auxstatus(L, co); - switch (status) { - case COS_DEAD: case COS_YIELD: { - status = lua_closethread(co, L); - if (status == LUA_OK) { - lua_pushboolean(L, 1); - return 1; - } - else { - lua_pushboolean(L, 0); - lua_xmove(co, L, 1); - return 2; - } - } - default: - return luaL_error(L, "cannot close a %s coroutine", statname[status]); - } -} - - -static const luaL_Reg co_funcs[] = { - {"create", luaB_cocreate}, - {"resume", luaB_coresume}, - {"running", luaB_corunning}, - {"status", luaB_costatus}, - {"wrap", luaB_cowrap}, - {"yield", luaB_yield}, - {"isyieldable", luaB_yieldable}, - {"close", luaB_close}, - {NULL, NULL} -}; - - - -LUAMOD_API int luaopen_coroutine (lua_State *L) { - luaL_newlib(L, co_funcs); - return 1; -} - - - -//path: src/imports/../dependencies/lua/ldblib.c - - -#define ldblib_c -#define LUA_LIB - - - - - -#include -#include -#include - - - - - - - - - - - -static const char *const HOOKKEY = "_HOOKKEY"; - - - -static void checkstack (lua_State *L, lua_State *L1, int n) { - if (l_unlikely(L != L1 && !lua_checkstack(L1, n))) - luaL_error(L, "stack overflow"); -} - - -static int db_getregistry (lua_State *L) { - lua_pushvalue(L, LUA_REGISTRYINDEX); - return 1; -} - - -static int db_getmetatable (lua_State *L) { - luaL_checkany(L, 1); - if (!lua_getmetatable(L, 1)) { - lua_pushnil(L); - } - return 1; -} - - -static int db_setmetatable (lua_State *L) { - int t = lua_type(L, 2); - luaL_argexpected(L, t == LUA_TNIL || t == LUA_TTABLE, 2, "nil or table"); - lua_settop(L, 2); - lua_setmetatable(L, 1); - return 1; -} - - -static int db_getuservalue (lua_State *L) { - int n = (int)luaL_optinteger(L, 2, 1); - if (lua_type(L, 1) != LUA_TUSERDATA) - luaL_pushfail(L); - else if (lua_getiuservalue(L, 1, n) != LUA_TNONE) { - lua_pushboolean(L, 1); - return 2; - } - return 1; -} - - -static int db_setuservalue (lua_State *L) { - int n = (int)luaL_optinteger(L, 3, 1); - luaL_checktype(L, 1, LUA_TUSERDATA); - luaL_checkany(L, 2); - lua_settop(L, 2); - if (!lua_setiuservalue(L, 1, n)) - luaL_pushfail(L); - return 1; -} - - - -static lua_State *getthread (lua_State *L, int *arg) { - if (lua_isthread(L, 1)) { - *arg = 1; - return lua_tothread(L, 1); - } - else { - *arg = 0; - return L; - } -} - - - -static void settabss (lua_State *L, const char *k, const char *v) { - lua_pushstring(L, v); - lua_setfield(L, -2, k); -} - -static void settabsi (lua_State *L, const char *k, int v) { - lua_pushinteger(L, v); - lua_setfield(L, -2, k); -} - -static void settabsb (lua_State *L, const char *k, int v) { - lua_pushboolean(L, v); - lua_setfield(L, -2, k); -} - - - -static void treatstackoption (lua_State *L, lua_State *L1, const char *fname) { - if (L == L1) - lua_rotate(L, -2, 1); - else - lua_xmove(L1, L, 1); - lua_setfield(L, -2, fname); -} - - - -static int db_getinfo (lua_State *L) { - lua_Debug ar; - int arg; - lua_State *L1 = getthread(L, &arg); - const char *options = luaL_optstring(L, arg+2, "flnSrtu"); - checkstack(L, L1, 3); - luaL_argcheck(L, options[0] != '>', arg + 2, "invalid option '>'"); - if (lua_isfunction(L, arg + 1)) { - options = lua_pushfstring(L, ">%s", options); - lua_pushvalue(L, arg + 1); - lua_xmove(L, L1, 1); - } - else { - if (!lua_getstack(L1, (int)luaL_checkinteger(L, arg + 1), &ar)) { - luaL_pushfail(L); - return 1; - } - } - if (!lua_getinfo(L1, options, &ar)) - return luaL_argerror(L, arg+2, "invalid option"); - lua_newtable(L); - if (strchr(options, 'S')) { - lua_pushlstring(L, ar.source, ar.srclen); - lua_setfield(L, -2, "source"); - settabss(L, "short_src", ar.short_src); - settabsi(L, "linedefined", ar.linedefined); - settabsi(L, "lastlinedefined", ar.lastlinedefined); - settabss(L, "what", ar.what); - } - if (strchr(options, 'l')) - settabsi(L, "currentline", ar.currentline); - if (strchr(options, 'u')) { - settabsi(L, "nups", ar.nups); - settabsi(L, "nparams", ar.nparams); - settabsb(L, "isvararg", ar.isvararg); - } - if (strchr(options, 'n')) { - settabss(L, "name", ar.name); - settabss(L, "namewhat", ar.namewhat); - } - if (strchr(options, 'r')) { - settabsi(L, "ftransfer", ar.ftransfer); - settabsi(L, "ntransfer", ar.ntransfer); - } - if (strchr(options, 't')) - settabsb(L, "istailcall", ar.istailcall); - if (strchr(options, 'L')) - treatstackoption(L, L1, "activelines"); - if (strchr(options, 'f')) - treatstackoption(L, L1, "func"); - return 1; -} - - -static int db_getlocal (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - int nvar = (int)luaL_checkinteger(L, arg + 2); - if (lua_isfunction(L, arg + 1)) { - lua_pushvalue(L, arg + 1); - lua_pushstring(L, lua_getlocal(L, NULL, nvar)); - return 1; - } - else { - lua_Debug ar; - const char *name; - int level = (int)luaL_checkinteger(L, arg + 1); - if (l_unlikely(!lua_getstack(L1, level, &ar))) - return luaL_argerror(L, arg+1, "level out of range"); - checkstack(L, L1, 1); - name = lua_getlocal(L1, &ar, nvar); - if (name) { - lua_xmove(L1, L, 1); - lua_pushstring(L, name); - lua_rotate(L, -2, 1); - return 2; - } - else { - luaL_pushfail(L); - return 1; - } - } -} - - -static int db_setlocal (lua_State *L) { - int arg; - const char *name; - lua_State *L1 = getthread(L, &arg); - lua_Debug ar; - int level = (int)luaL_checkinteger(L, arg + 1); - int nvar = (int)luaL_checkinteger(L, arg + 2); - if (l_unlikely(!lua_getstack(L1, level, &ar))) - return luaL_argerror(L, arg+1, "level out of range"); - luaL_checkany(L, arg+3); - lua_settop(L, arg+3); - checkstack(L, L1, 1); - lua_xmove(L, L1, 1); - name = lua_setlocal(L1, &ar, nvar); - if (name == NULL) - lua_pop(L1, 1); - lua_pushstring(L, name); - return 1; -} - - - -static int auxupvalue (lua_State *L, int get) { - const char *name; - int n = (int)luaL_checkinteger(L, 2); - luaL_checktype(L, 1, LUA_TFUNCTION); - name = get ? lua_getupvalue(L, 1, n) : lua_setupvalue(L, 1, n); - if (name == NULL) return 0; - lua_pushstring(L, name); - lua_insert(L, -(get+1)); - return get + 1; -} - - -static int db_getupvalue (lua_State *L) { - return auxupvalue(L, 1); -} - - -static int db_setupvalue (lua_State *L) { - luaL_checkany(L, 3); - return auxupvalue(L, 0); -} - - - -static void *checkupval (lua_State *L, int argf, int argnup, int *pnup) { - void *id; - int nup = (int)luaL_checkinteger(L, argnup); - luaL_checktype(L, argf, LUA_TFUNCTION); - id = lua_upvalueid(L, argf, nup); - if (pnup) { - luaL_argcheck(L, id != NULL, argnup, "invalid upvalue index"); - *pnup = nup; - } - return id; -} - - -static int db_upvalueid (lua_State *L) { - void *id = checkupval(L, 1, 2, NULL); - if (id != NULL) - lua_pushlightuserdata(L, id); - else - luaL_pushfail(L); - return 1; -} - - -static int db_upvaluejoin (lua_State *L) { - int n1, n2; - checkupval(L, 1, 2, &n1); - checkupval(L, 3, 4, &n2); - luaL_argcheck(L, !lua_iscfunction(L, 1), 1, "Lua function expected"); - luaL_argcheck(L, !lua_iscfunction(L, 3), 3, "Lua function expected"); - lua_upvaluejoin(L, 1, n1, 3, n2); - return 0; -} - - - -static void hookf (lua_State *L, lua_Debug *ar) { - static const char *const hooknames[] = - {"call", "return", "line", "count", "tail call"}; - lua_getfield(L, LUA_REGISTRYINDEX, HOOKKEY); - lua_pushthread(L); - if (lua_rawget(L, -2) == LUA_TFUNCTION) { - lua_pushstring(L, hooknames[(int)ar->event]); - if (ar->currentline >= 0) - lua_pushinteger(L, ar->currentline); - else lua_pushnil(L); - lua_assert(lua_getinfo(L, "lS", ar)); - lua_call(L, 2, 0); - } -} - - - -static int makemask (const char *smask, int count) { - int mask = 0; - if (strchr(smask, 'c')) mask |= LUA_MASKCALL; - if (strchr(smask, 'r')) mask |= LUA_MASKRET; - if (strchr(smask, 'l')) mask |= LUA_MASKLINE; - if (count > 0) mask |= LUA_MASKCOUNT; - return mask; -} - - - -static char *unmakemask (int mask, char *smask) { - int i = 0; - if (mask & LUA_MASKCALL) smask[i++] = 'c'; - if (mask & LUA_MASKRET) smask[i++] = 'r'; - if (mask & LUA_MASKLINE) smask[i++] = 'l'; - smask[i] = '\0'; - return smask; -} - - -static int db_sethook (lua_State *L) { - int arg, mask, count; - lua_Hook func; - lua_State *L1 = getthread(L, &arg); - if (lua_isnoneornil(L, arg+1)) { - lua_settop(L, arg+1); - func = NULL; mask = 0; count = 0; - } - else { - const char *smask = luaL_checkstring(L, arg+2); - luaL_checktype(L, arg+1, LUA_TFUNCTION); - count = (int)luaL_optinteger(L, arg + 3, 0); - func = hookf; mask = makemask(smask, count); - } - if (!luaL_getsubtable(L, LUA_REGISTRYINDEX, HOOKKEY)) { - - lua_pushliteral(L, "k"); - lua_setfield(L, -2, "__mode"); - lua_pushvalue(L, -1); - lua_setmetatable(L, -2); - } - checkstack(L, L1, 1); - lua_pushthread(L1); lua_xmove(L1, L, 1); - lua_pushvalue(L, arg + 1); - lua_rawset(L, -3); - lua_sethook(L1, func, mask, count); - return 0; -} - - -static int db_gethook (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - char buff[5]; - int mask = lua_gethookmask(L1); - lua_Hook hook = lua_gethook(L1); - if (hook == NULL) { - luaL_pushfail(L); - return 1; - } - else if (hook != hookf) - lua_pushliteral(L, "external hook"); - else { - lua_getfield(L, LUA_REGISTRYINDEX, HOOKKEY); - checkstack(L, L1, 1); - lua_pushthread(L1); lua_xmove(L1, L, 1); - lua_rawget(L, -2); - lua_remove(L, -2); - } - lua_pushstring(L, unmakemask(mask, buff)); - lua_pushinteger(L, lua_gethookcount(L1)); - return 3; -} - - -static int db_debug (lua_State *L) { - for (;;) { - char buffer[250]; - lua_writestringerror("%s", "lua_debug> "); - if (fgets(buffer, sizeof(buffer), stdin) == NULL || - strcmp(buffer, "cont\n") == 0) - return 0; - if (luaL_loadbuffer(L, buffer, strlen(buffer), "=(debug command)") || - lua_pcall(L, 0, 0, 0)) - lua_writestringerror("%s\n", luaL_tolstring(L, -1, NULL)); - lua_settop(L, 0); - } -} - - -static int db_traceback (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - const char *msg = lua_tostring(L, arg + 1); - if (msg == NULL && !lua_isnoneornil(L, arg + 1)) - lua_pushvalue(L, arg + 1); - else { - int level = (int)luaL_optinteger(L, arg + 2, (L == L1) ? 1 : 0); - luaL_traceback(L, L1, msg, level); - } - return 1; -} - - -static const luaL_Reg dblib[] = { - {"debug", db_debug}, - {"getuservalue", db_getuservalue}, - {"gethook", db_gethook}, - {"getinfo", db_getinfo}, - {"getlocal", db_getlocal}, - {"getregistry", db_getregistry}, - {"getmetatable", db_getmetatable}, - {"getupvalue", db_getupvalue}, - {"upvaluejoin", db_upvaluejoin}, - {"upvalueid", db_upvalueid}, - {"setuservalue", db_setuservalue}, - {"sethook", db_sethook}, - {"setlocal", db_setlocal}, - {"setmetatable", db_setmetatable}, - {"setupvalue", db_setupvalue}, - {"traceback", db_traceback}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_debug (lua_State *L) { - luaL_newlib(L, dblib); - return 1; -} - - - -//path: src/imports/../dependencies/lua/liolib.c - - -#define liolib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include -#include -#include - - - - - - - - - - - - - -#if !defined(l_checkmode) - - -#if !defined(L_MODEEXT) -#define L_MODEEXT "b" -#endif - - -static int l_checkmode (const char *mode) { - return (*mode != '\0' && strchr("rwa", *(mode++)) != NULL && - (*mode != '+' || ((void)(++mode), 1)) && - (strspn(mode, L_MODEEXT) == strlen(mode))); -} - -#endif - - - -#if !defined(l_popen) - -#if defined(LUA_USE_POSIX) - -#define l_popen(L,c,m) (fflush(NULL), popen(c,m)) -#define l_pclose(L,file) (pclose(file)) - -#elif defined(LUA_USE_WINDOWS) - -#define l_popen(L,c,m) (_popen(c,m)) -#define l_pclose(L,file) (_pclose(file)) - -#if !defined(l_checkmodep) - -#define l_checkmodep(m) ((m[0] == 'r' || m[0] == 'w') && \ - (m[1] == '\0' || ((m[1] == 'b' || m[1] == 't') && m[2] == '\0'))) -#endif - -#else - - -#define l_popen(L,c,m) \ - ((void)c, (void)m, \ - luaL_error(L, "'popen' not supported"), \ - (FILE*)0) -#define l_pclose(L,file) ((void)L, (void)file, -1) - -#endif - -#endif - - -#if !defined(l_checkmodep) - -#define l_checkmodep(m) ((m[0] == 'r' || m[0] == 'w') && m[1] == '\0') -#endif - - - - -#if !defined(l_getc) - -#if defined(LUA_USE_POSIX) -#define l_getc(f) getc_unlocked(f) -#define l_lockfile(f) flockfile(f) -#define l_unlockfile(f) funlockfile(f) -#else -#define l_getc(f) getc(f) -#define l_lockfile(f) ((void)0) -#define l_unlockfile(f) ((void)0) -#endif - -#endif - - - - -#if !defined(l_fseek) - -#if defined(LUA_USE_POSIX) - -#include - -#define l_fseek(f,o,w) fseeko(f,o,w) -#define l_ftell(f) ftello(f) -#define l_seeknum off_t - -#elif defined(LUA_USE_WINDOWS) && !defined(_CRTIMP_TYPEINFO) \ - && defined(_MSC_VER) && (_MSC_VER >= 1400) - - -#define l_fseek(f,o,w) _fseeki64(f,o,w) -#define l_ftell(f) _ftelli64(f) -#define l_seeknum __int64 - -#else - - -#define l_fseek(f,o,w) fseek(f,o,w) -#define l_ftell(f) ftell(f) -#define l_seeknum long - -#endif - -#endif - - - - - -#define IO_PREFIX "_IO_" -#define IOPREF_LEN (sizeof(IO_PREFIX)/sizeof(char) - 1) -#define IO_INPUT (IO_PREFIX "input") -#define IO_OUTPUT (IO_PREFIX "output") - - -typedef luaL_Stream LStream; - - -#define tolstream(L) ((LStream *)luaL_checkudata(L, 1, LUA_FILEHANDLE)) - -#define isclosed(p) ((p)->closef == NULL) - - -static int io_type (lua_State *L) { - LStream *p; - luaL_checkany(L, 1); - p = (LStream *)luaL_testudata(L, 1, LUA_FILEHANDLE); - if (p == NULL) - luaL_pushfail(L); - else if (isclosed(p)) - lua_pushliteral(L, "closed file"); - else - lua_pushliteral(L, "file"); - return 1; -} - - -static int f_tostring (lua_State *L) { - LStream *p = tolstream(L); - if (isclosed(p)) - lua_pushliteral(L, "file (closed)"); - else - lua_pushfstring(L, "file (%p)", p->f); - return 1; -} - - -static FILE *tofile (lua_State *L) { - LStream *p = tolstream(L); - if (l_unlikely(isclosed(p))) - luaL_error(L, "attempt to use a closed file"); - lua_assert(p->f); - return p->f; -} - - - -static LStream *newprefile (lua_State *L) { - LStream *p = (LStream *)lua_newuserdatauv(L, sizeof(LStream), 0); - p->closef = NULL; - luaL_setmetatable(L, LUA_FILEHANDLE); - return p; -} - - - -static int aux_close (lua_State *L) { - LStream *p = tolstream(L); - volatile lua_CFunction cf = p->closef; - p->closef = NULL; - return (*cf)(L); -} - - -static int f_close (lua_State *L) { - tofile(L); - return aux_close(L); -} - - -static int io_close (lua_State *L) { - if (lua_isnone(L, 1)) - lua_getfield(L, LUA_REGISTRYINDEX, IO_OUTPUT); - return f_close(L); -} - - -static int f_gc (lua_State *L) { - LStream *p = tolstream(L); - if (!isclosed(p) && p->f != NULL) - aux_close(L); - return 0; -} - - - -static int io_fclose (lua_State *L) { - LStream *p = tolstream(L); - int res = fclose(p->f); - return luaL_fileresult(L, (res == 0), NULL); -} - - -static LStream *newfile (lua_State *L) { - LStream *p = newprefile(L); - p->f = NULL; - p->closef = &io_fclose; - return p; -} - - -static void opencheck (lua_State *L, const char *fname, const char *mode) { - LStream *p = newfile(L); - p->f = fopen(fname, mode); - if (l_unlikely(p->f == NULL)) - luaL_error(L, "cannot open file '%s' (%s)", fname, strerror(errno)); -} - - -static int io_open (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - const char *mode = luaL_optstring(L, 2, "r"); - LStream *p = newfile(L); - const char *md = mode; - luaL_argcheck(L, l_checkmode(md), 2, "invalid mode"); - p->f = fopen(filename, mode); - return (p->f == NULL) ? luaL_fileresult(L, 0, filename) : 1; -} - - - -static int io_pclose (lua_State *L) { - LStream *p = tolstream(L); - errno = 0; - return luaL_execresult(L, l_pclose(L, p->f)); -} - - -static int io_popen (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - const char *mode = luaL_optstring(L, 2, "r"); - LStream *p = newprefile(L); - luaL_argcheck(L, l_checkmodep(mode), 2, "invalid mode"); - p->f = l_popen(L, filename, mode); - p->closef = &io_pclose; - return (p->f == NULL) ? luaL_fileresult(L, 0, filename) : 1; -} - - -static int io_tmpfile (lua_State *L) { - LStream *p = newfile(L); - p->f = tmpfile(); - return (p->f == NULL) ? luaL_fileresult(L, 0, NULL) : 1; -} - - -static FILE *getiofile (lua_State *L, const char *findex) { - LStream *p; - lua_getfield(L, LUA_REGISTRYINDEX, findex); - p = (LStream *)lua_touserdata(L, -1); - if (l_unlikely(isclosed(p))) - luaL_error(L, "default %s file is closed", findex + IOPREF_LEN); - return p->f; -} - - -static int g_iofile (lua_State *L, const char *f, const char *mode) { - if (!lua_isnoneornil(L, 1)) { - const char *filename = lua_tostring(L, 1); - if (filename) - opencheck(L, filename, mode); - else { - tofile(L); - lua_pushvalue(L, 1); - } - lua_setfield(L, LUA_REGISTRYINDEX, f); - } - - lua_getfield(L, LUA_REGISTRYINDEX, f); - return 1; -} - - -static int io_input (lua_State *L) { - return g_iofile(L, IO_INPUT, "r"); -} - - -static int io_output (lua_State *L) { - return g_iofile(L, IO_OUTPUT, "w"); -} - - -static int io_readline (lua_State *L); - - - -#define MAXARGLINE 250 - - -static void aux_lines (lua_State *L, int toclose) { - int n = lua_gettop(L) - 1; - luaL_argcheck(L, n <= MAXARGLINE, MAXARGLINE + 2, "too many arguments"); - lua_pushvalue(L, 1); - lua_pushinteger(L, n); - lua_pushboolean(L, toclose); - lua_rotate(L, 2, 3); - lua_pushcclosure(L, io_readline, 3 + n); -} - - -static int f_lines (lua_State *L) { - tofile(L); - aux_lines(L, 0); - return 1; -} - - - -static int io_lines (lua_State *L) { - int toclose; - if (lua_isnone(L, 1)) lua_pushnil(L); - if (lua_isnil(L, 1)) { - lua_getfield(L, LUA_REGISTRYINDEX, IO_INPUT); - lua_replace(L, 1); - tofile(L); - toclose = 0; - } - else { - const char *filename = luaL_checkstring(L, 1); - opencheck(L, filename, "r"); - lua_replace(L, 1); - toclose = 1; - } - aux_lines(L, toclose); - if (toclose) { - lua_pushnil(L); - lua_pushnil(L); - lua_pushvalue(L, 1); - return 4; - } - else - return 1; -} - - - - - - -#if !defined (L_MAXLENNUM) -#define L_MAXLENNUM 200 -#endif - - - -typedef struct { - FILE *f; - int c; - int n; - char buff[L_MAXLENNUM + 1]; -} RN; - - - -static int nextc (RN *rn) { - if (l_unlikely(rn->n >= L_MAXLENNUM)) { - rn->buff[0] = '\0'; - return 0; - } - else { - rn->buff[rn->n++] = rn->c; - rn->c = l_getc(rn->f); - return 1; - } -} - - - -static int test2 (RN *rn, const char *set) { - if (rn->c == set[0] || rn->c == set[1]) - return nextc(rn); - else return 0; -} - - - -static int readdigits (RN *rn, int hex) { - int count = 0; - while ((hex ? isxdigit(rn->c) : isdigit(rn->c)) && nextc(rn)) - count++; - return count; -} - - - -static int read_number (lua_State *L, FILE *f) { - RN rn; - int count = 0; - int hex = 0; - char decp[2]; - rn.f = f; rn.n = 0; - decp[0] = lua_getlocaledecpoint(); - decp[1] = '.'; - l_lockfile(rn.f); - do { rn.c = l_getc(rn.f); } while (isspace(rn.c)); - test2(&rn, "-+"); - if (test2(&rn, "00")) { - if (test2(&rn, "xX")) hex = 1; - else count = 1; - } - count += readdigits(&rn, hex); - if (test2(&rn, decp)) - count += readdigits(&rn, hex); - if (count > 0 && test2(&rn, (hex ? "pP" : "eE"))) { - test2(&rn, "-+"); - readdigits(&rn, 0); - } - ungetc(rn.c, rn.f); - l_unlockfile(rn.f); - rn.buff[rn.n] = '\0'; - if (l_likely(lua_stringtonumber(L, rn.buff))) - return 1; - else { - lua_pushnil(L); - return 0; - } -} - - -static int test_eof (lua_State *L, FILE *f) { - int c = getc(f); - ungetc(c, f); - lua_pushliteral(L, ""); - return (c != EOF); -} - - -static int read_line (lua_State *L, FILE *f, int chop) { - luaL_Buffer b; - int c; - luaL_buffinit(L, &b); - do { - char *buff = luaL_prepbuffer(&b); - int i = 0; - l_lockfile(f); - while (i < LUAL_BUFFERSIZE && (c = l_getc(f)) != EOF && c != '\n') - buff[i++] = c; - l_unlockfile(f); - luaL_addsize(&b, i); - } while (c != EOF && c != '\n'); - if (!chop && c == '\n') - luaL_addchar(&b, c); - luaL_pushresult(&b); - - return (c == '\n' || lua_rawlen(L, -1) > 0); -} - - -static void read_all (lua_State *L, FILE *f) { - size_t nr; - luaL_Buffer b; - luaL_buffinit(L, &b); - do { - char *p = luaL_prepbuffer(&b); - nr = fread(p, sizeof(char), LUAL_BUFFERSIZE, f); - luaL_addsize(&b, nr); - } while (nr == LUAL_BUFFERSIZE); - luaL_pushresult(&b); -} - - -static int read_chars (lua_State *L, FILE *f, size_t n) { - size_t nr; - char *p; - luaL_Buffer b; - luaL_buffinit(L, &b); - p = luaL_prepbuffsize(&b, n); - nr = fread(p, sizeof(char), n, f); - luaL_addsize(&b, nr); - luaL_pushresult(&b); - return (nr > 0); -} - - -static int g_read (lua_State *L, FILE *f, int first) { - int nargs = lua_gettop(L) - 1; - int n, success; - clearerr(f); - if (nargs == 0) { - success = read_line(L, f, 1); - n = first + 1; - } - else { - - luaL_checkstack(L, nargs+LUA_MINSTACK, "too many arguments"); - success = 1; - for (n = first; nargs-- && success; n++) { - if (lua_type(L, n) == LUA_TNUMBER) { - size_t l = (size_t)luaL_checkinteger(L, n); - success = (l == 0) ? test_eof(L, f) : read_chars(L, f, l); - } - else { - const char *p = luaL_checkstring(L, n); - if (*p == '*') p++; - switch (*p) { - case 'n': - success = read_number(L, f); - break; - case 'l': - success = read_line(L, f, 1); - break; - case 'L': - success = read_line(L, f, 0); - break; - case 'a': - read_all(L, f); - success = 1; - break; - default: - return luaL_argerror(L, n, "invalid format"); - } - } - } - } - if (ferror(f)) - return luaL_fileresult(L, 0, NULL); - if (!success) { - lua_pop(L, 1); - luaL_pushfail(L); - } - return n - first; -} - - -static int io_read (lua_State *L) { - return g_read(L, getiofile(L, IO_INPUT), 1); -} - - -static int f_read (lua_State *L) { - return g_read(L, tofile(L), 2); -} - - - -static int io_readline (lua_State *L) { - LStream *p = (LStream *)lua_touserdata(L, lua_upvalueindex(1)); - int i; - int n = (int)lua_tointeger(L, lua_upvalueindex(2)); - if (isclosed(p)) - return luaL_error(L, "file is already closed"); - lua_settop(L , 1); - luaL_checkstack(L, n, "too many arguments"); - for (i = 1; i <= n; i++) - lua_pushvalue(L, lua_upvalueindex(3 + i)); - n = g_read(L, p->f, 2); - lua_assert(n > 0); - if (lua_toboolean(L, -n)) - return n; - else { - if (n > 1) { - - return luaL_error(L, "%s", lua_tostring(L, -n + 1)); - } - if (lua_toboolean(L, lua_upvalueindex(3))) { - lua_settop(L, 0); - lua_pushvalue(L, lua_upvalueindex(1)); - aux_close(L); - } - return 0; - } -} - - - - -static int g_write (lua_State *L, FILE *f, int arg) { - int nargs = lua_gettop(L) - arg; - int status = 1; - for (; nargs--; arg++) { - if (lua_type(L, arg) == LUA_TNUMBER) { - - int len = lua_isinteger(L, arg) - ? fprintf(f, LUA_INTEGER_FMT, - (LUAI_UACINT)lua_tointeger(L, arg)) - : fprintf(f, LUA_NUMBER_FMT, - (LUAI_UACNUMBER)lua_tonumber(L, arg)); - status = status && (len > 0); - } - else { - size_t l; - const char *s = luaL_checklstring(L, arg, &l); - status = status && (fwrite(s, sizeof(char), l, f) == l); - } - } - if (l_likely(status)) - return 1; - else return luaL_fileresult(L, status, NULL); -} - - -static int io_write (lua_State *L) { - return g_write(L, getiofile(L, IO_OUTPUT), 1); -} - - -static int f_write (lua_State *L) { - FILE *f = tofile(L); - lua_pushvalue(L, 1); - return g_write(L, f, 2); -} - - -static int f_seek (lua_State *L) { - static const int mode[] = {SEEK_SET, SEEK_CUR, SEEK_END}; - static const char *const modenames[] = {"set", "cur", "end", NULL}; - FILE *f = tofile(L); - int op = luaL_checkoption(L, 2, "cur", modenames); - lua_Integer p3 = luaL_optinteger(L, 3, 0); - l_seeknum offset = (l_seeknum)p3; - luaL_argcheck(L, (lua_Integer)offset == p3, 3, - "not an integer in proper range"); - op = l_fseek(f, offset, mode[op]); - if (l_unlikely(op)) - return luaL_fileresult(L, 0, NULL); - else { - lua_pushinteger(L, (lua_Integer)l_ftell(f)); - return 1; - } -} - - -static int f_setvbuf (lua_State *L) { - static const int mode[] = {_IONBF, _IOFBF, _IOLBF}; - static const char *const modenames[] = {"no", "full", "line", NULL}; - FILE *f = tofile(L); - int op = luaL_checkoption(L, 2, NULL, modenames); - lua_Integer sz = luaL_optinteger(L, 3, LUAL_BUFFERSIZE); - int res = setvbuf(f, NULL, mode[op], (size_t)sz); - return luaL_fileresult(L, res == 0, NULL); -} - - - -static int io_flush (lua_State *L) { - return luaL_fileresult(L, fflush(getiofile(L, IO_OUTPUT)) == 0, NULL); -} - - -static int f_flush (lua_State *L) { - return luaL_fileresult(L, fflush(tofile(L)) == 0, NULL); -} - - - -static const luaL_Reg iolib[] = { - {"close", io_close}, - {"flush", io_flush}, - {"input", io_input}, - {"lines", io_lines}, - {"open", io_open}, - {"output", io_output}, - {"popen", io_popen}, - {"read", io_read}, - {"tmpfile", io_tmpfile}, - {"type", io_type}, - {"write", io_write}, - {NULL, NULL} -}; - - - -static const luaL_Reg meth[] = { - {"read", f_read}, - {"write", f_write}, - {"lines", f_lines}, - {"flush", f_flush}, - {"seek", f_seek}, - {"close", f_close}, - {"setvbuf", f_setvbuf}, - {NULL, NULL} -}; - - - -static const luaL_Reg metameth[] = { - {"__index", NULL}, - {"__gc", f_gc}, - {"__close", f_gc}, - {"__tostring", f_tostring}, - {NULL, NULL} -}; - - -static void createmeta (lua_State *L) { - luaL_newmetatable(L, LUA_FILEHANDLE); - luaL_setfuncs(L, metameth, 0); - luaL_newlibtable(L, meth); - luaL_setfuncs(L, meth, 0); - lua_setfield(L, -2, "__index"); - lua_pop(L, 1); -} - - - -static int io_noclose (lua_State *L) { - LStream *p = tolstream(L); - p->closef = &io_noclose; - luaL_pushfail(L); - lua_pushliteral(L, "cannot close standard file"); - return 2; -} - - -static void createstdfile (lua_State *L, FILE *f, const char *k, - const char *fname) { - LStream *p = newprefile(L); - p->f = f; - p->closef = &io_noclose; - if (k != NULL) { - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, k); - } - lua_setfield(L, -2, fname); -} - - -LUAMOD_API int luaopen_io (lua_State *L) { - luaL_newlib(L, iolib); - createmeta(L); - - createstdfile(L, stdin, IO_INPUT, "stdin"); - createstdfile(L, stdout, IO_OUTPUT, "stdout"); - createstdfile(L, stderr, NULL, "stderr"); - return 1; -} - - - -//path: src/imports/../dependencies/lua/lmathlib.c - -#define lmathlib_c -#define LUA_LIB - - - - -#include -#include -#include -#include - - - - - - - - - - -#undef PI -#define PI (l_mathop(3.141592653589793238462643383279502884)) - - -static int math_abs (lua_State *L) { - if (lua_isinteger(L, 1)) { - lua_Integer n = lua_tointeger(L, 1); - if (n < 0) n = (lua_Integer)(0u - (lua_Unsigned)n); - lua_pushinteger(L, n); - } - else - lua_pushnumber(L, l_mathop(private_lua_cembed_fabs)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_sin (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_sin)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_cos (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_cos)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_tan (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_tan)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_asin (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_asin)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_acos (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_acos)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_atan (lua_State *L) { - lua_Number y = luaL_checknumber(L, 1); - lua_Number x = luaL_optnumber(L, 2, 1); - lua_pushnumber(L, l_mathop(private_lua_cembed_atan2)(y, x)); - return 1; -} - - -static int math_toint (lua_State *L) { - int valid; - lua_Integer n = lua_tointegerx(L, 1, &valid); - if (l_likely(valid)) - lua_pushinteger(L, n); - else { - luaL_checkany(L, 1); - luaL_pushfail(L); - } - return 1; -} - - -static void pushnumint (lua_State *L, lua_Number d) { - lua_Integer n; - if (lua_numbertointeger(d, &n)) - lua_pushinteger(L, n); - else - lua_pushnumber(L, d); -} - - -static int math_floor (lua_State *L) { - if (lua_isinteger(L, 1)) - lua_settop(L, 1); - else { - lua_Number d = l_mathop(private_lua_embed_floor)(luaL_checknumber(L, 1)); - pushnumint(L, d); - } - return 1; -} - - -static int math_ceil (lua_State *L) { - if (lua_isinteger(L, 1)) - lua_settop(L, 1); - else { - lua_Number d = l_mathop(private_lua_cembed_ceil)(luaL_checknumber(L, 1)); - pushnumint(L, d); - } - return 1; -} - - -static int math_fmod (lua_State *L) { - if (lua_isinteger(L, 1) && lua_isinteger(L, 2)) { - lua_Integer d = lua_tointeger(L, 2); - if ((lua_Unsigned)d + 1u <= 1u) { - luaL_argcheck(L, d != 0, 2, "zero"); - lua_pushinteger(L, 0); - } - else - lua_pushinteger(L, lua_tointeger(L, 1) % d); - } - else - lua_pushnumber(L, l_mathop(private_lua_embed_fmod)(luaL_checknumber(L, 1), - luaL_checknumber(L, 2))); - return 1; -} - - - -static int math_modf (lua_State *L) { - if (lua_isinteger(L ,1)) { - lua_settop(L, 1); - lua_pushnumber(L, 0); - } - else { - lua_Number n = luaL_checknumber(L, 1); - - lua_Number ip = (n < 0) ? l_mathop(private_lua_cembed_ceil)(n) : l_mathop(private_lua_embed_floor)(n); - pushnumint(L, ip); - - lua_pushnumber(L, (n == ip) ? l_mathop(0.0) : (n - ip)); - } - return 2; -} - - -static int math_sqrt (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_sqrt)(luaL_checknumber(L, 1))); - return 1; -} - - -static int math_ult (lua_State *L) { - lua_Integer a = luaL_checkinteger(L, 1); - lua_Integer b = luaL_checkinteger(L, 2); - lua_pushboolean(L, (lua_Unsigned)a < (lua_Unsigned)b); - return 1; -} - -static int math_log (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - lua_Number res; - if (lua_isnoneornil(L, 2)) - res = l_mathop(private_lua_cembed_log)(x); - else { - lua_Number base = luaL_checknumber(L, 2); -#if !defined(LUA_USE_C89) - if (base == l_mathop(2.0)) - res = l_mathop(private_lua_cembed_log2)(x); - else -#endif - if (base == l_mathop(10.0)) - res = l_mathop(private_lua_embed_log10)(x); - else - res = l_mathop(private_lua_cembed_log)(x)/l_mathop(private_lua_cembed_log)(base); - } - lua_pushnumber(L, res); - return 1; -} - -static int math_exp (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_exp)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_deg (lua_State *L) { - lua_pushnumber(L, luaL_checknumber(L, 1) * (l_mathop(180.0) / PI)); - return 1; -} - -static int math_rad (lua_State *L) { - lua_pushnumber(L, luaL_checknumber(L, 1) * (PI / l_mathop(180.0))); - return 1; -} - - -static int math_min (lua_State *L) { - int n = lua_gettop(L); - int imin = 1; - int i; - luaL_argcheck(L, n >= 1, 1, "value expected"); - for (i = 2; i <= n; i++) { - if (lua_compare(L, i, imin, LUA_OPLT)) - imin = i; - } - lua_pushvalue(L, imin); - return 1; -} - - -static int math_max (lua_State *L) { - int n = lua_gettop(L); - int imax = 1; - int i; - luaL_argcheck(L, n >= 1, 1, "value expected"); - for (i = 2; i <= n; i++) { - if (lua_compare(L, imax, i, LUA_OPLT)) - imax = i; - } - lua_pushvalue(L, imax); - return 1; -} - - -static int math_type (lua_State *L) { - if (lua_type(L, 1) == LUA_TNUMBER) - lua_pushstring(L, (lua_isinteger(L, 1)) ? "integer" : "float"); - else { - luaL_checkany(L, 1); - luaL_pushfail(L); - } - return 1; -} - - - - - - - - - -#define FIGS l_floatatt(MANT_DIG) - -#if FIGS > 64 - -#undef FIGS -#define FIGS 64 -#endif - - - -#if !defined(LUA_RAND32) && !defined(Rand64) - - - -#if ((ULONG_MAX >> 31) >> 31) >= 3 - - -#define Rand64 unsigned long -#define SRand64 long - -#elif !defined(LUA_USE_C89) && defined(LLONG_MAX) - - -#define Rand64 unsigned long long -#define SRand64 long long - -#elif ((LUA_MAXUNSIGNED >> 31) >> 31) >= 3 - - -#define Rand64 lua_Unsigned -#define SRand64 lua_Integer - -#endif - -#endif - - -#if defined(Rand64) - - - - -#define trim64(x) ((x) & 0xffffffffffffffffu) - - - -static Rand64 rotl (Rand64 x, int n) { - return (x << n) | (trim64(x) >> (64 - n)); -} - -static Rand64 nextrand (Rand64 *state) { - Rand64 state0 = state[0]; - Rand64 state1 = state[1]; - Rand64 state2 = state[2] ^ state0; - Rand64 state3 = state[3] ^ state1; - Rand64 res = rotl(state1 * 5, 7) * 9; - state[0] = state0 ^ state3; - state[1] = state1 ^ state2; - state[2] = state2 ^ (state1 << 17); - state[3] = rotl(state3, 45); - return res; -} - - - - - -#define shift64_FIG (64 - FIGS) - - -#define scaleFIG (l_mathop(0.5) / ((Rand64)1 << (FIGS - 1))) - -static lua_Number I2d (Rand64 x) { - SRand64 sx = (SRand64)(trim64(x) >> shift64_FIG); - lua_Number res = (lua_Number)(sx) * scaleFIG; - if (sx < 0) - res += l_mathop(1.0); - lua_assert(0 <= res && res < 1); - return res; -} - - -#define I2UInt(x) ((lua_Unsigned)trim64(x)) - - -#define Int2I(x) ((Rand64)(x)) - - -#else - - -#if LUAI_IS32INT -typedef unsigned int lu_int32; -#else -typedef unsigned long lu_int32; -#endif - - - -typedef struct Rand64 { - lu_int32 h; - lu_int32 l; -} Rand64; - - - - - -#define trim32(x) ((x) & 0xffffffffu) - - - - - -static Rand64 packI (lu_int32 h, lu_int32 l) { - Rand64 result; - result.h = h; - result.l = l; - return result; -} - - -static Rand64 Ishl (Rand64 i, int n) { - lua_assert(n > 0 && n < 32); - return packI((i.h << n) | (trim32(i.l) >> (32 - n)), i.l << n); -} - - -static void Ixor (Rand64 *i1, Rand64 i2) { - i1->h ^= i2.h; - i1->l ^= i2.l; -} - - -static Rand64 Iadd (Rand64 i1, Rand64 i2) { - Rand64 result = packI(i1.h + i2.h, i1.l + i2.l); - if (trim32(result.l) < trim32(i1.l)) - result.h++; - return result; -} - - -static Rand64 times5 (Rand64 i) { - return Iadd(Ishl(i, 2), i); -} - - -static Rand64 times9 (Rand64 i) { - return Iadd(Ishl(i, 3), i); -} - - -static Rand64 rotl (Rand64 i, int n) { - lua_assert(n > 0 && n < 32); - return packI((i.h << n) | (trim32(i.l) >> (32 - n)), - (trim32(i.h) >> (32 - n)) | (i.l << n)); -} - - -static Rand64 rotl1 (Rand64 i, int n) { - lua_assert(n > 32 && n < 64); - n = 64 - n; - return packI((trim32(i.h) >> n) | (i.l << (32 - n)), - (i.h << (32 - n)) | (trim32(i.l) >> n)); -} - - -static Rand64 nextrand (Rand64 *state) { - Rand64 res = times9(rotl(times5(state[1]), 7)); - Rand64 t = Ishl(state[1], 17); - Ixor(&state[2], state[0]); - Ixor(&state[3], state[1]); - Ixor(&state[1], state[2]); - Ixor(&state[0], state[3]); - Ixor(&state[2], t); - state[3] = rotl1(state[3], 45); - return res; -} - - - - - -#define UONE ((lu_int32)1) - - -#if FIGS <= 32 - - -#define scaleFIG (l_mathop(0.5) / (UONE << (FIGS - 1))) - - -static lua_Number I2d (Rand64 x) { - lua_Number h = (lua_Number)(trim32(x.h) >> (32 - FIGS)); - return h * scaleFIG; -} - -#else - - -#define scaleFIG \ - (l_mathop(1.0) / (UONE << 30) / l_mathop(8.0) / (UONE << (FIGS - 33))) - - -#define shiftLOW (64 - FIGS) - - -#define shiftHI ((lua_Number)(UONE << (FIGS - 33)) * l_mathop(2.0)) - - -static lua_Number I2d (Rand64 x) { - lua_Number h = (lua_Number)trim32(x.h) * shiftHI; - lua_Number l = (lua_Number)(trim32(x.l) >> shiftLOW); - return (h + l) * scaleFIG; -} - -#endif - - - -static lua_Unsigned I2UInt (Rand64 x) { - return (((lua_Unsigned)trim32(x.h) << 31) << 1) | (lua_Unsigned)trim32(x.l); -} - - -static Rand64 Int2I (lua_Unsigned n) { - return packI((lu_int32)((n >> 31) >> 1), (lu_int32)n); -} - -#endif - - - -typedef struct { - Rand64 s[4]; -} RanState; - - - -static lua_Unsigned project (lua_Unsigned ran, lua_Unsigned n, - RanState *state) { - if ((n & (n + 1)) == 0) - return ran & n; - else { - lua_Unsigned lim = n; - - lim |= (lim >> 1); - lim |= (lim >> 2); - lim |= (lim >> 4); - lim |= (lim >> 8); - lim |= (lim >> 16); -#if (LUA_MAXUNSIGNED >> 31) >= 3 - lim |= (lim >> 32); -#endif - lua_assert((lim & (lim + 1)) == 0 - && lim >= n - && (lim >> 1) < n); - while ((ran &= lim) > n) - ran = I2UInt(nextrand(state->s)); - return ran; - } -} - - -static int math_random (lua_State *L) { - lua_Integer low, up; - lua_Unsigned p; - RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1)); - Rand64 rv = nextrand(state->s); - switch (lua_gettop(L)) { - case 0: { - lua_pushnumber(L, I2d(rv)); - return 1; - } - case 1: { - low = 1; - up = luaL_checkinteger(L, 1); - if (up == 0) { - lua_pushinteger(L, I2UInt(rv)); - return 1; - } - break; - } - case 2: { - low = luaL_checkinteger(L, 1); - up = luaL_checkinteger(L, 2); - break; - } - default: return luaL_error(L, "wrong number of arguments"); - } - - luaL_argcheck(L, low <= up, 1, "interval is empty"); - - p = project(I2UInt(rv), (lua_Unsigned)up - (lua_Unsigned)low, state); - lua_pushinteger(L, p + (lua_Unsigned)low); - return 1; -} - - -static void setseed (lua_State *L, Rand64 *state, - lua_Unsigned n1, lua_Unsigned n2) { - int i; - state[0] = Int2I(n1); - state[1] = Int2I(0xff); - state[2] = Int2I(n2); - state[3] = Int2I(0); - for (i = 0; i < 16; i++) - nextrand(state); - lua_pushinteger(L, n1); - lua_pushinteger(L, n2); -} - - -static int math_randomseed (lua_State *L) { - RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1)); - lua_Unsigned n1, n2; - if (lua_isnone(L, 1)) { - n1 = luaL_makeseed(L); - n2 = I2UInt(nextrand(state->s)); - } - else { - n1 = luaL_checkinteger(L, 1); - n2 = luaL_optinteger(L, 2, 0); - } - setseed(L, state->s, n1, n2); - return 2; -} - - -static const luaL_Reg randfuncs[] = { - {"random", math_random}, - {"randomseed", math_randomseed}, - {NULL, NULL} -}; - - - -static void setrandfunc (lua_State *L) { - RanState *state = (RanState *)lua_newuserdatauv(L, sizeof(RanState), 0); - setseed(L, state->s, luaL_makeseed(L), 0); - lua_pop(L, 2); - luaL_setfuncs(L, randfuncs, 1); -} - - - - - -#if defined(LUA_COMPAT_MATHLIB) - -static int math_cosh (lua_State *L) { - lua_pushnumber(L, l_mathop(cosh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_sinh (lua_State *L) { - lua_pushnumber(L, l_mathop(sinh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_tanh (lua_State *L) { - lua_pushnumber(L, l_mathop(tanh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_pow (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - lua_Number y = luaL_checknumber(L, 2); - lua_pushnumber(L, l_mathop(pow)(x, y)); - return 1; -} - -static int math_frexp (lua_State *L) { - int e; - lua_pushnumber(L, l_mathop(frexp)(luaL_checknumber(L, 1), &e)); - lua_pushinteger(L, e); - return 2; -} - -static int math_ldexp (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - int ep = (int)luaL_checkinteger(L, 2); - lua_pushnumber(L, l_mathop(ldexp)(x, ep)); - return 1; -} - -static int math_log10 (lua_State *L) { - lua_pushnumber(L, l_mathop(log10)(luaL_checknumber(L, 1))); - return 1; -} - -#endif - - - - -static const luaL_Reg mathlib[] = { - {"abs", math_abs}, - {"acos", math_acos}, - {"asin", math_asin}, - {"atan", math_atan}, - {"ceil", math_ceil}, - {"cos", math_cos}, - {"deg", math_deg}, - {"exp", math_exp}, - {"tointeger", math_toint}, - {"floor", math_floor}, - {"fmod", math_fmod}, - {"ult", math_ult}, - {"log", math_log}, - {"max", math_max}, - {"min", math_min}, - {"modf", math_modf}, - {"rad", math_rad}, - {"sin", math_sin}, - {"sqrt", math_sqrt}, - {"tan", math_tan}, - {"type", math_type}, -#if defined(LUA_COMPAT_MATHLIB) - {"atan2", math_atan}, - {"cosh", math_cosh}, - {"sinh", math_sinh}, - {"tanh", math_tanh}, - {"pow", math_pow}, - {"frexp", math_frexp}, - {"ldexp", math_ldexp}, - {"log10", math_log10}, -#endif - - {"random", NULL}, - {"randomseed", NULL}, - {"pi", NULL}, - {"huge", NULL}, - {"maxinteger", NULL}, - {"mininteger", NULL}, - {NULL, NULL} -}; - - - -LUAMOD_API int luaopen_math (lua_State *L) { - luaL_newlib(L, mathlib); - lua_pushnumber(L, PI); - lua_setfield(L, -2, "pi"); - lua_pushnumber(L, (lua_Number)HUGE_VAL); - lua_setfield(L, -2, "huge"); - lua_pushinteger(L, LUA_MAXINTEGER); - lua_setfield(L, -2, "maxinteger"); - lua_pushinteger(L, LUA_MININTEGER); - lua_setfield(L, -2, "mininteger"); - setrandfunc(L); - return 1; -} - - - -//path: src/imports/../dependencies/lua/loadlib.c - - -#define loadlib_c -#define LUA_LIB - - - - - -#include -#include -#include - - - - - - - - - - - -#if !defined(LUA_CSUBSEP) -#define LUA_CSUBSEP LUA_DIRSEP -#endif - -#if !defined(LUA_LSUBSEP) -#define LUA_LSUBSEP LUA_DIRSEP -#endif - - - -#define LUA_POF "luaopen_" - - -#define LUA_OFSEP "_" - - - -static const char *const CLIBS = "_CLIBS"; - -#define LIB_FAIL "open" - - -#define setprogdir(L) ((void)0) - - - -typedef void (*voidf)(void); - - - - - -static void lsys_unloadlib (void *lib); - - -static void *lsys_load (lua_State *L, const char *path, int seeglb); - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym); - - - - -#if defined(LUA_USE_DLOPEN) - - -#include - - -#if defined(__GNUC__) -#define cast_func(p) (__extension__ (lua_CFunction)(p)) -#else -#define cast_func(p) ((lua_CFunction)(p)) -#endif - - -static void lsys_unloadlib (void *lib) { - dlclose(lib); -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - void *lib = dlopen(path, RTLD_NOW | (seeglb ? RTLD_GLOBAL : RTLD_LOCAL)); - if (l_unlikely(lib == NULL)) - lua_pushstring(L, dlerror()); - return lib; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - lua_CFunction f = cast_func(dlsym(lib, sym)); - if (l_unlikely(f == NULL)) - lua_pushstring(L, dlerror()); - return f; -} - - - - - -#elif defined(LUA_DL_DLL) - - -#include - - - -#if !defined(LUA_LLE_FLAGS) -#define LUA_LLE_FLAGS 0 -#endif - - -#undef setprogdir - - - -static void setprogdir (lua_State *L) { - char buff[MAX_PATH + 1]; - char *lb; - DWORD nsize = sizeof(buff)/sizeof(char); - DWORD n = GetModuleFileNameA(NULL, buff, nsize); - if (n == 0 || n == nsize || (lb = strrchr(buff, '\\')) == NULL) - luaL_error(L, "unable to get ModuleFileName"); - else { - *lb = '\0'; - luaL_gsub(L, lua_tostring(L, -1), LUA_EXEC_DIR, buff); - lua_remove(L, -2); - } -} - - - - -static void pusherror (lua_State *L) { - int error = GetLastError(); - char buffer[128]; - if (FormatMessageA(FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM, - NULL, error, 0, buffer, sizeof(buffer)/sizeof(char), NULL)) - lua_pushstring(L, buffer); - else - lua_pushfstring(L, "system error %d\n", error); -} - -static void lsys_unloadlib (void *lib) { - FreeLibrary((HMODULE)lib); -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - HMODULE lib = LoadLibraryExA(path, NULL, LUA_LLE_FLAGS); - (void)(seeglb); - if (lib == NULL) pusherror(L); - return lib; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - lua_CFunction f = (lua_CFunction)(voidf)GetProcAddress((HMODULE)lib, sym); - if (f == NULL) pusherror(L); - return f; -} - - - - -#else - - -#undef LIB_FAIL -#define LIB_FAIL "absent" - - -#define DLMSG "dynamic libraries not enabled; check your Lua installation" - - -static void lsys_unloadlib (void *lib) { - (void)(lib); -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - (void)(path); (void)(seeglb); - lua_pushliteral(L, DLMSG); - return NULL; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - (void)(lib); (void)(sym); - lua_pushliteral(L, DLMSG); - return NULL; -} - - -#endif - - - - - -#if !defined(LUA_PATH_VAR) -#define LUA_PATH_VAR "LUA_PATH" -#endif - -#if !defined(LUA_CPATH_VAR) -#define LUA_CPATH_VAR "LUA_CPATH" -#endif - - - - -static int noenv (lua_State *L) { - int b; - lua_getfield(L, LUA_REGISTRYINDEX, "LUA_NOENV"); - b = lua_toboolean(L, -1); - lua_pop(L, 1); - return b; -} - - - -static void setpath (lua_State *L, const char *fieldname, - const char *envname, - const char *dft) { - const char *dftmark; - const char *nver = lua_pushfstring(L, "%s%s", envname, LUA_VERSUFFIX); - const char *path = getenv(nver); - if (path == NULL) - path = getenv(envname); - if (path == NULL || noenv(L)) - lua_pushextlstring(L, dft, strlen(dft), NULL, NULL); - else if ((dftmark = strstr(path, LUA_PATH_SEP LUA_PATH_SEP)) == NULL) - lua_pushstring(L, path); - else { - size_t len = strlen(path); - luaL_Buffer b; - luaL_buffinit(L, &b); - if (path < dftmark) { - luaL_addlstring(&b, path, dftmark - path); - luaL_addchar(&b, *LUA_PATH_SEP); - } - luaL_addstring(&b, dft); - if (dftmark < path + len - 2) { - luaL_addchar(&b, *LUA_PATH_SEP); - luaL_addlstring(&b, dftmark + 2, (path + len - 2) - dftmark); - } - luaL_pushresult(&b); - } - setprogdir(L); - lua_setfield(L, -3, fieldname); - lua_pop(L, 1); -} - - - - - -static void *checkclib (lua_State *L, const char *path) { - void *plib; - lua_getfield(L, LUA_REGISTRYINDEX, CLIBS); - lua_getfield(L, -1, path); - plib = lua_touserdata(L, -1); - lua_pop(L, 2); - return plib; -} - - - -static void addtoclib (lua_State *L, const char *path, void *plib) { - lua_getfield(L, LUA_REGISTRYINDEX, CLIBS); - lua_pushlightuserdata(L, plib); - lua_pushvalue(L, -1); - lua_setfield(L, -3, path); - lua_rawseti(L, -2, luaL_len(L, -2) + 1); - lua_pop(L, 1); -} - - - -static int gctm (lua_State *L) { - lua_Integer n = luaL_len(L, 1); - for (; n >= 1; n--) { - lua_rawgeti(L, 1, n); - lsys_unloadlib(lua_touserdata(L, -1)); - lua_pop(L, 1); - } - return 0; -} - - - - -#define ERRLIB 1 -#define ERRFUNC 2 - - -static int lookforfunc (lua_State *L, const char *path, const char *sym) { - void *reg = checkclib(L, path); - if (reg == NULL) { - reg = lsys_load(L, path, *sym == '*'); - if (reg == NULL) return ERRLIB; - addtoclib(L, path, reg); - } - if (*sym == '*') { - lua_pushboolean(L, 1); - return 0; - } - else { - lua_CFunction f = lsys_sym(L, reg, sym); - if (f == NULL) - return ERRFUNC; - lua_pushcfunction(L, f); - return 0; - } -} - - -static int ll_loadlib (lua_State *L) { - const char *path = luaL_checkstring(L, 1); - const char *init = luaL_checkstring(L, 2); - int stat = lookforfunc(L, path, init); - if (l_likely(stat == 0)) - return 1; - else { - luaL_pushfail(L); - lua_insert(L, -2); - lua_pushstring(L, (stat == ERRLIB) ? LIB_FAIL : "init"); - return 3; - } -} - - - - - - -static int readable (const char *filename) { - FILE *f = fopen(filename, "r"); - if (f == NULL) return 0; - fclose(f); - return 1; -} - - - -static const char *getnextfilename (char **path, char *end) { - char *sep; - char *name = *path; - if (name == end) - return NULL; - else if (*name == '\0') { - *name = *LUA_PATH_SEP; - name++; - } - sep = strchr(name, *LUA_PATH_SEP); - if (sep == NULL) - sep = end; - *sep = '\0'; - *path = sep; - return name; -} - - - -static void pusherrornotfound (lua_State *L, const char *path) { - luaL_Buffer b; - luaL_buffinit(L, &b); - luaL_addstring(&b, "no file '"); - luaL_addgsub(&b, path, LUA_PATH_SEP, "'\n\tno file '"); - luaL_addstring(&b, "'"); - luaL_pushresult(&b); -} - - -static const char *searchpath (lua_State *L, const char *name, - const char *path, - const char *sep, - const char *dirsep) { - luaL_Buffer buff; - char *pathname; - char *endpathname; - const char *filename; - - if (*sep != '\0' && strchr(name, *sep) != NULL) - name = luaL_gsub(L, name, sep, dirsep); - luaL_buffinit(L, &buff); - - luaL_addgsub(&buff, path, LUA_PATH_MARK, name); - luaL_addchar(&buff, '\0'); - pathname = luaL_buffaddr(&buff); - endpathname = pathname + luaL_bufflen(&buff) - 1; - while ((filename = getnextfilename(&pathname, endpathname)) != NULL) { - if (readable(filename)) - return lua_pushstring(L, filename); - } - luaL_pushresult(&buff); - pusherrornotfound(L, lua_tostring(L, -1)); - return NULL; -} - - -static int ll_searchpath (lua_State *L) { - const char *f = searchpath(L, luaL_checkstring(L, 1), - luaL_checkstring(L, 2), - luaL_optstring(L, 3, "."), - luaL_optstring(L, 4, LUA_DIRSEP)); - if (f != NULL) return 1; - else { - luaL_pushfail(L); - lua_insert(L, -2); - return 2; - } -} - - -static const char *findfile (lua_State *L, const char *name, - const char *pname, - const char *dirsep) { - const char *path; - lua_getfield(L, lua_upvalueindex(1), pname); - path = lua_tostring(L, -1); - if (l_unlikely(path == NULL)) - luaL_error(L, "'package.%s' must be a string", pname); - return searchpath(L, name, path, ".", dirsep); -} - - -static int checkload (lua_State *L, int stat, const char *filename) { - if (l_likely(stat)) { - lua_pushstring(L, filename); - return 2; - } - else - return luaL_error(L, "error loading module '%s' from file '%s':\n\t%s", - lua_tostring(L, 1), filename, lua_tostring(L, -1)); -} - - -static int searcher_Lua (lua_State *L) { - const char *filename; - const char *name = luaL_checkstring(L, 1); - filename = findfile(L, name, "path", LUA_LSUBSEP); - if (filename == NULL) return 1; - return checkload(L, (luaL_loadfile(L, filename) == LUA_OK), filename); -} - - - -static int loadfunc (lua_State *L, const char *filename, const char *modname) { - const char *openfunc; - const char *mark; - modname = luaL_gsub(L, modname, ".", LUA_OFSEP); - mark = strchr(modname, *LUA_IGMARK); - if (mark) { - int stat; - openfunc = lua_pushlstring(L, modname, mark - modname); - openfunc = lua_pushfstring(L, LUA_POF"%s", openfunc); - stat = lookforfunc(L, filename, openfunc); - if (stat != ERRFUNC) return stat; - modname = mark + 1; - } - openfunc = lua_pushfstring(L, LUA_POF"%s", modname); - return lookforfunc(L, filename, openfunc); -} - - -static int searcher_C (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - const char *filename = findfile(L, name, "cpath", LUA_CSUBSEP); - if (filename == NULL) return 1; - return checkload(L, (loadfunc(L, filename, name) == 0), filename); -} - - -static int searcher_Croot (lua_State *L) { - const char *filename; - const char *name = luaL_checkstring(L, 1); - const char *p = strchr(name, '.'); - int stat; - if (p == NULL) return 0; - lua_pushlstring(L, name, p - name); - filename = findfile(L, lua_tostring(L, -1), "cpath", LUA_CSUBSEP); - if (filename == NULL) return 1; - if ((stat = loadfunc(L, filename, name)) != 0) { - if (stat != ERRFUNC) - return checkload(L, 0, filename); - else { - lua_pushfstring(L, "no module '%s' in file '%s'", name, filename); - return 1; - } - } - lua_pushstring(L, filename); - return 2; -} - - -static int searcher_preload (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - lua_getfield(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - if (lua_getfield(L, -1, name) == LUA_TNIL) { - lua_pushfstring(L, "no field package.preload['%s']", name); - return 1; - } - else { - lua_pushliteral(L, ":preload:"); - return 2; - } -} - - -static void findloader (lua_State *L, const char *name) { - int i; - luaL_Buffer msg; - - if (l_unlikely(lua_getfield(L, lua_upvalueindex(1), "searchers") - != LUA_TTABLE)) - luaL_error(L, "'package.searchers' must be a table"); - luaL_buffinit(L, &msg); - - for (i = 1; ; i++) { - luaL_addstring(&msg, "\n\t"); - if (l_unlikely(lua_rawgeti(L, 3, i) == LUA_TNIL)) { - lua_pop(L, 1); - luaL_buffsub(&msg, 2); - luaL_pushresult(&msg); - luaL_error(L, "module '%s' not found:%s", name, lua_tostring(L, -1)); - } - lua_pushstring(L, name); - lua_call(L, 1, 2); - if (lua_isfunction(L, -2)) - return; - else if (lua_isstring(L, -2)) { - lua_pop(L, 1); - luaL_addvalue(&msg); - } - else { - lua_pop(L, 2); - luaL_buffsub(&msg, 2); - } - } -} - - -static int ll_require (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - lua_settop(L, 1); - lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_getfield(L, 2, name); - if (lua_toboolean(L, -1)) - return 1; - - lua_pop(L, 1); - findloader(L, name); - lua_rotate(L, -2, 1); - lua_pushvalue(L, 1); - lua_pushvalue(L, -3); - - lua_call(L, 2, 1); - - if (!lua_isnil(L, -1)) - lua_setfield(L, 2, name); - else - lua_pop(L, 1); - if (lua_getfield(L, 2, name) == LUA_TNIL) { - lua_pushboolean(L, 1); - lua_copy(L, -1, -2); - lua_setfield(L, 2, name); - } - lua_rotate(L, -2, 1); - return 2; -} - - - - - - -static const luaL_Reg pk_funcs[] = { - {"loadlib", ll_loadlib}, - {"searchpath", ll_searchpath}, - - {"preload", NULL}, - {"cpath", NULL}, - {"path", NULL}, - {"searchers", NULL}, - {"loaded", NULL}, - {NULL, NULL} -}; - - -static const luaL_Reg ll_funcs[] = { - {"require", ll_require}, - {NULL, NULL} -}; - - -static void createsearcherstable (lua_State *L) { - static const lua_CFunction searchers[] = { - searcher_preload, - searcher_Lua, - searcher_C, - searcher_Croot, - NULL - }; - int i; - - lua_createtable(L, sizeof(searchers)/sizeof(searchers[0]) - 1, 0); - - for (i=0; searchers[i] != NULL; i++) { - lua_pushvalue(L, -2); - lua_pushcclosure(L, searchers[i], 1); - lua_rawseti(L, -2, i+1); - } - lua_setfield(L, -2, "searchers"); -} - - - -static void createclibstable (lua_State *L) { - luaL_getsubtable(L, LUA_REGISTRYINDEX, CLIBS); - lua_createtable(L, 0, 1); - lua_pushcfunction(L, gctm); - lua_setfield(L, -2, "__gc"); - lua_setmetatable(L, -2); -} - - -LUAMOD_API int luaopen_package (lua_State *L) { - createclibstable(L); - luaL_newlib(L, pk_funcs); - createsearcherstable(L); - - setpath(L, "path", LUA_PATH_VAR, LUA_PATH_DEFAULT); - setpath(L, "cpath", LUA_CPATH_VAR, LUA_CPATH_DEFAULT); - - lua_pushliteral(L, LUA_DIRSEP "\n" LUA_PATH_SEP "\n" LUA_PATH_MARK "\n" - LUA_EXEC_DIR "\n" LUA_IGMARK "\n"); - lua_setfield(L, -2, "config"); - - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_setfield(L, -2, "loaded"); - - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - lua_setfield(L, -2, "preload"); - lua_pushglobaltable(L); - lua_pushvalue(L, -2); - luaL_setfuncs(L, ll_funcs, 1); - lua_pop(L, 1); - return 1; -} - - - -//path: src/imports/../dependencies/lua/loslib.c - - -#define loslib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include -#include - - - - - - - - - - - -#if !defined(LUA_STRFTIMEOPTIONS) - -#if defined(LUA_USE_WINDOWS) -#define LUA_STRFTIMEOPTIONS "aAbBcdHIjmMpSUwWxXyYzZ%" \ - "||" "#c#x#d#H#I#j#m#M#S#U#w#W#y#Y" -#elif defined(LUA_USE_C89) -#define LUA_STRFTIMEOPTIONS "aAbBcdHIjmMpSUwWxXyYZ%" -#else -#define LUA_STRFTIMEOPTIONS "aAbBcCdDeFgGhHIjmMnprRStTuUVwWxXyYzZ%" \ - "||" "EcECExEXEyEY" "OdOeOHOIOmOMOSOuOUOVOwOWOy" -#endif - -#endif - - - - - - -#if !defined(LUA_NUMTIME) - -#define l_timet lua_Integer -#define l_pushtime(L,t) lua_pushinteger(L,(lua_Integer)(t)) -#define l_gettime(L,arg) luaL_checkinteger(L, arg) - -#else - -#define l_timet lua_Number -#define l_pushtime(L,t) lua_pushnumber(L,(lua_Number)(t)) -#define l_gettime(L,arg) luaL_checknumber(L, arg) - -#endif - - -#if !defined(l_gmtime) - - -#if defined(LUA_USE_POSIX) - -#define l_gmtime(t,r) gmtime_r(t,r) -#define l_localtime(t,r) localtime_r(t,r) - -#else - - -#define l_gmtime(t,r) ((void)(r)->tm_sec, gmtime(t)) -#define l_localtime(t,r) ((void)(r)->tm_sec, localtime(t)) - -#endif - -#endif - - - - - -#if !defined(lua_tmpnam) - -#if defined(LUA_USE_POSIX) - -#include - -#define LUA_TMPNAMBUFSIZE 32 - -#if !defined(LUA_TMPNAMTEMPLATE) -#define LUA_TMPNAMTEMPLATE "/tmp/lua_XXXXXX" -#endif - -#define lua_tmpnam(b,e) { \ - strcpy(b, LUA_TMPNAMTEMPLATE); \ - e = mkstemp(b); \ - if (e != -1) close(e); \ - e = (e == -1); } - -#else - - -#define LUA_TMPNAMBUFSIZE L_tmpnam -#define lua_tmpnam(b,e) { e = (tmpnam(b) == NULL); } - -#endif - -#endif - - - -#if !defined(l_system) -#if defined(LUA_USE_IOS) - -#define l_system(cmd) ((cmd) == NULL ? 0 : -1) -#else -#define l_system(cmd) system(cmd) -#endif -#endif - - -static int os_execute (lua_State *L) { - const char *cmd = luaL_optstring(L, 1, NULL); - int stat; - errno = 0; - stat = l_system(cmd); - if (cmd != NULL) - return luaL_execresult(L, stat); - else { - lua_pushboolean(L, stat); - return 1; - } -} - - -static int os_remove (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - return luaL_fileresult(L, remove(filename) == 0, filename); -} - - -static int os_rename (lua_State *L) { - const char *fromname = luaL_checkstring(L, 1); - const char *toname = luaL_checkstring(L, 2); - return luaL_fileresult(L, rename(fromname, toname) == 0, NULL); -} -#ifdef __linux -static int os_tmpname(lua_State *L) { - char buff[100]; - const char *tmpdir = "/tmp/lua_XXXXXX"; - int fd = mkstemp(buff); - if (fd == -1) { - return luaL_error(L, "unable to generate a unique filename"); - } - - close(fd); - lua_pushstring(L, buff); - return 1; -} -#endif -#ifdef _WIN32 - -static int os_tmpname(lua_State *L) { - char buff[100] = {0}; - const char *template_file = "lua_XXXXXX"; - - GetTempPathA(sizeof(buff), buff); - - UINT fd = GetTempFileNameA(buff, template_file, 0, buff); - if (fd == -1) { - return luaL_error(L, "unable to generate a unique filename"); - } - lua_pushstring(L, buff); - return 1; -} -#endif -static int os_getenv (lua_State *L) { - lua_pushstring(L, getenv(luaL_checkstring(L, 1))); - return 1; -} - - -static int os_clock (lua_State *L) { - lua_pushnumber(L, ((lua_Number)clock())/(lua_Number)CLOCKS_PER_SEC); - return 1; -} - - - - - -static void setfield (lua_State *L, const char *key, int value, int delta) { - #if (defined(LUA_NUMTIME) && LUA_MAXINTEGER <= INT_MAX) - if (l_unlikely(value > LUA_MAXINTEGER - delta)) - luaL_error(L, "field '%s' is out-of-bound", key); - #endif - lua_pushinteger(L, (lua_Integer)value + delta); - lua_setfield(L, -2, key); -} - - -static void setboolfield (lua_State *L, const char *key, int value) { - if (value < 0) - return; - lua_pushboolean(L, value); - lua_setfield(L, -2, key); -} - - - -static void setallfields (lua_State *L, struct tm *stm) { - setfield(L, "year", stm->tm_year, 1900); - setfield(L, "month", stm->tm_mon, 1); - setfield(L, "day", stm->tm_mday, 0); - setfield(L, "hour", stm->tm_hour, 0); - setfield(L, "min", stm->tm_min, 0); - setfield(L, "sec", stm->tm_sec, 0); - setfield(L, "yday", stm->tm_yday, 1); - setfield(L, "wday", stm->tm_wday, 1); - setboolfield(L, "isdst", stm->tm_isdst); -} - - -static int getboolfield (lua_State *L, const char *key) { - int res; - res = (lua_getfield(L, -1, key) == LUA_TNIL) ? -1 : lua_toboolean(L, -1); - lua_pop(L, 1); - return res; -} - - -static int getfield (lua_State *L, const char *key, int d, int delta) { - int isnum; - int t = lua_getfield(L, -1, key); - lua_Integer res = lua_tointegerx(L, -1, &isnum); - if (!isnum) { - if (l_unlikely(t != LUA_TNIL)) - return luaL_error(L, "field '%s' is not an integer", key); - else if (l_unlikely(d < 0)) - return luaL_error(L, "field '%s' missing in date table", key); - res = d; - } - else { - if (!(res >= 0 ? res - delta <= INT_MAX : INT_MIN + delta <= res)) - return luaL_error(L, "field '%s' is out-of-bound", key); - res -= delta; - } - lua_pop(L, 1); - return (int)res; -} - - -static const char *checkoption (lua_State *L, const char *conv, - ptrdiff_t convlen, char *buff) { - const char *option = LUA_STRFTIMEOPTIONS; - int oplen = 1; - for (; *option != '\0' && oplen <= convlen; option += oplen) { - if (*option == '|') - oplen++; - else if (memcmp(conv, option, oplen) == 0) { - memcpy(buff, conv, oplen); - buff[oplen] = '\0'; - return conv + oplen; - } - } - luaL_argerror(L, 1, - lua_pushfstring(L, "invalid conversion specifier '%%%s'", conv)); - return conv; -} - - -static time_t l_checktime (lua_State *L, int arg) { - l_timet t = l_gettime(L, arg); - luaL_argcheck(L, (time_t)t == t, arg, "time out-of-bounds"); - return (time_t)t; -} - - - -#define SIZETIMEFMT 250 - - -static int os_date (lua_State *L) { - size_t slen; - const char *s = luaL_optlstring(L, 1, "%c", &slen); - time_t t = luaL_opt(L, l_checktime, 2, time(NULL)); - const char *se = s + slen; - struct tm tmr, *stm; - if (*s == '!') { - stm = l_gmtime(&t, &tmr); - s++; - } - else - stm = l_localtime(&t, &tmr); - if (stm == NULL) - return luaL_error(L, - "date result cannot be represented in this installation"); - if (strcmp(s, "*t") == 0) { - lua_createtable(L, 0, 9); - setallfields(L, stm); - } - else { - char cc[4]; - luaL_Buffer b; - cc[0] = '%'; - luaL_buffinit(L, &b); - while (s < se) { - if (*s != '%') - luaL_addchar(&b, *s++); - else { - size_t reslen; - char *buff = luaL_prepbuffsize(&b, SIZETIMEFMT); - s++; - s = checkoption(L, s, se - s, cc + 1); - reslen = strftime(buff, SIZETIMEFMT, cc, stm); - luaL_addsize(&b, reslen); - } - } - luaL_pushresult(&b); - } - return 1; -} - - -static int os_time (lua_State *L) { - time_t t; - if (lua_isnoneornil(L, 1)) - t = time(NULL); - else { - struct tm ts; - luaL_checktype(L, 1, LUA_TTABLE); - lua_settop(L, 1); - ts.tm_year = getfield(L, "year", -1, 1900); - ts.tm_mon = getfield(L, "month", -1, 1); - ts.tm_mday = getfield(L, "day", -1, 0); - ts.tm_hour = getfield(L, "hour", 12, 0); - ts.tm_min = getfield(L, "min", 0, 0); - ts.tm_sec = getfield(L, "sec", 0, 0); - ts.tm_isdst = getboolfield(L, "isdst"); - t = mktime(&ts); - setallfields(L, &ts); - } - if (t != (time_t)(l_timet)t || t == (time_t)(-1)) - return luaL_error(L, - "time result cannot be represented in this installation"); - l_pushtime(L, t); - return 1; -} - - -static int os_difftime (lua_State *L) { - time_t t1 = l_checktime(L, 1); - time_t t2 = l_checktime(L, 2); - lua_pushnumber(L, (lua_Number)difftime(t1, t2)); - return 1; -} - - - - -static int os_setlocale (lua_State *L) { - static const int cat[] = {LC_ALL, LC_COLLATE, LC_CTYPE, LC_MONETARY, - LC_NUMERIC, LC_TIME}; - static const char *const catnames[] = {"all", "collate", "ctype", "monetary", - "numeric", "time", NULL}; - const char *l = luaL_optstring(L, 1, NULL); - int op = luaL_checkoption(L, 2, "all", catnames); - lua_pushstring(L, setlocale(cat[op], l)); - return 1; -} - - -static int os_exit (lua_State *L) { - int status; - if (lua_isboolean(L, 1)) - status = (lua_toboolean(L, 1) ? EXIT_SUCCESS : EXIT_FAILURE); - else - status = (int)luaL_optinteger(L, 1, EXIT_SUCCESS); - if (lua_toboolean(L, 2)) - lua_close(L); - if (L) exit(status); - return 0; -} - - -static const luaL_Reg syslib[] = { - {"clock", os_clock}, - {"date", os_date}, - {"difftime", os_difftime}, - {"execute", os_execute}, - {"exit", os_exit}, - {"getenv", os_getenv}, - {"remove", os_remove}, - {"rename", os_rename}, - {"setlocale", os_setlocale}, - {"time", os_time}, - {"tmpname", os_tmpname}, - {NULL, NULL} -}; - - - - - -LUAMOD_API int luaopen_os (lua_State *L) { - luaL_newlib(L, syslib); - return 1; -} - - - -//path: src/imports/../dependencies/lua/lstrlib.c - - -#define lstrlib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include -#include -#include -#include -#include - - - - - - - - - - - -#if !defined(LUA_MAXCAPTURES) -#define LUA_MAXCAPTURES 32 -#endif - - - -#define uchar(c) ((unsigned char)(c)) - - - -#define MAX_SIZET ((size_t)(~(size_t)0)) - -#define MAXSIZE \ - (sizeof(size_t) < sizeof(int) ? MAX_SIZET : (size_t)(INT_MAX)) - - - - -static int str_len (lua_State *L) { - size_t l; - luaL_checklstring(L, 1, &l); - lua_pushinteger(L, (lua_Integer)l); - return 1; -} - - - -static size_t posrelatI (lua_Integer pos, size_t len) { - if (pos > 0) - return (size_t)pos; - else if (pos == 0) - return 1; - else if (pos < -(lua_Integer)len) - return 1; - else return len + (size_t)pos + 1; -} - - - -static size_t getendpos (lua_State *L, int arg, lua_Integer def, - size_t len) { - lua_Integer pos = luaL_optinteger(L, arg, def); - if (pos > (lua_Integer)len) - return len; - else if (pos >= 0) - return (size_t)pos; - else if (pos < -(lua_Integer)len) - return 0; - else return len + (size_t)pos + 1; -} - - -static int str_sub (lua_State *L) { - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - size_t start = posrelatI(luaL_checkinteger(L, 2), l); - size_t end = getendpos(L, 3, -1, l); - if (start <= end) - lua_pushlstring(L, s + start - 1, (end - start) + 1); - else lua_pushliteral(L, ""); - return 1; -} - - -static int str_reverse (lua_State *L) { - size_t l, i; - luaL_Buffer b; - const char *s = luaL_checklstring(L, 1, &l); - char *p = luaL_buffinitsize(L, &b, l); - for (i = 0; i < l; i++) - p[i] = s[l - i - 1]; - luaL_pushresultsize(&b, l); - return 1; -} - - -static int str_lower (lua_State *L) { - size_t l; - size_t i; - luaL_Buffer b; - const char *s = luaL_checklstring(L, 1, &l); - char *p = luaL_buffinitsize(L, &b, l); - for (i=0; i MAXSIZE / n)) - return luaL_error(L, "resulting string too large"); - else { - size_t totallen = (size_t)n * l + (size_t)(n - 1) * lsep; - luaL_Buffer b; - char *p = luaL_buffinitsize(L, &b, totallen); - while (n-- > 1) { - memcpy(p, s, l * sizeof(char)); p += l; - if (lsep > 0) { - memcpy(p, sep, lsep * sizeof(char)); - p += lsep; - } - } - memcpy(p, s, l * sizeof(char)); - luaL_pushresultsize(&b, totallen); - } - return 1; -} - - -static int str_byte (lua_State *L) { - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - lua_Integer pi = luaL_optinteger(L, 2, 1); - size_t posi = posrelatI(pi, l); - size_t pose = getendpos(L, 3, pi, l); - int n, i; - if (posi > pose) return 0; - if (l_unlikely(pose - posi >= (size_t)INT_MAX)) - return luaL_error(L, "string slice too long"); - n = (int)(pose - posi) + 1; - luaL_checkstack(L, n, "string slice too long"); - for (i=0; iinit) { - state->init = 1; - luaL_buffinit(L, &state->B); - } - if (b == NULL) { - luaL_pushresult(&state->B); - lua_replace(L, 1); - } - else - luaL_addlstring(&state->B, (const char *)b, size); - return 0; -} - - -static int str_dump (lua_State *L) { - struct str_Writer state; - int strip = lua_toboolean(L, 2); - luaL_argcheck(L, lua_type(L, 1) == LUA_TFUNCTION && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - - lua_pushvalue(L, 1); - state.init = 0; - lua_dump(L, writer, &state, strip); - lua_settop(L, 1); - return 1; -} - - - - - -#if defined(LUA_NOCVTS2N) - - - -static const luaL_Reg stringmetamethods[] = { - {"__index", NULL}, - {NULL, NULL} -}; - -#else - -static int tonum (lua_State *L, int arg) { - if (lua_type(L, arg) == LUA_TNUMBER) { - lua_pushvalue(L, arg); - return 1; - } - else { - size_t len; - const char *s = lua_tolstring(L, arg, &len); - return (s != NULL && lua_stringtonumber(L, s) == len + 1); - } -} - - -static void trymt (lua_State *L, const char *mtname) { - lua_settop(L, 2); - if (l_unlikely(lua_type(L, 2) == LUA_TSTRING || - !luaL_getmetafield(L, 2, mtname))) - luaL_error(L, "attempt to %s a '%s' with a '%s'", mtname + 2, - luaL_typename(L, -2), luaL_typename(L, -1)); - lua_insert(L, -3); - lua_call(L, 2, 1); -} - - -static int arith (lua_State *L, int op, const char *mtname) { - if (tonum(L, 1) && tonum(L, 2)) - lua_arith(L, op); - else - trymt(L, mtname); - return 1; -} - - -static int arith_add (lua_State *L) { - return arith(L, LUA_OPADD, "__add"); -} - -static int arith_sub (lua_State *L) { - return arith(L, LUA_OPSUB, "__sub"); -} - -static int arith_mul (lua_State *L) { - return arith(L, LUA_OPMUL, "__mul"); -} - -static int arith_mod (lua_State *L) { - return arith(L, LUA_OPMOD, "__mod"); -} - -static int arith_pow (lua_State *L) { - return arith(L, LUA_OPPOW, "__pow"); -} - -static int arith_div (lua_State *L) { - return arith(L, LUA_OPDIV, "__div"); -} - -static int arith_idiv (lua_State *L) { - return arith(L, LUA_OPIDIV, "__idiv"); -} - -static int arith_unm (lua_State *L) { - return arith(L, LUA_OPUNM, "__unm"); -} - - -static const luaL_Reg stringmetamethods[] = { - {"__add", arith_add}, - {"__sub", arith_sub}, - {"__mul", arith_mul}, - {"__mod", arith_mod}, - {"__pow", arith_pow}, - {"__div", arith_div}, - {"__idiv", arith_idiv}, - {"__unm", arith_unm}, - {"__index", NULL}, - {NULL, NULL} -}; - -#endif - - - - - - -#define CAP_UNFINISHED (-1) -#define CAP_POSITION (-2) - - -typedef struct MatchState { - const char *src_init; - const char *src_end; - const char *p_end; - lua_State *L; - int matchdepth; - unsigned char level; - struct { - const char *init; - ptrdiff_t len; - } capture[LUA_MAXCAPTURES]; -} MatchState; - - - -static const char *match (MatchState *ms, const char *s, const char *p); - - - -#if !defined(MAXCCALLS) -#define MAXCCALLS 200 -#endif - - -#define L_ESC '%' -#define SPECIALS "^$*+?.([%-" - - -static int check_capture (MatchState *ms, int l) { - l -= '1'; - if (l_unlikely(l < 0 || l >= ms->level || - ms->capture[l].len == CAP_UNFINISHED)) - return luaL_error(ms->L, "invalid capture index %%%d", l + 1); - return l; -} - - -static int capture_to_close (MatchState *ms) { - int level = ms->level; - for (level--; level>=0; level--) - if (ms->capture[level].len == CAP_UNFINISHED) return level; - return luaL_error(ms->L, "invalid pattern capture"); -} - - -static const char *classend (MatchState *ms, const char *p) { - switch (*p++) { - case L_ESC: { - if (l_unlikely(p == ms->p_end)) - luaL_error(ms->L, "malformed pattern (ends with '%%')"); - return p+1; - } - case '[': { - if (*p == '^') p++; - do { - if (l_unlikely(p == ms->p_end)) - luaL_error(ms->L, "malformed pattern (missing ']')"); - if (*(p++) == L_ESC && p < ms->p_end) - p++; - } while (*p != ']'); - return p+1; - } - default: { - return p; - } - } -} - - -static int match_class (int c, int cl) { - int res; - switch (tolower(cl)) { - case 'a' : res = isalpha(c); break; - case 'c' : res = iscntrl(c); break; - case 'd' : res = isdigit(c); break; - case 'g' : res = isgraph(c); break; - case 'l' : res = islower(c); break; - case 'p' : res = ispunct(c); break; - case 's' : res = isspace(c); break; - case 'u' : res = isupper(c); break; - case 'w' : res = isalnum(c); break; - case 'x' : res = isxdigit(c); break; - case 'z' : res = (c == 0); break; - default: return (cl == c); - } - return (islower(cl) ? res : !res); -} - - -static int matchbracketclass (int c, const char *p, const char *ec) { - int sig = 1; - if (*(p+1) == '^') { - sig = 0; - p++; - } - while (++p < ec) { - if (*p == L_ESC) { - p++; - if (match_class(c, uchar(*p))) - return sig; - } - else if ((*(p+1) == '-') && (p+2 < ec)) { - p+=2; - if (uchar(*(p-2)) <= c && c <= uchar(*p)) - return sig; - } - else if (uchar(*p) == c) return sig; - } - return !sig; -} - - -static int singlematch (MatchState *ms, const char *s, const char *p, - const char *ep) { - if (s >= ms->src_end) - return 0; - else { - int c = uchar(*s); - switch (*p) { - case '.': return 1; - case L_ESC: return match_class(c, uchar(*(p+1))); - case '[': return matchbracketclass(c, p, ep-1); - default: return (uchar(*p) == c); - } - } -} - - -static const char *matchbalance (MatchState *ms, const char *s, - const char *p) { - if (l_unlikely(p >= ms->p_end - 1)) - luaL_error(ms->L, "malformed pattern (missing arguments to '%%b')"); - if (*s != *p) return NULL; - else { - int b = *p; - int e = *(p+1); - int cont = 1; - while (++s < ms->src_end) { - if (*s == e) { - if (--cont == 0) return s+1; - } - else if (*s == b) cont++; - } - } - return NULL; -} - - -static const char *max_expand (MatchState *ms, const char *s, - const char *p, const char *ep) { - ptrdiff_t i = 0; - while (singlematch(ms, s + i, p, ep)) - i++; - - while (i>=0) { - const char *res = match(ms, (s+i), ep+1); - if (res) return res; - i--; - } - return NULL; -} - - -static const char *min_expand (MatchState *ms, const char *s, - const char *p, const char *ep) { - for (;;) { - const char *res = match(ms, s, ep+1); - if (res != NULL) - return res; - else if (singlematch(ms, s, p, ep)) - s++; - else return NULL; - } -} - - -static const char *start_capture (MatchState *ms, const char *s, - const char *p, int what) { - const char *res; - int level = ms->level; - if (level >= LUA_MAXCAPTURES) luaL_error(ms->L, "too many captures"); - ms->capture[level].init = s; - ms->capture[level].len = what; - ms->level = level+1; - if ((res=match(ms, s, p)) == NULL) - ms->level--; - return res; -} - - -static const char *end_capture (MatchState *ms, const char *s, - const char *p) { - int l = capture_to_close(ms); - const char *res; - ms->capture[l].len = s - ms->capture[l].init; - if ((res = match(ms, s, p)) == NULL) - ms->capture[l].len = CAP_UNFINISHED; - return res; -} - - -static const char *match_capture (MatchState *ms, const char *s, int l) { - size_t len; - l = check_capture(ms, l); - len = ms->capture[l].len; - if ((size_t)(ms->src_end-s) >= len && - memcmp(ms->capture[l].init, s, len) == 0) - return s+len; - else return NULL; -} - - -static const char *match (MatchState *ms, const char *s, const char *p) { - if (l_unlikely(ms->matchdepth-- == 0)) - luaL_error(ms->L, "pattern too complex"); - init: - if (p != ms->p_end) { - switch (*p) { - case '(': { - if (*(p + 1) == ')') - s = start_capture(ms, s, p + 2, CAP_POSITION); - else - s = start_capture(ms, s, p + 1, CAP_UNFINISHED); - break; - } - case ')': { - s = end_capture(ms, s, p + 1); - break; - } - case '$': { - if ((p + 1) != ms->p_end) - goto dflt; - s = (s == ms->src_end) ? s : NULL; - break; - } - case L_ESC: { - switch (*(p + 1)) { - case 'b': { - s = matchbalance(ms, s, p + 2); - if (s != NULL) { - p += 4; goto init; - } - break; - } - case 'f': { - const char *ep; char previous; - p += 2; - if (l_unlikely(*p != '[')) - luaL_error(ms->L, "missing '[' after '%%f' in pattern"); - ep = classend(ms, p); - previous = (s == ms->src_init) ? '\0' : *(s - 1); - if (!matchbracketclass(uchar(previous), p, ep - 1) && - matchbracketclass(uchar(*s), p, ep - 1)) { - p = ep; goto init; - } - s = NULL; - break; - } - case '0': case '1': case '2': case '3': - case '4': case '5': case '6': case '7': - case '8': case '9': { - s = match_capture(ms, s, uchar(*(p + 1))); - if (s != NULL) { - p += 2; goto init; - } - break; - } - default: goto dflt; - } - break; - } - default: dflt: { - const char *ep = classend(ms, p); - - if (!singlematch(ms, s, p, ep)) { - if (*ep == '*' || *ep == '?' || *ep == '-') { - p = ep + 1; goto init; - } - else - s = NULL; - } - else { - switch (*ep) { - case '?': { - const char *res; - if ((res = match(ms, s + 1, ep + 1)) != NULL) - s = res; - else { - p = ep + 1; goto init; - } - break; - } - case '+': - s++; - - case '*': - s = max_expand(ms, s, p, ep); - break; - case '-': - s = min_expand(ms, s, p, ep); - break; - default: - s++; p = ep; goto init; - } - } - break; - } - } - } - ms->matchdepth++; - return s; -} - - - -static const char *lmemfind (const char *s1, size_t l1, - const char *s2, size_t l2) { - if (l2 == 0) return s1; - else if (l2 > l1) return NULL; - else { - const char *init; - l2--; - l1 = l1-l2; - while (l1 > 0 && (init = (const char *)memchr(s1, *s2, l1)) != NULL) { - init++; - if (memcmp(init, s2+1, l2) == 0) - return init-1; - else { - l1 -= init-s1; - s1 = init; - } - } - return NULL; - } -} - - - -static size_t get_onecapture (MatchState *ms, int i, const char *s, - const char *e, const char **cap) { - if (i >= ms->level) { - if (l_unlikely(i != 0)) - luaL_error(ms->L, "invalid capture index %%%d", i + 1); - *cap = s; - return e - s; - } - else { - ptrdiff_t capl = ms->capture[i].len; - *cap = ms->capture[i].init; - if (l_unlikely(capl == CAP_UNFINISHED)) - luaL_error(ms->L, "unfinished capture"); - else if (capl == CAP_POSITION) - lua_pushinteger(ms->L, (ms->capture[i].init - ms->src_init) + 1); - return capl; - } -} - - - -static void push_onecapture (MatchState *ms, int i, const char *s, - const char *e) { - const char *cap; - ptrdiff_t l = get_onecapture(ms, i, s, e, &cap); - if (l != CAP_POSITION) - lua_pushlstring(ms->L, cap, l); - -} - - -static int push_captures (MatchState *ms, const char *s, const char *e) { - int i; - int nlevels = (ms->level == 0 && s) ? 1 : ms->level; - luaL_checkstack(ms->L, nlevels, "too many captures"); - for (i = 0; i < nlevels; i++) - push_onecapture(ms, i, s, e); - return nlevels; -} - - - -static int nospecials (const char *p, size_t l) { - size_t upto = 0; - do { - if (strpbrk(p + upto, SPECIALS)) - return 0; - upto += strlen(p + upto) + 1; - } while (upto <= l); - return 1; -} - - -static void prepstate (MatchState *ms, lua_State *L, - const char *s, size_t ls, const char *p, size_t lp) { - ms->L = L; - ms->matchdepth = MAXCCALLS; - ms->src_init = s; - ms->src_end = s + ls; - ms->p_end = p + lp; -} - - -static void reprepstate (MatchState *ms) { - ms->level = 0; - lua_assert(ms->matchdepth == MAXCCALLS); -} - - -static int str_find_aux (lua_State *L, int find) { - size_t ls, lp; - const char *s = luaL_checklstring(L, 1, &ls); - const char *p = luaL_checklstring(L, 2, &lp); - size_t init = posrelatI(luaL_optinteger(L, 3, 1), ls) - 1; - if (init > ls) { - luaL_pushfail(L); - return 1; - } - - if (find && (lua_toboolean(L, 4) || nospecials(p, lp))) { - - const char *s2 = lmemfind(s + init, ls - init, p, lp); - if (s2) { - lua_pushinteger(L, (s2 - s) + 1); - lua_pushinteger(L, (s2 - s) + lp); - return 2; - } - } - else { - MatchState ms; - const char *s1 = s + init; - int anchor = (*p == '^'); - if (anchor) { - p++; lp--; - } - prepstate(&ms, L, s, ls, p, lp); - do { - const char *res; - reprepstate(&ms); - if ((res=match(&ms, s1, p)) != NULL) { - if (find) { - lua_pushinteger(L, (s1 - s) + 1); - lua_pushinteger(L, res - s); - return push_captures(&ms, NULL, 0) + 2; - } - else - return push_captures(&ms, s1, res); - } - } while (s1++ < ms.src_end && !anchor); - } - luaL_pushfail(L); - return 1; -} - - -static int str_find (lua_State *L) { - return str_find_aux(L, 1); -} - - -static int str_match (lua_State *L) { - return str_find_aux(L, 0); -} - - - -typedef struct GMatchState { - const char *src; - const char *p; - const char *lastmatch; - MatchState ms; -} GMatchState; - - -static int gmatch_aux (lua_State *L) { - GMatchState *gm = (GMatchState *)lua_touserdata(L, lua_upvalueindex(3)); - const char *src; - gm->ms.L = L; - for (src = gm->src; src <= gm->ms.src_end; src++) { - const char *e; - reprepstate(&gm->ms); - if ((e = match(&gm->ms, src, gm->p)) != NULL && e != gm->lastmatch) { - gm->src = gm->lastmatch = e; - return push_captures(&gm->ms, src, e); - } - } - return 0; -} - - -static int gmatch (lua_State *L) { - size_t ls, lp; - const char *s = luaL_checklstring(L, 1, &ls); - const char *p = luaL_checklstring(L, 2, &lp); - size_t init = posrelatI(luaL_optinteger(L, 3, 1), ls) - 1; - GMatchState *gm; - lua_settop(L, 2); - gm = (GMatchState *)lua_newuserdatauv(L, sizeof(GMatchState), 0); - if (init > ls) - init = ls + 1; - prepstate(&gm->ms, L, s, ls, p, lp); - gm->src = s + init; gm->p = p; gm->lastmatch = NULL; - lua_pushcclosure(L, gmatch_aux, 3); - return 1; -} - - -static void add_s (MatchState *ms, luaL_Buffer *b, const char *s, - const char *e) { - size_t l; - lua_State *L = ms->L; - const char *news = lua_tolstring(L, 3, &l); - const char *p; - while ((p = (char *)memchr(news, L_ESC, l)) != NULL) { - luaL_addlstring(b, news, p - news); - p++; - if (*p == L_ESC) - luaL_addchar(b, *p); - else if (*p == '0') - luaL_addlstring(b, s, e - s); - else if (isdigit(uchar(*p))) { - const char *cap; - ptrdiff_t resl = get_onecapture(ms, *p - '1', s, e, &cap); - if (resl == CAP_POSITION) - luaL_addvalue(b); - else - luaL_addlstring(b, cap, resl); - } - else - luaL_error(L, "invalid use of '%c' in replacement string", L_ESC); - l -= p + 1 - news; - news = p + 1; - } - luaL_addlstring(b, news, l); -} - - - -static int add_value (MatchState *ms, luaL_Buffer *b, const char *s, - const char *e, int tr) { - lua_State *L = ms->L; - switch (tr) { - case LUA_TFUNCTION: { - int n; - lua_pushvalue(L, 3); - n = push_captures(ms, s, e); - lua_call(L, n, 1); - break; - } - case LUA_TTABLE: { - push_onecapture(ms, 0, s, e); - lua_gettable(L, 3); - break; - } - default: { - add_s(ms, b, s, e); - return 1; - } - } - if (!lua_toboolean(L, -1)) { - lua_pop(L, 1); - luaL_addlstring(b, s, e - s); - return 0; - } - else if (l_unlikely(!lua_isstring(L, -1))) - return luaL_error(L, "invalid replacement value (a %s)", - luaL_typename(L, -1)); - else { - luaL_addvalue(b); - return 1; - } -} - - -static int str_gsub (lua_State *L) { - size_t srcl, lp; - const char *src = luaL_checklstring(L, 1, &srcl); - const char *p = luaL_checklstring(L, 2, &lp); - const char *lastmatch = NULL; - int tr = lua_type(L, 3); - lua_Integer max_s = luaL_optinteger(L, 4, srcl + 1); - int anchor = (*p == '^'); - lua_Integer n = 0; - int changed = 0; - MatchState ms; - luaL_Buffer b; - luaL_argexpected(L, tr == LUA_TNUMBER || tr == LUA_TSTRING || - tr == LUA_TFUNCTION || tr == LUA_TTABLE, 3, - "string/function/table"); - luaL_buffinit(L, &b); - if (anchor) { - p++; lp--; - } - prepstate(&ms, L, src, srcl, p, lp); - while (n < max_s) { - const char *e; - reprepstate(&ms); - if ((e = match(&ms, src, p)) != NULL && e != lastmatch) { - n++; - changed = add_value(&ms, &b, src, e, tr) | changed; - src = lastmatch = e; - } - else if (src < ms.src_end) - luaL_addchar(&b, *src++); - else break; - if (anchor) break; - } - if (!changed) - lua_pushvalue(L, 1); - else { - luaL_addlstring(&b, src, ms.src_end-src); - luaL_pushresult(&b); - } - lua_pushinteger(L, n); - return 2; -} - - - - - - - -#if !defined(lua_number2strx) - - - -#define SIZELENMOD (sizeof(LUA_NUMBER_FRMLEN)/sizeof(char)) - - - -#define L_NBFD ((l_floatatt(MANT_DIG) - 1)%4 + 1) - - - -static lua_Number adddigit (char *buff, int n, lua_Number x) { - lua_Number dd = l_mathop(floor)(x); - int d = (int)dd; - buff[n] = (d < 10 ? d + '0' : d - 10 + 'a'); - return x - dd; -} - - -static int num2straux (char *buff, int sz, lua_Number x) { - - if (x != x || x == (lua_Number)HUGE_VAL || x == -(lua_Number)HUGE_VAL) - return l_sprintf(buff, sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)x); - else if (x == 0) { - - return l_sprintf(buff, sz, LUA_NUMBER_FMT "x0p+0", (LUAI_UACNUMBER)x); - } - else { - int e; - lua_Number m = l_mathop(frexp)(x, &e); - int n = 0; - if (m < 0) { - buff[n++] = '-'; - m = -m; - } - buff[n++] = '0'; buff[n++] = 'x'; - m = adddigit(buff, n++, m * (1 << L_NBFD)); - e -= L_NBFD; - if (m > 0) { - buff[n++] = lua_getlocaledecpoint(); - do { - m = adddigit(buff, n++, m * 16); - } while (m > 0); - } - n += l_sprintf(buff + n, sz - n, "p%+d", e); - lua_assert(n < sz); - return n; - } -} - - -static int lua_number2strx (lua_State *L, char *buff, int sz, - const char *fmt, lua_Number x) { - int n = num2straux(buff, sz, x); - if (fmt[SIZELENMOD] == 'A') { - int i; - for (i = 0; i < n; i++) - buff[i] = toupper(uchar(buff[i])); - } - else if (l_unlikely(fmt[SIZELENMOD] != 'a')) - return luaL_error(L, "modifiers for format '%%a'/'%%A' not implemented"); - return n; -} - -#endif - - - -#define MAX_ITEMF (110 + l_floatatt(MAX_10_EXP)) - - - -#define MAX_ITEM 120 - - - -#if !defined(L_FMTFLAGSF) - - -#define L_FMTFLAGSF "-+#0 " - - -#define L_FMTFLAGSX "-#0" - - -#define L_FMTFLAGSI "-+0 " - - -#define L_FMTFLAGSU "-0" - - -#define L_FMTFLAGSC "-" - -#endif - - - -#define MAX_FORMAT 32 - - -static void addquoted (luaL_Buffer *b, const char *s, size_t len) { - luaL_addchar(b, '"'); - while (len--) { - if (*s == '"' || *s == '\\' || *s == '\n') { - luaL_addchar(b, '\\'); - luaL_addchar(b, *s); - } - else if (iscntrl(uchar(*s))) { - char buff[10]; - if (!isdigit(uchar(*(s+1)))) - l_sprintf(buff, sizeof(buff), "\\%d", (int)uchar(*s)); - else - l_sprintf(buff, sizeof(buff), "\\%03d", (int)uchar(*s)); - luaL_addstring(b, buff); - } - else - luaL_addchar(b, *s); - s++; - } - luaL_addchar(b, '"'); -} - - - -static int quotefloat (lua_State *L, char *buff, lua_Number n) { - const char *s; - if (n == (lua_Number)HUGE_VAL) - s = "1e9999"; - else if (n == -(lua_Number)HUGE_VAL) - s = "-1e9999"; - else if (n != n) - s = "(0/0)"; - else { - int nb = lua_number2strx(L, buff, MAX_ITEM, - "%" LUA_NUMBER_FRMLEN "a", n); - - if (memchr(buff, '.', nb) == NULL) { - char point = lua_getlocaledecpoint(); - char *ppoint = (char *)memchr(buff, point, nb); - if (ppoint) *ppoint = '.'; - } - return nb; - } - - return l_sprintf(buff, MAX_ITEM, "%s", s); -} - - -static void addliteral (lua_State *L, luaL_Buffer *b, int arg) { - switch (lua_type(L, arg)) { - case LUA_TSTRING: { - size_t len; - const char *s = lua_tolstring(L, arg, &len); - addquoted(b, s, len); - break; - } - case LUA_TNUMBER: { - char *buff = luaL_prepbuffsize(b, MAX_ITEM); - int nb; - if (!lua_isinteger(L, arg)) - nb = quotefloat(L, buff, lua_tonumber(L, arg)); - else { - lua_Integer n = lua_tointeger(L, arg); - const char *format = (n == LUA_MININTEGER) - ? "0x%" LUA_INTEGER_FRMLEN "x" - : LUA_INTEGER_FMT; - nb = l_sprintf(buff, MAX_ITEM, format, (LUAI_UACINT)n); - } - luaL_addsize(b, nb); - break; - } - case LUA_TNIL: case LUA_TBOOLEAN: { - luaL_tolstring(L, arg, NULL); - luaL_addvalue(b); - break; - } - default: { - luaL_argerror(L, arg, "value has no literal form"); - } - } -} - - -static const char *get2digits (const char *s) { - if (isdigit(uchar(*s))) { - s++; - if (isdigit(uchar(*s))) s++; - } - return s; -} - - - -static void checkformat (lua_State *L, const char *form, const char *flags, - int precision) { - const char *spec = form + 1; - spec += strspn(spec, flags); - if (*spec != '0') { - spec = get2digits(spec); - if (*spec == '.' && precision) { - spec++; - spec = get2digits(spec); - } - } - if (!isalpha(uchar(*spec))) - luaL_error(L, "invalid conversion specification: '%s'", form); -} - - - -static const char *getformat (lua_State *L, const char *strfrmt, - char *form) { - - size_t len = strspn(strfrmt, L_FMTFLAGSF "123456789."); - len++; - - if (len >= MAX_FORMAT - 10) - luaL_error(L, "invalid format (too long)"); - *(form++) = '%'; - memcpy(form, strfrmt, len * sizeof(char)); - *(form + len) = '\0'; - return strfrmt + len - 1; -} - - - -static void addlenmod (char *form, const char *lenmod) { - size_t l = strlen(form); - size_t lm = strlen(lenmod); - char spec = form[l - 1]; - strcpy(form + l - 1, lenmod); - form[l + lm - 1] = spec; - form[l + lm] = '\0'; -} - - -static int str_format (lua_State *L) { - int top = lua_gettop(L); - int arg = 1; - size_t sfl; - const char *strfrmt = luaL_checklstring(L, arg, &sfl); - const char *strfrmt_end = strfrmt+sfl; - const char *flags; - luaL_Buffer b; - luaL_buffinit(L, &b); - while (strfrmt < strfrmt_end) { - if (*strfrmt != L_ESC) - luaL_addchar(&b, *strfrmt++); - else if (*++strfrmt == L_ESC) - luaL_addchar(&b, *strfrmt++); - else { - char form[MAX_FORMAT]; - int maxitem = MAX_ITEM; - char *buff = luaL_prepbuffsize(&b, maxitem); - int nb = 0; - if (++arg > top) - return luaL_argerror(L, arg, "no value"); - strfrmt = getformat(L, strfrmt, form); - switch (*strfrmt++) { - case 'c': { - checkformat(L, form, L_FMTFLAGSC, 0); - nb = l_sprintf(buff, maxitem, form, (int)luaL_checkinteger(L, arg)); - break; - } - case 'd': case 'i': - flags = L_FMTFLAGSI; - goto intcase; - case 'u': - flags = L_FMTFLAGSU; - goto intcase; - case 'o': case 'x': case 'X': - flags = L_FMTFLAGSX; - intcase: { - lua_Integer n = luaL_checkinteger(L, arg); - checkformat(L, form, flags, 1); - addlenmod(form, LUA_INTEGER_FRMLEN); - nb = l_sprintf(buff, maxitem, form, (LUAI_UACINT)n); - break; - } - case 'a': case 'A': - checkformat(L, form, L_FMTFLAGSF, 1); - addlenmod(form, LUA_NUMBER_FRMLEN); - nb = lua_number2strx(L, buff, maxitem, form, - luaL_checknumber(L, arg)); - break; - case 'f': - maxitem = MAX_ITEMF; - buff = luaL_prepbuffsize(&b, maxitem); - - case 'e': case 'E': case 'g': case 'G': { - lua_Number n = luaL_checknumber(L, arg); - checkformat(L, form, L_FMTFLAGSF, 1); - addlenmod(form, LUA_NUMBER_FRMLEN); - nb = l_sprintf(buff, maxitem, form, (LUAI_UACNUMBER)n); - break; - } - case 'p': { - const void *p = lua_topointer(L, arg); - checkformat(L, form, L_FMTFLAGSC, 0); - if (p == NULL) { - p = "(null)"; - form[strlen(form) - 1] = 's'; - } - nb = l_sprintf(buff, maxitem, form, p); - break; - } - case 'q': { - if (form[2] != '\0') - return luaL_error(L, "specifier '%%q' cannot have modifiers"); - addliteral(L, &b, arg); - break; - } - case 's': { - size_t l; - const char *s = luaL_tolstring(L, arg, &l); - if (form[2] == '\0') - luaL_addvalue(&b); - else { - luaL_argcheck(L, l == strlen(s), arg, "string contains zeros"); - checkformat(L, form, L_FMTFLAGSC, 1); - if (strchr(form, '.') == NULL && l >= 100) { - - luaL_addvalue(&b); - } - else { - nb = l_sprintf(buff, maxitem, form, s); - lua_pop(L, 1); - } - } - break; - } - default: { - return luaL_error(L, "invalid conversion '%s' to 'format'", form); - } - } - lua_assert(nb < maxitem); - luaL_addsize(&b, nb); - } - } - luaL_pushresult(&b); - return 1; -} - - - - - - - - -#if !defined(LUAL_PACKPADBYTE) -#define LUAL_PACKPADBYTE 0x00 -#endif - - -#define MAXINTSIZE 16 - - -#define NB CHAR_BIT - - -#define MC ((1 << NB) - 1) - - -#define SZINT ((int)sizeof(lua_Integer)) - - - -static const union { - int dummy; - char little; -} nativeendian = {1}; - - - -typedef struct Header { - lua_State *L; - int islittle; - int maxalign; -} Header; - - - -typedef enum KOption { - Kint, - Kuint, - Kfloat, - Knumber, - Kdouble, - Kchar, - Kstring, - Kzstr, - Kpadding, - Kpaddalign, - Knop -} KOption; - - - -static int digit (int c) { return '0' <= c && c <= '9'; } - -static int getnum (const char **fmt, int df) { - if (!digit(**fmt)) - return df; - else { - int a = 0; - do { - a = a*10 + (*((*fmt)++) - '0'); - } while (digit(**fmt) && a <= ((int)MAXSIZE - 9)/10); - return a; - } -} - - - -static int getnumlimit (Header *h, const char **fmt, int df) { - int sz = getnum(fmt, df); - if (l_unlikely(sz > MAXINTSIZE || sz <= 0)) - return luaL_error(h->L, "integral size (%d) out of limits [1,%d]", - sz, MAXINTSIZE); - return sz; -} - - - -static void initheader (lua_State *L, Header *h) { - h->L = L; - h->islittle = nativeendian.little; - h->maxalign = 1; -} - - - -static KOption getoption (Header *h, const char **fmt, int *size) { - - struct cD { char c; union { LUAI_MAXALIGN; } u; }; - int opt = *((*fmt)++); - *size = 0; - switch (opt) { - case 'b': *size = sizeof(char); return Kint; - case 'B': *size = sizeof(char); return Kuint; - case 'h': *size = sizeof(short); return Kint; - case 'H': *size = sizeof(short); return Kuint; - case 'l': *size = sizeof(long); return Kint; - case 'L': *size = sizeof(long); return Kuint; - case 'j': *size = sizeof(lua_Integer); return Kint; - case 'J': *size = sizeof(lua_Integer); return Kuint; - case 'T': *size = sizeof(size_t); return Kuint; - case 'f': *size = sizeof(float); return Kfloat; - case 'n': *size = sizeof(lua_Number); return Knumber; - case 'd': *size = sizeof(double); return Kdouble; - case 'i': *size = getnumlimit(h, fmt, sizeof(int)); return Kint; - case 'I': *size = getnumlimit(h, fmt, sizeof(int)); return Kuint; - case 's': *size = getnumlimit(h, fmt, sizeof(size_t)); return Kstring; - case 'c': - *size = getnum(fmt, -1); - if (l_unlikely(*size == -1)) - luaL_error(h->L, "missing size for format option 'c'"); - return Kchar; - case 'z': return Kzstr; - case 'x': *size = 1; return Kpadding; - case 'X': return Kpaddalign; - case ' ': break; - case '<': h->islittle = 1; break; - case '>': h->islittle = 0; break; - case '=': h->islittle = nativeendian.little; break; - case '!': { - const int maxalign = offsetof(struct cD, u); - h->maxalign = getnumlimit(h, fmt, maxalign); - break; - } - default: luaL_error(h->L, "invalid format option '%c'", opt); - } - return Knop; -} - - - -static KOption getdetails (Header *h, size_t totalsize, - const char **fmt, int *psize, int *ntoalign) { - KOption opt = getoption(h, fmt, psize); - int align = *psize; - if (opt == Kpaddalign) { - if (**fmt == '\0' || getoption(h, fmt, &align) == Kchar || align == 0) - luaL_argerror(h->L, 1, "invalid next option for option 'X'"); - } - if (align <= 1 || opt == Kchar) - *ntoalign = 0; - else { - if (align > h->maxalign) - align = h->maxalign; - if (l_unlikely((align & (align - 1)) != 0)) - luaL_argerror(h->L, 1, "format asks for alignment not power of 2"); - *ntoalign = (align - (int)(totalsize & (align - 1))) & (align - 1); - } - return opt; -} - - - -static void packint (luaL_Buffer *b, lua_Unsigned n, - int islittle, int size, int neg) { - char *buff = luaL_prepbuffsize(b, size); - int i; - buff[islittle ? 0 : size - 1] = (char)(n & MC); - for (i = 1; i < size; i++) { - n >>= NB; - buff[islittle ? i : size - 1 - i] = (char)(n & MC); - } - if (neg && size > SZINT) { - for (i = SZINT; i < size; i++) - buff[islittle ? i : size - 1 - i] = (char)MC; - } - luaL_addsize(b, size); -} - - - -static void copywithendian (char *dest, const char *src, - int size, int islittle) { - if (islittle == nativeendian.little) - memcpy(dest, src, size); - else { - dest += size - 1; - while (size-- != 0) - *(dest--) = *(src++); - } -} - - -static int str_pack (lua_State *L) { - luaL_Buffer b; - Header h; - const char *fmt = luaL_checkstring(L, 1); - int arg = 1; - size_t totalsize = 0; - initheader(L, &h); - lua_pushnil(L); - luaL_buffinit(L, &b); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, totalsize, &fmt, &size, &ntoalign); - totalsize += ntoalign + size; - while (ntoalign-- > 0) - luaL_addchar(&b, LUAL_PACKPADBYTE); - arg++; - switch (opt) { - case Kint: { - lua_Integer n = luaL_checkinteger(L, arg); - if (size < SZINT) { - lua_Integer lim = (lua_Integer)1 << ((size * NB) - 1); - luaL_argcheck(L, -lim <= n && n < lim, arg, "integer overflow"); - } - packint(&b, (lua_Unsigned)n, h.islittle, size, (n < 0)); - break; - } - case Kuint: { - lua_Integer n = luaL_checkinteger(L, arg); - if (size < SZINT) - luaL_argcheck(L, (lua_Unsigned)n < ((lua_Unsigned)1 << (size * NB)), - arg, "unsigned overflow"); - packint(&b, (lua_Unsigned)n, h.islittle, size, 0); - break; - } - case Kfloat: { - float f = (float)luaL_checknumber(L, arg); - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Knumber: { - lua_Number f = luaL_checknumber(L, arg); - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Kdouble: { - double f = (double)luaL_checknumber(L, arg); - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Kchar: { - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, len <= (size_t)size, arg, - "string longer than given size"); - luaL_addlstring(&b, s, len); - while (len++ < (size_t)size) - luaL_addchar(&b, LUAL_PACKPADBYTE); - break; - } - case Kstring: { - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, size >= (int)sizeof(size_t) || - len < ((size_t)1 << (size * NB)), - arg, "string length does not fit in given size"); - packint(&b, (lua_Unsigned)len, h.islittle, size, 0); - luaL_addlstring(&b, s, len); - totalsize += len; - break; - } - case Kzstr: { - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, strlen(s) == len, arg, "string contains zeros"); - luaL_addlstring(&b, s, len); - luaL_addchar(&b, '\0'); - totalsize += len + 1; - break; - } - case Kpadding: luaL_addchar(&b, LUAL_PACKPADBYTE); - case Kpaddalign: case Knop: - arg--; - break; - } - } - luaL_pushresult(&b); - return 1; -} - - -static int str_packsize (lua_State *L) { - Header h; - const char *fmt = luaL_checkstring(L, 1); - size_t totalsize = 0; - initheader(L, &h); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, totalsize, &fmt, &size, &ntoalign); - luaL_argcheck(L, opt != Kstring && opt != Kzstr, 1, - "variable-length format"); - size += ntoalign; - luaL_argcheck(L, totalsize <= MAXSIZE - size, 1, - "format result too large"); - totalsize += size; - } - lua_pushinteger(L, (lua_Integer)totalsize); - return 1; -} - - - -static lua_Integer unpackint (lua_State *L, const char *str, - int islittle, int size, int issigned) { - lua_Unsigned res = 0; - int i; - int limit = (size <= SZINT) ? size : SZINT; - for (i = limit - 1; i >= 0; i--) { - res <<= NB; - res |= (lua_Unsigned)(unsigned char)str[islittle ? i : size - 1 - i]; - } - if (size < SZINT) { - if (issigned) { - lua_Unsigned mask = (lua_Unsigned)1 << (size*NB - 1); - res = ((res ^ mask) - mask); - } - } - else if (size > SZINT) { - int mask = (!issigned || (lua_Integer)res >= 0) ? 0 : MC; - for (i = limit; i < size; i++) { - if (l_unlikely((unsigned char)str[islittle ? i : size - 1 - i] != mask)) - luaL_error(L, "%d-byte integer does not fit into Lua Integer", size); - } - } - return (lua_Integer)res; -} - - -static int str_unpack (lua_State *L) { - Header h; - const char *fmt = luaL_checkstring(L, 1); - size_t ld; - const char *data = luaL_checklstring(L, 2, &ld); - size_t pos = posrelatI(luaL_optinteger(L, 3, 1), ld) - 1; - int n = 0; - luaL_argcheck(L, pos <= ld, 3, "initial position out of string"); - initheader(L, &h); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, pos, &fmt, &size, &ntoalign); - luaL_argcheck(L, (size_t)ntoalign + size <= ld - pos, 2, - "data string too short"); - pos += ntoalign; - - luaL_checkstack(L, 2, "too many results"); - n++; - switch (opt) { - case Kint: - case Kuint: { - lua_Integer res = unpackint(L, data + pos, h.islittle, size, - (opt == Kint)); - lua_pushinteger(L, res); - break; - } - case Kfloat: { - float f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, (lua_Number)f); - break; - } - case Knumber: { - lua_Number f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, f); - break; - } - case Kdouble: { - double f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, (lua_Number)f); - break; - } - case Kchar: { - lua_pushlstring(L, data + pos, size); - break; - } - case Kstring: { - size_t len = (size_t)unpackint(L, data + pos, h.islittle, size, 0); - luaL_argcheck(L, len <= ld - pos - size, 2, "data string too short"); - lua_pushlstring(L, data + pos + size, len); - pos += len; - break; - } - case Kzstr: { - size_t len = strlen(data + pos); - luaL_argcheck(L, pos + len < ld, 2, - "unfinished string for format 'z'"); - lua_pushlstring(L, data + pos, len); - pos += len + 1; - break; - } - case Kpaddalign: case Kpadding: case Knop: - n--; - break; - } - pos += size; - } - lua_pushinteger(L, pos + 1); - return n + 1; -} - - - - -static const luaL_Reg strlib[] = { - {"byte", str_byte}, - {"char", str_char}, - {"dump", str_dump}, - {"find", str_find}, - {"format", str_format}, - {"gmatch", gmatch}, - {"gsub", str_gsub}, - {"len", str_len}, - {"lower", str_lower}, - {"match", str_match}, - {"rep", str_rep}, - {"reverse", str_reverse}, - {"sub", str_sub}, - {"upper", str_upper}, - {"pack", str_pack}, - {"packsize", str_packsize}, - {"unpack", str_unpack}, - {NULL, NULL} -}; - - -static void createmetatable (lua_State *L) { - - luaL_newlibtable(L, stringmetamethods); - luaL_setfuncs(L, stringmetamethods, 0); - lua_pushliteral(L, ""); - lua_pushvalue(L, -2); - lua_setmetatable(L, -2); - lua_pop(L, 1); - lua_pushvalue(L, -2); - lua_setfield(L, -2, "__index"); - lua_pop(L, 1); -} - - - -LUAMOD_API int luaopen_string (lua_State *L) { - luaL_newlib(L, strlib); - createmetatable(L); - return 1; -} - - - -//path: src/imports/../dependencies/lua/ltablib.c - - -#define ltablib_c -#define LUA_LIB - - - - - -#include -#include -#include - - - - - - - - - - - -#define TAB_R 1 -#define TAB_W 2 -#define TAB_L 4 -#define TAB_RW (TAB_R | TAB_W) - - -#define aux_getn(L,n,w) (checktab(L, n, (w) | TAB_L), luaL_len(L, n)) - - -static int checkfield (lua_State *L, const char *key, int n) { - lua_pushstring(L, key); - return (lua_rawget(L, -n) != LUA_TNIL); -} - - - -static void checktab (lua_State *L, int arg, int what) { - if (lua_type(L, arg) != LUA_TTABLE) { - int n = 1; - if (lua_getmetatable(L, arg) && - (!(what & TAB_R) || checkfield(L, "__index", ++n)) && - (!(what & TAB_W) || checkfield(L, "__newindex", ++n)) && - (!(what & TAB_L) || checkfield(L, "__len", ++n))) { - lua_pop(L, n); - } - else - luaL_checktype(L, arg, LUA_TTABLE); - } -} - - -static int tcreate (lua_State *L) { - lua_Unsigned sizeseq = (lua_Unsigned)luaL_checkinteger(L, 1); - lua_Unsigned sizerest = (lua_Unsigned)luaL_optinteger(L, 2, 0); - luaL_argcheck(L, sizeseq <= UINT_MAX, 1, "out of range"); - luaL_argcheck(L, sizerest <= UINT_MAX, 2, "out of range"); - lua_createtable(L, (unsigned)sizeseq, (unsigned)sizerest); - return 1; -} - - -static int tinsert (lua_State *L) { - lua_Integer pos; - lua_Integer e = aux_getn(L, 1, TAB_RW); - e = luaL_intop(+, e, 1); - switch (lua_gettop(L)) { - case 2: { - pos = e; - break; - } - case 3: { - lua_Integer i; - pos = luaL_checkinteger(L, 2); - - luaL_argcheck(L, (lua_Unsigned)pos - 1u < (lua_Unsigned)e, 2, - "position out of bounds"); - for (i = e; i > pos; i--) { - lua_geti(L, 1, i - 1); - lua_seti(L, 1, i); - } - break; - } - default: { - return luaL_error(L, "wrong number of arguments to 'insert'"); - } - } - lua_seti(L, 1, pos); - return 0; -} - - -static int tremove (lua_State *L) { - lua_Integer size = aux_getn(L, 1, TAB_RW); - lua_Integer pos = luaL_optinteger(L, 2, size); - if (pos != size) - - luaL_argcheck(L, (lua_Unsigned)pos - 1u <= (lua_Unsigned)size, 2, - "position out of bounds"); - lua_geti(L, 1, pos); - for ( ; pos < size; pos++) { - lua_geti(L, 1, pos + 1); - lua_seti(L, 1, pos); - } - lua_pushnil(L); - lua_seti(L, 1, pos); - return 1; -} - - - -static int tmove (lua_State *L) { - lua_Integer f = luaL_checkinteger(L, 2); - lua_Integer e = luaL_checkinteger(L, 3); - lua_Integer t = luaL_checkinteger(L, 4); - int tt = !lua_isnoneornil(L, 5) ? 5 : 1; - checktab(L, 1, TAB_R); - checktab(L, tt, TAB_W); - if (e >= f) { - lua_Integer n, i; - luaL_argcheck(L, f > 0 || e < LUA_MAXINTEGER + f, 3, - "too many elements to move"); - n = e - f + 1; - luaL_argcheck(L, t <= LUA_MAXINTEGER - n + 1, 4, - "destination wrap around"); - if (t > e || t <= f || (tt != 1 && !lua_compare(L, 1, tt, LUA_OPEQ))) { - for (i = 0; i < n; i++) { - lua_geti(L, 1, f + i); - lua_seti(L, tt, t + i); - } - } - else { - for (i = n - 1; i >= 0; i--) { - lua_geti(L, 1, f + i); - lua_seti(L, tt, t + i); - } - } - } - lua_pushvalue(L, tt); - return 1; -} - - -static void addfield (lua_State *L, luaL_Buffer *b, lua_Integer i) { - lua_geti(L, 1, i); - if (l_unlikely(!lua_isstring(L, -1))) - luaL_error(L, "invalid value (%s) at index %I in table for 'concat'", - luaL_typename(L, -1), (LUAI_UACINT)i); - luaL_addvalue(b); -} - - -static int tconcat (lua_State *L) { - luaL_Buffer b; - lua_Integer last = aux_getn(L, 1, TAB_R); - size_t lsep; - const char *sep = luaL_optlstring(L, 2, "", &lsep); - lua_Integer i = luaL_optinteger(L, 3, 1); - last = luaL_optinteger(L, 4, last); - luaL_buffinit(L, &b); - for (; i < last; i++) { - addfield(L, &b, i); - luaL_addlstring(&b, sep, lsep); - } - if (i == last) - addfield(L, &b, i); - luaL_pushresult(&b); - return 1; -} - - - - -static int tpack (lua_State *L) { - int i; - int n = lua_gettop(L); - lua_createtable(L, n, 1); - lua_insert(L, 1); - for (i = n; i >= 1; i--) - lua_seti(L, 1, i); - lua_pushinteger(L, n); - lua_setfield(L, 1, "n"); - return 1; -} - - -static int tunpack (lua_State *L) { - lua_Unsigned n; - lua_Integer i = luaL_optinteger(L, 2, 1); - lua_Integer e = luaL_opt(L, luaL_checkinteger, 3, luaL_len(L, 1)); - if (i > e) return 0; - n = (lua_Unsigned)e - i; - if (l_unlikely(n >= (unsigned int)INT_MAX || - !lua_checkstack(L, (int)(++n)))) - return luaL_error(L, "too many results to unpack"); - for (; i < e; i++) { - lua_geti(L, 1, i); - } - lua_geti(L, 1, e); - return (int)n; -} - - - - - - - - - -typedef unsigned int IdxT; - - - -#if !defined(l_randomizePivot) -#define l_randomizePivot(L) luaL_makeseed(L) -#endif - - - -#define RANLIMIT 100u - - -static void set2 (lua_State *L, IdxT i, IdxT j) { - lua_seti(L, 1, i); - lua_seti(L, 1, j); -} - - - -static int sort_comp (lua_State *L, int a, int b) { - if (lua_isnil(L, 2)) - return lua_compare(L, a, b, LUA_OPLT); - else { - int res; - lua_pushvalue(L, 2); - lua_pushvalue(L, a-1); - lua_pushvalue(L, b-2); - lua_call(L, 2, 1); - res = lua_toboolean(L, -1); - lua_pop(L, 1); - return res; - } -} - - - -static IdxT partition (lua_State *L, IdxT lo, IdxT up) { - IdxT i = lo; - IdxT j = up - 1; - - for (;;) { - - while ((void)lua_geti(L, 1, ++i), sort_comp(L, -1, -2)) { - if (l_unlikely(i == up - 1)) - luaL_error(L, "invalid order function for sorting"); - lua_pop(L, 1); - } - - - while ((void)lua_geti(L, 1, --j), sort_comp(L, -3, -1)) { - if (l_unlikely(j < i)) - luaL_error(L, "invalid order function for sorting"); - lua_pop(L, 1); - } - - if (j < i) { - - lua_pop(L, 1); - - set2(L, up - 1, i); - return i; - } - - set2(L, i, j); - } -} - - - -static IdxT choosePivot (IdxT lo, IdxT up, unsigned int rnd) { - IdxT r4 = (up - lo) / 4; - IdxT p = (rnd ^ lo ^ up) % (r4 * 2) + (lo + r4); - lua_assert(lo + r4 <= p && p <= up - r4); - return p; -} - - - -static void auxsort (lua_State *L, IdxT lo, IdxT up, unsigned rnd) { - while (lo < up) { - IdxT p; - IdxT n; - - lua_geti(L, 1, lo); - lua_geti(L, 1, up); - if (sort_comp(L, -1, -2)) - set2(L, lo, up); - else - lua_pop(L, 2); - if (up - lo == 1) - return; - if (up - lo < RANLIMIT || rnd == 0) - p = (lo + up)/2; - else - p = choosePivot(lo, up, rnd); - lua_geti(L, 1, p); - lua_geti(L, 1, lo); - if (sort_comp(L, -2, -1)) - set2(L, p, lo); - else { - lua_pop(L, 1); - lua_geti(L, 1, up); - if (sort_comp(L, -1, -2)) - set2(L, p, up); - else - lua_pop(L, 2); - } - if (up - lo == 2) - return; - lua_geti(L, 1, p); - lua_pushvalue(L, -1); - lua_geti(L, 1, up - 1); - set2(L, p, up - 1); - p = partition(L, lo, up); - - if (p - lo < up - p) { - auxsort(L, lo, p - 1, rnd); - n = p - lo; - lo = p + 1; - } - else { - auxsort(L, p + 1, up, rnd); - n = up - p; - up = p - 1; - } - if ((up - lo) / 128 > n) - rnd = l_randomizePivot(L); - } -} - - -static int sort (lua_State *L) { - lua_Integer n = aux_getn(L, 1, TAB_RW); - if (n > 1) { - luaL_argcheck(L, n < INT_MAX, 1, "array too big"); - if (!lua_isnoneornil(L, 2)) - luaL_checktype(L, 2, LUA_TFUNCTION); - lua_settop(L, 2); - auxsort(L, 1, (IdxT)n, 0); - } - return 0; -} - - - - -static const luaL_Reg tab_funcs[] = { - {"concat", tconcat}, - {"create", tcreate}, - {"insert", tinsert}, - {"pack", tpack}, - {"unpack", tunpack}, - {"remove", tremove}, - {"move", tmove}, - {"sort", sort}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_table (lua_State *L) { - luaL_newlib(L, tab_funcs); - return 1; -} - - - -//path: src/imports/../dependencies/lua/lutf8lib.c - - -#define lutf8lib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include - - - - - - - - - - -#define MAXUNICODE 0x10FFFFu - -#define MAXUTF 0x7FFFFFFFu - - -#define MSGInvalid "invalid UTF-8 code" - - -#if (UINT_MAX >> 30) >= 1 -typedef unsigned int utfint; -#else -typedef unsigned long utfint; -#endif - - -#define iscont(c) (((c) & 0xC0) == 0x80) -#define iscontp(p) iscont(*(p)) - - - - -static lua_Integer u_posrelat (lua_Integer pos, size_t len) { - if (pos >= 0) return pos; - else if (0u - (size_t)pos > len) return 0; - else return (lua_Integer)len + pos + 1; -} - - - -static const char *utf8_decode (const char *s, utfint *val, int strict) { - static const utfint limits[] = - {~(utfint)0, 0x80, 0x800, 0x10000u, 0x200000u, 0x4000000u}; - unsigned int c = (unsigned char)s[0]; - utfint res = 0; - if (c < 0x80) - res = c; - else { - int count = 0; - for (; c & 0x40; c <<= 1) { - unsigned int cc = (unsigned char)s[++count]; - if (!iscont(cc)) - return NULL; - res = (res << 6) | (cc & 0x3F); - } - res |= ((utfint)(c & 0x7F) << (count * 5)); - if (count > 5 || res > MAXUTF || res < limits[count]) - return NULL; - s += count; - } - if (strict) { - - if (res > MAXUNICODE || (0xD800u <= res && res <= 0xDFFFu)) - return NULL; - } - if (val) *val = res; - return s + 1; -} - - - -static int utflen (lua_State *L) { - lua_Integer n = 0; - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer posi = u_posrelat(luaL_optinteger(L, 2, 1), len); - lua_Integer posj = u_posrelat(luaL_optinteger(L, 3, -1), len); - int lax = lua_toboolean(L, 4); - luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 2, - "initial position out of bounds"); - luaL_argcheck(L, --posj < (lua_Integer)len, 3, - "final position out of bounds"); - while (posi <= posj) { - const char *s1 = utf8_decode(s + posi, NULL, !lax); - if (s1 == NULL) { - luaL_pushfail(L); - lua_pushinteger(L, posi + 1); - return 2; - } - posi = s1 - s; - n++; - } - lua_pushinteger(L, n); - return 1; -} - - - -static int codepoint (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer posi = u_posrelat(luaL_optinteger(L, 2, 1), len); - lua_Integer pose = u_posrelat(luaL_optinteger(L, 3, posi), len); - int lax = lua_toboolean(L, 4); - int n; - const char *se; - luaL_argcheck(L, posi >= 1, 2, "out of bounds"); - luaL_argcheck(L, pose <= (lua_Integer)len, 3, "out of bounds"); - if (posi > pose) return 0; - if (pose - posi >= INT_MAX) - return luaL_error(L, "string slice too long"); - n = (int)(pose - posi) + 1; - luaL_checkstack(L, n, "string slice too long"); - n = 0; - se = s + pose; - for (s += posi - 1; s < se;) { - utfint code; - s = utf8_decode(s, &code, !lax); - if (s == NULL) - return luaL_error(L, MSGInvalid); - lua_pushinteger(L, code); - n++; - } - return n; -} - - -static void pushutfchar (lua_State *L, int arg) { - lua_Unsigned code = (lua_Unsigned)luaL_checkinteger(L, arg); - luaL_argcheck(L, code <= MAXUTF, arg, "value out of range"); - lua_pushfstring(L, "%U", (long)code); -} - - - -static int utfchar (lua_State *L) { - int n = lua_gettop(L); - if (n == 1) - pushutfchar(L, 1); - else { - int i; - luaL_Buffer b; - luaL_buffinit(L, &b); - for (i = 1; i <= n; i++) { - pushutfchar(L, i); - luaL_addvalue(&b); - } - luaL_pushresult(&b); - } - return 1; -} - - - -static int byteoffset (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer n = luaL_checkinteger(L, 2); - lua_Integer posi = (n >= 0) ? 1 : len + 1; - posi = u_posrelat(luaL_optinteger(L, 3, posi), len); - luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 3, - "position out of bounds"); - if (n == 0) { - - while (posi > 0 && iscontp(s + posi)) posi--; - } - else { - if (iscontp(s + posi)) - return luaL_error(L, "initial position is a continuation byte"); - if (n < 0) { - while (n < 0 && posi > 0) { - do { - posi--; - } while (posi > 0 && iscontp(s + posi)); - n++; - } - } - else { - n--; - while (n > 0 && posi < (lua_Integer)len) { - do { - posi++; - } while (iscontp(s + posi)); - n--; - } - } - } - if (n == 0) - lua_pushinteger(L, posi + 1); - else - luaL_pushfail(L); - return 1; -} - - -static int iter_aux (lua_State *L, int strict) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Unsigned n = (lua_Unsigned)lua_tointeger(L, 2); - if (n < len) { - while (iscontp(s + n)) n++; - } - if (n >= len) - return 0; - else { - utfint code; - const char *next = utf8_decode(s + n, &code, strict); - if (next == NULL || iscontp(next)) - return luaL_error(L, MSGInvalid); - lua_pushinteger(L, n + 1); - lua_pushinteger(L, code); - return 2; - } -} - - -static int iter_auxstrict (lua_State *L) { - return iter_aux(L, 1); -} - -static int iter_auxlax (lua_State *L) { - return iter_aux(L, 0); -} - - -static int iter_codes (lua_State *L) { - int lax = lua_toboolean(L, 2); - const char *s = luaL_checkstring(L, 1); - luaL_argcheck(L, !iscontp(s), 1, MSGInvalid); - lua_pushcfunction(L, lax ? iter_auxlax : iter_auxstrict); - lua_pushvalue(L, 1); - lua_pushinteger(L, 0); - return 3; -} - - - -#define UTF8PATT "[\0-\x7F\xC2-\xFD][\x80-\xBF]*" - - -static const luaL_Reg funcs[] = { - {"offset", byteoffset}, - {"codepoint", codepoint}, - {"char", utfchar}, - {"len", utflen}, - {"codes", iter_codes}, - - {"charpattern", NULL}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_utf8 (lua_State *L) { - luaL_newlib(L, funcs); - lua_pushlstring(L, UTF8PATT, sizeof(UTF8PATT)/sizeof(char) - 1); - lua_setfield(L, -2, "charpattern"); - return 1; -} - - - -//path: src/imports/../dependencies/lua/linit.c - - - -#define linit_c -#define LUA_LIB - - - - - - -#include - - - - - - - - - - - -static const luaL_Reg stdlibs[] = { - {LUA_GNAME, luaopen_base}, - {LUA_LOADLIBNAME, luaopen_package}, - {LUA_COLIBNAME, luaopen_coroutine}, - {LUA_DBLIBNAME, luaopen_debug}, - {LUA_IOLIBNAME, luaopen_io}, - {LUA_MATHLIBNAME, luaopen_math}, - {LUA_OSLIBNAME, luaopen_os}, - {LUA_STRLIBNAME, luaopen_string}, - {LUA_TABLIBNAME, luaopen_table}, - {LUA_UTF8LIBNAME, luaopen_utf8}, - {NULL, NULL} -}; - - - -LUALIB_API void luaL_openselectedlibs (lua_State *L, int load, int preload) { - int mask; - const luaL_Reg *lib; - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - for (lib = stdlibs, mask = 1; lib->name != NULL; lib++, mask <<= 1) { - if (load & mask) { - luaL_requiref(L, lib->name, lib->func, 1); - lua_pop(L, 1); - } - else if (preload & mask) { - lua_pushcfunction(L, lib->func); - lua_setfield(L, -2, lib->name); - } - } - lua_assert((mask >> 1) == LUA_UTF8LIBK); - lua_pop(L, 1); -} - - - -#endif - - -#ifdef MAKE_LUA -//path: src/imports/../dependencies/lua/lua.c - - -#define lua_c - - - - - -#include -#include -#include - -#include - - - - - - - - - - -#if !defined(LUA_PROGNAME) -#define LUA_PROGNAME "lua" -#endif - -#if !defined(LUA_INIT_VAR) -#define LUA_INIT_VAR "LUA_INIT" -#endif - -#define LUA_INITVARVERSION LUA_INIT_VAR LUA_VERSUFFIX - - -static lua_State *globalL = NULL; - -static const char *progname = LUA_PROGNAME; - - -#if defined(LUA_USE_POSIX) - - -static void setsignal (int sig, void (*handler)(int)) { - struct sigaction sa; - sa.sa_handler = handler; - sa.sa_flags = 0; - sigemptyset(&sa.sa_mask); - sigaction(sig, &sa, NULL); -} - -#else - -#define setsignal signal - -#endif - - - -static void lstop (lua_State *L, lua_Debug *ar) { - (void)ar; - lua_sethook(L, NULL, 0, 0); - luaL_error(L, "interrupted!"); -} - - - -static void laction (int i) { - int flag = LUA_MASKCALL | LUA_MASKRET | LUA_MASKLINE | LUA_MASKCOUNT; - setsignal(i, SIG_DFL); - lua_sethook(globalL, lstop, flag, 1); -} - - -static void print_usage (const char *badoption) { - lua_writestringerror("%s: ", progname); - if (badoption[1] == 'e' || badoption[1] == 'l') - lua_writestringerror("'%s' needs argument\n", badoption); - else - lua_writestringerror("unrecognized option '%s'\n", badoption); - lua_writestringerror( - "usage: %s [options] [script [args]]\n" - "Available options are:\n" - " -e stat execute string 'stat'\n" - " -i enter interactive mode after executing 'script'\n" - " -l mod require library 'mod' into global 'mod'\n" - " -l g=mod require library 'mod' into global 'g'\n" - " -v show version information\n" - " -E ignore environment variables\n" - " -W turn warnings on\n" - " -- stop handling options\n" - " - stop handling options and execute stdin\n" - , - progname); -} - - - -static void l_message (const char *pname, const char *msg) { - if (pname) lua_writestringerror("%s: ", pname); - lua_writestringerror("%s\n", msg); -} - - - -static int report (lua_State *L, int status) { - if (status != LUA_OK) { - const char *msg = lua_tostring(L, -1); - l_message(progname, msg); - lua_pop(L, 1); - } - return status; -} - - - -static int msghandler (lua_State *L) { - const char *msg = lua_tostring(L, 1); - if (msg == NULL) { - if (luaL_callmeta(L, 1, "__tostring") && - lua_type(L, -1) == LUA_TSTRING) - return 1; - else - msg = lua_pushfstring(L, "(error object is a %s value)", - luaL_typename(L, 1)); - } - luaL_traceback(L, L, msg, 1); - return 1; -} - - - -static int docall (lua_State *L, int narg, int nres) { - int status; - int base = lua_gettop(L) - narg; - lua_pushcfunction(L, msghandler); - lua_insert(L, base); - globalL = L; - setsignal(SIGINT, laction); - status = lua_pcall(L, narg, nres, base); - setsignal(SIGINT, SIG_DFL); - lua_remove(L, base); - return status; -} - - -static void print_version (void) { - lua_writestring(LUA_COPYRIGHT, strlen(LUA_COPYRIGHT)); - lua_writeline(); -} - - - -static void createargtable (lua_State *L, char **argv, int argc, int script) { - int i, narg; - narg = argc - (script + 1); - lua_createtable(L, narg, script + 1); - for (i = 0; i < argc; i++) { - lua_pushstring(L, argv[i]); - lua_rawseti(L, -2, i - script); - } - lua_setglobal(L, "arg"); -} - - -static int dochunk (lua_State *L, int status) { - if (status == LUA_OK) status = docall(L, 0, 0); - return report(L, status); -} - - -static int dofile (lua_State *L, const char *name) { - return dochunk(L, luaL_loadfile(L, name)); -} - - -static int dostring (lua_State *L, const char *s, const char *name) { - return dochunk(L, luaL_loadbuffer(L, s, strlen(s), name)); -} - - - -static int dolibrary (lua_State *L, char *globname) { - int status; - char *suffix = NULL; - char *modname = strchr(globname, '='); - if (modname == NULL) { - modname = globname; - suffix = strchr(modname, *LUA_IGMARK); - } - else { - *modname = '\0'; - modname++; - } - lua_getglobal(L, "require"); - lua_pushstring(L, modname); - status = docall(L, 1, 1); - if (status == LUA_OK) { - if (suffix != NULL) - *suffix = '\0'; - lua_setglobal(L, globname); - } - return report(L, status); -} - - - -static int pushargs (lua_State *L) { - int i, n; - if (lua_getglobal(L, "arg") != LUA_TTABLE) - luaL_error(L, "'arg' is not a table"); - n = (int)luaL_len(L, -1); - luaL_checkstack(L, n + 3, "too many arguments to script"); - for (i = 1; i <= n; i++) - lua_rawgeti(L, -i, i); - lua_remove(L, -i); - return n; -} - - -static int handle_script (lua_State *L, char **argv) { - int status; - const char *fname = argv[0]; - if (strcmp(fname, "-") == 0 && strcmp(argv[-1], "--") != 0) - fname = NULL; - status = luaL_loadfile(L, fname); - if (status == LUA_OK) { - int n = pushargs(L); - status = docall(L, n, LUA_MULTRET); - } - return report(L, status); -} - - - -#define has_error 1 -#define has_i 2 -#define has_v 4 -#define has_e 8 -#define has_E 16 - - - -static int collectargs (char **argv, int *first) { - int args = 0; - int i; - if (argv[0] != NULL) { - if (argv[0][0]) - progname = argv[0]; - } - else { - *first = -1; - return 0; - } - for (i = 1; argv[i] != NULL; i++) { - *first = i; - if (argv[i][0] != '-') - return args; - switch (argv[i][1]) { - case '-': - if (argv[i][2] != '\0') - return has_error; - *first = i + 1; - return args; - case '\0': - return args; - case 'E': - if (argv[i][2] != '\0') - return has_error; - args |= has_E; - break; - case 'W': - if (argv[i][2] != '\0') - return has_error; - break; - case 'i': - args |= has_i; /* FALLTHROUGH */ - case 'v': - if (argv[i][2] != '\0') - return has_error; - args |= has_v; - break; - case 'e': - args |= has_e; - case 'l': - if (argv[i][2] == '\0') { - i++; - if (argv[i] == NULL || argv[i][0] == '-') - return has_error; - } - break; - default: - return has_error; - } - } - *first = 0; - return args; -} - - - -static int runargs (lua_State *L, char **argv, int n) { - int i; - for (i = 1; i < n; i++) { - int option = argv[i][1]; - lua_assert(argv[i][0] == '-'); - switch (option) { - case 'e': case 'l': { - int status; - char *extra = argv[i] + 2; - if (*extra == '\0') extra = argv[++i]; - lua_assert(extra != NULL); - status = (option == 'e') - ? dostring(L, extra, "=(command line)") - : dolibrary(L, extra); - if (status != LUA_OK) return 0; - break; - } - case 'W': - lua_warning(L, "@on", 0); - break; - } - } - return 1; -} - - -static int handle_luainit (lua_State *L) { - const char *name = "=" LUA_INITVARVERSION; - const char *init = getenv(name + 1); - if (init == NULL) { - name = "=" LUA_INIT_VAR; - init = getenv(name + 1); - } - if (init == NULL) return LUA_OK; - else if (init[0] == '@') - return dofile(L, init+1); - else - return dostring(L, init, name); -} - - - - -#if !defined(LUA_PROMPT) -#define LUA_PROMPT "> " -#define LUA_PROMPT2 ">> " -#endif - -#if !defined(LUA_MAXINPUT) -#define LUA_MAXINPUT 512 -#endif - - - -#if !defined(lua_stdin_is_tty) - -#if defined(LUA_USE_POSIX) - -#include -#define lua_stdin_is_tty() isatty(0) - -#elif defined(LUA_USE_WINDOWS) - -#include -#include - -#define lua_stdin_is_tty() _isatty(_fileno(stdin)) - -#else - - -#define lua_stdin_is_tty() 1 - -#endif - -#endif - - - -#if !defined(lua_readline) - -#if defined(LUA_USE_READLINE) - -#include -#include -#define lua_initreadline(L) ((void)L, rl_readline_name="lua") -#define lua_readline(L,b,p) ((void)L, ((b)=readline(p)) != NULL) -#define lua_saveline(L,line) ((void)L, add_history(line)) -#define lua_freeline(L,b) ((void)L, free(b)) - -#else - -#define lua_initreadline(L) ((void)L) -#define lua_readline(L,b,p) \ - ((void)L, fputs(p, stdout), fflush(stdout), \ - fgets(b, LUA_MAXINPUT, stdin) != NULL) -#define lua_saveline(L,line) { (void)L; (void)line; } -#define lua_freeline(L,b) { (void)L; (void)b; } - -#endif - -#endif - - - -static const char *get_prompt (lua_State *L, int firstline) { - if (lua_getglobal(L, firstline ? "_PROMPT" : "_PROMPT2") == LUA_TNIL) - return (firstline ? LUA_PROMPT : LUA_PROMPT2); - else { - const char *p = luaL_tolstring(L, -1, NULL); - lua_remove(L, -2); - return p; - } -} - - -#define EOFMARK "" -#define marklen (sizeof(EOFMARK)/sizeof(char) - 1) - - - -static int incomplete (lua_State *L, int status) { - if (status == LUA_ERRSYNTAX) { - size_t lmsg; - const char *msg = lua_tolstring(L, -1, &lmsg); - if (lmsg >= marklen && strcmp(msg + lmsg - marklen, EOFMARK) == 0) { - lua_pop(L, 1); - return 1; - } - } - return 0; -} - - - -static int pushline (lua_State *L, int firstline) { - char buffer[LUA_MAXINPUT]; - char *b = buffer; - size_t l; - const char *prmt = get_prompt(L, firstline); - int readstatus = lua_readline(L, b, prmt); - if (readstatus == 0) - return 0; - lua_pop(L, 1); - l = strlen(b); - if (l > 0 && b[l-1] == '\n') - b[--l] = '\0'; - if (firstline && b[0] == '=') - lua_pushfstring(L, "return %s", b + 1); - else - lua_pushlstring(L, b, l); - lua_freeline(L, b); - return 1; -} - - - -static int addreturn (lua_State *L) { - const char *line = lua_tostring(L, -1); - const char *retline = lua_pushfstring(L, "return %s;", line); - int status = luaL_loadbuffer(L, retline, strlen(retline), "=stdin"); - if (status == LUA_OK) { - lua_remove(L, -2); - if (line[0] != '\0') - lua_saveline(L, line); - } - else - lua_pop(L, 2); - return status; -} - - - -static int multiline (lua_State *L) { - for (;;) { - size_t len; - const char *line = lua_tolstring(L, 1, &len); - int status = luaL_loadbuffer(L, line, len, "=stdin"); - if (!incomplete(L, status) || !pushline(L, 0)) { - lua_saveline(L, line); - return status; - } - lua_pushliteral(L, "\n"); - lua_insert(L, -2); - lua_concat(L, 3); - } -} - - - -static int loadline (lua_State *L) { - int status; - lua_settop(L, 0); - if (!pushline(L, 1)) - return -1; - if ((status = addreturn(L)) != LUA_OK) - status = multiline(L); - lua_remove(L, 1); - lua_assert(lua_gettop(L) == 1); - return status; -} - - - -static void l_print (lua_State *L) { - int n = lua_gettop(L); - if (n > 0) { - luaL_checkstack(L, LUA_MINSTACK, "too many results to print"); - lua_getglobal(L, "print"); - lua_insert(L, 1); - if (lua_pcall(L, n, 0, 0) != LUA_OK) - l_message(progname, lua_pushfstring(L, "error calling 'print' (%s)", - lua_tostring(L, -1))); - } -} - - - -static void doREPL (lua_State *L) { - int status; - const char *oldprogname = progname; - progname = NULL; - lua_initreadline(L); - while ((status = loadline(L)) != -1) { - if (status == LUA_OK) - status = docall(L, 0, LUA_MULTRET); - if (status == LUA_OK) l_print(L); - else report(L, status); - } - lua_settop(L, 0); - lua_writeline(); - progname = oldprogname; -} - - - -#if !defined(luai_openlibs) -#define luai_openlibs(L) luaL_openselectedlibs(L, ~0, 0) -#endif - - - -static int pmain (lua_State *L) { - int argc = (int)lua_tointeger(L, 1); - char **argv = (char **)lua_touserdata(L, 2); - int script; - int args = collectargs(argv, &script); - int optlim = (script > 0) ? script : argc; - luaL_checkversion(L); - if (args == has_error) { - print_usage(argv[script]); - return 0; - } - if (args & has_v) - print_version(); - if (args & has_E) { - lua_pushboolean(L, 1); - lua_setfield(L, LUA_REGISTRYINDEX, "LUA_NOENV"); - } - luai_openlibs(L); - createargtable(L, argv, argc, script); - lua_gc(L, LUA_GCRESTART); - lua_gc(L, LUA_GCGEN); - if (!(args & has_E)) { - if (handle_luainit(L) != LUA_OK) - return 0; - } - if (!runargs(L, argv, optlim)) - return 0; - if (script > 0) { - if (handle_script(L, argv + script) != LUA_OK) - return 0; - } - if (args & has_i) - doREPL(L); - else if (script < 1 && !(args & (has_e | has_v))) { - if (lua_stdin_is_tty()) { - print_version(); - doREPL(L); - } - else dofile(L, NULL); - } - lua_pushboolean(L, 1); - return 1; -} - - - - -#endif - - -#ifdef MAKE_LUAC -//path: src/imports/../dependencies/lua/luac.c - - - -#define luac_c -#define LUA_CORE - - - - -#include -#include -#include -#include -#include - - - - - - - - - - - - -//path: src/imports/../dependencies/lua/lopnames.h - - -#if !defined(lopnames_h) -#define lopnames_h - -#include - - - - -static const char *const opnames[] = { - "MOVE", - "LOADI", - "LOADF", - "LOADK", - "LOADKX", - "LOADFALSE", - "LFALSESKIP", - "LOADTRUE", - "LOADNIL", - "GETUPVAL", - "SETUPVAL", - "GETTABUP", - "GETTABLE", - "GETI", - "GETFIELD", - "SETTABUP", - "SETTABLE", - "SETI", - "SETFIELD", - "NEWTABLE", - "SELF", - "ADDI", - "ADDK", - "SUBK", - "MULK", - "MODK", - "POWK", - "DIVK", - "IDIVK", - "BANDK", - "BORK", - "BXORK", - "SHRI", - "SHLI", - "ADD", - "SUB", - "MUL", - "MOD", - "POW", - "DIV", - "IDIV", - "BAND", - "BOR", - "BXOR", - "SHL", - "SHR", - "MMBIN", - "MMBINI", - "MMBINK", - "UNM", - "BNOT", - "NOT", - "LEN", - "CONCAT", - "CLOSE", - "TBC", - "JMP", - "EQ", - "LT", - "LE", - "EQK", - "EQI", - "LTI", - "LEI", - "GTI", - "GEI", - "TEST", - "TESTSET", - "CALL", - "TAILCALL", - "RETURN", - "RETURN0", - "RETURN1", - "FORLOOP", - "FORPREP", - "TFORPREP", - "TFORCALL", - "TFORLOOP", - "SETLIST", - "CLOSURE", - "VARARG", - "VARARGPREP", - "EXTRAARG", - NULL -}; - -#endif - - - - - - - - -static void PrintFunction(const Proto* f, int full); -#define luaU_print PrintFunction - -#define PROGNAME "luac" -#define OUTPUT PROGNAME ".out" - -static int listing=0; -static int dumping=1; -static int stripping=0; -static char Output[]={ OUTPUT }; -static const char* output=Output; -static const char* progname=PROGNAME; -static TString **tmname; - -static void fatal(const char* message) -{ - fprintf(stderr,"%s: %s\n",progname,message); - exit(EXIT_FAILURE); -} - -static void cannot(const char* what) -{ - fprintf(stderr,"%s: cannot %s %s: %s\n",progname,what,output,strerror(errno)); - exit(EXIT_FAILURE); -} - -static void usage(const char* message) -{ - if (*message=='-') - fprintf(stderr,"%s: unrecognized option '%s'\n",progname,message); - else - fprintf(stderr,"%s: %s\n",progname,message); - fprintf(stderr, - "usage: %s [options] [filenames]\n" - "Available options are:\n" - " -l list (use -l -l for full listing)\n" - " -o name output to file 'name' (default is \"%s\")\n" - " -p parse only\n" - " -s strip debug information\n" - " -v show version information\n" - " -- stop handling options\n" - " - stop handling options and process stdin\n" - ,progname,Output); - exit(EXIT_FAILURE); -} - -#define IS(s) (strcmp(argv[i],s)==0) - -static int doargs(int argc, char* argv[]) -{ - int i; - int version=0; - if (argv[0]!=NULL && *argv[0]!=0) progname=argv[0]; - for (i=1; itop.p+(i))) - -static const Proto* combine(lua_State* L, int n) -{ - if (n==1) - return toproto(L,-1); - else - { - Proto* f; - int i=n; - if (lua_load(L,reader,&i,"=(" PROGNAME ")",NULL)!=LUA_OK) fatal(lua_tostring(L,-1)); - f=toproto(L,-1); - for (i=0; ip[i]=toproto(L,i-n-1); - if (f->p[i]->sizeupvalues>0) f->p[i]->upvalues[0].instack=0; - } - return f; - } -} - -static int writer(lua_State* L, const void* p, size_t size, void* u) -{ - UNUSED(L); - return (fwrite(p,size,1,(FILE*)u)!=1) && (size!=0); -} - -static int pmain(lua_State* L) -{ - int argc=(int)lua_tointeger(L,1); - char** argv=(char**)lua_touserdata(L,2); - const Proto* f; - int i; - tmname=G(L)->tmname; - if (!lua_checkstack(L,argc)) fatal("too many input files"); - for (i=0; i1); - if (dumping) - { - FILE* D= (output==NULL) ? stdout : fopen(output,"wb"); - if (D==NULL) cannot("open"); - lua_lock(L); - luaU_dump(L,f,writer,D,stripping); - lua_unlock(L); - if (ferror(D)) cannot("write"); - if (fclose(D)) cannot("close"); - } - return 0; -} - -int main(int argc, char* argv[]) -{ - lua_State* L; - int i=doargs(argc,argv); - argc-=i; argv+=i; - if (argc<=0) usage("no input files given"); - L=luaL_newstate(); - if (L==NULL) fatal("cannot create state: not enough memory"); - lua_pushcfunction(L,&pmain); - lua_pushinteger(L,argc); - lua_pushlightuserdata(L,argv); - if (lua_pcall(L,2,0,0)!=LUA_OK) fatal(lua_tostring(L,-1)); - lua_close(L); - return EXIT_SUCCESS; -} - - - -#define UPVALNAME(x) ((f->upvalues[x].name) ? getstr(f->upvalues[x].name) : "-") -#define VOID(p) ((const void*)(p)) -#define eventname(i) (getstr(tmname[i])) - -static void PrintString(const TString* ts) -{ - const char* s=getstr(ts); - size_t i,n=tsslen(ts); - printf("\""); - for (i=0; ik[i]; - switch (ttypetag(o)) - { - case LUA_VNIL: - printf("N"); - break; - case LUA_VFALSE: - case LUA_VTRUE: - printf("B"); - break; - case LUA_VNUMFLT: - printf("F"); - break; - case LUA_VNUMINT: - printf("I"); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - printf("S"); - break; - default: - printf("?%d",ttypetag(o)); - break; - } - printf("\t"); -} - -static void PrintConstant(const Proto* f, int i) -{ - const TValue* o=&f->k[i]; - switch (ttypetag(o)) - { - case LUA_VNIL: - printf("nil"); - break; - case LUA_VFALSE: - printf("false"); - break; - case LUA_VTRUE: - printf("true"); - break; - case LUA_VNUMFLT: - { - char buff[100]; - sprintf(buff,LUA_NUMBER_FMT,fltvalue(o)); - printf("%s",buff); - if (buff[strspn(buff,"-0123456789")]=='\0') printf(".0"); - break; - } - case LUA_VNUMINT: - printf(LUA_INTEGER_FMT,ivalue(o)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - PrintString(tsvalue(o)); - break; - default: - printf("?%d",ttypetag(o)); - break; - } -} - -#define COMMENT "\t; " -#define EXTRAARG GETARG_Ax(code[pc+1]) -#define EXTRAARGC (EXTRAARG*(MAXARG_C+1)) -#define ISK (isk ? "k" : "") - -static void PrintCode(const Proto* f) -{ - const Instruction* code=f->code; - int pc,n=f->sizecode; - for (pc=0; pc0) printf("[%d]\t",line); else printf("[-]\t"); - printf("%-9s\t",opnames[o]); - switch (o) - { - case OP_MOVE: - printf("%d %d",a,b); - break; - case OP_LOADI: - printf("%d %d",a,sbx); - break; - case OP_LOADF: - printf("%d %d",a,sbx); - break; - case OP_LOADK: - printf("%d %d",a,bx); - printf(COMMENT); PrintConstant(f,bx); - break; - case OP_LOADKX: - printf("%d",a); - printf(COMMENT); PrintConstant(f,EXTRAARG); - break; - case OP_LOADFALSE: - printf("%d",a); - break; - case OP_LFALSESKIP: - printf("%d",a); - break; - case OP_LOADTRUE: - printf("%d",a); - break; - case OP_LOADNIL: - printf("%d %d",a,b); - printf(COMMENT "%d out",b+1); - break; - case OP_GETUPVAL: - printf("%d %d",a,b); - printf(COMMENT "%s",UPVALNAME(b)); - break; - case OP_SETUPVAL: - printf("%d %d",a,b); - printf(COMMENT "%s",UPVALNAME(b)); - break; - case OP_GETTABUP: - printf("%d %d %d",a,b,c); - printf(COMMENT "%s",UPVALNAME(b)); - printf(" "); PrintConstant(f,c); - break; - case OP_GETTABLE: - printf("%d %d %d",a,b,c); - break; - case OP_GETI: - printf("%d %d %d",a,b,c); - break; - case OP_GETFIELD: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_SETTABUP: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT "%s",UPVALNAME(a)); - printf(" "); PrintConstant(f,b); - if (isk) { printf(" "); PrintConstant(f,c); } - break; - case OP_SETTABLE: - printf("%d %d %d%s",a,b,c,ISK); - if (isk) { printf(COMMENT); PrintConstant(f,c); } - break; - case OP_SETI: - printf("%d %d %d%s",a,b,c,ISK); - if (isk) { printf(COMMENT); PrintConstant(f,c); } - break; - case OP_SETFIELD: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT); PrintConstant(f,b); - if (isk) { printf(" "); PrintConstant(f,c); } - break; - case OP_NEWTABLE: - printf("%d %d %d",a,b,c); - printf(COMMENT "%d",c+EXTRAARGC); - break; - case OP_SELF: - printf("%d %d %d%s",a,b,c,ISK); - if (isk) { printf(COMMENT); PrintConstant(f,c); } - break; - case OP_ADDI: - printf("%d %d %d",a,b,sc); - break; - case OP_ADDK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_SUBK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_MULK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_MODK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_POWK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_DIVK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_IDIVK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_BANDK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_BORK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_BXORK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_SHRI: - printf("%d %d %d",a,b,sc); - break; - case OP_SHLI: - printf("%d %d %d",a,b,sc); - break; - case OP_ADD: - printf("%d %d %d",a,b,c); - break; - case OP_SUB: - printf("%d %d %d",a,b,c); - break; - case OP_MUL: - printf("%d %d %d",a,b,c); - break; - case OP_MOD: - printf("%d %d %d",a,b,c); - break; - case OP_POW: - printf("%d %d %d",a,b,c); - break; - case OP_DIV: - printf("%d %d %d",a,b,c); - break; - case OP_IDIV: - printf("%d %d %d",a,b,c); - break; - case OP_BAND: - printf("%d %d %d",a,b,c); - break; - case OP_BOR: - printf("%d %d %d",a,b,c); - break; - case OP_BXOR: - printf("%d %d %d",a,b,c); - break; - case OP_SHL: - printf("%d %d %d",a,b,c); - break; - case OP_SHR: - printf("%d %d %d",a,b,c); - break; - case OP_MMBIN: - printf("%d %d %d",a,b,c); - printf(COMMENT "%s",eventname(c)); - break; - case OP_MMBINI: - printf("%d %d %d %d",a,sb,c,isk); - printf(COMMENT "%s",eventname(c)); - if (isk) printf(" flip"); - break; - case OP_MMBINK: - printf("%d %d %d %d",a,b,c,isk); - printf(COMMENT "%s ",eventname(c)); PrintConstant(f,b); - if (isk) printf(" flip"); - break; - case OP_UNM: - printf("%d %d",a,b); - break; - case OP_BNOT: - printf("%d %d",a,b); - break; - case OP_NOT: - printf("%d %d",a,b); - break; - case OP_LEN: - printf("%d %d",a,b); - break; - case OP_CONCAT: - printf("%d %d",a,b); - break; - case OP_CLOSE: - printf("%d",a); - break; - case OP_TBC: - printf("%d",a); - break; - case OP_JMP: - printf("%d",GETARG_sJ(i)); - printf(COMMENT "to %d",GETARG_sJ(i)+pc+2); - break; - case OP_EQ: - printf("%d %d %d",a,b,isk); - break; - case OP_LT: - printf("%d %d %d",a,b,isk); - break; - case OP_LE: - printf("%d %d %d",a,b,isk); - break; - case OP_EQK: - printf("%d %d %d",a,b,isk); - printf(COMMENT); PrintConstant(f,b); - break; - case OP_EQI: - printf("%d %d %d",a,sb,isk); - break; - case OP_LTI: - printf("%d %d %d",a,sb,isk); - break; - case OP_LEI: - printf("%d %d %d",a,sb,isk); - break; - case OP_GTI: - printf("%d %d %d",a,sb,isk); - break; - case OP_GEI: - printf("%d %d %d",a,sb,isk); - break; - case OP_TEST: - printf("%d %d",a,isk); - break; - case OP_TESTSET: - printf("%d %d %d",a,b,isk); - break; - case OP_CALL: - printf("%d %d %d",a,b,c); - printf(COMMENT); - if (b==0) printf("all in "); else printf("%d in ",b-1); - if (c==0) printf("all out"); else printf("%d out",c-1); - break; - case OP_TAILCALL: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT "%d in",b-1); - break; - case OP_RETURN: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT); - if (b==0) printf("all out"); else printf("%d out",b-1); - break; - case OP_RETURN0: - break; - case OP_RETURN1: - printf("%d",a); - break; - case OP_FORLOOP: - printf("%d %d",a,bx); - printf(COMMENT "to %d",pc-bx+2); - break; - case OP_FORPREP: - printf("%d %d",a,bx); - printf(COMMENT "exit to %d",pc+bx+3); - break; - case OP_TFORPREP: - printf("%d %d",a,bx); - printf(COMMENT "to %d",pc+bx+2); - break; - case OP_TFORCALL: - printf("%d %d",a,c); - break; - case OP_TFORLOOP: - printf("%d %d",a,bx); - printf(COMMENT "to %d",pc-bx+2); - break; - case OP_SETLIST: - printf("%d %d %d",a,b,c); - if (isk) printf(COMMENT "%d",c+EXTRAARGC); - break; - case OP_CLOSURE: - printf("%d %d",a,bx); - printf(COMMENT "%p",VOID(f->p[bx])); - break; - case OP_VARARG: - printf("%d %d",a,c); - printf(COMMENT); - if (c==0) printf("all out"); else printf("%d out",c-1); - break; - case OP_VARARGPREP: - printf("%d",a); - break; - case OP_EXTRAARG: - printf("%d",ax); - break; -#if 0 - default: - printf("%d %d %d",a,b,c); - printf(COMMENT "not handled"); - break; -#endif - } - printf("\n"); - } -} - - -#define SS(x) ((x==1)?"":"s") -#define S(x) (int)(x),SS(x) - -static void PrintHeader(const Proto* f) -{ - const char* s=f->source ? getstr(f->source) : "=?"; - if (*s=='@' || *s=='=') - s++; - else if (*s==LUA_SIGNATURE[0]) - s="(bstring)"; - else - s="(string)"; - printf("\n%s <%s:%d,%d> (%d instruction%s at %p)\n", - (f->linedefined==0)?"main":"function",s, - f->linedefined,f->lastlinedefined, - S(f->sizecode),VOID(f)); - printf("%d%s param%s, %d slot%s, %d upvalue%s, ", - (int)(f->numparams),f->is_vararg?"+":"",SS(f->numparams), - S(f->maxstacksize),S(f->sizeupvalues)); - printf("%d local%s, %d constant%s, %d function%s\n", - S(f->sizelocvars),S(f->sizek),S(f->sizep)); -} - -static void PrintDebug(const Proto* f) -{ - int i,n; - n=f->sizek; - printf("constants (%d) for %p:\n",n,VOID(f)); - for (i=0; isizelocvars; - printf("locals (%d) for %p:\n",n,VOID(f)); - for (i=0; ilocvars[i].varname),f->locvars[i].startpc+1,f->locvars[i].endpc+1); - } - n=f->sizeupvalues; - printf("upvalues (%d) for %p:\n",n,VOID(f)); - for (i=0; iupvalues[i].instack,f->upvalues[i].idx); - } -} - -static void PrintFunction(const Proto* f, int full) -{ - int i,n=f->sizep; - PrintHeader(f); - PrintCode(f); - if (full) PrintDebug(f); - for (i=0; ip[i],full); -} - -#endif - - - - -#endif - - -#ifndef privateluacembed_consts -#define privateluacembed_consts -//path: src/imports/../constants/consts.aplication.h -//mannaged by silver chain - -#ifndef LUA_CEMBED_INDEX_DIF -#define LUA_CEMBED_INDEX_DIF 1 -#endif - -#define PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE 1 -#define PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE 2 -#define LUA_CEMBED_DEFAULT_TIMEOUT 10 -#define LUA_CEMBED_DEFAULT_MEMORY_LIMIT 100 - -#define PRIVATE_LUA_CEMBED_ONE_MB (1024 * 1024) - - -//path: src/imports/../constants/consts.errors.h -//mannaged by silver chain - - - -#define PRIVATE_LUA_CEMBED_TIMEOUT_ERROR "timeout error" -#define PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED "arg %ld at function:%s not provided" -#define PRIVATE_LUA_CEMBED_ARG_WRONG_TYPE "arg %d at function:%s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_GLOBAL_WRONG_TYPE "global variable:%s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_RESULT_EVALUATION_WRONG_TYPE "result evaluation its:%s instead of %s" -#define PRIVATE_LUA_CEMBED_RESULT_EVALUATION_ARG_WRONG_TYPE "result evaluation of function %s at index %d its:%s instead of %s" - -#define PRIVATE_LUA_CEMBED_CODE_ITS_NOT_A_FUNCTION "value %s its not a function" -#define PRIVATE_LUA_CEMBED_WRONG_TYPE_PROPETY "propety %s at object %s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX "index %d at object %s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_ELEMENT_DOES_NOT_HAVE_KEY "index %d at object %s not have a key" -#define PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR "timeout error" -#define PRIVATE_LUA_CEMBED_LIB_PROP_WRONG_TYPE "lib prop %s its %s insteadd of %s" - -//path: src/imports/../constants/consts.lua_code.h -//mannaged by silver chain - - -#define PRIVATE_LUA_CEMBED_TOTAL_LIBS "private_lua_c_embed_total_running_libs" -#define PRIVATE_LUA_CEMBED_STACK_LEVEL "private_lua_c_embed_stack_level" - -#define PRIVATE_LUA_CEMBED_EVALUATION_NAME "private_lua_c_embed_evaluation" -#define PRIVATE_LUA_CEMBED_DEL_PREFIX "__gc" -#define PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE "%s = %s\n" - - - - -#define PRIVATE_LUA_CEMBED_SELFNAME "private_lua_c_embed_self" -#define PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE "private_lua_c_embed_stage_area_table" -#define PRIVATE_LUA_CEMBED_TABLE_RETURN "private_lua_embed_table_return" - -#define PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__ "private_lua_c_embed_main_lib_table_%d" -#define PRIVATE_LUA_CEMBED_MAIN_LIB_SUB_TABLE "private_lua_c_embed_main_lib_table_%d_%s" - -#define PRIVATE_LUA_CEMBED_MAIN_META_TABLE__ "private_lua_c_embed_main_meta_table_%d" -#define PRIVATE_LUA_CEMBED_ANONYMOUS_TABLE_ "private_lua_c_embed_anononymous_table_%d_%d" -#define PRIVATE_LUA_CEMBED_ANONYMOUS_FUNC_TABLE_ "private_lua_c_embed_anononymous_func_table_%d_%d" -#define PRIVATE_LUA_CEMBED_ARGS_ "private_lua_c_embed_args_%d_%d" -#define PRIVATE_LUA_CEMBED_MULTIRETURN_ "private_lua_c_embed_multi_return_%d_%d" - -//path: src/imports/../constants/consts.main_callback.h -//mannaged by silver chain - - -#define PRIVATE_LUACEMBED_NO_RETURN 0 -#define PRIVATE_LUACEMBED_ONE_RETURN 1 - - - -//path: src/imports/../constants/consts.responses.h -//mannaged by silver chain - -#define PRIVATE_LUA_CEMBED_STRING_RESPONSE 1 -#define PRIVATE_LUA_CEMBED_LONG_RESPONSE 2 -#define PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE 3 -#define PRIVATE_LUA_CEMBED_BOOL_RESPONSE 4 -#define PRIVATE_LUA_CEMBED_TABLE_RESPONSE 5 - -#define PRIVATE_LUA_CEMBED_EVALUATION 6 -#define PRIVATE_LUA_CEMBED_ERROR_RESPONSE 7 -#define PRIVATE_LUA_CEMBED_MULTI_RESPONSE 8 - -#define LUA_CEMBED_OK 0 -#define LUA_CEMBED_GENERIC_ERROR (-1) - -//path: src/imports/../constants/consts.types.h -//mannaged by silver chain - -#define LUA_CEMBED_NOT_FOUND LUA_TNONE -#define LUA_CEMBED_STRING LUA_TSTRING -#define LUA_CEMBED_NUMBER LUA_TNUMBER -#define LUA_CEMBED_BOOL LUA_TBOOLEAN -#define LUA_CEMBED_NIL LUA_TNIL -#define LUA_CEMBED_FUNCTION LUA_TFUNCTION -#define LUA_CEMBED_TABLE LUA_TTABLE - -#define PRIVATE_LUA_CEMBED_NOT_FOUND_STRING "not Found" -#define PRIVATE_LUA_CEMBED_STRING_STRING "string" -#define PRIVATE_LUA_CEMBED_NUMBER_STRING "number" -#define PRIVATE_LUA_CEMBED_BOOL_STRING "boolean" -#define PRIVATE_LUA_CEMBED_NIL_STRING "nil" -#define PRIVATE_LUA_CEMBED_TABLE_STRING "table" -#define PRIVATE_LUA_CEMBED_FUNCTION_STRING "function" - -#define PRIVATE_LUA_CEMBED_UNKNOW_STRING "unknow" - -#endif - - -#ifndef privateluacembed_macros -#define privateluacembed_macros -//path: src/imports/../LuaCEmbed/macros.protection_macros.h -//mannaged by silver chain - -#define PRIVATE_LUA_CEMBED_PROTECT_VOID \ - if(!self){ \ - return; \ - } - - -#define PRIVATE_LUA_CEMBED_PROTECT_NUM \ - if(!self){ \ - return LUA_CEMBED_GENERIC_ERROR; \ - } - -#define PRIVATE_LUA_CEMBED_PROTECT_BOOL \ - if(!self){ \ - return false; \ - } - -#define PRIVATE_LUA_CEMBED_PROTECT_NULL \ - if(!self){ \ - return NULL; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK if(lua_gettop(self->main_object->state)){lua_settop(self->main_object->state,0);} - -#define PRIVATE_LUA_CEMBED_CLEAR_STACK if(lua_gettop(self->state)){lua_settop(self->state,0);} - - -//path: src/imports/../LuaCEmbed/table/macros.protection_macros.h -//mannaged by silver chain - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID \ - if(!self){ \ - return; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM \ - if(!self){ \ - return LUA_CEMBED_GENERIC_ERROR; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL \ - if(!self){ \ - return false; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL \ - if(!self){ \ - return NULL; \ - } - - -#endif - - -#ifndef privateluacembed_types -#define privateluacembed_types -//path: src/imports/../LuaCEmbed/types.LuaCEmbed.h -//mannaged by silver chain - - -typedef struct LuaCEmbed{ - lua_State *state; - const char *current_function; - bool is_lib; - int total_args; - char *error_msg; - void (*delete_function)(struct LuaCEmbed *self); - void *global_tables; - void *func_tables; - int lib_identifier; - int stack_leve; - char *main_lib_table; - bool field_protection; -}LuaCEmbed; - -int lua_cembed_timeout = -1; -LuaCEmbed *global_current_lua_embed_object; - - -//path: src/imports/../LuaCEmbedResponse/types.LuaCembedResponse.h -//mannaged by silver chain - - -typedef struct { - - int type; - double num_val; - bool its_string_ref; - long string_size; - char *string_val; - -}LuaCEmbedResponse; - - -//path: src/imports/../types.typedefs.h -//mannaged by silver chain - -typedef long private_lua_cembed_incremented_arg ; - - -#endif - - -#ifndef privateluacembed_typesB -#define privateluacembed_typesB -//path: src/imports/../LuaCEmbed/table/table/typesB.table.h -//mannaged by silver chain - - - -typedef struct { - LuaCEmbed *main_object; - char *prop_name; - char *global_name; - void *sub_tables; - long index; - -}LuaCEmbedTable; - - -#endif - - -#ifndef privateluacembed_typesC -#define privateluacembed_typesC -//path: src/imports/../namespace/args/typesC.args.h -//mannaged by silver chain - - -typedef struct { - - - int (*size)(LuaCEmbed *self); - int (*get_type)(LuaCEmbed *self,int index); - long long (*get_long)(LuaCEmbed *self, int index); - double (*get_double)(LuaCEmbed *self, int index); - bool (*get_bool)(LuaCEmbed *self, int index); - char * (*get_raw_str)(LuaCEmbed *self, long *size, int index); - char * (*get_str)(LuaCEmbed *self, int index); - LuaCEmbedTable * (*get_table)(LuaCEmbed *self,int index); - int (*generate_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - int (*get_type_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - long long (*get_long_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - double (*get_double_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - bool (*get_bool_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - char* (*get_string_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - LuaCEmbedTable* (*run_lambda)(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call,int total_returns); - - - - -} LuaCembedArgsModule; - - -//path: src/imports/../namespace/globals/typesC.globals.h -//mannaged by silver chain - - - -typedef struct { - - int (*ensure_type)(LuaCEmbed *self, const char *name,int expected_type); - int (*get_type)(LuaCEmbed *self,const char *name); - long long (*get_long)(LuaCEmbed *self,const char *name); - double (*get_double)(LuaCEmbed *self,const char *name); - bool (*get_bool)(LuaCEmbed *self,const char *name); - char * (*get_string)(LuaCEmbed *self,const char *name); - LuaCEmbedTable* (*run_global_lambda)(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns); - void (*set_table)(LuaCEmbed *self, const char *name, LuaCEmbedTable *table); - void (*set_raw_string)(LuaCEmbed *self, const char *name, const char *value, long size); - char * (*get_raw_string)(LuaCEmbed *self, const char *name, long *size); - - - void (*set_string)(LuaCEmbed *self,const char *name,const char *value); - void (*set_long)(LuaCEmbed *self,const char *name,long long value); - void (*set_double)(LuaCEmbed *self,const char *name,double value); - void (*set_bool)(LuaCEmbed *self,const char *name,bool value); - - LuaCEmbedTable * (*get_table)(LuaCEmbed *self, const char *name); - LuaCEmbedTable * (*new_table)(LuaCEmbed *self, const char *name); - - -}LuaCEmbedGlobalModule; - - -//path: src/imports/../namespace/response/typesC.response.h -//mannaged by silver chain - - -typedef struct { - LuaCEmbedResponse * (*send_multi_return)(LuaCEmbedTable *table); - LuaCEmbedResponse * (*send_str)(const char *text); - LuaCEmbedResponse * (*send_raw_string)(const char *text,long size); - LuaCEmbedResponse * (*send_str_reference)( const char *text); - LuaCEmbedResponse * (*send_raw_string_reference)(const char *text,long size); - LuaCEmbedResponse * (*send_table)(LuaCEmbedTable *table); - LuaCEmbedResponse * (*send_evaluation_function)(const char *function); - LuaCEmbedResponse * (*send_double)(double value); - LuaCEmbedResponse * (*send_bool)(bool value); - LuaCEmbedResponse * (*send_long)(long value); - LuaCEmbedResponse * (*send_error)(const char *format,...); - -}LuaCEmbedResponseModule; - - -//path: src/imports/../namespace/table/typesC.table.h -//mannaged by silver chain - -typedef struct { - - void (*append_string)(LuaCEmbedTable *self, const char *value); - void (*append_long)(LuaCEmbedTable *self, long long value); - void (*append_double)(LuaCEmbedTable *self, double value); - void (*append_bool)(LuaCEmbedTable *self, bool value); - void (*append_table)(LuaCEmbedTable *self, LuaCEmbedTable *table); - void (*set_evaluation_prop)(LuaCEmbedTable *self, const char *name, const char *code, ...); - void (*append_evaluation)(LuaCEmbedTable *self, const char *code, ...); - - void (*insert_string_at_index)(LuaCEmbedTable *self, long index, const char *value); - void (*insert_bool_at_index)(LuaCEmbedTable *self, long index,bool value); - void (*insert_long_at_index)(LuaCEmbedTable *self, long long index,long value); - void (*insert_double_at_index)(LuaCEmbedTable *self, long index,double value); - void (*insert_table_at_index)(LuaCEmbedTable *self, long index,LuaCEmbedTable *table); - - - - void (*set_sub_table_by_index)(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table); - void (*set_string_by_index)(LuaCEmbedTable *self, long index, const char *value); - void (*set_long_by_index)(LuaCEmbedTable *self, long long index, long value); - void (*set_double_by_index)(LuaCEmbedTable *self, long index, double value); - void (*set_bool_by_index)(LuaCEmbedTable *self, long index, bool value); - void (*set_evaluation_by_index)(LuaCEmbedTable *self, long index, const char *code, ...); - long (*get_listable_size)(LuaCEmbedTable *self); - LuaCEmbedTable *(*get_sub_table_by_index)(LuaCEmbedTable *self, long index); - - LuaCEmbedTable *(*new_sub_table_appending)(LuaCEmbedTable *self); - - void (*set_method)(LuaCEmbedTable *self , const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)); - void (*set_string_prop)(LuaCEmbedTable *self , const char *name, const char *value); - void (*set_long_prop)(LuaCEmbedTable *self , const char *name, long long value); - void (*set_double_prop)(LuaCEmbedTable *self , const char *name, double value); - void (*set_bool_prop)(LuaCEmbedTable *self , const char *name, bool value); - int (*get_type_prop)(LuaCEmbedTable *self, const char *name); - char* (*get_string_prop)(LuaCEmbedTable *self , const char *name); - long long (*get_long_prop)(LuaCEmbedTable *self , const char *name); - double (*get_double_prop)(LuaCEmbedTable *self , const char *name); - bool (*get_bool_prop)(LuaCEmbedTable *self , const char *name); - LuaCEmbedTable * (*new_anonymous_table)(LuaCEmbed *self); - void (*destroy_prop)(LuaCEmbedTable *self, const char *name); - - LuaCEmbedTable *(*get_sub_table_prop)(LuaCEmbedTable *self, const char *name); - LuaCEmbedTable *(*new_sub_table_prop)(LuaCEmbedTable *self, const char *name); - void (*set_sub_table_prop)(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table); - char *(*get_key_by_index)(LuaCEmbedTable *self, long index); - bool (*has_key)(LuaCEmbedTable *self,long index); - - long (*get_size)(LuaCEmbedTable *self); - int (*get_type_by_index)(LuaCEmbedTable *self, int index); - long long (*get_long_by_index)(LuaCEmbedTable *self, int index); - double (*get_double_by_index)(LuaCEmbedTable *self, int index); - char * (*get_string_by_index)(LuaCEmbedTable *self, int index); - bool (*get_bool_by_index)(LuaCEmbedTable *self, int index); - -}LuaCembedTableModule; - - -//path: src/imports/../namespace/types/typesC.types.h -//mannaged by silver chain - - - -typedef struct { - int NOT_FOUND; - int STRING; - int NUMBER; - int BOOL; - int NILL; - int TABLE; - int FUNCTION; - - -}LuaCEmbedTypeModule; - - -#endif - - -#ifndef privateluacembed_typesD -#define privateluacembed_typesD -//path: src/imports/../namespace/LuaCEmbedNamespace/typesD.LuaCEmbedNamespace.h -//mannaged by silver chain - - -typedef struct{ - LuaCEmbedTypeModule types; - LuaCEmbedResponseModule response; - LuaCembedArgsModule args; - LuaCEmbedGlobalModule globals; - LuaCembedTableModule tables; - void (*clear_errors)(LuaCEmbed *self); - LuaCEmbed * (*newLuaLib)(lua_State *state); - void (*set_delete_function)(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)); - LuaCEmbed * (*newLuaEvaluation)(); - void (*load_native_libs)(LuaCEmbed *self); - void (*load_lib_from_c)(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name); - int (*perform)(LuaCEmbed *self); - const char * (*convert_arg_code)(int arg_code); - void (*set_memory_limit)(LuaCEmbed *self, double limit); - - char * (*get_error_message)(LuaCEmbed *self); - bool (*has_errors)(LuaCEmbed *self); - void (*set_timeout)(int seconds); - int (*evaluate)(LuaCEmbed *self, const char *code, ...); - char * (*get_string_evaluation)(LuaCEmbed *self,const char *code, ...); - int (*get_evaluation_type)(LuaCEmbed *self,const char *code,...); - long (*get_evaluation_size)(LuaCEmbed *self,const char *code,...); - long long (*get_evaluation_long)(LuaCEmbed *self,const char *code,...); - double (*get_evaluation_double)(LuaCEmbed *self,const char *code,...); - bool (*get_evaluation_bool)(LuaCEmbed *self, const char *code,...); - - void (*set_long_lib_prop)(LuaCEmbed *self,const char *name,long long value); - - void (*set_double_lib_prop)(LuaCEmbed *self,const char *name,double value); - void (*set_bool_lib_prop)(LuaCEmbed *self,const char *name,bool value); - void (*set_string_lib_prop)(LuaCEmbed *self,const char *name,const char * value); - void (*set_table_lib_prop)(LuaCEmbed *self,const char *name,LuaCEmbedTable *value); - - long long (*get_long_lib_prop)(LuaCEmbed *self,const char *name); - double (*get_double_lib_prop)(LuaCEmbed *self,const char *name); - bool (*get_bool_lib_prop)(LuaCEmbed *self,const char *name); - char * (*get_string_lib_prop)(LuaCEmbed *self,const char *name); - LuaCEmbedTable *(*get_table_lib_prop)(LuaCEmbed *self,const char *name); - - int (*evaluete_file)(LuaCEmbed *self, const char *file); - void (*add_callback)(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - void (*add_global_callback)(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - - void (*free)(LuaCEmbed *self); - -} LuaCEmbedNamespace; - - -#endif - - -#ifndef privateluacembed_fdeclare -#define privateluacembed_fdeclare -//path: src/imports/../LuaCEmbed/args/args_error/fdeclare.args_error.h -//mannaged by silver chain - - - -int LuaCEmbed_ensure_arg_exist(LuaCEmbed *self, private_lua_cembed_incremented_arg index); - -int private_LuaCEmbed_ensure_top_stack_arg_type(LuaCEmbed *self, int index,int arg_type); - - -//path: src/imports/../LuaCEmbed/args/basic/fdeclare.basic.h -//mannaged by silver chain - - -int privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, int index); - -int LuaCEmbed_get_total_args(LuaCEmbed *self); - -int LuaCEmbed_get_arg_type(LuaCEmbed *self,int index); - - - -long long LuaCEmbed_get_long_arg(LuaCEmbed *self, int index); - -double LuaCEmbed_get_double_arg(LuaCEmbed *self, int index); - -bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, int index); - -char * LuaCEmbed_get_str_arg(LuaCEmbed *self, int index); - -char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,long *size, int index); - -LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,int index); - -LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call, int total_returns); - - - -//path: src/imports/../LuaCEmbed/args/evaluation/fdeclare.evaluation.h -//mannaged by silver chain - - - -int private_LuaCembed_run_code_with_args(LuaCEmbed *self,int index,const char *code,va_list args); - -int privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,int index,int expected_type); - -int LuaCEmbed_get_type_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -int LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -long long LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - - -double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - - - -//path: src/imports/../LuaCEmbed/basic/fdeclare.basic.h -//mannaged by silver chain - - - - -LuaCEmbed * newLuaCEmbedEvaluation(); - - -int private_LuaCemb_internal_free(lua_State *L); - -void LuaCEmbed_load_lib_from_c(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name); - -void LuaCEmbed_load_native_libs(LuaCEmbed *self); - -void LuaCembed_set_delete_function(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)); - -char * LuaCEmbed_get_error_message(LuaCEmbed *self); - - -bool LuaCEmbed_has_errors(LuaCEmbed *self); - -void LuaCEmbed_clear_errors(LuaCEmbed *self); - -void privateLuaCEmbd_get_field_protected(LuaCEmbed *self,const char *name); - -void privateLuaCEmbed_raise_error_not_jumping(LuaCEmbed *self, const char *error, ...); - -void * privateLuaCEmbed_get_current_table_array(LuaCEmbed *self); - - -void LuaCEmbed_set_timeout(int seconds); - - - -void privata_LuaCEmbed_increment_stack_(LuaCEmbed *self); - - -void privata_LuaCEmbed_decrement_stack(LuaCEmbed *self); - -void LuaCEmbed_free(LuaCEmbed *self); - - - - -//path: src/imports/../LuaCEmbed/callback_handle/fdeclare.callback_handle.h -//mannaged by silver chain - - - -int privateLuaCEmbed_main_callback_handler(lua_State *L); - -void private_LuaCEmbed_add_lib_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args),bool global_functions ); - -void private_LuaCEmbed_add_evaluation_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - -void LuaCEmbed_add_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - - -void LuaCEmbed_add_global_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args)); - - - -//path: src/imports/../LuaCEmbed/evaluation/fdeclare.evaluation.h -//mannaged by silver chain - - - -#ifdef _WIN32 -VOID CALLBACK TimerHandler(HWND hwnd, UINT uMsg, UINT_PTR idEvent, DWORD dwTime); -#else - -void private_LuaCembed_handle_timeout(int signum); - -#endif - -int privateLuaCEmbed_start_func_evaluation(lua_State *state); - -int LuaCEmbed_evaluate(LuaCEmbed *self, const char *code, ...); - -int LuaCEmbed_evaluete_file(LuaCEmbed *self, const char *file); - - -int private_LuaCEmbed_ensure_evaluation_type(LuaCEmbed *self,int type); - -int private_LuaCEmbed_evaluate_puting_on_top_of_stack(LuaCEmbed *self,const char *code, va_list args); - -char * LuaCEmbed_get_evaluation_string(LuaCEmbed *self,const char *code, ...); - - -int LuaCEmbed_get_evaluation_type(LuaCEmbed *self,const char *code, ...); - - -long LuaCEmbed_get_evaluation_table_size(LuaCEmbed *self,const char *code, ...); - -long long LuaCEmbed_get_evaluation_long(LuaCEmbed *self,const char *code, ...); - -double LuaCEmbed_get_evaluation_double(LuaCEmbed *self,const char *code, ...); - -bool LuaCEmbed_get_evaluation_bool(LuaCEmbed *self,const char *code, ...); - - - - -//path: src/imports/../LuaCEmbed/globals/errors/fdeclare.errors.h -//mannaged by silver chain - - - - -int LuaCEmbed_ensure_global_type(LuaCEmbed *self, const char *name,int expected_type); - - -//path: src/imports/../LuaCEmbed/globals/getters/fdeclare.getters.h -//mannaged by silver chain - - - -int LuaCEmbed_get_global_type(LuaCEmbed *self,const char *name); - -long long LuaCEmbed_get_global_long(LuaCEmbed *self,const char *name); - -double LuaCEmbed_get_global_double(LuaCEmbed *self,const char *name); - -bool LuaCEmbed_get_global_bool(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_global_string(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_global_raw_string(LuaCEmbed *self,const char *name,long *size); - - -LuaCEmbedTable * LuaCembed_new_anonymous_table(LuaCEmbed *self); - -LuaCEmbedTable* LuaCEmbed_run_global_lambda(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns); - -LuaCEmbedTable * LuaCembed_get_global_table(LuaCEmbed *self, const char *name); - -LuaCEmbedTable * LuaCembed_new_global_table(LuaCEmbed *self, const char *name); - - -//path: src/imports/../LuaCEmbed/globals/setters/fdeclare.setters.h -//mannaged by silver chain - - -void LuaCEmbed_set_global_string(LuaCEmbed *self, const char *name, const char *value); - -void LuaCEmbed_set_global_raw_string(LuaCEmbed *self, const char *name, const char *value,long size); - -void LuaCEmbed_set_global_long(LuaCEmbed *self, const char *name, long long value); - -void LuaCEmbed_set_global_double(LuaCEmbed *self, const char *name, double value); - -void LuaCEmbed_set_global_bool(LuaCEmbed *self, const char *name, bool value); - -void LuaCEmbed_set_global_table(LuaCEmbed *self, const char *name, LuaCEmbedTable *table); - - -//path: src/imports/../LuaCEmbed/lib_props/fdeclare.lib_props.h -//mannaged by silver chain - - - -void LuaCEmbed_set_long_lib_prop(LuaCEmbed *self,const char *name,long long value); - -void LuaCEmbed_set_double_lib_prop(LuaCEmbed *self,const char *name,double value); - -void LuaCEmbed_set_bool_lib_prop(LuaCEmbed *self,const char *name,bool value); - -void LuaCEmbed_set_string_lib_prop(LuaCEmbed *self,const char *name,const char * value); - -void LuaCEmbed_set_table_lib_prop(LuaCEmbed *self,const char *name,LuaCEmbedTable *value); - -int private_LuaCEmbed_ensure_lib_prop_type(LuaCEmbed *self,const char *name,int expected_type);; - - -long long LuaCEmbed_get_long_lib_prop(LuaCEmbed *self,const char *name); - -double LuaCEmbed_get_double_lib_prop(LuaCEmbed *self,const char *name); - -bool LuaCEmbed_get_bool_lib_prop(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_string_lib_prop(LuaCEmbed *self,const char *name); - -LuaCEmbedTable *LuaCEmbed_get_table_lib_prop(LuaCEmbed *self,const char *name); - - - -//path: src/imports/../LuaCEmbed/lib_start/fdeclare.lib_start.h -//mannaged by silver chain - - -int private_LuaCemb_internal_free(lua_State *L); - -LuaCEmbed * newLuaCEmbedLib(lua_State *state); - -int LuaCembed_perform(LuaCEmbed *self); - - -//path: src/imports/../LuaCEmbed/memory/fdeclare.memory.h -//mannaged by silver chain - - - -long lua_cembed_used_memory = 0; -long lua_cembed_memory_limit = -1; - -void LuaCEmbed_set_memory_limit(LuaCEmbed *self, double limit); - - -static void *private_LuaCembed_custom_allocator(void *ud, void *ptr, size_t osize, size_t nsize) ; - - - -//path: src/imports/../LuaCEmbed/table/table/append/fdeclare.append.h -//mannaged by silver chain - - - -void LuaCEmbedTable_append_table(LuaCEmbedTable *self, LuaCEmbedTable *table); - - -void LuaCEmbedTable_append_evaluation(LuaCEmbedTable *self, const char *code, ...); - -void LuaCEmbedTable_append_string(LuaCEmbedTable *self, const char *value); - -void LuaCEmbedTable_append_long(LuaCEmbedTable *self, long long value); - -void LuaCEmbedTable_append_double(LuaCEmbedTable *self, double value); - -void LuaCEmbedTable_append_bool(LuaCEmbedTable *self, bool value); - -//path: src/imports/../LuaCEmbed/table/table/basic/fdeclare.basic.h -//mannaged by silver chain - - - -LuaCEmbedTable * private_newLuaCembedTable(LuaCEmbed *main_embed, const char *format, ...); - -int private_lua_cEmbed_unpack(LuaCEmbedTable *self,const char * previews_function); - -void privateLuaCEmbedTable_free(LuaCEmbedTable *self); - -void privateLuaCEmbedTable_free_setting_nill(LuaCEmbedTable *self); - -//path: src/imports/../LuaCEmbed/table/table/destroy/fdeclare.destroy.h -//mannaged by silver chain - - - -void LuaCembedTable_destroy_prop(LuaCEmbedTable *self, const char *name); - -void LuaCEmbedTable_destroy_by_index(LuaCEmbedTable *self, long index); - -//path: src/imports/../LuaCEmbed/table/table/errors/fdeclare.errors.h -//mannaged by silver chain - - -int privateLuaCEmbedTable_ensure_type_with_key(LuaCEmbedTable *self, const char *name, int expected_type); - -int privateLuaCEmbedTable_ensure_type_with_index(LuaCEmbedTable *self, long index, int expected_type); - - -//path: src/imports/../LuaCEmbed/table/table/getters/index/fdeclare.index.h -//mannaged by silver chain - - - -char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, long index); - -bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, long index); - -long LuaCEmbedTable_get_full_size(LuaCEmbedTable *self); - -long LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self); - - -long privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cembed_incremented_arg index); - -int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, int index); - -long long LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, int index); - -double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, int index); - -char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, int index); - -bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, int index); - - - - -//path: src/imports/../LuaCEmbed/table/table/getters/keys/fdeclare.keys.h -//mannaged by silver chain - - - - -char* LuaCembedTable_get_string_prop(LuaCEmbedTable *self, const char *name); - -long long LuaCembedTable_get_long_prop(LuaCEmbedTable *self, const char *name); - -double LuaCembedTable_get_double_prop(LuaCEmbedTable *self, const char *name); - -bool LuaCembedTable_get_bool_prop(LuaCEmbedTable *self, const char *name); - -int LuaCEmbedTable_get_type_prop(LuaCEmbedTable *self, const char *name); - - -//path: src/imports/../LuaCEmbed/table/table/setters/index/fdeclare.index.h -//mannaged by silver chain - - -void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, long index, const char *value); - -void LuaCEmbedTable_set_long_by_index(LuaCEmbedTable *self, long long index, long value); - -void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, long index, double value); - -void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, long index, bool value); - - -void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, long index, const char *code, ...); - - -//path: src/imports/../LuaCEmbed/table/table/setters/insert/fdeclare.insert.h -//mannaged by silver chain - - - -void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, long formatted_index); - -void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, long index, const char *value); - -void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, long index,bool value); - -void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, long long index,long value); - -void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, long index,double value); - -void LuaCEmbedTable_insert_table_at_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *table); - - - -//path: src/imports/../LuaCEmbed/table/table/setters/keys/fdeclare.keys.h -//mannaged by silver chain - - - - - - -void LuaCEmbedTable_set_method(LuaCEmbedTable *self, const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)); - -void LuaCEmbedTable_set_string_prop(LuaCEmbedTable *self, const char *name, const char *value); - -void LuaCEmbedTable_set_long_prop(LuaCEmbedTable *self, const char *name, long long value); - -void LuaCEmbedTable_set_double_prop(LuaCEmbedTable *self, const char *name, double value); - -void LuaCEmbedTable_set_bool_prop(LuaCEmbedTable *self, const char *name, bool value); - - -void LuaCEmbedTable_set_evaluation_prop(LuaCEmbedTable *self, const char *name, const char *code, ...); - - - -//path: src/imports/../LuaCEmbed/table/table/sub_tables/index/fdeclare.index.h -//mannaged by silver chain - - - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_appending(LuaCEmbedTable *self); - - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, long index); - - -void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table); - - - - - -//path: src/imports/../LuaCEmbed/table/table/sub_tables/key/fdeclare.key.h -//mannaged by silver chain - - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_by_key(LuaCEmbedTable *self, const char *name); - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_key(LuaCEmbedTable *self, const char *name); - -void LuaCEmbedTable_set_sub_table_prop(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table); - -//path: src/imports/../LuaCEmbed/table/table_array/fdeclare.table_array.h -//mannaged by silver chain - - - -typedef struct { - - LuaCEmbedTable **tables; - long size; - -}privateLuaCEmbedTableArray; - -privateLuaCEmbedTableArray *newprivateLuaCEmbedTableArray(); - -void privateLuaCEmbedTableArray_append(privateLuaCEmbedTableArray *self,LuaCEmbedTable *element); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_global_name(privateLuaCEmbedTableArray *self, const char *name); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_prop_name(privateLuaCEmbedTableArray *self, const char *name); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_internal_index(privateLuaCEmbedTableArray *self, long internal_index); - -void privateLuaCEmbedTableArray_free(privateLuaCEmbedTableArray *self); - - -//path: src/imports/../LuaCEmbedResponse/fdeclare.LuaCEmbedResponse.h -//mannaged by silver chain - - -LuaCEmbedResponse *private_LuaCEmbedReturn_raw(); - - -LuaCEmbedResponse * LuaCEmbed_send_str(const char *text); - -LuaCEmbedResponse * LuaCEmbed_send_raw_string(const char *text,long size); - -LuaCEmbedResponse * LuaCEmbed_send_str_reference( const char *text); - -LuaCEmbedResponse * LuaCEmbed_send_raw_string_reference(const char *text,long size); - -LuaCEmbedResponse * LuaCEmbed_send_error(const char *format,...); - - -LuaCEmbedResponse * LuaCEmbed_send_evaluation(const char *code); - - - - - -LuaCEmbedResponse * LuaCEmbed_send_double(double value); - -LuaCEmbedResponse * LuaCEmbed_send_bool(bool value); - - -LuaCEmbedResponse * LuaCEmbed_send_long(long value); - - -void private_LuaCEmbedResponse_free(LuaCEmbedResponse *self); - - -LuaCEmbedResponse * LuaCEmbed_send_table(LuaCEmbedTable *table); - - -LuaCEmbedResponse * LuaCEmbed_send_multi_return(LuaCEmbedTable *table); - - -//path: src/imports/../extra/fdeclare.extra.h -//mannaged by silver chain - - - -const char * LuaCembed_convert_arg_code(int arg_code); - - -char * private_LuaCembed_format_vaarg(const char *expresion, va_list args); - -char * private_LuaCembed_format(const char *expresion, ...); - - - - -//path: src/imports/../namespace/LuaCEmbedNamespace/fdeclare.LuaCEmbedNamespace.h -//mannaged by silver chain - - - -LuaCEmbedNamespace newLuaCEmbedNamespace(); - - -//path: src/imports/../namespace/args/fdeclare.args.h -//mannaged by silver chain - - -LuaCembedArgsModule newLuaCembedArgsModule(); - - -//path: src/imports/../namespace/globals/fdeclare.globals.h -//mannaged by silver chain - - -LuaCEmbedGlobalModule newLuaCEmbedGlobalModule(); - - -//path: src/imports/../namespace/response/fdeclare.response.h -//mannaged by silver chain - - - -LuaCEmbedResponseModule newLuaCEmbedResponseModule(); - - -//path: src/imports/../namespace/table/fdeclare.table.h -//mannaged by silver chain - - - -LuaCembedTableModule newLuaCembedTableModule(); - - -//path: src/imports/../namespace/types/fdeclare.types.h -//mannaged by silver chain - - - - -LuaCEmbedTypeModule newLuaCEmbedTypeModule(); - - -#endif - - -#ifndef privateluacembed_fdefine -#define privateluacembed_fdefine -//path: src/imports/../LuaCEmbed/args/args_error/fdefine.args_error.c -//mannaged by silver chain - - - -int LuaCEmbed_ensure_arg_exist(LuaCEmbed *self, private_lua_cembed_incremented_arg index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(index > self->total_args){ - - privateLuaCEmbed_raise_error_not_jumping(self, PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,index,self->current_function); - return LUA_CEMBED_GENERIC_ERROR; - } - return LUA_CEMBED_OK; - -} - -int private_LuaCEmbed_ensure_top_stack_arg_type(LuaCEmbed *self, int index,int arg_type) { - PRIVATE_LUA_CEMBED_PROTECT_NUM - int type = lua_type(self->state, -1); - if (type != arg_type) { - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_ARG_WRONG_TYPE, - index + LUA_CEMBED_INDEX_DIF, - self->current_function, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(arg_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - - return LUA_CEMBED_OK; - -} - - - -//path: src/imports/../LuaCEmbed/args/basic/fdefine.basic.c -//mannaged by silver chain - - -int privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(formatted_index > self->total_args){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,formatted_index,self->current_function); - return LUA_CEMBED_GENERIC_ERROR; - } - - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - lua_getglobal(self->state,formated_arg); - int type = lua_type(self->state,-1); - if(type == LUA_CEMBED_NOT_FOUND || type == LUA_CEMBED_NIL){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,formatted_index,self->current_function); - free(formated_arg); - return LUA_CEMBED_GENERIC_ERROR; - } - - free(formated_arg); - return LUA_OK; -} - -int LuaCEmbed_get_total_args(LuaCEmbed *self){ - return self->total_args; -} - - - -int LuaCEmbed_get_arg_type(LuaCEmbed *self,int index){ - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(formatted_index > self->total_args){ - return LUA_CEMBED_NIL; - } - - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - lua_getglobal(self->state,formated_arg); - int type = lua_type(self->state, -1); - free(formated_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return type; -} - - -long long LuaCEmbed_get_long_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_NUMBER)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - - long long result = (long long)lua_tonumber(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - - -double LuaCEmbed_get_double_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_NUMBER)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - double result = lua_tonumber(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - -bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_BOOL)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - bool result = lua_toboolean(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - - -char * LuaCEmbed_get_str_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - PRIVATE_LUA_CEMBED_CLEAR_STACK - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_STRING)){ - return NULL; - } - char *result = (char*)lua_tostring(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} -char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,long *size, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - PRIVATE_LUA_CEMBED_CLEAR_STACK - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_STRING)){ - return NULL; - } - char *result = (char*)lua_tolstring(self->state,-1,(size_t*)size); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - -LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_TABLE)){ - return NULL; - } - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - LuaCEmbedTable *created = LuaCembed_get_global_table(self,formated_arg); - free(formated_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return created; - -} - -LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call, int total_returns){ - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - char *formatted_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - free(formatted_arg); - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_FUNCTION)){ - free(formatted_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - int total_args = private_lua_cEmbed_unpack(args_to_call,formatted_arg); - if(lua_pcall(self->state,total_args,total_returns,0)){ - - privateLuaCEmbed_raise_error_not_jumping(self, lua_tostring(self->state,-1)); - free(formatted_arg); - - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - - for(int i = 0; i < total_returns; i++){ - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - int position = (i +1) * -1; - lua_pushvalue(self->state,position); - lua_setglobal(self->state,formatted); - free(formatted); - } - - - - LuaCEmbedTable *result = LuaCembed_new_anonymous_table(self); - for(int i = 0; i < total_returns; i++){ - lua_getglobal(self->state,result->global_name); - lua_pushinteger(self->state,i+1); - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - lua_getglobal(self->state,formatted); - lua_settable(self->state,-3); - free(formatted); - } - free(formatted_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; - -} - - - -//path: src/imports/../LuaCEmbed/args/evaluation/fdefine.evaluation.c -//mannaged by silver chain - - - -int private_LuaCembed_run_code_with_args(LuaCEmbed *self,int index,const char *code,va_list args){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(LuaCEmbed_ensure_arg_exist(self,formatted_index)){ - return LUA_CEMBED_GENERIC_ERROR; - } - - char *formated_expresion = private_LuaCembed_format_vaarg(code,args); - - char *buffer = private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - formated_expresion - ); - - if(LuaCEmbed_evaluate(self, buffer)){ - free(formated_expresion); - free(buffer); - return LUA_CEMBED_GENERIC_ERROR; - } - free(buffer); - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - - int type = lua_type(self->state,-1); - - if(type != LUA_CEMBED_FUNCTION){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_CODE_ITS_NOT_A_FUNCTION,formated_expresion); - free(formated_expresion); - return LUA_CEMBED_GENERIC_ERROR; - } - - free(formated_expresion); - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - privateLuaCEmbed_put_arg_on_top(self,index); - - if(lua_pcall(self->state,1,1,0)){ - const char *generated_error = lua_tostring(self->state,-1); - privateLuaCEmbed_raise_error_not_jumping(self, generated_error); - } - return LUA_CEMBED_OK; -} - -int privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,int index,int expected_type){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - int actual_type = lua_type(self->state,-1); - if(actual_type== expected_type){ - return LUA_CEMBED_OK; - } - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_RESULT_EVALUATION_ARG_WRONG_TYPE, - self->current_function, - index, - LuaCembed_convert_arg_code(actual_type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} -int LuaCEmbed_get_type_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - return lua_type(self->state,-1); -} -int LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - return LUA_CEMBED_OK; -} -long long LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (long long) lua_tonumber(self->state,-1); - -} - - -double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (double ) lua_tonumber(self->state,-1); - -} - -bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return false; - } - return lua_toboolean(self->state,-1); - -} - -char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return NULL; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); - -} - - - -//path: src/imports/../LuaCEmbed/basic/fdefine.basic.c -//mannaged by silver chain - - - -LuaCEmbed * newLuaCEmbedEvaluation(){ - LuaCEmbed *self = (LuaCEmbed*) malloc(sizeof (LuaCEmbed)); - *self = (LuaCEmbed){0}; - self->state = luaL_newstate(); - - self->global_tables = (void*)newprivateLuaCEmbedTableArray(); - - return self; -} -void LuaCEmbed_load_lib_from_c(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name){ - int result = callback(self->state); - if(result > 0){ - lua_setglobal(self->state,name); - } -} -void LuaCEmbed_load_native_libs(LuaCEmbed *self) { - luaL_openlibs(self->state); -} - - - - -void LuaCembed_set_delete_function(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)){ - self->delete_function = delelte_function; -} - - - - -void LuaCEmbed_set_timeout(int seconds){ - lua_cembed_timeout = seconds; -} - -char * LuaCEmbed_get_error_message(LuaCEmbed *self){ - if(!self){ - return NULL; - } - - return self->error_msg; -} -void LuaCEmbed_clear_errors(LuaCEmbed *self){ - if(!self){ - return; - } - - if(self->error_msg){ - free(self->error_msg); - self->error_msg = NULL; - } -} -void * privateLuaCEmbed_get_current_table_array(LuaCEmbed *self){ - if(self->current_function){ - return self->func_tables; - } - return self->global_tables; -} -void privateLuaCEmbed_raise_error_not_jumping(LuaCEmbed *self, const char *error_msg, ...){ - - if(LuaCEmbed_has_errors(self)){ - return; - } - - va_list args; - va_start(args,error_msg); - self->error_msg = private_LuaCembed_format_vaarg(error_msg, args); - va_end(args); - -} - - - -bool LuaCEmbed_has_errors(LuaCEmbed *self){ - if(!self){ - return true; - } - - if(self->error_msg){ - return true; - } - - return false; -} - - - - - - -void privata_LuaCEmbed_increment_stack_(LuaCEmbed *self){ - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - int value = 0; - if(lua_type(self->state,-1) == LUA_CEMBED_NUMBER){ - value = lua_tonumber(self->state,-1); - } - int new_value = value+1; - lua_pushinteger(self->state,new_value); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve =new_value; -} - - -void privata_LuaCEmbed_decrement_stack(LuaCEmbed *self){ - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - int value = 0; - if(lua_type(self->state,-1) == LUA_CEMBED_NUMBER){ - value = lua_tointeger(self->state,-1); - } - if(value> 0){ - int new_value = value -1; - lua_pushinteger(self->state,new_value); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve = new_value; - } - -} - -void privateLuaCEmbd_get_field_protected(LuaCEmbed *self,const char *name){ - bool old_field_proection = self->field_protection; - self->field_protection = true; - lua_getfield(self->state,-1,name); - self->field_protection = old_field_proection; -} - -void LuaCEmbed_free(LuaCEmbed *self){ - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->global_tables); - if(!self->is_lib){ //se for do próprio lua, o lua cuidará de limpar - lua_close(self->state); // Fecha o estado Lua - } - if(self->error_msg){ - free(self->error_msg); - } - if(self->main_lib_table){ - free(self->main_lib_table); - } - free(self); -} - - -//path: src/imports/../LuaCEmbed/callback_handle/fdefine.callback_handle.c -//mannaged by silver chain - - - -int privateLuaCEmbed_main_callback_handler(lua_State *L){ - - bool is_a_method = lua_toboolean(L, lua_upvalueindex(1)); - bool is_a_function = !is_a_method; - LuaCEmbedResponse *possible_return = NULL; - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(L,lua_upvalueindex(2)); - int old_total_args = self->total_args; - self->total_args = lua_gettop(self->state); - privata_LuaCEmbed_increment_stack_(self); - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve = (int)lua_tonumber(self->state,-1); - - for(int i = 0; i < self->total_args; i++){ - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,i); - lua_pushvalue(L,i+1); - lua_setglobal(L,formated_arg); - free(formated_arg); - } - - const char *func_name = lua_tostring(L,lua_upvalueindex(3)); - self->current_function = func_name; - void *old_funct_tables = self->func_tables; - self->func_tables = (void*)newprivateLuaCEmbedTableArray(); - if(is_a_method){ - LuaCEmbedResponse *(*method_callback)(LuaCEmbedTable *tb, LuaCEmbed *self); - - //equivalent of PRIVATE_LUA_CEMBED_SELFNAME = index[4] - lua_pushvalue(L, lua_upvalueindex(4)); - lua_setglobal(L,PRIVATE_LUA_CEMBED_SELFNAME); - - LuaCEmbedTable *table = private_newLuaCembedTable(self, PRIVATE_LUA_CEMBED_SELFNAME); - method_callback = (LuaCEmbedResponse *(*)(LuaCEmbedTable *tb, LuaCEmbed *self))lua_touserdata(L, lua_upvalueindex(5)); - possible_return = method_callback(table,self); - privateLuaCEmbedTable_free(table); - } - - if(is_a_function){ - LuaCEmbedResponse *(*function_callback)(LuaCEmbed *self); - function_callback = (LuaCEmbedResponse *(*)(LuaCEmbed *self))lua_touserdata(L, lua_upvalueindex(4)); - possible_return = function_callback(self); - } - - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->func_tables); - self->func_tables = old_funct_tables; - self->total_args = old_total_args; - privata_LuaCEmbed_decrement_stack(self); - PRIVATE_LUA_CEMBED_CLEAR_STACK - self->current_function = NULL; - - if(possible_return==NULL){ - return PRIVATE_LUACEMBED_NO_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_ERROR_RESPONSE){ - - if(self->field_protection){ - private_LuaCEmbedResponse_free(possible_return); - if(self->error_msg){ - free(self->error_msg); - self->error_msg = NULL; - } - - return PRIVATE_LUACEMBED_NO_RETURN; - } - - lua_pushstring(L, possible_return->string_val); - privateLuaCEmbed_raise_error_not_jumping(self,possible_return->string_val); - private_LuaCEmbedResponse_free(possible_return); - lua_error(L); - return PRIVATE_LUACEMBED_NO_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_LONG_RESPONSE){ - lua_pushinteger(L, (int)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_BOOL_RESPONSE){ - lua_pushboolean(L, (bool)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE){ - lua_pushnumber(L, possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_STRING_RESPONSE){ - lua_pushlstring(self->state,possible_return->string_val,possible_return->string_size); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE){ - lua_pushboolean(L, (bool)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_TABLE_RESPONSE){ - lua_getglobal(self->state, PRIVATE_LUA_CEMBED_TABLE_RETURN); - lua_pushvalue(self->state,-1); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_MULTI_RESPONSE){ - LuaCEmbedTable *table = private_newLuaCembedTable(self, PRIVATE_LUA_CEMBED_TABLE_RETURN); - int size =private_lua_cEmbed_unpack(table,NULL); - private_LuaCEmbedResponse_free(possible_return); - privateLuaCEmbedTable_free(table); - - return size; - } - - - if(possible_return->type == PRIVATE_LUA_CEMBED_EVALUATION){ - char *formated_function =private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - possible_return->string_val - ); - - int error_code = LuaCEmbed_evaluate(self, formated_function); - free(formated_function); - - if(error_code){ - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - } - - lua_getglobal(self->state, PRIVATE_LUA_CEMBED_EVALUATION_NAME); - int v_type = lua_type(self->state,-1); - if(v_type == LUA_CEMBED_FUNCTION){ - const int TOTAL_ARGS =0; - const int TOTAL_RETURNS =1; - if(lua_pcall(self->state,TOTAL_ARGS,TOTAL_RETURNS,0)){ - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - } - } - - lua_pushvalue(self->state,-1); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - - } - - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - -} - - -void private_LuaCEmbed_add_lib_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args),bool global_functions ){ - - char *main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - //get the table - lua_getglobal(self->state,main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,callback_name); - - //creating the clojure - - //creating the clojure - lua_pushboolean(self->state,false);//is a method - lua_pushlightuserdata(self->state,(void*)self); //self - lua_pushstring(self->state,callback_name);//calback name - lua_pushlightuserdata(self->state,(void*)callback);//calback - - lua_pushcclosure(self->state,privateLuaCEmbed_main_callback_handler,4); - - - lua_settable(self->state,-3); - if(global_functions){ - //it points the function to a global function - //like: callback = private_lua_c_embed_main_lib_table.callback - lua_getglobal(self->state, main_lib_table); - lua_getfield(self->state,-1,callback_name); - lua_setglobal(self->state, callback_name); - } - - lua_settop(self->state, 0); - free(main_lib_table); - -} - -void private_LuaCEmbed_add_evaluation_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - //creating the clojure - lua_pushboolean(self->state,false);//is a method - lua_pushlightuserdata(self->state,(void*)self); //self - lua_pushstring(self->state,callback_name);//calback name - lua_pushlightuserdata(self->state,(void*)callback);//calback - - lua_pushcclosure(self->state,privateLuaCEmbed_main_callback_handler,4); - lua_setglobal(self->state, callback_name); - lua_settop(self->state, 0); - -} - - -void LuaCEmbed_add_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - if(self->is_lib){ - private_LuaCEmbed_add_lib_callback(self,callback_name,callback,false); - return; - } - private_LuaCEmbed_add_evaluation_callback(self,callback_name,callback); - -} - -void LuaCEmbed_add_global_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args)){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - if(self->is_lib){ - private_LuaCEmbed_add_lib_callback(self,callback_name,callback,true); - return; - } - private_LuaCEmbed_add_evaluation_callback(self,callback_name,callback); -} - -//path: src/imports/../LuaCEmbed/evaluation/fdefine.evaluation.c -//mannaged by silver chain - - - -#ifdef _WIN32 -VOID CALLBACK TimerHandler(HWND hwnd, UINT uMsg, UINT_PTR idEvent, DWORD dwTime) { - - privateLuaCEmbed_raise_error_not_jumping(global_current_lua_embed_object, PRIVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_pushstring(global_current_lua_embed_object->state,PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_error(global_current_lua_embed_object->state); -} - -#else - -void private_LuaCembed_handle_timeout(int signum) { - - privateLuaCEmbed_raise_error_not_jumping(global_current_lua_embed_object, PRIVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_pushstring(global_current_lua_embed_object->state,PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_error(global_current_lua_embed_object->state); -} - -#endif - - - -int privateLuaCEmbed_start_func_evaluation(lua_State *state){ - - int evaluation_type = lua_tointeger(state, lua_upvalueindex(1)); - char *text_value = (char*)lua_touserdata(state,lua_upvalueindex(2)); - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(state,lua_upvalueindex(3)); - global_current_lua_embed_object = self; - #ifdef _WIN32 - if (lua_cembed_timeout > 0) { - SetTimer(NULL, 0,lua_cembed_timeout > 0 * 1000, TimerHandler); - } - #else - if (lua_cembed_timeout > 0) { - signal(SIGALRM, private_LuaCembed_handle_timeout); - alarm(lua_cembed_timeout); - } - #endif - - int error = 0; - if(evaluation_type == PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE){ - error =luaL_dofile(self->state,text_value); - } - if(evaluation_type == PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE){ - error = luaL_dostring(self->state,text_value); - } - if(error){ - privateLuaCEmbed_raise_error_not_jumping(self,lua_tostring(self->state,-1)); - } - lua_pushinteger(self->state,error); - - return 1; - -} -int LuaCEmbed_evaluate(LuaCEmbed *self, const char *code, ...){ - - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - char * formated_expresion = private_LuaCembed_format_vaarg(code,args); - va_end(args); - lua_pushinteger(self->state,PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE); - lua_pushlightuserdata(self->state,(void*)formated_expresion); //code - lua_pushlightuserdata(self->state,(void*)self); //code - lua_pushcclosure(self->state,privateLuaCEmbed_start_func_evaluation,3); - lua_pcall(self->state,0,1,0); - int error = lua_tointeger(self->state,-1); - free(formated_expresion); - - return error; - -} - -int LuaCEmbed_evaluete_file(LuaCEmbed *self, const char *file){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - - lua_pushinteger(self->state,PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE); - lua_pushlightuserdata(self->state,(void*)file); //code - lua_pushlightuserdata(self->state,(void*)self); //code - lua_pushcclosure(self->state,privateLuaCEmbed_start_func_evaluation,3); - lua_pcall(self->state,0,1,0); - int error = lua_tointeger(self->state,-1); - return error; - -} - -int private_LuaCEmbed_evaluate_puting_on_top_of_stack(LuaCEmbed *self,const char *code, va_list args){ - - char * formated_expresion =private_LuaCembed_format_vaarg(code,args); - - char * buffer =private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - formated_expresion - ); - - if(LuaCEmbed_evaluate(self, buffer)){ - free(formated_expresion); - free(buffer); - return LUA_CEMBED_GENERIC_ERROR; - } - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - - int type = lua_type(self->state,-1); - - if(type == LUA_CEMBED_FUNCTION){ - if(lua_pcall(self->state,0,1,0)){ - const char *generated_error = lua_tostring(self->state,-1); - privateLuaCEmbed_raise_error_not_jumping(self, generated_error); - } - } - free(formated_expresion); - free(buffer); - return LUA_CEMBED_OK; - -} -int private_LuaCEmbed_ensure_evaluation_type(LuaCEmbed *self,int type){ - - int actual_type = lua_type(self->state,-1); - if(actual_type== type){ - return LUA_CEMBED_OK; - } - - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_RESULT_EVALUATION_WRONG_TYPE, - LuaCembed_convert_arg_code(actual_type), - LuaCembed_convert_arg_code(type) - ); - - return LUA_CEMBED_GENERIC_ERROR; -} - -char * LuaCEmbed_get_evaluation_string(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return NULL; - } - - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_STRING)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); - -} - - -int LuaCEmbed_get_evaluation_type(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - - return lua_type(self->state,-1); -} - - -long LuaCEmbed_get_evaluation_table_size(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_TABLE)){ - return LUA_CEMBED_GENERIC_ERROR; - } - - - return (long)lua_rawlen(self->state,-1); -} - - - -long long LuaCEmbed_get_evaluation_long(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (long)lua_tonumber(self->state,-1); - -} - -double LuaCEmbed_get_evaluation_double(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (double)lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_evaluation_bool(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (bool)lua_toboolean(self->state,-1); -} - - - -//path: src/imports/../LuaCEmbed/globals/errors/fdefine.errors.c -//mannaged by silver chain - - - - - -int LuaCEmbed_ensure_global_type(LuaCEmbed *self, const char *name,int expected_type){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - lua_getglobal(self->state,name); - int type = lua_type(self->state,-1); - - if(type != expected_type){ - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_GLOBAL_WRONG_TYPE, - name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - - return LUA_CEMBED_OK; - -} - -//path: src/imports/../LuaCEmbed/globals/getters/fdefine.getters.c -//mannaged by silver chain - - - -int LuaCEmbed_get_global_type(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - lua_getglobal(self->state, name); - return lua_type(self->state,-1); -} - -long long LuaCEmbed_get_global_long(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return (long )lua_tonumber(self->state,-1); -} - -double LuaCEmbed_get_global_double(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return (double )lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_global_bool(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return lua_toboolean(self->state,-1); -} - -char * LuaCEmbed_get_global_raw_string(LuaCEmbed *self,const char *name,long *size){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - lua_getglobal(self->state, name); - return (char*)lua_tolstring(self->state,-1,(size_t*)size); -} - -char * LuaCEmbed_get_global_string(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - lua_getglobal(self->state, name); - return (char*)lua_tostring(self->state,-1); -} - -LuaCEmbedTable * LuaCembed_new_anonymous_table(LuaCEmbed *self){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - - const char *format_raw = PRIVATE_LUA_CEMBED_ANONYMOUS_TABLE_; - if(self->current_function){ - format_raw =PRIVATE_LUA_CEMBED_ANONYMOUS_FUNC_TABLE_; - } - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - char *buffer= private_LuaCembed_format(format_raw, self->stack_leve, target->size); - LuaCEmbedTable *created_table =LuaCembed_new_global_table(self,buffer); - - free(buffer); - return created_table; -} - - - -LuaCEmbedTable * LuaCembed_get_global_table(LuaCEmbed *self, const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_TABLE)){ - return NULL; - } - - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,name); - if(possible){ - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s", name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} - -LuaCEmbedTable * LuaCembed_new_global_table(LuaCEmbed *self, const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - lua_newtable(self->state); - lua_setglobal(self->state,name); - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,name); - if(possible){ - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s", name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} - -LuaCEmbedTable* LuaCEmbed_run_global_lambda(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns){ - - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_FUNCTION)){ - return NULL; - } - - int total_args = private_lua_cEmbed_unpack(args_to_call,name); - if(lua_pcall(self->state,total_args,total_returns,0)){ - privateLuaCEmbed_raise_error_not_jumping(self, lua_tostring(self->state,-1)); - return NULL; - } - - for(int i = 0; i < total_returns; i++){ - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_, self->stack_leve, i); - int position = (i +1) * -1; - lua_pushvalue(self->state,position); - lua_setglobal(self->state,formatted); - free(formatted); - } - - LuaCEmbedTable *result = LuaCembed_new_anonymous_table(self); - for(int i = 0; i < total_returns; i++){ - lua_getglobal(self->state,result->global_name); - lua_pushinteger(self->state,i+1); - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - lua_getglobal(self->state,formatted); - lua_settable(self->state,-3); - free(formatted); - } - - return result; -} - - - -//path: src/imports/../LuaCEmbed/globals/setters/fdefine.setters.c -//mannaged by silver chain - - - -void LuaCEmbed_set_global_string(LuaCEmbed *self, const char *name, const char *value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushstring(self->state,value); - lua_setglobal(self->state,name); -} -void LuaCEmbed_set_global_raw_string(LuaCEmbed *self, const char *name, const char *value,long size){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushlstring(self->state,value,size); - lua_setglobal(self->state,name); -} - - -void LuaCEmbed_set_global_long(LuaCEmbed *self, const char *name, long long value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushnumber(self->state,(double )value); - lua_setglobal(self->state,name); -} - -void LuaCEmbed_set_global_double(LuaCEmbed *self, const char *name, double value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushnumber(self->state,(double )value); - lua_setglobal(self->state,name); -} - -void LuaCEmbed_set_global_bool(LuaCEmbed *self, const char *name, bool value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - lua_pushboolean(self->state,value); - lua_setglobal(self->state,name); -} - - -void LuaCEmbed_set_global_table(LuaCEmbed *self, const char *name, LuaCEmbedTable *table){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_getglobal(self->state,table->global_name); - lua_setglobal(self->state,name); -} - -//path: src/imports/../LuaCEmbed/lib_props/fdefine.lib_props.c -//mannaged by silver chain - - - -void LuaCEmbed_set_long_lib_prop(LuaCEmbed *self,const char *name,long long value){ - char *main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - lua_getglobal(self->state,main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushinteger(self->state,value); - lua_settable(self->state,-3); - free(main_lib_table); -} - -void LuaCEmbed_set_double_lib_prop(LuaCEmbed *self,const char *name,double value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushnumber(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_bool_lib_prop(LuaCEmbed *self,const char *name,bool value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushboolean(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_string_lib_prop(LuaCEmbed *self,const char *name,const char * value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushstring(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_table_lib_prop(LuaCEmbed *self,const char *name,LuaCEmbedTable *value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - lua_pushstring(self->state,name); - lua_getglobal(self->state,value->global_name); - lua_settable(self->state,-3); - -} - -int private_LuaCEmbed_ensure_lib_prop_type(LuaCEmbed *self,const char *name,int expected_type){ - int type = lua_type(self->state,-1); - if(type!= expected_type){ - privateLuaCEmbed_raise_error_not_jumping( - self, - PRIVATE_LUA_CEMBED_LIB_PROP_WRONG_TYPE, - name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - return LUA_CEMBED_OK; -} - -long long LuaCEmbed_get_long_lib_prop(LuaCEmbed *self,const char *name){ - lua_getglobal(self->state,self->main_lib_table); - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_tointeger(self->state,-1); - -} - -double LuaCEmbed_get_double_lib_prop(LuaCEmbed *self,const char *name){ - - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_bool_lib_prop(LuaCEmbed *self,const char *name){ - - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_toboolean(self->state,-1); -} - -char * LuaCEmbed_get_string_lib_prop(LuaCEmbed *self,const char *name){ - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); -} - -LuaCEmbedTable *LuaCEmbed_get_table_lib_prop(LuaCEmbed *self,const char *name){ -; - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_TABLE)){ - return NULL; - } - - char *global_sub_table_name = private_LuaCembed_format( - PRIVATE_LUA_CEMBED_MAIN_LIB_SUB_TABLE, - self->lib_identifier, - name - ); - lua_setglobal(self->state,global_sub_table_name); - - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,global_sub_table_name); - if(possible){ - free(global_sub_table_name); - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s",global_sub_table_name); - free(global_sub_table_name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} - - -//path: src/imports/../LuaCEmbed/lib_start/fdefine.lib_start.c -//mannaged by silver chain - - -int private_LuaCemb_internal_free(lua_State *L){ - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(L, lua_upvalueindex(1)); - if(self->delete_function){ - self->delete_function(self); - } - LuaCEmbed_free(self); - return 0; -} -LuaCEmbed * newLuaCEmbedLib(lua_State *state){ - LuaCEmbed *self = (LuaCEmbed*) malloc(sizeof (LuaCEmbed)); - *self = (LuaCEmbed){0}; - - self->state = state; - - self->lib_identifier = 0; - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_TOTAL_LIBS); - if(lua_type(self->state,-1) == LUA_CEMBED_NIL){ - self->lib_identifier = lua_tointeger(self->state,-1); - } - - self->lib_identifier +=1; - - self->main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - lua_pushinteger(self->state,self->lib_identifier); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_TOTAL_LIBS); - - - self->is_lib = true; - self->global_tables = (void*)newprivateLuaCEmbedTableArray(); - - - UniversalGarbage *garbage = newUniversalGarbage(); - char *lib_meta_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_META_TABLE__,self->lib_identifier); - UniversalGarbage_add_simple(garbage,lib_meta_table); - //creating the metatable - luaL_newmetatable(self->state, lib_meta_table); - //seting the clojure key - lua_pushstring(self->state,PRIVATE_LUA_CEMBED_DEL_PREFIX); - //set self as first clojure argument - lua_pushlightuserdata(self->state,(void*)self); - lua_pushcclosure(self->state,private_LuaCemb_internal_free,1); - lua_settable(self->state, -3); - - - char *lib_main_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - UniversalGarbage_add_simple(garbage,lib_main_table); - //creating the global table to store the elements - lua_newtable(self->state); - lua_setglobal(self->state,lib_main_table); - luaL_setmetatable(self->state, lib_meta_table); - - UniversalGarbage_free(garbage); - return self; -} - -int LuaCembed_perform(LuaCEmbed *self){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - char *lib_main_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - lua_getglobal(self->state,lib_main_table); - free(lib_main_table); - return 1; -} - - -//path: src/imports/../LuaCEmbed/memory/fdefine.memory.c -//mannaged by silver chain - - - -void LuaCEmbed_set_memory_limit(LuaCEmbed *self, double limit){ - lua_setallocf(self->state, private_LuaCembed_custom_allocator, &lua_cembed_used_memory); - lua_cembed_memory_limit = limit; -} -static void *private_LuaCembed_custom_allocator(void *ud, void *ptr, size_t osize, size_t nsize) { - int *used = (int *)ud; - - if (ptr == NULL) { - osize = 0; - } - - if (nsize == 0) { - free(ptr); - *used -= osize; - return NULL; - } else { - long custom_limit = (long)(lua_cembed_memory_limit * PRIVATE_LUA_CEMBED_ONE_MB); - if (*used + (nsize - osize) > custom_limit) - return NULL; - ptr = realloc(ptr, nsize); - if (ptr) - *used += (nsize - osize); - return ptr; - } -} - - - -//path: src/imports/../LuaCEmbed/table/table/append/fdefine.append.c -//mannaged by silver chain - -void LuaCEmbedTable_append_table(LuaCEmbedTable *self, LuaCEmbedTable *table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_getglobal(self->main_object->state,table->global_name); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_string(LuaCEmbedTable *self, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushstring(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_long(LuaCEmbedTable *self, long long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushnumber(self->main_object->state,(double)value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_double(LuaCEmbedTable *self, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushnumber(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_bool(LuaCEmbedTable *self, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushboolean(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_evaluation(LuaCEmbedTable *self, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - va_list args; - va_start(args,code); - char *buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate( - self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); -} - -//path: src/imports/../LuaCEmbed/table/table/basic/fdefine.basic.c -//mannaged by silver chain - - - - - -LuaCEmbedTable * private_newLuaCembedTable(LuaCEmbed *main_embed, const char *format, ...){ - - LuaCEmbedTable *self = (LuaCEmbedTable*)malloc(sizeof (LuaCEmbedTable)); - *self = (LuaCEmbedTable){0}; - self->main_object =main_embed; - - va_list args; - va_start(args,format); - self->global_name = private_LuaCembed_format_vaarg(format,args); - va_end(args); - - self->sub_tables = (void*)newprivateLuaCEmbedTableArray(); - - return self; -} - - int private_lua_cEmbed_unpack(LuaCEmbedTable *self,const char * previews_function){ - - long size = LuaCEmbedTable_get_listable_size(self); - lua_settop(self->main_object->state, 0); - - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - int total = 0; - - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - - lua_pushvalue(self->main_object->state,-1); - char *formated = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->main_object->stack_leve,total); - - lua_setglobal(self->main_object->state,formated); - free(formated); - lua_pop(self->main_object->state,1); - total+=1; - } - if(previews_function){ - lua_getglobal(self->main_object->state,previews_function); - } - for(int i = 0; i < size; i++){ - char *formated = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->main_object->stack_leve,i); - lua_getglobal(self->main_object->state,formated); - free(formated); - } - - return (int)size; -} -void privateLuaCEmbedTable_free(LuaCEmbedTable *self){ - - free(self->global_name); - - if(self->prop_name){ - free(self->prop_name); - } - - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->sub_tables); - free(self); -} - - - -//path: src/imports/../LuaCEmbed/table/table/destroy/fdefine.destroy.c -//mannaged by silver chain - - - -void LuaCembedTable_destroy_prop(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnil(self->main_object->state); - lua_settable(self->main_object->state,-3); -} -void LuaCEmbedTable_destroy_by_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(LuaCembedTable_has_key_at_index(self,index)){ - char *key = LuaCembedTable_get_key_by_index(self,index); - LuaCembedTable_destroy_prop(self,key); - return; - } - - lua_getglobal(self->main_object->state,self->global_name); - - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int table_index = lua_gettop(self->main_object->state); - int total = 0; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total >= converted_index){ - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)(total)); - lua_pushvalue(self->main_object->state,-3); - lua_settable(self->main_object->state,-3); - lua_pop(self->main_object->state,1); - - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,total); - lua_pushnil(self->main_object->state); - lua_settable(self->main_object->state,-3); - - - -} - -//path: src/imports/../LuaCEmbed/table/table/errors/fdefine.errors.c -//mannaged by silver chain - - - - -int privateLuaCEmbedTable_ensure_type_with_key(LuaCEmbedTable *self, const char *name, int expected_type){ - if(!self){ - return LUA_CEMBED_GENERIC_ERROR; - } - - int type = lua_type(self->main_object->state,-1); - if(type == expected_type){ - return LUA_CEMBED_OK; - } - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_PROPETY, - name, - self->global_name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} - -int privateLuaCEmbedTable_ensure_type_with_index(LuaCEmbedTable *self, long index, int expected_type){ - if(!self){ - return LUA_CEMBED_GENERIC_ERROR; - } - - int type = lua_type(self->main_object->state,-1); - if(type == expected_type){ - return LUA_CEMBED_OK; - } - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} - -//path: src/imports/../LuaCEmbed/table/table/getters/index/fdefine.index.c -//mannaged by silver chain - - - -long LuaCEmbedTable_get_full_size(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - - - lua_getglobal(self->main_object->state,self->global_name); - int index = lua_gettop(self->main_object->state); - long total = 0; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,index)){ - total+=1; - lua_pop(self->main_object->state,1); - } - - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return total; -} - -long LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - lua_getglobal(self->main_object->state,self->global_name); - return (long)lua_rawlen(self->main_object->state,-1); -} - - -long privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cembed_incremented_arg index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - if(index >= 0){ - return index; - } - - return LuaCEmbedTable_get_full_size(self) + index; -} - -int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - int type = lua_type(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return type; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_NOT_FOUND; -} -char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - - if(total == converted_index){ - if(lua_type(self->main_object->state,-2) != LUA_CEMBED_STRING ){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - char* result = (char*)lua_tostring(self->main_object->state,-2); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - - lua_pop(self->main_object->state,1); - total+=1; - - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} -bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - lua_settop(self->main_object->state,0); - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - bool has_key =lua_type(self->main_object->state,-2) == LUA_CEMBED_STRING; - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return has_key; - } - - lua_pop(self->main_object->state,1); - total+=1; - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return false; -} - -long long LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - lua_settop(self->main_object->state,0); - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_NUMBER)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - long result = (long)lua_tonumber(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_NUMBER) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} - -double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_NUMBER)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - double result = (double )lua_tonumber(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_NUMBER) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} - -char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_STRING)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - char * result = (char*)lua_tostring(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_STRING) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} - -bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_BOOL)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - bool result = lua_toboolean(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - converted_index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_BOOL) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} - -//path: src/imports/../LuaCEmbed/table/table/getters/keys/fdefine.keys.c -//mannaged by silver chain - - -int LuaCEmbedTable_get_type_prop(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - return lua_type(self->main_object->state,-1); - -} - -char* LuaCembedTable_get_string_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_STRING)){ - return NULL; - } - - char *value = (char*)lua_tostring(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - - -long long LuaCembedTable_get_long_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - long long value = (long long)lua_tonumber(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - -double LuaCembedTable_get_double_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - double value = (double )lua_tonumber(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - -bool LuaCembedTable_get_bool_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - bool value = lua_toboolean(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - - -//path: src/imports/../LuaCEmbed/table/table/setters/index/fdefine.index.c -//mannaged by silver chain - - - -void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, long index, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_string_prop(self,possible_key,value); - return; - } - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushstring(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_long_by_index(LuaCEmbedTable *self, long long index, long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_long_prop(self,possible_key,value); - return; - } - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushnumber(self->main_object->state,(double )value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, long index, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_double_prop(self,possible_key,value); - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushnumber(self->main_object->state,(double )value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, long index, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_bool_prop(self,possible_key,value); - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushboolean(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - - -void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, long index, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - va_list args; - va_start(args,code); - char * buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate(self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - - -//path: src/imports/../LuaCEmbed/table/table/setters/insert/fdefine.insert.c -//mannaged by silver chain - - -void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, long formatted_index){ - - - lua_newtable(self->main_object->state); - lua_setglobal(self->main_object->state,PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - - lua_getglobal(self->main_object->state, self->global_name); - int table_index = lua_gettop(self->main_object->state); - int total = 1; - lua_pushnil(self->main_object->state); // Empilhando o primeiro par chave-valor - while (lua_next(self->main_object->state, table_index)) { - - if (total >= formatted_index) { - lua_getglobal(self->main_object->state, PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - lua_pushinteger(self->main_object->state, total + 1); - lua_pushvalue(self->main_object->state, -3); - lua_settable(self->main_object->state, -3); - lua_pop(self->main_object->state, 1); - } - lua_pop(self->main_object->state, 1); // Removendo o valor atual - total+=1; - } - - lua_getglobal(self->main_object->state, PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - table_index = lua_gettop(self->main_object->state); - lua_pushnil(self->main_object->state); - - while (lua_next(self->main_object->state, table_index)) { - lua_getglobal(self->main_object->state,self->global_name); - lua_pushvalue(self->main_object->state,-3); //table[index] = stage_area[index] - lua_pushvalue(self->main_object->state,-3); //table[index] = stage_area[index] - lua_settable(self->main_object->state,-3); - lua_pop(self->main_object->state, 2); // Removendo o valor atual - } - - lua_getglobal(self->main_object->state, "stage_arrea"); - lua_pushnil(self->main_object->state); -} - -void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, long index, const char *value) { - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushstring(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - - -void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, long index,bool value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushboolean(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, long long index,long value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushinteger(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, long index,double value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushnumber(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_table_at_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *table){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_getglobal(self->main_object->state,table->global_name); - lua_settable(self->main_object->state, -3); - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -//path: src/imports/../LuaCEmbed/table/table/setters/keys/fdefine.keys.c -//mannaged by silver chain - - - - - -void LuaCEmbedTable_set_method(LuaCEmbedTable *self , const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - bool is_meta = false; - - if(strlen(name) > 3){ - if(name[0] == '_' && name[1] == '_' ){ - is_meta = true; - } - } - lua_getglobal(self->main_object->state,self->global_name); - - if(is_meta){ - - - int found =lua_getmetatable(self->main_object->state,-1); - if(!found){ - - //equivalent of meta ={} ;setmetatable(table,meta) - lua_getglobal(self->main_object->state,self->global_name); - lua_newtable(self->main_object->state); - lua_setmetatable(self->main_object->state,-2); - - lua_getglobal(self->main_object->state,self->global_name); - lua_getmetatable(self->main_object->state,-1); - } - } - - - lua_pushstring(self->main_object->state,name); - //creating the clojure - - lua_pushboolean(self->main_object->state,true);//is a method - - lua_pushlightuserdata(self->main_object->state,(void*)self->main_object); //self - lua_pushstring(self->main_object->state,name);//calback name - lua_getglobal(self->main_object->state,self->global_name);//table - lua_pushlightuserdata(self->main_object->state,(void*)callback); - - //add these clojure to be handled by the callbacks - lua_pushcclosure(self->main_object->state,privateLuaCEmbed_main_callback_handler,5); - lua_settable(self->main_object->state,-3); - - if(is_meta){ - //equivalent of meta ={} ;setmetatable(table,meta) - lua_getglobal(self->main_object->state,self->global_name); - lua_getmetatable(self->main_object->state,-1); - lua_setmetatable(self->main_object->state,-2); - } - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_string_prop(LuaCEmbedTable *self , const char *name, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushstring(self->main_object->state,value); - - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_long_prop(LuaCEmbedTable *self , const char *name, long long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnumber(self->main_object->state,(double)value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_double_prop(LuaCEmbedTable *self , const char *name, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnumber(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_bool_prop(LuaCEmbedTable *self , const char *name, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushboolean(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_evaluation_prop(LuaCEmbedTable *self, const char *name, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - va_list args; - va_start(args,code); - char *buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate(self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -//path: src/imports/../LuaCEmbed/table/table/sub_tables/index/fdefine.index.c -//mannaged by silver chain - - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_appending(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - - //equivalent of: full_sub_table_name = {} - long index= LuaCEmbedTable_get_listable_size(self) +1; - char *full_sub_table_name = private_LuaCembed_format("%s_%d", self->global_name, index); - lua_newtable(self->main_object->state); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - //equivalent of: table[index] = full_sub_table_name - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,index); - lua_getglobal(self->main_object->state,full_sub_table_name); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_internal_index( - (privateLuaCEmbedTableArray *) self->sub_tables, - index - ); - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->index = index; - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; -} - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, long index){ - - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_TABLE)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - - //equivalent of full_sub_table_name = table[index] - char *full_sub_table_name = private_LuaCembed_format("%s_%d", self->global_name, index); - lua_setglobal(self->main_object->state,full_sub_table_name); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_internal_index( - (privateLuaCEmbedTableArray *) self->sub_tables, - index - ); - - if(possible){ - free(full_sub_table_name); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->index = index; - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_TABLE) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} - -void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_sub_table_prop(self,possible_key,sub_table); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,formatted_index); - lua_getglobal(self->main_object->state,sub_table->global_name); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK -} - - -//path: src/imports/../LuaCEmbed/table/table/sub_tables/key/fdefine.key.c -//mannaged by silver chain - - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_by_key(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - //equivalent of: table.sub_table = {} - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_newtable(self->main_object->state); - lua_settable(self->main_object->state,-3); - - - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state, name); - lua_gettable(self->main_object->state, -2); - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_prop_name( - (privateLuaCEmbedTableArray *) self->sub_tables, - name - ); - - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->prop_name = strdup(name); - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; -} - - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_key(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_TABLE)){ - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_prop_name( - (privateLuaCEmbedTableArray *) self->sub_tables, - name - ); - - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->prop_name = strdup(name); - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; - -} - - - -void LuaCEmbedTable_set_sub_table_prop(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - //equivalent of table.name = sub_table; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_getglobal(self->main_object->state,sub_table->global_name); - lua_settable(self->main_object->state,-3); - - - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK -} - -//path: src/imports/../LuaCEmbed/table/table_array/fdefine.table_array.c -//mannaged by silver chain - - - -privateLuaCEmbedTableArray *newprivateLuaCEmbedTableArray(){ - privateLuaCEmbedTableArray *self = (privateLuaCEmbedTableArray*) malloc(sizeof (privateLuaCEmbedTableArray)); - *self = (privateLuaCEmbedTableArray){0}; - self->tables = (LuaCEmbedTable**)malloc(0); - return self; -} - -void privateLuaCEmbedTableArray_append(privateLuaCEmbedTableArray *self,LuaCEmbedTable *element){ - - self->tables = (LuaCEmbedTable **)realloc( - self->tables, - (self->size+1)* sizeof (LuaCEmbedTable**) - ); - self->tables[self->size] = element; - self->size+=1; -} - - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_prop_name(privateLuaCEmbedTableArray *self, const char *name){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(current_table->prop_name){ - if(strcmp(current_table->prop_name,name) ==0){ - return current_table; - } - } - } - return NULL; -} - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_global_name(privateLuaCEmbedTableArray *self, const char *name){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(strcmp(current_table->global_name,name) ==0){ - return current_table; - } - } - return NULL; -} - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_internal_index(privateLuaCEmbedTableArray *self, long internal_index){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(current_table->index == internal_index){ - return current_table; - } - } - return NULL; -} - -void privateLuaCEmbedTableArray_free(privateLuaCEmbedTableArray *self){ - - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - privateLuaCEmbedTable_free(current_table); - } - - free(self->tables); - free(self); -} - - -//path: src/imports/../LuaCEmbedResponse/fdefine.LuaCEmbedResponse.c -//mannaged by silver chain - - - - -LuaCEmbedResponse *private_LuaCEmbedReturn_raw(){ - LuaCEmbedResponse *self = (LuaCEmbedResponse*)malloc(sizeof(LuaCEmbedResponse)); - *self = (LuaCEmbedResponse){0}; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_bool(bool value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_BOOL_RESPONSE; - self->num_val = (double)value; - return self; -} - - -LuaCEmbedResponse * LuaCEmbed_send_str(const char *text){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = (long)strlen(text); - self->string_val = (char*)malloc(sizeof(char) * self->string_size +1); - memcpy(self->string_val,text,self->string_size); - self->string_val[self->string_size] = '\0'; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_raw_string(const char *text,long size){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = size; - self->string_val = (char*)malloc(sizeof(char) * self->string_size +1); - memcpy(self->string_val,text,self->string_size); - self->string_val[self->string_size] = '\0'; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_str_reference(const char *text){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = (long)strlen(text); - self->string_val = (char*)text; - self->its_string_ref = true; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_raw_string_reference(const char *text,long size){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = size; - self->string_val = (char*)text; - self->its_string_ref = true; - return self; -} - - - -LuaCEmbedResponse * LuaCEmbed_send_error(const char *format,...){ - - va_list args; - va_start(args,format); - char *error = private_LuaCembed_format_vaarg(format,args); - va_end(args); - - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_ERROR_RESPONSE; - self->string_val = error; - return self; -} - - -LuaCEmbedResponse * LuaCEmbed_send_multi_return(LuaCEmbedTable *table){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_MULTI_RESPONSE; - lua_getglobal(table->main_object->state,table->global_name); - lua_setglobal(table->main_object->state,PRIVATE_LUA_CEMBED_TABLE_RETURN); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_table(LuaCEmbedTable *table){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_TABLE_RESPONSE; - lua_getglobal(table->main_object->state,table->global_name); - lua_setglobal(table->main_object->state,PRIVATE_LUA_CEMBED_TABLE_RETURN); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_evaluation(const char *code){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_EVALUATION; - self->string_val = strdup(code); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_double(double value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE; - self->num_val = value; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_long(long value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_LONG_RESPONSE; - self->num_val = (double)value; - return self; -} - - - -void private_LuaCEmbedResponse_free(LuaCEmbedResponse *self){ - - if(self->string_val && self->its_string_ref == false){ - free(self->string_val); - } - free(self); -} - - -//path: src/imports/../extra/fdefine.extra.c -//mannaged by silver chain - - - -const char * LuaCembed_convert_arg_code(int arg_code){ - if(arg_code == LUA_CEMBED_NOT_FOUND){ - return PRIVATE_LUA_CEMBED_NOT_FOUND_STRING; - } - - if(arg_code == LUA_CEMBED_STRING){ - return PRIVATE_LUA_CEMBED_STRING_STRING; - - } - if(arg_code == LUA_CEMBED_NUMBER){ - return PRIVATE_LUA_CEMBED_NUMBER_STRING; - } - if(arg_code == LUA_CEMBED_BOOL){ - return PRIVATE_LUA_CEMBED_BOOL_STRING; - } - if(arg_code == LUA_CEMBED_NIL){ - return PRIVATE_LUA_CEMBED_NIL_STRING; - } - if(arg_code == LUA_CEMBED_TABLE){ - return PRIVATE_LUA_CEMBED_TABLE_STRING; - } - if(arg_code == LUA_CEMBED_FUNCTION){ - return PRIVATE_LUA_CEMBED_FUNCTION_STRING; - } - - return PRIVATE_LUA_CEMBED_UNKNOW_STRING; -} - -char * private_LuaCembed_format_vaarg(const char *expresion, va_list args){ - - va_list args_copy; - va_copy(args_copy, args); - long required_size = vsnprintf(NULL, 0,expresion,args_copy); - va_end(args_copy); - char *buffer = (char*)malloc(sizeof(char) * required_size + 2); - vsnprintf(buffer,sizeof (char) * required_size+1,expresion,args); - return buffer; -} -char * private_LuaCembed_format(const char *expresion, ...){ - va_list args; - va_start(args,expresion); - char *result = private_LuaCembed_format_vaarg(expresion,args); - va_end(args); - return result; -} - -//path: src/imports/../namespace/LuaCEmbedNamespace/fdefine.LuaCEmbedNamespace.c -//mannaged by silver chain - - - - -LuaCEmbedNamespace newLuaCEmbedNamespace(){ - LuaCEmbedNamespace self = {0}; - self.newLuaLib = newLuaCEmbedLib; - self.load_lib_from_c = LuaCEmbed_load_lib_from_c; - self.newLuaEvaluation = newLuaCEmbedEvaluation; - self.set_delete_function = LuaCembed_set_delete_function; - self.perform = LuaCembed_perform; - self.load_native_libs = LuaCEmbed_load_native_libs; - self.set_memory_limit = LuaCEmbed_set_memory_limit; - self.clear_errors = LuaCEmbed_clear_errors; - self.convert_arg_code = LuaCembed_convert_arg_code; - self.tables = newLuaCembedTableModule(); - self.args = newLuaCembedArgsModule(); - self.types = newLuaCEmbedTypeModule(); - self.globals = newLuaCEmbedGlobalModule(); - self.response = newLuaCEmbedResponseModule(); - self.get_error_message = LuaCEmbed_get_error_message; - self.has_errors = LuaCEmbed_has_errors; - self.set_timeout = LuaCEmbed_set_timeout; - self.evaluate = LuaCEmbed_evaluate; - self.get_string_evaluation = LuaCEmbed_get_evaluation_string; - self.get_evaluation_type = LuaCEmbed_get_evaluation_type; - self.get_evaluation_size = LuaCEmbed_get_evaluation_table_size; - self.get_evaluation_long = LuaCEmbed_get_evaluation_long; - self.get_evaluation_double = LuaCEmbed_get_evaluation_double; - self.get_evaluation_bool = LuaCEmbed_get_evaluation_bool; - self.evaluete_file = LuaCEmbed_evaluete_file; - self.add_callback = LuaCEmbed_add_callback; - self.add_global_callback = LuaCEmbed_add_global_callback; - self.set_bool_lib_prop = LuaCEmbed_set_bool_lib_prop; - self.set_long_lib_prop = LuaCEmbed_set_long_lib_prop; - self.set_double_lib_prop = LuaCEmbed_set_double_lib_prop; - self.set_string_lib_prop = LuaCEmbed_set_string_lib_prop; - self.set_table_lib_prop = LuaCEmbed_set_table_lib_prop; - self.get_long_lib_prop = LuaCEmbed_get_long_lib_prop; - self.get_double_lib_prop = LuaCEmbed_get_double_lib_prop; - self.get_bool_lib_prop = LuaCEmbed_get_bool_lib_prop; - self.get_string_lib_prop = LuaCEmbed_get_string_lib_prop; - self.get_table_lib_prop = LuaCEmbed_get_table_lib_prop; - - self.free = LuaCEmbed_free; - return self; -} - - -//path: src/imports/../namespace/args/fdefine.args.c -//mannaged by silver chain - - - -LuaCembedArgsModule newLuaCembedArgsModule(){ - LuaCembedArgsModule self = {0}; - self.get_bool = LuaCEmbed_get_bool_arg; - self.get_long = LuaCEmbed_get_long_arg; - self.get_double = LuaCEmbed_get_double_arg; - self.get_str = LuaCEmbed_get_str_arg; - self.get_raw_str = LuaCEmbed_get_raw_str_arg; - self.get_type = LuaCEmbed_get_arg_type; - self.get_table = LuaCEmbed_get_arg_table; - self.size = LuaCEmbed_get_total_args; - self.get_type_clojure_evalation = LuaCEmbed_get_type_clojure_evalation; - self.generate_arg_clojure_evalation = LuaCEmbed_generate_arg_clojure_evalation; - self.get_bool_arg_clojure_evalation = LuaCEmbed_get_bool_arg_clojure_evalation; - self.get_long_arg_clojure_evalation = LuaCEmbed_get_long_arg_clojure_evalation; - self.get_double_arg_clojure_evalation = LuaCEmbed_get_double_arg_clojure_evalation; - self.get_string_arg_clojure_evalation = LuaCEmbed_get_string_arg_clojure_evalation; - self.run_lambda = LuaCEmbed_run_args_lambda; - return self; -} - -//path: src/imports/../namespace/globals/fdefine.globals.c -//mannaged by silver chain - - - -LuaCEmbedGlobalModule newLuaCEmbedGlobalModule(){ - LuaCEmbedGlobalModule self = {0}; - self.ensure_type = LuaCEmbed_ensure_global_type; - self.get_double = LuaCEmbed_get_global_double; - self.get_string = LuaCEmbed_get_global_string; - self.get_long = LuaCEmbed_get_global_long; - self.get_raw_string = LuaCEmbed_get_global_raw_string; - self.set_raw_string = LuaCEmbed_set_global_raw_string; - self.get_bool = LuaCEmbed_get_global_bool; - self.get_type = LuaCEmbed_get_global_type; - self.run_global_lambda = LuaCEmbed_run_global_lambda; - self.set_table = LuaCEmbed_set_global_table; - self.set_string = LuaCEmbed_set_global_string; - self.set_bool = LuaCEmbed_set_global_bool; - self.set_double = LuaCEmbed_set_global_double; - self.set_long = LuaCEmbed_set_global_long; - self.new_table = LuaCembed_new_global_table; - self.get_table = LuaCembed_get_global_table; - - return self; -} - -//path: src/imports/../namespace/response/fdefine.response.c -//mannaged by silver chain - - - -LuaCEmbedResponseModule newLuaCEmbedResponseModule(){ - LuaCEmbedResponseModule self = {0}; - self.send_multi_return = LuaCEmbed_send_multi_return; - self.send_str = LuaCEmbed_send_str; - self.send_str_reference = LuaCEmbed_send_str_reference; - self.send_raw_string = LuaCEmbed_send_raw_string; - self.send_raw_string_reference = LuaCEmbed_send_raw_string_reference; - self.send_bool = LuaCEmbed_send_bool; - self.send_double = LuaCEmbed_send_double; - self.send_evaluation_function = LuaCEmbed_send_evaluation; - self.send_long = LuaCEmbed_send_long; - self.send_table = LuaCEmbed_send_table; - self.send_error = LuaCEmbed_send_error; - return self; -} - - -//path: src/imports/../namespace/table/fdefine.table.c -//mannaged by silver chain - - - -LuaCembedTableModule newLuaCembedTableModule(){ - LuaCembedTableModule self ={0}; - - self.append_string = LuaCEmbedTable_append_string; - self.append_bool = LuaCEmbedTable_append_bool; - self.append_double = LuaCEmbedTable_append_double; - self.append_long = LuaCEmbedTable_append_long; - self.append_table = LuaCEmbedTable_append_table; - self.append_evaluation = LuaCEmbedTable_append_evaluation; - - self.insert_string_at_index = LuaCEmbedTable_insert_string_at_index; - self.insert_double_at_index = LuaCEmbedTable_insert_double_at_index; - self.insert_long_at_index = LuaCEmbedTable_insert_long_at_index; - self.insert_table_at_index = LuaCEmbedTable_insert_table_at_index; - - self.set_evaluation_prop = LuaCEmbedTable_set_evaluation_prop; - self.set_method = LuaCEmbedTable_set_method; - self.set_method = LuaCEmbedTable_set_method; - self.set_bool_prop = LuaCEmbedTable_set_bool_prop; - self.set_double_prop = LuaCEmbedTable_set_double_prop; - self.set_long_prop = LuaCEmbedTable_set_long_prop; - self.set_string_prop = LuaCEmbedTable_set_string_prop; - - self.get_sub_table_prop = LuaCEmbedTable_get_sub_table_by_key; - self.new_sub_table_prop = LuaCEmbedTable_new_sub_table_by_key; - self.set_sub_table_prop = LuaCEmbedTable_set_sub_table_prop; - self.new_anonymous_table = LuaCembed_new_anonymous_table; - - self.set_sub_table_by_index = LuaCEmbedTable_set_sub_table_by_index; - self.get_bool_prop = LuaCembedTable_get_bool_prop; - self.get_double_prop = LuaCembedTable_get_double_prop; - self.get_long_prop = LuaCembedTable_get_long_prop; - self.get_string_prop = LuaCembedTable_get_string_prop; - self.get_type_prop = LuaCEmbedTable_get_type_prop; - self.destroy_prop = LuaCembedTable_destroy_prop; - - self.set_long_by_index = LuaCEmbedTable_set_long_by_index; - self.set_bool_by_index= LuaCEmbedTable_set_bool_by_index; - self.set_double_by_index =LuaCEmbedTable_set_double_by_index; - self.set_string_by_index = LuaCEmbedTable_set_string_by_index; - self.set_evaluation_by_index = LuaCEmbedTable_set_evaluation_by_index; - - self.get_listable_size = LuaCEmbedTable_get_listable_size; - - self.new_sub_table_appending = LuaCEmbedTable_new_sub_table_appending; - self.has_key = LuaCembedTable_has_key_at_index; - self.get_key_by_index = LuaCembedTable_get_key_by_index; - self.get_size = LuaCEmbedTable_get_full_size; - self.get_type_by_index = LuaCEmbedTable_get_type_by_index; - self.get_long_by_index = LuaCEmbedTable_get_long_by_index; - self.get_double_by_index = LuaCEmbedTable_get_double_by_index; - self.get_bool_by_index = LuaCEmbedTable_get_bool_by_index; - self.get_string_by_index= LuaCEmbedTable_get_string_by_index; - self.get_sub_table_by_index = LuaCEmbedTable_get_sub_table_by_index; - return self; -} - - -//path: src/imports/../namespace/types/fdefine.types.c -//mannaged by silver chain - - -LuaCEmbedTypeModule newLuaCEmbedTypeModule(){ - LuaCEmbedTypeModule self = {0}; - self.NOT_FOUND = LUA_CEMBED_NOT_FOUND; - self.STRING = LUA_CEMBED_STRING; - self.NUMBER = LUA_CEMBED_NUMBER; - self.BOOL = LUA_CEMBED_BOOL; - self.NILL = LUA_CEMBED_NIL; - self.TABLE = LUA_CEMBED_TABLE; - self.FUNCTION = LUA_CEMBED_FUNCTION; - return self; -} - -#endif - - - - -#define LUACEMBED_H -#endif diff --git a/README.md b/README.md index a857f1b..d6001b2 100644 --- a/README.md +++ b/README.md @@ -1,31 +1,22 @@ +### WARNING: THIS IS ALPHA SOFTWARE. USE AT YOUR OWN RISK. NO WARRANTY IS PROVIDED AND BUGS ARE EXPECTED. LuaCEmbed it's a lua wrapper to allow easy interoperability beetwen C and Lua -providing any methods to control Lua Code from C +providing any methods to control Lua Code from C,Make Lua Libs, or create ambients +for safe evaluation of Lua code. -

-DESPITE BEING 100% COVERED BY TESTS, THIS LIBRARY IS NOT CONSIDERED PRODUCTION READY YET, USE RESPONSIBLY -

+## Releases +| Item | Description | +|------|-------------| +|[LuaCEmbedOne.c](https://github.com/OUIsolutions/LuaCEmbed/releases/download/0.8.2/LuaCEmbedOne.c) |One File| +|[LuaCEmbed.c](https://github.com/OUIsolutions/LuaCEmbed/releases/download/0.8.2/LuaCEmbed.c)| Definition| +|[LuaCEmbed.h](https://github.com/OUIsolutions/LuaCEmbed/releases/download/0.8.2/LuaCEmbed.h)| Header| +|[LuaCEmbed.zip](https://github.com/OUIsolutions/LuaCEmbed/releases/download/0.8.2/LuaCEmbed.zip)| Zip Mode| - -### Usefull Links - - -#### Lua Project -[Lua Project](https://www.lua.org/) - -#### Oui WebSite -[Link to Web Site](oui.tec.br) - -#### Download Link -[Click Here to Download](https://github.com/OUIsolutions/LuaCEmbed/releases/download/v0.75/LuaCEmbed.h) - - -### Instalation -Like all Oui librarys, the LuaCEmbed addopt the ideia of single file lib, so you just need to copy the **LuaCEmbed.h** file -into your project, and compile with gcc/clang - -~~~c -#include "LuaCEmbed.h" +### Most Basic Example +Like all OUI librarys, the LuaCEmbed addopt the ideia of single file lib, so you just need to copy the [LuaCEmbedOne.c](https://github.com/OUIsolutions/LuaCEmbed/releases/download/0.8.2/LuaCEmbedOne.c) file +into your project, and compile with gcc/clang +```c +#include "LuaCEmbedOne.c" LuaCEmbedNamespace lua_n; int main(int argc, char *argv[]){ @@ -43,2223 +34,19 @@ int main(int argc, char *argv[]){ return 0; } -~~~ - - -It will produce: - - -~~~txt -result 50 -~~~ - -### Runting Native functions -

-NEVER CALL THE FUNCTION 'load_native_libs' IF YOU DON TRUST IN THE USER -

-You can load native lua functions by the usage of **load_native_libs** function - - -~~~c -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - //NEVER USE THESE IF YOU DONT TRUSt IN THE CLIENT - lua_n.load_native_libs(l); - - lua_n.evaluate(l,"print('hello from lua')"); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - -~~~txt -hello from lua - -~~~ - - -### Making a library -in the same way we can execute lua from C, we also can generate dll/so to be acessible by lua as a library - -~~~c - -#include "LuaCEmbed.h" - -LuaCEmbedNamespace lua_n; - - - LuaCEmbedResponse *add_cfunc(LuaCEmbed *args){ - double first_num = lua_n.args.get_double(args,0); - double second_num = lua_n.args.get_double(args,1); - - if(lua_n.has_errors(args)){ - char *message = lua_n.get_error_message(args); - return lua_n.response.send_error(message); - } - double result = first_num + second_num; - return lua_n.response.send_double(result); -} -LuaCEmbedResponse *sub_cfunc(LuaCEmbed *args){ - double first_num = lua_n.args.get_double(args,0); - double second_num = lua_n.args.get_double(args,1); - - if(lua_n.has_errors(args)){ - char *message = lua_n.get_error_message(args); - return lua_n.response.send_error(message); - } - double result = first_num - second_num; - return lua_n.response.send_double(result); -} -int luaopen_my_lib(lua_State *state){ - lua_n = newLuaCEmbedNamespace(); - //functions will be only assescible by the required reciver - LuaCEmbed * l = lua_n.newLuaLib(state); - lua_n.add_callback(l,"add",add_cfunc); - lua_n.add_callback(l,"sub",sub_cfunc); - -return lua_n.perform(l); - -} -~~~ -Compile the code with: -~~~shell -gcc -Wall -shared -fpic -o my_lib.so main.c -~~~ - - -than you can call into your lua code - -~~~lua - -local lib = require("my_lib") - -x = lib.add(10,20) -y = lib.sub(20,5) -print("x",x) -print("y",y) - -~~~ -### Lib Props -you can determine library props into your lib: -~~~c - - -#include "LuaCEmbed.h" - -LuaCEmbedNamespace lua_n; - - - -int luaopen_my_lib(lua_State *state){ - lua_n = newLuaCEmbedNamespace(); - //functions will be only assescible by the required reciver - bool set_functions_as_public = false; - LuaCEmbed * l = lua_n.newLuaLib(state,set_functions_as_public); - lua_n.set_long_lib_prop(l,"long_prop", 30); - lua_n.set_double_lib_prop(l,"double_prop",50.5); - lua_n.set_bool_lib_prop(l,"bool_prop",true); - lua_n.set_string_lib_prop(l,"string_prop","test"); - LuaCEmbedTable * t = lua_n.tables.new_anonymous_table(l); - lua_n.tables.set_string_prop(t,"test","test_message"); - lua_n.set_table_lib_prop(l,"table_prop",t); - - return lua_n.perform(l); - -} -~~~ - -testing with lua: - -~~~lua - -lib = require("my_lib") -print("long_prop",lib.long_prop) -print("double_prop",lib.double_prop) -print("bool_prop",lib.bool_prop) -print("string_prop",lib.string_prop) -print("table_prop",lib.table_prop) -print("table_prop internal",lib.table_prop.test) - - -~~~ - - -### Evaluation -To evaluate Lua Code from C, you can use all the evaluation methods, provided by the lib - - -#### Evaluating string - - -~~~c -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.evaluate(l,"r = 'hello world'"); - - char * result = lua_n.get_string_evaluation(l,"r"); - printf("result: %s\n",result); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -result: hello world - -~~~ - - -#### Evaluating a file -It's also possible to evaluate a file by using the **evaluete_file** method - - -~~~c -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * hello(LuaCEmbed *args){ - printf("hello world"); - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"hello",hello); - - lua_n.evaluete_file(l,"tests/target/hello.lua"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} -~~~ - - -It will produce: - - -~~~txt -hello world -~~~ - - - -#### Type Evaluation -You can determine the type of the evaluation by using the **get_evaluation_type** method -#### Evaluating Long - - -~~~c -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.evaluate(l,"r = 'hello world'"); - - int r_type = lua_n.get_evaluation_type(l,"r"); - const char*converted = lua_n.convert_arg_code(r_type); - printf("result: %s\n",converted); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} -~~~ - - -It will produce: - - -~~~txt -result: string - -~~~ - - - -### Table Size -Its also possible to determine the size of a table by using the **get_evaluation_size** method - - -~~~c -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.evaluate(l,"r = {1,2,3}"); - - long result = lua_n.get_evaluation_size(l,"r"); - printf("size: %ld\n",result); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} -~~~ - - -It will produce: - - -~~~txt -size: 3 - -~~~ - -#### Evaluating Long - - -~~~c -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.evaluate(l,"r = 20 + 30"); - - long result = lua_n.get_evaluation_long(l,"r"); - printf("result: %ld\n",result); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -result: 50 - -~~~ - -#### Evaluating Double - - -~~~c -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.evaluate(l,"r = 20 + 30"); - - double result = lua_n.get_evaluation_double(l,"r"); - printf("result: %lf\n",result); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} -~~~ - - -It will produce: - - -~~~txt -result: 50.000000 - -~~~ - -#### Evaluating Bool - - -~~~c -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.evaluate(l,"r = true"); - - bool result = lua_n.get_evaluation_bool(l,"r"); - printf("result: %d\n",result); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -result: 1 - -~~~ - -### Timeout -You can set timeout to your functions, by using the timeout method: - - - -~~~c -#include "LuaCEmbed.h" - - -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - return lua_n.response.send_str(" executed after timeout error\n"); -} -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - int seconds = 2; - lua_n.set_timeout(seconds); - - lua_n.evaluate(l,"while true do end ;"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.clear_errors(l); - char *teste =lua_n.get_string_evaluation(l,"test()"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - - else{ - printf("%s",teste); - } - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -error: timeout error - executed after timeout error - -~~~ - -### Memory usage -by using the method **set_memory_limit** you can control the max ram usage of lua, the default its 100mb -
NOTE THAT EXTRA MEMORY ALOCATED OUTSIDE CALLBACKS OR EVALUATIONS ARE CONSIDER UNPROTECTED GEHAVIOR -AND IT WILL KILL THE APPLICATION - -
- - - - -~~~c -#include "LuaCEmbed.h" - -LuaCEmbedNamespace lua_n; - - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - int one_mega = 1; - lua_n.set_memory_limit(l,one_mega); - lua_n.evaluate(l,"t = 'a';while true do t = t .. t end"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -error: not enough memory - -~~~ - -### Callbacks -Callbacks i'ts a way to make c functions assesible in lua code, this it's the most basic callback: - - -~~~c - -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * hello(LuaCEmbed *args){ - printf("my first callback\n"); - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"hello",hello); - - lua_n.evaluate(l,"hello()"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -my first callback - -~~~ - - - -#### CallBack args -you can accept callback arguments into your function,check their types, and make operations with them. - - -~~~c - -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - long size = lua_n.args.size(args); - if(size == 0){ - printf("no argument providided\n"); - return NULL; - } - int index = 0; - int arg_type = lua_n.args.get_type(args,index); - - if(arg_type == lua_n.types.NUMBER){ - printf("number: %lf\n",lua_n.args.get_double(args,index)); - } - - else if(arg_type == lua_n.types.STRING){ - printf("str: %s\n",lua_n.args.get_str(args,index)); - } - - else if(arg_type == lua_n.types.BOOL){ - printf("bool: %d\n", lua_n.args.get_bool(args,index)); - } - else{ - const char *converted_to_str = lua_n.convert_arg_code(arg_type); - printf("type: %s\n",converted_to_str); - } - - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - lua_n.evaluate(l,"test()"); - lua_n.evaluate(l,"test(10)"); - lua_n.evaluate(l,"test('hello')"); - lua_n.evaluate(l,"test(true)"); - lua_n.evaluate(l,"test({a=30})"); - - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -no argument providided -number: 10.000000 -str: hello -bool: 1 -type: table - -~~~ - -#### Index type -The lua native language index first elements in position 1, authogth LuaCEmbed use the C style for indexation, starting at -0, but these can be easly reverted with the int macro **LUA_CEMBED_INDEX_DIF** - - -~~~c - -#define LUA_CEMBED_INDEX_DIF 0 -#include "LuaCEmbed.h" - -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - long size = lua_n.args.size(args); - if(size == 0){ - printf("no argument providided\n"); - return NULL; - } - int index = 1; - int arg_type = lua_n.args.get_type(args,index); - - if(arg_type == lua_n.types.NUMBER){ - printf("number: %lf\n",lua_n.args.get_double(args,index)); - } - - else if(arg_type == lua_n.types.STRING){ - printf("str: %s\n",lua_n.args.get_str(args,index)); - } - - else if(arg_type == lua_n.types.BOOL){ - printf("bool: %d\n", lua_n.args.get_bool(args,index)); - } - else{ - const char *converted_to_str = lua_n.convert_arg_code(arg_type); - printf("type: %s\n",converted_to_str); - } - - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - lua_n.evaluate(l,"test()"); - lua_n.evaluate(l,"test(10)"); - lua_n.evaluate(l,"test('hello')"); - lua_n.evaluate(l,"test(true)"); - lua_n.evaluate(l,"test({a=30})"); - - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} -~~~ - - -It will produce: - - -~~~txt -no argument providided -number: 10.000000 -str: hello -bool: 1 -type: table - -~~~ - - - -#### Creating a basic print function - -in these example, we are creating an 'print' function ,to allow print values - - -~~~c - -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * print_func(LuaCEmbed *args){ - long size = lua_n.args.size(args); - for(int index =0;index < size;index++ ){ - int arg_type = lua_n.args.get_type(args,index); - - if(arg_type == lua_n.types.NUMBER){ - printf("%lf\n",lua_n.args.get_double(args,index)); - } - - else if(arg_type == lua_n.types.STRING){ - printf("%s\n",lua_n.args.get_str(args,index)); - } - - else if(arg_type == lua_n.types.BOOL){ - bool result = lua_n.args.get_bool(args,index); - const char *converted_bool = result? "true":"false"; - printf("%s\n", converted_bool); - } - else{ - const char *converted_to_str = lua_n.convert_arg_code(arg_type); - printf("%s\n",converted_to_str); - } - - } - - - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"print",print_func); - - - lua_n.evaluate(l,"print(10,30,'aa',true,{a=30})"); - - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -10.000000 -30.000000 -aa -true -table - -~~~ - - -#### Evaluating arguments - -it's also possible to modify callbacks by lua code , by using the evaluation args mechanism. - - -~~~c - -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * add_func(LuaCEmbed *args){ - - - double num1 = lua_n.args.get_long_arg_clojure_evalation(args,0,"function(t) return t.num1 end "); - double num2 = lua_n.args.get_long_arg_clojure_evalation(args,0,"function(t) return t.num2 end "); - - if(lua_n.has_errors(args)){ - char *error_message = lua_n.get_error_message(args); - return lua_n.response.send_error(error_message); - } - return lua_n.response.send_double(num1+num2); - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"add",add_func); - - - double result = lua_n.get_evaluation_double(l,"add({num1=10, num2=30})"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - printf("resullt :%lf\n",result); - - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -resullt :40.000000 - -~~~ - -#### Calling args callback - -if you recive a lambda as argument , you can run the function with rguments and retriving its result - - -~~~c - -#include "LuaCEmbed.h" - - -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - - LuaCEmbedTable *created = lua_n.tables.new_anonymous_table(args); - lua_n.tables.append_long(created,10); - lua_n.tables.append_long(created,20); - LuaCEmbedTable *response = lua_n.args.run_lambda(args,0,created,3); - double result = lua_n.tables.get_double_by_index(response,0); - - printf("result %lf\n",result); - - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - lua_n.evaluate(l,"test(function (a,b) return a + b end )"); - - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -result 30.000000 - -~~~ - - -#### Table Arguments -you can control table arguments easly with the **get_table** method, where you can retrive a -**LuaCEmbedTable** object - - - -~~~c - -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * add_func(LuaCEmbed *args){ - - LuaCEmbedTable *t0 = lua_n.args.get_table(args,0); - - if(lua_n.has_errors(args)){ - char *error_message = lua_n.get_error_message(args); - return lua_n.response.send_error(error_message); - } - - double num1 = lua_n.tables.get_double_prop(t0,"num1"); - double num2 = lua_n.tables.get_double_prop(t0,"num2"); - - - if(lua_n.has_errors(args)){ - char *error_message = lua_n.get_error_message(args); - return lua_n.response.send_error(error_message); - } - return lua_n.response.send_double(num1+num2); - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"add",add_func); - - - double result = lua_n.get_evaluation_double(l,"add({num1=10, num2=30})"); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - printf("resullt :%lf\n",result); - - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -resullt :40.000000 - -~~~ - -### Callbacks Response - -You also can return values or errors, with the **response** methods - -#### Returning a Long - - - -~~~c - -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - return lua_n.response.send_long(30); -} -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - - long result = lua_n.get_evaluation_long(l,"test()"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - printf("resullt :%ld\n",result); - - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -resullt :30 - -~~~ - -#### Returning a Double - - - -~~~c - -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - return lua_n.response.send_double(30); -} -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - - double result = lua_n.get_evaluation_double(l,"test()"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - printf("resullt :%lf\n",result); - - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -resullt :30.000000 - -~~~ - -#### Returning a String - - - -~~~c - -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - return lua_n.response.send_str("str return"); -} -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - - char * result = lua_n.get_string_evaluation(l,"test()"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - printf("resullt :%s\n",result); - - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -resullt :str return - -~~~ - -#### Returning a Bool - - - -~~~c - -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - return lua_n.response.send_bool(true); -} -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - - bool result = lua_n.get_evaluation_bool (l,"test()"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - printf("resullt :%d\n",result); - - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -resullt :1 - -~~~ - -#### Returning a Table - - - -~~~c - -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - LuaCEmbedTable *created = lua_n.tables.new_anonymous_table(args); - lua_n.tables.set_string_prop(created,"a","test message"); - return lua_n.response.send_table(created); -} -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - - lua_n.evaluate(l,"created_table = test()"); - LuaCEmbedTable *created = lua_n.globals.get_table(l,"created_table"); - char *a = lua_n.tables.get_string_prop(created,"a"); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - - printf("value of created.a = %s\n",a); - - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -value of created.a = test message - -~~~ - - -#### Returning multi return - -You also can return multi values at once with the **return_multi_return** method - - -~~~c - -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - - LuaCEmbedTable * multi_response = lua_n.tables.new_anonymous_table(args); - lua_n.tables.append_string(multi_response,"first"); - lua_n.tables.append_long(multi_response,10); - return lua_n.response.send_multi_return(multi_response); -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - - lua_n.evaluate(l,"a,b =test()"); - char *a = lua_n.get_string_evaluation(l,"a"); - long b = lua_n.get_evaluation_long(l,"b"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - printf("a = %s\n",a); - printf("b = %ld\n",b); - - - lua_n.free(l); - - return 0; -} -~~~ - - -It will produce: - - -~~~txt -a = first -b = 10 - -~~~ - -you can return multiple values using the multi return method - - -#### Returning a a Error -you can "raise" a error by returning a error in the function - - -~~~c - -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - return lua_n.response.send_error("my custom error menssage"); -} -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - - lua_n.evaluate(l,"test()"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -error: my custom error menssage - -~~~ - -### Table Handling -you can easly handle tables, with the getters and setters methods - -#### Retriving table props - - -~~~c -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - -LuaCEmbedResponse * show_table(LuaCEmbed *args){ - - LuaCEmbedTable * t1 = lua_n.args.get_table(args,0); - if(lua_n.has_errors(args)){ - char *menssage = lua_n.get_error_message(args); - return lua_n.response.send_error(menssage); - } - - char *name = lua_n.tables.get_string_prop(t1,"name"); - long age = lua_n.tables.get_long_prop(t1,"age"); - - if(lua_n.has_errors(args)){ - char *menssage = lua_n.get_error_message(args); - return lua_n.response.send_error(menssage); - } - - printf("name : %s\n",name); - printf("age: %ld\n",age); - - return NULL; -} -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"show_table", show_table); - lua_n.evaluate(l,"show_table({name='mateus',age=27})"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -name : mateus -age: 27 - -~~~ - - -#### Retriving Sub Tables - - - -~~~c -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - -LuaCEmbedResponse * show_table(LuaCEmbed *args){ - - LuaCEmbedTable * t1 = lua_n.args.get_table(args,0); - if(lua_n.has_errors(args)){ - char *menssage = lua_n.get_error_message(args); - return lua_n.response.send_error(menssage); - } - - long size = lua_n.tables.get_size(t1); - for(int i = 0; i < size; i++){ - - LuaCEmbedTable *current = lua_n.tables.get_sub_table_by_index(t1,i); - char *name = lua_n.tables.get_string_prop(current,"name"); - long age = lua_n.tables.get_long_prop(current,"age"); - - if(lua_n.has_errors(args)){ - char *menssage = lua_n.get_error_message(args); - return lua_n.response.send_error(menssage); - } - - printf("name : %s\n",name); - printf("age: %ld\n",age); - - printf("------------------------------------------\n"); - } - - return NULL; - -} -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"show_table", show_table); - lua_n.evaluate(l,"show_table({{name='mateus',age=27},{name='john',age=30}} )"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} -~~~ - -It will produce: - - -~~~txt -name : mateus -age: 27 ------------------------------------------- -name : john -age: 30 ------------------------------------------- - -~~~ - -#### Iterating over table - - -~~~c -#include "LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - - -LuaCEmbedResponse * show_table(LuaCEmbed *args){ - - LuaCEmbedTable * t1 = lua_n.args.get_table(args,0); - if(lua_n.has_errors(args)){ - char *menssage = lua_n.get_error_message(args); - return lua_n.response.send_error(menssage); - } - long size = lua_n.tables.get_size(t1); - for(int i = 0; i -DESPITE BEING 100% COVERED BY TESTS, THIS LIBRARY IS NOT CONSIDERED PRODUCTION READY YET, USE RESPONSIBLY - - - -### Usefull Links - - -#### Lua Project -[Lua Project](https://www.lua.org/) - -#### Oui WebSite -[Link to Web Site](oui.tec.br) - -#### Download Link -[Click Here to Download](https://github.com/OUIsolutions/LuaCEmbed/releases/download/v0.75/LuaCEmbed.h) - - -### Instalation -Like all Oui librarys, the LuaCEmbed addopt the ideia of single file lib, so you just need to copy the **LuaCEmbed.h** file -into your project, and compile with gcc/clang -codeof: exemples/evaluation/hello_world.c - - -It will produce: - -codeof: tests/main_test/evaluation/T_hello_world/expected.txt - -### Runting Native functions -

-NEVER CALL THE FUNCTION 'load_native_libs' IF YOU DON TRUST IN THE USER -

-You can load native lua functions by the usage of **load_native_libs** function - -codeof: exemples/evaluation/basic_evaluation_with_loaded_libs.c - -It will produce: -codeof: tests/main_test/evaluation/T_basic_evaluation_with_loaded_libs/expected.txt - - -### Making a library -in the same way we can execute lua from C, we also can generate dll/so to be acessible by lua as a library - -~~~c - -#include "LuaCEmbed.h" - -LuaCEmbedNamespace lua_n; - - - LuaCEmbedResponse *add_cfunc(LuaCEmbed *args){ - double first_num = lua_n.args.get_double(args,0); - double second_num = lua_n.args.get_double(args,1); - - if(lua_n.has_errors(args)){ - char *message = lua_n.get_error_message(args); - return lua_n.response.send_error(message); - } - double result = first_num + second_num; - return lua_n.response.send_double(result); -} -LuaCEmbedResponse *sub_cfunc(LuaCEmbed *args){ - double first_num = lua_n.args.get_double(args,0); - double second_num = lua_n.args.get_double(args,1); - - if(lua_n.has_errors(args)){ - char *message = lua_n.get_error_message(args); - return lua_n.response.send_error(message); - } - double result = first_num - second_num; - return lua_n.response.send_double(result); -} -int luaopen_my_lib(lua_State *state){ - lua_n = newLuaCEmbedNamespace(); - //functions will be only assescible by the required reciver - LuaCEmbed * l = lua_n.newLuaLib(state); - lua_n.add_callback(l,"add",add_cfunc); - lua_n.add_callback(l,"sub",sub_cfunc); - -return lua_n.perform(l); - -} -~~~ -Compile the code with: -~~~shell -gcc -Wall -shared -fpic -o my_lib.so main.c -~~~ - - -than you can call into your lua code - -~~~lua - -local lib = require("my_lib") - -x = lib.add(10,20) -y = lib.sub(20,5) -print("x",x) -print("y",y) - -~~~ -### Lib Props -you can determine library props into your lib: -~~~c - - -#include "LuaCEmbed.h" - -LuaCEmbedNamespace lua_n; - - - -int luaopen_my_lib(lua_State *state){ - lua_n = newLuaCEmbedNamespace(); - //functions will be only assescible by the required reciver - bool set_functions_as_public = false; - LuaCEmbed * l = lua_n.newLuaLib(state,set_functions_as_public); - lua_n.set_long_lib_prop(l,"long_prop", 30); - lua_n.set_double_lib_prop(l,"double_prop",50.5); - lua_n.set_bool_lib_prop(l,"bool_prop",true); - lua_n.set_string_lib_prop(l,"string_prop","test"); - LuaCEmbedTable * t = lua_n.tables.new_anonymous_table(l); - lua_n.tables.set_string_prop(t,"test","test_message"); - lua_n.set_table_lib_prop(l,"table_prop",t); - - return lua_n.perform(l); - -} -~~~ - -testing with lua: - -~~~lua - -lib = require("my_lib") -print("long_prop",lib.long_prop) -print("double_prop",lib.double_prop) -print("bool_prop",lib.bool_prop) -print("string_prop",lib.string_prop) -print("table_prop",lib.table_prop) -print("table_prop internal",lib.table_prop.test) - - -~~~ - - -### Evaluation -To evaluate Lua Code from C, you can use all the evaluation methods, provided by the lib - - -#### Evaluating string - -codeof: exemples/evaluation/string_evalation.c - -It will produce: - -codeof: tests/main_test/evaluation/T_string_evalation/expected.txt - - -#### Evaluating a file -It's also possible to evaluate a file by using the **evaluete_file** method - -codeof: exemples/evaluation/file_evaluation.c - - -It will produce: - -codeof: tests/main_test/evaluation/T_file_evaluation/expected.txt - - - -#### Type Evaluation -You can determine the type of the evaluation by using the **get_evaluation_type** method -#### Evaluating Long - -codeof: exemples/evaluation/type_evaluation.c - - -It will produce: - -codeof: tests/main_test/evaluation/T_type_evaluation/expected.txt - - - -### Table Size -Its also possible to determine the size of a table by using the **get_evaluation_size** method - -codeof: exemples/evaluation/table_size.c - - -It will produce: - -codeof: tests/main_test/evaluation/T_table_size/expected.txt - -#### Evaluating Long - -codeof: exemples/evaluation/long_return.c - -It will produce: - -codeof: tests/main_test/evaluation/T_long_return/expected.txt - -#### Evaluating Double - -codeof: exemples/evaluation/double_evaluation.c - - -It will produce: - -codeof: tests/main_test/evaluation/T_double_evaluation/expected.txt - -#### Evaluating Bool - -codeof: exemples/evaluation/bool_evaluation.c - -It will produce: - -codeof: tests/main_test/evaluation/T_bool_evaluation/expected.txt - -### Timeout -You can set timeout to your functions, by using the timeout method: - - -codeof: exemples/evaluation/timeout.c - -It will produce: - -codeof: tests/main_test/evaluation/T_timeout/expected.txt - -### Memory usage -by using the method **set_memory_limit** you can control the max ram usage of lua, the default its 100mb -
NOTE THAT EXTRA MEMORY ALOCATED OUTSIDE CALLBACKS OR EVALUATIONS ARE CONSIDER UNPROTECTED GEHAVIOR -AND IT WILL KILL THE APPLICATION - -
- - - -codeof: exemples/evaluation/memory_usage.c - -It will produce: - -codeof: tests/main_test/evaluation/T_memory_usage/expected.txt - -### Callbacks -Callbacks i'ts a way to make c functions assesible in lua code, this it's the most basic callback: - -codeof: exemples/calbacks/basic_callback.c - -It will produce: - -codeof: tests/main_test/calbacks/T_basic_callback/expected.txt - - - -#### CallBack args -you can accept callback arguments into your function,check their types, and make operations with them. - -codeof: exemples/calbacks/args_retriving.c - -It will produce: - -codeof: tests/main_test/calbacks/T_args_retriving/expected.txt - -#### Index type -The lua native language index first elements in position 1, authogth LuaCEmbed use the C style for indexation, starting at -0, but these can be easly reverted with the int macro **LUA_CEMBED_INDEX_DIF** - -codeof: exemples/calbacks/args_retriving_balanced.c - - -It will produce: - -codeof: tests/main_test/calbacks/T_args_retriving_balanced/expected.txt - - - -#### Creating a basic print function - -in these example, we are creating an 'print' function ,to allow print values - -codeof: exemples/calbacks/print_func.c - -It will produce: - -codeof: tests/main_test/calbacks/T_print_func/expected.txt - - -#### Evaluating arguments - -it's also possible to modify callbacks by lua code , by using the evaluation args mechanism. - -codeof: exemples/calbacks/evaluating_args.c - -It will produce: - -codeof: tests/main_test/calbacks/T_evaluating_args/expected.txt - -#### Calling args callback - -if you recive a lambda as argument , you can run the function with rguments and retriving its result - -codeof: exemples/calbacks/args_lambda.c - -It will produce: - -codeof: tests/main_test/calbacks/T_args_lambda/expected.txt - - -#### Table Arguments -you can control table arguments easly with the **get_table** method, where you can retrive a -**LuaCEmbedTable** object - - -codeof: exemples/calbacks/getting_table_args.c - -It will produce: - -codeof: tests/main_test/calbacks/T_getting_table_args/expected.txt - -### Callbacks Response - -You also can return values or errors, with the **response** methods - -#### Returning a Long - - -codeof: exemples/calbacks/return_long.c - -It will produce: - -codeof: tests/main_test/calbacks/T_return_long/expected.txt - -#### Returning a Double - - -codeof: exemples/calbacks/return_double.c - -It will produce: - -codeof: tests/main_test/calbacks/T_return_double/expected.txt - -#### Returning a String - - -codeof: exemples/calbacks/return_string.c - -It will produce: - -codeof: tests/main_test/calbacks/T_return_string/expected.txt - -#### Returning a Bool - - -codeof: exemples/calbacks/return_bool.c - -It will produce: - -codeof: tests/main_test/calbacks/T_return_bool/expected.txt - -#### Returning a Table - - -codeof: exemples/calbacks/return_table.c - -It will produce: - -codeof: tests/main_test/calbacks/T_return_table/expected.txt - - -#### Returning multi return - -You also can return multi values at once with the **return_multi_return** method - -codeof: exemples/calbacks/return_multi_return.c - - -It will produce: - -codeof: tests/main_test/calbacks/T_return_multi_return/expected.txt - -you can return multiple values using the multi return method - - -#### Returning a a Error -you can "raise" a error by returning a error in the function - -codeof: exemples/calbacks/return_error.c - -It will produce: - -codeof: tests/main_test/calbacks/T_return_error/expected.txt - -### Table Handling -you can easly handle tables, with the getters and setters methods - -#### Retriving table props - -codeof: exemples/table_handle/retriving_props.c - -It will produce: - -codeof: tests/main_test/table_handle/T_retriving_props/expected.txt - - -#### Retriving Sub Tables - - -codeof: exemples/table_handle/retriving_sub_table.c - -It will produce: - -codeof: tests/main_test/table_handle/S_retriving_sub_table/expected.txt - -#### Iterating over table - -codeof: exemples/table_handle/iterating_over_table.c - -It will produce: - -codeof: tests/main_test/table_handle/S_iterating_over_table/expected.txt - - -### Table setting -its possible to set values of table in a lot of different ways - -#### Seting basic Props -codeof: exemples/table_handle/setting_props.c - -It will produce: - -codeof: tests/main_test/table_handle/T_setting_props/expected.txt - - -#### Setting Methods -you also can set a method to a table, passing a callback function for it - -codeof: exemples/table_handle/setting_method.c - -It will produce: - -codeof: tests/main_test/table_handle/T_setting_method/expected.txt - -#### Setting Meta Methods -Meta methods like **__gc** or **__index** works fine tool - -codeof: exemples/table_handle/meta_method.c - -It will produce: - -codeof: tests/main_test/table_handle/T_meta_method/expected.txt - -### Full Object construction - -in these example we are creating a **full class ** of a person - -codeof: exemples/table_handle/full_person.c - -It will produce: - -codeof: tests/main_test/table_handle/T_full_person/expected.txt - -### Appending Props -you also can work with arrays , by using the **append** methods - -codeof: exemples/table_handle/appending_props.c - -It will produce: - -codeof: tests/main_test/table_handle/T_appending_props/expected.txt - -### Setting sub tables -sub tables can be constructed, setted and autocreated - -codeof: exemples/table_handle/setting_sub_table.c - -It will produce: - -codeof: tests/main_test/table_handle/T_setting_sub_table/expected.txt - - -### Globals -Glbals can be fully handled by the LuaCEmbed Api - -#### Retriving Globals - -#### Getting a global string - -codeof: exemples/globals/get_string_global.c - -It will produce: - -codeof: tests/main_test/globals/T_get_string_global/expected.txt - -#### Getting a global bool - -codeof: exemples/globals/get_bool_global.c - -It will produce: - - -codeof: tests/main_test/globals/T_get_bool_global/expected.txt - -#### Getting a double global - -codeof: exemples/globals/get_double_global.c - -It will produce: - -codeof: tests/main_test/globals/T_get_double_global/expected.txt - - -#### Getting a long global - -codeof: exemples/globals/get_long_global.c - -It will produce: - -codeof: tests/main_test/globals/T_get_long_global/expected.txt - -#### Getting a type global -codeof: exemples/globals/get_type.c - -It will produce: - -codeof: tests/main_test/globals/T_get_type/expected.txt -#### Getting a table -Tables are by default auto created, so yoou can just use the **get_table_auto_creating** method -codeof: exemples/globals/get_table_global.c -It will produce: - -codeof: tests/main_test/globals/T_get_table_global/expected.txt - -### Setting Globals - -Its also possible to set global variables - -#### Set Long -codeof: exemples/globals/set_long.c -It will produce - -codeof: tests/main_test/globals/T_set_long/expected.txt -#### Set Double -codeof: exemples/globals/set_double.c -It will produce - -codeof: tests/main_test/globals/T_set_double/expected.txt -#### Set string -codeof: exemples/globals/set_string.c - -It will produce - -codeof: tests/main_test/globals/T_set_string/expected.txt - -#### Set Bool -codeof: exemples/globals/set_bool.c - -It will produce - -codeof: tests/main_test/globals/T_set_bool/expected.txt - -#### New Table -its possible to create a new global table, the vallues will be automaticaly setted - - -#### Set Bool -codeof: exemples/globals/set_table.c - -It will produce - -codeof: tests/main_test/globals/T_set_table/expected.txt - - diff --git a/build/build/conf.h b/build/build/conf.h deleted file mode 100644 index 8d332a8..0000000 --- a/build/build/conf.h +++ /dev/null @@ -1,8 +0,0 @@ -const char * LUA_FOLDER = "lua"; -const char *OUTPUT = "c/lua_code.h"; -const char *LUA_VAR_NAME = "lua_code"; -const char *LUA_START_POINT = "main.lua"; -const char *FINAL_OUPTUT_LINUX = "final.out"; -const char *FINAL_OUPTUT_WINDOWS = "final.exe"; -bool ALLOW_DEBUG = false; -const char *DEBUG_LUA = "debug.lua"; \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/CTextArray/CTextArray.c b/build/build/dependencies/CTextEngine/CTextArray/CTextArray.c deleted file mode 100644 index 1118ec0..0000000 --- a/build/build/dependencies/CTextEngine/CTextArray/CTextArray.c +++ /dev/null @@ -1,121 +0,0 @@ - -CTextArray * newCTextArray(){ - CTextArray *self = (CTextArray*) malloc(sizeof (CTextArray)); - self->size = 0; - self->stacks = (CTextStack**) malloc(0); - return self; -} - -void CTextArray_append(CTextArray *self,CTextStack *element){ - self->stacks = (CTextStack**) realloc( - self->stacks, - (self->size+1)* sizeof (CTextStack*) - ); - - self->stacks[self->size] = element; - self->size+=1; -} - - - -void CTextArray_append_string(CTextArray *self,const char *element){ - CTextStack *new_element = newCTextStack_string(element); - CTextArray_append(self,new_element); -} - -CTextStack * CTextArray_join(CTextArray *self,const char *separator){ - CTextStack *result = newCTextStack_string_empty(); - for(int i = 0; i < self->size; i++){ - if(i < self->size -1){ - CTextStack_format(result,"%t%s",self->stacks[i],separator); - } - else{ - CTextStack_format(result,"%t",self->stacks[i]); - - } - - } - return result; -} - -CTextArray *CTextArray_split(const char *element,const char *target){ - CTextArray *self = newCTextArray(); - CTextStack *text = newCTextStack_string(element); - long target_size = (long)strlen(target); - CTextStack *acumulated = newCTextStack_string_empty(); - - for(int i = 0; i size; i++){ - CTextStack *possible_division = CTextStack_substr(text,i,target_size + i); - if(CTextStack_equal(possible_division,target)){ - CTextArray_append(self,acumulated); - acumulated = newCTextStack_string_empty(); - CTextStack_free(possible_division); - continue; - } - CTextStack_free(possible_division); - - CTextStack_format(acumulated,"%c",text->rendered_text[i]); - } - - CTextArray_append(self,acumulated); - CTextStack_free(text); - return self; -} - -bool CTextStack_equal(struct CTextStack *self,const char *element){ - return strcmp(self->rendered_text,element) == 0; -} - - -void CTextArray_free(CTextArray *self){ - for(int i = 0; i < self->size; i++){ - CTextStack_free(self->stacks[i]); - } - free(self->stacks); - free(self); -} - -CTextArray * CTextArray_map(CTextArray *self, CTextStack *(caller)(CTextStack* element)){ - CTextArray *new_array = newCTextArray(); - for(int i = 0; i < self->size; i++){ - CTextStack *result = caller(self->stacks[i]); - CTextArray_append(new_array,result); - } - return new_array; -} - - -CTextArray * CTextArray_filter(CTextArray *self, bool (caller)(CTextStack* element)){ - CTextArray *new_array = newCTextArray(); - - for(int i = 0; i < self->size; i++){ - if(caller(self->stacks[i])){ - - CTextArray_append(new_array, CTextStack_clone(self->stacks[i])); - } - } - - return new_array; -} - -void CTextArray_foreach(CTextArray *self, void (*caller)(CTextStack* element)){ - for(int i = 0; i < self->size; i++){ - caller(self->stacks[i]); - } -} - -bool CTextArray_includes(CTextArray *self,const char *element){ - for(int i = 0 ; i < self->size;i++){ - if(CTextStack_equal(self->stacks[i],element)){ - return true; - } - } - return false; -} - - -void CTextArray_represent(CTextArray *self){ - for(int i =0; i < self->size; i++){ - CTextStack_represent(self->stacks[i]); - } -} \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/CTextArray/CTextArray.h b/build/build/dependencies/CTextEngine/CTextArray/CTextArray.h deleted file mode 100644 index b4501f3..0000000 --- a/build/build/dependencies/CTextEngine/CTextArray/CTextArray.h +++ /dev/null @@ -1,33 +0,0 @@ - - -typedef struct CTextArray{ - - CTextStack **stacks; - long size; - - -}CTextArray; - -CTextArray * newCTextArray(); - - -void CTextArray_append(CTextArray *self,CTextStack *element); - - -void CTextArray_append_string(CTextArray *self,const char *element); - -CTextStack * CTextArray_join(CTextArray *self,const char *separator); - -CTextArray * CTextArray_split(const char *element,const char *target); - -CTextArray * CTextArray_map(CTextArray *self, CTextStack *(caller)(CTextStack* element)); - -CTextArray * CTextArray_filter(CTextArray *self, bool (caller)(CTextStack* element)); - -void CTextArray_foreach(CTextArray *self, void (*caller)(CTextStack* element)); - -bool CTextArray_includes(CTextArray *self,const char *element); - -void CTextArray_free(CTextArray *self); - -void CTextArray_represent(CTextArray *self); diff --git a/build/build/dependencies/CTextEngine/CTextEngineMain.h b/build/build/dependencies/CTextEngine/CTextEngineMain.h deleted file mode 100644 index e947931..0000000 --- a/build/build/dependencies/CTextEngine/CTextEngineMain.h +++ /dev/null @@ -1,30 +0,0 @@ -/* -MIT License - -Copyright (c) 2023 OUI - -Permission is hereby granted, free of charge, to any person obtaining a copy -of this software and associated documentation files (the "Software"), to deal -in the Software without restriction, including without limitation the rights -to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -copies of the Software, and to permit persons to whom the Software is -furnished to do so, subject to the following conditions: - -The above copyright notice and this permission notice shall be included in all -copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE -SOFTWARE. -*/ -#ifndef CTEXTENGINE_H -#define CTEXTENGINE_H - -#include "declaration.h" -#include "definition.h" - -#endif // CTEXTENGINE_H \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/CTextNamespace/CTexStackModule/CTextStackModule.c b/build/build/dependencies/CTextEngine/CTextNamespace/CTexStackModule/CTextStackModule.c deleted file mode 100644 index 7b74815..0000000 --- a/build/build/dependencies/CTextEngine/CTextNamespace/CTexStackModule/CTextStackModule.c +++ /dev/null @@ -1,76 +0,0 @@ - -CTextStackModule newCTextStackModule(){ - struct CTextStackModule self = {0}; - self.newStack = newCTextStack; - self.newStack_string = newCTextStack_string; - self.newStack_string_format = newCTextStack_string_format; - self.newStack_string_empty = newCTextStack_string_empty; - self.newStack_string_getting_ownership = newCTextStack_string_getting_ownership; - self.text = CTextStack_text; - self.segment_text = CTextStack_segment_text; - self.format = CTextStack_format; - self.segment = CTextStack_segment; - self.segment_format = CTextStack_segment_format; - self.$open = CTextStack_$open; - self.only$open =CTextStack_only$open; - self.auto$close = CTextStack_auto$close; - self.open = ctext_open; - self.close = ctext_close; - self.free = CTextStack_free; - self.clone = CTextStack_clone; - self.represent = CTextStack_represent; - self.self_transform_in_string_and_self_clear = CTextStack_self_transform_in_string_and_self_clear; - self.restart = CTextStack_restart; - self.substr = CTextStack_substr; - self.self_substr =CTextStack_self_substr; - - self.pop = CTextStack_pop; - self.self_pop =CTextStack_self_pop; - - self.replace = CTextStack_replace; - self.self_replace = CTextStack_self_replace; - - self.replace_long = CTextStack_replace_long; - self.self_replace_long =CTextStack_self_replace_long; - - - self.replace_double = CTextStack_replace_double; - self.self_replace_double =CTextStack_self_replace_double; - - self.insert_at = CTextStack_insert_at; - self.self_insert_at = CTextStack_self_insert_at; - - - self.index_of = CTextStack_index_of; - self.index_of_char = CTextStack_index_of_char; - - self.lower = CTextStack_lower; - self.self_lower = CTextStack_self_lower; - - self.upper = CTextStack_upper; - self.self_upper = CTextStack_self_upper; - - self.captalize = CTextStack_captalize; - self.self_captalize = CTextStack_self_captalize; - - self.starts_with = CTextStack_starts_with; - self.ends_with = CTextStack_ends_with; - - self.equal = CTextStack_equal; - self.reverse = CTextStack_reverse; - self.self_reverse = CTextStack_self_reverse; - - - self.typeof_element = CTextStack_typeof; - self.is_a_num = CTextStack_is_a_num; - self.typeof_in_str = CTextStack_typeof_in_str; - self.parse_to_bool = CTextStack_parse_to_bool; - self.parse_to_integer = CTextStack_parse_to_integer; - self.parse_to_double = CTextStack_parse_to_double; - - self.trim = CTextStack_trim; - self.self_trim = CTextStack_self_trim; - - - return self; -} \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/CTextNamespace/CTexStackModule/CTextStackModule.h b/build/build/dependencies/CTextEngine/CTextNamespace/CTexStackModule/CTextStackModule.h deleted file mode 100644 index 5515c17..0000000 --- a/build/build/dependencies/CTextEngine/CTextNamespace/CTexStackModule/CTextStackModule.h +++ /dev/null @@ -1,97 +0,0 @@ - - -typedef struct CTextStackModule{ - - //admnistrative methods - CTextStack *(*newStack)(const char *line_breaker, const char *separator); - CTextStack *(*newStack_string)(const char *starter); - CTextStack *(*newStack_string_format)(const char *format, ...); - - CTextStack *(*newStack_string_getting_ownership)(const char *starter); - CTextStack *(*newStack_string_empty)(); - - void (*free)(struct CTextStack *self); - struct CTextStack *(*clone)(struct CTextStack *self); - void (*represent)(struct CTextStack *self); - char *(*self_transform_in_string_and_self_clear)(struct CTextStack *self); - void (*restart)(struct CTextStack *self); - - //render methods - void (*text)(struct CTextStack *self, const char *element); - - void (*segment_text)(struct CTextStack *self, const char *element); - - void (*format)(struct CTextStack *self, const char *format, ...); - - void (*segment)(struct CTextStack *self); - - void (*segment_format)(struct CTextStack *self, const char *format, ...); - - void (*$open)(struct CTextStack *self, const char *tag, const char *format,...); - - void (*only$open)(struct CTextStack *self, const char *tag, const char *format,...); - - void (*auto$close)(struct CTextStack *self, const char *tag, const char *format,...); - - void (*open)(struct CTextStack *self, const char *tag); - - void (*close)(struct CTextStack *self, const char *tag); - - - //algorithm methods - struct CTextStack * (*substr)(struct CTextStack *self, long starter, long end); - void (*self_substr)(struct CTextStack *self, long starter, long end); - - - struct CTextStack *(*pop)(struct CTextStack *self, long starter, long end); - void(*self_pop)(struct CTextStack *self, long starter, long end); - - - - struct CTextStack *(*insert_at)(struct CTextStack *self,long point, const char *element); - void (*self_insert_at)(struct CTextStack *self,long point, const char *element); - - struct CTextStack *(*replace)(struct CTextStack *self,const char *element, const char *element_to_replace); - void (*self_replace)(struct CTextStack *self,const char *element, const char *element_to_replace); - - - struct CTextStack *(*replace_long)(struct CTextStack *self,const char *element, long element_to_replace); - void(*self_replace_long)(struct CTextStack *self,const char *element, long element_to_replace); - - - struct CTextStack *(*replace_double)(struct CTextStack *self,const char *element, double element_to_replace); - void (*self_replace_double)(struct CTextStack *self,const char *element, double element_to_replace); - - - struct CTextStack * (*lower)(struct CTextStack *self); - void(*self_lower)(struct CTextStack *self); - - struct CTextStack * (*upper)(struct CTextStack *self); - void(*self_upper)(struct CTextStack *self); - - struct CTextStack *(*captalize)(struct CTextStack *self); - void (*self_captalize)(struct CTextStack *self); - - struct CTextStack * (*reverse)(struct CTextStack *self); - void(*self_reverse)(struct CTextStack *self); - - struct CTextStack * (*trim)(struct CTextStack *self); - void(*self_trim)(struct CTextStack *self); - - bool (*starts_with)(struct CTextStack *self, const char *element); - bool (*ends_with)(struct CTextStack *self, const char *element); - - bool (*equal)(struct CTextStack *self,const char *element); - int (*typeof_element)(struct CTextStack *self); - bool (*is_a_num)(struct CTextStack *self); - - const char * (*typeof_in_str)(struct CTextStack *self); - bool (*parse_to_bool)(struct CTextStack *self); - long (*parse_to_integer)(struct CTextStack *self); - double (*parse_to_double)(struct CTextStack *self); - - long (*index_of)(struct CTextStack *self, const char *element); - long (*index_of_char)(struct CTextStack *self, char element); -}CTextStackModule; - -CTextStackModule newCTextStackModule(); \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/CTextNamespace/CTextArrayModule/CTextArrayModule.c b/build/build/dependencies/CTextEngine/CTextNamespace/CTextArrayModule/CTextArrayModule.c deleted file mode 100644 index 1b9fa32..0000000 --- a/build/build/dependencies/CTextEngine/CTextNamespace/CTextArrayModule/CTextArrayModule.c +++ /dev/null @@ -1,16 +0,0 @@ - - -CTextArrayModule newCTextArrayModule(){ - CTextArrayModule module = {0}; - module.newArray = newCTextArray; - module.append = CTextArray_append; - module.append_string = CTextArray_append_string; - module.join = CTextArray_join; - module.map = CTextArray_map; - module.filter = CTextArray_filter; - module.foreach = CTextArray_foreach; - module.represent = CTextArray_represent; - module.includes = CTextArray_includes; - module.free = CTextArray_free; - return module; -} diff --git a/build/build/dependencies/CTextEngine/CTextNamespace/CTextArrayModule/CTextArrayModule.h b/build/build/dependencies/CTextEngine/CTextNamespace/CTextArrayModule/CTextArrayModule.h deleted file mode 100644 index 1f91215..0000000 --- a/build/build/dependencies/CTextEngine/CTextNamespace/CTextArrayModule/CTextArrayModule.h +++ /dev/null @@ -1,17 +0,0 @@ - -typedef struct CTextArrayModule{ - CTextArray *(*newArray)(); - void (*append)(CTextArray *self,CTextStack *element); - void (*append_string)(CTextArray *self,const char *element); - CTextStack * (*join)(CTextArray *self,const char *separator); - - CTextArray * (*map)(CTextArray *self, CTextStack *(caller)(CTextStack* element)); - CTextArray * (*filter)(CTextArray *self, bool (caller)(CTextStack* element)); - void (*foreach)(CTextArray *self, void (*caller)(CTextStack* element)); - bool (*includes)(CTextArray *self,const char *element); - void (*represent)(CTextArray *self); - void (*free)(CTextArray *self); - -}CTextArrayModule; - -CTextArrayModule newCTextArrayModule(); \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/CTextNamespace/CTextNamespace/CTextNamespace.c b/build/build/dependencies/CTextEngine/CTextNamespace/CTextNamespace/CTextNamespace.c deleted file mode 100644 index 0446825..0000000 --- a/build/build/dependencies/CTextEngine/CTextNamespace/CTextNamespace/CTextNamespace.c +++ /dev/null @@ -1,8 +0,0 @@ - - -CTextNamespace newCTextNamespace(){ - CTextNamespace self = {0}; - self.stack = newCTextStackModule(); - self.array = newCTextArrayModule(); - return self; -} \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/CTextNamespace/CTextNamespace/CTextNamespace.h b/build/build/dependencies/CTextEngine/CTextNamespace/CTextNamespace/CTextNamespace.h deleted file mode 100644 index 35aabac..0000000 --- a/build/build/dependencies/CTextEngine/CTextNamespace/CTextNamespace/CTextNamespace.h +++ /dev/null @@ -1,10 +0,0 @@ - - -typedef struct CTextNamespace{ - - CTextArrayModule array; - CTextStackModule stack; - -}CTextNamespace; - -CTextNamespace newCTextNamespace(); \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/CTextNamespace/declaration.h b/build/build/dependencies/CTextEngine/CTextNamespace/declaration.h deleted file mode 100644 index a2f9865..0000000 --- a/build/build/dependencies/CTextEngine/CTextNamespace/declaration.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "CTexStackModule/CTextStackModule.h" -#include "CTextArrayModule/CTextArrayModule.h" -#include "CTextNamespace/CTextNamespace.h" \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/CTextNamespace/definition.h b/build/build/dependencies/CTextEngine/CTextNamespace/definition.h deleted file mode 100644 index bd58174..0000000 --- a/build/build/dependencies/CTextEngine/CTextNamespace/definition.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "CTexStackModule/CTextStackModule.c" -#include "CTextArrayModule/CTextArrayModule.c" -#include "CTextNamespace/CTextNamespace.c" \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/CTextStack/CTextStack.h b/build/build/dependencies/CTextEngine/CTextStack/CTextStack.h deleted file mode 100644 index 09f623c..0000000 --- a/build/build/dependencies/CTextEngine/CTextStack/CTextStack.h +++ /dev/null @@ -1,143 +0,0 @@ - - -#define CTEXT_LINE_BREAKER "\n" -#define CTEXT_SEPARATOR " " - -#define CTEXT_LONG 1 -#define CTEXT_DOUBLE 2 -#define CTEXT_BOOL 3 -#define CTEXT_STRING 4 - -typedef struct CTextStack{ - - char *rendered_text; - size_t rendered_text_alocation_size; - size_t size; - - char *line_breaker; - char *separator; - int ident_level; - -}CTextStack; - -struct CTextStack *newCTextStack(const char *line_breaker, const char *separator); - - -struct CTextStack *newCTextStack_string(const char *starter); - -struct CTextStack *newCTextStack_string_format(const char *format, ...); - -struct CTextStack *newCTextStack_string_getting_ownership(const char *starter); - -struct CTextStack *newCTextStack_string_empty(); - - -void CTextStack_text(struct CTextStack *self, const char *text); - - -void private_ctext_text_double_size_if_reachs(struct CTextStack *self); - - -void CTextStack_segment_text(struct CTextStack *self, const char *text); - - -void CTextStack_segment(struct CTextStack *self); - - -void CTextStack_$open(struct CTextStack *self, const char *tag, const char *format, ...); - - - -void CTextStack_only$open(struct CTextStack *self, const char *tag, const char *format, ...); - - -void CTextStack_auto$close(struct CTextStack *self, const char *tag, const char *format, ...); - - -void CTextStack_format(struct CTextStack *self, const char *format, ...); - - -void CTextStack_segment_format(struct CTextStack *self, const char *format, ...); - - -void ctext_open(struct CTextStack *self, const char *tag); - - - -void ctext_close(struct CTextStack *self, const char *tag); - -void CTextStack_represent(struct CTextStack *self); -void CTextStack_free(struct CTextStack *self); - - -struct CTextStack * CTextStack_clone(struct CTextStack *self); - - -char * CTextStack_self_transform_in_string_and_self_clear(struct CTextStack *self); - -void private_CTextStack_parse_ownership(struct CTextStack *self, struct CTextStack *new_string); - - -void CTextStack_restart(struct CTextStack *self); - - -//algorithm methods - -struct CTextStack *CTextStack_substr(struct CTextStack *self, long starter, long end); -void CTextStack_self_substr(struct CTextStack *self, long starter, long end); - - -struct CTextStack *CTextStack_pop(struct CTextStack *self, long starter, long end); -void CTextStack_self_pop(struct CTextStack *self, long starter, long end); - - -struct CTextStack *CTextStack_replace(struct CTextStack *self,const char *element, const char *element_to_replace); -void CTextStack_self_replace(struct CTextStack *self,const char *element, const char *element_to_replace); - - -struct CTextStack *CTextStack_replace_long(struct CTextStack *self,const char *element, long element_to_replace); -void CTextStack_self_replace_long(struct CTextStack *self,const char *element, long element_to_replace); - -struct CTextStack *CTextStack_replace_double(struct CTextStack *self,const char *element, double element_to_replace); -void CTextStack_self_replace_double(struct CTextStack *self,const char *element, double element_to_replace); - - -struct CTextStack *CTextStack_insert_at(struct CTextStack *self,long point, const char *element); -void CTextStack_self_insert_at(struct CTextStack *self,long point, const char *element); - - -long CTextStack_index_of_char(struct CTextStack *self, char element); -long CTextStack_index_of(struct CTextStack *self, const char *element); - -bool CTextStack_starts_with(struct CTextStack *self, const char *element); -bool CTextStack_ends_with(struct CTextStack *self, const char *element); - -bool CTextStack_equal(struct CTextStack *self,const char *element); - -struct CTextStack *CTextStack_trim(struct CTextStack *self); -void CTextStack_self_trim(struct CTextStack *self); - -struct CTextStack *CTextStack_lower(struct CTextStack *self); -void CTextStack_self_lower(struct CTextStack *self); - -struct CTextStack *CTextStack_captalize(struct CTextStack *self); -void CTextStack_self_captalize(struct CTextStack *self); - -struct CTextStack *CTextStack_upper(struct CTextStack *self); -void CTextStack_self_upper(struct CTextStack *self); - -int CTextStack_typeof(struct CTextStack *self); - -bool CTextStack_is_a_num(struct CTextStack *self); - - -const char * CTextStack_typeof_in_str(struct CTextStack *self); -bool CTextStack_parse_to_bool(struct CTextStack *self); -long CTextStack_parse_to_integer(struct CTextStack *self); -double CTextStack_parse_to_double(struct CTextStack *self); - - -struct CTextStack *CTextStack_reverse(struct CTextStack *self); -void CTextStack_self_reverse(struct CTextStack *self); - - diff --git a/build/build/dependencies/CTextEngine/CTextStack/admnistrative_methods.c b/build/build/dependencies/CTextEngine/CTextStack/admnistrative_methods.c deleted file mode 100644 index e739e11..0000000 --- a/build/build/dependencies/CTextEngine/CTextStack/admnistrative_methods.c +++ /dev/null @@ -1,59 +0,0 @@ - - - - - - - -char * CTextStack_self_transform_in_string_and_self_clear(struct CTextStack *self){ - free(self->line_breaker); - free(self->separator); - char *result = self->rendered_text; - free(self); - return result; -} - -void private_CTextStack_parse_ownership(struct CTextStack *self, struct CTextStack *new_stack){ - - free(self->line_breaker); - free(self->separator); - free(self->rendered_text); - - self->rendered_text_alocation_size = new_stack->rendered_text_alocation_size; - self->size = new_stack->size; - self->ident_level = new_stack->ident_level; - - - self->line_breaker = new_stack->line_breaker; - self->separator = new_stack->separator; - self->rendered_text = new_stack->rendered_text; - free(new_stack); - -} -void CTextStack_restart(struct CTextStack *self){ - free(self->rendered_text); - self->rendered_text = (char*)malloc(2); - strcpy(self->rendered_text,"\0"); - self->rendered_text_alocation_size = 2; - self->size = 0; - self->ident_level = 0; -} - -void CTextStack_represent(struct CTextStack *self){ - printf("%s\n",self->rendered_text); -} - - -void CTextStack_free(struct CTextStack *self){ - free(self->line_breaker); - free(self->separator); - free(self->rendered_text); - free(self); -} - -struct CTextStack * CTextStack_clone(struct CTextStack *self){ - CTextStack *new_stack = newCTextStack(self->line_breaker,self->separator); - new_stack->ident_level = self->ident_level; - CTextStack_text(new_stack,self->rendered_text); - return new_stack; -} \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/CTextStack/algo_methods.c b/build/build/dependencies/CTextEngine/CTextStack/algo_methods.c deleted file mode 100644 index af647b8..0000000 --- a/build/build/dependencies/CTextEngine/CTextStack/algo_methods.c +++ /dev/null @@ -1,295 +0,0 @@ - - - -struct CTextStack * CTextStack_substr(struct CTextStack *self, long starter, long end){ - - CTextStack *new_element = newCTextStack(self->line_breaker,self->separator); - new_element->ident_level = self->ident_level; - long formated_starter = private_CText_transform_index(self->size, starter); - long formated_end = private_CText_transform_index(self->size, end); - - if(formated_starter == formated_end){ - CTextStack_format(new_element,"%c",self->rendered_text[formated_starter]); - return new_element; - } - - for(long i =formated_starter; i < formated_end; i++){ - CTextStack_format(new_element,"%c",self->rendered_text[i]); - } - - return new_element; - -} - -void CTextStack_self_substr(struct CTextStack *self, long starter, long end){ - CTextStack *new_stack = CTextStack_substr(self,starter,end); - private_CTextStack_parse_ownership(self,new_stack); - -} - - -struct CTextStack *CTextStack_replace(struct CTextStack *self,const char *element, const char *element_to_replace){ - - CTextStack *new_element = newCTextStack(self->line_breaker,self->separator); - new_element->ident_level = self->ident_level; - - long element_size = (long)strlen(element); - for(long i = 0; i < self->size;i++){ - CTextStack *possible_ocurrence = CTextStack_substr(self,i,i+element_size); - - if(strcmp(possible_ocurrence->rendered_text,element)== 0){ - CTextStack_text(new_element,element_to_replace); - i+=element_size -1; - } - - else{ - CTextStack_format(new_element,"%c",self->rendered_text[i]); - } - - CTextStack_free(possible_ocurrence); - - } - return new_element; -} - -void CTextStack_self_replace(struct CTextStack *self,const char *element, const char *element_to_replace){ - CTextStack *new_stack = CTextStack_replace(self,element,element_to_replace); - private_CTextStack_parse_ownership(self,new_stack); -} - - -struct CTextStack *CTextStack_replace_long(struct CTextStack *self,const char *element, long element_to_replace){ - char num_conversion[20] = {0}; - sprintf(num_conversion,"%ld",element_to_replace); - return CTextStack_replace(self,element,num_conversion); -} - - -void CTextStack_self_replace_long(struct CTextStack *self,const char *element, long element_to_replace){ - CTextStack *new_stack = CTextStack_replace_long(self,element,element_to_replace); - private_CTextStack_parse_ownership(self,new_stack); -} - - -struct CTextStack *CTextStack_replace_double(struct CTextStack *self,const char *element, double element_to_replace){ - CTextStack *num_formated = newCTextStack_string_empty(); - CTextStack_format(num_formated,"%f",element_to_replace); - CTextStack *result = CTextStack_replace(self,element,num_formated->rendered_text); - CTextStack_free(num_formated); - return result; -} - - -void CTextStack_self_replace_double(struct CTextStack *self,const char *element, double element_to_replace){ - CTextStack *new_stack = CTextStack_replace_double(self,element,element_to_replace); - private_CTextStack_parse_ownership(self,new_stack); -} - - - -long CTextStack_index_of(struct CTextStack *self, const char *element){ - long element_size = (long)strlen(element); - for(int i = 0; i < self->size; i++){ - CTextStack *possible_element = CTextStack_substr(self,i,i+element_size); - if(strcmp(possible_element->rendered_text,element) == 0){ - CTextStack_free(possible_element); - return i; - } - CTextStack_free(possible_element); - - } - return -1; -} - - -long CTextStack_index_of_char(struct CTextStack *self, char element){ - for(int i = 0; i < self->size; i++) { - if(self->rendered_text[i] == element){ - return i; - } - } - return -1; -} -bool CTextStack_starts_with(struct CTextStack *self, const char *element){ - long element_size = strlen(element); - CTextStack *separated = CTextStack_substr(self,0,element_size); - if(strcmp(separated->rendered_text,element) == 0){ - CTextStack_free(separated); - return true; - } - CTextStack_free(separated); - return false; -} - -bool CTextStack_ends_with(struct CTextStack *self, const char *element){ - long element_size = strlen(element); - CTextStack *separated = CTextStack_substr(self,self->size -element_size,-1); - - if(strcmp(separated->rendered_text,element) == 0){ - CTextStack_free(separated); - return true; - } - CTextStack_free(separated); - return false; -} - - - -struct CTextStack *CTextStack_lower(struct CTextStack *self){ - CTextStack *new_element = newCTextStack(self->line_breaker,self->separator); - new_element->ident_level = self->ident_level; - for(long i =0; i < self->size; i++){ - char current = self->rendered_text[i]; - CTextStack_format(new_element,"%c",tolower(current)); - } - return new_element; -} - -void CTextStack_self_lower(struct CTextStack *self){ - CTextStack *new_stack = CTextStack_lower(self); - private_CTextStack_parse_ownership(self,new_stack); -} - -struct CTextStack *CTextStack_upper(struct CTextStack *self){ - CTextStack *new_element = newCTextStack(self->line_breaker,self->separator); - new_element->ident_level = self->ident_level; - for(long i =0; i < self->size; i++){ - char current = self->rendered_text[i]; - CTextStack_format(new_element,"%c",toupper(current)); - } - return new_element; -} - -struct CTextStack *CTextStack_captalize(struct CTextStack *self){ - CTextStack *new_element = newCTextStack(self->line_breaker,self->separator); - new_element->ident_level = self->ident_level; - if(self->size ==0){ - return new_element; - } - - CTextStack_format(new_element,"%c", toupper(self->rendered_text[0])); - - for(long i =1; i < self->size; i++){ - char last = self->rendered_text[i-1]; - char current = self->rendered_text[i]; - - - if(last == ' '){ - CTextStack_format(new_element,"%c",toupper(current)); - } - else{ - CTextStack_format(new_element,"%c", tolower(current)); - - } - - } - return new_element; -} - -void CTextStack_self_captalize(struct CTextStack *self){ - CTextStack *new_stack = CTextStack_captalize(self); - private_CTextStack_parse_ownership(self,new_stack); -} - - -void CTextStack_self_upper(struct CTextStack *self){ - CTextStack *new_stack = CTextStack_upper(self); - private_CTextStack_parse_ownership(self,new_stack); -} - - -struct CTextStack *CTextStack_reverse(struct CTextStack *self){ - CTextStack *new_element = newCTextStack(self->line_breaker,self->separator); - new_element->ident_level = self->ident_level; - for(long i = (long)self->size; i >= 0 ; i--){ - CTextStack_format(new_element,"%c",self->rendered_text[i]); - } - return new_element; - -} - -void CTextStack_self_reverse(struct CTextStack *self){ - CTextStack *new_stack = CTextStack_reverse(self); - private_CTextStack_parse_ownership(self,new_stack); -} - - - -struct CTextStack *CTextStack_pop(struct CTextStack *self, long starter, long end){ - CTextStack *new_element = newCTextStack(self->line_breaker,self->separator); - new_element->ident_level = self->ident_level; - long formated_starter = private_CText_transform_index(self->size, starter); - long formated_end = private_CText_transform_index(self->size, end); - - for(int i =0; i < self->size; i ++){ - if(i >= formated_starter && i <= formated_end){ - continue; - } - CTextStack_format(new_element,"%c",self->rendered_text[i]); - } - return new_element; -} - - -void CTextStack_self_pop(struct CTextStack *self, long starter, long end){ - CTextStack *new_stack = CTextStack_pop(self, starter, end); - private_CTextStack_parse_ownership(self,new_stack); -} - - -struct CTextStack *CTextStack_insert_at(struct CTextStack *self,long point, const char *element){ - - CTextStack *new_element = newCTextStack(self->line_breaker,self->separator); - new_element->ident_level = self->ident_level; - - long converted_point = private_CText_transform_index(self->size, point); - for(long i = 0; i < converted_point; i++){ - CTextStack_format(new_element,"%c",self->rendered_text[i]); - } - CTextStack_text(new_element,element); - for(long i = converted_point; i < self->size; i++){ - CTextStack_format(new_element,"%c",self->rendered_text[i]); - } - return new_element; -} - -void CTextStack_self_insert_at(struct CTextStack *self,long point, const char *element){ - CTextStack *new_stack = CTextStack_insert_at(self, point,element); - private_CTextStack_parse_ownership(self,new_stack); -} - - -struct CTextStack *CTextStack_trim(struct CTextStack *self){ - - CTextStack *invalid_elements = newCTextStack_string("\t\r\n "); - long start_point = 0; - for(int i = 0; i < self->size; i ++){ - char current_char =self->rendered_text[i]; - long invalid_point = CTextStack_index_of_char(invalid_elements, current_char); - bool is_invalid = invalid_point != -1; - if(!is_invalid){ - start_point = i; - break; - } - } - long end_point = -1; - for(long i = (long)self->size -1; i >= 0; i--){ - - char current_char =self->rendered_text[i]; - long invalid_point = CTextStack_index_of_char(invalid_elements, current_char); - bool is_invalid = invalid_point != -1; - if(!is_invalid){ - end_point = i+1; - break; - } - } - CTextStack_free(invalid_elements); - return CTextStack_substr(self,start_point,end_point); - -} - - -void CTextStack_self_trim(struct CTextStack *self){ - CTextStack *new_stack = CTextStack_trim(self); - private_CTextStack_parse_ownership(self,new_stack); -} \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/CTextStack/constructors.c b/build/build/dependencies/CTextEngine/CTextStack/constructors.c deleted file mode 100644 index 965026a..0000000 --- a/build/build/dependencies/CTextEngine/CTextStack/constructors.c +++ /dev/null @@ -1,46 +0,0 @@ -// -// Created by jurandi on 14-06-2023. -// -struct CTextStack * newCTextStack(const char *line_breaker, const char *separator){ - struct CTextStack *self = (struct CTextStack*)malloc(sizeof(struct CTextStack)); - *self = (CTextStack){0}; - self->rendered_text = (char*)malloc(2); - strcpy(self->rendered_text,"\0"); - self->rendered_text_alocation_size = 2; - - self->line_breaker = strdup(line_breaker); - self->separator = strdup(separator); - - - return self; -} - -struct CTextStack *newCTextStack_string(const char *starter){ - CTextStack *self = newCTextStack("",""); - if(starter){ - CTextStack_format(self,"%s", starter); - } - return self; -} - -struct CTextStack *newCTextStack_string_format(const char *format, ...){ - CTextStack *self = newCTextStack("",""); - va_list argptr; - va_start(argptr, format); - private_ctext_generate_formated_text(self,format,argptr); - va_end(argptr); - - return self; -} - -struct CTextStack *newCTextStack_string_getting_ownership(const char *starter){ - CTextStack *self = newCTextStack("",""); - free(self->rendered_text); - self->rendered_text = (char*)starter; - self->size = strlen(starter); - self->rendered_text_alocation_size = self->size; - return self; -} -struct CTextStack *newCTextStack_string_empty(){ - return newCTextStack("",""); -} \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/CTextStack/parsers.c b/build/build/dependencies/CTextEngine/CTextStack/parsers.c deleted file mode 100644 index 751938c..0000000 --- a/build/build/dependencies/CTextEngine/CTextStack/parsers.c +++ /dev/null @@ -1,79 +0,0 @@ - -int CTextStack_typeof(struct CTextStack *self){ - if(self->size == 0){ - return CTEXT_STRING; - } - - if(CTextStack_equal(self,"true") ||CTextStack_equal(self,"false") ){ - return CTEXT_BOOL; - } - - double data; - int result = sscanf(self->rendered_text,"%lf",&data); - if(!result){ - return CTEXT_STRING; - } - if(CTextStack_index_of(self,".") == -1){ - return CTEXT_LONG; - } - return CTEXT_DOUBLE; - - -} -bool CTextStack_is_a_num(struct CTextStack *self){ - int type = CTextStack_typeof(self); - if(type == CTEXT_DOUBLE || type == CTEXT_LONG){ - return true; - } - return false; -} - - -const char * CTextStack_typeof_in_str(struct CTextStack *self){ - int current_type = CTextStack_typeof(self); - - if(current_type == CTEXT_BOOL){ - return "bool"; - } - - else if(current_type == CTEXT_STRING){ - return "string"; - } - - else if(current_type == CTEXT_LONG){ - return "long"; - } - - else if(current_type == CTEXT_DOUBLE){ - return "double"; - } - - else{ - return "invalid"; - } -} - -bool CTextStack_parse_to_bool(struct CTextStack *self){ - if(CTextStack_equal(self,"true")){ - return true; - } - return false; -} - -long CTextStack_parse_to_integer(struct CTextStack *self){ - long value; - int result = sscanf(self->rendered_text,"%ld",&value); - if(!result){ - return -1; - } - return value; -} - -double CTextStack_parse_to_double(struct CTextStack *self){ - double value; - int result = sscanf(self->rendered_text,"%lf",&value); - if(!result){ - return -1; - } - return value; -} diff --git a/build/build/dependencies/CTextEngine/CTextStack/render_methods.c b/build/build/dependencies/CTextEngine/CTextStack/render_methods.c deleted file mode 100644 index 706df51..0000000 --- a/build/build/dependencies/CTextEngine/CTextStack/render_methods.c +++ /dev/null @@ -1,160 +0,0 @@ - -void private_ctext_text_double_size_if_reachs(struct CTextStack *self){ - - while(self->size >= (self->rendered_text_alocation_size - 2)){ - self->rendered_text_alocation_size = (self->rendered_text_alocation_size * 2)+2; - self->rendered_text = (char*)(realloc( - self->rendered_text,self->rendered_text_alocation_size - )); - } -} - -void CTextStack_text(struct CTextStack *self, const char *text){ - - if (!text || !text[0]) { - // Tratar caso de ponteiro nulo ou string vazia - return; - } - - size_t text_size = strlen(text); - - self->size += text_size; - private_ctext_text_double_size_if_reachs(self); - - memcpy( - self->rendered_text + self->size - text_size, - text, - text_size - ); - self->rendered_text[self->size] = '\0'; -} - - - -void CTextStack_segment_text(struct CTextStack *self, const char *text){ - CTextStack_segment(self); - CTextStack_text(self,text); -} - - -void CTextStack_format(struct CTextStack *self, const char *format, ...){ - va_list argptr; - va_start(argptr, format); - private_ctext_generate_formated_text(self,format,argptr); - va_end(argptr); - -} - -void CTextStack_segment_format(struct CTextStack *self, const char *format, ...){ - CTextStack_segment(self); - va_list argptr; - va_start(argptr, format); - private_ctext_generate_formated_text(self,format,argptr); - va_end(argptr); - -} - - -void CTextStack_segment(struct CTextStack *self){ - - CTextStack_text(self,self->line_breaker); - - for(int i=0;iident_level;i++){ - CTextStack_text(self,self->separator); - - } - - -} - -void CTextStack_$open(struct CTextStack *self, const char *tag, const char *format, ...){ - CTextStack_segment(self); - CTextStack_format(self, "%c",'<'); - CTextStack_text(self,tag); - - - if(format!=NULL){ - CTextStack_format(self, "%c",' '); - - va_list argptr; - va_start(argptr, format); - private_ctext_generate_formated_text(self,format,argptr); - va_end(argptr); - - } - CTextStack_format(self, "%c",'>'); - - - self->ident_level += 1; -} - - - -void CTextStack_only$open(struct CTextStack *self, const char *tag, const char *format, ...){ - CTextStack_segment(self); - CTextStack_format(self, "%c",'<'); - - CTextStack_text(self,tag); - - - if(format!=NULL){ - CTextStack_format(self, "%c",' '); - va_list argptr; - va_start(argptr, format); - private_ctext_generate_formated_text(self,format,argptr); - va_end(argptr); - - } - CTextStack_format(self, "%c",'>'); - - -} - -void CTextStack_auto$close(struct CTextStack *self, const char *tag, const char *format, ...){ - CTextStack_segment(self); - CTextStack_format(self, "%c",'<'); - - CTextStack_text(self,tag); - - - if(format!=NULL){ - CTextStack_format(self, "%c",' '); - - va_list argptr; - va_start(argptr, format); - private_ctext_generate_formated_text(self,format,argptr); - va_end(argptr); - } - CTextStack_text(self,"/>"); - -} - -void ctext_open(struct CTextStack *self, const char *tag){ - if(tag == NULL){ - - self->ident_level += 1; - return; - } - CTextStack_$open(self, tag, NULL); -} - - - -void ctext_close(struct CTextStack *self, const char *tag){ - - if(tag==NULL){ - self->ident_level -= 1; - - return; - } - self->ident_level -= 1; - CTextStack_segment(self); - - - CTextStack_text(self,"'); - -} - - diff --git a/build/build/dependencies/CTextEngine/constants.h b/build/build/dependencies/CTextEngine/constants.h deleted file mode 100644 index 6cc8c76..0000000 --- a/build/build/dependencies/CTextEngine/constants.h +++ /dev/null @@ -1,4 +0,0 @@ - -#define CTEXT_BY_OWNESHIP 1 -#define CTEXT_BY_COPY 2 -#define CTEXT_BY_REFERENCE 3 \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/declaration.h b/build/build/dependencies/CTextEngine/declaration.h deleted file mode 100644 index 0cd9201..0000000 --- a/build/build/dependencies/CTextEngine/declaration.h +++ /dev/null @@ -1,8 +0,0 @@ -#include "depencies.h" -#include "macros.h" -#include "constants.h" -#include "tags.h" -#include "CTextStack/CTextStack.h" -#include "extras/extras.h" -#include "CTextArray/CTextArray.h" -#include "CTextNamespace/declaration.h" \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/definition.h b/build/build/dependencies/CTextEngine/definition.h deleted file mode 100644 index 59a1880..0000000 --- a/build/build/dependencies/CTextEngine/definition.h +++ /dev/null @@ -1,11 +0,0 @@ - -#include "CTextStack/admnistrative_methods.c" -#include "CTextStack/algo_methods.c" -#include "CTextStack/constructors.c" -#include "CTextStack/parsers.c" -#include "CTextStack/render_methods.c" - - -#include "extras/extras.c" -#include "CTextArray/CTextArray.c" -#include "CTextNamespace/definition.h" diff --git a/build/build/dependencies/CTextEngine/depencies.h b/build/build/dependencies/CTextEngine/depencies.h deleted file mode 100644 index e6b0e61..0000000 --- a/build/build/dependencies/CTextEngine/depencies.h +++ /dev/null @@ -1,7 +0,0 @@ -#include -#include -#include -#include -#include -#include - diff --git a/build/build/dependencies/CTextEngine/extras/extras.c b/build/build/dependencies/CTextEngine/extras/extras.c deleted file mode 100644 index 50c40d4..0000000 --- a/build/build/dependencies/CTextEngine/extras/extras.c +++ /dev/null @@ -1,182 +0,0 @@ - -void private_ctext_generate_formated_text( - struct CTextStack *stack,const char *format,va_list argptr){ - long text_size = strlen(format); - - int i; - for(i =0;i < text_size -1 ;i++){ - - char single_test[3] = {format[i],format[i+1],'\0'}; - char double_test[4] = {0}; - - - if(i < text_size -2){ - strcpy(double_test,single_test); - double_test[2] = format[i+2]; - double_test[3] = '\0'; - - } - - if(strcmp(single_test,"%d") == 0 || strcmp(single_test,"%i") == 0) { - int value = va_arg(argptr,int); - char result[20] ={0}; - sprintf(result,"%d", value); - - - - CTextStack_text(stack,result); - - i+=1; - continue; - } - - else if(strcmp(double_test,"%ld") == 0 ) { - - int value = va_arg(argptr,int); - char result[20] ={0}; - sprintf(result,"%d", value); - - CTextStack_text(stack,result); - - i+=2; - continue; - } - - - else if(strcmp(single_test,"%f") == 0 ) { - char result_text[20]= {0}; - - sprintf(result_text,"%lf", va_arg(argptr,double )); - - for(int t = 18; t > 0; t--){ - char current_char = result_text[t]; - if(current_char != '0' && current_char != '\0'){ - - if(current_char == '.'){ - result_text[t+2] = '\0'; - } - else{ - result_text[t+1] = '\0'; - } - - break; - } - } - CTextStack_text(stack,result_text); - i+=1; - continue; - } - - else if(strcmp(double_test,"%lf") == 0 ) { - char result_text[20]= {0}; - - sprintf(result_text,"%lf", va_arg(argptr,double )); - - for(int t = 18; t > 0; t--){ - char current_char = result_text[t]; - if(current_char != '0' && current_char != '\0'){ - - if(current_char == '.'){ - result_text[t+2] = '\0'; - } - else{ - result_text[t+1] = '\0'; - } - - break; - } - } - CTextStack_text(stack,result_text); - i+=2; - continue; - } - else if(strcmp(single_test,"%c") == 0){ - char result = va_arg(argptr,int); - char element[2] = {result,'\0'}; - CTextStack_text(stack,element); - i+=1; - continue; - } - - - else if(strcmp(single_test,"%b") == 0){ - bool value = va_arg(argptr,int); - if(value){ - CTextStack_text(stack,"true"); - }else{ - CTextStack_text(stack,"false"); - } - i+=1; - continue; - } - - else if(strcmp(double_test,"%sc") == 0){ - char *value = va_arg(argptr,char*); - if(value){ - CTextStack_text(stack,value); - free(value); - } - i+=2; - continue; - } - - else if(strcmp(single_test,"%s") == 0){ - const char *value = va_arg(argptr,const char*); - if(value){ - CTextStack_text(stack,value); - } - - i+=1; - continue; - } - else if(strcmp(double_test,"%tc") == 0){ - struct CTextStack *new_stack = (struct CTextStack*)va_arg(argptr,void *); - if(new_stack){ - char *result = CTextStack_self_transform_in_string_and_self_clear(new_stack); - CTextStack_text(stack,result); - free(result); - } - i+=2; - continue; - } - - else if(strcmp(single_test,"%t") == 0){ - struct CTextStack *new_stack = (struct CTextStack*)va_arg(argptr,void *); - if(new_stack){ - CTextStack_text(stack,new_stack->rendered_text); - } - i+=1; - continue; - } - - char element[2] = {format[i],'\0'}; - CTextStack_text(stack,element); - - } - - - - if(text_size > 0 && text_size> i){ - char element[2] = {format[text_size-1],'\0'}; - CTextStack_text(stack,element); - } - - va_end(argptr); -} - - -long private_CText_transform_index(long size , long value){ - long formated_value = value; - - if(formated_value >= size){ - formated_value = size; - } - - if(formated_value < 0){ - formated_value = size + (formated_value +1); - } - if(formated_value <0){ - formated_value = 0; - } - return formated_value; -} \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/extras/extras.h b/build/build/dependencies/CTextEngine/extras/extras.h deleted file mode 100644 index 7651912..0000000 --- a/build/build/dependencies/CTextEngine/extras/extras.h +++ /dev/null @@ -1,10 +0,0 @@ - - -long private_CText_transform_index(long size, long value); - - -void private_ctext_generate_formated_text( - struct CTextStack *stack, - const char *format, - va_list argptr - ); \ No newline at end of file diff --git a/build/build/dependencies/CTextEngine/macros.h b/build/build/dependencies/CTextEngine/macros.h deleted file mode 100644 index e6a753f..0000000 --- a/build/build/dependencies/CTextEngine/macros.h +++ /dev/null @@ -1,8 +0,0 @@ - -#define CTextScope(s,t)\ -ctext_open(s, t);\ -for(int snaunduwwqwetjsdvda = 0; snaunduwwqwetjsdvda < 1; ctext_close(s, t), ++snaunduwwqwetjsdvda) - -#define CText$Scope(s,t, ...)\ -CTextStack_$open(s,t,__VA_ARGS__);\ -for(int snaunduwwqwetjsdvda = 0; snaunduwwqwetjsdvda < 1; ctext_close(s, t), ++snaunduwwqwetjsdvda) diff --git a/build/build/dependencies/CTextEngine/main b/build/build/dependencies/CTextEngine/main deleted file mode 100755 index a611fbd..0000000 Binary files a/build/build/dependencies/CTextEngine/main and /dev/null differ diff --git a/build/build/dependencies/CTextEngine/tags.h b/build/build/dependencies/CTextEngine/tags.h deleted file mode 100644 index 9653974..0000000 --- a/build/build/dependencies/CTextEngine/tags.h +++ /dev/null @@ -1,66 +0,0 @@ -// -// Created by jurandi on 18-04-2023. -// -#define CTEXT_HTML "html" -#define CTEXT_BODY "body" -#define CTEXT_DIV "div" -#define CTEXT_H1 "h1" -#define CTEXT_H2 "h2" -#define CTEXT_H3 "h3" -#define CTEXT_H4 "h4" -#define CTEXT_H5 "h5" -#define CTEXT_H6 "h6" -#define CTEXT_P "p" -#define CTEXT_SPAN "span" -#define CTEXT_A "a" -#define CTEXT_IMG "img" -#define CTEXT_INPUT "input" -#define CTEXT_BUTTON "button" -#define CTEXT_TABLE "table" -#define CTEXT_TR "tr" -#define CTEXT_TD "td" -#define TH "th" -#define CTEXT_THEAD "thead" -#define CTEXT_TBODY "tbody" -#define CTEXT_TFOOT "tfoot" -#define CTEXT_UL "ul" -#define CTEXT_LI "li" -#define CTEXT_OL "ol" -#define CTEXT_FORM "form" -#define CTEXT_LABEL "label" -#define CTEXT_SELECT "select" -#define CTEXT_OPTION "option" -#define CTEXT_TEXTAREA "textarea" -#define CTEXT_SCRIPT "script" -#define CTEXT_STYLE "style" -#define CTEXT_META "meta" -#define CTEXT_LINK "link" -#define CTEXT_HEAD "head" -#define CTEXT_BASE "base" -#define CTEXT_BR "br" -#define CTEXT_HR "hr" -#define CTEXT_TITLE "title" -#define CTEXT_IFRAME "iframe" -#define CTEXT_NAV "nav" -#define CTEXT_HEADER "header" -#define CTEXT_FOOTER "footer" -#define CTEXT_SECTION "section" -#define CTEXT_ARTICLE "article" -#define CTEXT_ASIDE "aside" -#define CTEXT_DETAILS "details" -#define CTEXT_SUMMARY "summary" -#define CTEXT_DIALOG "dialog" -#define MENU "menu" -#define MENUITEM "menuitem" -#define CTEXT_MAIN "main" -#define CTEXT_CANVAS "canvas" -#define CTEXT_AUDIO "audio" -#define CTEXT_VIDEO "video" -#define CTEXT_SOURCE "source" -#define CTEXT_TRACK "track" -#define CTEXT_EMBED "embed" -#define CTEXT_PARAM "param" - - - - diff --git a/build/build/dependencies/UniversalGarbage/declaration.h b/build/build/dependencies/UniversalGarbage/declaration.h deleted file mode 100644 index 5a17f4f..0000000 --- a/build/build/dependencies/UniversalGarbage/declaration.h +++ /dev/null @@ -1,11 +0,0 @@ - -#include -#include -#include -#include - - - -#include "macros.h" -#include "garbage_element/garbage_element.h" -#include "garbage/garbage.h" diff --git a/build/build/dependencies/UniversalGarbage/definition.h b/build/build/dependencies/UniversalGarbage/definition.h deleted file mode 100644 index 9e6b69e..0000000 --- a/build/build/dependencies/UniversalGarbage/definition.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "garbage_element/garbage_element.c" -#include "garbage/garbage.c" - diff --git a/build/build/dependencies/UniversalGarbage/garbage/garbage.c b/build/build/dependencies/UniversalGarbage/garbage/garbage.c deleted file mode 100644 index e1b471f..0000000 --- a/build/build/dependencies/UniversalGarbage/garbage/garbage.c +++ /dev/null @@ -1,178 +0,0 @@ -UniversalGarbage * private_new_MainUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->is_the_root = false; - return self; -} - -UniversalGarbage * newUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->is_the_root = true; - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->return_values =private_new_MainUniversalGarbage(); - - return self; -} - - - - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - - if(rawUniversalGarbage_reallocate(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - - privateUniversalGarbageElement *current = self->elements[i]; - bool reallocate = current->pointer == pointer; - - if(reallocate){ - current->pointed_value = *pointer; - return true; - } - } - return false; -} - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - if(rawUniversalGarbage_resset(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - bool resset = current->pointer == pointer; - if(resset){ - private_UniversalGarbageSimpleElement_free_pointed_value(current); - current->pointed_value = *pointer; - return true; - } - } - return false; - -} -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_remove(self->return_values,pointer)){ - *pointer = NULL; - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - private_UniversalGarbageSimpleElement_free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - - } - *pointer = NULL; - return true; - } - } - return false; -} -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_disconnect(self->return_values,pointer)){ - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - } - return true; - } - } - return false; - - - -} -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer){ - - if(!pointer){ - return false; - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - return false; - } - } - - self->elements = (privateUniversalGarbageElement**)realloc( - self->elements, - (self->elements_size + 1) * sizeof(privateUniversalGarbageElement*) - ); - void (*dealocator_callback)(void *element); -#ifdef __cplusplus - dealocator_callback =reinterpret_cast(release_callback); -#else - dealocator_callback = (void*)(void*)release_callback; - -#endif - - - - self->elements[self->elements_size] = private_newUniversalGarbageSimpleElement(dealocator_callback, pointer); - self->elements_size+=1; - return true; -} - - - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self){ - for(int i = 0; i < self->elements_size; i++){ - private_UniversalGarbageSimpleElement_free(self->elements[i]); - } - free(self->elements); -} - -void UniversalGarbage_free_including_return(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - if(self->is_the_root){ - UniversalGarbage_free(self->return_values); - } - free(self); -} - -void UniversalGarbage_free(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - - if(self->is_the_root){ - - UniversalGarbage *return_garbage = self->return_values; - for(int i = 0; i < return_garbage->elements_size; i++){ - free(return_garbage->elements[i]); - } - - free(return_garbage->elements); - free(return_garbage); - } - - - free(self); -} diff --git a/build/build/dependencies/UniversalGarbage/garbage/garbage.h b/build/build/dependencies/UniversalGarbage/garbage/garbage.h deleted file mode 100644 index ac61651..0000000 --- a/build/build/dependencies/UniversalGarbage/garbage/garbage.h +++ /dev/null @@ -1,32 +0,0 @@ - - -typedef struct UniversalGarbage{ - - struct UniversalGarbage *return_values; - privateUniversalGarbageElement **elements; - int elements_size; - bool is_the_root; - -}UniversalGarbage; - -UniversalGarbage * newUniversalGarbage(); - -UniversalGarbage * private_new_MainUniversalGarbage(); - - - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer); - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self); - -void UniversalGarbage_free_including_return(UniversalGarbage *self); - -void UniversalGarbage_free(UniversalGarbage *self); diff --git a/build/build/dependencies/UniversalGarbage/garbage_element/garbage_element.c b/build/build/dependencies/UniversalGarbage/garbage_element/garbage_element.c deleted file mode 100644 index e5ebd57..0000000 --- a/build/build/dependencies/UniversalGarbage/garbage_element/garbage_element.c +++ /dev/null @@ -1,25 +0,0 @@ - - - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer){ - - privateUniversalGarbageElement * self = UniversalGarbage_create_empty_struct( - self, - privateUniversalGarbageElement - ); - self->pointer = pointer; - self->deallocator_callback = dealocator_callback; - self->pointed_value = *pointer; - return self; -} -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self){ - if(self->pointed_value){ - self->deallocator_callback(self->pointed_value); - self->pointed_value = NULL; - } -} - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self){ - private_UniversalGarbageSimpleElement_free_pointed_value(self); - free(self); -} diff --git a/build/build/dependencies/UniversalGarbage/garbage_element/garbage_element.h b/build/build/dependencies/UniversalGarbage/garbage_element/garbage_element.h deleted file mode 100644 index 6a21fc5..0000000 --- a/build/build/dependencies/UniversalGarbage/garbage_element/garbage_element.h +++ /dev/null @@ -1,15 +0,0 @@ - - - -typedef struct privateUniversalGarbageElement{ - void **pointer; - void (*deallocator_callback)(void *element); - void *pointed_value; -}privateUniversalGarbageElement; - -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self); - - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self); - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer); \ No newline at end of file diff --git a/build/build/dependencies/UniversalGarbage/macros.h b/build/build/dependencies/UniversalGarbage/macros.h deleted file mode 100644 index 7996a6f..0000000 --- a/build/build/dependencies/UniversalGarbage/macros.h +++ /dev/null @@ -1,42 +0,0 @@ - -#define UniversalGarbage_create_empty_struct(name,element_type) \ -(element_type*)malloc(sizeof(element_type)); \ -*name = (element_type){0}; - - -#define UniversalGarbage_cast(value) ((void**)&value) - - -#define UniversalGarbage_add(garbage,deallocator_callback,value) \ - rawUniversalGarbage_add(garbage,(void*)deallocator_callback,UniversalGarbage_cast(value)) - -#define UniversalGarbage_add_simple(garbage,value) \ - UniversalGarbage_add(garbage,free,value) - - -#define UniversalGarbage_add_return(garbage,deallocator_callback,value) \ - UniversalGarbage_add(garbage->return_values,deallocator_callback,value) - - -#define UniversalGarbage_add_simple_return(garbage,value) \ - UniversalGarbage_add_simple(garbage->return_values,value) - - - -#define UniversalGarbage_remove(garbage,value) \ - rawUniversalGarbage_remove(garbage,UniversalGarbage_cast(value)); - - -#define UniversalGarbage_disconnect(garbage,value) \ - rawUniversalGarbage_disconnect(garbage,UniversalGarbage_cast(value)); - - - - -#define UniversalGarbage_reallocate(garbage,value) \ - rawUniversalGarbage_reallocate(garbage,UniversalGarbage_cast(value)) - - -#define UniversalGarbage_resset(garbage,value) \ - rawUniversalGarbage_resset(garbage,UniversalGarbage_cast(value)) - diff --git a/build/build/dependencies/UniversalGarbage/one.h b/build/build/dependencies/UniversalGarbage/one.h deleted file mode 100644 index 4197457..0000000 --- a/build/build/dependencies/UniversalGarbage/one.h +++ /dev/null @@ -1,8 +0,0 @@ - - -#ifndef UNIVERSAL_GARBAGE_H -#include "declaration.h" -#include "definition.h" - -#define UNIVERSAL_GARBAGE_H -#endif \ No newline at end of file diff --git a/build/build/dependencies/all.h b/build/build/dependencies/all.h deleted file mode 100644 index 1b8c0a9..0000000 --- a/build/build/dependencies/all.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "doTheWorld/one.c" -#include "CTextEngine/CTextEngineMain.h" -#include "UniversalGarbage/one.h" \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/base64/base64.c b/build/build/dependencies/doTheWorld/base64/base64.c deleted file mode 100644 index 5a4386d..0000000 --- a/build/build/dependencies/doTheWorld/base64/base64.c +++ /dev/null @@ -1,78 +0,0 @@ - - -char *dtw_base64_encode(unsigned char *data, long input_length){ - if (data == NULL) return NULL; - - size_t output_length = 4 * ((input_length + 2) / 3); - - char *encoded_data = (char *)malloc(output_length + 1); - - - long i, j; - for (i = 0, j = 0; i < input_length; ) { - unsigned char b0 = i < input_length ? data[i++] : 0; - unsigned char b1 = i < input_length ? data[i++] : 0; - unsigned char b2 = i < input_length ? data[i++] : 0; - - unsigned char b = b0 >> 2; - encoded_data[j++] = dtw_base64_table[b]; - - b = (b0 << 4) & 0x3F; - b |= b1 >> 4; - encoded_data[j++] = dtw_base64_table[b]; - - b = (b1 << 2) & 0x3F; - b |= b2 >> 6; - encoded_data[j++] = i <= input_length + 1 ? dtw_base64_table[b] : '='; - - b = b2 & 0x3F; - encoded_data[j++] = i <= input_length ? dtw_base64_table[b] : '='; - } - - encoded_data[j] = '\0'; - return encoded_data; -} - - -unsigned char *dtw_base64_decode(const char *data, long *output_length){ - long input_length = (long)strlen(data); - if (input_length % 4 != 0) return NULL; - - *output_length = input_length / 4 * 3; - if (data[input_length - 1] == '=') (*output_length)--; - if (data[input_length - 2] == '=') (*output_length)--; - - unsigned char *decoded_data = (unsigned char*) malloc(*output_length +2); - - - long i, j; - for (i = 0, j = 0; i < input_length; ) { - unsigned char b0 = data[i] == '=' ? 0 & i++ : strchr(dtw_base64_table, data[i++]) - dtw_base64_table; - unsigned char b1 = data[i] == '=' ? 0 & i++ : strchr(dtw_base64_table, data[i++]) - dtw_base64_table; - unsigned char b2 = data[i] == '=' ? 0 & i++ : strchr(dtw_base64_table, data[i++]) - dtw_base64_table; - unsigned char b3 = data[i] == '=' ? 0 & i++ : strchr(dtw_base64_table, data[i++]) - dtw_base64_table; - - unsigned char b = (b0 << 2) | (b1 >> 4); - decoded_data[j++] = b; - - if (j < *output_length) { - b = (b1 << 4) | (b2 >> 2); - decoded_data[j++] = b; - } - if (j < *output_length) { - b = (b2 << 6) | b3; - decoded_data[j++] = b; - } - } - decoded_data[*output_length] = '\0'; - - return decoded_data; -} - -char *dtw_convert_binary_file_to_base64(const char *path){ - long size; - unsigned char *data = dtw_load_binary_content(path, &size); - char *b64 = dtw_base64_encode(data, size); - free(data); - return b64; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/base64/base64.h b/build/build/dependencies/doTheWorld/base64/base64.h deleted file mode 100644 index 0c411d8..0000000 --- a/build/build/dependencies/doTheWorld/base64/base64.h +++ /dev/null @@ -1,9 +0,0 @@ - - -char *dtw_base64_encode(unsigned char *data, long input_length); - - -unsigned char *dtw_base64_decode(const char *data, long *output_length); - - -char *dtw_convert_binary_file_to_base64(const char *path); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/declaration.h b/build/build/dependencies/doTheWorld/declaration.h deleted file mode 100644 index a34594e..0000000 --- a/build/build/dependencies/doTheWorld/declaration.h +++ /dev/null @@ -1,62 +0,0 @@ - - - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -#include -#include -#include - - - -#ifdef __linux__ -#include - #include - #include -#elif _WIN32 - #include - #include - #include - #include - #include -#endif - -#ifndef cJSON__h -#include "dependencies/cJSON/cJSON.h" -#undef cJSON__h -#endif //cJSON__h - -#ifndef SHA_256_H -#include "dependencies/sha256/sha-256.h" -#undef SHA_256_H -#endif //SHA_256_H - -#include "string_array/string_array.h" - -#include "base64/base64.h" -#include "randonizer/randonizer.h" -#include "extras/extras.h" -#include "string_functions/string_functions.h" -#include "io/io.h" -#include "numeral_io/numeral_io.h" -#include "listage_wrappers/listage_wrappers.h" -#include "monodimension_listage/monodimension_listage.h" -#include "multidimension_listage/multidimension_listage.h" -#include "path/path.h" -#include "tree/declarations.h" - -#include "lockers/declaration.h" - -#include "transaction/declaration.h" -#include "resource/declaration.h" -#include "hash/hash.h" -#include "namespace/declaration.h" diff --git a/build/build/dependencies/doTheWorld/definition.h b/build/build/dependencies/doTheWorld/definition.h deleted file mode 100644 index 52f4fe2..0000000 --- a/build/build/dependencies/doTheWorld/definition.h +++ /dev/null @@ -1,49 +0,0 @@ - -#ifndef cJSON__h -#define cJSON__h -#include "dependencies/cJSON/cJSON.c" -#endif //cJSON__h - -#undef true -#define true 1 - -#undef false -#define false 0 - - -#ifndef SHA_256_H -#define SHA_256_H -#include "dependencies/sha256/sha-256.c" -#endif //SHA_256_H - - - -#include "base64/base64.c" -#include "randonizer/randonizer.c" -#include "extras/extras.c" -#include "string_functions/string_functions.c" -#include "io/io.c" -#include "numeral_io/numeral_io.c" -#include "listage_wrappers/listage_wrappers.c" -#include "monodimension_listage/monodimension_listage_linux.c" -#include "monodimension_listage/monodimension_listage_win32.c" -#include "multidimension_listage/multidimension_listage.c" -#include "path/path.c" -#include "path/setters.c" -#include "path/getters.c" -#include "path/index_dirs.c" -#include "string_array/string_array.c" -#include "tree/definitions.h" - -#include "lockers/definition.h" - -#include "resource/definition.h" -#include "transaction/definition.h" -#include "hash/hash.c" -#include "namespace/definition.h" - - - - - - diff --git a/build/build/dependencies/doTheWorld/dependencies/cJSON/cJSON.c b/build/build/dependencies/doTheWorld/dependencies/cJSON/cJSON.c deleted file mode 100644 index 3d75ac1..0000000 --- a/build/build/dependencies/doTheWorld/dependencies/cJSON/cJSON.c +++ /dev/null @@ -1,3118 +0,0 @@ -/* - Copyright (c) 2009-2017 Dave Gamble and cJSON contributors - - Permission is hereby granted, free of charge, to any person obtaining a copy - of this software and associated documentation files (the "Software"), to deal - in the Software without restriction, including without limitation the rights - to use, copy, modify, merge, publish, distribute, sublicense, and/or sell - copies of the Software, and to permit persons to whom the Software is - furnished to do so, subject to the following conditions: - - The above copyright notice and this permission notice shall be included in - all copies or substantial portions of the Software. - - THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR - IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, - FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE - AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER - LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, - OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN - THE SOFTWARE. -*/ - -/* cJSON */ -/* JSON parser in C. */ - -/* disable warnings about old C89 functions in MSVC */ -#if !defined(_CRT_SECURE_NO_DEPRECATE) && defined(_MSC_VER) -#define _CRT_SECURE_NO_DEPRECATE -#endif - -#ifdef __GNUC__ -#pragma GCC visibility push(default) -#endif -#if defined(_MSC_VER) -#pragma warning (push) -/* disable warning about single line comments in system headers */ -#pragma warning (disable : 4001) -#endif - -#include -#include -#include -#include -#include -#include -#include - -#ifdef ENABLE_LOCALES -#include -#endif - -#if defined(_MSC_VER) -#pragma warning (pop) -#endif -#ifdef __GNUC__ -#pragma GCC visibility pop -#endif - - -/* define our own boolean type */ -#ifdef true -#undef true -#endif -#define true ((cJSON_bool)1) - -#ifdef false -#undef false -#endif -#define false ((cJSON_bool)0) - -/* define isnan and isinf for ANSI C, if in C99 or above, isnan and isinf has been defined in math.h */ -#ifndef isinf -#define isinf(d) (isnan((d - d)) && !isnan(d)) -#endif -#ifndef isnan -#define isnan(d) (d != d) -#endif - -#ifndef NAN -#ifdef _WIN32 -#define NAN sqrt(-1.0) -#else -#define NAN 0.0/0.0 -#endif -#endif - -typedef struct { - const unsigned char *json; - size_t position; -} error; -static error global_error = { NULL, 0 }; - -CJSON_PUBLIC(const char *) cJSON_GetErrorPtr(void) -{ - return (const char*) (global_error.json + global_error.position); -} - -CJSON_PUBLIC(char *) cJSON_GetStringValue(const cJSON * const item) -{ - if (!cJSON_IsString(item)) - { - return NULL; - } - - return item->valuestring; -} - -CJSON_PUBLIC(double) cJSON_GetNumberValue(const cJSON * const item) -{ - if (!cJSON_IsNumber(item)) - { - return (double) NAN; - } - - return item->valuedouble; -} - -/* This is a safeguard to prevent copy-pasters from using incompatible C and header files */ -#if (CJSON_VERSION_MAJOR != 1) || (CJSON_VERSION_MINOR != 7) || (CJSON_VERSION_PATCH != 15) - #error cJSON.h and cJSON.c have different versions. Make sure that both have the same. -#endif - -CJSON_PUBLIC(const char*) cJSON_Version(void) -{ - static char version[15]; - sprintf(version, "%i.%i.%i", CJSON_VERSION_MAJOR, CJSON_VERSION_MINOR, CJSON_VERSION_PATCH); - - return version; -} - -/* Case insensitive string comparison, doesn't consider two NULL pointers equal though */ -static int case_insensitive_strcmp(const unsigned char *string1, const unsigned char *string2) -{ - if ((string1 == NULL) || (string2 == NULL)) - { - return 1; - } - - if (string1 == string2) - { - return 0; - } - - for(; tolower(*string1) == tolower(*string2); (void)string1++, string2++) - { - if (*string1 == '\0') - { - return 0; - } - } - - return tolower(*string1) - tolower(*string2); -} - -typedef struct internal_hooks -{ - void *(CJSON_CDECL *allocate)(size_t size); - void (CJSON_CDECL *deallocate)(void *pointer); - void *(CJSON_CDECL *reallocate)(void *pointer, size_t size); -} internal_hooks; - -#if defined(_MSC_VER) -/* work around MSVC error C2322: '...' address of dllimport '...' is not static */ -static void * CJSON_CDECL internal_malloc(size_t size) -{ - return malloc(size); -} -static void CJSON_CDECL internal_free(void *pointer) -{ - free(pointer); -} -static void * CJSON_CDECL internal_realloc(void *pointer, size_t size) -{ - return realloc(pointer, size); -} -#else -#define internal_malloc malloc -#define internal_free free -#define internal_realloc realloc -#endif - -/* strlen of character literals resolved at compile time */ -#define static_strlen(string_literal) (sizeof(string_literal) - sizeof("")) - -static internal_hooks global_hooks = { internal_malloc, internal_free, internal_realloc }; - -static unsigned char* cJSON_strdup(const unsigned char* string, const internal_hooks * const hooks) -{ - size_t length = 0; - unsigned char *copy = NULL; - - if (string == NULL) - { - return NULL; - } - - length = strlen((const char*)string) + sizeof(""); - copy = (unsigned char*)hooks->allocate(length); - if (copy == NULL) - { - return NULL; - } - memcpy(copy, string, length); - - return copy; -} - -CJSON_PUBLIC(void) cJSON_InitHooks(cJSON_Hooks* hooks) -{ - if (hooks == NULL) - { - /* Reset hooks */ - global_hooks.allocate = malloc; - global_hooks.deallocate = free; - global_hooks.reallocate = realloc; - return; - } - - global_hooks.allocate = malloc; - if (hooks->malloc_fn != NULL) - { - global_hooks.allocate = hooks->malloc_fn; - } - - global_hooks.deallocate = free; - if (hooks->free_fn != NULL) - { - global_hooks.deallocate = hooks->free_fn; - } - - /* use realloc only if both free and malloc are used */ - global_hooks.reallocate = NULL; - if ((global_hooks.allocate == malloc) && (global_hooks.deallocate == free)) - { - global_hooks.reallocate = realloc; - } -} - -/* Internal constructor. */ -static cJSON *cJSON_New_Item(const internal_hooks * const hooks) -{ - cJSON* node = (cJSON*)hooks->allocate(sizeof(cJSON)); - if (node) - { - memset(node, '\0', sizeof(cJSON)); - } - - return node; -} - -/* Delete a cJSON structure. */ -CJSON_PUBLIC(void) cJSON_Delete(cJSON *item) -{ - cJSON *next = NULL; - while (item != NULL) - { - next = item->next; - if (!(item->type & cJSON_IsReference) && (item->child != NULL)) - { - cJSON_Delete(item->child); - } - if (!(item->type & cJSON_IsReference) && (item->valuestring != NULL)) - { - global_hooks.deallocate(item->valuestring); - } - if (!(item->type & cJSON_StringIsConst) && (item->string != NULL)) - { - global_hooks.deallocate(item->string); - } - global_hooks.deallocate(item); - item = next; - } -} - -/* get the decimal point character of the current locale */ -static unsigned char get_decimal_point(void) -{ -#ifdef ENABLE_LOCALES - struct lconv *lconv = localeconv(); - return (unsigned char) lconv->decimal_point[0]; -#else - return '.'; -#endif -} - -typedef struct -{ - const unsigned char *content; - size_t length; - size_t offset; - size_t depth; /* How deeply nested (in arrays/objects) is the input at the current offset. */ - internal_hooks hooks; -} parse_buffer; - -/* check if the given size is left to read in a given parse buffer (starting with 1) */ -#define can_read(buffer, size) ((buffer != NULL) && (((buffer)->offset + size) <= (buffer)->length)) -/* check if the buffer can be accessed at the given index (starting with 0) */ -#define can_access_at_index(buffer, index) ((buffer != NULL) && (((buffer)->offset + index) < (buffer)->length)) -#define cannot_access_at_index(buffer, index) (!can_access_at_index(buffer, index)) -/* get a pointer to the buffer at the position */ -#define buffer_at_offset(buffer) ((buffer)->content + (buffer)->offset) - -/* Parse the input text to generate a number, and populate the result into item. */ -static cJSON_bool parse_number(cJSON * const item, parse_buffer * const input_buffer) -{ - double number = 0; - unsigned char *after_end = NULL; - unsigned char number_c_string[64]; - unsigned char decimal_point = get_decimal_point(); - size_t i = 0; - - if ((input_buffer == NULL) || (input_buffer->content == NULL)) - { - return false; - } - - /* copy the number into a temporary buffer and replace '.' with the decimal point - * of the current locale (for strtod) - * This also takes care of '\0' not necessarily being available for marking the end of the input */ - for (i = 0; (i < (sizeof(number_c_string) - 1)) && can_access_at_index(input_buffer, i); i++) - { - switch (buffer_at_offset(input_buffer)[i]) - { - case '0': - case '1': - case '2': - case '3': - case '4': - case '5': - case '6': - case '7': - case '8': - case '9': - case '+': - case '-': - case 'e': - case 'E': - number_c_string[i] = buffer_at_offset(input_buffer)[i]; - break; - - case '.': - number_c_string[i] = decimal_point; - break; - - default: - goto loop_end; - } - } -loop_end: - number_c_string[i] = '\0'; - - number = strtod((const char*)number_c_string, (char**)&after_end); - if (number_c_string == after_end) - { - return false; /* parse_error */ - } - - item->valuedouble = number; - - /* use saturation in case of overflow */ - if (number >= INT_MAX) - { - item->valueint = INT_MAX; - } - else if (number <= (double)INT_MIN) - { - item->valueint = INT_MIN; - } - else - { - item->valueint = (int)number; - } - - item->type = cJSON_Number; - - input_buffer->offset += (size_t)(after_end - number_c_string); - return true; -} - -/* don't ask me, but the original cJSON_SetNumberValue returns an integer or double */ -CJSON_PUBLIC(double) cJSON_SetNumberHelper(cJSON *object, double number) -{ - if (number >= INT_MAX) - { - object->valueint = INT_MAX; - } - else if (number <= (double)INT_MIN) - { - object->valueint = INT_MIN; - } - else - { - object->valueint = (int)number; - } - - return object->valuedouble = number; -} - -CJSON_PUBLIC(char*) cJSON_SetValuestring(cJSON *object, const char *valuestring) -{ - char *copy = NULL; - /* if object's type is not cJSON_String or is cJSON_IsReference, it should not set valuestring */ - if (!(object->type & cJSON_String) || (object->type & cJSON_IsReference)) - { - return NULL; - } - if (strlen(valuestring) <= strlen(object->valuestring)) - { - strcpy(object->valuestring, valuestring); - return object->valuestring; - } - copy = (char*) cJSON_strdup((const unsigned char*)valuestring, &global_hooks); - if (copy == NULL) - { - return NULL; - } - if (object->valuestring != NULL) - { - cJSON_free(object->valuestring); - } - object->valuestring = copy; - - return copy; -} - -typedef struct -{ - unsigned char *buffer; - size_t length; - size_t offset; - size_t depth; /* current nesting depth (for formatted printing) */ - cJSON_bool noalloc; - cJSON_bool format; /* is this print a formatted print */ - internal_hooks hooks; -} printbuffer; - -/* realloc printbuffer if necessary to have at least "needed" bytes more */ -static unsigned char* ensure(printbuffer * const p, size_t needed) -{ - unsigned char *newbuffer = NULL; - size_t newsize = 0; - - if ((p == NULL) || (p->buffer == NULL)) - { - return NULL; - } - - if ((p->length > 0) && (p->offset >= p->length)) - { - /* make sure that offset is valid */ - return NULL; - } - - if (needed > INT_MAX) - { - /* sizes bigger than INT_MAX are currently not supported */ - return NULL; - } - - needed += p->offset + 1; - if (needed <= p->length) - { - return p->buffer + p->offset; - } - - if (p->noalloc) { - return NULL; - } - - /* calculate new buffer size */ - if (needed > (INT_MAX / 2)) - { - /* overflow of int, use INT_MAX if possible */ - if (needed <= INT_MAX) - { - newsize = INT_MAX; - } - else - { - return NULL; - } - } - else - { - newsize = needed * 2; - } - - if (p->hooks.reallocate != NULL) - { - /* reallocate with realloc if available */ - newbuffer = (unsigned char*)p->hooks.reallocate(p->buffer, newsize); - if (newbuffer == NULL) - { - p->hooks.deallocate(p->buffer); - p->length = 0; - p->buffer = NULL; - - return NULL; - } - } - else - { - /* otherwise reallocate manually */ - newbuffer = (unsigned char*)p->hooks.allocate(newsize); - if (!newbuffer) - { - p->hooks.deallocate(p->buffer); - p->length = 0; - p->buffer = NULL; - - return NULL; - } - - memcpy(newbuffer, p->buffer, p->offset + 1); - p->hooks.deallocate(p->buffer); - } - p->length = newsize; - p->buffer = newbuffer; - - return newbuffer + p->offset; -} - -/* calculate the new length of the string in a printbuffer and update the offset */ -static void update_offset(printbuffer * const buffer) -{ - const unsigned char *buffer_pointer = NULL; - if ((buffer == NULL) || (buffer->buffer == NULL)) - { - return; - } - buffer_pointer = buffer->buffer + buffer->offset; - - buffer->offset += strlen((const char*)buffer_pointer); -} - -/* securely comparison of floating-point variables */ -static cJSON_bool compare_double(double a, double b) -{ - double maxVal = fabs(a) > fabs(b) ? fabs(a) : fabs(b); - return (fabs(a - b) <= maxVal * DBL_EPSILON); -} - -/* Render the number nicely from the given item into a string. */ -static cJSON_bool print_number(const cJSON * const item, printbuffer * const output_buffer) -{ - unsigned char *output_pointer = NULL; - double d = item->valuedouble; - int length = 0; - size_t i = 0; - unsigned char number_buffer[26] = {0}; /* temporary buffer to print the number into */ - unsigned char decimal_point = get_decimal_point(); - double test = 0.0; - - if (output_buffer == NULL) - { - return false; - } - - /* This checks for NaN and Infinity */ - if (isnan(d) || isinf(d)) - { - length = sprintf((char*)number_buffer, "null"); - } - else if(d == (double)item->valueint) - { - length = sprintf((char*)number_buffer, "%d", item->valueint); - } - else - { - /* Try 15 decimal places of precision to avoid nonsignificant nonzero digits */ - length = sprintf((char*)number_buffer, "%1.15g", d); - - /* Check whether the original double can be recovered */ - if ((sscanf((char*)number_buffer, "%lg", &test) != 1) || !compare_double((double)test, d)) - { - /* If not, print with 17 decimal places of precision */ - length = sprintf((char*)number_buffer, "%1.17g", d); - } - } - - /* sprintf failed or buffer overrun occurred */ - if ((length < 0) || (length > (int)(sizeof(number_buffer) - 1))) - { - return false; - } - - /* reserve appropriate space in the output */ - output_pointer = ensure(output_buffer, (size_t)length + sizeof("")); - if (output_pointer == NULL) - { - return false; - } - - /* copy the printed number to the output and replace locale - * dependent decimal point with '.' */ - for (i = 0; i < ((size_t)length); i++) - { - if (number_buffer[i] == decimal_point) - { - output_pointer[i] = '.'; - continue; - } - - output_pointer[i] = number_buffer[i]; - } - output_pointer[i] = '\0'; - - output_buffer->offset += (size_t)length; - - return true; -} - -/* parse 4 digit hexadecimal number */ -static unsigned parse_hex4(const unsigned char * const input) -{ - unsigned int h = 0; - size_t i = 0; - - for (i = 0; i < 4; i++) - { - /* parse digit */ - if ((input[i] >= '0') && (input[i] <= '9')) - { - h += (unsigned int) input[i] - '0'; - } - else if ((input[i] >= 'A') && (input[i] <= 'F')) - { - h += (unsigned int) 10 + input[i] - 'A'; - } - else if ((input[i] >= 'a') && (input[i] <= 'f')) - { - h += (unsigned int) 10 + input[i] - 'a'; - } - else /* invalid */ - { - return 0; - } - - if (i < 3) - { - /* shift left to make place for the next nibble */ - h = h << 4; - } - } - - return h; -} - -/* converts a UTF-16 literal to UTF-8 - * A literal can be one or two sequences of the form \uXXXX */ -static unsigned char utf16_literal_to_utf8(const unsigned char * const input_pointer, const unsigned char * const input_end, unsigned char **output_pointer) -{ - long unsigned int codepoint = 0; - unsigned int first_code = 0; - const unsigned char *first_sequence = input_pointer; - unsigned char utf8_length = 0; - unsigned char utf8_position = 0; - unsigned char sequence_length = 0; - unsigned char first_byte_mark = 0; - - if ((input_end - first_sequence) < 6) - { - /* input ends unexpectedly */ - goto fail; - } - - /* get the first utf16 sequence */ - first_code = parse_hex4(first_sequence + 2); - - /* check that the code is valid */ - if (((first_code >= 0xDC00) && (first_code <= 0xDFFF))) - { - goto fail; - } - - /* UTF16 surrogate pair */ - if ((first_code >= 0xD800) && (first_code <= 0xDBFF)) - { - const unsigned char *second_sequence = first_sequence + 6; - unsigned int second_code = 0; - sequence_length = 12; /* \uXXXX\uXXXX */ - - if ((input_end - second_sequence) < 6) - { - /* input ends unexpectedly */ - goto fail; - } - - if ((second_sequence[0] != '\\') || (second_sequence[1] != 'u')) - { - /* missing second half of the surrogate pair */ - goto fail; - } - - /* get the second utf16 sequence */ - second_code = parse_hex4(second_sequence + 2); - /* check that the code is valid */ - if ((second_code < 0xDC00) || (second_code > 0xDFFF)) - { - /* invalid second half of the surrogate pair */ - goto fail; - } - - - /* calculate the unicode codepoint from the surrogate pair */ - codepoint = 0x10000 + (((first_code & 0x3FF) << 10) | (second_code & 0x3FF)); - } - else - { - sequence_length = 6; /* \uXXXX */ - codepoint = first_code; - } - - /* encode as UTF-8 - * takes at maximum 4 bytes to encode: - * 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx */ - if (codepoint < 0x80) - { - /* normal ascii, encoding 0xxxxxxx */ - utf8_length = 1; - } - else if (codepoint < 0x800) - { - /* two bytes, encoding 110xxxxx 10xxxxxx */ - utf8_length = 2; - first_byte_mark = 0xC0; /* 11000000 */ - } - else if (codepoint < 0x10000) - { - /* three bytes, encoding 1110xxxx 10xxxxxx 10xxxxxx */ - utf8_length = 3; - first_byte_mark = 0xE0; /* 11100000 */ - } - else if (codepoint <= 0x10FFFF) - { - /* four bytes, encoding 1110xxxx 10xxxxxx 10xxxxxx 10xxxxxx */ - utf8_length = 4; - first_byte_mark = 0xF0; /* 11110000 */ - } - else - { - /* invalid unicode codepoint */ - goto fail; - } - - /* encode as utf8 */ - for (utf8_position = (unsigned char)(utf8_length - 1); utf8_position > 0; utf8_position--) - { - /* 10xxxxxx */ - (*output_pointer)[utf8_position] = (unsigned char)((codepoint | 0x80) & 0xBF); - codepoint >>= 6; - } - /* encode first byte */ - if (utf8_length > 1) - { - (*output_pointer)[0] = (unsigned char)((codepoint | first_byte_mark) & 0xFF); - } - else - { - (*output_pointer)[0] = (unsigned char)(codepoint & 0x7F); - } - - *output_pointer += utf8_length; - - return sequence_length; - -fail: - return 0; -} - -/* Parse the input text into an unescaped cinput, and populate item. */ -static cJSON_bool parse_string(cJSON * const item, parse_buffer * const input_buffer) -{ - const unsigned char *input_pointer = buffer_at_offset(input_buffer) + 1; - const unsigned char *input_end = buffer_at_offset(input_buffer) + 1; - unsigned char *output_pointer = NULL; - unsigned char *output = NULL; - - /* not a string */ - if (buffer_at_offset(input_buffer)[0] != '\"') - { - goto fail; - } - - { - /* calculate approximate size of the output (overestimate) */ - size_t allocation_length = 0; - size_t skipped_bytes = 0; - while (((size_t)(input_end - input_buffer->content) < input_buffer->length) && (*input_end != '\"')) - { - /* is escape sequence */ - if (input_end[0] == '\\') - { - if ((size_t)(input_end + 1 - input_buffer->content) >= input_buffer->length) - { - /* prevent buffer overflow when last input character is a backslash */ - goto fail; - } - skipped_bytes++; - input_end++; - } - input_end++; - } - if (((size_t)(input_end - input_buffer->content) >= input_buffer->length) || (*input_end != '\"')) - { - goto fail; /* string ended unexpectedly */ - } - - /* This is at most how much we need for the output */ - allocation_length = (size_t) (input_end - buffer_at_offset(input_buffer)) - skipped_bytes; - output = (unsigned char*)input_buffer->hooks.allocate(allocation_length + sizeof("")); - if (output == NULL) - { - goto fail; /* allocation failure */ - } - } - - output_pointer = output; - /* loop through the string literal */ - while (input_pointer < input_end) - { - if (*input_pointer != '\\') - { - *output_pointer++ = *input_pointer++; - } - /* escape sequence */ - else - { - unsigned char sequence_length = 2; - if ((input_end - input_pointer) < 1) - { - goto fail; - } - - switch (input_pointer[1]) - { - case 'b': - *output_pointer++ = '\b'; - break; - case 'f': - *output_pointer++ = '\f'; - break; - case 'n': - *output_pointer++ = '\n'; - break; - case 'r': - *output_pointer++ = '\r'; - break; - case 't': - *output_pointer++ = '\t'; - break; - case '\"': - case '\\': - case '/': - *output_pointer++ = input_pointer[1]; - break; - - /* UTF-16 literal */ - case 'u': - sequence_length = utf16_literal_to_utf8(input_pointer, input_end, &output_pointer); - if (sequence_length == 0) - { - /* failed to convert UTF16-literal to UTF-8 */ - goto fail; - } - break; - - default: - goto fail; - } - input_pointer += sequence_length; - } - } - - /* zero terminate the output */ - *output_pointer = '\0'; - - item->type = cJSON_String; - item->valuestring = (char*)output; - - input_buffer->offset = (size_t) (input_end - input_buffer->content); - input_buffer->offset++; - - return true; - -fail: - if (output != NULL) - { - input_buffer->hooks.deallocate(output); - } - - if (input_pointer != NULL) - { - input_buffer->offset = (size_t)(input_pointer - input_buffer->content); - } - - return false; -} - -/* Render the cstring provided to an escaped version that can be printed. */ -static cJSON_bool print_string_ptr(const unsigned char * const input, printbuffer * const output_buffer) -{ - const unsigned char *input_pointer = NULL; - unsigned char *output = NULL; - unsigned char *output_pointer = NULL; - size_t output_length = 0; - /* numbers of additional characters needed for escaping */ - size_t escape_characters = 0; - - if (output_buffer == NULL) - { - return false; - } - - /* empty string */ - if (input == NULL) - { - output = ensure(output_buffer, sizeof("\"\"")); - if (output == NULL) - { - return false; - } - strcpy((char*)output, "\"\""); - - return true; - } - - /* set "flag" to 1 if something needs to be escaped */ - for (input_pointer = input; *input_pointer; input_pointer++) - { - switch (*input_pointer) - { - case '\"': - case '\\': - case '\b': - case '\f': - case '\n': - case '\r': - case '\t': - /* one character escape sequence */ - escape_characters++; - break; - default: - if (*input_pointer < 32) - { - /* UTF-16 escape sequence uXXXX */ - escape_characters += 5; - } - break; - } - } - output_length = (size_t)(input_pointer - input) + escape_characters; - - output = ensure(output_buffer, output_length + sizeof("\"\"")); - if (output == NULL) - { - return false; - } - - /* no characters have to be escaped */ - if (escape_characters == 0) - { - output[0] = '\"'; - memcpy(output + 1, input, output_length); - output[output_length + 1] = '\"'; - output[output_length + 2] = '\0'; - - return true; - } - - output[0] = '\"'; - output_pointer = output + 1; - /* copy the string */ - for (input_pointer = input; *input_pointer != '\0'; (void)input_pointer++, output_pointer++) - { - if ((*input_pointer > 31) && (*input_pointer != '\"') && (*input_pointer != '\\')) - { - /* normal character, copy */ - *output_pointer = *input_pointer; - } - else - { - /* character needs to be escaped */ - *output_pointer++ = '\\'; - switch (*input_pointer) - { - case '\\': - *output_pointer = '\\'; - break; - case '\"': - *output_pointer = '\"'; - break; - case '\b': - *output_pointer = 'b'; - break; - case '\f': - *output_pointer = 'f'; - break; - case '\n': - *output_pointer = 'n'; - break; - case '\r': - *output_pointer = 'r'; - break; - case '\t': - *output_pointer = 't'; - break; - default: - /* escape and print as unicode codepoint */ - sprintf((char*)output_pointer, "u%04x", *input_pointer); - output_pointer += 4; - break; - } - } - } - output[output_length + 1] = '\"'; - output[output_length + 2] = '\0'; - - return true; -} - -/* Invoke print_string_ptr (which is useful) on an item. */ -static cJSON_bool print_string(const cJSON * const item, printbuffer * const p) -{ - return print_string_ptr((unsigned char*)item->valuestring, p); -} - -/* Predeclare these prototypes. */ -static cJSON_bool parse_value(cJSON * const item, parse_buffer * const input_buffer); -static cJSON_bool print_value(const cJSON * const item, printbuffer * const output_buffer); -static cJSON_bool parse_array(cJSON * const item, parse_buffer * const input_buffer); -static cJSON_bool print_array(const cJSON * const item, printbuffer * const output_buffer); -static cJSON_bool parse_object(cJSON * const item, parse_buffer * const input_buffer); -static cJSON_bool print_object(const cJSON * const item, printbuffer * const output_buffer); - -/* Utility to jump whitespace and cr/lf */ -static parse_buffer *buffer_skip_whitespace(parse_buffer * const buffer) -{ - if ((buffer == NULL) || (buffer->content == NULL)) - { - return NULL; - } - - if (cannot_access_at_index(buffer, 0)) - { - return buffer; - } - - while (can_access_at_index(buffer, 0) && (buffer_at_offset(buffer)[0] <= 32)) - { - buffer->offset++; - } - - if (buffer->offset == buffer->length) - { - buffer->offset--; - } - - return buffer; -} - -/* skip the UTF-8 BOM (byte order mark) if it is at the beginning of a buffer */ -static parse_buffer *skip_utf8_bom(parse_buffer * const buffer) -{ - if ((buffer == NULL) || (buffer->content == NULL) || (buffer->offset != 0)) - { - return NULL; - } - - if (can_access_at_index(buffer, 4) && (strncmp((const char*)buffer_at_offset(buffer), "\xEF\xBB\xBF", 3) == 0)) - { - buffer->offset += 3; - } - - return buffer; -} - -CJSON_PUBLIC(cJSON *) cJSON_ParseWithOpts(const char *value, const char **return_parse_end, cJSON_bool require_null_terminated) -{ - size_t buffer_length; - - if (NULL == value) - { - return NULL; - } - - /* Adding null character size due to require_null_terminated. */ - buffer_length = strlen(value) + sizeof(""); - - return cJSON_ParseWithLengthOpts(value, buffer_length, return_parse_end, require_null_terminated); -} - -/* Parse an object - create a new root, and populate. */ -CJSON_PUBLIC(cJSON *) cJSON_ParseWithLengthOpts(const char *value, size_t buffer_length, const char **return_parse_end, cJSON_bool require_null_terminated) -{ - parse_buffer buffer = { 0, 0, 0, 0, { 0, 0, 0 } }; - cJSON *item = NULL; - - /* reset error position */ - global_error.json = NULL; - global_error.position = 0; - - if (value == NULL || 0 == buffer_length) - { - goto fail; - } - - buffer.content = (const unsigned char*)value; - buffer.length = buffer_length; - buffer.offset = 0; - buffer.hooks = global_hooks; - - item = cJSON_New_Item(&global_hooks); - if (item == NULL) /* memory fail */ - { - goto fail; - } - - if (!parse_value(item, buffer_skip_whitespace(skip_utf8_bom(&buffer)))) - { - /* parse failure. ep is set. */ - goto fail; - } - - /* if we require null-terminated JSON without appended garbage, skip and then check for a null terminator */ - if (require_null_terminated) - { - buffer_skip_whitespace(&buffer); - if ((buffer.offset >= buffer.length) || buffer_at_offset(&buffer)[0] != '\0') - { - goto fail; - } - } - if (return_parse_end) - { - *return_parse_end = (const char*)buffer_at_offset(&buffer); - } - - return item; - -fail: - if (item != NULL) - { - cJSON_Delete(item); - } - - if (value != NULL) - { - error local_error; - local_error.json = (const unsigned char*)value; - local_error.position = 0; - - if (buffer.offset < buffer.length) - { - local_error.position = buffer.offset; - } - else if (buffer.length > 0) - { - local_error.position = buffer.length - 1; - } - - if (return_parse_end != NULL) - { - *return_parse_end = (const char*)local_error.json + local_error.position; - } - - global_error = local_error; - } - - return NULL; -} - -/* Default options for cJSON_Parse */ -CJSON_PUBLIC(cJSON *) cJSON_Parse(const char *value) -{ - return cJSON_ParseWithOpts(value, 0, 0); -} - -CJSON_PUBLIC(cJSON *) cJSON_ParseWithLength(const char *value, size_t buffer_length) -{ - return cJSON_ParseWithLengthOpts(value, buffer_length, 0, 0); -} - -#define cjson_min(a, b) (((a) < (b)) ? (a) : (b)) - -static unsigned char *print(const cJSON * const item, cJSON_bool format, const internal_hooks * const hooks) -{ - static const size_t default_buffer_size = 256; - printbuffer buffer[1]; - unsigned char *printed = NULL; - - memset(buffer, 0, sizeof(buffer)); - - /* create buffer */ - buffer->buffer = (unsigned char*) hooks->allocate(default_buffer_size); - buffer->length = default_buffer_size; - buffer->format = format; - buffer->hooks = *hooks; - if (buffer->buffer == NULL) - { - goto fail; - } - - /* print the value */ - if (!print_value(item, buffer)) - { - goto fail; - } - update_offset(buffer); - - /* check if reallocate is available */ - if (hooks->reallocate != NULL) - { - printed = (unsigned char*) hooks->reallocate(buffer->buffer, buffer->offset + 1); - if (printed == NULL) { - goto fail; - } - buffer->buffer = NULL; - } - else /* otherwise copy the JSON over to a new buffer */ - { - printed = (unsigned char*) hooks->allocate(buffer->offset + 1); - if (printed == NULL) - { - goto fail; - } - memcpy(printed, buffer->buffer, cjson_min(buffer->length, buffer->offset + 1)); - printed[buffer->offset] = '\0'; /* just to be sure */ - - /* free the buffer */ - hooks->deallocate(buffer->buffer); - } - - return printed; - -fail: - if (buffer->buffer != NULL) - { - hooks->deallocate(buffer->buffer); - } - - if (printed != NULL) - { - hooks->deallocate(printed); - } - - return NULL; -} - -/* Render a cJSON item/entity/structure to text. */ -CJSON_PUBLIC(char *) cJSON_Print(const cJSON *item) -{ - return (char*)print(item, true, &global_hooks); -} - -CJSON_PUBLIC(char *) cJSON_PrintUnformatted(const cJSON *item) -{ - return (char*)print(item, false, &global_hooks); -} - -CJSON_PUBLIC(char *) cJSON_PrintBuffered(const cJSON *item, int prebuffer, cJSON_bool fmt) -{ - printbuffer p = { 0, 0, 0, 0, 0, 0, { 0, 0, 0 } }; - - if (prebuffer < 0) - { - return NULL; - } - - p.buffer = (unsigned char*)global_hooks.allocate((size_t)prebuffer); - if (!p.buffer) - { - return NULL; - } - - p.length = (size_t)prebuffer; - p.offset = 0; - p.noalloc = false; - p.format = fmt; - p.hooks = global_hooks; - - if (!print_value(item, &p)) - { - global_hooks.deallocate(p.buffer); - return NULL; - } - - return (char*)p.buffer; -} - -CJSON_PUBLIC(cJSON_bool) cJSON_PrintPreallocated(cJSON *item, char *buffer, const int length, const cJSON_bool format) -{ - printbuffer p = { 0, 0, 0, 0, 0, 0, { 0, 0, 0 } }; - - if ((length < 0) || (buffer == NULL)) - { - return false; - } - - p.buffer = (unsigned char*)buffer; - p.length = (size_t)length; - p.offset = 0; - p.noalloc = true; - p.format = format; - p.hooks = global_hooks; - - return print_value(item, &p); -} - -/* Parser core - when encountering text, process appropriately. */ -static cJSON_bool parse_value(cJSON * const item, parse_buffer * const input_buffer) -{ - if ((input_buffer == NULL) || (input_buffer->content == NULL)) - { - return false; /* no input */ - } - - /* parse the different types of values */ - /* null */ - if (can_read(input_buffer, 4) && (strncmp((const char*)buffer_at_offset(input_buffer), "null", 4) == 0)) - { - item->type = cJSON_NULL; - input_buffer->offset += 4; - return true; - } - /* false */ - if (can_read(input_buffer, 5) && (strncmp((const char*)buffer_at_offset(input_buffer), "false", 5) == 0)) - { - item->type = cJSON_False; - input_buffer->offset += 5; - return true; - } - /* true */ - if (can_read(input_buffer, 4) && (strncmp((const char*)buffer_at_offset(input_buffer), "true", 4) == 0)) - { - item->type = cJSON_True; - item->valueint = 1; - input_buffer->offset += 4; - return true; - } - /* string */ - if (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == '\"')) - { - return parse_string(item, input_buffer); - } - /* number */ - if (can_access_at_index(input_buffer, 0) && ((buffer_at_offset(input_buffer)[0] == '-') || ((buffer_at_offset(input_buffer)[0] >= '0') && (buffer_at_offset(input_buffer)[0] <= '9')))) - { - return parse_number(item, input_buffer); - } - /* array */ - if (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == '[')) - { - return parse_array(item, input_buffer); - } - /* object */ - if (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == '{')) - { - return parse_object(item, input_buffer); - } - - return false; -} - -/* Render a value to text. */ -static cJSON_bool print_value(const cJSON * const item, printbuffer * const output_buffer) -{ - unsigned char *output = NULL; - - if ((item == NULL) || (output_buffer == NULL)) - { - return false; - } - - switch ((item->type) & 0xFF) - { - case cJSON_NULL: - output = ensure(output_buffer, 5); - if (output == NULL) - { - return false; - } - strcpy((char*)output, "null"); - return true; - - case cJSON_False: - output = ensure(output_buffer, 6); - if (output == NULL) - { - return false; - } - strcpy((char*)output, "false"); - return true; - - case cJSON_True: - output = ensure(output_buffer, 5); - if (output == NULL) - { - return false; - } - strcpy((char*)output, "true"); - return true; - - case cJSON_Number: - return print_number(item, output_buffer); - - case cJSON_Raw: - { - size_t raw_length = 0; - if (item->valuestring == NULL) - { - return false; - } - - raw_length = strlen(item->valuestring) + sizeof(""); - output = ensure(output_buffer, raw_length); - if (output == NULL) - { - return false; - } - memcpy(output, item->valuestring, raw_length); - return true; - } - - case cJSON_String: - return print_string(item, output_buffer); - - case cJSON_Array: - return print_array(item, output_buffer); - - case cJSON_Object: - return print_object(item, output_buffer); - - default: - return false; - } -} - -/* Build an array from input text. */ -static cJSON_bool parse_array(cJSON * const item, parse_buffer * const input_buffer) -{ - cJSON *head = NULL; /* head of the linked list */ - cJSON *current_item = NULL; - - if (input_buffer->depth >= CJSON_NESTING_LIMIT) - { - return false; /* to deeply nested */ - } - input_buffer->depth++; - - if (buffer_at_offset(input_buffer)[0] != '[') - { - /* not an array */ - goto fail; - } - - input_buffer->offset++; - buffer_skip_whitespace(input_buffer); - if (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == ']')) - { - /* empty array */ - goto success; - } - - /* check if we skipped to the end of the buffer */ - if (cannot_access_at_index(input_buffer, 0)) - { - input_buffer->offset--; - goto fail; - } - - /* step back to character in front of the first element */ - input_buffer->offset--; - /* loop through the comma separated array elements */ - do - { - /* allocate next item */ - cJSON *new_item = cJSON_New_Item(&(input_buffer->hooks)); - if (new_item == NULL) - { - goto fail; /* allocation failure */ - } - - /* attach next item to list */ - if (head == NULL) - { - /* start the linked list */ - current_item = head = new_item; - } - else - { - /* add to the end and advance */ - current_item->next = new_item; - new_item->prev = current_item; - current_item = new_item; - } - - /* parse next value */ - input_buffer->offset++; - buffer_skip_whitespace(input_buffer); - if (!parse_value(current_item, input_buffer)) - { - goto fail; /* failed to parse value */ - } - buffer_skip_whitespace(input_buffer); - } - while (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == ',')); - - if (cannot_access_at_index(input_buffer, 0) || buffer_at_offset(input_buffer)[0] != ']') - { - goto fail; /* expected end of array */ - } - -success: - input_buffer->depth--; - - if (head != NULL) { - head->prev = current_item; - } - - item->type = cJSON_Array; - item->child = head; - - input_buffer->offset++; - - return true; - -fail: - if (head != NULL) - { - cJSON_Delete(head); - } - - return false; -} - -/* Render an array to text */ -static cJSON_bool print_array(const cJSON * const item, printbuffer * const output_buffer) -{ - unsigned char *output_pointer = NULL; - size_t length = 0; - cJSON *current_element = item->child; - - if (output_buffer == NULL) - { - return false; - } - - /* Compose the output array. */ - /* opening square bracket */ - output_pointer = ensure(output_buffer, 1); - if (output_pointer == NULL) - { - return false; - } - - *output_pointer = '['; - output_buffer->offset++; - output_buffer->depth++; - - while (current_element != NULL) - { - if (!print_value(current_element, output_buffer)) - { - return false; - } - update_offset(output_buffer); - if (current_element->next) - { - length = (size_t) (output_buffer->format ? 2 : 1); - output_pointer = ensure(output_buffer, length + 1); - if (output_pointer == NULL) - { - return false; - } - *output_pointer++ = ','; - if(output_buffer->format) - { - *output_pointer++ = ' '; - } - *output_pointer = '\0'; - output_buffer->offset += length; - } - current_element = current_element->next; - } - - output_pointer = ensure(output_buffer, 2); - if (output_pointer == NULL) - { - return false; - } - *output_pointer++ = ']'; - *output_pointer = '\0'; - output_buffer->depth--; - - return true; -} - -/* Build an object from the text. */ -static cJSON_bool parse_object(cJSON * const item, parse_buffer * const input_buffer) -{ - cJSON *head = NULL; /* linked list head */ - cJSON *current_item = NULL; - - if (input_buffer->depth >= CJSON_NESTING_LIMIT) - { - return false; /* to deeply nested */ - } - input_buffer->depth++; - - if (cannot_access_at_index(input_buffer, 0) || (buffer_at_offset(input_buffer)[0] != '{')) - { - goto fail; /* not an object */ - } - - input_buffer->offset++; - buffer_skip_whitespace(input_buffer); - if (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == '}')) - { - goto success; /* empty object */ - } - - /* check if we skipped to the end of the buffer */ - if (cannot_access_at_index(input_buffer, 0)) - { - input_buffer->offset--; - goto fail; - } - - /* step back to character in front of the first element */ - input_buffer->offset--; - /* loop through the comma separated array elements */ - do - { - /* allocate next item */ - cJSON *new_item = cJSON_New_Item(&(input_buffer->hooks)); - if (new_item == NULL) - { - goto fail; /* allocation failure */ - } - - /* attach next item to list */ - if (head == NULL) - { - /* start the linked list */ - current_item = head = new_item; - } - else - { - /* add to the end and advance */ - current_item->next = new_item; - new_item->prev = current_item; - current_item = new_item; - } - - /* parse the name of the child */ - input_buffer->offset++; - buffer_skip_whitespace(input_buffer); - if (!parse_string(current_item, input_buffer)) - { - goto fail; /* failed to parse name */ - } - buffer_skip_whitespace(input_buffer); - - /* swap valuestring and string, because we parsed the name */ - current_item->string = current_item->valuestring; - current_item->valuestring = NULL; - - if (cannot_access_at_index(input_buffer, 0) || (buffer_at_offset(input_buffer)[0] != ':')) - { - goto fail; /* invalid object */ - } - - /* parse the value */ - input_buffer->offset++; - buffer_skip_whitespace(input_buffer); - if (!parse_value(current_item, input_buffer)) - { - goto fail; /* failed to parse value */ - } - buffer_skip_whitespace(input_buffer); - } - while (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == ',')); - - if (cannot_access_at_index(input_buffer, 0) || (buffer_at_offset(input_buffer)[0] != '}')) - { - goto fail; /* expected end of object */ - } - -success: - input_buffer->depth--; - - if (head != NULL) { - head->prev = current_item; - } - - item->type = cJSON_Object; - item->child = head; - - input_buffer->offset++; - return true; - -fail: - if (head != NULL) - { - cJSON_Delete(head); - } - - return false; -} - -/* Render an object to text. */ -static cJSON_bool print_object(const cJSON * const item, printbuffer * const output_buffer) -{ - unsigned char *output_pointer = NULL; - size_t length = 0; - cJSON *current_item = item->child; - - if (output_buffer == NULL) - { - return false; - } - - /* Compose the output: */ - length = (size_t) (output_buffer->format ? 2 : 1); /* fmt: {\n */ - output_pointer = ensure(output_buffer, length + 1); - if (output_pointer == NULL) - { - return false; - } - - *output_pointer++ = '{'; - output_buffer->depth++; - if (output_buffer->format) - { - *output_pointer++ = '\n'; - } - output_buffer->offset += length; - - while (current_item) - { - if (output_buffer->format) - { - size_t i; - output_pointer = ensure(output_buffer, output_buffer->depth); - if (output_pointer == NULL) - { - return false; - } - for (i = 0; i < output_buffer->depth; i++) - { - *output_pointer++ = '\t'; - } - output_buffer->offset += output_buffer->depth; - } - - /* print key */ - if (!print_string_ptr((unsigned char*)current_item->string, output_buffer)) - { - return false; - } - update_offset(output_buffer); - - length = (size_t) (output_buffer->format ? 2 : 1); - output_pointer = ensure(output_buffer, length); - if (output_pointer == NULL) - { - return false; - } - *output_pointer++ = ':'; - if (output_buffer->format) - { - *output_pointer++ = '\t'; - } - output_buffer->offset += length; - - /* print value */ - if (!print_value(current_item, output_buffer)) - { - return false; - } - update_offset(output_buffer); - - /* print comma if not last */ - length = ((size_t)(output_buffer->format ? 1 : 0) + (size_t)(current_item->next ? 1 : 0)); - output_pointer = ensure(output_buffer, length + 1); - if (output_pointer == NULL) - { - return false; - } - if (current_item->next) - { - *output_pointer++ = ','; - } - - if (output_buffer->format) - { - *output_pointer++ = '\n'; - } - *output_pointer = '\0'; - output_buffer->offset += length; - - current_item = current_item->next; - } - - output_pointer = ensure(output_buffer, output_buffer->format ? (output_buffer->depth + 1) : 2); - if (output_pointer == NULL) - { - return false; - } - if (output_buffer->format) - { - size_t i; - for (i = 0; i < (output_buffer->depth - 1); i++) - { - *output_pointer++ = '\t'; - } - } - *output_pointer++ = '}'; - *output_pointer = '\0'; - output_buffer->depth--; - - return true; -} - -/* Get Array size/item / object item. */ -CJSON_PUBLIC(int) cJSON_GetArraySize(const cJSON *array) -{ - cJSON *child = NULL; - size_t size = 0; - - if (array == NULL) - { - return 0; - } - - child = array->child; - - while(child != NULL) - { - size++; - child = child->next; - } - - /* FIXME: Can overflow here. Cannot be fixed without breaking the API */ - - return (int)size; -} - -static cJSON* get_array_item(const cJSON *array, size_t index) -{ - cJSON *current_child = NULL; - - if (array == NULL) - { - return NULL; - } - - current_child = array->child; - while ((current_child != NULL) && (index > 0)) - { - index--; - current_child = current_child->next; - } - - return current_child; -} - -CJSON_PUBLIC(cJSON *) cJSON_GetArrayItem(const cJSON *array, int index) -{ - if (index < 0) - { - return NULL; - } - - return get_array_item(array, (size_t)index); -} - -static cJSON *get_object_item(const cJSON * const object, const char * const name, const cJSON_bool case_sensitive) -{ - cJSON *current_element = NULL; - - if ((object == NULL) || (name == NULL)) - { - return NULL; - } - - current_element = object->child; - if (case_sensitive) - { - while ((current_element != NULL) && (current_element->string != NULL) && (strcmp(name, current_element->string) != 0)) - { - current_element = current_element->next; - } - } - else - { - while ((current_element != NULL) && (case_insensitive_strcmp((const unsigned char*)name, (const unsigned char*)(current_element->string)) != 0)) - { - current_element = current_element->next; - } - } - - if ((current_element == NULL) || (current_element->string == NULL)) { - return NULL; - } - - return current_element; -} - -CJSON_PUBLIC(cJSON *) cJSON_GetObjectItem(const cJSON * const object, const char * const string) -{ - return get_object_item(object, string, false); -} - -CJSON_PUBLIC(cJSON *) cJSON_GetObjectItemCaseSensitive(const cJSON * const object, const char * const string) -{ - return get_object_item(object, string, true); -} - -CJSON_PUBLIC(cJSON_bool) cJSON_HasObjectItem(const cJSON *object, const char *string) -{ - return cJSON_GetObjectItem(object, string) ? 1 : 0; -} - -/* Utility for array list handling. */ -static void suffix_object(cJSON *prev, cJSON *item) -{ - prev->next = item; - item->prev = prev; -} - -/* Utility for handling references. */ -static cJSON *create_reference(const cJSON *item, const internal_hooks * const hooks) -{ - cJSON *reference = NULL; - if (item == NULL) - { - return NULL; - } - - reference = cJSON_New_Item(hooks); - if (reference == NULL) - { - return NULL; - } - - memcpy(reference, item, sizeof(cJSON)); - reference->string = NULL; - reference->type |= cJSON_IsReference; - reference->next = reference->prev = NULL; - return reference; -} - -static cJSON_bool add_item_to_array(cJSON *array, cJSON *item) -{ - cJSON *child = NULL; - - if ((item == NULL) || (array == NULL) || (array == item)) - { - return false; - } - - child = array->child; - /* - * To find the last item in array quickly, we use prev in array - */ - if (child == NULL) - { - /* list is empty, start new one */ - array->child = item; - item->prev = item; - item->next = NULL; - } - else - { - /* append to the end */ - if (child->prev) - { - suffix_object(child->prev, item); - array->child->prev = item; - } - } - - return true; -} - -/* Add item to array/object. */ -CJSON_PUBLIC(cJSON_bool) cJSON_AddItemToArray(cJSON *array, cJSON *item) -{ - return add_item_to_array(array, item); -} - -#if defined(__clang__) || (defined(__GNUC__) && ((__GNUC__ > 4) || ((__GNUC__ == 4) && (__GNUC_MINOR__ > 5)))) - #pragma GCC diagnostic push -#endif -#ifdef __GNUC__ -#pragma GCC diagnostic ignored "-Wcast-qual" -#endif -/* helper function to cast away const */ -static void* cast_away_const(const void* string) -{ - return (void*)string; -} -#if defined(__clang__) || (defined(__GNUC__) && ((__GNUC__ > 4) || ((__GNUC__ == 4) && (__GNUC_MINOR__ > 5)))) - #pragma GCC diagnostic pop -#endif - - -static cJSON_bool add_item_to_object(cJSON * const object, const char * const string, cJSON * const item, const internal_hooks * const hooks, const cJSON_bool constant_key) -{ - char *new_key = NULL; - int new_type = cJSON_Invalid; - - if ((object == NULL) || (string == NULL) || (item == NULL) || (object == item)) - { - return false; - } - - if (constant_key) - { - new_key = (char*)cast_away_const(string); - new_type = item->type | cJSON_StringIsConst; - } - else - { - new_key = (char*)cJSON_strdup((const unsigned char*)string, hooks); - if (new_key == NULL) - { - return false; - } - - new_type = item->type & ~cJSON_StringIsConst; - } - - if (!(item->type & cJSON_StringIsConst) && (item->string != NULL)) - { - hooks->deallocate(item->string); - } - - item->string = new_key; - item->type = new_type; - - return add_item_to_array(object, item); -} - -CJSON_PUBLIC(cJSON_bool) cJSON_AddItemToObject(cJSON *object, const char *string, cJSON *item) -{ - return add_item_to_object(object, string, item, &global_hooks, false); -} - -/* Add an item to an object with constant string as key */ -CJSON_PUBLIC(cJSON_bool) cJSON_AddItemToObjectCS(cJSON *object, const char *string, cJSON *item) -{ - return add_item_to_object(object, string, item, &global_hooks, true); -} - -CJSON_PUBLIC(cJSON_bool) cJSON_AddItemReferenceToArray(cJSON *array, cJSON *item) -{ - if (array == NULL) - { - return false; - } - - return add_item_to_array(array, create_reference(item, &global_hooks)); -} - -CJSON_PUBLIC(cJSON_bool) cJSON_AddItemReferenceToObject(cJSON *object, const char *string, cJSON *item) -{ - if ((object == NULL) || (string == NULL)) - { - return false; - } - - return add_item_to_object(object, string, create_reference(item, &global_hooks), &global_hooks, false); -} - -CJSON_PUBLIC(cJSON*) cJSON_AddNullToObject(cJSON * const object, const char * const name) -{ - cJSON *null = cJSON_CreateNull(); - if (add_item_to_object(object, name, null, &global_hooks, false)) - { - return null; - } - - cJSON_Delete(null); - return NULL; -} - -CJSON_PUBLIC(cJSON*) cJSON_AddTrueToObject(cJSON * const object, const char * const name) -{ - cJSON *true_item = cJSON_CreateTrue(); - if (add_item_to_object(object, name, true_item, &global_hooks, false)) - { - return true_item; - } - - cJSON_Delete(true_item); - return NULL; -} - -CJSON_PUBLIC(cJSON*) cJSON_AddFalseToObject(cJSON * const object, const char * const name) -{ - cJSON *false_item = cJSON_CreateFalse(); - if (add_item_to_object(object, name, false_item, &global_hooks, false)) - { - return false_item; - } - - cJSON_Delete(false_item); - return NULL; -} - -CJSON_PUBLIC(cJSON*) cJSON_AddBoolToObject(cJSON * const object, const char * const name, const cJSON_bool boolean) -{ - cJSON *bool_item = cJSON_CreateBool(boolean); - if (add_item_to_object(object, name, bool_item, &global_hooks, false)) - { - return bool_item; - } - - cJSON_Delete(bool_item); - return NULL; -} - -CJSON_PUBLIC(cJSON*) cJSON_AddNumberToObject(cJSON * const object, const char * const name, const double number) -{ - cJSON *number_item = cJSON_CreateNumber(number); - if (add_item_to_object(object, name, number_item, &global_hooks, false)) - { - return number_item; - } - - cJSON_Delete(number_item); - return NULL; -} - -CJSON_PUBLIC(cJSON*) cJSON_AddStringToObject(cJSON * const object, const char * const name, const char * const string) -{ - cJSON *string_item = cJSON_CreateString(string); - if (add_item_to_object(object, name, string_item, &global_hooks, false)) - { - return string_item; - } - - cJSON_Delete(string_item); - return NULL; -} - -CJSON_PUBLIC(cJSON*) cJSON_AddRawToObject(cJSON * const object, const char * const name, const char * const raw) -{ - cJSON *raw_item = cJSON_CreateRaw(raw); - if (add_item_to_object(object, name, raw_item, &global_hooks, false)) - { - return raw_item; - } - - cJSON_Delete(raw_item); - return NULL; -} - -CJSON_PUBLIC(cJSON*) cJSON_AddObjectToObject(cJSON * const object, const char * const name) -{ - cJSON *object_item = cJSON_CreateObject(); - if (add_item_to_object(object, name, object_item, &global_hooks, false)) - { - return object_item; - } - - cJSON_Delete(object_item); - return NULL; -} - -CJSON_PUBLIC(cJSON*) cJSON_AddArrayToObject(cJSON * const object, const char * const name) -{ - cJSON *array = cJSON_CreateArray(); - if (add_item_to_object(object, name, array, &global_hooks, false)) - { - return array; - } - - cJSON_Delete(array); - return NULL; -} - -CJSON_PUBLIC(cJSON *) cJSON_DetachItemViaPointer(cJSON *parent, cJSON * const item) -{ - if ((parent == NULL) || (item == NULL)) - { - return NULL; - } - - if (item != parent->child) - { - /* not the first element */ - item->prev->next = item->next; - } - if (item->next != NULL) - { - /* not the last element */ - item->next->prev = item->prev; - } - - if (item == parent->child) - { - /* first element */ - parent->child = item->next; - } - else if (item->next == NULL) - { - /* last element */ - parent->child->prev = item->prev; - } - - /* make sure the detached item doesn't point anywhere anymore */ - item->prev = NULL; - item->next = NULL; - - return item; -} - -CJSON_PUBLIC(cJSON *) cJSON_DetachItemFromArray(cJSON *array, int which) -{ - if (which < 0) - { - return NULL; - } - - return cJSON_DetachItemViaPointer(array, get_array_item(array, (size_t)which)); -} - -CJSON_PUBLIC(void) cJSON_DeleteItemFromArray(cJSON *array, int which) -{ - cJSON_Delete(cJSON_DetachItemFromArray(array, which)); -} - -CJSON_PUBLIC(cJSON *) cJSON_DetachItemFromObject(cJSON *object, const char *string) -{ - cJSON *to_detach = cJSON_GetObjectItem(object, string); - - return cJSON_DetachItemViaPointer(object, to_detach); -} - -CJSON_PUBLIC(cJSON *) cJSON_DetachItemFromObjectCaseSensitive(cJSON *object, const char *string) -{ - cJSON *to_detach = cJSON_GetObjectItemCaseSensitive(object, string); - - return cJSON_DetachItemViaPointer(object, to_detach); -} - -CJSON_PUBLIC(void) cJSON_DeleteItemFromObject(cJSON *object, const char *string) -{ - cJSON_Delete(cJSON_DetachItemFromObject(object, string)); -} - -CJSON_PUBLIC(void) cJSON_DeleteItemFromObjectCaseSensitive(cJSON *object, const char *string) -{ - cJSON_Delete(cJSON_DetachItemFromObjectCaseSensitive(object, string)); -} - -/* Replace array/object items with new ones. */ -CJSON_PUBLIC(cJSON_bool) cJSON_InsertItemInArray(cJSON *array, int which, cJSON *newitem) -{ - cJSON *after_inserted = NULL; - - if (which < 0) - { - return false; - } - - after_inserted = get_array_item(array, (size_t)which); - if (after_inserted == NULL) - { - return add_item_to_array(array, newitem); - } - - newitem->next = after_inserted; - newitem->prev = after_inserted->prev; - after_inserted->prev = newitem; - if (after_inserted == array->child) - { - array->child = newitem; - } - else - { - newitem->prev->next = newitem; - } - return true; -} - -CJSON_PUBLIC(cJSON_bool) cJSON_ReplaceItemViaPointer(cJSON * const parent, cJSON * const item, cJSON * replacement) -{ - if ((parent == NULL) || (replacement == NULL) || (item == NULL)) - { - return false; - } - - if (replacement == item) - { - return true; - } - - replacement->next = item->next; - replacement->prev = item->prev; - - if (replacement->next != NULL) - { - replacement->next->prev = replacement; - } - if (parent->child == item) - { - if (parent->child->prev == parent->child) - { - replacement->prev = replacement; - } - parent->child = replacement; - } - else - { /* - * To find the last item in array quickly, we use prev in array. - * We can't modify the last item's next pointer where this item was the parent's child - */ - if (replacement->prev != NULL) - { - replacement->prev->next = replacement; - } - if (replacement->next == NULL) - { - parent->child->prev = replacement; - } - } - - item->next = NULL; - item->prev = NULL; - cJSON_Delete(item); - - return true; -} - -CJSON_PUBLIC(cJSON_bool) cJSON_ReplaceItemInArray(cJSON *array, int which, cJSON *newitem) -{ - if (which < 0) - { - return false; - } - - return cJSON_ReplaceItemViaPointer(array, get_array_item(array, (size_t)which), newitem); -} - -static cJSON_bool replace_item_in_object(cJSON *object, const char *string, cJSON *replacement, cJSON_bool case_sensitive) -{ - if ((replacement == NULL) || (string == NULL)) - { - return false; - } - - /* replace the name in the replacement */ - if (!(replacement->type & cJSON_StringIsConst) && (replacement->string != NULL)) - { - cJSON_free(replacement->string); - } - replacement->string = (char*)cJSON_strdup((const unsigned char*)string, &global_hooks); - if (replacement->string == NULL) - { - return false; - } - - replacement->type &= ~cJSON_StringIsConst; - - return cJSON_ReplaceItemViaPointer(object, get_object_item(object, string, case_sensitive), replacement); -} - -CJSON_PUBLIC(cJSON_bool) cJSON_ReplaceItemInObject(cJSON *object, const char *string, cJSON *newitem) -{ - return replace_item_in_object(object, string, newitem, false); -} - -CJSON_PUBLIC(cJSON_bool) cJSON_ReplaceItemInObjectCaseSensitive(cJSON *object, const char *string, cJSON *newitem) -{ - return replace_item_in_object(object, string, newitem, true); -} - -/* Create basic types: */ -CJSON_PUBLIC(cJSON *) cJSON_CreateNull(void) -{ - cJSON *item = cJSON_New_Item(&global_hooks); - if(item) - { - item->type = cJSON_NULL; - } - - return item; -} - -CJSON_PUBLIC(cJSON *) cJSON_CreateTrue(void) -{ - cJSON *item = cJSON_New_Item(&global_hooks); - if(item) - { - item->type = cJSON_True; - } - - return item; -} - -CJSON_PUBLIC(cJSON *) cJSON_CreateFalse(void) -{ - cJSON *item = cJSON_New_Item(&global_hooks); - if(item) - { - item->type = cJSON_False; - } - - return item; -} - -CJSON_PUBLIC(cJSON *) cJSON_CreateBool(cJSON_bool boolean) -{ - cJSON *item = cJSON_New_Item(&global_hooks); - if(item) - { - item->type = boolean ? cJSON_True : cJSON_False; - } - - return item; -} - -CJSON_PUBLIC(cJSON *) cJSON_CreateNumber(double num) -{ - cJSON *item = cJSON_New_Item(&global_hooks); - if(item) - { - item->type = cJSON_Number; - item->valuedouble = num; - - /* use saturation in case of overflow */ - if (num >= INT_MAX) - { - item->valueint = INT_MAX; - } - else if (num <= (double)INT_MIN) - { - item->valueint = INT_MIN; - } - else - { - item->valueint = (int)num; - } - } - - return item; -} - -CJSON_PUBLIC(cJSON *) cJSON_CreateString(const char *string) -{ - cJSON *item = cJSON_New_Item(&global_hooks); - if(item) - { - item->type = cJSON_String; - item->valuestring = (char*)cJSON_strdup((const unsigned char*)string, &global_hooks); - if(!item->valuestring) - { - cJSON_Delete(item); - return NULL; - } - } - - return item; -} - -CJSON_PUBLIC(cJSON *) cJSON_CreateStringReference(const char *string) -{ - cJSON *item = cJSON_New_Item(&global_hooks); - if (item != NULL) - { - item->type = cJSON_String | cJSON_IsReference; - item->valuestring = (char*)cast_away_const(string); - } - - return item; -} - -CJSON_PUBLIC(cJSON *) cJSON_CreateObjectReference(const cJSON *child) -{ - cJSON *item = cJSON_New_Item(&global_hooks); - if (item != NULL) { - item->type = cJSON_Object | cJSON_IsReference; - item->child = (cJSON*)cast_away_const(child); - } - - return item; -} - -CJSON_PUBLIC(cJSON *) cJSON_CreateArrayReference(const cJSON *child) { - cJSON *item = cJSON_New_Item(&global_hooks); - if (item != NULL) { - item->type = cJSON_Array | cJSON_IsReference; - item->child = (cJSON*)cast_away_const(child); - } - - return item; -} - -CJSON_PUBLIC(cJSON *) cJSON_CreateRaw(const char *raw) -{ - cJSON *item = cJSON_New_Item(&global_hooks); - if(item) - { - item->type = cJSON_Raw; - item->valuestring = (char*)cJSON_strdup((const unsigned char*)raw, &global_hooks); - if(!item->valuestring) - { - cJSON_Delete(item); - return NULL; - } - } - - return item; -} - -CJSON_PUBLIC(cJSON *) cJSON_CreateArray(void) -{ - cJSON *item = cJSON_New_Item(&global_hooks); - if(item) - { - item->type=cJSON_Array; - } - - return item; -} - -CJSON_PUBLIC(cJSON *) cJSON_CreateObject(void) -{ - cJSON *item = cJSON_New_Item(&global_hooks); - if (item) - { - item->type = cJSON_Object; - } - - return item; -} - -/* Create Arrays: */ -CJSON_PUBLIC(cJSON *) cJSON_CreateIntArray(const int *numbers, int count) -{ - size_t i = 0; - cJSON *n = NULL; - cJSON *p = NULL; - cJSON *a = NULL; - - if ((count < 0) || (numbers == NULL)) - { - return NULL; - } - - a = cJSON_CreateArray(); - - for(i = 0; a && (i < (size_t)count); i++) - { - n = cJSON_CreateNumber(numbers[i]); - if (!n) - { - cJSON_Delete(a); - return NULL; - } - if(!i) - { - a->child = n; - } - else - { - suffix_object(p, n); - } - p = n; - } - - if (a && a->child) { - a->child->prev = n; - } - - return a; -} - -CJSON_PUBLIC(cJSON *) cJSON_CreateFloatArray(const float *numbers, int count) -{ - size_t i = 0; - cJSON *n = NULL; - cJSON *p = NULL; - cJSON *a = NULL; - - if ((count < 0) || (numbers == NULL)) - { - return NULL; - } - - a = cJSON_CreateArray(); - - for(i = 0; a && (i < (size_t)count); i++) - { - n = cJSON_CreateNumber((double)numbers[i]); - if(!n) - { - cJSON_Delete(a); - return NULL; - } - if(!i) - { - a->child = n; - } - else - { - suffix_object(p, n); - } - p = n; - } - - if (a && a->child) { - a->child->prev = n; - } - - return a; -} - -CJSON_PUBLIC(cJSON *) cJSON_CreateDoubleArray(const double *numbers, int count) -{ - size_t i = 0; - cJSON *n = NULL; - cJSON *p = NULL; - cJSON *a = NULL; - - if ((count < 0) || (numbers == NULL)) - { - return NULL; - } - - a = cJSON_CreateArray(); - - for(i = 0; a && (i < (size_t)count); i++) - { - n = cJSON_CreateNumber(numbers[i]); - if(!n) - { - cJSON_Delete(a); - return NULL; - } - if(!i) - { - a->child = n; - } - else - { - suffix_object(p, n); - } - p = n; - } - - if (a && a->child) { - a->child->prev = n; - } - - return a; -} - -CJSON_PUBLIC(cJSON *) cJSON_CreateStringArray(const char *const *strings, int count) -{ - size_t i = 0; - cJSON *n = NULL; - cJSON *p = NULL; - cJSON *a = NULL; - - if ((count < 0) || (strings == NULL)) - { - return NULL; - } - - a = cJSON_CreateArray(); - - for (i = 0; a && (i < (size_t)count); i++) - { - n = cJSON_CreateString(strings[i]); - if(!n) - { - cJSON_Delete(a); - return NULL; - } - if(!i) - { - a->child = n; - } - else - { - suffix_object(p,n); - } - p = n; - } - - if (a && a->child) { - a->child->prev = n; - } - - return a; -} - -/* Duplication */ -CJSON_PUBLIC(cJSON *) cJSON_Duplicate(const cJSON *item, cJSON_bool recurse) -{ - cJSON *newitem = NULL; - cJSON *child = NULL; - cJSON *next = NULL; - cJSON *newchild = NULL; - - /* Bail on bad ptr */ - if (!item) - { - goto fail; - } - /* Create new item */ - newitem = cJSON_New_Item(&global_hooks); - if (!newitem) - { - goto fail; - } - /* Copy over all vars */ - newitem->type = item->type & (~cJSON_IsReference); - newitem->valueint = item->valueint; - newitem->valuedouble = item->valuedouble; - if (item->valuestring) - { - newitem->valuestring = (char*)cJSON_strdup((unsigned char*)item->valuestring, &global_hooks); - if (!newitem->valuestring) - { - goto fail; - } - } - if (item->string) - { - newitem->string = (item->type&cJSON_StringIsConst) ? item->string : (char*)cJSON_strdup((unsigned char*)item->string, &global_hooks); - if (!newitem->string) - { - goto fail; - } - } - /* If non-recursive, then we're done! */ - if (!recurse) - { - return newitem; - } - /* Walk the ->next chain for the child. */ - child = item->child; - while (child != NULL) - { - newchild = cJSON_Duplicate(child, true); /* Duplicate (with recurse) each item in the ->next chain */ - if (!newchild) - { - goto fail; - } - if (next != NULL) - { - /* If newitem->child already set, then crosswire ->prev and ->next and move on */ - next->next = newchild; - newchild->prev = next; - next = newchild; - } - else - { - /* Set newitem->child and move to it */ - newitem->child = newchild; - next = newchild; - } - child = child->next; - } - if (newitem && newitem->child) - { - newitem->child->prev = newchild; - } - - return newitem; - -fail: - if (newitem != NULL) - { - cJSON_Delete(newitem); - } - - return NULL; -} - -static void skip_oneline_comment(char **input) -{ - *input += static_strlen("//"); - - for (; (*input)[0] != '\0'; ++(*input)) - { - if ((*input)[0] == '\n') { - *input += static_strlen("\n"); - return; - } - } -} - -static void skip_multiline_comment(char **input) -{ - *input += static_strlen("/*"); - - for (; (*input)[0] != '\0'; ++(*input)) - { - if (((*input)[0] == '*') && ((*input)[1] == '/')) - { - *input += static_strlen("*/"); - return; - } - } -} - -static void minify_string(char **input, char **output) { - (*output)[0] = (*input)[0]; - *input += static_strlen("\""); - *output += static_strlen("\""); - - - for (; (*input)[0] != '\0'; (void)++(*input), ++(*output)) { - (*output)[0] = (*input)[0]; - - if ((*input)[0] == '\"') { - (*output)[0] = '\"'; - *input += static_strlen("\""); - *output += static_strlen("\""); - return; - } else if (((*input)[0] == '\\') && ((*input)[1] == '\"')) { - (*output)[1] = (*input)[1]; - *input += static_strlen("\""); - *output += static_strlen("\""); - } - } -} - -CJSON_PUBLIC(void) cJSON_Minify(char *json) -{ - char *into = json; - - if (json == NULL) - { - return; - } - - while (json[0] != '\0') - { - switch (json[0]) - { - case ' ': - case '\t': - case '\r': - case '\n': - json++; - break; - - case '/': - if (json[1] == '/') - { - skip_oneline_comment(&json); - } - else if (json[1] == '*') - { - skip_multiline_comment(&json); - } else { - json++; - } - break; - - case '\"': - minify_string(&json, (char**)&into); - break; - - default: - into[0] = json[0]; - json++; - into++; - } - } - - /* and null-terminate. */ - *into = '\0'; -} - -CJSON_PUBLIC(cJSON_bool) cJSON_IsInvalid(const cJSON * const item) -{ - if (item == NULL) - { - return false; - } - - return (item->type & 0xFF) == cJSON_Invalid; -} - -CJSON_PUBLIC(cJSON_bool) cJSON_IsFalse(const cJSON * const item) -{ - if (item == NULL) - { - return false; - } - - return (item->type & 0xFF) == cJSON_False; -} - -CJSON_PUBLIC(cJSON_bool) cJSON_IsTrue(const cJSON * const item) -{ - if (item == NULL) - { - return false; - } - - return (item->type & 0xff) == cJSON_True; -} - - -CJSON_PUBLIC(cJSON_bool) cJSON_IsBool(const cJSON * const item) -{ - if (item == NULL) - { - return false; - } - - return (item->type & (cJSON_True | cJSON_False)) != 0; -} -CJSON_PUBLIC(cJSON_bool) cJSON_IsNull(const cJSON * const item) -{ - if (item == NULL) - { - return false; - } - - return (item->type & 0xFF) == cJSON_NULL; -} - -CJSON_PUBLIC(cJSON_bool) cJSON_IsNumber(const cJSON * const item) -{ - if (item == NULL) - { - return false; - } - - return (item->type & 0xFF) == cJSON_Number; -} - -CJSON_PUBLIC(cJSON_bool) cJSON_IsString(const cJSON * const item) -{ - if (item == NULL) - { - return false; - } - - return (item->type & 0xFF) == cJSON_String; -} - -CJSON_PUBLIC(cJSON_bool) cJSON_IsArray(const cJSON * const item) -{ - if (item == NULL) - { - return false; - } - - return (item->type & 0xFF) == cJSON_Array; -} - -CJSON_PUBLIC(cJSON_bool) cJSON_IsObject(const cJSON * const item) -{ - if (item == NULL) - { - return false; - } - - return (item->type & 0xFF) == cJSON_Object; -} - -CJSON_PUBLIC(cJSON_bool) cJSON_IsRaw(const cJSON * const item) -{ - if (item == NULL) - { - return false; - } - - return (item->type & 0xFF) == cJSON_Raw; -} - -CJSON_PUBLIC(cJSON_bool) cJSON_Compare(const cJSON * const a, const cJSON * const b, const cJSON_bool case_sensitive) -{ - if ((a == NULL) || (b == NULL) || ((a->type & 0xFF) != (b->type & 0xFF))) - { - return false; - } - - /* check if type is valid */ - switch (a->type & 0xFF) - { - case cJSON_False: - case cJSON_True: - case cJSON_NULL: - case cJSON_Number: - case cJSON_String: - case cJSON_Raw: - case cJSON_Array: - case cJSON_Object: - break; - - default: - return false; - } - - /* identical objects are equal */ - if (a == b) - { - return true; - } - - switch (a->type & 0xFF) - { - /* in these cases and equal type is enough */ - case cJSON_False: - case cJSON_True: - case cJSON_NULL: - return true; - - case cJSON_Number: - if (compare_double(a->valuedouble, b->valuedouble)) - { - return true; - } - return false; - - case cJSON_String: - case cJSON_Raw: - if ((a->valuestring == NULL) || (b->valuestring == NULL)) - { - return false; - } - if (strcmp(a->valuestring, b->valuestring) == 0) - { - return true; - } - - return false; - - case cJSON_Array: - { - cJSON *a_element = a->child; - cJSON *b_element = b->child; - - for (; (a_element != NULL) && (b_element != NULL);) - { - if (!cJSON_Compare(a_element, b_element, case_sensitive)) - { - return false; - } - - a_element = a_element->next; - b_element = b_element->next; - } - - /* one of the arrays is longer than the other */ - if (a_element != b_element) { - return false; - } - - return true; - } - - case cJSON_Object: - { - cJSON *a_element = NULL; - cJSON *b_element = NULL; - cJSON_ArrayForEach(a_element, a) - { - /* TODO This has O(n^2) runtime, which is horrible! */ - b_element = get_object_item(b, a_element->string, case_sensitive); - if (b_element == NULL) - { - return false; - } - - if (!cJSON_Compare(a_element, b_element, case_sensitive)) - { - return false; - } - } - - /* doing this twice, once on a and b to prevent true comparison if a subset of b - * TODO: Do this the proper way, this is just a fix for now */ - cJSON_ArrayForEach(b_element, b) - { - a_element = get_object_item(a, b_element->string, case_sensitive); - if (a_element == NULL) - { - return false; - } - - if (!cJSON_Compare(b_element, a_element, case_sensitive)) - { - return false; - } - } - - return true; - } - - default: - return false; - } -} - -CJSON_PUBLIC(void *) cJSON_malloc(size_t size) -{ - return global_hooks.allocate(size); -} - -CJSON_PUBLIC(void) cJSON_free(void *object) -{ - global_hooks.deallocate(object); -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/dependencies/cJSON/cJSON.h b/build/build/dependencies/doTheWorld/dependencies/cJSON/cJSON.h deleted file mode 100644 index 90d80a8..0000000 --- a/build/build/dependencies/doTheWorld/dependencies/cJSON/cJSON.h +++ /dev/null @@ -1,300 +0,0 @@ -/* - Copyright (c) 2009-2017 Dave Gamble and cJSON contributors - - Permission is hereby granted, free of charge, to any person obtaining a copy - of this software and associated documentation files (the "Software"), to deal - in the Software without restriction, including without limitation the rights - to use, copy, modify, merge, publish, distribute, sublicense, and/or sell - copies of the Software, and to permit persons to whom the Software is - furnished to do so, subject to the following conditions: - - The above copyright notice and this permission notice shall be included in - all copies or substantial portions of the Software. - - THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR - IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, - FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE - AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER - LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, - OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN - THE SOFTWARE. -*/ - -#ifndef cJSON__h -#define cJSON__h - -#ifdef __cplusplus -extern "C" -{ -#endif - -#if !defined(__WINDOWS__) && (defined(WIN32) || defined(WIN64) || defined(_MSC_VER) || defined(_WIN32)) -#define __WINDOWS__ -#endif - -#ifdef __WINDOWS__ - -/* When compiling for windows, we specify a specific calling convention to avoid issues where we are being called from a project with a different default calling convention. For windows you have 3 define options: - -CJSON_HIDE_SYMBOLS - Define this in the case where you don't want to ever dllexport symbols -CJSON_EXPORT_SYMBOLS - Define this on library build when you want to dllexport symbols (default) -CJSON_IMPORT_SYMBOLS - Define this if you want to dllimport symbol - -For *nix builds that support visibility attribute, you can define similar behavior by - -setting default visibility to hidden by adding --fvisibility=hidden (for gcc) -or --xldscope=hidden (for sun cc) -to CFLAGS - -then using the CJSON_API_VISIBILITY flag to "export" the same symbols the way CJSON_EXPORT_SYMBOLS does - -*/ - -#define CJSON_CDECL __cdecl -#define CJSON_STDCALL __stdcall - -/* export symbols by default, this is necessary for copy pasting the C and header file */ -#if !defined(CJSON_HIDE_SYMBOLS) && !defined(CJSON_IMPORT_SYMBOLS) && !defined(CJSON_EXPORT_SYMBOLS) -#define CJSON_EXPORT_SYMBOLS -#endif - -#if defined(CJSON_HIDE_SYMBOLS) -#define CJSON_PUBLIC(type) type CJSON_STDCALL -#elif defined(CJSON_EXPORT_SYMBOLS) -#define CJSON_PUBLIC(type) __declspec(dllexport) type CJSON_STDCALL -#elif defined(CJSON_IMPORT_SYMBOLS) -#define CJSON_PUBLIC(type) __declspec(dllimport) type CJSON_STDCALL -#endif -#else /* !__WINDOWS__ */ -#define CJSON_CDECL -#define CJSON_STDCALL - -#if (defined(__GNUC__) || defined(__SUNPRO_CC) || defined (__SUNPRO_C)) && defined(CJSON_API_VISIBILITY) -#define CJSON_PUBLIC(type) __attribute__((visibility("default"))) type -#else -#define CJSON_PUBLIC(type) type -#endif -#endif - -/* project version */ -#define CJSON_VERSION_MAJOR 1 -#define CJSON_VERSION_MINOR 7 -#define CJSON_VERSION_PATCH 15 - -#include - -/* cJSON Types: */ -#define cJSON_Invalid (0) -#define cJSON_False (1 << 0) -#define cJSON_True (1 << 1) -#define cJSON_NULL (1 << 2) -#define cJSON_Number (1 << 3) -#define cJSON_String (1 << 4) -#define cJSON_Array (1 << 5) -#define cJSON_Object (1 << 6) -#define cJSON_Raw (1 << 7) /* raw json */ - -#define cJSON_IsReference 256 -#define cJSON_StringIsConst 512 - -/* The cJSON structure: */ -typedef struct cJSON -{ - /* next/prev allow you to walk array/object chains. Alternatively, use GetArraySize/GetArrayItem/GetObjectItem */ - struct cJSON *next; - struct cJSON *prev; - /* An array or object item will have a child pointer pointing to a chain of the items in the array/object. */ - struct cJSON *child; - - /* The type of the item, as above. */ - int type; - - /* The item's string, if type==cJSON_String and type == cJSON_Raw */ - char *valuestring; - /* writing to valueint is DEPRECATED, use cJSON_SetNumberValue instead */ - int valueint; - /* The item's number, if type==cJSON_Number */ - double valuedouble; - - /* The item's name string, if this item is the child of, or is in the list of subitems of an object. */ - char *string; -} cJSON; - -typedef struct cJSON_Hooks -{ - /* malloc/free are CDECL on Windows regardless of the default calling convention of the compiler, so ensure the hooks allow passing those functions directly. */ - void *(CJSON_CDECL *malloc_fn)(size_t sz); - void (CJSON_CDECL *free_fn)(void *ptr); -} cJSON_Hooks; - -typedef int cJSON_bool; - -/* Limits how deeply nested arrays/objects can be before cJSON rejects to parse them. - * This is to prevent stack overflows. */ -#ifndef CJSON_NESTING_LIMIT -#define CJSON_NESTING_LIMIT 1000 -#endif - -/* returns the version of cJSON as a string */ -CJSON_PUBLIC(const char*) cJSON_Version(void); - -/* Supply malloc, realloc and free functions to cJSON */ -CJSON_PUBLIC(void) cJSON_InitHooks(cJSON_Hooks* hooks); - -/* Memory Management: the caller is always responsible to free the results from all variants of cJSON_Parse (with cJSON_Delete) and cJSON_Print (with stdlib free, cJSON_Hooks.free_fn, or cJSON_free as appropriate). The exception is cJSON_PrintPreallocated, where the caller has full responsibility of the buffer. */ -/* Supply a block of JSON, and this returns a cJSON object you can interrogate. */ -CJSON_PUBLIC(cJSON *) cJSON_Parse(const char *value); -CJSON_PUBLIC(cJSON *) cJSON_ParseWithLength(const char *value, size_t buffer_length); -/* ParseWithOpts allows you to require (and check) that the JSON is null terminated, and to retrieve the pointer to the final byte parsed. */ -/* If you supply a ptr in return_parse_end and parsing fails, then return_parse_end will contain a pointer to the error so will match cJSON_GetErrorPtr(). */ -CJSON_PUBLIC(cJSON *) cJSON_ParseWithOpts(const char *value, const char **return_parse_end, cJSON_bool require_null_terminated); -CJSON_PUBLIC(cJSON *) cJSON_ParseWithLengthOpts(const char *value, size_t buffer_length, const char **return_parse_end, cJSON_bool require_null_terminated); - -/* Render a cJSON entity to text for transfer/storage. */ -CJSON_PUBLIC(char *) cJSON_Print(const cJSON *item); -/* Render a cJSON entity to text for transfer/storage without any formatting. */ -CJSON_PUBLIC(char *) cJSON_PrintUnformatted(const cJSON *item); -/* Render a cJSON entity to text using a buffered strategy. prebuffer is a guess at the final size. guessing well reduces reallocation. fmt=0 gives unformatted, =1 gives formatted */ -CJSON_PUBLIC(char *) cJSON_PrintBuffered(const cJSON *item, int prebuffer, cJSON_bool fmt); -/* Render a cJSON entity to text using a buffer already allocated in memory with given length. Returns 1 on success and 0 on failure. */ -/* NOTE: cJSON is not always 100% accurate in estimating how much memory it will use, so to be safe allocate 5 bytes more than you actually need */ -CJSON_PUBLIC(cJSON_bool) cJSON_PrintPreallocated(cJSON *item, char *buffer, const int length, const cJSON_bool format); -/* Delete a cJSON entity and all subentities. */ -CJSON_PUBLIC(void) cJSON_Delete(cJSON *item); - -/* Returns the number of items in an array (or object). */ -CJSON_PUBLIC(int) cJSON_GetArraySize(const cJSON *array); -/* Retrieve item number "index" from array "array". Returns NULL if unsuccessful. */ -CJSON_PUBLIC(cJSON *) cJSON_GetArrayItem(const cJSON *array, int index); -/* Get item "string" from object. Case insensitive. */ -CJSON_PUBLIC(cJSON *) cJSON_GetObjectItem(const cJSON * const object, const char * const string); -CJSON_PUBLIC(cJSON *) cJSON_GetObjectItemCaseSensitive(const cJSON * const object, const char * const string); -CJSON_PUBLIC(cJSON_bool) cJSON_HasObjectItem(const cJSON *object, const char *string); -/* For analysing failed parses. This returns a pointer to the parse error. You'll probably need to look a few chars back to make sense of it. Defined when cJSON_Parse() returns 0. 0 when cJSON_Parse() succeeds. */ -CJSON_PUBLIC(const char *) cJSON_GetErrorPtr(void); - -/* Check item type and return its value */ -CJSON_PUBLIC(char *) cJSON_GetStringValue(const cJSON * const item); -CJSON_PUBLIC(double) cJSON_GetNumberValue(const cJSON * const item); - -/* These functions check the type of an item */ -CJSON_PUBLIC(cJSON_bool) cJSON_IsInvalid(const cJSON * const item); -CJSON_PUBLIC(cJSON_bool) cJSON_IsFalse(const cJSON * const item); -CJSON_PUBLIC(cJSON_bool) cJSON_IsTrue(const cJSON * const item); -CJSON_PUBLIC(cJSON_bool) cJSON_IsBool(const cJSON * const item); -CJSON_PUBLIC(cJSON_bool) cJSON_IsNull(const cJSON * const item); -CJSON_PUBLIC(cJSON_bool) cJSON_IsNumber(const cJSON * const item); -CJSON_PUBLIC(cJSON_bool) cJSON_IsString(const cJSON * const item); -CJSON_PUBLIC(cJSON_bool) cJSON_IsArray(const cJSON * const item); -CJSON_PUBLIC(cJSON_bool) cJSON_IsObject(const cJSON * const item); -CJSON_PUBLIC(cJSON_bool) cJSON_IsRaw(const cJSON * const item); - -/* These calls create a cJSON item of the appropriate type. */ -CJSON_PUBLIC(cJSON *) cJSON_CreateNull(void); -CJSON_PUBLIC(cJSON *) cJSON_CreateTrue(void); -CJSON_PUBLIC(cJSON *) cJSON_CreateFalse(void); -CJSON_PUBLIC(cJSON *) cJSON_CreateBool(cJSON_bool boolean); -CJSON_PUBLIC(cJSON *) cJSON_CreateNumber(double num); -CJSON_PUBLIC(cJSON *) cJSON_CreateString(const char *string); -/* raw json */ -CJSON_PUBLIC(cJSON *) cJSON_CreateRaw(const char *raw); -CJSON_PUBLIC(cJSON *) cJSON_CreateArray(void); -CJSON_PUBLIC(cJSON *) cJSON_CreateObject(void); - -/* Create a string where valuestring references a string so - * it will not be freed by cJSON_Delete */ -CJSON_PUBLIC(cJSON *) cJSON_CreateStringReference(const char *string); -/* Create an object/array that only references it's elements so - * they will not be freed by cJSON_Delete */ -CJSON_PUBLIC(cJSON *) cJSON_CreateObjectReference(const cJSON *child); -CJSON_PUBLIC(cJSON *) cJSON_CreateArrayReference(const cJSON *child); - -/* These utilities create an Array of count items. - * The parameter count cannot be greater than the number of elements in the number array, otherwise array access will be out of bounds.*/ -CJSON_PUBLIC(cJSON *) cJSON_CreateIntArray(const int *numbers, int count); -CJSON_PUBLIC(cJSON *) cJSON_CreateFloatArray(const float *numbers, int count); -CJSON_PUBLIC(cJSON *) cJSON_CreateDoubleArray(const double *numbers, int count); -CJSON_PUBLIC(cJSON *) cJSON_CreateStringArray(const char *const *strings, int count); - -/* Append item to the specified array/object. */ -CJSON_PUBLIC(cJSON_bool) cJSON_AddItemToArray(cJSON *array, cJSON *item); -CJSON_PUBLIC(cJSON_bool) cJSON_AddItemToObject(cJSON *object, const char *string, cJSON *item); -/* Use this when string is definitely const (i.e. a literal, or as good as), and will definitely survive the cJSON object. - * WARNING: When this function was used, make sure to always check that (item->type & cJSON_StringIsConst) is zero before - * writing to `item->string` */ -CJSON_PUBLIC(cJSON_bool) cJSON_AddItemToObjectCS(cJSON *object, const char *string, cJSON *item); -/* Append reference to item to the specified array/object. Use this when you want to add an existing cJSON to a new cJSON, but don't want to corrupt your existing cJSON. */ -CJSON_PUBLIC(cJSON_bool) cJSON_AddItemReferenceToArray(cJSON *array, cJSON *item); -CJSON_PUBLIC(cJSON_bool) cJSON_AddItemReferenceToObject(cJSON *object, const char *string, cJSON *item); - -/* Remove/Detach items from Arrays/Objects. */ -CJSON_PUBLIC(cJSON *) cJSON_DetachItemViaPointer(cJSON *parent, cJSON * const item); -CJSON_PUBLIC(cJSON *) cJSON_DetachItemFromArray(cJSON *array, int which); -CJSON_PUBLIC(void) cJSON_DeleteItemFromArray(cJSON *array, int which); -CJSON_PUBLIC(cJSON *) cJSON_DetachItemFromObject(cJSON *object, const char *string); -CJSON_PUBLIC(cJSON *) cJSON_DetachItemFromObjectCaseSensitive(cJSON *object, const char *string); -CJSON_PUBLIC(void) cJSON_DeleteItemFromObject(cJSON *object, const char *string); -CJSON_PUBLIC(void) cJSON_DeleteItemFromObjectCaseSensitive(cJSON *object, const char *string); - -/* Update array items. */ -CJSON_PUBLIC(cJSON_bool) cJSON_InsertItemInArray(cJSON *array, int which, cJSON *newitem); /* Shifts pre-existing items to the right. */ -CJSON_PUBLIC(cJSON_bool) cJSON_ReplaceItemViaPointer(cJSON * const parent, cJSON * const item, cJSON * replacement); -CJSON_PUBLIC(cJSON_bool) cJSON_ReplaceItemInArray(cJSON *array, int which, cJSON *newitem); -CJSON_PUBLIC(cJSON_bool) cJSON_ReplaceItemInObject(cJSON *object,const char *string,cJSON *newitem); -CJSON_PUBLIC(cJSON_bool) cJSON_ReplaceItemInObjectCaseSensitive(cJSON *object,const char *string,cJSON *newitem); - -/* Duplicate a cJSON item */ -CJSON_PUBLIC(cJSON *) cJSON_Duplicate(const cJSON *item, cJSON_bool recurse); -/* Duplicate will create a new, identical cJSON item to the one you pass, in new memory that will - * need to be released. With recurse!=0, it will duplicate any children connected to the item. - * The item->next and ->prev pointers are always zero on return from Duplicate. */ -/* Recursively compare two cJSON items for equality. If either a or b is NULL or invalid, they will be considered unequal. - * case_sensitive determines if object primary_keys are treated case sensitive (1) or case insensitive (0) */ -CJSON_PUBLIC(cJSON_bool) cJSON_Compare(const cJSON * const a, const cJSON * const b, const cJSON_bool case_sensitive); - -/* Minify a strings, remove blank characters(such as ' ', '\t', '\r', '\n') from strings. - * The input pointer json cannot point to a read-only address area, such as a string constant, - * but should point to a readable and writable address area. */ -CJSON_PUBLIC(void) cJSON_Minify(char *json); - -/* Helper functions for creating and adding items to an object at the same time. - * They return the added item or NULL on failure. */ -CJSON_PUBLIC(cJSON*) cJSON_AddNullToObject(cJSON * const object, const char * const name); -CJSON_PUBLIC(cJSON*) cJSON_AddTrueToObject(cJSON * const object, const char * const name); -CJSON_PUBLIC(cJSON*) cJSON_AddFalseToObject(cJSON * const object, const char * const name); -CJSON_PUBLIC(cJSON*) cJSON_AddBoolToObject(cJSON * const object, const char * const name, const cJSON_bool boolean); -CJSON_PUBLIC(cJSON*) cJSON_AddNumberToObject(cJSON * const object, const char * const name, const double number); -CJSON_PUBLIC(cJSON*) cJSON_AddStringToObject(cJSON * const object, const char * const name, const char * const string); -CJSON_PUBLIC(cJSON*) cJSON_AddRawToObject(cJSON * const object, const char * const name, const char * const raw); -CJSON_PUBLIC(cJSON*) cJSON_AddObjectToObject(cJSON * const object, const char * const name); -CJSON_PUBLIC(cJSON*) cJSON_AddArrayToObject(cJSON * const object, const char * const name); - -/* When assigning an integer value, it needs to be propagated to valuedouble too. */ -#define cJSON_SetIntValue(object, number) ((object) ? (object)->valueint = (object)->valuedouble = (number) : (number)) -/* helper for the cJSON_SetNumberValue macro */ -CJSON_PUBLIC(double) cJSON_SetNumberHelper(cJSON *object, double number); -#define cJSON_SetNumberValue(object, number) ((object != NULL) ? cJSON_SetNumberHelper(object, (double)number) : (number)) -/* Change the valuestring of a cJSON_String object, only takes effect when type of object is cJSON_String */ -CJSON_PUBLIC(char*) cJSON_SetValuestring(cJSON *object, const char *valuestring); - -/* If the object is not a boolean type this does nothing and returns cJSON_Invalid else it returns the new type*/ -#define cJSON_SetBoolValue(object, boolValue) ( \ - (object != NULL && ((object)->type & (cJSON_False|cJSON_True))) ? \ - (object)->type=((object)->type &(~(cJSON_False|cJSON_True)))|((boolValue)?cJSON_True:cJSON_False) : \ - cJSON_Invalid\ -) - -/* Macro for iterating over an array or object */ -#define cJSON_ArrayForEach(element, array) for(element = (array != NULL) ? (array)->child : NULL; element != NULL; element = element->next) - -/* malloc/free objects using the malloc/free functions that have been set with cJSON_InitHooks */ -CJSON_PUBLIC(void *) cJSON_malloc(size_t size); -CJSON_PUBLIC(void) cJSON_free(void *object); - -#ifdef __cplusplus -} -#endif - -#endif \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/dependencies/sha256/sha-256.c b/build/build/dependencies/doTheWorld/dependencies/sha256/sha-256.c deleted file mode 100644 index 48567da..0000000 --- a/build/build/dependencies/doTheWorld/dependencies/sha256/sha-256.c +++ /dev/null @@ -1,288 +0,0 @@ - - -#define TOTAL_LEN_LEN 8 - -/* - * Comments from pseudo-code at https://en.wikipedia.org/wiki/SHA-2 are reproduced here. - * When useful for clarification, portions of the pseudo-code are reproduced here too. - */ - -/* - * @brief Rotate a 32-bit value by a number of bits to the right. - * @param value The value to be rotated. - * @param count The number of bits to rotate by. - * @return The rotated value. - */ -static inline uint32_t right_rot(uint32_t value, unsigned int count) -{ - /* - * Defined behaviour in standard C for all count where 0 < count < 32, which is what we need here. - */ - return value >> count | value << (32 - count); -} - -/* - * @brief Update a hash value under calculation with a new chunk of data. - * @param h Pointer to the first hash item, of a total of eight. - * @param p Pointer to the chunk data, which has a standard length. - * - * @note This is the SHA-256 work horse. - */ -static inline void consume_chunk(uint32_t *h, const uint8_t *p) -{ - unsigned i, j; - uint32_t ah[8]; - - /* Initialize working variables to current hash value: */ - for (i = 0; i < 8; i++) - ah[i] = h[i]; - - /* - * The w-array is really w[64], but since we only need 16 of them at a time, we save stack by - * calculating 16 at a time. - * - * This optimization was not there initially and the rest of the comments about w[64] are kept in their - * initial state. - */ - - /* - * create a 64-entry message schedule array w[0..63] of 32-bit words (The initial values in w[0..63] - * don't matter, so many implementations zero them here) copy chunk into first 16 words w[0..15] of the - * message schedule array - */ - uint32_t w[16]; - - /* Compression function main loop: */ - for (i = 0; i < 4; i++) { - for (j = 0; j < 16; j++) { - if (i == 0) { - w[j] = - (uint32_t)p[0] << 24 | (uint32_t)p[1] << 16 | (uint32_t)p[2] << 8 | (uint32_t)p[3]; - p += 4; - } else { - /* Extend the first 16 words into the remaining 48 words w[16..63] of the - * message schedule array: */ - const uint32_t s0 = right_rot(w[(j + 1) & 0xf], 7) ^ right_rot(w[(j + 1) & 0xf], 18) ^ - (w[(j + 1) & 0xf] >> 3); - const uint32_t s1 = right_rot(w[(j + 14) & 0xf], 17) ^ - right_rot(w[(j + 14) & 0xf], 19) ^ (w[(j + 14) & 0xf] >> 10); - w[j] = w[j] + s0 + w[(j + 9) & 0xf] + s1; - } - const uint32_t s1 = right_rot(ah[4], 6) ^ right_rot(ah[4], 11) ^ right_rot(ah[4], 25); - const uint32_t ch = (ah[4] & ah[5]) ^ (~ah[4] & ah[6]); - - /* - * Initialize array of round constants: - * (first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311): - */ - static const uint32_t k[] = { - 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, - 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, - 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, - 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, - 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, - 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b, - 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116, - 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, - 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, - 0xc67178f2}; - - const uint32_t temp1 = ah[7] + s1 + ch + k[i << 4 | j] + w[j]; - const uint32_t s0 = right_rot(ah[0], 2) ^ right_rot(ah[0], 13) ^ right_rot(ah[0], 22); - const uint32_t maj = (ah[0] & ah[1]) ^ (ah[0] & ah[2]) ^ (ah[1] & ah[2]); - const uint32_t temp2 = s0 + maj; - - ah[7] = ah[6]; - ah[6] = ah[5]; - ah[5] = ah[4]; - ah[4] = ah[3] + temp1; - ah[3] = ah[2]; - ah[2] = ah[1]; - ah[1] = ah[0]; - ah[0] = temp1 + temp2; - } - } - - /* Add the compressed chunk to the current hash value: */ - for (i = 0; i < 8; i++) - h[i] += ah[i]; -} - -/* - * Public functions. See header file for documentation. - */ - -void sha_256_init(struct Sha_256 *sha_256, uint8_t hash[SIZE_OF_SHA_256_HASH]) -{ - sha_256->hash = hash; - sha_256->chunk_pos = sha_256->chunk; - sha_256->space_left = SIZE_OF_SHA_256_CHUNK; - sha_256->total_len = 0; - /* - * Initialize hash values (first 32 bits of the fractional parts of the square roots of the first 8 primes - * 2..19): - */ - sha_256->h[0] = 0x6a09e667; - sha_256->h[1] = 0xbb67ae85; - sha_256->h[2] = 0x3c6ef372; - sha_256->h[3] = 0xa54ff53a; - sha_256->h[4] = 0x510e527f; - sha_256->h[5] = 0x9b05688c; - sha_256->h[6] = 0x1f83d9ab; - sha_256->h[7] = 0x5be0cd19; -} - -void sha_256_write(struct Sha_256 *sha_256, const void *data, size_t len) -{ - sha_256->total_len += len; - - - const uint8_t *p = (const uint8_t *)data; - - - while (len > 0) { - /* - * If the input chunks have sizes that are multiples of the calculation chunk size, no copies are - * necessary. We operate directly on the input data instead. - */ - if (sha_256->space_left == SIZE_OF_SHA_256_CHUNK && len >= SIZE_OF_SHA_256_CHUNK) { - consume_chunk(sha_256->h, p); - len -= SIZE_OF_SHA_256_CHUNK; - p += SIZE_OF_SHA_256_CHUNK; - continue; - } - /* General case, no particular optimization. */ - const size_t consumed_len = len < sha_256->space_left ? len : sha_256->space_left; - memcpy(sha_256->chunk_pos, p, consumed_len); - sha_256->space_left -= consumed_len; - len -= consumed_len; - p += consumed_len; - if (sha_256->space_left == 0) { - consume_chunk(sha_256->h, sha_256->chunk); - sha_256->chunk_pos = sha_256->chunk; - sha_256->space_left = SIZE_OF_SHA_256_CHUNK; - } else { - sha_256->chunk_pos += consumed_len; - } - } -} - -uint8_t *sha_256_close(struct Sha_256 *sha_256) -{ - uint8_t *pos = sha_256->chunk_pos; - size_t space_left = sha_256->space_left; - uint32_t *const h = sha_256->h; - - /* - * The current chunk cannot be full. Otherwise, it would already have be consumed. I.e. there is space left for - * at least one byte. The next step in the calculation is to add a single one-bit to the data. - */ - *pos++ = 0x80; - --space_left; - - /* - * Now, the last step is to add the total data length at the end of the last chunk, and zero padding before - * that. But we do not necessarily have enough space left. If not, we pad the current chunk with zeroes, and add - * an extras chunk at the end. - */ - if (space_left < TOTAL_LEN_LEN) { - memset(pos, 0x00, space_left); - consume_chunk(h, sha_256->chunk); - pos = sha_256->chunk; - space_left = SIZE_OF_SHA_256_CHUNK; - } - const size_t left = space_left - TOTAL_LEN_LEN; - memset(pos, 0x00, left); - pos += left; - size_t len = sha_256->total_len; - pos[7] = (uint8_t)(len << 3); - len >>= 5; - int i; - for (i = 6; i >= 0; --i) { - pos[i] = (uint8_t)len; - len >>= 8; - } - consume_chunk(h, sha_256->chunk); - /* Produce the final hash value (big-endian): */ - int j; - uint8_t *const hash = sha_256->hash; - for (i = 0, j = 0; i < 8; i++) { - hash[j++] = (uint8_t)(h[i] >> 24); - hash[j++] = (uint8_t)(h[i] >> 16); - hash[j++] = (uint8_t)(h[i] >> 8); - hash[j++] = (uint8_t)h[i]; - } - return sha_256->hash; -} - -char * sha256_open_file(const char *filename, int *size){ - FILE *file = fopen(filename, "rb"); - if (file == NULL) { - return NULL; - } - fseek(file,0,SEEK_END); - *size = ftell(file); - fseek(file,0,SEEK_SET); - char *content = (char*)malloc(*size +1); - fread(content,1,*size,file); - fclose(file); - return content; -} - -//Wrapper functions -void calc_sha_256(uint8_t hash[SIZE_OF_SHA_256_HASH], const void *input, size_t len) -{ - struct Sha_256 sha_256; - sha_256_init(&sha_256, hash); - sha_256_write(&sha_256, input, len); - (void)sha_256_close(&sha_256); -} - -char * calc_sha_256_returning_string(const void *input, size_t len) -{ - - - uint8_t hash[SIZE_OF_SHA_256_HASH]; - calc_sha_256(hash, input, len); - char *hash_string = (char*)malloc(SIZE_OF_SHA_256_HASH * 2 + 1); - for (unsigned int i = 0; i < SIZE_OF_SHA_256_HASH; i++) { - sprintf(hash_string + i * 2, "%02x", hash[i]); - } - return hash_string; -} - -void calc_sha_256_from_string(uint8_t hash[SIZE_OF_SHA_256_HASH], const char *input) -{ - calc_sha_256(hash, input, strlen(input)); - -} - -char * calc_sha_256_from_string_returning_string(const char *input) -{ - return calc_sha_256_returning_string(input, strlen(input)); -} - -int calc_sha_256_from_file(uint8_t hash[SIZE_OF_SHA_256_HASH], const char *filename) -{ - int size; - char *content = sha256_open_file(filename, &size); - if(content == NULL){ - return -1; - } - calc_sha_256(hash, content, size); - free(content); - return 0; -} - -char * calc_sha_256_from_file_returning_string(const char *filename) -{ - int size; - char *content = sha256_open_file(filename, &size); - if(content == NULL){ - return NULL; - } - char *hash_string = calc_sha_256_returning_string(content, size); - free(content); - return hash_string; - -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/dependencies/sha256/sha-256.h b/build/build/dependencies/doTheWorld/dependencies/sha256/sha-256.h deleted file mode 100644 index 03d8e97..0000000 --- a/build/build/dependencies/doTheWorld/dependencies/sha256/sha-256.h +++ /dev/null @@ -1,136 +0,0 @@ -#ifndef SHA_256_H -#define SHA_256_H - -#include -#include -#include - -#ifdef __cplusplus -extern "C" { -#endif - -/* - * @brief Size of the SHA-256 sum. This times eight is 256 bits. - */ -#define SIZE_OF_SHA_256_HASH 32 - -/* - * @brief Size of the chunks used for the calculations. - * - * @note This should mostly be ignored by the user, although when using the streaming API, it has an impact for - * performance. Add chunks whose size is a multiple of this, and you will avoid a lot of superfluous copying in RAM! - */ -#define SIZE_OF_SHA_256_CHUNK 64 - -/* - * @brief The opaque SHA-256 type, that should be instantiated when using the streaming API. - * - * @note Although the details are exposed here, in order to make instantiation easy, you should refrain from directly - * accessing the fields, as they may change in the future. - */ -struct Sha_256 { - uint8_t *hash; - uint8_t chunk[SIZE_OF_SHA_256_CHUNK]; - uint8_t *chunk_pos; - size_t space_left; - size_t total_len; - uint32_t h[8]; -}; - -/* - * @brief The simple SHA-256 calculation function. - * @param hash Hash array, where the result is delivered. - * @param input Pointer to the data the hash shall be calculated on. - * @param len Length of the input data, in byte. - * - * @note If all of the data you are calculating the hash value on is available in a contiguous buffer in memory, this is - * the function you should use. - * - * @note If either of the passed pointers is NULL, the results are unpredictable. - */ -void calc_sha_256(uint8_t hash[SIZE_OF_SHA_256_HASH], const void *input, size_t len); - -/* - * @brief Initialize a SHA-256 streaming calculation. - * @param sha_256 A pointer to a SHA-256 structure. - * @param hash Hash array, where the result will be delivered. - * - * @note If all of the data you are calculating the hash value on is not available in a contiguous buffer in memory, this is - * where you should start. Instantiate a SHA-256 structure, for instance by simply declaring it locally, make your hash - * buffer available, and invoke this function. Once a SHA-256 hash has been calculated (see further below) a SHA-256 - * structure can be initialized again for the next calculation. - * - * @note If either of the passed pointers is NULL, the results are unpredictable. - */ - -char * calc_sha_256_returning_string(const void *input, size_t len); -/* - @param input: the string to be hashed - @param len: the length of the string - @return: the hash of the string - @note: if the input string is NULL, the results are unpredictable -*/ - -void calc_sha_256_from_string(uint8_t hash[SIZE_OF_SHA_256_HASH], const char *input); -/* - @param hash: the hash array, where the result is delivered - @param input: the string to be hashed - @note: if the input string is NULL, the results are unpredictable -*/ - -int calc_sha_256_from_file(uint8_t hash[SIZE_OF_SHA_256_HASH], const char *filename); -/* - @param hash: the hash array, where the result is delivered - @param filename: the name of the file to be hashed - @return: 0 if the file was hashed successfully, -1 otherwise -*/ - -char * calc_sha_256_from_file_returning_string(const char *filename); -/* - @param filename: the name of the file to be hashed - @return: the hash of the file - @note: if the filename is NULL, the return value is NULL -*/ - -void sha_256_init(struct Sha_256 *sha_256, uint8_t hash[SIZE_OF_SHA_256_HASH]); - -/* - * @brief Stream more input data for an on-going SHA-256 calculation. - * @param sha_256 A pointer to a previously initialized SHA-256 structure. - * @param data Pointer to the data to be added to the calculation. - * @param len Length of the data to add, in byte. - * - * @note This function may be invoked an arbitrary number of times between initialization and closing, but the maximum - * data length is limited by the SHA-256 algorithm: the total number of bits (i.e. the total number of bytes times - * eight) must be representable by a 64-bit unsigned integer. While that is not a practical limitation, the results are - * unpredictable if that limit is exceeded. - * - * @note This function may be invoked on empty data (zero length), although that obviously will not add any data. - * - * @note If either of the passed pointers is NULL, the results are unpredictable. - */ -void sha_256_write(struct Sha_256 *sha_256, const void *data, size_t len); - -/* - * @brief Conclude a SHA-256 streaming calculation, making the hash value available. - * @param sha_256 A pointer to a previously initialized SHA-256 structure. - * @return Pointer to the hash array, where the result is delivered. - * - * @note After this function has been invoked, the result is available in the hash buffer that initially was provided. A - * pointer to the hash value is returned for convenience, but you should feel free to ignore it: it is simply a pointer - * to the first byte of your initially provided hash array. - * - * @note If the passed pointer is NULL, the results are unpredictable. - * - * @note Invoking this function for a calculation with no data (the writing function has never been invoked, or it only - * has been invoked with empty data) is legal. It will calculate the SHA-256 value of the empty string. - */ -uint8_t *sha_256_close(struct Sha_256 *sha_256); - - - -#ifdef __cplusplus -} -#endif - -#endif \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/extras/extras.c b/build/build/dependencies/doTheWorld/extras/extras.c deleted file mode 100644 index fc4b2cc..0000000 --- a/build/build/dependencies/doTheWorld/extras/extras.c +++ /dev/null @@ -1,156 +0,0 @@ - -char * dtw_generate_sha_from_file(const char *path){ - return calc_sha_256_from_file_returning_string(path); -} - -char * dtw_generate_sha_from_any(void *anything , long size){ - if(anything ==NULL) { - return NULL; - } - return calc_sha_256_returning_string(anything,size); -} - -char * dtw_generate_sha_from_string(const char *string){ - if(string == NULL) { - return NULL; - } - return calc_sha_256_from_string_returning_string(string); -} - - -long int dtw_get_entity_last_motification_in_unix(const char *path){ - struct stat attr; - if(stat(path, &attr) != 0) { - return -1; - } - - time_t last_modification_in_unix = attr.st_mtime; - - return last_modification_in_unix; -} - -char * dtw_convert_unix_time_to_string(long int unix_time){ - struct tm * timeinfo; - #ifdef _WIN32 - //get timeinfo from windows - time_t rawtime = unix_time; - timeinfo = localtime(&rawtime); - #else - timeinfo = localtime(&unix_time); - #endif - char *time_string = (char *)malloc(100); - strftime(time_string, 100, "%Y-%m-%d %H:%M:%S", timeinfo); - return time_string; -} - -char * dtw_get_entity_last_motification_in_string(const char *path){ - long int last_modification_in_unix = dtw_get_entity_last_motification_in_unix(path); - char *last_modification_in_string = dtw_convert_unix_time_to_string(last_modification_in_unix); - return last_modification_in_string; -} - -const char * private_dtw_convert_action_to_string(short action){ - switch (action){ - case DTW_REMOVE: - return "remove"; - case DTW_WRITE: - return "write"; - case DTW_MODIFY: - return "modify"; - } - return NULL; -} - -short private_dtw_convert_string_to_action(const char *action){ - if(strcmp(action,"remove") == 0){ - return DTW_REMOVE; - } - if(strcmp(action,"write") == 0){ - return DTW_WRITE; - } - if(strcmp(action,"modify") == 0){ - return DTW_MODIFY; - } - return -1; -} - -void private_dtw_add_end_bar_to_dirs_string_array(struct DtwStringArray * dirs){ - for(int i = 0; i < dirs->size; i++){ - - if(!dtw_ends_with(dirs->strings[i], "/") || !dtw_ends_with(dirs->strings[i],"\\")){ - char *formated_dir = (char*)malloc(strlen(dirs->strings[i]) + 3); - sprintf(formated_dir,"%s/",dirs->strings[i]); - DtwStringArray_set_value(dirs, i, formated_dir); - free(formated_dir); - } - - - } -} - - - -struct DtwStringArray* private_dtw_remove_start_path(struct DtwStringArray *paths,const char *rm_path){ - - char *path_to_remove = dtw_replace_string(rm_path,"//","/"); - - int size_to_remove = strlen(path_to_remove) +1; - - if(dtw_ends_with(path_to_remove,"/")){ - size_to_remove-=1; - } - - - struct DtwStringArray *new_array = newDtwStringArray(); - - for(int i =0; i < paths->size; i++){ - - char *current_path_string = paths->strings[i]; - int current_path_string_size = strlen(current_path_string); - - char *new_string = (char*)malloc(current_path_string_size +2); - new_string[current_path_string_size] =0; - - strcpy(new_string,current_path_string); - memmove( - new_string, - current_path_string+size_to_remove, - strlen(current_path_string) - size_to_remove +1 - ); - if(strcmp(new_string,"/") == 0 || strcmp(new_string,"") == 0){ - free(new_string); - continue; - } - - DtwStringArray_append(new_array, new_string); - free(new_string); - - } - free(path_to_remove); - return new_array; -} - - -long dtw_get_time(){ -#ifdef DTW_DEBUG_TIME - return 0; -#endif - return time(NULL); -} -long private_dtw_convert_index(long index,long size){ - - long converted_index = index; - - if(converted_index < 0){ - converted_index = size + converted_index; - } - - if(converted_index >= size){ - return size -1; - } - if(converted_index < 0){ - return 0; - } - - return converted_index; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/extras/extras.h b/build/build/dependencies/doTheWorld/extras/extras.h deleted file mode 100644 index b1c114c..0000000 --- a/build/build/dependencies/doTheWorld/extras/extras.h +++ /dev/null @@ -1,19 +0,0 @@ - -char * dtw_generate_sha_from_file(const char *path); -char * dtw_generate_sha_from_string(const char *string); -char * dtw_generate_sha_from_any(void *anything , long size); - -long int dtw_get_entity_last_motification_in_unix(const char *path); -char * dtw_convert_unix_time_to_string(long int unix_time); -char * dtw_get_entity_last_motification_in_string(const char *path); -const char * private_dtw_convert_action_to_string(short action); -short private_dtw_convert_string_to_action(const char *action); -void private_dtw_add_end_bar_to_dirs_string_array(struct DtwStringArray * dirs); - -long private_dtw_convert_index(long index,long size); - - -long dtw_get_time(); - - - diff --git a/build/build/dependencies/doTheWorld/globals.h b/build/build/dependencies/doTheWorld/globals.h deleted file mode 100644 index 281ea31..0000000 --- a/build/build/dependencies/doTheWorld/globals.h +++ /dev/null @@ -1,4 +0,0 @@ - - - -const char dtw_base64_table[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; diff --git a/build/build/dependencies/doTheWorld/hash/hash.c b/build/build/dependencies/doTheWorld/hash/hash.c deleted file mode 100644 index 4fbda4c..0000000 --- a/build/build/dependencies/doTheWorld/hash/hash.c +++ /dev/null @@ -1,179 +0,0 @@ - - - - - - -DtwHash * newDtwHash(){ - DtwHash *self = (DtwHash*) malloc(sizeof(DtwHash)); - self->hash = dtw_generate_sha_from_string(""); - return self; -} - -bool DtwHash_digest_any(DtwHash *self,unsigned char *content,long size){ - if(content == NULL){ - return false; - } - char *generated = dtw_generate_sha_from_any(content,size); - char result[300] ={0}; - sprintf(result,"%s%s",self->hash,generated); - free(generated); - free(self->hash); - self->hash = dtw_generate_sha_from_string(result); - return true; -} - -bool DtwHash_digest_string(DtwHash * self, const char *content){ - return DtwHash_digest_any(self,(unsigned char *)content, (long)strlen(content)); -} - -void DtwHash_digest_long(DtwHash * self,long content){ - char formated[20] ={0}; - sprintf(formated,"%ld",content); - DtwHash_digest_string(self,formated); -} - -void DtwHash_digest_double(DtwHash * self,double content){ - char formated[20] ={0}; - sprintf(formated,"%lf",content); - DtwHash_digest_string(self,formated); -} - -void DtwHash_digest_bool(DtwHash * self,bool content){ - char formated[20] ={0}; - sprintf(formated,"%d",(bool)content); - DtwHash_digest_string(self,formated); -} - -bool DtwHash_digest_file(DtwHash * self, const char *path){ - - long size; - unsigned char *content = dtw_load_binary_content(path,&size); - if(!content){ - return false; - } - DtwHash_digest_any(self,content,size); - free(content); - return true; -} - -bool DtwHash_digest_entity_last_modification(DtwHash * self, const char *path){ - long last_modification = dtw_get_entity_last_motification_in_unix(path); - if(last_modification == -1){ - return false; - } - DtwHash_digest_long(self,last_modification); - return true; -} - - -bool DtwHash_digest_string_array(DtwHash *self,DtwStringArray *element){ - if(element->size == 0){ - return false; - } - DtwStringArray *clone = DtwStringArray_clone(element); - DtwStringArray_sort(clone); - - for(int i =0 ; i < clone->size; i++){ - DtwHash_digest_string(self,clone->strings[i]); - } - DtwStringArray_free(clone); - return true; -} - -bool DtwHash_digest_string_array_last_modifications(DtwHash *self,DtwStringArray *element){ - if(element->size == 0){ - return false; - } - DtwStringArray *clone = DtwStringArray_clone(element); - DtwStringArray_sort(clone); - for(int i =0 ; i < clone->size; i++){ - DtwHash_digest_entity_last_modification(self, clone->strings[i]); - } - DtwStringArray_free(clone); - return true; -} - -bool DtwHash_digest_string_array_last_modifications_adding_name(DtwHash *self,DtwStringArray *element){ - if(element->size == 0){ - return false; - } - DtwStringArray *clone = DtwStringArray_clone(element); - DtwStringArray_sort(clone); - for(int i =0 ; i < clone->size; i++){ - DtwHash_digest_string(self,clone->strings[i]); - DtwHash_digest_entity_last_modification(self, clone->strings[i]); - } - DtwStringArray_free(clone); - return true; -} - - -bool DtwHash_digest_string_array_content(DtwHash *self,DtwStringArray *element){ - if(element->size == 0){ - return false; - } - DtwStringArray *clone = DtwStringArray_clone(element); - DtwStringArray_sort(clone); - for(int i =0 ; i < clone->size; i++){ - DtwHash_digest_file(self,clone->strings[i]); - } - DtwStringArray_free(clone); - return true; -} - -bool DtwHash_digest_string_array_content_adding_name(DtwHash *self,DtwStringArray *element){ - if(element->size == 0){ - return false; - } - DtwStringArray *clone = DtwStringArray_clone(element); - DtwStringArray_sort(clone); - for(int i =0; i < clone->size; i++){ - DtwHash_digest_string(self,clone->strings[i]); - DtwHash_digest_file(self,clone->strings[i]); - } - DtwStringArray_free(clone); - return true; -} - - -bool DtwHash_digest_folder_by_last_modification(DtwHash *self,const char *path){ - DtwStringArray *folder = dtw_list_all_recursively(path,DTW_NOT_CONCAT_PATH); - if(folder->size == 0){ - DtwStringArray_free(folder); - return false; - } - DtwStringArray_sort(folder); - for(int i =0; i < folder->size; i++){ - DtwHash_digest_string(self,folder->strings[i]); - char *formated_path = dtw_concat_path(path,folder->strings[i]); - - DtwHash_digest_entity_last_modification(self, formated_path); - free(formated_path); - } - DtwStringArray_free(folder); - return true; -} - -bool DtwHash_digest_folder_by_content(DtwHash *self,const char *path){ - - DtwStringArray *folder = dtw_list_all_recursively(path,DTW_NOT_CONCAT_PATH); - if(folder->size == 0){ - DtwStringArray_free(folder); - return false; - } - DtwStringArray_sort(folder); - for(int i =0; i < folder->size; i++){ - DtwHash_digest_string(self,folder->strings[i]); - char *formated_path = dtw_concat_path(path,folder->strings[i]); - DtwHash_digest_file(self,formated_path); - free(formated_path); - } - DtwStringArray_free(folder); - return true; -} - -void DtwHash_free(DtwHash *self){ - free(self->hash); - free(self); -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/hash/hash.h b/build/build/dependencies/doTheWorld/hash/hash.h deleted file mode 100644 index 0c37deb..0000000 --- a/build/build/dependencies/doTheWorld/hash/hash.h +++ /dev/null @@ -1,42 +0,0 @@ - - -typedef struct DtwHash{ - char *hash; -}DtwHash; - - -DtwHash * newDtwHash(); - -bool DtwHash_digest_any(DtwHash *self,unsigned char *content,long size); - -bool DtwHash_digest_string(DtwHash * self, const char *content); - -void DtwHash_digest_long(DtwHash * self,long content); - -void DtwHash_digest_double(DtwHash * self,double content); - -void DtwHash_digest_bool(DtwHash * self,bool content); - -bool DtwHash_digest_file(DtwHash * self, const char *path); - -bool DtwHash_digest_entity_last_modification(DtwHash * self, const char *path); - -bool DtwHash_digest_folder_by_last_modification(DtwHash *self,const char *path); - -bool DtwHash_digest_folder_by_content(DtwHash *self,const char *path); - - -bool DtwHash_digest_string_array(DtwHash *self,DtwStringArray *element); - -bool DtwHash_digest_string_array_last_modifications(DtwHash *self,DtwStringArray *element); - -bool DtwHash_digest_string_array_last_modifications_adding_name(DtwHash *self,DtwStringArray *element); - - -bool DtwHash_digest_string_array_content(DtwHash *self,DtwStringArray *element); - -bool DtwHash_digest_string_array_content_adding_name(DtwHash *self,DtwStringArray *element); - - -void DtwHash_free(DtwHash *self); - diff --git a/build/build/dependencies/doTheWorld/io/io.c b/build/build/dependencies/doTheWorld/io/io.c deleted file mode 100644 index 2d3d461..0000000 --- a/build/build/dependencies/doTheWorld/io/io.c +++ /dev/null @@ -1,409 +0,0 @@ - -#ifdef __linux__ -#define dtw_create_dir(path) mkdir(path,0777) -#elif _WIN32 -#define dtw_create_dir(path) _mkdir(path) -#endif - - - -void dtw_create_dir_recursively(const char *path){ - - int entity =dtw_entity_type(path); - - if(entity == DTW_FOLDER_TYPE){ - return; - } - - if(entity == DTW_FILE_TYPE){ - remove(path); - } - - - long size_path = strlen(path); - for(int i=0;i < size_path;i++){ - if((path[i] == '\\' || path[i] == '/' ) &&( i != size_path - 1)){ - - char * current_path = (char*)malloc(i + 1); - current_path[i] = '\0'; - strncpy(current_path,path,i); - - if(dtw_entity_type(current_path) == DTW_FILE_TYPE){ - remove(current_path); - } - - dtw_create_dir(current_path); - - free(current_path); - } - } - - dtw_create_dir(path); -} - -char *dtw_get_current_dir(){ - char *path = (char*)malloc(1024); - getcwd(path,1024); - char*path_with_bar = (char*)malloc(strlen(path) + 2); - sprintf(path_with_bar,"%s/",path); - free(path); - return path_with_bar; -} - - - -bool dtw_remove_any(const char* path) { - //means is an file - if(remove(path) == 0){ - return true; - } - - struct DtwStringArray *files = dtw_list_files_recursively(path,DTW_CONCAT_PATH); - int files_size = files->size; - for(int i = 0; i < files_size; i++){ - remove(files->strings[i]); - } - DtwStringArray_free(files); - - - struct DtwStringArray *dirs = dtw_list_dirs_recursively(path,DTW_CONCAT_PATH); - int dirs_size = dirs->size; - for(int i = dirs->size -1; i >=0; i--){ - rmdir(dirs->strings[i]); - } - DtwStringArray_free(dirs); - //remove / to the path - if(files_size ||dirs_size){ - return true; - } - return false; - - -} - - - -unsigned char *dtw_load_any_content(const char * path,long *size,bool *is_binary){ - - *is_binary = false; - *size = 0; - - int entity = dtw_entity_type(path); - if(entity != DTW_FILE_TYPE){ - return NULL; - } - FILE *file = fopen(path,"rb"); - - if(!file){ - return NULL; - } - - - if(fseek(file,0,SEEK_END) == -1){ - fclose(file); - return NULL; - } - - - *size = ftell(file); - - if(*size == -1){ - fclose(file); - return NULL; - } - - if(*size == 0){ - fclose(file); - return NULL; - } - - - if(fseek(file,0,SEEK_SET) == -1){ - fclose(file); - return NULL; - } - - unsigned char *content = (unsigned char*)malloc(*size +1); - int bytes_read = fread(content,1,*size,file); - if(bytes_read <=0 ){ - free(content); - fclose(file); - return NULL; - } - - - *is_binary = false; - for(int i = 0;i < *size;i++){ - if(content[i] == 0){ - *is_binary = true; - break; - } - } - if(!*is_binary){ - content[*size] = '\0'; - } - - fclose(file); - return content; -} - - -char *dtw_load_string_file_content(const char * path){ - long size; - bool is_binary; - unsigned char *element = dtw_load_any_content(path,&size,&is_binary); - if(!element){ - - if(dtw_entity_type(path) == DTW_FILE_TYPE){ - return strdup(""); - } - return NULL; - } - - if(is_binary){ - free(element); - return NULL; - } - return (char*)element; -} - - -unsigned char *dtw_load_binary_content(const char * path,long *size){ - bool is_binary; - return dtw_load_any_content(path,size,&is_binary); -} - - -bool dtw_write_any_content(const char *path,unsigned char *content,long size){ - //Iterate through the path and create directories if they don't exist - int entity_type =dtw_entity_type(path); - if(entity_type == DTW_FOLDER_TYPE){ - dtw_remove_any(path); - } - - - if(entity_type == DTW_NOT_FOUND){ - long path_size = (long)strlen(path); - for(long i = path_size-1;i > 0;i--){ - //runs in negative mode til / or \ is found - if(path[i] == '\\' || path[i] == '/'){ - char *dir_path =(char*)malloc(i +2); - dir_path[i] = '\0'; - strncpy(dir_path,path,i); - - dtw_create_dir_recursively(dir_path); - free(dir_path); - - break; - } - } - } - - FILE *file = fopen(path,"wb"); - if(file == NULL){ - - return false; - } - - fwrite(content, sizeof(char),size, file); - - fclose(file); - return true; -} - - -bool dtw_write_string_file_content(const char *path,const char *content){ - long size; - if(content == NULL){ - size = 0; - } - else{ - size = (long)strlen(content); - } - return dtw_write_any_content(path,(unsigned char*)content,size); -} - - -int dtw_entity_type(const char *path){ - //returns 1 for file, 2 for directory, -1 for not found - struct stat path_stat; - - if(stat(path,&path_stat) == 0){ - if(S_ISREG(path_stat.st_mode)){ - return DTW_FILE_TYPE; - }else if(S_ISDIR(path_stat.st_mode)){ - return DTW_FOLDER_TYPE; - } - } - return DTW_NOT_FOUND; - -} - - -int dtw_complex_entity_type(const char *path){ - int entity = dtw_entity_type(path); - if(entity != DTW_FILE_TYPE){ - return entity; - } - long size; - bool is_binary; - char *data = (char*)dtw_load_any_content(path,&size,&is_binary); - if(is_binary){ - free(data); - return DTW_COMPLEX_BINARY; - } - - if( - strcmp(data,"t") == 0 || - strcmp(data,"f") == 0 || - strcmp(data,"true") == 0 || - strcmp(data,"false") == 0 - ){ - free(data); - return DTW_COMPLEX_BOOL_TYPE; - } - - - double value; - int result = sscanf(data,"%lf",&value); - if(result == 0){ - free(data); - return DTW_COMPLEX_STRING_TYPE; - } - for(int i = 0; i < size; i++){ - char current = data[i]; - if(current == '.'){ - free(data); - return DTW_COMPLEX_DOUBLE_TYPE; - } - } - free(data); - return DTW_COMPLEX_LONG_TYPE; -} - -long dtw_get_total_itens_of_dir(const char *path){ - - #ifdef __linux__ - - DIR *dir = opendir(path); - if (dir == NULL) { - return -1; - } - int i = 0; - while ((readdir(dir)) != NULL){ - i++; - } - closedir(dir); - return i -2; - #else - WIN32_FIND_DATA findFileData; - HANDLE hFind = FindFirstFile(path, &findFileData); - - if (hFind == INVALID_HANDLE_VALUE) { - return -1; - } - - int i = 0; - do { - if (!(findFileData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY)) { - i++; - } - } while (FindNextFile(hFind, &findFileData) != 0); - - FindClose(hFind); - return i; - - #endif -} - -const char *dtw_convert_entity(int entity_type){ - if(entity_type == DTW_FILE_TYPE){ - return "file"; - } - if(entity_type == DTW_FOLDER_TYPE){ - return "folder"; - } - if(entity_type == DTW_NOT_FOUND){ - return "null"; - } - if(entity_type == DTW_COMPLEX_BINARY){ - return "binary"; - } - if(entity_type == DTW_COMPLEX_STRING_TYPE){ - return "string"; - } - if(entity_type == DTW_COMPLEX_BOOL_TYPE){ - return "bool"; - } - if(entity_type == DTW_COMPLEX_LONG_TYPE){ - return "long"; - } - if(entity_type == DTW_COMPLEX_DOUBLE_TYPE){ - return "double"; - } - return "invalid"; -} - -bool dtw_copy_any(const char* src_path,const char* dest_path,bool merge) { - - //verify if is an file - int type = dtw_entity_type(src_path); - if(type == DTW_NOT_FOUND){ - return false; - } - - if(type == DTW_FILE_TYPE){ - - long size; - bool is_binary; - unsigned char *content = dtw_load_any_content(src_path,&size,&is_binary); - bool result = dtw_write_any_content(dest_path,content,size); - free(content); - return result; - } - //means is an directory - - //remove the previous directory if merge is false - if(!merge){ - dtw_remove_any(dest_path); - } - //creating dirs - struct DtwStringArray *dirs = dtw_list_dirs_recursively(src_path,DTW_CONCAT_PATH); - - int size = dirs->size; - int src_path_size = strlen(src_path); - - for(int i = 0; i < size; i++){ - char *new_path_dir = private_dtw_change_beginning_of_string(dirs->strings[i],src_path_size,dest_path); - dtw_create_dir_recursively(new_path_dir); - free(new_path_dir); - } - DtwStringArray_free(dirs); - - - struct DtwStringArray *files = dtw_list_files_recursively(src_path,DTW_CONCAT_PATH); - - for(int i = 0; i < files->size; i++){ - long file_size; - bool is_binary; - unsigned char *content = dtw_load_any_content(files->strings[i],&file_size,&is_binary); - char *new_path = private_dtw_change_beginning_of_string(files->strings[i],src_path_size,dest_path); - - dtw_write_any_content(new_path,content,file_size); - free(content); - free(new_path); - - - } - - DtwStringArray_free(files); - - return true; - -} - -bool dtw_move_any(const char* src_path, const char* dest_path,bool merge) { - bool result = dtw_copy_any(src_path,dest_path,merge); - dtw_remove_any(src_path); - return result; -} diff --git a/build/build/dependencies/doTheWorld/io/io.h b/build/build/dependencies/doTheWorld/io/io.h deleted file mode 100644 index 0111fdf..0000000 --- a/build/build/dependencies/doTheWorld/io/io.h +++ /dev/null @@ -1,56 +0,0 @@ - -#define DTW_FILE_TYPE 1 -#define DTW_FOLDER_TYPE 2 -#define DTW_ALL_TYPE 3 -#define DTW_NOT_FOUND -1 - -#define DTW_COMPLEX_BINARY 10 -#define DTW_COMPLEX_STRING_TYPE 11 -#define DTW_COMPLEX_LONG_TYPE 12 -#define DTW_COMPLEX_DOUBLE_TYPE 13 -#define DTW_COMPLEX_BOOL_TYPE 14 - -#define DTW_MERGE true - - -#define DTW_NOT_MERGE false -#ifdef __linux__ -#define dtw_create_dir(path) mkdir(path,0777) -#elif _WIN32 -#define dtw_create_dir(path) _mkdir(path) -#endif - -void dtw_create_dir_recursively(const char *path); - -bool dtw_remove_any(const char* path); - -char *dtw_get_current_dir(); - -long dtw_get_total_itens_of_dir(const char *path); - -unsigned char *dtw_load_any_content(const char * path,long *size,bool *is_binary); - -char *dtw_load_string_file_content(const char * path); - -unsigned char *dtw_load_binary_content(const char * path,long *size); - - -bool dtw_write_any_content(const char *path,unsigned char *content,long size); -bool dtw_write_string_file_content(const char *path,const char *content); - - - -int dtw_entity_type(const char *path); - - - -int dtw_complex_entity_type(const char *path); - -const char *dtw_convert_entity(int entity_type); - - -bool dtw_copy_any(const char* src_path,const char* dest_path,bool merge); - - - -bool dtw_move_any(const char* src_path, const char* dest_path,bool merge); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/listage_wrappers/listage_wrappers.c b/build/build/dependencies/doTheWorld/listage_wrappers/listage_wrappers.c deleted file mode 100644 index fec0edf..0000000 --- a/build/build/dependencies/doTheWorld/listage_wrappers/listage_wrappers.c +++ /dev/null @@ -1,13 +0,0 @@ - - - DtwStringArray * dtw_list_files(const char *path, bool concat_path){ - return dtw_list_basic(path, DTW_FILE_TYPE, concat_path); -} - - DtwStringArray * dtw_list_dirs(const char *path, bool concat_path){ - return dtw_list_basic(path,DTW_FOLDER_TYPE, concat_path); -} - - DtwStringArray * dtw_list_all(const char *path, bool concat_path){ - return dtw_list_basic(path, DTW_ALL_TYPE, concat_path); -} diff --git a/build/build/dependencies/doTheWorld/listage_wrappers/listage_wrappers.h b/build/build/dependencies/doTheWorld/listage_wrappers/listage_wrappers.h deleted file mode 100644 index 8c27fbb..0000000 --- a/build/build/dependencies/doTheWorld/listage_wrappers/listage_wrappers.h +++ /dev/null @@ -1,8 +0,0 @@ -#define DTW_CONCAT_PATH true -#define DTW_NOT_CONCAT_PATH false - - - DtwStringArray * dtw_list_files(const char *path, bool concat_path); -DtwStringArray * dtw_list_dirs(const char *path, bool concat_path); - -DtwStringArray * dtw_list_all(const char *path, bool concat_path); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/lockers/declaration.h b/build/build/dependencies/doTheWorld/lockers/declaration.h deleted file mode 100644 index 98e8f8d..0000000 --- a/build/build/dependencies/doTheWorld/lockers/declaration.h +++ /dev/null @@ -1,5 +0,0 @@ -#include "multifile_locker/multifile_locker.h" -#ifdef __linux__ -#include "flock_locker/declaration.h" -#endif -#include "locker/locker.h" \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/lockers/definition.h b/build/build/dependencies/doTheWorld/lockers/definition.h deleted file mode 100644 index d512981..0000000 --- a/build/build/dependencies/doTheWorld/lockers/definition.h +++ /dev/null @@ -1,7 +0,0 @@ - -#include "multifile_locker/multifile_locker.c" -#ifdef __linux__ - #include "flock_locker/definition.h" -#endif - -#include "locker/locker.c" \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/lockers/flock_locker/declaration.h b/build/build/dependencies/doTheWorld/lockers/flock_locker/declaration.h deleted file mode 100644 index 8567fcb..0000000 --- a/build/build/dependencies/doTheWorld/lockers/flock_locker/declaration.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "flockarray/declaration.h" -#include "flock_locker/flock_locker.h" \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/lockers/flock_locker/definition.h b/build/build/dependencies/doTheWorld/lockers/flock_locker/definition.h deleted file mode 100644 index 744b424..0000000 --- a/build/build/dependencies/doTheWorld/lockers/flock_locker/definition.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "flockarray/definition.h" -#include "flock_locker/flock_locker.c" \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/lockers/flock_locker/flock_locker/flock_locker.c b/build/build/dependencies/doTheWorld/lockers/flock_locker/flock_locker/flock_locker.c deleted file mode 100644 index 9e77cf0..0000000 --- a/build/build/dependencies/doTheWorld/lockers/flock_locker/flock_locker/flock_locker.c +++ /dev/null @@ -1,61 +0,0 @@ - -DtwFlockLocker * newFlockLocker(){ - - DtwFlockLocker *self = (DtwFlockLocker*) malloc(sizeof (DtwFlockLocker)); - *self = (DtwFlockLocker){0}; - self->locked_files = private_new_privateFlockArray(); - self->temp_folder = "/tmp/"; - - return self; -} -int DtwFlockLocker_lock(DtwFlockLocker *self, const char *filename) { - if (privateDtwFlockArray_index_of(self->locked_files, filename) != -1) { - return DTW_LOCKER_LOCKED; - } - - char *file_sha = dtw_generate_sha_from_string(filename); - const char *EXTENSION = "lock"; - char *formatted = (char *) malloc( - strlen(file_sha) + - strlen(self->temp_folder) + - strlen(EXTENSION) + - 3 - ); - sprintf(formatted, "%s/%s.%s", self->temp_folder, file_sha, EXTENSION); - - free(file_sha); - int fd = open(formatted, O_RDWR | O_CREAT, 0644); - free(formatted); - if (fd == -1) { - return DTW_LOCKER_IMPOSSIBLE_TO_CREATE_FILE_DESCRIPTOR; - } - if (flock(fd, LOCK_EX) == -1) { - close(fd); - return DTW_LOCKER_FLCTL_FAIL; - } - privateDtwFlockArray_append(self->locked_files, filename, fd); - return DTW_LOCKER_LOCKED; -} - -void private_FlockLocker_unlock_by_index(DtwFlockLocker *self, int index){ - privateDtwFlockLockedElement *element = self->locked_files->elements[index]; - flock(element->file_descriptor, LOCK_UN); - close(element->file_descriptor); -} -void DtwFlockLocker_unlock(DtwFlockLocker *self, const char *filename){ - int index = privateDtwFlockArray_index_of(self->locked_files, filename); - if(index == -1){ - return; - } - private_FlockLocker_unlock_by_index(self,index); -} -void DtwFlockLocker_represent(DtwFlockLocker *self){ - privateDtwFlockArray_represent(self->locked_files); -} -void DtwFlockLocker_free(DtwFlockLocker *self){ - for(int i = 0 ; i < self->locked_files->size; i++){ - private_FlockLocker_unlock_by_index(self,i); - } - privateDtwFlockArray_free(self->locked_files); - free(self); -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/lockers/flock_locker/flock_locker/flock_locker.h b/build/build/dependencies/doTheWorld/lockers/flock_locker/flock_locker/flock_locker.h deleted file mode 100644 index f3aed46..0000000 --- a/build/build/dependencies/doTheWorld/lockers/flock_locker/flock_locker/flock_locker.h +++ /dev/null @@ -1,17 +0,0 @@ - -typedef struct { - const char *temp_folder; - privateDtwFlockArray *locked_files; -}DtwFlockLocker; - -DtwFlockLocker * newFlockLocker(); - -void private_FlockLocker_unlock_by_index(DtwFlockLocker *self, int index); - -void DtwFlockLocker_unlock(DtwFlockLocker *self, const char *filename); - -int DtwFlockLocker_lock(DtwFlockLocker *self, const char *filename); - -void DtwFlockLocker_represent(DtwFlockLocker *self); - -void DtwFlockLocker_free(DtwFlockLocker *self); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/declaration.h b/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/declaration.h deleted file mode 100644 index 3c15b75..0000000 --- a/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/declaration.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "flock_locked_element/flock_locked_element.h" -#include "flock_array/flock_array.h" \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/definition.h b/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/definition.h deleted file mode 100644 index 00ae61d..0000000 --- a/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/definition.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "flock_locked_element/flock_locked_element.c" -#include "flock_array/flock_array.c" \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/flock_array/flock_array.c b/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/flock_array/flock_array.c deleted file mode 100644 index 817a15d..0000000 --- a/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/flock_array/flock_array.c +++ /dev/null @@ -1,59 +0,0 @@ - -privateDtwFlockArray * private_new_privateFlockArray(){ - privateDtwFlockArray * self = (privateDtwFlockArray*) malloc(sizeof (privateDtwFlockArray)); - self->elements = (privateDtwFlockLockedElement **) malloc(0); - self->size = 0; - return self; -} - - -int privateDtwFlockArray_index_of(privateDtwFlockArray *self, const char *filename){ - for(int i = 0 ; i size;i++){ - privateDtwFlockLockedElement *current = self->elements[i]; - if(strcmp(current->filename,filename) ==0){ - return i; - } - } - return -1; -} -void privateDtwFlockArray_append(privateDtwFlockArray *self, const char *filename, int file_descriptor){ - - self->elements = (privateDtwFlockLockedElement**) realloc( - self->elements, - sizeof(privateDtwFlockLockedElement**) * (self->size + 1) - ); - privateDtwFlockLockedElement *created = private_new_privateDtwFlockLockedElement(filename, file_descriptor); - self->elements[self->size] = created; - self->size+=1; -} - -void privateDtwFlockArray_destroy_by_index(privateDtwFlockArray *self, int position){ - if(position >= self->size){ - return ; - } - privateDtwFlockLockedElement *finded = self->elements[position]; - privateDtwFlockLockedElement_free(finded); - for(int i = position; i < self->size-1; i++){ - self->elements[i] = self->elements[i+1]; - } - self->size-=1; -} - - -void privateDtwFlockArray_represent(privateDtwFlockArray *self){ - for(int i = 0 ; i size;i++){ - - privateDtwFlockLockedElement *current = self->elements[i]; - printf("=============================\n"); - privateDtwFlockLockedElement_represent(current); - } -} - -void privateDtwFlockArray_free(privateDtwFlockArray *self){ - for(int i = 0 ; i size;i++){ - privateDtwFlockLockedElement *current = self->elements[i]; - privateDtwFlockLockedElement_free(current); - } - free(self->elements); - free(self); -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/flock_array/flock_array.h b/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/flock_array/flock_array.h deleted file mode 100644 index 95e1766..0000000 --- a/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/flock_array/flock_array.h +++ /dev/null @@ -1,20 +0,0 @@ - - - -typedef struct { - privateDtwFlockLockedElement **elements; - int size; -}privateDtwFlockArray; - - -privateDtwFlockArray * private_new_privateFlockArray(); - -int privateDtwFlockArray_index_of(privateDtwFlockArray *self, const char *filename); - -void privateDtwFlockArray_append(privateDtwFlockArray *self, const char *filename, int file_descriptor); - -void privateDtwFlockArray_destroy_by_index(privateDtwFlockArray *self, int position); - -void privateDtwFlockArray_represent(privateDtwFlockArray *self); - -void privateDtwFlockArray_free(privateDtwFlockArray *self); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/flock_locked_element/flock_locked_element.c b/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/flock_locked_element/flock_locked_element.c deleted file mode 100644 index ae4a400..0000000 --- a/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/flock_locked_element/flock_locked_element.c +++ /dev/null @@ -1,19 +0,0 @@ - - -privateDtwFlockLockedElement * private_new_privateDtwFlockLockedElement(const char *filename, int file_descriptor){ - privateDtwFlockLockedElement *self = (privateDtwFlockLockedElement*) malloc(sizeof (privateDtwFlockLockedElement)); - self->filename = strdup(filename); - self->file_descriptor = file_descriptor; - return self; -} - -void privateDtwFlockLockedElement_represent(privateDtwFlockLockedElement *self){ - printf("file: %s\n",self->filename); - printf("if: %d\n",self->file_descriptor); - -} -void privateDtwFlockLockedElement_free(privateDtwFlockLockedElement *self){ - free(self->filename); - free(self); - -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/flock_locked_element/flock_locked_element.h b/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/flock_locked_element/flock_locked_element.h deleted file mode 100644 index 4d06bf0..0000000 --- a/build/build/dependencies/doTheWorld/lockers/flock_locker/flockarray/flock_locked_element/flock_locked_element.h +++ /dev/null @@ -1,14 +0,0 @@ - -typedef struct { - - char *filename; - int file_descriptor; - - -}privateDtwFlockLockedElement; - -privateDtwFlockLockedElement * private_new_privateDtwFlockLockedElement(const char *filename, int file_descriptor); - -void privateDtwFlockLockedElement_represent(privateDtwFlockLockedElement *self); - -void privateDtwFlockLockedElement_free(privateDtwFlockLockedElement *self); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/lockers/locker/locker.c b/build/build/dependencies/doTheWorld/lockers/locker/locker.c deleted file mode 100644 index 2e1aeee..0000000 --- a/build/build/dependencies/doTheWorld/lockers/locker/locker.c +++ /dev/null @@ -1,56 +0,0 @@ - - -DtwLocker *newDtwLocker(){ - - DtwLocker *self = (DtwLocker*)malloc(sizeof(DtwLocker)); -#ifdef __linux__ - self->locker = newFlockLocker(); -#endif -#ifdef _WIN32 - self->locker = newDtwMultiFileLocker(); -#endif - return self; -} - -int DtwLocker_lock(DtwLocker *self, const char *element){ - -#ifdef __linux__ - return DtwFlockLocker_lock(self->locker,element); -#endif -#ifdef _WIN32 - return DtwMultiFIleLocker_lock(self->locker,element); -#endif - return DTW_LOCKER_OS_NOT_PREDICTIBLE; -} - -void DtwLocker_unlock(DtwLocker *self, const char *element){ - -#ifdef __linux__ - DtwFlockLocker_unlock(self->locker,element); -#endif - #ifdef _WIN32 - DtwMultifileLocker_unlock(self->locker,element); - #endif -} - -void DtwLocker_represemt(DtwLocker *self){ - -#ifdef __linux__ - DtwFlockLocker_represent(self->locker); -#endif -#ifdef _WIN32 - DtwMultiFileLocker_represemt(self->locker); -#endif -} - -void DtwLocker_free(DtwLocker *self){ - -#ifdef __linux__ - DtwFlockLocker_free(self->locker); -#endif - -#ifdef _WIN32 - DtwMultiFileLocker_free(self->locker); -#endif - free(self); -} diff --git a/build/build/dependencies/doTheWorld/lockers/locker/locker.h b/build/build/dependencies/doTheWorld/lockers/locker/locker.h deleted file mode 100644 index 650b108..0000000 --- a/build/build/dependencies/doTheWorld/lockers/locker/locker.h +++ /dev/null @@ -1,27 +0,0 @@ - -#define DTW_LOCKER_LOCKED 0 -#define DTW_LOCKER_IMPOSSIBLE_TO_CREATE_FILE_DESCRIPTOR 5 -#define DTW_LOCKER_FLCTL_FAIL 6 -#define DTW_LOCKER_WAIT_ERROR 21 -#define DTW_LOCKER_OS_NOT_PREDICTIBLE -1 -typedef struct { -#ifdef __linux__ - DtwFlockLocker *locker; -#endif -#ifdef _WIN32 - DtwMultiFileLocker *locker; -#endif - -} DtwLocker; - - -DtwLocker *newDtwLocker(); - -int DtwLocker_lock(DtwLocker *self, const char *element); - -void DtwLocker_unlock(DtwLocker *self, const char *element); - -void DtwLocker_represemt(DtwLocker *self); - -void DtwLocker_free(DtwLocker *self); - diff --git a/build/build/dependencies/doTheWorld/lockers/multifile_locker/multifile_locker.c b/build/build/dependencies/doTheWorld/lockers/multifile_locker/multifile_locker.c deleted file mode 100644 index 0b5c545..0000000 --- a/build/build/dependencies/doTheWorld/lockers/multifile_locker/multifile_locker.c +++ /dev/null @@ -1,127 +0,0 @@ - - -DtwMultiFileLocker *newDtwMultiFileLocker(){ - DtwMultiFileLocker *self = (DtwMultiFileLocker*) malloc(sizeof (DtwMultiFileLocker)); - - self->process = getpid(); - self->total_checks = DTW_MULTIFILE_LOCKER_TOTAL_CHECK; - self->max_lock_time = DTW_MULTIFILE_LOCKER_MAX_TIMEOUT; - self->max_wait = DTW_MULFILE_LOCKER_MAX_WAIT; - self->locked_elements = newDtwStringArray(); - - return self; -} - - - - -int DtwMultiFIleLocker_lock(DtwMultiFileLocker *self, const char *element) { - - if(DtwStringArray_find_position(self->locked_elements,element) != -1){ - return DTW_LOCKER_LOCKED; - } - - const char *LOCK_FOLDER = ".lock"; - const int LOCK_FOLDER_SIZE = (int)strlen(LOCK_FOLDER); - char *file = (char*)malloc(strlen(element) + LOCK_FOLDER_SIZE + 10); - sprintf(file,"%s%s",element,LOCK_FOLDER); - long started_time = time(NULL); - - while (true){ - - - long now = time(NULL); - if((now - started_time) > self->max_wait){ - free(file); - return DTW_LOCKER_WAIT_ERROR; - } - - - bool write = false; - int entity_type = dtw_entity_type(file); - if(entity_type== DTW_NOT_FOUND){ - write = true; - } - - if(entity_type== DTW_FILE_TYPE){ - long last_modification = dtw_get_entity_last_motification_in_unix(file); - if ((now - self->max_lock_time) > last_modification ) { - write = true; - } - } - - if(entity_type == DTW_FOLDER_TYPE){ - dtw_remove_any(file); - continue; - } - - - if(!write) { - continue; - } - dtw_write_long_file_content(file,self->process); - bool break_loop = true; - for(int i = 0;i < self->total_checks;i++){ - long result = dtw_load_long_file_content(file); - if(result != self->process && result != -1){ - break_loop = false; - break; - } - } - - if(break_loop){ - break; - - } - - - } - DtwStringArray_append(self->locked_elements,element); - free(file); - return DTW_LOCKER_LOCKED; - -} - -void DtwMultifileLocker_unlock(DtwMultiFileLocker *self, const char *element){ - bool found = false; - for(long i = 0; i < self->locked_elements->size;i++){ - if(strcmp(self->locked_elements->strings[i],element)==0){ - found = true; - break; - } - } - - if(!found){ - return; - } - - - const char *LOCK_FOLDER = ".lock"; - const int LOCK_FOLDER_SIZE = (int)strlen(LOCK_FOLDER); - char *file = (char*)malloc(strlen(element) + LOCK_FOLDER_SIZE + 10); - sprintf(file,"%s%s",element,LOCK_FOLDER); - dtw_remove_any(file); - free(file); -} - - -void DtwMultiFileLocker_represemt(DtwMultiFileLocker *self){ - printf("locked:\n"); - for(int i = 0 ; i < self->locked_elements->size;i++){ - char *element = self->locked_elements->strings[i]; - char *unformated = dtw_replace_string(element,".lock",""); - printf("\t%s\n",unformated); - free(unformated); - } -} - -void DtwMultiFileLocker_free(DtwMultiFileLocker *self){ - - for(int i = 0 ; i < self->locked_elements->size;i++){ - char *element = self->locked_elements->strings[i]; - DtwMultifileLocker_unlock(self, element); - } - - DtwStringArray_free(self->locked_elements); - free(self); -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/lockers/multifile_locker/multifile_locker.h b/build/build/dependencies/doTheWorld/lockers/multifile_locker/multifile_locker.h deleted file mode 100644 index 5397d4b..0000000 --- a/build/build/dependencies/doTheWorld/lockers/multifile_locker/multifile_locker.h +++ /dev/null @@ -1,27 +0,0 @@ -#define DTW_MULTIFILE_LOCKER_TOTAL_CHECK 500 -#define DTW_MULTIFILE_LOCKER_MAX_TIMEOUT 10 -#define DTW_MULFILE_LOCKER_MAX_WAIT 10 - - -typedef struct { - - int total_checks; - int process; - int max_wait; - int max_lock_time; - DtwStringArray *locked_elements; - - -}DtwMultiFileLocker; - - -DtwMultiFileLocker *newDtwMultiFileLocker(); - -int DtwMultiFIleLocker_lock(DtwMultiFileLocker *self, const char *element); - -void DtwMultifileLocker_unlock(DtwMultiFileLocker *self, const char *element); - -void DtwMultiFileLocker_represemt(DtwMultiFileLocker *self); - -void DtwMultiFileLocker_free(DtwMultiFileLocker *self); - diff --git a/build/build/dependencies/doTheWorld/monodimension_listage/monodimension_listage.h b/build/build/dependencies/doTheWorld/monodimension_listage/monodimension_listage.h deleted file mode 100644 index ceee33d..0000000 --- a/build/build/dependencies/doTheWorld/monodimension_listage/monodimension_listage.h +++ /dev/null @@ -1,19 +0,0 @@ - -#ifdef __linux__ - -bool private_dtw_verify_if_add(const int expected_type, int d_type); -bool private_dtw_verify_if_skip(struct dirent *entry); - -#endif - - -#ifdef _WIN32 - -bool private_dtw_verify_if_add(const int expected_type, WIN32_FIND_DATAA entry); -bool private_dtw_verify_if_skip(WIN32_FIND_DATAA *entry); -#endif - - - -struct DtwStringArray * dtw_list_basic(const char *path,int expected_type,bool concat_path); - \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/monodimension_listage/monodimension_listage_linux.c b/build/build/dependencies/doTheWorld/monodimension_listage/monodimension_listage_linux.c deleted file mode 100644 index aeda25a..0000000 --- a/build/build/dependencies/doTheWorld/monodimension_listage/monodimension_listage_linux.c +++ /dev/null @@ -1,81 +0,0 @@ - - -#ifdef __linux__ - -bool private_dtw_verify_if_add(const int expected_type, int d_type){ - if (expected_type == DTW_FILE_TYPE && d_type == DT_REG) { - return true; - } - - if (expected_type == DTW_FOLDER_TYPE && d_type == DT_DIR) { - return true; - } - - if (expected_type == DTW_ALL_TYPE) { - - return true; - } - return false; -} -bool private_dtw_verify_if_skip(struct dirent *entry){ - if (strcmp(entry->d_name, ".") == 0 || strcmp(entry->d_name, "..") == 0) { - return true; - } - return false; -} - -struct DtwStringArray * dtw_list_basic(const char *path,int expected_type,bool concat_path){ - - DIR *dir; - struct dirent *entry; - - //array of directories - struct DtwStringArray *dirs = newDtwStringArray(); - int i = 0; - - //means that the directory is not found - if ((dir = opendir(path)) == NULL) { - return dirs; - } - - //reads the directory and adds the directories to the array - while ((entry = readdir(dir)) != NULL) { - //means is not a directory - if (private_dtw_verify_if_skip(entry)){ - continue; - } - - if (private_dtw_verify_if_add(expected_type,entry->d_type)) { - - - if(concat_path){ - //allocates memory for the directory - char *generated_dir = (char*)malloc(strlen(path) + strlen(entry->d_name) + 2); - if(path[strlen(path) - 1] == '/'){ - sprintf(generated_dir, "%s%s", path, entry->d_name); - } - else{ - sprintf(generated_dir, "%s/%s", path, entry->d_name); - } - - DtwStringArray_append(dirs, generated_dir); - free(generated_dir); - } - else{ - DtwStringArray_append(dirs, entry->d_name); - - } - - i++; - } - } - - if(expected_type == DTW_FOLDER_TYPE){ - private_dtw_add_end_bar_to_dirs_string_array(dirs); - } - closedir(dir); - - return dirs; -} - -#endif \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/monodimension_listage/monodimension_listage_win32.c b/build/build/dependencies/doTheWorld/monodimension_listage/monodimension_listage_win32.c deleted file mode 100644 index 249a4a0..0000000 --- a/build/build/dependencies/doTheWorld/monodimension_listage/monodimension_listage_win32.c +++ /dev/null @@ -1,94 +0,0 @@ - -#ifdef _WIN32 - - -bool private_dtw_verify_if_add(const int expected_type, WIN32_FIND_DATAA entry){ - #define WIN32_FILETYPE 32 - - if (expected_type == DTW_FILE_TYPE && entry.dwFileAttributes == WIN32_FILETYPE) { - return true; - } - - if (expected_type == DTW_FOLDER_TYPE && entry.dwFileAttributes != WIN32_FILETYPE){ - return true; - } - - if (expected_type == DTW_ALL_TYPE) { - return true; - } - - return false; -} - -bool private_dtw_verify_if_skip(WIN32_FIND_DATAA *entry){ - if (strcmp(entry->cFileName, ".") == 0 || strcmp(entry->cFileName, "..") == 0) { - return true; - } - return false; -} - -struct DtwStringArray * dtw_list_basic(const char *path,int expected_type,bool concat_path){ - - WIN32_FIND_DATAA file_data; - HANDLE file_handle; - char search_path[MAX_PATH]; - - //array of directories - struct DtwStringArray *dirs = newDtwStringArray(); - int i = 0; - - // build the search path string - snprintf(search_path, MAX_PATH, "%s\\*", path); - - // try to open the directory - if ((file_handle = FindFirstFileA(search_path, &file_data)) == INVALID_HANDLE_VALUE) { - return dirs; - } - - do { - // skip "." and ".." directories - if (private_dtw_verify_if_skip(&file_data)){ - continue; - } - - // verify if it's a file or directory - if (private_dtw_verify_if_add(expected_type, file_data)) { - - if(concat_path){ - // allocate memory for the directory - if(path[strlen(path) - 1] == '\\' || path[strlen(path) - 1] == '/'){ - char *generated_dir = (char*)malloc(strlen(path) + strlen(file_data.cFileName) + 1); - sprintf(generated_dir, "%s%s", path, file_data.cFileName); - DtwStringArray_append(dirs, generated_dir); - free(generated_dir); - } - else{ - char *generated_dir = (char*)malloc(strlen(path) + strlen(file_data.cFileName) + 2); - - - sprintf(generated_dir, "%s/%s", path, file_data.cFileName); - - DtwStringArray_append(dirs, generated_dir); - free(generated_dir); - } - - - } - else{ - DtwStringArray_append(dirs, file_data.cFileName); - - } - - i++; - } - } while (FindNextFileA(file_handle, &file_data) != 0); - - if(expected_type == DTW_FOLDER_TYPE){ - private_dtw_add_end_bar_to_dirs_string_array(dirs); - } - - FindClose(file_handle); - - return dirs; -} -#endif \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/multidimension_listage/multidimension_listage.c b/build/build/dependencies/doTheWorld/multidimension_listage/multidimension_listage.c deleted file mode 100644 index 7b20bf1..0000000 --- a/build/build/dependencies/doTheWorld/multidimension_listage/multidimension_listage.c +++ /dev/null @@ -1,101 +0,0 @@ - - DtwStringArray * dtw_list_dirs_recursively(const char *path,bool concat_path){ - - struct DtwStringArray *dirs = newDtwStringArray(); - //verify if the path is a directory - - int entity_type = dtw_entity_type(path); - if(entity_type != DTW_FOLDER_TYPE){ - return dirs; - } - - - DtwStringArray_append(dirs, (char*)path); - - private_dtw_add_end_bar_to_dirs_string_array(dirs); - int i = 0; - //The size of dirs will increase til it reaches the end of the array - while(i < dirs->size){ - struct DtwStringArray *sub_dirs = dtw_list_basic( - dirs->strings[i], - DTW_FOLDER_TYPE, - true - ); - //merge the two dirs - DtwStringArray_merge(dirs, sub_dirs); - DtwStringArray_free(sub_dirs); - i++; - - } - //unsifth path in dirs - private_dtw_remove_double_bars_from_string_array(dirs); - - if(!concat_path){ - - struct DtwStringArray *removed = private_dtw_remove_start_path(dirs,path); - DtwStringArray_free(dirs); - return removed; - } - return dirs; -} - - - - DtwStringArray * dtw_list_files_recursively(const char *path,bool concat_path){ - - struct DtwStringArray *dirs = dtw_list_dirs_recursively(path,DTW_CONCAT_PATH); - - struct DtwStringArray *files = newDtwStringArray(); - for(int i = 0; i < dirs->size; i++){ - struct DtwStringArray *sub_files = dtw_list_basic(dirs->strings[i],DTW_FILE_TYPE,DTW_CONCAT_PATH); - DtwStringArray_merge(files, sub_files); - DtwStringArray_free(sub_files); - } - - DtwStringArray_free(dirs); - - if(!concat_path){ - - struct DtwStringArray *removed = private_dtw_remove_start_path(files,path); - DtwStringArray_free(files); - return removed; - } - - return files; -} - - - DtwStringArray * dtw_list_all_recursively(const char *path,bool concat_path){ - - struct DtwStringArray *dirs = dtw_list_dirs_recursively(path,DTW_CONCAT_PATH); - - struct DtwStringArray *all = newDtwStringArray(); - - for(int i = 0; i < dirs->size; i++){ - - if(!dtw_ends_with(dirs->strings[i], "/") || !dtw_ends_with(dirs->strings[i], "\\") ){ - - char *formated_dir = (char*)malloc(strlen(dirs->strings[i]) + 2); - sprintf(formated_dir,"%s/",dirs->strings[i]); - DtwStringArray_append(all, formated_dir); - free(formated_dir); - } - - else{ - DtwStringArray_append(all, dirs->strings[i]); - } - - struct DtwStringArray *sub_files = dtw_list_basic(dirs->strings[i],DTW_FILE_TYPE,true); - DtwStringArray_merge(all,sub_files); - DtwStringArray_free(sub_files); - } - DtwStringArray_free(dirs); - private_dtw_remove_double_bars_from_string_array(all); - if(!concat_path){ - - struct DtwStringArray *removed = private_dtw_remove_start_path(all,path); - DtwStringArray_free(all); - return removed; - } - return all; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/multidimension_listage/multidimension_listage.h b/build/build/dependencies/doTheWorld/multidimension_listage/multidimension_listage.h deleted file mode 100644 index 620d588..0000000 --- a/build/build/dependencies/doTheWorld/multidimension_listage/multidimension_listage.h +++ /dev/null @@ -1,8 +0,0 @@ - - DtwStringArray * dtw_list_dirs_recursively(const char *path,bool concat_path); - - - DtwStringArray * dtw_list_files_recursively(const char *path,bool concat_path); - - - DtwStringArray * dtw_list_all_recursively(const char *path,bool concat_path); diff --git a/build/build/dependencies/doTheWorld/namespace/declaration.h b/build/build/dependencies/doTheWorld/namespace/declaration.h deleted file mode 100644 index e55ab07..0000000 --- a/build/build/dependencies/doTheWorld/namespace/declaration.h +++ /dev/null @@ -1,10 +0,0 @@ -#include "randonizer_module/randonizer_module.h" -#include "path_module/path_module.h" -#include "string_array_module/string_array_module.h" -#include "tree_module/declaration.h" -#include "locker/locker.h" -#include "transaction_module/declaration.h" -#include "resource_module/declaration.h" -#include "hash_module/hash_module.h" -#include "schema_module/schema_module.h" -#include "namespace/namespace.h" diff --git a/build/build/dependencies/doTheWorld/namespace/definition.h b/build/build/dependencies/doTheWorld/namespace/definition.h deleted file mode 100644 index dc51e3a..0000000 --- a/build/build/dependencies/doTheWorld/namespace/definition.h +++ /dev/null @@ -1,10 +0,0 @@ -#include "randonizer_module/randonizer_module.c" -#include "path_module/path_module.c" -#include "string_array_module/string_array_module.c" -#include "tree_module/definition.h" -#include "locker/locker.c" -#include "transaction_module/definition.h" -#include "resource_module/definition.h" -#include "hash_module/hash_module.c" -#include "schema_module/schema_module.c" -#include "namespace/namespace.c" \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/hash_module/hash_module.c b/build/build/dependencies/doTheWorld/namespace/hash_module/hash_module.c deleted file mode 100644 index 965d4a8..0000000 --- a/build/build/dependencies/doTheWorld/namespace/hash_module/hash_module.c +++ /dev/null @@ -1,22 +0,0 @@ - - -DtwHashModule newDtwHashModule(){ - DtwHashModule self = {0}; - self.newHash =newDtwHash; - self.digest_any = DtwHash_digest_any; - self.digest_string = DtwHash_digest_string; - self.digest_long = DtwHash_digest_long; - self.digest_double = DtwHash_digest_double; - self.digest_bool = DtwHash_digest_bool; - self.digest_file = DtwHash_digest_file; - self.digest_entity_last_modification =DtwHash_digest_entity_last_modification; - self.digest_string_array = DtwHash_digest_string_array; - self.digest_string_array_last_modifications = DtwHash_digest_string_array_last_modifications; - self.digest_string_array_last_modifications_adding_name = DtwHash_digest_string_array_last_modifications_adding_name; - self.digest_string_array_content = DtwHash_digest_string_array_content; - self.digest_string_array_content_adding_name = DtwHash_digest_string_array_content_adding_name; - self.digest_folder_by_last_modification = DtwHash_digest_folder_by_last_modification; - self.digest_folder_by_content = DtwHash_digest_folder_by_content; - self.free = DtwHash_free; - return self; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/hash_module/hash_module.h b/build/build/dependencies/doTheWorld/namespace/hash_module/hash_module.h deleted file mode 100644 index df1f000..0000000 --- a/build/build/dependencies/doTheWorld/namespace/hash_module/hash_module.h +++ /dev/null @@ -1,22 +0,0 @@ - -typedef struct DtwHashModule{ - DtwHash * (*newHash)(); - bool (*digest_any)(DtwHash *self,unsigned char *content,long size); - bool (*digest_string)(DtwHash * self, const char *content); - void (*digest_long)(DtwHash * self,long content); - void (*digest_double)(DtwHash * self,double content); - void (*digest_bool)(DtwHash * self,bool content); - bool (*digest_file)(DtwHash * self, const char *path); - bool (*digest_entity_last_modification)(DtwHash * self, const char *path); - bool (*digest_string_array)(DtwHash *self,DtwStringArray *element); - bool (*digest_string_array_last_modifications)(DtwHash *self,DtwStringArray *element); - bool (*digest_string_array_last_modifications_adding_name)(DtwHash *self,DtwStringArray *element); - bool (*digest_string_array_content)(DtwHash *self,DtwStringArray *element); - bool (*digest_string_array_content_adding_name)(DtwHash *self,DtwStringArray *element); - bool (*digest_folder_by_last_modification)(DtwHash *self,const char *path); - bool (*digest_folder_by_content)(DtwHash *self,const char *path); - void (*free)(DtwHash *self); - -}DtwHashModule; - -DtwHashModule newDtwHashModule(); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/locker/locker.c b/build/build/dependencies/doTheWorld/namespace/locker/locker.c deleted file mode 100644 index 382c7be..0000000 --- a/build/build/dependencies/doTheWorld/namespace/locker/locker.c +++ /dev/null @@ -1,10 +0,0 @@ - -DtwLockerModule newDtwLockerModule(){ - DtwLockerModule self = {0}; - self.newLocker = newDtwLocker; - self.lock = DtwLocker_lock; - self.unlock = DtwLocker_unlock; - self.represemt = DtwLocker_represemt; - self.free = DtwLocker_free; - return self; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/locker/locker.h b/build/build/dependencies/doTheWorld/namespace/locker/locker.h deleted file mode 100644 index 83aad02..0000000 --- a/build/build/dependencies/doTheWorld/namespace/locker/locker.h +++ /dev/null @@ -1,12 +0,0 @@ - - -typedef struct DtwLockerModule{ - DtwLocker * (*newLocker)(); - int (*lock)(DtwLocker *self, const char *element); - void (*unlock)(DtwLocker *self, const char *element); - void (*represemt)(DtwLocker *self); - void (*free)(DtwLocker *self); - -}DtwLockerModule; - -DtwLockerModule newDtwLockerModule(); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/namespace/namespace.c b/build/build/dependencies/doTheWorld/namespace/namespace/namespace.c deleted file mode 100644 index cbbf663..0000000 --- a/build/build/dependencies/doTheWorld/namespace/namespace/namespace.c +++ /dev/null @@ -1,60 +0,0 @@ - -DtwNamespace newDtwNamespace(){ - DtwNamespace self = {0}; - //io - self.create_dir_recursively = dtw_create_dir_recursively; - self.remove_any = dtw_remove_any; - self.get_current_dir = dtw_get_current_dir; - self.load_any_content = dtw_load_any_content; - self.load_string_file_content = dtw_load_string_file_content; - self.load_binary_content = dtw_load_binary_content; - self.write_any_content = dtw_write_any_content; - self.write_string_file_content =dtw_write_string_file_content; - self.entity_type = dtw_entity_type; - self.complex_entity_type = dtw_complex_entity_type; - self.convert_entity = dtw_convert_entity; - self.copy_any = dtw_copy_any; - self.move_any = dtw_move_any; - //numeral io - self.load_long_file_content = dtw_load_long_file_content; - self.load_double_file_content = dtw_load_double_file_content; - self.load_bool_file_content = dtw_load_bool_file_content; - - self.write_long_file_content = dtw_write_long_file_content; - self.write_double_file_content = dtw_write_double_file_content; - self.write_bool_file_content = dtw_write_bool_file_content; - - //listage - self.list_files = dtw_list_files; - self.list_dirs = dtw_list_dirs; - self.list_all = dtw_list_all; - - self.list_files_recursively = dtw_list_files_recursively; - self.list_dirs_recursively = dtw_list_dirs_recursively; - self.list_all_recursively = dtw_list_all_recursively; - - //extras - self.generate_sha_from_file = dtw_generate_sha_from_file; - self.generate_sha_from_string = dtw_generate_sha_from_string; - self.generate_sha_from_any = dtw_generate_sha_from_any; - self.get_entity_last_motification_in_unix = dtw_get_entity_last_motification_in_unix; - self.get_entity_last_motification_in_string = dtw_get_entity_last_motification_in_string; - self.concat_path = dtw_concat_path; - //bas64 - self.base64_encode = dtw_base64_encode; - self.base64_decode = dtw_base64_decode; - self.convert_binary_file_to_base64 = dtw_convert_binary_file_to_base64; - - self.string_array = newDtwStringArrayModule(); - self.path = newDtwPathModule(); - self.locker = newDtwLockerModule(); - - self.schema = newDtwSchemaModule(); - self.tree = newDtwTreeModule(); - self.hash = newDtwHashModule(); - self.transaction = newDtwTransactionModule(); - self.resource = newDtwResourceModule(); - self.randonizer = newDtwRandonizerModule(); - - return self; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/namespace/namespace.h b/build/build/dependencies/doTheWorld/namespace/namespace/namespace.h deleted file mode 100644 index 00a715b..0000000 --- a/build/build/dependencies/doTheWorld/namespace/namespace/namespace.h +++ /dev/null @@ -1,101 +0,0 @@ - -typedef struct DtwNamespace{ - //IO - void (*create_dir_recursively)(const char *path); - - bool (*remove_any)(const char* path); - - char *(*get_current_dir)(); - - unsigned char *(*load_any_content)(const char * path,long *size,bool *is_binary); - - char *(*load_string_file_content)(const char * path); - - unsigned char *(*load_binary_content)(const char * path,long *size); - - bool (*write_any_content)(const char *path,unsigned char *content,long size); - - bool (*write_string_file_content)(const char *path,const char *content); - - int (*entity_type)(const char *path); - - int (*complex_entity_type)(const char *path); - - const char *(*convert_entity)(int entity_type); - - bool (*copy_any)(const char* src_path,const char* dest_path,bool merge); - - bool (*move_any)(const char* src_path, const char* dest_path,bool merge); - - //numeral io - - long (*load_long_file_content)(const char * path); - - double (*load_double_file_content)(const char * path); - - bool (*load_bool_file_content)(const char * path); - - - - void (*write_long_file_content)(const char *path, long value); - - void (*write_bool_file_content)(const char *path, bool value); - - void (*write_double_file_content)(const char *path,double value); - - - - //listage - - DtwStringArray * (*list_files)(const char *path, bool concat_path); - DtwStringArray * (*list_dirs)(const char *path, bool concat_path); - - DtwStringArray * (*list_all)(const char *path, bool concat_path); - DtwStringArray * (*list_dirs_recursively)(const char *path,bool concat_path); - DtwStringArray * (*list_files_recursively)(const char *path,bool concat_path); - DtwStringArray * (*list_all_recursively)(const char *path,bool concat_path); - - - //extras - - char * (*generate_sha_from_file)(const char *path); - - char * (*generate_sha_from_string)(const char *string); - - char * (*generate_sha_from_any)(void *anything , long size); - - long int (*get_entity_last_motification_in_unix)(const char *path); - - char * (*convert_unix_time_to_string)(long int unix_time); - - char * (*get_entity_last_motification_in_string)(const char *path); - - char *(*concat_path)(const char *path1, const char *path2); - - - //base64 - - char *(*base64_encode)(unsigned char *data, long input_length); - - unsigned char *(*base64_decode)(const char *data, long *output_length); - - char *(*convert_binary_file_to_base64)(const char *path); - //string array - - DtwStringArrayModule string_array; - - DtwPathModule path; - - DtwLockerModule locker; - - DtwSchemaModule schema; - DtwTreeModule tree; - DtwHashModule hash; - DtwTransactionModule transaction; - - DtwResourceModule resource; - DtwRandonizerModule randonizer; - -}DtwNamespace; - -DtwNamespace newDtwNamespace(); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/path_module/path_module.c b/build/build/dependencies/doTheWorld/namespace/path_module/path_module.c deleted file mode 100644 index 20a19c5..0000000 --- a/build/build/dependencies/doTheWorld/namespace/path_module/path_module.c +++ /dev/null @@ -1,32 +0,0 @@ - -DtwPathModule newDtwPathModule(){ - DtwPathModule self = {0}; - self.newPath = newDtwPath; - self.changed =DtwPath_changed; - self.get_full_name = DtwPath_get_full_name; - self.get_name = DtwPath_get_name; - self.get_extension = DtwPath_get_extension; - self.get_path = DtwPath_get_path; - self.get_dir = DtwPath_get_dir; - self.get_total_dirs = DtwPath_get_total_dirs; - self.get_sub_dirs_from_index = DtwPath_get_sub_dirs_from_index; - self.insert_dir_at_index = DtwPath_insert_dir_at_index; - self.remove_sub_dirs_at_index = DtwPath_remove_sub_dirs_at_index; - self.insert_dir_after= DtwPath_insert_dir_after; - self.insert_dir_before = DtwPath_insert_dir_before; - self.replace_dirs = DtwPath_replace_dirs; - self.remove_sub_dirs_at = DtwPath_remove_sub_dirs_at; - - self.set_extension = DtwPath_set_extension; - self.set_name = DtwPath_set_name; - self.set_dir = DtwPath_set_dir; - self.set_full_name =DtwPath_set_full_name; - self.set_path = DtwPath_set_path; - - self.add_start_dir =DtwPath_add_start_dir; - self.add_end_dir = DtwPath_add_end_dir; - self.represent = DtwPath_represent; - self.free = DtwPath_free; - - return self; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/path_module/path_module.h b/build/build/dependencies/doTheWorld/namespace/path_module/path_module.h deleted file mode 100644 index 3d72f9a..0000000 --- a/build/build/dependencies/doTheWorld/namespace/path_module/path_module.h +++ /dev/null @@ -1,40 +0,0 @@ - - -typedef struct DtwPathModule{ - //Getters - - DtwPath * (*newPath)(const char *path); - bool (*changed)(struct DtwPath *self); - char *(*get_full_name) (struct DtwPath *self); - char *(*get_name) (struct DtwPath *self); - char *(*get_extension) (struct DtwPath *self); - - char *(*get_path) (struct DtwPath *self); - char *(*get_dir) (struct DtwPath *self); - - int (*get_total_dirs)(DtwPath *self); - char *(*get_sub_dirs_from_index)(DtwPath *self, int start,int end); - void (*insert_dir_at_index)(DtwPath *self,int index,const char *dir); - void (*remove_sub_dirs_at_index)(DtwPath *self,int start,int end); - void (*insert_dir_after)(DtwPath *self,const char *str,const char *dir); - void (*insert_dir_before)(DtwPath *self,const char *str,const char *dir); - void (*replace_dirs)(DtwPath *self,const char *str,const char *dir); - void (*remove_sub_dirs_at)(DtwPath *self,const char *str); - - - //Setters - void (*set_extension) (struct DtwPath *self, const char *extension); - void (*set_name) (struct DtwPath *self, const char *name); - void (*set_dir) (struct DtwPath *self, const char *path); - void (*set_full_name) (struct DtwPath *self, const char *full_name); - void (*set_path) (struct DtwPath *self, const char *target_path); - - void (*add_start_dir)(struct DtwPath *self, const char *start_dir); - void (*add_end_dir)(struct DtwPath *self, const char *end_dir); - - void (*represent)(struct DtwPath *self); - void (*free) (struct DtwPath *self); - -}DtwPathModule; - -DtwPathModule newDtwPathModule(); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/randonizer_module/randonizer_module.c b/build/build/dependencies/doTheWorld/namespace/randonizer_module/randonizer_module.c deleted file mode 100644 index 6c13129..0000000 --- a/build/build/dependencies/doTheWorld/namespace/randonizer_module/randonizer_module.c +++ /dev/null @@ -1,9 +0,0 @@ - - -DtwRandonizerModule newDtwRandonizerModule(){ - DtwRandonizerModule self = {0}; - self.newRandonizer = newDtwRandonizer; - self.generate_token =DtwRandonizer_generate_token; - self.free = DtwRandonizer_free; - return self; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/randonizer_module/randonizer_module.h b/build/build/dependencies/doTheWorld/namespace/randonizer_module/randonizer_module.h deleted file mode 100644 index d4785cb..0000000 --- a/build/build/dependencies/doTheWorld/namespace/randonizer_module/randonizer_module.h +++ /dev/null @@ -1,9 +0,0 @@ - -typedef struct DtwRandonizerModule{ - DtwRandonizer * (*newRandonizer)(); - - char * (*generate_token)(DtwRandonizer*self, int size); - void (*free)(DtwRandonizer *self); -}DtwRandonizerModule; - -DtwRandonizerModule newDtwRandonizerModule(); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/resource_module/declaration.h b/build/build/dependencies/doTheWorld/namespace/resource_module/declaration.h deleted file mode 100644 index a42e5a6..0000000 --- a/build/build/dependencies/doTheWorld/namespace/resource_module/declaration.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "resource_array_module/resource_array_module.h" -#include "resource_module/resource_module.h" \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/resource_module/definition.h b/build/build/dependencies/doTheWorld/namespace/resource_module/definition.h deleted file mode 100644 index 2b00f2e..0000000 --- a/build/build/dependencies/doTheWorld/namespace/resource_module/definition.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "resource_array_module/resource_array_module.c" -#include "resource_module/resource_module.c" \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/resource_module/resource_array_module/resource_array_module.c b/build/build/dependencies/doTheWorld/namespace/resource_module/resource_array_module/resource_array_module.c deleted file mode 100644 index 0b15152..0000000 --- a/build/build/dependencies/doTheWorld/namespace/resource_module/resource_array_module/resource_array_module.c +++ /dev/null @@ -1,8 +0,0 @@ -DtwResourceArrayModule newDtwResourceArrayModule(){ - DtwResourceArrayModule self = {0}; - self.append = DtwResourceArray_append; - self.represent = DtwResourceArray_represent; - self.get_by_name = DtwResourceArray_get_by_name; - self.free = DtwResourceArray_free; - return self; -} diff --git a/build/build/dependencies/doTheWorld/namespace/resource_module/resource_array_module/resource_array_module.h b/build/build/dependencies/doTheWorld/namespace/resource_module/resource_array_module/resource_array_module.h deleted file mode 100644 index 9767896..0000000 --- a/build/build/dependencies/doTheWorld/namespace/resource_module/resource_array_module/resource_array_module.h +++ /dev/null @@ -1,11 +0,0 @@ - -typedef struct DtwResourceArrayModule{ - - void (*append)(DtwResourceArray *self, DtwResource *element); - DtwResource * (*get_by_name)(DtwResourceArray *self, const char *name); - void (*represent)(DtwResourceArray *self); - void (*free)(DtwResourceArray *self); - -}DtwResourceArrayModule; - -DtwResourceArrayModule newDtwResourceArrayModule(); diff --git a/build/build/dependencies/doTheWorld/namespace/resource_module/resource_module/resource_module.c b/build/build/dependencies/doTheWorld/namespace/resource_module/resource_module/resource_module.c deleted file mode 100644 index 7d3c999..0000000 --- a/build/build/dependencies/doTheWorld/namespace/resource_module/resource_module/resource_module.c +++ /dev/null @@ -1,76 +0,0 @@ - -DtwResourceModule newDtwResourceModule(){ - DtwResourceModule self = {0}; - self.newResource = new_DtwResource; - self.get_error_code = DtwResource_get_error_code; - self.get_error_message = DtwResource_get_error_message; - self.error = DtwResource_error; - self.load = DtwResource_load; - self.clear_errors = DtwResource_clear_errors; - self.unload = DtwResource_unload; - self.sub_resource = DtwResource_sub_resource; - self.get_any_from_sub_resource = DtwResource_get_any_from_sub_resource; - self.get_binary_from_sub_resource = DtwResource_get_binary_from_sub_resource; - self.get_string_from_sub_resource = DtwResource_get_string_from_sub_resource; - self.get_long_from_sub_resource = DtwResource_get_long_from_sub_resource; - self.get_double_from_sub_resource = DtwResource_get_double_from_sub_resource; - self.get_bool_from_sub_resource = DtwResource_get_bool_from_sub_resource; - self.get_error_path = DtwResource_get_error_path; - self.get_schema_values = DtwResource_get_schema_values; - self.set_binary_in_sub_resource = DtwResource_set_binary_in_sub_resource; - self.set_string_in_sub_resource = DtwResource_set_string_in_sub_resource; - self.set_long_in_sub_resource = DtwResource_set_long_in_sub_resource; - self.set_double_in_sub_resource = DtwResource_set_double_in_sub_resource; - self.set_bool_in_sub_resource = DtwResource_set_bool_in_sub_resource; - self.is_file = DtwResource_is_file; - self.sub_resource_ensuring_not_exist = DtwResource_sub_resource_ensuring_not_exist; - self.sub_resource_next = DtwResource_sub_resource_next; - self.destroy_sub_resource = DtwResource_destroy_sub_resource; - self.rename_sub_resource = DtwResource_rename_sub_resource; - self.sub_resource_now = DtwResource_sub_resource_now; - self.sub_resource_now_in_unix = DtwResource_sub_resource_now_in_unix; - self.sub_resource_random = DtwResource_sub_resource_random; - self.set_binary_sha =DtwResource_set_binary_sha; - self.set_string_sha = DtwResource_set_string_sha; - self.set_binary_sha_in_sub_resource = DtwResource_set_binary_sha_in_sub_resource; - self.set_string_sha_in_sub_resource = DtwResource_set_string_sha_in_sub_resource; - - self.new_schema_insertion = DtwResource_new_schema_insertion; - self.find_by_name_id = DtwResource_find_by_name_id; - self.find_by_primary_key_with_string = DtwResource_find_by_primary_key_with_string; - self.find_by_primary_key_with_binary = DtwResource_find_by_primary_key_with_binary; - self.dangerous_remove_schema_prop = DtwResource_dangerous_remove_schema_prop; - self.dangerous_rename_schema_prop = DtwResource_dangerous_rename_schema_prop; - self.newSchema = DtwResource_newSchema; - - self.lock =DtwResource_lock; - self.unlock = DtwResource_unlock; - self.destroy = DtwResource_destroy; - - self.get_any = DtwResource_get_any; - self.get_string = DtwResource_get_string; - self.get_binary = DtwResource_get_binary; - self.get_double = DtwResource_get_double; - self.get_long = DtwResource_get_long; - self.get_bool = DtwResource_get_bool; - - self.set_binary = DtwResource_set_binary; - self.set_string = DtwResource_set_string; - self.set_long = DtwResource_set_long; - self.set_double = DtwResource_set_double; - self.set_bool = DtwResource_set_bool; - - - self.list_names = DtwResource_list_names; - self.size = DtwResource_size; - self.type = DtwResource_type; - self.type_in_str = DtwResource_type_in_str; - self.commit =DtwResource_commit; - self.represent = DtwResource_represent; - self.rename = DtwResource_rename; - self.free = DtwResource_free; - self.sub_resources = DtwResource_sub_resources; - self.array = newDtwResourceArrayModule(); - - return self; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/resource_module/resource_module/resource_module.h b/build/build/dependencies/doTheWorld/namespace/resource_module/resource_module/resource_module.h deleted file mode 100644 index 1e16dcd..0000000 --- a/build/build/dependencies/doTheWorld/namespace/resource_module/resource_module/resource_module.h +++ /dev/null @@ -1,104 +0,0 @@ - -typedef struct DtwResourceModule{ - - DtwResource *(*newResource)(const char *path); - int (*get_error_code)(DtwResource *self); - bool (*error)(DtwResource *self); - - char * (*get_error_message)(DtwResource *self); - bool (*is_file)(DtwResource *self); - void (*destroy_sub_resource)(DtwResource *self, const char *key); - void (*rename_sub_resource)(DtwResource *self,const char *old_name,const char *new_name); - DtwResource * (*sub_resource)(struct DtwResource *self,const char *format,...); - unsigned char *(*get_any_from_sub_resource)(DtwResource *self, long *size, bool *is_binary,const char *format,...); - unsigned char *(*get_binary_from_sub_resource)(DtwResource *self, long *size,const char *format,...); - char *(*get_string_from_sub_resource)(DtwResource *self,const char *format,...); - long (*get_long_from_sub_resource)(DtwResource *self,const char *format,...); - double (*get_double_from_sub_resource)(DtwResource *self,const char *format,...); - bool (*get_bool_from_sub_resource)(DtwResource *self,const char *format,...); - void (*set_binary_in_sub_resource)(DtwResource *self,const char *key, unsigned char *element, long size); - void (*set_string_in_sub_resource)(DtwResource *self,const char *key,const char *element); - void (*set_long_in_sub_resource)(DtwResource *self,const char *key,long element); - void (*set_double_in_sub_resource)(DtwResource *self,const char *key,double element); - void (*set_bool_in_sub_resource)( DtwResource *self,const char *key,bool element); - void (*set_binary_sha)(DtwResource *self, unsigned char *value, long size); - void (*set_string_sha)(DtwResource *self,const char *value); - - void (*set_binary_sha_in_sub_resource)(DtwResource *self,const char *key, unsigned char *value, long size); - void (*set_string_sha_in_sub_resource)(DtwResource *self,const char *key,const char *value); - - - - DtwResource * (*new_schema_insertion)(DtwResource *self); - DtwResource *(*find_by_name_id)(DtwResource *self, const char *name); - DtwResource * (*find_by_primary_key_with_binary)(DtwResource *self, const char *primary_key, unsigned char *value, long size); - DtwResource * (*find_by_primary_key_with_string)(DtwResource *self, const char *key, const char *value); - void (*dangerous_remove_schema_prop)(DtwResource*self,const char *prop); - void (*dangerous_rename_schema_prop)(DtwResource*self,const char *prop,const char *new_name); - DtwSchema * (*newSchema_with_custom_folders)(DtwResource *self,const char *values_name,const char *index_name, const char *format, ...); - DtwSchema * (*newSchema)(DtwResource *self); - char * (*get_error_path)(DtwResource *self); - DtwResourceArray * (*get_schema_values)(DtwResource *self); - - - DtwResource * (*sub_resource_ensuring_not_exist)(DtwResource *self,const char *format, ...); - DtwResource * (*sub_resource_next)(DtwResource *self, const char *end_path); - DtwResource * (*sub_resource_now)(DtwResource *self, const char *end_path); - - DtwResource * (*sub_resource_now_in_unix)(DtwResource *self,const char *end_path); - DtwResource * (*sub_resource_random)(DtwResource *self,const char *end_path); - - - void (*load)(DtwResource *self); - - void (*unload)(DtwResource *self); - - int (*lock)(DtwResource *self); - void (*unlock)(DtwResource *self); - - void (*destroy)(DtwResource *self); - void (*clear_errors)(DtwResource *self); - unsigned char *(*get_any)(struct DtwResource *self, long *size, bool *is_binary); - - unsigned char *(*get_binary)(struct DtwResource *self, long *size); - - char *(*get_string)(struct DtwResource *self); - - long (*get_long)(struct DtwResource *self); - - double (*get_double)(struct DtwResource *self); - - bool (*get_bool)(struct DtwResource *self); - - void (*set_binary)(DtwResource *self, unsigned char *element, long size); - - void (*set_string)(DtwResource *self,const char *element); - - void (*set_long)(DtwResource *self,long element); - - void (*set_double)(DtwResource *self,double element); - - void (*set_bool)(DtwResource *self,bool element); - - - - DtwStringArray *(*list_names)(DtwResource *self); - - long (*size)(DtwResource *self); - int (*type)(DtwResource *self); - - const char *(*type_in_str)(DtwResource *self); - void (*commit)(DtwResource *self); - - void (*represent)(DtwResource *self); - - void (*rename)(DtwResource *self,const char *new_name); - - void (*free)(DtwResource *self); - DtwResourceArray * (*sub_resources)(DtwResource *self); - DtwResourceArrayModule array; - - -}DtwResourceModule; - -DtwResourceModule newDtwResourceModule(); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/schema_module/schema_module.c b/build/build/dependencies/doTheWorld/namespace/schema_module/schema_module.c deleted file mode 100644 index 21e2743..0000000 --- a/build/build/dependencies/doTheWorld/namespace/schema_module/schema_module.c +++ /dev/null @@ -1,9 +0,0 @@ - - -DtwSchemaModule newDtwSchemaModule(){ - DtwSchemaModule self = {0}; - self.sub_schema = DtwSchema_new_subSchema; - self.add_primary_key = DtwSchema_add_primary_key; - - return self; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/schema_module/schema_module.h b/build/build/dependencies/doTheWorld/namespace/schema_module/schema_module.h deleted file mode 100644 index 108e197..0000000 --- a/build/build/dependencies/doTheWorld/namespace/schema_module/schema_module.h +++ /dev/null @@ -1,7 +0,0 @@ - -typedef struct { - void (*add_primary_key)(DtwSchema *self, const char *primary_key); - DtwSchema * (*sub_schema)(DtwSchema *self,const char *name); -}DtwSchemaModule; - -DtwSchemaModule newDtwSchemaModule(); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/string_array_module/string_array_module.c b/build/build/dependencies/doTheWorld/namespace/string_array_module/string_array_module.c deleted file mode 100644 index 7cbc961..0000000 --- a/build/build/dependencies/doTheWorld/namespace/string_array_module/string_array_module.c +++ /dev/null @@ -1,14 +0,0 @@ - -DtwStringArrayModule newDtwStringArrayModule(){ - DtwStringArrayModule self = {0}; - self.newStringArray = newDtwStringArray; - self.set_value = DtwStringArray_set_value; - self.append = DtwStringArray_append; - self.pop = DtwStringArray_pop; - self.merge = DtwStringArray_merge; - self.represent = DtwStringArray_represent; - self.find_position = DtwStringArray_find_position; - self.sort = DtwStringArray_sort; - self.free =DtwStringArray_free; - return self; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/string_array_module/string_array_module.h b/build/build/dependencies/doTheWorld/namespace/string_array_module/string_array_module.h deleted file mode 100644 index 81e1783..0000000 --- a/build/build/dependencies/doTheWorld/namespace/string_array_module/string_array_module.h +++ /dev/null @@ -1,24 +0,0 @@ - -typedef struct DtwStringArrayModule{ - DtwStringArray *(*newStringArray)(); - - void (*set_value)(struct DtwStringArray *self,int index,const char *value); - - void (*append)(struct DtwStringArray *self,const char *string); - - void (*pop)(struct DtwStringArray *self, int position); - - void (*merge)(struct DtwStringArray *self, struct DtwStringArray *other); - - void (*represent)(struct DtwStringArray *self); - - int (*find_position)(struct DtwStringArray *self,const char *string); - - void (*sort)(struct DtwStringArray *self); - - void (*free)(struct DtwStringArray *self); - - -}DtwStringArrayModule; - -DtwStringArrayModule newDtwStringArrayModule(); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/transaction_module/action/action.c b/build/build/dependencies/doTheWorld/namespace/transaction_module/action/action.c deleted file mode 100644 index d218b68..0000000 --- a/build/build/dependencies/doTheWorld/namespace/transaction_module/action/action.c +++ /dev/null @@ -1,17 +0,0 @@ - -DtwActionTransactionModule newDtwActionTransactionModule(){ - DtwActionTransactionModule self = {0}; - self.newAction = newDtwActionTransaction; - self.write_any = DtwActionTransaction_write_any; - self.move_any = DtwActionTransaction_move_any; - self.copy_any = DtwActionTransaction_copy_any; - self.move_any_merging = DtwActionTransaction_move_any_merging; - self.copy_any_merging = DtwActionTransaction_move_any_merging; - self.delete_any = DtwActionTransaction_delete_any; - self.convert_action_to_integer =DtwActionTransaction_convert_action_to_integer; - self.convert_action_to_string = DtwActionTransaction_convert_action_to_string; - self.commit = DtwActionTransaction_commit; - self.represent = DtwActionTransaction_represent; - self.free = DtwActionTransaction_free; - return self; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/transaction_module/action/action.h b/build/build/dependencies/doTheWorld/namespace/transaction_module/action/action.h deleted file mode 100644 index 88038dc..0000000 --- a/build/build/dependencies/doTheWorld/namespace/transaction_module/action/action.h +++ /dev/null @@ -1,29 +0,0 @@ - - -typedef struct DtwActionTransactionModule{ - - DtwActionTransaction *(*newAction)(); - - DtwActionTransaction * (*write_any)(const char *source,unsigned char *content,long size,bool is_binary); - - DtwActionTransaction * (*move_any)(const char *source, const char *dest); - DtwActionTransaction * (*move_any_merging)(const char *source, const char *dest); - DtwActionTransaction * (*copy_any_merging)(const char *source, const char *dest); - - DtwActionTransaction * (*copy_any)(const char *source, const char *dest); - - DtwActionTransaction * (*delete_any)(const char *source); - - short (*convert_action_to_integer)(char *action); - - const char * (*convert_action_to_string)(int action); - - void (*commit)(DtwActionTransaction* self,const char *path); - - void (*represent)(DtwActionTransaction* self); - - void (*free)(DtwActionTransaction* self); - -}DtwActionTransactionModule; - -DtwActionTransactionModule newDtwActionTransactionModule(); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/transaction_module/declaration.h b/build/build/dependencies/doTheWorld/namespace/transaction_module/declaration.h deleted file mode 100644 index 0a0501d..0000000 --- a/build/build/dependencies/doTheWorld/namespace/transaction_module/declaration.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "action/action.h" -#include "json_error_module/json_error_module.h" -#include "transaction_module/transaction_module.h" \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/transaction_module/definition.h b/build/build/dependencies/doTheWorld/namespace/transaction_module/definition.h deleted file mode 100644 index f4bba30..0000000 --- a/build/build/dependencies/doTheWorld/namespace/transaction_module/definition.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "action/action.c" -#include "json_error_module/json_error_module.c" -#include "transaction_module/transaction_module.c" \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/transaction_module/json_error_module/json_error_module.c b/build/build/dependencies/doTheWorld/namespace/transaction_module/json_error_module/json_error_module.c deleted file mode 100644 index 1a49a6c..0000000 --- a/build/build/dependencies/doTheWorld/namespace/transaction_module/json_error_module/json_error_module.c +++ /dev/null @@ -1,7 +0,0 @@ - -DtwJsonTransactionErrorModule newDtwJsonTransactionErrorModule(){ - DtwJsonTransactionErrorModule self = {0}; - self.represent = DtwJsonTransactionError_represent; - self.free = DtwJsonTransactionError_free; - return self; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/transaction_module/json_error_module/json_error_module.h b/build/build/dependencies/doTheWorld/namespace/transaction_module/json_error_module/json_error_module.h deleted file mode 100644 index 427dcdc..0000000 --- a/build/build/dependencies/doTheWorld/namespace/transaction_module/json_error_module/json_error_module.h +++ /dev/null @@ -1,9 +0,0 @@ - - -typedef struct DtwJsonTransactionErrorModule{ - void (*represent)(struct DtwJsonTransactionError *self); - void (*free)(struct DtwJsonTransactionError *self); - -}DtwJsonTransactionErrorModule; - -DtwJsonTransactionErrorModule newDtwJsonTransactionErrorModule(); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/transaction_module/transaction_module/transaction_module.c b/build/build/dependencies/doTheWorld/namespace/transaction_module/transaction_module/transaction_module.c deleted file mode 100644 index 85d216d..0000000 --- a/build/build/dependencies/doTheWorld/namespace/transaction_module/transaction_module/transaction_module.c +++ /dev/null @@ -1,37 +0,0 @@ - - -DtwTransactionModule newDtwTransactionModule(){ - DtwTransactionModule self = {0}; - self.newTransaction = newDtwTransaction; - self.newTransaction_from_json = newDtwTransaction_from_json; - self.newTransaction_from_json_file = newDtwTransaction_from_json_file; - self.validate_json_transaction_file = dtw_validate_json_transaction_file; - self.remove_from_index = DtwTransaction_remove_from_index; - self.remove_from_source = DtwTransaction_remove_from_source; - self.filter = DtwTransaction_filter; - self.append_action = DtwTransaction_append_action; - self.write_any = DtwTransaction_write_any; - self.write_string = DtwTransaction_write_string; - self.write_long = DtwTransaction_write_long; - self.write_bool = DtwTransaction_write_bool; - self.write_double = DtwTransaction_write_double; - - self.move_any_merging = DtwTransaction_move_any_merging; - self.copy_any_merging = DtwTransaction_copy_any_merging; - self.move_any = DtwTransaction_move_any; - self.copy_any = DtwTransaction_copy_any; - self.delete_any = DtwTransaction_delete_any; - - self.dumps_transaction_to_json = DtwTransaction_dumps_to_json; - self.dumps_transaction_to_json_file = DtwTransaction_dumps_to_json_file; - - self.commit = DtwTransaction_commit; - self.represent = DtwTransaction_represent; - self.free =DtwTransaction_free; - - self.action = newDtwActionTransactionModule(); - self.json_error = newDtwJsonTransactionErrorModule(); - - - return self; -} diff --git a/build/build/dependencies/doTheWorld/namespace/transaction_module/transaction_module/transaction_module.h b/build/build/dependencies/doTheWorld/namespace/transaction_module/transaction_module/transaction_module.h deleted file mode 100644 index 80b4862..0000000 --- a/build/build/dependencies/doTheWorld/namespace/transaction_module/transaction_module/transaction_module.h +++ /dev/null @@ -1,41 +0,0 @@ - -typedef struct DtwTransactionModule{ - DtwTransaction *(*newTransaction)(); - DtwTransaction * (*newTransaction_from_json)(cJSON *json_entry); - DtwTransaction * (*newTransaction_from_json_file)(const char *filename); - DtwJsonTransactionError * (*validate_json_transaction_file)(const char *filename); - - void (*remove_from_index)(DtwTransaction *self,long index); - void (*remove_from_source)(DtwTransaction *self,const char *source); - void (*filter)(DtwTransaction *self,bool (*callback)(DtwActionTransaction *action)); - - void (*append_action)(struct DtwTransaction *self,struct DtwActionTransaction *action); - void (*write_any)(struct DtwTransaction *self,const char *path,unsigned char *content, long size,bool is_binary); - void (*write_string)(struct DtwTransaction *self,const char *path,const char *content); - - void (*write_long)(struct DtwTransaction *self,const char *path,long value); - void (*write_bool)(struct DtwTransaction *self,const char *path,bool value); - void (*write_double)(struct DtwTransaction *self,const char *path,double value); - - void (*move_any_merging)(struct DtwTransaction *self,const char *source,const char *dest); - void (*copy_any_merging)(struct DtwTransaction *self,const char *source,const char *dest); - - - void (*move_any)(struct DtwTransaction *self,const char *source,const char *dest); - void (*copy_any)(struct DtwTransaction *self,const char *source,const char *dest); - void (*delete_any)(struct DtwTransaction *self,const char *source); - - cJSON *(*dumps_transaction_to_json)(struct DtwTransaction *self); - void (*dumps_transaction_to_json_file)(struct DtwTransaction *self,const char *filename); - - void (*commit)(struct DtwTransaction *self,const char *source); - void (*represent)(struct DtwTransaction *self); - void (*free)(struct DtwTransaction *self); - - DtwActionTransactionModule action; - DtwJsonTransactionErrorModule json_error; - - -}DtwTransactionModule; - -DtwTransactionModule newDtwTransactionModule(); diff --git a/build/build/dependencies/doTheWorld/namespace/tree_module/declaration.h b/build/build/dependencies/doTheWorld/namespace/tree_module/declaration.h deleted file mode 100644 index c41adb8..0000000 --- a/build/build/dependencies/doTheWorld/namespace/tree_module/declaration.h +++ /dev/null @@ -1,4 +0,0 @@ -#include "tree_part_module/tree_part_module.h" -#include "json_error/json_error.h" -#include "transaction_report/transaction_report_module.h" -#include "tree/tree.h" diff --git a/build/build/dependencies/doTheWorld/namespace/tree_module/definition.h b/build/build/dependencies/doTheWorld/namespace/tree_module/definition.h deleted file mode 100644 index a1a3b9a..0000000 --- a/build/build/dependencies/doTheWorld/namespace/tree_module/definition.h +++ /dev/null @@ -1,4 +0,0 @@ -#include "tree_part_module/tree_part_module.c" -#include "json_error/json_error.c" -#include "transaction_report/transaction_report_module.c" -#include "tree/tree.c" diff --git a/build/build/dependencies/doTheWorld/namespace/tree_module/json_error/json_error.c b/build/build/dependencies/doTheWorld/namespace/tree_module/json_error/json_error.c deleted file mode 100644 index 2e55292..0000000 --- a/build/build/dependencies/doTheWorld/namespace/tree_module/json_error/json_error.c +++ /dev/null @@ -1,7 +0,0 @@ - -DtwJsonTreeErrorModule newDtwJsonTreeErrorModule(){ - DtwJsonTreeErrorModule self = {0}; - self.represent =DtwJsonTreeError_represent; - self.free = DtwJsonTreeError_free; - return self; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/tree_module/json_error/json_error.h b/build/build/dependencies/doTheWorld/namespace/tree_module/json_error/json_error.h deleted file mode 100644 index 840f7b9..0000000 --- a/build/build/dependencies/doTheWorld/namespace/tree_module/json_error/json_error.h +++ /dev/null @@ -1,9 +0,0 @@ - - -typedef struct DtwJsonTreeErrorModule{ - void (*free)(struct DtwJsonTreeError *self); - void (*represent)(struct DtwJsonTreeError *self); - -}DtwJsonTreeErrorModule; - -DtwJsonTreeErrorModule newDtwJsonTreeErrorModule(); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/tree_module/transaction_report/transaction_report_module.c b/build/build/dependencies/doTheWorld/namespace/tree_module/transaction_report/transaction_report_module.c deleted file mode 100644 index 949a0f0..0000000 --- a/build/build/dependencies/doTheWorld/namespace/tree_module/transaction_report/transaction_report_module.c +++ /dev/null @@ -1,7 +0,0 @@ - -DtwTreeTransactionReportModule newDtwTreeTransactionReportModule(){ - DtwTreeTransactionReportModule self = {0}; - self.represent = DtwTreeTransactionReport_represent; - self.free = DtwTreeTransactionReport_free; - return self; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/tree_module/transaction_report/transaction_report_module.h b/build/build/dependencies/doTheWorld/namespace/tree_module/transaction_report/transaction_report_module.h deleted file mode 100644 index 6b4afc7..0000000 --- a/build/build/dependencies/doTheWorld/namespace/tree_module/transaction_report/transaction_report_module.h +++ /dev/null @@ -1,9 +0,0 @@ - -typedef struct DtwTreeTransactionReportModule{ - - void (*represent)(struct DtwTreeTransactionReport *report); - void (*free)(struct DtwTreeTransactionReport *report); - -}DtwTreeTransactionReportModule; - -DtwTreeTransactionReportModule newDtwTreeTransactionReportModule(); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/tree_module/tree/tree.c b/build/build/dependencies/doTheWorld/namespace/tree_module/tree/tree.c deleted file mode 100644 index 6f62d9f..0000000 --- a/build/build/dependencies/doTheWorld/namespace/tree_module/tree/tree.c +++ /dev/null @@ -1,42 +0,0 @@ - -DtwTreeModule newDtwTreeModule(){ - DtwTreeModule self = {0}; - self.newTree = newDtwTree; - self.add_tree_part_by_copy = DtwTree_add_tree_part_copy; - self.remove_tree_part = DtwTree_remove_tree_part; - self.add_tree_part_getting_owenership = DtwTree_add_tree_part_getting_onwership; - self.add_tree_part_referencing = DtwTree_add_tree_part_referencing; - self.add_tree_parts_from_string_array = DtwTree_add_tree_parts_from_string_array; - self.get_sub_tree = DtwTree_get_sub_tree; - self.add_tree_from_hardware = DtwTree_add_tree_from_hardware; - self.find_tree_part_by_function = DtwTree_find_tree_part_by_function; - self.filter = DtwTree_filter; - self.map = DtwTree_map; - - self.list_files = DtwTree_list_files; - self.list_dirs = DtwTree_list_dirs; - self.list_all = DtwTree_list_all; - - self.list_files_recursively = DtwTree_list_files_recursively; - self.list_dirs_recursively = DtwTree_list_dirs_recursively; - self.list_all_recursively = DtwTree_list_all_recursively; - - self.find_tree_part_by_name = DtwTree_find_tree_part_by_name; - self.find_tree_part_by_path = DtwTree_find_tree_part_by_path; - - self.create_report = DtwTree_create_report; - self.loads_json_tree = DtwTree_loads_json_tree; - self.loads_json_tree_from_file = DtwTree_loads_json_tree_from_file; - self.dumps_json_tree = DtwTree_dumps_tree_json; - self.dumps_json_tree_to_file = DtwTree_dumps_tree_json_to_file; - - self.represent = DtwTree_represent; - self.insecure_hardware_remove_tree = DtwTree_insecure_hardware_remove_tree; - self.insecure_hardware_write_tree = DtwTree_insecure_hardware_write_tree; - self.hardware_commit_tree = DtwTree_hardware_commit_tree; - self.free = DtwTree_free; - self.transaction_report = newDtwTreeTransactionReportModule(); - self.part = newDtwTreePartModule(); - self.json_error = newDtwJsonTreeErrorModule(); - return self; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/tree_module/tree/tree.h b/build/build/dependencies/doTheWorld/namespace/tree_module/tree/tree.h deleted file mode 100644 index 12123e5..0000000 --- a/build/build/dependencies/doTheWorld/namespace/tree_module/tree/tree.h +++ /dev/null @@ -1,108 +0,0 @@ - -typedef struct DtwTreeModule{ - - DtwTree *(*newTree)(); - void (*add_tree_part_by_copy)( - DtwTree *self, - DtwTreePart *tree_part - ); - - void (*remove_tree_part)( - DtwTree *self, - int position - ); - - void (*add_tree_part_getting_owenership)( - DtwTree *self, - DtwTreePart *tree_part - ); - void (*add_tree_part_referencing)( - DtwTree *self, - DtwTreePart *tree_part - ); - void (*add_tree_parts_from_string_array)( - struct DtwTree *self, - struct DtwStringArray *paths, - DtwTreeProps props - ); - - struct DtwTree *(*get_sub_tree)( - struct DtwTree *self, - const char *path, - bool copy_content - ); - - void (*add_tree_from_hardware)( - struct DtwTree *self, - const char *path, - DtwTreeProps props - ); - //Listage Functions - - DtwTreePart *(*find_tree_part_by_function)( - struct DtwTree *self, - bool (*caller)(struct DtwTreePart *part) - ); - - DtwTree *(*filter)( - struct DtwTree *self, - bool (*caller)(struct DtwTreePart *part) - ); - - DtwTree *(*map)( - struct DtwTree *self, - struct DtwTreePart*(*caller)(struct DtwTreePart *part) - ); - - - DtwStringArray * (*list_files)(struct DtwTree *self, const char *path,bool concat_path); - DtwStringArray * (*list_dirs)(struct DtwTree *self, const char *path,bool concat_path); - DtwStringArray * (*list_all)(struct DtwTree *self, const char *path,bool concat_path); - - DtwStringArray * (*list_files_recursively)(struct DtwTree *self, const char *path,bool concat_path); - DtwStringArray * (*list_dirs_recursively)(struct DtwTree *self, const char *path,bool concat_path); - DtwStringArray * (*list_all_recursively)(struct DtwTree *self, const char *path,bool concat_path); - - - struct DtwTreePart *(*find_tree_part_by_name)( struct DtwTree *self,const char *name); - struct DtwTreePart *(*find_tree_part_by_path)( struct DtwTree *self,const char *path); - - - struct DtwTreeTransactionReport * (*create_report)(struct DtwTree *self); - - void (*loads_json_tree)( - struct DtwTree *self, - const char *content - ); - - - void (*loads_json_tree_from_file)( - struct DtwTree *self, - const char *path - ); - - char *(*dumps_json_tree)( - struct DtwTree *self, - DtwTreeProps props - ); - - void (*dumps_json_tree_to_file)( - struct DtwTree *self, - const char *path, - DtwTreeProps props - ); - - void (*represent)(struct DtwTree *self); - void (*insecure_hardware_remove_tree)(struct DtwTree *self); - void (*insecure_hardware_write_tree)(struct DtwTree *self); - void (*hardware_commit_tree)(struct DtwTree *self); - void (*free)(struct DtwTree *self); - - DtwTreeTransactionReportModule transaction_report; - - DtwTreePartModule part; - DtwJsonTreeErrorModule json_error; - -}DtwTreeModule; - -DtwTreeModule newDtwTreeModule(); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/namespace/tree_module/tree_part_module/tree_part_module.c b/build/build/dependencies/doTheWorld/namespace/tree_module/tree_part_module/tree_part_module.c deleted file mode 100644 index 946c9da..0000000 --- a/build/build/dependencies/doTheWorld/namespace/tree_module/tree_part_module/tree_part_module.c +++ /dev/null @@ -1,28 +0,0 @@ - - -DtwTreePartModule newDtwTreePartModule(){ - DtwTreePartModule self ={0}; - self.newPart = newDtwTreePart; - self.newPartEmpty = newDtwTreePartEmpty; - self.newPartLoading = newDtwTreePartLoading; - self.get_content_string_by_reference = DtwTreePart_get_content_string_by_reference; - self.get_content_binary_by_reference = DtwTreePart_get_content_binary_by_reference; - self.get_content_sha = DtwTreePart_get_content_sha; - self.last_modification_time_in_string = DtwTreePart_last_modification_time_in_string; - self.set_any_content = DtwTreePart_set_any_content; - self.set_string_content = DtwTreePart_set_string_content; - self.set_binary_content = DtwTreePart_set_binary_content; - self.load_content_from_hardware =DtwTreePart_load_content_from_hardware; - self.free_content = DtwTreePart_free_content; - self.represent =DtwTreePart_represent; - self.hardware_remove = DtwTreePart_hardware_remove; - self.hardware_write = DtwTreePart_hardware_write; - self.hardware_modify = DtwTreePart_hardware_modify; - self.hardware_commit =DtwTreePart_hardware_commit; - - self.free = DtwTreePart_free; - self.self_copy = DtwTreePart_self_copy; - - - return self; -} diff --git a/build/build/dependencies/doTheWorld/namespace/tree_module/tree_part_module/tree_part_module.h b/build/build/dependencies/doTheWorld/namespace/tree_module/tree_part_module/tree_part_module.h deleted file mode 100644 index 6afb1d3..0000000 --- a/build/build/dependencies/doTheWorld/namespace/tree_module/tree_part_module/tree_part_module.h +++ /dev/null @@ -1,31 +0,0 @@ - - -typedef struct DtwTreePartModule{ - - DtwTreePart *(*newPart)(const char *path, DtwTreeProps props); - DtwTreePart *(*newPartEmpty)(const char *path); - DtwTreePart * (*newPartLoading)(const char *path); - - char *(*get_content_string_by_reference)(struct DtwTreePart *self); - unsigned char *(*get_content_binary_by_reference)(struct DtwTreePart *self); - - char *(*get_content_sha)(struct DtwTreePart *self); - char *(*last_modification_time_in_string)(struct DtwTreePart *self); - void (*set_any_content)(struct DtwTreePart *self,unsigned char *content,int content_size,bool is_binary); - void (*set_string_content)(struct DtwTreePart *self,const char *content); - void (*set_binary_content)(struct DtwTreePart *self,unsigned char *content,int content_size); - void (*load_content_from_hardware)(struct DtwTreePart *self); - void (*free_content)(struct DtwTreePart *self); - void(*represent)(struct DtwTreePart *self); - - bool(*hardware_remove)(struct DtwTreePart *self, int transaction); - bool(*hardware_write)(struct DtwTreePart *self, int transaction); - bool(*hardware_modify)(struct DtwTreePart *self, int transaction); - bool(*hardware_commit)(struct DtwTreePart *self); - - void (*free)(struct DtwTreePart *self); - struct DtwTreePart *(*self_copy)(struct DtwTreePart *self); -}DtwTreePartModule; - - -DtwTreePartModule newDtwTreePartModule(); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/numeral_io/numeral_io.c b/build/build/dependencies/doTheWorld/numeral_io/numeral_io.c deleted file mode 100644 index 22489a0..0000000 --- a/build/build/dependencies/doTheWorld/numeral_io/numeral_io.c +++ /dev/null @@ -1,103 +0,0 @@ - -long dtw_load_long_file_content_setting_error(const char *path,int *error){ - char *data = dtw_load_string_file_content(path); - if(!data){ - *error = DTW_NOT_FOUND; - return DTW_NOT_FOUND; - } - long value = -1; - int result = sscanf(data,"%ld",&value); - free(data); - if(result){ - return value; - } - *error = DTW_NOT_NUMERICAL; - return DTW_NOT_NUMERICAL; -} - - -long dtw_load_long_file_content(const char * path){ - int error; - return dtw_load_long_file_content_setting_error(path,&error); -} - - -double dtw_load_double_file_content_setting_error(const char * path, int *error){ - char *data = dtw_load_string_file_content(path); - if(!data){ - *error = DTW_NOT_FOUND; - return DTW_NOT_FOUND; - } - double value = -1; - int result = sscanf(data,"%lf",&value); - free(data); - if(result){ - - return value; - } - *error = DTW_NOT_NUMERICAL; - return DTW_NOT_NUMERICAL; -} - - -double dtw_load_double_file_content(const char * path){ - int error; - return dtw_load_double_file_content_setting_error(path,&error); -} - - -bool dtw_load_bool_file_content_setting_error(const char * path, int *error){ - char *data = dtw_load_string_file_content(path); - if(!data){ - *error = DTW_NOT_FOUND; - return false; - } - - if(strcmp(data,"true") == 0 || strcmp(data,"t") == 0){ - free(data); - return true; - } - - if(strcmp(data,"false") == 0 || strcmp(data,"f") == 0){ - free(data); - return false; - } - free(data); - *error = DTW_NOT_BOOL; - return false; - -} - - -bool dtw_load_bool_file_content(const char * path){ - int error; - return dtw_load_bool_file_content_setting_error(path,&error); - -} - - - -void dtw_write_long_file_content(const char *path, long value){ - char result[30] ={0}; - sprintf(result,"%ld",value); - dtw_write_string_file_content(path,result); -} - - -void dtw_write_double_file_content(const char *path,double value){ - char result[30] ={0}; - sprintf(result,"%lf",value); - dtw_write_string_file_content(path,result); -} - - -void dtw_write_bool_file_content(const char *path, bool value){ - if(value){ - dtw_write_string_file_content(path,"t"); - } - else{ - dtw_write_string_file_content(path,"f"); - } -} - - diff --git a/build/build/dependencies/doTheWorld/numeral_io/numeral_io.h b/build/build/dependencies/doTheWorld/numeral_io/numeral_io.h deleted file mode 100644 index 4be9bdd..0000000 --- a/build/build/dependencies/doTheWorld/numeral_io/numeral_io.h +++ /dev/null @@ -1,25 +0,0 @@ - - -#define DTW_NOT_NUMERICAL -2 -#define DTW_NOT_BOOL -3 - -long dtw_load_long_file_content_setting_error(const char *path,int *error); - -long dtw_load_long_file_content(const char * path); - -double dtw_load_double_file_content_setting_error(const char * path, int *error); - -double dtw_load_double_file_content(const char * path); - -bool dtw_load_bool_file_content_setting_error(const char * path, int *error); - - -bool dtw_load_bool_file_content(const char * path); - - -void dtw_write_long_file_content(const char *path, long value); - -void dtw_write_bool_file_content(const char *path, bool value); - -void dtw_write_double_file_content(const char *path,double value); - diff --git a/build/build/dependencies/doTheWorld/one.c b/build/build/dependencies/doTheWorld/one.c deleted file mode 100644 index 1d778a9..0000000 --- a/build/build/dependencies/doTheWorld/one.c +++ /dev/null @@ -1,40 +0,0 @@ - -// USE THIS FILE ONLY FOR PRODUCTION -// This file is part of the DoTheWorld project. -// Do not edit this file, it is automatically generated. -// See the README.md file for more information. -/* -MIT License - -Copyright (c) 2023 Mateus Moutinho Queiroz - -Permission is hereby granted, free of charge, to any person obtaining a copy -of this software and associated documentation files (the "Software"), to deal -in the Software without restriction, including without limitation the rights -to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -copies of the Software, and to permit persons to whom the Software is -furnished to do so, subject to the following conditions: - -The above copyright notice and this permission notice shall be included in all -copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE -SOFTWARE. -*/ - -#ifndef DO_THE_WORLD_H -#define DO_THE_WORLD_H -#include "declaration.h" -#include "globals.h" - -#include "definition.h" -#endif //DO_THE_WORLD_H - - - - diff --git a/build/build/dependencies/doTheWorld/path/getters.c b/build/build/dependencies/doTheWorld/path/getters.c deleted file mode 100644 index e1f02b7..0000000 --- a/build/build/dependencies/doTheWorld/path/getters.c +++ /dev/null @@ -1,85 +0,0 @@ - - -char * DtwPath_get_name(struct DtwPath *self){ - - long path_size = (long)strlen(self->path); - long start = 0; - long end = path_size; - for(long i = path_size-1; i >=0; i--){ - char current_char = self->path[i]; - if(current_char == '/' || current_char == '\\'){ - start = i+1; - break; - } - if(current_char == '.'){ - end = i; - } - } - if(end - start == 0){ - return NULL; - } - - char *buffer = private_dtw_sub_str(self->path,start,end); - return privateDtwStringArray_append_if_not_included(self->garbage,buffer); - -} -char * DtwPath_get_extension(struct DtwPath *self){ - long path_size = (long)strlen(self->path); - long start = -1; - long end = path_size; - for(long i = path_size-1; i >=0; i--){ - char current_char = self->path[i]; - if(current_char == '.'){ - start = i+1; - break; - } - } - if(start == -1){ - return NULL; - } - char *buffer = private_dtw_sub_str(self->path,start,end); - return privateDtwStringArray_append_if_not_included(self->garbage,buffer); -} - -char * DtwPath_get_full_name(struct DtwPath *self){ - long path_size = (long)strlen(self->path); - long start = 0; - long end = path_size; - for(long i = path_size-1; i >=0; i--){ - char current_char = self->path[i]; - if(current_char == '/' || current_char == '\\'){ - start = i+1; - break; - } - } - if(end - start == 0){ - return NULL; - } - char *buffer = private_dtw_sub_str(self->path,start,end); - return privateDtwStringArray_append_if_not_included(self->garbage,buffer); -} - -char * DtwPath_get_dir(struct DtwPath *self){ - long path_size = (long)strlen(self->path); - long start = 0; - long end = -1; - for(long i = path_size-1; i >=0; i--){ - char current_char = self->path[i]; - if(current_char == '/' || current_char == '\\'){ - end = i+1; - break; - } - } - if(end == -1){ - return NULL; - } - - char *buffer = private_dtw_sub_str(self->path,start,end); - return privateDtwStringArray_append_if_not_included(self->garbage,buffer); -} - -char * DtwPath_get_path(struct DtwPath *self){ - return self->path; -} - - diff --git a/build/build/dependencies/doTheWorld/path/index_dirs.c b/build/build/dependencies/doTheWorld/path/index_dirs.c deleted file mode 100644 index ad27e43..0000000 --- a/build/build/dependencies/doTheWorld/path/index_dirs.c +++ /dev/null @@ -1,160 +0,0 @@ - -int DtwPath_get_total_dirs(DtwPath *self){ - int size = 0; - int path_size = (int)strlen(self->path); - for(int i = 0; i < path_size;i++){ - char current = self->path[i]; - if(current == '/' || current =='\\'){ - size+=1; - } - } - return size; -} - -char *DtwPath_get_sub_dirs_from_index(DtwPath *self, int start, int end){ - - int size = DtwPath_get_total_dirs(self); - if(size == 0){ - return NULL; - } - int converted_start_index = (int)private_dtw_convert_index(start, size); - int converted_end_index = (int)private_dtw_convert_index(end, size); - - char *dir = DtwPath_get_dir(self); - int dirs_string_size = (int)strlen(dir); - int total_dirs = 0; - int start_point = 0; - int end_point = dirs_string_size; - - for(int i= 0 ;i < dirs_string_size;i++ ){ - char current = dir[i]; - if(current == '/' || current =='\\'){ - total_dirs+=1; - } - if(total_dirs == converted_start_index){ - start_point = i; - } - - if(total_dirs == (converted_end_index + 1)){ - end_point = i; - } - } - char *buffer = private_dtw_sub_str(dir,start_point,end_point); - return privateDtwStringArray_append_if_not_included(self->garbage,buffer); -} - - - -int private_dtw_count_dirs_before(const char *dirs,int index){ - int total = 0; - for(int i =index; i >=0; i--){ - char current_char = dirs[i]; - if(current_char == '\\' || current_char == '/' ){ - total+=1; - } - } - return total; -} - -void DtwPath_insert_dir_at_index(DtwPath *self, int index, const char *dir){ - - int size = DtwPath_get_total_dirs(self); - int converted_index = (int)private_dtw_convert_index(index,size+1); - - char * starter = NULL; - if(converted_index > 0){ - starter = DtwPath_get_sub_dirs_from_index(self, 0, converted_index - 1); - } - - const char *rest =NULL; - if(converted_index < size){ - rest = DtwPath_get_sub_dirs_from_index(self, converted_index, -1); - } - - - char *buffer =NULL; - if(starter && rest){ - buffer = private_dtw_formatt("%s/%s/%s",starter,dir,rest); - } - if(starter && !rest){ - buffer = private_dtw_formatt("%s/%s",starter,dir); - } - if(!starter && rest){ - buffer = private_dtw_formatt("%s/%s",dir,rest); - } - - if(!starter && !rest){ - buffer = (char*)dir; - } - - DtwPath_set_dir(self,buffer); - - if(starter || rest){ - free(buffer); - } -} - -void DtwPath_insert_dir_after(DtwPath *self,const char *str,const char *dir){ - char *current_dir = DtwPath_get_dir(self); - int index = (int)dtw_index_of_string(current_dir,str); - if(index == -1){ - return; - } - - int start = private_dtw_count_dirs_before(current_dir,index)+1; - DtwPath_insert_dir_at_index(self, start, dir); -} - -void DtwPath_insert_dir_before(DtwPath *self,const char *str,const char *dir){ - char *current_dir = DtwPath_get_dir(self); - int index = (int)dtw_index_of_string(current_dir,str); - if(index == -1){ - return; - } - int start = private_dtw_count_dirs_before(current_dir,index); - DtwPath_insert_dir_at_index(self, start, dir); -} - -void DtwPath_remove_sub_dirs_at_index(DtwPath *self, int start, int end){ - - int size = DtwPath_get_total_dirs(self); - if(size == 0){ - return ; - } - int converted_start_index = (int)private_dtw_convert_index(start, size); - int converted_end_index = (int)private_dtw_convert_index(end, size); - - - char *start_dirs = NULL; - if(converted_start_index > 0){ - start_dirs = DtwPath_get_sub_dirs_from_index(self, 0, converted_start_index - 1); - } - - char *end_dirs = DtwPath_get_sub_dirs_from_index(self, converted_end_index + 1, -1); - - if(start_dirs){ - char *buffer = private_dtw_formatt("%s/%s",start_dirs,end_dirs); - DtwPath_set_dir(self,buffer); - free(buffer); - } - - if(!start_dirs){ - DtwPath_set_dir(self,end_dirs); - } - -} - -void DtwPath_remove_sub_dirs_at(DtwPath *self,const char *str){ - char *current_dir = DtwPath_get_dir(self); - int index = (int)dtw_index_of_string(current_dir,str); - if(index == -1){ - return; - } - - int start = private_dtw_count_dirs_before(current_dir,index); - int end = private_dtw_count_dirs_before(current_dir,index+ (int)strlen(str)); - printf("start %d\n",start); - - printf("end %d\n",end); - DtwPath_remove_sub_dirs_at_index(self, start, end - 1); -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/path/path.c b/build/build/dependencies/doTheWorld/path/path.c deleted file mode 100644 index e33f3e2..0000000 --- a/build/build/dependencies/doTheWorld/path/path.c +++ /dev/null @@ -1,46 +0,0 @@ - - -struct DtwPath * newDtwPath(const char *path) { - struct DtwPath *self = (struct DtwPath *)malloc(sizeof(struct DtwPath)); - self->garbage = newDtwStringArray(); - self->path = private_dtw_format_path(path); - self->original_path_string = strdup(self->path); - - - return self; -} -bool DtwPath_changed(struct DtwPath *self){ - return strcmp(self->path,self->original_path_string) != 0; -} - - - - -void DtwPath_represent(struct DtwPath *self){ - char *path = DtwPath_get_path(self); - char *full_name = DtwPath_get_full_name(self); - char *dir = DtwPath_get_dir(self); - char *name = DtwPath_get_name(self); - char *extension = DtwPath_get_extension(self); - bool changed = DtwPath_changed(self); - - printf("First Path: %s\n", self->original_path_string ? self->original_path_string : "NULL"); - printf("Path: %s\n", path ? path : "NULL"); - printf("Path Changed: %s\n", changed ? "true" : "false"); - printf("Dir: %s\n", dir ? dir : "NULL"); - printf("Full Name: %s\n", full_name ? full_name : "NULL"); - printf("Name: %s\n", name ? name : "NULL"); - printf("Extension: %s\n", extension ? extension : "NULL"); - - -} - - - -void DtwPath_free(struct DtwPath *self) { - DtwStringArray_free(self->garbage); - free(self->original_path_string); - free(self->path); - free(self); -} - diff --git a/build/build/dependencies/doTheWorld/path/path.h b/build/build/dependencies/doTheWorld/path/path.h deleted file mode 100644 index 4368a8b..0000000 --- a/build/build/dependencies/doTheWorld/path/path.h +++ /dev/null @@ -1,61 +0,0 @@ - -typedef struct DtwPath { - char *original_path_string; - char *path; - DtwStringArray *garbage; - - -}DtwPath; -struct DtwPath * newDtwPath(const char *path); -bool DtwPath_changed(DtwPath *self); - -char *DtwPath_get_full_name(DtwPath *self); - -char *DtwPath_get_name(DtwPath *self); - -char *DtwPath_get_extension( DtwPath *self); - -char *DtwPath_get_path(DtwPath *self); - -char *DtwPath_get_dir(DtwPath *self); - -void DtwPath_set_extension(DtwPath *self, const char *extension); - -void DtwPath_set_name(DtwPath * self, const char * name); - -void DtwPath_set_dir(DtwPath *self, const char *path); - -void DtwPath_set_full_name(DtwPath * self, const char * full_name); - -void DtwPath_set_path(DtwPath *self, const char *target_path); - -void DtwPath_add_start_dir(DtwPath *self, const char *start_dir); - -void DtwPath_add_end_dir(DtwPath *self, const char *end_dir); - -void DtwPath_represent(DtwPath *self); - -int DtwPath_get_total_dirs(DtwPath *self); - -char *DtwPath_get_sub_dirs_from_index(DtwPath *self, int start, int end); - -void DtwPath_insert_dir_at_index(DtwPath *self, int index, const char *dir); - -void DtwPath_remove_sub_dirs_at_index(DtwPath *self, int start, int end); - - -int private_dtw_count_dirs_before(const char *dirs,int index); - - - -void DtwPath_insert_dir_after(DtwPath *self,const char *str,const char *dir); - -void DtwPath_insert_dir_before(DtwPath *self,const char *str,const char *dir); - -void DtwPath_replace_dirs(DtwPath *self,const char *str,const char *dir); - -void DtwPath_remove_sub_dirs_at(DtwPath *self,const char *str); - -void DtwPath_free(DtwPath *self); - - diff --git a/build/build/dependencies/doTheWorld/path/setters.c b/build/build/dependencies/doTheWorld/path/setters.c deleted file mode 100644 index d42bdb6..0000000 --- a/build/build/dependencies/doTheWorld/path/setters.c +++ /dev/null @@ -1,107 +0,0 @@ - - -void DtwPath_set_extension(struct DtwPath *self, const char *extension){ - - const char *dir = DtwPath_get_dir(self); - if(!dir){ - dir = ""; - } - const char *name = DtwPath_get_name(self); - if(!name){ - name = ""; - } - free(self->path); - char *formated_extension = dtw_replace_string(extension,".",""); - self->path= private_dtw_formatt("%s%s.%s",dir,name,formated_extension); - free(formated_extension); -} - - -void DtwPath_set_name(struct DtwPath * self, const char * name){ - const char *dir = DtwPath_get_dir(self); - if(!dir){ - dir = ""; - } - char *extension = DtwPath_get_extension(self); - free(self->path); - - if(extension){ - self->path = private_dtw_formatt("%s%s.%s",dir,name,extension); - } - if(!extension){ - self->path = private_dtw_formatt("%s%s",dir,name); - } -} - - - -void DtwPath_set_full_name(struct DtwPath * self, const char * full_name){ - const char *dir = DtwPath_get_dir(self); - if(!dir){ - dir = ""; - } - free(self->path); - self->path = private_dtw_formatt("%s%s",dir,full_name); - -} - - -void DtwPath_set_dir(struct DtwPath *self, const char *dir){ - const char * full_name = DtwPath_get_full_name(self); - if(!full_name){ - full_name = ""; - } - free(self->path); - char *buffer = private_dtw_formatt("%s/%s",dir,full_name); - self->path = private_dtw_format_path(buffer); - free(buffer); - -} - - -void DtwPath_set_path(struct DtwPath *self, const char *target_path) { - free(self->path); - self->path = private_dtw_format_path(target_path); -} - - -void DtwPath_add_start_dir(struct DtwPath *self, const char *start_dir){ - char *element = dtw_concat_path(start_dir,self->path); - free(self->path); - self->path = private_dtw_format_path(element); - free(element); -} - -void DtwPath_add_end_dir(struct DtwPath *self, const char *end_dir){ - const char *dir = DtwPath_get_dir(self); - if(!dir){ - dir = ""; - } - const char * full_name = DtwPath_get_full_name(self); - if(!full_name){ - full_name = ""; - } - free(self->path); - - char *buffer = private_dtw_formatt("%s/%s/%s",dir,end_dir,full_name); - self->path = private_dtw_format_path(buffer); - free(buffer); -} - -void DtwPath_replace_dirs(DtwPath *self,const char *str,const char *dir){ - char *self_dir = DtwPath_get_dir(self); - - char *formatted_entry = NULL; - if(dtw_starts_with(self_dir,str)){ - formatted_entry = private_dtw_formatt("%s/",dir); - } - else{ - formatted_entry = private_dtw_formatt("/%s/",dir); - - } - char * formated_dir = dtw_replace_string(self_dir,str,formatted_entry); - DtwPath_set_dir(self,formated_dir); - free(formated_dir); - free(formatted_entry); - -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/randonizer/randonizer.c b/build/build/dependencies/doTheWorld/randonizer/randonizer.c deleted file mode 100644 index 694f57d..0000000 --- a/build/build/dependencies/doTheWorld/randonizer/randonizer.c +++ /dev/null @@ -1,36 +0,0 @@ - - - - -DtwRandonizer * newDtwRandonizer(){ - DtwRandonizer *self = (DtwRandonizer*) malloc(sizeof (DtwRandonizer)); - *self =(DtwRandonizer){0}; - self->time_seed = dtw_get_time(); - return self; -} - -char * DtwRandonizer_generate_token(struct DtwRandonizer*self, int size){ - self->actual_generation+=1; - static const char chars[] = - "abcdefghijklmnopqrstuvwxyz" - "ABCDEFGHIJKLMNOPQRSTUVWXYZ" - "0123456789"; - - int total_size = sizeof(chars) - 1; - char *token = (char*)malloc(size +1); - - srand( self->time_seed + self->actual_generation + self->seed); - - for (int i = 0; i < size; ++i) { - int index = rand() % total_size; - token[i] = chars[index]; - } - - token[size] = '\0'; - return token; -} - -void DtwRandonizer_free(struct DtwRandonizer *self){ - free(self); -} - diff --git a/build/build/dependencies/doTheWorld/randonizer/randonizer.h b/build/build/dependencies/doTheWorld/randonizer/randonizer.h deleted file mode 100644 index 204b6d0..0000000 --- a/build/build/dependencies/doTheWorld/randonizer/randonizer.h +++ /dev/null @@ -1,16 +0,0 @@ - - - -typedef struct DtwRandonizer{ - long time_seed; - long seed; - long actual_generation; - -}DtwRandonizer; - - -DtwRandonizer * newDtwRandonizer(); -char * DtwRandonizer_generate_token(struct DtwRandonizer*self, int size); -void DtwRandonizer_free(struct DtwRandonizer *self); - - diff --git a/build/build/dependencies/doTheWorld/resource/declaration.h b/build/build/dependencies/doTheWorld/resource/declaration.h deleted file mode 100644 index edf9836..0000000 --- a/build/build/dependencies/doTheWorld/resource/declaration.h +++ /dev/null @@ -1,4 +0,0 @@ -#include "root_props/root_props.h" -#include "schema/schema.h" -#include "resource/declaration.h" -#include "resource_array/resource_array.h" diff --git a/build/build/dependencies/doTheWorld/resource/definition.h b/build/build/dependencies/doTheWorld/resource/definition.h deleted file mode 100644 index 7f0af67..0000000 --- a/build/build/dependencies/doTheWorld/resource/definition.h +++ /dev/null @@ -1,4 +0,0 @@ -#include "schema/schema.c" -#include "root_props/root_props.c" -#include "resource/definition.h" -#include "resource_array/resource_array.c" \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/resource/resource/constructors_and_desctructors/constructors_and_destructors.c b/build/build/dependencies/doTheWorld/resource/resource/constructors_and_desctructors/constructors_and_destructors.c deleted file mode 100644 index bb97eb7..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/constructors_and_desctructors/constructors_and_destructors.c +++ /dev/null @@ -1,188 +0,0 @@ - - -DtwResource *new_DtwResource(const char *path){ - DtwResource *self = (DtwResource*) malloc(sizeof (DtwResource)); - *self =(DtwResource){0}; - - self->path = strdup(path); - self->name = strdup(path); - self->sub_resources = newDtwResourceArray(); - self->allow_transaction = true; - self->use_locker_on_unique_values = true; - self->cache_sub_resources = true; - self->root_props = private_newDtwResourceRootProps(); - - return self; -} - -DtwResource * DtwResource_sub_resource(DtwResource *self,const char *format, ...){ - if(DtwResource_error(self)){ - return NULL; - } - - - privateDtwResource_ensure_its_possible_to_sub_resource(self); - - if(DtwResource_error(self)){ - return NULL; - } - - - if(self->were_renamed){ - private_DtwResource_raise_error( - self, - DTW_RESOURCE_RENAMED_RESOURCE_CANNOT_HAVE_SONS, - "you cannot create a sub resurce from a renamed resource", - self->name - ); - return NULL; - } - - - va_list args; - va_start(args, format); - char *name = private_dtw_format_vaarg(format,args); - va_end(args); - - - DtwResource * Already_Exist = DtwResourceArray_get_by_name((DtwResourceArray*)self->sub_resources,name); - if(Already_Exist){ - free(name); - return Already_Exist; - } - - DtwResource *new_element = (DtwResource*) malloc(sizeof (DtwResource)); - *new_element =(DtwResource){0}; - - if(self->schema_type == PRIVATE_DTW_SCHEMA_VALUE){ - new_element->schema_type = PRIVATE_DTW_SCHEMA_ELEMENT; - } - if(self->schema_type ==PRIVATE_DTW_SCHEMA_ELEMENT){ - new_element->schema_type = PRIVATE_DTW_SCHEMA_ELEMENT_PROP; - } - - if(self->schema_type == PRIVATE_DTW_SCHEMA_INDEX){ - new_element->schema_type = PRIVATE_DTW_SCHEMA_PK_FOLDER; - } - if(self->schema_type == PRIVATE_DTW_SCHEMA_PK_FOLDER){ - new_element->schema_type = PRIVATE_DTW_SCHEMA_PK_VALUE; - } - - - - new_element->allow_transaction = self->allow_transaction; - new_element->use_locker_on_unique_values = self->use_locker_on_unique_values; - new_element->root_props = self->root_props; - //copied elements - - new_element->mother = self; - new_element->path = dtw_concat_path(self->path, name); - new_element->name = strdup(name); - - - new_element->cache_sub_resources = self->cache_sub_resources; - new_element->sub_resources = newDtwResourceArray(); - - if(self->attached_schema && self->root_props->is_writing_schema == false){ - new_element->attached_schema = privateDtwSchema_get_sub_schema(self->attached_schema, name); - } - - if(self->schema_type == PRIVATE_DTW_SCHEMA_ELEMENT){ - DtwResource * ancestor = self->mother->mother; - new_element->attached_schema = privateDtwSchema_get_sub_schema(ancestor->attached_schema, name); - } - - - - if(new_element->attached_schema){ - self->root_props->is_writing_schema = true; - new_element->schema_type = PRIVATE_DTW_SCHEMA_ROOT; - new_element->values_resource = DtwResource_sub_resource(new_element,DTW_SCHEMA_DEFAULT_VALUES_NAME); - new_element->values_resource->schema_type = PRIVATE_DTW_SCHEMA_VALUE; - new_element->index_resource = DtwResource_sub_resource(new_element,DTW_SCHEMA_DEFAULT_INDEX_NAME); - new_element->index_resource->schema_type = PRIVATE_DTW_SCHEMA_INDEX; - } - - - - if(self->cache_sub_resources){ - DtwResourceArray_append((DtwResourceArray*)self->sub_resources,new_element); - } - - - free(name); - return new_element; - -} -DtwResource * DtwResource_sub_resource_ensuring_not_exist(DtwResource *self,const char *format, ...){ - if(DtwResource_error(self)){ - return NULL; - } - va_list args; - va_start(args, format); - char *name = private_dtw_format_vaarg(format,args); - va_end(args); -; - - DtwResource *possible_emptiy = DtwResourceArray_get_by_name( - (DtwResourceArray*)self->sub_resources, - name - ); - if(possible_emptiy){ - return NULL; - } - - bool old_cache_value = self->cache_sub_resources; - self->cache_sub_resources = false; - possible_emptiy = DtwResource_sub_resource(self,"%s",name); - possible_emptiy->cache_sub_resources = old_cache_value; - self->cache_sub_resources = old_cache_value; - if(self->use_locker_on_unique_values){ - DtwResource_lock(possible_emptiy); - } - - int type = DtwResource_type(possible_emptiy); - - if(type == DTW_NOT_FOUND){ - - - if(self->cache_sub_resources){ - DtwResourceArray_append((DtwResourceArray*)self->sub_resources,possible_emptiy); - } - free(name); - return possible_emptiy; - } - DtwResource_unlock(possible_emptiy); - DtwResource_free(possible_emptiy); - free(name); - return NULL; - -} - -void DtwResource_free(DtwResource *self){ - if(!self){ - return; - } - - bool is_root = self->mother == NULL; - if(is_root){ - privateDtwResourceRootProps_free(self->root_props); - } - - if(self->its_the_schema_owner){ - private_newDtwSchema_free(self->attached_schema); - } - - DtwResourceArray_free((DtwResourceArray*)self->sub_resources); - - - - if(self->value_any){ - free(self->value_any); - } - - - free(self->path); - free(self->name); - free(self); -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/resource/resource/constructors_and_desctructors/constructors_and_destructors.h b/build/build/dependencies/doTheWorld/resource/resource/constructors_and_desctructors/constructors_and_destructors.h deleted file mode 100644 index 986194c..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/constructors_and_desctructors/constructors_and_destructors.h +++ /dev/null @@ -1,9 +0,0 @@ - - -DtwResource *new_DtwResource(const char *path); - -DtwResource * DtwResource_sub_resource(DtwResource *self,const char *format, ...); - -DtwResource * DtwResource_sub_resource_ensuring_not_exist(DtwResource *self,const char *format, ...); - -void DtwResource_free(DtwResource *self); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/resource/resource/custom_constructors/custom_constructors.c b/build/build/dependencies/doTheWorld/resource/resource/custom_constructors/custom_constructors.c deleted file mode 100644 index f70acef..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/custom_constructors/custom_constructors.c +++ /dev/null @@ -1,147 +0,0 @@ - - -DtwResource * DtwResource_sub_resource_next(DtwResource *self, const char *end_path){ - if(DtwResource_error(self)){ - return NULL; - } - long size = dtw_get_total_itens_of_dir(self->path); - if(size < 0){ - size = 0; - } - while(true){ - - char *path = NULL; - if(end_path){ - path = private_dtw_realoc_formatting(path,"%ld%s",size,end_path); - } - - else{ - path = private_dtw_realoc_formatting(path,"%ld",size); - } - - DtwResource *new_element = DtwResource_sub_resource_ensuring_not_exist(self,"%s",path); - free(path); - if(DtwResource_error(self)){ - return NULL; - } - - if(new_element){ - return new_element; - } - size = size+1; - } -} - - -DtwResource * DtwResource_sub_resource_now(DtwResource *self, const char *end_path){ - if(DtwResource_error(self)){ - return NULL; - } - bool empty_already_exist = false; - - - while(true){ - - long now = dtw_get_time(); - char *time = dtw_convert_unix_time_to_string(now); - char *path = NULL; - - if(empty_already_exist){ - char *token = DtwRandonizer_generate_token(self->root_props->randonizer,10); - path = private_dtw_realoc_formatting(path,"%s--%s",time,token); - free(token); - } - else{ - path = private_dtw_realoc_formatting(path,"%s",time); - } - - free(time); - - if(end_path){ - path = private_dtw_realoc_formatting(path,"%s%s",path,end_path); - } - - DtwResource *new_element = DtwResource_sub_resource_ensuring_not_exist(self,"%s",path); - - free(path); - - - if(DtwResource_error(self)){ - return NULL; - } - if(new_element){ - return new_element; - } - empty_already_exist = true; - } -} - - -DtwResource * DtwResource_sub_resource_now_in_unix(DtwResource *self, const char *end_path){ - if(DtwResource_error(self)){ - return NULL; - } - bool empty_already_exist = false; - - while(true){ - - long now = dtw_get_time(); - char *path = NULL; - - if(empty_already_exist){ - char *token = DtwRandonizer_generate_token(self->root_props->randonizer,10); - path = private_dtw_realoc_formatting(path,"%ld--%s",now,token); - free(token); - } - else{ - path = private_dtw_realoc_formatting(path,"%ld",now); - } - - if(end_path){ - path = private_dtw_realoc_formatting(path,"%s%s",path,end_path); - } - - DtwResource *new_element = DtwResource_sub_resource_ensuring_not_exist(self,"%s",path); - - free(path); - - - if(DtwResource_error(self)){ - return NULL; - } - if(new_element){ - return new_element; - } - empty_already_exist = true; - } -} - -DtwResource * DtwResource_sub_resource_random(DtwResource *self, const char *end_path){ - if(DtwResource_error(self)){ - return NULL; - } - while(true){ - - char *path = NULL; - char *token = DtwRandonizer_generate_token(self->root_props->randonizer,15); - path = private_dtw_realoc_formatting(path,"%s",token); - free(token); - - if(end_path){ - path = private_dtw_realoc_formatting(path,"%s%s",path,end_path); - } - - DtwResource *new_element = DtwResource_sub_resource_ensuring_not_exist(self,"%s",path); - free(path); - if(DtwResource_error(self)){ - return NULL; - } - - if(new_element){ - return new_element; - } - - } -} - - diff --git a/build/build/dependencies/doTheWorld/resource/resource/custom_constructors/custom_constructors.h b/build/build/dependencies/doTheWorld/resource/resource/custom_constructors/custom_constructors.h deleted file mode 100644 index b8e840f..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/custom_constructors/custom_constructors.h +++ /dev/null @@ -1,13 +0,0 @@ - - -DtwResource * DtwResource_sub_resource_next(DtwResource *self, const char *end_path); - - -DtwResource * DtwResource_sub_resource_now(DtwResource *self, const char *end_path); - -DtwResource * DtwResource_sub_resource_now_in_unix(DtwResource *self, const char *end_path); - -DtwResource * DtwResource_sub_resource_random(DtwResource *self, const char *end_path); - - - diff --git a/build/build/dependencies/doTheWorld/resource/resource/declaration.h b/build/build/dependencies/doTheWorld/resource/resource/declaration.h deleted file mode 100644 index 26fc505..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/declaration.h +++ /dev/null @@ -1,10 +0,0 @@ -#include "resource.h" -#include "constructors_and_desctructors/constructors_and_destructors.h" -#include "custom_constructors/custom_constructors.h" -#include "destroy/destroy.h" -#include "extras/extras.h" -#include "getters/getters.h" -#include "loaders_and_unloaders/loaders_and_unloaders.h" -#include "schema/schema.h" -#include "setters/setters.h" -#include "sub_resource_setters/sub_resource_setters.h" diff --git a/build/build/dependencies/doTheWorld/resource/resource/definition.h b/build/build/dependencies/doTheWorld/resource/resource/definition.h deleted file mode 100644 index a9b3b0d..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/definition.h +++ /dev/null @@ -1,9 +0,0 @@ -#include "constructors_and_desctructors/constructors_and_destructors.c" -#include "custom_constructors/custom_constructors.c" -#include "destroy/destroy.c" -#include "extras/extras.c" -#include "getters/getters.c" -#include "loaders_and_unloaders/loaders_and_unloaders.c" -#include "schema/schema.c" -#include "setters/setters.c" -#include "sub_resource_setters/sub_resource_setters.c" diff --git a/build/build/dependencies/doTheWorld/resource/resource/destroy/destroy.c b/build/build/dependencies/doTheWorld/resource/resource/destroy/destroy.c deleted file mode 100644 index 029e9ba..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/destroy/destroy.c +++ /dev/null @@ -1,103 +0,0 @@ - -void private_DtwResurce_destroy_primary_key(DtwResource *self) { - - - if (!DtwResource_is_file(self)) { - return; - } - - DtwResource *root = self->mother->mother->mother; - DtwResource *pk_index_folder = DtwResource_sub_resource(root->index_resource, "%s", self->name); - long size; - bool is_binary; - unsigned char *possible_pk_value = DtwResource_get_any(self, &size, &is_binary); - char *pk_sha = dtw_generate_sha_from_any(possible_pk_value, size); - - DtwResource *pk_index_value = DtwResource_sub_resource(pk_index_folder, "%s", pk_sha); - - if(DtwResource_error(self)){ - return; - } - - free(pk_sha); - if (self->allow_transaction) { - DtwTransaction_delete_any(self->root_props->transaction, pk_index_value->path); - } else { - dtw_remove_any(pk_index_value->path); - } - - -} -void private_DtwResource_destroy_all_primary_keys(DtwResource *self){ - DtwSchema * schema = (DtwSchema*)self->mother->mother->attached_schema; - for(int i = 0; i < schema->primary_keys->size; i++){ - char *current_pk = schema->primary_keys->strings[i]; - DtwResource *son = DtwResource_sub_resource(self,"%s",current_pk); - private_DtwResurce_destroy_primary_key(son); - - if(DtwResource_error(self)){ - return; - } - - } -} -void DtwResource_destroy(DtwResource *self){ - if(DtwResource_error(self)){ - return; - } - - - if(self->schema_type == PRIVATE_DTW_SCHEMA_ELEMENT){ - self->root_props->is_writing_schema = true; - private_DtwResource_destroy_all_primary_keys(self); - self->root_props->is_writing_schema =false; - } - - if(private_DtwResource_its_a_pk(self)){ - self->root_props->is_writing_schema = true; - private_DtwResurce_destroy_primary_key(self); - self->root_props->is_writing_schema =false; - - } - - if(DtwResource_error(self)){ - return; - } - - if(self->root_props->is_writing_schema == false){ - if( - self->schema_type == PRIVATE_DTW_SCHEMA_VALUE - || self->schema_type == PRIVATE_DTW_SCHEMA_INDEX - || self->schema_type == PRIVATE_DTW_SCHEMA_PK_FOLDER - || self->schema_type == PRIVATE_DTW_SCHEMA_PK_VALUE - ){ - private_DtwResource_raise_error( - self, - DTW_RESOURCE_ONLY_ROOT_SCHEMA_CANN_MODIFY_SCHEMA_PROPS, - "you cannot delete a internal schema part" - ); - } - } - - if(DtwResource_error(self)){ - return; - } - - - if(self->allow_transaction){ - DtwTransaction_delete_any(self->root_props->transaction,self->path); - } - else{ - dtw_remove_any(self->path); - } - -} - -void DtwResource_destroy_sub_resource(DtwResource *self, const char *key){ - if(DtwResource_error(self)){ - return; - } - DtwResource *son = DtwResource_sub_resource(self, "%s",key); - DtwResource_destroy(son); -} - diff --git a/build/build/dependencies/doTheWorld/resource/resource/destroy/destroy.h b/build/build/dependencies/doTheWorld/resource/resource/destroy/destroy.h deleted file mode 100644 index 44e7bd0..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/destroy/destroy.h +++ /dev/null @@ -1,11 +0,0 @@ - -void private_DtwResurce_destroy_primary_key(DtwResource *self); - - -void private_DtwResource_destroy_all_primary_keys(DtwResource *self); - -void DtwResource_destroy(DtwResource *self); - - -void DtwResource_destroy_sub_resource(DtwResource *self, const char *key); - diff --git a/build/build/dependencies/doTheWorld/resource/resource/extras/extras.c b/build/build/dependencies/doTheWorld/resource/resource/extras/extras.c deleted file mode 100644 index d2c1342..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/extras/extras.c +++ /dev/null @@ -1,261 +0,0 @@ - - - -bool DtwResource_error(DtwResource *self){ - if(self==NULL){ - return true; - } - if(DtwResource_get_error_code(self) == DTW_RESOURCE_OK){ - return false; - } - return true; -} - - - -int DtwResource_get_error_code(DtwResource *self){ - if(!self){ - return DTW_RESOURCE_ELEMENT_IS_NULL; - } - return self->root_props->error_code; -} -char * DtwResource_get_error_path(DtwResource *self){ - if(!self){ - return NULL; - } - if(!self->root_props){ - return NULL; - } - return self->root_props->error_path; -} - - -char * DtwResource_get_error_message(DtwResource *self){ - - if(!self){ - return (char*)"element its null"; - } - - return self->root_props->error_message; -} -void DtwResource_clear_errors(DtwResource *self){ - if(!DtwResource_error(self)){ - return; - } - free(self->root_props->error_message); - self->root_props->error_message = NULL; - free(self->root_props->error_path); - self->root_props->error_path = NULL; - self->root_props->error_code = DTW_RESOURCE_OK; - -} - - -void private_DtwResource_raise_error(DtwResource *self, int error_code, const char *format,...){ - - va_list args; - va_start(args, format); - char *error_message = private_dtw_format_vaarg(format,args); - va_end(args); - - self->root_props->error_code = error_code; - self->root_props->error_path = strdup(self->path); - self->root_props->error_message = dtw_replace_string(error_message,"#path#",self->path); - free(error_message); -} - -void DtwResource_rename(DtwResource *self,const char *new_name){ - if(DtwResource_error(self)){ - return; - } - if(private_DtwResource_its_a_pk(self)){ - private_DtwResource_raise_error( - self, - DTW_IMPOSSIBLE_TO_RENAME_A_PRIMARY_KEY, - "primary key %s cannot be renamed", - self->name - ); - return; - } - DtwResourceArray *sons =(DtwResourceArray*)self->sub_resources; - if(sons->size > 0){ - private_DtwResource_raise_error( - self, - DTW_RESOURCE_RENAMED_RESOURCE_CANNOT_HAVE_SONS, - "you cannot rename a resource with active sons", - self->name - ); - return; - } - - self->were_renamed = true; - char *old_path = strdup(self->path); - free(self->path); - free(self->name); - - if(self->mother){ - self->path = dtw_concat_path(self->mother->path, new_name); - } - if(!self->mother){ - self->path = strdup(new_name); - } - - self->name = strdup(new_name); - - if(self->allow_transaction){ - DtwTransaction_move_any(self->root_props->transaction,old_path,self->path); - } - else{ - dtw_move_any(old_path,self->path,DTW_NOT_MERGE); - } - - free(old_path); - -} - -void DtwResource_rename_sub_resource(DtwResource *self,const char *old_name,const char *new_name){ - if(DtwResource_error(self)){ - return; - } - DtwResource *created = DtwResource_sub_resource(self,"name"); - DtwResource_rename(created,new_name); -} - -int DtwResource_lock(DtwResource *self){ - if(DtwResource_error(self)){ - return -1; - } - return DtwLocker_lock(self->root_props->locker, self->path); -} - -void DtwResource_unlock(DtwResource *self){ - if(DtwResource_error(self)){ - return ; - } - DtwLocker_unlock(self->root_props->locker, self->path); - -} - - - -void DtwResource_commit(DtwResource *self){ - if(DtwResource_error(self)){ - return ; - } - DtwTransaction_commit(self->root_props->transaction,NULL); -} - -long DtwResource_size(DtwResource *self){ - if(DtwResource_error(self)){ - return -1; - } - return dtw_get_total_itens_of_dir(self->path); -} - - - -DtwStringArray *DtwResource_list_names(DtwResource *self){ - if(DtwResource_error(self)){ - return NULL; - } - return dtw_list_all(self->path,DTW_NOT_CONCAT_PATH); -} - -int DtwResource_type(DtwResource *self){ - if(DtwResource_error(self)){ - return -1; - } - DtwResource_load_if_not_loaded(self); - - if(!self->value_any){ - return dtw_entity_type(self->path); - } - - - if(self->is_binary){ - return DTW_COMPLEX_BINARY; - } - char *data_in_string = DtwResource_get_string(self); - - if( - strcmp(data_in_string,"t") == 0 || strcmp(data_in_string,"true") == 0 || - strcmp(data_in_string,"f") == 0 || strcmp(data_in_string,"false") == 0 - - ){ - return DTW_COMPLEX_BOOL_TYPE; - } - - - double data_double; - int result = sscanf(data_in_string,"%lf",&data_double); - if(result == 0){ - return DTW_COMPLEX_STRING_TYPE; - - } - - - for(int i = 0; i < self->value_size; i++){ - char current = data_in_string[i]; - if(current == '.'){ - return DTW_COMPLEX_DOUBLE_TYPE; - } - } - return DTW_COMPLEX_LONG_TYPE; - -} -bool DtwResource_is_file(DtwResource *self){ - if(DtwResource_error(self)){ - return -1; - } - DtwResource_load_if_not_loaded(self); - - if(self->value_any){ - return true; - } - return false; - -} - -const char * DtwResource_type_in_str(DtwResource *self){ - if(DtwResource_error(self)){ - return NULL; - } - return dtw_convert_entity(DtwResource_type(self)); -} - -void DtwResource_represent(DtwResource *self){ - if(DtwResource_error(self)){ - return; - } - - if(DtwResource_error(self)){ - printf("error code: %d\n", DtwResource_get_error_code(self)); - printf("error message: %s\n", DtwResource_get_error_message(self)); - return ; - } - - printf("path: %s\n", self->path); - printf("name: %s\n",self->name); - if(self->loaded){ - printf("type: %s\n",DtwResource_type_in_str(self)); - int type = DtwResource_type(self); - if(type == DTW_COMPLEX_STRING_TYPE){ - printf("value: %s\n", DtwResource_get_string(self)); - } - if(type == DTW_COMPLEX_LONG_TYPE){ - printf("value: %ld\n", DtwResource_get_long(self)); - } - - if(type == DTW_COMPLEX_DOUBLE_TYPE){ - printf("value: %lf\n", DtwResource_get_double(self)); - } - - if(type == DTW_COMPLEX_BOOL_TYPE){ - printf("value: %s\n",DtwResource_get_bool(self) ?"true": "false"); - } - - } - - -} - diff --git a/build/build/dependencies/doTheWorld/resource/resource/extras/extras.h b/build/build/dependencies/doTheWorld/resource/resource/extras/extras.h deleted file mode 100644 index 13182a7..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/extras/extras.h +++ /dev/null @@ -1,42 +0,0 @@ - - - -bool DtwResource_error(DtwResource *self); - -int DtwResource_get_error_code(DtwResource *self); - - -char * DtwResource_get_error_message(DtwResource *self); - -char * DtwResource_get_error_path(DtwResource *self); - -void DtwResource_clear_errors(DtwResource *self); - - -void private_DtwResource_raise_error(DtwResource *self, int error_code, const char *format,...); - -void DtwResource_rename(DtwResource *self,const char *new_name); - -void DtwResource_rename_sub_resource(DtwResource *self,const char *old_name,const char *new_name); - -int DtwResource_lock(DtwResource *self); - -void DtwResource_unlock(DtwResource *self); - - -void DtwResource_commit(DtwResource *self); - -long DtwResource_size(DtwResource *self); - - - -DtwStringArray *DtwResource_list_names(DtwResource *self); - -int DtwResource_type(DtwResource *self); - -bool DtwResource_is_file(DtwResource *self); - - -const char * DtwResource_type_in_str(DtwResource *self); - -void DtwResource_represent(DtwResource *self); diff --git a/build/build/dependencies/doTheWorld/resource/resource/getters/getters.c b/build/build/dependencies/doTheWorld/resource/resource/getters/getters.c deleted file mode 100644 index 53d9adc..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/getters/getters.c +++ /dev/null @@ -1,223 +0,0 @@ - -unsigned char *DtwResource_get_any(DtwResource *self, long *size, bool *is_binary){ - if(DtwResource_error(self)){ - return NULL; - } - DtwResource_load_if_not_loaded(self); - *size = self->value_size; - *is_binary = self->is_binary; - - if(!self->value_any){ - private_DtwResource_raise_error( - self, - DTW_RESOURCE_ELEMENT_NOT_EXIST, - "element at #path# not exist" - ); - return NULL; - } - - return self->value_any; - - -} - -unsigned char *DtwResource_get_any_from_sub_resource(DtwResource *self, long *size, bool *is_binary,const char *format,...){ - if(DtwResource_error(self)){ - return NULL; - } - va_list args; - va_start(args, format); - char *name = private_dtw_format_vaarg(format,args); - va_end(args); - - DtwResource *element = DtwResource_sub_resource(self,"%s",name); - free(name); - return DtwResource_get_any(element,size,is_binary); - -} - -unsigned char *DtwResource_get_binary(DtwResource *self, long *size){ - if(DtwResource_error(self)){ - return NULL; - } - bool is_binary; - - return DtwResource_get_any(self,size,&is_binary); -} - -unsigned char *DtwResource_get_binary_from_sub_resource(DtwResource *self, long *size,const char *format,...){ - if(DtwResource_error(self)){ - return NULL; - } - - va_list args; - va_start(args, format); - char *name = private_dtw_format_vaarg(format,args); - va_end(args); - - DtwResource *element = DtwResource_sub_resource(self,"%s",name); - free(name); - return DtwResource_get_binary(element,size); -} - - -char *DtwResource_get_string(DtwResource *self){ - if(DtwResource_error(self)){ - return NULL; - } - - long size; - bool is_binary; - char *result = (char *)DtwResource_get_any(self,&size,&is_binary); - - if(is_binary){ - private_DtwResource_raise_error( - self, - DTW_RESOURCE_ELEMENT_NOT_STRING, - "element at #path# its an binary" - ); - return NULL; - } - - return result; -} - - -char *DtwResource_get_string_from_sub_resource(DtwResource *self,const char *format,...){ - if(DtwResource_error(self)){ - return NULL; - } - - va_list args; - va_start(args, format); - char *name = private_dtw_format_vaarg(format,args); - va_end(args); - - - DtwResource *element = DtwResource_sub_resource(self,"%s",name); - free(name); - return DtwResource_get_string(element); -} - - -long DtwResource_get_long(DtwResource *self){ - - if(DtwResource_error(self)){ - return -1; - } - - char *element = DtwResource_get_string(self); - - if(DtwResource_error(self)){ - return -1; - } - - long value; - int result = sscanf(element,"%ld",&value); - if(result == 0){ - private_DtwResource_raise_error( - self, - DTW_RESOURCE_ELEMENT_NOT_LONG, - "element at #path# its not long" - ); - return -1; - } - return value; -} - - -long DtwResource_get_long_from_sub_resource(DtwResource *self,const char *format,...){ - if(DtwResource_error(self)){ - return -1; - } - va_list args; - va_start(args, format); - char *name = private_dtw_format_vaarg(format,args); - va_end(args); - - - DtwResource *element = DtwResource_sub_resource(self,"%s",name); - free(name); - return DtwResource_get_long(element); -} - - -double DtwResource_get_double(DtwResource *self){ - if(DtwResource_error(self)){ - return -1; - } - - char *element = DtwResource_get_string(self); - if(DtwResource_error(self)){ - return -1; - } - - double value; - int result = sscanf(element,"%lf",&value); - if(result == 0){ - private_DtwResource_raise_error( - self, - DTW_RESOURCE_ELEMENT_NOT_DOUBLE, - "element at #path# its not long" - ); - return-1; - } - return value; -} - -double DtwResource_get_double_from_sub_resource(DtwResource *self,const char *format,...){ - - if(DtwResource_error(self)){ - return -1; - } - - va_list args; - va_start(args, format); - char *name = private_dtw_format_vaarg(format,args); - va_end(args); - - - DtwResource *element = DtwResource_sub_resource(self,"%s",name); - free(name); - return DtwResource_get_double(element); -} - - -bool DtwResource_get_bool(DtwResource *self){ - if(DtwResource_error(self)){ - return false; - } - char *element = DtwResource_get_string(self); - if(DtwResource_error(self)){ - return false; - } - - if(strcmp(element,"true") == 0 || strcmp(element,"t") == 0){ - return true; - } - if(strcmp(element,"false") == 0 || strcmp(element,"f") == 0){ - return false; - } - - private_DtwResource_raise_error( - self, - DTW_RESOURCE_ELEMENT_NOT_BOOL, - "element at #path# its not bool" - ); - return false; -} - -bool DtwResource_get_bool_from_sub_resource(DtwResource *self,const char *format,...){ - if(DtwResource_error(self)){ - return false; - } - - va_list args; - va_start(args, format); - char *name = private_dtw_format_vaarg(format,args); - va_end(args); - - DtwResource *element = DtwResource_sub_resource(self,"%s",name); - free(name); - return DtwResource_get_bool(element); -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/resource/resource/getters/getters.h b/build/build/dependencies/doTheWorld/resource/resource/getters/getters.h deleted file mode 100644 index 807d92c..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/getters/getters.h +++ /dev/null @@ -1,29 +0,0 @@ - -unsigned char *DtwResource_get_any(DtwResource *self, long *size, bool *is_binary); - - -unsigned char *DtwResource_get_any_from_sub_resource(DtwResource *self, long *size, bool *is_binary,const char *format,...); - -unsigned char *DtwResource_get_binary(DtwResource *self, long *size); - -unsigned char *DtwResource_get_binary_from_sub_resource(DtwResource *self, long *size,const char *format,...); - -char *DtwResource_get_string(DtwResource *self); - -char *DtwResource_get_string_from_sub_resource(DtwResource *self,const char *format,...); - - -long DtwResource_get_long(DtwResource *self); - - - -long DtwResource_get_long_from_sub_resource(DtwResource *self,const char *format,...); - - -double DtwResource_get_double(DtwResource *self); - -double DtwResource_get_double_from_sub_resource(DtwResource *self,const char *format,...); - -bool DtwResource_get_bool(DtwResource *self); - -bool DtwResource_get_bool_from_sub_resource(DtwResource *self,const char *format,...); diff --git a/build/build/dependencies/doTheWorld/resource/resource/loaders_and_unloaders/loaders_and_unloaders.c b/build/build/dependencies/doTheWorld/resource/resource/loaders_and_unloaders/loaders_and_unloaders.c deleted file mode 100644 index be42e6f..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/loaders_and_unloaders/loaders_and_unloaders.c +++ /dev/null @@ -1,40 +0,0 @@ - - -void DtwResource_unload(DtwResource *self){ - if(DtwResource_error(self)){ - return ; - } - if(self->loaded == false){ - return; - } - if(self->value_any){ - free(self->value_any); - } - - self->value_any = NULL; - self->is_binary = false; - self->value_size = 0; -} - -void DtwResource_load(DtwResource *self){ - if(DtwResource_error(self)){ - return ; - } - DtwResource_unload(self); - self->value_any = dtw_load_any_content(self->path,&self->value_size,&self->is_binary); - //means its a empty string - if(dtw_entity_type(self->path) == DTW_FILE_TYPE && self->value_size ==0 ){ - self->value_any = (unsigned char*)strdup(""); - } - self->loaded = true; - -} -void DtwResource_load_if_not_loaded(DtwResource *self){ - if(DtwResource_error(self)){ - return ; - } - if(self->loaded == false){ - DtwResource_load(self); - } -} - diff --git a/build/build/dependencies/doTheWorld/resource/resource/loaders_and_unloaders/loaders_and_unloaders.h b/build/build/dependencies/doTheWorld/resource/resource/loaders_and_unloaders/loaders_and_unloaders.h deleted file mode 100644 index bd39dc0..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/loaders_and_unloaders/loaders_and_unloaders.h +++ /dev/null @@ -1,9 +0,0 @@ - - -void DtwResource_unload(DtwResource *self); - - -void DtwResource_load(DtwResource *self); - -void DtwResource_load_if_not_loaded(DtwResource *self); - diff --git a/build/build/dependencies/doTheWorld/resource/resource/resource.h b/build/build/dependencies/doTheWorld/resource/resource/resource.h deleted file mode 100644 index cf301a0..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/resource.h +++ /dev/null @@ -1,44 +0,0 @@ - - -typedef struct DtwResource{ - - bool allow_transaction; - bool use_locker_on_unique_values; - - - privateDtwResourceRootProps *root_props; - struct DtwResource *mother; - char *name; - char *path; - - - - - //in the schema struct there is: - //|/root - //|/root/values - //|root/values/element <-----------------------------| - //|root/values/element/pk_name ->any(write_point) | - //|root/values/element/element_prop ->any(write_point)| - //|root/index | - //|root/index/pk_name/pk_sha ->txt ------------------- - DtwSchema *attached_schema; - struct DtwResource *values_resource; - struct DtwResource *index_resource; - bool its_the_schema_owner; - int schema_type; - - bool loaded; - bool is_binary; - bool were_renamed; - unsigned char *value_any; - long value_size; - - //cache implementation - bool cache_sub_resources; - void *sub_resources; - -}DtwResource; - - - diff --git a/build/build/dependencies/doTheWorld/resource/resource/schema/schema.c b/build/build/dependencies/doTheWorld/resource/resource/schema/schema.c deleted file mode 100644 index c0ab609..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/schema/schema.c +++ /dev/null @@ -1,234 +0,0 @@ - -bool private_DtwResource_its_a_pk(DtwResource *self){ - if(self->schema_type != PRIVATE_DTW_SCHEMA_ELEMENT_PROP){ - return false; - } - DtwResource *ancestor = self->mother->mother->mother; - DtwSchema * schema = ancestor->attached_schema; - return DtwStringArray_find_position(schema->primary_keys,self->name) !=-1; -} - -void privateDtwResource_ensure_its_possible_to_sub_resource(DtwResource *self){ - - if(self->root_props->is_writing_schema){ - return; - } - - if(self->schema_type == 0){ - - return; - } - - - if(self->schema_type != PRIVATE_DTW_SCHEMA_ELEMENT && self->schema_type != PRIVATE_DTW_SCHEMA_ELEMENT_PROP){ - - private_DtwResource_raise_error( - self, - DTW_RESOURCE_IMPOSSIBLE_TO_ADD_SUB_RESOURCE_INSIDE_SCHEMA_STRUCT, - "impossible to add sub resource inside schema struct " - ); - return ; - } - - if(private_DtwResource_its_a_pk(self)){ - private_DtwResource_raise_error( - self, - DTW_RESOURCE_PRIMARY_KEY_CANNOT_HAVE_SUB_RESOURCE, - "primary key %s cannot have a sub resource", - self->name - ); - return; - } - -} - - -DtwResource * DtwResource_new_schema_insertion(DtwResource *self){ - - if(DtwResource_error(self)){ - return NULL; - } - if(self->schema_type != PRIVATE_DTW_SCHEMA_ROOT){ - private_DtwResource_raise_error( - self, - DTW_RESOURCE_IMPSSIBLE_TO_ADD_INSERTION_OUTSIDE_ROOT_SCHEMA, - "only root schema can generate insertions", - self->name - ); - return NULL; - } - self->root_props->is_writing_schema = true; - - DtwResource *created = DtwResource_sub_resource_random(self->values_resource,NULL); - self->root_props->is_writing_schema = false; - return created; -} - -DtwResource *DtwResource_find_by_name_id(DtwResource *self, const char *name){ - - if(DtwResource_error(self)){ - return NULL; - } - if(self->schema_type != PRIVATE_DTW_SCHEMA_ROOT){ - private_DtwResource_raise_error( - self, - DTW_RESOURCE_ONLY_ROOT_SCHEMA_CAN_FIND_BY_ID_OR_PK, - "only root schema can find by id or pk" - ); - return NULL; - } - self->root_props->is_writing_schema = true; - - DtwResource *element = DtwResource_sub_resource(self->values_resource,name); - - if(DtwResource_type(element) == DTW_NOT_FOUND){ - return NULL; - } - self->root_props->is_writing_schema = false; - - return element; -} -DtwResource * DtwResource_find_by_primary_key_with_binary(DtwResource *self, const char *primary_key, unsigned char *value, long size){ - if(DtwResource_error(self)){ - return NULL; - } - if(self->schema_type != PRIVATE_DTW_SCHEMA_ROOT){ - private_DtwResource_raise_error( - self, - DTW_RESOURCE_ONLY_ROOT_SCHEMA_CAN_FIND_BY_ID_OR_PK, - "only root schema can find by id or pk" - ); - return NULL; - } - self->root_props->is_writing_schema = true; - - DtwResource *primary_key_folder = DtwResource_sub_resource(self->index_resource, "%s", primary_key); - char *sha = dtw_generate_sha_from_any(value,size); - DtwResource *index_value = DtwResource_sub_resource(primary_key_folder,"%s",sha); - free(sha); - if(DtwResource_type(index_value) == DTW_NOT_FOUND){ - return NULL; - } - char *element_folder = DtwResource_get_string(index_value); - if(DtwResource_error(self)){ - return NULL; - } - if(!element_folder){ - return NULL; - } - - DtwResource *founded_resource = DtwResource_sub_resource(self->values_resource, "%s", element_folder); - self->root_props->is_writing_schema = false; - return founded_resource; -} - - - -DtwResource * DtwResource_find_by_primary_key_with_string(DtwResource *self, const char *key, const char *value){ - if(DtwResource_error(self)){ - return NULL; - } - return DtwResource_find_by_primary_key_with_binary(self,key,(unsigned char*)value, (long )strlen(value)); -} - - -void DtwResource_dangerous_remove_schema_prop(DtwResource*self,const char *prop){ - if(DtwResource_error(self)){ - return ; - } - if(self->schema_type != PRIVATE_DTW_SCHEMA_ROOT){ - private_DtwResource_raise_error( - self, - DTW_RESOURCE_ONLY_ROOT_SCHEMA_CANN_MODIFY_SCHEMA_PROPS, - "only root schema can modify schema props" - ); - return; - } - self->root_props->is_writing_schema = true; - - bool allow_transaction = self->allow_transaction; - - DtwResourceArray * all_values = DtwResource_sub_resources(self->values_resource); - DtwTransaction * transaction = self->root_props->transaction; - for(int i = 0; i < all_values->size; i++){ - DtwResource *current = all_values->resources[i]; - DtwResource *prop_to_remove = DtwResource_sub_resource(current,"%s",prop); - if(allow_transaction){ - DtwTransaction_delete_any(transaction,prop_to_remove->path); - }else{ - dtw_remove_any(prop_to_remove->path); - } - - } - DtwResource *index_element = DtwResource_sub_resource(self->index_resource,"%s",prop); - if(allow_transaction){ - DtwTransaction_delete_any(transaction,index_element->path); - }else{ - dtw_remove_any(index_element->path); - } - self->root_props->is_writing_schema = false; - -} - - -void DtwResource_dangerous_rename_schema_prop(DtwResource*self,const char *prop,const char *new_name){ - if(DtwResource_error(self)){ - return ; - } - if(self->schema_type != PRIVATE_DTW_SCHEMA_ROOT){ - private_DtwResource_raise_error( - self, - DTW_RESOURCE_ONLY_ROOT_SCHEMA_CANN_MODIFY_SCHEMA_PROPS, - "only root schema can modify schema props" - ); - return; - } - self->root_props->is_writing_schema = true; - bool allow_transaction = self->allow_transaction; - - DtwResourceArray * all_values = DtwResource_sub_resources(self->values_resource); - DtwTransaction * transaction = self->root_props->transaction; - for(int i = 0; i < all_values->size; i++){ - DtwResource *current = all_values->resources[i]; - DtwResource *prop_to_remove = DtwResource_sub_resource(current,"%s",prop); - DtwResource *new_prop = DtwResource_sub_resource(current,"%s",new_name); - if(allow_transaction){ - DtwTransaction_move_any_merging(transaction,prop_to_remove->path,new_prop->path); - }else{ - dtw_move_any(prop_to_remove->path,new_prop->path,DTW_MERGE); - } - - } - - - DtwResource *index_element = DtwResource_sub_resource(self->index_resource,"%s",prop); - DtwResource *new_index = DtwResource_sub_resource(self->index_resource,"%s",new_name); - if(allow_transaction){ - DtwTransaction_move_any_merging(transaction,index_element->path,new_index->path); - }else{ - dtw_move_any(index_element->path,new_index->path,DTW_MERGE); - } - self->root_props->is_writing_schema = false; - -} - - - -DtwSchema * DtwResource_newSchema(DtwResource *self){ - if(DtwResource_error(self)){ - return NULL; - } - privateDtwResource_ensure_its_possible_to_sub_resource(self); - - if(DtwResource_error(self)){ - return NULL; - } - - if(self->attached_schema){ - return self->attached_schema; - } - - self->attached_schema = private_newDtwSchema(NULL); - self->its_the_schema_owner = true; - return self->attached_schema; -} diff --git a/build/build/dependencies/doTheWorld/resource/resource/schema/schema.h b/build/build/dependencies/doTheWorld/resource/resource/schema/schema.h deleted file mode 100644 index ff2c94f..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/schema/schema.h +++ /dev/null @@ -1,28 +0,0 @@ - -#define PRIVATE_DTW_SCHEMA_ROOT 1 -#define PRIVATE_DTW_SCHEMA_VALUE 2 -#define PRIVATE_DTW_SCHEMA_ELEMENT 3 -#define PRIVATE_DTW_SCHEMA_ELEMENT_PROP 4 -#define PRIVATE_DTW_SCHEMA_INDEX 5 -#define PRIVATE_DTW_SCHEMA_PK_FOLDER 6 -#define PRIVATE_DTW_SCHEMA_PK_VALUE 7 - -bool private_DtwResource_its_a_pk(DtwResource *self); - -void privateDtwResource_ensure_its_possible_to_sub_resource(DtwResource *self); - -DtwResource * DtwResource_new_schema_insertion(DtwResource *self); - -DtwResource *DtwResource_find_by_name_id(DtwResource *self, const char *name); - -DtwResource * DtwResource_find_by_primary_key_with_binary(DtwResource *self, const char *primary_key, unsigned char *value, long size); - -DtwResource * DtwResource_find_by_primary_key_with_string(DtwResource *self, const char *key, const char *value); - -void DtwResource_dangerous_remove_schema_prop(DtwResource*self,const char *prop); - -void DtwResource_dangerous_rename_schema_prop(DtwResource*self,const char *prop,const char *new_name); - - - -DtwSchema * DtwResource_newSchema(DtwResource *self); diff --git a/build/build/dependencies/doTheWorld/resource/resource/setters/setters.c b/build/build/dependencies/doTheWorld/resource/resource/setters/setters.c deleted file mode 100644 index b5229f9..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/setters/setters.c +++ /dev/null @@ -1,183 +0,0 @@ -// -// Created by mateusmoutinho on 05/08/23. -// -void private_dtw_resource_set_primary_key(DtwResource *self, unsigned char *element, long size){ - - self->root_props->is_writing_schema = true; - DtwResource * ancestor = self->mother->mother->mother; - DtwResource *index_resource =ancestor->index_resource; - DtwResource *pk_folder = DtwResource_sub_resource(index_resource,"%s",self->name); - - char *sha = dtw_generate_sha_from_any(element,size); - DtwResource *pk_value = DtwResource_sub_resource(pk_folder,sha); - free(sha); - char *mothers_name =self->mother->name; - - if(DtwResource_is_file(pk_value)) { - char *content = DtwResource_get_string(pk_value); - if (DtwResource_error(self)) { - self->root_props->is_writing_schema = false; - return; - } - - //means its the same - if (strcmp(content, mothers_name) == 0) { - self->root_props->is_writing_schema = false; - return; - } - - private_DtwResource_raise_error( - self, - DTW_RESOURCE_PRIMARY_KEY_ALREADY_EXIST, - "primary key: %s already exist", - self->name - ); - self->root_props->is_writing_schema = false; - return; - - } - DtwResource_set_string(pk_value,mothers_name); - self->root_props->is_writing_schema = false; - -} - -void DtwResource_set_binary(DtwResource *self, unsigned char *element, long size){ - if(DtwResource_error(self)){ - return ; - } - if(private_DtwResource_its_a_pk(self)){ - private_dtw_resource_set_primary_key(self, element, size); - } - - if(DtwResource_error(self)){ - return ; - } - - if(self->allow_transaction){ - DtwTransaction_write_any(self->root_props->transaction,self->path,element,size,true); - } - else{ - dtw_write_any_content(self->path,element,size); - } - - DtwResource_unload(self); - self->loaded = true; - self->value_size = size; - self->value_any = (unsigned char *) malloc(size+1); - memcpy(self->value_any,element,size); - -} - - -void DtwResource_set_string(DtwResource *self,const char *element){ - if(DtwResource_error(self)){ - return ; - } - if(private_DtwResource_its_a_pk(self)){ - private_dtw_resource_set_primary_key(self, (unsigned char *) element, (long) strlen(element)); - } - - if(DtwResource_error(self)){ - return ; - } - - if(self->allow_transaction){ - DtwTransaction_write_string(self->root_props->transaction,self->path,element); - } - else{ - dtw_write_string_file_content(self->path,element); - } - DtwResource_unload(self); - - self->loaded = true; - - self->value_size = (long)strlen(element); - - self->value_any = (unsigned char*)strdup(element); - - -} - - -void DtwResource_set_binary_sha(DtwResource *self, unsigned char *value, long size){ - if(DtwResource_error(self)){ - return ; - } - char *generated_sha = dtw_generate_sha_from_any(value,size); - DtwResource_set_string(self,generated_sha); - free(generated_sha); -} - -void DtwResource_set_string_sha(DtwResource *self,const char *value){ - if(DtwResource_error(self)){ - return ; - } - DtwResource_set_binary_sha(self,(unsigned char*)value, (long)strlen(value)); -} - - - - - - - - -void DtwResource_set_long(DtwResource *self,long element){ - if(DtwResource_error(self)){ - return ; - } - if(self->allow_transaction){ - DtwTransaction_write_long(self->root_props->transaction,self->path,element); - } - else{ - dtw_write_long_file_content(self->path,element); - } - DtwResource_unload(self); - self->loaded = true; - char result[20] ={0}; - sprintf(result,"%ld",element); - self->value_any = (unsigned char *)strdup(result); - -} - -void DtwResource_set_double(DtwResource *self,double element){ - if(DtwResource_error(self)){ - return ; - } - if(self->allow_transaction){ - DtwTransaction_write_double(self->root_props->transaction,self->path,element); - } - else{ - dtw_write_double_file_content(self->path,element); - } - DtwResource_unload(self); - self->loaded = true; - char result[20] ={0}; - sprintf(result,"%lf",element); - self->value_any = (unsigned char *)strdup(result); - - -} - -void DtwResource_set_bool( DtwResource *self,bool element){ - if(DtwResource_error(self)){ - return ; - } - if(self->allow_transaction){ - DtwTransaction_write_bool(self->root_props->transaction,self->path,element); - } - else{ - dtw_write_bool_file_content(self->path,element); - } - - DtwResource_unload(self); - self->loaded = true; - if(element){ - self->value_any = (unsigned char*)strdup("true"); - } - else{ - self->value_any = (unsigned char*)strdup("false"); - - } - -} diff --git a/build/build/dependencies/doTheWorld/resource/resource/setters/setters.h b/build/build/dependencies/doTheWorld/resource/resource/setters/setters.h deleted file mode 100644 index da58aef..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/setters/setters.h +++ /dev/null @@ -1,23 +0,0 @@ -// -// Created by mateusmoutinho on 05/08/23. -// -void private_dtw_resource_set_primary_key(DtwResource *self, unsigned char *element, long size); - -void DtwResource_set_binary(DtwResource *self, unsigned char *element, long size); - - -void DtwResource_set_string(DtwResource *self,const char *element); - -void DtwResource_set_binary_sha(DtwResource *self, unsigned char *value, long size); - - -void DtwResource_set_string_sha(DtwResource *self,const char *value); - - -void DtwResource_set_long(DtwResource *self,long element); - - -void DtwResource_set_double(DtwResource *self,double element); - -void DtwResource_set_bool( DtwResource *self,bool element); - diff --git a/build/build/dependencies/doTheWorld/resource/resource/sub_resource_setters/sub_resource_setters.c b/build/build/dependencies/doTheWorld/resource/resource/sub_resource_setters/sub_resource_setters.c deleted file mode 100644 index 13eabd1..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/sub_resource_setters/sub_resource_setters.c +++ /dev/null @@ -1,60 +0,0 @@ -void DtwResource_set_binary_in_sub_resource(DtwResource *self,const char *key, unsigned char *element, long size){ - if(DtwResource_error(self)){ - return ; - } - - DtwResource *created = DtwResource_sub_resource(self,"%s",key); - DtwResource_set_binary(created, element, size); -} - -void DtwResource_set_binary_sha_in_sub_resource(DtwResource *self, const char *key, unsigned char *value, long size){ - if(DtwResource_error(self)){ - return ; - } - DtwResource *created = DtwResource_sub_resource(self,"%s",key); - DtwResource_set_binary_sha(created,value,size); -} - - -void DtwResource_set_string_sha_in_sub_resource(DtwResource *self, const char *key, const char *value){ - if(DtwResource_error(self)){ - return ; - } - DtwResource *created = DtwResource_sub_resource(self,"%s",key); - DtwResource_set_string_sha(created,value); -} - -void DtwResource_set_string_in_sub_resource(DtwResource *self, const char *key, const char *element){ - if(DtwResource_error(self)){ - return ; - } - - DtwResource *created = DtwResource_sub_resource(self,"%s",key); - DtwResource_set_string(created,element); -} - -void DtwResource_set_long_in_sub_resource(DtwResource *self, const char *key, long element){ - if(DtwResource_error(self)){ - return ; - } - DtwResource *created = DtwResource_sub_resource(self,"%s",key); - DtwResource_set_long(created,element); -} - -void DtwResource_set_double_in_sub_resource(DtwResource *self, const char *key, double element){ - if(DtwResource_error(self)){ - return ; - } - - DtwResource *created = DtwResource_sub_resource(self,"%s",key); - DtwResource_set_double(created,element); -} - -void DtwResource_set_bool_in_sub_resource(DtwResource *self,const char *key, bool element){ - if(DtwResource_error(self)){ - return ; - } - - DtwResource *created = DtwResource_sub_resource(self,"%s",key); - DtwResource_set_bool(created,element); -} diff --git a/build/build/dependencies/doTheWorld/resource/resource/sub_resource_setters/sub_resource_setters.h b/build/build/dependencies/doTheWorld/resource/resource/sub_resource_setters/sub_resource_setters.h deleted file mode 100644 index 0f42255..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource/sub_resource_setters/sub_resource_setters.h +++ /dev/null @@ -1,15 +0,0 @@ -void DtwResource_set_binary_in_sub_resource(DtwResource *self,const char *key, unsigned char *element, long size); - - -void DtwResource_set_binary_sha_in_sub_resource(DtwResource *self, const char *key, unsigned char *value, long size); - - -void DtwResource_set_string_sha_in_sub_resource(DtwResource *self, const char *key, const char *value); - -void DtwResource_set_string_in_sub_resource(DtwResource *self, const char *key, const char *element); - -void DtwResource_set_long_in_sub_resource(DtwResource *self, const char *key, long element); - -void DtwResource_set_double_in_sub_resource(DtwResource *self, const char *key, double element); - -void DtwResource_set_bool_in_sub_resource(DtwResource *self,const char *key, bool element); diff --git a/build/build/dependencies/doTheWorld/resource/resource_array/resource_array.c b/build/build/dependencies/doTheWorld/resource/resource_array/resource_array.c deleted file mode 100644 index 9cae4eb..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource_array/resource_array.c +++ /dev/null @@ -1,96 +0,0 @@ - - - -DtwResourceArray * newDtwResourceArray(){ - DtwResourceArray *self = (DtwResourceArray*) malloc(sizeof (DtwResourceArray)); - self->resources = (DtwResource**) malloc(0); - self->size = 0; - return self; -} - - -void DtwResourceArray_append(DtwResourceArray *self, DtwResource *element){ - self->resources = (DtwResource**)realloc(self->resources,(self->size +1) * sizeof (DtwResource**)); - self->resources[self->size] = element; - self->size+=1; -} - - -DtwResource* DtwResourceArray_get_by_name(DtwResourceArray *self, const char *name){ - for(int i = 0; i < self->size; i++){ - DtwResource *current = self->resources[i]; - if(strcmp(current->name,name) ==0){ - return current; - } - } - return NULL; -} - -DtwResourceArray * DtwResource_get_schema_values(DtwResource *self){ - if(DtwResource_error(self)){ - return NULL; - } - self->root_props->is_writing_schema = true; - - if(self->schema_type != PRIVATE_DTW_SCHEMA_ROOT){ - private_DtwResource_raise_error( - self, - DTW_RESOURCE_ONLY_ROOT_SCHEMA_HAVE_SCHEMA_VALUES, - "only root schema have schema values" - ); - return NULL; - } - - DtwResourceArray *elements = DtwResource_sub_resources(self->values_resource); - self->root_props->is_writing_schema = false; - return elements; -} - - -DtwResourceArray * DtwResource_sub_resources(DtwResource *self){ - - - - DtwStringArray *names = DtwResource_list_names(self); - DtwStringArray_sort(names); - DtwResourceArray *target_array = (DtwResourceArray*)self->sub_resources; - - if(self->cache_sub_resources == false){ - target_array = newDtwResourceArray(); - } - - for(int i = 0; i < names->size; i++){ - char *current_name = names->strings[i]; - - if(self->cache_sub_resources){ - DtwResource_sub_resource(self,"%s", current_name); - } - - else{ - DtwResource *current_resource = DtwResource_sub_resource(self,"%s",current_name); - DtwResourceArray_append(target_array,current_resource); - } - } - - DtwStringArray_free(names); - return target_array; - - -} - - -void DtwResourceArray_represent(DtwResourceArray *self){ - for(int i = 0; i< self->size; i++){ - printf("----------------------------------------\n"); - DtwResource_represent(self->resources[i]); - } -} - -void DtwResourceArray_free(DtwResourceArray *self){ - for(int i = 0; i < self->size; i++){ - DtwResource_free(self->resources[i]); - - } - free(self->resources); - free(self); -} diff --git a/build/build/dependencies/doTheWorld/resource/resource_array/resource_array.h b/build/build/dependencies/doTheWorld/resource/resource_array/resource_array.h deleted file mode 100644 index 97ca447..0000000 --- a/build/build/dependencies/doTheWorld/resource/resource_array/resource_array.h +++ /dev/null @@ -1,25 +0,0 @@ - - - -typedef struct DtwResourceArray{ - DtwResource **resources; - long size; - -}DtwResourceArray; - -DtwResourceArray * newDtwResourceArray(); - -void DtwResourceArray_append(DtwResourceArray *self, DtwResource *element); - - -DtwResource * DtwResourceArray_get_by_name(DtwResourceArray *self, const char *name); - -DtwResourceArray * DtwResource_get_schema_values(DtwResource *self); - -DtwResourceArray * DtwResource_sub_resources(DtwResource *self); - - -void DtwResourceArray_represent(DtwResourceArray *self); - -void DtwResourceArray_free(DtwResourceArray *self); - diff --git a/build/build/dependencies/doTheWorld/resource/root_props/root_props.c b/build/build/dependencies/doTheWorld/resource/root_props/root_props.c deleted file mode 100644 index d6290c2..0000000 --- a/build/build/dependencies/doTheWorld/resource/root_props/root_props.c +++ /dev/null @@ -1,30 +0,0 @@ - - -privateDtwResourceRootProps *private_newDtwResourceRootProps(){ - privateDtwResourceRootProps *self = (privateDtwResourceRootProps*) malloc(sizeof (privateDtwResourceRootProps)); - *self = (privateDtwResourceRootProps){0}; - self->transaction = newDtwTransaction(); - self->randonizer = newDtwRandonizer(); - self->locker = newDtwLocker(); - self->error_code = DTW_RESOURCE_OK; - - return self; -} - - -void privateDtwResourceRootProps_free(privateDtwResourceRootProps *self){ - DtwTransaction_free(self->transaction); - DtwRandonizer_free(self->randonizer); - DtwLocker_free(self->locker); - if(self->error_path){ - free(self->error_path); - } - - if(self->error_message){ - free(self->error_message); - } - - - - free(self); -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/resource/root_props/root_props.h b/build/build/dependencies/doTheWorld/resource/root_props/root_props.h deleted file mode 100644 index 4a18d86..0000000 --- a/build/build/dependencies/doTheWorld/resource/root_props/root_props.h +++ /dev/null @@ -1,33 +0,0 @@ -#define DTW_RESOURCE_ELEMENT_IS_NULL -1 -#define DTW_RESOURCE_OK 0 -#define DTW_RESOURCE_ELEMENT_NOT_EXIST 1 -#define DTW_RESOURCE_ELEMENT_NOT_BOOL 2 -#define DTW_RESOURCE_ELEMENT_NOT_LONG 3 -#define DTW_RESOURCE_ELEMENT_NOT_DOUBLE 4 -#define DTW_RESOURCE_ELEMENT_NOT_STRING 5 -#define DTW_RESOURCE_PRIMARY_KEY_ALREADY_EXIST 6 -#define DTW_RESOURCE_PRIMARY_KEY_CANNOT_HAVE_SUB_RESOURCE 7 -#define DTW_IMPOSSIBLE_TO_RENAME_A_PRIMARY_KEY 8 -#define DTW_RESOURCE_RENAMED_RESOURCE_CANNOT_HAVE_SONS 9 -#define DTW_RESOURCE_IMPSSIBLE_TO_ADD_INSERTION_OUTSIDE_ROOT_SCHEMA 10 -#define DTW_RESOURCE_IMPOSSIBLE_TO_ADD_SUB_RESOURCE_INSIDE_SCHEMA_STRUCT 11 -#define DTW_RESOURCE_ONLY_ROOT_SCHEMA_CAN_FIND_BY_ID_OR_PK 12 -#define DTW_RESOURCE_ONLY_ROOT_SCHEMA_HAVE_SCHEMA_VALUES 13 -#define DTW_RESOURCE_ONLY_ROOT_SCHEMA_CANN_MODIFY_SCHEMA_PROPS 14 - -typedef struct { - DtwTransaction *transaction; - DtwRandonizer *randonizer; - DtwLocker *locker; - bool is_writing_schema; - int error_code; - char *error_path; - char *error_message; - -}privateDtwResourceRootProps; - -privateDtwResourceRootProps *private_newDtwResourceRootProps(); - - -void privateDtwResourceRootProps_free(privateDtwResourceRootProps *self); - diff --git a/build/build/dependencies/doTheWorld/resource/schema/schema.c b/build/build/dependencies/doTheWorld/resource/schema/schema.c deleted file mode 100644 index abcc548..0000000 --- a/build/build/dependencies/doTheWorld/resource/schema/schema.c +++ /dev/null @@ -1,56 +0,0 @@ - -DtwSchema *private_newDtwSchema(const char *name){ - DtwSchema *self = (DtwSchema*) malloc(sizeof (DtwSchema)); - *self = (DtwSchema){0}; - self->value_name = DTW_SCHEMA_DEFAULT_VALUES_NAME; - self->index_name = DTW_SCHEMA_DEFAULT_INDEX_NAME; - self->sub_schemas = (struct DtwSchema **)malloc(0); - if(name){ - self->primary_keys = newDtwStringArray(); - self->name = strdup(name); - } - - return self; -} - - -DtwSchema * privateDtwSchema_get_sub_schema(DtwSchema *self,const char *name){ - - for(int i = 0; i < self->size; i++){ - DtwSchema *current = self->sub_schemas[i]; - - if(strcmp(current->name,name) == 0){ - return current; - } - } - return NULL; -} - -DtwSchema * DtwSchema_new_subSchema(DtwSchema *self,const char *name){ - DtwSchema *subSchema = private_newDtwSchema(name); - self->sub_schemas = ( DtwSchema **) realloc(self->sub_schemas, (self->size + 1) * sizeof( DtwSchema *)); - self->sub_schemas[self->size] = subSchema; - self->size+=1; - return subSchema; -} - - -void DtwSchema_add_primary_key(DtwSchema *self,const char *name){ - DtwStringArray_append(self->primary_keys,name); -} - -void private_newDtwSchema_free(DtwSchema *self){ - - for (int i = 0; i < self->size; i++) { - private_newDtwSchema_free((DtwSchema *) self->sub_schemas[i]); - } - - free(self->sub_schemas); - if(self->name){ - free(self->name); - } - if(self->primary_keys){ - DtwStringArray_free(self->primary_keys); - } - free(self); -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/resource/schema/schema.h b/build/build/dependencies/doTheWorld/resource/schema/schema.h deleted file mode 100644 index e0ab7c6..0000000 --- a/build/build/dependencies/doTheWorld/resource/schema/schema.h +++ /dev/null @@ -1,29 +0,0 @@ - - -#define DTW_SCHEMA_DEFAULT_VALUES_NAME "value" -#define DTW_SCHEMA_DEFAULT_INDEX_NAME "index" - - - -typedef struct DtwSchema{ - - - const char *value_name; - const char *index_name; - - char *name; - struct DtwSchema **sub_schemas; - int size; - DtwStringArray *primary_keys; -}DtwSchema; - -DtwSchema *private_newDtwSchema(const char *name); - -DtwSchema * privateDtwSchema_get_sub_schema(DtwSchema *self,const char *name); - - -DtwSchema * (DtwSchema_new_subSchema)(DtwSchema *self,const char *name); - -void DtwSchema_add_primary_key(DtwSchema *self,const char *name); - -void private_newDtwSchema_free(DtwSchema *self); diff --git a/build/build/dependencies/doTheWorld/string_array/string_array.c b/build/build/dependencies/doTheWorld/string_array/string_array.c deleted file mode 100644 index a186a11..0000000 --- a/build/build/dependencies/doTheWorld/string_array/string_array.c +++ /dev/null @@ -1,97 +0,0 @@ - -struct DtwStringArray * newDtwStringArray(){ - struct DtwStringArray *self = (struct DtwStringArray*)malloc(sizeof(struct DtwStringArray)); - self->size = 0; - - self->strings = (char**)malloc(1); - - return self; -} - -int DtwStringArray_find_position(struct DtwStringArray *self, const char *string){ - for(int i = 0; i < self->size; i++){ - if(strcmp(self->strings[i], string) == 0){ - return i; - } - } - return -1; -} - - -void DtwStringArray_set_value(struct DtwStringArray *self, int index, const char *value){ - if(index < self->size && index >= 0){ - int size = strlen(value); - self->strings[index] = (char*)realloc(self->strings[index], size + 1); - self->strings[index][size] = '\0'; - strcpy(self->strings[index], value); - } -} -void DtwStringArray_append_getting_ownership(struct DtwStringArray *self, char *string){ - self->strings = (char**)realloc(self->strings, (self->size+ 1) * sizeof(char*)); - self->strings[self->size] = string; - self->size+=1; -} - -// Function prototypes -void DtwStringArray_append(struct DtwStringArray *self, const char *string){ - - self->strings = (char**)realloc(self->strings, (self->size+ 1) * sizeof(char*)); - self->strings[self->size] = strdup(string); - self->size+=1; -} - -void DtwStringArray_pop(struct DtwStringArray *self, int position){ - free(self->strings[position]); - for(int i = position; i < self->size -1; i++){ - self->strings[i] = self->strings[i+1]; - } - self->size-=1; -} - -void DtwStringArray_merge(struct DtwStringArray *self, struct DtwStringArray *other){ - for(int i = 0; i < other->size; i++){ - DtwStringArray_append(self, other->strings[i]); - } -} - - -void DtwStringArray_represent(struct DtwStringArray *self){ - for(int i = 0; i < self->size; i++){ - printf("%s\n", self->strings[i]); - } -} - - - -void DtwStringArray_sort(struct DtwStringArray *self) { - - qsort(self->strings, self->size, sizeof(char*), private_dtw_string_cmp); - - -} - -struct DtwStringArray * DtwStringArray_clone(DtwStringArray *self){ - DtwStringArray *clone = newDtwStringArray(); - for(int i = 0; i< self->size; i++){ - DtwStringArray_append(clone,self->strings[i]); - } - return clone; -} - -char * privateDtwStringArray_append_if_not_included(DtwStringArray *self,char *value){ - long position=DtwStringArray_find_position(self,value); - if(position != -1){ - free(value); - return self->strings[position]; - } - DtwStringArray_append_getting_ownership(self,value); - return value; -} -void DtwStringArray_free(struct DtwStringArray *self){ - for(int i = 0; i < self->size; i++){ - free(self->strings[i]); - } - - free(self->strings); - free(self); -} diff --git a/build/build/dependencies/doTheWorld/string_array/string_array.h b/build/build/dependencies/doTheWorld/string_array/string_array.h deleted file mode 100644 index 2ef6a54..0000000 --- a/build/build/dependencies/doTheWorld/string_array/string_array.h +++ /dev/null @@ -1,33 +0,0 @@ - -typedef struct DtwStringArray { - int size; - - char **strings; - - - -}DtwStringArray; - -// End the structure with a semicolon -int DtwStringArray_find_position(struct DtwStringArray *self, const char *string); - - -void DtwStringArray_append_getting_ownership(struct DtwStringArray *self, char *string); - -void DtwStringArray_append(struct DtwStringArray *self, const char *string); - -void DtwStringArray_pop(struct DtwStringArray *self, int position); - -void DtwStringArray_merge(struct DtwStringArray *self, struct DtwStringArray *other); -void DtwStringArray_represent(struct DtwStringArray *self); -void DtwStringArray_free(struct DtwStringArray *self); -void DtwStringArray_sort(struct DtwStringArray *self); - -void DtwStringArray_set_value(struct DtwStringArray *self, int index, const char *value); - -struct DtwStringArray * newDtwStringArray(); - -char * privateDtwStringArray_append_if_not_included(DtwStringArray *self,char *value); - -struct DtwStringArray * DtwStringArray_clone(DtwStringArray *self); - diff --git a/build/build/dependencies/doTheWorld/string_functions/string_functions.c b/build/build/dependencies/doTheWorld/string_functions/string_functions.c deleted file mode 100644 index 2fd2932..0000000 --- a/build/build/dependencies/doTheWorld/string_functions/string_functions.c +++ /dev/null @@ -1,220 +0,0 @@ - - -void private_dtw_remove_double_bars_from_string_array(struct DtwStringArray*path){ - for(int i =0;i< path->size;i++){ - char *buffer = private_dtw_format_path(path->strings[i]); - free(path->strings[i]); - path->strings[i] = buffer; - } -} - -char *dtw_concat_path(const char *path1, const char *path2){ - - if(!path1){ - return strdup(path2); - } - - if(!path2){ - return strdup(path1); - } - - char *path = (char *)malloc(strlen(path1) + strlen(path2) + 3); - - if(dtw_ends_with(path1, "/") || dtw_ends_with(path1, "\\")){ - sprintf(path,"%s%s",path1,path2); - - } - else{ - sprintf(path,"%s/%s",path1,path2); - - } - return path; -} - -char * private_dtw_format_vaarg(const char *expresion, va_list args){ - - va_list args_copy; - va_copy(args_copy, args); - long required_size = vsnprintf(NULL, 0,expresion,args_copy); - va_end(args_copy); - char *buffer = (char*)malloc(sizeof(char) * required_size + 2); - vsnprintf(buffer,sizeof (char) * required_size+1,expresion,args); - return buffer; -} - -char *private_dtw_format_path(const char *path){ - int path_size = (int)strlen(path); - char *buffer = (char*)malloc((path_size+2) * sizeof(char)); - int buffer_size = 0; - bool already_concatened = false; - for(long i = 0; i < path_size;i++){ - char current_char = path[i]; - - bool is_a_divisor =current_char == '\\' || current_char == '/'; - - if(is_a_divisor && already_concatened){ - continue; - } - if(is_a_divisor){ -#ifdef __linux - buffer[buffer_size] = '/'; -#else - buffer[buffer_size] = '\\'; -#endif - buffer_size+=1; - already_concatened = true; - continue; - } - - already_concatened = false; - buffer[buffer_size] = current_char; - buffer_size+=1; - - } - buffer[buffer_size] = '\0'; - return buffer; -} - - -char * private_dtw_sub_str(const char *str, long start,long end){ - long size = end - start; - char *value = (char*)malloc(size+ 2); - - for(long i = 0; i str_size){ - return false; - } - for(long i = 0; i < target_size; i++ ){ - char current_char = target[i]; - char char_to_compare = str[i+target_point]; - if(current_char != char_to_compare){ - return false; - } - } - return true; -} - -long dtw_index_of_string(const char *str,const char *element){ - long str_size = (long)strlen(str); - long element_size = (long)strlen(element); - - for(int i = 0; i action_type = DTW_ACTION_WRITE; - self->content = (unsigned char*)malloc(size +2); - memcpy(self->content,content,size); - self->content[size] = '\0'; - self->size = size; - self->source = strdup(source); - self->is_binary = is_binary; - return self; -} - - -DtwActionTransaction * DtwActionTransaction_move_any(const char *source, const char *dest){ - DtwActionTransaction *self = newDtwActionTransaction(); - self->action_type = DTW_ACTION_MOVE; - self->source = strdup(source); - self->dest = strdup(dest); - return self; - -} - - -DtwActionTransaction * DtwActionTransaction_copy_any(const char *source, const char *dest){ - DtwActionTransaction *self = newDtwActionTransaction(); - self->action_type = DTW_ACTION_COPY; - self->source = strdup(source); - self->dest = strdup(dest); - return self; -} -DtwActionTransaction * DtwActionTransaction_move_any_merging(const char *source, const char *dest){ - DtwActionTransaction *self = newDtwActionTransaction(); - self->action_type = DTW_ACTION_MOVE_MERGING; - self->source = strdup(source); - self->dest = strdup(dest); - return self; -} - -DtwActionTransaction * DtwActionTransaction_copy_any_merging(const char *source, const char *dest){ - DtwActionTransaction *self = newDtwActionTransaction(); - self->action_type = DTW_ACTION_COPY_MERGING; - self->source = strdup(source); - self->dest = strdup(dest); - return self; -} - -DtwActionTransaction * DtwActionTransaction_delete_any(const char *source){ - DtwActionTransaction *self = newDtwActionTransaction(); - self->action_type = DTW_ACTION_DELETE; - self->source = strdup(source); - return self; -} - - - -void DtwActionTransaction_commit(DtwActionTransaction* self,const char *path){ - - char *formated_source = dtw_concat_path(path,self->source); - - - if(self->action_type == DTW_ACTION_WRITE){ - dtw_write_any_content(formated_source,self->content,self->size); - free(formated_source); - return; - } - if(self->action_type == DTW_ACTION_DELETE){ - dtw_remove_any(formated_source); - free(formated_source); - return; - } - char *formated_dest = dtw_concat_path(path,self->dest); - - if(self->action_type == DTW_ACTION_MOVE){ - dtw_move_any(formated_source,formated_dest,DTW_NOT_MERGE); - } - - if(self->action_type == DTW_ACTION_MOVE_MERGING){ - dtw_move_any(formated_source,formated_dest,DTW_MERGE); - } - - if(self->action_type == DTW_ACTION_COPY){ - dtw_copy_any(formated_source,formated_dest,DTW_NOT_MERGE); - } - - if(self->action_type == DTW_ACTION_COPY_MERGING){ - dtw_copy_any(formated_source,formated_dest,DTW_MERGE); - } - - free(formated_dest); - free(formated_source); - -} - - -void DtwActionTransaction_free(DtwActionTransaction* self){ - - if(self->content){ - free(self->content); - } - if(self->source){ - free(self->source); - } - if(self->dest){ - free(self->dest); - } - free(self); -} diff --git a/build/build/dependencies/doTheWorld/transaction/action/action.h b/build/build/dependencies/doTheWorld/transaction/action/action.h deleted file mode 100644 index b049ced..0000000 --- a/build/build/dependencies/doTheWorld/transaction/action/action.h +++ /dev/null @@ -1,59 +0,0 @@ - - -enum { - DTW_ACTION_FILE_NOT_FOUND, - DTW_ACTION_ITS_NOT_JSON, - DTW_ACTION_WRITE, - DTW_ACTION_MOVE, - DTW_ACTION_MOVE_MERGING, - DTW_ACTION_COPY, - DTW_ACTION_COPY_MERGING, - DTW_ACTION_DELETE -}; - - -typedef struct DtwActionTransaction{ - short action_type; - unsigned char *content; - long size; - bool is_binary; - - char *dest; - char *source; - -}DtwActionTransaction; - -DtwActionTransaction *newDtwActionTransaction(); - -DtwJsonTransactionError * private_dtw_validate_json_action_transaction(cJSON *json_obj); - - -DtwActionTransaction * private_DtwActionTransaction_parse_json_object(cJSON *json_obj); - - -DtwActionTransaction * DtwActionTransaction_write_any(const char *source,unsigned char *content,long size,bool is_binary); - -DtwActionTransaction * DtwActionTransaction_move_any(const char *source, const char *dest); - -DtwActionTransaction * DtwActionTransaction_copy_any(const char *source, const char *dest); - -DtwActionTransaction * DtwActionTransaction_move_any_merging(const char *source, const char *dest); - -DtwActionTransaction * DtwActionTransaction_copy_any_merging(const char *source, const char *dest); - -DtwActionTransaction * DtwActionTransaction_delete_any(const char *source); - -short DtwActionTransaction_convert_action_to_integer(char *action); - - -const char * DtwActionTransaction_convert_action_to_string(int action); - - -cJSON * private_DtwActionTransaction_create_json_object(DtwActionTransaction* self); - - -void DtwActionTransaction_commit(DtwActionTransaction* self,const char *path); - -void DtwActionTransaction_represent(DtwActionTransaction* self); - -void DtwActionTransaction_free(DtwActionTransaction* self); diff --git a/build/build/dependencies/doTheWorld/transaction/action/action_parsment.c b/build/build/dependencies/doTheWorld/transaction/action/action_parsment.c deleted file mode 100644 index ce5f2d4..0000000 --- a/build/build/dependencies/doTheWorld/transaction/action/action_parsment.c +++ /dev/null @@ -1,242 +0,0 @@ - -short DtwActionTransaction_convert_action_to_integer(char *action){ - if(strcmp(action,"write") == 0){ - return DTW_ACTION_WRITE; - } - - if(strcmp(action,"move") == 0){ - return DTW_ACTION_MOVE; - } - - if(strcmp(action,"copy") == 0){ - return DTW_ACTION_COPY; - } - - if(strcmp(action,"delete") == 0){ - return DTW_ACTION_DELETE; - } - return -1; - -} - -const char * DtwActionTransaction_convert_action_to_string(int action){ - if(action == DTW_ACTION_WRITE){ - return "write"; - } - if(action == DTW_ACTION_MOVE){ - return "move"; - } - - if(action == DTW_ACTION_COPY){ - return "copy"; - } - if(action == DTW_ACTION_DELETE){ - return "delete"; - } - return NULL; -} - -DtwJsonTransactionError * private_dtw_validate_json_action_transaction(cJSON *json_obj){ - - if(json_obj->type != cJSON_Object ){ - return private_new_DtwJsonTransactionError( - JSON_TRANSACTION_WRONG_TYPE, - "the action object its not an object", - NULL - ); - } - - cJSON *action = cJSON_GetObjectItem(json_obj,"action"); - - if(!action){ - return private_new_DtwJsonTransactionError( - JSON_TRANSACTION_NOT_PRESENT_VALUE, - "the action is not present", - "[\"action\"]" - ); - } - - if(action->type != cJSON_String){ - return private_new_DtwJsonTransactionError( - JSON_TRANSACTION_WRONG_TYPE, - "the action is not an string", - "[\"action\"]" - ); - } - - - int converted_action = DtwActionTransaction_convert_action_to_integer(action->valuestring); - - if(converted_action == -1){ - - char *formated_mensage = (char*)calloc(sizeof (char),strlen(action->valuestring) + 30); - sprintf(formated_mensage,"the action: %s its not valid",action->valuestring); - DtwJsonTransactionError *error = private_new_DtwJsonTransactionError( - JSON_TRANSACTION_INVALID_ACTION, - formated_mensage, - "[\"action\"]" - ); - free(formated_mensage); - return error; - } - - if(converted_action == DTW_ACTION_WRITE){ - cJSON *content = cJSON_GetObjectItem(json_obj,"content"); - if(!content){ - return private_new_DtwJsonTransactionError( - JSON_TRANSACTION_NOT_PRESENT_VALUE, - "the content is not present", - "[\"content\"]" - ); - } - if(content->type != cJSON_String){ - return private_new_DtwJsonTransactionError( - JSON_TRANSACTION_WRONG_TYPE, - "the content is not an string", - "[\"content\"]" - ); - } - cJSON *is_binary = cJSON_GetObjectItem(json_obj,"is binary"); - if(is_binary){ - if(!cJSON_IsBool(is_binary)){ - return private_new_DtwJsonTransactionError( - JSON_TRANSACTION_WRONG_TYPE, - "the is binary is not an bool", - "[\"is binary\"]" - ); - } - } - - } - - - - - cJSON *source = cJSON_GetObjectItem(json_obj,"source"); - if(!source){ - return private_new_DtwJsonTransactionError( - JSON_TRANSACTION_NOT_PRESENT_VALUE, - "the source is not present", - "[\"source\"]" - ); - } - - if(source->type != cJSON_String){ - return private_new_DtwJsonTransactionError( - JSON_TRANSACTION_WRONG_TYPE, - "the source is not an string", - "[\"source\"]" - ); - } - - if(converted_action == DTW_ACTION_MOVE || converted_action == DTW_ACTION_COPY){ - cJSON *dest = cJSON_GetObjectItem(json_obj,"dest"); - - if(!dest){ - return private_new_DtwJsonTransactionError( - JSON_TRANSACTION_NOT_PRESENT_VALUE, - "the dest is not present", - "[\"dest\"]" - ); - } - if(dest->type != cJSON_String){ - return private_new_DtwJsonTransactionError( - JSON_TRANSACTION_WRONG_TYPE, - "the dest is not an string", - "[\"dest\"]" - ); - } - } - return NULL; - -} - - -DtwActionTransaction * private_DtwActionTransaction_parse_json_object(cJSON *json_obj){ - DtwActionTransaction *self = newDtwActionTransaction(); - - char *action = cJSON_GetObjectItem(json_obj,"action")->valuestring; - self->action_type = DtwActionTransaction_convert_action_to_integer(action); - - char *source = cJSON_GetObjectItem(json_obj,"source")->valuestring; - self->source = strdup(source); - - if(self->action_type == DTW_ACTION_DELETE){ - return self; - } - - if(self->action_type == DTW_ACTION_WRITE){ - cJSON *is_binary = cJSON_GetObjectItem(json_obj,"is binary"); - - if(is_binary){ - if(is_binary->valueint){ - self->is_binary= true; - } - } - - char *content = cJSON_GetObjectItem(json_obj,"content")->valuestring; - if(self->is_binary){ - self->content = dtw_base64_decode(content,&self->size); - } - else{ - self->content =(unsigned char*)strdup(content); - self->size =(long)strlen(content); - } - - return self; - } - char *dest = cJSON_GetObjectItem(json_obj,"dest")->valuestring; - self->dest = strdup(dest); - return self; -} - -cJSON * private_DtwActionTransaction_create_json_object(DtwActionTransaction* self){ - cJSON * json_object = cJSON_CreateObject(); - cJSON_AddStringToObject(json_object,"action",DtwActionTransaction_convert_action_to_string(self->action_type)); - - cJSON_AddStringToObject(json_object,"source",self->source); - if(self->action_type ==DTW_ACTION_WRITE){ - if(self->is_binary){ - char *converted = dtw_base64_encode(self->content,self->size); - cJSON_AddStringToObject(json_object,"content",converted); - free(converted); - cJSON_AddBoolToObject(json_object,"is binary",true); - } - else{ - cJSON_AddStringToObject(json_object,"content",(char*)self->content); - } - } - if(self->action_type != DTW_ACTION_DELETE){ - cJSON_AddStringToObject(json_object,"dest",self->dest); - } - - return json_object; -} - - - -void DtwActionTransaction_represent(DtwActionTransaction* self){ - - printf("\taction: %s\n", DtwActionTransaction_convert_action_to_string(self->action_type)); - printf("\tsource:%s\n",self->source); - if(self->action_type == DTW_ACTION_WRITE){ - - if(!self->is_binary && self->size < 30){ - - printf("\tcontent : %s\n",(char*)self->content); - } - else{ - printf("\tcontent: impossible to show\n"); - } - - printf("\tsize:%ld\n",self->size); - printf("\tis binary: %s\n",self->is_binary? "true":"false"); - return; - } - - if(self->action_type != DTW_ACTION_DELETE){ - printf("\tdest: %s\n",self->dest); - } - -} - diff --git a/build/build/dependencies/doTheWorld/transaction/declaration.h b/build/build/dependencies/doTheWorld/transaction/declaration.h deleted file mode 100644 index 9877c7b..0000000 --- a/build/build/dependencies/doTheWorld/transaction/declaration.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "json_error/json_transaction_error.h" -#include "action/action.h" -#include "transaction/transaction.h" diff --git a/build/build/dependencies/doTheWorld/transaction/definition.h b/build/build/dependencies/doTheWorld/transaction/definition.h deleted file mode 100644 index a89437d..0000000 --- a/build/build/dependencies/doTheWorld/transaction/definition.h +++ /dev/null @@ -1,7 +0,0 @@ -#include "json_error/json_transaction_error.c" - -#include "action/action.c" -#include "action/action_parsment.c" - -#include "transaction/transaction.c" -#include "transaction/transaction_parsment.c" \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/transaction/json_error/json_transaction_error.c b/build/build/dependencies/doTheWorld/transaction/json_error/json_transaction_error.c deleted file mode 100644 index f60d3e7..0000000 --- a/build/build/dependencies/doTheWorld/transaction/json_error/json_transaction_error.c +++ /dev/null @@ -1,49 +0,0 @@ - - - - - -DtwJsonTransactionError * private_new_DtwJsonTransactionError( int code,const char *mensage,const char *path){ - DtwJsonTransactionError *self = (DtwJsonTransactionError*) malloc(sizeof(DtwJsonTransactionError)); - self->code = code; - self->mensage = strdup(mensage); - self->path = NULL; - if(path){ - self->path = strdup(path); - } - - return self; -} - -void DtwJsonTransactionError_represent(struct DtwJsonTransactionError *self){ - printf("code: %d\n",self->code); - printf("mensage:%s\n",self->mensage); - if(self->path){ - printf("path: %s",self->path); - } -} - -void DtwJsonTransactionError_prepend_path(struct DtwJsonTransactionError *self,char *path){ - if(self->path){ - - char *new_path = (char*)calloc(sizeof (char), strlen(self->path) + strlen(path) + 2); - - sprintf(new_path,"%s%s",path,self->path); - - free(self->path); - self->path = new_path; - return; - } - self->path = strdup(path); -} - - -void DtwJsonTransactionError_free(struct DtwJsonTransactionError *self){ - free(self->mensage); - if(self->path){ - free(self->path); - } - free(self); - -} - diff --git a/build/build/dependencies/doTheWorld/transaction/json_error/json_transaction_error.h b/build/build/dependencies/doTheWorld/transaction/json_error/json_transaction_error.h deleted file mode 100644 index 607d200..0000000 --- a/build/build/dependencies/doTheWorld/transaction/json_error/json_transaction_error.h +++ /dev/null @@ -1,21 +0,0 @@ -enum { - - JSON_TRANSACTION_WRONG_TYPE, - JSON_TRANSACTION_NOT_PRESENT_VALUE, - JSON_TRANSACTION_INVALID_ACTION -}; -typedef struct DtwJsonTransactionError{ - int code; - char *mensage; - char *path; - - -}DtwJsonTransactionError; - -DtwJsonTransactionError * private_new_DtwJsonTransactionError( int code,const char *mensage,const char *path); - -void DtwJsonTransactionError_represent(struct DtwJsonTransactionError *self); - -void DtwJsonTransactionError_prepend_path(struct DtwJsonTransactionError *self,char *path); - -void DtwJsonTransactionError_free(struct DtwJsonTransactionError *self); diff --git a/build/build/dependencies/doTheWorld/transaction/transaction/transaction.c b/build/build/dependencies/doTheWorld/transaction/transaction/transaction.c deleted file mode 100644 index bf15c1f..0000000 --- a/build/build/dependencies/doTheWorld/transaction/transaction/transaction.c +++ /dev/null @@ -1,131 +0,0 @@ - - -DtwTransaction * newDtwTransaction(){ - DtwTransaction *self = (DtwTransaction*) malloc(sizeof(DtwTransaction)); - self->actions = (DtwActionTransaction **) malloc(sizeof (DtwActionTransaction**)); - self->size = 0; - - return self; -} - -void DtwTransaction_append_action(struct DtwTransaction *self,struct DtwActionTransaction *action){ - self->actions = (DtwActionTransaction**)realloc( - self->actions, - (sizeof(DtwActionTransaction*) * (self->size+1)) - ); - self->actions[self->size] = action; - self->size++; -} - - -void DtwTransaction_remove_from_index(DtwTransaction *self,long index){ - - - DtwActionTransaction_free(self->actions[index]); - self->size -=1; - if(self->size == 0){ - return; - } - for(long i = index; i < self->size; i++){ - self->actions[i] = self->actions[i+1]; - } - -} -void DtwTransaction_filter(DtwTransaction *self,bool (*callback)(DtwActionTransaction *action)){ - for(long i = 0; i < self->size; i++){ - DtwActionTransaction *current = self->actions[i]; - if(!callback(current)){ - DtwTransaction_remove_from_index(self,i); - i-=1; - } - } -} - -void DtwTransaction_remove_from_source(DtwTransaction *self,const char *source){ - for(long i = 0; i < self->size; i++){ - DtwActionTransaction *current = self->actions[i]; - if(strcmp(current->source,source) ==0){ - DtwTransaction_remove_from_index(self,i); - i-=1; - } - } -} - - -void DtwTransaction_write_any(struct DtwTransaction *self,const char *path,unsigned char *content, long size,bool is_binary){ - DtwActionTransaction * action = DtwActionTransaction_write_any(path,content,size,is_binary); - DtwTransaction_append_action(self,action); -} - -void DtwTransaction_write_string(struct DtwTransaction *self,const char *path,const char *content){ - DtwActionTransaction * action = DtwActionTransaction_write_any(path,(unsigned char*)content, strlen(content),false); - DtwTransaction_append_action(self,action); -} - - -void DtwTransaction_write_long(struct DtwTransaction *self,const char *path,long value){ - char converted[20] ={0}; - sprintf(converted,"%ld",value); - DtwTransaction_write_string(self,path,converted); -} - -void DtwTransaction_write_bool(struct DtwTransaction *self,const char *path,bool value){ - if(value){ - DtwTransaction_write_string(self,path,"t"); - } - else{ - DtwTransaction_write_string(self,path,"f"); - } -} - -void DtwTransaction_write_double(struct DtwTransaction *self,const char *path,double value){ - char converted[20] ={0}; - sprintf(converted,"%lf",value); - DtwTransaction_write_string(self,path,converted); -} - - -void DtwTransaction_move_any(struct DtwTransaction *self,const char *source,const char *dest){ - DtwActionTransaction * action = DtwActionTransaction_move_any(source,dest); - DtwTransaction_append_action(self,action); -} - -void DtwTransaction_copy_any(struct DtwTransaction *self,const char *source,const char *dest){ - DtwActionTransaction * action = DtwActionTransaction_copy_any(source,dest); - DtwTransaction_append_action(self,action); -} - -void DtwTransaction_move_any_merging(struct DtwTransaction *self,const char *source,const char *dest){ - DtwActionTransaction * action = DtwActionTransaction_move_any_merging(source,dest); - DtwTransaction_append_action(self,action); -} - - -void DtwTransaction_copy_any_merging(struct DtwTransaction *self,const char *source,const char *dest){ - DtwActionTransaction * action = DtwActionTransaction_copy_any_merging(source,dest); - DtwTransaction_append_action(self,action); -} - - -void DtwTransaction_delete_any(struct DtwTransaction *self,const char *source){ - DtwActionTransaction *action = DtwActionTransaction_delete_any(source); - DtwTransaction_append_action(self,action); -} - - - -void DtwTransaction_commit(struct DtwTransaction *self,const char *path){ - for(int i = 0; i < self->size; i++){ - DtwActionTransaction_commit(self->actions[i],path); - } -} - - - -void DtwTransaction_free(struct DtwTransaction *self){ - for(int i =0; i < self->size; i++){ - DtwActionTransaction_free(self->actions[i]); - } - free(self->actions); - free(self); -} diff --git a/build/build/dependencies/doTheWorld/transaction/transaction/transaction.h b/build/build/dependencies/doTheWorld/transaction/transaction/transaction.h deleted file mode 100644 index 7ff46fe..0000000 --- a/build/build/dependencies/doTheWorld/transaction/transaction/transaction.h +++ /dev/null @@ -1,59 +0,0 @@ - -typedef struct DtwTransaction{ - - DtwActionTransaction **actions; - long size; - - - -}DtwTransaction; - -DtwTransaction * newDtwTransaction(); - -DtwTransaction * newDtwTransaction_from_json(cJSON *json_entry); - -DtwJsonTransactionError * dtw_validate_json_transaction(cJSON *json_entry); - -DtwJsonTransactionError * dtw_validate_json_transaction_file(const char *filename); - - -DtwTransaction * newDtwTransaction_from_json_file(const char *filename); - -void DtwTransaction_remove_from_index(DtwTransaction *self,long index); - -void DtwTransaction_remove_from_source(DtwTransaction *self,const char *source); - -void DtwTransaction_filter(DtwTransaction *self,bool (*callback)(DtwActionTransaction *action)); - -void DtwTransaction_append_action(struct DtwTransaction *self,struct DtwActionTransaction *action); - -void DtwTransaction_write_any(struct DtwTransaction *self,const char *path,unsigned char *content, long size,bool is_binary); - -void DtwTransaction_write_string(struct DtwTransaction *self,const char *path,const char *content); - -void DtwTransaction_write_long(struct DtwTransaction *self,const char *path,long value); - -void DtwTransaction_write_bool(struct DtwTransaction *self,const char *path,bool value); - -void DtwTransaction_write_double(struct DtwTransaction *self,const char *path,double value); - -void DtwTransaction_move_any(struct DtwTransaction *self,const char *source,const char *dest); - -void DtwTransaction_move_any_merging(struct DtwTransaction *self,const char *source,const char *dest); - -void DtwTransaction_copy_any_merging(struct DtwTransaction *self,const char *source,const char *dest); - -void DtwTransaction_copy_any(struct DtwTransaction *self,const char *source,const char *dest); - -void DtwTransaction_delete_any(struct DtwTransaction *self,const char *source); - -cJSON * DtwTransaction_dumps_to_json(struct DtwTransaction *self); - -void DtwTransaction_dumps_to_json_file(struct DtwTransaction *self,const char *filename); - -void DtwTransaction_commit(struct DtwTransaction *self,const char *path); - -void DtwTransaction_represent(struct DtwTransaction *self); - - -void DtwTransaction_free(struct DtwTransaction *self); diff --git a/build/build/dependencies/doTheWorld/transaction/transaction/transaction_parsment.c b/build/build/dependencies/doTheWorld/transaction/transaction/transaction_parsment.c deleted file mode 100644 index 112b1c6..0000000 --- a/build/build/dependencies/doTheWorld/transaction/transaction/transaction_parsment.c +++ /dev/null @@ -1,139 +0,0 @@ - - -DtwJsonTransactionError * dtw_validate_json_transaction(cJSON *json_entry){ - if(json_entry->type != cJSON_Array){ - return private_new_DtwJsonTransactionError( - JSON_TRANSACTION_WRONG_TYPE, - "the initial value its not an array", - NULL - ); - } - long element_size = cJSON_GetArraySize(json_entry); - for(long i = 0; i size; i ++){ - - cJSON_AddItemToArray( - json_array, - private_DtwActionTransaction_create_json_object(self->actions[i]) - ); - - } - return json_array; -} - - -void DtwTransaction_dumps_to_json_file(struct DtwTransaction *self,const char *filename){ - cJSON *json_array = DtwTransaction_dumps_to_json(self); - char *result = cJSON_Print(json_array); - dtw_write_string_file_content(filename,result); - free(result); - cJSON_Delete(json_array); -} - -void DtwTransaction_represent(struct DtwTransaction *self){ - - for(int i = 0; i < self->size; i++){ - - DtwActionTransaction_represent(self->actions[i]); - printf("------------------------------------\n"); - - } - -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/tree/declarations.h b/build/build/dependencies/doTheWorld/tree/declarations.h deleted file mode 100644 index ec343eb..0000000 --- a/build/build/dependencies/doTheWorld/tree/declarations.h +++ /dev/null @@ -1,6 +0,0 @@ - -#include "tree_props/tree_props.h" -#include "json_error/json_error.h" -#include "transaction_report/transaction_report.h" -#include "tree_part/tree_part.h" -#include "tree/tree.h" diff --git a/build/build/dependencies/doTheWorld/tree/definitions.h b/build/build/dependencies/doTheWorld/tree/definitions.h deleted file mode 100644 index 1f34c89..0000000 --- a/build/build/dependencies/doTheWorld/tree/definitions.h +++ /dev/null @@ -1,10 +0,0 @@ -#include "tree_props/tree_props.c" -#include "json_error/json_error.c" -#include "transaction_report/transaction_report.c" -#include "tree_part/tree_part.c" -#include "tree_part/hardware_tree_part.c" - -#include "tree/json_tree.c" -#include "tree/tree_finding.c" -#include "tree/listage.c" -#include "tree/tree.c" diff --git a/build/build/dependencies/doTheWorld/tree/json_error/json_error.c b/build/build/dependencies/doTheWorld/tree/json_error/json_error.c deleted file mode 100644 index 2a6e268..0000000 --- a/build/build/dependencies/doTheWorld/tree/json_error/json_error.c +++ /dev/null @@ -1,141 +0,0 @@ -struct DtwJsonTreeError * newDtwJsonError(){ - struct DtwJsonTreeError *self =(struct DtwJsonTreeError*)malloc(sizeof(struct DtwJsonTreeError)); - self->code = DTW_JSON_ERROR_CODE_OK; - self->position = 0; - self->menssage = "ok"; - - return self; -} - - -struct DtwJsonTreeError * DtwJsonTreeError_validate_json_tree(char *content){ - - struct DtwJsonTreeError *json_error = newDtwJsonError(); - cJSON *json_tree = cJSON_Parse(content); - //verifiy if json_tre is not null - if(json_tree == NULL){ - json_error->code = DTW_JSON_SYNTAX_ERROR; - json_error->menssage = "json_tree is null"; - return json_error; - } - - //verifiy if json_tre is an array - if(!cJSON_IsArray(json_tree)){ - cJSON_Delete(json_tree); - json_error->code = DTW_JSON_TYPE_ERROR; - json_error->menssage = "json_tree is not an array"; - return json_error; - } - - int size = cJSON_GetArraySize(json_tree); - for(int i = 0; i < size; i++){ - json_error->position = i; - cJSON *json_tree_part = cJSON_GetArrayItem(json_tree, i); - cJSON *path = cJSON_GetObjectItemCaseSensitive(json_tree_part, "path"); - cJSON *original_path = cJSON_GetObjectItemCaseSensitive(json_tree_part, "original_path"); - cJSON *hardware_sha = cJSON_GetObjectItemCaseSensitive(json_tree_part, "hardware_sha256"); - cJSON *hardware_content_size = cJSON_GetObjectItemCaseSensitive(json_tree_part, "hardware_content_size"); - cJSON *last_modification_in_unix_time = cJSON_GetObjectItemCaseSensitive(json_tree_part, "last_modification_in_unix_time"); - cJSON *content_size = cJSON_GetObjectItemCaseSensitive(json_tree_part, "content_size"); - cJSON *is_binary = cJSON_GetObjectItemCaseSensitive(json_tree_part, "is_binary"); - cJSON *content = cJSON_GetObjectItemCaseSensitive(json_tree_part, "content"); - cJSON *ignore = cJSON_GetObjectItemCaseSensitive(json_tree_part, "ignore"); - cJSON *pending_action = cJSON_GetObjectItemCaseSensitive(json_tree_part, "pending_action"); - //path is required - if(!cJSON_IsString(path)){ - cJSON_Delete(json_tree); - json_error->code = DTW_JSON_REQUIRED_KEY_ERROR; - json_error->menssage = "path is not a string"; - return json_error; - } - - //Others are not required - if(original_path != NULL && !cJSON_IsString(original_path)){ - cJSON_Delete(json_tree); - json_error->code = DTW_JSON_REQUIRED_VALUE_ERROR; - json_error->menssage = "original_path is not a string"; - return json_error; - } - if(hardware_sha != NULL && !cJSON_IsString(hardware_sha)){ - cJSON_Delete(json_tree); - json_error->code = DTW_JSON_REQUIRED_VALUE_ERROR; - json_error->menssage = "hardware_sha is not a string"; - return json_error; - } - if(hardware_content_size != NULL && !cJSON_IsNumber(hardware_content_size)){ - cJSON_Delete(json_tree); - json_error->code = DTW_JSON_REQUIRED_VALUE_ERROR; - json_error->menssage = "hardware_content_size is not a number"; - return json_error; - } - if(last_modification_in_unix_time != NULL && !cJSON_IsNumber(last_modification_in_unix_time)){ - cJSON_Delete(json_tree); - json_error->code = DTW_JSON_REQUIRED_VALUE_ERROR; - json_error->menssage = "last_modification_in_unix_time is not a number"; - return json_error; - } - if(content_size != NULL && !cJSON_IsNumber(content_size)){ - cJSON_Delete(json_tree); - json_error->code = DTW_JSON_REQUIRED_VALUE_ERROR; - json_error->menssage = "content_size is not a number"; - return json_error; - } - - if(is_binary != NULL && !cJSON_IsBool(is_binary)){ - cJSON_Delete(json_tree); - json_error->code = DTW_JSON_REQUIRED_VALUE_ERROR; - json_error->menssage = "is_binary is not a bool"; - return json_error; - } - if(content != NULL && !cJSON_IsString(content)){ - cJSON_Delete(json_tree); - json_error->code = DTW_JSON_REQUIRED_VALUE_ERROR; - json_error->menssage = "content is not a string"; - return json_error; - } - if(ignore != NULL && !cJSON_IsBool(ignore)){ - cJSON_Delete(json_tree); - json_error->code = DTW_JSON_REQUIRED_VALUE_ERROR; - json_error->menssage = "ignore is not a bool"; - return json_error; - } - - if(pending_action != NULL && cJSON_IsNull(pending_action) == false){ - - if(cJSON_IsString(pending_action)){ - - int action = private_dtw_convert_string_to_action( - cJSON_GetStringValue(pending_action) - ); - if(action == DTW_ACTION_ERROR){ - cJSON_Delete(json_tree); - json_error->code = DTW_JSON_REQUIRED_VALUE_ERROR; - json_error->menssage = "pending_action is not a valid action"; - return json_error; - } - } - else{ - cJSON_Delete(json_tree); - json_error->code = DTW_JSON_REQUIRED_VALUE_ERROR; - json_error->menssage = "pending_action is not a valid action"; - return json_error; - } - - - } - - } - cJSON_Delete(json_tree); - return json_error; -} - - -void DtwJsonTreeError_represent(struct DtwJsonTreeError *self){ - printf("code: %d\n", self->code); - printf("position: %d\n", self->position); - printf("menssage: %s\n", self->menssage); -} - -void DtwJsonTreeError_free(struct DtwJsonTreeError *self){ - free(self); -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/tree/json_error/json_error.h b/build/build/dependencies/doTheWorld/tree/json_error/json_error.h deleted file mode 100644 index 30a1722..0000000 --- a/build/build/dependencies/doTheWorld/tree/json_error/json_error.h +++ /dev/null @@ -1,21 +0,0 @@ -#define DTW_JSON_ERROR_CODE_OK 0 -#define DTW_JSON_TYPE_ERROR 1 -#define DTW_JSON_SYNTAX_ERROR 2 -#define DTW_JSON_REQUIRED_KEY_ERROR 3 -#define DTW_JSON_REQUIRED_VALUE_ERROR 4 -#define DTW_JSON_NOT_FOUND_ERROR 5 -#define DTW_ACTION_ERROR (-1) - - -typedef struct DtwJsonTreeError { - int code; - int position; - const char *menssage; - - -}DtwJsonTreeError; - -struct DtwJsonTreeError * newDtwJsonError(); -struct DtwJsonTreeError * DtwJsonTreeError_validate_json_tree(char *content); -void DtwJsonTreeError_represent(struct DtwJsonTreeError *self); -void DtwJsonTreeError_free(struct DtwJsonTreeError *self); diff --git a/build/build/dependencies/doTheWorld/tree/transaction_report/transaction_report.c b/build/build/dependencies/doTheWorld/tree/transaction_report/transaction_report.c deleted file mode 100644 index 7ca81b7..0000000 --- a/build/build/dependencies/doTheWorld/tree/transaction_report/transaction_report.c +++ /dev/null @@ -1,26 +0,0 @@ - - -struct DtwTreeTransactionReport * newDtwTreeTransactionReport(){ - struct DtwTreeTransactionReport *new_report = (struct DtwTreeTransactionReport *)malloc(sizeof(struct DtwTreeTransactionReport)); - new_report->write = newDtwStringArray(); - new_report->modify = newDtwStringArray(); - new_report->remove = newDtwStringArray(); - return new_report; -} - -void DtwTreeTransactionReport_represent(struct DtwTreeTransactionReport *report){ - printf("Write:---------------------------------------\n"); - DtwStringArray_represent(report->write); - printf("Modify:--------------------------------------\n"); - DtwStringArray_represent(report->modify); - printf("Remove:--------------------------------------\n"); - DtwStringArray_represent(report->remove); - puts(""); -} - -void DtwTreeTransactionReport_free(struct DtwTreeTransactionReport *report){ - DtwStringArray_free(report->write); - DtwStringArray_free(report->modify); - DtwStringArray_free(report->remove); - free(report); -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/tree/transaction_report/transaction_report.h b/build/build/dependencies/doTheWorld/tree/transaction_report/transaction_report.h deleted file mode 100644 index 88bad18..0000000 --- a/build/build/dependencies/doTheWorld/tree/transaction_report/transaction_report.h +++ /dev/null @@ -1,11 +0,0 @@ - -typedef struct DtwTreeTransactionReport{ - DtwStringArray *write; - DtwStringArray *modify; - DtwStringArray *remove; - -}DtwTreeTransactionReport; - -struct DtwTreeTransactionReport * newDtwTreeTransactionReport(); -void DtwTreeTransactionReport_represent(struct DtwTreeTransactionReport *report); -void DtwTreeTransactionReport_free(struct DtwTreeTransactionReport *report); \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/tree/tree/json_tree.c b/build/build/dependencies/doTheWorld/tree/tree/json_tree.c deleted file mode 100644 index 11ad8b3..0000000 --- a/build/build/dependencies/doTheWorld/tree/tree/json_tree.c +++ /dev/null @@ -1,270 +0,0 @@ - - -void DtwTree_loads_json_tree(struct DtwTree *self, const char *all_tree){ - //load json - cJSON *json_tree = cJSON_Parse(all_tree); - int size = cJSON_GetArraySize(json_tree); - for(int i = 0; i < size; i++){ - - cJSON *json_tree_part = cJSON_GetArrayItem(json_tree, i); - cJSON *path = cJSON_GetObjectItemCaseSensitive(json_tree_part, "path"); - cJSON *original_path = cJSON_GetObjectItemCaseSensitive(json_tree_part, "original_path"); - cJSON *hardware_sha = cJSON_GetObjectItemCaseSensitive(json_tree_part, "hardware_sha256"); - cJSON *hardware_content_size = cJSON_GetObjectItemCaseSensitive(json_tree_part, "hardware_content_size"); - cJSON *last_modification_in_unix_time = cJSON_GetObjectItemCaseSensitive(json_tree_part, "last_modification_in_unix_time"); - cJSON *content_size = cJSON_GetObjectItemCaseSensitive(json_tree_part, "content_size"); - cJSON *is_binary = cJSON_GetObjectItemCaseSensitive(json_tree_part, "is_binary"); - cJSON *content = cJSON_GetObjectItemCaseSensitive(json_tree_part, "content"); - cJSON *pending_action = cJSON_GetObjectItemCaseSensitive(json_tree_part, "pending_action"); - cJSON *ignore = cJSON_GetObjectItemCaseSensitive(json_tree_part, "ignore"); - - struct DtwTreePart *part = newDtwTreePartEmpty( - path->valuestring - ); - - if(original_path != NULL){ - if( part->path->original_path_string){ - free( part->path->original_path_string); - } - part->path->original_path_string = strdup(original_path->valuestring); - - } - - if(hardware_sha != NULL){ - part->content_exist_in_hardware = true; - part->hawdware_content_sha = (char *)realloc(part->hawdware_content_sha,strlen(hardware_sha->valuestring)+1); - strcpy(part->hawdware_content_sha,hardware_sha->valuestring); - - } - - if(hardware_content_size != NULL){ - part->content_exist_in_hardware = true; - part->hardware_content_size = hardware_content_size->valueint; - } - - if(last_modification_in_unix_time != NULL){ - part->last_modification_time = last_modification_in_unix_time->valueint; - } - - if(is_binary != NULL){ - part->is_binary = is_binary->valueint; - } - - if(content_size != NULL){ - part->content_size = content_size->valueint; - } - - if(content != NULL){ - - if(part->is_binary){ - long out_size; - unsigned char *decoded =dtw_base64_decode( - content->valuestring, - &out_size - ); - DtwTreePart_set_binary_content(part,decoded,out_size); - free(decoded); - } - else{ - DtwTreePart_set_string_content(part,content->valuestring); - } - } - if(pending_action != NULL && pending_action->valuestring){ - - part->pending_action = private_dtw_convert_string_to_action( - pending_action->valuestring - ); - } - if(ignore != NULL){ - part->ignore = ignore->valueint; - } - - DtwTree_add_tree_part_getting_onwership(self, part); - - } - cJSON_Delete(json_tree); -} - - -void DtwTree_loads_json_tree_from_file( DtwTree *self, const char *path){ - char *content = dtw_load_string_file_content(path); - DtwTree_loads_json_tree(self,content); - free(content); -} - -char * DtwTree_dumps_tree_json( DtwTree *self, DtwTreeProps props){ - - - DtwTreeProps formated_props = DtwTreeProps_format_props(props); - - cJSON *json_array = cJSON_CreateArray(); - for(int i = 0; i < self->size; i++){ - - cJSON *json_tree_part = cJSON_CreateObject(); - DtwTreePart *tree_part = self->tree_parts[i]; - char *path_string = DtwPath_get_path(tree_part->path); - if(path_string ==NULL){ - cJSON_Delete(json_tree_part); - continue; - } - - if(formated_props.ignored_elements == DTW_INCLUDE && tree_part->ignore){ - continue; - } - - if(tree_part->ignore){ - cJSON_AddItemToObject( - json_tree_part, - "ignore", - cJSON_CreateBool(true) - ); - } - - cJSON_AddItemToObject( - json_tree_part, - "path", - cJSON_CreateString(path_string) - ); - - - - if(formated_props.path_atributes == DTW_INCLUDE ){ - char *dir_string = DtwPath_get_dir(tree_part->path); - char *full_name_string = DtwPath_get_full_name(tree_part->path); - char *name_string = DtwPath_get_name(tree_part->path); - char *extension_string = DtwPath_get_extension(tree_part->path); - if(tree_part->path->original_path_string != path_string){ - cJSON_AddItemToObject( - json_tree_part, - "original_path", - cJSON_CreateString(tree_part->path->original_path_string) - ); - } - cJSON_AddItemToObject( - json_tree_part, - "dir", - cJSON_CreateString(dir_string) - ); - - cJSON_AddItemToObject( - json_tree_part, - "full_name", - cJSON_CreateString(full_name_string) - ); - - cJSON_AddItemToObject( - json_tree_part, - "name", - cJSON_CreateString(name_string) - ); - - cJSON_AddItemToObject( - json_tree_part, - "extension", - cJSON_CreateString(extension_string) - ); - - - } - - - if(formated_props.hadware_data == DTW_INCLUDE && tree_part->metadata_loaded){ - cJSON_AddItemToObject( - json_tree_part, - "hardware_sha256", - cJSON_CreateString(tree_part->hawdware_content_sha) - ); - cJSON_AddItemToObject( - json_tree_part, - "last_modification_in_unix", - cJSON_CreateNumber(tree_part->last_modification_time) - ); - - cJSON_AddItemToObject( - json_tree_part, - "hardware_content_size", - cJSON_CreateNumber(tree_part->hardware_content_size) - ); - char *last_modification_string =DtwTreePart_last_modification_time_in_string(tree_part); - cJSON_AddItemToObject( - json_tree_part, - "last_modification", - cJSON_CreateString(last_modification_string) - ); - - free(last_modification_string); - - - } - - if(formated_props.content_data == DTW_INCLUDE && tree_part->content){ - char *content_sha = DtwTreePart_get_content_sha(tree_part); - cJSON_AddItemToObject( - json_tree_part, - "content_size", - cJSON_CreateNumber(tree_part->content_size) - ); - - cJSON_AddItemToObject( - json_tree_part, - "content_sha256", - cJSON_CreateString(content_sha) - ); - - } - - if(formated_props.content == DTW_INCLUDE && tree_part->content){ - - cJSON_AddItemToObject( - json_tree_part, - "is_binary", - cJSON_CreateBool(tree_part->is_binary) - ); - if(tree_part->is_binary == false){ - cJSON_AddItemToObject( - json_tree_part, - "content", - cJSON_CreateString(DtwTreePart_get_content_string_by_reference(tree_part)) - ); - } - else{ - char *content_base64 = dtw_base64_encode(tree_part->content, tree_part->content_size); - - - cJSON_AddItemToObject( - json_tree_part, - "content", - cJSON_CreateString(content_base64) - ); - free(content_base64); - } - } - - //adding action - const char *action_string = private_dtw_convert_action_to_string(tree_part->pending_action); - if(action_string != NULL){ - cJSON_AddItemToObject( - json_tree_part, - "pending_action", - cJSON_CreateString(action_string) - ); - } - //Add json_tree_part - cJSON_AddItemToArray(json_array,json_tree_part); - - } - - char *json_string = cJSON_Print(json_array); - //set ident to 4 spaces - if(formated_props.minification == DTW_MIMIFY){ - cJSON_Minify(json_string); - } - cJSON_Delete(json_array); - return json_string; -} - -void DtwTree_dumps_tree_json_to_file(struct DtwTree *self, const char *path, DtwTreeProps props){ - char *json_string = DtwTree_dumps_tree_json(self,props); - dtw_write_string_file_content(path,json_string); - free(json_string); -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/tree/tree/listage.c b/build/build/dependencies/doTheWorld/tree/tree/listage.c deleted file mode 100644 index 5beacf1..0000000 --- a/build/build/dependencies/doTheWorld/tree/tree/listage.c +++ /dev/null @@ -1,228 +0,0 @@ - -//listages - DtwStringArray *DtwTree_list_files( DtwTree *self, const char *path,bool concat_path){ - DtwStringArray *formated_elements = newDtwStringArray(); - for(int i = 0; i < self->size; i++){ - DtwTreePart *current = self->tree_parts[i]; - DtwPath *current_path = current->path; - char *current_path_string = DtwPath_get_path(current_path); - - long size = strlen(current_path_string); - char last_char = current_path_string[size-1]; - if(last_char =='/'){ - continue; - } - - if(dtw_starts_with(current_path_string,path)){ - //means its not an path from these dimension - int path_size = strlen(path); - bool insert = true; - - for(int i =path_size +1; i < size;i++){ - if(current_path_string[i] == '/'){ - insert = false; - continue; - } - } - - if(insert){ - DtwStringArray_append(formated_elements,current_path_string); - } - - } - - - } - if(!concat_path){ - - DtwStringArray *not_concatened = private_dtw_remove_start_path(formated_elements,path); - DtwStringArray_free(formated_elements); - return not_concatened; - } - - - return formated_elements; -} - - DtwStringArray *DtwTree_list_dirs( DtwTree *self, const char *path,bool concat_path){ - - DtwStringArray *formated_elements = newDtwStringArray(); - for(int i = 0; i < self->size; i++){ - DtwTreePart *current = self->tree_parts[i]; - DtwPath *current_path = current->path; - char *current_path_string = DtwPath_get_path(current_path); - - long size = strlen(current_path_string); - char last_char = current_path_string[size-1]; - if(last_char !='/'){ - continue; - } - - if(dtw_starts_with(current_path_string,path)){ - //means its not an path from these dimension - int path_size = strlen(path); - - int total_found = 0; - for(int i =path_size +1; i < size;i++){ - if(current_path_string[i] == '/'){ - total_found+=1; - continue; - } - } - - if(total_found ==1){ - DtwStringArray_append(formated_elements,current_path_string); - } - - } - - - } - if(!concat_path){ - - DtwStringArray *not_concatened = private_dtw_remove_start_path(formated_elements,path); - DtwStringArray_free(formated_elements); - return not_concatened; - } - - - return formated_elements; -} - -struct DtwStringArray *DtwTree_list_all( DtwTree *self, const char *path,bool concat_path){ - - DtwStringArray *formated_elements = newDtwStringArray(); - for(int i = 0; i < self->size; i++){ - DtwTreePart *current = self->tree_parts[i]; - DtwPath *current_path = current->path; - char *current_path_string = DtwPath_get_path(current_path); - - if(dtw_starts_with(current_path_string,path)){ - //means its not an path from these dimension - int path_size = strlen(path); - long size = strlen(current_path_string); - char last_char = current_path_string[size-1]; - - int total_found = 0; - for(int i =path_size+1; i < size;i++){ - if(current_path_string[i] == '/'){ - total_found+=1; - continue; - } - } - - if(total_found ==1 && last_char == '/'){ - DtwStringArray_append(formated_elements,current_path_string); - } - if(total_found ==0){ - DtwStringArray_append(formated_elements,current_path_string); - - } - - - - } - - - } - if(!concat_path){ - - DtwStringArray *not_concatened = private_dtw_remove_start_path(formated_elements,path); - DtwStringArray_free(formated_elements); - return not_concatened; - } - - - return formated_elements; - -} - - DtwStringArray *DtwTree_list_files_recursively( DtwTree *self, const char *path,bool concat_path){ - DtwStringArray *formated_elements = newDtwStringArray(); - for(int i = 0; i < self->size; i++){ - DtwTreePart *current = self->tree_parts[i]; - DtwPath *current_path = current->path; - char *current_path_string = DtwPath_get_path(current_path); - - - long size = strlen(current_path_string); - char last_char = current_path_string[size-1]; - if(last_char =='/'){ - continue; - } - - if(dtw_starts_with(current_path_string,path)){ - DtwStringArray_append(formated_elements,current_path_string); - - } - - - } - if(!concat_path){ - - DtwStringArray *not_concatened = private_dtw_remove_start_path(formated_elements,path); - DtwStringArray_free(formated_elements); - return not_concatened; - } - - - return formated_elements; -} - - DtwStringArray *DtwTree_list_dirs_recursively( DtwTree *self, const char *path,bool concat_path){ - DtwStringArray *formated_elements = newDtwStringArray(); - for(int i = 0; i < self->size; i++){ - DtwTreePart *current = self->tree_parts[i]; - DtwPath *current_path = current->path; - char *current_path_string = DtwPath_get_path(current_path); - - long size = strlen(current_path_string); - char last_char = current_path_string[size-1]; - if(last_char !='/'){ - continue; - } - - if(dtw_starts_with(current_path_string,path)){ - DtwStringArray_append(formated_elements,current_path_string); - - } - - } - if(!concat_path){ - - DtwStringArray *not_concatened = private_dtw_remove_start_path(formated_elements,path); - DtwStringArray_free(formated_elements); - return not_concatened; - } - - - return formated_elements; -} - - - DtwStringArray *DtwTree_list_all_recursively( DtwTree *self, const char *path,bool concat_path){ - DtwStringArray *formated_elements = newDtwStringArray(); - for(int i = 0; i < self->size; i++){ - DtwTreePart *current = self->tree_parts[i]; - DtwPath *current_path = current->path; - char *current_path_string = DtwPath_get_path(current_path); - - - - if(dtw_starts_with(current_path_string,path)){ - DtwStringArray_append(formated_elements,current_path_string); - - } - - } - if(!concat_path){ - - DtwStringArray *not_concatened = private_dtw_remove_start_path(formated_elements,path); - DtwStringArray_free(formated_elements); - return not_concatened; - } - - - return formated_elements; -} - diff --git a/build/build/dependencies/doTheWorld/tree/tree/tree.c b/build/build/dependencies/doTheWorld/tree/tree/tree.c deleted file mode 100644 index 50a955d..0000000 --- a/build/build/dependencies/doTheWorld/tree/tree/tree.c +++ /dev/null @@ -1,183 +0,0 @@ - - - -struct DtwTree * newDtwTree(){ - - struct DtwTree *self = (struct DtwTree*)malloc(sizeof(struct DtwTree)); - self->size = 0; - self->tree_parts = (struct DtwTreePart**)malloc(1); - - return self; -} - - -struct DtwTree *DtwTree_get_sub_tree(struct DtwTree *self, const char *path, bool copy_content){ - struct DtwTree *sub_tree = newDtwTree(); - for(int i = 0; i < self->size; i++){ - struct DtwTreePart *tree_part = self->tree_parts[i]; - char *current_path = DtwPath_get_path(tree_part->path); - if(dtw_starts_with(current_path,path)){ - if(copy_content){ - DtwTree_add_tree_part_copy(sub_tree,tree_part); - } - if(!copy_content){ - DtwTree_add_tree_part_referencing(sub_tree, tree_part); - } - } - } - return sub_tree; -} - -void DtwTree_add_tree_part_referencing(struct DtwTree *self, struct DtwTreePart *tree_part) { - self->size++; - self->tree_parts = (struct DtwTreePart**)realloc(self->tree_parts, self->size * sizeof(struct DtwTreePart *)); - self->tree_parts[self->size - 1] = tree_part; -} - -void DtwTree_add_tree_part_copy( DtwTree *self, DtwTreePart *tree_part){ - self->size++; - self->tree_parts = (struct DtwTreePart**)realloc(self->tree_parts, self->size * sizeof(struct DtwTreePart *)); - DtwTreePart *copy = DtwTreePart_self_copy(tree_part); - copy->owner = (void*)self; - self->tree_parts[self->size - 1] = copy; - -} - -void DtwTree_remove_tree_part(struct DtwTree *self, int position){ - - self->size--; - DtwTreePart_free(self->tree_parts[position]); - - for(int i = position; isize; i++){ - self->tree_parts[i] = self->tree_parts[i+1]; - } - - -} - -struct DtwTreeTransactionReport * DtwTree_create_report(struct DtwTree *self){ - struct DtwTreeTransactionReport *report = newDtwTreeTransactionReport(); - for(int i = 0; i < self->size; i++){ - struct DtwTreePart *tree_part = self->tree_parts[i]; - int pending_action = tree_part->pending_action; - char *path = DtwPath_get_path(tree_part->path); - - if (pending_action == DTW_WRITE){ - DtwStringArray_append(report->write, path); - } - - else if (pending_action == DTW_MODIFY){ - DtwStringArray_append(report->modify, path); - } - - else if (pending_action == DTW_REMOVE){ - DtwStringArray_append(report->remove, path); - } - - - } - return report; -} - - -void DtwTree_add_tree_part_getting_onwership( DtwTree *self, DtwTreePart *tree_part){ - DtwTree_add_tree_part_referencing(self,tree_part); - tree_part->owner = (void*)self; -} - - - -void DtwTree_represent( DtwTree *self){ - for(int i = 0; i < self->size; i++){ - DtwTreePart_represent(self->tree_parts[i]); - } -} - -void DtwTree_add_tree_parts_from_string_array( DtwTree *self, DtwStringArray *paths,DtwTreeProps props){ - for(int i = 0; i < paths->size; i++){ - - const char *current_path = paths->strings[i]; - DtwTreePart *tree_part = newDtwTreePart( - current_path, - props - ); - - DtwTree_add_tree_part_getting_onwership(self, tree_part); - } -} - - -void DtwTree_add_tree_from_hardware( DtwTree *self,const char *path, DtwTreeProps props){ - DtwTreeProps formated_props = DtwTreeProps_format_props(props); - struct DtwStringArray *path_array = dtw_list_all_recursively(path,DTW_CONCAT_PATH); - DtwStringArray_sort(path_array); - DtwTree_add_tree_parts_from_string_array(self, path_array,props); - DtwStringArray_free(path_array); - - - if(formated_props.path_atributes == DTW_INCLUDE){ - return; - } - if(self->size == 0){ - return; - } - DtwTree_remove_tree_part(self,0); - - int size_to_remove = strlen(path); - if(!dtw_ends_with(path,"/")){ - size_to_remove+=1; - } - - for(int i =0; i < self->size; i++){ - struct DtwTreePart *current_part = self->tree_parts[i]; - struct DtwPath *current_path = current_part->path; - char *current_path_string = DtwPath_get_path(current_path); - //remove the size toremove from string - - memmove( - current_path_string, - current_path_string+size_to_remove, - strlen(current_path_string) - size_to_remove +1 - ); - DtwPath_set_path(current_path,current_path_string); - if(current_path->original_path_string){ - free(current_path->original_path_string); - } - current_path->original_path_string = current_path_string; - - } - -} - -void DtwTree_free( DtwTree *self){ - for(int i = 0; i < self->size; i++){ - DtwTreePart * part = self->tree_parts[i]; - if(part->owner == (void*)self) { - DtwTreePart_free(part); - - } - - } - - free(self->tree_parts); - free(self); -} -void DtwTree_insecure_hardware_remove_tree(struct DtwTree *self){ - for(int i = 0; i < self->size; i++){ - DtwTreePart_hardware_remove(self->tree_parts[i],DTW_EXECUTE_NOW); - } -} - -void DtwTree_insecure_hardware_write_tree(struct DtwTree *self){ - - for(int i = 0; i < self->size; i++){ - struct DtwTreePart *tree_part = self->tree_parts[i]; - DtwTreePart_hardware_write(tree_part,DTW_EXECUTE_NOW); - } -} - -void DtwTree_hardware_commit_tree(struct DtwTree *self){ - for(int i = 0; i < self->size; i++){ - DtwTreePart_hardware_commit(self->tree_parts[i]); - } -} diff --git a/build/build/dependencies/doTheWorld/tree/tree/tree.h b/build/build/dependencies/doTheWorld/tree/tree/tree.h deleted file mode 100644 index ff06c18..0000000 --- a/build/build/dependencies/doTheWorld/tree/tree/tree.h +++ /dev/null @@ -1,77 +0,0 @@ - - - -typedef struct DtwTree{ - int size; - DtwTreePart **tree_parts; - -}DtwTree; - - - DtwTree *DtwTree_get_sub_tree( - DtwTree *self, - const char *path, - bool copy_content -); - - DtwTreePart *DtwTree_find_tree_part_by_function(DtwTree *self,bool (*caller)( DtwTreePart *part)); - - - DtwTree *DtwTree_map(DtwTree *self, DtwTreePart* (*caller)( DtwTreePart *part)); - - - DtwTree *DtwTree_filter(DtwTree *self,bool (*caller)(struct DtwTreePart *part)); - - - DtwTreePart *DtwTree_find_tree_part_by_name( DtwTree *self, const char *name); - DtwTreePart *DtwTree_find_tree_part_by_path( DtwTree *self, const char *path); - -//listages - DtwStringArray *DtwTree_list_files( DtwTree *self, const char *path,bool concat_path); - - DtwStringArray *DtwTree_list_dirs( DtwTree *self, const char *path,bool concat_path); - - DtwStringArray *DtwTree_list_all( DtwTree *self, const char *path,bool concat_path); - - DtwStringArray *DtwTree_list_files_recursively( DtwTree *self, const char *path,bool concat_path); - - DtwStringArray *DtwTree_list_dirs_recursively( DtwTree *self, const char *path,bool concat_path); - - DtwStringArray *DtwTree_list_all_recursively( DtwTree *self, const char *path,bool concat_path); - - -void DtwTree_remove_tree_part( DtwTree *self, int position); - -void DtwTree_add_tree_part_copy( DtwTree *self, DtwTreePart *tree_part); - -void DtwTree_add_tree_part_getting_onwership( DtwTree *self, DtwTreePart *tree_part); - -void DtwTree_add_tree_part_referencing( DtwTree *self, DtwTreePart *tree_part); - -void DtwTree_free( DtwTree *self); -void DtwTree_represent( DtwTree *self); - -void DtwTree_add_tree_parts_from_string_array(DtwTree *self,DtwStringArray *paths,DtwTreeProps props); - -void DtwTree_add_tree_from_hardware(DtwTree *self,const char *path,DtwTreeProps props); - - DtwTreeTransactionReport * DtwTree_create_report( DtwTree *self); - - - -void DtwTree_insecure_hardware_remove_tree( DtwTree *self); - -void DtwTree_insecure_hardware_write_tree( DtwTree *self); - -void DtwTree_hardware_commit_tree( DtwTree *self); - -void DtwTree_loads_json_tree( DtwTree *self, const char *content); - -void DtwTree_loads_json_tree_from_file( DtwTree *self, const char *path); - -char * DtwTree_dumps_tree_json(DtwTree *self,DtwTreeProps props); - -void DtwTree_dumps_tree_json_to_file(DtwTree *self,const char *path,DtwTreeProps props); - - DtwTree * newDtwTree(); - diff --git a/build/build/dependencies/doTheWorld/tree/tree/tree_finding.c b/build/build/dependencies/doTheWorld/tree/tree/tree_finding.c deleted file mode 100644 index 5ea1404..0000000 --- a/build/build/dependencies/doTheWorld/tree/tree/tree_finding.c +++ /dev/null @@ -1,83 +0,0 @@ -// -// Created by jurandi on 11-04-2023. -// -struct DtwTreePart *DtwTree_find_tree_part_by_function( - struct DtwTree *self, - bool (*caller)(struct DtwTreePart *part) -){ - for(int i = 0;i < self->size; i++){ - struct DtwTreePart *current = self->tree_parts[i]; - bool result = caller(current); - if(result){ - return current; - } - } - return NULL; -} - -struct DtwTree *DtwTree_filter( - struct DtwTree *self, - bool (*caller)(struct DtwTreePart *part) -){ - DtwTree *filtered_tree = newDtwTree(); - - for(int i = 0;i < self->size; i++){ - - DtwTreePart *current = self->tree_parts[i]; - - bool result = caller(current); - - if(result){ - DtwTree_add_tree_part_copy(filtered_tree,current); - } - - } - return filtered_tree; -} - - - DtwTree *DtwTree_map(DtwTree *self,DtwTreePart *(*caller)( DtwTreePart *part)){ - DtwTree *mapped_tree = newDtwTree(); - - for(int i = 0;i < self->size; i++){ - DtwTreePart *current = self->tree_parts[i]; - DtwTreePart *copy = DtwTreePart_self_copy(current); - DtwTreePart *result = caller(copy); - DtwTree_add_tree_part_getting_onwership(mapped_tree, result); - } - return mapped_tree; -} - - - DtwTreePart *DtwTree_find_tree_part_by_name( DtwTree *self, const char *name){ - for(int i = 0;i < self->size; i++){ - DtwTreePart *current = self->tree_parts[i]; - DtwPath *current_path = current->path; - char *current_name = DtwPath_get_full_name(current_path); - if(current_name){ - - if(strcmp(current_name, name) == 0){ - return current; - } - } - - } - - return NULL; -} - - DtwTreePart *DtwTree_find_tree_part_by_path( DtwTree *self, const char *path){ - for(int i = 0;i < self->size; i++){ - DtwTreePart *current = self->tree_parts[i]; - DtwPath *current_path = current->path; - char *current_path_string = DtwPath_get_path(current_path); - if(current_path_string){ - if(strcmp(current_path_string, path) == 0){ - return current; - } - } - - } - - return NULL; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/tree/tree_part/hardware_tree_part.c b/build/build/dependencies/doTheWorld/tree/tree_part/hardware_tree_part.c deleted file mode 100644 index d90af59..0000000 --- a/build/build/dependencies/doTheWorld/tree/tree_part/hardware_tree_part.c +++ /dev/null @@ -1,164 +0,0 @@ - - - - - - -void DtwTreePart_load_content_from_hardware(struct DtwTreePart *self){ - long size; - bool is_binary; - char *path = DtwPath_get_path(self->path); - - if(!path){ - return; - } - if(dtw_entity_type(path) != DTW_FILE_TYPE){ - return; - } - - DtwTreePart_free_content(self); - self->content = dtw_load_any_content(path,&size,&is_binary); - - if(!self->content){ - self->content = (unsigned char *)strdup(""); - } - - - self->is_binary = is_binary; - self->content_size = size; - self->hardware_content_size = size; - self->content_exist_in_hardware = true; - - -} - - - -bool DtwTreePart_hardware_remove(struct DtwTreePart *self, int transaction){ - if(self->ignore == true){ - return false; - } - if(transaction == DTW_SET_AS_ACTION){ - self->pending_action = DTW_REMOVE; - return false; - } - - char *path =DtwPath_get_path(self->path); - - remove(path); - - self->content_exist_in_hardware = false; - return true; -} - -bool DtwTreePart_hardware_write(struct DtwTreePart *self, int transaction){ - if(self->ignore == true){ - return false; - } - if(transaction == DTW_SET_AS_ACTION){ - self->pending_action = DTW_WRITE; - return false; - } - //means that the content not exist in memory - if(self->content == NULL){ - char *path = DtwPath_get_path(self->path); - char *dir = DtwPath_get_dir(self->path); - int entity_type = dtw_entity_type(path); - - if(entity_type== DTW_NOT_FOUND && dir!= NULL){ - dtw_create_dir_recursively(dir); - - } - - - return true; - } - char *path = DtwPath_get_path(self->path); - - dtw_write_any_content(path,self->content,(long)self->content_size); - free(self->hawdware_content_sha); - self->hawdware_content_sha = dtw_generate_sha_from_string((const char *)self->content); - self->content_exist_in_hardware = true; - long now = dtw_get_time(); - self->last_modification_time = now; - - return true; - -} - -bool DtwTreePart_hardware_modify(struct DtwTreePart *self, int transaction){ - if(self->ignore == true){ - return false; - } - if(transaction == DTW_SET_AS_ACTION){ - self->pending_action = DTW_MODIFY; - return false; - } - bool changed_path =DtwPath_changed(self->path); - - - if(changed_path == true && self->content == NULL){ - char *old_path = self->path->original_path_string; - char *new_path = DtwPath_get_path(self->path); - remove(old_path); - dtw_create_dir_recursively(new_path); - return true; - } - - if(changed_path == false && self->content == NULL){ - return false; - } - - bool write = false; - if(changed_path == true){ - char *old_path = self->path->original_path_string; - remove(old_path); - write = true; - } - - if(changed_path== false){ - if(self->metadata_loaded == true){ - char *hardware_sha = self->hawdware_content_sha; - char *memory_sha = DtwTreePart_get_content_sha(self); - if(strcmp(hardware_sha,memory_sha) != 0){ - write = true; - } - } - else{ - write = true; - } - } - - if(write){ - char *path = DtwPath_get_path(self->path); - dtw_write_any_content( - path, - self->content, - (long)self->content_size - ); - free(self->hawdware_content_sha); - self->hawdware_content_sha = dtw_generate_sha_from_string((const char *)self->content); - self->content_exist_in_hardware = true; - long now = dtw_get_time(); - self->last_modification_time = now; - - return true; - } - return false; -} - -bool DtwTreePart_hardware_commit(struct DtwTreePart *self){ - if(self->ignore == true){ - return false; - } - if(self->pending_action == DTW_REMOVE){ - return DtwTreePart_hardware_remove(self,DTW_EXECUTE_NOW); - } - if(self->pending_action == DTW_WRITE){ - return DtwTreePart_hardware_write(self,DTW_EXECUTE_NOW); - } - if(self->pending_action == DTW_MODIFY){ - return DtwTreePart_hardware_modify(self,DTW_EXECUTE_NOW); - } - return false; -} diff --git a/build/build/dependencies/doTheWorld/tree/tree_part/tree_part.c b/build/build/dependencies/doTheWorld/tree/tree_part/tree_part.c deleted file mode 100644 index d2e8923..0000000 --- a/build/build/dependencies/doTheWorld/tree/tree_part/tree_part.c +++ /dev/null @@ -1,211 +0,0 @@ - - - -struct DtwTreePart * newDtwTreePart(const char *path, DtwTreeProps props){ - DtwTreeProps formated_props = DtwTreeProps_format_props(props); - - DtwTreePart *self = (DtwTreePart *)malloc(sizeof(struct DtwTreePart)); - *self = (DtwTreePart){0}; - self->path = newDtwPath(path); - - - if(formated_props.content == DTW_INCLUDE || formated_props.hadware_data == DTW_INCLUDE){ - - DtwTreePart_load_content_from_hardware(self); - if(formated_props.hadware_data == DTW_INCLUDE && self->content){ - - self->metadata_loaded = true; - self->last_modification_time = dtw_get_entity_last_motification_in_unix(path); - free(self->hawdware_content_sha); - self->hawdware_content_sha = dtw_generate_sha_from_string((const char*)self->content); - } - - if(formated_props.content == DTW_HIDE){ - DtwTreePart_free_content(self); - } - } - - return self; -} -char *DtwTreePart_get_content_string_by_reference(struct DtwTreePart *self){ - return (char *)self->content; -} - -unsigned char *DtwTreePart_get_content_binary_by_reference(struct DtwTreePart *self){ - return self->content; -} - - -struct DtwTreePart * DtwTreePart_self_copy( DtwTreePart *self){ - char *path = DtwPath_get_path(self->path); - - DtwTreeProps props = {.content =DTW_NOT_LOAD,.hadware_data = DTW_NOT_LOAD}; - DtwTreePart *new_tree_part = newDtwTreePart( - path, - props - ); - - new_tree_part->content_exist_in_hardware = self->content_exist_in_hardware; - new_tree_part->is_binary = self->is_binary; - new_tree_part->ignore = self->ignore; - new_tree_part->content_size = self->content_size; - - char * current_sha = DtwTreePart_get_content_sha(self); - - if(current_sha) { - new_tree_part->current_sha = strdup(current_sha); - } - - if(self->hawdware_content_sha){ - new_tree_part->hawdware_content_sha = strdup(self->hawdware_content_sha); - } - - if(self->content) { - new_tree_part->content = (unsigned char *)malloc(self->content_size + 2); - memcpy(new_tree_part->content,self->content,self->content_size); - - if(self->is_binary == false){ - new_tree_part->content[self->content_size] = '\0'; - } - - } - - - - return new_tree_part; -} - -void DtwTreePart_set_any_content( DtwTreePart *self, unsigned char *content, int content_size, bool is_binary){ - - DtwTreePart_free_content(self); - self->is_binary = is_binary; - self->content = (unsigned char *)malloc(content_size+2); - memcpy(self->content,content,content_size); - self->content_size = content_size; - - -} - -void DtwTreePart_set_string_content( DtwTreePart *self, const char *content){ - DtwTreePart_set_any_content( - self, - (unsigned char*)content, - strlen(content), - false - ); - - self->content[self->content_size] = '\0'; -} - -void DtwTreePart_set_binary_content( DtwTreePart *self, unsigned char *content, int content_size){ - DtwTreePart_set_any_content(self,content,content_size,true); -} - - -char *DtwTreePart_get_content_sha( DtwTreePart *self){ - if(self->content == NULL) { - return NULL; - } - if(self->current_sha) { - free(self->current_sha); - } - self->current_sha =dtw_generate_sha_from_any(self->content,self->content_size);; - return self->current_sha; -} - - -char *DtwTreePart_last_modification_time_in_string(DtwTreePart *self){ - if(self->last_modification_in_str) { - free(self->last_modification_in_str); - } - self->last_modification_in_str = dtw_convert_unix_time_to_string(self->last_modification_time); - return self->last_modification_in_str; -} - - - - -void DtwTreePart_represent(struct DtwTreePart *self){ - printf("------------------------------------------------------------\n"); - DtwPath_represent(self->path); - printf("Content Exist in Memory: %s\n",self->content ? "true" : "false"); - printf("Ignore: %s\n",self->ignore ? "true" : "false"); - - printf("Content Exist In Hardware: %s\n",self->content_exist_in_hardware ? "true" : "false"); - printf("Is Binary: %s\n",self->is_binary ? "true" : "false"); - - if(self->last_modification_time){ - printf("Last Modification Time in Unix: %li\n",self->last_modification_time); - char *last_moditication_in_string = DtwTreePart_last_modification_time_in_string(self); - printf("Last Modification Time: %s\n",last_moditication_in_string); - } - - printf("Content Size: %ld\n",(long)self->content_size); - - char *content_sha = DtwTreePart_get_content_sha(self); - if(content_sha){ - printf("Content SHA: %s\n",content_sha); - } - if(self->content && self->is_binary == false){ - printf ("Content: %s\n",(char*)self->content); - } - - if(self->hawdware_content_sha) { - printf("Original Hardware SHA:%s\n",self->hawdware_content_sha); - } - - if(self->is_binary == true){ - printf("Content: Binary\n"); - } - - const char *action = private_dtw_convert_action_to_string(self->pending_action); - if(action){ - printf("Pending Action: %s\n",action); - - } - -} - - -void DtwTreePart_free_content(struct DtwTreePart *self){ - if(self->content){ - free(self->content); - } - self->content = NULL; - -} -void DtwTreePart_free(struct DtwTreePart *self){ - if(self->path) { - DtwPath_free(self->path); - } - - if(self->hawdware_content_sha) { - free(self->hawdware_content_sha); - } - if(self->current_sha) { - free(self->current_sha); - } - if(self->last_modification_in_str) { - free(self->last_modification_in_str); - } - DtwTreePart_free_content(self); - free(self); -} - - DtwTreePart * newDtwTreePartEmpty(const char *path){ - DtwTreeProps props = {.content =DTW_NOT_LOAD,.hadware_data = DTW_NOT_LOAD}; - return newDtwTreePart( - path, - props - ); - -} - - - DtwTreePart * newDtwTreePartLoading(const char *path){ - DtwTreeProps props = {.content =DTW_LOAD,.hadware_data = DTW_LOAD}; - return newDtwTreePart( - path, - props - ); -} diff --git a/build/build/dependencies/doTheWorld/tree/tree_part/tree_part.h b/build/build/dependencies/doTheWorld/tree/tree_part/tree_part.h deleted file mode 100644 index a8145ae..0000000 --- a/build/build/dependencies/doTheWorld/tree/tree_part/tree_part.h +++ /dev/null @@ -1,60 +0,0 @@ - - -#define DTW_IS_BINARY true -#define DTW_IS_NOT_BINARY false -#define DTW_IGNORE true -#define DTW_NOT_IGNORE false - -#define DTW_SET_AS_ACTION 1 -#define DTW_EXECUTE_NOW 2 - -#define DTW_MODIFY 1 -#define DTW_WRITE 2 -#define DTW_REMOVE 3 - -typedef struct DtwTreePart{ - - struct DtwPath *path; - void *owner; - size_t hardware_content_size; - long last_modification_time; - bool content_exist_in_hardware; - bool ignore; - bool is_binary; - bool metadata_loaded; - char *current_sha; - char * last_modification_in_str; - char *hawdware_content_sha; - - unsigned char *content; - int pending_action; - - size_t content_size; - -}DtwTreePart; - - -char *DtwTreePart_get_content_string_by_reference(struct DtwTreePart *self); -unsigned char *DtwTreePart_get_content_binary_by_reference(struct DtwTreePart *self); -char *DtwTreePart_get_content_sha(struct DtwTreePart *self); -char *DtwTreePart_last_modification_time_in_string(struct DtwTreePart *self); -void DtwTreePart_set_any_content(struct DtwTreePart *self, unsigned char *content, int content_size, bool is_binary); -void DtwTreePart_set_string_content(struct DtwTreePart *self, const char *content); -void DtwTreePart_set_binary_content(struct DtwTreePart *self, unsigned char *content, int content_size); -void DtwTreePart_load_content_from_hardware(struct DtwTreePart *self); -void DtwTreePart_free_content(struct DtwTreePart *self); -void DtwTreePart_represent(struct DtwTreePart *self); - -bool DtwTreePart_hardware_remove(struct DtwTreePart *self,int transaction); -bool DtwTreePart_hardware_write(struct DtwTreePart *self,int transaction); -bool DtwTreePart_hardware_modify(struct DtwTreePart *self,int transaction); - - -bool DtwTreePart_hardware_commit(struct DtwTreePart *self); - -void DtwTreePart_free(struct DtwTreePart *self); -struct DtwTreePart * DtwTreePart_self_copy(struct DtwTreePart *self); - -struct DtwTreePart * newDtwTreePart(const char *path, DtwTreeProps props); -struct DtwTreePart * newDtwTreePartEmpty(const char *path); -struct DtwTreePart * newDtwTreePartLoading(const char *path); diff --git a/build/build/dependencies/doTheWorld/tree/tree_props/tree_props.c b/build/build/dependencies/doTheWorld/tree/tree_props/tree_props.c deleted file mode 100644 index 6de31c9..0000000 --- a/build/build/dependencies/doTheWorld/tree/tree_props/tree_props.c +++ /dev/null @@ -1,27 +0,0 @@ -// -// Created by jurandi on 01-07-2023. -// - -DtwTreeProps DtwTreeProps_format_props(DtwTreeProps props){ - DtwTreeProps result = props; - - if(!result.minification){ - result.minification = DTW_NOT_MIMIFY; - } - if(!result.content){ - result.content = DTW_INCLUDE; - } - if(!result.path_atributes){ - result.path_atributes = DTW_INCLUDE; - } - if(!result.hadware_data){ - result.hadware_data = DTW_INCLUDE; - } - if(!result.content_data){ - result.content_data = DTW_INCLUDE; - } - if(!result.ignored_elements){ - result.ignored_elements = DTW_HIDE; - } - return result; -} \ No newline at end of file diff --git a/build/build/dependencies/doTheWorld/tree/tree_props/tree_props.h b/build/build/dependencies/doTheWorld/tree/tree_props/tree_props.h deleted file mode 100644 index 7e4d20c..0000000 --- a/build/build/dependencies/doTheWorld/tree/tree_props/tree_props.h +++ /dev/null @@ -1,24 +0,0 @@ - - -#define DTW_NOT_MIMIFY 1 -#define DTW_MIMIFY 2 - -#define DTW_NOT_LOAD 1 -#define DTW_LOAD 2 - -#define DTW_HIDE 1 -#define DTW_INCLUDE 2 - -typedef struct DtwTreeProps{ - int minification; - int content; - int path_atributes; - int hadware_data; - int content_data; - int ignored_elements; - -}DtwTreeProps; - - - -DtwTreeProps DtwTreeProps_format_props(DtwTreeProps props); diff --git a/build/c/callbacks/algo/algo.c b/build/c/callbacks/algo/algo.c deleted file mode 100644 index cbe9476..0000000 --- a/build/c/callbacks/algo/algo.c +++ /dev/null @@ -1,76 +0,0 @@ -LuaCEmbedResponse * lua_get_str_size(LuaCEmbedTable *self,LuaCEmbed *args){ - long size; - lua.args.get_raw_str(args,&size,0); - if(lua.has_errors(args)){ - char *erro_msg = lua.get_error_message(args); - return lua.response.send_error(erro_msg); - } - return lua.response.send_long(size); -} - -LuaCEmbedResponse * lua_get_char(LuaCEmbedTable *self,LuaCEmbed *args){ - - long size; - char *content = lua.args.get_raw_str(args,&size,0); - long index = lua.args.get_long(args,1)-1; - if(lua.has_errors(args)){ - char *erro_msg = lua.get_error_message(args); - return lua.response.send_error(erro_msg); - } - if(index >=size || index < 0){ - return NULL; - } - - char buffer[5] = {0}; - sprintf(buffer,"%c",content[index]); - return lua.response.send_raw_string(buffer,1); - -} - -LuaCEmbedResponse * lua_index_of(LuaCEmbedTable *self,LuaCEmbed *args){ - - char *content = lua.args.get_str(args,0); - char *target = lua.args.get_str(args,1); - - if(lua.has_errors(args)){ - char *error_msg = lua.get_error_message(args); - return lua.response.send_error(error_msg); - } - CTextStack *content_stack = stack.newStack_string(content); - int index = stack.index_of(content_stack,target); - stack.free(content_stack); - return lua.response.send_long(index); -} -LuaCEmbedResponse * lua_replace_string(LuaCEmbedTable *self,LuaCEmbed *args){ - - char *content = lua.args.get_str(args,0); - char *target = lua.args.get_str(args,1); - char *value_to_replace = lua.args.get_str(args,2); - if(lua.has_errors(args)){ - char *error_msg = lua.get_error_message(args); - return lua.response.send_error(error_msg); - } - CTextStack *content_stack = stack.newStack_string(content); - stack.self_replace(content_stack,target,value_to_replace); - - LuaCEmbedResponse *response = lua.response.send_str(content_stack->rendered_text); - stack.free(content_stack); - return response; - -} - -LuaCEmbedResponse * lua_trim(LuaCEmbedTable *self,LuaCEmbed *args){ - - char *content = lua.args.get_str(args,0); - - if(lua.has_errors(args)){ - char *error_msg = lua.get_error_message(args); - return lua.response.send_error(error_msg); - } - - CTextStack * content_stack = stack.newStack_string(content); - stack.self_trim(content_stack); - LuaCEmbedResponse *response =lua.response.send_str(content_stack->rendered_text); - stack.free(content_stack); - return response; -} diff --git a/build/c/callbacks/algo/algo.h b/build/c/callbacks/algo/algo.h deleted file mode 100644 index 9e1d906..0000000 --- a/build/c/callbacks/algo/algo.h +++ /dev/null @@ -1,10 +0,0 @@ - -LuaCEmbedResponse * lua_get_str_size(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * lua_get_char(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * lua_index_of(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * lua_replace_string(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * lua_trim(LuaCEmbedTable *self,LuaCEmbed *args); diff --git a/build/c/callbacks/declaration.h b/build/c/callbacks/declaration.h deleted file mode 100644 index cfc6295..0000000 --- a/build/c/callbacks/declaration.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "algo/algo.h" -#include "extra/extra.h" -#include "io/io.h" \ No newline at end of file diff --git a/build/c/callbacks/definition.h b/build/c/callbacks/definition.h deleted file mode 100644 index 2206e5d..0000000 --- a/build/c/callbacks/definition.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "algo/algo.c" -#include "io/io.c" -#include "extra/extra.c" diff --git a/build/c/callbacks/extra/extra.c b/build/c/callbacks/extra/extra.c deleted file mode 100644 index a798297..0000000 --- a/build/c/callbacks/extra/extra.c +++ /dev/null @@ -1,32 +0,0 @@ - -LuaCEmbedResponse * generate_exit(LuaCEmbedTable *self,LuaCEmbed *args){ - - printf("\x1b[0m"); //ressset color - int status = lua.args.get_long(args,0); - if(lua.has_errors(args)){ - char *menssage = lua.get_error_message(args); - return lua.response.send_error(menssage); - } - lua_exit = status; - return lua.response.send_error(""); -} - -LuaCEmbedResponse * get_out_extension(LuaCEmbedTable *self,LuaCEmbed *args) -{ -#ifdef __linux__ - return lua.response.send_str("out"); -#elif _WIN32 - return lua.response.send_str("exe"); -#endif - -} - -LuaCEmbedResponse * get_time(LuaCEmbedTable *self,LuaCEmbed *args){ - struct timeval current_time; - gettimeofday(¤t_time, NULL); - char buffer[50] = {0}; - sprintf(buffer,"%ld.%ld",current_time.tv_sec,current_time.tv_usec); - double value = -1; - sscanf(buffer,"%lf",&value); - return lua.response.send_double(value); -} diff --git a/build/c/callbacks/extra/extra.h b/build/c/callbacks/extra/extra.h deleted file mode 100644 index cb07b39..0000000 --- a/build/c/callbacks/extra/extra.h +++ /dev/null @@ -1,9 +0,0 @@ - - - -LuaCEmbedResponse * generate_exit(LuaCEmbedTable *self,LuaCEmbed *args); - - -LuaCEmbedResponse * get_time(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * get_out_extension(LuaCEmbedTable *self,LuaCEmbed *args); diff --git a/build/c/callbacks/io/io.c b/build/c/callbacks/io/io.c deleted file mode 100644 index 5a88d2c..0000000 --- a/build/c/callbacks/io/io.c +++ /dev/null @@ -1,63 +0,0 @@ - -LuaCEmbedResponse * system_function_with_status(LuaCEmbedTable *self,LuaCEmbed *args){ - char *command = lua.args.get_str(args,0); - if(lua.has_errors(args)){ - char *msg = lua.get_error_message(args); - return lua.response.send_error(msg); - } - int result = system(command); - return lua.response.send_long(result); -} - -LuaCEmbedResponse *system_with_text(LuaCEmbedTable *self,LuaCEmbed *args){ - - char *comand = lua.args.get_str(args,0); - if(lua.has_errors(args)){ - char *error_msg = lua.get_error_message(args); - return lua.response.send_error(error_msg); - } - - FILE *fp = popen(comand, "r"); - if (fp == NULL) { - return lua.response.send_error("fail to run the comand"); - } - - - CTextStack *final =stack.newStack_string_empty(); - char path[1035] ={0}; - - while (fgets(path, sizeof(path), fp) != NULL) { - stack.format(final,"%s",path); - } - - /* close */ - pclose(fp); - - LuaCEmbedResponse *response = lua.response.send_raw_string(final->rendered_text,final->size); - stack.free(final); - return response; -} - -LuaCEmbedResponse *custom_print(LuaCEmbedTable *self,LuaCEmbed *args){ - - int size = lua.args.size(args); - for(int i = 0; i < size; i++){ - int type = lua.args.get_type(args,i); - if(type == lua.types.NUMBER){ - printf("%lf",lua.args.get_double(args,i)); - } - if(type == lua.types.STRING){ - printf("%s",lua.args.get_str(args,i)); - } - if(type == lua.types.BOOL){ - char *bool_str = lua.args.get_bool(args,i) ? "true":"false"; - printf("%s",bool_str); - } - - if(type == lua.types.NILL){ - printf("nil"); - } - } - return NULL; -} - diff --git a/build/c/callbacks/io/io.h b/build/c/callbacks/io/io.h deleted file mode 100644 index 7c545c3..0000000 --- a/build/c/callbacks/io/io.h +++ /dev/null @@ -1,8 +0,0 @@ - -LuaCEmbedResponse * system_function_with_status(LuaCEmbedTable *self,LuaCEmbed *args); - - -LuaCEmbedResponse *custom_print(LuaCEmbedTable *self,LuaCEmbed *args); - - -LuaCEmbedResponse *system_with_text(LuaCEmbedTable *self,LuaCEmbed *args); diff --git a/build/c/dependencies/CTextEngine/CTextArray/CTextArray.c b/build/c/dependencies/CTextEngine/CTextArray/CTextArray.c deleted file mode 100644 index 1118ec0..0000000 --- a/build/c/dependencies/CTextEngine/CTextArray/CTextArray.c +++ /dev/null @@ -1,121 +0,0 @@ - -CTextArray * newCTextArray(){ - CTextArray *self = (CTextArray*) malloc(sizeof (CTextArray)); - self->size = 0; - self->stacks = (CTextStack**) malloc(0); - return self; -} - -void CTextArray_append(CTextArray *self,CTextStack *element){ - self->stacks = (CTextStack**) realloc( - self->stacks, - (self->size+1)* sizeof (CTextStack*) - ); - - self->stacks[self->size] = element; - self->size+=1; -} - - - -void CTextArray_append_string(CTextArray *self,const char *element){ - CTextStack *new_element = newCTextStack_string(element); - CTextArray_append(self,new_element); -} - -CTextStack * CTextArray_join(CTextArray *self,const char *separator){ - CTextStack *result = newCTextStack_string_empty(); - for(int i = 0; i < self->size; i++){ - if(i < self->size -1){ - CTextStack_format(result,"%t%s",self->stacks[i],separator); - } - else{ - CTextStack_format(result,"%t",self->stacks[i]); - - } - - } - return result; -} - -CTextArray *CTextArray_split(const char *element,const char *target){ - CTextArray *self = newCTextArray(); - CTextStack *text = newCTextStack_string(element); - long target_size = (long)strlen(target); - CTextStack *acumulated = newCTextStack_string_empty(); - - for(int i = 0; i size; i++){ - CTextStack *possible_division = CTextStack_substr(text,i,target_size + i); - if(CTextStack_equal(possible_division,target)){ - CTextArray_append(self,acumulated); - acumulated = newCTextStack_string_empty(); - CTextStack_free(possible_division); - continue; - } - CTextStack_free(possible_division); - - CTextStack_format(acumulated,"%c",text->rendered_text[i]); - } - - CTextArray_append(self,acumulated); - CTextStack_free(text); - return self; -} - -bool CTextStack_equal(struct CTextStack *self,const char *element){ - return strcmp(self->rendered_text,element) == 0; -} - - -void CTextArray_free(CTextArray *self){ - for(int i = 0; i < self->size; i++){ - CTextStack_free(self->stacks[i]); - } - free(self->stacks); - free(self); -} - -CTextArray * CTextArray_map(CTextArray *self, CTextStack *(caller)(CTextStack* element)){ - CTextArray *new_array = newCTextArray(); - for(int i = 0; i < self->size; i++){ - CTextStack *result = caller(self->stacks[i]); - CTextArray_append(new_array,result); - } - return new_array; -} - - -CTextArray * CTextArray_filter(CTextArray *self, bool (caller)(CTextStack* element)){ - CTextArray *new_array = newCTextArray(); - - for(int i = 0; i < self->size; i++){ - if(caller(self->stacks[i])){ - - CTextArray_append(new_array, CTextStack_clone(self->stacks[i])); - } - } - - return new_array; -} - -void CTextArray_foreach(CTextArray *self, void (*caller)(CTextStack* element)){ - for(int i = 0; i < self->size; i++){ - caller(self->stacks[i]); - } -} - -bool CTextArray_includes(CTextArray *self,const char *element){ - for(int i = 0 ; i < self->size;i++){ - if(CTextStack_equal(self->stacks[i],element)){ - return true; - } - } - return false; -} - - -void CTextArray_represent(CTextArray *self){ - for(int i =0; i < self->size; i++){ - CTextStack_represent(self->stacks[i]); - } -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/CTextArray/CTextArray.h b/build/c/dependencies/CTextEngine/CTextArray/CTextArray.h deleted file mode 100644 index b4501f3..0000000 --- a/build/c/dependencies/CTextEngine/CTextArray/CTextArray.h +++ /dev/null @@ -1,33 +0,0 @@ - - -typedef struct CTextArray{ - - CTextStack **stacks; - long size; - - -}CTextArray; - -CTextArray * newCTextArray(); - - -void CTextArray_append(CTextArray *self,CTextStack *element); - - -void CTextArray_append_string(CTextArray *self,const char *element); - -CTextStack * CTextArray_join(CTextArray *self,const char *separator); - -CTextArray * CTextArray_split(const char *element,const char *target); - -CTextArray * CTextArray_map(CTextArray *self, CTextStack *(caller)(CTextStack* element)); - -CTextArray * CTextArray_filter(CTextArray *self, bool (caller)(CTextStack* element)); - -void CTextArray_foreach(CTextArray *self, void (*caller)(CTextStack* element)); - -bool CTextArray_includes(CTextArray *self,const char *element); - -void CTextArray_free(CTextArray *self); - -void CTextArray_represent(CTextArray *self); diff --git a/build/c/dependencies/CTextEngine/CTextEngineMain.h b/build/c/dependencies/CTextEngine/CTextEngineMain.h deleted file mode 100644 index e947931..0000000 --- a/build/c/dependencies/CTextEngine/CTextEngineMain.h +++ /dev/null @@ -1,30 +0,0 @@ -/* -MIT License - -Copyright (c) 2023 OUI - -Permission is hereby granted, free of charge, to any person obtaining a copy -of this software and associated documentation files (the "Software"), to deal -in the Software without restriction, including without limitation the rights -to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -copies of the Software, and to permit persons to whom the Software is -furnished to do so, subject to the following conditions: - -The above copyright notice and this permission notice shall be included in all -copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE -SOFTWARE. -*/ -#ifndef CTEXTENGINE_H -#define CTEXTENGINE_H - -#include "declaration.h" -#include "definition.h" - -#endif // CTEXTENGINE_H \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/CTextNamespace/CTexStackModule/CTextStackModule.c b/build/c/dependencies/CTextEngine/CTextNamespace/CTexStackModule/CTextStackModule.c deleted file mode 100644 index 7b74815..0000000 --- a/build/c/dependencies/CTextEngine/CTextNamespace/CTexStackModule/CTextStackModule.c +++ /dev/null @@ -1,76 +0,0 @@ - -CTextStackModule newCTextStackModule(){ - struct CTextStackModule self = {0}; - self.newStack = newCTextStack; - self.newStack_string = newCTextStack_string; - self.newStack_string_format = newCTextStack_string_format; - self.newStack_string_empty = newCTextStack_string_empty; - self.newStack_string_getting_ownership = newCTextStack_string_getting_ownership; - self.text = CTextStack_text; - self.segment_text = CTextStack_segment_text; - self.format = CTextStack_format; - self.segment = CTextStack_segment; - self.segment_format = CTextStack_segment_format; - self.$open = CTextStack_$open; - self.only$open =CTextStack_only$open; - self.auto$close = CTextStack_auto$close; - self.open = ctext_open; - self.close = ctext_close; - self.free = CTextStack_free; - self.clone = CTextStack_clone; - self.represent = CTextStack_represent; - self.self_transform_in_string_and_self_clear = CTextStack_self_transform_in_string_and_self_clear; - self.restart = CTextStack_restart; - self.substr = CTextStack_substr; - self.self_substr =CTextStack_self_substr; - - self.pop = CTextStack_pop; - self.self_pop =CTextStack_self_pop; - - self.replace = CTextStack_replace; - self.self_replace = CTextStack_self_replace; - - self.replace_long = CTextStack_replace_long; - self.self_replace_long =CTextStack_self_replace_long; - - - self.replace_double = CTextStack_replace_double; - self.self_replace_double =CTextStack_self_replace_double; - - self.insert_at = CTextStack_insert_at; - self.self_insert_at = CTextStack_self_insert_at; - - - self.index_of = CTextStack_index_of; - self.index_of_char = CTextStack_index_of_char; - - self.lower = CTextStack_lower; - self.self_lower = CTextStack_self_lower; - - self.upper = CTextStack_upper; - self.self_upper = CTextStack_self_upper; - - self.captalize = CTextStack_captalize; - self.self_captalize = CTextStack_self_captalize; - - self.starts_with = CTextStack_starts_with; - self.ends_with = CTextStack_ends_with; - - self.equal = CTextStack_equal; - self.reverse = CTextStack_reverse; - self.self_reverse = CTextStack_self_reverse; - - - self.typeof_element = CTextStack_typeof; - self.is_a_num = CTextStack_is_a_num; - self.typeof_in_str = CTextStack_typeof_in_str; - self.parse_to_bool = CTextStack_parse_to_bool; - self.parse_to_integer = CTextStack_parse_to_integer; - self.parse_to_double = CTextStack_parse_to_double; - - self.trim = CTextStack_trim; - self.self_trim = CTextStack_self_trim; - - - return self; -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/CTextNamespace/CTexStackModule/CTextStackModule.h b/build/c/dependencies/CTextEngine/CTextNamespace/CTexStackModule/CTextStackModule.h deleted file mode 100644 index 5515c17..0000000 --- a/build/c/dependencies/CTextEngine/CTextNamespace/CTexStackModule/CTextStackModule.h +++ /dev/null @@ -1,97 +0,0 @@ - - -typedef struct CTextStackModule{ - - //admnistrative methods - CTextStack *(*newStack)(const char *line_breaker, const char *separator); - CTextStack *(*newStack_string)(const char *starter); - CTextStack *(*newStack_string_format)(const char *format, ...); - - CTextStack *(*newStack_string_getting_ownership)(const char *starter); - CTextStack *(*newStack_string_empty)(); - - void (*free)(struct CTextStack *self); - struct CTextStack *(*clone)(struct CTextStack *self); - void (*represent)(struct CTextStack *self); - char *(*self_transform_in_string_and_self_clear)(struct CTextStack *self); - void (*restart)(struct CTextStack *self); - - //render methods - void (*text)(struct CTextStack *self, const char *element); - - void (*segment_text)(struct CTextStack *self, const char *element); - - void (*format)(struct CTextStack *self, const char *format, ...); - - void (*segment)(struct CTextStack *self); - - void (*segment_format)(struct CTextStack *self, const char *format, ...); - - void (*$open)(struct CTextStack *self, const char *tag, const char *format,...); - - void (*only$open)(struct CTextStack *self, const char *tag, const char *format,...); - - void (*auto$close)(struct CTextStack *self, const char *tag, const char *format,...); - - void (*open)(struct CTextStack *self, const char *tag); - - void (*close)(struct CTextStack *self, const char *tag); - - - //algorithm methods - struct CTextStack * (*substr)(struct CTextStack *self, long starter, long end); - void (*self_substr)(struct CTextStack *self, long starter, long end); - - - struct CTextStack *(*pop)(struct CTextStack *self, long starter, long end); - void(*self_pop)(struct CTextStack *self, long starter, long end); - - - - struct CTextStack *(*insert_at)(struct CTextStack *self,long point, const char *element); - void (*self_insert_at)(struct CTextStack *self,long point, const char *element); - - struct CTextStack *(*replace)(struct CTextStack *self,const char *element, const char *element_to_replace); - void (*self_replace)(struct CTextStack *self,const char *element, const char *element_to_replace); - - - struct CTextStack *(*replace_long)(struct CTextStack *self,const char *element, long element_to_replace); - void(*self_replace_long)(struct CTextStack *self,const char *element, long element_to_replace); - - - struct CTextStack *(*replace_double)(struct CTextStack *self,const char *element, double element_to_replace); - void (*self_replace_double)(struct CTextStack *self,const char *element, double element_to_replace); - - - struct CTextStack * (*lower)(struct CTextStack *self); - void(*self_lower)(struct CTextStack *self); - - struct CTextStack * (*upper)(struct CTextStack *self); - void(*self_upper)(struct CTextStack *self); - - struct CTextStack *(*captalize)(struct CTextStack *self); - void (*self_captalize)(struct CTextStack *self); - - struct CTextStack * (*reverse)(struct CTextStack *self); - void(*self_reverse)(struct CTextStack *self); - - struct CTextStack * (*trim)(struct CTextStack *self); - void(*self_trim)(struct CTextStack *self); - - bool (*starts_with)(struct CTextStack *self, const char *element); - bool (*ends_with)(struct CTextStack *self, const char *element); - - bool (*equal)(struct CTextStack *self,const char *element); - int (*typeof_element)(struct CTextStack *self); - bool (*is_a_num)(struct CTextStack *self); - - const char * (*typeof_in_str)(struct CTextStack *self); - bool (*parse_to_bool)(struct CTextStack *self); - long (*parse_to_integer)(struct CTextStack *self); - double (*parse_to_double)(struct CTextStack *self); - - long (*index_of)(struct CTextStack *self, const char *element); - long (*index_of_char)(struct CTextStack *self, char element); -}CTextStackModule; - -CTextStackModule newCTextStackModule(); \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/CTextNamespace/CTextArrayModule/CTextArrayModule.c b/build/c/dependencies/CTextEngine/CTextNamespace/CTextArrayModule/CTextArrayModule.c deleted file mode 100644 index 1b9fa32..0000000 --- a/build/c/dependencies/CTextEngine/CTextNamespace/CTextArrayModule/CTextArrayModule.c +++ /dev/null @@ -1,16 +0,0 @@ - - -CTextArrayModule newCTextArrayModule(){ - CTextArrayModule module = {0}; - module.newArray = newCTextArray; - module.append = CTextArray_append; - module.append_string = CTextArray_append_string; - module.join = CTextArray_join; - module.map = CTextArray_map; - module.filter = CTextArray_filter; - module.foreach = CTextArray_foreach; - module.represent = CTextArray_represent; - module.includes = CTextArray_includes; - module.free = CTextArray_free; - return module; -} diff --git a/build/c/dependencies/CTextEngine/CTextNamespace/CTextArrayModule/CTextArrayModule.h b/build/c/dependencies/CTextEngine/CTextNamespace/CTextArrayModule/CTextArrayModule.h deleted file mode 100644 index 1f91215..0000000 --- a/build/c/dependencies/CTextEngine/CTextNamespace/CTextArrayModule/CTextArrayModule.h +++ /dev/null @@ -1,17 +0,0 @@ - -typedef struct CTextArrayModule{ - CTextArray *(*newArray)(); - void (*append)(CTextArray *self,CTextStack *element); - void (*append_string)(CTextArray *self,const char *element); - CTextStack * (*join)(CTextArray *self,const char *separator); - - CTextArray * (*map)(CTextArray *self, CTextStack *(caller)(CTextStack* element)); - CTextArray * (*filter)(CTextArray *self, bool (caller)(CTextStack* element)); - void (*foreach)(CTextArray *self, void (*caller)(CTextStack* element)); - bool (*includes)(CTextArray *self,const char *element); - void (*represent)(CTextArray *self); - void (*free)(CTextArray *self); - -}CTextArrayModule; - -CTextArrayModule newCTextArrayModule(); \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/CTextNamespace/CTextNamespace/CTextNamespace.c b/build/c/dependencies/CTextEngine/CTextNamespace/CTextNamespace/CTextNamespace.c deleted file mode 100644 index 0446825..0000000 --- a/build/c/dependencies/CTextEngine/CTextNamespace/CTextNamespace/CTextNamespace.c +++ /dev/null @@ -1,8 +0,0 @@ - - -CTextNamespace newCTextNamespace(){ - CTextNamespace self = {0}; - self.stack = newCTextStackModule(); - self.array = newCTextArrayModule(); - return self; -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/CTextNamespace/CTextNamespace/CTextNamespace.h b/build/c/dependencies/CTextEngine/CTextNamespace/CTextNamespace/CTextNamespace.h deleted file mode 100644 index 35aabac..0000000 --- a/build/c/dependencies/CTextEngine/CTextNamespace/CTextNamespace/CTextNamespace.h +++ /dev/null @@ -1,10 +0,0 @@ - - -typedef struct CTextNamespace{ - - CTextArrayModule array; - CTextStackModule stack; - -}CTextNamespace; - -CTextNamespace newCTextNamespace(); \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/CTextNamespace/declaration.h b/build/c/dependencies/CTextEngine/CTextNamespace/declaration.h deleted file mode 100644 index a2f9865..0000000 --- a/build/c/dependencies/CTextEngine/CTextNamespace/declaration.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "CTexStackModule/CTextStackModule.h" -#include "CTextArrayModule/CTextArrayModule.h" -#include "CTextNamespace/CTextNamespace.h" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/CTextNamespace/definition.h b/build/c/dependencies/CTextEngine/CTextNamespace/definition.h deleted file mode 100644 index bd58174..0000000 --- a/build/c/dependencies/CTextEngine/CTextNamespace/definition.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "CTexStackModule/CTextStackModule.c" -#include "CTextArrayModule/CTextArrayModule.c" -#include "CTextNamespace/CTextNamespace.c" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/CTextStack/CTextStack.h b/build/c/dependencies/CTextEngine/CTextStack/CTextStack.h deleted file mode 100644 index 09f623c..0000000 --- a/build/c/dependencies/CTextEngine/CTextStack/CTextStack.h +++ /dev/null @@ -1,143 +0,0 @@ - - -#define CTEXT_LINE_BREAKER "\n" -#define CTEXT_SEPARATOR " " - -#define CTEXT_LONG 1 -#define CTEXT_DOUBLE 2 -#define CTEXT_BOOL 3 -#define CTEXT_STRING 4 - -typedef struct CTextStack{ - - char *rendered_text; - size_t rendered_text_alocation_size; - size_t size; - - char *line_breaker; - char *separator; - int ident_level; - -}CTextStack; - -struct CTextStack *newCTextStack(const char *line_breaker, const char *separator); - - -struct CTextStack *newCTextStack_string(const char *starter); - -struct CTextStack *newCTextStack_string_format(const char *format, ...); - -struct CTextStack *newCTextStack_string_getting_ownership(const char *starter); - -struct CTextStack *newCTextStack_string_empty(); - - -void CTextStack_text(struct CTextStack *self, const char *text); - - -void private_ctext_text_double_size_if_reachs(struct CTextStack *self); - - -void CTextStack_segment_text(struct CTextStack *self, const char *text); - - -void CTextStack_segment(struct CTextStack *self); - - -void CTextStack_$open(struct CTextStack *self, const char *tag, const char *format, ...); - - - -void CTextStack_only$open(struct CTextStack *self, const char *tag, const char *format, ...); - - -void CTextStack_auto$close(struct CTextStack *self, const char *tag, const char *format, ...); - - -void CTextStack_format(struct CTextStack *self, const char *format, ...); - - -void CTextStack_segment_format(struct CTextStack *self, const char *format, ...); - - -void ctext_open(struct CTextStack *self, const char *tag); - - - -void ctext_close(struct CTextStack *self, const char *tag); - -void CTextStack_represent(struct CTextStack *self); -void CTextStack_free(struct CTextStack *self); - - -struct CTextStack * CTextStack_clone(struct CTextStack *self); - - -char * CTextStack_self_transform_in_string_and_self_clear(struct CTextStack *self); - -void private_CTextStack_parse_ownership(struct CTextStack *self, struct CTextStack *new_string); - - -void CTextStack_restart(struct CTextStack *self); - - -//algorithm methods - -struct CTextStack *CTextStack_substr(struct CTextStack *self, long starter, long end); -void CTextStack_self_substr(struct CTextStack *self, long starter, long end); - - -struct CTextStack *CTextStack_pop(struct CTextStack *self, long starter, long end); -void CTextStack_self_pop(struct CTextStack *self, long starter, long end); - - -struct CTextStack *CTextStack_replace(struct CTextStack *self,const char *element, const char *element_to_replace); -void CTextStack_self_replace(struct CTextStack *self,const char *element, const char *element_to_replace); - - -struct CTextStack *CTextStack_replace_long(struct CTextStack *self,const char *element, long element_to_replace); -void CTextStack_self_replace_long(struct CTextStack *self,const char *element, long element_to_replace); - -struct CTextStack *CTextStack_replace_double(struct CTextStack *self,const char *element, double element_to_replace); -void CTextStack_self_replace_double(struct CTextStack *self,const char *element, double element_to_replace); - - -struct CTextStack *CTextStack_insert_at(struct CTextStack *self,long point, const char *element); -void CTextStack_self_insert_at(struct CTextStack *self,long point, const char *element); - - -long CTextStack_index_of_char(struct CTextStack *self, char element); -long CTextStack_index_of(struct CTextStack *self, const char *element); - -bool CTextStack_starts_with(struct CTextStack *self, const char *element); -bool CTextStack_ends_with(struct CTextStack *self, const char *element); - -bool CTextStack_equal(struct CTextStack *self,const char *element); - -struct CTextStack *CTextStack_trim(struct CTextStack *self); -void CTextStack_self_trim(struct CTextStack *self); - -struct CTextStack *CTextStack_lower(struct CTextStack *self); -void CTextStack_self_lower(struct CTextStack *self); - -struct CTextStack *CTextStack_captalize(struct CTextStack *self); -void CTextStack_self_captalize(struct CTextStack *self); - -struct CTextStack *CTextStack_upper(struct CTextStack *self); -void CTextStack_self_upper(struct CTextStack *self); - -int CTextStack_typeof(struct CTextStack *self); - -bool CTextStack_is_a_num(struct CTextStack *self); - - -const char * CTextStack_typeof_in_str(struct CTextStack *self); -bool CTextStack_parse_to_bool(struct CTextStack *self); -long CTextStack_parse_to_integer(struct CTextStack *self); -double CTextStack_parse_to_double(struct CTextStack *self); - - -struct CTextStack *CTextStack_reverse(struct CTextStack *self); -void CTextStack_self_reverse(struct CTextStack *self); - - diff --git a/build/c/dependencies/CTextEngine/CTextStack/admnistrative_methods.c b/build/c/dependencies/CTextEngine/CTextStack/admnistrative_methods.c deleted file mode 100644 index e739e11..0000000 --- a/build/c/dependencies/CTextEngine/CTextStack/admnistrative_methods.c +++ /dev/null @@ -1,59 +0,0 @@ - - - - - - - -char * CTextStack_self_transform_in_string_and_self_clear(struct CTextStack *self){ - free(self->line_breaker); - free(self->separator); - char *result = self->rendered_text; - free(self); - return result; -} - -void private_CTextStack_parse_ownership(struct CTextStack *self, struct CTextStack *new_stack){ - - free(self->line_breaker); - free(self->separator); - free(self->rendered_text); - - self->rendered_text_alocation_size = new_stack->rendered_text_alocation_size; - self->size = new_stack->size; - self->ident_level = new_stack->ident_level; - - - self->line_breaker = new_stack->line_breaker; - self->separator = new_stack->separator; - self->rendered_text = new_stack->rendered_text; - free(new_stack); - -} -void CTextStack_restart(struct CTextStack *self){ - free(self->rendered_text); - self->rendered_text = (char*)malloc(2); - strcpy(self->rendered_text,"\0"); - self->rendered_text_alocation_size = 2; - self->size = 0; - self->ident_level = 0; -} - -void CTextStack_represent(struct CTextStack *self){ - printf("%s\n",self->rendered_text); -} - - -void CTextStack_free(struct CTextStack *self){ - free(self->line_breaker); - free(self->separator); - free(self->rendered_text); - free(self); -} - -struct CTextStack * CTextStack_clone(struct CTextStack *self){ - CTextStack *new_stack = newCTextStack(self->line_breaker,self->separator); - new_stack->ident_level = self->ident_level; - CTextStack_text(new_stack,self->rendered_text); - return new_stack; -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/CTextStack/algo_methods.c b/build/c/dependencies/CTextEngine/CTextStack/algo_methods.c deleted file mode 100644 index af647b8..0000000 --- a/build/c/dependencies/CTextEngine/CTextStack/algo_methods.c +++ /dev/null @@ -1,295 +0,0 @@ - - - -struct CTextStack * CTextStack_substr(struct CTextStack *self, long starter, long end){ - - CTextStack *new_element = newCTextStack(self->line_breaker,self->separator); - new_element->ident_level = self->ident_level; - long formated_starter = private_CText_transform_index(self->size, starter); - long formated_end = private_CText_transform_index(self->size, end); - - if(formated_starter == formated_end){ - CTextStack_format(new_element,"%c",self->rendered_text[formated_starter]); - return new_element; - } - - for(long i =formated_starter; i < formated_end; i++){ - CTextStack_format(new_element,"%c",self->rendered_text[i]); - } - - return new_element; - -} - -void CTextStack_self_substr(struct CTextStack *self, long starter, long end){ - CTextStack *new_stack = CTextStack_substr(self,starter,end); - private_CTextStack_parse_ownership(self,new_stack); - -} - - -struct CTextStack *CTextStack_replace(struct CTextStack *self,const char *element, const char *element_to_replace){ - - CTextStack *new_element = newCTextStack(self->line_breaker,self->separator); - new_element->ident_level = self->ident_level; - - long element_size = (long)strlen(element); - for(long i = 0; i < self->size;i++){ - CTextStack *possible_ocurrence = CTextStack_substr(self,i,i+element_size); - - if(strcmp(possible_ocurrence->rendered_text,element)== 0){ - CTextStack_text(new_element,element_to_replace); - i+=element_size -1; - } - - else{ - CTextStack_format(new_element,"%c",self->rendered_text[i]); - } - - CTextStack_free(possible_ocurrence); - - } - return new_element; -} - -void CTextStack_self_replace(struct CTextStack *self,const char *element, const char *element_to_replace){ - CTextStack *new_stack = CTextStack_replace(self,element,element_to_replace); - private_CTextStack_parse_ownership(self,new_stack); -} - - -struct CTextStack *CTextStack_replace_long(struct CTextStack *self,const char *element, long element_to_replace){ - char num_conversion[20] = {0}; - sprintf(num_conversion,"%ld",element_to_replace); - return CTextStack_replace(self,element,num_conversion); -} - - -void CTextStack_self_replace_long(struct CTextStack *self,const char *element, long element_to_replace){ - CTextStack *new_stack = CTextStack_replace_long(self,element,element_to_replace); - private_CTextStack_parse_ownership(self,new_stack); -} - - -struct CTextStack *CTextStack_replace_double(struct CTextStack *self,const char *element, double element_to_replace){ - CTextStack *num_formated = newCTextStack_string_empty(); - CTextStack_format(num_formated,"%f",element_to_replace); - CTextStack *result = CTextStack_replace(self,element,num_formated->rendered_text); - CTextStack_free(num_formated); - return result; -} - - -void CTextStack_self_replace_double(struct CTextStack *self,const char *element, double element_to_replace){ - CTextStack *new_stack = CTextStack_replace_double(self,element,element_to_replace); - private_CTextStack_parse_ownership(self,new_stack); -} - - - -long CTextStack_index_of(struct CTextStack *self, const char *element){ - long element_size = (long)strlen(element); - for(int i = 0; i < self->size; i++){ - CTextStack *possible_element = CTextStack_substr(self,i,i+element_size); - if(strcmp(possible_element->rendered_text,element) == 0){ - CTextStack_free(possible_element); - return i; - } - CTextStack_free(possible_element); - - } - return -1; -} - - -long CTextStack_index_of_char(struct CTextStack *self, char element){ - for(int i = 0; i < self->size; i++) { - if(self->rendered_text[i] == element){ - return i; - } - } - return -1; -} -bool CTextStack_starts_with(struct CTextStack *self, const char *element){ - long element_size = strlen(element); - CTextStack *separated = CTextStack_substr(self,0,element_size); - if(strcmp(separated->rendered_text,element) == 0){ - CTextStack_free(separated); - return true; - } - CTextStack_free(separated); - return false; -} - -bool CTextStack_ends_with(struct CTextStack *self, const char *element){ - long element_size = strlen(element); - CTextStack *separated = CTextStack_substr(self,self->size -element_size,-1); - - if(strcmp(separated->rendered_text,element) == 0){ - CTextStack_free(separated); - return true; - } - CTextStack_free(separated); - return false; -} - - - -struct CTextStack *CTextStack_lower(struct CTextStack *self){ - CTextStack *new_element = newCTextStack(self->line_breaker,self->separator); - new_element->ident_level = self->ident_level; - for(long i =0; i < self->size; i++){ - char current = self->rendered_text[i]; - CTextStack_format(new_element,"%c",tolower(current)); - } - return new_element; -} - -void CTextStack_self_lower(struct CTextStack *self){ - CTextStack *new_stack = CTextStack_lower(self); - private_CTextStack_parse_ownership(self,new_stack); -} - -struct CTextStack *CTextStack_upper(struct CTextStack *self){ - CTextStack *new_element = newCTextStack(self->line_breaker,self->separator); - new_element->ident_level = self->ident_level; - for(long i =0; i < self->size; i++){ - char current = self->rendered_text[i]; - CTextStack_format(new_element,"%c",toupper(current)); - } - return new_element; -} - -struct CTextStack *CTextStack_captalize(struct CTextStack *self){ - CTextStack *new_element = newCTextStack(self->line_breaker,self->separator); - new_element->ident_level = self->ident_level; - if(self->size ==0){ - return new_element; - } - - CTextStack_format(new_element,"%c", toupper(self->rendered_text[0])); - - for(long i =1; i < self->size; i++){ - char last = self->rendered_text[i-1]; - char current = self->rendered_text[i]; - - - if(last == ' '){ - CTextStack_format(new_element,"%c",toupper(current)); - } - else{ - CTextStack_format(new_element,"%c", tolower(current)); - - } - - } - return new_element; -} - -void CTextStack_self_captalize(struct CTextStack *self){ - CTextStack *new_stack = CTextStack_captalize(self); - private_CTextStack_parse_ownership(self,new_stack); -} - - -void CTextStack_self_upper(struct CTextStack *self){ - CTextStack *new_stack = CTextStack_upper(self); - private_CTextStack_parse_ownership(self,new_stack); -} - - -struct CTextStack *CTextStack_reverse(struct CTextStack *self){ - CTextStack *new_element = newCTextStack(self->line_breaker,self->separator); - new_element->ident_level = self->ident_level; - for(long i = (long)self->size; i >= 0 ; i--){ - CTextStack_format(new_element,"%c",self->rendered_text[i]); - } - return new_element; - -} - -void CTextStack_self_reverse(struct CTextStack *self){ - CTextStack *new_stack = CTextStack_reverse(self); - private_CTextStack_parse_ownership(self,new_stack); -} - - - -struct CTextStack *CTextStack_pop(struct CTextStack *self, long starter, long end){ - CTextStack *new_element = newCTextStack(self->line_breaker,self->separator); - new_element->ident_level = self->ident_level; - long formated_starter = private_CText_transform_index(self->size, starter); - long formated_end = private_CText_transform_index(self->size, end); - - for(int i =0; i < self->size; i ++){ - if(i >= formated_starter && i <= formated_end){ - continue; - } - CTextStack_format(new_element,"%c",self->rendered_text[i]); - } - return new_element; -} - - -void CTextStack_self_pop(struct CTextStack *self, long starter, long end){ - CTextStack *new_stack = CTextStack_pop(self, starter, end); - private_CTextStack_parse_ownership(self,new_stack); -} - - -struct CTextStack *CTextStack_insert_at(struct CTextStack *self,long point, const char *element){ - - CTextStack *new_element = newCTextStack(self->line_breaker,self->separator); - new_element->ident_level = self->ident_level; - - long converted_point = private_CText_transform_index(self->size, point); - for(long i = 0; i < converted_point; i++){ - CTextStack_format(new_element,"%c",self->rendered_text[i]); - } - CTextStack_text(new_element,element); - for(long i = converted_point; i < self->size; i++){ - CTextStack_format(new_element,"%c",self->rendered_text[i]); - } - return new_element; -} - -void CTextStack_self_insert_at(struct CTextStack *self,long point, const char *element){ - CTextStack *new_stack = CTextStack_insert_at(self, point,element); - private_CTextStack_parse_ownership(self,new_stack); -} - - -struct CTextStack *CTextStack_trim(struct CTextStack *self){ - - CTextStack *invalid_elements = newCTextStack_string("\t\r\n "); - long start_point = 0; - for(int i = 0; i < self->size; i ++){ - char current_char =self->rendered_text[i]; - long invalid_point = CTextStack_index_of_char(invalid_elements, current_char); - bool is_invalid = invalid_point != -1; - if(!is_invalid){ - start_point = i; - break; - } - } - long end_point = -1; - for(long i = (long)self->size -1; i >= 0; i--){ - - char current_char =self->rendered_text[i]; - long invalid_point = CTextStack_index_of_char(invalid_elements, current_char); - bool is_invalid = invalid_point != -1; - if(!is_invalid){ - end_point = i+1; - break; - } - } - CTextStack_free(invalid_elements); - return CTextStack_substr(self,start_point,end_point); - -} - - -void CTextStack_self_trim(struct CTextStack *self){ - CTextStack *new_stack = CTextStack_trim(self); - private_CTextStack_parse_ownership(self,new_stack); -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/CTextStack/constructors.c b/build/c/dependencies/CTextEngine/CTextStack/constructors.c deleted file mode 100644 index 965026a..0000000 --- a/build/c/dependencies/CTextEngine/CTextStack/constructors.c +++ /dev/null @@ -1,46 +0,0 @@ -// -// Created by jurandi on 14-06-2023. -// -struct CTextStack * newCTextStack(const char *line_breaker, const char *separator){ - struct CTextStack *self = (struct CTextStack*)malloc(sizeof(struct CTextStack)); - *self = (CTextStack){0}; - self->rendered_text = (char*)malloc(2); - strcpy(self->rendered_text,"\0"); - self->rendered_text_alocation_size = 2; - - self->line_breaker = strdup(line_breaker); - self->separator = strdup(separator); - - - return self; -} - -struct CTextStack *newCTextStack_string(const char *starter){ - CTextStack *self = newCTextStack("",""); - if(starter){ - CTextStack_format(self,"%s", starter); - } - return self; -} - -struct CTextStack *newCTextStack_string_format(const char *format, ...){ - CTextStack *self = newCTextStack("",""); - va_list argptr; - va_start(argptr, format); - private_ctext_generate_formated_text(self,format,argptr); - va_end(argptr); - - return self; -} - -struct CTextStack *newCTextStack_string_getting_ownership(const char *starter){ - CTextStack *self = newCTextStack("",""); - free(self->rendered_text); - self->rendered_text = (char*)starter; - self->size = strlen(starter); - self->rendered_text_alocation_size = self->size; - return self; -} -struct CTextStack *newCTextStack_string_empty(){ - return newCTextStack("",""); -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/CTextStack/parsers.c b/build/c/dependencies/CTextEngine/CTextStack/parsers.c deleted file mode 100644 index 751938c..0000000 --- a/build/c/dependencies/CTextEngine/CTextStack/parsers.c +++ /dev/null @@ -1,79 +0,0 @@ - -int CTextStack_typeof(struct CTextStack *self){ - if(self->size == 0){ - return CTEXT_STRING; - } - - if(CTextStack_equal(self,"true") ||CTextStack_equal(self,"false") ){ - return CTEXT_BOOL; - } - - double data; - int result = sscanf(self->rendered_text,"%lf",&data); - if(!result){ - return CTEXT_STRING; - } - if(CTextStack_index_of(self,".") == -1){ - return CTEXT_LONG; - } - return CTEXT_DOUBLE; - - -} -bool CTextStack_is_a_num(struct CTextStack *self){ - int type = CTextStack_typeof(self); - if(type == CTEXT_DOUBLE || type == CTEXT_LONG){ - return true; - } - return false; -} - - -const char * CTextStack_typeof_in_str(struct CTextStack *self){ - int current_type = CTextStack_typeof(self); - - if(current_type == CTEXT_BOOL){ - return "bool"; - } - - else if(current_type == CTEXT_STRING){ - return "string"; - } - - else if(current_type == CTEXT_LONG){ - return "long"; - } - - else if(current_type == CTEXT_DOUBLE){ - return "double"; - } - - else{ - return "invalid"; - } -} - -bool CTextStack_parse_to_bool(struct CTextStack *self){ - if(CTextStack_equal(self,"true")){ - return true; - } - return false; -} - -long CTextStack_parse_to_integer(struct CTextStack *self){ - long value; - int result = sscanf(self->rendered_text,"%ld",&value); - if(!result){ - return -1; - } - return value; -} - -double CTextStack_parse_to_double(struct CTextStack *self){ - double value; - int result = sscanf(self->rendered_text,"%lf",&value); - if(!result){ - return -1; - } - return value; -} diff --git a/build/c/dependencies/CTextEngine/CTextStack/render_methods.c b/build/c/dependencies/CTextEngine/CTextStack/render_methods.c deleted file mode 100644 index 706df51..0000000 --- a/build/c/dependencies/CTextEngine/CTextStack/render_methods.c +++ /dev/null @@ -1,160 +0,0 @@ - -void private_ctext_text_double_size_if_reachs(struct CTextStack *self){ - - while(self->size >= (self->rendered_text_alocation_size - 2)){ - self->rendered_text_alocation_size = (self->rendered_text_alocation_size * 2)+2; - self->rendered_text = (char*)(realloc( - self->rendered_text,self->rendered_text_alocation_size - )); - } -} - -void CTextStack_text(struct CTextStack *self, const char *text){ - - if (!text || !text[0]) { - // Tratar caso de ponteiro nulo ou string vazia - return; - } - - size_t text_size = strlen(text); - - self->size += text_size; - private_ctext_text_double_size_if_reachs(self); - - memcpy( - self->rendered_text + self->size - text_size, - text, - text_size - ); - self->rendered_text[self->size] = '\0'; -} - - - -void CTextStack_segment_text(struct CTextStack *self, const char *text){ - CTextStack_segment(self); - CTextStack_text(self,text); -} - - -void CTextStack_format(struct CTextStack *self, const char *format, ...){ - va_list argptr; - va_start(argptr, format); - private_ctext_generate_formated_text(self,format,argptr); - va_end(argptr); - -} - -void CTextStack_segment_format(struct CTextStack *self, const char *format, ...){ - CTextStack_segment(self); - va_list argptr; - va_start(argptr, format); - private_ctext_generate_formated_text(self,format,argptr); - va_end(argptr); - -} - - -void CTextStack_segment(struct CTextStack *self){ - - CTextStack_text(self,self->line_breaker); - - for(int i=0;iident_level;i++){ - CTextStack_text(self,self->separator); - - } - - -} - -void CTextStack_$open(struct CTextStack *self, const char *tag, const char *format, ...){ - CTextStack_segment(self); - CTextStack_format(self, "%c",'<'); - CTextStack_text(self,tag); - - - if(format!=NULL){ - CTextStack_format(self, "%c",' '); - - va_list argptr; - va_start(argptr, format); - private_ctext_generate_formated_text(self,format,argptr); - va_end(argptr); - - } - CTextStack_format(self, "%c",'>'); - - - self->ident_level += 1; -} - - - -void CTextStack_only$open(struct CTextStack *self, const char *tag, const char *format, ...){ - CTextStack_segment(self); - CTextStack_format(self, "%c",'<'); - - CTextStack_text(self,tag); - - - if(format!=NULL){ - CTextStack_format(self, "%c",' '); - va_list argptr; - va_start(argptr, format); - private_ctext_generate_formated_text(self,format,argptr); - va_end(argptr); - - } - CTextStack_format(self, "%c",'>'); - - -} - -void CTextStack_auto$close(struct CTextStack *self, const char *tag, const char *format, ...){ - CTextStack_segment(self); - CTextStack_format(self, "%c",'<'); - - CTextStack_text(self,tag); - - - if(format!=NULL){ - CTextStack_format(self, "%c",' '); - - va_list argptr; - va_start(argptr, format); - private_ctext_generate_formated_text(self,format,argptr); - va_end(argptr); - } - CTextStack_text(self,"/>"); - -} - -void ctext_open(struct CTextStack *self, const char *tag){ - if(tag == NULL){ - - self->ident_level += 1; - return; - } - CTextStack_$open(self, tag, NULL); -} - - - -void ctext_close(struct CTextStack *self, const char *tag){ - - if(tag==NULL){ - self->ident_level -= 1; - - return; - } - self->ident_level -= 1; - CTextStack_segment(self); - - - CTextStack_text(self,"'); - -} - - diff --git a/build/c/dependencies/CTextEngine/constants.h b/build/c/dependencies/CTextEngine/constants.h deleted file mode 100644 index 6cc8c76..0000000 --- a/build/c/dependencies/CTextEngine/constants.h +++ /dev/null @@ -1,4 +0,0 @@ - -#define CTEXT_BY_OWNESHIP 1 -#define CTEXT_BY_COPY 2 -#define CTEXT_BY_REFERENCE 3 \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/declaration.h b/build/c/dependencies/CTextEngine/declaration.h deleted file mode 100644 index 0cd9201..0000000 --- a/build/c/dependencies/CTextEngine/declaration.h +++ /dev/null @@ -1,8 +0,0 @@ -#include "depencies.h" -#include "macros.h" -#include "constants.h" -#include "tags.h" -#include "CTextStack/CTextStack.h" -#include "extras/extras.h" -#include "CTextArray/CTextArray.h" -#include "CTextNamespace/declaration.h" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/definition.h b/build/c/dependencies/CTextEngine/definition.h deleted file mode 100644 index 59a1880..0000000 --- a/build/c/dependencies/CTextEngine/definition.h +++ /dev/null @@ -1,11 +0,0 @@ - -#include "CTextStack/admnistrative_methods.c" -#include "CTextStack/algo_methods.c" -#include "CTextStack/constructors.c" -#include "CTextStack/parsers.c" -#include "CTextStack/render_methods.c" - - -#include "extras/extras.c" -#include "CTextArray/CTextArray.c" -#include "CTextNamespace/definition.h" diff --git a/build/c/dependencies/CTextEngine/depencies.h b/build/c/dependencies/CTextEngine/depencies.h deleted file mode 100644 index e6b0e61..0000000 --- a/build/c/dependencies/CTextEngine/depencies.h +++ /dev/null @@ -1,7 +0,0 @@ -#include -#include -#include -#include -#include -#include - diff --git a/build/c/dependencies/CTextEngine/extras/extras.c b/build/c/dependencies/CTextEngine/extras/extras.c deleted file mode 100644 index 50c40d4..0000000 --- a/build/c/dependencies/CTextEngine/extras/extras.c +++ /dev/null @@ -1,182 +0,0 @@ - -void private_ctext_generate_formated_text( - struct CTextStack *stack,const char *format,va_list argptr){ - long text_size = strlen(format); - - int i; - for(i =0;i < text_size -1 ;i++){ - - char single_test[3] = {format[i],format[i+1],'\0'}; - char double_test[4] = {0}; - - - if(i < text_size -2){ - strcpy(double_test,single_test); - double_test[2] = format[i+2]; - double_test[3] = '\0'; - - } - - if(strcmp(single_test,"%d") == 0 || strcmp(single_test,"%i") == 0) { - int value = va_arg(argptr,int); - char result[20] ={0}; - sprintf(result,"%d", value); - - - - CTextStack_text(stack,result); - - i+=1; - continue; - } - - else if(strcmp(double_test,"%ld") == 0 ) { - - int value = va_arg(argptr,int); - char result[20] ={0}; - sprintf(result,"%d", value); - - CTextStack_text(stack,result); - - i+=2; - continue; - } - - - else if(strcmp(single_test,"%f") == 0 ) { - char result_text[20]= {0}; - - sprintf(result_text,"%lf", va_arg(argptr,double )); - - for(int t = 18; t > 0; t--){ - char current_char = result_text[t]; - if(current_char != '0' && current_char != '\0'){ - - if(current_char == '.'){ - result_text[t+2] = '\0'; - } - else{ - result_text[t+1] = '\0'; - } - - break; - } - } - CTextStack_text(stack,result_text); - i+=1; - continue; - } - - else if(strcmp(double_test,"%lf") == 0 ) { - char result_text[20]= {0}; - - sprintf(result_text,"%lf", va_arg(argptr,double )); - - for(int t = 18; t > 0; t--){ - char current_char = result_text[t]; - if(current_char != '0' && current_char != '\0'){ - - if(current_char == '.'){ - result_text[t+2] = '\0'; - } - else{ - result_text[t+1] = '\0'; - } - - break; - } - } - CTextStack_text(stack,result_text); - i+=2; - continue; - } - else if(strcmp(single_test,"%c") == 0){ - char result = va_arg(argptr,int); - char element[2] = {result,'\0'}; - CTextStack_text(stack,element); - i+=1; - continue; - } - - - else if(strcmp(single_test,"%b") == 0){ - bool value = va_arg(argptr,int); - if(value){ - CTextStack_text(stack,"true"); - }else{ - CTextStack_text(stack,"false"); - } - i+=1; - continue; - } - - else if(strcmp(double_test,"%sc") == 0){ - char *value = va_arg(argptr,char*); - if(value){ - CTextStack_text(stack,value); - free(value); - } - i+=2; - continue; - } - - else if(strcmp(single_test,"%s") == 0){ - const char *value = va_arg(argptr,const char*); - if(value){ - CTextStack_text(stack,value); - } - - i+=1; - continue; - } - else if(strcmp(double_test,"%tc") == 0){ - struct CTextStack *new_stack = (struct CTextStack*)va_arg(argptr,void *); - if(new_stack){ - char *result = CTextStack_self_transform_in_string_and_self_clear(new_stack); - CTextStack_text(stack,result); - free(result); - } - i+=2; - continue; - } - - else if(strcmp(single_test,"%t") == 0){ - struct CTextStack *new_stack = (struct CTextStack*)va_arg(argptr,void *); - if(new_stack){ - CTextStack_text(stack,new_stack->rendered_text); - } - i+=1; - continue; - } - - char element[2] = {format[i],'\0'}; - CTextStack_text(stack,element); - - } - - - - if(text_size > 0 && text_size> i){ - char element[2] = {format[text_size-1],'\0'}; - CTextStack_text(stack,element); - } - - va_end(argptr); -} - - -long private_CText_transform_index(long size , long value){ - long formated_value = value; - - if(formated_value >= size){ - formated_value = size; - } - - if(formated_value < 0){ - formated_value = size + (formated_value +1); - } - if(formated_value <0){ - formated_value = 0; - } - return formated_value; -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/extras/extras.h b/build/c/dependencies/CTextEngine/extras/extras.h deleted file mode 100644 index 7651912..0000000 --- a/build/c/dependencies/CTextEngine/extras/extras.h +++ /dev/null @@ -1,10 +0,0 @@ - - -long private_CText_transform_index(long size, long value); - - -void private_ctext_generate_formated_text( - struct CTextStack *stack, - const char *format, - va_list argptr - ); \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/LuaCEmbed.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/LuaCEmbed.h deleted file mode 100644 index 6c5e92e..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/LuaCEmbed.h +++ /dev/null @@ -1,19 +0,0 @@ - -typedef struct LuaCEmbed{ - lua_State *state; - const char *current_function; - bool is_lib; - int total_args; - char *error_msg; - void (*delete_function)(struct LuaCEmbed *self); - void *global_tables; - void *func_tables; - int lib_identifier; - int stack_leve; - char *main_lib_table; - bool field_protection; -}LuaCEmbed; - -int lua_cembed_timeout = -1; -LuaCEmbed *global_current_lua_embed_object; - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/args_error/args_error.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/args_error/args_error.c deleted file mode 100644 index 982d1cd..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/args_error/args_error.c +++ /dev/null @@ -1,33 +0,0 @@ - - -int LuaCEmbed_ensure_arg_exist(LuaCEmbed *self, private_lua_cembed_incremented_arg index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(index > self->total_args){ - - privateLuaCEmbed_raise_error_not_jumping(self, PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,index,self->current_function); - return LUA_CEMBED_GENERIC_ERROR; - } - return LUA_CEMBED_OK; - -} - -int private_LuaCEmbed_ensure_top_stack_arg_type(LuaCEmbed *self, int index,int arg_type) { - PRIVATE_LUA_CEMBED_PROTECT_NUM - int type = lua_type(self->state, -1); - if (type != arg_type) { - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_ARG_WRONG_TYPE, - index + LUA_CEMBED_INDEX_DIF, - self->current_function, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(arg_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - - return LUA_CEMBED_OK; - -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/args_error/args_error.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/args_error/args_error.h deleted file mode 100644 index 7300a8e..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/args_error/args_error.h +++ /dev/null @@ -1,5 +0,0 @@ - - -int LuaCEmbed_ensure_arg_exist(LuaCEmbed *self, private_lua_cembed_incremented_arg index); - -int private_LuaCEmbed_ensure_top_stack_arg_type(LuaCEmbed *self, int index,int arg_type); diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/basic/basic.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/basic/basic.c deleted file mode 100644 index aa07bad..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/basic/basic.c +++ /dev/null @@ -1,206 +0,0 @@ - -int privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(formatted_index > self->total_args){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,formatted_index,self->current_function); - return LUA_CEMBED_GENERIC_ERROR; - } - - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - lua_getglobal(self->state,formated_arg); - int type = lua_type(self->state,-1); - if(type == LUA_CEMBED_NOT_FOUND || type == LUA_CEMBED_NIL){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,formatted_index,self->current_function); - free(formated_arg); - return LUA_CEMBED_GENERIC_ERROR; - } - - free(formated_arg); - return LUA_OK; -} - -int LuaCEmbed_get_total_args(LuaCEmbed *self){ - return self->total_args; -} - - - -int LuaCEmbed_get_arg_type(LuaCEmbed *self,int index){ - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(formatted_index > self->total_args){ - return LUA_CEMBED_NIL; - } - - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - lua_getglobal(self->state,formated_arg); - int type = lua_type(self->state, -1); - free(formated_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return type; -} - - -long long LuaCEmbed_get_long_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_NUMBER)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - - long long result = (long long)lua_tonumber(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - - -double LuaCEmbed_get_double_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_NUMBER)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - double result = lua_tonumber(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - -bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_BOOL)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - bool result = lua_toboolean(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - - -char * LuaCEmbed_get_str_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - PRIVATE_LUA_CEMBED_CLEAR_STACK - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_STRING)){ - return NULL; - } - char *result = (char*)lua_tostring(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} -char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,long *size, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - PRIVATE_LUA_CEMBED_CLEAR_STACK - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_STRING)){ - return NULL; - } - char *result = (char*)lua_tolstring(self->state,-1,(size_t*)size); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - -LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_TABLE)){ - return NULL; - } - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - LuaCEmbedTable *created = LuaCembed_get_global_table(self,formated_arg); - free(formated_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return created; - -} - -LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call, int total_returns){ - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - char *formatted_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - free(formatted_arg); - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_FUNCTION)){ - free(formatted_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - int total_args = private_lua_cEmbed_unpack(args_to_call,formatted_arg); - if(lua_pcall(self->state,total_args,total_returns,0)){ - - privateLuaCEmbed_raise_error_not_jumping(self, lua_tostring(self->state,-1)); - free(formatted_arg); - - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - - for(int i = 0; i < total_returns; i++){ - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - int position = (i +1) * -1; - lua_pushvalue(self->state,position); - lua_setglobal(self->state,formatted); - free(formatted); - } - - - - LuaCEmbedTable *result = LuaCembed_new_anonymous_table(self); - for(int i = 0; i < total_returns; i++){ - lua_getglobal(self->state,result->global_name); - lua_pushinteger(self->state,i+1); - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - lua_getglobal(self->state,formatted); - lua_settable(self->state,-3); - free(formatted); - } - free(formatted_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; - -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/basic/basic.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/basic/basic.h deleted file mode 100644 index 6263703..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/basic/basic.h +++ /dev/null @@ -1,23 +0,0 @@ - -int privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, int index); - -int LuaCEmbed_get_total_args(LuaCEmbed *self); - -int LuaCEmbed_get_arg_type(LuaCEmbed *self,int index); - - - -long long LuaCEmbed_get_long_arg(LuaCEmbed *self, int index); - -double LuaCEmbed_get_double_arg(LuaCEmbed *self, int index); - -bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, int index); - -char * LuaCEmbed_get_str_arg(LuaCEmbed *self, int index); - -char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,long *size, int index); - -LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,int index); - -LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call, int total_returns); - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/declaration.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/declaration.h deleted file mode 100644 index d99c5c3..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/declaration.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "args_error/args_error.h" -#include "basic/basic.h" -#include "evaluation/evaluation.h" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/definition.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/definition.h deleted file mode 100644 index ecfe1d9..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/definition.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "args_error/args_error.c" -#include "basic/basic.c" -#include "evaluation/evaluation.c" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/evaluation/evaluation.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/evaluation/evaluation.c deleted file mode 100644 index 3524958..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/evaluation/evaluation.c +++ /dev/null @@ -1,155 +0,0 @@ - - -int private_LuaCembed_run_code_with_args(LuaCEmbed *self,int index,const char *code,va_list args){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(LuaCEmbed_ensure_arg_exist(self,formatted_index)){ - return LUA_CEMBED_GENERIC_ERROR; - } - - char *formated_expresion = private_LuaCembed_format_vaarg(code,args); - - char *buffer = private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - formated_expresion - ); - - if(LuaCEmbed_evaluate(self, buffer)){ - free(formated_expresion); - free(buffer); - return LUA_CEMBED_GENERIC_ERROR; - } - free(buffer); - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - - int type = lua_type(self->state,-1); - - if(type != LUA_CEMBED_FUNCTION){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_CODE_ITS_NOT_A_FUNCTION,formated_expresion); - free(formated_expresion); - return LUA_CEMBED_GENERIC_ERROR; - } - - free(formated_expresion); - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - privateLuaCEmbed_put_arg_on_top(self,index); - - if(lua_pcall(self->state,1,1,0)){ - const char *generated_error = lua_tostring(self->state,-1); - privateLuaCEmbed_raise_error_not_jumping(self, generated_error); - } - return LUA_CEMBED_OK; -} - -int privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,int index,int expected_type){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - int actual_type = lua_type(self->state,-1); - if(actual_type== expected_type){ - return LUA_CEMBED_OK; - } - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_RESULT_EVALUATION_ARG_WRONG_TYPE, - self->current_function, - index, - LuaCembed_convert_arg_code(actual_type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} -int LuaCEmbed_get_type_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - return lua_type(self->state,-1); -} -int LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - return LUA_CEMBED_OK; -} -long long LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (long long) lua_tonumber(self->state,-1); - -} - - -double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (double ) lua_tonumber(self->state,-1); - -} - -bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return false; - } - return lua_toboolean(self->state,-1); - -} - -char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return NULL; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); - -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/evaluation/evaluation.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/evaluation/evaluation.h deleted file mode 100644 index da15cac..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/args/evaluation/evaluation.h +++ /dev/null @@ -1,19 +0,0 @@ - - -int private_LuaCembed_run_code_with_args(LuaCEmbed *self,int index,const char *code,va_list args); - -int privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,int index,int expected_type); - -int LuaCEmbed_get_type_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -int LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -long long LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - - -double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/basic/basic.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/basic/basic.c deleted file mode 100644 index 1100fc3..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/basic/basic.c +++ /dev/null @@ -1,136 +0,0 @@ - - -LuaCEmbed * newLuaCEmbedEvaluation(){ - LuaCEmbed *self = (LuaCEmbed*) malloc(sizeof (LuaCEmbed)); - *self = (LuaCEmbed){0}; - self->state = luaL_newstate(); - - self->global_tables = (void*)newprivateLuaCEmbedTableArray(); - - return self; -} -void LuaCEmbed_load_lib_from_c(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name){ - int result = callback(self->state); - if(result > 0){ - lua_setglobal(self->state,name); - } -} - - - - - -void LuaCembed_set_delete_function(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)){ - self->delete_function = delelte_function; -} - - - - -void LuaCEmbed_set_timeout(int seconds){ - lua_cembed_timeout = seconds; -} - -char * LuaCEmbed_get_error_message(LuaCEmbed *self){ - if(!self){ - return NULL; - } - - return self->error_msg; -} -void LuaCEmbed_clear_errors(LuaCEmbed *self){ - if(!self){ - return; - } - - if(self->error_msg){ - free(self->error_msg); - self->error_msg = NULL; - } -} -void * privateLuaCEmbed_get_current_table_array(LuaCEmbed *self){ - if(self->current_function){ - return self->func_tables; - } - return self->global_tables; -} -void privateLuaCEmbed_raise_error_not_jumping(LuaCEmbed *self, const char *error_msg, ...){ - - if(LuaCEmbed_has_errors(self)){ - return; - } - - va_list args; - va_start(args,error_msg); - self->error_msg = private_LuaCembed_format_vaarg(error_msg, args); - va_end(args); - -} - - - -bool LuaCEmbed_has_errors(LuaCEmbed *self){ - if(!self){ - return true; - } - - if(self->error_msg){ - return true; - } - - return false; -} - - - - - - -void privata_LuaCEmbed_increment_stack_(LuaCEmbed *self){ - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - int value = 0; - if(lua_type(self->state,-1) == LUA_CEMBED_NUMBER){ - value = lua_tonumber(self->state,-1); - } - int new_value = value+1; - lua_pushinteger(self->state,new_value); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve =new_value; -} - - -void privata_LuaCEmbed_decrement_stack(LuaCEmbed *self){ - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - int value = 0; - if(lua_type(self->state,-1) == LUA_CEMBED_NUMBER){ - value = lua_tointeger(self->state,-1); - } - if(value> 0){ - int new_value = value -1; - lua_pushinteger(self->state,new_value); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve = new_value; - } - -} - -void privateLuaCEmbd_get_field_protected(LuaCEmbed *self,const char *name){ - bool old_field_proection = self->field_protection; - self->field_protection = true; - lua_getfield(self->state,-1,name); - self->field_protection = old_field_proection; -} - -void LuaCEmbed_free(LuaCEmbed *self){ - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->global_tables); - if(!self->is_lib){ //se for do próprio lua, o lua cuidará de limpar - lua_close(self->state); // Fecha o estado Lua - } - if(self->error_msg){ - free(self->error_msg); - } - if(self->main_lib_table){ - free(self->main_lib_table); - } - free(self); -} diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/basic/basic.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/basic/basic.h deleted file mode 100644 index b7ea79d..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/basic/basic.h +++ /dev/null @@ -1,38 +0,0 @@ - - - -LuaCEmbed * newLuaCEmbedEvaluation(); - - -int private_LuaCemb_internal_free(lua_State *L); - -void LuaCEmbed_load_lib_from_c(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name); - -void LuaCembed_set_delete_function(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)); - -char * LuaCEmbed_get_error_message(LuaCEmbed *self); - - -bool LuaCEmbed_has_errors(LuaCEmbed *self); - -void LuaCEmbed_clear_errors(LuaCEmbed *self); - -void privateLuaCEmbd_get_field_protected(LuaCEmbed *self,const char *name); - -void privateLuaCEmbed_raise_error_not_jumping(LuaCEmbed *self, const char *error, ...); - -void * privateLuaCEmbed_get_current_table_array(LuaCEmbed *self); - - -void LuaCEmbed_set_timeout(int seconds); - - - -void privata_LuaCEmbed_increment_stack_(LuaCEmbed *self); - - -void privata_LuaCEmbed_decrement_stack(LuaCEmbed *self); - -void LuaCEmbed_free(LuaCEmbed *self); - - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/callback_handle/callback_handle.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/callback_handle/callback_handle.c deleted file mode 100644 index 3d30475..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/callback_handle/callback_handle.c +++ /dev/null @@ -1,231 +0,0 @@ - - -int privateLuaCEmbed_main_callback_handler(lua_State *L){ - - bool is_a_method = lua_toboolean(L, lua_upvalueindex(1)); - bool is_a_function = !is_a_method; - LuaCEmbedResponse *possible_return = NULL; - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(L,lua_upvalueindex(2)); - int old_total_args = self->total_args; - self->total_args = lua_gettop(self->state); - privata_LuaCEmbed_increment_stack_(self); - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve = (int)lua_tonumber(self->state,-1); - - for(int i = 0; i < self->total_args; i++){ - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,i); - lua_pushvalue(L,i+1); - lua_setglobal(L,formated_arg); - free(formated_arg); - } - - const char *func_name = lua_tostring(L,lua_upvalueindex(3)); - self->current_function = func_name; - void *old_funct_tables = self->func_tables; - self->func_tables = (void*)newprivateLuaCEmbedTableArray(); - if(is_a_method){ - LuaCEmbedResponse *(*method_callback)(LuaCEmbedTable *tb, LuaCEmbed *self); - - //equivalent of PRIVATE_LUA_CEMBED_SELFNAME = index[4] - lua_pushvalue(L, lua_upvalueindex(4)); - lua_setglobal(L,PRIVATE_LUA_CEMBED_SELFNAME); - - LuaCEmbedTable *table = private_newLuaCembedTable(self, PRIVATE_LUA_CEMBED_SELFNAME); - method_callback = (LuaCEmbedResponse *(*)(LuaCEmbedTable *tb, LuaCEmbed *self))lua_touserdata(L, lua_upvalueindex(5)); - possible_return = method_callback(table,self); - privateLuaCEmbedTable_free(table); - } - - if(is_a_function){ - LuaCEmbedResponse *(*function_callback)(LuaCEmbed *self); - function_callback = (LuaCEmbedResponse *(*)(LuaCEmbed *self))lua_touserdata(L, lua_upvalueindex(4)); - possible_return = function_callback(self); - } - - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->func_tables); - self->func_tables = old_funct_tables; - self->total_args = old_total_args; - privata_LuaCEmbed_decrement_stack(self); - PRIVATE_LUA_CEMBED_CLEAR_STACK - self->current_function = NULL; - - if(possible_return==NULL){ - return PRIVATE_LUACEMBED_NO_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_ERROR_RESPONSE){ - - if(self->field_protection){ - private_LuaCEmbedResponse_free(possible_return); - if(self->error_msg){ - free(self->error_msg); - self->error_msg = NULL; - } - - return PRIVATE_LUACEMBED_NO_RETURN; - } - - lua_pushstring(L, possible_return->string_val); - privateLuaCEmbed_raise_error_not_jumping(self,possible_return->string_val); - private_LuaCEmbedResponse_free(possible_return); - lua_error(L); - return PRIVATE_LUACEMBED_NO_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_LONG_RESPONSE){ - lua_pushinteger(L, (int)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_BOOL_RESPONSE){ - lua_pushboolean(L, (bool)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE){ - lua_pushnumber(L, possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_STRING_RESPONSE){ - lua_pushlstring(self->state,possible_return->string_val,possible_return->string_size); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE){ - lua_pushboolean(L, (bool)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_TABLE_RESPONSE){ - lua_getglobal(self->state, PRIVATE_LUA_CEMBED_TABLE_RETURN); - lua_pushvalue(self->state,-1); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_MULTI_RESPONSE){ - LuaCEmbedTable *table = private_newLuaCembedTable(self, PRIVATE_LUA_CEMBED_TABLE_RETURN); - int size =private_lua_cEmbed_unpack(table,NULL); - private_LuaCEmbedResponse_free(possible_return); - privateLuaCEmbedTable_free(table); - - return size; - } - - - if(possible_return->type == PRIVATE_LUA_CEMBED_EVALUATION){ - char *formated_function =private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - possible_return->string_val - ); - - int error_code = LuaCEmbed_evaluate(self, formated_function); - free(formated_function); - - if(error_code){ - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - } - - lua_getglobal(self->state, PRIVATE_LUA_CEMBED_EVALUATION_NAME); - int v_type = lua_type(self->state,-1); - if(v_type == LUA_CEMBED_FUNCTION){ - const int TOTAL_ARGS =0; - const int TOTAL_RETURNS =1; - if(lua_pcall(self->state,TOTAL_ARGS,TOTAL_RETURNS,0)){ - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - } - } - - lua_pushvalue(self->state,-1); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - - } - - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - -} - - -void private_LuaCEmbed_add_lib_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args),bool global_functions ){ - - char *main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - //get the table - lua_getglobal(self->state,main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,callback_name); - - //creating the clojure - - //creating the clojure - lua_pushboolean(self->state,false);//is a method - lua_pushlightuserdata(self->state,(void*)self); //self - lua_pushstring(self->state,callback_name);//calback name - lua_pushlightuserdata(self->state,(void*)callback);//calback - - lua_pushcclosure(self->state,privateLuaCEmbed_main_callback_handler,4); - - - lua_settable(self->state,-3); - if(global_functions){ - //it points the function to a global function - //like: callback = private_lua_c_embed_main_lib_table.callback - lua_getglobal(self->state, main_lib_table); - lua_getfield(self->state,-1,callback_name); - lua_setglobal(self->state, callback_name); - } - - lua_settop(self->state, 0); - free(main_lib_table); - -} - -void private_LuaCEmbed_add_evaluation_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - //creating the clojure - lua_pushboolean(self->state,false);//is a method - lua_pushlightuserdata(self->state,(void*)self); //self - lua_pushstring(self->state,callback_name);//calback name - lua_pushlightuserdata(self->state,(void*)callback);//calback - - lua_pushcclosure(self->state,privateLuaCEmbed_main_callback_handler,4); - lua_setglobal(self->state, callback_name); - lua_settop(self->state, 0); - -} - - -void LuaCEmbed_add_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - if(self->is_lib){ - private_LuaCEmbed_add_lib_callback(self,callback_name,callback,false); - return; - } - private_LuaCEmbed_add_evaluation_callback(self,callback_name,callback); - -} - -void LuaCEmbed_add_global_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args)){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - if(self->is_lib){ - private_LuaCEmbed_add_lib_callback(self,callback_name,callback,true); - return; - } - private_LuaCEmbed_add_evaluation_callback(self,callback_name,callback); -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/callback_handle/callback_handle.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/callback_handle/callback_handle.h deleted file mode 100644 index 20c5c8e..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/callback_handle/callback_handle.h +++ /dev/null @@ -1,13 +0,0 @@ - - -int privateLuaCEmbed_main_callback_handler(lua_State *L); - -void private_LuaCEmbed_add_lib_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args),bool global_functions ); - -void private_LuaCEmbed_add_evaluation_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - -void LuaCEmbed_add_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - - -void LuaCEmbed_add_global_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args)); - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/declaration.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/declaration.h deleted file mode 100644 index 8188bd9..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/declaration.h +++ /dev/null @@ -1,13 +0,0 @@ -typedef long private_lua_cembed_incremented_arg ; -#include "LuaCEmbed.h" -#include "memory/memory.h" - -#include "lib_start/lib_start.h" -#include "basic/basic.h" -#include "table/declaration.h" -#include "args/declaration.h" -#include "globals/declaration.h" -#include "callback_handle/callback_handle.h" -#include "evaluation/evaluation.h" -#include "protection_macros.h" -#include "lib_props/lib_props.h" diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/definition.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/definition.h deleted file mode 100644 index 7f45e5a..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/definition.h +++ /dev/null @@ -1,9 +0,0 @@ -#include "memory/memory.c" -#include "lib_start/lib_start.c" -#include "basic/basic.c" -#include "args/definition.h" -#include "table/definition.h" -#include "globals/definition.h" -#include "callback_handle/callback_handle.c" -#include "evaluation/evaluation.c" -#include "lib_props/lib_props.c" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/evaluation/evaluation.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/evaluation/evaluation.c deleted file mode 100644 index 29b3ee9..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/evaluation/evaluation.c +++ /dev/null @@ -1,247 +0,0 @@ - - -#ifdef _WIN32 -VOID CALLBACK TimerHandler(HWND hwnd, UINT uMsg, UINT_PTR idEvent, DWORD dwTime) { - - privateLuaCEmbed_raise_error_not_jumping(global_current_lua_embed_object, PRIVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_pushstring(global_current_lua_embed_object->state,PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_error(global_current_lua_embed_object->state); -} - -#else - -void private_LuaCembed_handle_timeout(int signum) { - - privateLuaCEmbed_raise_error_not_jumping(global_current_lua_embed_object, PRIVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_pushstring(global_current_lua_embed_object->state,PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_error(global_current_lua_embed_object->state); -} - -#endif - - - -int privateLuaCEmbed_start_func_evaluation(lua_State *state){ - - int evaluation_type = lua_tointeger(state, lua_upvalueindex(1)); - char *text_value = (char*)lua_touserdata(state,lua_upvalueindex(2)); - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(state,lua_upvalueindex(3)); - global_current_lua_embed_object = self; - #ifdef _WIN32 - if (lua_cembed_timeout > 0) { - SetTimer(NULL, 0,lua_cembed_timeout > 0 * 1000, TimerHandler); - } - #else - if (lua_cembed_timeout > 0) { - signal(SIGALRM, private_LuaCembed_handle_timeout); - alarm(lua_cembed_timeout); - } - #endif - - int error = 0; - if(evaluation_type == PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE){ - error =luaL_dofile(self->state,text_value); - } - if(evaluation_type == PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE){ - error = luaL_dostring(self->state,text_value); - } - if(error){ - privateLuaCEmbed_raise_error_not_jumping(self,lua_tostring(self->state,-1)); - } - lua_pushinteger(self->state,error); - - return 1; - -} -int LuaCEmbed_evaluate(LuaCEmbed *self, const char *code, ...){ - - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - char * formated_expresion = private_LuaCembed_format_vaarg(code,args); - va_end(args); - lua_pushinteger(self->state,PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE); - lua_pushlightuserdata(self->state,(void*)formated_expresion); //code - lua_pushlightuserdata(self->state,(void*)self); //code - lua_pushcclosure(self->state,privateLuaCEmbed_start_func_evaluation,3); - lua_pcall(self->state,0,1,0); - int error = lua_tointeger(self->state,-1); - free(formated_expresion); - - return error; - -} - -int LuaCEmbed_evaluete_file(LuaCEmbed *self, const char *file){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - - lua_pushinteger(self->state,PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE); - lua_pushlightuserdata(self->state,(void*)file); //code - lua_pushlightuserdata(self->state,(void*)self); //code - lua_pushcclosure(self->state,privateLuaCEmbed_start_func_evaluation,3); - lua_pcall(self->state,0,1,0); - int error = lua_tointeger(self->state,-1); - return error; - -} - -int private_LuaCEmbed_evaluate_puting_on_top_of_stack(LuaCEmbed *self,const char *code, va_list args){ - - char * formated_expresion =private_LuaCembed_format_vaarg(code,args); - - char * buffer =private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - formated_expresion - ); - - if(LuaCEmbed_evaluate(self, buffer)){ - free(formated_expresion); - free(buffer); - return LUA_CEMBED_GENERIC_ERROR; - } - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - - int type = lua_type(self->state,-1); - - if(type == LUA_CEMBED_FUNCTION){ - if(lua_pcall(self->state,0,1,0)){ - const char *generated_error = lua_tostring(self->state,-1); - privateLuaCEmbed_raise_error_not_jumping(self, generated_error); - } - } - free(formated_expresion); - free(buffer); - return LUA_CEMBED_OK; - -} -int private_LuaCEmbed_ensure_evaluation_type(LuaCEmbed *self,int type){ - - int actual_type = lua_type(self->state,-1); - if(actual_type== type){ - return LUA_CEMBED_OK; - } - - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_RESULT_EVALUATION_WRONG_TYPE, - LuaCembed_convert_arg_code(actual_type), - LuaCembed_convert_arg_code(type) - ); - - return LUA_CEMBED_GENERIC_ERROR; -} - -char * LuaCEmbed_get_evaluation_string(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return NULL; - } - - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_STRING)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); - -} - - -int LuaCEmbed_get_evaluation_type(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - - return lua_type(self->state,-1); -} - - -long LuaCEmbed_get_evaluation_table_size(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_TABLE)){ - return LUA_CEMBED_GENERIC_ERROR; - } - /* - long size = 0; - lua_pushnil(self->state); // Coloca a chave nula na pilha - while (lua_next(self->state, -1) != 0) { // Enquanto houver elementos na tabela - size+=1; - lua_pop(self->state, 1); - } - */ - - return (long)lua_rawlen(self->state,-1); -} - - - -long long LuaCEmbed_get_evaluation_long(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (long)lua_tonumber(self->state,-1); - -} - -double LuaCEmbed_get_evaluation_double(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (double)lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_evaluation_bool(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (bool)lua_toboolean(self->state,-1); -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/evaluation/evaluation.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/evaluation/evaluation.h deleted file mode 100644 index fa7c95d..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/evaluation/evaluation.h +++ /dev/null @@ -1,36 +0,0 @@ - - -#ifdef _WIN32 -VOID CALLBACK TimerHandler(HWND hwnd, UINT uMsg, UINT_PTR idEvent, DWORD dwTime); -#else - -void private_LuaCembed_handle_timeout(int signum); - -#endif - -int privateLuaCEmbed_start_func_evaluation(lua_State *state); - -int LuaCEmbed_evaluate(LuaCEmbed *self, const char *code, ...); - -int LuaCEmbed_evaluete_file(LuaCEmbed *self, const char *file); - - -int private_LuaCEmbed_ensure_evaluation_type(LuaCEmbed *self,int type); - -int private_LuaCEmbed_evaluate_puting_on_top_of_stack(LuaCEmbed *self,const char *code, va_list args); - -char * LuaCEmbed_get_evaluation_string(LuaCEmbed *self,const char *code, ...); - - -int LuaCEmbed_get_evaluation_type(LuaCEmbed *self,const char *code, ...); - - -long LuaCEmbed_get_evaluation_table_size(LuaCEmbed *self,const char *code, ...); - -long long LuaCEmbed_get_evaluation_long(LuaCEmbed *self,const char *code, ...); - -double LuaCEmbed_get_evaluation_double(LuaCEmbed *self,const char *code, ...); - -bool LuaCEmbed_get_evaluation_bool(LuaCEmbed *self,const char *code, ...); - - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/declaration.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/declaration.h deleted file mode 100644 index c7e0d1f..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/declaration.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "errors/errors.h" -#include "getters/getters.h" -#include "setters/setters.h" diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/definition.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/definition.h deleted file mode 100644 index 8882f59..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/definition.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "errors/errors.c" -#include "getters/getters.c" -#include "setters/setters.c" diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/errors/errors.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/errors/errors.c deleted file mode 100644 index 17b897b..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/errors/errors.c +++ /dev/null @@ -1,23 +0,0 @@ - - - - -int LuaCEmbed_ensure_global_type(LuaCEmbed *self, const char *name,int expected_type){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - lua_getglobal(self->state,name); - int type = lua_type(self->state,-1); - - if(type != expected_type){ - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_GLOBAL_WRONG_TYPE, - name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - - return LUA_CEMBED_OK; - -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/errors/errors.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/errors/errors.h deleted file mode 100644 index 16ae62f..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/errors/errors.h +++ /dev/null @@ -1,4 +0,0 @@ - - - -int LuaCEmbed_ensure_global_type(LuaCEmbed *self, const char *name,int expected_type); diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/getters/getters.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/getters/getters.c deleted file mode 100644 index 12481b6..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/getters/getters.c +++ /dev/null @@ -1,156 +0,0 @@ - - -int LuaCEmbed_get_global_type(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - lua_getglobal(self->state, name); - return lua_type(self->state,-1); -} - -long long LuaCEmbed_get_global_long(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return (long )lua_tonumber(self->state,-1); -} - -double LuaCEmbed_get_global_double(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return (double )lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_global_bool(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return lua_toboolean(self->state,-1); -} - -char * LuaCEmbed_get_global_raw_string(LuaCEmbed *self,const char *name,long *size){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - lua_getglobal(self->state, name); - return (char*)lua_tolstring(self->state,-1,(size_t*)size); -} - -char * LuaCEmbed_get_global_string(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - lua_getglobal(self->state, name); - return (char*)lua_tostring(self->state,-1); -} - -LuaCEmbedTable * LuaCembed_new_anonymous_table(LuaCEmbed *self){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - - const char *format_raw = PRIVATE_LUA_CEMBED_ANONYMOUS_TABLE_; - if(self->current_function){ - format_raw =PRIVATE_LUA_CEMBED_ANONYMOUS_FUNC_TABLE_; - } - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - char *buffer= private_LuaCembed_format(format_raw, self->stack_leve, target->size); - LuaCEmbedTable *created_table =LuaCembed_new_global_table(self,buffer); - - free(buffer); - return created_table; -} - - - -LuaCEmbedTable * LuaCembed_get_global_table(LuaCEmbed *self, const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_TABLE)){ - return NULL; - } - - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,name); - if(possible){ - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s", name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} - -LuaCEmbedTable * LuaCembed_new_global_table(LuaCEmbed *self, const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - lua_newtable(self->state); - lua_setglobal(self->state,name); - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,name); - if(possible){ - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s", name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} - -LuaCEmbedTable* LuaCEmbed_run_global_lambda(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns){ - - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_FUNCTION)){ - return NULL; - } - - int total_args = private_lua_cEmbed_unpack(args_to_call,name); - if(lua_pcall(self->state,total_args,total_returns,0)){ - privateLuaCEmbed_raise_error_not_jumping(self, lua_tostring(self->state,-1)); - return NULL; - } - - for(int i = 0; i < total_returns; i++){ - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_, self->stack_leve, i); - int position = (i +1) * -1; - lua_pushvalue(self->state,position); - lua_setglobal(self->state,formatted); - free(formatted); - } - - LuaCEmbedTable *result = LuaCembed_new_anonymous_table(self); - for(int i = 0; i < total_returns; i++){ - lua_getglobal(self->state,result->global_name); - lua_pushinteger(self->state,i+1); - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - lua_getglobal(self->state,formatted); - lua_settable(self->state,-3); - free(formatted); - } - - return result; -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/getters/getters.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/getters/getters.h deleted file mode 100644 index c0e915c..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/getters/getters.h +++ /dev/null @@ -1,22 +0,0 @@ - - -int LuaCEmbed_get_global_type(LuaCEmbed *self,const char *name); - -long long LuaCEmbed_get_global_long(LuaCEmbed *self,const char *name); - -double LuaCEmbed_get_global_double(LuaCEmbed *self,const char *name); - -bool LuaCEmbed_get_global_bool(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_global_string(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_global_raw_string(LuaCEmbed *self,const char *name,long *size); - - -LuaCEmbedTable * LuaCembed_new_anonymous_table(LuaCEmbed *self); - -LuaCEmbedTable* LuaCEmbed_run_global_lambda(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns); - -LuaCEmbedTable * LuaCembed_get_global_table(LuaCEmbed *self, const char *name); - -LuaCEmbedTable * LuaCembed_new_global_table(LuaCEmbed *self, const char *name); diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/setters/setters.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/setters/setters.c deleted file mode 100644 index 48a1082..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/setters/setters.c +++ /dev/null @@ -1,43 +0,0 @@ - - -void LuaCEmbed_set_global_string(LuaCEmbed *self, const char *name, const char *value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushstring(self->state,value); - lua_setglobal(self->state,name); -} -void LuaCEmbed_set_global_raw_string(LuaCEmbed *self, const char *name, const char *value,long size){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushlstring(self->state,value,size); - lua_setglobal(self->state,name); -} - - -void LuaCEmbed_set_global_long(LuaCEmbed *self, const char *name, long long value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushnumber(self->state,(double )value); - lua_setglobal(self->state,name); -} - -void LuaCEmbed_set_global_double(LuaCEmbed *self, const char *name, double value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushnumber(self->state,(double )value); - lua_setglobal(self->state,name); -} - -void LuaCEmbed_set_global_bool(LuaCEmbed *self, const char *name, bool value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - lua_pushboolean(self->state,value); - lua_setglobal(self->state,name); -} - - -void LuaCEmbed_set_global_table(LuaCEmbed *self, const char *name, LuaCEmbedTable *table){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_getglobal(self->state,table->global_name); - lua_setglobal(self->state,name); -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/setters/setters.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/setters/setters.h deleted file mode 100644 index 1f22314..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/globals/setters/setters.h +++ /dev/null @@ -1,12 +0,0 @@ - -void LuaCEmbed_set_global_string(LuaCEmbed *self, const char *name, const char *value); - -void LuaCEmbed_set_global_raw_string(LuaCEmbed *self, const char *name, const char *value,long size); - -void LuaCEmbed_set_global_long(LuaCEmbed *self, const char *name, long long value); - -void LuaCEmbed_set_global_double(LuaCEmbed *self, const char *name, double value); - -void LuaCEmbed_set_global_bool(LuaCEmbed *self, const char *name, bool value); - -void LuaCEmbed_set_global_table(LuaCEmbed *self, const char *name, LuaCEmbedTable *table); diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/lib_props/lib_props.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/lib_props/lib_props.c deleted file mode 100644 index cfcf894..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/lib_props/lib_props.c +++ /dev/null @@ -1,147 +0,0 @@ - - -void LuaCEmbed_set_long_lib_prop(LuaCEmbed *self,const char *name,long long value){ - char *main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - lua_getglobal(self->state,main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushinteger(self->state,value); - lua_settable(self->state,-3); - free(main_lib_table); -} - -void LuaCEmbed_set_double_lib_prop(LuaCEmbed *self,const char *name,double value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushnumber(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_bool_lib_prop(LuaCEmbed *self,const char *name,bool value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushboolean(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_string_lib_prop(LuaCEmbed *self,const char *name,const char * value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushstring(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_table_lib_prop(LuaCEmbed *self,const char *name,LuaCEmbedTable *value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - lua_pushstring(self->state,name); - lua_getglobal(self->state,value->global_name); - lua_settable(self->state,-3); - -} - -int private_LuaCEmbed_ensure_lib_prop_type(LuaCEmbed *self,const char *name,int expected_type){ - int type = lua_type(self->state,-1); - if(type!= expected_type){ - privateLuaCEmbed_raise_error_not_jumping( - self, - PRIVATE_LUA_CEMBED_LIB_PROP_WRONG_TYPE, - name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - return LUA_CEMBED_OK; -} - -long long LuaCEmbed_get_long_lib_prop(LuaCEmbed *self,const char *name){ - lua_getglobal(self->state,self->main_lib_table); - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_tointeger(self->state,-1); - -} - -double LuaCEmbed_get_double_lib_prop(LuaCEmbed *self,const char *name){ - - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_bool_lib_prop(LuaCEmbed *self,const char *name){ - - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_toboolean(self->state,-1); -} - -char * LuaCEmbed_get_string_lib_prop(LuaCEmbed *self,const char *name){ - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); -} - -LuaCEmbedTable *LuaCEmbed_get_table_lib_prop(LuaCEmbed *self,const char *name){ -; - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_TABLE)){ - return NULL; - } - - char *global_sub_table_name = private_LuaCembed_format( - PRIVATE_LUA_CEMBED_MAIN_LIB_SUB_TABLE, - self->lib_identifier, - name - ); - lua_setglobal(self->state,global_sub_table_name); - - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,global_sub_table_name); - if(possible){ - free(global_sub_table_name); - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s",global_sub_table_name); - free(global_sub_table_name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/lib_props/lib_props.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/lib_props/lib_props.h deleted file mode 100644 index 58f8e59..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/lib_props/lib_props.h +++ /dev/null @@ -1,25 +0,0 @@ - - -void LuaCEmbed_set_long_lib_prop(LuaCEmbed *self,const char *name,long long value); - -void LuaCEmbed_set_double_lib_prop(LuaCEmbed *self,const char *name,double value); - -void LuaCEmbed_set_bool_lib_prop(LuaCEmbed *self,const char *name,bool value); - -void LuaCEmbed_set_string_lib_prop(LuaCEmbed *self,const char *name,const char * value); - -void LuaCEmbed_set_table_lib_prop(LuaCEmbed *self,const char *name,LuaCEmbedTable *value); - -int private_LuaCEmbed_ensure_lib_prop_type(LuaCEmbed *self,const char *name,int expected_type);; - - -long long LuaCEmbed_get_long_lib_prop(LuaCEmbed *self,const char *name); - -double LuaCEmbed_get_double_lib_prop(LuaCEmbed *self,const char *name); - -bool LuaCEmbed_get_bool_lib_prop(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_string_lib_prop(LuaCEmbed *self,const char *name); - -LuaCEmbedTable *LuaCEmbed_get_table_lib_prop(LuaCEmbed *self,const char *name); - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/lib_start/lib_start.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/lib_start/lib_start.c deleted file mode 100644 index e021dc3..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/lib_start/lib_start.c +++ /dev/null @@ -1,66 +0,0 @@ - -int private_LuaCemb_internal_free(lua_State *L){ - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(L, lua_upvalueindex(1)); - if(self->delete_function){ - self->delete_function(self); - } - LuaCEmbed_free(self); - return 0; -} -LuaCEmbed * newLuaCEmbedLib(lua_State *state){ - LuaCEmbed *self = (LuaCEmbed*) malloc(sizeof (LuaCEmbed)); - *self = (LuaCEmbed){0}; - - self->state = state; - - self->lib_identifier = 0; - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_TOTAL_LIBS); - if(lua_type(self->state,-1) == LUA_CEMBED_NIL){ - self->lib_identifier = lua_tointeger(self->state,-1); - } - - self->lib_identifier +=1; - - self->main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - lua_pushinteger(self->state,self->lib_identifier); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_TOTAL_LIBS); - - - self->is_lib = true; - self->global_tables = (void*)newprivateLuaCEmbedTableArray(); - - - UniversalGarbage *garbage = newUniversalGarbage(); - char *lib_meta_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_META_TABLE__,self->lib_identifier); - UniversalGarbage_add_simple(garbage,lib_meta_table); - //creating the metatable - luaL_newmetatable(self->state, lib_meta_table); - //seting the clojure key - lua_pushstring(self->state,PRIVATE_LUA_CEMBED_DEL_PREFIX); - //set self as first clojure argument - lua_pushlightuserdata(self->state,(void*)self); - lua_pushcclosure(self->state,private_LuaCemb_internal_free,1); - lua_settable(self->state, -3); - - - char *lib_main_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - UniversalGarbage_add_simple(garbage,lib_main_table); - //creating the global table to store the elements - lua_newtable(self->state); - lua_setglobal(self->state,lib_main_table); - luaL_setmetatable(self->state, lib_meta_table); - - UniversalGarbage_free(garbage); - return self; -} - -int LuaCembed_perform(LuaCEmbed *self){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - char *lib_main_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - lua_getglobal(self->state,lib_main_table); - free(lib_main_table); - return 1; -} diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/lib_start/lib_start.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/lib_start/lib_start.h deleted file mode 100644 index 8bc3150..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/lib_start/lib_start.h +++ /dev/null @@ -1,6 +0,0 @@ - -int private_LuaCemb_internal_free(lua_State *L); - -LuaCEmbed * newLuaCEmbedLib(lua_State *state); - -int LuaCembed_perform(LuaCEmbed *self); diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/memory/memory.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/memory/memory.c deleted file mode 100644 index 64626f8..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/memory/memory.c +++ /dev/null @@ -1,28 +0,0 @@ - - -void LuaCEmbed_set_memory_limit(LuaCEmbed *self, double limit){ - lua_setallocf(self->state, private_LuaCembed_custom_allocator, &lua_cembed_used_memory); - lua_cembed_memory_limit = limit; -} -static void *private_LuaCembed_custom_allocator(void *ud, void *ptr, size_t osize, size_t nsize) { - int *used = (int *)ud; - - if (ptr == NULL) { - osize = 0; - } - - if (nsize == 0) { - free(ptr); - *used -= osize; /* subtract old size from used memory */ - return NULL; - } else { - long custom_limit = (long)(lua_cembed_memory_limit * PRIVATE_LUA_CEMBED_ONE_MB); - if (*used + (nsize - osize) > custom_limit) /* too much memory in use */ - return NULL; - ptr = realloc(ptr, nsize); - if (ptr) /* reallocation successful? */ - *used += (nsize - osize); - return ptr; - } -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/memory/memory.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/memory/memory.h deleted file mode 100644 index 3975fc5..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/memory/memory.h +++ /dev/null @@ -1,10 +0,0 @@ - - -long lua_cembed_used_memory = 0; -long lua_cembed_memory_limit = -1; - -void LuaCEmbed_set_memory_limit(LuaCEmbed *self, double limit); - - -static void *private_LuaCembed_custom_allocator(void *ud, void *ptr, size_t osize, size_t nsize) ; - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/protection_macros.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/protection_macros.h deleted file mode 100644 index 7164a30..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/protection_macros.h +++ /dev/null @@ -1,24 +0,0 @@ -#define PRIVATE_LUA_CEMBED_PROTECT_VOID \ - if(!self){ \ - return; \ - } - - -#define PRIVATE_LUA_CEMBED_PROTECT_NUM \ - if(!self){ \ - return LUA_CEMBED_GENERIC_ERROR; \ - } - -#define PRIVATE_LUA_CEMBED_PROTECT_BOOL \ - if(!self){ \ - return false; \ - } - -#define PRIVATE_LUA_CEMBED_PROTECT_NULL \ - if(!self){ \ - return NULL; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK if(lua_gettop(self->main_object->state)){lua_settop(self->main_object->state,0);} - -#define PRIVATE_LUA_CEMBED_CLEAR_STACK if(lua_gettop(self->state)){lua_settop(self->state,0);} diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/declaration.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/declaration.h deleted file mode 100644 index da9d43f..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/declaration.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "table/declaration.h" -#include "table_array/table_array.h" -#include "protection_macros.h" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/definition.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/definition.h deleted file mode 100644 index fd0a7b8..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/definition.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "table/definition.h" -#include "table_array/table_array.c" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/protection_macros.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/protection_macros.h deleted file mode 100644 index c21cd13..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/protection_macros.h +++ /dev/null @@ -1,19 +0,0 @@ -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID \ - if(!self){ \ - return; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM \ - if(!self){ \ - return LUA_CEMBED_GENERIC_ERROR; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL \ - if(!self){ \ - return false; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL \ - if(!self){ \ - return NULL; \ - } diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/append/append.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/append/append.c deleted file mode 100644 index 6f914a6..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/append/append.c +++ /dev/null @@ -1,85 +0,0 @@ -void LuaCEmbedTable_append_table(LuaCEmbedTable *self, LuaCEmbedTable *table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_getglobal(self->main_object->state,table->global_name); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_string(LuaCEmbedTable *self, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushstring(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_long(LuaCEmbedTable *self, long long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushnumber(self->main_object->state,(double)value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_double(LuaCEmbedTable *self, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushnumber(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_bool(LuaCEmbedTable *self, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushboolean(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_evaluation(LuaCEmbedTable *self, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - va_list args; - va_start(args,code); - char *buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate( - self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/append/append.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/append/append.h deleted file mode 100644 index 8b29b86..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/append/append.h +++ /dev/null @@ -1,14 +0,0 @@ - - -void LuaCEmbedTable_append_table(LuaCEmbedTable *self, LuaCEmbedTable *table); - - -void LuaCEmbedTable_append_evaluation(LuaCEmbedTable *self, const char *code, ...); - -void LuaCEmbedTable_append_string(LuaCEmbedTable *self, const char *value); - -void LuaCEmbedTable_append_long(LuaCEmbedTable *self, long long value); - -void LuaCEmbedTable_append_double(LuaCEmbedTable *self, double value); - -void LuaCEmbedTable_append_bool(LuaCEmbedTable *self, bool value); \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/basic/basic.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/basic/basic.c deleted file mode 100644 index 550c772..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/basic/basic.c +++ /dev/null @@ -1,65 +0,0 @@ - - - - -LuaCEmbedTable * private_newLuaCembedTable(LuaCEmbed *main_embed, const char *format, ...){ - - LuaCEmbedTable *self = (LuaCEmbedTable*)malloc(sizeof (LuaCEmbedTable)); - *self = (LuaCEmbedTable){0}; - self->main_object =main_embed; - - va_list args; - va_start(args,format); - self->global_name = private_LuaCembed_format_vaarg(format,args); - va_end(args); - - self->sub_tables = (void*)newprivateLuaCEmbedTableArray(); - - return self; -} - - int private_lua_cEmbed_unpack(LuaCEmbedTable *self,const char * previews_function){ - - long size = LuaCEmbedTable_get_listable_size(self); - lua_settop(self->main_object->state, 0); - - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - int total = 0; - - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - - lua_pushvalue(self->main_object->state,-1); - char *formated = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->main_object->stack_leve,total); - - lua_setglobal(self->main_object->state,formated); - free(formated); - lua_pop(self->main_object->state,1); - total+=1; - } - if(previews_function){ - lua_getglobal(self->main_object->state,previews_function); - } - for(int i = 0; i < size; i++){ - char *formated = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->main_object->stack_leve,i); - lua_getglobal(self->main_object->state,formated); - free(formated); - } - - return (int)size; -} -void privateLuaCEmbedTable_free(LuaCEmbedTable *self){ - - free(self->global_name); - - if(self->prop_name){ - free(self->prop_name); - } - - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->sub_tables); - free(self); -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/basic/basic.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/basic/basic.h deleted file mode 100644 index 6c03fab..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/basic/basic.h +++ /dev/null @@ -1,9 +0,0 @@ - - -LuaCEmbedTable * private_newLuaCembedTable(LuaCEmbed *main_embed, const char *format, ...); - -int private_lua_cEmbed_unpack(LuaCEmbedTable *self,const char * previews_function); - -void privateLuaCEmbedTable_free(LuaCEmbedTable *self); - -void privateLuaCEmbedTable_free_setting_nill(LuaCEmbedTable *self); \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/declaration.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/declaration.h deleted file mode 100644 index bbecb17..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/declaration.h +++ /dev/null @@ -1,8 +0,0 @@ -#include "table.h" -#include "basic/basic.h" -#include "getters/declaration.h" -#include "setters/declaration.h" -#include "errors/errors.h" -#include "sub_tables/declaration.h" -#include "append/append.h" -#include "destroy/destroy.h" diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/definition.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/definition.h deleted file mode 100644 index 02a20e6..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/definition.h +++ /dev/null @@ -1,8 +0,0 @@ - -#include "basic/basic.c" -#include "getters/definition.h" -#include "setters/definition.h" -#include "errors/errors.c" -#include "sub_tables/definition.h" -#include "append/append.c" -#include "destroy/destroy.c" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/destroy/destroy.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/destroy/destroy.c deleted file mode 100644 index 90da9b0..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/destroy/destroy.c +++ /dev/null @@ -1,52 +0,0 @@ - - -void LuaCembedTable_destroy_prop(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnil(self->main_object->state); - lua_settable(self->main_object->state,-3); -} -void LuaCEmbedTable_destroy_by_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(LuaCembedTable_has_key_at_index(self,index)){ - char *key = LuaCembedTable_get_key_by_index(self,index); - LuaCembedTable_destroy_prop(self,key); - return; - } - - lua_getglobal(self->main_object->state,self->global_name); - - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int table_index = lua_gettop(self->main_object->state); - int total = 0; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total >= converted_index){ - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)(total)); - lua_pushvalue(self->main_object->state,-3); - lua_settable(self->main_object->state,-3); - lua_pop(self->main_object->state,1); - - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,total); - lua_pushnil(self->main_object->state); - lua_settable(self->main_object->state,-3); - - - -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/destroy/destroy.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/destroy/destroy.h deleted file mode 100644 index 23f506d..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/destroy/destroy.h +++ /dev/null @@ -1,5 +0,0 @@ - - -void LuaCembedTable_destroy_prop(LuaCEmbedTable *self, const char *name); - -void LuaCEmbedTable_destroy_by_index(LuaCEmbedTable *self, long index); \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/errors/errors.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/errors/errors.c deleted file mode 100644 index b56a963..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/errors/errors.c +++ /dev/null @@ -1,42 +0,0 @@ - - - -int privateLuaCEmbedTable_ensure_type_with_key(LuaCEmbedTable *self, const char *name, int expected_type){ - if(!self){ - return LUA_CEMBED_GENERIC_ERROR; - } - - int type = lua_type(self->main_object->state,-1); - if(type == expected_type){ - return LUA_CEMBED_OK; - } - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_PROPETY, - name, - self->global_name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} - -int privateLuaCEmbedTable_ensure_type_with_index(LuaCEmbedTable *self, long index, int expected_type){ - if(!self){ - return LUA_CEMBED_GENERIC_ERROR; - } - - int type = lua_type(self->main_object->state,-1); - if(type == expected_type){ - return LUA_CEMBED_OK; - } - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/errors/errors.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/errors/errors.h deleted file mode 100644 index 0474819..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/errors/errors.h +++ /dev/null @@ -1,4 +0,0 @@ - -int privateLuaCEmbedTable_ensure_type_with_key(LuaCEmbedTable *self, const char *name, int expected_type); - -int privateLuaCEmbedTable_ensure_type_with_index(LuaCEmbedTable *self, long index, int expected_type); diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/declaration.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/declaration.h deleted file mode 100644 index 11daa6f..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/declaration.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "index/index.h" -#include "keys/keys.h" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/definition.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/definition.h deleted file mode 100644 index 92a5e82..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/definition.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "index/index.c" -#include "keys/keys.c" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/index/index.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/index/index.c deleted file mode 100644 index 0c2e505..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/index/index.c +++ /dev/null @@ -1,277 +0,0 @@ - - -long LuaCEmbedTable_get_full_size(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - - - lua_getglobal(self->main_object->state,self->global_name); - int index = lua_gettop(self->main_object->state); - long total = 0; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,index)){ - total+=1; - lua_pop(self->main_object->state,1); - } - - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return total; -} - -long LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - lua_getglobal(self->main_object->state,self->global_name); - return (long)lua_rawlen(self->main_object->state,-1); -} - - -long privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cembed_incremented_arg index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - if(index >= 0){ - return index; - } - - return LuaCEmbedTable_get_full_size(self) + index; -} - -int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - int type = lua_type(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return type; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_NOT_FOUND; -} -char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - - if(total == converted_index){ - if(lua_type(self->main_object->state,-2) != LUA_CEMBED_STRING ){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - char* result = (char*)lua_tostring(self->main_object->state,-2); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - - lua_pop(self->main_object->state,1); - total+=1; - - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} -bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - lua_settop(self->main_object->state,0); - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - bool has_key =lua_type(self->main_object->state,-2) == LUA_CEMBED_STRING; - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return has_key; - } - - lua_pop(self->main_object->state,1); - total+=1; - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return false; -} - -long long LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - lua_settop(self->main_object->state,0); - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_NUMBER)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - long result = (long)lua_tonumber(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_NUMBER) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} - -double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_NUMBER)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - double result = (double )lua_tonumber(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_NUMBER) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} - -char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_STRING)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - char * result = (char*)lua_tostring(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_STRING) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} - -bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_BOOL)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - bool result = lua_toboolean(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - converted_index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_BOOL) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/index/index.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/index/index.h deleted file mode 100644 index f72364d..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/index/index.h +++ /dev/null @@ -1,24 +0,0 @@ - - -char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, long index); - -bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, long index); - -long LuaCEmbedTable_get_full_size(LuaCEmbedTable *self); - -long LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self); - - -long privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cembed_incremented_arg index); - -int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, int index); - -long long LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, int index); - -double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, int index); - -char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, int index); - -bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, int index); - - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/keys/keys.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/keys/keys.c deleted file mode 100644 index 7f77463..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/keys/keys.c +++ /dev/null @@ -1,69 +0,0 @@ - -int LuaCEmbedTable_get_type_prop(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - return lua_type(self->main_object->state,-1); - -} - -char* LuaCembedTable_get_string_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_STRING)){ - return NULL; - } - - char *value = (char*)lua_tostring(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - - -long long LuaCembedTable_get_long_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - long long value = (long long)lua_tonumber(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - -double LuaCembedTable_get_double_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - double value = (double )lua_tonumber(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - -bool LuaCembedTable_get_bool_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - bool value = lua_toboolean(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/keys/keys.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/keys/keys.h deleted file mode 100644 index ec5de2b..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/getters/keys/keys.h +++ /dev/null @@ -1,12 +0,0 @@ - - - -char* LuaCembedTable_get_string_prop(LuaCEmbedTable *self, const char *name); - -long long LuaCembedTable_get_long_prop(LuaCEmbedTable *self, const char *name); - -double LuaCembedTable_get_double_prop(LuaCEmbedTable *self, const char *name); - -bool LuaCembedTable_get_bool_prop(LuaCEmbedTable *self, const char *name); - -int LuaCEmbedTable_get_type_prop(LuaCEmbedTable *self, const char *name); diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/declaration.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/declaration.h deleted file mode 100644 index caac5e4..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/declaration.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "index/index.h" -#include "keys/keys.h" -#include "insert/insert.h" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/definition.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/definition.h deleted file mode 100644 index c99d93c..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/definition.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "index/index.c" -#include "keys/keys.c" -#include "insert/insert.c" diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/index/index.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/index/index.c deleted file mode 100644 index c608625..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/index/index.c +++ /dev/null @@ -1,98 +0,0 @@ - - -void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, long index, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_string_prop(self,possible_key,value); - return; - } - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushstring(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_long_by_index(LuaCEmbedTable *self, long long index, long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_long_prop(self,possible_key,value); - return; - } - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushnumber(self->main_object->state,(double )value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, long index, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_double_prop(self,possible_key,value); - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushnumber(self->main_object->state,(double )value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, long index, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_bool_prop(self,possible_key,value); - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushboolean(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - - -void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, long index, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - va_list args; - va_start(args,code); - char * buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate(self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/index/index.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/index/index.h deleted file mode 100644 index 1fce205..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/index/index.h +++ /dev/null @@ -1,11 +0,0 @@ - -void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, long index, const char *value); - -void LuaCEmbedTable_set_long_by_index(LuaCEmbedTable *self, long long index, long value); - -void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, long index, double value); - -void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, long index, bool value); - - -void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, long index, const char *code, ...); diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/insert/insert.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/insert/insert.c deleted file mode 100644 index 8763c59..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/insert/insert.c +++ /dev/null @@ -1,118 +0,0 @@ - -void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, long formatted_index){ - - - lua_newtable(self->main_object->state); - lua_setglobal(self->main_object->state,PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - - lua_getglobal(self->main_object->state, self->global_name); - int table_index = lua_gettop(self->main_object->state); - int total = 1; - lua_pushnil(self->main_object->state); // Empilhando o primeiro par chave-valor - while (lua_next(self->main_object->state, table_index)) { - - if (total >= formatted_index) { - lua_getglobal(self->main_object->state, PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - lua_pushinteger(self->main_object->state, total + 1); - lua_pushvalue(self->main_object->state, -3); - lua_settable(self->main_object->state, -3); - lua_pop(self->main_object->state, 1); - } - lua_pop(self->main_object->state, 1); // Removendo o valor atual - total+=1; - } - - lua_getglobal(self->main_object->state, PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - table_index = lua_gettop(self->main_object->state); - lua_pushnil(self->main_object->state); - - while (lua_next(self->main_object->state, table_index)) { - lua_getglobal(self->main_object->state,self->global_name); - lua_pushvalue(self->main_object->state,-3); //table[index] = stage_area[index] - lua_pushvalue(self->main_object->state,-3); //table[index] = stage_area[index] - lua_settable(self->main_object->state,-3); - lua_pop(self->main_object->state, 2); // Removendo o valor atual - } - - lua_getglobal(self->main_object->state, "stage_arrea"); - lua_pushnil(self->main_object->state); -} - -void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, long index, const char *value) { - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushstring(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - - -void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, long index,bool value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushboolean(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, long long index,long value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushinteger(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, long index,double value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushnumber(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_table_at_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *table){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_getglobal(self->main_object->state,table->global_name); - lua_settable(self->main_object->state, -3); - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/insert/insert.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/insert/insert.h deleted file mode 100644 index c226d8f..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/insert/insert.h +++ /dev/null @@ -1,14 +0,0 @@ - - -void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, long formatted_index); - -void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, long index, const char *value); - -void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, long index,bool value); - -void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, long long index,long value); - -void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, long index,double value); - -void LuaCEmbedTable_insert_table_at_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *table); - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/keys/keys.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/keys/keys.c deleted file mode 100644 index b031400..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/keys/keys.c +++ /dev/null @@ -1,128 +0,0 @@ - - - - -void LuaCEmbedTable_set_method(LuaCEmbedTable *self , const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - bool is_meta = false; - - if(strlen(name) > 3){ - if(name[0] == '_' && name[1] == '_' ){ - is_meta = true; - } - } - lua_getglobal(self->main_object->state,self->global_name); - - if(is_meta){ - - - int found =lua_getmetatable(self->main_object->state,-1); - if(!found){ - - //equivalent of meta ={} ;setmetatable(table,meta) - lua_getglobal(self->main_object->state,self->global_name); - lua_newtable(self->main_object->state); - lua_setmetatable(self->main_object->state,-2); - - lua_getglobal(self->main_object->state,self->global_name); - lua_getmetatable(self->main_object->state,-1); - } - } - - - lua_pushstring(self->main_object->state,name); - //creating the clojure - - lua_pushboolean(self->main_object->state,true);//is a method - - lua_pushlightuserdata(self->main_object->state,(void*)self->main_object); //self - lua_pushstring(self->main_object->state,name);//calback name - lua_getglobal(self->main_object->state,self->global_name);//table - lua_pushlightuserdata(self->main_object->state,(void*)callback); - - //add these clojure to be handled by the callbacks - lua_pushcclosure(self->main_object->state,privateLuaCEmbed_main_callback_handler,5); - lua_settable(self->main_object->state,-3); - - if(is_meta){ - //equivalent of meta ={} ;setmetatable(table,meta) - lua_getglobal(self->main_object->state,self->global_name); - lua_getmetatable(self->main_object->state,-1); - lua_setmetatable(self->main_object->state,-2); - } - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_string_prop(LuaCEmbedTable *self , const char *name, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushstring(self->main_object->state,value); - - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_long_prop(LuaCEmbedTable *self , const char *name, long long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnumber(self->main_object->state,(double)value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_double_prop(LuaCEmbedTable *self , const char *name, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnumber(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_bool_prop(LuaCEmbedTable *self , const char *name, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushboolean(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_evaluation_prop(LuaCEmbedTable *self, const char *name, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - va_list args; - va_start(args,code); - char *buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate(self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/keys/keys.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/keys/keys.h deleted file mode 100644 index 45f9f48..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/setters/keys/keys.h +++ /dev/null @@ -1,18 +0,0 @@ - - - - - -void LuaCEmbedTable_set_method(LuaCEmbedTable *self, const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)); - -void LuaCEmbedTable_set_string_prop(LuaCEmbedTable *self, const char *name, const char *value); - -void LuaCEmbedTable_set_long_prop(LuaCEmbedTable *self, const char *name, long long value); - -void LuaCEmbedTable_set_double_prop(LuaCEmbedTable *self, const char *name, double value); - -void LuaCEmbedTable_set_bool_prop(LuaCEmbedTable *self, const char *name, bool value); - - -void LuaCEmbedTable_set_evaluation_prop(LuaCEmbedTable *self, const char *name, const char *code, ...); - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/declaration.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/declaration.h deleted file mode 100644 index 0e30419..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/declaration.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "key/key.h" -#include "index/index.h" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/definition.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/definition.h deleted file mode 100644 index 78d5a47..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/definition.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "key/key.c" -#include "index/index.c" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/index/index.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/index/index.c deleted file mode 100644 index 8daf216..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/index/index.c +++ /dev/null @@ -1,131 +0,0 @@ - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_appending(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - - //equivalent of: full_sub_table_name = {} - long index= LuaCEmbedTable_get_listable_size(self) +1; - char *full_sub_table_name = private_LuaCembed_format("%s_%d", self->global_name, index); - lua_newtable(self->main_object->state); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - //equivalent of: table[index] = full_sub_table_name - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,index); - lua_getglobal(self->main_object->state,full_sub_table_name); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_internal_index( - (privateLuaCEmbedTableArray *) self->sub_tables, - index - ); - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->index = index; - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; -} - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, long index){ - - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_TABLE)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - - //equivalent of full_sub_table_name = table[index] - char *full_sub_table_name = private_LuaCembed_format("%s_%d", self->global_name, index); - lua_setglobal(self->main_object->state,full_sub_table_name); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_internal_index( - (privateLuaCEmbedTableArray *) self->sub_tables, - index - ); - - if(possible){ - free(full_sub_table_name); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->index = index; - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_TABLE) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} - -void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_sub_table_prop(self,possible_key,sub_table); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,formatted_index); - lua_getglobal(self->main_object->state,sub_table->global_name); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK -} diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/index/index.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/index/index.h deleted file mode 100644 index 3244198..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/index/index.h +++ /dev/null @@ -1,12 +0,0 @@ - - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_appending(LuaCEmbedTable *self); - - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, long index); - - -void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table); - - - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/key/key.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/key/key.c deleted file mode 100644 index d82f31a..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/key/key.c +++ /dev/null @@ -1,110 +0,0 @@ - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_by_key(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - //equivalent of: table.sub_table = {} - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_newtable(self->main_object->state); - lua_settable(self->main_object->state,-3); - - - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state, name); - lua_gettable(self->main_object->state, -2); - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_prop_name( - (privateLuaCEmbedTableArray *) self->sub_tables, - name - ); - - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->prop_name = strdup(name); - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; -} - - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_key(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_TABLE)){ - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_prop_name( - (privateLuaCEmbedTableArray *) self->sub_tables, - name - ); - - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->prop_name = strdup(name); - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; - -} - - - -void LuaCEmbedTable_set_sub_table_prop(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - //equivalent of table.name = sub_table; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_getglobal(self->main_object->state,sub_table->global_name); - lua_settable(self->main_object->state,-3); - - - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/key/key.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/key/key.h deleted file mode 100644 index ac17850..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/sub_tables/key/key.h +++ /dev/null @@ -1,6 +0,0 @@ - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_by_key(LuaCEmbedTable *self, const char *name); - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_key(LuaCEmbedTable *self, const char *name); - -void LuaCEmbedTable_set_sub_table_prop(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table); \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/table.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/table.h deleted file mode 100644 index a8e5391..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table/table.h +++ /dev/null @@ -1,10 +0,0 @@ - - -typedef struct { - LuaCEmbed *main_object; - char *prop_name; - char *global_name; - void *sub_tables; - long index; - -}LuaCEmbedTable; diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table_array/table_array.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table_array/table_array.c deleted file mode 100644 index ff47a8f..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table_array/table_array.c +++ /dev/null @@ -1,62 +0,0 @@ - - -privateLuaCEmbedTableArray *newprivateLuaCEmbedTableArray(){ - privateLuaCEmbedTableArray *self = (privateLuaCEmbedTableArray*) malloc(sizeof (privateLuaCEmbedTableArray)); - *self = (privateLuaCEmbedTableArray){0}; - self->tables = (LuaCEmbedTable**)malloc(0); - return self; -} - -void privateLuaCEmbedTableArray_append(privateLuaCEmbedTableArray *self,LuaCEmbedTable *element){ - - self->tables = (LuaCEmbedTable **)realloc( - self->tables, - (self->size+1)* sizeof (LuaCEmbedTable**) - ); - self->tables[self->size] = element; - self->size+=1; -} - - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_prop_name(privateLuaCEmbedTableArray *self, const char *name){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(current_table->prop_name){ - if(strcmp(current_table->prop_name,name) ==0){ - return current_table; - } - } - } - return NULL; -} - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_global_name(privateLuaCEmbedTableArray *self, const char *name){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(strcmp(current_table->global_name,name) ==0){ - return current_table; - } - } - return NULL; -} - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_internal_index(privateLuaCEmbedTableArray *self, long internal_index){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(current_table->index == internal_index){ - return current_table; - } - } - return NULL; -} - -void privateLuaCEmbedTableArray_free(privateLuaCEmbedTableArray *self){ - - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - privateLuaCEmbedTable_free(current_table); - } - - free(self->tables); - free(self); -} diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table_array/table_array.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table_array/table_array.h deleted file mode 100644 index 4c878ca..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbed/table/table_array/table_array.h +++ /dev/null @@ -1,20 +0,0 @@ - - -typedef struct { - - LuaCEmbedTable **tables; - long size; - -}privateLuaCEmbedTableArray; - -privateLuaCEmbedTableArray *newprivateLuaCEmbedTableArray(); - -void privateLuaCEmbedTableArray_append(privateLuaCEmbedTableArray *self,LuaCEmbedTable *element); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_global_name(privateLuaCEmbedTableArray *self, const char *name); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_prop_name(privateLuaCEmbedTableArray *self, const char *name); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_internal_index(privateLuaCEmbedTableArray *self, long internal_index); - -void privateLuaCEmbedTableArray_free(privateLuaCEmbedTableArray *self); diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbedResponse/LuaCEmbedResponse.c b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbedResponse/LuaCEmbedResponse.c deleted file mode 100644 index 58b6912..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbedResponse/LuaCEmbedResponse.c +++ /dev/null @@ -1,117 +0,0 @@ - - - -LuaCEmbedResponse *private_LuaCEmbedReturn_raw(){ - LuaCEmbedResponse *self = (LuaCEmbedResponse*)malloc(sizeof(LuaCEmbedResponse)); - *self = (LuaCEmbedResponse){0}; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_bool(bool value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_BOOL_RESPONSE; - self->num_val = (double)value; - return self; -} - - -LuaCEmbedResponse * LuaCEmbed_send_str(const char *text){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = (long)strlen(text); - self->string_val = (char*)malloc(sizeof(char) * self->string_size +1); - memcpy(self->string_val,text,self->string_size); - self->string_val[self->string_size] = '\0'; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_raw_string(const char *text,long size){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = size; - self->string_val = (char*)malloc(sizeof(char) * self->string_size +1); - memcpy(self->string_val,text,self->string_size); - self->string_val[self->string_size] = '\0'; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_str_reference(const char *text){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = (long)strlen(text); - self->string_val = (char*)text; - self->its_string_ref = true; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_raw_string_reference(const char *text,long size){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = size; - self->string_val = (char*)text; - self->its_string_ref = true; - return self; -} - - - -LuaCEmbedResponse * LuaCEmbed_send_error(const char *format,...){ - - va_list args; - va_start(args,format); - char *error = private_LuaCembed_format_vaarg(format,args); - va_end(args); - - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_ERROR_RESPONSE; - self->string_val = error; - return self; -} - - -LuaCEmbedResponse * LuaCEmbed_send_multi_return(LuaCEmbedTable *table){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_MULTI_RESPONSE; - lua_getglobal(table->main_object->state,table->global_name); - lua_setglobal(table->main_object->state,PRIVATE_LUA_CEMBED_TABLE_RETURN); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_table(LuaCEmbedTable *table){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_TABLE_RESPONSE; - lua_getglobal(table->main_object->state,table->global_name); - lua_setglobal(table->main_object->state,PRIVATE_LUA_CEMBED_TABLE_RETURN); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_evaluation(const char *code){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_EVALUATION; - self->string_val = strdup(code); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_double(double value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE; - self->num_val = value; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_long(long value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_LONG_RESPONSE; - self->num_val = (double)value; - return self; -} - - - -void private_LuaCEmbedResponse_free(LuaCEmbedResponse *self){ - - if(self->string_val && self->its_string_ref == false){ - free(self->string_val); - } - free(self); -} diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbedResponse/LuaCEmbedResponse.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbedResponse/LuaCEmbedResponse.h deleted file mode 100644 index 0d5e909..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbedResponse/LuaCEmbedResponse.h +++ /dev/null @@ -1,40 +0,0 @@ - -typedef struct { - - int type; - double num_val; - bool its_string_ref; - long string_size; - char *string_val; - -}LuaCEmbedResponse; - -LuaCEmbedResponse *private_LuaCEmbedReturn_raw(); - - -LuaCEmbedResponse * LuaCEmbed_send_str(const char *text); - -LuaCEmbedResponse * LuaCEmbed_send_raw_string(const char *text,long size); - -LuaCEmbedResponse * LuaCEmbed_send_str_reference( const char *text); - -LuaCEmbedResponse * LuaCEmbed_send_raw_string_reference(const char *text,long size); - -LuaCEmbedResponse * LuaCEmbed_send_error(const char *format,...); - - -LuaCEmbedResponse * LuaCEmbed_send_evaluation(const char *code); - - - - - -LuaCEmbedResponse * LuaCEmbed_send_double(double value); - -LuaCEmbedResponse * LuaCEmbed_send_bool(bool value); - - -LuaCEmbedResponse * LuaCEmbed_send_long(long value); - - -void private_LuaCEmbedResponse_free(LuaCEmbedResponse *self); diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbedResponse/LuaCembedResponse_pt2.h b/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbedResponse/LuaCembedResponse_pt2.h deleted file mode 100644 index 353c88b..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/LuaCEmbedResponse/LuaCembedResponse_pt2.h +++ /dev/null @@ -1,6 +0,0 @@ - - -LuaCEmbedResponse * LuaCEmbed_send_table(LuaCEmbedTable *table); - - -LuaCEmbedResponse * LuaCEmbed_send_multi_return(LuaCEmbedTable *table); diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/constants/all.h b/build/c/dependencies/CTextEngine/luaCEmbed/constants/all.h deleted file mode 100644 index e72bb69..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/constants/all.h +++ /dev/null @@ -1,6 +0,0 @@ -#include "main_callback.h" -#include "types.h" -#include "responses.h" -#include "lua_code.h" -#include "errors.h" -#include "aplication.h" diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/constants/aplication.h b/build/c/dependencies/CTextEngine/luaCEmbed/constants/aplication.h deleted file mode 100644 index 0d1ca0f..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/constants/aplication.h +++ /dev/null @@ -1,10 +0,0 @@ -#ifndef LUA_CEMBED_INDEX_DIF -#define LUA_CEMBED_INDEX_DIF 1 -#endif - -#define PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE 1 -#define PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE 2 -#define LUA_CEMBED_DEFAULT_TIMEOUT 10 -#define LUA_CEMBED_DEFAULT_MEMORY_LIMIT 100 - -#define PRIVATE_LUA_CEMBED_ONE_MB (1024 * 1024) diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/constants/errors.h b/build/c/dependencies/CTextEngine/luaCEmbed/constants/errors.h deleted file mode 100644 index 2c384ea..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/constants/errors.h +++ /dev/null @@ -1,15 +0,0 @@ - - -#define PRIVATE_LUA_CEMBED_TIMEOUT_ERROR "timeout error" -#define PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED "arg %ld at function:%s not provided" -#define PRIVATE_LUA_CEMBED_ARG_WRONG_TYPE "arg %d at function:%s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_GLOBAL_WRONG_TYPE "global variable:%s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_RESULT_EVALUATION_WRONG_TYPE "result evaluation its:%s instead of %s" -#define PRIVATE_LUA_CEMBED_RESULT_EVALUATION_ARG_WRONG_TYPE "result evaluation of function %s at index %d its:%s instead of %s" - -#define PRIVATE_LUA_CEMBED_CODE_ITS_NOT_A_FUNCTION "value %s its not a function" -#define PRIVATE_LUA_CEMBED_WRONG_TYPE_PROPETY "propety %s at object %s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX "index %d at object %s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_ELEMENT_DOES_NOT_HAVE_KEY "index %d at object %s not have a key" -#define PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR "timeout error" -#define PRIVATE_LUA_CEMBED_LIB_PROP_WRONG_TYPE "lib prop %s its %s insteadd of %s" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/constants/lua_code.h b/build/c/dependencies/CTextEngine/luaCEmbed/constants/lua_code.h deleted file mode 100644 index 59da360..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/constants/lua_code.h +++ /dev/null @@ -1,23 +0,0 @@ - -#define PRIVATE_LUA_CEMBED_TOTAL_LIBS "private_lua_c_embed_total_running_libs" -#define PRIVATE_LUA_CEMBED_STACK_LEVEL "private_lua_c_embed_stack_level" - -#define PRIVATE_LUA_CEMBED_EVALUATION_NAME "private_lua_c_embed_evaluation" -#define PRIVATE_LUA_CEMBED_DEL_PREFIX "__gc" -#define PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE "%s = %s\n" - - - - -#define PRIVATE_LUA_CEMBED_SELFNAME "private_lua_c_embed_self" -#define PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE "private_lua_c_embed_stage_area_table" -#define PRIVATE_LUA_CEMBED_TABLE_RETURN "private_lua_embed_table_return" - -#define PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__ "private_lua_c_embed_main_lib_table_%d" -#define PRIVATE_LUA_CEMBED_MAIN_LIB_SUB_TABLE "private_lua_c_embed_main_lib_table_%d_%s" - -#define PRIVATE_LUA_CEMBED_MAIN_META_TABLE__ "private_lua_c_embed_main_meta_table_%d" -#define PRIVATE_LUA_CEMBED_ANONYMOUS_TABLE_ "private_lua_c_embed_anononymous_table_%d_%d" -#define PRIVATE_LUA_CEMBED_ANONYMOUS_FUNC_TABLE_ "private_lua_c_embed_anononymous_func_table_%d_%d" -#define PRIVATE_LUA_CEMBED_ARGS_ "private_lua_c_embed_args_%d_%d" -#define PRIVATE_LUA_CEMBED_MULTIRETURN_ "private_lua_c_embed_multi_return_%d_%d" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/constants/main_callback.h b/build/c/dependencies/CTextEngine/luaCEmbed/constants/main_callback.h deleted file mode 100644 index 71d2f20..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/constants/main_callback.h +++ /dev/null @@ -1,4 +0,0 @@ - -#define PRIVATE_LUACEMBED_NO_RETURN 0 -#define PRIVATE_LUACEMBED_ONE_RETURN 1 - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/constants/responses.h b/build/c/dependencies/CTextEngine/luaCEmbed/constants/responses.h deleted file mode 100644 index 897978e..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/constants/responses.h +++ /dev/null @@ -1,12 +0,0 @@ -#define PRIVATE_LUA_CEMBED_STRING_RESPONSE 1 -#define PRIVATE_LUA_CEMBED_LONG_RESPONSE 2 -#define PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE 3 -#define PRIVATE_LUA_CEMBED_BOOL_RESPONSE 4 -#define PRIVATE_LUA_CEMBED_TABLE_RESPONSE 5 - -#define PRIVATE_LUA_CEMBED_EVALUATION 6 -#define PRIVATE_LUA_CEMBED_ERROR_RESPONSE 7 -#define PRIVATE_LUA_CEMBED_MULTI_RESPONSE 8 - -#define LUA_CEMBED_OK 0 -#define LUA_CEMBED_GENERIC_ERROR (-1) \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/constants/types.h b/build/c/dependencies/CTextEngine/luaCEmbed/constants/types.h deleted file mode 100644 index d00b857..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/constants/types.h +++ /dev/null @@ -1,17 +0,0 @@ -#define LUA_CEMBED_NOT_FOUND LUA_TNONE -#define LUA_CEMBED_STRING LUA_TSTRING -#define LUA_CEMBED_NUMBER LUA_TNUMBER -#define LUA_CEMBED_BOOL LUA_TBOOLEAN -#define LUA_CEMBED_NIL LUA_TNIL -#define LUA_CEMBED_FUNCTION LUA_TFUNCTION -#define LUA_CEMBED_TABLE LUA_TTABLE - -#define PRIVATE_LUA_CEMBED_NOT_FOUND_STRING "not Found" -#define PRIVATE_LUA_CEMBED_STRING_STRING "string" -#define PRIVATE_LUA_CEMBED_NUMBER_STRING "number" -#define PRIVATE_LUA_CEMBED_BOOL_STRING "boolean" -#define PRIVATE_LUA_CEMBED_NIL_STRING "nil" -#define PRIVATE_LUA_CEMBED_TABLE_STRING "table" -#define PRIVATE_LUA_CEMBED_FUNCTION_STRING "function" - -#define PRIVATE_LUA_CEMBED_UNKNOW_STRING "unknow" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/declaration.h b/build/c/dependencies/CTextEngine/luaCEmbed/declaration.h deleted file mode 100644 index 3361d02..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/declaration.h +++ /dev/null @@ -1,19 +0,0 @@ -#ifdef _WIN32 -#include -#else -#include -#include -#endif - -#include -#include -#include -#include -#include "dependencies/dependencies.h" -#include "constants/all.h" -#include "LuaCEmbedResponse/LuaCEmbedResponse.h" -#include "LuaCEmbed/declaration.h" -#include "LuaCEmbedResponse/LuaCembedResponse_pt2.h" - -#include "extra/extra.h" -#include "namespace/declaration.h" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/definition.h b/build/c/dependencies/CTextEngine/luaCEmbed/definition.h deleted file mode 100644 index 7efa5f0..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/definition.h +++ /dev/null @@ -1,4 +0,0 @@ -#include "LuaCEmbedResponse/LuaCEmbedResponse.c" -#include "LuaCEmbed/definition.h" -#include "extra/extra.c" -#include "namespace/definition.h" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/UniversalGarbage.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/UniversalGarbage.h deleted file mode 100644 index 6ba5987..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/UniversalGarbage.h +++ /dev/null @@ -1,321 +0,0 @@ - - - -#ifndef UNIVERSAL_GARBAGE_H - - -#include -#include -#include -#include - - - - - -#define UniversalGarbage_create_empty_struct(name,element_type) \ -(element_type*)malloc(sizeof(element_type)); \ -*name = (element_type){0}; - - -#define UniversalGarbage_cast(value) ((void**)&value) - - -#define UniversalGarbage_add(garbage,deallocator_callback,value) \ - rawUniversalGarbage_add(garbage,(void*)deallocator_callback,UniversalGarbage_cast(value)) - -#define UniversalGarbage_add_simple(garbage,value) \ - UniversalGarbage_add(garbage,free,value) - - -#define UniversalGarbage_add_return(garbage,deallocator_callback,value) \ - UniversalGarbage_add(garbage->return_values,deallocator_callback,value) - - -#define UniversalGarbage_add_simple_return(garbage,value) \ - UniversalGarbage_add_simple(garbage->return_values,value) - - - -#define UniversalGarbage_remove(garbage,value) \ - rawUniversalGarbage_remove(garbage,UniversalGarbage_cast(value)); - - -#define UniversalGarbage_disconnect(garbage,value) \ - rawUniversalGarbage_disconnect(garbage,UniversalGarbage_cast(value)); - - - - -#define UniversalGarbage_reallocate(garbage,value) \ - rawUniversalGarbage_reallocate(garbage,UniversalGarbage_cast(value)) - - -#define UniversalGarbage_resset(garbage,value) \ - rawUniversalGarbage_resset(garbage,UniversalGarbage_cast(value)) - - - - - - -typedef struct privateUniversalGarbageElement{ - void **pointer; - void (*deallocator_callback)(void *element); - void *pointed_value; -}privateUniversalGarbageElement; - -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self); - - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self); - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer); - - - -typedef struct UniversalGarbage{ - - struct UniversalGarbage *return_values; - privateUniversalGarbageElement **elements; - int elements_size; - bool is_the_root; - -}UniversalGarbage; - -UniversalGarbage * newUniversalGarbage(); - -UniversalGarbage * private_new_MainUniversalGarbage(); - - - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer); - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self); - -void UniversalGarbage_free_including_return(UniversalGarbage *self); - -void UniversalGarbage_free(UniversalGarbage *self); - - - - - - - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer){ - - privateUniversalGarbageElement * self = UniversalGarbage_create_empty_struct( - self, - privateUniversalGarbageElement - ); - self->pointer = pointer; - self->deallocator_callback = dealocator_callback; - self->pointed_value = *pointer; - return self; -} -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self){ - if(self->pointed_value){ - self->deallocator_callback(self->pointed_value); - self->pointed_value = NULL; - } -} - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self){ - private_UniversalGarbageSimpleElement_free_pointed_value(self); - free(self); -} - - -UniversalGarbage * private_new_MainUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->is_the_root = false; - return self; -} - -UniversalGarbage * newUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->is_the_root = true; - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->return_values =private_new_MainUniversalGarbage(); - - return self; -} - - - - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - - if(rawUniversalGarbage_reallocate(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - - privateUniversalGarbageElement *current = self->elements[i]; - bool reallocate = current->pointer == pointer; - - if(reallocate){ - current->pointed_value = *pointer; - return true; - } - } - return false; -} - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - if(rawUniversalGarbage_resset(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - bool resset = current->pointer == pointer; - if(resset){ - private_UniversalGarbageSimpleElement_free_pointed_value(current); - current->pointed_value = *pointer; - return true; - } - } - return false; - -} -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_remove(self->return_values,pointer)){ - *pointer = NULL; - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - private_UniversalGarbageSimpleElement_free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - - } - *pointer = NULL; - return true; - } - } - return false; -} -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_disconnect(self->return_values,pointer)){ - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - } - return true; - } - } - return false; - - - -} -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer){ - - if(!pointer){ - return false; - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - return false; - } - } - - self->elements = (privateUniversalGarbageElement**)realloc( - self->elements, - (self->elements_size + 1) * sizeof(privateUniversalGarbageElement*) - ); - void (*dealocator_callback)(void *element); -#ifdef __cplusplus - dealocator_callback =reinterpret_cast(release_callback); -#else - dealocator_callback = (void*)(void*)release_callback; - -#endif - - - - self->elements[self->elements_size] = private_newUniversalGarbageSimpleElement(dealocator_callback, pointer); - self->elements_size+=1; - return true; -} - - - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self){ - for(int i = 0; i < self->elements_size; i++){ - private_UniversalGarbageSimpleElement_free(self->elements[i]); - } - free(self->elements); -} - -void UniversalGarbage_free_including_return(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - if(self->is_the_root){ - UniversalGarbage_free(self->return_values); - } - free(self); -} - -void UniversalGarbage_free(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - - if(self->is_the_root){ - - UniversalGarbage *return_garbage = self->return_values; - for(int i = 0; i < return_garbage->elements_size; i++){ - free(return_garbage->elements[i]); - } - - free(return_garbage->elements); - free(return_garbage); - } - - - free(self); -} - - - - -#define UNIVERSAL_GARBAGE_H -#endif \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/dependencies.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/dependencies.h deleted file mode 100644 index 383bdb8..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/dependencies.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "UniversalGarbage.h" -#include "lua/onelua.c" diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/custom_math/custom_math.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/custom_math/custom_math.c deleted file mode 100644 index 2b189e8..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/custom_math/custom_math.c +++ /dev/null @@ -1,44 +0,0 @@ -double private_lua_embed_fmod(double x, double y) { - while (y != 0.0) { - while (x >= y) { - x -= y; - } - if (x < y) { - return x; - } - } - return 0.0 / 0.0; -} - -double private_lua_embed_pow(double b, double e) { - double resultado = 1.0; - int i; - - if (e == 0.0) { - return 1.0; - } - if (e < 0.0) { - b = 1.0 / b; - e = -e; - } - - for (i = 0; i < e; i++) { - resultado *= b; - } - - return resultado; -} - -double private_lua_embed_floor(double x) { - int i = (int)x; - - if (x == (double)i) { - return x; - } - - if (x < 0.0) { - return (double)(i - 1); - } - - return (double)i; -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/custom_math/custom_math.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/custom_math/custom_math.h deleted file mode 100644 index 5c05b0d..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/custom_math/custom_math.h +++ /dev/null @@ -1,8 +0,0 @@ - -double private_lua_embed_fmod(double x, double y); - -// Implementação simples da função pow -double private_lua_embed_pow(double b, double e); - -// Implementação simples da função floor -double private_lua_embed_floor(double x); \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lapi.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lapi.c deleted file mode 100644 index 5de3767..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lapi.c +++ /dev/null @@ -1,1471 +0,0 @@ -/* -** $Id: lapi.c $ -** Lua API -** See Copyright Notice in lua.h -*/ - -#define lapi_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lundump.h" -#include "lvm.h" - - - -const char lua_ident[] = - "$LuaVersion: " LUA_COPYRIGHT " $" - "$LuaAuthors: " LUA_AUTHORS " $"; - - - -/* -** Test for a valid index (one that is not the 'nilvalue'). -** '!ttisnil(o)' implies 'o != &G(L)->nilvalue', so it is not needed. -** However, it covers the most common cases in a faster way. -*/ -#define isvalid(L, o) (!ttisnil(o) || o != &G(L)->nilvalue) - - -/* test for pseudo index */ -#define ispseudo(i) ((i) <= LUA_REGISTRYINDEX) - -/* test for upvalue */ -#define isupvalue(i) ((i) < LUA_REGISTRYINDEX) - - -/* Advance the garbage collector when creating large objects */ -static void advancegc (lua_State *L, size_t delta) { - delta >>= 5; /* one object for each 32 bytes (empirical) */ - if (delta > 0) { - global_State *g = G(L); - luaE_setdebt(g, g->GCdebt - delta); - } -} - - -/* -** Convert an acceptable index to a pointer to its respective value. -** Non-valid indices return the special nil value 'G(L)->nilvalue'. -*/ -static TValue *index2value (lua_State *L, int idx) { - CallInfo *ci = L->ci; - if (idx > 0) { - StkId o = ci->func.p + idx; - api_check(L, idx <= ci->top.p - (ci->func.p + 1), "unacceptable index"); - if (o >= L->top.p) return &G(L)->nilvalue; - else return s2v(o); - } - else if (!ispseudo(idx)) { /* negative index */ - api_check(L, idx != 0 && -idx <= L->top.p - (ci->func.p + 1), - "invalid index"); - return s2v(L->top.p + idx); - } - else if (idx == LUA_REGISTRYINDEX) - return &G(L)->l_registry; - else { /* upvalues */ - idx = LUA_REGISTRYINDEX - idx; - api_check(L, idx <= MAXUPVAL + 1, "upvalue index too large"); - if (ttisCclosure(s2v(ci->func.p))) { /* C closure? */ - CClosure *func = clCvalue(s2v(ci->func.p)); - return (idx <= func->nupvalues) ? &func->upvalue[idx-1] - : &G(L)->nilvalue; - } - else { /* light C function or Lua function (through a hook)?) */ - api_check(L, ttislcf(s2v(ci->func.p)), "caller not a C function"); - return &G(L)->nilvalue; /* no upvalues */ - } - } -} - - - -/* -** Convert a valid actual index (not a pseudo-index) to its address. -*/ -static StkId index2stack (lua_State *L, int idx) { - CallInfo *ci = L->ci; - if (idx > 0) { - StkId o = ci->func.p + idx; - api_check(L, o < L->top.p, "invalid index"); - return o; - } - else { /* non-positive index */ - api_check(L, idx != 0 && -idx <= L->top.p - (ci->func.p + 1), - "invalid index"); - api_check(L, !ispseudo(idx), "invalid index"); - return L->top.p + idx; - } -} - - -LUA_API int lua_checkstack (lua_State *L, int n) { - int res; - CallInfo *ci; - lua_lock(L); - ci = L->ci; - api_check(L, n >= 0, "negative 'n'"); - if (L->stack_last.p - L->top.p > n) /* stack large enough? */ - res = 1; /* yes; check is OK */ - else /* need to grow stack */ - res = luaD_growstack(L, n, 0); - if (res && ci->top.p < L->top.p + n) - ci->top.p = L->top.p + n; /* adjust frame top */ - lua_unlock(L); - return res; -} - - -LUA_API void lua_xmove (lua_State *from, lua_State *to, int n) { - int i; - if (from == to) return; - lua_lock(to); - api_checkpop(from, n); - api_check(from, G(from) == G(to), "moving among independent states"); - api_check(from, to->ci->top.p - to->top.p >= n, "stack overflow"); - from->top.p -= n; - for (i = 0; i < n; i++) { - setobjs2s(to, to->top.p, from->top.p + i); - to->top.p++; /* stack already checked by previous 'api_check' */ - } - lua_unlock(to); -} - - -LUA_API lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf) { - lua_CFunction old; - lua_lock(L); - old = G(L)->panic; - G(L)->panic = panicf; - lua_unlock(L); - return old; -} - - -LUA_API lua_Number lua_version (lua_State *L) { - UNUSED(L); - return LUA_VERSION_NUM; -} - - - -/* -** basic stack manipulation -*/ - - -/* -** convert an acceptable stack index into an absolute index -*/ -LUA_API int lua_absindex (lua_State *L, int idx) { - return (idx > 0 || ispseudo(idx)) - ? idx - : cast_int(L->top.p - L->ci->func.p) + idx; -} - - -LUA_API int lua_gettop (lua_State *L) { - return cast_int(L->top.p - (L->ci->func.p + 1)); -} - - -LUA_API void lua_settop (lua_State *L, int idx) { - CallInfo *ci; - StkId func, newtop; - ptrdiff_t diff; /* difference for new top */ - lua_lock(L); - ci = L->ci; - func = ci->func.p; - if (idx >= 0) { - api_check(L, idx <= ci->top.p - (func + 1), "new top too large"); - diff = ((func + 1) + idx) - L->top.p; - for (; diff > 0; diff--) - setnilvalue(s2v(L->top.p++)); /* clear new slots */ - } - else { - api_check(L, -(idx+1) <= (L->top.p - (func + 1)), "invalid new top"); - diff = idx + 1; /* will "subtract" index (as it is negative) */ - } - newtop = L->top.p + diff; - if (diff < 0 && L->tbclist.p >= newtop) { - lua_assert(hastocloseCfunc(ci->nresults)); - newtop = luaF_close(L, newtop, CLOSEKTOP, 0); - } - L->top.p = newtop; /* correct top only after closing any upvalue */ - lua_unlock(L); -} - - -LUA_API void lua_closeslot (lua_State *L, int idx) { - StkId level; - lua_lock(L); - level = index2stack(L, idx); - api_check(L, hastocloseCfunc(L->ci->nresults) && L->tbclist.p == level, - "no variable to close at given level"); - level = luaF_close(L, level, CLOSEKTOP, 0); - setnilvalue(s2v(level)); - lua_unlock(L); -} - - -/* -** Reverse the stack segment from 'from' to 'to' -** (auxiliary to 'lua_rotate') -** Note that we move(copy) only the value inside the stack. -** (We do not move additional fields that may exist.) -*/ -static void reverse (lua_State *L, StkId from, StkId to) { - for (; from < to; from++, to--) { - TValue temp; - setobj(L, &temp, s2v(from)); - setobjs2s(L, from, to); - setobj2s(L, to, &temp); - } -} - - -/* -** Let x = AB, where A is a prefix of length 'n'. Then, -** rotate x n == BA. But BA == (A^r . B^r)^r. -*/ -LUA_API void lua_rotate (lua_State *L, int idx, int n) { - StkId p, t, m; - lua_lock(L); - t = L->top.p - 1; /* end of stack segment being rotated */ - p = index2stack(L, idx); /* start of segment */ - api_check(L, L->tbclist.p < p, "moving a to-be-closed slot"); - api_check(L, (n >= 0 ? n : -n) <= (t - p + 1), "invalid 'n'"); - m = (n >= 0 ? t - n : p - n - 1); /* end of prefix */ - reverse(L, p, m); /* reverse the prefix with length 'n' */ - reverse(L, m + 1, t); /* reverse the suffix */ - reverse(L, p, t); /* reverse the entire segment */ - lua_unlock(L); -} - - -LUA_API void lua_copy (lua_State *L, int fromidx, int toidx) { - TValue *fr, *to; - lua_lock(L); - fr = index2value(L, fromidx); - to = index2value(L, toidx); - api_check(L, isvalid(L, to), "invalid index"); - setobj(L, to, fr); - if (isupvalue(toidx)) /* function upvalue? */ - luaC_barrier(L, clCvalue(s2v(L->ci->func.p)), fr); - /* LUA_REGISTRYINDEX does not need gc barrier - (collector revisits it before finishing collection) */ - lua_unlock(L); -} - - -LUA_API void lua_pushvalue (lua_State *L, int idx) { - lua_lock(L); - setobj2s(L, L->top.p, index2value(L, idx)); - api_incr_top(L); - lua_unlock(L); -} - - - -/* -** access functions (stack -> C) -*/ - - -LUA_API int lua_type (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (isvalid(L, o) ? ttype(o) : LUA_TNONE); -} - - -LUA_API const char *lua_typename (lua_State *L, int t) { - UNUSED(L); - api_check(L, LUA_TNONE <= t && t < LUA_NUMTYPES, "invalid type"); - return ttypename(t); -} - - -LUA_API int lua_iscfunction (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttislcf(o) || (ttisCclosure(o))); -} - - -LUA_API int lua_isinteger (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return ttisinteger(o); -} - - -LUA_API int lua_isnumber (lua_State *L, int idx) { - lua_Number n; - const TValue *o = index2value(L, idx); - return tonumber(o, &n); -} - - -LUA_API int lua_isstring (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttisstring(o) || cvt2str(o)); -} - - -LUA_API int lua_isuserdata (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttisfulluserdata(o) || ttislightuserdata(o)); -} - - -LUA_API int lua_rawequal (lua_State *L, int index1, int index2) { - const TValue *o1 = index2value(L, index1); - const TValue *o2 = index2value(L, index2); - return (isvalid(L, o1) && isvalid(L, o2)) ? luaV_rawequalobj(o1, o2) : 0; -} - - -LUA_API void lua_arith (lua_State *L, int op) { - lua_lock(L); - if (op != LUA_OPUNM && op != LUA_OPBNOT) - api_checkpop(L, 2); /* all other operations expect two operands */ - else { /* for unary operations, add fake 2nd operand */ - api_checkpop(L, 1); - setobjs2s(L, L->top.p, L->top.p - 1); - api_incr_top(L); - } - /* first operand at top - 2, second at top - 1; result go to top - 2 */ - luaO_arith(L, op, s2v(L->top.p - 2), s2v(L->top.p - 1), L->top.p - 2); - L->top.p--; /* pop second operand */ - lua_unlock(L); -} - - -LUA_API int lua_compare (lua_State *L, int index1, int index2, int op) { - const TValue *o1; - const TValue *o2; - int i = 0; - lua_lock(L); /* may call tag method */ - o1 = index2value(L, index1); - o2 = index2value(L, index2); - if (isvalid(L, o1) && isvalid(L, o2)) { - switch (op) { - case LUA_OPEQ: i = luaV_equalobj(L, o1, o2); break; - case LUA_OPLT: i = luaV_lessthan(L, o1, o2); break; - case LUA_OPLE: i = luaV_lessequal(L, o1, o2); break; - default: api_check(L, 0, "invalid option"); - } - } - lua_unlock(L); - return i; -} - - -LUA_API size_t lua_stringtonumber (lua_State *L, const char *s) { - size_t sz = luaO_str2num(s, s2v(L->top.p)); - if (sz != 0) - api_incr_top(L); - return sz; -} - - -LUA_API lua_Number lua_tonumberx (lua_State *L, int idx, int *pisnum) { - lua_Number n = 0; - const TValue *o = index2value(L, idx); - int isnum = tonumber(o, &n); - if (pisnum) - *pisnum = isnum; - return n; -} - - -LUA_API lua_Integer lua_tointegerx (lua_State *L, int idx, int *pisnum) { - lua_Integer res = 0; - const TValue *o = index2value(L, idx); - int isnum = tointeger(o, &res); - if (pisnum) - *pisnum = isnum; - return res; -} - - -LUA_API int lua_toboolean (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return !l_isfalse(o); -} - - -LUA_API const char *lua_tolstring (lua_State *L, int idx, size_t *len) { - TValue *o; - lua_lock(L); - o = index2value(L, idx); - if (!ttisstring(o)) { - if (!cvt2str(o)) { /* not convertible? */ - if (len != NULL) *len = 0; - lua_unlock(L); - return NULL; - } - luaO_tostring(L, o); - luaC_checkGC(L); - o = index2value(L, idx); /* previous call may reallocate the stack */ - } - lua_unlock(L); - if (len != NULL) - return getlstr(tsvalue(o), *len); - else - return getstr(tsvalue(o)); -} - - -LUA_API lua_Unsigned lua_rawlen (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - switch (ttypetag(o)) { - case LUA_VSHRSTR: return tsvalue(o)->shrlen; - case LUA_VLNGSTR: return tsvalue(o)->u.lnglen; - case LUA_VUSERDATA: return uvalue(o)->len; - case LUA_VTABLE: return luaH_getn(hvalue(o)); - default: return 0; - } -} - - -LUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - if (ttislcf(o)) return fvalue(o); - else if (ttisCclosure(o)) - return clCvalue(o)->f; - else return NULL; /* not a C function */ -} - - -l_sinline void *touserdata (const TValue *o) { - switch (ttype(o)) { - case LUA_TUSERDATA: return getudatamem(uvalue(o)); - case LUA_TLIGHTUSERDATA: return pvalue(o); - default: return NULL; - } -} - - -LUA_API void *lua_touserdata (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return touserdata(o); -} - - -LUA_API lua_State *lua_tothread (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (!ttisthread(o)) ? NULL : thvalue(o); -} - - -/* -** Returns a pointer to the internal representation of an object. -** Note that ANSI C does not allow the conversion of a pointer to -** function to a 'void*', so the conversion here goes through -** a 'size_t'. (As the returned pointer is only informative, this -** conversion should not be a problem.) -*/ -LUA_API const void *lua_topointer (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - switch (ttypetag(o)) { - case LUA_VLCF: return cast_voidp(cast_sizet(fvalue(o))); - case LUA_VUSERDATA: case LUA_VLIGHTUSERDATA: - return touserdata(o); - default: { - if (iscollectable(o)) - return gcvalue(o); - else - return NULL; - } - } -} - - - -/* -** push functions (C -> stack) -*/ - - -LUA_API void lua_pushnil (lua_State *L) { - lua_lock(L); - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushnumber (lua_State *L, lua_Number n) { - lua_lock(L); - setfltvalue(s2v(L->top.p), n); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushinteger (lua_State *L, lua_Integer n) { - lua_lock(L); - setivalue(s2v(L->top.p), n); - api_incr_top(L); - lua_unlock(L); -} - - -/* -** Pushes on the stack a string with given length. Avoid using 's' when -** 'len' == 0 (as 's' can be NULL in that case), due to later use of -** 'memcmp' and 'memcpy'. -*/ -LUA_API const char *lua_pushlstring (lua_State *L, const char *s, size_t len) { - TString *ts; - lua_lock(L); - ts = (len == 0) ? luaS_new(L, "") : luaS_newlstr(L, s, len); - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - advancegc(L, len); - luaC_checkGC(L); - lua_unlock(L); - return getstr(ts); -} - - -LUA_API const char *lua_pushextlstring (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud) { - TString *ts; - lua_lock(L); - api_check(L, s[len] == '\0', "string not ending with zero"); - ts = luaS_newextlstr (L, s, len, falloc, ud); - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - if (falloc != NULL) /* non-static string? */ - advancegc(L, len); /* count its memory */ - luaC_checkGC(L); - lua_unlock(L); - return getstr(ts); -} - - -LUA_API const char *lua_pushstring (lua_State *L, const char *s) { - lua_lock(L); - if (s == NULL) - setnilvalue(s2v(L->top.p)); - else { - TString *ts; - ts = luaS_new(L, s); - setsvalue2s(L, L->top.p, ts); - s = getstr(ts); /* internal copy's address */ - } - api_incr_top(L); - luaC_checkGC(L); - lua_unlock(L); - return s; -} - - -LUA_API const char *lua_pushvfstring (lua_State *L, const char *fmt, - va_list argp) { - const char *ret; - lua_lock(L); - ret = luaO_pushvfstring(L, fmt, argp); - luaC_checkGC(L); - lua_unlock(L); - return ret; -} - - -LUA_API const char *lua_pushfstring (lua_State *L, const char *fmt, ...) { - const char *ret; - va_list argp; - lua_lock(L); - va_start(argp, fmt); - ret = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - luaC_checkGC(L); - lua_unlock(L); - return ret; -} - - -LUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) { - lua_lock(L); - if (n == 0) { - setfvalue(s2v(L->top.p), fn); - api_incr_top(L); - } - else { - int i; - CClosure *cl; - api_checkpop(L, n); - api_check(L, n <= MAXUPVAL, "upvalue index too large"); - cl = luaF_newCclosure(L, n); - cl->f = fn; - for (i = 0; i < n; i++) { - setobj2n(L, &cl->upvalue[i], s2v(L->top.p - n + i)); - /* does not need barrier because closure is white */ - lua_assert(iswhite(cl)); - } - L->top.p -= n; - setclCvalue(L, s2v(L->top.p), cl); - api_incr_top(L); - luaC_checkGC(L); - } - lua_unlock(L); -} - - -LUA_API void lua_pushboolean (lua_State *L, int b) { - lua_lock(L); - if (b) - setbtvalue(s2v(L->top.p)); - else - setbfvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushlightuserdata (lua_State *L, void *p) { - lua_lock(L); - setpvalue(s2v(L->top.p), p); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API int lua_pushthread (lua_State *L) { - lua_lock(L); - setthvalue(L, s2v(L->top.p), L); - api_incr_top(L); - lua_unlock(L); - return (G(L)->mainthread == L); -} - - - -/* -** get functions (Lua -> stack) -*/ - - -static int auxgetstr (lua_State *L, const TValue *t, const char *k) { - int tag; - TString *str = luaS_new(L, k); - luaV_fastget(t, str, s2v(L->top.p), luaH_getstr, tag); - if (!tagisempty(tag)) { - api_incr_top(L); - } - else { - setsvalue2s(L, L->top.p, str); - api_incr_top(L); - tag = luaV_finishget(L, t, s2v(L->top.p - 1), L->top.p - 1, tag); - } - lua_unlock(L); - return novariant(tag); -} - - -static void getGlobalTable (lua_State *L, TValue *gt) { - Table *registry = hvalue(&G(L)->l_registry); - int tag = luaH_getint(registry, LUA_RIDX_GLOBALS, gt); - (void)tag; /* avoid not-used warnings when checks are off */ - api_check(L, novariant(tag) == LUA_TTABLE, "global table must exist"); -} - - -LUA_API int lua_getglobal (lua_State *L, const char *name) { - TValue gt; - lua_lock(L); - getGlobalTable(L, >); - return auxgetstr(L, >, name); -} - - -LUA_API int lua_gettable (lua_State *L, int idx) { - int tag; - TValue *t; - lua_lock(L); - api_checkpop(L, 1); - t = index2value(L, idx); - luaV_fastget(t, s2v(L->top.p - 1), s2v(L->top.p - 1), luaH_get, tag); - if (tagisempty(tag)) - tag = luaV_finishget(L, t, s2v(L->top.p - 1), L->top.p - 1, tag); - lua_unlock(L); - return novariant(tag); -} - - -LUA_API int lua_getfield (lua_State *L, int idx, const char *k) { - lua_lock(L); - return auxgetstr(L, index2value(L, idx), k); -} - - -LUA_API int lua_geti (lua_State *L, int idx, lua_Integer n) { - TValue *t; - int tag; - lua_lock(L); - t = index2value(L, idx); - luaV_fastgeti(t, n, s2v(L->top.p), tag); - if (tagisempty(tag)) { - TValue key; - setivalue(&key, n); - tag = luaV_finishget(L, t, &key, L->top.p, tag); - } - api_incr_top(L); - lua_unlock(L); - return novariant(tag); -} - - -static int finishrawget (lua_State *L, int tag) { - if (tagisempty(tag)) /* avoid copying empty items to the stack */ - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); - return novariant(tag); -} - - -l_sinline Table *gettable (lua_State *L, int idx) { - TValue *t = index2value(L, idx); - api_check(L, ttistable(t), "table expected"); - return hvalue(t); -} - - -LUA_API int lua_rawget (lua_State *L, int idx) { - Table *t; - int tag; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - tag = luaH_get(t, s2v(L->top.p - 1), s2v(L->top.p - 1)); - L->top.p--; /* pop key */ - return finishrawget(L, tag); -} - - -LUA_API int lua_rawgeti (lua_State *L, int idx, lua_Integer n) { - Table *t; - int tag; - lua_lock(L); - t = gettable(L, idx); - luaH_fastgeti(t, n, s2v(L->top.p), tag); - return finishrawget(L, tag); -} - - -LUA_API int lua_rawgetp (lua_State *L, int idx, const void *p) { - Table *t; - TValue k; - lua_lock(L); - t = gettable(L, idx); - setpvalue(&k, cast_voidp(p)); - return finishrawget(L, luaH_get(t, &k, s2v(L->top.p))); -} - - -LUA_API void lua_createtable (lua_State *L, unsigned narray, unsigned nrec) { - Table *t; - lua_lock(L); - t = luaH_new(L); - sethvalue2s(L, L->top.p, t); - api_incr_top(L); - if (narray > 0 || nrec > 0) - luaH_resize(L, t, narray, nrec); - luaC_checkGC(L); - lua_unlock(L); -} - - -LUA_API int lua_getmetatable (lua_State *L, int objindex) { - const TValue *obj; - Table *mt; - int res = 0; - lua_lock(L); - obj = index2value(L, objindex); - switch (ttype(obj)) { - case LUA_TTABLE: - mt = hvalue(obj)->metatable; - break; - case LUA_TUSERDATA: - mt = uvalue(obj)->metatable; - break; - default: - mt = G(L)->mt[ttype(obj)]; - break; - } - if (mt != NULL) { - sethvalue2s(L, L->top.p, mt); - api_incr_top(L); - res = 1; - } - lua_unlock(L); - return res; -} - - -LUA_API int lua_getiuservalue (lua_State *L, int idx, int n) { - TValue *o; - int t; - lua_lock(L); - o = index2value(L, idx); - api_check(L, ttisfulluserdata(o), "full userdata expected"); - if (n <= 0 || n > uvalue(o)->nuvalue) { - setnilvalue(s2v(L->top.p)); - t = LUA_TNONE; - } - else { - setobj2s(L, L->top.p, &uvalue(o)->uv[n - 1].uv); - t = ttype(s2v(L->top.p)); - } - api_incr_top(L); - lua_unlock(L); - return t; -} - - -/* -** set functions (stack -> Lua) -*/ - -/* -** t[k] = value at the top of the stack (where 'k' is a string) -*/ -static void auxsetstr (lua_State *L, const TValue *t, const char *k) { - int hres; - TString *str = luaS_new(L, k); - api_checkpop(L, 1); - luaV_fastset(t, str, s2v(L->top.p - 1), hres, luaH_psetstr); - if (hres == HOK) { - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - L->top.p--; /* pop value */ - } - else { - setsvalue2s(L, L->top.p, str); /* push 'str' (to make it a TValue) */ - api_incr_top(L); - luaV_finishset(L, t, s2v(L->top.p - 1), s2v(L->top.p - 2), hres); - L->top.p -= 2; /* pop value and key */ - } - lua_unlock(L); /* lock done by caller */ -} - - -LUA_API void lua_setglobal (lua_State *L, const char *name) { - TValue gt; - lua_lock(L); /* unlock done in 'auxsetstr' */ - getGlobalTable(L, >); - auxsetstr(L, >, name); -} - - -LUA_API void lua_settable (lua_State *L, int idx) { - TValue *t; - int hres; - lua_lock(L); - api_checkpop(L, 2); - t = index2value(L, idx); - luaV_fastset(t, s2v(L->top.p - 2), s2v(L->top.p - 1), hres, luaH_pset); - if (hres == HOK) { - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - } - else - luaV_finishset(L, t, s2v(L->top.p - 2), s2v(L->top.p - 1), hres); - L->top.p -= 2; /* pop index and value */ - lua_unlock(L); -} - - -LUA_API void lua_setfield (lua_State *L, int idx, const char *k) { - lua_lock(L); /* unlock done in 'auxsetstr' */ - auxsetstr(L, index2value(L, idx), k); -} - - -LUA_API void lua_seti (lua_State *L, int idx, lua_Integer n) { - TValue *t; - int hres; - lua_lock(L); - api_checkpop(L, 1); - t = index2value(L, idx); - luaV_fastseti(t, n, s2v(L->top.p - 1), hres); - if (hres == HOK) - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - else { - TValue temp; - setivalue(&temp, n); - luaV_finishset(L, t, &temp, s2v(L->top.p - 1), hres); - } - L->top.p--; /* pop value */ - lua_unlock(L); -} - - -static void aux_rawset (lua_State *L, int idx, TValue *key, int n) { - Table *t; - lua_lock(L); - api_checkpop(L, n); - t = gettable(L, idx); - luaH_set(L, t, key, s2v(L->top.p - 1)); - invalidateTMcache(t); - luaC_barrierback(L, obj2gco(t), s2v(L->top.p - 1)); - L->top.p -= n; - lua_unlock(L); -} - - -LUA_API void lua_rawset (lua_State *L, int idx) { - aux_rawset(L, idx, s2v(L->top.p - 2), 2); -} - - -LUA_API void lua_rawsetp (lua_State *L, int idx, const void *p) { - TValue k; - setpvalue(&k, cast_voidp(p)); - aux_rawset(L, idx, &k, 1); -} - - -LUA_API void lua_rawseti (lua_State *L, int idx, lua_Integer n) { - Table *t; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - luaH_setint(L, t, n, s2v(L->top.p - 1)); - luaC_barrierback(L, obj2gco(t), s2v(L->top.p - 1)); - L->top.p--; - lua_unlock(L); -} - - -LUA_API int lua_setmetatable (lua_State *L, int objindex) { - TValue *obj; - Table *mt; - lua_lock(L); - api_checkpop(L, 1); - obj = index2value(L, objindex); - if (ttisnil(s2v(L->top.p - 1))) - mt = NULL; - else { - api_check(L, ttistable(s2v(L->top.p - 1)), "table expected"); - mt = hvalue(s2v(L->top.p - 1)); - } - switch (ttype(obj)) { - case LUA_TTABLE: { - hvalue(obj)->metatable = mt; - if (mt) { - luaC_objbarrier(L, gcvalue(obj), mt); - luaC_checkfinalizer(L, gcvalue(obj), mt); - } - break; - } - case LUA_TUSERDATA: { - uvalue(obj)->metatable = mt; - if (mt) { - luaC_objbarrier(L, uvalue(obj), mt); - luaC_checkfinalizer(L, gcvalue(obj), mt); - } - break; - } - default: { - G(L)->mt[ttype(obj)] = mt; - break; - } - } - L->top.p--; - lua_unlock(L); - return 1; -} - - -LUA_API int lua_setiuservalue (lua_State *L, int idx, int n) { - TValue *o; - int res; - lua_lock(L); - api_checkpop(L, 1); - o = index2value(L, idx); - api_check(L, ttisfulluserdata(o), "full userdata expected"); - if (!(cast_uint(n) - 1u < cast_uint(uvalue(o)->nuvalue))) - res = 0; /* 'n' not in [1, uvalue(o)->nuvalue] */ - else { - setobj(L, &uvalue(o)->uv[n - 1].uv, s2v(L->top.p - 1)); - luaC_barrierback(L, gcvalue(o), s2v(L->top.p - 1)); - res = 1; - } - L->top.p--; - lua_unlock(L); - return res; -} - - -/* -** 'load' and 'call' functions (run Lua code) -*/ - - -#define checkresults(L,na,nr) \ - api_check(L, (nr) == LUA_MULTRET \ - || (L->ci->top.p - L->top.p >= (nr) - (na)), \ - "results from function overflow current stack size") - - -LUA_API void lua_callk (lua_State *L, int nargs, int nresults, - lua_KContext ctx, lua_KFunction k) { - StkId func; - lua_lock(L); - api_check(L, k == NULL || !isLua(L->ci), - "cannot use continuations inside hooks"); - api_checkpop(L, nargs + 1); - api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); - checkresults(L, nargs, nresults); - func = L->top.p - (nargs+1); - if (k != NULL && yieldable(L)) { /* need to prepare continuation? */ - L->ci->u.c.k = k; /* save continuation */ - L->ci->u.c.ctx = ctx; /* save context */ - luaD_call(L, func, nresults); /* do the call */ - } - else /* no continuation or no yieldable */ - luaD_callnoyield(L, func, nresults); /* just do the call */ - adjustresults(L, nresults); - lua_unlock(L); -} - - - -/* -** Execute a protected call. -*/ -struct CallS { /* data to 'f_call' */ - StkId func; - int nresults; -}; - - -static void f_call (lua_State *L, void *ud) { - struct CallS *c = cast(struct CallS *, ud); - luaD_callnoyield(L, c->func, c->nresults); -} - - - -LUA_API int lua_pcallk (lua_State *L, int nargs, int nresults, int errfunc, - lua_KContext ctx, lua_KFunction k) { - struct CallS c; - int status; - ptrdiff_t func; - lua_lock(L); - api_check(L, k == NULL || !isLua(L->ci), - "cannot use continuations inside hooks"); - api_checkpop(L, nargs + 1); - api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); - checkresults(L, nargs, nresults); - if (errfunc == 0) - func = 0; - else { - StkId o = index2stack(L, errfunc); - api_check(L, ttisfunction(s2v(o)), "private_lua_error handler must be a function"); - func = savestack(L, o); - } - c.func = L->top.p - (nargs+1); /* function to be called */ - if (k == NULL || !yieldable(L)) { /* no continuation or no yieldable? */ - c.nresults = nresults; /* do a 'conventional' protected call */ - status = luaD_pcall(L, f_call, &c, savestack(L, c.func), func); - } - else { /* prepare continuation (call is already protected by 'resume') */ - CallInfo *ci = L->ci; - ci->u.c.k = k; /* save continuation */ - ci->u.c.ctx = ctx; /* save context */ - /* save information for error recovery */ - ci->u2.funcidx = cast_int(savestack(L, c.func)); - ci->u.c.old_errfunc = L->errfunc; - L->errfunc = func; - setoah(ci->callstatus, L->allowhook); /* save value of 'allowhook' */ - ci->callstatus |= CIST_YPCALL; /* function can do error recovery */ - luaD_call(L, c.func, nresults); /* do the call */ - ci->callstatus &= ~CIST_YPCALL; - L->errfunc = ci->u.c.old_errfunc; - status = LUA_OK; /* if it is here, there were no errors */ - } - adjustresults(L, nresults); - lua_unlock(L); - return status; -} - - -LUA_API int lua_load (lua_State *L, lua_Reader reader, void *data, - const char *chunkname, const char *mode) { - ZIO z; - int status; - lua_lock(L); - if (!chunkname) chunkname = "?"; - luaZ_init(L, &z, reader, data); - status = luaD_protectedparser(L, &z, chunkname, mode); - if (status == LUA_OK) { /* no errors? */ - LClosure *f = clLvalue(s2v(L->top.p - 1)); /* get new function */ - if (f->nupvalues >= 1) { /* does it have an upvalue? */ - /* get global table from registry */ - TValue gt; - getGlobalTable(L, >); - /* set global table as 1st upvalue of 'f' (may be LUA_ENV) */ - setobj(L, f->upvals[0]->v.p, >); - luaC_barrier(L, f->upvals[0], >); - } - } - lua_unlock(L); - return status; -} - - -/* -** Dump a Lua function, calling 'writer' to write its parts. Ensure -** the stack returns with its original size. -*/ -LUA_API int lua_dump (lua_State *L, lua_Writer writer, void *data, int strip) { - int status; - ptrdiff_t otop = savestack(L, L->top.p); /* original top */ - TValue *f = s2v(L->top.p - 1); /* function to be dumped */ - lua_lock(L); - api_checkpop(L, 1); - api_check(L, isLfunction(f), "Lua function expected"); - status = luaU_dump(L, clLvalue(f)->p, writer, data, strip); - L->top.p = restorestack(L, otop); /* restore top */ - lua_unlock(L); - return status; -} - - -LUA_API int lua_status (lua_State *L) { - return L->status; -} - - -/* -** Garbage-collection function -*/ -LUA_API int lua_gc (lua_State *L, int what, ...) { - va_list argp; - int res = 0; - global_State *g = G(L); - if (g->gcstp & (GCSTPGC | GCSTPCLS)) /* internal stop? */ - return -1; /* all options are invalid when stopped */ - lua_lock(L); - va_start(argp, what); - switch (what) { - case LUA_GCSTOP: { - g->gcstp = GCSTPUSR; /* stopped by the user */ - break; - } - case LUA_GCRESTART: { - luaE_setdebt(g, 0); - g->gcstp = 0; /* (other bits must be zero here) */ - break; - } - case LUA_GCCOLLECT: { - luaC_fullgc(L, 0); - break; - } - case LUA_GCCOUNT: { - /* GC values are expressed in Kbytes: #bytes/2^10 */ - res = cast_int(g->totalbytes >> 10); - break; - } - case LUA_GCCOUNTB: { - res = cast_int(g->totalbytes & 0x3ff); - break; - } - case LUA_GCSTEP: { - lu_byte oldstp = g->gcstp; - l_obj n = va_arg(argp, int); - int work = 0; /* true if GC did some work */ - g->gcstp = 0; /* allow GC to run (other bits must be zero here) */ - if (n <= 0) - n = g->GCdebt; /* force to run one basic step */ - luaE_setdebt(g, g->GCdebt - n); - luaC_condGC(L, (void)0, work = 1); - if (work && g->gcstate == GCSpause) /* end of cycle? */ - res = 1; /* signal it */ - g->gcstp = oldstp; /* restore previous state */ - break; - } - case LUA_GCISRUNNING: { - res = gcrunning(g); - break; - } - case LUA_GCGEN: { - res = (g->gckind == KGC_INC) ? LUA_GCINC : LUA_GCGEN; - luaC_changemode(L, KGC_GENMINOR); - break; - } - case LUA_GCINC: { - res = (g->gckind == KGC_INC) ? LUA_GCINC : LUA_GCGEN; - luaC_changemode(L, KGC_INC); - break; - } - case LUA_GCPARAM: { - int param = va_arg(argp, int); - int value = va_arg(argp, int); - api_check(L, 0 <= param && param < LUA_GCPN, "invalid parameter"); - res = cast_int(luaO_applyparam(g->gcparams[param], 100)); - if (value >= 0) - g->gcparams[param] = luaO_codeparam(value); - break; - } - default: res = -1; /* invalid option */ - } - va_end(argp); - lua_unlock(L); - return res; -} - - - -/* -** miscellaneous functions -*/ - - -LUA_API int lua_error (lua_State *L) { - TValue *errobj; - lua_lock(L); - errobj = s2v(L->top.p - 1); - api_checkpop(L, 1); - /* error object is the memory error message? */ - if (ttisshrstring(errobj) && eqshrstr(tsvalue(errobj), G(L)->memerrmsg)) - luaM_error(L); /* raise a memory error */ - else - luaG_errormsg(L); /* raise a regular error */ - /* code unreachable; will unlock when control actually leaves the kernel */ - return 0; /* to avoid warnings */ -} - - -LUA_API int lua_next (lua_State *L, int idx) { - Table *t; - int more; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - more = luaH_next(L, t, L->top.p - 1); - if (more) - api_incr_top(L); - else /* no more elements */ - L->top.p--; /* pop key */ - lua_unlock(L); - return more; -} - - -LUA_API void lua_toclose (lua_State *L, int idx) { - int nresults; - StkId o; - lua_lock(L); - o = index2stack(L, idx); - nresults = L->ci->nresults; - api_check(L, L->tbclist.p < o, "given index below or equal a marked one"); - luaF_newtbcupval(L, o); /* create new to-be-closed upvalue */ - if (!hastocloseCfunc(nresults)) /* function not marked yet? */ - L->ci->nresults = codeNresults(nresults); /* mark it */ - lua_assert(hastocloseCfunc(L->ci->nresults)); - lua_unlock(L); -} - - -LUA_API void lua_concat (lua_State *L, int n) { - lua_lock(L); - api_checknelems(L, n); - if (n > 0) { - luaV_concat(L, n); - luaC_checkGC(L); - } - else { /* nothing to concatenate */ - setsvalue2s(L, L->top.p, luaS_newlstr(L, "", 0)); /* push empty string */ - api_incr_top(L); - } - lua_unlock(L); -} - - -LUA_API void lua_len (lua_State *L, int idx) { - TValue *t; - lua_lock(L); - t = index2value(L, idx); - luaV_objlen(L, L->top.p, t); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API lua_Alloc lua_getallocf (lua_State *L, void **ud) { - lua_Alloc f; - lua_lock(L); - if (ud) *ud = G(L)->ud; - f = G(L)->frealloc; - lua_unlock(L); - return f; -} - - -LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud) { - lua_lock(L); - G(L)->ud = ud; - G(L)->frealloc = f; - lua_unlock(L); -} - - -void lua_setwarnf (lua_State *L, lua_WarnFunction f, void *ud) { - lua_lock(L); - G(L)->ud_warn = ud; - G(L)->warnf = f; - lua_unlock(L); -} - - -void lua_warning (lua_State *L, const char *msg, int tocont) { - lua_lock(L); - luaE_warning(L, msg, tocont); - lua_unlock(L); -} - - - -LUA_API void *lua_newuserdatauv (lua_State *L, size_t size, int nuvalue) { - Udata *u; - lua_lock(L); - api_check(L, 0 <= nuvalue && nuvalue < USHRT_MAX, "invalid value"); - u = luaS_newudata(L, size, nuvalue); - setuvalue(L, s2v(L->top.p), u); - api_incr_top(L); - advancegc(L, size); - luaC_checkGC(L); - lua_unlock(L); - return getudatamem(u); -} - - - -static const char *aux_upvalue (TValue *fi, int n, TValue **val, - GCObject **owner) { - switch (ttypetag(fi)) { - case LUA_VCCL: { /* C closure */ - CClosure *f = clCvalue(fi); - if (!(cast_uint(n) - 1u < cast_uint(f->nupvalues))) - return NULL; /* 'n' not in [1, f->nupvalues] */ - *val = &f->upvalue[n-1]; - if (owner) *owner = obj2gco(f); - return ""; - } - case LUA_VLCL: { /* Lua closure */ - LClosure *f = clLvalue(fi); - TString *name; - Proto *p = f->p; - if (!(cast_uint(n) - 1u < cast_uint(p->sizeupvalues))) - return NULL; /* 'n' not in [1, p->sizeupvalues] */ - *val = f->upvals[n-1]->v.p; - if (owner) *owner = obj2gco(f->upvals[n - 1]); - name = p->upvalues[n-1].name; - return (name == NULL) ? "(no name)" : getstr(name); - } - default: return NULL; /* not a closure */ - } -} - - -LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n) { - const char *name; - TValue *val = NULL; /* to avoid warnings */ - lua_lock(L); - name = aux_upvalue(index2value(L, funcindex), n, &val, NULL); - if (name) { - setobj2s(L, L->top.p, val); - api_incr_top(L); - } - lua_unlock(L); - return name; -} - - -LUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n) { - const char *name; - TValue *val = NULL; /* to avoid warnings */ - GCObject *owner = NULL; /* to avoid warnings */ - TValue *fi; - lua_lock(L); - fi = index2value(L, funcindex); - api_checknelems(L, 1); - name = aux_upvalue(fi, n, &val, &owner); - if (name) { - L->top.p--; - setobj(L, val, s2v(L->top.p)); - luaC_barrier(L, owner, val); - } - lua_unlock(L); - return name; -} - - -static UpVal **getupvalref (lua_State *L, int fidx, int n, LClosure **pf) { - static const UpVal *const nullup = NULL; - LClosure *f; - TValue *fi = index2value(L, fidx); - api_check(L, ttisLclosure(fi), "Lua function expected"); - f = clLvalue(fi); - if (pf) *pf = f; - if (1 <= n && n <= f->p->sizeupvalues) - return &f->upvals[n - 1]; /* get its upvalue pointer */ - else - return (UpVal**)&nullup; -} - - -LUA_API void *lua_upvalueid (lua_State *L, int fidx, int n) { - TValue *fi = index2value(L, fidx); - switch (ttypetag(fi)) { - case LUA_VLCL: { /* lua closure */ - return *getupvalref(L, fidx, n, NULL); - } - case LUA_VCCL: { /* C closure */ - CClosure *f = clCvalue(fi); - if (1 <= n && n <= f->nupvalues) - return &f->upvalue[n - 1]; - /* else */ - } /* FALLTHROUGH */ - case LUA_VLCF: - return NULL; /* light C functions have no upvalues */ - default: { - api_check(L, 0, "function expected"); - return NULL; - } - } -} - - -LUA_API void lua_upvaluejoin (lua_State *L, int fidx1, int n1, - int fidx2, int n2) { - LClosure *f1; - UpVal **up1 = getupvalref(L, fidx1, n1, &f1); - UpVal **up2 = getupvalref(L, fidx2, n2, NULL); - api_check(L, *up1 != NULL && *up2 != NULL, "invalid upvalue index"); - *up1 = *up2; - luaC_objbarrier(L, f1, *up1); -} - - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lapi.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lapi.h deleted file mode 100644 index 757bf3d..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lapi.h +++ /dev/null @@ -1,61 +0,0 @@ -/* -** $Id: lapi.h $ -** Auxiliary functions from Lua API -** See Copyright Notice in lua.h -*/ - -#ifndef lapi_h -#define lapi_h - - -#include "llimits.h" -#include "lstate.h" - - -/* Increments 'L->top.p', checking for stack overflows */ -#define api_incr_top(L) \ - (L->top.p++, api_check(L, L->top.p <= L->ci->top.p, "stack overflow")) - - -/* -** If a call returns too many multiple returns, the callee may not have -** stack space to accommodate all results. In this case, this macro -** increases its stack space ('L->ci->top.p'). -*/ -#define adjustresults(L,nres) \ - { if ((nres) <= LUA_MULTRET && L->ci->top.p < L->top.p) \ - L->ci->top.p = L->top.p; } - - -/* Ensure the stack has at least 'n' elements */ -#define api_checknelems(L,n) \ - api_check(L, (n) < (L->top.p - L->ci->func.p), \ - "not enough elements in the stack") - - -/* Ensure the stack has at least 'n' elements to be popped. (Some -** functions only update a slot after checking it for popping, but that -** is only an optimization for a pop followed by a push.) -*/ -#define api_checkpop(L,n) \ - api_check(L, (n) < L->top.p - L->ci->func.p && \ - L->tbclist.p < L->top.p - (n), \ - "not enough free elements in the stack") - - -/* -** To reduce the overhead of returning from C functions, the presence of -** to-be-closed variables in these functions is coded in the CallInfo's -** field 'nresults', in a way that functions with no to-be-closed variables -** with zero, one, or "all" wanted results have no overhead. Functions -** with other number of wanted results, as well as functions with -** variables to be closed, have an extra check. -*/ - -#define hastocloseCfunc(n) ((n) < LUA_MULTRET) - -/* Map [-1, inf) (range of 'nresults') into (-inf, -2] */ -#define codeNresults(n) (-(n) - 3) -#define decodeNresults(n) (-(n) - 3) - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lauxlib.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lauxlib.c deleted file mode 100644 index 45d033b..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lauxlib.c +++ /dev/null @@ -1,1184 +0,0 @@ -/* -** $Id: lauxlib.c $ -** Auxiliary functions for building Lua libraries -** See Copyright Notice in lua.h -*/ - -#define lauxlib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include - - -/* -** This file uses only the official API of Lua. -** Any function declared here could be written as an application function. -*/ - -#include "lua.h" - -#include "lauxlib.h" - - -#if !defined(MAX_SIZET) -/* maximum value for size_t */ -#define MAX_SIZET ((size_t)(~(size_t)0)) -#endif - - -/* -** {====================================================== -** Traceback -** ======================================================= -*/ - - -#define LEVELS1 10 /* size of the first part of the stack */ -#define LEVELS2 11 /* size of the second part of the stack */ - - - -/* -** Search for 'objidx' in table at index -1. ('objidx' must be an -** absolute index.) Return 1 + string at top if it found a good name. -*/ -static int findfield (lua_State *L, int objidx, int level) { - if (level == 0 || !lua_istable(L, -1)) - return 0; /* not found */ - lua_pushnil(L); /* start 'next' loop */ - while (lua_next(L, -2)) { /* for each pair in table */ - if (lua_type(L, -2) == LUA_TSTRING) { /* ignore non-string keys */ - if (lua_rawequal(L, objidx, -1)) { /* found object? */ - lua_pop(L, 1); /* remove value (but keep name) */ - return 1; - } - else if (findfield(L, objidx, level - 1)) { /* try recursively */ - /* stack: lib_name, lib_table, field_name (top) */ - lua_pushliteral(L, "."); /* place '.' between the two names */ - lua_replace(L, -3); /* (in the slot occupied by table) */ - lua_concat(L, 3); /* lib_name.field_name */ - return 1; - } - } - lua_pop(L, 1); /* remove value */ - } - return 0; /* not found */ -} - - -/* -** Search for a name for a function in all loaded modules -*/ -static int pushglobalfuncname (lua_State *L, lua_Debug *ar) { - int top = lua_gettop(L); - lua_getinfo(L, "f", ar); /* push function */ - lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - if (findfield(L, top + 1, 2)) { - const char *name = lua_tostring(L, -1); - if (strncmp(name, LUA_GNAME ".", 3) == 0) { /* name start with '_G.'? */ - lua_pushstring(L, name + 3); /* push name without prefix */ - lua_remove(L, -2); /* remove original name */ - } - lua_copy(L, -1, top + 1); /* copy name to proper place */ - lua_settop(L, top + 1); /* remove table "loaded" and name copy */ - return 1; - } - else { - lua_settop(L, top); /* remove function and global table */ - return 0; - } -} - - -static void pushfuncname (lua_State *L, lua_Debug *ar) { - if (pushglobalfuncname(L, ar)) { /* try first a global name */ - lua_pushfstring(L, "function '%s'", lua_tostring(L, -1)); - lua_remove(L, -2); /* remove name */ - } - else if (*ar->namewhat != '\0') /* is there a name from code? */ - lua_pushfstring(L, "%s '%s'", ar->namewhat, ar->name); /* use it */ - else if (*ar->what == 'm') /* main? */ - lua_pushliteral(L, "main chunk"); - else if (*ar->what != 'C') /* for Lua functions, use */ - lua_pushfstring(L, "function <%s:%d>", ar->short_src, ar->linedefined); - else /* nothing left... */ - lua_pushliteral(L, "?"); -} - - -static int lastlevel (lua_State *L) { - lua_Debug ar; - int li = 1, le = 1; - /* find an upper bound */ - while (lua_getstack(L, le, &ar)) { li = le; le *= 2; } - /* do a binary search */ - while (li < le) { - int m = (li + le)/2; - if (lua_getstack(L, m, &ar)) li = m + 1; - else le = m; - } - return le - 1; -} - - -LUALIB_API void luaL_traceback (lua_State *L, lua_State *L1, - const char *msg, int level) { - luaL_Buffer b; - lua_Debug ar; - int last = lastlevel(L1); - int limit2show = (last - level > LEVELS1 + LEVELS2) ? LEVELS1 : -1; - luaL_buffinit(L, &b); - if (msg) { - luaL_addstring(&b, msg); - luaL_addchar(&b, '\n'); - } - luaL_addstring(&b, "stack traceback:"); - while (lua_getstack(L1, level++, &ar)) { - if (limit2show-- == 0) { /* too many levels? */ - int n = last - level - LEVELS2 + 1; /* number of levels to skip */ - lua_pushfstring(L, "\n\t...\t(skipping %d levels)", n); - luaL_addvalue(&b); /* add warning about skip */ - level += n; /* and skip to last levels */ - } - else { - lua_getinfo(L1, "Slnt", &ar); - if (ar.currentline <= 0) - lua_pushfstring(L, "\n\t%s: in ", ar.short_src); - else - lua_pushfstring(L, "\n\t%s:%d: in ", ar.short_src, ar.currentline); - luaL_addvalue(&b); - pushfuncname(L, &ar); - luaL_addvalue(&b); - if (ar.istailcall) - luaL_addstring(&b, "\n\t(...tail calls...)"); - } - } - luaL_pushresult(&b); -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Error-report functions -** ======================================================= -*/ - -LUALIB_API int luaL_argerror (lua_State *L, int arg, const char *extramsg) { - lua_Debug ar; - if (!lua_getstack(L, 0, &ar)) /* no stack frame? */ - return luaL_error(L, "bad argument #%d (%s)", arg, extramsg); - lua_getinfo(L, "n", &ar); - if (strcmp(ar.namewhat, "method") == 0) { - arg--; /* do not count 'self' */ - if (arg == 0) /* error is in the self argument itself? */ - return luaL_error(L, "calling '%s' on bad self (%s)", - ar.name, extramsg); - } - if (ar.name == NULL) - ar.name = (pushglobalfuncname(L, &ar)) ? lua_tostring(L, -1) : "?"; - return luaL_error(L, "bad argument #%d to '%s' (%s)", - arg, ar.name, extramsg); -} - - -LUALIB_API int luaL_typeerror (lua_State *L, int arg, const char *tname) { - const char *msg; - const char *typearg; /* name for the type of the actual argument */ - if (luaL_getmetafield(L, arg, "__name") == LUA_TSTRING) - typearg = lua_tostring(L, -1); /* use the given type name */ - else if (lua_type(L, arg) == LUA_TLIGHTUSERDATA) - typearg = "light userdata"; /* special name for messages */ - else - typearg = luaL_typename(L, arg); /* standard name */ - msg = lua_pushfstring(L, "%s expected, got %s", tname, typearg); - return luaL_argerror(L, arg, msg); -} - - -static void tag_error (lua_State *L, int arg, int tag) { - luaL_typeerror(L, arg, lua_typename(L, tag)); -} - - -/* -** The use of 'lua_pushfstring' ensures this function does not -** need reserved stack space when called. -*/ -LUALIB_API void luaL_where (lua_State *L, int level) { - lua_Debug ar; - if (lua_getstack(L, level, &ar)) { /* check function at level */ - lua_getinfo(L, "Sl", &ar); /* get info about it */ - if (ar.currentline > 0) { /* is there info? */ - lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline); - return; - } - } - lua_pushfstring(L, ""); /* else, no information available... */ -} - - -/* -** Again, the use of 'lua_pushvfstring' ensures this function does -** not need reserved stack space when called. (At worst, it generates -** an error with "stack overflow" instead of the given message.) -*/ -LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) { - va_list argp; - va_start(argp, fmt); - luaL_where(L, 1); - lua_pushvfstring(L, fmt, argp); - va_end(argp); - lua_concat(L, 2); - return lua_error(L); -} - - -LUALIB_API int luaL_fileresult (lua_State *L, int stat, const char *fname) { - int en = errno; /* calls to Lua API may change this value */ - if (stat) { - lua_pushboolean(L, 1); - return 1; - } - else { - luaL_pushfail(L); - if (fname) - lua_pushfstring(L, "%s: %s", fname, strerror(en)); - else - lua_pushstring(L, strerror(en)); - lua_pushinteger(L, en); - return 3; - } -} - - -#if !defined(l_inspectstat) /* { */ - -#if defined(LUA_USE_POSIX) - -#include - -/* -** use appropriate macros to interpret 'pclose' return status -*/ -#define l_inspectstat(stat,what) \ - if (WIFEXITED(stat)) { stat = WEXITSTATUS(stat); } \ - else if (WIFSIGNALED(stat)) { stat = WTERMSIG(stat); what = "signal"; } - -#else - -#define l_inspectstat(stat,what) /* no op */ - -#endif - -#endif /* } */ - - -LUALIB_API int luaL_execresult (lua_State *L, int stat) { - if (stat != 0 && errno != 0) /* error with an 'errno'? */ - return luaL_fileresult(L, 0, NULL); - else { - const char *what = "exit"; /* type of termination */ - l_inspectstat(stat, what); /* interpret result */ - if (*what == 'e' && stat == 0) /* successful termination? */ - lua_pushboolean(L, 1); - else - luaL_pushfail(L); - lua_pushstring(L, what); - lua_pushinteger(L, stat); - return 3; /* return true/fail,what,code */ - } -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Userdata's metatable manipulation -** ======================================================= -*/ - -LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) { - if (luaL_getmetatable(L, tname) != LUA_TNIL) /* name already in use? */ - return 0; /* leave previous value on top, but return 0 */ - lua_pop(L, 1); - lua_createtable(L, 0, 2); /* create metatable */ - lua_pushstring(L, tname); - lua_setfield(L, -2, "__name"); /* metatable.__name = tname */ - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, tname); /* registry.name = metatable */ - return 1; -} - - -LUALIB_API void luaL_setmetatable (lua_State *L, const char *tname) { - luaL_getmetatable(L, tname); - lua_setmetatable(L, -2); -} - - -LUALIB_API void *luaL_testudata (lua_State *L, int ud, const char *tname) { - void *p = lua_touserdata(L, ud); - if (p != NULL) { /* value is a userdata? */ - if (lua_getmetatable(L, ud)) { /* does it have a metatable? */ - luaL_getmetatable(L, tname); /* get correct metatable */ - if (!lua_rawequal(L, -1, -2)) /* not the same? */ - p = NULL; /* value is a userdata with wrong metatable */ - lua_pop(L, 2); /* remove both metatables */ - return p; - } - } - return NULL; /* value is not a userdata with a metatable */ -} - - -LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) { - void *p = luaL_testudata(L, ud, tname); - luaL_argexpected(L, p != NULL, ud, tname); - return p; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Argument check functions -** ======================================================= -*/ - -LUALIB_API int luaL_checkoption (lua_State *L, int arg, const char *def, - const char *const lst[]) { - const char *name = (def) ? luaL_optstring(L, arg, def) : - luaL_checkstring(L, arg); - int i; - for (i=0; lst[i]; i++) - if (strcmp(lst[i], name) == 0) - return i; - return luaL_argerror(L, arg, - lua_pushfstring(L, "invalid option '%s'", name)); -} - - -/* -** Ensures the stack has at least 'space' extra slots, raising an error -** if it cannot fulfill the request. (The error handling needs a few -** extra slots to format the error message. In case of an error without -** this extra space, Lua will generate the same 'stack overflow' error, -** but without 'msg'.) -*/ -LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *msg) { - if (l_unlikely(!lua_checkstack(L, space))) { - if (msg) - luaL_error(L, "stack overflow (%s)", msg); - else - luaL_error(L, "stack overflow"); - } -} - - -LUALIB_API void luaL_checktype (lua_State *L, int arg, int t) { - if (l_unlikely(lua_type(L, arg) != t)) - tag_error(L, arg, t); -} - - -LUALIB_API void luaL_checkany (lua_State *L, int arg) { - if (l_unlikely(lua_type(L, arg) == LUA_TNONE)) - luaL_argerror(L, arg, "value expected"); -} - - -LUALIB_API const char *luaL_checklstring (lua_State *L, int arg, size_t *len) { - const char *s = lua_tolstring(L, arg, len); - if (l_unlikely(!s)) tag_error(L, arg, LUA_TSTRING); - return s; -} - - -LUALIB_API const char *luaL_optlstring (lua_State *L, int arg, - const char *def, size_t *len) { - if (lua_isnoneornil(L, arg)) { - if (len) - *len = (def ? strlen(def) : 0); - return def; - } - else return luaL_checklstring(L, arg, len); -} - - -LUALIB_API lua_Number luaL_checknumber (lua_State *L, int arg) { - int isnum; - lua_Number d = lua_tonumberx(L, arg, &isnum); - if (l_unlikely(!isnum)) - tag_error(L, arg, LUA_TNUMBER); - return d; -} - - -LUALIB_API lua_Number luaL_optnumber (lua_State *L, int arg, lua_Number def) { - return luaL_opt(L, luaL_checknumber, arg, def); -} - - -static void interror (lua_State *L, int arg) { - if (lua_isnumber(L, arg)) - luaL_argerror(L, arg, "number has no integer representation"); - else - tag_error(L, arg, LUA_TNUMBER); -} - - -LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int arg) { - int isnum; - lua_Integer d = lua_tointegerx(L, arg, &isnum); - if (l_unlikely(!isnum)) { - interror(L, arg); - } - return d; -} - - -LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int arg, - lua_Integer def) { - return luaL_opt(L, luaL_checkinteger, arg, def); -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Generic Buffer manipulation -** ======================================================= -*/ - -/* userdata to box arbitrary data */ -typedef struct UBox { - void *box; - size_t bsize; -} UBox; - - -/* Resize the buffer used by a box. Optimize for the common case of -** resizing to the old size. (For instance, __gc will resize the box -** to 0 even after it was closed. 'pushresult' may also resize it to a -** final size that is equal to the one set when the buffer was created.) -*/ -static void *resizebox (lua_State *L, int idx, size_t newsize) { - UBox *box = (UBox *)lua_touserdata(L, idx); - if (box->bsize == newsize) /* not changing size? */ - return box->box; /* keep the buffer */ - else { - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); - void *temp = allocf(ud, box->box, box->bsize, newsize); - if (l_unlikely(temp == NULL && newsize > 0)) { /* allocation error? */ - lua_pushliteral(L, "not enough memory"); - lua_error(L); /* raise a memory error */ - } - box->box = temp; - box->bsize = newsize; - return temp; - } -} - - -static int boxgc (lua_State *L) { - resizebox(L, 1, 0); - return 0; -} - - -static const luaL_Reg boxmt[] = { /* box metamethods */ - {"__gc", boxgc}, - {"__close", boxgc}, - {NULL, NULL} -}; - - -static void newbox (lua_State *L) { - UBox *box = (UBox *)lua_newuserdatauv(L, sizeof(UBox), 0); - box->box = NULL; - box->bsize = 0; - if (luaL_newmetatable(L, "_UBOX*")) /* creating metatable? */ - luaL_setfuncs(L, boxmt, 0); /* set its metamethods */ - lua_setmetatable(L, -2); -} - - -/* -** check whether buffer is using a userdata on the stack as a temporary -** buffer -*/ -#define buffonstack(B) ((B)->b != (B)->init.b) - - -/* -** Whenever buffer is accessed, slot 'idx' must either be a box (which -** cannot be NULL) or it is a placeholder for the buffer. -*/ -#define checkbufferlevel(B,idx) \ - lua_assert(buffonstack(B) ? lua_touserdata(B->L, idx) != NULL \ - : lua_touserdata(B->L, idx) == (void*)B) - - -/* -** Compute new size for buffer 'B', enough to accommodate extra 'sz' -** bytes plus one for a terminating zero. (The test for "not big enough" -** also gets the case when the computation of 'newsize' overflows.) -*/ -static size_t newbuffsize (luaL_Buffer *B, size_t sz) { - size_t newsize = (B->size / 2) * 3; /* buffer size * 1.5 */ - if (l_unlikely(MAX_SIZET - sz - 1 < B->n)) /* overflow in (B->n + sz + 1)? */ - return luaL_error(B->L, "buffer too large"); - if (newsize < B->n + sz + 1) /* not big enough? */ - newsize = B->n + sz + 1; - return newsize; -} - - -/* -** Returns a pointer to a free area with at least 'sz' bytes in buffer -** 'B'. 'boxidx' is the relative position in the stack where is the -** buffer's box or its placeholder. -*/ -static char *prepbuffsize (luaL_Buffer *B, size_t sz, int boxidx) { - checkbufferlevel(B, boxidx); - if (B->size - B->n >= sz) /* enough space? */ - return B->b + B->n; - else { - lua_State *L = B->L; - char *newbuff; - size_t newsize = newbuffsize(B, sz); - /* create larger buffer */ - if (buffonstack(B)) /* buffer already has a box? */ - newbuff = (char *)resizebox(L, boxidx, newsize); /* resize it */ - else { /* no box yet */ - lua_remove(L, boxidx); /* remove placeholder */ - newbox(L); /* create a new box */ - lua_insert(L, boxidx); /* move box to its intended position */ - lua_toclose(L, boxidx); - newbuff = (char *)resizebox(L, boxidx, newsize); - memcpy(newbuff, B->b, B->n * sizeof(char)); /* copy original content */ - } - B->b = newbuff; - B->size = newsize; - return newbuff + B->n; - } -} - -/* -** returns a pointer to a free area with at least 'sz' bytes -*/ -LUALIB_API char *luaL_prepbuffsize (luaL_Buffer *B, size_t sz) { - return prepbuffsize(B, sz, -1); -} - - -LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) { - if (l > 0) { /* avoid 'memcpy' when 's' can be NULL */ - char *b = prepbuffsize(B, l, -1); - memcpy(b, s, l * sizeof(char)); - luaL_addsize(B, l); - } -} - - -LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) { - luaL_addlstring(B, s, strlen(s)); -} - - -LUALIB_API void luaL_pushresult (luaL_Buffer *B) { - lua_State *L = B->L; - checkbufferlevel(B, -1); - if (!buffonstack(B)) /* using static buffer? */ - lua_pushlstring(L, B->b, B->n); /* save result as regular string */ - else { /* reuse buffer already allocated */ - UBox *box = (UBox *)lua_touserdata(L, -1); - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); /* function to free buffer */ - size_t len = B->n; /* final string length */ - char *s; - resizebox(L, -1, len + 1); /* adjust box size to content size */ - s = (char*)box->box; /* final buffer address */ - s[len] = '\0'; /* add ending zero */ - /* clear box, as 'lua_pushextlstring' will take control over buffer */ - box->bsize = 0; box->box = NULL; - lua_pushextlstring(L, s, len, allocf, ud); - lua_closeslot(L, -2); /* close the box */ - } - lua_remove(L, -2); /* remove box or placeholder from the stack */ -} - - -LUALIB_API void luaL_pushresultsize (luaL_Buffer *B, size_t sz) { - luaL_addsize(B, sz); - luaL_pushresult(B); -} - - -/* -** 'luaL_addvalue' is the only function in the Buffer system where the -** box (if existent) is not on the top of the stack. So, instead of -** calling 'luaL_addlstring', it replicates the code using -2 as the -** last argument to 'prepbuffsize', signaling that the box is (or will -** be) below the string being added to the buffer. (Box creation can -** trigger an emergency GC, so we should not remove the string from the -** stack before we have the space guaranteed.) -*/ -LUALIB_API void luaL_addvalue (luaL_Buffer *B) { - lua_State *L = B->L; - size_t len; - const char *s = lua_tolstring(L, -1, &len); - char *b = prepbuffsize(B, len, -2); - memcpy(b, s, len * sizeof(char)); - luaL_addsize(B, len); - lua_pop(L, 1); /* pop string */ -} - - -LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) { - B->L = L; - B->b = B->init.b; - B->n = 0; - B->size = LUAL_BUFFERSIZE; - lua_pushlightuserdata(L, (void*)B); /* push placeholder */ -} - - -LUALIB_API char *luaL_buffinitsize (lua_State *L, luaL_Buffer *B, size_t sz) { - luaL_buffinit(L, B); - return prepbuffsize(B, sz, -1); -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Reference system -** ======================================================= -*/ - -/* -** The previously freed references form a linked list: t[1] is the index -** of a first free index, t[t[1]] is the index of the second element, -** etc. A zero signals the end of the list. -*/ -LUALIB_API int luaL_ref (lua_State *L, int t) { - int ref; - if (lua_isnil(L, -1)) { - lua_pop(L, 1); /* remove from stack */ - return LUA_REFNIL; /* 'nil' has a unique fixed reference */ - } - t = lua_absindex(L, t); - if (lua_rawgeti(L, t, 1) == LUA_TNUMBER) /* already initialized? */ - ref = (int)lua_tointeger(L, -1); /* ref = t[1] */ - else { /* first access */ - lua_assert(!lua_toboolean(L, -1)); /* must be nil or false */ - ref = 0; /* list is empty */ - lua_pushinteger(L, 0); /* initialize as an empty list */ - lua_rawseti(L, t, 1); /* ref = t[1] = 0 */ - } - lua_pop(L, 1); /* remove element from stack */ - if (ref != 0) { /* any free element? */ - lua_rawgeti(L, t, ref); /* remove it from list */ - lua_rawseti(L, t, 1); /* (t[1] = t[ref]) */ - } - else /* no free elements */ - ref = (int)lua_rawlen(L, t) + 1; /* get a new reference */ - lua_rawseti(L, t, ref); - return ref; -} - - -LUALIB_API void luaL_unref (lua_State *L, int t, int ref) { - if (ref >= 0) { - t = lua_absindex(L, t); - lua_rawgeti(L, t, 1); - lua_assert(lua_isinteger(L, -1)); - lua_rawseti(L, t, ref); /* t[ref] = t[1] */ - lua_pushinteger(L, ref); - lua_rawseti(L, t, 1); /* t[1] = ref */ - } -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Load functions -** ======================================================= -*/ - -typedef struct LoadF { - int n; /* number of pre-read characters */ - FILE *f; /* file being read */ - char buff[BUFSIZ]; /* area for reading file */ -} LoadF; - - -static const char *getF (lua_State *L, void *ud, size_t *size) { - LoadF *lf = (LoadF *)ud; - (void)L; /* not used */ - if (lf->n > 0) { /* are there pre-read characters to be read? */ - *size = lf->n; /* return them (chars already in buffer) */ - lf->n = 0; /* no more pre-read characters */ - } - else { /* read a block from file */ - /* 'fread' can return > 0 *and* set the EOF flag. If next call to - 'getF' called 'fread', it might still wait for user input. - The next check avoids this problem. */ - if (feof(lf->f)) return NULL; - *size = fread(lf->buff, 1, sizeof(lf->buff), lf->f); /* read block */ - } - return lf->buff; -} - - -static int errfile (lua_State *L, const char *what, int fnameindex) { - const char *serr = strerror(errno); - const char *filename = lua_tostring(L, fnameindex) + 1; - lua_pushfstring(L, "cannot %s %s: %s", what, filename, serr); - lua_remove(L, fnameindex); - return LUA_ERRFILE; -} - - -/* -** Skip an optional BOM at the start of a stream. If there is an -** incomplete BOM (the first character is correct but the rest is -** not), returns the first character anyway to force an error -** (as no chunk can start with 0xEF). -*/ -static int skipBOM (FILE *f) { - int c = getc(f); /* read first character */ - if (c == 0xEF && getc(f) == 0xBB && getc(f) == 0xBF) /* correct BOM? */ - return getc(f); /* ignore BOM and return next char */ - else /* no (valid) BOM */ - return c; /* return first character */ -} - - -/* -** reads the first character of file 'f' and skips an optional BOM mark -** in its beginning plus its first line if it starts with '#'. Returns -** true if it skipped the first line. In any case, '*cp' has the -** first "valid" character of the file (after the optional BOM and -** a first-line comment). -*/ -static int skipcomment (FILE *f, int *cp) { - int c = *cp = skipBOM(f); - if (c == '#') { /* first line is a comment (Unix exec. file)? */ - do { /* skip first line */ - c = getc(f); - } while (c != EOF && c != '\n'); - *cp = getc(f); /* next character after comment, if present */ - return 1; /* there was a comment */ - } - else return 0; /* no comment */ -} - - -LUALIB_API int luaL_loadfilex (lua_State *L, const char *filename, - const char *mode) { - LoadF lf; - int status, readstatus; - int c; - int fnameindex = lua_gettop(L) + 1; /* index of filename on the stack */ - if (filename == NULL) { - lua_pushliteral(L, "=stdin"); - lf.f = stdin; - } - else { - lua_pushfstring(L, "@%s", filename); - lf.f = fopen(filename, "r"); - if (lf.f == NULL) return errfile(L, "open", fnameindex); - } - lf.n = 0; - if (skipcomment(lf.f, &c)) /* read initial portion */ - lf.buff[lf.n++] = '\n'; /* add newline to correct line numbers */ - if (c == LUA_SIGNATURE[0]) { /* binary file? */ - lf.n = 0; /* remove possible newline */ - if (filename) { /* "real" file? */ - lf.f = freopen(filename, "rb", lf.f); /* reopen in binary mode */ - if (lf.f == NULL) return errfile(L, "reopen", fnameindex); - skipcomment(lf.f, &c); /* re-read initial portion */ - } - } - if (c != EOF) - lf.buff[lf.n++] = c; /* 'c' is the first character of the stream */ - status = lua_load(L, getF, &lf, lua_tostring(L, -1), mode); - readstatus = ferror(lf.f); - if (filename) fclose(lf.f); /* close file (even in case of errors) */ - if (readstatus) { - lua_settop(L, fnameindex); /* ignore results from 'lua_load' */ - return errfile(L, "read", fnameindex); - } - lua_remove(L, fnameindex); - return status; -} - - -typedef struct LoadS { - const char *s; - size_t size; -} LoadS; - - -static const char *getS (lua_State *L, void *ud, size_t *size) { - LoadS *ls = (LoadS *)ud; - (void)L; /* not used */ - if (ls->size == 0) return NULL; - *size = ls->size; - ls->size = 0; - return ls->s; -} - - -LUALIB_API int luaL_loadbufferx (lua_State *L, const char *buff, size_t size, - const char *name, const char *mode) { - LoadS ls; - ls.s = buff; - ls.size = size; - return lua_load(L, getS, &ls, name, mode); -} - - -LUALIB_API int luaL_loadstring (lua_State *L, const char *s) { - return luaL_loadbuffer(L, s, strlen(s), s); -} - -/* }====================================================== */ - - - -LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) { - if (!lua_getmetatable(L, obj)) /* no metatable? */ - return LUA_TNIL; - else { - int tt; - lua_pushstring(L, event); - tt = lua_rawget(L, -2); - if (tt == LUA_TNIL) /* is metafield nil? */ - lua_pop(L, 2); /* remove metatable and metafield */ - else - lua_remove(L, -2); /* remove only metatable */ - return tt; /* return metafield type */ - } -} - - -LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) { - obj = lua_absindex(L, obj); - if (luaL_getmetafield(L, obj, event) == LUA_TNIL) /* no metafield? */ - return 0; - lua_pushvalue(L, obj); - lua_call(L, 1, 1); - return 1; -} - - -LUALIB_API lua_Integer luaL_len (lua_State *L, int idx) { - lua_Integer l; - int isnum; - lua_len(L, idx); - l = lua_tointegerx(L, -1, &isnum); - if (l_unlikely(!isnum)) - luaL_error(L, "object length is not an integer"); - lua_pop(L, 1); /* remove object */ - return l; -} - - -LUALIB_API const char *luaL_tolstring (lua_State *L, int idx, size_t *len) { - idx = lua_absindex(L,idx); - if (luaL_callmeta(L, idx, "__tostring")) { /* metafield? */ - if (!lua_isstring(L, -1)) - luaL_error(L, "'__tostring' must return a string"); - } - else { - switch (lua_type(L, idx)) { - case LUA_TNUMBER: { - if (lua_isinteger(L, idx)) - lua_pushfstring(L, "%I", (LUAI_UACINT)lua_tointeger(L, idx)); - else - lua_pushfstring(L, "%f", (LUAI_UACNUMBER)lua_tonumber(L, idx)); - break; - } - case LUA_TSTRING: - lua_pushvalue(L, idx); - break; - case LUA_TBOOLEAN: - lua_pushstring(L, (lua_toboolean(L, idx) ? "true" : "false")); - break; - case LUA_TNIL: - lua_pushliteral(L, "nil"); - break; - default: { - int tt = luaL_getmetafield(L, idx, "__name"); /* try name */ - const char *kind = (tt == LUA_TSTRING) ? lua_tostring(L, -1) : - luaL_typename(L, idx); - lua_pushfstring(L, "%s: %p", kind, lua_topointer(L, idx)); - if (tt != LUA_TNIL) - lua_remove(L, -2); /* remove '__name' */ - break; - } - } - } - return lua_tolstring(L, -1, len); -} - - -/* -** set functions from list 'l' into table at top - 'nup'; each -** function gets the 'nup' elements at the top as upvalues. -** Returns with only the table at the stack. -*/ -LUALIB_API void luaL_setfuncs (lua_State *L, const luaL_Reg *l, int nup) { - luaL_checkstack(L, nup, "too many upvalues"); - for (; l->name != NULL; l++) { /* fill the table with given functions */ - if (l->func == NULL) /* place holder? */ - lua_pushboolean(L, 0); - else { - int i; - for (i = 0; i < nup; i++) /* copy upvalues to the top */ - lua_pushvalue(L, -nup); - lua_pushcclosure(L, l->func, nup); /* closure with those upvalues */ - } - lua_setfield(L, -(nup + 2), l->name); - } - lua_pop(L, nup); /* remove upvalues */ -} - - -/* -** ensure that stack[idx][fname] has a table and push that table -** into the stack -*/ -LUALIB_API int luaL_getsubtable (lua_State *L, int idx, const char *fname) { - if (lua_getfield(L, idx, fname) == LUA_TTABLE) - return 1; /* table already there */ - else { - lua_pop(L, 1); /* remove previous result */ - idx = lua_absindex(L, idx); - lua_newtable(L); - lua_pushvalue(L, -1); /* copy to be left at top */ - lua_setfield(L, idx, fname); /* assign new table to field */ - return 0; /* false, because did not find table there */ - } -} - - -/* -** Stripped-down 'require': After checking "loaded" table, calls 'openf' -** to open a module, registers the result in 'package.loaded' table and, -** if 'glb' is true, also registers the result in the global table. -** Leaves resulting module on the top. -*/ -LUALIB_API void luaL_requiref (lua_State *L, const char *modname, - lua_CFunction openf, int glb) { - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_getfield(L, -1, modname); /* LOADED[modname] */ - if (!lua_toboolean(L, -1)) { /* package not already loaded? */ - lua_pop(L, 1); /* remove field */ - lua_pushcfunction(L, openf); - lua_pushstring(L, modname); /* argument to open function */ - lua_call(L, 1, 1); /* call 'openf' to open module */ - lua_pushvalue(L, -1); /* make copy of module (call result) */ - lua_setfield(L, -3, modname); /* LOADED[modname] = module */ - } - lua_remove(L, -2); /* remove LOADED table */ - if (glb) { - lua_pushvalue(L, -1); /* copy of module */ - lua_setglobal(L, modname); /* _G[modname] = module */ - } -} - - -LUALIB_API void luaL_addgsub (luaL_Buffer *b, const char *s, - const char *p, const char *r) { - const char *wild; - size_t l = strlen(p); - while ((wild = strstr(s, p)) != NULL) { - luaL_addlstring(b, s, wild - s); /* push prefix */ - luaL_addstring(b, r); /* push replacement in place of pattern */ - s = wild + l; /* continue after 'p' */ - } - luaL_addstring(b, s); /* push last suffix */ -} - - -LUALIB_API const char *luaL_gsub (lua_State *L, const char *s, - const char *p, const char *r) { - luaL_Buffer b; - luaL_buffinit(L, &b); - luaL_addgsub(&b, s, p, r); - luaL_pushresult(&b); - return lua_tostring(L, -1); -} - - -static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) { - (void)ud; (void)osize; /* not used */ - if (nsize == 0) { - free(ptr); - return NULL; - } - else - return realloc(ptr, nsize); -} - - -/* -** Standard panic funcion just prints an error message. The test -** with 'lua_type' avoids possible memory errors in 'lua_tostring'. -*/ -static int panic (lua_State *L) { - const char *msg = (lua_type(L, -1) == LUA_TSTRING) - ? lua_tostring(L, -1) - : "private_lua_error object is not a string"; - lua_writestringerror("PANIC: unprotected private_lua_error in call to Lua API (%s)\n", - msg); - return 0; /* return to Lua to abort */ -} - - -/* -** Warning functions: -** warnfoff: warning system is off -** warnfon: ready to start a new message -** warnfcont: previous message is to be continued -*/ -static void warnfoff (void *ud, const char *message, int tocont); -static void warnfon (void *ud, const char *message, int tocont); -static void warnfcont (void *ud, const char *message, int tocont); - - -/* -** Check whether message is a control message. If so, execute the -** control or ignore it if unknown. -*/ -static int checkcontrol (lua_State *L, const char *message, int tocont) { - if (tocont || *(message++) != '@') /* not a control message? */ - return 0; - else { - if (strcmp(message, "off") == 0) - lua_setwarnf(L, warnfoff, L); /* turn warnings off */ - else if (strcmp(message, "on") == 0) - lua_setwarnf(L, warnfon, L); /* turn warnings on */ - return 1; /* it was a control message */ - } -} - - -static void warnfoff (void *ud, const char *message, int tocont) { - checkcontrol((lua_State *)ud, message, tocont); -} - - -/* -** Writes the message and handle 'tocont', finishing the message -** if needed and setting the next warn function. -*/ -static void warnfcont (void *ud, const char *message, int tocont) { - lua_State *L = (lua_State *)ud; - lua_writestringerror("%s", message); /* write message */ - if (tocont) /* not the last part? */ - lua_setwarnf(L, warnfcont, L); /* to be continued */ - else { /* last part */ - lua_writestringerror("%s", "\n"); /* finish message with end-of-line */ - lua_setwarnf(L, warnfon, L); /* next call is a new message */ - } -} - - -static void warnfon (void *ud, const char *message, int tocont) { - if (checkcontrol((lua_State *)ud, message, tocont)) /* control message? */ - return; /* nothing else to be done */ - lua_writestringerror("%s", "Lua warning: "); /* start a new warning */ - warnfcont(ud, message, tocont); /* finish processing */ -} - - - -/* -** A function to compute an unsigned int with some level of -** randomness. Rely on Address Space Layout Randomization (if present) -** and the current time. -*/ -#if !defined(luai_makeseed) - -#include - - -/* Size for the buffer, in bytes */ -#define BUFSEEDB (sizeof(void*) + sizeof(time_t)) - -/* Size for the buffer in int's, rounded up */ -#define BUFSEED ((BUFSEEDB + sizeof(int) - 1) / sizeof(int)) - -/* -** Copy the contents of variable 'v' into the buffer pointed by 'b'. -** (The '&b[0]' disguises 'b' to fix an absurd warning from clang.) -*/ -#define addbuff(b,v) (memcpy(&b[0], &(v), sizeof(v)), b += sizeof(v)) - - -static unsigned int luai_makeseed (void) { - unsigned int buff[BUFSEED]; - unsigned int res; - unsigned int i; - time_t t = time(NULL); - char *b = (char*)buff; - addbuff(b, b); /* local variable's address */ - addbuff(b, t); /* time */ - /* fill (rare but possible) remain of the buffer with zeros */ - memset(b, 0, sizeof(buff) - BUFSEEDB); - res = buff[0]; - for (i = 1; i < BUFSEED; i++) - res ^= (res >> 3) + (res << 7) + buff[i]; - return res; -} - -#endif - - -LUALIB_API unsigned int luaL_makeseed (lua_State *L) { - (void)L; /* unused */ - return luai_makeseed(); -} - - -LUALIB_API lua_State *luaL_newstate (void) { - lua_State *L = lua_newstate(l_alloc, NULL, luai_makeseed()); - if (l_likely(L)) { - lua_atpanic(L, &panic); - lua_setwarnf(L, warnfoff, L); /* default is warnings off */ - } - return L; -} - - -LUALIB_API void luaL_checkversion_ (lua_State *L, lua_Number ver, size_t sz) { - lua_Number v = lua_version(L); - if (sz != LUAL_NUMSIZES) /* check numeric types */ - luaL_error(L, "core and library have incompatible numeric types"); - else if (v != ver) - luaL_error(L, "version mismatch: app. needs %f, Lua core provides %f", - (LUAI_UACNUMBER)ver, (LUAI_UACNUMBER)v); -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lauxlib.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lauxlib.h deleted file mode 100644 index 3c37068..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lauxlib.h +++ /dev/null @@ -1,303 +0,0 @@ -/* -** $Id: lauxlib.h $ -** Auxiliary functions for building Lua libraries -** See Copyright Notice in lua.h -*/ - - -#ifndef lauxlib_h -#define lauxlib_h - - -#include -#include - -#include "luaconf.h" -#include "lua.h" - - -/* global table */ -#define LUA_GNAME "_G" - - -typedef struct luaL_Buffer luaL_Buffer; - - -/* extra error code for 'luaL_loadfilex' */ -#define LUA_ERRFILE (LUA_ERRERR+1) - - -/* key, in the registry, for table of loaded modules */ -#define LUA_LOADED_TABLE "_LOADED" - - -/* key, in the registry, for table of preloaded loaders */ -#define LUA_PRELOAD_TABLE "_PRELOAD" - - -typedef struct luaL_Reg { - const char *name; - lua_CFunction func; -} luaL_Reg; - - -#define LUAL_NUMSIZES (sizeof(lua_Integer)*16 + sizeof(lua_Number)) - -LUALIB_API void (luaL_checkversion_) (lua_State *L, lua_Number ver, size_t sz); -#define luaL_checkversion(L) \ - luaL_checkversion_(L, LUA_VERSION_NUM, LUAL_NUMSIZES) - -LUALIB_API int (luaL_getmetafield) (lua_State *L, int obj, const char *e); -LUALIB_API int (luaL_callmeta) (lua_State *L, int obj, const char *e); -LUALIB_API const char *(luaL_tolstring) (lua_State *L, int idx, size_t *len); -LUALIB_API int (luaL_argerror) (lua_State *L, int arg, const char *extramsg); -LUALIB_API int (luaL_typeerror) (lua_State *L, int arg, const char *tname); -LUALIB_API const char *(luaL_checklstring) (lua_State *L, int arg, - size_t *l); -LUALIB_API const char *(luaL_optlstring) (lua_State *L, int arg, - const char *def, size_t *l); -LUALIB_API lua_Number (luaL_checknumber) (lua_State *L, int arg); -LUALIB_API lua_Number (luaL_optnumber) (lua_State *L, int arg, lua_Number def); - -LUALIB_API lua_Integer (luaL_checkinteger) (lua_State *L, int arg); -LUALIB_API lua_Integer (luaL_optinteger) (lua_State *L, int arg, - lua_Integer def); - -LUALIB_API void (luaL_checkstack) (lua_State *L, int sz, const char *msg); -LUALIB_API void (luaL_checktype) (lua_State *L, int arg, int t); -LUALIB_API void (luaL_checkany) (lua_State *L, int arg); - -LUALIB_API int (luaL_newmetatable) (lua_State *L, const char *tname); -LUALIB_API void (luaL_setmetatable) (lua_State *L, const char *tname); -LUALIB_API void *(luaL_testudata) (lua_State *L, int ud, const char *tname); -LUALIB_API void *(luaL_checkudata) (lua_State *L, int ud, const char *tname); - -LUALIB_API void (luaL_where) (lua_State *L, int lvl); -LUALIB_API int (luaL_error) (lua_State *L, const char *fmt, ...); - -LUALIB_API int (luaL_checkoption) (lua_State *L, int arg, const char *def, - const char *const lst[]); - -LUALIB_API int (luaL_fileresult) (lua_State *L, int stat, const char *fname); -LUALIB_API int (luaL_execresult) (lua_State *L, int stat); - - -/* predefined references */ -#define LUA_NOREF (-2) -#define LUA_REFNIL (-1) - -LUALIB_API int (luaL_ref) (lua_State *L, int t); -LUALIB_API void (luaL_unref) (lua_State *L, int t, int ref); - -LUALIB_API int (luaL_loadfilex) (lua_State *L, const char *filename, - const char *mode); - -#define luaL_loadfile(L,f) luaL_loadfilex(L,f,NULL) - -LUALIB_API int (luaL_loadbufferx) (lua_State *L, const char *buff, size_t sz, - const char *name, const char *mode); -LUALIB_API int (luaL_loadstring) (lua_State *L, const char *s); - -LUALIB_API lua_State *(luaL_newstate) (void); - -LUALIB_API unsigned luaL_makeseed (lua_State *L); - -LUALIB_API lua_Integer (luaL_len) (lua_State *L, int idx); - -LUALIB_API void (luaL_addgsub) (luaL_Buffer *b, const char *s, - const char *p, const char *r); -LUALIB_API const char *(luaL_gsub) (lua_State *L, const char *s, - const char *p, const char *r); - -LUALIB_API void (luaL_setfuncs) (lua_State *L, const luaL_Reg *l, int nup); - -LUALIB_API int (luaL_getsubtable) (lua_State *L, int idx, const char *fname); - -LUALIB_API void (luaL_traceback) (lua_State *L, lua_State *L1, - const char *msg, int level); - -LUALIB_API void (luaL_requiref) (lua_State *L, const char *modname, - lua_CFunction openf, int glb); - -/* -** =============================================================== -** some useful macros -** =============================================================== -*/ - - -#define luaL_newlibtable(L,l) \ - lua_createtable(L, 0, sizeof(l)/sizeof((l)[0]) - 1) - -#define luaL_newlib(L,l) \ - (luaL_checkversion(L), luaL_newlibtable(L,l), luaL_setfuncs(L,l,0)) - -#define luaL_argcheck(L, cond,arg,extramsg) \ - ((void)(luai_likely(cond) || luaL_argerror(L, (arg), (extramsg)))) - -#define luaL_argexpected(L,cond,arg,tname) \ - ((void)(luai_likely(cond) || luaL_typeerror(L, (arg), (tname)))) - -#define luaL_checkstring(L,n) (luaL_checklstring(L, (n), NULL)) -#define luaL_optstring(L,n,d) (luaL_optlstring(L, (n), (d), NULL)) - -#define luaL_typename(L,i) lua_typename(L, lua_type(L,(i))) - -#define luaL_dofile(L, fn) \ - (luaL_loadfile(L, fn) || lua_pcall(L, 0, LUA_MULTRET, 0)) - -#define luaL_dostring(L, s) \ - (luaL_loadstring(L, s) || lua_pcall(L, 0, LUA_MULTRET, 0)) - -#define luaL_getmetatable(L,n) (lua_getfield(L, LUA_REGISTRYINDEX, (n))) - -#define luaL_opt(L,f,n,d) (lua_isnoneornil(L,(n)) ? (d) : f(L,(n))) - -#define luaL_loadbuffer(L,s,sz,n) luaL_loadbufferx(L,s,sz,n,NULL) - - -/* -** Perform arithmetic operations on lua_Integer values with wrap-around -** semantics, as the Lua core does. -*/ -#define luaL_intop(op,v1,v2) \ - ((lua_Integer)((lua_Unsigned)(v1) op (lua_Unsigned)(v2))) - - -/* push the value used to represent failure/error */ -#define luaL_pushfail(L) lua_pushnil(L) - - -/* -** Internal assertions for in-house debugging -*/ -#if !defined(lua_assert) - -#if defined LUAI_ASSERT - #include - #define lua_assert(c) assert(c) -#else - #define lua_assert(c) ((void)0) -#endif - -#endif - - - -/* -** {====================================================== -** Generic Buffer manipulation -** ======================================================= -*/ - -struct luaL_Buffer { - char *b; /* buffer address */ - size_t size; /* buffer size */ - size_t n; /* number of characters in buffer */ - lua_State *L; - union { - LUAI_MAXALIGN; /* ensure maximum alignment for buffer */ - char b[LUAL_BUFFERSIZE]; /* initial buffer */ - } init; -}; - - -#define luaL_bufflen(bf) ((bf)->n) -#define luaL_buffaddr(bf) ((bf)->b) - - -#define luaL_addchar(B,c) \ - ((void)((B)->n < (B)->size || luaL_prepbuffsize((B), 1)), \ - ((B)->b[(B)->n++] = (c))) - -#define luaL_addsize(B,s) ((B)->n += (s)) - -#define luaL_buffsub(B,s) ((B)->n -= (s)) - -LUALIB_API void (luaL_buffinit) (lua_State *L, luaL_Buffer *B); -LUALIB_API char *(luaL_prepbuffsize) (luaL_Buffer *B, size_t sz); -LUALIB_API void (luaL_addlstring) (luaL_Buffer *B, const char *s, size_t l); -LUALIB_API void (luaL_addstring) (luaL_Buffer *B, const char *s); -LUALIB_API void (luaL_addvalue) (luaL_Buffer *B); -LUALIB_API void (luaL_pushresult) (luaL_Buffer *B); -LUALIB_API void (luaL_pushresultsize) (luaL_Buffer *B, size_t sz); -LUALIB_API char *(luaL_buffinitsize) (lua_State *L, luaL_Buffer *B, size_t sz); - -#define luaL_prepbuffer(B) luaL_prepbuffsize(B, LUAL_BUFFERSIZE) - -/* }====================================================== */ - - - -/* -** {====================================================== -** File handles for IO library -** ======================================================= -*/ - -/* -** A file handle is a userdata with metatable 'LUA_FILEHANDLE' and -** initial structure 'luaL_Stream' (it may contain other fields -** after that initial structure). -*/ - -#define LUA_FILEHANDLE "FILE*" - - -typedef struct luaL_Stream { - FILE *f; /* stream (NULL for incompletely created streams) */ - lua_CFunction closef; /* to close stream (NULL for closed streams) */ -} luaL_Stream; - -/* }====================================================== */ - -/* -** {================================================================== -** "Abstraction Layer" for basic report of messages and errors -** =================================================================== -*/ - -/* print a string */ -#if !defined(lua_writestring) -#define lua_writestring(s,l) fwrite((s), sizeof(char), (l), stdout) -#endif - -/* print a newline and flush the output */ -#if !defined(lua_writeline) -#define lua_writeline() (lua_writestring("\n", 1), fflush(stdout)) -#endif - -/* print an error message */ -#if !defined(lua_writestringerror) -#define lua_writestringerror(s,p) \ - (fprintf(stderr, (s), (p)), fflush(stderr)) -#endif - -/* }================================================================== */ - - -/* -** {============================================================ -** Compatibility with deprecated conversions -** ============================================================= -*/ -#if defined(LUA_COMPAT_APIINTCASTS) - -#define luaL_checkunsigned(L,a) ((lua_Unsigned)luaL_checkinteger(L,a)) -#define luaL_optunsigned(L,a,d) \ - ((lua_Unsigned)luaL_optinteger(L,a,(lua_Integer)(d))) - -#define luaL_checkint(L,n) ((int)luaL_checkinteger(L, (n))) -#define luaL_optint(L,n,d) ((int)luaL_optinteger(L, (n), (d))) - -#define luaL_checklong(L,n) ((long)luaL_checkinteger(L, (n))) -#define luaL_optlong(L,n,d) ((long)luaL_optinteger(L, (n), (d))) - -#endif -/* }============================================================ */ - - - -#endif - - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lbaselib.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lbaselib.c deleted file mode 100644 index 4238f96..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lbaselib.c +++ /dev/null @@ -1,556 +0,0 @@ -/* -** $Id: lbaselib.c $ -** Basic library -** See Copyright Notice in lua.h -*/ - -#define lbaselib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -static int luaB_print (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - int i; - for (i = 1; i <= n; i++) { /* for each argument */ - size_t l; - const char *s = luaL_tolstring(L, i, &l); /* convert it to string */ - if (i > 1) /* not the first element? */ - lua_writestring("\t", 1); /* add a tab before it */ - lua_writestring(s, l); /* print it */ - lua_pop(L, 1); /* pop result */ - } - lua_writeline(); - return 0; -} - - -/* -** Creates a warning with all given arguments. -** Check first for errors; otherwise an error may interrupt -** the composition of a warning, leaving it unfinished. -*/ -static int luaB_warn (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - int i; - luaL_checkstring(L, 1); /* at least one argument */ - for (i = 2; i <= n; i++) - luaL_checkstring(L, i); /* make sure all arguments are strings */ - for (i = 1; i < n; i++) /* compose warning */ - lua_warning(L, lua_tostring(L, i), 1); - lua_warning(L, lua_tostring(L, n), 0); /* close warning */ - return 0; -} - - -#define SPACECHARS " \f\n\r\t\v" - -static const char *b_str2int (const char *s, int base, lua_Integer *pn) { - lua_Unsigned n = 0; - int neg = 0; - s += strspn(s, SPACECHARS); /* skip initial spaces */ - if (*s == '-') { s++; neg = 1; } /* handle sign */ - else if (*s == '+') s++; - if (!isalnum((unsigned char)*s)) /* no digit? */ - return NULL; - do { - int digit = (isdigit((unsigned char)*s)) ? *s - '0' - : (toupper((unsigned char)*s) - 'A') + 10; - if (digit >= base) return NULL; /* invalid numeral */ - n = n * base + digit; - s++; - } while (isalnum((unsigned char)*s)); - s += strspn(s, SPACECHARS); /* skip trailing spaces */ - *pn = (lua_Integer)((neg) ? (0u - n) : n); - return s; -} - - -static int luaB_tonumber (lua_State *L) { - if (lua_isnoneornil(L, 2)) { /* standard conversion? */ - if (lua_type(L, 1) == LUA_TNUMBER) { /* already a number? */ - lua_settop(L, 1); /* yes; return it */ - return 1; - } - else { - size_t l; - const char *s = lua_tolstring(L, 1, &l); - if (s != NULL && lua_stringtonumber(L, s) == l + 1) - return 1; /* successful conversion to number */ - /* else not a number */ - luaL_checkany(L, 1); /* (but there must be some parameter) */ - } - } - else { - size_t l; - const char *s; - lua_Integer n = 0; /* to avoid warnings */ - lua_Integer base = luaL_checkinteger(L, 2); - luaL_checktype(L, 1, LUA_TSTRING); /* no numbers as strings */ - s = lua_tolstring(L, 1, &l); - luaL_argcheck(L, 2 <= base && base <= 36, 2, "base out of range"); - if (b_str2int(s, (int)base, &n) == s + l) { - lua_pushinteger(L, n); - return 1; - } /* else not a number */ - } /* else not a number */ - luaL_pushfail(L); /* not a number */ - return 1; -} - - -static int luaB_error (lua_State *L) { - int level = (int)luaL_optinteger(L, 2, 1); - lua_settop(L, 1); - if (lua_type(L, 1) == LUA_TSTRING && level > 0) { - luaL_where(L, level); /* add extra information */ - lua_pushvalue(L, 1); - lua_concat(L, 2); - } - return lua_error(L); -} - - -static int luaB_getmetatable (lua_State *L) { - luaL_checkany(L, 1); - if (!lua_getmetatable(L, 1)) { - lua_pushnil(L); - return 1; /* no metatable */ - } - luaL_getmetafield(L, 1, "__metatable"); - return 1; /* returns either __metatable field (if present) or metatable */ -} - - -static int luaB_setmetatable (lua_State *L) { - int t = lua_type(L, 2); - luaL_checktype(L, 1, LUA_TTABLE); - luaL_argexpected(L, t == LUA_TNIL || t == LUA_TTABLE, 2, "nil or table"); - if (l_unlikely(luaL_getmetafield(L, 1, "__metatable") != LUA_TNIL)) - return luaL_error(L, "cannot change a protected metatable"); - lua_settop(L, 2); - lua_setmetatable(L, 1); - return 1; -} - - -static int luaB_rawequal (lua_State *L) { - luaL_checkany(L, 1); - luaL_checkany(L, 2); - lua_pushboolean(L, lua_rawequal(L, 1, 2)); - return 1; -} - - -static int luaB_rawlen (lua_State *L) { - int t = lua_type(L, 1); - luaL_argexpected(L, t == LUA_TTABLE || t == LUA_TSTRING, 1, - "table or string"); - lua_pushinteger(L, lua_rawlen(L, 1)); - return 1; -} - - -static int luaB_rawget (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - luaL_checkany(L, 2); - lua_settop(L, 2); - lua_rawget(L, 1); - return 1; -} - -static int luaB_rawset (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - luaL_checkany(L, 2); - luaL_checkany(L, 3); - lua_settop(L, 3); - lua_rawset(L, 1); - return 1; -} - - -static int pushmode (lua_State *L, int oldmode) { - if (oldmode == -1) - luaL_pushfail(L); /* invalid call to 'lua_gc' */ - else - lua_pushstring(L, (oldmode == LUA_GCINC) ? "incremental" - : "generational"); - return 1; -} - - -/* -** check whether call to 'lua_gc' was valid (not inside a finalizer) -*/ -#define checkvalres(res) { if (res == -1) break; } - -static int luaB_collectgarbage (lua_State *L) { - static const char *const opts[] = {"stop", "restart", "collect", - "count", "step", "isrunning", "generational", "incremental", - "param", NULL}; - static const char optsnum[] = {LUA_GCSTOP, LUA_GCRESTART, LUA_GCCOLLECT, - LUA_GCCOUNT, LUA_GCSTEP, LUA_GCISRUNNING, LUA_GCGEN, LUA_GCINC, - LUA_GCPARAM}; - int o = optsnum[luaL_checkoption(L, 1, "collect", opts)]; - switch (o) { - case LUA_GCCOUNT: { - int k = lua_gc(L, o); - int b = lua_gc(L, LUA_GCCOUNTB); - checkvalres(k); - lua_pushnumber(L, (lua_Number)k + ((lua_Number)b/1024)); - return 1; - } - case LUA_GCSTEP: { - lua_Integer n = luaL_optinteger(L, 2, 0); - int res = lua_gc(L, o, (int)n); - checkvalres(res); - lua_pushboolean(L, res); - return 1; - } - case LUA_GCISRUNNING: { - int res = lua_gc(L, o); - checkvalres(res); - lua_pushboolean(L, res); - return 1; - } - case LUA_GCGEN: { - return pushmode(L, lua_gc(L, o)); - } - case LUA_GCINC: { - return pushmode(L, lua_gc(L, o)); - } - case LUA_GCPARAM: { - static const char *const params[] = { - "minormul", "majorminor", "minormajor", - "pause", "stepmul", "stepsize", NULL}; - static const char pnum[] = { - LUA_GCPMINORMUL, LUA_GCPMAJORMINOR, LUA_GCPMINORMAJOR, - LUA_GCPPAUSE, LUA_GCPSTEPMUL, LUA_GCPSTEPSIZE}; - int p = pnum[luaL_checkoption(L, 2, NULL, params)]; - lua_Integer value = luaL_optinteger(L, 3, -1); - lua_pushinteger(L, lua_gc(L, o, p, (int)value)); - return 1; - } - default: { - int res = lua_gc(L, o); - checkvalres(res); - lua_pushinteger(L, res); - return 1; - } - } - luaL_pushfail(L); /* invalid call (inside a finalizer) */ - return 1; -} - - -static int luaB_type (lua_State *L) { - int t = lua_type(L, 1); - luaL_argcheck(L, t != LUA_TNONE, 1, "value expected"); - lua_pushstring(L, lua_typename(L, t)); - return 1; -} - - -static int luaB_next (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - lua_settop(L, 2); /* create a 2nd argument if there isn't one */ - if (lua_next(L, 1)) - return 2; - else { - lua_pushnil(L); - return 1; - } -} - - -static int pairscont (lua_State *L, int status, lua_KContext k) { - (void)L; (void)status; (void)k; /* unused */ - return 3; -} - -static int luaB_pairs (lua_State *L) { - luaL_checkany(L, 1); - if (luaL_getmetafield(L, 1, "__pairs") == LUA_TNIL) { /* no metamethod? */ - lua_pushcfunction(L, luaB_next); /* will return generator, */ - lua_pushvalue(L, 1); /* state, */ - lua_pushnil(L); /* and initial value */ - } - else { - lua_pushvalue(L, 1); /* argument 'self' to metamethod */ - lua_callk(L, 1, 3, 0, pairscont); /* get 3 values from metamethod */ - } - return 3; -} - - -/* -** Traversal function for 'ipairs' -*/ -static int ipairsaux (lua_State *L) { - lua_Integer i = luaL_checkinteger(L, 2); - i = luaL_intop(+, i, 1); - lua_pushinteger(L, i); - return (lua_geti(L, 1, i) == LUA_TNIL) ? 1 : 2; -} - - -/* -** 'ipairs' function. Returns 'ipairsaux', given "table", 0. -** (The given "table" may not be a table.) -*/ -static int luaB_ipairs (lua_State *L) { - luaL_checkany(L, 1); - lua_pushcfunction(L, ipairsaux); /* iteration function */ - lua_pushvalue(L, 1); /* state */ - lua_pushinteger(L, 0); /* initial value */ - return 3; -} - - -static int load_aux (lua_State *L, int status, int envidx) { - if (l_likely(status == LUA_OK)) { - if (envidx != 0) { /* 'env' parameter? */ - lua_pushvalue(L, envidx); /* environment for loaded function */ - if (!lua_setupvalue(L, -2, 1)) /* set it as 1st upvalue */ - lua_pop(L, 1); /* remove 'env' if not used by previous call */ - } - return 1; - } - else { /* error (message is on top of the stack) */ - luaL_pushfail(L); - lua_insert(L, -2); /* put before error message */ - return 2; /* return fail plus error message */ - } -} - - -static const char *getmode (lua_State *L, int idx) { - const char *mode = luaL_optstring(L, idx, "bt"); - if (strchr(mode, 'B') != NULL) /* Lua code cannot use fixed buffers */ - luaL_argerror(L, idx, "invalid mode"); - return mode; -} - - -static int luaB_loadfile (lua_State *L) { - const char *fname = luaL_optstring(L, 1, NULL); - const char *mode = getmode(L, 2); - int env = (!lua_isnone(L, 3) ? 3 : 0); /* 'env' index or 0 if no 'env' */ - int status = luaL_loadfilex(L, fname, mode); - return load_aux(L, status, env); -} - - -/* -** {====================================================== -** Generic Read function -** ======================================================= -*/ - - -/* -** reserved slot, above all arguments, to hold a copy of the returned -** string to avoid it being collected while parsed. 'load' has four -** optional arguments (chunk, source name, mode, and environment). -*/ -#define RESERVEDSLOT 5 - - -/* -** Reader for generic 'load' function: 'lua_load' uses the -** stack for internal stuff, so the reader cannot change the -** stack top. Instead, it keeps its resulting string in a -** reserved slot inside the stack. -*/ -static const char *generic_reader (lua_State *L, void *ud, size_t *size) { - (void)(ud); /* not used */ - luaL_checkstack(L, 2, "too many nested functions"); - lua_pushvalue(L, 1); /* get function */ - lua_call(L, 0, 1); /* call it */ - if (lua_isnil(L, -1)) { - lua_pop(L, 1); /* pop result */ - *size = 0; - return NULL; - } - else if (l_unlikely(!lua_isstring(L, -1))) - luaL_error(L, "reader function must return a string"); - lua_replace(L, RESERVEDSLOT); /* save string in reserved slot */ - return lua_tolstring(L, RESERVEDSLOT, size); -} - - -static int luaB_load (lua_State *L) { - int status; - size_t l; - const char *s = lua_tolstring(L, 1, &l); - const char *mode = getmode(L, 3); - int env = (!lua_isnone(L, 4) ? 4 : 0); /* 'env' index or 0 if no 'env' */ - if (s != NULL) { /* loading a string? */ - const char *chunkname = luaL_optstring(L, 2, s); - status = luaL_loadbufferx(L, s, l, chunkname, mode); - } - else { /* loading from a reader function */ - const char *chunkname = luaL_optstring(L, 2, "=(load)"); - luaL_checktype(L, 1, LUA_TFUNCTION); - lua_settop(L, RESERVEDSLOT); /* create reserved slot */ - status = lua_load(L, generic_reader, NULL, chunkname, mode); - } - return load_aux(L, status, env); -} - -/* }====================================================== */ - - -static int dofilecont (lua_State *L, int d1, lua_KContext d2) { - (void)d1; (void)d2; /* only to match 'lua_Kfunction' prototype */ - return lua_gettop(L) - 1; -} - - -static int luaB_dofile (lua_State *L) { - const char *fname = luaL_optstring(L, 1, NULL); - lua_settop(L, 1); - if (l_unlikely(luaL_loadfile(L, fname) != LUA_OK)) - return lua_error(L); - lua_callk(L, 0, LUA_MULTRET, 0, dofilecont); - return dofilecont(L, 0, 0); -} - - -static int luaB_assert (lua_State *L) { - if (l_likely(lua_toboolean(L, 1))) /* condition is true? */ - return lua_gettop(L); /* return all arguments */ - else { /* error */ - luaL_checkany(L, 1); /* there must be a condition */ - lua_remove(L, 1); /* remove it */ - lua_pushliteral(L, "assertion failed!"); /* default message */ - lua_settop(L, 1); /* leave only message (default if no other one) */ - return luaB_error(L); /* call 'error' */ - } -} - - -static int luaB_select (lua_State *L) { - int n = lua_gettop(L); - if (lua_type(L, 1) == LUA_TSTRING && *lua_tostring(L, 1) == '#') { - lua_pushinteger(L, n-1); - return 1; - } - else { - lua_Integer i = luaL_checkinteger(L, 1); - if (i < 0) i = n + i; - else if (i > n) i = n; - luaL_argcheck(L, 1 <= i, 1, "index out of range"); - return n - (int)i; - } -} - - -/* -** Continuation function for 'pcall' and 'xpcall'. Both functions -** already pushed a 'true' before doing the call, so in case of success -** 'finishpcall' only has to return everything in the stack minus -** 'extra' values (where 'extra' is exactly the number of items to be -** ignored). -*/ -static int finishpcall (lua_State *L, int status, lua_KContext extra) { - if (l_unlikely(status != LUA_OK && status != LUA_YIELD)) { /* error? */ - lua_pushboolean(L, 0); /* first result (false) */ - lua_pushvalue(L, -2); /* error message */ - return 2; /* return false, msg */ - } - else - return lua_gettop(L) - (int)extra; /* return all results */ -} - - -static int luaB_pcall (lua_State *L) { - int status; - luaL_checkany(L, 1); - lua_pushboolean(L, 1); /* first result if no errors */ - lua_insert(L, 1); /* put it in place */ - status = lua_pcallk(L, lua_gettop(L) - 2, LUA_MULTRET, 0, 0, finishpcall); - return finishpcall(L, status, 0); -} - - -/* -** Do a protected call with error handling. After 'lua_rotate', the -** stack will have ; so, the function passes -** 2 to 'finishpcall' to skip the 2 first values when returning results. -*/ -static int luaB_xpcall (lua_State *L) { - int status; - int n = lua_gettop(L); - luaL_checktype(L, 2, LUA_TFUNCTION); /* check error function */ - lua_pushboolean(L, 1); /* first result */ - lua_pushvalue(L, 1); /* function */ - lua_rotate(L, 3, 2); /* move them below function's arguments */ - status = lua_pcallk(L, n - 2, LUA_MULTRET, 2, 2, finishpcall); - return finishpcall(L, status, 2); -} - - -static int luaB_tostring (lua_State *L) { - luaL_checkany(L, 1); - luaL_tolstring(L, 1, NULL); - return 1; -} - - -static const luaL_Reg base_funcs[] = { - {"assert", luaB_assert}, - {"collectgarbage", luaB_collectgarbage}, - {"dofile", luaB_dofile}, - {"error", luaB_error}, - {"getmetatable", luaB_getmetatable}, - {"ipairs", luaB_ipairs}, - {"loadfile", luaB_loadfile}, - {"load", luaB_load}, - {"next", luaB_next}, - {"pairs", luaB_pairs}, - {"pcall", luaB_pcall}, - {"print", luaB_print}, - {"warn", luaB_warn}, - {"rawequal", luaB_rawequal}, - {"rawlen", luaB_rawlen}, - {"rawget", luaB_rawget}, - {"rawset", luaB_rawset}, - {"select", luaB_select}, - {"setmetatable", luaB_setmetatable}, - {"tonumber", luaB_tonumber}, - {"tostring", luaB_tostring}, - {"type", luaB_type}, - {"xpcall", luaB_xpcall}, - /* placeholders */ - {LUA_GNAME, NULL}, - {"_VERSION", NULL}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_base (lua_State *L) { - /* open lib into global table */ - lua_pushglobaltable(L); - luaL_setfuncs(L, base_funcs, 0); - /* set global _G */ - lua_pushvalue(L, -1); - lua_setfield(L, -2, LUA_GNAME); - /* set global _VERSION */ - lua_pushliteral(L, LUA_VERSION); - lua_setfield(L, -2, "_VERSION"); - return 1; -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lcode.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lcode.c deleted file mode 100644 index 2c57fda..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lcode.c +++ /dev/null @@ -1,1872 +0,0 @@ -/* -** $Id: lcode.c $ -** Code generator for Lua -** See Copyright Notice in lua.h -*/ - -#define lcode_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include -#include - -#include "lua.h" - -#include "lcode.h" -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "llex.h" -#include "lmem.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lparser.h" -#include "lstring.h" -#include "ltable.h" -#include "lvm.h" - - -/* Maximum number of registers in a Lua function (must fit in 8 bits) */ -#define MAXREGS 255 - - -#define hasjumps(e) ((e)->t != (e)->f) - - -static int codesJ (FuncState *fs, OpCode o, int sj, int k); - - - -/* semantic error */ -l_noret luaK_semerror (LexState *ls, const char *msg) { - ls->t.token = 0; /* remove "near " from final message */ - luaX_syntaxerror(ls, msg); -} - - -/* -** If expression is a numeric constant, fills 'v' with its value -** and returns 1. Otherwise, returns 0. -*/ -static int tonumeral (const expdesc *e, TValue *v) { - if (hasjumps(e)) - return 0; /* not a numeral */ - switch (e->k) { - case VKINT: - if (v) setivalue(v, e->u.ival); - return 1; - case VKFLT: - if (v) setfltvalue(v, e->u.nval); - return 1; - default: return 0; - } -} - - -/* -** Get the constant value from a constant expression -*/ -static TValue *const2val (FuncState *fs, const expdesc *e) { - lua_assert(e->k == VCONST); - return &fs->ls->dyd->actvar.arr[e->u.info].k; -} - - -/* -** If expression is a constant, fills 'v' with its value -** and returns 1. Otherwise, returns 0. -*/ -int luaK_exp2const (FuncState *fs, const expdesc *e, TValue *v) { - if (hasjumps(e)) - return 0; /* not a constant */ - switch (e->k) { - case VFALSE: - setbfvalue(v); - return 1; - case VTRUE: - setbtvalue(v); - return 1; - case VNIL: - setnilvalue(v); - return 1; - case VKSTR: { - setsvalue(fs->ls->L, v, e->u.strval); - return 1; - } - case VCONST: { - setobj(fs->ls->L, v, const2val(fs, e)); - return 1; - } - default: return tonumeral(e, v); - } -} - - -/* -** Return the previous instruction of the current code. If there -** may be a jump target between the current instruction and the -** previous one, return an invalid instruction (to avoid wrong -** optimizations). -*/ -static Instruction *previousinstruction (FuncState *fs) { - static const Instruction invalidinstruction = ~(Instruction)0; - if (fs->pc > fs->lasttarget) - return &fs->f->code[fs->pc - 1]; /* previous instruction */ - else - return cast(Instruction*, &invalidinstruction); -} - - -/* -** Create a OP_LOADNIL instruction, but try to optimize: if the previous -** instruction is also OP_LOADNIL and ranges are compatible, adjust -** range of previous instruction instead of emitting a new one. (For -** instance, 'local a; local b' will generate a single opcode.) -*/ -void luaK_nil (FuncState *fs, int from, int n) { - int l = from + n - 1; /* last register to set nil */ - Instruction *previous = previousinstruction(fs); - if (GET_OPCODE(*previous) == OP_LOADNIL) { /* previous is LOADNIL? */ - int pfrom = GETARG_A(*previous); /* get previous range */ - int pl = pfrom + GETARG_B(*previous); - if ((pfrom <= from && from <= pl + 1) || - (from <= pfrom && pfrom <= l + 1)) { /* can connect both? */ - if (pfrom < from) from = pfrom; /* from = min(from, pfrom) */ - if (pl > l) l = pl; /* l = max(l, pl) */ - SETARG_A(*previous, from); - SETARG_B(*previous, l - from); - return; - } /* else go through */ - } - luaK_codeABC(fs, OP_LOADNIL, from, n - 1, 0); /* else no optimization */ -} - - -/* -** Gets the destination address of a jump instruction. Used to traverse -** a list of jumps. -*/ -static int getjump (FuncState *fs, int pc) { - int offset = GETARG_sJ(fs->f->code[pc]); - if (offset == NO_JUMP) /* point to itself represents end of list */ - return NO_JUMP; /* end of list */ - else - return (pc+1)+offset; /* turn offset into absolute position */ -} - - -/* -** Fix jump instruction at position 'pc' to jump to 'dest'. -** (Jump addresses are relative in Lua) -*/ -static void fixjump (FuncState *fs, int pc, int dest) { - Instruction *jmp = &fs->f->code[pc]; - int offset = dest - (pc + 1); - lua_assert(dest != NO_JUMP); - if (!(-OFFSET_sJ <= offset && offset <= MAXARG_sJ - OFFSET_sJ)) - luaX_syntaxerror(fs->ls, "control structure too long"); - lua_assert(GET_OPCODE(*jmp) == OP_JMP); - SETARG_sJ(*jmp, offset); -} - - -/* -** Concatenate jump-list 'l2' into jump-list 'l1' -*/ -void luaK_concat (FuncState *fs, int *l1, int l2) { - if (l2 == NO_JUMP) return; /* nothing to concatenate? */ - else if (*l1 == NO_JUMP) /* no original list? */ - *l1 = l2; /* 'l1' points to 'l2' */ - else { - int list = *l1; - int next; - while ((next = getjump(fs, list)) != NO_JUMP) /* find last element */ - list = next; - fixjump(fs, list, l2); /* last element links to 'l2' */ - } -} - - -/* -** Create a jump instruction and return its position, so its destination -** can be fixed later (with 'fixjump'). -*/ -int luaK_jump (FuncState *fs) { - return codesJ(fs, OP_JMP, NO_JUMP, 0); -} - - -/* -** Code a 'return' instruction -*/ -void luaK_ret (FuncState *fs, int first, int nret) { - OpCode op; - switch (nret) { - case 0: op = OP_RETURN0; break; - case 1: op = OP_RETURN1; break; - default: op = OP_RETURN; break; - } - luaK_codeABC(fs, op, first, nret + 1, 0); -} - - -/* -** Code a "conditional jump", that is, a test or comparison opcode -** followed by a jump. Return jump position. -*/ -static int condjump (FuncState *fs, OpCode op, int A, int B, int C, int k) { - luaK_codeABCk(fs, op, A, B, C, k); - return luaK_jump(fs); -} - - -/* -** returns current 'pc' and marks it as a jump target (to avoid wrong -** optimizations with consecutive instructions not in the same basic block). -*/ -int luaK_getlabel (FuncState *fs) { - fs->lasttarget = fs->pc; - return fs->pc; -} - - -/* -** Returns the position of the instruction "controlling" a given -** jump (that is, its condition), or the jump itself if it is -** unconditional. -*/ -static Instruction *getjumpcontrol (FuncState *fs, int pc) { - Instruction *pi = &fs->f->code[pc]; - if (pc >= 1 && testTMode(GET_OPCODE(*(pi-1)))) - return pi-1; - else - return pi; -} - - -/* -** Patch destination register for a TESTSET instruction. -** If instruction in position 'node' is not a TESTSET, return 0 ("fails"). -** Otherwise, if 'reg' is not 'NO_REG', set it as the destination -** register. Otherwise, change instruction to a simple 'TEST' (produces -** no register value) -*/ -static int patchtestreg (FuncState *fs, int node, int reg) { - Instruction *i = getjumpcontrol(fs, node); - if (GET_OPCODE(*i) != OP_TESTSET) - return 0; /* cannot patch other instructions */ - if (reg != NO_REG && reg != GETARG_B(*i)) - SETARG_A(*i, reg); - else { - /* no register to put value or register already has the value; - change instruction to simple test */ - *i = CREATE_ABCk(OP_TEST, GETARG_B(*i), 0, 0, GETARG_k(*i)); - } - return 1; -} - - -/* -** Traverse a list of tests ensuring no one produces a value -*/ -static void removevalues (FuncState *fs, int list) { - for (; list != NO_JUMP; list = getjump(fs, list)) - patchtestreg(fs, list, NO_REG); -} - - -/* -** Traverse a list of tests, patching their destination address and -** registers: tests producing values jump to 'vtarget' (and put their -** values in 'reg'), other tests jump to 'dtarget'. -*/ -static void patchlistaux (FuncState *fs, int list, int vtarget, int reg, - int dtarget) { - while (list != NO_JUMP) { - int next = getjump(fs, list); - if (patchtestreg(fs, list, reg)) - fixjump(fs, list, vtarget); - else - fixjump(fs, list, dtarget); /* jump to default target */ - list = next; - } -} - - -/* -** Path all jumps in 'list' to jump to 'target'. -** (The assert means that we cannot fix a jump to a forward address -** because we only know addresses once code is generated.) -*/ -void luaK_patchlist (FuncState *fs, int list, int target) { - lua_assert(target <= fs->pc); - patchlistaux(fs, list, target, NO_REG, target); -} - - -void luaK_patchtohere (FuncState *fs, int list) { - int hr = luaK_getlabel(fs); /* mark "here" as a jump target */ - luaK_patchlist(fs, list, hr); -} - - -/* limit for difference between lines in relative line info. */ -#define LIMLINEDIFF 0x80 - - -/* -** Save line info for a new instruction. If difference from last line -** does not fit in a byte, of after that many instructions, save a new -** absolute line info; (in that case, the special value 'ABSLINEINFO' -** in 'lineinfo' signals the existence of this absolute information.) -** Otherwise, store the difference from last line in 'lineinfo'. -*/ -static void savelineinfo (FuncState *fs, Proto *f, int line) { - int linedif = line - fs->previousline; - int pc = fs->pc - 1; /* last instruction coded */ - if (abs(linedif) >= LIMLINEDIFF || fs->iwthabs++ >= MAXIWTHABS) { - luaM_growvector(fs->ls->L, f->abslineinfo, fs->nabslineinfo, - f->sizeabslineinfo, AbsLineInfo, MAX_INT, "lines"); - f->abslineinfo[fs->nabslineinfo].pc = pc; - f->abslineinfo[fs->nabslineinfo++].line = line; - linedif = ABSLINEINFO; /* signal that there is absolute information */ - fs->iwthabs = 1; /* restart counter */ - } - luaM_growvector(fs->ls->L, f->lineinfo, pc, f->sizelineinfo, ls_byte, - MAX_INT, "opcodes"); - f->lineinfo[pc] = linedif; - fs->previousline = line; /* last line saved */ -} - - -/* -** Remove line information from the last instruction. -** If line information for that instruction is absolute, set 'iwthabs' -** above its max to force the new (replacing) instruction to have -** absolute line info, too. -*/ -static void removelastlineinfo (FuncState *fs) { - Proto *f = fs->f; - int pc = fs->pc - 1; /* last instruction coded */ - if (f->lineinfo[pc] != ABSLINEINFO) { /* relative line info? */ - fs->previousline -= f->lineinfo[pc]; /* correct last line saved */ - fs->iwthabs--; /* undo previous increment */ - } - else { /* absolute line information */ - lua_assert(f->abslineinfo[fs->nabslineinfo - 1].pc == pc); - fs->nabslineinfo--; /* remove it */ - fs->iwthabs = MAXIWTHABS + 1; /* force next line info to be absolute */ - } -} - - -/* -** Remove the last instruction created, correcting line information -** accordingly. -*/ -static void removelastinstruction (FuncState *fs) { - removelastlineinfo(fs); - fs->pc--; -} - - -/* -** Emit instruction 'i', checking for array sizes and saving also its -** line information. Return 'i' position. -*/ -int luaK_code (FuncState *fs, Instruction i) { - Proto *f = fs->f; - /* put new instruction in code array */ - luaM_growvector(fs->ls->L, f->code, fs->pc, f->sizecode, Instruction, - MAX_INT, "opcodes"); - f->code[fs->pc++] = i; - savelineinfo(fs, f, fs->ls->lastline); - return fs->pc - 1; /* index of new instruction */ -} - - -/* -** Format and emit an 'iABC' instruction. (Assertions check consistency -** of parameters versus opcode.) -*/ -int luaK_codeABCk (FuncState *fs, OpCode o, int a, int b, int c, int k) { - lua_assert(getOpMode(o) == iABC); - lua_assert(a <= MAXARG_A && b <= MAXARG_B && - c <= MAXARG_C && (k & ~1) == 0); - return luaK_code(fs, CREATE_ABCk(o, a, b, c, k)); -} - - -/* -** Format and emit an 'iABx' instruction. -*/ -int luaK_codeABx (FuncState *fs, OpCode o, int a, unsigned int bc) { - lua_assert(getOpMode(o) == iABx); - lua_assert(a <= MAXARG_A && bc <= MAXARG_Bx); - return luaK_code(fs, CREATE_ABx(o, a, bc)); -} - - -/* -** Format and emit an 'iAsBx' instruction. -*/ -static int codeAsBx (FuncState *fs, OpCode o, int a, int bc) { - unsigned int b = bc + OFFSET_sBx; - lua_assert(getOpMode(o) == iAsBx); - lua_assert(a <= MAXARG_A && b <= MAXARG_Bx); - return luaK_code(fs, CREATE_ABx(o, a, b)); -} - - -/* -** Format and emit an 'isJ' instruction. -*/ -static int codesJ (FuncState *fs, OpCode o, int sj, int k) { - unsigned int j = sj + OFFSET_sJ; - lua_assert(getOpMode(o) == isJ); - lua_assert(j <= MAXARG_sJ && (k & ~1) == 0); - return luaK_code(fs, CREATE_sJ(o, j, k)); -} - - -/* -** Emit an "extra argument" instruction (format 'iAx') -*/ -static int codeextraarg (FuncState *fs, int a) { - lua_assert(a <= MAXARG_Ax); - return luaK_code(fs, CREATE_Ax(OP_EXTRAARG, a)); -} - - -/* -** Emit a "load constant" instruction, using either 'OP_LOADK' -** (if constant index 'k' fits in 18 bits) or an 'OP_LOADKX' -** instruction with "extra argument". -*/ -static int luaK_codek (FuncState *fs, int reg, int k) { - if (k <= MAXARG_Bx) - return luaK_codeABx(fs, OP_LOADK, reg, k); - else { - int p = luaK_codeABx(fs, OP_LOADKX, reg, 0); - codeextraarg(fs, k); - return p; - } -} - - -/* -** Check register-stack level, keeping track of its maximum size -** in field 'maxstacksize' -*/ -void luaK_checkstack (FuncState *fs, int n) { - int newstack = fs->freereg + n; - if (newstack > fs->f->maxstacksize) { - if (newstack >= MAXREGS) - luaX_syntaxerror(fs->ls, - "function or expression needs too many registers"); - fs->f->maxstacksize = cast_byte(newstack); - } -} - - -/* -** Reserve 'n' registers in register stack -*/ -void luaK_reserveregs (FuncState *fs, int n) { - luaK_checkstack(fs, n); - fs->freereg += n; -} - - -/* -** Free register 'reg', if it is neither a constant index nor -** a local variable. -) -*/ -static void freereg (FuncState *fs, int reg) { - if (reg >= luaY_nvarstack(fs)) { - fs->freereg--; - lua_assert(reg == fs->freereg); - } -} - - -/* -** Free two registers in proper order -*/ -static void freeregs (FuncState *fs, int r1, int r2) { - if (r1 > r2) { - freereg(fs, r1); - freereg(fs, r2); - } - else { - freereg(fs, r2); - freereg(fs, r1); - } -} - - -/* -** Free register used by expression 'e' (if any) -*/ -static void freeexp (FuncState *fs, expdesc *e) { - if (e->k == VNONRELOC) - freereg(fs, e->u.info); -} - - -/* -** Free registers used by expressions 'e1' and 'e2' (if any) in proper -** order. -*/ -static void freeexps (FuncState *fs, expdesc *e1, expdesc *e2) { - int r1 = (e1->k == VNONRELOC) ? e1->u.info : -1; - int r2 = (e2->k == VNONRELOC) ? e2->u.info : -1; - freeregs(fs, r1, r2); -} - - -/* -** Add constant 'v' to prototype's list of constants (field 'k'). -** Use scanner's table to cache position of constants in constant list -** and try to reuse constants. Because some values should not be used -** as keys (nil cannot be a key, integer keys can collapse with float -** keys), the caller must provide a useful 'key' for indexing the cache. -** Note that all functions share the same table, so entering or exiting -** a function can make some indices wrong. -*/ -static int addk (FuncState *fs, TValue *key, TValue *v) { - TValue val; - lua_State *L = fs->ls->L; - Proto *f = fs->f; - int tag = luaH_get(fs->ls->h, key, &val); /* query scanner table */ - int k, oldsize; - if (tag == LUA_VNUMINT) { /* is there an index there? */ - k = cast_int(ivalue(&val)); - /* correct value? (warning: must distinguish floats from integers!) */ - if (k < fs->nk && ttypetag(&f->k[k]) == ttypetag(v) && - luaV_rawequalobj(&f->k[k], v)) - return k; /* reuse index */ - } - /* constant not found; create a new entry */ - oldsize = f->sizek; - k = fs->nk; - /* numerical value does not need GC barrier; - table has no metatable, so it does not need to invalidate cache */ - setivalue(&val, k); - luaH_set(L, fs->ls->h, key, &val); - luaM_growvector(L, f->k, k, f->sizek, TValue, MAXARG_Ax, "constants"); - while (oldsize < f->sizek) setnilvalue(&f->k[oldsize++]); - setobj(L, &f->k[k], v); - fs->nk++; - luaC_barrier(L, f, v); - return k; -} - - -/* -** Add a string to list of constants and return its index. -*/ -static int stringK (FuncState *fs, TString *s) { - TValue o; - setsvalue(fs->ls->L, &o, s); - return addk(fs, &o, &o); /* use string itself as key */ -} - - -/* -** Add an integer to list of constants and return its index. -*/ -static int luaK_intK (FuncState *fs, lua_Integer n) { - TValue o; - setivalue(&o, n); - return addk(fs, &o, &o); /* use integer itself as key */ -} - -/* -** Add a float to list of constants and return its index. Floats -** with integral values need a different key, to avoid collision -** with actual integers. To that, we add to the number its smaller -** power-of-two fraction that is still significant in its scale. -** For doubles, that would be 1/2^52. -** (This method is not bulletproof: there may be another float -** with that value, and for floats larger than 2^53 the result is -** still an integer. At worst, this only wastes an entry with -** a duplicate.) -*/ -static int luaK_numberK (FuncState *fs, lua_Number r) { - TValue o; - lua_Integer ik; - setfltvalue(&o, r); - if (!luaV_flttointeger(r, &ik, F2Ieq)) /* not an integral value? */ - return addk(fs, &o, &o); /* use number itself as key */ - else { /* must build an alternative key */ - const int nbm = l_floatatt(MANT_DIG); - const lua_Number q = l_mathop(ldexp)(l_mathop(1.0), -nbm + 1); - const lua_Number k = (ik == 0) ? q : r + r*q; /* new key */ - TValue kv; - setfltvalue(&kv, k); - /* result is not an integral value, unless value is too large */ - lua_assert(!luaV_flttointeger(k, &ik, F2Ieq) || - l_mathop(fabs)(r) >= l_mathop(1e6)); - return addk(fs, &kv, &o); - } -} - - -/* -** Add a false to list of constants and return its index. -*/ -static int boolF (FuncState *fs) { - TValue o; - setbfvalue(&o); - return addk(fs, &o, &o); /* use boolean itself as key */ -} - - -/* -** Add a true to list of constants and return its index. -*/ -static int boolT (FuncState *fs) { - TValue o; - setbtvalue(&o); - return addk(fs, &o, &o); /* use boolean itself as key */ -} - - -/* -** Add nil to list of constants and return its index. -*/ -static int nilK (FuncState *fs) { - TValue k, v; - setnilvalue(&v); - /* cannot use nil as key; instead use table itself to represent nil */ - sethvalue(fs->ls->L, &k, fs->ls->h); - return addk(fs, &k, &v); -} - - -/* -** Check whether 'i' can be stored in an 'sC' operand. Equivalent to -** (0 <= int2sC(i) && int2sC(i) <= MAXARG_C) but without risk of -** overflows in the hidden addition inside 'int2sC'. -*/ -static int fitsC (lua_Integer i) { - return (l_castS2U(i) + OFFSET_sC <= cast_uint(MAXARG_C)); -} - - -/* -** Check whether 'i' can be stored in an 'sBx' operand. -*/ -static int fitsBx (lua_Integer i) { - return (-OFFSET_sBx <= i && i <= MAXARG_Bx - OFFSET_sBx); -} - - -void luaK_int (FuncState *fs, int reg, lua_Integer i) { - if (fitsBx(i)) - codeAsBx(fs, OP_LOADI, reg, cast_int(i)); - else - luaK_codek(fs, reg, luaK_intK(fs, i)); -} - - -static void luaK_float (FuncState *fs, int reg, lua_Number f) { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ieq) && fitsBx(fi)) - codeAsBx(fs, OP_LOADF, reg, cast_int(fi)); - else - luaK_codek(fs, reg, luaK_numberK(fs, f)); -} - - -/* -** Convert a constant in 'v' into an expression description 'e' -*/ -static void const2exp (TValue *v, expdesc *e) { - switch (ttypetag(v)) { - case LUA_VNUMINT: - e->k = VKINT; e->u.ival = ivalue(v); - break; - case LUA_VNUMFLT: - e->k = VKFLT; e->u.nval = fltvalue(v); - break; - case LUA_VFALSE: - e->k = VFALSE; - break; - case LUA_VTRUE: - e->k = VTRUE; - break; - case LUA_VNIL: - e->k = VNIL; - break; - case LUA_VSHRSTR: case LUA_VLNGSTR: - e->k = VKSTR; e->u.strval = tsvalue(v); - break; - default: lua_assert(0); - } -} - - -/* -** Fix an expression to return the number of results 'nresults'. -** 'e' must be a multi-ret expression (function call or vararg). -*/ -void luaK_setreturns (FuncState *fs, expdesc *e, int nresults) { - Instruction *pc = &getinstruction(fs, e); - if (e->k == VCALL) /* expression is an open function call? */ - SETARG_C(*pc, nresults + 1); - else { - lua_assert(e->k == VVARARG); - SETARG_C(*pc, nresults + 1); - SETARG_A(*pc, fs->freereg); - luaK_reserveregs(fs, 1); - } -} - - -/* -** Convert a VKSTR to a VK -*/ -static void str2K (FuncState *fs, expdesc *e) { - lua_assert(e->k == VKSTR); - e->u.info = stringK(fs, e->u.strval); - e->k = VK; -} - - -/* -** Fix an expression to return one result. -** If expression is not a multi-ret expression (function call or -** vararg), it already returns one result, so nothing needs to be done. -** Function calls become VNONRELOC expressions (as its result comes -** fixed in the base register of the call), while vararg expressions -** become VRELOC (as OP_VARARG puts its results where it wants). -** (Calls are created returning one result, so that does not need -** to be fixed.) -*/ -void luaK_setoneret (FuncState *fs, expdesc *e) { - if (e->k == VCALL) { /* expression is an open function call? */ - /* already returns 1 value */ - lua_assert(GETARG_C(getinstruction(fs, e)) == 2); - e->k = VNONRELOC; /* result has fixed position */ - e->u.info = GETARG_A(getinstruction(fs, e)); - } - else if (e->k == VVARARG) { - SETARG_C(getinstruction(fs, e), 2); - e->k = VRELOC; /* can relocate its simple result */ - } -} - - -/* -** Ensure that expression 'e' is not a variable (nor a ). -** (Expression still may have jump lists.) -*/ -void luaK_dischargevars (FuncState *fs, expdesc *e) { - switch (e->k) { - case VCONST: { - const2exp(const2val(fs, e), e); - break; - } - case VLOCAL: { /* already in a register */ - e->u.info = e->u.var.ridx; - e->k = VNONRELOC; /* becomes a non-relocatable value */ - break; - } - case VUPVAL: { /* move value to some (pending) register */ - e->u.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.info, 0); - e->k = VRELOC; - break; - } - case VINDEXUP: { - e->u.info = luaK_codeABC(fs, OP_GETTABUP, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXI: { - freereg(fs, e->u.ind.t); - e->u.info = luaK_codeABC(fs, OP_GETI, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXSTR: { - freereg(fs, e->u.ind.t); - e->u.info = luaK_codeABC(fs, OP_GETFIELD, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXED: { - freeregs(fs, e->u.ind.t, e->u.ind.idx); - e->u.info = luaK_codeABC(fs, OP_GETTABLE, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VVARARG: case VCALL: { - luaK_setoneret(fs, e); - break; - } - default: break; /* there is one value available (somewhere) */ - } -} - - -/* -** Ensure expression value is in register 'reg', making 'e' a -** non-relocatable expression. -** (Expression still may have jump lists.) -*/ -static void discharge2reg (FuncState *fs, expdesc *e, int reg) { - luaK_dischargevars(fs, e); - switch (e->k) { - case VNIL: { - luaK_nil(fs, reg, 1); - break; - } - case VFALSE: { - luaK_codeABC(fs, OP_LOADFALSE, reg, 0, 0); - break; - } - case VTRUE: { - luaK_codeABC(fs, OP_LOADTRUE, reg, 0, 0); - break; - } - case VKSTR: { - str2K(fs, e); - } /* FALLTHROUGH */ - case VK: { - luaK_codek(fs, reg, e->u.info); - break; - } - case VKFLT: { - luaK_float(fs, reg, e->u.nval); - break; - } - case VKINT: { - luaK_int(fs, reg, e->u.ival); - break; - } - case VRELOC: { - Instruction *pc = &getinstruction(fs, e); - SETARG_A(*pc, reg); /* instruction will put result in 'reg' */ - break; - } - case VNONRELOC: { - if (reg != e->u.info) - luaK_codeABC(fs, OP_MOVE, reg, e->u.info, 0); - break; - } - default: { - lua_assert(e->k == VJMP); - return; /* nothing to do... */ - } - } - e->u.info = reg; - e->k = VNONRELOC; -} - - -/* -** Ensure expression value is in a register, making 'e' a -** non-relocatable expression. -** (Expression still may have jump lists.) -*/ -static void discharge2anyreg (FuncState *fs, expdesc *e) { - if (e->k != VNONRELOC) { /* no fixed register yet? */ - luaK_reserveregs(fs, 1); /* get a register */ - discharge2reg(fs, e, fs->freereg-1); /* put value there */ - } -} - - -static int code_loadbool (FuncState *fs, int A, OpCode op) { - luaK_getlabel(fs); /* those instructions may be jump targets */ - return luaK_codeABC(fs, op, A, 0, 0); -} - - -/* -** check whether list has any jump that do not produce a value -** or produce an inverted value -*/ -static int need_value (FuncState *fs, int list) { - for (; list != NO_JUMP; list = getjump(fs, list)) { - Instruction i = *getjumpcontrol(fs, list); - if (GET_OPCODE(i) != OP_TESTSET) return 1; - } - return 0; /* not found */ -} - - -/* -** Ensures final expression result (which includes results from its -** jump lists) is in register 'reg'. -** If expression has jumps, need to patch these jumps either to -** its final position or to "load" instructions (for those tests -** that do not produce values). -*/ -static void exp2reg (FuncState *fs, expdesc *e, int reg) { - discharge2reg(fs, e, reg); - if (e->k == VJMP) /* expression itself is a test? */ - luaK_concat(fs, &e->t, e->u.info); /* put this jump in 't' list */ - if (hasjumps(e)) { - int final; /* position after whole expression */ - int p_f = NO_JUMP; /* position of an eventual LOAD false */ - int p_t = NO_JUMP; /* position of an eventual LOAD true */ - if (need_value(fs, e->t) || need_value(fs, e->f)) { - int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs); - p_f = code_loadbool(fs, reg, OP_LFALSESKIP); /* skip next inst. */ - p_t = code_loadbool(fs, reg, OP_LOADTRUE); - /* jump around these booleans if 'e' is not a test */ - luaK_patchtohere(fs, fj); - } - final = luaK_getlabel(fs); - patchlistaux(fs, e->f, final, reg, p_f); - patchlistaux(fs, e->t, final, reg, p_t); - } - e->f = e->t = NO_JUMP; - e->u.info = reg; - e->k = VNONRELOC; -} - - -/* -** Ensures final expression result is in next available register. -*/ -void luaK_exp2nextreg (FuncState *fs, expdesc *e) { - luaK_dischargevars(fs, e); - freeexp(fs, e); - luaK_reserveregs(fs, 1); - exp2reg(fs, e, fs->freereg - 1); -} - - -/* -** Ensures final expression result is in some (any) register -** and return that register. -*/ -int luaK_exp2anyreg (FuncState *fs, expdesc *e) { - luaK_dischargevars(fs, e); - if (e->k == VNONRELOC) { /* expression already has a register? */ - if (!hasjumps(e)) /* no jumps? */ - return e->u.info; /* result is already in a register */ - if (e->u.info >= luaY_nvarstack(fs)) { /* reg. is not a local? */ - exp2reg(fs, e, e->u.info); /* put final result in it */ - return e->u.info; - } - /* else expression has jumps and cannot change its register - to hold the jump values, because it is a local variable. - Go through to the default case. */ - } - luaK_exp2nextreg(fs, e); /* default: use next available register */ - return e->u.info; -} - - -/* -** Ensures final expression result is either in a register -** or in an upvalue. -*/ -void luaK_exp2anyregup (FuncState *fs, expdesc *e) { - if (e->k != VUPVAL || hasjumps(e)) - luaK_exp2anyreg(fs, e); -} - - -/* -** Ensures final expression result is either in a register -** or it is a constant. -*/ -void luaK_exp2val (FuncState *fs, expdesc *e) { - if (hasjumps(e)) - luaK_exp2anyreg(fs, e); - else - luaK_dischargevars(fs, e); -} - - -/* -** Try to make 'e' a K expression with an index in the range of R/K -** indices. Return true iff succeeded. -*/ -static int luaK_exp2K (FuncState *fs, expdesc *e) { - if (!hasjumps(e)) { - int info; - switch (e->k) { /* move constants to 'k' */ - case VTRUE: info = boolT(fs); break; - case VFALSE: info = boolF(fs); break; - case VNIL: info = nilK(fs); break; - case VKINT: info = luaK_intK(fs, e->u.ival); break; - case VKFLT: info = luaK_numberK(fs, e->u.nval); break; - case VKSTR: info = stringK(fs, e->u.strval); break; - case VK: info = e->u.info; break; - default: return 0; /* not a constant */ - } - if (info <= MAXINDEXRK) { /* does constant fit in 'argC'? */ - e->k = VK; /* make expression a 'K' expression */ - e->u.info = info; - return 1; - } - } - /* else, expression doesn't fit; leave it unchanged */ - return 0; -} - - -/* -** Ensures final expression result is in a valid R/K index -** (that is, it is either in a register or in 'k' with an index -** in the range of R/K indices). -** Returns 1 iff expression is K. -*/ -static int exp2RK (FuncState *fs, expdesc *e) { - if (luaK_exp2K(fs, e)) - return 1; - else { /* not a constant in the right range: put it in a register */ - luaK_exp2anyreg(fs, e); - return 0; - } -} - - -static void codeABRK (FuncState *fs, OpCode o, int a, int b, - expdesc *ec) { - int k = exp2RK(fs, ec); - luaK_codeABCk(fs, o, a, b, ec->u.info, k); -} - - -/* -** Generate code to store result of expression 'ex' into variable 'var'. -*/ -void luaK_storevar (FuncState *fs, expdesc *var, expdesc *ex) { - switch (var->k) { - case VLOCAL: { - freeexp(fs, ex); - exp2reg(fs, ex, var->u.var.ridx); /* compute 'ex' into proper place */ - return; - } - case VUPVAL: { - int e = luaK_exp2anyreg(fs, ex); - luaK_codeABC(fs, OP_SETUPVAL, e, var->u.info, 0); - break; - } - case VINDEXUP: { - codeABRK(fs, OP_SETTABUP, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXI: { - codeABRK(fs, OP_SETI, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXSTR: { - codeABRK(fs, OP_SETFIELD, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXED: { - codeABRK(fs, OP_SETTABLE, var->u.ind.t, var->u.ind.idx, ex); - break; - } - default: lua_assert(0); /* invalid var kind to store */ - } - freeexp(fs, ex); -} - - -/* -** Emit SELF instruction (convert expression 'e' into 'e:key(e,'). -*/ -void luaK_self (FuncState *fs, expdesc *e, expdesc *key) { - int ereg; - luaK_exp2anyreg(fs, e); - ereg = e->u.info; /* register where 'e' was placed */ - freeexp(fs, e); - e->u.info = fs->freereg; /* base register for op_self */ - e->k = VNONRELOC; /* self expression has a fixed register */ - luaK_reserveregs(fs, 2); /* function and 'self' produced by op_self */ - codeABRK(fs, OP_SELF, e->u.info, ereg, key); - freeexp(fs, key); -} - - -/* -** Negate condition 'e' (where 'e' is a comparison). -*/ -static void negatecondition (FuncState *fs, expdesc *e) { - Instruction *pc = getjumpcontrol(fs, e->u.info); - lua_assert(testTMode(GET_OPCODE(*pc)) && GET_OPCODE(*pc) != OP_TESTSET && - GET_OPCODE(*pc) != OP_TEST); - SETARG_k(*pc, (GETARG_k(*pc) ^ 1)); -} - - -/* -** Emit instruction to jump if 'e' is 'cond' (that is, if 'cond' -** is true, code will jump if 'e' is true.) Return jump position. -** Optimize when 'e' is 'not' something, inverting the condition -** and removing the 'not'. -*/ -static int jumponcond (FuncState *fs, expdesc *e, int cond) { - if (e->k == VRELOC) { - Instruction ie = getinstruction(fs, e); - if (GET_OPCODE(ie) == OP_NOT) { - removelastinstruction(fs); /* remove previous OP_NOT */ - return condjump(fs, OP_TEST, GETARG_B(ie), 0, 0, !cond); - } - /* else go through */ - } - discharge2anyreg(fs, e); - freeexp(fs, e); - return condjump(fs, OP_TESTSET, NO_REG, e->u.info, 0, cond); -} - - -/* -** Emit code to go through if 'e' is true, jump otherwise. -*/ -void luaK_goiftrue (FuncState *fs, expdesc *e) { - int pc; /* pc of new jump */ - luaK_dischargevars(fs, e); - switch (e->k) { - case VJMP: { /* condition? */ - negatecondition(fs, e); /* jump when it is false */ - pc = e->u.info; /* save jump position */ - break; - } - case VK: case VKFLT: case VKINT: case VKSTR: case VTRUE: { - pc = NO_JUMP; /* always true; do nothing */ - break; - } - default: { - pc = jumponcond(fs, e, 0); /* jump when false */ - break; - } - } - luaK_concat(fs, &e->f, pc); /* insert new jump in false list */ - luaK_patchtohere(fs, e->t); /* true list jumps to here (to go through) */ - e->t = NO_JUMP; -} - - -/* -** Emit code to go through if 'e' is false, jump otherwise. -*/ -void luaK_goiffalse (FuncState *fs, expdesc *e) { - int pc; /* pc of new jump */ - luaK_dischargevars(fs, e); - switch (e->k) { - case VJMP: { - pc = e->u.info; /* already jump if true */ - break; - } - case VNIL: case VFALSE: { - pc = NO_JUMP; /* always false; do nothing */ - break; - } - default: { - pc = jumponcond(fs, e, 1); /* jump if true */ - break; - } - } - luaK_concat(fs, &e->t, pc); /* insert new jump in 't' list */ - luaK_patchtohere(fs, e->f); /* false list jumps to here (to go through) */ - e->f = NO_JUMP; -} - - -/* -** Code 'not e', doing constant folding. -*/ -static void codenot (FuncState *fs, expdesc *e) { - switch (e->k) { - case VNIL: case VFALSE: { - e->k = VTRUE; /* true == not nil == not false */ - break; - } - case VK: case VKFLT: case VKINT: case VKSTR: case VTRUE: { - e->k = VFALSE; /* false == not "x" == not 0.5 == not 1 == not true */ - break; - } - case VJMP: { - negatecondition(fs, e); - break; - } - case VRELOC: - case VNONRELOC: { - discharge2anyreg(fs, e); - freeexp(fs, e); - e->u.info = luaK_codeABC(fs, OP_NOT, 0, e->u.info, 0); - e->k = VRELOC; - break; - } - default: lua_assert(0); /* cannot happen */ - } - /* interchange true and false lists */ - { int temp = e->f; e->f = e->t; e->t = temp; } - removevalues(fs, e->f); /* values are useless when negated */ - removevalues(fs, e->t); -} - - -/* -** Check whether expression 'e' is a short literal string -*/ -static int isKstr (FuncState *fs, expdesc *e) { - return (e->k == VK && !hasjumps(e) && e->u.info <= MAXARG_B && - ttisshrstring(&fs->f->k[e->u.info])); -} - -/* -** Check whether expression 'e' is a literal integer. -*/ -static int isKint (expdesc *e) { - return (e->k == VKINT && !hasjumps(e)); -} - - -/* -** Check whether expression 'e' is a literal integer in -** proper range to fit in register C -*/ -static int isCint (expdesc *e) { - return isKint(e) && (l_castS2U(e->u.ival) <= l_castS2U(MAXARG_C)); -} - - -/* -** Check whether expression 'e' is a literal integer in -** proper range to fit in register sC -*/ -static int isSCint (expdesc *e) { - return isKint(e) && fitsC(e->u.ival); -} - - -/* -** Check whether expression 'e' is a literal integer or float in -** proper range to fit in a register (sB or sC). -*/ -static int isSCnumber (expdesc *e, int *pi, int *isfloat) { - lua_Integer i; - if (e->k == VKINT) - i = e->u.ival; - else if (e->k == VKFLT && luaV_flttointeger(e->u.nval, &i, F2Ieq)) - *isfloat = 1; - else - return 0; /* not a number */ - if (!hasjumps(e) && fitsC(i)) { - *pi = int2sC(cast_int(i)); - return 1; - } - else - return 0; -} - - -/* -** Create expression 't[k]'. 't' must have its final result already in a -** register or upvalue. Upvalues can only be indexed by literal strings. -** Keys can be literal strings in the constant table or arbitrary -** values in registers. -*/ -void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) { - if (k->k == VKSTR) - str2K(fs, k); - lua_assert(!hasjumps(t) && - (t->k == VLOCAL || t->k == VNONRELOC || t->k == VUPVAL)); - if (t->k == VUPVAL && !isKstr(fs, k)) /* upvalue indexed by non 'Kstr'? */ - luaK_exp2anyreg(fs, t); /* put it in a register */ - if (t->k == VUPVAL) { - lua_assert(isKstr(fs, k)); - t->u.ind.t = t->u.info; /* upvalue index */ - t->u.ind.idx = k->u.info; /* literal short string */ - t->k = VINDEXUP; - } - else { - /* register index of the table */ - t->u.ind.t = (t->k == VLOCAL) ? t->u.var.ridx: t->u.info; - if (isKstr(fs, k)) { - t->u.ind.idx = k->u.info; /* literal short string */ - t->k = VINDEXSTR; - } - else if (isCint(k)) { - t->u.ind.idx = cast_int(k->u.ival); /* int. constant in proper range */ - t->k = VINDEXI; - } - else { - t->u.ind.idx = luaK_exp2anyreg(fs, k); /* register */ - t->k = VINDEXED; - } - } -} - - -/* -** Return false if folding can raise an error. -** Bitwise operations need operands convertible to integers; division -** operations cannot have 0 as divisor. -*/ -static int validop (int op, TValue *v1, TValue *v2) { - switch (op) { - case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: - case LUA_OPSHL: case LUA_OPSHR: case LUA_OPBNOT: { /* conversion errors */ - lua_Integer i; - return (luaV_tointegerns(v1, &i, LUA_FLOORN2I) && - luaV_tointegerns(v2, &i, LUA_FLOORN2I)); - } - case LUA_OPDIV: case LUA_OPIDIV: case LUA_OPMOD: /* division by 0 */ - return (nvalue(v2) != 0); - default: return 1; /* everything else is valid */ - } -} - - -/* -** Try to "constant-fold" an operation; return 1 iff successful. -** (In this case, 'e1' has the final result.) -*/ -static int constfolding (FuncState *fs, int op, expdesc *e1, - const expdesc *e2) { - TValue v1, v2, res; - if (!tonumeral(e1, &v1) || !tonumeral(e2, &v2) || !validop(op, &v1, &v2)) - return 0; /* non-numeric operands or not safe to fold */ - luaO_rawarith(fs->ls->L, op, &v1, &v2, &res); /* does operation */ - if (ttisinteger(&res)) { - e1->k = VKINT; - e1->u.ival = ivalue(&res); - } - else { /* folds neither NaN nor 0.0 (to avoid problems with -0.0) */ - lua_Number n = fltvalue(&res); - if (luai_numisnan(n) || n == 0) - return 0; - e1->k = VKFLT; - e1->u.nval = n; - } - return 1; -} - - -/* -** Convert a BinOpr to an OpCode (ORDER OPR - ORDER OP) -*/ -l_sinline OpCode binopr2op (BinOpr opr, BinOpr baser, OpCode base) { - lua_assert(baser <= opr && - ((baser == OPR_ADD && opr <= OPR_SHR) || - (baser == OPR_LT && opr <= OPR_LE))); - return cast(OpCode, (cast_int(opr) - cast_int(baser)) + cast_int(base)); -} - - -/* -** Convert a UnOpr to an OpCode (ORDER OPR - ORDER OP) -*/ -l_sinline OpCode unopr2op (UnOpr opr) { - return cast(OpCode, (cast_int(opr) - cast_int(OPR_MINUS)) + - cast_int(OP_UNM)); -} - - -/* -** Convert a BinOpr to a tag method (ORDER OPR - ORDER TM) -*/ -l_sinline TMS binopr2TM (BinOpr opr) { - lua_assert(OPR_ADD <= opr && opr <= OPR_SHR); - return cast(TMS, (cast_int(opr) - cast_int(OPR_ADD)) + cast_int(TM_ADD)); -} - - -/* -** Emit code for unary expressions that "produce values" -** (everything but 'not'). -** Expression to produce final result will be encoded in 'e'. -*/ -static void codeunexpval (FuncState *fs, OpCode op, expdesc *e, int line) { - int r = luaK_exp2anyreg(fs, e); /* opcodes operate only on registers */ - freeexp(fs, e); - e->u.info = luaK_codeABC(fs, op, 0, r, 0); /* generate opcode */ - e->k = VRELOC; /* all those operations are relocatable */ - luaK_fixline(fs, line); -} - - -/* -** Emit code for binary expressions that "produce values" -** (everything but logical operators 'and'/'or' and comparison -** operators). -** Expression to produce final result will be encoded in 'e1'. -*/ -static void finishbinexpval (FuncState *fs, expdesc *e1, expdesc *e2, - OpCode op, int v2, int flip, int line, - OpCode mmop, TMS event) { - int v1 = luaK_exp2anyreg(fs, e1); - int pc = luaK_codeABCk(fs, op, 0, v1, v2, 0); - freeexps(fs, e1, e2); - e1->u.info = pc; - e1->k = VRELOC; /* all those operations are relocatable */ - luaK_fixline(fs, line); - luaK_codeABCk(fs, mmop, v1, v2, event, flip); /* to call metamethod */ - luaK_fixline(fs, line); -} - - -/* -** Emit code for binary expressions that "produce values" over -** two registers. -*/ -static void codebinexpval (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - OpCode op = binopr2op(opr, OPR_ADD, OP_ADD); - int v2 = luaK_exp2anyreg(fs, e2); /* make sure 'e2' is in a register */ - /* 'e1' must be already in a register or it is a constant */ - lua_assert((VNIL <= e1->k && e1->k <= VKSTR) || - e1->k == VNONRELOC || e1->k == VRELOC); - lua_assert(OP_ADD <= op && op <= OP_SHR); - finishbinexpval(fs, e1, e2, op, v2, 0, line, OP_MMBIN, binopr2TM(opr)); -} - - -/* -** Code binary operators with immediate operands. -*/ -static void codebini (FuncState *fs, OpCode op, - expdesc *e1, expdesc *e2, int flip, int line, - TMS event) { - int v2 = int2sC(cast_int(e2->u.ival)); /* immediate operand */ - lua_assert(e2->k == VKINT); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINI, event); -} - - -/* -** Code binary operators with K operand. -*/ -static void codebinK (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - TMS event = binopr2TM(opr); - int v2 = e2->u.info; /* K index */ - OpCode op = binopr2op(opr, OPR_ADD, OP_ADDK); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINK, event); -} - - -/* Try to code a binary operator negating its second operand. -** For the metamethod, 2nd operand must keep its original value. -*/ -static int finishbinexpneg (FuncState *fs, expdesc *e1, expdesc *e2, - OpCode op, int line, TMS event) { - if (!isKint(e2)) - return 0; /* not an integer constant */ - else { - lua_Integer i2 = e2->u.ival; - if (!(fitsC(i2) && fitsC(-i2))) - return 0; /* not in the proper range */ - else { /* operating a small integer constant */ - int v2 = cast_int(i2); - finishbinexpval(fs, e1, e2, op, int2sC(-v2), 0, line, OP_MMBINI, event); - /* correct metamethod argument */ - SETARG_B(fs->f->code[fs->pc - 1], int2sC(v2)); - return 1; /* successfully coded */ - } - } -} - - -static void swapexps (expdesc *e1, expdesc *e2) { - expdesc temp = *e1; *e1 = *e2; *e2 = temp; /* swap 'e1' and 'e2' */ -} - - -/* -** Code binary operators with no constant operand. -*/ -static void codebinNoK (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - if (flip) - swapexps(e1, e2); /* back to original order */ - codebinexpval(fs, opr, e1, e2, line); /* use standard operators */ -} - - -/* -** Code arithmetic operators ('+', '-', ...). If second operand is a -** constant in the proper range, use variant opcodes with K operands. -*/ -static void codearith (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - if (tonumeral(e2, NULL) && luaK_exp2K(fs, e2)) /* K operand? */ - codebinK(fs, opr, e1, e2, flip, line); - else /* 'e2' is neither an immediate nor a K operand */ - codebinNoK(fs, opr, e1, e2, flip, line); -} - - -/* -** Code commutative operators ('+', '*'). If first operand is a -** numeric constant, change order of operands to try to use an -** immediate or K operator. -*/ -static void codecommutative (FuncState *fs, BinOpr op, - expdesc *e1, expdesc *e2, int line) { - int flip = 0; - if (tonumeral(e1, NULL)) { /* is first operand a numeric constant? */ - swapexps(e1, e2); /* change order */ - flip = 1; - } - if (op == OPR_ADD && isSCint(e2)) /* immediate operand? */ - codebini(fs, OP_ADDI, e1, e2, flip, line, TM_ADD); - else - codearith(fs, op, e1, e2, flip, line); -} - - -/* -** Code bitwise operations; they are all commutative, so the function -** tries to put an integer constant as the 2nd operand (a K operand). -*/ -static void codebitwise (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - int flip = 0; - if (e1->k == VKINT) { - swapexps(e1, e2); /* 'e2' will be the constant operand */ - flip = 1; - } - if (e2->k == VKINT && luaK_exp2K(fs, e2)) /* K operand? */ - codebinK(fs, opr, e1, e2, flip, line); - else /* no constants */ - codebinNoK(fs, opr, e1, e2, flip, line); -} - - -/* -** Emit code for order comparisons. When using an immediate operand, -** 'isfloat' tells whether the original value was a float. -*/ -static void codeorder (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { - int r1, r2; - int im; - int isfloat = 0; - OpCode op; - if (isSCnumber(e2, &im, &isfloat)) { - /* use immediate operand */ - r1 = luaK_exp2anyreg(fs, e1); - r2 = im; - op = binopr2op(opr, OPR_LT, OP_LTI); - } - else if (isSCnumber(e1, &im, &isfloat)) { - /* transform (A < B) to (B > A) and (A <= B) to (B >= A) */ - r1 = luaK_exp2anyreg(fs, e2); - r2 = im; - op = binopr2op(opr, OPR_LT, OP_GTI); - } - else { /* regular case, compare two registers */ - r1 = luaK_exp2anyreg(fs, e1); - r2 = luaK_exp2anyreg(fs, e2); - op = binopr2op(opr, OPR_LT, OP_LT); - } - freeexps(fs, e1, e2); - e1->u.info = condjump(fs, op, r1, r2, isfloat, 1); - e1->k = VJMP; -} - - -/* -** Emit code for equality comparisons ('==', '~='). -** 'e1' was already put as RK by 'luaK_infix'. -*/ -static void codeeq (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { - int r1, r2; - int im; - int isfloat = 0; /* not needed here, but kept for symmetry */ - OpCode op; - if (e1->k != VNONRELOC) { - lua_assert(e1->k == VK || e1->k == VKINT || e1->k == VKFLT); - swapexps(e1, e2); - } - r1 = luaK_exp2anyreg(fs, e1); /* 1st expression must be in register */ - if (isSCnumber(e2, &im, &isfloat)) { - op = OP_EQI; - r2 = im; /* immediate operand */ - } - else if (exp2RK(fs, e2)) { /* 2nd expression is constant? */ - op = OP_EQK; - r2 = e2->u.info; /* constant index */ - } - else { - op = OP_EQ; /* will compare two registers */ - r2 = luaK_exp2anyreg(fs, e2); - } - freeexps(fs, e1, e2); - e1->u.info = condjump(fs, op, r1, r2, isfloat, (opr == OPR_EQ)); - e1->k = VJMP; -} - - -/* -** Apply prefix operation 'op' to expression 'e'. -*/ -void luaK_prefix (FuncState *fs, UnOpr opr, expdesc *e, int line) { - static const expdesc ef = {VKINT, {0}, NO_JUMP, NO_JUMP}; - luaK_dischargevars(fs, e); - switch (opr) { - case OPR_MINUS: case OPR_BNOT: /* use 'ef' as fake 2nd operand */ - if (constfolding(fs, opr + LUA_OPUNM, e, &ef)) - break; - /* else */ /* FALLTHROUGH */ - case OPR_LEN: - codeunexpval(fs, unopr2op(opr), e, line); - break; - case OPR_NOT: codenot(fs, e); break; - default: lua_assert(0); - } -} - - -/* -** Process 1st operand 'v' of binary operation 'op' before reading -** 2nd operand. -*/ -void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) { - luaK_dischargevars(fs, v); - switch (op) { - case OPR_AND: { - luaK_goiftrue(fs, v); /* go ahead only if 'v' is true */ - break; - } - case OPR_OR: { - luaK_goiffalse(fs, v); /* go ahead only if 'v' is false */ - break; - } - case OPR_CONCAT: { - luaK_exp2nextreg(fs, v); /* operand must be on the stack */ - break; - } - case OPR_ADD: case OPR_SUB: - case OPR_MUL: case OPR_DIV: case OPR_IDIV: - case OPR_MOD: case OPR_POW: - case OPR_BAND: case OPR_BOR: case OPR_BXOR: - case OPR_SHL: case OPR_SHR: { - if (!tonumeral(v, NULL)) - luaK_exp2anyreg(fs, v); - /* else keep numeral, which may be folded or used as an immediate - operand */ - break; - } - case OPR_EQ: case OPR_NE: { - if (!tonumeral(v, NULL)) - exp2RK(fs, v); - /* else keep numeral, which may be an immediate operand */ - break; - } - case OPR_LT: case OPR_LE: - case OPR_GT: case OPR_GE: { - int dummy, dummy2; - if (!isSCnumber(v, &dummy, &dummy2)) - luaK_exp2anyreg(fs, v); - /* else keep numeral, which may be an immediate operand */ - break; - } - default: lua_assert(0); - } -} - -/* -** Create code for '(e1 .. e2)'. -** For '(e1 .. e2.1 .. e2.2)' (which is '(e1 .. (e2.1 .. e2.2))', -** because concatenation is right associative), merge both CONCATs. -*/ -static void codeconcat (FuncState *fs, expdesc *e1, expdesc *e2, int line) { - Instruction *ie2 = previousinstruction(fs); - if (GET_OPCODE(*ie2) == OP_CONCAT) { /* is 'e2' a concatenation? */ - int n = GETARG_B(*ie2); /* # of elements concatenated in 'e2' */ - lua_assert(e1->u.info + 1 == GETARG_A(*ie2)); - freeexp(fs, e2); - SETARG_A(*ie2, e1->u.info); /* correct first element ('e1') */ - SETARG_B(*ie2, n + 1); /* will concatenate one more element */ - } - else { /* 'e2' is not a concatenation */ - luaK_codeABC(fs, OP_CONCAT, e1->u.info, 2, 0); /* new concat opcode */ - freeexp(fs, e2); - luaK_fixline(fs, line); - } -} - - -/* -** Finalize code for binary operation, after reading 2nd operand. -*/ -void luaK_posfix (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - luaK_dischargevars(fs, e2); - if (foldbinop(opr) && constfolding(fs, opr + LUA_OPADD, e1, e2)) - return; /* done by folding */ - switch (opr) { - case OPR_AND: { - lua_assert(e1->t == NO_JUMP); /* list closed by 'luaK_infix' */ - luaK_concat(fs, &e2->f, e1->f); - *e1 = *e2; - break; - } - case OPR_OR: { - lua_assert(e1->f == NO_JUMP); /* list closed by 'luaK_infix' */ - luaK_concat(fs, &e2->t, e1->t); - *e1 = *e2; - break; - } - case OPR_CONCAT: { /* e1 .. e2 */ - luaK_exp2nextreg(fs, e2); - codeconcat(fs, e1, e2, line); - break; - } - case OPR_ADD: case OPR_MUL: { - codecommutative(fs, opr, e1, e2, line); - break; - } - case OPR_SUB: { - if (finishbinexpneg(fs, e1, e2, OP_ADDI, line, TM_SUB)) - break; /* coded as (r1 + -I) */ - /* ELSE */ - } /* FALLTHROUGH */ - case OPR_DIV: case OPR_IDIV: case OPR_MOD: case OPR_POW: { - codearith(fs, opr, e1, e2, 0, line); - break; - } - case OPR_BAND: case OPR_BOR: case OPR_BXOR: { - codebitwise(fs, opr, e1, e2, line); - break; - } - case OPR_SHL: { - if (isSCint(e1)) { - swapexps(e1, e2); - codebini(fs, OP_SHLI, e1, e2, 1, line, TM_SHL); /* I << r2 */ - } - else if (finishbinexpneg(fs, e1, e2, OP_SHRI, line, TM_SHL)) { - /* coded as (r1 >> -I) */; - } - else /* regular case (two registers) */ - codebinexpval(fs, opr, e1, e2, line); - break; - } - case OPR_SHR: { - if (isSCint(e2)) - codebini(fs, OP_SHRI, e1, e2, 0, line, TM_SHR); /* r1 >> I */ - else /* regular case (two registers) */ - codebinexpval(fs, opr, e1, e2, line); - break; - } - case OPR_EQ: case OPR_NE: { - codeeq(fs, opr, e1, e2); - break; - } - case OPR_GT: case OPR_GE: { - /* '(a > b)' <=> '(b < a)'; '(a >= b)' <=> '(b <= a)' */ - swapexps(e1, e2); - opr = cast(BinOpr, (opr - OPR_GT) + OPR_LT); - } /* FALLTHROUGH */ - case OPR_LT: case OPR_LE: { - codeorder(fs, opr, e1, e2); - break; - } - default: lua_assert(0); - } -} - - -/* -** Change line information associated with current position, by removing -** previous info and adding it again with new line. -*/ -void luaK_fixline (FuncState *fs, int line) { - removelastlineinfo(fs); - savelineinfo(fs, fs->f, line); -} - - -void luaK_settablesize (FuncState *fs, int pc, int ra, int asize, int hsize) { - Instruction *inst = &fs->f->code[pc]; - int rb = (hsize != 0) ? luaO_ceillog2(hsize) + 1 : 0; /* hash size */ - int extra = asize / (MAXARG_C + 1); /* higher bits of array size */ - int rc = asize % (MAXARG_C + 1); /* lower bits of array size */ - int k = (extra > 0); /* true iff needs extra argument */ - *inst = CREATE_ABCk(OP_NEWTABLE, ra, rb, rc, k); - *(inst + 1) = CREATE_Ax(OP_EXTRAARG, extra); -} - - -/* -** Emit a SETLIST instruction. -** 'base' is register that keeps table; -** 'nelems' is #table plus those to be stored now; -** 'tostore' is number of values (in registers 'base + 1',...) to add to -** table (or LUA_MULTRET to add up to stack top). -*/ -void luaK_setlist (FuncState *fs, int base, int nelems, int tostore) { - lua_assert(tostore != 0 && tostore <= LFIELDS_PER_FLUSH); - if (tostore == LUA_MULTRET) - tostore = 0; - if (nelems <= MAXARG_C) - luaK_codeABC(fs, OP_SETLIST, base, tostore, nelems); - else { - int extra = nelems / (MAXARG_C + 1); - nelems %= (MAXARG_C + 1); - luaK_codeABCk(fs, OP_SETLIST, base, tostore, nelems, 1); - codeextraarg(fs, extra); - } - fs->freereg = base + 1; /* free registers with list values */ -} - - -/* -** return the final target of a jump (skipping jumps to jumps) -*/ -static int finaltarget (Instruction *code, int i) { - int count; - for (count = 0; count < 100; count++) { /* avoid infinite loops */ - Instruction pc = code[i]; - if (GET_OPCODE(pc) != OP_JMP) - break; - else - i += GETARG_sJ(pc) + 1; - } - return i; -} - - -/* -** Do a final pass over the code of a function, doing small peephole -** optimizations and adjustments. -*/ -void luaK_finish (FuncState *fs) { - int i; - Proto *p = fs->f; - for (i = 0; i < fs->pc; i++) { - Instruction *pc = &p->code[i]; - lua_assert(i == 0 || isOT(*(pc - 1)) == isIT(*pc)); - switch (GET_OPCODE(*pc)) { - case OP_RETURN0: case OP_RETURN1: { - if (!(fs->needclose || (p->flag & PF_ISVARARG))) - break; /* no extra work */ - /* else use OP_RETURN to do the extra work */ - SET_OPCODE(*pc, OP_RETURN); - } /* FALLTHROUGH */ - case OP_RETURN: case OP_TAILCALL: { - if (fs->needclose) - SETARG_k(*pc, 1); /* signal that it needs to close */ - if (p->flag & PF_ISVARARG) - SETARG_C(*pc, p->numparams + 1); /* signal that it is vararg */ - break; - } - case OP_JMP: { - int target = finaltarget(p->code, i); - fixjump(fs, i, target); - break; - } - default: break; - } - } -} diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lcode.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lcode.h deleted file mode 100644 index 5b8eb29..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lcode.h +++ /dev/null @@ -1,101 +0,0 @@ -/* -** $Id: lcode.h $ -** Code generator for Lua -** See Copyright Notice in lua.h -*/ - -#ifndef lcode_h -#define lcode_h - -#include "llex.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lparser.h" - - -/* -** Marks the end of a patch list. It is an invalid value both as an absolute -** address, and as a list link (would link an element to itself). -*/ -#define NO_JUMP (-1) - - -/* -** grep "ORDER OPR" if you change these enums (ORDER OP) -*/ -typedef enum BinOpr { - /* arithmetic operators */ - OPR_ADD, OPR_SUB, OPR_MUL, OPR_MOD, OPR_POW, - OPR_DIV, OPR_IDIV, - /* bitwise operators */ - OPR_BAND, OPR_BOR, OPR_BXOR, - OPR_SHL, OPR_SHR, - /* string operator */ - OPR_CONCAT, - /* comparison operators */ - OPR_EQ, OPR_LT, OPR_LE, - OPR_NE, OPR_GT, OPR_GE, - /* logical operators */ - OPR_AND, OPR_OR, - OPR_NOBINOPR -} BinOpr; - - -/* true if operation is foldable (that is, it is arithmetic or bitwise) */ -#define foldbinop(op) ((op) <= OPR_SHR) - - -#define luaK_codeABC(fs,o,a,b,c) luaK_codeABCk(fs,o,a,b,c,0) - - -typedef enum UnOpr { OPR_MINUS, OPR_BNOT, OPR_NOT, OPR_LEN, OPR_NOUNOPR } UnOpr; - - -/* get (pointer to) instruction of given 'expdesc' */ -#define getinstruction(fs,e) ((fs)->f->code[(e)->u.info]) - - -#define luaK_setmultret(fs,e) luaK_setreturns(fs, e, LUA_MULTRET) - -#define luaK_jumpto(fs,t) luaK_patchlist(fs, luaK_jump(fs), t) - -LUAI_FUNC int luaK_code (FuncState *fs, Instruction i); -LUAI_FUNC int luaK_codeABx (FuncState *fs, OpCode o, int A, unsigned Bx); -LUAI_FUNC int luaK_codeABCk (FuncState *fs, OpCode o, int A, - int B, int C, int k); -LUAI_FUNC int luaK_exp2const (FuncState *fs, const expdesc *e, TValue *v); -LUAI_FUNC void luaK_fixline (FuncState *fs, int line); -LUAI_FUNC void luaK_nil (FuncState *fs, int from, int n); -LUAI_FUNC void luaK_reserveregs (FuncState *fs, int n); -LUAI_FUNC void luaK_checkstack (FuncState *fs, int n); -LUAI_FUNC void luaK_int (FuncState *fs, int reg, lua_Integer n); -LUAI_FUNC void luaK_dischargevars (FuncState *fs, expdesc *e); -LUAI_FUNC int luaK_exp2anyreg (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2anyregup (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2nextreg (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2val (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_self (FuncState *fs, expdesc *e, expdesc *key); -LUAI_FUNC void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k); -LUAI_FUNC void luaK_goiftrue (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_goiffalse (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_storevar (FuncState *fs, expdesc *var, expdesc *e); -LUAI_FUNC void luaK_setreturns (FuncState *fs, expdesc *e, int nresults); -LUAI_FUNC void luaK_setoneret (FuncState *fs, expdesc *e); -LUAI_FUNC int luaK_jump (FuncState *fs); -LUAI_FUNC void luaK_ret (FuncState *fs, int first, int nret); -LUAI_FUNC void luaK_patchlist (FuncState *fs, int list, int target); -LUAI_FUNC void luaK_patchtohere (FuncState *fs, int list); -LUAI_FUNC void luaK_concat (FuncState *fs, int *l1, int l2); -LUAI_FUNC int luaK_getlabel (FuncState *fs); -LUAI_FUNC void luaK_prefix (FuncState *fs, UnOpr op, expdesc *v, int line); -LUAI_FUNC void luaK_infix (FuncState *fs, BinOpr op, expdesc *v); -LUAI_FUNC void luaK_posfix (FuncState *fs, BinOpr op, expdesc *v1, - expdesc *v2, int line); -LUAI_FUNC void luaK_settablesize (FuncState *fs, int pc, - int ra, int asize, int hsize); -LUAI_FUNC void luaK_setlist (FuncState *fs, int base, int nelems, int tostore); -LUAI_FUNC void luaK_finish (FuncState *fs); -LUAI_FUNC l_noret luaK_semerror (LexState *ls, const char *msg); - - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lcorolib.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lcorolib.c deleted file mode 100644 index c64adf0..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lcorolib.c +++ /dev/null @@ -1,210 +0,0 @@ -/* -** $Id: lcorolib.c $ -** Coroutine Library -** See Copyright Notice in lua.h -*/ - -#define lcorolib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -static lua_State *getco (lua_State *L) { - lua_State *co = lua_tothread(L, 1); - luaL_argexpected(L, co, 1, "thread"); - return co; -} - - -/* -** Resumes a coroutine. Returns the number of results for non-error -** cases or -1 for errors. -*/ -static int auxresume (lua_State *L, lua_State *co, int narg) { - int status, nres; - if (l_unlikely(!lua_checkstack(co, narg))) { - lua_pushliteral(L, "too many arguments to resume"); - return -1; /* error flag */ - } - lua_xmove(L, co, narg); - status = lua_resume(co, L, narg, &nres); - if (l_likely(status == LUA_OK || status == LUA_YIELD)) { - if (l_unlikely(!lua_checkstack(L, nres + 1))) { - lua_pop(co, nres); /* remove results anyway */ - lua_pushliteral(L, "too many results to resume"); - return -1; /* error flag */ - } - lua_xmove(co, L, nres); /* move yielded values */ - return nres; - } - else { - lua_xmove(co, L, 1); /* move error message */ - return -1; /* error flag */ - } -} - - -static int luaB_coresume (lua_State *L) { - lua_State *co = getco(L); - int r; - r = auxresume(L, co, lua_gettop(L) - 1); - if (l_unlikely(r < 0)) { - lua_pushboolean(L, 0); - lua_insert(L, -2); - return 2; /* return false + error message */ - } - else { - lua_pushboolean(L, 1); - lua_insert(L, -(r + 1)); - return r + 1; /* return true + 'resume' returns */ - } -} - - -static int luaB_auxwrap (lua_State *L) { - lua_State *co = lua_tothread(L, lua_upvalueindex(1)); - int r = auxresume(L, co, lua_gettop(L)); - if (l_unlikely(r < 0)) { /* error? */ - int stat = lua_status(co); - if (stat != LUA_OK && stat != LUA_YIELD) { /* error in the coroutine? */ - stat = lua_closethread(co, L); /* close its tbc variables */ - lua_assert(stat != LUA_OK); - lua_xmove(co, L, 1); /* move error message to the caller */ - } - if (stat != LUA_ERRMEM && /* not a memory error and ... */ - lua_type(L, -1) == LUA_TSTRING) { /* ... error object is a string? */ - luaL_where(L, 1); /* add extra info, if available */ - lua_insert(L, -2); - lua_concat(L, 2); - } - return lua_error(L); /* propagate error */ - } - return r; -} - - -static int luaB_cocreate (lua_State *L) { - lua_State *NL; - luaL_checktype(L, 1, LUA_TFUNCTION); - NL = lua_newthread(L); - lua_pushvalue(L, 1); /* move function to top */ - lua_xmove(L, NL, 1); /* move function from L to NL */ - return 1; -} - - -static int luaB_cowrap (lua_State *L) { - luaB_cocreate(L); - lua_pushcclosure(L, luaB_auxwrap, 1); - return 1; -} - - -static int luaB_yield (lua_State *L) { - return lua_yield(L, lua_gettop(L)); -} - - -#define COS_RUN 0 -#define COS_DEAD 1 -#define COS_YIELD 2 -#define COS_NORM 3 - - -static const char *const statname[] = - {"running", "dead", "suspended", "normal"}; - - -static int auxstatus (lua_State *L, lua_State *co) { - if (L == co) return COS_RUN; - else { - switch (lua_status(co)) { - case LUA_YIELD: - return COS_YIELD; - case LUA_OK: { - lua_Debug ar; - if (lua_getstack(co, 0, &ar)) /* does it have frames? */ - return COS_NORM; /* it is running */ - else if (lua_gettop(co) == 0) - return COS_DEAD; - else - return COS_YIELD; /* initial state */ - } - default: /* some error occurred */ - return COS_DEAD; - } - } -} - - -static int luaB_costatus (lua_State *L) { - lua_State *co = getco(L); - lua_pushstring(L, statname[auxstatus(L, co)]); - return 1; -} - - -static int luaB_yieldable (lua_State *L) { - lua_State *co = lua_isnone(L, 1) ? L : getco(L); - lua_pushboolean(L, lua_isyieldable(co)); - return 1; -} - - -static int luaB_corunning (lua_State *L) { - int ismain = lua_pushthread(L); - lua_pushboolean(L, ismain); - return 2; -} - - -static int luaB_close (lua_State *L) { - lua_State *co = getco(L); - int status = auxstatus(L, co); - switch (status) { - case COS_DEAD: case COS_YIELD: { - status = lua_closethread(co, L); - if (status == LUA_OK) { - lua_pushboolean(L, 1); - return 1; - } - else { - lua_pushboolean(L, 0); - lua_xmove(co, L, 1); /* move error message */ - return 2; - } - } - default: /* normal or running coroutine */ - return luaL_error(L, "cannot close a %s coroutine", statname[status]); - } -} - - -static const luaL_Reg co_funcs[] = { - {"create", luaB_cocreate}, - {"resume", luaB_coresume}, - {"running", luaB_corunning}, - {"status", luaB_costatus}, - {"wrap", luaB_cowrap}, - {"yield", luaB_yield}, - {"isyieldable", luaB_yieldable}, - {"close", luaB_close}, - {NULL, NULL} -}; - - - -LUAMOD_API int luaopen_coroutine (lua_State *L) { - luaL_newlib(L, co_funcs); - return 1; -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lctype.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lctype.c deleted file mode 100644 index 9542280..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lctype.c +++ /dev/null @@ -1,64 +0,0 @@ -/* -** $Id: lctype.c $ -** 'ctype' functions for Lua -** See Copyright Notice in lua.h -*/ - -#define lctype_c -#define LUA_CORE - -#include "lprefix.h" - - -#include "lctype.h" - -#if !LUA_USE_CTYPE /* { */ - -#include - - -#if defined (LUA_UCID) /* accept UniCode IDentifiers? */ -/* consider all non-ascii codepoints to be alphabetic */ -#define NONA 0x01 -#else -#define NONA 0x00 /* default */ -#endif - - -LUAI_DDEF const lu_byte luai_ctype_[UCHAR_MAX + 2] = { - 0x00, /* EOZ */ - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0. */ - 0x00, 0x08, 0x08, 0x08, 0x08, 0x08, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 1. */ - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x0c, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, /* 2. */ - 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, /* 3. */ - 0x16, 0x16, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x04, 0x15, 0x15, 0x15, 0x15, 0x15, 0x15, 0x05, /* 4. */ - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, /* 5. */ - 0x05, 0x05, 0x05, 0x04, 0x04, 0x04, 0x04, 0x05, - 0x04, 0x15, 0x15, 0x15, 0x15, 0x15, 0x15, 0x05, /* 6. */ - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, /* 7. */ - 0x05, 0x05, 0x05, 0x04, 0x04, 0x04, 0x04, 0x00, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* 8. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* 9. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* a. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* b. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - 0x00, 0x00, NONA, NONA, NONA, NONA, NONA, NONA, /* c. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* d. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* e. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, 0x00, 0x00, 0x00, /* f. */ - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 -}; - -#endif /* } */ diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lctype.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lctype.h deleted file mode 100644 index 864e190..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lctype.h +++ /dev/null @@ -1,101 +0,0 @@ -/* -** $Id: lctype.h $ -** 'ctype' functions for Lua -** See Copyright Notice in lua.h -*/ - -#ifndef lctype_h -#define lctype_h - -#include "lua.h" - - -/* -** WARNING: the functions defined here do not necessarily correspond -** to the similar functions in the standard C ctype.h. They are -** optimized for the specific needs of Lua. -*/ - -#if !defined(LUA_USE_CTYPE) - -#if 'A' == 65 && '0' == 48 -/* ASCII case: can use its own tables; faster and fixed */ -#define LUA_USE_CTYPE 0 -#else -/* must use standard C ctype */ -#define LUA_USE_CTYPE 1 -#endif - -#endif - - -#if !LUA_USE_CTYPE /* { */ - -#include - -#include "llimits.h" - - -#define ALPHABIT 0 -#define DIGITBIT 1 -#define PRINTBIT 2 -#define SPACEBIT 3 -#define XDIGITBIT 4 - - -#define MASK(B) (1 << (B)) - - -/* -** add 1 to char to allow index -1 (EOZ) -*/ -#define testprop(c,p) (luai_ctype_[(c)+1] & (p)) - -/* -** 'lalpha' (Lua alphabetic) and 'lalnum' (Lua alphanumeric) both include '_' -*/ -#define lislalpha(c) testprop(c, MASK(ALPHABIT)) -#define lislalnum(c) testprop(c, (MASK(ALPHABIT) | MASK(DIGITBIT))) -#define lisdigit(c) testprop(c, MASK(DIGITBIT)) -#define lisspace(c) testprop(c, MASK(SPACEBIT)) -#define lisprint(c) testprop(c, MASK(PRINTBIT)) -#define lisxdigit(c) testprop(c, MASK(XDIGITBIT)) - - -/* -** In ASCII, this 'ltolower' is correct for alphabetic characters and -** for '.'. That is enough for Lua needs. ('check_exp' ensures that -** the character either is an upper-case letter or is unchanged by -** the transformation, which holds for lower-case letters and '.'.) -*/ -#define ltolower(c) \ - check_exp(('A' <= (c) && (c) <= 'Z') || (c) == ((c) | ('A' ^ 'a')), \ - (c) | ('A' ^ 'a')) - - -/* one entry for each character and for -1 (EOZ) */ -LUAI_DDEC(const lu_byte luai_ctype_[UCHAR_MAX + 2];) - - -#else /* }{ */ - -/* -** use standard C ctypes -*/ - -#include - - -#define lislalpha(c) (isalpha(c) || (c) == '_') -#define lislalnum(c) (isalnum(c) || (c) == '_') -#define lisdigit(c) (isdigit(c)) -#define lisspace(c) (isspace(c)) -#define lisprint(c) (isprint(c)) -#define lisxdigit(c) (isxdigit(c)) - -#define ltolower(c) (tolower(c)) - -#endif /* } */ - -#endif - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldblib.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldblib.c deleted file mode 100644 index 2c94138..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldblib.c +++ /dev/null @@ -1,474 +0,0 @@ -/* -** $Id: ldblib.c $ -** Interface from Lua to its debug API -** See Copyright Notice in lua.h -*/ - -#define ldblib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** The hook table at registry[HOOKKEY] maps threads to their current -** hook function. -*/ -static const char *const HOOKKEY = "_HOOKKEY"; - - -/* -** If L1 != L, L1 can be in any state, and therefore there are no -** guarantees about its stack space; any push in L1 must be -** checked. -*/ -static void checkstack (lua_State *L, lua_State *L1, int n) { - if (l_unlikely(L != L1 && !lua_checkstack(L1, n))) - luaL_error(L, "stack overflow"); -} - - -static int db_getregistry (lua_State *L) { - lua_pushvalue(L, LUA_REGISTRYINDEX); - return 1; -} - - -static int db_getmetatable (lua_State *L) { - luaL_checkany(L, 1); - if (!lua_getmetatable(L, 1)) { - lua_pushnil(L); /* no metatable */ - } - return 1; -} - - -static int db_setmetatable (lua_State *L) { - int t = lua_type(L, 2); - luaL_argexpected(L, t == LUA_TNIL || t == LUA_TTABLE, 2, "nil or table"); - lua_settop(L, 2); - lua_setmetatable(L, 1); - return 1; /* return 1st argument */ -} - - -static int db_getuservalue (lua_State *L) { - int n = (int)luaL_optinteger(L, 2, 1); - if (lua_type(L, 1) != LUA_TUSERDATA) - luaL_pushfail(L); - else if (lua_getiuservalue(L, 1, n) != LUA_TNONE) { - lua_pushboolean(L, 1); - return 2; - } - return 1; -} - - -static int db_setuservalue (lua_State *L) { - int n = (int)luaL_optinteger(L, 3, 1); - luaL_checktype(L, 1, LUA_TUSERDATA); - luaL_checkany(L, 2); - lua_settop(L, 2); - if (!lua_setiuservalue(L, 1, n)) - luaL_pushfail(L); - return 1; -} - - -/* -** Auxiliary function used by several library functions: check for -** an optional thread as function's first argument and set 'arg' with -** 1 if this argument is present (so that functions can skip it to -** access their other arguments) -*/ -static lua_State *getthread (lua_State *L, int *arg) { - if (lua_isthread(L, 1)) { - *arg = 1; - return lua_tothread(L, 1); - } - else { - *arg = 0; - return L; /* function will operate over current thread */ - } -} - - -/* -** Variations of 'lua_settable', used by 'db_getinfo' to put results -** from 'lua_getinfo' into result table. Key is always a string; -** value can be a string, an int, or a boolean. -*/ -static void settabss (lua_State *L, const char *k, const char *v) { - lua_pushstring(L, v); - lua_setfield(L, -2, k); -} - -static void settabsi (lua_State *L, const char *k, int v) { - lua_pushinteger(L, v); - lua_setfield(L, -2, k); -} - -static void settabsb (lua_State *L, const char *k, int v) { - lua_pushboolean(L, v); - lua_setfield(L, -2, k); -} - - -/* -** In function 'db_getinfo', the call to 'lua_getinfo' may push -** results on the stack; later it creates the result table to put -** these objects. Function 'treatstackoption' puts the result from -** 'lua_getinfo' on top of the result table so that it can call -** 'lua_setfield'. -*/ -static void treatstackoption (lua_State *L, lua_State *L1, const char *fname) { - if (L == L1) - lua_rotate(L, -2, 1); /* exchange object and table */ - else - lua_xmove(L1, L, 1); /* move object to the "main" stack */ - lua_setfield(L, -2, fname); /* put object into table */ -} - - -/* -** Calls 'lua_getinfo' and collects all results in a new table. -** L1 needs stack space for an optional input (function) plus -** two optional outputs (function and line table) from function -** 'lua_getinfo'. -*/ -static int db_getinfo (lua_State *L) { - lua_Debug ar; - int arg; - lua_State *L1 = getthread(L, &arg); - const char *options = luaL_optstring(L, arg+2, "flnSrtu"); - checkstack(L, L1, 3); - luaL_argcheck(L, options[0] != '>', arg + 2, "invalid option '>'"); - if (lua_isfunction(L, arg + 1)) { /* info about a function? */ - options = lua_pushfstring(L, ">%s", options); /* add '>' to 'options' */ - lua_pushvalue(L, arg + 1); /* move function to 'L1' stack */ - lua_xmove(L, L1, 1); - } - else { /* stack level */ - if (!lua_getstack(L1, (int)luaL_checkinteger(L, arg + 1), &ar)) { - luaL_pushfail(L); /* level out of range */ - return 1; - } - } - if (!lua_getinfo(L1, options, &ar)) - return luaL_argerror(L, arg+2, "invalid option"); - lua_newtable(L); /* table to collect results */ - if (strchr(options, 'S')) { - lua_pushlstring(L, ar.source, ar.srclen); - lua_setfield(L, -2, "source"); - settabss(L, "short_src", ar.short_src); - settabsi(L, "linedefined", ar.linedefined); - settabsi(L, "lastlinedefined", ar.lastlinedefined); - settabss(L, "what", ar.what); - } - if (strchr(options, 'l')) - settabsi(L, "currentline", ar.currentline); - if (strchr(options, 'u')) { - settabsi(L, "nups", ar.nups); - settabsi(L, "nparams", ar.nparams); - settabsb(L, "isvararg", ar.isvararg); - } - if (strchr(options, 'n')) { - settabss(L, "name", ar.name); - settabss(L, "namewhat", ar.namewhat); - } - if (strchr(options, 'r')) { - settabsi(L, "ftransfer", ar.ftransfer); - settabsi(L, "ntransfer", ar.ntransfer); - } - if (strchr(options, 't')) - settabsb(L, "istailcall", ar.istailcall); - if (strchr(options, 'L')) - treatstackoption(L, L1, "activelines"); - if (strchr(options, 'f')) - treatstackoption(L, L1, "func"); - return 1; /* return table */ -} - - -static int db_getlocal (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - int nvar = (int)luaL_checkinteger(L, arg + 2); /* local-variable index */ - if (lua_isfunction(L, arg + 1)) { /* function argument? */ - lua_pushvalue(L, arg + 1); /* push function */ - lua_pushstring(L, lua_getlocal(L, NULL, nvar)); /* push local name */ - return 1; /* return only name (there is no value) */ - } - else { /* stack-level argument */ - lua_Debug ar; - const char *name; - int level = (int)luaL_checkinteger(L, arg + 1); - if (l_unlikely(!lua_getstack(L1, level, &ar))) /* out of range? */ - return luaL_argerror(L, arg+1, "level out of range"); - checkstack(L, L1, 1); - name = lua_getlocal(L1, &ar, nvar); - if (name) { - lua_xmove(L1, L, 1); /* move local value */ - lua_pushstring(L, name); /* push name */ - lua_rotate(L, -2, 1); /* re-order */ - return 2; - } - else { - luaL_pushfail(L); /* no name (nor value) */ - return 1; - } - } -} - - -static int db_setlocal (lua_State *L) { - int arg; - const char *name; - lua_State *L1 = getthread(L, &arg); - lua_Debug ar; - int level = (int)luaL_checkinteger(L, arg + 1); - int nvar = (int)luaL_checkinteger(L, arg + 2); - if (l_unlikely(!lua_getstack(L1, level, &ar))) /* out of range? */ - return luaL_argerror(L, arg+1, "level out of range"); - luaL_checkany(L, arg+3); - lua_settop(L, arg+3); - checkstack(L, L1, 1); - lua_xmove(L, L1, 1); - name = lua_setlocal(L1, &ar, nvar); - if (name == NULL) - lua_pop(L1, 1); /* pop value (if not popped by 'lua_setlocal') */ - lua_pushstring(L, name); - return 1; -} - - -/* -** get (if 'get' is true) or set an upvalue from a closure -*/ -static int auxupvalue (lua_State *L, int get) { - const char *name; - int n = (int)luaL_checkinteger(L, 2); /* upvalue index */ - luaL_checktype(L, 1, LUA_TFUNCTION); /* closure */ - name = get ? lua_getupvalue(L, 1, n) : lua_setupvalue(L, 1, n); - if (name == NULL) return 0; - lua_pushstring(L, name); - lua_insert(L, -(get+1)); /* no-op if get is false */ - return get + 1; -} - - -static int db_getupvalue (lua_State *L) { - return auxupvalue(L, 1); -} - - -static int db_setupvalue (lua_State *L) { - luaL_checkany(L, 3); - return auxupvalue(L, 0); -} - - -/* -** Check whether a given upvalue from a given closure exists and -** returns its index -*/ -static void *checkupval (lua_State *L, int argf, int argnup, int *pnup) { - void *id; - int nup = (int)luaL_checkinteger(L, argnup); /* upvalue index */ - luaL_checktype(L, argf, LUA_TFUNCTION); /* closure */ - id = lua_upvalueid(L, argf, nup); - if (pnup) { - luaL_argcheck(L, id != NULL, argnup, "invalid upvalue index"); - *pnup = nup; - } - return id; -} - - -static int db_upvalueid (lua_State *L) { - void *id = checkupval(L, 1, 2, NULL); - if (id != NULL) - lua_pushlightuserdata(L, id); - else - luaL_pushfail(L); - return 1; -} - - -static int db_upvaluejoin (lua_State *L) { - int n1, n2; - checkupval(L, 1, 2, &n1); - checkupval(L, 3, 4, &n2); - luaL_argcheck(L, !lua_iscfunction(L, 1), 1, "Lua function expected"); - luaL_argcheck(L, !lua_iscfunction(L, 3), 3, "Lua function expected"); - lua_upvaluejoin(L, 1, n1, 3, n2); - return 0; -} - - -/* -** Call hook function registered at hook table for the current -** thread (if there is one) -*/ -static void hookf (lua_State *L, lua_Debug *ar) { - static const char *const hooknames[] = - {"call", "return", "line", "count", "tail call"}; - lua_getfield(L, LUA_REGISTRYINDEX, HOOKKEY); - lua_pushthread(L); - if (lua_rawget(L, -2) == LUA_TFUNCTION) { /* is there a hook function? */ - lua_pushstring(L, hooknames[(int)ar->event]); /* push event name */ - if (ar->currentline >= 0) - lua_pushinteger(L, ar->currentline); /* push current line */ - else lua_pushnil(L); - lua_assert(lua_getinfo(L, "lS", ar)); - lua_call(L, 2, 0); /* call hook function */ - } -} - - -/* -** Convert a string mask (for 'sethook') into a bit mask -*/ -static int makemask (const char *smask, int count) { - int mask = 0; - if (strchr(smask, 'c')) mask |= LUA_MASKCALL; - if (strchr(smask, 'r')) mask |= LUA_MASKRET; - if (strchr(smask, 'l')) mask |= LUA_MASKLINE; - if (count > 0) mask |= LUA_MASKCOUNT; - return mask; -} - - -/* -** Convert a bit mask (for 'gethook') into a string mask -*/ -static char *unmakemask (int mask, char *smask) { - int i = 0; - if (mask & LUA_MASKCALL) smask[i++] = 'c'; - if (mask & LUA_MASKRET) smask[i++] = 'r'; - if (mask & LUA_MASKLINE) smask[i++] = 'l'; - smask[i] = '\0'; - return smask; -} - - -static int db_sethook (lua_State *L) { - int arg, mask, count; - lua_Hook func; - lua_State *L1 = getthread(L, &arg); - if (lua_isnoneornil(L, arg+1)) { /* no hook? */ - lua_settop(L, arg+1); - func = NULL; mask = 0; count = 0; /* turn off hooks */ - } - else { - const char *smask = luaL_checkstring(L, arg+2); - luaL_checktype(L, arg+1, LUA_TFUNCTION); - count = (int)luaL_optinteger(L, arg + 3, 0); - func = hookf; mask = makemask(smask, count); - } - if (!luaL_getsubtable(L, LUA_REGISTRYINDEX, HOOKKEY)) { - /* table just created; initialize it */ - lua_pushliteral(L, "k"); - lua_setfield(L, -2, "__mode"); /** hooktable.__mode = "k" */ - lua_pushvalue(L, -1); - lua_setmetatable(L, -2); /* metatable(hooktable) = hooktable */ - } - checkstack(L, L1, 1); - lua_pushthread(L1); lua_xmove(L1, L, 1); /* key (thread) */ - lua_pushvalue(L, arg + 1); /* value (hook function) */ - lua_rawset(L, -3); /* hooktable[L1] = new Lua hook */ - lua_sethook(L1, func, mask, count); - return 0; -} - - -static int db_gethook (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - char buff[5]; - int mask = lua_gethookmask(L1); - lua_Hook hook = lua_gethook(L1); - if (hook == NULL) { /* no hook? */ - luaL_pushfail(L); - return 1; - } - else if (hook != hookf) /* external hook? */ - lua_pushliteral(L, "external hook"); - else { /* hook table must exist */ - lua_getfield(L, LUA_REGISTRYINDEX, HOOKKEY); - checkstack(L, L1, 1); - lua_pushthread(L1); lua_xmove(L1, L, 1); - lua_rawget(L, -2); /* 1st result = hooktable[L1] */ - lua_remove(L, -2); /* remove hook table */ - } - lua_pushstring(L, unmakemask(mask, buff)); /* 2nd result = mask */ - lua_pushinteger(L, lua_gethookcount(L1)); /* 3rd result = count */ - return 3; -} - - -static int db_debug (lua_State *L) { - for (;;) { - char buffer[250]; - lua_writestringerror("%s", "lua_debug> "); - if (fgets(buffer, sizeof(buffer), stdin) == NULL || - strcmp(buffer, "cont\n") == 0) - return 0; - if (luaL_loadbuffer(L, buffer, strlen(buffer), "=(debug command)") || - lua_pcall(L, 0, 0, 0)) - lua_writestringerror("%s\n", luaL_tolstring(L, -1, NULL)); - lua_settop(L, 0); /* remove eventual returns */ - } -} - - -static int db_traceback (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - const char *msg = lua_tostring(L, arg + 1); - if (msg == NULL && !lua_isnoneornil(L, arg + 1)) /* non-string 'msg'? */ - lua_pushvalue(L, arg + 1); /* return it untouched */ - else { - int level = (int)luaL_optinteger(L, arg + 2, (L == L1) ? 1 : 0); - luaL_traceback(L, L1, msg, level); - } - return 1; -} - - -static const luaL_Reg dblib[] = { - {"debug", db_debug}, - {"getuservalue", db_getuservalue}, - {"gethook", db_gethook}, - {"getinfo", db_getinfo}, - {"getlocal", db_getlocal}, - {"getregistry", db_getregistry}, - {"getmetatable", db_getmetatable}, - {"getupvalue", db_getupvalue}, - {"upvaluejoin", db_upvaluejoin}, - {"upvalueid", db_upvalueid}, - {"setuservalue", db_setuservalue}, - {"sethook", db_sethook}, - {"setlocal", db_setlocal}, - {"setmetatable", db_setmetatable}, - {"setupvalue", db_setupvalue}, - {"traceback", db_traceback}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_debug (lua_State *L) { - luaL_newlib(L, dblib); - return 1; -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldebug.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldebug.c deleted file mode 100644 index daa979a..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldebug.c +++ /dev/null @@ -1,963 +0,0 @@ -/* -** $Id: ldebug.c $ -** Debug Interface -** See Copyright Notice in lua.h -*/ - -#define ldebug_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "lcode.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lvm.h" - - - -#define noLuaClosure(f) ((f) == NULL || (f)->c.tt == LUA_VCCL) - - -static const char *funcnamefromcall (lua_State *L, CallInfo *ci, - const char **name); - - -static int currentpc (CallInfo *ci) { - lua_assert(isLua(ci)); - return pcRel(ci->u.l.savedpc, ci_func(ci)->p); -} - - -/* -** Get a "base line" to find the line corresponding to an instruction. -** Base lines are regularly placed at MAXIWTHABS intervals, so usually -** an integer division gets the right place. When the source file has -** large sequences of empty/comment lines, it may need extra entries, -** so the original estimate needs a correction. -** If the original estimate is -1, the initial 'if' ensures that the -** 'while' will run at least once. -** The assertion that the estimate is a lower bound for the correct base -** is valid as long as the debug info has been generated with the same -** value for MAXIWTHABS or smaller. (Previous releases use a little -** smaller value.) -*/ -static int getbaseline (const Proto *f, int pc, int *basepc) { - if (f->sizeabslineinfo == 0 || pc < f->abslineinfo[0].pc) { - *basepc = -1; /* start from the beginning */ - return f->linedefined; - } - else { - int i = cast_uint(pc) / MAXIWTHABS - 1; /* get an estimate */ - /* estimate must be a lower bound of the correct base */ - lua_assert(i < 0 || - (i < f->sizeabslineinfo && f->abslineinfo[i].pc <= pc)); - while (i + 1 < f->sizeabslineinfo && pc >= f->abslineinfo[i + 1].pc) - i++; /* low estimate; adjust it */ - *basepc = f->abslineinfo[i].pc; - return f->abslineinfo[i].line; - } -} - - -/* -** Get the line corresponding to instruction 'pc' in function 'f'; -** first gets a base line and from there does the increments until -** the desired instruction. -*/ -int luaG_getfuncline (const Proto *f, int pc) { - if (f->lineinfo == NULL) /* no debug information? */ - return -1; - else { - int basepc; - int baseline = getbaseline(f, pc, &basepc); - while (basepc++ < pc) { /* walk until given instruction */ - lua_assert(f->lineinfo[basepc] != ABSLINEINFO); - baseline += f->lineinfo[basepc]; /* correct line */ - } - return baseline; - } -} - - -static int getcurrentline (CallInfo *ci) { - return luaG_getfuncline(ci_func(ci)->p, currentpc(ci)); -} - - -/* -** Set 'trap' for all active Lua frames. -** This function can be called during a signal, under "reasonable" -** assumptions. A new 'ci' is completely linked in the list before it -** becomes part of the "active" list, and we assume that pointers are -** atomic; see comment in next function. -** (A compiler doing interprocedural optimizations could, theoretically, -** reorder memory writes in such a way that the list could be -** temporarily broken while inserting a new element. We simply assume it -** has no good reasons to do that.) -*/ -static void settraps (CallInfo *ci) { - for (; ci != NULL; ci = ci->previous) - if (isLua(ci)) - ci->u.l.trap = 1; -} - - -/* -** This function can be called during a signal, under "reasonable" -** assumptions. -** Fields 'basehookcount' and 'hookcount' (set by 'resethookcount') -** are for debug only, and it is no problem if they get arbitrary -** values (causes at most one wrong hook call). 'hookmask' is an atomic -** value. We assume that pointers are atomic too (e.g., gcc ensures that -** for all platforms where it runs). Moreover, 'hook' is always checked -** before being called (see 'luaD_hook'). -*/ -LUA_API void lua_sethook (lua_State *L, lua_Hook func, int mask, int count) { - if (func == NULL || mask == 0) { /* turn off hooks? */ - mask = 0; - func = NULL; - } - L->hook = func; - L->basehookcount = count; - resethookcount(L); - L->hookmask = cast_byte(mask); - if (mask) - settraps(L->ci); /* to trace inside 'luaV_execute' */ -} - - -LUA_API lua_Hook lua_gethook (lua_State *L) { - return L->hook; -} - - -LUA_API int lua_gethookmask (lua_State *L) { - return L->hookmask; -} - - -LUA_API int lua_gethookcount (lua_State *L) { - return L->basehookcount; -} - - -LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar) { - int status; - CallInfo *ci; - if (level < 0) return 0; /* invalid (negative) level */ - lua_lock(L); - for (ci = L->ci; level > 0 && ci != &L->base_ci; ci = ci->previous) - level--; - if (level == 0 && ci != &L->base_ci) { /* level found? */ - status = 1; - ar->i_ci = ci; - } - else status = 0; /* no such level */ - lua_unlock(L); - return status; -} - - -static const char *upvalname (const Proto *p, int uv) { - TString *s = check_exp(uv < p->sizeupvalues, p->upvalues[uv].name); - if (s == NULL) return "?"; - else return getstr(s); -} - - -static const char *findvararg (CallInfo *ci, int n, StkId *pos) { - if (clLvalue(s2v(ci->func.p))->p->flag & PF_ISVARARG) { - int nextra = ci->u.l.nextraargs; - if (n >= -nextra) { /* 'n' is negative */ - *pos = ci->func.p - nextra - (n + 1); - return "(vararg)"; /* generic name for any vararg */ - } - } - return NULL; /* no such vararg */ -} - - -const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, StkId *pos) { - StkId base = ci->func.p + 1; - const char *name = NULL; - if (isLua(ci)) { - if (n < 0) /* access to vararg values? */ - return findvararg(ci, n, pos); - else - name = luaF_getlocalname(ci_func(ci)->p, n, currentpc(ci)); - } - if (name == NULL) { /* no 'standard' name? */ - StkId limit = (ci == L->ci) ? L->top.p : ci->next->func.p; - if (limit - base >= n && n > 0) { /* is 'n' inside 'ci' stack? */ - /* generic name for any valid slot */ - name = isLua(ci) ? "(temporary)" : "(C temporary)"; - } - else - return NULL; /* no name */ - } - if (pos) - *pos = base + (n - 1); - return name; -} - - -LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) { - const char *name; - lua_lock(L); - if (ar == NULL) { /* information about non-active function? */ - if (!isLfunction(s2v(L->top.p - 1))) /* not a Lua function? */ - name = NULL; - else /* consider live variables at function start (parameters) */ - name = luaF_getlocalname(clLvalue(s2v(L->top.p - 1))->p, n, 0); - } - else { /* active function; get information through 'ar' */ - StkId pos = NULL; /* to avoid warnings */ - name = luaG_findlocal(L, ar->i_ci, n, &pos); - if (name) { - setobjs2s(L, L->top.p, pos); - api_incr_top(L); - } - } - lua_unlock(L); - return name; -} - - -LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) { - StkId pos = NULL; /* to avoid warnings */ - const char *name; - lua_lock(L); - name = luaG_findlocal(L, ar->i_ci, n, &pos); - if (name) { - api_checkpop(L, 1); - setobjs2s(L, pos, L->top.p - 1); - L->top.p--; /* pop value */ - } - lua_unlock(L); - return name; -} - - -static void funcinfo (lua_Debug *ar, Closure *cl) { - if (noLuaClosure(cl)) { - ar->source = "=[C]"; - ar->srclen = LL("=[C]"); - ar->linedefined = -1; - ar->lastlinedefined = -1; - ar->what = "C"; - } - else { - const Proto *p = cl->l.p; - if (p->source) { - ar->source = getlstr(p->source, ar->srclen); - } - else { - ar->source = "=?"; - ar->srclen = LL("=?"); - } - ar->linedefined = p->linedefined; - ar->lastlinedefined = p->lastlinedefined; - ar->what = (ar->linedefined == 0) ? "main" : "Lua"; - } - luaO_chunkid(ar->short_src, ar->source, ar->srclen); -} - - -static int nextline (const Proto *p, int currentline, int pc) { - if (p->lineinfo[pc] != ABSLINEINFO) - return currentline + p->lineinfo[pc]; - else - return luaG_getfuncline(p, pc); -} - - -static void collectvalidlines (lua_State *L, Closure *f) { - if (noLuaClosure(f)) { - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - } - else { - int i; - TValue v; - const Proto *p = f->l.p; - int currentline = p->linedefined; - Table *t = luaH_new(L); /* new table to store active lines */ - sethvalue2s(L, L->top.p, t); /* push it on stack */ - api_incr_top(L); - setbtvalue(&v); /* boolean 'true' to be the value of all indices */ - if (!(p->flag & PF_ISVARARG)) /* regular function? */ - i = 0; /* consider all instructions */ - else { /* vararg function */ - lua_assert(GET_OPCODE(p->code[0]) == OP_VARARGPREP); - currentline = nextline(p, currentline, 0); - i = 1; /* skip first instruction (OP_VARARGPREP) */ - } - for (; i < p->sizelineinfo; i++) { /* for each instruction */ - currentline = nextline(p, currentline, i); /* get its line */ - luaH_setint(L, t, currentline, &v); /* table[line] = true */ - } - } -} - - -static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name) { - /* calling function is a known function? */ - if (ci != NULL && !(ci->callstatus & CIST_TAIL)) - return funcnamefromcall(L, ci->previous, name); - else return NULL; /* no way to find a name */ -} - - -static int auxgetinfo (lua_State *L, const char *what, lua_Debug *ar, - Closure *f, CallInfo *ci) { - int status = 1; - for (; *what; what++) { - switch (*what) { - case 'S': { - funcinfo(ar, f); - break; - } - case 'l': { - ar->currentline = (ci && isLua(ci)) ? getcurrentline(ci) : -1; - break; - } - case 'u': { - ar->nups = (f == NULL) ? 0 : f->c.nupvalues; - if (noLuaClosure(f)) { - ar->isvararg = 1; - ar->nparams = 0; - } - else { - ar->isvararg = f->l.p->flag & PF_ISVARARG; - ar->nparams = f->l.p->numparams; - } - break; - } - case 't': { - ar->istailcall = (ci) ? ci->callstatus & CIST_TAIL : 0; - break; - } - case 'n': { - ar->namewhat = getfuncname(L, ci, &ar->name); - if (ar->namewhat == NULL) { - ar->namewhat = ""; /* not found */ - ar->name = NULL; - } - break; - } - case 'r': { - if (ci == NULL || !(ci->callstatus & CIST_TRAN)) - ar->ftransfer = ar->ntransfer = 0; - else { - ar->ftransfer = ci->u2.transferinfo.ftransfer; - ar->ntransfer = ci->u2.transferinfo.ntransfer; - } - break; - } - case 'L': - case 'f': /* handled by lua_getinfo */ - break; - default: status = 0; /* invalid option */ - } - } - return status; -} - - -LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) { - int status; - Closure *cl; - CallInfo *ci; - TValue *func; - lua_lock(L); - if (*what == '>') { - ci = NULL; - func = s2v(L->top.p - 1); - api_check(L, ttisfunction(func), "function expected"); - what++; /* skip the '>' */ - L->top.p--; /* pop function */ - } - else { - ci = ar->i_ci; - func = s2v(ci->func.p); - lua_assert(ttisfunction(func)); - } - cl = ttisclosure(func) ? clvalue(func) : NULL; - status = auxgetinfo(L, what, ar, cl, ci); - if (strchr(what, 'f')) { - setobj2s(L, L->top.p, func); - api_incr_top(L); - } - if (strchr(what, 'L')) - collectvalidlines(L, cl); - lua_unlock(L); - return status; -} - - -/* -** {====================================================== -** Symbolic Execution -** ======================================================= -*/ - - -static int filterpc (int pc, int jmptarget) { - if (pc < jmptarget) /* is code conditional (inside a jump)? */ - return -1; /* cannot know who sets that register */ - else return pc; /* current position sets that register */ -} - - -/* -** Try to find last instruction before 'lastpc' that modified register 'reg'. -*/ -static int findsetreg (const Proto *p, int lastpc, int reg) { - int pc; - int setreg = -1; /* keep last instruction that changed 'reg' */ - int jmptarget = 0; /* any code before this address is conditional */ - if (testMMMode(GET_OPCODE(p->code[lastpc]))) - lastpc--; /* previous instruction was not actually executed */ - for (pc = 0; pc < lastpc; pc++) { - Instruction i = p->code[pc]; - OpCode op = GET_OPCODE(i); - int a = GETARG_A(i); - int change; /* true if current instruction changed 'reg' */ - switch (op) { - case OP_LOADNIL: { /* set registers from 'a' to 'a+b' */ - int b = GETARG_B(i); - change = (a <= reg && reg <= a + b); - break; - } - case OP_TFORCALL: { /* affect all regs above its base */ - change = (reg >= a + 2); - break; - } - case OP_CALL: - case OP_TAILCALL: { /* affect all registers above base */ - change = (reg >= a); - break; - } - case OP_JMP: { /* doesn't change registers, but changes 'jmptarget' */ - int b = GETARG_sJ(i); - int dest = pc + 1 + b; - /* jump does not skip 'lastpc' and is larger than current one? */ - if (dest <= lastpc && dest > jmptarget) - jmptarget = dest; /* update 'jmptarget' */ - change = 0; - break; - } - default: /* any instruction that sets A */ - change = (testAMode(op) && reg == a); - break; - } - if (change) - setreg = filterpc(pc, jmptarget); - } - return setreg; -} - - -/* -** Find a "name" for the constant 'c'. -*/ -static const char *kname (const Proto *p, int index, const char **name) { - TValue *kvalue = &p->k[index]; - if (ttisstring(kvalue)) { - *name = getstr(tsvalue(kvalue)); - return "constant"; - } - else { - *name = "?"; - return NULL; - } -} - - -static const char *basicgetobjname (const Proto *p, int *ppc, int reg, - const char **name) { - int pc = *ppc; - *name = luaF_getlocalname(p, reg + 1, pc); - if (*name) /* is a local? */ - return "local"; - /* else try symbolic execution */ - *ppc = pc = findsetreg(p, pc, reg); - if (pc != -1) { /* could find instruction? */ - Instruction i = p->code[pc]; - OpCode op = GET_OPCODE(i); - switch (op) { - case OP_MOVE: { - int b = GETARG_B(i); /* move from 'b' to 'a' */ - if (b < GETARG_A(i)) - return basicgetobjname(p, ppc, b, name); /* get name for 'b' */ - break; - } - case OP_GETUPVAL: { - *name = upvalname(p, GETARG_B(i)); - return "upvalue"; - } - case OP_LOADK: return kname(p, GETARG_Bx(i), name); - case OP_LOADKX: return kname(p, GETARG_Ax(p->code[pc + 1]), name); - default: break; - } - } - return NULL; /* could not find reasonable name */ -} - - -/* -** Find a "name" for the register 'c'. -*/ -static void rname (const Proto *p, int pc, int c, const char **name) { - const char *what = basicgetobjname(p, &pc, c, name); /* search for 'c' */ - if (!(what && *what == 'c')) /* did not find a constant name? */ - *name = "?"; -} - - -/* -** Find a "name" for a 'C' value in an RK instruction. -*/ -static void rkname (const Proto *p, int pc, Instruction i, const char **name) { - int c = GETARG_C(i); /* key index */ - if (GETARG_k(i)) /* is 'c' a constant? */ - kname(p, c, name); - else /* 'c' is a register */ - rname(p, pc, c, name); -} - - -/* -** Check whether table being indexed by instruction 'i' is the -** environment '_ENV' -*/ -static const char *isEnv (const Proto *p, int pc, Instruction i, int isup) { - int t = GETARG_B(i); /* table index */ - const char *name; /* name of indexed variable */ - if (isup) /* is 't' an upvalue? */ - name = upvalname(p, t); - else /* 't' is a register */ - basicgetobjname(p, &pc, t, &name); - return (name && strcmp(name, LUA_ENV) == 0) ? "global" : "field"; -} - - -/* -** Extend 'basicgetobjname' to handle table accesses -*/ -static const char *getobjname (const Proto *p, int lastpc, int reg, - const char **name) { - const char *kind = basicgetobjname(p, &lastpc, reg, name); - if (kind != NULL) - return kind; - else if (lastpc != -1) { /* could find instruction? */ - Instruction i = p->code[lastpc]; - OpCode op = GET_OPCODE(i); - switch (op) { - case OP_GETTABUP: { - int k = GETARG_C(i); /* key index */ - kname(p, k, name); - return isEnv(p, lastpc, i, 1); - } - case OP_GETTABLE: { - int k = GETARG_C(i); /* key index */ - rname(p, lastpc, k, name); - return isEnv(p, lastpc, i, 0); - } - case OP_GETI: { - *name = "integer index"; - return "field"; - } - case OP_GETFIELD: { - int k = GETARG_C(i); /* key index */ - kname(p, k, name); - return isEnv(p, lastpc, i, 0); - } - case OP_SELF: { - rkname(p, lastpc, i, name); - return "method"; - } - default: break; /* go through to return NULL */ - } - } - return NULL; /* could not find reasonable name */ -} - - -/* -** Try to find a name for a function based on the code that called it. -** (Only works when function was called by a Lua function.) -** Returns what the name is (e.g., "for iterator", "method", -** "metamethod") and sets '*name' to point to the name. -*/ -static const char *funcnamefromcode (lua_State *L, const Proto *p, - int pc, const char **name) { - TMS tm = (TMS)0; /* (initial value avoids warnings) */ - Instruction i = p->code[pc]; /* calling instruction */ - switch (GET_OPCODE(i)) { - case OP_CALL: - case OP_TAILCALL: - return getobjname(p, pc, GETARG_A(i), name); /* get function name */ - case OP_TFORCALL: { /* for iterator */ - *name = "for iterator"; - return "for iterator"; - } - /* other instructions can do calls through metamethods */ - case OP_SELF: case OP_GETTABUP: case OP_GETTABLE: - case OP_GETI: case OP_GETFIELD: - tm = TM_INDEX; - break; - case OP_SETTABUP: case OP_SETTABLE: case OP_SETI: case OP_SETFIELD: - tm = TM_NEWINDEX; - break; - case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { - tm = cast(TMS, GETARG_C(i)); - break; - } - case OP_UNM: tm = TM_UNM; break; - case OP_BNOT: tm = TM_BNOT; break; - case OP_LEN: tm = TM_LEN; break; - case OP_CONCAT: tm = TM_CONCAT; break; - case OP_EQ: tm = TM_EQ; break; - /* no cases for OP_EQI and OP_EQK, as they don't call metamethods */ - case OP_LT: case OP_LTI: case OP_GTI: tm = TM_LT; break; - case OP_LE: case OP_LEI: case OP_GEI: tm = TM_LE; break; - case OP_CLOSE: case OP_RETURN: tm = TM_CLOSE; break; - default: - return NULL; /* cannot find a reasonable name */ - } - *name = getshrstr(G(L)->tmname[tm]) + 2; - return "metamethod"; -} - - -/* -** Try to find a name for a function based on how it was called. -*/ -static const char *funcnamefromcall (lua_State *L, CallInfo *ci, - const char **name) { - if (ci->callstatus & CIST_HOOKED) { /* was it called inside a hook? */ - *name = "?"; - return "hook"; - } - else if (ci->callstatus & CIST_FIN) { /* was it called as a finalizer? */ - *name = "__gc"; - return "metamethod"; /* report it as such */ - } - else if (isLua(ci)) - return funcnamefromcode(L, ci_func(ci)->p, currentpc(ci), name); - else - return NULL; -} - -/* }====================================================== */ - - - -/* -** Check whether pointer 'o' points to some value in the stack frame of -** the current function and, if so, returns its index. Because 'o' may -** not point to a value in this stack, we cannot compare it with the -** region boundaries (undefined behavior in ISO C). -*/ -static int instack (CallInfo *ci, const TValue *o) { - int pos; - StkId base = ci->func.p + 1; - for (pos = 0; base + pos < ci->top.p; pos++) { - if (o == s2v(base + pos)) - return pos; - } - return -1; /* not found */ -} - - -/* -** Checks whether value 'o' came from an upvalue. (That can only happen -** with instructions OP_GETTABUP/OP_SETTABUP, which operate directly on -** upvalues.) -*/ -static const char *getupvalname (CallInfo *ci, const TValue *o, - const char **name) { - LClosure *c = ci_func(ci); - int i; - for (i = 0; i < c->nupvalues; i++) { - if (c->upvals[i]->v.p == o) { - *name = upvalname(c->p, i); - return "upvalue"; - } - } - return NULL; -} - - -static const char *formatvarinfo (lua_State *L, const char *kind, - const char *name) { - if (kind == NULL) - return ""; /* no information */ - else - return luaO_pushfstring(L, " (%s '%s')", kind, name); -} - -/* -** Build a string with a "description" for the value 'o', such as -** "variable 'x'" or "upvalue 'y'". -*/ -static const char *varinfo (lua_State *L, const TValue *o) { - CallInfo *ci = L->ci; - const char *name = NULL; /* to avoid warnings */ - const char *kind = NULL; - if (isLua(ci)) { - kind = getupvalname(ci, o, &name); /* check whether 'o' is an upvalue */ - if (!kind) { /* not an upvalue? */ - int reg = instack(ci, o); /* try a register */ - if (reg >= 0) /* is 'o' a register? */ - kind = getobjname(ci_func(ci)->p, currentpc(ci), reg, &name); - } - } - return formatvarinfo(L, kind, name); -} - - -/* -** Raise a type error -*/ -static l_noret typeerror (lua_State *L, const TValue *o, const char *op, - const char *extra) { - const char *t = luaT_objtypename(L, o); - luaG_runerror(L, "attempt to %s a %s value%s", op, t, extra); -} - - -/* -** Raise a type error with "standard" information about the faulty -** object 'o' (using 'varinfo'). -*/ -l_noret luaG_typeerror (lua_State *L, const TValue *o, const char *op) { - typeerror(L, o, op, varinfo(L, o)); -} - - -/* -** Raise an error for calling a non-callable object. Try to find a name -** for the object based on how it was called ('funcnamefromcall'); if it -** cannot get a name there, try 'varinfo'. -*/ -l_noret luaG_callerror (lua_State *L, const TValue *o) { - CallInfo *ci = L->ci; - const char *name = NULL; /* to avoid warnings */ - const char *kind = funcnamefromcall(L, ci, &name); - const char *extra = kind ? formatvarinfo(L, kind, name) : varinfo(L, o); - typeerror(L, o, "call", extra); -} - - -l_noret luaG_forerror (lua_State *L, const TValue *o, const char *what) { - luaG_runerror(L, "bad 'for' %s (number expected, got %s)", - what, luaT_objtypename(L, o)); -} - - -l_noret luaG_concaterror (lua_State *L, const TValue *p1, const TValue *p2) { - if (ttisstring(p1) || cvt2str(p1)) p1 = p2; - luaG_typeerror(L, p1, "concatenate"); -} - - -l_noret luaG_opinterror (lua_State *L, const TValue *p1, - const TValue *p2, const char *msg) { - if (!ttisnumber(p1)) /* first operand is wrong? */ - p2 = p1; /* now second is wrong */ - luaG_typeerror(L, p2, msg); -} - - -/* -** Error when both values are convertible to numbers, but not to integers -*/ -l_noret luaG_tointerror (lua_State *L, const TValue *p1, const TValue *p2) { - lua_Integer temp; - if (!luaV_tointegerns(p1, &temp, LUA_FLOORN2I)) - p2 = p1; - luaG_runerror(L, "number%s has no integer representation", varinfo(L, p2)); -} - - -l_noret luaG_ordererror (lua_State *L, const TValue *p1, const TValue *p2) { - const char *t1 = luaT_objtypename(L, p1); - const char *t2 = luaT_objtypename(L, p2); - if (strcmp(t1, t2) == 0) - luaG_runerror(L, "attempt to compare two %s values", t1); - else - luaG_runerror(L, "attempt to compare %s with %s", t1, t2); -} - - -/* add src:line information to 'msg' */ -const char *luaG_addinfo (lua_State *L, const char *msg, TString *src, - int line) { - char buff[LUA_IDSIZE]; - if (src) { - size_t idlen; - const char *id = getlstr(src, idlen); - luaO_chunkid(buff, id, idlen); - } - else { /* no source available; use "?" instead */ - buff[0] = '?'; buff[1] = '\0'; - } - return luaO_pushfstring(L, "%s:%d: %s", buff, line, msg); -} - - -l_noret luaG_errormsg (lua_State *L) { - if (L->errfunc != 0) { /* is there an error handling function? */ - StkId errfunc = restorestack(L, L->errfunc); - lua_assert(ttisfunction(s2v(errfunc))); - setobjs2s(L, L->top.p, L->top.p - 1); /* move argument */ - setobjs2s(L, L->top.p - 1, errfunc); /* push function */ - L->top.p++; /* assume EXTRA_STACK */ - luaD_callnoyield(L, L->top.p - 2, 1); /* call it */ - } - luaD_throw(L, LUA_ERRRUN); -} - - -l_noret luaG_runerror (lua_State *L, const char *fmt, ...) { - CallInfo *ci = L->ci; - const char *msg; - va_list argp; - luaC_checkGC(L); /* error message uses memory */ - va_start(argp, fmt); - msg = luaO_pushvfstring(L, fmt, argp); /* format message */ - va_end(argp); - if (isLua(ci)) { /* if Lua function, add source:line information */ - luaG_addinfo(L, msg, ci_func(ci)->p->source, getcurrentline(ci)); - setobjs2s(L, L->top.p - 2, L->top.p - 1); /* remove 'msg' */ - L->top.p--; - } - luaG_errormsg(L); -} - - -/* -** Check whether new instruction 'newpc' is in a different line from -** previous instruction 'oldpc'. More often than not, 'newpc' is only -** one or a few instructions after 'oldpc' (it must be after, see -** caller), so try to avoid calling 'luaG_getfuncline'. If they are -** too far apart, there is a good chance of a ABSLINEINFO in the way, -** so it goes directly to 'luaG_getfuncline'. -*/ -static int changedline (const Proto *p, int oldpc, int newpc) { - if (p->lineinfo == NULL) /* no debug information? */ - return 0; - if (newpc - oldpc < MAXIWTHABS / 2) { /* not too far apart? */ - int delta = 0; /* line difference */ - int pc = oldpc; - for (;;) { - int lineinfo = p->lineinfo[++pc]; - if (lineinfo == ABSLINEINFO) - break; /* cannot compute delta; fall through */ - delta += lineinfo; - if (pc == newpc) - return (delta != 0); /* delta computed successfully */ - } - } - /* either instructions are too far apart or there is an absolute line - info in the way; compute line difference explicitly */ - return (luaG_getfuncline(p, oldpc) != luaG_getfuncline(p, newpc)); -} - - -/* -** Traces Lua calls. If code is running the first instruction of a function, -** and function is not vararg, and it is not coming from an yield, -** calls 'luaD_hookcall'. (Vararg functions will call 'luaD_hookcall' -** after adjusting its variable arguments; otherwise, they could call -** a line/count hook before the call hook. Functions coming from -** an yield already called 'luaD_hookcall' before yielding.) -*/ -int luaG_tracecall (lua_State *L) { - CallInfo *ci = L->ci; - Proto *p = ci_func(ci)->p; - ci->u.l.trap = 1; /* ensure hooks will be checked */ - if (ci->u.l.savedpc == p->code) { /* first instruction (not resuming)? */ - if (p->flag & PF_ISVARARG) - return 0; /* hooks will start at VARARGPREP instruction */ - else if (!(ci->callstatus & CIST_HOOKYIELD)) /* not yieded? */ - luaD_hookcall(L, ci); /* check 'call' hook */ - } - return 1; /* keep 'trap' on */ -} - - -/* -** Traces the execution of a Lua function. Called before the execution -** of each opcode, when debug is on. 'L->oldpc' stores the last -** instruction traced, to detect line changes. When entering a new -** function, 'npci' will be zero and will test as a new line whatever -** the value of 'oldpc'. Some exceptional conditions may return to -** a function without setting 'oldpc'. In that case, 'oldpc' may be -** invalid; if so, use zero as a valid value. (A wrong but valid 'oldpc' -** at most causes an extra call to a line hook.) -** This function is not "Protected" when called, so it should correct -** 'L->top.p' before calling anything that can run the GC. -*/ -int luaG_traceexec (lua_State *L, const Instruction *pc) { - CallInfo *ci = L->ci; - lu_byte mask = L->hookmask; - const Proto *p = ci_func(ci)->p; - int counthook; - if (!(mask & (LUA_MASKLINE | LUA_MASKCOUNT))) { /* no hooks? */ - ci->u.l.trap = 0; /* don't need to stop again */ - return 0; /* turn off 'trap' */ - } - pc++; /* reference is always next instruction */ - ci->u.l.savedpc = pc; /* save 'pc' */ - counthook = (mask & LUA_MASKCOUNT) && (--L->hookcount == 0); - if (counthook) - resethookcount(L); /* reset count */ - else if (!(mask & LUA_MASKLINE)) - return 1; /* no line hook and count != 0; nothing to be done now */ - if (ci->callstatus & CIST_HOOKYIELD) { /* hook yielded last time? */ - ci->callstatus &= ~CIST_HOOKYIELD; /* erase mark */ - return 1; /* do not call hook again (VM yielded, so it did not move) */ - } - if (!isIT(*(ci->u.l.savedpc - 1))) /* top not being used? */ - L->top.p = ci->top.p; /* correct top */ - if (counthook) - luaD_hook(L, LUA_HOOKCOUNT, -1, 0, 0); /* call count hook */ - if (mask & LUA_MASKLINE) { - /* 'L->oldpc' may be invalid; use zero in this case */ - int oldpc = (L->oldpc < p->sizecode) ? L->oldpc : 0; - int npci = pcRel(pc, p); - if (npci <= oldpc || /* call hook when jump back (loop), */ - changedline(p, oldpc, npci)) { /* or when enter new line */ - int newline = luaG_getfuncline(p, npci); - luaD_hook(L, LUA_HOOKLINE, newline, 0, 0); /* call line hook */ - } - L->oldpc = npci; /* 'pc' of last call to line hook */ - } - if (L->status == LUA_YIELD) { /* did hook yield? */ - if (counthook) - L->hookcount = 1; /* undo decrement to zero */ - ci->callstatus |= CIST_HOOKYIELD; /* mark that it yielded */ - luaD_throw(L, LUA_YIELD); - } - return 1; /* keep 'trap' on */ -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldebug.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldebug.h deleted file mode 100644 index 2bfce3c..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldebug.h +++ /dev/null @@ -1,64 +0,0 @@ -/* -** $Id: ldebug.h $ -** Auxiliary functions from Debug Interface module -** See Copyright Notice in lua.h -*/ - -#ifndef ldebug_h -#define ldebug_h - - -#include "lstate.h" - - -#define pcRel(pc, p) (cast_int((pc) - (p)->code) - 1) - - -/* Active Lua function (given call info) */ -#define ci_func(ci) (clLvalue(s2v((ci)->func.p))) - - -#define resethookcount(L) (L->hookcount = L->basehookcount) - -/* -** mark for entries in 'lineinfo' array that has absolute information in -** 'abslineinfo' array -*/ -#define ABSLINEINFO (-0x80) - - -/* -** MAXimum number of successive Instructions WiTHout ABSolute line -** information. (A power of two allows fast divisions.) -*/ -#if !defined(MAXIWTHABS) -#define MAXIWTHABS 128 -#endif - - -LUAI_FUNC int luaG_getfuncline (const Proto *f, int pc); -LUAI_FUNC const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, - StkId *pos); -LUAI_FUNC l_noret luaG_typeerror (lua_State *L, const TValue *o, - const char *opname); -LUAI_FUNC l_noret luaG_callerror (lua_State *L, const TValue *o); -LUAI_FUNC l_noret luaG_forerror (lua_State *L, const TValue *o, - const char *what); -LUAI_FUNC l_noret luaG_concaterror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_opinterror (lua_State *L, const TValue *p1, - const TValue *p2, - const char *msg); -LUAI_FUNC l_noret luaG_tointerror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_ordererror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_runerror (lua_State *L, const char *fmt, ...); -LUAI_FUNC const char *luaG_addinfo (lua_State *L, const char *msg, - TString *src, int line); -LUAI_FUNC l_noret luaG_errormsg (lua_State *L); -LUAI_FUNC int luaG_traceexec (lua_State *L, const Instruction *pc); -LUAI_FUNC int luaG_tracecall (lua_State *L); - - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldo.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldo.c deleted file mode 100644 index b8d36cc..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldo.c +++ /dev/null @@ -1,1034 +0,0 @@ -/* -** $Id: ldo.c $ -** Stack and Call structure of Lua -** See Copyright Notice in lua.h -*/ - -#define ldo_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lparser.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lundump.h" -#include "lvm.h" -#include "lzio.h" - - - -#define errorstatus(s) ((s) > LUA_YIELD) - - -/* -** {====================================================== -** Error-recovery functions -** ======================================================= -*/ - -/* -** LUAI_THROW/LUAI_TRY define how Lua does exception handling. By -** default, Lua handles errors with exceptions when compiling as -** C++ code, with _longjmp/_setjmp when asked to use them, and with -** longjmp/setjmp otherwise. -*/ -#if !defined(LUAI_THROW) /* { */ - -#if defined(__cplusplus) && !defined(LUA_USE_LONGJMP) /* { */ - -/* C++ exceptions */ -#define LUAI_THROW(L,c) throw(c) -#define LUAI_TRY(L,c,a) \ - try { a } catch(...) { if ((c)->status == 0) (c)->status = -1; } -#define luai_jmpbuf int /* dummy variable */ - -#elif defined(LUA_USE_POSIX) /* }{ */ - -/* in POSIX, try _longjmp/_setjmp (more efficient) */ -#define LUAI_THROW(L,c) _longjmp((c)->b, 1) -#define LUAI_TRY(L,c,a) if (_setjmp((c)->b) == 0) { a } -#define luai_jmpbuf jmp_buf - -#else /* }{ */ - -/* ISO C handling with long jumps */ -#define LUAI_THROW(L,c) longjmp((c)->b, 1) -#define LUAI_TRY(L,c,a) if (setjmp((c)->b) == 0) { a } -#define luai_jmpbuf jmp_buf - -#endif /* } */ - -#endif /* } */ - - - -/* chain list of long jump buffers */ -struct lua_longjmp { - struct lua_longjmp *previous; - luai_jmpbuf b; - volatile int status; /* error code */ -}; - - -void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop) { - switch (errcode) { - case LUA_ERRMEM: { /* memory error? */ - setsvalue2s(L, oldtop, G(L)->memerrmsg); /* reuse preregistered msg. */ - break; - } - case LUA_ERRERR: { - setsvalue2s(L, oldtop, luaS_newliteral(L, "error in private_lua_error handling")); - break; - } - case LUA_OK: { /* special case only for closing upvalues */ - setnilvalue(s2v(oldtop)); /* no error message */ - break; - } - default: { - lua_assert(errorstatus(errcode)); /* real error */ - setobjs2s(L, oldtop, L->top.p - 1); /* error message on current top */ - break; - } - } - L->top.p = oldtop + 1; -} - - -l_noret luaD_throw (lua_State *L, int errcode) { - if (L->errorJmp) { /* thread has an error handler? */ - L->errorJmp->status = errcode; /* set status */ - LUAI_THROW(L, L->errorJmp); /* jump to it */ - } - else { /* thread has no error handler */ - global_State *g = G(L); - errcode = luaE_resetthread(L, errcode); /* close all upvalues */ - if (g->mainthread->errorJmp) { /* main thread has a handler? */ - setobjs2s(L, g->mainthread->top.p++, L->top.p - 1); /* copy error obj. */ - luaD_throw(g->mainthread, errcode); /* re-throw in main thread */ - } - else { /* no handler at all; abort */ - if (g->panic) { /* panic function? */ - lua_unlock(L); - g->panic(L); /* call panic function (last chance to jump out) */ - } - abort(); - } - } -} - - -int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) { - l_uint32 oldnCcalls = L->nCcalls; - struct lua_longjmp lj; - lj.status = LUA_OK; - lj.previous = L->errorJmp; /* chain new error handler */ - L->errorJmp = &lj; - LUAI_TRY(L, &lj, - (*f)(L, ud); - ); - L->errorJmp = lj.previous; /* restore old error handler */ - L->nCcalls = oldnCcalls; - return lj.status; -} - -/* }====================================================== */ - - -/* -** {================================================================== -** Stack reallocation -** =================================================================== -*/ - - -/* -** Change all pointers to the stack into offsets. -*/ -static void relstack (lua_State *L) { - CallInfo *ci; - UpVal *up; - L->top.offset = savestack(L, L->top.p); - L->tbclist.offset = savestack(L, L->tbclist.p); - for (up = L->openupval; up != NULL; up = up->u.open.next) - up->v.offset = savestack(L, uplevel(up)); - for (ci = L->ci; ci != NULL; ci = ci->previous) { - ci->top.offset = savestack(L, ci->top.p); - ci->func.offset = savestack(L, ci->func.p); - } -} - - -/* -** Change back all offsets into pointers. -*/ -static void correctstack (lua_State *L) { - CallInfo *ci; - UpVal *up; - L->top.p = restorestack(L, L->top.offset); - L->tbclist.p = restorestack(L, L->tbclist.offset); - for (up = L->openupval; up != NULL; up = up->u.open.next) - up->v.p = s2v(restorestack(L, up->v.offset)); - for (ci = L->ci; ci != NULL; ci = ci->previous) { - ci->top.p = restorestack(L, ci->top.offset); - ci->func.p = restorestack(L, ci->func.offset); - if (isLua(ci)) - ci->u.l.trap = 1; /* signal to update 'trap' in 'luaV_execute' */ - } -} - - -/* some space for error handling */ -#define ERRORSTACKSIZE (LUAI_MAXSTACK + 200) - -/* -** Reallocate the stack to a new size, correcting all pointers into it. -** In ISO C, any pointer use after the pointer has been deallocated is -** undefined behavior. So, before the reallocation, all pointers are -** changed to offsets, and after the reallocation they are changed back -** to pointers. As during the reallocation the pointers are invalid, the -** reallocation cannot run emergency collections. -** -** In case of allocation error, raise an error or return false according -** to 'raiseerror'. -*/ -int luaD_reallocstack (lua_State *L, int newsize, int raiseerror) { - int oldsize = stacksize(L); - int i; - StkId newstack; - int oldgcstop = G(L)->gcstopem; - lua_assert(newsize <= LUAI_MAXSTACK || newsize == ERRORSTACKSIZE); - relstack(L); /* change pointers to offsets */ - G(L)->gcstopem = 1; /* stop emergency collection */ - newstack = luaM_reallocvector(L, L->stack.p, oldsize + EXTRA_STACK, - newsize + EXTRA_STACK, StackValue); - G(L)->gcstopem = oldgcstop; /* restore emergency collection */ - if (l_unlikely(newstack == NULL)) { /* reallocation failed? */ - correctstack(L); /* change offsets back to pointers */ - if (raiseerror) - luaM_error(L); - else return 0; /* do not raise an error */ - } - L->stack.p = newstack; - correctstack(L); /* change offsets back to pointers */ - L->stack_last.p = L->stack.p + newsize; - for (i = oldsize + EXTRA_STACK; i < newsize + EXTRA_STACK; i++) - setnilvalue(s2v(newstack + i)); /* erase new segment */ - return 1; -} - - -/* -** Try to grow the stack by at least 'n' elements. When 'raiseerror' -** is true, raises any error; otherwise, return 0 in case of errors. -*/ -int luaD_growstack (lua_State *L, int n, int raiseerror) { - int size = stacksize(L); - if (l_unlikely(size > LUAI_MAXSTACK)) { - /* if stack is larger than maximum, thread is already using the - extra space reserved for errors, that is, thread is handling - a stack error; cannot grow further than that. */ - lua_assert(stacksize(L) == ERRORSTACKSIZE); - if (raiseerror) - luaD_throw(L, LUA_ERRERR); /* error inside message handler */ - return 0; /* if not 'raiseerror', just signal it */ - } - else if (n < LUAI_MAXSTACK) { /* avoids arithmetic overflows */ - int newsize = 2 * size; /* tentative new size */ - int needed = cast_int(L->top.p - L->stack.p) + n; - if (newsize > LUAI_MAXSTACK) /* cannot cross the limit */ - newsize = LUAI_MAXSTACK; - if (newsize < needed) /* but must respect what was asked for */ - newsize = needed; - if (l_likely(newsize <= LUAI_MAXSTACK)) - return luaD_reallocstack(L, newsize, raiseerror); - } - /* else stack overflow */ - /* add extra size to be able to handle the error message */ - luaD_reallocstack(L, ERRORSTACKSIZE, raiseerror); - if (raiseerror) - luaG_runerror(L, "stack overflow"); - return 0; -} - - -/* -** Compute how much of the stack is being used, by computing the -** maximum top of all call frames in the stack and the current top. -*/ -static int stackinuse (lua_State *L) { - CallInfo *ci; - int res; - StkId lim = L->top.p; - for (ci = L->ci; ci != NULL; ci = ci->previous) { - if (lim < ci->top.p) lim = ci->top.p; - } - lua_assert(lim <= L->stack_last.p + EXTRA_STACK); - res = cast_int(lim - L->stack.p) + 1; /* part of stack in use */ - if (res < LUA_MINSTACK) - res = LUA_MINSTACK; /* ensure a minimum size */ - return res; -} - - -/* -** If stack size is more than 3 times the current use, reduce that size -** to twice the current use. (So, the final stack size is at most 2/3 the -** previous size, and half of its entries are empty.) -** As a particular case, if stack was handling a stack overflow and now -** it is not, 'max' (limited by LUAI_MAXSTACK) will be smaller than -** stacksize (equal to ERRORSTACKSIZE in this case), and so the stack -** will be reduced to a "regular" size. -*/ -void luaD_shrinkstack (lua_State *L) { - int inuse = stackinuse(L); - int max = (inuse > LUAI_MAXSTACK / 3) ? LUAI_MAXSTACK : inuse * 3; - /* if thread is currently not handling a stack overflow and its - size is larger than maximum "reasonable" size, shrink it */ - if (inuse <= LUAI_MAXSTACK && stacksize(L) > max) { - int nsize = (inuse > LUAI_MAXSTACK / 2) ? LUAI_MAXSTACK : inuse * 2; - luaD_reallocstack(L, nsize, 0); /* ok if that fails */ - } - else /* don't change stack */ - condmovestack(L,{},{}); /* (change only for debugging) */ - luaE_shrinkCI(L); /* shrink CI list */ -} - - -void luaD_inctop (lua_State *L) { - luaD_checkstack(L, 1); - L->top.p++; -} - -/* }================================================================== */ - - -/* -** Call a hook for the given event. Make sure there is a hook to be -** called. (Both 'L->hook' and 'L->hookmask', which trigger this -** function, can be changed asynchronously by signals.) -*/ -void luaD_hook (lua_State *L, int event, int line, - int ftransfer, int ntransfer) { - lua_Hook hook = L->hook; - if (hook && L->allowhook) { /* make sure there is a hook */ - int mask = CIST_HOOKED; - CallInfo *ci = L->ci; - ptrdiff_t top = savestack(L, L->top.p); /* preserve original 'top' */ - ptrdiff_t ci_top = savestack(L, ci->top.p); /* idem for 'ci->top' */ - lua_Debug ar; - ar.event = event; - ar.currentline = line; - ar.i_ci = ci; - if (ntransfer != 0) { - mask |= CIST_TRAN; /* 'ci' has transfer information */ - ci->u2.transferinfo.ftransfer = ftransfer; - ci->u2.transferinfo.ntransfer = ntransfer; - } - if (isLua(ci) && L->top.p < ci->top.p) - L->top.p = ci->top.p; /* protect entire activation register */ - luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */ - if (ci->top.p < L->top.p + LUA_MINSTACK) - ci->top.p = L->top.p + LUA_MINSTACK; - L->allowhook = 0; /* cannot call hooks inside a hook */ - ci->callstatus |= mask; - lua_unlock(L); - (*hook)(L, &ar); - lua_lock(L); - lua_assert(!L->allowhook); - L->allowhook = 1; - ci->top.p = restorestack(L, ci_top); - L->top.p = restorestack(L, top); - ci->callstatus &= ~mask; - } -} - - -/* -** Executes a call hook for Lua functions. This function is called -** whenever 'hookmask' is not zero, so it checks whether call hooks are -** active. -*/ -void luaD_hookcall (lua_State *L, CallInfo *ci) { - L->oldpc = 0; /* set 'oldpc' for new function */ - if (L->hookmask & LUA_MASKCALL) { /* is call hook on? */ - int event = (ci->callstatus & CIST_TAIL) ? LUA_HOOKTAILCALL - : LUA_HOOKCALL; - Proto *p = ci_func(ci)->p; - ci->u.l.savedpc++; /* hooks assume 'pc' is already incremented */ - luaD_hook(L, event, -1, 1, p->numparams); - ci->u.l.savedpc--; /* correct 'pc' */ - } -} - - -/* -** Executes a return hook for Lua and C functions and sets/corrects -** 'oldpc'. (Note that this correction is needed by the line hook, so it -** is done even when return hooks are off.) -*/ -static void rethook (lua_State *L, CallInfo *ci, int nres) { - if (L->hookmask & LUA_MASKRET) { /* is return hook on? */ - StkId firstres = L->top.p - nres; /* index of first result */ - int delta = 0; /* correction for vararg functions */ - int ftransfer; - if (isLua(ci)) { - Proto *p = ci_func(ci)->p; - if (p->flag & PF_ISVARARG) - delta = ci->u.l.nextraargs + p->numparams + 1; - } - ci->func.p += delta; /* if vararg, back to virtual 'func' */ - ftransfer = cast(unsigned short, firstres - ci->func.p); - luaD_hook(L, LUA_HOOKRET, -1, ftransfer, nres); /* call it */ - ci->func.p -= delta; - } - if (isLua(ci = ci->previous)) - L->oldpc = pcRel(ci->u.l.savedpc, ci_func(ci)->p); /* set 'oldpc' */ -} - - -/* -** Check whether 'func' has a '__call' metafield. If so, put it in the -** stack, below original 'func', so that 'luaD_precall' can call it. Raise -** an error if there is no '__call' metafield. -*/ -static StkId tryfuncTM (lua_State *L, StkId func) { - const TValue *tm; - StkId p; - checkstackp(L, 1, func); /* space for metamethod */ - tm = luaT_gettmbyobj(L, s2v(func), TM_CALL); /* (after previous GC) */ - if (l_unlikely(ttisnil(tm))) - luaG_callerror(L, s2v(func)); /* nothing to call */ - for (p = L->top.p; p > func; p--) /* open space for metamethod */ - setobjs2s(L, p, p-1); - L->top.p++; /* stack space pre-allocated by the caller */ - setobj2s(L, func, tm); /* metamethod is the new function to be called */ - return func; -} - - -/* -** Given 'nres' results at 'firstResult', move 'wanted' of them to 'res'. -** Handle most typical cases (zero results for commands, one result for -** expressions, multiple results for tail calls/single parameters) -** separated. -*/ -l_sinline void moveresults (lua_State *L, StkId res, int nres, int wanted) { - StkId firstresult; - int i; - switch (wanted) { /* handle typical cases separately */ - case 0: /* no values needed */ - L->top.p = res; - return; - case 1: /* one value needed */ - if (nres == 0) /* no results? */ - setnilvalue(s2v(res)); /* adjust with nil */ - else /* at least one result */ - setobjs2s(L, res, L->top.p - nres); /* move it to proper place */ - L->top.p = res + 1; - return; - case LUA_MULTRET: - wanted = nres; /* we want all results */ - break; - default: /* two/more results and/or to-be-closed variables */ - if (hastocloseCfunc(wanted)) { /* to-be-closed variables? */ - L->ci->callstatus |= CIST_CLSRET; /* in case of yields */ - L->ci->u2.nres = nres; - res = luaF_close(L, res, CLOSEKTOP, 1); - L->ci->callstatus &= ~CIST_CLSRET; - if (L->hookmask) { /* if needed, call hook after '__close's */ - ptrdiff_t savedres = savestack(L, res); - rethook(L, L->ci, nres); - res = restorestack(L, savedres); /* hook can move stack */ - } - wanted = decodeNresults(wanted); - if (wanted == LUA_MULTRET) - wanted = nres; /* we want all results */ - } - break; - } - /* generic case */ - firstresult = L->top.p - nres; /* index of first result */ - if (nres > wanted) /* extra results? */ - nres = wanted; /* don't need them */ - for (i = 0; i < nres; i++) /* move all results to correct place */ - setobjs2s(L, res + i, firstresult + i); - for (; i < wanted; i++) /* complete wanted number of results */ - setnilvalue(s2v(res + i)); - L->top.p = res + wanted; /* top points after the last result */ -} - - -/* -** Finishes a function call: calls hook if necessary, moves current -** number of results to proper place, and returns to previous call -** info. If function has to close variables, hook must be called after -** that. -*/ -void luaD_poscall (lua_State *L, CallInfo *ci, int nres) { - int wanted = ci->nresults; - if (l_unlikely(L->hookmask && !hastocloseCfunc(wanted))) - rethook(L, ci, nres); - /* move results to proper place */ - moveresults(L, ci->func.p, nres, wanted); - /* function cannot be in any of these cases when returning */ - lua_assert(!(ci->callstatus & - (CIST_HOOKED | CIST_YPCALL | CIST_FIN | CIST_TRAN | CIST_CLSRET))); - L->ci = ci->previous; /* back to caller (after closing variables) */ -} - - - -#define next_ci(L) (L->ci->next ? L->ci->next : luaE_extendCI(L)) - - -l_sinline CallInfo *prepCallInfo (lua_State *L, StkId func, int nret, - int mask, StkId top) { - CallInfo *ci = L->ci = next_ci(L); /* new frame */ - ci->func.p = func; - ci->nresults = nret; - ci->callstatus = mask; - ci->top.p = top; - return ci; -} - - -/* -** precall for C functions -*/ -l_sinline int precallC (lua_State *L, StkId func, int nresults, - lua_CFunction f) { - int n; /* number of returns */ - CallInfo *ci; - checkstackp(L, LUA_MINSTACK, func); /* ensure minimum stack size */ - L->ci = ci = prepCallInfo(L, func, nresults, CIST_C, - L->top.p + LUA_MINSTACK); - lua_assert(ci->top.p <= L->stack_last.p); - if (l_unlikely(L->hookmask & LUA_MASKCALL)) { - int narg = cast_int(L->top.p - func) - 1; - luaD_hook(L, LUA_HOOKCALL, -1, 1, narg); - } - lua_unlock(L); - n = (*f)(L); /* do the actual call */ - lua_lock(L); - api_checknelems(L, n); - luaD_poscall(L, ci, n); - return n; -} - - -/* -** Prepare a function for a tail call, building its call info on top -** of the current call info. 'narg1' is the number of arguments plus 1 -** (so that it includes the function itself). Return the number of -** results, if it was a C function, or -1 for a Lua function. -*/ -int luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, - int narg1, int delta) { - retry: - switch (ttypetag(s2v(func))) { - case LUA_VCCL: /* C closure */ - return precallC(L, func, LUA_MULTRET, clCvalue(s2v(func))->f); - case LUA_VLCF: /* light C function */ - return precallC(L, func, LUA_MULTRET, fvalue(s2v(func))); - case LUA_VLCL: { /* Lua function */ - Proto *p = clLvalue(s2v(func))->p; - int fsize = p->maxstacksize; /* frame size */ - int nfixparams = p->numparams; - int i; - checkstackp(L, fsize - delta, func); - ci->func.p -= delta; /* restore 'func' (if vararg) */ - for (i = 0; i < narg1; i++) /* move down function and arguments */ - setobjs2s(L, ci->func.p + i, func + i); - func = ci->func.p; /* moved-down function */ - for (; narg1 <= nfixparams; narg1++) - setnilvalue(s2v(func + narg1)); /* complete missing arguments */ - ci->top.p = func + 1 + fsize; /* top for new function */ - lua_assert(ci->top.p <= L->stack_last.p); - ci->u.l.savedpc = p->code; /* starting point */ - ci->callstatus |= CIST_TAIL; - L->top.p = func + narg1; /* set top */ - return -1; - } - default: { /* not a function */ - func = tryfuncTM(L, func); /* try to get '__call' metamethod */ - /* return luaD_pretailcall(L, ci, func, narg1 + 1, delta); */ - narg1++; - goto retry; /* try again */ - } - } -} - - -/* -** Prepares the call to a function (C or Lua). For C functions, also do -** the call. The function to be called is at '*func'. The arguments -** are on the stack, right after the function. Returns the CallInfo -** to be executed, if it was a Lua function. Otherwise (a C function) -** returns NULL, with all the results on the stack, starting at the -** original function position. -*/ -CallInfo *luaD_precall (lua_State *L, StkId func, int nresults) { - retry: - switch (ttypetag(s2v(func))) { - case LUA_VCCL: /* C closure */ - precallC(L, func, nresults, clCvalue(s2v(func))->f); - return NULL; - case LUA_VLCF: /* light C function */ - precallC(L, func, nresults, fvalue(s2v(func))); - return NULL; - case LUA_VLCL: { /* Lua function */ - CallInfo *ci; - Proto *p = clLvalue(s2v(func))->p; - int narg = cast_int(L->top.p - func) - 1; /* number of real arguments */ - int nfixparams = p->numparams; - int fsize = p->maxstacksize; /* frame size */ - checkstackp(L, fsize, func); - L->ci = ci = prepCallInfo(L, func, nresults, 0, func + 1 + fsize); - ci->u.l.savedpc = p->code; /* starting point */ - for (; narg < nfixparams; narg++) - setnilvalue(s2v(L->top.p++)); /* complete missing arguments */ - lua_assert(ci->top.p <= L->stack_last.p); - return ci; - } - default: { /* not a function */ - func = tryfuncTM(L, func); /* try to get '__call' metamethod */ - /* return luaD_precall(L, func, nresults); */ - goto retry; /* try again with metamethod */ - } - } -} - - -/* -** Call a function (C or Lua) through C. 'inc' can be 1 (increment -** number of recursive invocations in the C stack) or nyci (the same -** plus increment number of non-yieldable calls). -** This function can be called with some use of EXTRA_STACK, so it should -** check the stack before doing anything else. 'luaD_precall' already -** does that. -*/ -l_sinline void ccall (lua_State *L, StkId func, int nResults, l_uint32 inc) { - CallInfo *ci; - L->nCcalls += inc; - if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) { - checkstackp(L, 0, func); /* free any use of EXTRA_STACK */ - luaE_checkcstack(L); - } - if ((ci = luaD_precall(L, func, nResults)) != NULL) { /* Lua function? */ - ci->callstatus = CIST_FRESH; /* mark that it is a "fresh" execute */ - luaV_execute(L, ci); /* call it */ - } - L->nCcalls -= inc; -} - - -/* -** External interface for 'ccall' -*/ -void luaD_call (lua_State *L, StkId func, int nResults) { - ccall(L, func, nResults, 1); -} - - -/* -** Similar to 'luaD_call', but does not allow yields during the call. -*/ -void luaD_callnoyield (lua_State *L, StkId func, int nResults) { - ccall(L, func, nResults, nyci); -} - - -/* -** Finish the job of 'lua_pcallk' after it was interrupted by an yield. -** (The caller, 'finishCcall', does the final call to 'adjustresults'.) -** The main job is to complete the 'luaD_pcall' called by 'lua_pcallk'. -** If a '__close' method yields here, eventually control will be back -** to 'finishCcall' (when that '__close' method finally returns) and -** 'finishpcallk' will run again and close any still pending '__close' -** methods. Similarly, if a '__close' method errs, 'precover' calls -** 'unroll' which calls ''finishCcall' and we are back here again, to -** close any pending '__close' methods. -** Note that, up to the call to 'luaF_close', the corresponding -** 'CallInfo' is not modified, so that this repeated run works like the -** first one (except that it has at least one less '__close' to do). In -** particular, field CIST_RECST preserves the error status across these -** multiple runs, changing only if there is a new error. -*/ -static int finishpcallk (lua_State *L, CallInfo *ci) { - int status = getcistrecst(ci); /* get original status */ - if (l_likely(status == LUA_OK)) /* no error? */ - status = LUA_YIELD; /* was interrupted by an yield */ - else { /* error */ - StkId func = restorestack(L, ci->u2.funcidx); - L->allowhook = getoah(ci->callstatus); /* restore 'allowhook' */ - func = luaF_close(L, func, status, 1); /* can yield or raise an error */ - luaD_seterrorobj(L, status, func); - luaD_shrinkstack(L); /* restore stack size in case of overflow */ - setcistrecst(ci, LUA_OK); /* clear original status */ - } - ci->callstatus &= ~CIST_YPCALL; - L->errfunc = ci->u.c.old_errfunc; - /* if it is here, there were errors or yields; unlike 'lua_pcallk', - do not change status */ - return status; -} - - -/* -** Completes the execution of a C function interrupted by an yield. -** The interruption must have happened while the function was either -** closing its tbc variables in 'moveresults' or executing -** 'lua_callk'/'lua_pcallk'. In the first case, it just redoes -** 'luaD_poscall'. In the second case, the call to 'finishpcallk' -** finishes the interrupted execution of 'lua_pcallk'. After that, it -** calls the continuation of the interrupted function and finally it -** completes the job of the 'luaD_call' that called the function. In -** the call to 'adjustresults', we do not know the number of results -** of the function called by 'lua_callk'/'lua_pcallk', so we are -** conservative and use LUA_MULTRET (always adjust). -*/ -static void finishCcall (lua_State *L, CallInfo *ci) { - int n; /* actual number of results from C function */ - if (ci->callstatus & CIST_CLSRET) { /* was returning? */ - lua_assert(hastocloseCfunc(ci->nresults)); - n = ci->u2.nres; /* just redo 'luaD_poscall' */ - /* don't need to reset CIST_CLSRET, as it will be set again anyway */ - } - else { - int status = LUA_YIELD; /* default if there were no errors */ - /* must have a continuation and must be able to call it */ - lua_assert(ci->u.c.k != NULL && yieldable(L)); - if (ci->callstatus & CIST_YPCALL) /* was inside a 'lua_pcallk'? */ - status = finishpcallk(L, ci); /* finish it */ - adjustresults(L, LUA_MULTRET); /* finish 'lua_callk' */ - lua_unlock(L); - n = (*ci->u.c.k)(L, status, ci->u.c.ctx); /* call continuation */ - lua_lock(L); - api_checknelems(L, n); - } - luaD_poscall(L, ci, n); /* finish 'luaD_call' */ -} - - -/* -** Executes "full continuation" (everything in the stack) of a -** previously interrupted coroutine until the stack is empty (or another -** interruption long-jumps out of the loop). -*/ -static void unroll (lua_State *L, void *ud) { - CallInfo *ci; - UNUSED(ud); - while ((ci = L->ci) != &L->base_ci) { /* something in the stack */ - if (!isLua(ci)) /* C function? */ - finishCcall(L, ci); /* complete its execution */ - else { /* Lua function */ - luaV_finishOp(L); /* finish interrupted instruction */ - luaV_execute(L, ci); /* execute down to higher C 'boundary' */ - } - } -} - - -/* -** Try to find a suspended protected call (a "recover point") for the -** given thread. -*/ -static CallInfo *findpcall (lua_State *L) { - CallInfo *ci; - for (ci = L->ci; ci != NULL; ci = ci->previous) { /* search for a pcall */ - if (ci->callstatus & CIST_YPCALL) - return ci; - } - return NULL; /* no pending pcall */ -} - - -/* -** Signal an error in the call to 'lua_resume', not in the execution -** of the coroutine itself. (Such errors should not be handled by any -** coroutine error handler and should not kill the coroutine.) -*/ -static int resume_error (lua_State *L, const char *msg, int narg) { - api_checkpop(L, narg); - L->top.p -= narg; /* remove args from the stack */ - setsvalue2s(L, L->top.p, luaS_new(L, msg)); /* push error message */ - api_incr_top(L); - lua_unlock(L); - return LUA_ERRRUN; -} - - -/* -** Do the work for 'lua_resume' in protected mode. Most of the work -** depends on the status of the coroutine: initial state, suspended -** inside a hook, or regularly suspended (optionally with a continuation -** function), plus erroneous cases: non-suspended coroutine or dead -** coroutine. -*/ -static void resume (lua_State *L, void *ud) { - int n = *(cast(int*, ud)); /* number of arguments */ - StkId firstArg = L->top.p - n; /* first argument */ - CallInfo *ci = L->ci; - if (L->status == LUA_OK) /* starting a coroutine? */ - ccall(L, firstArg - 1, LUA_MULTRET, 0); /* just call its body */ - else { /* resuming from previous yield */ - lua_assert(L->status == LUA_YIELD); - L->status = LUA_OK; /* mark that it is running (again) */ - if (isLua(ci)) { /* yielded inside a hook? */ - /* undo increment made by 'luaG_traceexec': instruction was not - executed yet */ - lua_assert(ci->callstatus & CIST_HOOKYIELD); - ci->u.l.savedpc--; - L->top.p = firstArg; /* discard arguments */ - luaV_execute(L, ci); /* just continue running Lua code */ - } - else { /* 'common' yield */ - if (ci->u.c.k != NULL) { /* does it have a continuation function? */ - lua_unlock(L); - n = (*ci->u.c.k)(L, LUA_YIELD, ci->u.c.ctx); /* call continuation */ - lua_lock(L); - api_checknelems(L, n); - } - luaD_poscall(L, ci, n); /* finish 'luaD_call' */ - } - unroll(L, NULL); /* run continuation */ - } -} - - -/* -** Unrolls a coroutine in protected mode while there are recoverable -** errors, that is, errors inside a protected call. (Any error -** interrupts 'unroll', and this loop protects it again so it can -** continue.) Stops with a normal end (status == LUA_OK), an yield -** (status == LUA_YIELD), or an unprotected error ('findpcall' doesn't -** find a recover point). -*/ -static int precover (lua_State *L, int status) { - CallInfo *ci; - while (errorstatus(status) && (ci = findpcall(L)) != NULL) { - L->ci = ci; /* go down to recovery functions */ - setcistrecst(ci, status); /* status to finish 'pcall' */ - status = luaD_rawrunprotected(L, unroll, NULL); - } - return status; -} - - -LUA_API int lua_resume (lua_State *L, lua_State *from, int nargs, - int *nresults) { - int status; - lua_lock(L); - if (L->status == LUA_OK) { /* may be starting a coroutine */ - if (L->ci != &L->base_ci) /* not in base level? */ - return resume_error(L, "cannot resume non-suspended coroutine", nargs); - else if (L->top.p - (L->ci->func.p + 1) == nargs) /* no function? */ - return resume_error(L, "cannot resume dead coroutine", nargs); - } - else if (L->status != LUA_YIELD) /* ended with errors? */ - return resume_error(L, "cannot resume dead coroutine", nargs); - L->nCcalls = (from) ? getCcalls(from) : 0; - if (getCcalls(L) >= LUAI_MAXCCALLS) - return resume_error(L, "C stack overflow", nargs); - L->nCcalls++; - luai_userstateresume(L, nargs); - api_checkpop(L, (L->status == LUA_OK) ? nargs + 1 : nargs); - status = luaD_rawrunprotected(L, resume, &nargs); - /* continue running after recoverable errors */ - status = precover(L, status); - if (l_likely(!errorstatus(status))) - lua_assert(status == L->status); /* normal end or yield */ - else { /* unrecoverable error */ - L->status = cast_byte(status); /* mark thread as 'dead' */ - luaD_seterrorobj(L, status, L->top.p); /* push error message */ - L->ci->top.p = L->top.p; - } - *nresults = (status == LUA_YIELD) ? L->ci->u2.nyield - : cast_int(L->top.p - (L->ci->func.p + 1)); - lua_unlock(L); - return status; -} - - -LUA_API int lua_isyieldable (lua_State *L) { - return yieldable(L); -} - - -LUA_API int lua_yieldk (lua_State *L, int nresults, lua_KContext ctx, - lua_KFunction k) { - CallInfo *ci; - luai_userstateyield(L, nresults); - lua_lock(L); - ci = L->ci; - api_checkpop(L, nresults); - if (l_unlikely(!yieldable(L))) { - if (L != G(L)->mainthread) - luaG_runerror(L, "attempt to yield across a C-call boundary"); - else - luaG_runerror(L, "attempt to yield from outside a coroutine"); - } - L->status = LUA_YIELD; - ci->u2.nyield = nresults; /* save number of results */ - if (isLua(ci)) { /* inside a hook? */ - lua_assert(!isLuacode(ci)); - api_check(L, nresults == 0, "hooks cannot yield values"); - api_check(L, k == NULL, "hooks cannot continue after yielding"); - } - else { - if ((ci->u.c.k = k) != NULL) /* is there a continuation? */ - ci->u.c.ctx = ctx; /* save context */ - luaD_throw(L, LUA_YIELD); - } - lua_assert(ci->callstatus & CIST_HOOKED); /* must be inside a hook */ - lua_unlock(L); - return 0; /* return to 'luaD_hook' */ -} - - -/* -** Auxiliary structure to call 'luaF_close' in protected mode. -*/ -struct CloseP { - StkId level; - int status; -}; - - -/* -** Auxiliary function to call 'luaF_close' in protected mode. -*/ -static void closepaux (lua_State *L, void *ud) { - struct CloseP *pcl = cast(struct CloseP *, ud); - luaF_close(L, pcl->level, pcl->status, 0); -} - - -/* -** Calls 'luaF_close' in protected mode. Return the original status -** or, in case of errors, the new status. -*/ -int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status) { - CallInfo *old_ci = L->ci; - lu_byte old_allowhooks = L->allowhook; - for (;;) { /* keep closing upvalues until no more errors */ - struct CloseP pcl; - pcl.level = restorestack(L, level); pcl.status = status; - status = luaD_rawrunprotected(L, &closepaux, &pcl); - if (l_likely(status == LUA_OK)) /* no more errors? */ - return pcl.status; - else { /* an error occurred; restore saved state and repeat */ - L->ci = old_ci; - L->allowhook = old_allowhooks; - } - } -} - - -/* -** Call the C function 'func' in protected mode, restoring basic -** thread information ('allowhook', etc.) and in particular -** its stack level in case of errors. -*/ -int luaD_pcall (lua_State *L, Pfunc func, void *u, - ptrdiff_t old_top, ptrdiff_t ef) { - int status; - CallInfo *old_ci = L->ci; - lu_byte old_allowhooks = L->allowhook; - ptrdiff_t old_errfunc = L->errfunc; - L->errfunc = ef; - status = luaD_rawrunprotected(L, func, u); - if (l_unlikely(status != LUA_OK)) { /* an error occurred? */ - L->ci = old_ci; - L->allowhook = old_allowhooks; - status = luaD_closeprotected(L, old_top, status); - luaD_seterrorobj(L, status, restorestack(L, old_top)); - luaD_shrinkstack(L); /* restore stack size in case of overflow */ - } - L->errfunc = old_errfunc; - return status; -} - - - -/* -** Execute a protected parser. -*/ -struct SParser { /* data to 'f_parser' */ - ZIO *z; - Mbuffer buff; /* dynamic structure used by the scanner */ - Dyndata dyd; /* dynamic structures used by the parser */ - const char *mode; - const char *name; -}; - - -static void checkmode (lua_State *L, const char *mode, const char *x) { - if (strchr(mode, x[0]) == NULL) { - luaO_pushfstring(L, - "attempt to load a %s chunk (mode is '%s')", x, mode); - luaD_throw(L, LUA_ERRSYNTAX); - } -} - - -static void f_parser (lua_State *L, void *ud) { - LClosure *cl; - struct SParser *p = cast(struct SParser *, ud); - const char *mode = p->mode ? p->mode : "bt"; - int c = zgetc(p->z); /* read first character */ - if (c == LUA_SIGNATURE[0]) { - int fixed = 0; - if (strchr(mode, 'B') != NULL) - fixed = 1; - else - checkmode(L, mode, "binary"); - cl = luaU_undump(L, p->z, p->name, fixed); - } - else { - checkmode(L, mode, "text"); - cl = luaY_parser(L, p->z, &p->buff, &p->dyd, p->name, c); - } - lua_assert(cl->nupvalues == cl->p->sizeupvalues); - luaF_initupvals(L, cl); -} - - -int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, - const char *mode) { - struct SParser p; - int status; - incnny(L); /* cannot yield during parsing */ - p.z = z; p.name = name; p.mode = mode; - p.dyd.actvar.arr = NULL; p.dyd.actvar.size = 0; - p.dyd.gt.arr = NULL; p.dyd.gt.size = 0; - p.dyd.label.arr = NULL; p.dyd.label.size = 0; - luaZ_initbuffer(L, &p.buff); - status = luaD_pcall(L, f_parser, &p, savestack(L, L->top.p), L->errfunc); - luaZ_freebuffer(L, &p.buff); - luaM_freearray(L, p.dyd.actvar.arr, p.dyd.actvar.size); - luaM_freearray(L, p.dyd.gt.arr, p.dyd.gt.size); - luaM_freearray(L, p.dyd.label.arr, p.dyd.label.size); - decnny(L); - return status; -} - - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldo.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldo.h deleted file mode 100644 index 4bc7503..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldo.h +++ /dev/null @@ -1,75 +0,0 @@ -/* -** $Id: ldo.h $ -** Stack and Call structure of Lua -** See Copyright Notice in lua.h -*/ - -#ifndef ldo_h -#define ldo_h - - -#include "llimits.h" -#include "lobject.h" -#include "lstate.h" -#include "lzio.h" - - -/* -** Macro to check stack size and grow stack if needed. Parameters -** 'pre'/'pos' allow the macro to preserve a pointer into the -** stack across reallocations, doing the work only when needed. -** It also allows the running of one GC step when the stack is -** reallocated. -** 'condmovestack' is used in heavy tests to force a stack reallocation -** at every check. -*/ -#define luaD_checkstackaux(L,n,pre,pos) \ - if (l_unlikely(L->stack_last.p - L->top.p <= (n))) \ - { pre; luaD_growstack(L, n, 1); pos; } \ - else { condmovestack(L,pre,pos); } - -/* In general, 'pre'/'pos' are empty (nothing to save) */ -#define luaD_checkstack(L,n) luaD_checkstackaux(L,n,(void)0,(void)0) - - - -#define savestack(L,pt) (cast_charp(pt) - cast_charp(L->stack.p)) -#define restorestack(L,n) cast(StkId, cast_charp(L->stack.p) + (n)) - - -/* macro to check stack size, preserving 'p' */ -#define checkstackp(L,n,p) \ - luaD_checkstackaux(L, n, \ - ptrdiff_t t__ = savestack(L, p), /* save 'p' */ \ - p = restorestack(L, t__)) /* 'pos' part: restore 'p' */ - - - -/* type of protected functions, to be ran by 'runprotected' */ -typedef void (*Pfunc) (lua_State *L, void *ud); - -LUAI_FUNC void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop); -LUAI_FUNC int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, - const char *mode); -LUAI_FUNC void luaD_hook (lua_State *L, int event, int line, - int fTransfer, int nTransfer); -LUAI_FUNC void luaD_hookcall (lua_State *L, CallInfo *ci); -LUAI_FUNC int luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, - int narg1, int delta); -LUAI_FUNC CallInfo *luaD_precall (lua_State *L, StkId func, int nResults); -LUAI_FUNC void luaD_call (lua_State *L, StkId func, int nResults); -LUAI_FUNC void luaD_callnoyield (lua_State *L, StkId func, int nResults); -LUAI_FUNC int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status); -LUAI_FUNC int luaD_pcall (lua_State *L, Pfunc func, void *u, - ptrdiff_t oldtop, ptrdiff_t ef); -LUAI_FUNC void luaD_poscall (lua_State *L, CallInfo *ci, int nres); -LUAI_FUNC int luaD_reallocstack (lua_State *L, int newsize, int raiseerror); -LUAI_FUNC int luaD_growstack (lua_State *L, int n, int raiseerror); -LUAI_FUNC void luaD_shrinkstack (lua_State *L); -LUAI_FUNC void luaD_inctop (lua_State *L); - -LUAI_FUNC l_noret luaD_throw (lua_State *L, int errcode); -LUAI_FUNC int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud); - -#endif - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldump.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldump.c deleted file mode 100644 index ca708a4..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ldump.c +++ /dev/null @@ -1,290 +0,0 @@ -/* -** $Id: ldump.c $ -** save precompiled Lua chunks -** See Copyright Notice in lua.h -*/ - -#define ldump_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "lgc.h" -#include "lobject.h" -#include "lstate.h" -#include "ltable.h" -#include "lundump.h" - - -typedef struct { - lua_State *L; - lua_Writer writer; - void *data; - lu_mem offset; /* current position relative to beginning of dump */ - int strip; - int status; - Table *h; /* table to track saved strings */ - lua_Integer nstr; /* counter for counting saved strings */ -} DumpState; - - -/* -** All high-level dumps go through dumpVector; you can change it to -** change the endianness of the result -*/ -#define dumpVector(D,v,n) dumpBlock(D,v,(n)*sizeof((v)[0])) - -#define dumpLiteral(D, s) dumpBlock(D,s,sizeof(s) - sizeof(char)) - - -/* -** Dump the block of memory pointed by 'b' with given 'size'. -** 'b' should not be NULL, except for the last call signaling the end -** of the dump. -*/ -static void dumpBlock (DumpState *D, const void *b, size_t size) { - if (D->status == 0) { /* do not write anything after an error */ - lua_unlock(D->L); - D->status = (*D->writer)(D->L, b, size, D->data); - lua_lock(D->L); - D->offset += size; - } -} - - -/* -** Dump enough zeros to ensure that current position is a multiple of -** 'align'. -*/ -static void dumpAlign (DumpState *D, int align) { - int padding = align - (D->offset % align); - if (padding < align) { /* padding == align means no padding */ - static lua_Integer paddingContent = 0; - lua_assert(cast_uint(align) <= sizeof(lua_Integer)); - dumpBlock(D, &paddingContent, padding); - } - lua_assert(D->offset % align == 0); -} - - -#define dumpVar(D,x) dumpVector(D,&x,1) - - -static void dumpByte (DumpState *D, int y) { - lu_byte x = (lu_byte)y; - dumpVar(D, x); -} - - -/* -** size for 'dumpVarint' buffer: each byte can store up to 7 bits. -** (The "+6" rounds up the division.) -*/ -#define DIBS ((sizeof(size_t) * CHAR_BIT + 6) / 7) - -/* -** Dumps an unsigned integer using the MSB Varint encoding -*/ -static void dumpVarint (DumpState *D, size_t x) { - lu_byte buff[DIBS]; - int n = 1; - buff[DIBS - 1] = x & 0x7f; /* fill least-significant byte */ - while ((x >>= 7) != 0) /* fill other bytes in reverse order */ - buff[DIBS - (++n)] = (x & 0x7f) | 0x80; - dumpVector(D, buff + DIBS - n, n); -} - - -static void dumpSize (DumpState *D, size_t sz) { - dumpVarint(D, sz); -} - -static void dumpInt (DumpState *D, int x) { - lua_assert(x >= 0); - dumpVarint(D, cast(size_t, x)); -} - - -static void dumpNumber (DumpState *D, lua_Number x) { - dumpVar(D, x); -} - - -static void dumpInteger (DumpState *D, lua_Integer x) { - dumpVar(D, x); -} - - -/* -** Dump a String. First dump its "size": size==0 means NULL; -** size==1 is followed by an index and means "reuse saved string with -** that index"; size>=2 is followed by the string contents with real -** size==size-2 and means that string, which will be saved with -** the next available index. -*/ -static void dumpString (DumpState *D, TString *ts) { - if (ts == NULL) - dumpSize(D, 0); - else { - TValue idx; - int tag = luaH_getstr(D->h, ts, &idx); - if (!tagisempty(tag)) { /* string already saved? */ - dumpSize(D, 1); /* reuse a saved string */ - dumpSize(D, cast_sizet(ivalue(&idx))); /* index of saved string */ - } - else { /* must write and save the string */ - TValue key, value; /* to save the string in the hash */ - size_t size; - const char *s = getlstr(ts, size); - dumpSize(D, size + 2); - dumpVector(D, s, size + 1); /* include ending '\0' */ - D->nstr++; /* one more saved string */ - setsvalue(D->L, &key, ts); /* the string is the key */ - setivalue(&value, D->nstr); /* its index is the value */ - luaH_set(D->L, D->h, &key, &value); /* h[ts] = nstr */ - /* integer value does not need barrier */ - } - } -} - - -static void dumpCode (DumpState *D, const Proto *f) { - dumpInt(D, f->sizecode); - dumpAlign(D, sizeof(f->code[0])); - lua_assert(f->code != NULL); - dumpVector(D, f->code, f->sizecode); -} - - -static void dumpFunction (DumpState *D, const Proto *f); - -static void dumpConstants (DumpState *D, const Proto *f) { - int i; - int n = f->sizek; - dumpInt(D, n); - for (i = 0; i < n; i++) { - const TValue *o = &f->k[i]; - int tt = ttypetag(o); - dumpByte(D, tt); - switch (tt) { - case LUA_VNUMFLT: - dumpNumber(D, fltvalue(o)); - break; - case LUA_VNUMINT: - dumpInteger(D, ivalue(o)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - dumpString(D, tsvalue(o)); - break; - default: - lua_assert(tt == LUA_VNIL || tt == LUA_VFALSE || tt == LUA_VTRUE); - } - } -} - - -static void dumpProtos (DumpState *D, const Proto *f) { - int i; - int n = f->sizep; - dumpInt(D, n); - for (i = 0; i < n; i++) - dumpFunction(D, f->p[i]); -} - - -static void dumpUpvalues (DumpState *D, const Proto *f) { - int i, n = f->sizeupvalues; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpByte(D, f->upvalues[i].instack); - dumpByte(D, f->upvalues[i].idx); - dumpByte(D, f->upvalues[i].kind); - } -} - - -static void dumpDebug (DumpState *D, const Proto *f) { - int i, n; - n = (D->strip) ? 0 : f->sizelineinfo; - dumpInt(D, n); - if (f->lineinfo != NULL) - dumpVector(D, f->lineinfo, n); - n = (D->strip) ? 0 : f->sizeabslineinfo; - dumpInt(D, n); - if (n > 0) { - /* 'abslineinfo' is an array of structures of int's */ - dumpAlign(D, sizeof(int)); - dumpVector(D, f->abslineinfo, n); - } - n = (D->strip) ? 0 : f->sizelocvars; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpString(D, f->locvars[i].varname); - dumpInt(D, f->locvars[i].startpc); - dumpInt(D, f->locvars[i].endpc); - } - n = (D->strip) ? 0 : f->sizeupvalues; - dumpInt(D, n); - for (i = 0; i < n; i++) - dumpString(D, f->upvalues[i].name); -} - - -static void dumpFunction (DumpState *D, const Proto *f) { - dumpInt(D, f->linedefined); - dumpInt(D, f->lastlinedefined); - dumpByte(D, f->numparams); - dumpByte(D, f->flag); - dumpByte(D, f->maxstacksize); - dumpCode(D, f); - dumpConstants(D, f); - dumpUpvalues(D, f); - dumpProtos(D, f); - dumpString(D, D->strip ? NULL : f->source); - dumpDebug(D, f); -} - - -static void dumpHeader (DumpState *D) { - dumpLiteral(D, LUA_SIGNATURE); - dumpByte(D, LUAC_VERSION); - dumpByte(D, LUAC_FORMAT); - dumpLiteral(D, LUAC_DATA); - dumpByte(D, sizeof(Instruction)); - dumpByte(D, sizeof(lua_Integer)); - dumpByte(D, sizeof(lua_Number)); - dumpInteger(D, LUAC_INT); - dumpNumber(D, LUAC_NUM); -} - - -/* -** dump Lua function as precompiled chunk -*/ -int luaU_dump (lua_State *L, const Proto *f, lua_Writer w, void *data, - int strip) { - DumpState D; - D.h = luaH_new(L); /* aux. table to keep strings already dumped */ - sethvalue2s(L, L->top.p, D.h); /* anchor it */ - L->top.p++; - D.L = L; - D.writer = w; - D.offset = 0; - D.data = data; - D.strip = strip; - D.status = 0; - D.nstr = 0; - dumpHeader(&D); - dumpByte(&D, f->sizeupvalues); - dumpFunction(&D, f); - dumpBlock(&D, NULL, 0); /* signal end of dump */ - return D.status; -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lfunc.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lfunc.c deleted file mode 100644 index d63d05f..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lfunc.c +++ /dev/null @@ -1,296 +0,0 @@ -/* -** $Id: lfunc.c $ -** Auxiliary functions to manipulate prototypes and closures -** See Copyright Notice in lua.h -*/ - -#define lfunc_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" - - - -CClosure *luaF_newCclosure (lua_State *L, int nupvals) { - GCObject *o = luaC_newobj(L, LUA_VCCL, sizeCclosure(nupvals)); - CClosure *c = gco2ccl(o); - c->nupvalues = cast_byte(nupvals); - return c; -} - - -LClosure *luaF_newLclosure (lua_State *L, int nupvals) { - GCObject *o = luaC_newobj(L, LUA_VLCL, sizeLclosure(nupvals)); - LClosure *c = gco2lcl(o); - c->p = NULL; - c->nupvalues = cast_byte(nupvals); - while (nupvals--) c->upvals[nupvals] = NULL; - return c; -} - - -/* -** fill a closure with new closed upvalues -*/ -void luaF_initupvals (lua_State *L, LClosure *cl) { - int i; - for (i = 0; i < cl->nupvalues; i++) { - GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); - UpVal *uv = gco2upv(o); - uv->v.p = &uv->u.value; /* make it closed */ - setnilvalue(uv->v.p); - cl->upvals[i] = uv; - luaC_objbarrier(L, cl, uv); - } -} - - -/* -** Create a new upvalue at the given level, and link it to the list of -** open upvalues of 'L' after entry 'prev'. -**/ -static UpVal *newupval (lua_State *L, StkId level, UpVal **prev) { - GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); - UpVal *uv = gco2upv(o); - UpVal *next = *prev; - uv->v.p = s2v(level); /* current value lives in the stack */ - uv->u.open.next = next; /* link it to list of open upvalues */ - uv->u.open.previous = prev; - if (next) - next->u.open.previous = &uv->u.open.next; - *prev = uv; - if (!isintwups(L)) { /* thread not in list of threads with upvalues? */ - L->twups = G(L)->twups; /* link it to the list */ - G(L)->twups = L; - } - return uv; -} - - -/* -** Find and reuse, or create if it does not exist, an upvalue -** at the given level. -*/ -UpVal *luaF_findupval (lua_State *L, StkId level) { - UpVal **pp = &L->openupval; - UpVal *p; - lua_assert(isintwups(L) || L->openupval == NULL); - while ((p = *pp) != NULL && uplevel(p) >= level) { /* search for it */ - lua_assert(!isdead(G(L), p)); - if (uplevel(p) == level) /* corresponding upvalue? */ - return p; /* return it */ - pp = &p->u.open.next; - } - /* not found: create a new upvalue after 'pp' */ - return newupval(L, level, pp); -} - - -/* -** Call closing method for object 'obj' with error message 'err'. The -** boolean 'yy' controls whether the call is yieldable. -** (This function assumes EXTRA_STACK.) -*/ -static void callclosemethod (lua_State *L, TValue *obj, TValue *err, int yy) { - StkId top = L->top.p; - const TValue *tm = luaT_gettmbyobj(L, obj, TM_CLOSE); - setobj2s(L, top, tm); /* will call metamethod... */ - setobj2s(L, top + 1, obj); /* with 'self' as the 1st argument */ - setobj2s(L, top + 2, err); /* and error msg. as 2nd argument */ - L->top.p = top + 3; /* add function and arguments */ - if (yy) - luaD_call(L, top, 0); - else - luaD_callnoyield(L, top, 0); -} - - -/* -** Check whether object at given level has a close metamethod and raise -** an error if not. -*/ -static void checkclosemth (lua_State *L, StkId level) { - const TValue *tm = luaT_gettmbyobj(L, s2v(level), TM_CLOSE); - if (ttisnil(tm)) { /* no metamethod? */ - int idx = cast_int(level - L->ci->func.p); /* variable index */ - const char *vname = luaG_findlocal(L, L->ci, idx, NULL); - if (vname == NULL) vname = "?"; - luaG_runerror(L, "variable '%s' got a non-closable value", vname); - } -} - - -/* -** Prepare and call a closing method. -** If status is CLOSEKTOP, the call to the closing method will be pushed -** at the top of the stack. Otherwise, values can be pushed right after -** the 'level' of the upvalue being closed, as everything after that -** won't be used again. -*/ -static void prepcallclosemth (lua_State *L, StkId level, int status, int yy) { - TValue *uv = s2v(level); /* value being closed */ - TValue *errobj; - if (status == CLOSEKTOP) - errobj = &G(L)->nilvalue; /* error object is nil */ - else { /* 'luaD_seterrorobj' will set top to level + 2 */ - errobj = s2v(level + 1); /* error object goes after 'uv' */ - luaD_seterrorobj(L, status, level + 1); /* set error object */ - } - callclosemethod(L, uv, errobj, yy); -} - - -/* -** Maximum value for deltas in 'tbclist', dependent on the type -** of delta. (This macro assumes that an 'L' is in scope where it -** is used.) -*/ -#define MAXDELTA \ - ((256ul << ((sizeof(L->stack.p->tbclist.delta) - 1) * 8)) - 1) - - -/* -** Insert a variable in the list of to-be-closed variables. -*/ -void luaF_newtbcupval (lua_State *L, StkId level) { - lua_assert(level > L->tbclist.p); - if (l_isfalse(s2v(level))) - return; /* false doesn't need to be closed */ - checkclosemth(L, level); /* value must have a close method */ - while (cast_uint(level - L->tbclist.p) > MAXDELTA) { - L->tbclist.p += MAXDELTA; /* create a dummy node at maximum delta */ - L->tbclist.p->tbclist.delta = 0; - } - level->tbclist.delta = cast(unsigned short, level - L->tbclist.p); - L->tbclist.p = level; -} - - -void luaF_unlinkupval (UpVal *uv) { - lua_assert(upisopen(uv)); - *uv->u.open.previous = uv->u.open.next; - if (uv->u.open.next) - uv->u.open.next->u.open.previous = uv->u.open.previous; -} - - -/* -** Close all upvalues up to the given stack level. -*/ -void luaF_closeupval (lua_State *L, StkId level) { - UpVal *uv; - StkId upl; /* stack index pointed by 'uv' */ - while ((uv = L->openupval) != NULL && (upl = uplevel(uv)) >= level) { - TValue *slot = &uv->u.value; /* new position for value */ - lua_assert(uplevel(uv) < L->top.p); - luaF_unlinkupval(uv); /* remove upvalue from 'openupval' list */ - setobj(L, slot, uv->v.p); /* move value to upvalue slot */ - uv->v.p = slot; /* now current value lives here */ - if (!iswhite(uv)) { /* neither white nor dead? */ - nw2black(uv); /* closed upvalues cannot be gray */ - luaC_barrier(L, uv, slot); - } - } -} - - -/* -** Remove first element from the tbclist plus its dummy nodes. -*/ -static void poptbclist (lua_State *L) { - StkId tbc = L->tbclist.p; - lua_assert(tbc->tbclist.delta > 0); /* first element cannot be dummy */ - tbc -= tbc->tbclist.delta; - while (tbc > L->stack.p && tbc->tbclist.delta == 0) - tbc -= MAXDELTA; /* remove dummy nodes */ - L->tbclist.p = tbc; -} - - -/* -** Close all upvalues and to-be-closed variables up to the given stack -** level. Return restored 'level'. -*/ -StkId luaF_close (lua_State *L, StkId level, int status, int yy) { - ptrdiff_t levelrel = savestack(L, level); - luaF_closeupval(L, level); /* first, close the upvalues */ - while (L->tbclist.p >= level) { /* traverse tbc's down to that level */ - StkId tbc = L->tbclist.p; /* get variable index */ - poptbclist(L); /* remove it from list */ - prepcallclosemth(L, tbc, status, yy); /* close variable */ - level = restorestack(L, levelrel); - } - return level; -} - - -Proto *luaF_newproto (lua_State *L) { - GCObject *o = luaC_newobj(L, LUA_VPROTO, sizeof(Proto)); - Proto *f = gco2p(o); - f->k = NULL; - f->sizek = 0; - f->p = NULL; - f->sizep = 0; - f->code = NULL; - f->sizecode = 0; - f->lineinfo = NULL; - f->sizelineinfo = 0; - f->abslineinfo = NULL; - f->sizeabslineinfo = 0; - f->upvalues = NULL; - f->sizeupvalues = 0; - f->numparams = 0; - f->flag = 0; - f->maxstacksize = 0; - f->locvars = NULL; - f->sizelocvars = 0; - f->linedefined = 0; - f->lastlinedefined = 0; - f->source = NULL; - return f; -} - - -void luaF_freeproto (lua_State *L, Proto *f) { - if (!(f->flag & PF_FIXED)) { - luaM_freearray(L, f->code, f->sizecode); - luaM_freearray(L, f->lineinfo, f->sizelineinfo); - luaM_freearray(L, f->abslineinfo, f->sizeabslineinfo); - } - luaM_freearray(L, f->p, f->sizep); - luaM_freearray(L, f->k, f->sizek); - luaM_freearray(L, f->locvars, f->sizelocvars); - luaM_freearray(L, f->upvalues, f->sizeupvalues); - luaM_free(L, f); -} - - -/* -** Look for n-th local variable at line 'line' in function 'func'. -** Returns NULL if not found. -*/ -const char *luaF_getlocalname (const Proto *f, int local_number, int pc) { - int i; - for (i = 0; isizelocvars && f->locvars[i].startpc <= pc; i++) { - if (pc < f->locvars[i].endpc) { /* is variable active? */ - local_number--; - if (local_number == 0) - return getstr(f->locvars[i].varname); - } - } - return NULL; /* not found */ -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lfunc.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lfunc.h deleted file mode 100644 index 3be265e..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lfunc.h +++ /dev/null @@ -1,64 +0,0 @@ -/* -** $Id: lfunc.h $ -** Auxiliary functions to manipulate prototypes and closures -** See Copyright Notice in lua.h -*/ - -#ifndef lfunc_h -#define lfunc_h - - -#include "lobject.h" - - -#define sizeCclosure(n) (cast_int(offsetof(CClosure, upvalue)) + \ - cast_int(sizeof(TValue)) * (n)) - -#define sizeLclosure(n) (cast_int(offsetof(LClosure, upvals)) + \ - cast_int(sizeof(TValue *)) * (n)) - - -/* test whether thread is in 'twups' list */ -#define isintwups(L) (L->twups != L) - - -/* -** maximum number of upvalues in a closure (both C and Lua). (Value -** must fit in a VM register.) -*/ -#define MAXUPVAL 255 - - -#define upisopen(up) ((up)->v.p != &(up)->u.value) - - -#define uplevel(up) check_exp(upisopen(up), cast(StkId, (up)->v.p)) - - -/* -** maximum number of misses before giving up the cache of closures -** in prototypes -*/ -#define MAXMISS 10 - - - -/* special status to close upvalues preserving the top of the stack */ -#define CLOSEKTOP (-1) - - -LUAI_FUNC Proto *luaF_newproto (lua_State *L); -LUAI_FUNC CClosure *luaF_newCclosure (lua_State *L, int nupvals); -LUAI_FUNC LClosure *luaF_newLclosure (lua_State *L, int nupvals); -LUAI_FUNC void luaF_initupvals (lua_State *L, LClosure *cl); -LUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_newtbcupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_closeupval (lua_State *L, StkId level); -LUAI_FUNC StkId luaF_close (lua_State *L, StkId level, int status, int yy); -LUAI_FUNC void luaF_unlinkupval (UpVal *uv); -LUAI_FUNC void luaF_freeproto (lua_State *L, Proto *f); -LUAI_FUNC const char *luaF_getlocalname (const Proto *func, int local_number, - int pc); - - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lgc.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lgc.c deleted file mode 100644 index 700390d..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lgc.c +++ /dev/null @@ -1,1724 +0,0 @@ -/* -** $Id: lgc.c $ -** Garbage Collector -** See Copyright Notice in lua.h -*/ - -#define lgc_c -#define LUA_CORE - -#include "lprefix.h" - -#include - - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "llex.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" - - -/* -** Number of fixed (luaC_fix) objects in a Lua state: metafield names, -** plus reserved words, plus "_ENV", plus the memory-error message. -*/ -#define NFIXED (TM_N + NUM_RESERVED + 2) - - -/* -** Maximum number of elements to sweep in each single step. -** (Large enough to dissipate fixed overheads but small enough -** to allow small steps for the collector.) -*/ -#define GCSWEEPMAX 20 - - -/* mask with all color bits */ -#define maskcolors (bitmask(BLACKBIT) | WHITEBITS) - -/* mask with all GC bits */ -#define maskgcbits (maskcolors | AGEBITS) - - -/* macro to erase all color bits then set only the current white bit */ -#define makewhite(g,x) \ - (x->marked = cast_byte((x->marked & ~maskcolors) | luaC_white(g))) - -/* make an object gray (neither white nor black) */ -#define set2gray(x) resetbits(x->marked, maskcolors) - - -/* make an object black (coming from any color) */ -#define set2black(x) \ - (x->marked = cast_byte((x->marked & ~WHITEBITS) | bitmask(BLACKBIT))) - - -#define valiswhite(x) (iscollectable(x) && iswhite(gcvalue(x))) - -#define keyiswhite(n) (keyiscollectable(n) && iswhite(gckey(n))) - - -/* -** Protected access to objects in values -*/ -#define gcvalueN(o) (iscollectable(o) ? gcvalue(o) : NULL) - - -/* -** Access to collectable objects in array part of tables -*/ -#define gcvalarr(t,i) \ - ((*getArrTag(t,i) & BIT_ISCOLLECTABLE) ? getArrVal(t,i)->gc : NULL) - - -#define markvalue(g,o) { checkliveness(g->mainthread,o); \ - if (valiswhite(o)) reallymarkobject(g,gcvalue(o)); } - -#define markkey(g, n) { if keyiswhite(n) reallymarkobject(g,gckey(n)); } - -#define markobject(g,t) { if (iswhite(t)) reallymarkobject(g, obj2gco(t)); } - -/* -** mark an object that can be NULL (either because it is really optional, -** or it was stripped as debug info, or inside an uncompleted structure) -*/ -#define markobjectN(g,t) { if (t) markobject(g,t); } - - -static void reallymarkobject (global_State *g, GCObject *o); -static l_obj atomic (lua_State *L); -static void entersweep (lua_State *L); - - -/* -** {====================================================== -** Generic functions -** ======================================================= -*/ - - -/* -** one after last element in a hash array -*/ -#define gnodelast(h) gnode(h, cast_sizet(sizenode(h))) - - -static GCObject **getgclist (GCObject *o) { - switch (o->tt) { - case LUA_VTABLE: return &gco2t(o)->gclist; - case LUA_VLCL: return &gco2lcl(o)->gclist; - case LUA_VCCL: return &gco2ccl(o)->gclist; - case LUA_VTHREAD: return &gco2th(o)->gclist; - case LUA_VPROTO: return &gco2p(o)->gclist; - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - lua_assert(u->nuvalue > 0); - return &u->gclist; - } - default: lua_assert(0); return 0; - } -} - - -/* -** Link a collectable object 'o' with a known type into the list 'p'. -** (Must be a macro to access the 'gclist' field in different types.) -*/ -#define linkgclist(o,p) linkgclist_(obj2gco(o), &(o)->gclist, &(p)) - -static void linkgclist_ (GCObject *o, GCObject **pnext, GCObject **list) { - lua_assert(!isgray(o)); /* cannot be in a gray list */ - *pnext = *list; - *list = o; - set2gray(o); /* now it is */ -} - - -/* -** Link a generic collectable object 'o' into the list 'p'. -*/ -#define linkobjgclist(o,p) linkgclist_(obj2gco(o), getgclist(o), &(p)) - - - -/* -** Clear keys for empty entries in tables. If entry is empty, mark its -** entry as dead. This allows the collection of the key, but keeps its -** entry in the table: its removal could break a chain and could break -** a table traversal. Other places never manipulate dead keys, because -** its associated empty value is enough to signal that the entry is -** logically empty. -*/ -static void clearkey (Node *n) { - lua_assert(isempty(gval(n))); - if (keyiscollectable(n)) - setdeadkey(n); /* unused key; remove it */ -} - - -/* -** tells whether a key or value can be cleared from a weak -** table. Non-collectable objects are never removed from weak -** tables. Strings behave as 'values', so are never removed too. for -** other objects: if really collected, cannot keep them; for objects -** being finalized, keep them in keys, but not in values -*/ -static int iscleared (global_State *g, const GCObject *o) { - if (o == NULL) return 0; /* non-collectable value */ - else if (novariant(o->tt) == LUA_TSTRING) { - markobject(g, o); /* strings are 'values', so are never weak */ - return 0; - } - else return iswhite(o); -} - - -/* -** Barrier that moves collector forward, that is, marks the white object -** 'v' being pointed by the black object 'o'. In the generational -** mode, 'v' must also become old, if 'o' is old; however, it cannot -** be changed directly to OLD, because it may still point to non-old -** objects. So, it is marked as OLD0. In the next cycle it will become -** OLD1, and in the next it will finally become OLD (regular old). By -** then, any object it points to will also be old. If called in the -** incremental sweep phase, it clears the black object to white (sweep -** it) to avoid other barrier calls for this same object. (That cannot -** be done is generational mode, as its sweep does not distinguish -** whites from deads.) -*/ -void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v) { - global_State *g = G(L); - lua_assert(isblack(o) && iswhite(v) && !isdead(g, v) && !isdead(g, o)); - if (keepinvariant(g)) { /* must keep invariant? */ - reallymarkobject(g, v); /* restore invariant */ - if (isold(o)) { - lua_assert(!isold(v)); /* white object could not be old */ - setage(v, G_OLD0); /* restore generational invariant */ - } - } - else { /* sweep phase */ - lua_assert(issweepphase(g)); - if (g->gckind != KGC_GENMINOR) /* incremental mode? */ - makewhite(g, o); /* mark 'o' as white to avoid other barriers */ - } -} - - -/* -** barrier that moves collector backward, that is, mark the black object -** pointing to a white object as gray again. -*/ -void luaC_barrierback_ (lua_State *L, GCObject *o) { - global_State *g = G(L); - lua_assert(isblack(o) && !isdead(g, o)); - lua_assert((g->gckind != KGC_GENMINOR) - || (isold(o) && getage(o) != G_TOUCHED1)); - if (getage(o) == G_TOUCHED2) /* already in gray list? */ - set2gray(o); /* make it gray to become touched1 */ - else /* link it in 'grayagain' and paint it gray */ - linkobjgclist(o, g->grayagain); - if (isold(o)) /* generational mode? */ - setage(o, G_TOUCHED1); /* touched in current cycle */ -} - - -void luaC_fix (lua_State *L, GCObject *o) { - global_State *g = G(L); - lua_assert(g->allgc == o); /* object must be 1st in 'allgc' list! */ - set2gray(o); /* they will be gray forever */ - setage(o, G_OLD); /* and old forever */ - g->allgc = o->next; /* remove object from 'allgc' list */ - o->next = g->fixedgc; /* link it to 'fixedgc' list */ - g->fixedgc = o; -} - - -/* -** create a new collectable object (with given type, size, and offset) -** and link it to 'allgc' list. -*/ -GCObject *luaC_newobjdt (lua_State *L, int tt, size_t sz, size_t offset) { - global_State *g = G(L); - char *p = cast_charp(luaM_newobject(L, novariant(tt), sz)); - GCObject *o = cast(GCObject *, p + offset); - g->GCdebt--; - o->marked = luaC_white(g); - o->tt = tt; - o->next = g->allgc; - g->allgc = o; - return o; -} - - -/* -** create a new collectable object with no offset. -*/ -GCObject *luaC_newobj (lua_State *L, int tt, size_t sz) { - return luaC_newobjdt(L, tt, sz, 0); -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Mark functions -** ======================================================= -*/ - - -/* -** Mark an object. Userdata with no user values, strings, and closed -** upvalues are visited and turned black here. Open upvalues are -** already indirectly linked through their respective threads in the -** 'twups' list, so they don't go to the gray list; nevertheless, they -** are kept gray to avoid barriers, as their values will be revisited -** by the thread or by 'remarkupvals'. Other objects are added to the -** gray list to be visited (and turned black) later. Both userdata and -** upvalues can call this function recursively, but this recursion goes -** for at most two levels: An upvalue cannot refer to another upvalue -** (only closures can), and a userdata's metatable must be a table. -*/ -static void reallymarkobject (global_State *g, GCObject *o) { - g->marked++; - switch (o->tt) { - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - set2black(o); /* nothing to visit */ - break; - } - case LUA_VUPVAL: { - UpVal *uv = gco2upv(o); - if (upisopen(uv)) - set2gray(uv); /* open upvalues are kept gray */ - else - set2black(uv); /* closed upvalues are visited here */ - markvalue(g, uv->v.p); /* mark its content */ - break; - } - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - if (u->nuvalue == 0) { /* no user values? */ - markobjectN(g, u->metatable); /* mark its metatable */ - set2black(u); /* nothing else to mark */ - break; - } - /* else... */ - } /* FALLTHROUGH */ - case LUA_VLCL: case LUA_VCCL: case LUA_VTABLE: - case LUA_VTHREAD: case LUA_VPROTO: { - linkobjgclist(o, g->gray); /* to be visited later */ - break; - } - default: lua_assert(0); break; - } -} - - -/* -** mark metamethods for basic types -*/ -static void markmt (global_State *g) { - int i; - for (i=0; i < LUA_NUMTYPES; i++) - markobjectN(g, g->mt[i]); -} - - -/* -** mark all objects in list of being-finalized -*/ -static l_obj markbeingfnz (global_State *g) { - GCObject *o; - l_obj count = 0; - for (o = g->tobefnz; o != NULL; o = o->next) { - count++; - markobject(g, o); - } - return count; -} - - -/* -** For each non-marked thread, simulates a barrier between each open -** upvalue and its value. (If the thread is collected, the value will be -** assigned to the upvalue, but then it can be too late for the barrier -** to act. The "barrier" does not need to check colors: A non-marked -** thread must be young; upvalues cannot be older than their threads; so -** any visited upvalue must be young too.) Also removes the thread from -** the list, as it was already visited. Removes also threads with no -** upvalues, as they have nothing to be checked. (If the thread gets an -** upvalue later, it will be linked in the list again.) -*/ -static l_obj remarkupvals (global_State *g) { - l_obj work = 0; - lua_State *thread; - lua_State **p = &g->twups; - while ((thread = *p) != NULL) { - if (!iswhite(thread) && thread->openupval != NULL) - p = &thread->twups; /* keep marked thread with upvalues in the list */ - else { /* thread is not marked or without upvalues */ - UpVal *uv; - lua_assert(!isold(thread) || thread->openupval == NULL); - *p = thread->twups; /* remove thread from the list */ - thread->twups = thread; /* mark that it is out of list */ - for (uv = thread->openupval; uv != NULL; uv = uv->u.open.next) { - lua_assert(getage(uv) <= getage(thread)); - if (!iswhite(uv)) { /* upvalue already visited? */ - lua_assert(upisopen(uv) && isgray(uv)); - markvalue(g, uv->v.p); /* mark its value */ - } - } - } - work++; - } - return work; -} - - -static void cleargraylists (global_State *g) { - g->gray = g->grayagain = NULL; - g->weak = g->allweak = g->ephemeron = NULL; -} - - -/* -** mark root set and reset all gray lists, to start a new collection. -** 'marked' is initialized with the number of fixed objects in the state, -** to count the total number of live objects during a cycle. (That is -** the metafield names, plus the reserved words, plus "_ENV" plus the -** memory-error message.) -*/ -static void restartcollection (global_State *g) { - cleargraylists(g); - g->marked = NFIXED; - markobject(g, g->mainthread); - markvalue(g, &g->l_registry); - markmt(g); - markbeingfnz(g); /* mark any finalizing object left from previous cycle */ -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Traverse functions -** ======================================================= -*/ - - -/* -** Check whether object 'o' should be kept in the 'grayagain' list for -** post-processing by 'correctgraylist'. (It could put all old objects -** in the list and leave all the work to 'correctgraylist', but it is -** more efficient to avoid adding elements that will be removed.) Only -** TOUCHED1 objects need to be in the list. TOUCHED2 doesn't need to go -** back to a gray list, but then it must become OLD. (That is what -** 'correctgraylist' does when it finds a TOUCHED2 object.) -*/ -static void genlink (global_State *g, GCObject *o) { - lua_assert(isblack(o)); - if (getage(o) == G_TOUCHED1) { /* touched in this cycle? */ - linkobjgclist(o, g->grayagain); /* link it back in 'grayagain' */ - } /* everything else do not need to be linked back */ - else if (getage(o) == G_TOUCHED2) - setage(o, G_OLD); /* advance age */ -} - - -/* -** Traverse a table with weak values and link it to proper list. During -** propagate phase, keep it in 'grayagain' list, to be revisited in the -** atomic phase. In the atomic phase, if table has any white value, -** put it in 'weak' list, to be cleared. -*/ -static void traverseweakvalue (global_State *g, Table *h) { - Node *n, *limit = gnodelast(h); - /* if there is array part, assume it may have white values (it is not - worth traversing it now just to check) */ - int hasclears = (h->alimit > 0); - for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ - if (isempty(gval(n))) /* entry is empty? */ - clearkey(n); /* clear its key */ - else { - lua_assert(!keyisnil(n)); - markkey(g, n); - if (!hasclears && iscleared(g, gcvalueN(gval(n)))) /* a white value? */ - hasclears = 1; /* table will have to be cleared */ - } - } - if (g->gcstate == GCSatomic && hasclears) - linkgclist(h, g->weak); /* has to be cleared later */ - else - linkgclist(h, g->grayagain); /* must retraverse it in atomic phase */ -} - - -/* -** Traverse the array part of a table. -*/ -static int traversearray (global_State *g, Table *h) { - unsigned asize = luaH_realasize(h); - int marked = 0; /* true if some object is marked in this traversal */ - unsigned i; - for (i = 0; i < asize; i++) { - GCObject *o = gcvalarr(h, i); - if (o != NULL && iswhite(o)) { - marked = 1; - reallymarkobject(g, o); - } - } - return marked; -} - - -/* -** Traverse an ephemeron table and link it to proper list. Returns true -** iff any object was marked during this traversal (which implies that -** convergence has to continue). During propagation phase, keep table -** in 'grayagain' list, to be visited again in the atomic phase. In -** the atomic phase, if table has any white->white entry, it has to -** be revisited during ephemeron convergence (as that key may turn -** black). Otherwise, if it has any white key, table has to be cleared -** (in the atomic phase). In generational mode, some tables -** must be kept in some gray list for post-processing; this is done -** by 'genlink'. -*/ -static int traverseephemeron (global_State *g, Table *h, int inv) { - int hasclears = 0; /* true if table has white keys */ - int hasww = 0; /* true if table has entry "white-key -> white-value" */ - unsigned int i; - unsigned int nsize = sizenode(h); - int marked = traversearray(g, h); /* traverse array part */ - /* traverse hash part; if 'inv', traverse descending - (see 'convergeephemerons') */ - for (i = 0; i < nsize; i++) { - Node *n = inv ? gnode(h, nsize - 1 - i) : gnode(h, i); - if (isempty(gval(n))) /* entry is empty? */ - clearkey(n); /* clear its key */ - else if (iscleared(g, gckeyN(n))) { /* key is not marked (yet)? */ - hasclears = 1; /* table must be cleared */ - if (valiswhite(gval(n))) /* value not marked yet? */ - hasww = 1; /* white-white entry */ - } - else if (valiswhite(gval(n))) { /* value not marked yet? */ - marked = 1; - reallymarkobject(g, gcvalue(gval(n))); /* mark it now */ - } - } - /* link table into proper list */ - if (g->gcstate == GCSpropagate) - linkgclist(h, g->grayagain); /* must retraverse it in atomic phase */ - else if (hasww) /* table has white->white entries? */ - linkgclist(h, g->ephemeron); /* have to propagate again */ - else if (hasclears) /* table has white keys? */ - linkgclist(h, g->allweak); /* may have to clean white keys */ - else - genlink(g, obj2gco(h)); /* check whether collector still needs to see it */ - return marked; -} - - -static void traversestrongtable (global_State *g, Table *h) { - Node *n, *limit = gnodelast(h); - traversearray(g, h); - for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ - if (isempty(gval(n))) /* entry is empty? */ - clearkey(n); /* clear its key */ - else { - lua_assert(!keyisnil(n)); - markkey(g, n); - markvalue(g, gval(n)); - } - } - genlink(g, obj2gco(h)); -} - - -static void traversetable (global_State *g, Table *h) { - const char *weakkey, *weakvalue; - const TValue *mode = gfasttm(g, h->metatable, TM_MODE); - TString *smode; - markobjectN(g, h->metatable); - if (mode && ttisshrstring(mode) && /* is there a weak mode? */ - (cast_void(smode = tsvalue(mode)), - cast_void(weakkey = strchr(getshrstr(smode), 'k')), - cast_void(weakvalue = strchr(getshrstr(smode), 'v')), - (weakkey || weakvalue))) { /* is really weak? */ - if (!weakkey) /* strong keys? */ - traverseweakvalue(g, h); - else if (!weakvalue) /* strong values? */ - traverseephemeron(g, h, 0); - else /* all weak */ - linkgclist(h, g->allweak); /* nothing to traverse now */ - } - else /* not weak */ - traversestrongtable(g, h); -} - - -static void traverseudata (global_State *g, Udata *u) { - int i; - markobjectN(g, u->metatable); /* mark its metatable */ - for (i = 0; i < u->nuvalue; i++) - markvalue(g, &u->uv[i].uv); - genlink(g, obj2gco(u)); -} - - -/* -** Traverse a prototype. (While a prototype is being build, its -** arrays can be larger than needed; the extra slots are filled with -** NULL, so the use of 'markobjectN') -*/ -static void traverseproto (global_State *g, Proto *f) { - int i; - markobjectN(g, f->source); - for (i = 0; i < f->sizek; i++) /* mark literals */ - markvalue(g, &f->k[i]); - for (i = 0; i < f->sizeupvalues; i++) /* mark upvalue names */ - markobjectN(g, f->upvalues[i].name); - for (i = 0; i < f->sizep; i++) /* mark nested protos */ - markobjectN(g, f->p[i]); - for (i = 0; i < f->sizelocvars; i++) /* mark local-variable names */ - markobjectN(g, f->locvars[i].varname); -} - - -static void traverseCclosure (global_State *g, CClosure *cl) { - int i; - for (i = 0; i < cl->nupvalues; i++) /* mark its upvalues */ - markvalue(g, &cl->upvalue[i]); -} - -/* -** Traverse a Lua closure, marking its prototype and its upvalues. -** (Both can be NULL while closure is being created.) -*/ -static void traverseLclosure (global_State *g, LClosure *cl) { - int i; - markobjectN(g, cl->p); /* mark its prototype */ - for (i = 0; i < cl->nupvalues; i++) { /* visit its upvalues */ - UpVal *uv = cl->upvals[i]; - markobjectN(g, uv); /* mark upvalue */ - } -} - - -/* -** Traverse a thread, marking the elements in the stack up to its top -** and cleaning the rest of the stack in the final traversal. That -** ensures that the entire stack have valid (non-dead) objects. -** Threads have no barriers. In gen. mode, old threads must be visited -** at every cycle, because they might point to young objects. In inc. -** mode, the thread can still be modified before the end of the cycle, -** and therefore it must be visited again in the atomic phase. To ensure -** these visits, threads must return to a gray list if they are not new -** (which can only happen in generational mode) or if the traverse is in -** the propagate phase (which can only happen in incremental mode). -*/ -static void traversethread (global_State *g, lua_State *th) { - UpVal *uv; - StkId o = th->stack.p; - if (isold(th) || g->gcstate == GCSpropagate) - linkgclist(th, g->grayagain); /* insert into 'grayagain' list */ - if (o == NULL) - return; /* stack not completely built yet */ - lua_assert(g->gcstate == GCSatomic || - th->openupval == NULL || isintwups(th)); - for (; o < th->top.p; o++) /* mark live elements in the stack */ - markvalue(g, s2v(o)); - for (uv = th->openupval; uv != NULL; uv = uv->u.open.next) - markobject(g, uv); /* open upvalues cannot be collected */ - if (g->gcstate == GCSatomic) { /* final traversal? */ - if (!g->gcemergency) - luaD_shrinkstack(th); /* do not change stack in emergency cycle */ - for (o = th->top.p; o < th->stack_last.p + EXTRA_STACK; o++) - setnilvalue(s2v(o)); /* clear dead stack slice */ - /* 'remarkupvals' may have removed thread from 'twups' list */ - if (!isintwups(th) && th->openupval != NULL) { - th->twups = g->twups; /* link it back to the list */ - g->twups = th; - } - } -} - - -/* -** traverse one gray object, turning it to black. -*/ -static void propagatemark (global_State *g) { - GCObject *o = g->gray; - nw2black(o); - g->gray = *getgclist(o); /* remove from 'gray' list */ - switch (o->tt) { - case LUA_VTABLE: traversetable(g, gco2t(o)); break; - case LUA_VUSERDATA: traverseudata(g, gco2u(o)); break; - case LUA_VLCL: traverseLclosure(g, gco2lcl(o)); break; - case LUA_VCCL: traverseCclosure(g, gco2ccl(o)); break; - case LUA_VPROTO: traverseproto(g, gco2p(o)); break; - case LUA_VTHREAD: traversethread(g, gco2th(o)); break; - default: lua_assert(0); - } -} - - -static l_obj propagateall (global_State *g) { - l_obj work = 0; - while (g->gray) { - propagatemark(g); - work++; - } - return work; -} - - -/* -** Traverse all ephemeron tables propagating marks from keys to values. -** Repeat until it converges, that is, nothing new is marked. 'dir' -** inverts the direction of the traversals, trying to speed up -** convergence on chains in the same table. -*/ -static l_obj convergeephemerons (global_State *g) { - int changed; - l_obj work = 0; - int dir = 0; - do { - GCObject *w; - GCObject *next = g->ephemeron; /* get ephemeron list */ - g->ephemeron = NULL; /* tables may return to this list when traversed */ - changed = 0; - while ((w = next) != NULL) { /* for each ephemeron table */ - Table *h = gco2t(w); - next = h->gclist; /* list is rebuilt during loop */ - nw2black(h); /* out of the list (for now) */ - if (traverseephemeron(g, h, dir)) { /* marked some value? */ - propagateall(g); /* propagate changes */ - changed = 1; /* will have to revisit all ephemeron tables */ - } - work++; - } - dir = !dir; /* invert direction next time */ - } while (changed); /* repeat until no more changes */ - return work; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Sweep Functions -** ======================================================= -*/ - - -/* -** clear entries with unmarked keys from all weaktables in list 'l' -*/ -static l_obj clearbykeys (global_State *g, GCObject *l) { - l_obj work = 0; - for (; l; l = gco2t(l)->gclist) { - Table *h = gco2t(l); - Node *limit = gnodelast(h); - Node *n; - for (n = gnode(h, 0); n < limit; n++) { - if (iscleared(g, gckeyN(n))) /* unmarked key? */ - setempty(gval(n)); /* remove entry */ - if (isempty(gval(n))) /* is entry empty? */ - clearkey(n); /* clear its key */ - } - work++; - } - return work; -} - - -/* -** clear entries with unmarked values from all weaktables in list 'l' up -** to element 'f' -*/ -static l_obj clearbyvalues (global_State *g, GCObject *l, GCObject *f) { - l_obj work = 0; - for (; l != f; l = gco2t(l)->gclist) { - Table *h = gco2t(l); - Node *n, *limit = gnodelast(h); - unsigned int i; - unsigned int asize = luaH_realasize(h); - for (i = 0; i < asize; i++) { - GCObject *o = gcvalarr(h, i); - if (iscleared(g, o)) /* value was collected? */ - *getArrTag(h, i) = LUA_VEMPTY; /* remove entry */ - } - for (n = gnode(h, 0); n < limit; n++) { - if (iscleared(g, gcvalueN(gval(n)))) /* unmarked value? */ - setempty(gval(n)); /* remove entry */ - if (isempty(gval(n))) /* is entry empty? */ - clearkey(n); /* clear its key */ - } - work++; - } - return work; -} - - -static void freeupval (lua_State *L, UpVal *uv) { - if (upisopen(uv)) - luaF_unlinkupval(uv); - luaM_free(L, uv); -} - - -static void freeobj (lua_State *L, GCObject *o) { - G(L)->totalobjs--; - switch (o->tt) { - case LUA_VPROTO: - luaF_freeproto(L, gco2p(o)); - break; - case LUA_VUPVAL: - freeupval(L, gco2upv(o)); - break; - case LUA_VLCL: { - LClosure *cl = gco2lcl(o); - luaM_freemem(L, cl, sizeLclosure(cl->nupvalues)); - break; - } - case LUA_VCCL: { - CClosure *cl = gco2ccl(o); - luaM_freemem(L, cl, sizeCclosure(cl->nupvalues)); - break; - } - case LUA_VTABLE: - luaH_free(L, gco2t(o)); - break; - case LUA_VTHREAD: - luaE_freethread(L, gco2th(o)); - break; - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - luaM_freemem(L, o, sizeudata(u->nuvalue, u->len)); - break; - } - case LUA_VSHRSTR: { - TString *ts = gco2ts(o); - luaS_remove(L, ts); /* remove it from hash table */ - luaM_freemem(L, ts, sizestrshr(ts->shrlen)); - break; - } - case LUA_VLNGSTR: { - TString *ts = gco2ts(o); - if (ts->shrlen == LSTRMEM) /* must free external string? */ - (*ts->falloc)(ts->ud, ts->contents, ts->u.lnglen + 1, 0); - luaM_freemem(L, ts, luaS_sizelngstr(ts->u.lnglen, ts->shrlen)); - break; - } - default: lua_assert(0); - } -} - - -/* -** sweep at most 'countin' elements from a list of GCObjects erasing dead -** objects, where a dead object is one marked with the old (non current) -** white; change all non-dead objects back to white (and new), preparing -** for next collection cycle. Return where to continue the traversal or -** NULL if list is finished. -*/ -static GCObject **sweeplist (lua_State *L, GCObject **p, l_obj countin) { - global_State *g = G(L); - int ow = otherwhite(g); - l_obj i; - int white = luaC_white(g); /* current white */ - for (i = 0; *p != NULL && i < countin; i++) { - GCObject *curr = *p; - int marked = curr->marked; - if (isdeadm(ow, marked)) { /* is 'curr' dead? */ - *p = curr->next; /* remove 'curr' from list */ - freeobj(L, curr); /* erase 'curr' */ - } - else { /* change mark to 'white' and age to 'new' */ - curr->marked = cast_byte((marked & ~maskgcbits) | white | G_NEW); - p = &curr->next; /* go to next element */ - } - } - return (*p == NULL) ? NULL : p; -} - - -/* -** sweep a list until a live object (or end of list) -*/ -static GCObject **sweeptolive (lua_State *L, GCObject **p) { - GCObject **old = p; - do { - p = sweeplist(L, p, 1); - } while (p == old); - return p; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Finalization -** ======================================================= -*/ - -/* -** If possible, shrink string table. -*/ -static void checkSizes (lua_State *L, global_State *g) { - if (!g->gcemergency) { - if (g->strt.nuse < g->strt.size / 4) /* string table too big? */ - luaS_resize(L, g->strt.size / 2); - } -} - - -/* -** Get the next udata to be finalized from the 'tobefnz' list, and -** link it back into the 'allgc' list. -*/ -static GCObject *udata2finalize (global_State *g) { - GCObject *o = g->tobefnz; /* get first element */ - lua_assert(tofinalize(o)); - g->tobefnz = o->next; /* remove it from 'tobefnz' list */ - o->next = g->allgc; /* return it to 'allgc' list */ - g->allgc = o; - resetbit(o->marked, FINALIZEDBIT); /* object is "normal" again */ - if (issweepphase(g)) - makewhite(g, o); /* "sweep" object */ - else if (getage(o) == G_OLD1) - g->firstold1 = o; /* it is the first OLD1 object in the list */ - return o; -} - - -static void dothecall (lua_State *L, void *ud) { - UNUSED(ud); - luaD_callnoyield(L, L->top.p - 2, 0); -} - - -static void GCTM (lua_State *L) { - global_State *g = G(L); - const TValue *tm; - TValue v; - lua_assert(!g->gcemergency); - setgcovalue(L, &v, udata2finalize(g)); - tm = luaT_gettmbyobj(L, &v, TM_GC); - if (!notm(tm)) { /* is there a finalizer? */ - int status; - lu_byte oldah = L->allowhook; - int oldgcstp = g->gcstp; - g->gcstp |= GCSTPGC; /* avoid GC steps */ - L->allowhook = 0; /* stop debug hooks during GC metamethod */ - setobj2s(L, L->top.p++, tm); /* push finalizer... */ - setobj2s(L, L->top.p++, &v); /* ... and its argument */ - L->ci->callstatus |= CIST_FIN; /* will run a finalizer */ - status = luaD_pcall(L, dothecall, NULL, savestack(L, L->top.p - 2), 0); - L->ci->callstatus &= ~CIST_FIN; /* not running a finalizer anymore */ - L->allowhook = oldah; /* restore hooks */ - g->gcstp = oldgcstp; /* restore state */ - if (l_unlikely(status != LUA_OK)) { /* error while running __gc? */ - luaE_warnerror(L, "__gc"); - L->top.p--; /* pops error object */ - } - } -} - - -/* -** call all pending finalizers -*/ -static void callallpendingfinalizers (lua_State *L) { - global_State *g = G(L); - while (g->tobefnz) - GCTM(L); -} - - -/* -** find last 'next' field in list 'p' list (to add elements in its end) -*/ -static GCObject **findlast (GCObject **p) { - while (*p != NULL) - p = &(*p)->next; - return p; -} - - -/* -** Move all unreachable objects (or 'all' objects) that need -** finalization from list 'finobj' to list 'tobefnz' (to be finalized). -** (Note that objects after 'finobjold1' cannot be white, so they -** don't need to be traversed. In incremental mode, 'finobjold1' is NULL, -** so the whole list is traversed.) -*/ -static void separatetobefnz (global_State *g, int all) { - GCObject *curr; - GCObject **p = &g->finobj; - GCObject **lastnext = findlast(&g->tobefnz); - while ((curr = *p) != g->finobjold1) { /* traverse all finalizable objects */ - lua_assert(tofinalize(curr)); - if (!(iswhite(curr) || all)) /* not being collected? */ - p = &curr->next; /* don't bother with it */ - else { - if (curr == g->finobjsur) /* removing 'finobjsur'? */ - g->finobjsur = curr->next; /* correct it */ - *p = curr->next; /* remove 'curr' from 'finobj' list */ - curr->next = *lastnext; /* link at the end of 'tobefnz' list */ - *lastnext = curr; - lastnext = &curr->next; - } - } -} - - -/* -** If pointer 'p' points to 'o', move it to the next element. -*/ -static void checkpointer (GCObject **p, GCObject *o) { - if (o == *p) - *p = o->next; -} - - -/* -** Correct pointers to objects inside 'allgc' list when -** object 'o' is being removed from the list. -*/ -static void correctpointers (global_State *g, GCObject *o) { - checkpointer(&g->survival, o); - checkpointer(&g->old1, o); - checkpointer(&g->reallyold, o); - checkpointer(&g->firstold1, o); -} - - -/* -** if object 'o' has a finalizer, remove it from 'allgc' list (must -** search the list to find it) and link it in 'finobj' list. -*/ -void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt) { - global_State *g = G(L); - if (tofinalize(o) || /* obj. is already marked... */ - gfasttm(g, mt, TM_GC) == NULL || /* or has no finalizer... */ - (g->gcstp & GCSTPCLS)) /* or closing state? */ - return; /* nothing to be done */ - else { /* move 'o' to 'finobj' list */ - GCObject **p; - if (issweepphase(g)) { - makewhite(g, o); /* "sweep" object 'o' */ - if (g->sweepgc == &o->next) /* should not remove 'sweepgc' object */ - g->sweepgc = sweeptolive(L, g->sweepgc); /* change 'sweepgc' */ - } - else - correctpointers(g, o); - /* search for pointer pointing to 'o' */ - for (p = &g->allgc; *p != o; p = &(*p)->next) { /* empty */ } - *p = o->next; /* remove 'o' from 'allgc' list */ - o->next = g->finobj; /* link it in 'finobj' list */ - g->finobj = o; - l_setbit(o->marked, FINALIZEDBIT); /* mark it as such */ - } -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Generational Collector -** ======================================================= -*/ - - -/* -** Set the "time" to wait before starting a new incremental cycle; -** cycle will start when number of objects in use hits the threshold of -** approximately (marked * pause / 100). -*/ -static void setpause (global_State *g) { - l_obj threshold = applygcparam(g, PAUSE, g->marked); - l_obj debt = threshold - gettotalobjs(g); - if (debt < 0) debt = 0; - luaE_setdebt(g, debt); -} - - -/* -** Sweep a list of objects to enter generational mode. Deletes dead -** objects and turns the non dead to old. All non-dead threads---which -** are now old---must be in a gray list. Everything else is not in a -** gray list. Open upvalues are also kept gray. -*/ -static void sweep2old (lua_State *L, GCObject **p) { - GCObject *curr; - global_State *g = G(L); - while ((curr = *p) != NULL) { - if (iswhite(curr)) { /* is 'curr' dead? */ - lua_assert(isdead(g, curr)); - *p = curr->next; /* remove 'curr' from list */ - freeobj(L, curr); /* erase 'curr' */ - } - else { /* all surviving objects become old */ - setage(curr, G_OLD); - if (curr->tt == LUA_VTHREAD) { /* threads must be watched */ - lua_State *th = gco2th(curr); - linkgclist(th, g->grayagain); /* insert into 'grayagain' list */ - } - else if (curr->tt == LUA_VUPVAL && upisopen(gco2upv(curr))) - set2gray(curr); /* open upvalues are always gray */ - else /* everything else is black */ - nw2black(curr); - p = &curr->next; /* go to next element */ - } - } -} - - -/* -** Sweep for generational mode. Delete dead objects. (Because the -** collection is not incremental, there are no "new white" objects -** during the sweep. So, any white object must be dead.) For -** non-dead objects, advance their ages and clear the color of -** new objects. (Old objects keep their colors.) -** The ages of G_TOUCHED1 and G_TOUCHED2 objects cannot be advanced -** here, because these old-generation objects are usually not swept -** here. They will all be advanced in 'correctgraylist'. That function -** will also remove objects turned white here from any gray list. -*/ -static GCObject **sweepgen (lua_State *L, global_State *g, GCObject **p, - GCObject *limit, GCObject **pfirstold1, - l_obj *paddedold) { - static const lu_byte nextage[] = { - G_SURVIVAL, /* from G_NEW */ - G_OLD1, /* from G_SURVIVAL */ - G_OLD1, /* from G_OLD0 */ - G_OLD, /* from G_OLD1 */ - G_OLD, /* from G_OLD (do not change) */ - G_TOUCHED1, /* from G_TOUCHED1 (do not change) */ - G_TOUCHED2 /* from G_TOUCHED2 (do not change) */ - }; - l_obj addedold = 0; - int white = luaC_white(g); - GCObject *curr; - while ((curr = *p) != limit) { - if (iswhite(curr)) { /* is 'curr' dead? */ - lua_assert(!isold(curr) && isdead(g, curr)); - *p = curr->next; /* remove 'curr' from list */ - freeobj(L, curr); /* erase 'curr' */ - } - else { /* correct mark and age */ - int age = getage(curr); - if (age == G_NEW) { /* new objects go back to white */ - int marked = curr->marked & ~maskgcbits; /* erase GC bits */ - curr->marked = cast_byte(marked | G_SURVIVAL | white); - } - else { /* all other objects will be old, and so keep their color */ - lua_assert(age != G_OLD1); /* advanced in 'markold' */ - setage(curr, nextage[age]); - if (getage(curr) == G_OLD1) { - addedold++; /* one more object becoming old */ - if (*pfirstold1 == NULL) - *pfirstold1 = curr; /* first OLD1 object in the list */ - } - } - p = &curr->next; /* go to next element */ - } - } - *paddedold += addedold; - return p; -} - - -/* -** Correct a list of gray objects. Return a pointer to the last element -** left on the list, so that we can link another list to the end of -** this one. -** Because this correction is done after sweeping, young objects might -** be turned white and still be in the list. They are only removed. -** 'TOUCHED1' objects are advanced to 'TOUCHED2' and remain on the list; -** Non-white threads also remain on the list. 'TOUCHED2' objects and -** anything else become regular old, are marked black, and are removed -** from the list. -*/ -static GCObject **correctgraylist (GCObject **p) { - GCObject *curr; - while ((curr = *p) != NULL) { - GCObject **next = getgclist(curr); - if (iswhite(curr)) - goto remove; /* remove all white objects */ - else if (getage(curr) == G_TOUCHED1) { /* touched in this cycle? */ - lua_assert(isgray(curr)); - nw2black(curr); /* make it black, for next barrier */ - setage(curr, G_TOUCHED2); - goto remain; /* keep it in the list and go to next element */ - } - else if (curr->tt == LUA_VTHREAD) { - lua_assert(isgray(curr)); - goto remain; /* keep non-white threads on the list */ - } - else { /* everything else is removed */ - lua_assert(isold(curr)); /* young objects should be white here */ - if (getage(curr) == G_TOUCHED2) /* advance from TOUCHED2... */ - setage(curr, G_OLD); /* ... to OLD */ - nw2black(curr); /* make object black (to be removed) */ - goto remove; - } - remove: *p = *next; continue; - remain: p = next; continue; - } - return p; -} - - -/* -** Correct all gray lists, coalescing them into 'grayagain'. -*/ -static void correctgraylists (global_State *g) { - GCObject **list = correctgraylist(&g->grayagain); - *list = g->weak; g->weak = NULL; - list = correctgraylist(list); - *list = g->allweak; g->allweak = NULL; - list = correctgraylist(list); - *list = g->ephemeron; g->ephemeron = NULL; - correctgraylist(list); -} - - -/* -** Mark black 'OLD1' objects when starting a new young collection. -** Gray objects are already in some gray list, and so will be visited in -** the atomic step. -*/ -static void markold (global_State *g, GCObject *from, GCObject *to) { - GCObject *p; - for (p = from; p != to; p = p->next) { - if (getage(p) == G_OLD1) { - lua_assert(!iswhite(p)); - setage(p, G_OLD); /* now they are old */ - if (isblack(p)) - reallymarkobject(g, p); - } - } -} - - -/* -** Finish a young-generation collection. -*/ -static void finishgencycle (lua_State *L, global_State *g) { - correctgraylists(g); - checkSizes(L, g); - g->gcstate = GCSpropagate; /* skip restart */ - if (!g->gcemergency) - callallpendingfinalizers(L); -} - - -/* -** Shifts from a minor collection to major collections. It starts in -** the "sweep all" state to clear all objects, which are mostly black -** in generational mode. -*/ -static void minor2inc (lua_State *L, global_State *g, int kind) { - g->GCmajorminor = g->marked; /* number of live objects */ - g->gckind = kind; - g->reallyold = g->old1 = g->survival = NULL; - g->finobjrold = g->finobjold1 = g->finobjsur = NULL; - entersweep(L); /* continue as an incremental cycle */ - /* set a debt equal to the step size */ - luaE_setdebt(g, applygcparam(g, STEPSIZE, 100)); -} - - -/* -** Decide whether to shift to major mode. It tests two conditions: -** 1) Whether the number of added old objects in this collection is more -** than half the number of new objects. ('step' is the number of objects -** created between minor collections. Except for forward barriers, it -** is the maximum number of objects that can become old in each minor -** collection.) -** 2) Whether the accumulated number of added old objects is larger -** than 'minormajor'% of the number of lived objects after the last -** major collection. (That percentage is computed in 'limit'.) -*/ -static int checkminormajor (global_State *g, l_obj addedold1) { - l_obj step = applygcparam(g, MINORMUL, g->GCmajorminor); - l_obj limit = applygcparam(g, MINORMAJOR, g->GCmajorminor); - return (addedold1 >= (step >> 1) || g->marked >= limit); -} - -/* -** Does a young collection. First, mark 'OLD1' objects. Then does the -** atomic step. Then, check whether to continue in minor mode. If so, -** sweep all lists and advance pointers. Finally, finish the collection. -*/ -static void youngcollection (lua_State *L, global_State *g) { - l_obj addedold1 = 0; - l_obj marked = g->marked; /* preserve 'g->marked' */ - GCObject **psurvival; /* to point to first non-dead survival object */ - GCObject *dummy; /* dummy out parameter to 'sweepgen' */ - lua_assert(g->gcstate == GCSpropagate); - if (g->firstold1) { /* are there regular OLD1 objects? */ - markold(g, g->firstold1, g->reallyold); /* mark them */ - g->firstold1 = NULL; /* no more OLD1 objects (for now) */ - } - markold(g, g->finobj, g->finobjrold); - markold(g, g->tobefnz, NULL); - - atomic(L); /* will lose 'g->marked' */ - - /* sweep nursery and get a pointer to its last live element */ - g->gcstate = GCSswpallgc; - psurvival = sweepgen(L, g, &g->allgc, g->survival, &g->firstold1, &addedold1); - /* sweep 'survival' */ - sweepgen(L, g, psurvival, g->old1, &g->firstold1, &addedold1); - g->reallyold = g->old1; - g->old1 = *psurvival; /* 'survival' survivals are old now */ - g->survival = g->allgc; /* all news are survivals */ - - /* repeat for 'finobj' lists */ - dummy = NULL; /* no 'firstold1' optimization for 'finobj' lists */ - psurvival = sweepgen(L, g, &g->finobj, g->finobjsur, &dummy, &addedold1); - /* sweep 'survival' */ - sweepgen(L, g, psurvival, g->finobjold1, &dummy, &addedold1); - g->finobjrold = g->finobjold1; - g->finobjold1 = *psurvival; /* 'survival' survivals are old now */ - g->finobjsur = g->finobj; /* all news are survivals */ - - sweepgen(L, g, &g->tobefnz, NULL, &dummy, &addedold1); - - /* keep total number of added old1 objects */ - g->marked = marked + addedold1; - - /* decide whether to shift to major mode */ - if (checkminormajor(g, addedold1)) { - minor2inc(L, g, KGC_GENMAJOR); /* go to major mode */ - g->marked = 0; /* avoid pause in first major cycle */ - } - else - finishgencycle(L, g); /* still in minor mode; finish it */ -} - - -/* -** Clears all gray lists, sweeps objects, and prepare sublists to enter -** generational mode. The sweeps remove dead objects and turn all -** surviving objects to old. Threads go back to 'grayagain'; everything -** else is turned black (not in any gray list). -*/ -static void atomic2gen (lua_State *L, global_State *g) { - cleargraylists(g); - /* sweep all elements making them old */ - g->gcstate = GCSswpallgc; - sweep2old(L, &g->allgc); - /* everything alive now is old */ - g->reallyold = g->old1 = g->survival = g->allgc; - g->firstold1 = NULL; /* there are no OLD1 objects anywhere */ - - /* repeat for 'finobj' lists */ - sweep2old(L, &g->finobj); - g->finobjrold = g->finobjold1 = g->finobjsur = g->finobj; - - sweep2old(L, &g->tobefnz); - - g->gckind = KGC_GENMINOR; - g->GCmajorminor = g->marked; /* "base" for number of objects */ - g->marked = 0; /* to count the number of added old1 objects */ - finishgencycle(L, g); -} - - -/* -** Set debt for the next minor collection, which will happen when -** total number of objects grows 'genminormul'%. -*/ -static void setminordebt (global_State *g) { - luaE_setdebt(g, applygcparam(g, MINORMUL, g->GCmajorminor)); -} - - -/* -** Enter generational mode. Must go until the end of an atomic cycle -** to ensure that all objects are correctly marked and weak tables -** are cleared. Then, turn all objects into old and finishes the -** collection. -*/ -static void entergen (lua_State *L, global_State *g) { - luaC_runtilstate(L, GCSpause, 1); /* prepare to start a new cycle */ - luaC_runtilstate(L, GCSpropagate, 1); /* start new cycle */ - atomic(L); /* propagates all and then do the atomic stuff */ - atomic2gen(L, g); - setminordebt(g); /* set debt assuming next cycle will be minor */ -} - - -/* -** Change collector mode to 'newmode'. -*/ -void luaC_changemode (lua_State *L, int newmode) { - global_State *g = G(L); - if (g->gckind == KGC_GENMAJOR) /* doing major collections? */ - g->gckind = KGC_INC; /* already incremental but in name */ - if (newmode != g->gckind) { /* does it need to change? */ - if (newmode == KGC_INC) /* entering incremental mode? */ - minor2inc(L, g, KGC_INC); /* entering incremental mode */ - else { - lua_assert(newmode == KGC_GENMINOR); - entergen(L, g); - } - } -} - - -/* -** Does a full collection in generational mode. -*/ -static void fullgen (lua_State *L, global_State *g) { - minor2inc(L, g, KGC_INC); - entergen(L, g); -} - - -/* -** After an atomic incremental step from a major collection, -** check whether collector could return to minor collections. -** It checks whether the number of objects 'tobecollected' -** is greater than 'majorminor'% of the number of objects added -** since the last collection ('addedobjs'). -*/ -static int checkmajorminor (lua_State *L, global_State *g) { - if (g->gckind == KGC_GENMAJOR) { /* generational mode? */ - l_obj numobjs = gettotalobjs(g); - l_obj addedobjs = numobjs - g->GCmajorminor; - l_obj limit = applygcparam(g, MAJORMINOR, addedobjs); - l_obj tobecollected = numobjs - g->marked; - if (tobecollected > limit) { - atomic2gen(L, g); /* return to generational mode */ - setminordebt(g); - return 0; /* exit incremental collection */ - } - } - g->GCmajorminor = g->marked; /* prepare for next collection */ - return 1; /* stay doing incremental collections */ -} - -/* }====================================================== */ - - -/* -** {====================================================== -** GC control -** ======================================================= -*/ - - -/* -** Enter first sweep phase. -** The call to 'sweeptolive' makes the pointer point to an object -** inside the list (instead of to the header), so that the real sweep do -** not need to skip objects created between "now" and the start of the -** real sweep. -*/ -static void entersweep (lua_State *L) { - global_State *g = G(L); - g->gcstate = GCSswpallgc; - lua_assert(g->sweepgc == NULL); - g->sweepgc = sweeptolive(L, &g->allgc); -} - - -/* -** Delete all objects in list 'p' until (but not including) object -** 'limit'. -*/ -static void deletelist (lua_State *L, GCObject *p, GCObject *limit) { - while (p != limit) { - GCObject *next = p->next; - freeobj(L, p); - p = next; - } -} - - -/* -** Call all finalizers of the objects in the given Lua state, and -** then free all objects, except for the main thread. -*/ -void luaC_freeallobjects (lua_State *L) { - global_State *g = G(L); - g->gcstp = GCSTPCLS; /* no extra finalizers after here */ - luaC_changemode(L, KGC_INC); - separatetobefnz(g, 1); /* separate all objects with finalizers */ - lua_assert(g->finobj == NULL); - callallpendingfinalizers(L); - deletelist(L, g->allgc, obj2gco(g->mainthread)); - lua_assert(g->finobj == NULL); /* no new finalizers */ - deletelist(L, g->fixedgc, NULL); /* collect fixed objects */ - lua_assert(g->strt.nuse == 0); -} - - -static l_obj atomic (lua_State *L) { - l_obj work = 0; - global_State *g = G(L); - GCObject *origweak, *origall; - GCObject *grayagain = g->grayagain; /* save original list */ - g->grayagain = NULL; - lua_assert(g->ephemeron == NULL && g->weak == NULL); - lua_assert(!iswhite(g->mainthread)); - g->gcstate = GCSatomic; - markobject(g, L); /* mark running thread */ - /* registry and global metatables may be changed by API */ - markvalue(g, &g->l_registry); - markmt(g); /* mark global metatables */ - work += propagateall(g); /* empties 'gray' list */ - /* remark occasional upvalues of (maybe) dead threads */ - work += remarkupvals(g); - work += propagateall(g); /* propagate changes */ - g->gray = grayagain; - work += propagateall(g); /* traverse 'grayagain' list */ - work += convergeephemerons(g); - /* at this point, all strongly accessible objects are marked. */ - /* Clear values from weak tables, before checking finalizers */ - work += clearbyvalues(g, g->weak, NULL); - work += clearbyvalues(g, g->allweak, NULL); - origweak = g->weak; origall = g->allweak; - separatetobefnz(g, 0); /* separate objects to be finalized */ - work += markbeingfnz(g); /* mark objects that will be finalized */ - work += propagateall(g); /* remark, to propagate 'resurrection' */ - work += convergeephemerons(g); - /* at this point, all resurrected objects are marked. */ - /* remove dead objects from weak tables */ - work += clearbykeys(g, g->ephemeron); /* clear keys from all ephemeron */ - work += clearbykeys(g, g->allweak); /* clear keys from all 'allweak' */ - /* clear values from resurrected weak tables */ - work += clearbyvalues(g, g->weak, origweak); - work += clearbyvalues(g, g->allweak, origall); - luaS_clearcache(g); - g->currentwhite = cast_byte(otherwhite(g)); /* flip current white */ - lua_assert(g->gray == NULL); - return work; -} - - -/* -** Do a sweep step. The normal case (not fast) sweeps at most GCSWEEPMAX -** elements. The fast case sweeps the whole list. -*/ -static void sweepstep (lua_State *L, global_State *g, - int nextstate, GCObject **nextlist, int fast) { - if (g->sweepgc) - g->sweepgc = sweeplist(L, g->sweepgc, fast ? MAX_LOBJ : GCSWEEPMAX); - else { /* enter next state */ - g->gcstate = nextstate; - g->sweepgc = nextlist; - } -} - - -/* -** Performs one incremental "step" in an incremental garbage collection. -** For indivisible work, a step goes to the next state. When marking -** (propagating), a step traverses one object. When sweeping, a step -** sweeps GCSWEEPMAX objects, to avoid a big overhead for sweeping -** objects one by one. (Sweeping is inexpensive, no matter the -** object.) When 'fast' is true, 'singlestep' tries to finish a state -** "as fast as possible". In particular, it skips the propagation -** phase and leaves all objects to be traversed by the atomic phase: -** That avoids traversing twice some objects, such as theads and -** weak tables. -*/ -static l_obj singlestep (lua_State *L, int fast) { - global_State *g = G(L); - l_obj work; - lua_assert(!g->gcstopem); /* collector is not reentrant */ - g->gcstopem = 1; /* no emergency collections while collecting */ - switch (g->gcstate) { - case GCSpause: { - restartcollection(g); - g->gcstate = GCSpropagate; - work = 1; - break; - } - case GCSpropagate: { - if (fast || g->gray == NULL) { - g->gcstate = GCSenteratomic; /* finish propagate phase */ - work = 0; - } - else { - propagatemark(g); /* traverse one gray object */ - work = 1; - } - break; - } - case GCSenteratomic: { - work = atomic(L); - if (checkmajorminor(L, g)) - entersweep(L); - break; - } - case GCSswpallgc: { /* sweep "regular" objects */ - sweepstep(L, g, GCSswpfinobj, &g->finobj, fast); - work = GCSWEEPMAX; - break; - } - case GCSswpfinobj: { /* sweep objects with finalizers */ - sweepstep(L, g, GCSswptobefnz, &g->tobefnz, fast); - work = GCSWEEPMAX; - break; - } - case GCSswptobefnz: { /* sweep objects to be finalized */ - sweepstep(L, g, GCSswpend, NULL, fast); - work = GCSWEEPMAX; - break; - } - case GCSswpend: { /* finish sweeps */ - checkSizes(L, g); - g->gcstate = GCScallfin; - work = 0; - break; - } - case GCScallfin: { /* call finalizers */ - if (g->tobefnz && !g->gcemergency) { - g->gcstopem = 0; /* ok collections during finalizers */ - GCTM(L); /* call one finalizer */ - work = 1; - } - else { /* emergency mode or no more finalizers */ - g->gcstate = GCSpause; /* finish collection */ - work = 0; - } - break; - } - default: lua_assert(0); return 0; - } - g->gcstopem = 0; - return work; -} - - -/* -** Advances the garbage collector until it reaches the given state. -** (The option 'fast' is only for testing; in normal code, 'fast' -** here is always true.) -*/ -void luaC_runtilstate (lua_State *L, int state, int fast) { - global_State *g = G(L); - lua_assert(g->gckind == KGC_INC); - while (state != g->gcstate) - singlestep(L, fast); -} - - - -/* -** Performs a basic incremental step. The debt and step size are -** converted from bytes to "units of work"; then the function loops -** running single steps until adding that many units of work or -** finishing a cycle (pause state). Finally, it sets the debt that -** controls when next step will be performed. -*/ -static void incstep (lua_State *L, global_State *g) { - l_obj stepsize = applygcparam(g, STEPSIZE, 100); - l_obj work2do = applygcparam(g, STEPMUL, stepsize); - int fast = 0; - if (work2do == 0) { /* special case: do a full collection */ - work2do = MAX_LOBJ; /* do unlimited work */ - fast = 1; - } - do { /* repeat until pause or enough work */ - l_obj work = singlestep(L, fast); /* perform one single step */ - if (g->gckind == KGC_GENMINOR) /* returned to minor collections? */ - return; /* nothing else to be done here */ - work2do -= work; - } while (work2do > 0 && g->gcstate != GCSpause); - if (g->gcstate == GCSpause) - setpause(g); /* pause until next cycle */ - else - luaE_setdebt(g, stepsize); -} - -/* -** Performs a basic GC step if collector is running. (If collector is -** not running, set a reasonable debt to avoid it being called at -** every single check.) -*/ -void luaC_step (lua_State *L) { - global_State *g = G(L); - lua_assert(!g->gcemergency); - if (!gcrunning(g)) /* not running? */ - luaE_setdebt(g, 2000); - else { - switch (g->gckind) { - case KGC_INC: case KGC_GENMAJOR: - incstep(L, g); - break; - case KGC_GENMINOR: - youngcollection(L, g); - setminordebt(g); - break; - } - } -} - - -/* -** Perform a full collection in incremental mode. -** Before running the collection, check 'keepinvariant'; if it is true, -** there may be some objects marked as black, so the collector has -** to sweep all objects to turn them back to white (as white has not -** changed, nothing will be collected). -*/ -static void fullinc (lua_State *L, global_State *g) { - if (keepinvariant(g)) /* black objects? */ - entersweep(L); /* sweep everything to turn them back to white */ - /* finish any pending sweep phase to start a new cycle */ - luaC_runtilstate(L, GCSpause, 1); - luaC_runtilstate(L, GCScallfin, 1); /* run up to finalizers */ - /* 'marked' must be correct after a full GC cycle */ - lua_assert(g->marked == gettotalobjs(g)); - luaC_runtilstate(L, GCSpause, 1); /* finish collection */ - setpause(g); -} - - -/* -** Performs a full GC cycle; if 'isemergency', set a flag to avoid -** some operations which could change the interpreter state in some -** unexpected ways (running finalizers and shrinking some structures). -*/ -void luaC_fullgc (lua_State *L, int isemergency) { - global_State *g = G(L); - lua_assert(!g->gcemergency); - g->gcemergency = isemergency; /* set flag */ - switch (g->gckind) { - case KGC_GENMINOR: fullgen(L, g); break; - case KGC_INC: fullinc(L, g); break; - case KGC_GENMAJOR: - g->gckind = KGC_INC; - fullinc(L, g); - g->gckind = KGC_GENMAJOR; - break; - } - g->gcemergency = 0; -} - -/* }====================================================== */ - - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lgc.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lgc.h deleted file mode 100644 index 5e47411..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lgc.h +++ /dev/null @@ -1,249 +0,0 @@ -/* -** $Id: lgc.h $ -** Garbage Collector -** See Copyright Notice in lua.h -*/ - -#ifndef lgc_h -#define lgc_h - - -#include - - -#include "lobject.h" -#include "lstate.h" - -/* -** Collectable objects may have one of three colors: white, which means -** the object is not marked; gray, which means the object is marked, but -** its references may be not marked; and black, which means that the -** object and all its references are marked. The main invariant of the -** garbage collector, while marking objects, is that a black object can -** never point to a white one. Moreover, any gray object must be in a -** "gray list" (gray, grayagain, weak, allweak, ephemeron) so that it -** can be visited again before finishing the collection cycle. (Open -** upvalues are an exception to this rule.) These lists have no meaning -** when the invariant is not being enforced (e.g., sweep phase). -*/ - - -/* -** Possible states of the Garbage Collector -*/ -#define GCSpropagate 0 -#define GCSenteratomic 1 -#define GCSatomic 2 -#define GCSswpallgc 3 -#define GCSswpfinobj 4 -#define GCSswptobefnz 5 -#define GCSswpend 6 -#define GCScallfin 7 -#define GCSpause 8 - - -#define issweepphase(g) \ - (GCSswpallgc <= (g)->gcstate && (g)->gcstate <= GCSswpend) - - -/* -** macro to tell when main invariant (white objects cannot point to black -** ones) must be kept. During a collection, the sweep -** phase may break the invariant, as objects turned white may point to -** still-black objects. The invariant is restored when sweep ends and -** all objects are white again. -*/ - -#define keepinvariant(g) ((g)->gcstate <= GCSatomic) - - -/* -** some useful bit tricks -*/ -#define resetbits(x,m) ((x) &= cast_byte(~(m))) -#define setbits(x,m) ((x) |= (m)) -#define testbits(x,m) ((x) & (m)) -#define bitmask(b) (1<<(b)) -#define bit2mask(b1,b2) (bitmask(b1) | bitmask(b2)) -#define l_setbit(x,b) setbits(x, bitmask(b)) -#define resetbit(x,b) resetbits(x, bitmask(b)) -#define testbit(x,b) testbits(x, bitmask(b)) - - -/* -** Layout for bit use in 'marked' field. First three bits are -** used for object "age" in generational mode. Last bit is used -** by tests. -*/ -#define WHITE0BIT 3 /* object is white (type 0) */ -#define WHITE1BIT 4 /* object is white (type 1) */ -#define BLACKBIT 5 /* object is black */ -#define FINALIZEDBIT 6 /* object has been marked for finalization */ - -#define TESTBIT 7 - - - -#define WHITEBITS bit2mask(WHITE0BIT, WHITE1BIT) - - -#define iswhite(x) testbits((x)->marked, WHITEBITS) -#define isblack(x) testbit((x)->marked, BLACKBIT) -#define isgray(x) /* neither white nor black */ \ - (!testbits((x)->marked, WHITEBITS | bitmask(BLACKBIT))) - -#define tofinalize(x) testbit((x)->marked, FINALIZEDBIT) - -#define otherwhite(g) ((g)->currentwhite ^ WHITEBITS) -#define isdeadm(ow,m) ((m) & (ow)) -#define isdead(g,v) isdeadm(otherwhite(g), (v)->marked) - -#define changewhite(x) ((x)->marked ^= WHITEBITS) -#define nw2black(x) \ - check_exp(!iswhite(x), l_setbit((x)->marked, BLACKBIT)) - -#define luaC_white(g) cast_byte((g)->currentwhite & WHITEBITS) - - -/* object age in generational mode */ -#define G_NEW 0 /* created in current cycle */ -#define G_SURVIVAL 1 /* created in previous cycle */ -#define G_OLD0 2 /* marked old by frw. barrier in this cycle */ -#define G_OLD1 3 /* first full cycle as old */ -#define G_OLD 4 /* really old object (not to be visited) */ -#define G_TOUCHED1 5 /* old object touched this cycle */ -#define G_TOUCHED2 6 /* old object touched in previous cycle */ - -#define AGEBITS 7 /* all age bits (111) */ - -#define getage(o) ((o)->marked & AGEBITS) -#define setage(o,a) ((o)->marked = cast_byte(((o)->marked & (~AGEBITS)) | a)) -#define isold(o) (getage(o) > G_SURVIVAL) - - -/* -** In generational mode, objects are created 'new'. After surviving one -** cycle, they become 'survival'. Both 'new' and 'survival' can point -** to any other object, as they are traversed at the end of the cycle. -** We call them both 'young' objects. -** If a survival object survives another cycle, it becomes 'old1'. -** 'old1' objects can still point to survival objects (but not to -** new objects), so they still must be traversed. After another cycle -** (that, being old, 'old1' objects will "survive" no matter what) -** finally the 'old1' object becomes really 'old', and then they -** are no more traversed. -** -** To keep its invariants, the generational mode uses the same barriers -** also used by the incremental mode. If a young object is caught in a -** foward barrier, it cannot become old immediately, because it can -** still point to other young objects. Instead, it becomes 'old0', -** which in the next cycle becomes 'old1'. So, 'old0' objects is -** old but can point to new and survival objects; 'old1' is old -** but cannot point to new objects; and 'old' cannot point to any -** young object. -** -** If any old object ('old0', 'old1', 'old') is caught in a back -** barrier, it becomes 'touched1' and goes into a gray list, to be -** visited at the end of the cycle. There it evolves to 'touched2', -** which can point to survivals but not to new objects. In yet another -** cycle then it becomes 'old' again. -** -** The generational mode must also control the colors of objects, -** because of the barriers. While the mutator is running, young objects -** are kept white. 'old', 'old1', and 'touched2' objects are kept black, -** as they cannot point to new objects; exceptions are threads and open -** upvalues, which age to 'old1' and 'old' but are kept gray. 'old0' -** objects may be gray or black, as in the incremental mode. 'touched1' -** objects are kept gray, as they must be visited again at the end of -** the cycle. -*/ - - -/* Default Values for GC parameters */ - -/* -** Minor collections will shift to major ones after LUAI_MINORMAJOR% -** objects become old. -*/ -#define LUAI_MINORMAJOR 100 - -/* -** Major collections will shift to minor ones after a collection -** collects at least LUAI_MAJORMINOR% of the new objects. -*/ -#define LUAI_MAJORMINOR 50 - -/* -** A young (minor) collection will run after creating LUAI_GENMINORMUL% -** new objects. -*/ -#define LUAI_GENMINORMUL 25 - - -/* incremental */ - -/* Number of objects must be LUAI_GCPAUSE% before starting new cycle */ -#define LUAI_GCPAUSE 200 - -/* Step multiplier. (Roughly, the collector handles LUAI_GCMUL% objects - for each new allocated object.) */ -#define LUAI_GCMUL 200 - -/* How many objects to allocate before next GC step */ -#define LUAI_GCSTEPSIZE 250 - - -#define setgcparam(g,p,v) (g->gcparams[LUA_GCP##p] = luaO_codeparam(v)) -#define applygcparam(g,p,x) luaO_applyparam(g->gcparams[LUA_GCP##p], x) - -/* -** Control when GC is running: -*/ -#define GCSTPUSR 1 /* bit true when GC stopped by user */ -#define GCSTPGC 2 /* bit true when GC stopped by itself */ -#define GCSTPCLS 4 /* bit true when closing Lua state */ -#define gcrunning(g) ((g)->gcstp == 0) - - -/* -** Does one step of collection when debt becomes zero. 'pre'/'pos' -** allows some adjustments to be done only when needed. macro -** 'condchangemem' is used only for heavy tests (forcing a full -** GC cycle on every opportunity) -*/ -#define luaC_condGC(L,pre,pos) \ - { if (G(L)->GCdebt <= 0) { pre; luaC_step(L); pos;}; \ - condchangemem(L,pre,pos); } - -/* more often than not, 'pre'/'pos' are empty */ -#define luaC_checkGC(L) luaC_condGC(L,(void)0,(void)0) - - -#define luaC_objbarrier(L,p,o) ( \ - (isblack(p) && iswhite(o)) ? \ - luaC_barrier_(L,obj2gco(p),obj2gco(o)) : cast_void(0)) - -#define luaC_barrier(L,p,v) ( \ - iscollectable(v) ? luaC_objbarrier(L,p,gcvalue(v)) : cast_void(0)) - -#define luaC_objbarrierback(L,p,o) ( \ - (isblack(p) && iswhite(o)) ? luaC_barrierback_(L,p) : cast_void(0)) - -#define luaC_barrierback(L,p,v) ( \ - iscollectable(v) ? luaC_objbarrierback(L, p, gcvalue(v)) : cast_void(0)) - -LUAI_FUNC void luaC_fix (lua_State *L, GCObject *o); -LUAI_FUNC void luaC_freeallobjects (lua_State *L); -LUAI_FUNC void luaC_step (lua_State *L); -LUAI_FUNC void luaC_runtilstate (lua_State *L, int state, int fast); -LUAI_FUNC void luaC_fullgc (lua_State *L, int isemergency); -LUAI_FUNC GCObject *luaC_newobj (lua_State *L, int tt, size_t sz); -LUAI_FUNC GCObject *luaC_newobjdt (lua_State *L, int tt, size_t sz, - size_t offset); -LUAI_FUNC void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v); -LUAI_FUNC void luaC_barrierback_ (lua_State *L, GCObject *o); -LUAI_FUNC void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt); -LUAI_FUNC void luaC_changemode (lua_State *L, int newmode); - - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/linit.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/linit.c deleted file mode 100644 index 140f6d7..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/linit.c +++ /dev/null @@ -1,62 +0,0 @@ -/* -** $Id: linit.c $ -** Initialization of libraries for lua.c and other clients -** See Copyright Notice in lua.h -*/ - - -#define linit_c -#define LUA_LIB - - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "lualib.h" -#include "lauxlib.h" - - -/* -** Standard Libraries. (Must be listed in the same ORDER of their -** respective constants LUA_K.) -*/ -static const luaL_Reg stdlibs[] = { - {LUA_GNAME, luaopen_base}, - {LUA_LOADLIBNAME, luaopen_package}, - {LUA_COLIBNAME, luaopen_coroutine}, - {LUA_DBLIBNAME, luaopen_debug}, - {LUA_IOLIBNAME, luaopen_io}, - {LUA_MATHLIBNAME, luaopen_math}, - {LUA_OSLIBNAME, luaopen_os}, - {LUA_STRLIBNAME, luaopen_string}, - {LUA_TABLIBNAME, luaopen_table}, - {LUA_UTF8LIBNAME, luaopen_utf8}, - {NULL, NULL} -}; - - -/* -** require and preload selected standard libraries -*/ -LUALIB_API void luaL_openselectedlibs (lua_State *L, int load, int preload) { - int mask; - const luaL_Reg *lib; - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - for (lib = stdlibs, mask = 1; lib->name != NULL; lib++, mask <<= 1) { - if (load & mask) { /* selected? */ - luaL_requiref(L, lib->name, lib->func, 1); /* require library */ - lua_pop(L, 1); /* remove result from the stack */ - } - else if (preload & mask) { /* selected? */ - lua_pushcfunction(L, lib->func); - lua_setfield(L, -2, lib->name); /* add library to PRELOAD table */ - } - } - lua_assert((mask >> 1) == LUA_UTF8LIBK); - lua_pop(L, 1); /* remove PRELOAD table */ -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/liolib.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/liolib.c deleted file mode 100644 index b08397d..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/liolib.c +++ /dev/null @@ -1,828 +0,0 @@ -/* -** $Id: liolib.c $ -** Standard I/O (and system) library -** See Copyright Notice in lua.h -*/ - -#define liolib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - - - -/* -** Change this macro to accept other modes for 'fopen' besides -** the standard ones. -*/ -#if !defined(l_checkmode) - -/* accepted extensions to 'mode' in 'fopen' */ -#if !defined(L_MODEEXT) -#define L_MODEEXT "b" -#endif - -/* Check whether 'mode' matches '[rwa]%+?[L_MODEEXT]*' */ -static int l_checkmode (const char *mode) { - return (*mode != '\0' && strchr("rwa", *(mode++)) != NULL && - (*mode != '+' || ((void)(++mode), 1)) && /* skip if char is '+' */ - (strspn(mode, L_MODEEXT) == strlen(mode))); /* check extensions */ -} - -#endif - -/* -** {====================================================== -** l_popen spawns a new process connected to the current -** one through the file streams. -** ======================================================= -*/ - -#if !defined(l_popen) /* { */ - -#if defined(LUA_USE_POSIX) /* { */ - -#define l_popen(L,c,m) (fflush(NULL), popen(c,m)) -#define l_pclose(L,file) (pclose(file)) - -#elif defined(LUA_USE_WINDOWS) /* }{ */ - -#define l_popen(L,c,m) (_popen(c,m)) -#define l_pclose(L,file) (_pclose(file)) - -#if !defined(l_checkmodep) -/* Windows accepts "[rw][bt]?" as valid modes */ -#define l_checkmodep(m) ((m[0] == 'r' || m[0] == 'w') && \ - (m[1] == '\0' || ((m[1] == 'b' || m[1] == 't') && m[2] == '\0'))) -#endif - -#else /* }{ */ - -/* ISO C definitions */ -#define l_popen(L,c,m) \ - ((void)c, (void)m, \ - luaL_error(L, "'popen' not supported"), \ - (FILE*)0) -#define l_pclose(L,file) ((void)L, (void)file, -1) - -#endif /* } */ - -#endif /* } */ - - -#if !defined(l_checkmodep) -/* By default, Lua accepts only "r" or "w" as valid modes */ -#define l_checkmodep(m) ((m[0] == 'r' || m[0] == 'w') && m[1] == '\0') -#endif - -/* }====================================================== */ - - -#if !defined(l_getc) /* { */ - -#if defined(LUA_USE_POSIX) -#define l_getc(f) getc_unlocked(f) -#define l_lockfile(f) flockfile(f) -#define l_unlockfile(f) funlockfile(f) -#else -#define l_getc(f) getc(f) -#define l_lockfile(f) ((void)0) -#define l_unlockfile(f) ((void)0) -#endif - -#endif /* } */ - - -/* -** {====================================================== -** l_fseek: configuration for longer offsets -** ======================================================= -*/ - -#if !defined(l_fseek) /* { */ - -#if defined(LUA_USE_POSIX) /* { */ - -#include - -#define l_fseek(f,o,w) fseeko(f,o,w) -#define l_ftell(f) ftello(f) -#define l_seeknum off_t - -#elif defined(LUA_USE_WINDOWS) && !defined(_CRTIMP_TYPEINFO) \ - && defined(_MSC_VER) && (_MSC_VER >= 1400) /* }{ */ - -/* Windows (but not DDK) and Visual C++ 2005 or higher */ -#define l_fseek(f,o,w) _fseeki64(f,o,w) -#define l_ftell(f) _ftelli64(f) -#define l_seeknum __int64 - -#else /* }{ */ - -/* ISO C definitions */ -#define l_fseek(f,o,w) fseek(f,o,w) -#define l_ftell(f) ftell(f) -#define l_seeknum long - -#endif /* } */ - -#endif /* } */ - -/* }====================================================== */ - - - -#define IO_PREFIX "_IO_" -#define IOPREF_LEN (sizeof(IO_PREFIX)/sizeof(char) - 1) -#define IO_INPUT (IO_PREFIX "input") -#define IO_OUTPUT (IO_PREFIX "output") - - -typedef luaL_Stream LStream; - - -#define tolstream(L) ((LStream *)luaL_checkudata(L, 1, LUA_FILEHANDLE)) - -#define isclosed(p) ((p)->closef == NULL) - - -static int io_type (lua_State *L) { - LStream *p; - luaL_checkany(L, 1); - p = (LStream *)luaL_testudata(L, 1, LUA_FILEHANDLE); - if (p == NULL) - luaL_pushfail(L); /* not a file */ - else if (isclosed(p)) - lua_pushliteral(L, "closed file"); - else - lua_pushliteral(L, "file"); - return 1; -} - - -static int f_tostring (lua_State *L) { - LStream *p = tolstream(L); - if (isclosed(p)) - lua_pushliteral(L, "file (closed)"); - else - lua_pushfstring(L, "file (%p)", p->f); - return 1; -} - - -static FILE *tofile (lua_State *L) { - LStream *p = tolstream(L); - if (l_unlikely(isclosed(p))) - luaL_error(L, "attempt to use a closed file"); - lua_assert(p->f); - return p->f; -} - - -/* -** When creating file handles, always creates a 'closed' file handle -** before opening the actual file; so, if there is a memory error, the -** handle is in a consistent state. -*/ -static LStream *newprefile (lua_State *L) { - LStream *p = (LStream *)lua_newuserdatauv(L, sizeof(LStream), 0); - p->closef = NULL; /* mark file handle as 'closed' */ - luaL_setmetatable(L, LUA_FILEHANDLE); - return p; -} - - -/* -** Calls the 'close' function from a file handle. The 'volatile' avoids -** a bug in some versions of the Clang compiler (e.g., clang 3.0 for -** 32 bits). -*/ -static int aux_close (lua_State *L) { - LStream *p = tolstream(L); - volatile lua_CFunction cf = p->closef; - p->closef = NULL; /* mark stream as closed */ - return (*cf)(L); /* close it */ -} - - -static int f_close (lua_State *L) { - tofile(L); /* make sure argument is an open stream */ - return aux_close(L); -} - - -static int io_close (lua_State *L) { - if (lua_isnone(L, 1)) /* no argument? */ - lua_getfield(L, LUA_REGISTRYINDEX, IO_OUTPUT); /* use default output */ - return f_close(L); -} - - -static int f_gc (lua_State *L) { - LStream *p = tolstream(L); - if (!isclosed(p) && p->f != NULL) - aux_close(L); /* ignore closed and incompletely open files */ - return 0; -} - - -/* -** function to close regular files -*/ -static int io_fclose (lua_State *L) { - LStream *p = tolstream(L); - int res = fclose(p->f); - return luaL_fileresult(L, (res == 0), NULL); -} - - -static LStream *newfile (lua_State *L) { - LStream *p = newprefile(L); - p->f = NULL; - p->closef = &io_fclose; - return p; -} - - -static void opencheck (lua_State *L, const char *fname, const char *mode) { - LStream *p = newfile(L); - p->f = fopen(fname, mode); - if (l_unlikely(p->f == NULL)) - luaL_error(L, "cannot open file '%s' (%s)", fname, strerror(errno)); -} - - -static int io_open (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - const char *mode = luaL_optstring(L, 2, "r"); - LStream *p = newfile(L); - const char *md = mode; /* to traverse/check mode */ - luaL_argcheck(L, l_checkmode(md), 2, "invalid mode"); - p->f = fopen(filename, mode); - return (p->f == NULL) ? luaL_fileresult(L, 0, filename) : 1; -} - - -/* -** function to close 'popen' files -*/ -static int io_pclose (lua_State *L) { - LStream *p = tolstream(L); - errno = 0; - return luaL_execresult(L, l_pclose(L, p->f)); -} - - -static int io_popen (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - const char *mode = luaL_optstring(L, 2, "r"); - LStream *p = newprefile(L); - luaL_argcheck(L, l_checkmodep(mode), 2, "invalid mode"); - p->f = l_popen(L, filename, mode); - p->closef = &io_pclose; - return (p->f == NULL) ? luaL_fileresult(L, 0, filename) : 1; -} - - -static int io_tmpfile (lua_State *L) { - LStream *p = newfile(L); - p->f = tmpfile(); - return (p->f == NULL) ? luaL_fileresult(L, 0, NULL) : 1; -} - - -static FILE *getiofile (lua_State *L, const char *findex) { - LStream *p; - lua_getfield(L, LUA_REGISTRYINDEX, findex); - p = (LStream *)lua_touserdata(L, -1); - if (l_unlikely(isclosed(p))) - luaL_error(L, "default %s file is closed", findex + IOPREF_LEN); - return p->f; -} - - -static int g_iofile (lua_State *L, const char *f, const char *mode) { - if (!lua_isnoneornil(L, 1)) { - const char *filename = lua_tostring(L, 1); - if (filename) - opencheck(L, filename, mode); - else { - tofile(L); /* check that it's a valid file handle */ - lua_pushvalue(L, 1); - } - lua_setfield(L, LUA_REGISTRYINDEX, f); - } - /* return current value */ - lua_getfield(L, LUA_REGISTRYINDEX, f); - return 1; -} - - -static int io_input (lua_State *L) { - return g_iofile(L, IO_INPUT, "r"); -} - - -static int io_output (lua_State *L) { - return g_iofile(L, IO_OUTPUT, "w"); -} - - -static int io_readline (lua_State *L); - - -/* -** maximum number of arguments to 'f:lines'/'io.lines' (it + 3 must fit -** in the limit for upvalues of a closure) -*/ -#define MAXARGLINE 250 - -/* -** Auxiliary function to create the iteration function for 'lines'. -** The iteration function is a closure over 'io_readline', with -** the following upvalues: -** 1) The file being read (first value in the stack) -** 2) the number of arguments to read -** 3) a boolean, true iff file has to be closed when finished ('toclose') -** *) a variable number of format arguments (rest of the stack) -*/ -static void aux_lines (lua_State *L, int toclose) { - int n = lua_gettop(L) - 1; /* number of arguments to read */ - luaL_argcheck(L, n <= MAXARGLINE, MAXARGLINE + 2, "too many arguments"); - lua_pushvalue(L, 1); /* file */ - lua_pushinteger(L, n); /* number of arguments to read */ - lua_pushboolean(L, toclose); /* close/not close file when finished */ - lua_rotate(L, 2, 3); /* move the three values to their positions */ - lua_pushcclosure(L, io_readline, 3 + n); -} - - -static int f_lines (lua_State *L) { - tofile(L); /* check that it's a valid file handle */ - aux_lines(L, 0); - return 1; -} - - -/* -** Return an iteration function for 'io.lines'. If file has to be -** closed, also returns the file itself as a second result (to be -** closed as the state at the exit of a generic for). -*/ -static int io_lines (lua_State *L) { - int toclose; - if (lua_isnone(L, 1)) lua_pushnil(L); /* at least one argument */ - if (lua_isnil(L, 1)) { /* no file name? */ - lua_getfield(L, LUA_REGISTRYINDEX, IO_INPUT); /* get default input */ - lua_replace(L, 1); /* put it at index 1 */ - tofile(L); /* check that it's a valid file handle */ - toclose = 0; /* do not close it after iteration */ - } - else { /* open a new file */ - const char *filename = luaL_checkstring(L, 1); - opencheck(L, filename, "r"); - lua_replace(L, 1); /* put file at index 1 */ - toclose = 1; /* close it after iteration */ - } - aux_lines(L, toclose); /* push iteration function */ - if (toclose) { - lua_pushnil(L); /* state */ - lua_pushnil(L); /* control */ - lua_pushvalue(L, 1); /* file is the to-be-closed variable (4th result) */ - return 4; - } - else - return 1; -} - - -/* -** {====================================================== -** READ -** ======================================================= -*/ - - -/* maximum length of a numeral */ -#if !defined (L_MAXLENNUM) -#define L_MAXLENNUM 200 -#endif - - -/* auxiliary structure used by 'read_number' */ -typedef struct { - FILE *f; /* file being read */ - int c; /* current character (look ahead) */ - int n; /* number of elements in buffer 'buff' */ - char buff[L_MAXLENNUM + 1]; /* +1 for ending '\0' */ -} RN; - - -/* -** Add current char to buffer (if not out of space) and read next one -*/ -static int nextc (RN *rn) { - if (l_unlikely(rn->n >= L_MAXLENNUM)) { /* buffer overflow? */ - rn->buff[0] = '\0'; /* invalidate result */ - return 0; /* fail */ - } - else { - rn->buff[rn->n++] = rn->c; /* save current char */ - rn->c = l_getc(rn->f); /* read next one */ - return 1; - } -} - - -/* -** Accept current char if it is in 'set' (of size 2) -*/ -static int test2 (RN *rn, const char *set) { - if (rn->c == set[0] || rn->c == set[1]) - return nextc(rn); - else return 0; -} - - -/* -** Read a sequence of (hex)digits -*/ -static int readdigits (RN *rn, int hex) { - int count = 0; - while ((hex ? isxdigit(rn->c) : isdigit(rn->c)) && nextc(rn)) - count++; - return count; -} - - -/* -** Read a number: first reads a valid prefix of a numeral into a buffer. -** Then it calls 'lua_stringtonumber' to check whether the format is -** correct and to convert it to a Lua number. -*/ -static int read_number (lua_State *L, FILE *f) { - RN rn; - int count = 0; - int hex = 0; - char decp[2]; - rn.f = f; rn.n = 0; - decp[0] = lua_getlocaledecpoint(); /* get decimal point from locale */ - decp[1] = '.'; /* always accept a dot */ - l_lockfile(rn.f); - do { rn.c = l_getc(rn.f); } while (isspace(rn.c)); /* skip spaces */ - test2(&rn, "-+"); /* optional sign */ - if (test2(&rn, "00")) { - if (test2(&rn, "xX")) hex = 1; /* numeral is hexadecimal */ - else count = 1; /* count initial '0' as a valid digit */ - } - count += readdigits(&rn, hex); /* integral part */ - if (test2(&rn, decp)) /* decimal point? */ - count += readdigits(&rn, hex); /* fractional part */ - if (count > 0 && test2(&rn, (hex ? "pP" : "eE"))) { /* exponent mark? */ - test2(&rn, "-+"); /* exponent sign */ - readdigits(&rn, 0); /* exponent digits */ - } - ungetc(rn.c, rn.f); /* unread look-ahead char */ - l_unlockfile(rn.f); - rn.buff[rn.n] = '\0'; /* finish string */ - if (l_likely(lua_stringtonumber(L, rn.buff))) - return 1; /* ok, it is a valid number */ - else { /* invalid format */ - lua_pushnil(L); /* "result" to be removed */ - return 0; /* read fails */ - } -} - - -static int test_eof (lua_State *L, FILE *f) { - int c = getc(f); - ungetc(c, f); /* no-op when c == EOF */ - lua_pushliteral(L, ""); - return (c != EOF); -} - - -static int read_line (lua_State *L, FILE *f, int chop) { - luaL_Buffer b; - int c; - luaL_buffinit(L, &b); - do { /* may need to read several chunks to get whole line */ - char *buff = luaL_prepbuffer(&b); /* preallocate buffer space */ - int i = 0; - l_lockfile(f); /* no memory errors can happen inside the lock */ - while (i < LUAL_BUFFERSIZE && (c = l_getc(f)) != EOF && c != '\n') - buff[i++] = c; /* read up to end of line or buffer limit */ - l_unlockfile(f); - luaL_addsize(&b, i); - } while (c != EOF && c != '\n'); /* repeat until end of line */ - if (!chop && c == '\n') /* want a newline and have one? */ - luaL_addchar(&b, c); /* add ending newline to result */ - luaL_pushresult(&b); /* close buffer */ - /* return ok if read something (either a newline or something else) */ - return (c == '\n' || lua_rawlen(L, -1) > 0); -} - - -static void read_all (lua_State *L, FILE *f) { - size_t nr; - luaL_Buffer b; - luaL_buffinit(L, &b); - do { /* read file in chunks of LUAL_BUFFERSIZE bytes */ - char *p = luaL_prepbuffer(&b); - nr = fread(p, sizeof(char), LUAL_BUFFERSIZE, f); - luaL_addsize(&b, nr); - } while (nr == LUAL_BUFFERSIZE); - luaL_pushresult(&b); /* close buffer */ -} - - -static int read_chars (lua_State *L, FILE *f, size_t n) { - size_t nr; /* number of chars actually read */ - char *p; - luaL_Buffer b; - luaL_buffinit(L, &b); - p = luaL_prepbuffsize(&b, n); /* prepare buffer to read whole block */ - nr = fread(p, sizeof(char), n, f); /* try to read 'n' chars */ - luaL_addsize(&b, nr); - luaL_pushresult(&b); /* close buffer */ - return (nr > 0); /* true iff read something */ -} - - -static int g_read (lua_State *L, FILE *f, int first) { - int nargs = lua_gettop(L) - 1; - int n, success; - clearerr(f); - if (nargs == 0) { /* no arguments? */ - success = read_line(L, f, 1); - n = first + 1; /* to return 1 result */ - } - else { - /* ensure stack space for all results and for auxlib's buffer */ - luaL_checkstack(L, nargs+LUA_MINSTACK, "too many arguments"); - success = 1; - for (n = first; nargs-- && success; n++) { - if (lua_type(L, n) == LUA_TNUMBER) { - size_t l = (size_t)luaL_checkinteger(L, n); - success = (l == 0) ? test_eof(L, f) : read_chars(L, f, l); - } - else { - const char *p = luaL_checkstring(L, n); - if (*p == '*') p++; /* skip optional '*' (for compatibility) */ - switch (*p) { - case 'n': /* number */ - success = read_number(L, f); - break; - case 'l': /* line */ - success = read_line(L, f, 1); - break; - case 'L': /* line with end-of-line */ - success = read_line(L, f, 0); - break; - case 'a': /* file */ - read_all(L, f); /* read entire file */ - success = 1; /* always success */ - break; - default: - return luaL_argerror(L, n, "invalid format"); - } - } - } - } - if (ferror(f)) - return luaL_fileresult(L, 0, NULL); - if (!success) { - lua_pop(L, 1); /* remove last result */ - luaL_pushfail(L); /* push nil instead */ - } - return n - first; -} - - -static int io_read (lua_State *L) { - return g_read(L, getiofile(L, IO_INPUT), 1); -} - - -static int f_read (lua_State *L) { - return g_read(L, tofile(L), 2); -} - - -/* -** Iteration function for 'lines'. -*/ -static int io_readline (lua_State *L) { - LStream *p = (LStream *)lua_touserdata(L, lua_upvalueindex(1)); - int i; - int n = (int)lua_tointeger(L, lua_upvalueindex(2)); - if (isclosed(p)) /* file is already closed? */ - return luaL_error(L, "file is already closed"); - lua_settop(L , 1); - luaL_checkstack(L, n, "too many arguments"); - for (i = 1; i <= n; i++) /* push arguments to 'g_read' */ - lua_pushvalue(L, lua_upvalueindex(3 + i)); - n = g_read(L, p->f, 2); /* 'n' is number of results */ - lua_assert(n > 0); /* should return at least a nil */ - if (lua_toboolean(L, -n)) /* read at least one value? */ - return n; /* return them */ - else { /* first result is false: EOF or error */ - if (n > 1) { /* is there error information? */ - /* 2nd result is error message */ - return luaL_error(L, "%s", lua_tostring(L, -n + 1)); - } - if (lua_toboolean(L, lua_upvalueindex(3))) { /* generator created file? */ - lua_settop(L, 0); /* clear stack */ - lua_pushvalue(L, lua_upvalueindex(1)); /* push file at index 1 */ - aux_close(L); /* close it */ - } - return 0; - } -} - -/* }====================================================== */ - - -static int g_write (lua_State *L, FILE *f, int arg) { - int nargs = lua_gettop(L) - arg; - int status = 1; - for (; nargs--; arg++) { - if (lua_type(L, arg) == LUA_TNUMBER) { - /* optimization: could be done exactly as for strings */ - int len = lua_isinteger(L, arg) - ? fprintf(f, LUA_INTEGER_FMT, - (LUAI_UACINT)lua_tointeger(L, arg)) - : fprintf(f, LUA_NUMBER_FMT, - (LUAI_UACNUMBER)lua_tonumber(L, arg)); - status = status && (len > 0); - } - else { - size_t l; - const char *s = luaL_checklstring(L, arg, &l); - status = status && (fwrite(s, sizeof(char), l, f) == l); - } - } - if (l_likely(status)) - return 1; /* file handle already on stack top */ - else return luaL_fileresult(L, status, NULL); -} - - -static int io_write (lua_State *L) { - return g_write(L, getiofile(L, IO_OUTPUT), 1); -} - - -static int f_write (lua_State *L) { - FILE *f = tofile(L); - lua_pushvalue(L, 1); /* push file at the stack top (to be returned) */ - return g_write(L, f, 2); -} - - -static int f_seek (lua_State *L) { - static const int mode[] = {SEEK_SET, SEEK_CUR, SEEK_END}; - static const char *const modenames[] = {"set", "cur", "end", NULL}; - FILE *f = tofile(L); - int op = luaL_checkoption(L, 2, "cur", modenames); - lua_Integer p3 = luaL_optinteger(L, 3, 0); - l_seeknum offset = (l_seeknum)p3; - luaL_argcheck(L, (lua_Integer)offset == p3, 3, - "not an integer in proper range"); - op = l_fseek(f, offset, mode[op]); - if (l_unlikely(op)) - return luaL_fileresult(L, 0, NULL); /* error */ - else { - lua_pushinteger(L, (lua_Integer)l_ftell(f)); - return 1; - } -} - - -static int f_setvbuf (lua_State *L) { - static const int mode[] = {_IONBF, _IOFBF, _IOLBF}; - static const char *const modenames[] = {"no", "full", "line", NULL}; - FILE *f = tofile(L); - int op = luaL_checkoption(L, 2, NULL, modenames); - lua_Integer sz = luaL_optinteger(L, 3, LUAL_BUFFERSIZE); - int res = setvbuf(f, NULL, mode[op], (size_t)sz); - return luaL_fileresult(L, res == 0, NULL); -} - - - -static int io_flush (lua_State *L) { - return luaL_fileresult(L, fflush(getiofile(L, IO_OUTPUT)) == 0, NULL); -} - - -static int f_flush (lua_State *L) { - return luaL_fileresult(L, fflush(tofile(L)) == 0, NULL); -} - - -/* -** functions for 'io' library -*/ -static const luaL_Reg iolib[] = { - {"close", io_close}, - {"flush", io_flush}, - {"input", io_input}, - {"lines", io_lines}, - {"open", io_open}, - {"output", io_output}, - {"popen", io_popen}, - {"read", io_read}, - {"tmpfile", io_tmpfile}, - {"type", io_type}, - {"write", io_write}, - {NULL, NULL} -}; - - -/* -** methods for file handles -*/ -static const luaL_Reg meth[] = { - {"read", f_read}, - {"write", f_write}, - {"lines", f_lines}, - {"flush", f_flush}, - {"seek", f_seek}, - {"close", f_close}, - {"setvbuf", f_setvbuf}, - {NULL, NULL} -}; - - -/* -** metamethods for file handles -*/ -static const luaL_Reg metameth[] = { - {"__index", NULL}, /* place holder */ - {"__gc", f_gc}, - {"__close", f_gc}, - {"__tostring", f_tostring}, - {NULL, NULL} -}; - - -static void createmeta (lua_State *L) { - luaL_newmetatable(L, LUA_FILEHANDLE); /* metatable for file handles */ - luaL_setfuncs(L, metameth, 0); /* add metamethods to new metatable */ - luaL_newlibtable(L, meth); /* create method table */ - luaL_setfuncs(L, meth, 0); /* add file methods to method table */ - lua_setfield(L, -2, "__index"); /* metatable.__index = method table */ - lua_pop(L, 1); /* pop metatable */ -} - - -/* -** function to (not) close the standard files stdin, stdout, and stderr -*/ -static int io_noclose (lua_State *L) { - LStream *p = tolstream(L); - p->closef = &io_noclose; /* keep file opened */ - luaL_pushfail(L); - lua_pushliteral(L, "cannot close standard file"); - return 2; -} - - -static void createstdfile (lua_State *L, FILE *f, const char *k, - const char *fname) { - LStream *p = newprefile(L); - p->f = f; - p->closef = &io_noclose; - if (k != NULL) { - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, k); /* add file to registry */ - } - lua_setfield(L, -2, fname); /* add file to module */ -} - - -LUAMOD_API int luaopen_io (lua_State *L) { - luaL_newlib(L, iolib); /* new module */ - createmeta(L); - /* create (and set) default files */ - createstdfile(L, stdin, IO_INPUT, "stdin"); - createstdfile(L, stdout, IO_OUTPUT, "stdout"); - createstdfile(L, stderr, NULL, "stderr"); - return 1; -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ljumptab.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ljumptab.h deleted file mode 100644 index 8306f25..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ljumptab.h +++ /dev/null @@ -1,112 +0,0 @@ -/* -** $Id: ljumptab.h $ -** Jump Table for the Lua interpreter -** See Copyright Notice in lua.h -*/ - - -#undef vmdispatch -#undef vmcase -#undef vmbreak - -#define vmdispatch(x) goto *disptab[x]; - -#define vmcase(l) L_##l: - -#define vmbreak vmfetch(); vmdispatch(GET_OPCODE(i)); - - -static const void *const disptab[NUM_OPCODES] = { - -#if 0 -** you can update the following list with this command: -** -** sed -n '/^OP_/\!d; s/OP_/\&\&L_OP_/ ; s/,.*/,/ ; s/\/.*// ; p' lopcodes.h -** -#endif - -&&L_OP_MOVE, -&&L_OP_LOADI, -&&L_OP_LOADF, -&&L_OP_LOADK, -&&L_OP_LOADKX, -&&L_OP_LOADFALSE, -&&L_OP_LFALSESKIP, -&&L_OP_LOADTRUE, -&&L_OP_LOADNIL, -&&L_OP_GETUPVAL, -&&L_OP_SETUPVAL, -&&L_OP_GETTABUP, -&&L_OP_GETTABLE, -&&L_OP_GETI, -&&L_OP_GETFIELD, -&&L_OP_SETTABUP, -&&L_OP_SETTABLE, -&&L_OP_SETI, -&&L_OP_SETFIELD, -&&L_OP_NEWTABLE, -&&L_OP_SELF, -&&L_OP_ADDI, -&&L_OP_ADDK, -&&L_OP_SUBK, -&&L_OP_MULK, -&&L_OP_MODK, -&&L_OP_POWK, -&&L_OP_DIVK, -&&L_OP_IDIVK, -&&L_OP_BANDK, -&&L_OP_BORK, -&&L_OP_BXORK, -&&L_OP_SHRI, -&&L_OP_SHLI, -&&L_OP_ADD, -&&L_OP_SUB, -&&L_OP_MUL, -&&L_OP_MOD, -&&L_OP_POW, -&&L_OP_DIV, -&&L_OP_IDIV, -&&L_OP_BAND, -&&L_OP_BOR, -&&L_OP_BXOR, -&&L_OP_SHL, -&&L_OP_SHR, -&&L_OP_MMBIN, -&&L_OP_MMBINI, -&&L_OP_MMBINK, -&&L_OP_UNM, -&&L_OP_BNOT, -&&L_OP_NOT, -&&L_OP_LEN, -&&L_OP_CONCAT, -&&L_OP_CLOSE, -&&L_OP_TBC, -&&L_OP_JMP, -&&L_OP_EQ, -&&L_OP_LT, -&&L_OP_LE, -&&L_OP_EQK, -&&L_OP_EQI, -&&L_OP_LTI, -&&L_OP_LEI, -&&L_OP_GTI, -&&L_OP_GEI, -&&L_OP_TEST, -&&L_OP_TESTSET, -&&L_OP_CALL, -&&L_OP_TAILCALL, -&&L_OP_RETURN, -&&L_OP_RETURN0, -&&L_OP_RETURN1, -&&L_OP_FORLOOP, -&&L_OP_FORPREP, -&&L_OP_TFORPREP, -&&L_OP_TFORCALL, -&&L_OP_TFORLOOP, -&&L_OP_SETLIST, -&&L_OP_CLOSURE, -&&L_OP_VARARG, -&&L_OP_VARARGPREP, -&&L_OP_EXTRAARG - -}; diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/llex.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/llex.c deleted file mode 100644 index 9f20d3c..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/llex.c +++ /dev/null @@ -1,581 +0,0 @@ -/* -** $Id: llex.c $ -** Lexical Analyzer -** See Copyright Notice in lua.h -*/ - -#define llex_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "lctype.h" -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "llex.h" -#include "lobject.h" -#include "lparser.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "lzio.h" - - - -#define next(ls) (ls->current = zgetc(ls->z)) - - - -#define currIsNewline(ls) (ls->current == '\n' || ls->current == '\r') - - -/* ORDER RESERVED */ -static const char *const luaX_tokens [] = { - "and", "break", "do", "else", "elseif", - "end", "false", "for", "function", "goto", "if", - "in", "local", "nil", "not", "or", "repeat", - "return", "then", "true", "until", "while", - "//", "..", "...", "==", ">=", "<=", "~=", - "<<", ">>", "::", "", - "", "", "", "" -}; - - -#define save_and_next(ls) (save(ls, ls->current), next(ls)) - - -static l_noret lexerror (LexState *ls, const char *msg, int token); - - -static void save (LexState *ls, int c) { - Mbuffer *b = ls->buff; - if (luaZ_bufflen(b) + 1 > luaZ_sizebuffer(b)) { - size_t newsize; - if (luaZ_sizebuffer(b) >= MAX_SIZE/2) - lexerror(ls, "lexical element too long", 0); - newsize = luaZ_sizebuffer(b) * 2; - luaZ_resizebuffer(ls->L, b, newsize); - } - b->buffer[luaZ_bufflen(b)++] = cast_char(c); -} - - -void luaX_init (lua_State *L) { - int i; - TString *e = luaS_newliteral(L, LUA_ENV); /* create env name */ - luaC_fix(L, obj2gco(e)); /* never collect this name */ - for (i=0; iextra = cast_byte(i+1); /* reserved word */ - } -} - - -const char *luaX_token2str (LexState *ls, int token) { - if (token < FIRST_RESERVED) { /* single-byte symbols? */ - if (lisprint(token)) - return luaO_pushfstring(ls->L, "'%c'", token); - else /* control character */ - return luaO_pushfstring(ls->L, "'<\\%d>'", token); - } - else { - const char *s = luaX_tokens[token - FIRST_RESERVED]; - if (token < TK_EOS) /* fixed format (symbols and reserved words)? */ - return luaO_pushfstring(ls->L, "'%s'", s); - else /* names, strings, and numerals */ - return s; - } -} - - -static const char *txtToken (LexState *ls, int token) { - switch (token) { - case TK_NAME: case TK_STRING: - case TK_FLT: case TK_INT: - save(ls, '\0'); - return luaO_pushfstring(ls->L, "'%s'", luaZ_buffer(ls->buff)); - default: - return luaX_token2str(ls, token); - } -} - - -static l_noret lexerror (LexState *ls, const char *msg, int token) { - msg = luaG_addinfo(ls->L, msg, ls->source, ls->linenumber); - if (token) - luaO_pushfstring(ls->L, "%s near %s", msg, txtToken(ls, token)); - luaD_throw(ls->L, LUA_ERRSYNTAX); -} - - -l_noret luaX_syntaxerror (LexState *ls, const char *msg) { - lexerror(ls, msg, ls->t.token); -} - - -/* -** Creates a new string and anchors it in scanner's table so that it -** will not be collected until the end of the compilation; by that time -** it should be anchored somewhere. It also internalizes long strings, -** ensuring there is only one copy of each unique string. The table -** here is used as a set: the string enters as the key, while its value -** is irrelevant. We use the string itself as the value only because it -** is a TValue readily available. Later, the code generation can change -** this value. -*/ -TString *luaX_newstring (LexState *ls, const char *str, size_t l) { - lua_State *L = ls->L; - TString *ts = luaS_newlstr(L, str, l); /* create new string */ - TString *oldts = luaH_getstrkey(ls->h, ts); - if (oldts != NULL) /* string already present? */ - return oldts; /* use it */ - else { /* create a new entry */ - TValue *stv = s2v(L->top.p++); /* reserve stack space for string */ - setsvalue(L, stv, ts); /* temporarily anchor the string */ - luaH_set(L, ls->h, stv, stv); /* t[string] = string */ - /* table is not a metatable, so it does not need to invalidate cache */ - luaC_checkGC(L); - L->top.p--; /* remove string from stack */ - } - return ts; -} - - -/* -** increment line number and skips newline sequence (any of -** \n, \r, \n\r, or \r\n) -*/ -static void inclinenumber (LexState *ls) { - int old = ls->current; - lua_assert(currIsNewline(ls)); - next(ls); /* skip '\n' or '\r' */ - if (currIsNewline(ls) && ls->current != old) - next(ls); /* skip '\n\r' or '\r\n' */ - if (++ls->linenumber >= MAX_INT) - lexerror(ls, "chunk has too many lines", 0); -} - - -void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source, - int firstchar) { - ls->t.token = 0; - ls->L = L; - ls->current = firstchar; - ls->lookahead.token = TK_EOS; /* no look-ahead token */ - ls->z = z; - ls->fs = NULL; - ls->linenumber = 1; - ls->lastline = 1; - ls->source = source; - ls->envn = luaS_newliteral(L, LUA_ENV); /* get env name */ - luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER); /* initialize buffer */ -} - - - -/* -** ======================================================= -** LEXICAL ANALYZER -** ======================================================= -*/ - - -static int check_next1 (LexState *ls, int c) { - if (ls->current == c) { - next(ls); - return 1; - } - else return 0; -} - - -/* -** Check whether current char is in set 'set' (with two chars) and -** saves it -*/ -static int check_next2 (LexState *ls, const char *set) { - lua_assert(set[2] == '\0'); - if (ls->current == set[0] || ls->current == set[1]) { - save_and_next(ls); - return 1; - } - else return 0; -} - - -/* LUA_NUMBER */ -/* -** This function is quite liberal in what it accepts, as 'luaO_str2num' -** will reject ill-formed numerals. Roughly, it accepts the following -** pattern: -** -** %d(%x|%.|([Ee][+-]?))* | 0[Xx](%x|%.|([Pp][+-]?))* -** -** The only tricky part is to accept [+-] only after a valid exponent -** mark, to avoid reading '3-4' or '0xe+1' as a single number. -** -** The caller might have already read an initial dot. -*/ -static int read_numeral (LexState *ls, SemInfo *seminfo) { - TValue obj; - const char *expo = "Ee"; - int first = ls->current; - lua_assert(lisdigit(ls->current)); - save_and_next(ls); - if (first == '0' && check_next2(ls, "xX")) /* hexadecimal? */ - expo = "Pp"; - for (;;) { - if (check_next2(ls, expo)) /* exponent mark? */ - check_next2(ls, "-+"); /* optional exponent sign */ - else if (lisxdigit(ls->current) || ls->current == '.') /* '%x|%.' */ - save_and_next(ls); - else break; - } - if (lislalpha(ls->current)) /* is numeral touching a letter? */ - save_and_next(ls); /* force an error */ - save(ls, '\0'); - if (luaO_str2num(luaZ_buffer(ls->buff), &obj) == 0) /* format error? */ - lexerror(ls, "malformed number", TK_FLT); - if (ttisinteger(&obj)) { - seminfo->i = ivalue(&obj); - return TK_INT; - } - else { - lua_assert(ttisfloat(&obj)); - seminfo->r = fltvalue(&obj); - return TK_FLT; - } -} - - -/* -** read a sequence '[=*[' or ']=*]', leaving the last bracket. If -** sequence is well formed, return its number of '='s + 2; otherwise, -** return 1 if it is a single bracket (no '='s and no 2nd bracket); -** otherwise (an unfinished '[==...') return 0. -*/ -static size_t skip_sep (LexState *ls) { - size_t count = 0; - int s = ls->current; - lua_assert(s == '[' || s == ']'); - save_and_next(ls); - while (ls->current == '=') { - save_and_next(ls); - count++; - } - return (ls->current == s) ? count + 2 - : (count == 0) ? 1 - : 0; -} - - -static void read_long_string (LexState *ls, SemInfo *seminfo, size_t sep) { - int line = ls->linenumber; /* initial line (for error message) */ - save_and_next(ls); /* skip 2nd '[' */ - if (currIsNewline(ls)) /* string starts with a newline? */ - inclinenumber(ls); /* skip it */ - for (;;) { - switch (ls->current) { - case EOZ: { /* error */ - const char *what = (seminfo ? "string" : "comment"); - const char *msg = luaO_pushfstring(ls->L, - "unfinished long %s (starting at line %d)", what, line); - lexerror(ls, msg, TK_EOS); - break; /* to avoid warnings */ - } - case ']': { - if (skip_sep(ls) == sep) { - save_and_next(ls); /* skip 2nd ']' */ - goto endloop; - } - break; - } - case '\n': case '\r': { - save(ls, '\n'); - inclinenumber(ls); - if (!seminfo) luaZ_resetbuffer(ls->buff); /* avoid wasting space */ - break; - } - default: { - if (seminfo) save_and_next(ls); - else next(ls); - } - } - } endloop: - if (seminfo) - seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + sep, - luaZ_bufflen(ls->buff) - 2 * sep); -} - - -static void esccheck (LexState *ls, int c, const char *msg) { - if (!c) { - if (ls->current != EOZ) - save_and_next(ls); /* add current to buffer for error message */ - lexerror(ls, msg, TK_STRING); - } -} - - -static int gethexa (LexState *ls) { - save_and_next(ls); - esccheck (ls, lisxdigit(ls->current), "hexadecimal digit expected"); - return luaO_hexavalue(ls->current); -} - - -static int readhexaesc (LexState *ls) { - int r = gethexa(ls); - r = (r << 4) + gethexa(ls); - luaZ_buffremove(ls->buff, 2); /* remove saved chars from buffer */ - return r; -} - - -static unsigned long readutf8esc (LexState *ls) { - unsigned long r; - int i = 4; /* chars to be removed: '\', 'u', '{', and first digit */ - save_and_next(ls); /* skip 'u' */ - esccheck(ls, ls->current == '{', "missing '{'"); - r = gethexa(ls); /* must have at least one digit */ - while (cast_void(save_and_next(ls)), lisxdigit(ls->current)) { - i++; - esccheck(ls, r <= (0x7FFFFFFFu >> 4), "UTF-8 value too large"); - r = (r << 4) + luaO_hexavalue(ls->current); - } - esccheck(ls, ls->current == '}', "missing '}'"); - next(ls); /* skip '}' */ - luaZ_buffremove(ls->buff, i); /* remove saved chars from buffer */ - return r; -} - - -static void utf8esc (LexState *ls) { - char buff[UTF8BUFFSZ]; - int n = luaO_utf8esc(buff, readutf8esc(ls)); - for (; n > 0; n--) /* add 'buff' to string */ - save(ls, buff[UTF8BUFFSZ - n]); -} - - -static int readdecesc (LexState *ls) { - int i; - int r = 0; /* result accumulator */ - for (i = 0; i < 3 && lisdigit(ls->current); i++) { /* read up to 3 digits */ - r = 10*r + ls->current - '0'; - save_and_next(ls); - } - esccheck(ls, r <= UCHAR_MAX, "decimal escape too large"); - luaZ_buffremove(ls->buff, i); /* remove read digits from buffer */ - return r; -} - - -static void read_string (LexState *ls, int del, SemInfo *seminfo) { - save_and_next(ls); /* keep delimiter (for error messages) */ - while (ls->current != del) { - switch (ls->current) { - case EOZ: - lexerror(ls, "unfinished string", TK_EOS); - break; /* to avoid warnings */ - case '\n': - case '\r': - lexerror(ls, "unfinished string", TK_STRING); - break; /* to avoid warnings */ - case '\\': { /* escape sequences */ - int c; /* final character to be saved */ - save_and_next(ls); /* keep '\\' for error messages */ - switch (ls->current) { - case 'a': c = '\a'; goto read_save; - case 'b': c = '\b'; goto read_save; - case 'f': c = '\f'; goto read_save; - case 'n': c = '\n'; goto read_save; - case 'r': c = '\r'; goto read_save; - case 't': c = '\t'; goto read_save; - case 'v': c = '\v'; goto read_save; - case 'x': c = readhexaesc(ls); goto read_save; - case 'u': utf8esc(ls); goto no_save; - case '\n': case '\r': - inclinenumber(ls); c = '\n'; goto only_save; - case '\\': case '\"': case '\'': - c = ls->current; goto read_save; - case EOZ: goto no_save; /* will raise an error next loop */ - case 'z': { /* zap following span of spaces */ - luaZ_buffremove(ls->buff, 1); /* remove '\\' */ - next(ls); /* skip the 'z' */ - while (lisspace(ls->current)) { - if (currIsNewline(ls)) inclinenumber(ls); - else next(ls); - } - goto no_save; - } - default: { - esccheck(ls, lisdigit(ls->current), "invalid escape sequence"); - c = readdecesc(ls); /* digital escape '\ddd' */ - goto only_save; - } - } - read_save: - next(ls); - /* go through */ - only_save: - luaZ_buffremove(ls->buff, 1); /* remove '\\' */ - save(ls, c); - /* go through */ - no_save: break; - } - default: - save_and_next(ls); - } - } - save_and_next(ls); /* skip delimiter */ - seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1, - luaZ_bufflen(ls->buff) - 2); -} - - -static int llex (LexState *ls, SemInfo *seminfo) { - luaZ_resetbuffer(ls->buff); - for (;;) { - switch (ls->current) { - case '\n': case '\r': { /* line breaks */ - inclinenumber(ls); - break; - } - case ' ': case '\f': case '\t': case '\v': { /* spaces */ - next(ls); - break; - } - case '-': { /* '-' or '--' (comment) */ - next(ls); - if (ls->current != '-') return '-'; - /* else is a comment */ - next(ls); - if (ls->current == '[') { /* long comment? */ - size_t sep = skip_sep(ls); - luaZ_resetbuffer(ls->buff); /* 'skip_sep' may dirty the buffer */ - if (sep >= 2) { - read_long_string(ls, NULL, sep); /* skip long comment */ - luaZ_resetbuffer(ls->buff); /* previous call may dirty the buff. */ - break; - } - } - /* else short comment */ - while (!currIsNewline(ls) && ls->current != EOZ) - next(ls); /* skip until end of line (or end of file) */ - break; - } - case '[': { /* long string or simply '[' */ - size_t sep = skip_sep(ls); - if (sep >= 2) { - read_long_string(ls, seminfo, sep); - return TK_STRING; - } - else if (sep == 0) /* '[=...' missing second bracket? */ - lexerror(ls, "invalid long string delimiter", TK_STRING); - return '['; - } - case '=': { - next(ls); - if (check_next1(ls, '=')) return TK_EQ; /* '==' */ - else return '='; - } - case '<': { - next(ls); - if (check_next1(ls, '=')) return TK_LE; /* '<=' */ - else if (check_next1(ls, '<')) return TK_SHL; /* '<<' */ - else return '<'; - } - case '>': { - next(ls); - if (check_next1(ls, '=')) return TK_GE; /* '>=' */ - else if (check_next1(ls, '>')) return TK_SHR; /* '>>' */ - else return '>'; - } - case '/': { - next(ls); - if (check_next1(ls, '/')) return TK_IDIV; /* '//' */ - else return '/'; - } - case '~': { - next(ls); - if (check_next1(ls, '=')) return TK_NE; /* '~=' */ - else return '~'; - } - case ':': { - next(ls); - if (check_next1(ls, ':')) return TK_DBCOLON; /* '::' */ - else return ':'; - } - case '"': case '\'': { /* short literal strings */ - read_string(ls, ls->current, seminfo); - return TK_STRING; - } - case '.': { /* '.', '..', '...', or number */ - save_and_next(ls); - if (check_next1(ls, '.')) { - if (check_next1(ls, '.')) - return TK_DOTS; /* '...' */ - else return TK_CONCAT; /* '..' */ - } - else if (!lisdigit(ls->current)) return '.'; - else return read_numeral(ls, seminfo); - } - case '0': case '1': case '2': case '3': case '4': - case '5': case '6': case '7': case '8': case '9': { - return read_numeral(ls, seminfo); - } - case EOZ: { - return TK_EOS; - } - default: { - if (lislalpha(ls->current)) { /* identifier or reserved word? */ - TString *ts; - do { - save_and_next(ls); - } while (lislalnum(ls->current)); - ts = luaX_newstring(ls, luaZ_buffer(ls->buff), - luaZ_bufflen(ls->buff)); - seminfo->ts = ts; - if (isreserved(ts)) /* reserved word? */ - return ts->extra - 1 + FIRST_RESERVED; - else { - return TK_NAME; - } - } - else { /* single-char tokens ('+', '*', '%', '{', '}', ...) */ - int c = ls->current; - next(ls); - return c; - } - } - } - } -} - - -void luaX_next (LexState *ls) { - ls->lastline = ls->linenumber; - if (ls->lookahead.token != TK_EOS) { /* is there a look-ahead token? */ - ls->t = ls->lookahead; /* use this one */ - ls->lookahead.token = TK_EOS; /* and discharge it */ - } - else - ls->t.token = llex(ls, &ls->t.seminfo); /* read next token */ -} - - -int luaX_lookahead (LexState *ls) { - lua_assert(ls->lookahead.token == TK_EOS); - ls->lookahead.token = llex(ls, &ls->lookahead.seminfo); - return ls->lookahead.token; -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/llex.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/llex.h deleted file mode 100644 index 389d2f8..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/llex.h +++ /dev/null @@ -1,91 +0,0 @@ -/* -** $Id: llex.h $ -** Lexical Analyzer -** See Copyright Notice in lua.h -*/ - -#ifndef llex_h -#define llex_h - -#include - -#include "lobject.h" -#include "lzio.h" - - -/* -** Single-char tokens (terminal symbols) are represented by their own -** numeric code. Other tokens start at the following value. -*/ -#define FIRST_RESERVED (UCHAR_MAX + 1) - - -#if !defined(LUA_ENV) -#define LUA_ENV "_ENV" -#endif - - -/* -* WARNING: if you change the order of this enumeration, -* grep "ORDER RESERVED" -*/ -enum RESERVED { - /* terminal symbols denoted by reserved words */ - TK_AND = FIRST_RESERVED, TK_BREAK, - TK_DO, TK_ELSE, TK_ELSEIF, TK_END, TK_FALSE, TK_FOR, TK_FUNCTION, - TK_GOTO, TK_IF, TK_IN, TK_LOCAL, TK_NIL, TK_NOT, TK_OR, TK_REPEAT, - TK_RETURN, TK_THEN, TK_TRUE, TK_UNTIL, TK_WHILE, - /* other terminal symbols */ - TK_IDIV, TK_CONCAT, TK_DOTS, TK_EQ, TK_GE, TK_LE, TK_NE, - TK_SHL, TK_SHR, - TK_DBCOLON, TK_EOS, - TK_FLT, TK_INT, TK_NAME, TK_STRING -}; - -/* number of reserved words */ -#define NUM_RESERVED (cast_int(TK_WHILE-FIRST_RESERVED + 1)) - - -typedef union { - lua_Number r; - lua_Integer i; - TString *ts; -} SemInfo; /* semantics information */ - - -typedef struct Token { - int token; - SemInfo seminfo; -} Token; - - -/* state of the lexer plus state of the parser when shared by all - functions */ -typedef struct LexState { - int current; /* current character (charint) */ - int linenumber; /* input line counter */ - int lastline; /* line of last token 'consumed' */ - Token t; /* current token */ - Token lookahead; /* look ahead token */ - struct FuncState *fs; /* current function (parser) */ - struct lua_State *L; - ZIO *z; /* input stream */ - Mbuffer *buff; /* buffer for tokens */ - Table *h; /* to avoid collection/reuse strings */ - struct Dyndata *dyd; /* dynamic structures used by the parser */ - TString *source; /* current source name */ - TString *envn; /* environment variable name */ -} LexState; - - -LUAI_FUNC void luaX_init (lua_State *L); -LUAI_FUNC void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, - TString *source, int firstchar); -LUAI_FUNC TString *luaX_newstring (LexState *ls, const char *str, size_t l); -LUAI_FUNC void luaX_next (LexState *ls); -LUAI_FUNC int luaX_lookahead (LexState *ls); -LUAI_FUNC l_noret luaX_syntaxerror (LexState *ls, const char *s); -LUAI_FUNC const char *luaX_token2str (LexState *ls, int token); - - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/llimits.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/llimits.h deleted file mode 100644 index a32e977..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/llimits.h +++ /dev/null @@ -1,383 +0,0 @@ -/* -** $Id: llimits.h $ -** Limits, basic types, and some other 'installation-dependent' definitions -** See Copyright Notice in lua.h -*/ - -#ifndef llimits_h -#define llimits_h - - -#include -#include - - -#include "lua.h" - - -/* -** 'lu_mem' is an unsigned integer big enough to count the total memory -** used by Lua (in bytes). 'l_obj' is a signed integer big enough to -** count the total number of objects used by Lua. (It is signed due -** to the use of debt in several computations.) Usually, 'size_t' and -** 'ptrdiff_t' should work, but we use 'long' for 16-bit machines. -*/ -#if defined(LUAI_MEM) /* { external definitions? */ -typedef LUAI_UMEM lu_mem; -typedef LUAI_MEM l_obj; -#elif LUAI_IS32INT /* }{ */ -typedef size_t lu_mem; -typedef ptrdiff_t l_obj; -#else /* 16-bit ints */ /* }{ */ -typedef unsigned long lu_mem; -typedef long l_obj; -#endif /* } */ - -#define MAX_LOBJ \ - cast(l_obj, (cast(lu_mem, 1) << (sizeof(l_obj) * CHAR_BIT - 1)) - 1) - - -/* chars used as small naturals (so that 'char' is reserved for characters) */ -typedef unsigned char lu_byte; -typedef signed char ls_byte; - - -/* maximum value for size_t */ -#define MAX_SIZET ((size_t)(~(size_t)0)) - -/* -** Maximum size for strings and userdata visible for Lua (should be -** representable in a lua_Integer) -*/ -#define MAX_SIZE (sizeof(size_t) < sizeof(lua_Integer) ? MAX_SIZET \ - : (size_t)(LUA_MAXINTEGER)) - - -#define MAX_INT INT_MAX /* maximum value of an int */ - - -/* -** floor of the log2 of the maximum signed value for integral type 't'. -** (That is, maximum 'n' such that '2^n' fits in the given signed type.) -*/ -#define log2maxs(t) cast_int(sizeof(t) * 8 - 2) - - -/* -** test whether an unsigned value is a power of 2 (or zero) -*/ -#define ispow2(x) (((x) & ((x) - 1)) == 0) - - -/* number of chars of a literal string without the ending \0 */ -#define LL(x) (sizeof(x)/sizeof(char) - 1) - - -/* -** conversion of pointer to unsigned integer: this is for hashing only; -** there is no problem if the integer cannot hold the whole pointer -** value. (In strict ISO C this may cause undefined behavior, but no -** actual machine seems to bother.) -*/ -#if !defined(LUA_USE_C89) && defined(__STDC_VERSION__) && \ - __STDC_VERSION__ >= 199901L -#include -#if defined(UINTPTR_MAX) /* even in C99 this type is optional */ -#define L_P2I uintptr_t -#else /* no 'intptr'? */ -#define L_P2I uintmax_t /* use the largest available integer */ -#endif -#else /* C89 option */ -#define L_P2I size_t -#endif - -#define point2uint(p) cast_uint((L_P2I)(p) & UINT_MAX) - - - -/* types of 'usual argument conversions' for lua_Number and lua_Integer */ -typedef LUAI_UACNUMBER l_uacNumber; -typedef LUAI_UACINT l_uacInt; - - -/* -** Internal assertions for in-house debugging -*/ -#if defined LUAI_ASSERT -#undef NDEBUG -#include -#define lua_assert(c) assert(c) -#endif - -#if defined(lua_assert) -#define check_exp(c,e) (lua_assert(c), (e)) -/* to avoid problems with conditions too long */ -#define lua_longassert(c) ((c) ? (void)0 : lua_assert(0)) -#else -#define lua_assert(c) ((void)0) -#define check_exp(c,e) (e) -#define lua_longassert(c) ((void)0) -#endif - -/* -** assertion for checking API calls -*/ -#if !defined(luai_apicheck) -#define luai_apicheck(l,e) ((void)l, lua_assert(e)) -#endif - -#define api_check(l,e,msg) luai_apicheck(l,(e) && msg) - - -/* macro to avoid warnings about unused variables */ -#if !defined(UNUSED) -#define UNUSED(x) ((void)(x)) -#endif - - -/* type casts (a macro highlights casts in the code) */ -#define cast(t, exp) ((t)(exp)) - -#define cast_void(i) cast(void, (i)) -#define cast_voidp(i) cast(void *, (i)) -#define cast_num(i) cast(lua_Number, (i)) -#define cast_int(i) cast(int, (i)) -#define cast_uint(i) cast(unsigned int, (i)) -#define cast_byte(i) cast(lu_byte, (i)) -#define cast_uchar(i) cast(unsigned char, (i)) -#define cast_char(i) cast(char, (i)) -#define cast_charp(i) cast(char *, (i)) -#define cast_sizet(i) cast(size_t, (i)) - - -/* cast a signed lua_Integer to lua_Unsigned */ -#if !defined(l_castS2U) -#define l_castS2U(i) ((lua_Unsigned)(i)) -#endif - -/* -** cast a lua_Unsigned to a signed lua_Integer; this cast is -** not strict ISO C, but two-complement architectures should -** work fine. -*/ -#if !defined(l_castU2S) -#define l_castU2S(i) ((lua_Integer)(i)) -#endif - - -/* -** non-return type -*/ -#if !defined(l_noret) - -#if defined(__GNUC__) -#define l_noret void __attribute__((noreturn)) -#elif defined(_MSC_VER) && _MSC_VER >= 1200 -#define l_noret void __declspec(noreturn) -#else -#define l_noret void -#endif - -#endif - - -/* -** Inline functions -*/ -#if !defined(LUA_USE_C89) -#define l_inline inline -#elif defined(__GNUC__) -#define l_inline __inline__ -#else -#define l_inline /* empty */ -#endif - -#define l_sinline static l_inline - - -/* -** type for virtual-machine instructions; -** must be an unsigned with (at least) 4 bytes (see details in lopcodes.h) -*/ -#if LUAI_IS32INT -typedef unsigned int l_uint32; -#else -typedef unsigned long l_uint32; -#endif - -typedef l_uint32 Instruction; - - - -/* -** Maximum length for short strings, that is, strings that are -** internalized. (Cannot be smaller than reserved words or tags for -** metamethods, as these strings must be internalized; -** #("function") = 8, #("__newindex") = 10.) -*/ -#if !defined(LUAI_MAXSHORTLEN) -#define LUAI_MAXSHORTLEN 40 -#endif - - -/* -** Initial size for the string table (must be power of 2). -** The Lua core alone registers ~50 strings (reserved words + -** metaevent keys + a few others). Libraries would typically add -** a few dozens more. -*/ -#if !defined(MINSTRTABSIZE) -#define MINSTRTABSIZE 128 -#endif - - -/* -** Size of cache for strings in the API. 'N' is the number of -** sets (better be a prime) and "M" is the size of each set (M == 1 -** makes a direct cache.) -*/ -#if !defined(STRCACHE_N) -#define STRCACHE_N 53 -#define STRCACHE_M 2 -#endif - - -/* minimum size for string buffer */ -#if !defined(LUA_MINBUFFER) -#define LUA_MINBUFFER 32 -#endif - - -/* -** Maximum depth for nested C calls, syntactical nested non-terminals, -** and other features implemented through recursion in C. (Value must -** fit in a 16-bit unsigned integer. It must also be compatible with -** the size of the C stack.) -*/ -#if !defined(LUAI_MAXCCALLS) -#define LUAI_MAXCCALLS 200 -#endif - - -/* -** macros that are executed whenever program enters the Lua core -** ('lua_lock') and leaves the core ('lua_unlock') -*/ -#if !defined(lua_lock) -#define lua_lock(L) ((void) 0) -#define lua_unlock(L) ((void) 0) -#endif - -/* -** macro executed during Lua functions at points where the -** function can yield. -*/ -#if !defined(luai_threadyield) -#define luai_threadyield(L) {lua_unlock(L); lua_lock(L);} -#endif - - -/* -** these macros allow user-specific actions when a thread is -** created/deleted/resumed/yielded. -*/ -#if !defined(luai_userstateopen) -#define luai_userstateopen(L) ((void)L) -#endif - -#if !defined(luai_userstateclose) -#define luai_userstateclose(L) ((void)L) -#endif - -#if !defined(luai_userstatethread) -#define luai_userstatethread(L,L1) ((void)L) -#endif - -#if !defined(luai_userstatefree) -#define luai_userstatefree(L,L1) ((void)L) -#endif - -#if !defined(luai_userstateresume) -#define luai_userstateresume(L,n) ((void)L) -#endif - -#if !defined(luai_userstateyield) -#define luai_userstateyield(L,n) ((void)L) -#endif - - - -/* -** The luai_num* macros define the primitive operations over numbers. -*/ - -/* floor division (defined as 'floor(a/b)') */ -#if !defined(luai_numidiv) -#define luai_numidiv(L,a,b) ((void)L, l_floor(luai_numdiv(L,a,b))) -#endif - -/* float division */ -#if !defined(luai_numdiv) -#define luai_numdiv(L,a,b) ((a)/(b)) -#endif - -/* -** modulo: defined as 'a - floor(a/b)*b'; the direct computation -** using this definition has several problems with rounding errors, -** so it is better to use 'fmod'. 'fmod' gives the result of -** 'a - trunc(a/b)*b', and therefore must be corrected when -** 'trunc(a/b) ~= floor(a/b)'. That happens when the division has a -** non-integer negative result: non-integer result is equivalent to -** a non-zero remainder 'm'; negative result is equivalent to 'a' and -** 'b' with different signs, or 'm' and 'b' with different signs -** (as the result 'm' of 'fmod' has the same sign of 'a'). -*/ -#if !defined(luai_nummod) -#define luai_nummod(L,a,b,m) \ - { (void)L; (m) = l_mathop(private_lua_embed_fmod)(a,b); \ - if (((m) > 0) ? (b) < 0 : ((m) < 0 && (b) > 0)) (m) += (b); } -#endif - -/* exponentiation */ -#if !defined(luai_numpow) -#define luai_numpow(L,a,b) \ - ((void)L, (b == 2) ? (a)*(a) : l_mathop(private_lua_embed_pow)(a,b)) -#endif - -/* the others are quite standard operations */ -#if !defined(luai_numadd) -#define luai_numadd(L,a,b) ((a)+(b)) -#define luai_numsub(L,a,b) ((a)-(b)) -#define luai_nummul(L,a,b) ((a)*(b)) -#define luai_numunm(L,a) (-(a)) -#define luai_numeq(a,b) ((a)==(b)) -#define luai_numlt(a,b) ((a)<(b)) -#define luai_numle(a,b) ((a)<=(b)) -#define luai_numgt(a,b) ((a)>(b)) -#define luai_numge(a,b) ((a)>=(b)) -#define luai_numisnan(a) (!luai_numeq((a), (a))) -#endif - - - - - -/* -** macro to control inclusion of some hard tests on stack reallocation -*/ -#if !defined(HARDSTACKTESTS) -#define condmovestack(L,pre,pos) ((void)0) -#else -/* realloc stack keeping its size */ -#define condmovestack(L,pre,pos) \ - { int sz_ = stacksize(L); pre; luaD_reallocstack((L), sz_, 0); pos; } -#endif - -#if !defined(HARDMEMTESTS) -#define condchangemem(L,pre,pos) ((void)0) -#else -#define condchangemem(L,pre,pos) \ - { if (gcrunning(G(L))) { pre; luaC_fullgc(L, 0); pos; } } -#endif - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lmathlib.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lmathlib.c deleted file mode 100644 index 768e965..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lmathlib.c +++ /dev/null @@ -1,771 +0,0 @@ -/* -** $Id: lmathlib.c $ -** Standard mathematical library -** See Copyright Notice in lua.h -*/ - -#define lmathlib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -#undef PI -#define PI (l_mathop(3.141592653589793238462643383279502884)) - - -static int math_abs (lua_State *L) { - if (lua_isinteger(L, 1)) { - lua_Integer n = lua_tointeger(L, 1); - if (n < 0) n = (lua_Integer)(0u - (lua_Unsigned)n); - lua_pushinteger(L, n); - } - else - lua_pushnumber(L, l_mathop(fabs)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_sin (lua_State *L) { - lua_pushnumber(L, l_mathop(sin)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_cos (lua_State *L) { - lua_pushnumber(L, l_mathop(cos)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_tan (lua_State *L) { - lua_pushnumber(L, l_mathop(tan)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_asin (lua_State *L) { - lua_pushnumber(L, l_mathop(asin)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_acos (lua_State *L) { - lua_pushnumber(L, l_mathop(acos)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_atan (lua_State *L) { - lua_Number y = luaL_checknumber(L, 1); - lua_Number x = luaL_optnumber(L, 2, 1); - lua_pushnumber(L, l_mathop(atan2)(y, x)); - return 1; -} - - -static int math_toint (lua_State *L) { - int valid; - lua_Integer n = lua_tointegerx(L, 1, &valid); - if (l_likely(valid)) - lua_pushinteger(L, n); - else { - luaL_checkany(L, 1); - luaL_pushfail(L); /* value is not convertible to integer */ - } - return 1; -} - - -static void pushnumint (lua_State *L, lua_Number d) { - lua_Integer n; - if (lua_numbertointeger(d, &n)) /* does 'd' fit in an integer? */ - lua_pushinteger(L, n); /* result is integer */ - else - lua_pushnumber(L, d); /* result is float */ -} - - -static int math_floor (lua_State *L) { - if (lua_isinteger(L, 1)) - lua_settop(L, 1); /* integer is its own floor */ - else { - lua_Number d = l_mathop(floor)(luaL_checknumber(L, 1)); - pushnumint(L, d); - } - return 1; -} - - -static int math_ceil (lua_State *L) { - if (lua_isinteger(L, 1)) - lua_settop(L, 1); /* integer is its own ceil */ - else { - lua_Number d = l_mathop(ceil)(luaL_checknumber(L, 1)); - pushnumint(L, d); - } - return 1; -} - - -static int math_fmod (lua_State *L) { - if (lua_isinteger(L, 1) && lua_isinteger(L, 2)) { - lua_Integer d = lua_tointeger(L, 2); - if ((lua_Unsigned)d + 1u <= 1u) { /* special cases: -1 or 0 */ - luaL_argcheck(L, d != 0, 2, "zero"); - lua_pushinteger(L, 0); /* avoid overflow with 0x80000... / -1 */ - } - else - lua_pushinteger(L, lua_tointeger(L, 1) % d); - } - else - lua_pushnumber(L, l_mathop(private_lua_embed_fmod)(luaL_checknumber(L, 1), - luaL_checknumber(L, 2))); - return 1; -} - - -/* -** next function does not use 'modf', avoiding problems with 'double*' -** (which is not compatible with 'float*') when lua_Number is not -** 'double'. -*/ -static int math_modf (lua_State *L) { - if (lua_isinteger(L ,1)) { - lua_settop(L, 1); /* number is its own integer part */ - lua_pushnumber(L, 0); /* no fractional part */ - } - else { - lua_Number n = luaL_checknumber(L, 1); - /* integer part (rounds toward zero) */ - lua_Number ip = (n < 0) ? l_mathop(ceil)(n) : l_mathop(floor)(n); - pushnumint(L, ip); - /* fractional part (test needed for inf/-inf) */ - lua_pushnumber(L, (n == ip) ? l_mathop(0.0) : (n - ip)); - } - return 2; -} - - -static int math_sqrt (lua_State *L) { - lua_pushnumber(L, l_mathop(sqrt)(luaL_checknumber(L, 1))); - return 1; -} - - -static int math_ult (lua_State *L) { - lua_Integer a = luaL_checkinteger(L, 1); - lua_Integer b = luaL_checkinteger(L, 2); - lua_pushboolean(L, (lua_Unsigned)a < (lua_Unsigned)b); - return 1; -} - -static int math_log (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - lua_Number res; - if (lua_isnoneornil(L, 2)) - res = l_mathop(log)(x); - else { - lua_Number base = luaL_checknumber(L, 2); -#if !defined(LUA_USE_C89) - if (base == l_mathop(2.0)) - res = l_mathop(log2)(x); - else -#endif - if (base == l_mathop(10.0)) - res = l_mathop(log10)(x); - else - res = l_mathop(log)(x)/l_mathop(log)(base); - } - lua_pushnumber(L, res); - return 1; -} - -static int math_exp (lua_State *L) { - lua_pushnumber(L, l_mathop(exp)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_deg (lua_State *L) { - lua_pushnumber(L, luaL_checknumber(L, 1) * (l_mathop(180.0) / PI)); - return 1; -} - -static int math_rad (lua_State *L) { - lua_pushnumber(L, luaL_checknumber(L, 1) * (PI / l_mathop(180.0))); - return 1; -} - - -static int math_min (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - int imin = 1; /* index of current minimum value */ - int i; - luaL_argcheck(L, n >= 1, 1, "value expected"); - for (i = 2; i <= n; i++) { - if (lua_compare(L, i, imin, LUA_OPLT)) - imin = i; - } - lua_pushvalue(L, imin); - return 1; -} - - -static int math_max (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - int imax = 1; /* index of current maximum value */ - int i; - luaL_argcheck(L, n >= 1, 1, "value expected"); - for (i = 2; i <= n; i++) { - if (lua_compare(L, imax, i, LUA_OPLT)) - imax = i; - } - lua_pushvalue(L, imax); - return 1; -} - - -static int math_type (lua_State *L) { - if (lua_type(L, 1) == LUA_TNUMBER) - lua_pushstring(L, (lua_isinteger(L, 1)) ? "integer" : "float"); - else { - luaL_checkany(L, 1); - luaL_pushfail(L); - } - return 1; -} - - - -/* -** {================================================================== -** Pseudo-Random Number Generator based on 'xoshiro256**'. -** =================================================================== -*/ - -/* -** This code uses lots of shifts. ANSI C does not allow shifts greater -** than or equal to the width of the type being shifted, so some shifts -** are written in convoluted ways to match that restriction. For -** preprocessor tests, it assumes a width of 32 bits, so the maximum -** shift there is 31 bits. -*/ - - -/* number of binary digits in the mantissa of a float */ -#define FIGS l_floatatt(MANT_DIG) - -#if FIGS > 64 -/* there are only 64 random bits; use them all */ -#undef FIGS -#define FIGS 64 -#endif - - -/* -** LUA_RAND32 forces the use of 32-bit integers in the implementation -** of the PRN generator (mainly for testing). -*/ -#if !defined(LUA_RAND32) && !defined(Rand64) - -/* try to find an integer type with at least 64 bits */ - -#if ((ULONG_MAX >> 31) >> 31) >= 3 - -/* 'long' has at least 64 bits */ -#define Rand64 unsigned long -#define SRand64 long - -#elif !defined(LUA_USE_C89) && defined(LLONG_MAX) - -/* there is a 'long long' type (which must have at least 64 bits) */ -#define Rand64 unsigned long long -#define SRand64 long long - -#elif ((LUA_MAXUNSIGNED >> 31) >> 31) >= 3 - -/* 'lua_Unsigned' has at least 64 bits */ -#define Rand64 lua_Unsigned -#define SRand64 lua_Integer - -#endif - -#endif - - -#if defined(Rand64) /* { */ - -/* -** Standard implementation, using 64-bit integers. -** If 'Rand64' has more than 64 bits, the extra bits do not interfere -** with the 64 initial bits, except in a right shift. Moreover, the -** final result has to discard the extra bits. -*/ - -/* avoid using extra bits when needed */ -#define trim64(x) ((x) & 0xffffffffffffffffu) - - -/* rotate left 'x' by 'n' bits */ -static Rand64 rotl (Rand64 x, int n) { - return (x << n) | (trim64(x) >> (64 - n)); -} - -static Rand64 nextrand (Rand64 *state) { - Rand64 state0 = state[0]; - Rand64 state1 = state[1]; - Rand64 state2 = state[2] ^ state0; - Rand64 state3 = state[3] ^ state1; - Rand64 res = rotl(state1 * 5, 7) * 9; - state[0] = state0 ^ state3; - state[1] = state1 ^ state2; - state[2] = state2 ^ (state1 << 17); - state[3] = rotl(state3, 45); - return res; -} - - -/* -** Convert bits from a random integer into a float in the -** interval [0,1), getting the higher FIG bits from the -** random unsigned integer and converting that to a float. -** Some old Microsoft compilers cannot cast an unsigned long -** to a floating-point number, so we use a signed long as an -** intermediary. When lua_Number is float or double, the shift ensures -** that 'sx' is non negative; in that case, a good compiler will remove -** the correction. -*/ - -/* must throw out the extra (64 - FIGS) bits */ -#define shift64_FIG (64 - FIGS) - -/* 2^(-FIGS) == 2^-1 / 2^(FIGS-1) */ -#define scaleFIG (l_mathop(0.5) / ((Rand64)1 << (FIGS - 1))) - -static lua_Number I2d (Rand64 x) { - SRand64 sx = (SRand64)(trim64(x) >> shift64_FIG); - lua_Number res = (lua_Number)(sx) * scaleFIG; - if (sx < 0) - res += l_mathop(1.0); /* correct the two's complement if negative */ - lua_assert(0 <= res && res < 1); - return res; -} - -/* convert a 'Rand64' to a 'lua_Unsigned' */ -#define I2UInt(x) ((lua_Unsigned)trim64(x)) - -/* convert a 'lua_Unsigned' to a 'Rand64' */ -#define Int2I(x) ((Rand64)(x)) - - -#else /* no 'Rand64' }{ */ - -/* get an integer with at least 32 bits */ -#if LUAI_IS32INT -typedef unsigned int lu_int32; -#else -typedef unsigned long lu_int32; -#endif - - -/* -** Use two 32-bit integers to represent a 64-bit quantity. -*/ -typedef struct Rand64 { - lu_int32 h; /* higher half */ - lu_int32 l; /* lower half */ -} Rand64; - - -/* -** If 'lu_int32' has more than 32 bits, the extra bits do not interfere -** with the 32 initial bits, except in a right shift and comparisons. -** Moreover, the final result has to discard the extra bits. -*/ - -/* avoid using extra bits when needed */ -#define trim32(x) ((x) & 0xffffffffu) - - -/* -** basic operations on 'Rand64' values -*/ - -/* build a new Rand64 value */ -static Rand64 packI (lu_int32 h, lu_int32 l) { - Rand64 result; - result.h = h; - result.l = l; - return result; -} - -/* return i << n */ -static Rand64 Ishl (Rand64 i, int n) { - lua_assert(n > 0 && n < 32); - return packI((i.h << n) | (trim32(i.l) >> (32 - n)), i.l << n); -} - -/* i1 ^= i2 */ -static void Ixor (Rand64 *i1, Rand64 i2) { - i1->h ^= i2.h; - i1->l ^= i2.l; -} - -/* return i1 + i2 */ -static Rand64 Iadd (Rand64 i1, Rand64 i2) { - Rand64 result = packI(i1.h + i2.h, i1.l + i2.l); - if (trim32(result.l) < trim32(i1.l)) /* carry? */ - result.h++; - return result; -} - -/* return i * 5 */ -static Rand64 times5 (Rand64 i) { - return Iadd(Ishl(i, 2), i); /* i * 5 == (i << 2) + i */ -} - -/* return i * 9 */ -static Rand64 times9 (Rand64 i) { - return Iadd(Ishl(i, 3), i); /* i * 9 == (i << 3) + i */ -} - -/* return 'i' rotated left 'n' bits */ -static Rand64 rotl (Rand64 i, int n) { - lua_assert(n > 0 && n < 32); - return packI((i.h << n) | (trim32(i.l) >> (32 - n)), - (trim32(i.h) >> (32 - n)) | (i.l << n)); -} - -/* for offsets larger than 32, rotate right by 64 - offset */ -static Rand64 rotl1 (Rand64 i, int n) { - lua_assert(n > 32 && n < 64); - n = 64 - n; - return packI((trim32(i.h) >> n) | (i.l << (32 - n)), - (i.h << (32 - n)) | (trim32(i.l) >> n)); -} - -/* -** implementation of 'xoshiro256**' algorithm on 'Rand64' values -*/ -static Rand64 nextrand (Rand64 *state) { - Rand64 res = times9(rotl(times5(state[1]), 7)); - Rand64 t = Ishl(state[1], 17); - Ixor(&state[2], state[0]); - Ixor(&state[3], state[1]); - Ixor(&state[1], state[2]); - Ixor(&state[0], state[3]); - Ixor(&state[2], t); - state[3] = rotl1(state[3], 45); - return res; -} - - -/* -** Converts a 'Rand64' into a float. -*/ - -/* an unsigned 1 with proper type */ -#define UONE ((lu_int32)1) - - -#if FIGS <= 32 - -/* 2^(-FIGS) */ -#define scaleFIG (l_mathop(0.5) / (UONE << (FIGS - 1))) - -/* -** get up to 32 bits from higher half, shifting right to -** throw out the extra bits. -*/ -static lua_Number I2d (Rand64 x) { - lua_Number h = (lua_Number)(trim32(x.h) >> (32 - FIGS)); - return h * scaleFIG; -} - -#else /* 32 < FIGS <= 64 */ - -/* 2^(-FIGS) = 1.0 / 2^30 / 2^3 / 2^(FIGS-33) */ -#define scaleFIG \ - (l_mathop(1.0) / (UONE << 30) / l_mathop(8.0) / (UONE << (FIGS - 33))) - -/* -** use FIGS - 32 bits from lower half, throwing out the other -** (32 - (FIGS - 32)) = (64 - FIGS) bits -*/ -#define shiftLOW (64 - FIGS) - -/* -** higher 32 bits go after those (FIGS - 32) bits: shiftHI = 2^(FIGS - 32) -*/ -#define shiftHI ((lua_Number)(UONE << (FIGS - 33)) * l_mathop(2.0)) - - -static lua_Number I2d (Rand64 x) { - lua_Number h = (lua_Number)trim32(x.h) * shiftHI; - lua_Number l = (lua_Number)(trim32(x.l) >> shiftLOW); - return (h + l) * scaleFIG; -} - -#endif - - -/* convert a 'Rand64' to a 'lua_Unsigned' */ -static lua_Unsigned I2UInt (Rand64 x) { - return (((lua_Unsigned)trim32(x.h) << 31) << 1) | (lua_Unsigned)trim32(x.l); -} - -/* convert a 'lua_Unsigned' to a 'Rand64' */ -static Rand64 Int2I (lua_Unsigned n) { - return packI((lu_int32)((n >> 31) >> 1), (lu_int32)n); -} - -#endif /* } */ - - -/* -** A state uses four 'Rand64' values. -*/ -typedef struct { - Rand64 s[4]; -} RanState; - - -/* -** Project the random integer 'ran' into the interval [0, n]. -** Because 'ran' has 2^B possible values, the projection can only be -** uniform when the size of the interval is a power of 2 (exact -** division). Otherwise, to get a uniform projection into [0, n], we -** first compute 'lim', the smallest Mersenne number not smaller than -** 'n'. We then project 'ran' into the interval [0, lim]. If the result -** is inside [0, n], we are done. Otherwise, we try with another 'ran', -** until we have a result inside the interval. -*/ -static lua_Unsigned project (lua_Unsigned ran, lua_Unsigned n, - RanState *state) { - if ((n & (n + 1)) == 0) /* is 'n + 1' a power of 2? */ - return ran & n; /* no bias */ - else { - lua_Unsigned lim = n; - /* compute the smallest (2^b - 1) not smaller than 'n' */ - lim |= (lim >> 1); - lim |= (lim >> 2); - lim |= (lim >> 4); - lim |= (lim >> 8); - lim |= (lim >> 16); -#if (LUA_MAXUNSIGNED >> 31) >= 3 - lim |= (lim >> 32); /* integer type has more than 32 bits */ -#endif - lua_assert((lim & (lim + 1)) == 0 /* 'lim + 1' is a power of 2, */ - && lim >= n /* not smaller than 'n', */ - && (lim >> 1) < n); /* and it is the smallest one */ - while ((ran &= lim) > n) /* project 'ran' into [0..lim] */ - ran = I2UInt(nextrand(state->s)); /* not inside [0..n]? try again */ - return ran; - } -} - - -static int math_random (lua_State *L) { - lua_Integer low, up; - lua_Unsigned p; - RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1)); - Rand64 rv = nextrand(state->s); /* next pseudo-random value */ - switch (lua_gettop(L)) { /* check number of arguments */ - case 0: { /* no arguments */ - lua_pushnumber(L, I2d(rv)); /* float between 0 and 1 */ - return 1; - } - case 1: { /* only upper limit */ - low = 1; - up = luaL_checkinteger(L, 1); - if (up == 0) { /* single 0 as argument? */ - lua_pushinteger(L, I2UInt(rv)); /* full random integer */ - return 1; - } - break; - } - case 2: { /* lower and upper limits */ - low = luaL_checkinteger(L, 1); - up = luaL_checkinteger(L, 2); - break; - } - default: return luaL_error(L, "wrong number of arguments"); - } - /* random integer in the interval [low, up] */ - luaL_argcheck(L, low <= up, 1, "interval is empty"); - /* project random integer into the interval [0, up - low] */ - p = project(I2UInt(rv), (lua_Unsigned)up - (lua_Unsigned)low, state); - lua_pushinteger(L, p + (lua_Unsigned)low); - return 1; -} - - -static void setseed (lua_State *L, Rand64 *state, - lua_Unsigned n1, lua_Unsigned n2) { - int i; - state[0] = Int2I(n1); - state[1] = Int2I(0xff); /* avoid a zero state */ - state[2] = Int2I(n2); - state[3] = Int2I(0); - for (i = 0; i < 16; i++) - nextrand(state); /* discard initial values to "spread" seed */ - lua_pushinteger(L, n1); - lua_pushinteger(L, n2); -} - - -static int math_randomseed (lua_State *L) { - RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1)); - lua_Unsigned n1, n2; - if (lua_isnone(L, 1)) { - n1 = luaL_makeseed(L); /* "random" seed */ - n2 = I2UInt(nextrand(state->s)); /* in case seed is not that random... */ - } - else { - n1 = luaL_checkinteger(L, 1); - n2 = luaL_optinteger(L, 2, 0); - } - setseed(L, state->s, n1, n2); - return 2; /* return seeds */ -} - - -static const luaL_Reg randfuncs[] = { - {"random", math_random}, - {"randomseed", math_randomseed}, - {NULL, NULL} -}; - - -/* -** Register the random functions and initialize their state. -*/ -static void setrandfunc (lua_State *L) { - RanState *state = (RanState *)lua_newuserdatauv(L, sizeof(RanState), 0); - setseed(L, state->s, luaL_makeseed(L), 0); /* initialize with random seed */ - lua_pop(L, 2); /* remove pushed seeds */ - luaL_setfuncs(L, randfuncs, 1); -} - -/* }================================================================== */ - - -/* -** {================================================================== -** Deprecated functions (for compatibility only) -** =================================================================== -*/ -#if defined(LUA_COMPAT_MATHLIB) - -static int math_cosh (lua_State *L) { - lua_pushnumber(L, l_mathop(cosh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_sinh (lua_State *L) { - lua_pushnumber(L, l_mathop(sinh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_tanh (lua_State *L) { - lua_pushnumber(L, l_mathop(tanh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_pow (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - lua_Number y = luaL_checknumber(L, 2); - lua_pushnumber(L, l_mathop(pow)(x, y)); - return 1; -} - -static int math_frexp (lua_State *L) { - int e; - lua_pushnumber(L, l_mathop(frexp)(luaL_checknumber(L, 1), &e)); - lua_pushinteger(L, e); - return 2; -} - -static int math_ldexp (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - int ep = (int)luaL_checkinteger(L, 2); - lua_pushnumber(L, l_mathop(ldexp)(x, ep)); - return 1; -} - -static int math_log10 (lua_State *L) { - lua_pushnumber(L, l_mathop(log10)(luaL_checknumber(L, 1))); - return 1; -} - -#endif -/* }================================================================== */ - - - -static const luaL_Reg mathlib[] = { - {"abs", math_abs}, - {"acos", math_acos}, - {"asin", math_asin}, - {"atan", math_atan}, - {"ceil", math_ceil}, - {"cos", math_cos}, - {"deg", math_deg}, - {"exp", math_exp}, - {"tointeger", math_toint}, - {"floor", math_floor}, - {"fmod", math_fmod}, - {"ult", math_ult}, - {"log", math_log}, - {"max", math_max}, - {"min", math_min}, - {"modf", math_modf}, - {"rad", math_rad}, - {"sin", math_sin}, - {"sqrt", math_sqrt}, - {"tan", math_tan}, - {"type", math_type}, -#if defined(LUA_COMPAT_MATHLIB) - {"atan2", math_atan}, - {"cosh", math_cosh}, - {"sinh", math_sinh}, - {"tanh", math_tanh}, - {"pow", math_pow}, - {"frexp", math_frexp}, - {"ldexp", math_ldexp}, - {"log10", math_log10}, -#endif - /* placeholders */ - {"random", NULL}, - {"randomseed", NULL}, - {"pi", NULL}, - {"huge", NULL}, - {"maxinteger", NULL}, - {"mininteger", NULL}, - {NULL, NULL} -}; - - -/* -** Open math library -*/ -LUAMOD_API int luaopen_math (lua_State *L) { - luaL_newlib(L, mathlib); - lua_pushnumber(L, PI); - lua_setfield(L, -2, "pi"); - lua_pushnumber(L, (lua_Number)HUGE_VAL); - lua_setfield(L, -2, "huge"); - lua_pushinteger(L, LUA_MAXINTEGER); - lua_setfield(L, -2, "maxinteger"); - lua_pushinteger(L, LUA_MININTEGER); - lua_setfield(L, -2, "mininteger"); - setrandfunc(L); - return 1; -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lmem.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lmem.c deleted file mode 100644 index f6a3d95..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lmem.c +++ /dev/null @@ -1,215 +0,0 @@ -/* -** $Id: lmem.c $ -** Interface to Memory Manager -** See Copyright Notice in lua.h -*/ - -#define lmem_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" - - - -/* -** About the realloc function: -** void *frealloc (void *ud, void *ptr, size_t osize, size_t nsize); -** ('osize' is the old size, 'nsize' is the new size) -** -** - frealloc(ud, p, x, 0) frees the block 'p' and returns NULL. -** Particularly, frealloc(ud, NULL, 0, 0) does nothing, -** which is equivalent to free(NULL) in ISO C. -** -** - frealloc(ud, NULL, x, s) creates a new block of size 's' -** (no matter 'x'). Returns NULL if it cannot create the new block. -** -** - otherwise, frealloc(ud, b, x, y) reallocates the block 'b' from -** size 'x' to size 'y'. Returns NULL if it cannot reallocate the -** block to the new size. -*/ - - -/* -** Macro to call the allocation function. -*/ -#define callfrealloc(g,block,os,ns) ((*g->frealloc)(g->ud, block, os, ns)) - - -/* -** When an allocation fails, it will try again after an emergency -** collection, except when it cannot run a collection. The GC should -** not be called while the state is not fully built, as the collector -** is not yet fully initialized. Also, it should not be called when -** 'gcstopem' is true, because then the interpreter is in the middle of -** a collection step. -*/ -#define cantryagain(g) (completestate(g) && !g->gcstopem) - - - - -#if defined(EMERGENCYGCTESTS) -/* -** First allocation will fail except when freeing a block (frees never -** fail) and when it cannot try again; this fail will trigger 'tryagain' -** and a full GC cycle at every allocation. -*/ -static void *firsttry (global_State *g, void *block, size_t os, size_t ns) { - if (ns > 0 && cantryagain(g)) - return NULL; /* fail */ - else /* normal allocation */ - return callfrealloc(g, block, os, ns); -} -#else -#define firsttry(g,block,os,ns) callfrealloc(g, block, os, ns) -#endif - - - - - -/* -** {================================================================== -** Functions to allocate/deallocate arrays for the Parser -** =================================================================== -*/ - -/* -** Minimum size for arrays during parsing, to avoid overhead of -** reallocating to size 1, then 2, and then 4. All these arrays -** will be reallocated to exact sizes or erased when parsing ends. -*/ -#define MINSIZEARRAY 4 - - -void *luaM_growaux_ (lua_State *L, void *block, int nelems, int *psize, - int size_elems, int limit, const char *what) { - void *newblock; - int size = *psize; - if (nelems + 1 <= size) /* does one extra element still fit? */ - return block; /* nothing to be done */ - if (size >= limit / 2) { /* cannot double it? */ - if (l_unlikely(size >= limit)) /* cannot grow even a little? */ - luaG_runerror(L, "too many %s (limit is %d)", what, limit); - size = limit; /* still have at least one free place */ - } - else { - size *= 2; - if (size < MINSIZEARRAY) - size = MINSIZEARRAY; /* minimum size */ - } - lua_assert(nelems + 1 <= size && size <= limit); - /* 'limit' ensures that multiplication will not overflow */ - newblock = luaM_saferealloc_(L, block, cast_sizet(*psize) * size_elems, - cast_sizet(size) * size_elems); - *psize = size; /* update only when everything else is OK */ - return newblock; -} - - -/* -** In prototypes, the size of the array is also its number of -** elements (to save memory). So, if it cannot shrink an array -** to its number of elements, the only option is to raise an -** error. -*/ -void *luaM_shrinkvector_ (lua_State *L, void *block, int *size, - int final_n, int size_elem) { - void *newblock; - size_t oldsize = cast_sizet((*size) * size_elem); - size_t newsize = cast_sizet(final_n * size_elem); - lua_assert(newsize <= oldsize); - newblock = luaM_saferealloc_(L, block, oldsize, newsize); - *size = final_n; - return newblock; -} - -/* }================================================================== */ - - -l_noret luaM_toobig (lua_State *L) { - luaG_runerror(L, "memory allocation private_lua_error: block too big"); -} - - -/* -** Free memory -*/ -void luaM_free_ (lua_State *L, void *block, size_t osize) { - global_State *g = G(L); - lua_assert((osize == 0) == (block == NULL)); - callfrealloc(g, block, osize, 0); - g->totalbytes -= osize; -} - - -/* -** In case of allocation fail, this function will do an emergency -** collection to free some memory and then try the allocation again. -*/ -static void *tryagain (lua_State *L, void *block, - size_t osize, size_t nsize) { - global_State *g = G(L); - if (cantryagain(g)) { - luaC_fullgc(L, 1); /* try to free some memory... */ - return callfrealloc(g, block, osize, nsize); /* try again */ - } - else return NULL; /* cannot run an emergency collection */ -} - - -/* -** Generic allocation routine. -*/ -void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) { - void *newblock; - global_State *g = G(L); - lua_assert((osize == 0) == (block == NULL)); - newblock = firsttry(g, block, osize, nsize); - if (l_unlikely(newblock == NULL && nsize > 0)) { - newblock = tryagain(L, block, osize, nsize); - if (newblock == NULL) /* still no memory? */ - return NULL; /* do not update 'totalbytes' */ - } - lua_assert((nsize == 0) == (newblock == NULL)); - g->totalbytes += nsize - osize; - return newblock; -} - - -void *luaM_saferealloc_ (lua_State *L, void *block, size_t osize, - size_t nsize) { - void *newblock = luaM_realloc_(L, block, osize, nsize); - if (l_unlikely(newblock == NULL && nsize > 0)) /* allocation failed? */ - luaM_error(L); - return newblock; -} - - -void *luaM_malloc_ (lua_State *L, size_t size, int tag) { - if (size == 0) - return NULL; /* that's all */ - else { - global_State *g = G(L); - void *newblock = firsttry(g, NULL, tag, size); - if (l_unlikely(newblock == NULL)) { - newblock = tryagain(L, NULL, tag, size); - if (newblock == NULL) - luaM_error(L); - } - g->totalbytes += size; - return newblock; - } -} diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lmem.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lmem.h deleted file mode 100644 index c5dada9..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lmem.h +++ /dev/null @@ -1,95 +0,0 @@ -/* -** $Id: lmem.h $ -** Interface to Memory Manager -** See Copyright Notice in lua.h -*/ - -#ifndef lmem_h -#define lmem_h - - -#include - -#include "llimits.h" -#include "lua.h" - - -#define luaM_error(L) luaD_throw(L, LUA_ERRMEM) - - -/* -** This macro tests whether it is safe to multiply 'n' by the size of -** type 't' without overflows. Because 'e' is always constant, it avoids -** the runtime division MAX_SIZET/(e). -** (The macro is somewhat complex to avoid warnings: The 'sizeof' -** comparison avoids a runtime comparison when overflow cannot occur. -** The compiler should be able to optimize the real test by itself, but -** when it does it, it may give a warning about "comparison is always -** false due to limited range of data type"; the +1 tricks the compiler, -** avoiding this warning but also this optimization.) -*/ -#define luaM_testsize(n,e) \ - (sizeof(n) >= sizeof(size_t) && cast_sizet((n)) + 1 > MAX_SIZET/(e)) - -#define luaM_checksize(L,n,e) \ - (luaM_testsize(n,e) ? luaM_toobig(L) : cast_void(0)) - - -/* -** Computes the minimum between 'n' and 'MAX_SIZET/sizeof(t)', so that -** the result is not larger than 'n' and cannot overflow a 'size_t' -** when multiplied by the size of type 't'. (Assumes that 'n' is an -** 'int' or 'unsigned int' and that 'int' is not larger than 'size_t'.) -*/ -#define luaM_limitN(n,t) \ - ((cast_sizet(n) <= MAX_SIZET/sizeof(t)) ? (n) : \ - cast_uint((MAX_SIZET/sizeof(t)))) - - -/* -** Arrays of chars do not need any test -*/ -#define luaM_reallocvchar(L,b,on,n) \ - cast_charp(luaM_saferealloc_(L, (b), (on)*sizeof(char), (n)*sizeof(char))) - -#define luaM_freemem(L, b, s) luaM_free_(L, (b), (s)) -#define luaM_free(L, b) luaM_free_(L, (b), sizeof(*(b))) -#define luaM_freearray(L, b, n) luaM_free_(L, (b), (n)*sizeof(*(b))) - -#define luaM_new(L,t) cast(t*, luaM_malloc_(L, sizeof(t), 0)) -#define luaM_newvector(L,n,t) cast(t*, luaM_malloc_(L, (n)*sizeof(t), 0)) -#define luaM_newvectorchecked(L,n,t) \ - (luaM_checksize(L,n,sizeof(t)), luaM_newvector(L,n,t)) - -#define luaM_newobject(L,tag,s) luaM_malloc_(L, (s), tag) - -#define luaM_newblock(L, size) luaM_newvector(L, size, char) - -#define luaM_growvector(L,v,nelems,size,t,limit,e) \ - ((v)=cast(t *, luaM_growaux_(L,v,nelems,&(size),sizeof(t), \ - luaM_limitN(limit,t),e))) - -#define luaM_reallocvector(L, v,oldn,n,t) \ - (cast(t *, luaM_realloc_(L, v, cast_sizet(oldn) * sizeof(t), \ - cast_sizet(n) * sizeof(t)))) - -#define luaM_shrinkvector(L,v,size,fs,t) \ - ((v)=cast(t *, luaM_shrinkvector_(L, v, &(size), fs, sizeof(t)))) - -LUAI_FUNC l_noret luaM_toobig (lua_State *L); - -/* not to be called directly */ -LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize, - size_t size); -LUAI_FUNC void *luaM_saferealloc_ (lua_State *L, void *block, size_t oldsize, - size_t size); -LUAI_FUNC void luaM_free_ (lua_State *L, void *block, size_t osize); -LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int nelems, - int *size, int size_elem, int limit, - const char *what); -LUAI_FUNC void *luaM_shrinkvector_ (lua_State *L, void *block, int *nelem, - int final_n, int size_elem); -LUAI_FUNC void *luaM_malloc_ (lua_State *L, size_t size, int tag); - -#endif - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/loadlib.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/loadlib.c deleted file mode 100644 index 4f8024c..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/loadlib.c +++ /dev/null @@ -1,759 +0,0 @@ -/* -** $Id: loadlib.c $ -** Dynamic library loader for Lua -** See Copyright Notice in lua.h -** -** This module contains an implementation of loadlib for Unix systems -** that have dlfcn, an implementation for Windows, and a stub for other -** systems. -*/ - -#define loadlib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** LUA_CSUBSEP is the character that replaces dots in submodule names -** when searching for a C loader. -** LUA_LSUBSEP is the character that replaces dots in submodule names -** when searching for a Lua loader. -*/ -#if !defined(LUA_CSUBSEP) -#define LUA_CSUBSEP LUA_DIRSEP -#endif - -#if !defined(LUA_LSUBSEP) -#define LUA_LSUBSEP LUA_DIRSEP -#endif - - -/* prefix for open functions in C libraries */ -#define LUA_POF "luaopen_" - -/* separator for open functions in C libraries */ -#define LUA_OFSEP "_" - - -/* -** key for table in the registry that keeps handles -** for all loaded C libraries -*/ -static const char *const CLIBS = "_CLIBS"; - -#define LIB_FAIL "open" - - -#define setprogdir(L) ((void)0) - - -/* -** Special type equivalent to '(void*)' for functions in gcc -** (to suppress warnings when converting function pointers) -*/ -typedef void (*voidf)(void); - - -/* -** system-dependent functions -*/ - -/* -** unload library 'lib' -*/ -static void lsys_unloadlib (void *lib); - -/* -** load C library in file 'path'. If 'seeglb', load with all names in -** the library global. -** Returns the library; in case of error, returns NULL plus an -** error string in the stack. -*/ -static void *lsys_load (lua_State *L, const char *path, int seeglb); - -/* -** Try to find a function named 'sym' in library 'lib'. -** Returns the function; in case of error, returns NULL plus an -** error string in the stack. -*/ -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym); - - - - -#if defined(LUA_USE_DLOPEN) /* { */ -/* -** {======================================================================== -** This is an implementation of loadlib based on the dlfcn interface. -** The dlfcn interface is available in Linux, SunOS, Solaris, IRIX, FreeBSD, -** NetBSD, AIX 4.2, HPUX 11, and probably most other Unix flavors, at least -** as an emulation layer on top of native functions. -** ========================================================================= -*/ - -#include - -/* -** Macro to convert pointer-to-void* to pointer-to-function. This cast -** is undefined according to ISO C, but POSIX assumes that it works. -** (The '__extension__' in gnu compilers is only to avoid warnings.) -*/ -#if defined(__GNUC__) -#define cast_func(p) (__extension__ (lua_CFunction)(p)) -#else -#define cast_func(p) ((lua_CFunction)(p)) -#endif - - -static void lsys_unloadlib (void *lib) { - dlclose(lib); -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - void *lib = dlopen(path, RTLD_NOW | (seeglb ? RTLD_GLOBAL : RTLD_LOCAL)); - if (l_unlikely(lib == NULL)) - lua_pushstring(L, dlerror()); - return lib; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - lua_CFunction f = cast_func(dlsym(lib, sym)); - if (l_unlikely(f == NULL)) - lua_pushstring(L, dlerror()); - return f; -} - -/* }====================================================== */ - - - -#elif defined(LUA_DL_DLL) /* }{ */ -/* -** {====================================================================== -** This is an implementation of loadlib for Windows using native functions. -** ======================================================================= -*/ - -#include - - -/* -** optional flags for LoadLibraryEx -*/ -#if !defined(LUA_LLE_FLAGS) -#define LUA_LLE_FLAGS 0 -#endif - - -#undef setprogdir - - -/* -** Replace in the path (on the top of the stack) any occurrence -** of LUA_EXEC_DIR with the executable's path. -*/ -static void setprogdir (lua_State *L) { - char buff[MAX_PATH + 1]; - char *lb; - DWORD nsize = sizeof(buff)/sizeof(char); - DWORD n = GetModuleFileNameA(NULL, buff, nsize); /* get exec. name */ - if (n == 0 || n == nsize || (lb = strrchr(buff, '\\')) == NULL) - luaL_error(L, "unable to get ModuleFileName"); - else { - *lb = '\0'; /* cut name on the last '\\' to get the path */ - luaL_gsub(L, lua_tostring(L, -1), LUA_EXEC_DIR, buff); - lua_remove(L, -2); /* remove original string */ - } -} - - - - -static void pusherror (lua_State *L) { - int error = GetLastError(); - char buffer[128]; - if (FormatMessageA(FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM, - NULL, error, 0, buffer, sizeof(buffer)/sizeof(char), NULL)) - lua_pushstring(L, buffer); - else - lua_pushfstring(L, "system error %d\n", error); -} - -static void lsys_unloadlib (void *lib) { - FreeLibrary((HMODULE)lib); -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - HMODULE lib = LoadLibraryExA(path, NULL, LUA_LLE_FLAGS); - (void)(seeglb); /* not used: symbols are 'global' by default */ - if (lib == NULL) pusherror(L); - return lib; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - lua_CFunction f = (lua_CFunction)(voidf)GetProcAddress((HMODULE)lib, sym); - if (f == NULL) pusherror(L); - return f; -} - -/* }====================================================== */ - - -#else /* }{ */ -/* -** {====================================================== -** Fallback for other systems -** ======================================================= -*/ - -#undef LIB_FAIL -#define LIB_FAIL "absent" - - -#define DLMSG "dynamic libraries not enabled; check your Lua installation" - - -static void lsys_unloadlib (void *lib) { - (void)(lib); /* not used */ -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - (void)(path); (void)(seeglb); /* not used */ - lua_pushliteral(L, DLMSG); - return NULL; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - (void)(lib); (void)(sym); /* not used */ - lua_pushliteral(L, DLMSG); - return NULL; -} - -/* }====================================================== */ -#endif /* } */ - - -/* -** {================================================================== -** Set Paths -** =================================================================== -*/ - -/* -** LUA_PATH_VAR and LUA_CPATH_VAR are the names of the environment -** variables that Lua check to set its paths. -*/ -#if !defined(LUA_PATH_VAR) -#define LUA_PATH_VAR "LUA_PATH" -#endif - -#if !defined(LUA_CPATH_VAR) -#define LUA_CPATH_VAR "LUA_CPATH" -#endif - - - -/* -** return registry.LUA_NOENV as a boolean -*/ -static int noenv (lua_State *L) { - int b; - lua_getfield(L, LUA_REGISTRYINDEX, "LUA_NOENV"); - b = lua_toboolean(L, -1); - lua_pop(L, 1); /* remove value */ - return b; -} - - -/* -** Set a path. (If using the default path, assume it is a string -** literal in C and create it as an external string.) -*/ -static void setpath (lua_State *L, const char *fieldname, - const char *envname, - const char *dft) { - const char *dftmark; - const char *nver = lua_pushfstring(L, "%s%s", envname, LUA_VERSUFFIX); - const char *path = getenv(nver); /* try versioned name */ - if (path == NULL) /* no versioned environment variable? */ - path = getenv(envname); /* try unversioned name */ - if (path == NULL || noenv(L)) /* no environment variable? */ - lua_pushextlstring(L, dft, strlen(dft), NULL, NULL); /* use default */ - else if ((dftmark = strstr(path, LUA_PATH_SEP LUA_PATH_SEP)) == NULL) - lua_pushstring(L, path); /* nothing to change */ - else { /* path contains a ";;": insert default path in its place */ - size_t len = strlen(path); - luaL_Buffer b; - luaL_buffinit(L, &b); - if (path < dftmark) { /* is there a prefix before ';;'? */ - luaL_addlstring(&b, path, dftmark - path); /* add it */ - luaL_addchar(&b, *LUA_PATH_SEP); - } - luaL_addstring(&b, dft); /* add default */ - if (dftmark < path + len - 2) { /* is there a suffix after ';;'? */ - luaL_addchar(&b, *LUA_PATH_SEP); - luaL_addlstring(&b, dftmark + 2, (path + len - 2) - dftmark); - } - luaL_pushresult(&b); - } - setprogdir(L); - lua_setfield(L, -3, fieldname); /* package[fieldname] = path value */ - lua_pop(L, 1); /* pop versioned variable name ('nver') */ -} - -/* }================================================================== */ - - -/* -** return registry.CLIBS[path] -*/ -static void *checkclib (lua_State *L, const char *path) { - void *plib; - lua_getfield(L, LUA_REGISTRYINDEX, CLIBS); - lua_getfield(L, -1, path); - plib = lua_touserdata(L, -1); /* plib = CLIBS[path] */ - lua_pop(L, 2); /* pop CLIBS table and 'plib' */ - return plib; -} - - -/* -** registry.CLIBS[path] = plib -- for queries -** registry.CLIBS[#CLIBS + 1] = plib -- also keep a list of all libraries -*/ -static void addtoclib (lua_State *L, const char *path, void *plib) { - lua_getfield(L, LUA_REGISTRYINDEX, CLIBS); - lua_pushlightuserdata(L, plib); - lua_pushvalue(L, -1); - lua_setfield(L, -3, path); /* CLIBS[path] = plib */ - lua_rawseti(L, -2, luaL_len(L, -2) + 1); /* CLIBS[#CLIBS + 1] = plib */ - lua_pop(L, 1); /* pop CLIBS table */ -} - - -/* -** __gc tag method for CLIBS table: calls 'lsys_unloadlib' for all lib -** handles in list CLIBS -*/ -static int gctm (lua_State *L) { - lua_Integer n = luaL_len(L, 1); - for (; n >= 1; n--) { /* for each handle, in reverse order */ - lua_rawgeti(L, 1, n); /* get handle CLIBS[n] */ - lsys_unloadlib(lua_touserdata(L, -1)); - lua_pop(L, 1); /* pop handle */ - } - return 0; -} - - - -/* error codes for 'lookforfunc' */ -#define ERRLIB 1 -#define ERRFUNC 2 - -/* -** Look for a C function named 'sym' in a dynamically loaded library -** 'path'. -** First, check whether the library is already loaded; if not, try -** to load it. -** Then, if 'sym' is '*', return true (as library has been loaded). -** Otherwise, look for symbol 'sym' in the library and push a -** C function with that symbol. -** Return 0 and 'true' or a function in the stack; in case of -** errors, return an error code and an error message in the stack. -*/ -static int lookforfunc (lua_State *L, const char *path, const char *sym) { - void *reg = checkclib(L, path); /* check loaded C libraries */ - if (reg == NULL) { /* must load library? */ - reg = lsys_load(L, path, *sym == '*'); /* global symbols if 'sym'=='*' */ - if (reg == NULL) return ERRLIB; /* unable to load library */ - addtoclib(L, path, reg); - } - if (*sym == '*') { /* loading only library (no function)? */ - lua_pushboolean(L, 1); /* return 'true' */ - return 0; /* no errors */ - } - else { - lua_CFunction f = lsys_sym(L, reg, sym); - if (f == NULL) - return ERRFUNC; /* unable to find function */ - lua_pushcfunction(L, f); /* else create new function */ - return 0; /* no errors */ - } -} - - -static int ll_loadlib (lua_State *L) { - const char *path = luaL_checkstring(L, 1); - const char *init = luaL_checkstring(L, 2); - int stat = lookforfunc(L, path, init); - if (l_likely(stat == 0)) /* no errors? */ - return 1; /* return the loaded function */ - else { /* error; error message is on stack top */ - luaL_pushfail(L); - lua_insert(L, -2); - lua_pushstring(L, (stat == ERRLIB) ? LIB_FAIL : "init"); - return 3; /* return fail, error message, and where */ - } -} - - - -/* -** {====================================================== -** 'require' function -** ======================================================= -*/ - - -static int readable (const char *filename) { - FILE *f = fopen(filename, "r"); /* try to open file */ - if (f == NULL) return 0; /* open failed */ - fclose(f); - return 1; -} - - -/* -** Get the next name in '*path' = 'name1;name2;name3;...', changing -** the ending ';' to '\0' to create a zero-terminated string. Return -** NULL when list ends. -*/ -static const char *getnextfilename (char **path, char *end) { - char *sep; - char *name = *path; - if (name == end) - return NULL; /* no more names */ - else if (*name == '\0') { /* from previous iteration? */ - *name = *LUA_PATH_SEP; /* restore separator */ - name++; /* skip it */ - } - sep = strchr(name, *LUA_PATH_SEP); /* find next separator */ - if (sep == NULL) /* separator not found? */ - sep = end; /* name goes until the end */ - *sep = '\0'; /* finish file name */ - *path = sep; /* will start next search from here */ - return name; -} - - -/* -** Given a path such as ";blabla.so;blublu.so", pushes the string -** -** no file 'blabla.so' -** no file 'blublu.so' -*/ -static void pusherrornotfound (lua_State *L, const char *path) { - luaL_Buffer b; - luaL_buffinit(L, &b); - luaL_addstring(&b, "no file '"); - luaL_addgsub(&b, path, LUA_PATH_SEP, "'\n\tno file '"); - luaL_addstring(&b, "'"); - luaL_pushresult(&b); -} - - -static const char *searchpath (lua_State *L, const char *name, - const char *path, - const char *sep, - const char *dirsep) { - luaL_Buffer buff; - char *pathname; /* path with name inserted */ - char *endpathname; /* its end */ - const char *filename; - /* separator is non-empty and appears in 'name'? */ - if (*sep != '\0' && strchr(name, *sep) != NULL) - name = luaL_gsub(L, name, sep, dirsep); /* replace it by 'dirsep' */ - luaL_buffinit(L, &buff); - /* add path to the buffer, replacing marks ('?') with the file name */ - luaL_addgsub(&buff, path, LUA_PATH_MARK, name); - luaL_addchar(&buff, '\0'); - pathname = luaL_buffaddr(&buff); /* writable list of file names */ - endpathname = pathname + luaL_bufflen(&buff) - 1; - while ((filename = getnextfilename(&pathname, endpathname)) != NULL) { - if (readable(filename)) /* does file exist and is readable? */ - return lua_pushstring(L, filename); /* save and return name */ - } - luaL_pushresult(&buff); /* push path to create error message */ - pusherrornotfound(L, lua_tostring(L, -1)); /* create error message */ - return NULL; /* not found */ -} - - -static int ll_searchpath (lua_State *L) { - const char *f = searchpath(L, luaL_checkstring(L, 1), - luaL_checkstring(L, 2), - luaL_optstring(L, 3, "."), - luaL_optstring(L, 4, LUA_DIRSEP)); - if (f != NULL) return 1; - else { /* error message is on top of the stack */ - luaL_pushfail(L); - lua_insert(L, -2); - return 2; /* return fail + error message */ - } -} - - -static const char *findfile (lua_State *L, const char *name, - const char *pname, - const char *dirsep) { - const char *path; - lua_getfield(L, lua_upvalueindex(1), pname); - path = lua_tostring(L, -1); - if (l_unlikely(path == NULL)) - luaL_error(L, "'package.%s' must be a string", pname); - return searchpath(L, name, path, ".", dirsep); -} - - -static int checkload (lua_State *L, int stat, const char *filename) { - if (l_likely(stat)) { /* module loaded successfully? */ - lua_pushstring(L, filename); /* will be 2nd argument to module */ - return 2; /* return open function and file name */ - } - else - return luaL_error(L, "error loading module '%s' from file '%s':\n\t%s", - lua_tostring(L, 1), filename, lua_tostring(L, -1)); -} - - -static int searcher_Lua (lua_State *L) { - const char *filename; - const char *name = luaL_checkstring(L, 1); - filename = findfile(L, name, "path", LUA_LSUBSEP); - if (filename == NULL) return 1; /* module not found in this path */ - return checkload(L, (luaL_loadfile(L, filename) == LUA_OK), filename); -} - - -/* -** Try to find a load function for module 'modname' at file 'filename'. -** First, change '.' to '_' in 'modname'; then, if 'modname' has -** the form X-Y (that is, it has an "ignore mark"), build a function -** name "luaopen_X" and look for it. (For compatibility, if that -** fails, it also tries "luaopen_Y".) If there is no ignore mark, -** look for a function named "luaopen_modname". -*/ -static int loadfunc (lua_State *L, const char *filename, const char *modname) { - const char *openfunc; - const char *mark; - modname = luaL_gsub(L, modname, ".", LUA_OFSEP); - mark = strchr(modname, *LUA_IGMARK); - if (mark) { - int stat; - openfunc = lua_pushlstring(L, modname, mark - modname); - openfunc = lua_pushfstring(L, LUA_POF"%s", openfunc); - stat = lookforfunc(L, filename, openfunc); - if (stat != ERRFUNC) return stat; - modname = mark + 1; /* else go ahead and try old-style name */ - } - openfunc = lua_pushfstring(L, LUA_POF"%s", modname); - return lookforfunc(L, filename, openfunc); -} - - -static int searcher_C (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - const char *filename = findfile(L, name, "cpath", LUA_CSUBSEP); - if (filename == NULL) return 1; /* module not found in this path */ - return checkload(L, (loadfunc(L, filename, name) == 0), filename); -} - - -static int searcher_Croot (lua_State *L) { - const char *filename; - const char *name = luaL_checkstring(L, 1); - const char *p = strchr(name, '.'); - int stat; - if (p == NULL) return 0; /* is root */ - lua_pushlstring(L, name, p - name); - filename = findfile(L, lua_tostring(L, -1), "cpath", LUA_CSUBSEP); - if (filename == NULL) return 1; /* root not found */ - if ((stat = loadfunc(L, filename, name)) != 0) { - if (stat != ERRFUNC) - return checkload(L, 0, filename); /* real error */ - else { /* open function not found */ - lua_pushfstring(L, "no module '%s' in file '%s'", name, filename); - return 1; - } - } - lua_pushstring(L, filename); /* will be 2nd argument to module */ - return 2; -} - - -static int searcher_preload (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - lua_getfield(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - if (lua_getfield(L, -1, name) == LUA_TNIL) { /* not found? */ - lua_pushfstring(L, "no field package.preload['%s']", name); - return 1; - } - else { - lua_pushliteral(L, ":preload:"); - return 2; - } -} - - -static void findloader (lua_State *L, const char *name) { - int i; - luaL_Buffer msg; /* to build error message */ - /* push 'package.searchers' to index 3 in the stack */ - if (l_unlikely(lua_getfield(L, lua_upvalueindex(1), "searchers") - != LUA_TTABLE)) - luaL_error(L, "'package.searchers' must be a table"); - luaL_buffinit(L, &msg); - /* iterate over available searchers to find a loader */ - for (i = 1; ; i++) { - luaL_addstring(&msg, "\n\t"); /* error-message prefix */ - if (l_unlikely(lua_rawgeti(L, 3, i) == LUA_TNIL)) { /* no more searchers? */ - lua_pop(L, 1); /* remove nil */ - luaL_buffsub(&msg, 2); /* remove prefix */ - luaL_pushresult(&msg); /* create error message */ - luaL_error(L, "module '%s' not found:%s", name, lua_tostring(L, -1)); - } - lua_pushstring(L, name); - lua_call(L, 1, 2); /* call it */ - if (lua_isfunction(L, -2)) /* did it find a loader? */ - return; /* module loader found */ - else if (lua_isstring(L, -2)) { /* searcher returned error message? */ - lua_pop(L, 1); /* remove extra return */ - luaL_addvalue(&msg); /* concatenate error message */ - } - else { /* no error message */ - lua_pop(L, 2); /* remove both returns */ - luaL_buffsub(&msg, 2); /* remove prefix */ - } - } -} - - -static int ll_require (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - lua_settop(L, 1); /* LOADED table will be at index 2 */ - lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_getfield(L, 2, name); /* LOADED[name] */ - if (lua_toboolean(L, -1)) /* is it there? */ - return 1; /* package is already loaded */ - /* else must load package */ - lua_pop(L, 1); /* remove 'getfield' result */ - findloader(L, name); - lua_rotate(L, -2, 1); /* function <-> loader data */ - lua_pushvalue(L, 1); /* name is 1st argument to module loader */ - lua_pushvalue(L, -3); /* loader data is 2nd argument */ - /* stack: ...; loader data; loader function; mod. name; loader data */ - lua_call(L, 2, 1); /* run loader to load module */ - /* stack: ...; loader data; result from loader */ - if (!lua_isnil(L, -1)) /* non-nil return? */ - lua_setfield(L, 2, name); /* LOADED[name] = returned value */ - else - lua_pop(L, 1); /* pop nil */ - if (lua_getfield(L, 2, name) == LUA_TNIL) { /* module set no value? */ - lua_pushboolean(L, 1); /* use true as result */ - lua_copy(L, -1, -2); /* replace loader result */ - lua_setfield(L, 2, name); /* LOADED[name] = true */ - } - lua_rotate(L, -2, 1); /* loader data <-> module result */ - return 2; /* return module result and loader data */ -} - -/* }====================================================== */ - - - - -static const luaL_Reg pk_funcs[] = { - {"loadlib", ll_loadlib}, - {"searchpath", ll_searchpath}, - /* placeholders */ - {"preload", NULL}, - {"cpath", NULL}, - {"path", NULL}, - {"searchers", NULL}, - {"loaded", NULL}, - {NULL, NULL} -}; - - -static const luaL_Reg ll_funcs[] = { - {"require", ll_require}, - {NULL, NULL} -}; - - -static void createsearcherstable (lua_State *L) { - static const lua_CFunction searchers[] = { - searcher_preload, - searcher_Lua, - searcher_C, - searcher_Croot, - NULL - }; - int i; - /* create 'searchers' table */ - lua_createtable(L, sizeof(searchers)/sizeof(searchers[0]) - 1, 0); - /* fill it with predefined searchers */ - for (i=0; searchers[i] != NULL; i++) { - lua_pushvalue(L, -2); /* set 'package' as upvalue for all searchers */ - lua_pushcclosure(L, searchers[i], 1); - lua_rawseti(L, -2, i+1); - } - lua_setfield(L, -2, "searchers"); /* put it in field 'searchers' */ -} - - -/* -** create table CLIBS to keep track of loaded C libraries, -** setting a finalizer to close all libraries when closing state. -*/ -static void createclibstable (lua_State *L) { - luaL_getsubtable(L, LUA_REGISTRYINDEX, CLIBS); /* create CLIBS table */ - lua_createtable(L, 0, 1); /* create metatable for CLIBS */ - lua_pushcfunction(L, gctm); - lua_setfield(L, -2, "__gc"); /* set finalizer for CLIBS table */ - lua_setmetatable(L, -2); -} - - -LUAMOD_API int luaopen_package (lua_State *L) { - createclibstable(L); - luaL_newlib(L, pk_funcs); /* create 'package' table */ - createsearcherstable(L); - /* set paths */ - setpath(L, "path", LUA_PATH_VAR, LUA_PATH_DEFAULT); - setpath(L, "cpath", LUA_CPATH_VAR, LUA_CPATH_DEFAULT); - /* store config information */ - lua_pushliteral(L, LUA_DIRSEP "\n" LUA_PATH_SEP "\n" LUA_PATH_MARK "\n" - LUA_EXEC_DIR "\n" LUA_IGMARK "\n"); - lua_setfield(L, -2, "config"); - /* set field 'loaded' */ - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_setfield(L, -2, "loaded"); - /* set field 'preload' */ - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - lua_setfield(L, -2, "preload"); - lua_pushglobaltable(L); - lua_pushvalue(L, -2); /* set 'package' as upvalue for next lib */ - luaL_setfuncs(L, ll_funcs, 1); /* open lib into global table */ - lua_pop(L, 1); /* pop global table */ - return 1; /* return 'package' table */ -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lobject.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lobject.c deleted file mode 100644 index 45a2731..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lobject.c +++ /dev/null @@ -1,659 +0,0 @@ -/* -** $Id: lobject.c $ -** Some generic functions over Lua objects -** See Copyright Notice in lua.h -*/ - -#define lobject_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lctype.h" -#include "ldebug.h" -#include "ldo.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "lvm.h" - - -/* -** Computes ceil(log2(x)) -*/ -int luaO_ceillog2 (unsigned int x) { - static const lu_byte log_2[256] = { /* log_2[i - 1] = ceil(log2(i)) */ - 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, - 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, - 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, - 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8 - }; - int l = 0; - x--; - while (x >= 256) { l += 8; x >>= 8; } - return l + log_2[x]; -} - -/* -** Encodes 'p'% as a floating-point byte, represented as (eeeexxxx). -** The exponent is represented using excess-7. Mimicking IEEE 754, the -** representation normalizes the number when possible, assuming an extra -** 1 before the mantissa (xxxx) and adding one to the exponent (eeee) -** to signal that. So, the real value is (1xxxx) * 2^(eeee - 7 - 1) if -** eeee != 0, and (xxxx) * 2^-7 otherwise (subnormal numbers). -*/ -unsigned int luaO_codeparam (unsigned int p) { - if (p >= (cast(lu_mem, 0x1F) << (0xF - 7 - 1)) * 100u) /* overflow? */ - return 0xFF; /* return maximum value */ - else { - p = (cast(l_uint32, p) * 128 + 99) / 100; /* round up the division */ - if (p < 0x10) /* subnormal number? */ - return p; /* exponent bits are already zero; nothing else to do */ - else { - int log = luaO_ceillog2(p + 1) - 5; /* preserve 5 bits */ - return ((p >> log) - 0x10) | ((log + 1) << 4); - } - } -} - - -/* -** Computes 'p' times 'x', where 'p' is a floating-point byte. Roughly, -** we have to multiply 'x' by the mantissa and then shift accordingly to -** the exponent. If the exponent is positive, both the multiplication -** and the shift increase 'x', so we have to care only about overflows. -** For negative exponents, however, multiplying before the shift keeps -** more significant bits, as long as the multiplication does not -** overflow, so we check which order is best. -*/ -l_obj luaO_applyparam (unsigned int p, l_obj x) { - unsigned int m = p & 0xF; /* mantissa */ - int e = (p >> 4); /* exponent */ - if (e > 0) { /* normalized? */ - e--; /* correct exponent */ - m += 0x10; /* correct mantissa; maximum value is 0x1F */ - } - e -= 7; /* correct excess-7 */ - if (e >= 0) { - if (x < (MAX_LOBJ / 0x1F) >> e) /* no overflow? */ - return (x * m) << e; /* order doesn't matter here */ - else /* real overflow */ - return MAX_LOBJ; - } - else { /* negative exponent */ - e = -e; - if (x < MAX_LOBJ / 0x1F) /* multiplication cannot overflow? */ - return (x * m) >> e; /* multiplying first gives more precision */ - else if ((x >> e) < MAX_LOBJ / 0x1F) /* cannot overflow after shift? */ - return (x >> e) * m; - else /* real overflow */ - return MAX_LOBJ; - } -} - - -static lua_Integer intarith (lua_State *L, int op, lua_Integer v1, - lua_Integer v2) { - switch (op) { - case LUA_OPADD: return intop(+, v1, v2); - case LUA_OPSUB:return intop(-, v1, v2); - case LUA_OPMUL:return intop(*, v1, v2); - case LUA_OPMOD: return luaV_mod(L, v1, v2); - case LUA_OPIDIV: return luaV_idiv(L, v1, v2); - case LUA_OPBAND: return intop(&, v1, v2); - case LUA_OPBOR: return intop(|, v1, v2); - case LUA_OPBXOR: return intop(^, v1, v2); - case LUA_OPSHL: return luaV_shiftl(v1, v2); - case LUA_OPSHR: return luaV_shiftr(v1, v2); - case LUA_OPUNM: return intop(-, 0, v1); - case LUA_OPBNOT: return intop(^, ~l_castS2U(0), v1); - default: lua_assert(0); return 0; - } -} - - -static lua_Number numarith (lua_State *L, int op, lua_Number v1, - lua_Number v2) { - switch (op) { - case LUA_OPADD: return luai_numadd(L, v1, v2); - case LUA_OPSUB: return luai_numsub(L, v1, v2); - case LUA_OPMUL: return luai_nummul(L, v1, v2); - case LUA_OPDIV: return luai_numdiv(L, v1, v2); - case LUA_OPPOW: return luai_numpow(L, v1, v2); - case LUA_OPIDIV: return luai_numidiv(L, v1, v2); - case LUA_OPUNM: return luai_numunm(L, v1); - case LUA_OPMOD: return luaV_modf(L, v1, v2); - default: lua_assert(0); return 0; - } -} - - -int luaO_rawarith (lua_State *L, int op, const TValue *p1, const TValue *p2, - TValue *res) { - switch (op) { - case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: - case LUA_OPSHL: case LUA_OPSHR: - case LUA_OPBNOT: { /* operate only on integers */ - lua_Integer i1; lua_Integer i2; - if (tointegerns(p1, &i1) && tointegerns(p2, &i2)) { - setivalue(res, intarith(L, op, i1, i2)); - return 1; - } - else return 0; /* fail */ - } - case LUA_OPDIV: case LUA_OPPOW: { /* operate only on floats */ - lua_Number n1; lua_Number n2; - if (tonumberns(p1, n1) && tonumberns(p2, n2)) { - setfltvalue(res, numarith(L, op, n1, n2)); - return 1; - } - else return 0; /* fail */ - } - default: { /* other operations */ - lua_Number n1; lua_Number n2; - if (ttisinteger(p1) && ttisinteger(p2)) { - setivalue(res, intarith(L, op, ivalue(p1), ivalue(p2))); - return 1; - } - else if (tonumberns(p1, n1) && tonumberns(p2, n2)) { - setfltvalue(res, numarith(L, op, n1, n2)); - return 1; - } - else return 0; /* fail */ - } - } -} - - -void luaO_arith (lua_State *L, int op, const TValue *p1, const TValue *p2, - StkId res) { - if (!luaO_rawarith(L, op, p1, p2, s2v(res))) { - /* could not perform raw operation; try metamethod */ - luaT_trybinTM(L, p1, p2, res, cast(TMS, (op - LUA_OPADD) + TM_ADD)); - } -} - - -int luaO_hexavalue (int c) { - if (lisdigit(c)) return c - '0'; - else return (ltolower(c) - 'a') + 10; -} - - -static int isneg (const char **s) { - if (**s == '-') { (*s)++; return 1; } - else if (**s == '+') (*s)++; - return 0; -} - - - -/* -** {================================================================== -** Lua's implementation for 'lua_strx2number' -** =================================================================== -*/ - -#if !defined(lua_strx2number) - -/* maximum number of significant digits to read (to avoid overflows - even with single floats) */ -#define MAXSIGDIG 30 - -/* -** convert a hexadecimal numeric string to a number, following -** C99 specification for 'strtod' -*/ -static lua_Number lua_strx2number (const char *s, char **endptr) { - int dot = lua_getlocaledecpoint(); - lua_Number r = l_mathop(0.0); /* result (accumulator) */ - int sigdig = 0; /* number of significant digits */ - int nosigdig = 0; /* number of non-significant digits */ - int e = 0; /* exponent correction */ - int neg; /* 1 if number is negative */ - int hasdot = 0; /* true after seen a dot */ - *endptr = cast_charp(s); /* nothing is valid yet */ - while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */ - neg = isneg(&s); /* check sign */ - if (!(*s == '0' && (*(s + 1) == 'x' || *(s + 1) == 'X'))) /* check '0x' */ - return l_mathop(0.0); /* invalid format (no '0x') */ - for (s += 2; ; s++) { /* skip '0x' and read numeral */ - if (*s == dot) { - if (hasdot) break; /* second dot? stop loop */ - else hasdot = 1; - } - else if (lisxdigit(cast_uchar(*s))) { - if (sigdig == 0 && *s == '0') /* non-significant digit (zero)? */ - nosigdig++; - else if (++sigdig <= MAXSIGDIG) /* can read it without overflow? */ - r = (r * l_mathop(16.0)) + luaO_hexavalue(*s); - else e++; /* too many digits; ignore, but still count for exponent */ - if (hasdot) e--; /* decimal digit? correct exponent */ - } - else break; /* neither a dot nor a digit */ - } - if (nosigdig + sigdig == 0) /* no digits? */ - return l_mathop(0.0); /* invalid format */ - *endptr = cast_charp(s); /* valid up to here */ - e *= 4; /* each digit multiplies/divides value by 2^4 */ - if (*s == 'p' || *s == 'P') { /* exponent part? */ - int exp1 = 0; /* exponent value */ - int neg1; /* exponent sign */ - s++; /* skip 'p' */ - neg1 = isneg(&s); /* sign */ - if (!lisdigit(cast_uchar(*s))) - return l_mathop(0.0); /* invalid; must have at least one digit */ - while (lisdigit(cast_uchar(*s))) /* read exponent */ - exp1 = exp1 * 10 + *(s++) - '0'; - if (neg1) exp1 = -exp1; - e += exp1; - *endptr = cast_charp(s); /* valid up to here */ - } - if (neg) r = -r; - return l_mathop(ldexp)(r, e); -} - -#endif -/* }====================================================== */ - - -/* maximum length of a numeral to be converted to a number */ -#if !defined (L_MAXLENNUM) -#define L_MAXLENNUM 200 -#endif - -/* -** Convert string 's' to a Lua number (put in 'result'). Return NULL on -** fail or the address of the ending '\0' on success. ('mode' == 'x') -** means a hexadecimal numeral. -*/ -static const char *l_str2dloc (const char *s, lua_Number *result, int mode) { - char *endptr; - *result = (mode == 'x') ? lua_strx2number(s, &endptr) /* try to convert */ - : lua_str2number(s, &endptr); - if (endptr == s) return NULL; /* nothing recognized? */ - while (lisspace(cast_uchar(*endptr))) endptr++; /* skip trailing spaces */ - return (*endptr == '\0') ? endptr : NULL; /* OK iff no trailing chars */ -} - - -/* -** Convert string 's' to a Lua number (put in 'result') handling the -** current locale. -** This function accepts both the current locale or a dot as the radix -** mark. If the conversion fails, it may mean number has a dot but -** locale accepts something else. In that case, the code copies 's' -** to a buffer (because 's' is read-only), changes the dot to the -** current locale radix mark, and tries to convert again. -** The variable 'mode' checks for special characters in the string: -** - 'n' means 'inf' or 'nan' (which should be rejected) -** - 'x' means a hexadecimal numeral -** - '.' just optimizes the search for the common case (no special chars) -*/ -static const char *l_str2d (const char *s, lua_Number *result) { - const char *endptr; - const char *pmode = strpbrk(s, ".xXnN"); /* look for special chars */ - int mode = pmode ? ltolower(cast_uchar(*pmode)) : 0; - if (mode == 'n') /* reject 'inf' and 'nan' */ - return NULL; - endptr = l_str2dloc(s, result, mode); /* try to convert */ - if (endptr == NULL) { /* failed? may be a different locale */ - char buff[L_MAXLENNUM + 1]; - const char *pdot = strchr(s, '.'); - if (pdot == NULL || strlen(s) > L_MAXLENNUM) - return NULL; /* string too long or no dot; fail */ - strcpy(buff, s); /* copy string to buffer */ - buff[pdot - s] = lua_getlocaledecpoint(); /* correct decimal point */ - endptr = l_str2dloc(buff, result, mode); /* try again */ - if (endptr != NULL) - endptr = s + (endptr - buff); /* make relative to 's' */ - } - return endptr; -} - - -#define MAXBY10 cast(lua_Unsigned, LUA_MAXINTEGER / 10) -#define MAXLASTD cast_int(LUA_MAXINTEGER % 10) - -static const char *l_str2int (const char *s, lua_Integer *result) { - lua_Unsigned a = 0; - int empty = 1; - int neg; - while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */ - neg = isneg(&s); - if (s[0] == '0' && - (s[1] == 'x' || s[1] == 'X')) { /* hex? */ - s += 2; /* skip '0x' */ - for (; lisxdigit(cast_uchar(*s)); s++) { - a = a * 16 + luaO_hexavalue(*s); - empty = 0; - } - } - else { /* decimal */ - for (; lisdigit(cast_uchar(*s)); s++) { - int d = *s - '0'; - if (a >= MAXBY10 && (a > MAXBY10 || d > MAXLASTD + neg)) /* overflow? */ - return NULL; /* do not accept it (as integer) */ - a = a * 10 + d; - empty = 0; - } - } - while (lisspace(cast_uchar(*s))) s++; /* skip trailing spaces */ - if (empty || *s != '\0') return NULL; /* something wrong in the numeral */ - else { - *result = l_castU2S((neg) ? 0u - a : a); - return s; - } -} - - -size_t luaO_str2num (const char *s, TValue *o) { - lua_Integer i; lua_Number n; - const char *e; - if ((e = l_str2int(s, &i)) != NULL) { /* try as an integer */ - setivalue(o, i); - } - else if ((e = l_str2d(s, &n)) != NULL) { /* else try as a float */ - setfltvalue(o, n); - } - else - return 0; /* conversion failed */ - return (e - s) + 1; /* success; return string size */ -} - - -int luaO_utf8esc (char *buff, unsigned long x) { - int n = 1; /* number of bytes put in buffer (backwards) */ - lua_assert(x <= 0x7FFFFFFFu); - if (x < 0x80) /* ascii? */ - buff[UTF8BUFFSZ - 1] = cast_char(x); - else { /* need continuation bytes */ - unsigned int mfb = 0x3f; /* maximum that fits in first byte */ - do { /* add continuation bytes */ - buff[UTF8BUFFSZ - (n++)] = cast_char(0x80 | (x & 0x3f)); - x >>= 6; /* remove added bits */ - mfb >>= 1; /* now there is one less bit available in first byte */ - } while (x > mfb); /* still needs continuation byte? */ - buff[UTF8BUFFSZ - n] = cast_char((~mfb << 1) | x); /* add first byte */ - } - return n; -} - - -/* -** Maximum length of the conversion of a number to a string. Must be -** enough to accommodate both LUA_INTEGER_FMT and LUA_NUMBER_FMT. -** (For a long long int, this is 19 digits plus a sign and a final '\0', -** adding to 21. For a long double, it can go to a sign, 33 digits, -** the dot, an exponent letter, an exponent sign, 5 exponent digits, -** and a final '\0', adding to 43.) -*/ -#define MAXNUMBER2STR 44 - - -/* -** Convert a number object to a string, adding it to a buffer -*/ -static int tostringbuff (TValue *obj, char *buff) { - int len; - lua_assert(ttisnumber(obj)); - if (ttisinteger(obj)) - len = lua_integer2str(buff, MAXNUMBER2STR, ivalue(obj)); - else { - len = lua_number2str(buff, MAXNUMBER2STR, fltvalue(obj)); - if (buff[strspn(buff, "-0123456789")] == '\0') { /* looks like an int? */ - buff[len++] = lua_getlocaledecpoint(); - buff[len++] = '0'; /* adds '.0' to result */ - } - } - return len; -} - - -/* -** Convert a number object to a Lua string, replacing the value at 'obj' -*/ -void luaO_tostring (lua_State *L, TValue *obj) { - char buff[MAXNUMBER2STR]; - int len = tostringbuff(obj, buff); - setsvalue(L, obj, luaS_newlstr(L, buff, len)); -} - - - - -/* -** {================================================================== -** 'luaO_pushvfstring' -** =================================================================== -*/ - -/* -** Size for buffer space used by 'luaO_pushvfstring'. It should be -** (LUA_IDSIZE + MAXNUMBER2STR) + a minimal space for basic messages, -** so that 'luaG_addinfo' can work directly on the buffer. -*/ -#define BUFVFS (LUA_IDSIZE + MAXNUMBER2STR + 95) - -/* buffer used by 'luaO_pushvfstring' */ -typedef struct BuffFS { - lua_State *L; - int pushed; /* true if there is a part of the result on the stack */ - int blen; /* length of partial string in 'space' */ - char space[BUFVFS]; /* holds last part of the result */ -} BuffFS; - - -/* -** Push given string to the stack, as part of the result, and -** join it to previous partial result if there is one. -** It may call 'luaV_concat' while using one slot from EXTRA_STACK. -** This call cannot invoke metamethods, as both operands must be -** strings. It can, however, raise an error if the result is too -** long. In that case, 'luaV_concat' frees the extra slot before -** raising the error. -*/ -static void pushstr (BuffFS *buff, const char *str, size_t lstr) { - lua_State *L = buff->L; - setsvalue2s(L, L->top.p, luaS_newlstr(L, str, lstr)); - L->top.p++; /* may use one slot from EXTRA_STACK */ - if (!buff->pushed) /* no previous string on the stack? */ - buff->pushed = 1; /* now there is one */ - else /* join previous string with new one */ - luaV_concat(L, 2); -} - - -/* -** empty the buffer space into the stack -*/ -static void clearbuff (BuffFS *buff) { - pushstr(buff, buff->space, buff->blen); /* push buffer contents */ - buff->blen = 0; /* space now is empty */ -} - - -/* -** Get a space of size 'sz' in the buffer. If buffer has not enough -** space, empty it. 'sz' must fit in an empty buffer. -*/ -static char *getbuff (BuffFS *buff, int sz) { - lua_assert(buff->blen <= BUFVFS); lua_assert(sz <= BUFVFS); - if (sz > BUFVFS - buff->blen) /* not enough space? */ - clearbuff(buff); - return buff->space + buff->blen; -} - - -#define addsize(b,sz) ((b)->blen += (sz)) - - -/* -** Add 'str' to the buffer. If string is larger than the buffer space, -** push the string directly to the stack. -*/ -static void addstr2buff (BuffFS *buff, const char *str, size_t slen) { - if (slen <= BUFVFS) { /* does string fit into buffer? */ - char *bf = getbuff(buff, cast_int(slen)); - memcpy(bf, str, slen); /* add string to buffer */ - addsize(buff, cast_int(slen)); - } - else { /* string larger than buffer */ - clearbuff(buff); /* string comes after buffer's content */ - pushstr(buff, str, slen); /* push string */ - } -} - - -/* -** Add a numeral to the buffer. -*/ -static void addnum2buff (BuffFS *buff, TValue *num) { - char *numbuff = getbuff(buff, MAXNUMBER2STR); - int len = tostringbuff(num, numbuff); /* format number into 'numbuff' */ - addsize(buff, len); -} - - -/* -** this function handles only '%d', '%c', '%f', '%p', '%s', and '%%' - conventional formats, plus Lua-specific '%I' and '%U' -*/ -const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) { - BuffFS buff; /* holds last part of the result */ - const char *e; /* points to next '%' */ - buff.pushed = buff.blen = 0; - buff.L = L; - while ((e = strchr(fmt, '%')) != NULL) { - addstr2buff(&buff, fmt, e - fmt); /* add 'fmt' up to '%' */ - switch (*(e + 1)) { /* conversion specifier */ - case 's': { /* zero-terminated string */ - const char *s = va_arg(argp, char *); - if (s == NULL) s = "(null)"; - addstr2buff(&buff, s, strlen(s)); - break; - } - case 'c': { /* an 'int' as a character */ - char c = cast_uchar(va_arg(argp, int)); - addstr2buff(&buff, &c, sizeof(char)); - break; - } - case 'd': { /* an 'int' */ - TValue num; - setivalue(&num, va_arg(argp, int)); - addnum2buff(&buff, &num); - break; - } - case 'I': { /* a 'lua_Integer' */ - TValue num; - setivalue(&num, cast(lua_Integer, va_arg(argp, l_uacInt))); - addnum2buff(&buff, &num); - break; - } - case 'f': { /* a 'lua_Number' */ - TValue num; - setfltvalue(&num, cast_num(va_arg(argp, l_uacNumber))); - addnum2buff(&buff, &num); - break; - } - case 'p': { /* a pointer */ - const int sz = 3 * sizeof(void*) + 8; /* enough space for '%p' */ - char *bf = getbuff(&buff, sz); - void *p = va_arg(argp, void *); - int len = lua_pointer2str(bf, sz, p); - addsize(&buff, len); - break; - } - case 'U': { /* a 'long' as a UTF-8 sequence */ - char bf[UTF8BUFFSZ]; - int len = luaO_utf8esc(bf, va_arg(argp, long)); - addstr2buff(&buff, bf + UTF8BUFFSZ - len, len); - break; - } - case '%': { - addstr2buff(&buff, "%", 1); - break; - } - default: { - luaG_runerror(L, "invalid option '%%%c' to 'lua_pushfstring'", - *(e + 1)); - } - } - fmt = e + 2; /* skip '%' and the specifier */ - } - addstr2buff(&buff, fmt, strlen(fmt)); /* rest of 'fmt' */ - clearbuff(&buff); /* empty buffer into the stack */ - lua_assert(buff.pushed == 1); - return getstr(tsvalue(s2v(L->top.p - 1))); -} - - -const char *luaO_pushfstring (lua_State *L, const char *fmt, ...) { - const char *msg; - va_list argp; - va_start(argp, fmt); - msg = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - return msg; -} - -/* }================================================================== */ - - -#define RETS "..." -#define PRE "[string \"" -#define POS "\"]" - -#define addstr(a,b,l) ( memcpy(a,b,(l) * sizeof(char)), a += (l) ) - -void luaO_chunkid (char *out, const char *source, size_t srclen) { - size_t bufflen = LUA_IDSIZE; /* free space in buffer */ - if (*source == '=') { /* 'literal' source */ - if (srclen <= bufflen) /* small enough? */ - memcpy(out, source + 1, srclen * sizeof(char)); - else { /* truncate it */ - addstr(out, source + 1, bufflen - 1); - *out = '\0'; - } - } - else if (*source == '@') { /* file name */ - if (srclen <= bufflen) /* small enough? */ - memcpy(out, source + 1, srclen * sizeof(char)); - else { /* add '...' before rest of name */ - addstr(out, RETS, LL(RETS)); - bufflen -= LL(RETS); - memcpy(out, source + 1 + srclen - bufflen, bufflen * sizeof(char)); - } - } - else { /* string; format as [string "source"] */ - const char *nl = strchr(source, '\n'); /* find first new line (if any) */ - addstr(out, PRE, LL(PRE)); /* add prefix */ - bufflen -= LL(PRE RETS POS) + 1; /* save space for prefix+suffix+'\0' */ - if (srclen < bufflen && nl == NULL) { /* small one-line source? */ - addstr(out, source, srclen); /* keep it */ - } - else { - if (nl != NULL) srclen = nl - source; /* stop at first newline */ - if (srclen > bufflen) srclen = bufflen; - addstr(out, source, srclen); - addstr(out, RETS, LL(RETS)); - } - memcpy(out, POS, (LL(POS) + 1) * sizeof(char)); - } -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lobject.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lobject.h deleted file mode 100644 index 169512f..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lobject.h +++ /dev/null @@ -1,857 +0,0 @@ -/* -** $Id: lobject.h $ -** Type definitions for Lua objects -** See Copyright Notice in lua.h -*/ - - -#ifndef lobject_h -#define lobject_h - - -#include - - -#include "llimits.h" -#include "lua.h" - - -/* -** Extra types for collectable non-values -*/ -#define LUA_TUPVAL LUA_NUMTYPES /* upvalues */ -#define LUA_TPROTO (LUA_NUMTYPES+1) /* function prototypes */ -#define LUA_TDEADKEY (LUA_NUMTYPES+2) /* removed keys in tables */ - - - -/* -** number of all possible types (including LUA_TNONE but excluding DEADKEY) -*/ -#define LUA_TOTALTYPES (LUA_TPROTO + 2) - - -/* -** tags for Tagged Values have the following use of bits: -** bits 0-3: actual tag (a LUA_T* constant) -** bits 4-5: variant bits -** bit 6: whether value is collectable -*/ - -/* add variant bits to a type */ -#define makevariant(t,v) ((t) | ((v) << 4)) - - - -/* -** Union of all Lua values -*/ -typedef union Value { - struct GCObject *gc; /* collectable objects */ - void *p; /* light userdata */ - lua_CFunction f; /* light C functions */ - lua_Integer i; /* integer numbers */ - lua_Number n; /* float numbers */ - /* not used, but may avoid warnings for uninitialized value */ - lu_byte ub; -} Value; - - -/* -** Tagged Values. This is the basic representation of values in Lua: -** an actual value plus a tag with its type. -*/ - -#define TValuefields Value value_; lu_byte tt_ - -typedef struct TValue { - TValuefields; -} TValue; - - -#define val_(o) ((o)->value_) -#define valraw(o) (val_(o)) - - -/* raw type tag of a TValue */ -#define rawtt(o) ((o)->tt_) - -/* tag with no variants (bits 0-3) */ -#define novariant(t) ((t) & 0x0F) - -/* type tag of a TValue (bits 0-3 for tags + variant bits 4-5) */ -#define withvariant(t) ((t) & 0x3F) -#define ttypetag(o) withvariant(rawtt(o)) - -/* type of a TValue */ -#define ttype(o) (novariant(rawtt(o))) - - -/* Macros to test type */ -#define checktag(o,t) (rawtt(o) == (t)) -#define checktype(o,t) (ttype(o) == (t)) - - -/* Macros for internal tests */ - -/* collectable object has the same tag as the original value */ -#define righttt(obj) (ttypetag(obj) == gcvalue(obj)->tt) - -/* -** Any value being manipulated by the program either is non -** collectable, or the collectable object has the right tag -** and it is not dead. The option 'L == NULL' allows other -** macros using this one to be used where L is not available. -*/ -#define checkliveness(L,obj) \ - ((void)L, lua_longassert(!iscollectable(obj) || \ - (righttt(obj) && (L == NULL || !isdead(G(L),gcvalue(obj)))))) - - -/* Macros to set values */ - -/* set a value's tag */ -#define settt_(o,t) ((o)->tt_=(t)) - - -/* main macro to copy values (from 'obj2' to 'obj1') */ -#define setobj(L,obj1,obj2) \ - { TValue *io1=(obj1); const TValue *io2=(obj2); \ - io1->value_ = io2->value_; settt_(io1, io2->tt_); \ - checkliveness(L,io1); lua_assert(!isnonstrictnil(io1)); } - -/* -** Different types of assignments, according to source and destination. -** (They are mostly equal now, but may be different in the future.) -*/ - -/* from stack to stack */ -#define setobjs2s(L,o1,o2) setobj(L,s2v(o1),s2v(o2)) -/* to stack (not from same stack) */ -#define setobj2s(L,o1,o2) setobj(L,s2v(o1),o2) -/* from table to same table */ -#define setobjt2t setobj -/* to new object */ -#define setobj2n setobj -/* to table */ -#define setobj2t setobj - - -/* -** Entries in a Lua stack. Field 'tbclist' forms a list of all -** to-be-closed variables active in this stack. Dummy entries are -** used when the distance between two tbc variables does not fit -** in an unsigned short. They are represented by delta==0, and -** their real delta is always the maximum value that fits in -** that field. -*/ -typedef union StackValue { - TValue val; - struct { - TValuefields; - unsigned short delta; - } tbclist; -} StackValue; - - -/* index to stack elements */ -typedef StackValue *StkId; - - -/* -** When reallocating the stack, change all pointers to the stack into -** proper offsets. -*/ -typedef union { - StkId p; /* actual pointer */ - ptrdiff_t offset; /* used while the stack is being reallocated */ -} StkIdRel; - - -/* convert a 'StackValue' to a 'TValue' */ -#define s2v(o) (&(o)->val) - - - -/* -** {================================================================== -** Nil -** =================================================================== -*/ - -/* Standard nil */ -#define LUA_VNIL makevariant(LUA_TNIL, 0) - -/* Empty slot (which might be different from a slot containing nil) */ -#define LUA_VEMPTY makevariant(LUA_TNIL, 1) - -/* Value returned for a key not found in a table (absent key) */ -#define LUA_VABSTKEY makevariant(LUA_TNIL, 2) - -/* Special variant to signal that a fast get is accessing a non-table */ -#define LUA_VNOTABLE makevariant(LUA_TNIL, 3) - - -/* macro to test for (any kind of) nil */ -#define ttisnil(v) checktype((v), LUA_TNIL) - -/* -** Macro to test the result of a table access. Formally, it should -** distinguish between LUA_VEMPTY/LUA_VABSTKEY/LUA_VNOTABLE and -** other tags. As currently nil is equivalent to LUA_VEMPTY, it is -** simpler to just test whether the value is nil. -*/ -#define tagisempty(tag) (novariant(tag) == LUA_TNIL) - - -/* macro to test for a standard nil */ -#define ttisstrictnil(o) checktag((o), LUA_VNIL) - - -#define setnilvalue(obj) settt_(obj, LUA_VNIL) - - -#define isabstkey(v) checktag((v), LUA_VABSTKEY) - - -/* -** macro to detect non-standard nils (used only in assertions) -*/ -#define isnonstrictnil(v) (ttisnil(v) && !ttisstrictnil(v)) - - -/* -** By default, entries with any kind of nil are considered empty. -** (In any definition, values associated with absent keys must also -** be accepted as empty.) -*/ -#define isempty(v) ttisnil(v) - - -/* macro defining a value corresponding to an absent key */ -#define ABSTKEYCONSTANT {NULL}, LUA_VABSTKEY - - -/* mark an entry as empty */ -#define setempty(v) settt_(v, LUA_VEMPTY) - - - -/* }================================================================== */ - - -/* -** {================================================================== -** Booleans -** =================================================================== -*/ - - -#define LUA_VFALSE makevariant(LUA_TBOOLEAN, 0) -#define LUA_VTRUE makevariant(LUA_TBOOLEAN, 1) - -#define ttisboolean(o) checktype((o), LUA_TBOOLEAN) -#define ttisfalse(o) checktag((o), LUA_VFALSE) -#define ttistrue(o) checktag((o), LUA_VTRUE) - - -#define l_isfalse(o) (ttisfalse(o) || ttisnil(o)) -#define tagisfalse(t) ((t) == LUA_VFALSE || novariant(t) == LUA_TNIL) - - - -#define setbfvalue(obj) settt_(obj, LUA_VFALSE) -#define setbtvalue(obj) settt_(obj, LUA_VTRUE) - -/* }================================================================== */ - - -/* -** {================================================================== -** Threads -** =================================================================== -*/ - -#define LUA_VTHREAD makevariant(LUA_TTHREAD, 0) - -#define ttisthread(o) checktag((o), ctb(LUA_VTHREAD)) - -#define thvalue(o) check_exp(ttisthread(o), gco2th(val_(o).gc)) - -#define setthvalue(L,obj,x) \ - { TValue *io = (obj); lua_State *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTHREAD)); \ - checkliveness(L,io); } - -#define setthvalue2s(L,o,t) setthvalue(L,s2v(o),t) - -/* }================================================================== */ - - -/* -** {================================================================== -** Collectable Objects -** =================================================================== -*/ - -/* -** Common Header for all collectable objects (in macro form, to be -** included in other objects) -*/ -#define CommonHeader struct GCObject *next; lu_byte tt; lu_byte marked - - -/* Common type for all collectable objects */ -typedef struct GCObject { - CommonHeader; -} GCObject; - - -/* Bit mark for collectable types */ -#define BIT_ISCOLLECTABLE (1 << 6) - -#define iscollectable(o) (rawtt(o) & BIT_ISCOLLECTABLE) - -/* mark a tag as collectable */ -#define ctb(t) ((t) | BIT_ISCOLLECTABLE) - -#define gcvalue(o) check_exp(iscollectable(o), val_(o).gc) - -#define gcvalueraw(v) ((v).gc) - -#define setgcovalue(L,obj,x) \ - { TValue *io = (obj); GCObject *i_g=(x); \ - val_(io).gc = i_g; settt_(io, ctb(i_g->tt)); } - -/* }================================================================== */ - - -/* -** {================================================================== -** Numbers -** =================================================================== -*/ - -/* Variant tags for numbers */ -#define LUA_VNUMINT makevariant(LUA_TNUMBER, 0) /* integer numbers */ -#define LUA_VNUMFLT makevariant(LUA_TNUMBER, 1) /* float numbers */ - -#define ttisnumber(o) checktype((o), LUA_TNUMBER) -#define ttisfloat(o) checktag((o), LUA_VNUMFLT) -#define ttisinteger(o) checktag((o), LUA_VNUMINT) - -#define nvalue(o) check_exp(ttisnumber(o), \ - (ttisinteger(o) ? cast_num(ivalue(o)) : fltvalue(o))) -#define fltvalue(o) check_exp(ttisfloat(o), val_(o).n) -#define ivalue(o) check_exp(ttisinteger(o), val_(o).i) - -#define fltvalueraw(v) ((v).n) -#define ivalueraw(v) ((v).i) - -#define setfltvalue(obj,x) \ - { TValue *io=(obj); val_(io).n=(x); settt_(io, LUA_VNUMFLT); } - -#define chgfltvalue(obj,x) \ - { TValue *io=(obj); lua_assert(ttisfloat(io)); val_(io).n=(x); } - -#define setivalue(obj,x) \ - { TValue *io=(obj); val_(io).i=(x); settt_(io, LUA_VNUMINT); } - -#define chgivalue(obj,x) \ - { TValue *io=(obj); lua_assert(ttisinteger(io)); val_(io).i=(x); } - -/* }================================================================== */ - - -/* -** {================================================================== -** Strings -** =================================================================== -*/ - -/* Variant tags for strings */ -#define LUA_VSHRSTR makevariant(LUA_TSTRING, 0) /* short strings */ -#define LUA_VLNGSTR makevariant(LUA_TSTRING, 1) /* long strings */ - -#define ttisstring(o) checktype((o), LUA_TSTRING) -#define ttisshrstring(o) checktag((o), ctb(LUA_VSHRSTR)) -#define ttislngstring(o) checktag((o), ctb(LUA_VLNGSTR)) - -#define tsvalueraw(v) (gco2ts((v).gc)) - -#define tsvalue(o) check_exp(ttisstring(o), gco2ts(val_(o).gc)) - -#define setsvalue(L,obj,x) \ - { TValue *io = (obj); TString *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(x_->tt)); \ - checkliveness(L,io); } - -/* set a string to the stack */ -#define setsvalue2s(L,o,s) setsvalue(L,s2v(o),s) - -/* set a string to a new object */ -#define setsvalue2n setsvalue - - -/* Kinds of long strings (stored in 'shrlen') */ -#define LSTRREG -1 /* regular long string */ -#define LSTRFIX -2 /* fixed external long string */ -#define LSTRMEM -3 /* external long string with deallocation */ - - -/* -** Header for a string value. -*/ -typedef struct TString { - CommonHeader; - lu_byte extra; /* reserved words for short strings; "has hash" for longs */ - ls_byte shrlen; /* length for short strings, negative for long strings */ - unsigned int hash; - union { - size_t lnglen; /* length for long strings */ - struct TString *hnext; /* linked list for hash table */ - } u; - char *contents; /* pointer to content in long strings */ - lua_Alloc falloc; /* deallocation function for external strings */ - void *ud; /* user data for external strings */ -} TString; - - -#define strisshr(ts) ((ts)->shrlen >= 0) - - -/* -** Get the actual string (array of bytes) from a 'TString'. (Generic -** version and specialized versions for long and short strings.) -*/ -#define rawgetshrstr(ts) (cast_charp(&(ts)->contents)) -#define getshrstr(ts) check_exp(strisshr(ts), rawgetshrstr(ts)) -#define getlngstr(ts) check_exp(!strisshr(ts), (ts)->contents) -#define getstr(ts) (strisshr(ts) ? rawgetshrstr(ts) : (ts)->contents) - - -/* get string length from 'TString *ts' */ -#define tsslen(ts) \ - (strisshr(ts) ? cast_uint((ts)->shrlen) : (ts)->u.lnglen) - -/* -** Get string and length */ -#define getlstr(ts, len) \ - (strisshr(ts) \ - ? (cast_void((len) = (ts)->shrlen), rawgetshrstr(ts)) \ - : (cast_void((len) = (ts)->u.lnglen), (ts)->contents)) - -/* }================================================================== */ - - -/* -** {================================================================== -** Userdata -** =================================================================== -*/ - - -/* -** Light userdata should be a variant of userdata, but for compatibility -** reasons they are also different types. -*/ -#define LUA_VLIGHTUSERDATA makevariant(LUA_TLIGHTUSERDATA, 0) - -#define LUA_VUSERDATA makevariant(LUA_TUSERDATA, 0) - -#define ttislightuserdata(o) checktag((o), LUA_VLIGHTUSERDATA) -#define ttisfulluserdata(o) checktag((o), ctb(LUA_VUSERDATA)) - -#define pvalue(o) check_exp(ttislightuserdata(o), val_(o).p) -#define uvalue(o) check_exp(ttisfulluserdata(o), gco2u(val_(o).gc)) - -#define pvalueraw(v) ((v).p) - -#define setpvalue(obj,x) \ - { TValue *io=(obj); val_(io).p=(x); settt_(io, LUA_VLIGHTUSERDATA); } - -#define setuvalue(L,obj,x) \ - { TValue *io = (obj); Udata *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VUSERDATA)); \ - checkliveness(L,io); } - - -/* Ensures that addresses after this type are always fully aligned. */ -typedef union UValue { - TValue uv; - LUAI_MAXALIGN; /* ensures maximum alignment for udata bytes */ -} UValue; - - -/* -** Header for userdata with user values; -** memory area follows the end of this structure. -*/ -typedef struct Udata { - CommonHeader; - unsigned short nuvalue; /* number of user values */ - size_t len; /* number of bytes */ - struct Table *metatable; - GCObject *gclist; - UValue uv[1]; /* user values */ -} Udata; - - -/* -** Header for userdata with no user values. These userdata do not need -** to be gray during GC, and therefore do not need a 'gclist' field. -** To simplify, the code always use 'Udata' for both kinds of userdata, -** making sure it never accesses 'gclist' on userdata with no user values. -** This structure here is used only to compute the correct size for -** this representation. (The 'bindata' field in its end ensures correct -** alignment for binary data following this header.) -*/ -typedef struct Udata0 { - CommonHeader; - unsigned short nuvalue; /* number of user values */ - size_t len; /* number of bytes */ - struct Table *metatable; - union {LUAI_MAXALIGN;} bindata; -} Udata0; - - -/* compute the offset of the memory area of a userdata */ -#define udatamemoffset(nuv) \ - ((nuv) == 0 ? offsetof(Udata0, bindata) \ - : offsetof(Udata, uv) + (sizeof(UValue) * (nuv))) - -/* get the address of the memory block inside 'Udata' */ -#define getudatamem(u) (cast_charp(u) + udatamemoffset((u)->nuvalue)) - -/* compute the size of a userdata */ -#define sizeudata(nuv,nb) (udatamemoffset(nuv) + (nb)) - -/* }================================================================== */ - - -/* -** {================================================================== -** Prototypes -** =================================================================== -*/ - -#define LUA_VPROTO makevariant(LUA_TPROTO, 0) - - -/* -** Description of an upvalue for function prototypes -*/ -typedef struct Upvaldesc { - TString *name; /* upvalue name (for debug information) */ - lu_byte instack; /* whether it is in stack (register) */ - lu_byte idx; /* index of upvalue (in stack or in outer function's list) */ - lu_byte kind; /* kind of corresponding variable */ -} Upvaldesc; - - -/* -** Description of a local variable for function prototypes -** (used for debug information) -*/ -typedef struct LocVar { - TString *varname; - int startpc; /* first point where variable is active */ - int endpc; /* first point where variable is dead */ -} LocVar; - - -/* -** Associates the absolute line source for a given instruction ('pc'). -** The array 'lineinfo' gives, for each instruction, the difference in -** lines from the previous instruction. When that difference does not -** fit into a byte, Lua saves the absolute line for that instruction. -** (Lua also saves the absolute line periodically, to speed up the -** computation of a line number: we can use binary search in the -** absolute-line array, but we must traverse the 'lineinfo' array -** linearly to compute a line.) -*/ -typedef struct AbsLineInfo { - int pc; - int line; -} AbsLineInfo; - - -/* -** Flags in Prototypes -*/ -#define PF_ISVARARG 1 -#define PF_FIXED 2 /* prototype has parts in fixed memory */ - - -/* -** Function Prototypes -*/ -typedef struct Proto { - CommonHeader; - lu_byte numparams; /* number of fixed (named) parameters */ - lu_byte flag; - lu_byte maxstacksize; /* number of registers needed by this function */ - int sizeupvalues; /* size of 'upvalues' */ - int sizek; /* size of 'k' */ - int sizecode; - int sizelineinfo; - int sizep; /* size of 'p' */ - int sizelocvars; - int sizeabslineinfo; /* size of 'abslineinfo' */ - int linedefined; /* debug information */ - int lastlinedefined; /* debug information */ - TValue *k; /* constants used by the function */ - Instruction *code; /* opcodes */ - struct Proto **p; /* functions defined inside the function */ - Upvaldesc *upvalues; /* upvalue information */ - ls_byte *lineinfo; /* information about source lines (debug information) */ - AbsLineInfo *abslineinfo; /* idem */ - LocVar *locvars; /* information about local variables (debug information) */ - TString *source; /* used for debug information */ - GCObject *gclist; -} Proto; - -/* }================================================================== */ - - -/* -** {================================================================== -** Functions -** =================================================================== -*/ - -#define LUA_VUPVAL makevariant(LUA_TUPVAL, 0) - - -/* Variant tags for functions */ -#define LUA_VLCL makevariant(LUA_TFUNCTION, 0) /* Lua closure */ -#define LUA_VLCF makevariant(LUA_TFUNCTION, 1) /* light C function */ -#define LUA_VCCL makevariant(LUA_TFUNCTION, 2) /* C closure */ - -#define ttisfunction(o) checktype(o, LUA_TFUNCTION) -#define ttisLclosure(o) checktag((o), ctb(LUA_VLCL)) -#define ttislcf(o) checktag((o), LUA_VLCF) -#define ttisCclosure(o) checktag((o), ctb(LUA_VCCL)) -#define ttisclosure(o) (ttisLclosure(o) || ttisCclosure(o)) - - -#define isLfunction(o) ttisLclosure(o) - -#define clvalue(o) check_exp(ttisclosure(o), gco2cl(val_(o).gc)) -#define clLvalue(o) check_exp(ttisLclosure(o), gco2lcl(val_(o).gc)) -#define fvalue(o) check_exp(ttislcf(o), val_(o).f) -#define clCvalue(o) check_exp(ttisCclosure(o), gco2ccl(val_(o).gc)) - -#define fvalueraw(v) ((v).f) - -#define setclLvalue(L,obj,x) \ - { TValue *io = (obj); LClosure *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VLCL)); \ - checkliveness(L,io); } - -#define setclLvalue2s(L,o,cl) setclLvalue(L,s2v(o),cl) - -#define setfvalue(obj,x) \ - { TValue *io=(obj); val_(io).f=(x); settt_(io, LUA_VLCF); } - -#define setclCvalue(L,obj,x) \ - { TValue *io = (obj); CClosure *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VCCL)); \ - checkliveness(L,io); } - - -/* -** Upvalues for Lua closures -*/ -typedef struct UpVal { - CommonHeader; - union { - TValue *p; /* points to stack or to its own value */ - ptrdiff_t offset; /* used while the stack is being reallocated */ - } v; - union { - struct { /* (when open) */ - struct UpVal *next; /* linked list */ - struct UpVal **previous; - } open; - TValue value; /* the value (when closed) */ - } u; -} UpVal; - - - -#define ClosureHeader \ - CommonHeader; lu_byte nupvalues; GCObject *gclist - -typedef struct CClosure { - ClosureHeader; - lua_CFunction f; - TValue upvalue[1]; /* list of upvalues */ -} CClosure; - - -typedef struct LClosure { - ClosureHeader; - struct Proto *p; - UpVal *upvals[1]; /* list of upvalues */ -} LClosure; - - -typedef union Closure { - CClosure c; - LClosure l; -} Closure; - - -#define getproto(o) (clLvalue(o)->p) - -/* }================================================================== */ - - -/* -** {================================================================== -** Tables -** =================================================================== -*/ - -#define LUA_VTABLE makevariant(LUA_TTABLE, 0) - -#define ttistable(o) checktag((o), ctb(LUA_VTABLE)) - -#define hvalue(o) check_exp(ttistable(o), gco2t(val_(o).gc)) - -#define sethvalue(L,obj,x) \ - { TValue *io = (obj); Table *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTABLE)); \ - checkliveness(L,io); } - -#define sethvalue2s(L,o,h) sethvalue(L,s2v(o),h) - - -/* -** Nodes for Hash tables: A pack of two TValue's (key-value pairs) -** plus a 'next' field to link colliding entries. The distribution -** of the key's fields ('key_tt' and 'key_val') not forming a proper -** 'TValue' allows for a smaller size for 'Node' both in 4-byte -** and 8-byte alignments. -*/ -typedef union Node { - struct NodeKey { - TValuefields; /* fields for value */ - lu_byte key_tt; /* key type */ - int next; /* for chaining */ - Value key_val; /* key value */ - } u; - TValue i_val; /* direct access to node's value as a proper 'TValue' */ -} Node; - - -/* copy a value into a key */ -#define setnodekey(L,node,obj) \ - { Node *n_=(node); const TValue *io_=(obj); \ - n_->u.key_val = io_->value_; n_->u.key_tt = io_->tt_; \ - checkliveness(L,io_); } - - -/* copy a value from a key */ -#define getnodekey(L,obj,node) \ - { TValue *io_=(obj); const Node *n_=(node); \ - io_->value_ = n_->u.key_val; io_->tt_ = n_->u.key_tt; \ - checkliveness(L,io_); } - - -/* -** About 'alimit': if 'isrealasize(t)' is true, then 'alimit' is the -** real size of 'array'. Otherwise, the real size of 'array' is the -** smallest power of two not smaller than 'alimit' (or zero iff 'alimit' -** is zero); 'alimit' is then used as a hint for #t. -*/ - -#define BITRAS (1 << 7) -#define isrealasize(t) (!((t)->flags & BITRAS)) -#define setrealasize(t) ((t)->flags &= cast_byte(~BITRAS)) -#define setnorealasize(t) ((t)->flags |= BITRAS) - - -typedef struct ArrayCell ArrayCell; - - -typedef struct Table { - CommonHeader; - lu_byte flags; /* 1<

u.key_tt) -#define keyval(node) ((node)->u.key_val) - -#define keyisnil(node) (keytt(node) == LUA_TNIL) -#define keyisinteger(node) (keytt(node) == LUA_VNUMINT) -#define keyival(node) (keyval(node).i) -#define keyisshrstr(node) (keytt(node) == ctb(LUA_VSHRSTR)) -#define keystrval(node) (gco2ts(keyval(node).gc)) - -#define setnilkey(node) (keytt(node) = LUA_TNIL) - -#define keyiscollectable(n) (keytt(n) & BIT_ISCOLLECTABLE) - -#define gckey(n) (keyval(n).gc) -#define gckeyN(n) (keyiscollectable(n) ? gckey(n) : NULL) - - -/* -** Dead keys in tables have the tag DEADKEY but keep their original -** gcvalue. This distinguishes them from regular keys but allows them to -** be found when searched in a special way. ('next' needs that to find -** keys removed from a table during a traversal.) -*/ -#define setdeadkey(node) (keytt(node) = LUA_TDEADKEY) -#define keyisdead(node) (keytt(node) == LUA_TDEADKEY) - -/* }================================================================== */ - - - -/* -** 'module' operation for hashing (size is always a power of 2) -*/ -#define lmod(s,size) \ - (check_exp((size&(size-1))==0, (cast_int((s) & ((size)-1))))) - - -#define twoto(x) (1<<(x)) -#define sizenode(t) (twoto((t)->lsizenode)) - - -/* size of buffer for 'luaO_utf8esc' function */ -#define UTF8BUFFSZ 8 - -LUAI_FUNC int luaO_utf8esc (char *buff, unsigned long x); -LUAI_FUNC int luaO_ceillog2 (unsigned int x); -LUAI_FUNC unsigned int luaO_codeparam (unsigned int p); -LUAI_FUNC l_obj luaO_applyparam (unsigned int p, l_obj x); - -LUAI_FUNC int luaO_rawarith (lua_State *L, int op, const TValue *p1, - const TValue *p2, TValue *res); -LUAI_FUNC void luaO_arith (lua_State *L, int op, const TValue *p1, - const TValue *p2, StkId res); -LUAI_FUNC size_t luaO_str2num (const char *s, TValue *o); -LUAI_FUNC int luaO_hexavalue (int c); -LUAI_FUNC void luaO_tostring (lua_State *L, TValue *obj); -LUAI_FUNC const char *luaO_pushvfstring (lua_State *L, const char *fmt, - va_list argp); -LUAI_FUNC const char *luaO_pushfstring (lua_State *L, const char *fmt, ...); -LUAI_FUNC void luaO_chunkid (char *out, const char *source, size_t srclen); - - -#endif - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lopcodes.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lopcodes.c deleted file mode 100644 index c67aa22..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lopcodes.c +++ /dev/null @@ -1,104 +0,0 @@ -/* -** $Id: lopcodes.c $ -** Opcodes for Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#define lopcodes_c -#define LUA_CORE - -#include "lprefix.h" - - -#include "lopcodes.h" - - -/* ORDER OP */ - -LUAI_DDEF const lu_byte luaP_opmodes[NUM_OPCODES] = { -/* MM OT IT T A mode opcode */ - opmode(0, 0, 0, 0, 1, iABC) /* OP_MOVE */ - ,opmode(0, 0, 0, 0, 1, iAsBx) /* OP_LOADI */ - ,opmode(0, 0, 0, 0, 1, iAsBx) /* OP_LOADF */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_LOADK */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_LOADKX */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LOADFALSE */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LFALSESKIP */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LOADTRUE */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LOADNIL */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETUPVAL */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETUPVAL */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETTABUP */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETTABLE */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETI */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETFIELD */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETTABUP */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETTABLE */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETI */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETFIELD */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_NEWTABLE */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SELF */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_ADDI */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_ADDK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SUBK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MULK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MODK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_POWK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_DIVK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_IDIVK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BANDK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BORK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BXORK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHRI */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHLI */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_ADD */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SUB */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MUL */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MOD */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_POW */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_DIV */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_IDIV */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BAND */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BOR */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BXOR */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHL */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHR */ - ,opmode(1, 0, 0, 0, 0, iABC) /* OP_MMBIN */ - ,opmode(1, 0, 0, 0, 0, iABC) /* OP_MMBINI*/ - ,opmode(1, 0, 0, 0, 0, iABC) /* OP_MMBINK*/ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_UNM */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BNOT */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_NOT */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LEN */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_CONCAT */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_CLOSE */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_TBC */ - ,opmode(0, 0, 0, 0, 0, isJ) /* OP_JMP */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_EQ */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LT */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LE */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_EQK */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_EQI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LTI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LEI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_GTI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_GEI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_TEST */ - ,opmode(0, 0, 0, 1, 1, iABC) /* OP_TESTSET */ - ,opmode(0, 1, 1, 0, 1, iABC) /* OP_CALL */ - ,opmode(0, 1, 1, 0, 1, iABC) /* OP_TAILCALL */ - ,opmode(0, 0, 1, 0, 0, iABC) /* OP_RETURN */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_RETURN0 */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_RETURN1 */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_FORLOOP */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_FORPREP */ - ,opmode(0, 0, 0, 0, 0, iABx) /* OP_TFORPREP */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_TFORCALL */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_TFORLOOP */ - ,opmode(0, 0, 1, 0, 0, iABC) /* OP_SETLIST */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_CLOSURE */ - ,opmode(0, 1, 0, 0, 1, iABC) /* OP_VARARG */ - ,opmode(0, 0, 1, 0, 1, iABC) /* OP_VARARGPREP */ - ,opmode(0, 0, 0, 0, 0, iAx) /* OP_EXTRAARG */ -}; - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lopcodes.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lopcodes.h deleted file mode 100644 index 46911ca..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lopcodes.h +++ /dev/null @@ -1,405 +0,0 @@ -/* -** $Id: lopcodes.h $ -** Opcodes for Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#ifndef lopcodes_h -#define lopcodes_h - -#include "llimits.h" - - -/*=========================================================================== - We assume that instructions are unsigned 32-bit integers. - All instructions have an opcode in the first 7 bits. - Instructions can have the following formats: - - 3 3 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 - 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 -iABC C(8) | B(8) |k| A(8) | Op(7) | -iABx Bx(17) | A(8) | Op(7) | -iAsBx sBx (signed)(17) | A(8) | Op(7) | -iAx Ax(25) | Op(7) | -isJ sJ (signed)(25) | Op(7) | - - A signed argument is represented in excess K: the represented value is - the written unsigned value minus K, where K is half the maximum for the - corresponding unsigned argument. -===========================================================================*/ - - -enum OpMode {iABC, iABx, iAsBx, iAx, isJ}; /* basic instruction formats */ - - -/* -** size and position of opcode arguments. -*/ -#define SIZE_C 8 -#define SIZE_B 8 -#define SIZE_Bx (SIZE_C + SIZE_B + 1) -#define SIZE_A 8 -#define SIZE_Ax (SIZE_Bx + SIZE_A) -#define SIZE_sJ (SIZE_Bx + SIZE_A) - -#define SIZE_OP 7 - -#define POS_OP 0 - -#define POS_A (POS_OP + SIZE_OP) -#define POS_k (POS_A + SIZE_A) -#define POS_B (POS_k + 1) -#define POS_C (POS_B + SIZE_B) - -#define POS_Bx POS_k - -#define POS_Ax POS_A - -#define POS_sJ POS_A - - -/* -** limits for opcode arguments. -** we use (signed) 'int' to manipulate most arguments, -** so they must fit in ints. -*/ - -/* Check whether type 'int' has at least 'b' bits ('b' < 32) */ -#define L_INTHASBITS(b) ((UINT_MAX >> ((b) - 1)) >= 1) - - -#if L_INTHASBITS(SIZE_Bx) -#define MAXARG_Bx ((1<>1) /* 'sBx' is signed */ - - -#if L_INTHASBITS(SIZE_Ax) -#define MAXARG_Ax ((1<> 1) - - -#define MAXARG_A ((1<> 1) - -#define int2sC(i) ((i) + OFFSET_sC) -#define sC2int(i) ((i) - OFFSET_sC) - - -/* creates a mask with 'n' 1 bits at position 'p' */ -#define MASK1(n,p) ((~((~(Instruction)0)<<(n)))<<(p)) - -/* creates a mask with 'n' 0 bits at position 'p' */ -#define MASK0(n,p) (~MASK1(n,p)) - -/* -** the following macros help to manipulate instructions -*/ - -#define GET_OPCODE(i) (cast(OpCode, ((i)>>POS_OP) & MASK1(SIZE_OP,0))) -#define SET_OPCODE(i,o) ((i) = (((i)&MASK0(SIZE_OP,POS_OP)) | \ - ((cast(Instruction, o)<>(pos)) & MASK1(size,0))) -#define setarg(i,v,pos,size) ((i) = (((i)&MASK0(size,pos)) | \ - ((cast(Instruction, v)<> sC */ -OP_SHLI,/* A B sC R[A] := sC << R[B] */ - -OP_ADD,/* A B C R[A] := R[B] + R[C] */ -OP_SUB,/* A B C R[A] := R[B] - R[C] */ -OP_MUL,/* A B C R[A] := R[B] * R[C] */ -OP_MOD,/* A B C R[A] := R[B] % R[C] */ -OP_POW,/* A B C R[A] := R[B] ^ R[C] */ -OP_DIV,/* A B C R[A] := R[B] / R[C] */ -OP_IDIV,/* A B C R[A] := R[B] // R[C] */ - -OP_BAND,/* A B C R[A] := R[B] & R[C] */ -OP_BOR,/* A B C R[A] := R[B] | R[C] */ -OP_BXOR,/* A B C R[A] := R[B] ~ R[C] */ -OP_SHL,/* A B C R[A] := R[B] << R[C] */ -OP_SHR,/* A B C R[A] := R[B] >> R[C] */ - -OP_MMBIN,/* A B C call C metamethod over R[A] and R[B] (*) */ -OP_MMBINI,/* A sB C k call C metamethod over R[A] and sB */ -OP_MMBINK,/* A B C k call C metamethod over R[A] and K[B] */ - -OP_UNM,/* A B R[A] := -R[B] */ -OP_BNOT,/* A B R[A] := ~R[B] */ -OP_NOT,/* A B R[A] := not R[B] */ -OP_LEN,/* A B R[A] := #R[B] (length operator) */ - -OP_CONCAT,/* A B R[A] := R[A].. ... ..R[A + B - 1] */ - -OP_CLOSE,/* A close all upvalues >= R[A] */ -OP_TBC,/* A mark variable A "to be closed" */ -OP_JMP,/* sJ pc += sJ */ -OP_EQ,/* A B k if ((R[A] == R[B]) ~= k) then pc++ */ -OP_LT,/* A B k if ((R[A] < R[B]) ~= k) then pc++ */ -OP_LE,/* A B k if ((R[A] <= R[B]) ~= k) then pc++ */ - -OP_EQK,/* A B k if ((R[A] == K[B]) ~= k) then pc++ */ -OP_EQI,/* A sB k if ((R[A] == sB) ~= k) then pc++ */ -OP_LTI,/* A sB k if ((R[A] < sB) ~= k) then pc++ */ -OP_LEI,/* A sB k if ((R[A] <= sB) ~= k) then pc++ */ -OP_GTI,/* A sB k if ((R[A] > sB) ~= k) then pc++ */ -OP_GEI,/* A sB k if ((R[A] >= sB) ~= k) then pc++ */ - -OP_TEST,/* A k if (not R[A] == k) then pc++ */ -OP_TESTSET,/* A B k if (not R[B] == k) then pc++ else R[A] := R[B] (*) */ - -OP_CALL,/* A B C R[A], ... ,R[A+C-2] := R[A](R[A+1], ... ,R[A+B-1]) */ -OP_TAILCALL,/* A B C k return R[A](R[A+1], ... ,R[A+B-1]) */ - -OP_RETURN,/* A B C k return R[A], ... ,R[A+B-2] (see note) */ -OP_RETURN0,/* return */ -OP_RETURN1,/* A return R[A] */ - -OP_FORLOOP,/* A Bx update counters; if loop continues then pc-=Bx; */ -OP_FORPREP,/* A Bx ; - if not to run then pc+=Bx+1; */ - -OP_TFORPREP,/* A Bx create upvalue for R[A + 3]; pc+=Bx */ -OP_TFORCALL,/* A C R[A+4], ... ,R[A+3+C] := R[A](R[A+1], R[A+2]); */ -OP_TFORLOOP,/* A Bx if R[A+2] ~= nil then { R[A]=R[A+2]; pc -= Bx } */ - -OP_SETLIST,/* A B C k R[A][C+i] := R[A+i], 1 <= i <= B */ - -OP_CLOSURE,/* A Bx R[A] := closure(KPROTO[Bx]) */ - -OP_VARARG,/* A C R[A], R[A+1], ..., R[A+C-2] = vararg */ - -OP_VARARGPREP,/*A (adjust vararg parameters) */ - -OP_EXTRAARG/* Ax extra (larger) argument for previous opcode */ -} OpCode; - - -#define NUM_OPCODES ((int)(OP_EXTRAARG) + 1) - - - -/*=========================================================================== - Notes: - - (*) Opcode OP_LFALSESKIP is used to convert a condition to a boolean - value, in a code equivalent to (not cond ? false : true). (It - produces false and skips the next instruction producing true.) - - (*) Opcodes OP_MMBIN and variants follow each arithmetic and - bitwise opcode. If the operation succeeds, it skips this next - opcode. Otherwise, this opcode calls the corresponding metamethod. - - (*) Opcode OP_TESTSET is used in short-circuit expressions that need - both to jump and to produce a value, such as (a = b or c). - - (*) In OP_CALL, if (B == 0) then B = top - A. If (C == 0), then - 'top' is set to last_result+1, so next open instruction (OP_CALL, - OP_RETURN*, OP_SETLIST) may use 'top'. - - (*) In OP_VARARG, if (C == 0) then use actual number of varargs and - set top (like in OP_CALL with C == 0). - - (*) In OP_RETURN, if (B == 0) then return up to 'top'. - - (*) In OP_LOADKX and OP_NEWTABLE, the next instruction is always - OP_EXTRAARG. - - (*) In OP_SETLIST, if (B == 0) then real B = 'top'; if k, then - real C = EXTRAARG _ C (the bits of EXTRAARG concatenated with the - bits of C). - - (*) In OP_NEWTABLE, B is log2 of the hash size (which is always a - power of 2) plus 1, or zero for size zero. If not k, the array size - is C. Otherwise, the array size is EXTRAARG _ C. - - (*) For comparisons, k specifies what condition the test should accept - (true or false). - - (*) In OP_MMBINI/OP_MMBINK, k means the arguments were flipped - (the constant is the first operand). - - (*) All 'skips' (pc++) assume that next instruction is a jump. - - (*) In instructions OP_RETURN/OP_TAILCALL, 'k' specifies that the - function builds upvalues, which may need to be closed. C > 0 means - the function is vararg, so that its 'func' must be corrected before - returning; in this case, (C - 1) is its number of fixed parameters. - - (*) In comparisons with an immediate operand, C signals whether the - original operand was a float. (It must be corrected in case of - metamethods.) - -===========================================================================*/ - - -/* -** masks for instruction properties. The format is: -** bits 0-2: op mode -** bit 3: instruction set register A -** bit 4: operator is a test (next instruction must be a jump) -** bit 5: instruction uses 'L->top' set by previous instruction (when B == 0) -** bit 6: instruction sets 'L->top' for next instruction (when C == 0) -** bit 7: instruction is an MM instruction (call a metamethod) -*/ - -LUAI_DDEC(const lu_byte luaP_opmodes[NUM_OPCODES];) - -#define getOpMode(m) (cast(enum OpMode, luaP_opmodes[m] & 7)) -#define testAMode(m) (luaP_opmodes[m] & (1 << 3)) -#define testTMode(m) (luaP_opmodes[m] & (1 << 4)) -#define testITMode(m) (luaP_opmodes[m] & (1 << 5)) -#define testOTMode(m) (luaP_opmodes[m] & (1 << 6)) -#define testMMMode(m) (luaP_opmodes[m] & (1 << 7)) - -/* "out top" (set top for next instruction) */ -#define isOT(i) \ - ((testOTMode(GET_OPCODE(i)) && GETARG_C(i) == 0) || \ - GET_OPCODE(i) == OP_TAILCALL) - -/* "in top" (uses top from previous instruction) */ -#define isIT(i) (testITMode(GET_OPCODE(i)) && GETARG_B(i) == 0) - -#define opmode(mm,ot,it,t,a,m) \ - (((mm) << 7) | ((ot) << 6) | ((it) << 5) | ((t) << 4) | ((a) << 3) | (m)) - - -/* number of list items to accumulate before a SETLIST instruction */ -#define LFIELDS_PER_FLUSH 50 - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lopnames.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lopnames.h deleted file mode 100644 index 965cec9..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lopnames.h +++ /dev/null @@ -1,103 +0,0 @@ -/* -** $Id: lopnames.h $ -** Opcode names -** See Copyright Notice in lua.h -*/ - -#if !defined(lopnames_h) -#define lopnames_h - -#include - - -/* ORDER OP */ - -static const char *const opnames[] = { - "MOVE", - "LOADI", - "LOADF", - "LOADK", - "LOADKX", - "LOADFALSE", - "LFALSESKIP", - "LOADTRUE", - "LOADNIL", - "GETUPVAL", - "SETUPVAL", - "GETTABUP", - "GETTABLE", - "GETI", - "GETFIELD", - "SETTABUP", - "SETTABLE", - "SETI", - "SETFIELD", - "NEWTABLE", - "SELF", - "ADDI", - "ADDK", - "SUBK", - "MULK", - "MODK", - "POWK", - "DIVK", - "IDIVK", - "BANDK", - "BORK", - "BXORK", - "SHRI", - "SHLI", - "ADD", - "SUB", - "MUL", - "MOD", - "POW", - "DIV", - "IDIV", - "BAND", - "BOR", - "BXOR", - "SHL", - "SHR", - "MMBIN", - "MMBINI", - "MMBINK", - "UNM", - "BNOT", - "NOT", - "LEN", - "CONCAT", - "CLOSE", - "TBC", - "JMP", - "EQ", - "LT", - "LE", - "EQK", - "EQI", - "LTI", - "LEI", - "GTI", - "GEI", - "TEST", - "TESTSET", - "CALL", - "TAILCALL", - "RETURN", - "RETURN0", - "RETURN1", - "FORLOOP", - "FORPREP", - "TFORPREP", - "TFORCALL", - "TFORLOOP", - "SETLIST", - "CLOSURE", - "VARARG", - "VARARGPREP", - "EXTRAARG", - NULL -}; - -#endif - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/loslib.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/loslib.c deleted file mode 100644 index ad5a927..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/loslib.c +++ /dev/null @@ -1,428 +0,0 @@ -/* -** $Id: loslib.c $ -** Standard Operating System library -** See Copyright Notice in lua.h -*/ - -#define loslib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** {================================================================== -** List of valid conversion specifiers for the 'strftime' function; -** options are grouped by length; group of length 2 start with '||'. -** =================================================================== -*/ -#if !defined(LUA_STRFTIMEOPTIONS) /* { */ - -#if defined(LUA_USE_WINDOWS) -#define LUA_STRFTIMEOPTIONS "aAbBcdHIjmMpSUwWxXyYzZ%" \ - "||" "#c#x#d#H#I#j#m#M#S#U#w#W#y#Y" /* two-char options */ -#elif defined(LUA_USE_C89) /* ANSI C 89 (only 1-char options) */ -#define LUA_STRFTIMEOPTIONS "aAbBcdHIjmMpSUwWxXyYZ%" -#else /* C99 specification */ -#define LUA_STRFTIMEOPTIONS "aAbBcCdDeFgGhHIjmMnprRStTuUVwWxXyYzZ%" \ - "||" "EcECExEXEyEY" "OdOeOHOIOmOMOSOuOUOVOwOWOy" /* two-char options */ -#endif - -#endif /* } */ -/* }================================================================== */ - - -/* -** {================================================================== -** Configuration for time-related stuff -** =================================================================== -*/ - -/* -** type to represent time_t in Lua -*/ -#if !defined(LUA_NUMTIME) /* { */ - -#define l_timet lua_Integer -#define l_pushtime(L,t) lua_pushinteger(L,(lua_Integer)(t)) -#define l_gettime(L,arg) luaL_checkinteger(L, arg) - -#else /* }{ */ - -#define l_timet lua_Number -#define l_pushtime(L,t) lua_pushnumber(L,(lua_Number)(t)) -#define l_gettime(L,arg) luaL_checknumber(L, arg) - -#endif /* } */ - - -#if !defined(l_gmtime) /* { */ -/* -** By default, Lua uses gmtime/localtime, except when POSIX is available, -** where it uses gmtime_r/localtime_r -*/ - -#if defined(LUA_USE_POSIX) /* { */ - -#define l_gmtime(t,r) gmtime_r(t,r) -#define l_localtime(t,r) localtime_r(t,r) - -#else /* }{ */ - -/* ISO C definitions */ -#define l_gmtime(t,r) ((void)(r)->tm_sec, gmtime(t)) -#define l_localtime(t,r) ((void)(r)->tm_sec, localtime(t)) - -#endif /* } */ - -#endif /* } */ - -/* }================================================================== */ - - -/* -** {================================================================== -** Configuration for 'tmpnam': -** By default, Lua uses tmpnam except when POSIX is available, where -** it uses mkstemp. -** =================================================================== -*/ -#if !defined(lua_tmpnam) /* { */ - -#if defined(LUA_USE_POSIX) /* { */ - -#include - -#define LUA_TMPNAMBUFSIZE 32 - -#if !defined(LUA_TMPNAMTEMPLATE) -#define LUA_TMPNAMTEMPLATE "/tmp/lua_XXXXXX" -#endif - -#define lua_tmpnam(b,e) { \ - strcpy(b, LUA_TMPNAMTEMPLATE); \ - e = mkstemp(b); \ - if (e != -1) close(e); \ - e = (e == -1); } - -#else /* }{ */ - -/* ISO C definitions */ -#define LUA_TMPNAMBUFSIZE L_tmpnam -#define lua_tmpnam(b,e) { e = (tmpnam(b) == NULL); } - -#endif /* } */ - -#endif /* } */ -/* }================================================================== */ - - -#if !defined(l_system) -#if defined(LUA_USE_IOS) -/* Despite claiming to be ISO C, iOS does not implement 'system'. */ -#define l_system(cmd) ((cmd) == NULL ? 0 : -1) -#else -#define l_system(cmd) system(cmd) /* default definition */ -#endif -#endif - - -static int os_execute (lua_State *L) { - const char *cmd = luaL_optstring(L, 1, NULL); - int stat; - errno = 0; - stat = l_system(cmd); - if (cmd != NULL) - return luaL_execresult(L, stat); - else { - lua_pushboolean(L, stat); /* true if there is a shell */ - return 1; - } -} - - -static int os_remove (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - return luaL_fileresult(L, remove(filename) == 0, filename); -} - - -static int os_rename (lua_State *L) { - const char *fromname = luaL_checkstring(L, 1); - const char *toname = luaL_checkstring(L, 2); - return luaL_fileresult(L, rename(fromname, toname) == 0, NULL); -} - - -static int os_tmpname (lua_State *L) { - char buff[LUA_TMPNAMBUFSIZE]; - int err; - lua_tmpnam(buff, err); - if (l_unlikely(err)) - return luaL_error(L, "unable to generate a unique filename"); - lua_pushstring(L, buff); - return 1; -} - - -static int os_getenv (lua_State *L) { - lua_pushstring(L, getenv(luaL_checkstring(L, 1))); /* if NULL push nil */ - return 1; -} - - -static int os_clock (lua_State *L) { - lua_pushnumber(L, ((lua_Number)clock())/(lua_Number)CLOCKS_PER_SEC); - return 1; -} - - -/* -** {====================================================== -** Time/Date operations -** { year=%Y, month=%m, day=%d, hour=%H, min=%M, sec=%S, -** wday=%w+1, yday=%j, isdst=? } -** ======================================================= -*/ - -/* -** About the overflow check: an overflow cannot occur when time -** is represented by a lua_Integer, because either lua_Integer is -** large enough to represent all int fields or it is not large enough -** to represent a time that cause a field to overflow. However, if -** times are represented as doubles and lua_Integer is int, then the -** time 0x1.e1853b0d184f6p+55 would cause an overflow when adding 1900 -** to compute the year. -*/ -static void setfield (lua_State *L, const char *key, int value, int delta) { - #if (defined(LUA_NUMTIME) && LUA_MAXINTEGER <= INT_MAX) - if (l_unlikely(value > LUA_MAXINTEGER - delta)) - luaL_error(L, "field '%s' is out-of-bound", key); - #endif - lua_pushinteger(L, (lua_Integer)value + delta); - lua_setfield(L, -2, key); -} - - -static void setboolfield (lua_State *L, const char *key, int value) { - if (value < 0) /* undefined? */ - return; /* does not set field */ - lua_pushboolean(L, value); - lua_setfield(L, -2, key); -} - - -/* -** Set all fields from structure 'tm' in the table on top of the stack -*/ -static void setallfields (lua_State *L, struct tm *stm) { - setfield(L, "year", stm->tm_year, 1900); - setfield(L, "month", stm->tm_mon, 1); - setfield(L, "day", stm->tm_mday, 0); - setfield(L, "hour", stm->tm_hour, 0); - setfield(L, "min", stm->tm_min, 0); - setfield(L, "sec", stm->tm_sec, 0); - setfield(L, "yday", stm->tm_yday, 1); - setfield(L, "wday", stm->tm_wday, 1); - setboolfield(L, "isdst", stm->tm_isdst); -} - - -static int getboolfield (lua_State *L, const char *key) { - int res; - res = (lua_getfield(L, -1, key) == LUA_TNIL) ? -1 : lua_toboolean(L, -1); - lua_pop(L, 1); - return res; -} - - -static int getfield (lua_State *L, const char *key, int d, int delta) { - int isnum; - int t = lua_getfield(L, -1, key); /* get field and its type */ - lua_Integer res = lua_tointegerx(L, -1, &isnum); - if (!isnum) { /* field is not an integer? */ - if (l_unlikely(t != LUA_TNIL)) /* some other value? */ - return luaL_error(L, "field '%s' is not an integer", key); - else if (l_unlikely(d < 0)) /* absent field; no default? */ - return luaL_error(L, "field '%s' missing in date table", key); - res = d; - } - else { - if (!(res >= 0 ? res - delta <= INT_MAX : INT_MIN + delta <= res)) - return luaL_error(L, "field '%s' is out-of-bound", key); - res -= delta; - } - lua_pop(L, 1); - return (int)res; -} - - -static const char *checkoption (lua_State *L, const char *conv, - ptrdiff_t convlen, char *buff) { - const char *option = LUA_STRFTIMEOPTIONS; - int oplen = 1; /* length of options being checked */ - for (; *option != '\0' && oplen <= convlen; option += oplen) { - if (*option == '|') /* next block? */ - oplen++; /* will check options with next length (+1) */ - else if (memcmp(conv, option, oplen) == 0) { /* match? */ - memcpy(buff, conv, oplen); /* copy valid option to buffer */ - buff[oplen] = '\0'; - return conv + oplen; /* return next item */ - } - } - luaL_argerror(L, 1, - lua_pushfstring(L, "invalid conversion specifier '%%%s'", conv)); - return conv; /* to avoid warnings */ -} - - -static time_t l_checktime (lua_State *L, int arg) { - l_timet t = l_gettime(L, arg); - luaL_argcheck(L, (time_t)t == t, arg, "time out-of-bounds"); - return (time_t)t; -} - - -/* maximum size for an individual 'strftime' item */ -#define SIZETIMEFMT 250 - - -static int os_date (lua_State *L) { - size_t slen; - const char *s = luaL_optlstring(L, 1, "%c", &slen); - time_t t = luaL_opt(L, l_checktime, 2, time(NULL)); - const char *se = s + slen; /* 's' end */ - struct tm tmr, *stm; - if (*s == '!') { /* UTC? */ - stm = l_gmtime(&t, &tmr); - s++; /* skip '!' */ - } - else - stm = l_localtime(&t, &tmr); - if (stm == NULL) /* invalid date? */ - return luaL_error(L, - "date result cannot be represented in this installation"); - if (strcmp(s, "*t") == 0) { - lua_createtable(L, 0, 9); /* 9 = number of fields */ - setallfields(L, stm); - } - else { - char cc[4]; /* buffer for individual conversion specifiers */ - luaL_Buffer b; - cc[0] = '%'; - luaL_buffinit(L, &b); - while (s < se) { - if (*s != '%') /* not a conversion specifier? */ - luaL_addchar(&b, *s++); - else { - size_t reslen; - char *buff = luaL_prepbuffsize(&b, SIZETIMEFMT); - s++; /* skip '%' */ - s = checkoption(L, s, se - s, cc + 1); /* copy specifier to 'cc' */ - reslen = strftime(buff, SIZETIMEFMT, cc, stm); - luaL_addsize(&b, reslen); - } - } - luaL_pushresult(&b); - } - return 1; -} - - -static int os_time (lua_State *L) { - time_t t; - if (lua_isnoneornil(L, 1)) /* called without args? */ - t = time(NULL); /* get current time */ - else { - struct tm ts; - luaL_checktype(L, 1, LUA_TTABLE); - lua_settop(L, 1); /* make sure table is at the top */ - ts.tm_year = getfield(L, "year", -1, 1900); - ts.tm_mon = getfield(L, "month", -1, 1); - ts.tm_mday = getfield(L, "day", -1, 0); - ts.tm_hour = getfield(L, "hour", 12, 0); - ts.tm_min = getfield(L, "min", 0, 0); - ts.tm_sec = getfield(L, "sec", 0, 0); - ts.tm_isdst = getboolfield(L, "isdst"); - t = mktime(&ts); - setallfields(L, &ts); /* update fields with normalized values */ - } - if (t != (time_t)(l_timet)t || t == (time_t)(-1)) - return luaL_error(L, - "time result cannot be represented in this installation"); - l_pushtime(L, t); - return 1; -} - - -static int os_difftime (lua_State *L) { - time_t t1 = l_checktime(L, 1); - time_t t2 = l_checktime(L, 2); - lua_pushnumber(L, (lua_Number)difftime(t1, t2)); - return 1; -} - -/* }====================================================== */ - - -static int os_setlocale (lua_State *L) { - static const int cat[] = {LC_ALL, LC_COLLATE, LC_CTYPE, LC_MONETARY, - LC_NUMERIC, LC_TIME}; - static const char *const catnames[] = {"all", "collate", "ctype", "monetary", - "numeric", "time", NULL}; - const char *l = luaL_optstring(L, 1, NULL); - int op = luaL_checkoption(L, 2, "all", catnames); - lua_pushstring(L, setlocale(cat[op], l)); - return 1; -} - - -static int os_exit (lua_State *L) { - int status; - if (lua_isboolean(L, 1)) - status = (lua_toboolean(L, 1) ? EXIT_SUCCESS : EXIT_FAILURE); - else - status = (int)luaL_optinteger(L, 1, EXIT_SUCCESS); - if (lua_toboolean(L, 2)) - lua_close(L); - if (L) exit(status); /* 'if' to avoid warnings for unreachable 'return' */ - return 0; -} - - -static const luaL_Reg syslib[] = { - {"clock", os_clock}, - {"date", os_date}, - {"difftime", os_difftime}, - {"execute", os_execute}, - {"exit", os_exit}, - {"getenv", os_getenv}, - {"remove", os_remove}, - {"rename", os_rename}, - {"setlocale", os_setlocale}, - {"time", os_time}, - {"tmpname", os_tmpname}, - {NULL, NULL} -}; - -/* }====================================================== */ - - - -LUAMOD_API int luaopen_os (lua_State *L) { - luaL_newlib(L, syslib); - return 1; -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lparser.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lparser.c deleted file mode 100644 index 48cba06..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lparser.c +++ /dev/null @@ -1,1976 +0,0 @@ -/* -** $Id: lparser.c $ -** Lua Parser -** See Copyright Notice in lua.h -*/ - -#define lparser_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "lcode.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "llex.h" -#include "lmem.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lparser.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" - - - -/* maximum number of local variables per function (must be smaller - than 250, due to the bytecode format) */ -#define MAXVARS 200 - - -#define hasmultret(k) ((k) == VCALL || (k) == VVARARG) - - -/* because all strings are unified by the scanner, the parser - can use pointer equality for string equality */ -#define eqstr(a,b) ((a) == (b)) - - -/* -** nodes for block list (list of active blocks) -*/ -typedef struct BlockCnt { - struct BlockCnt *previous; /* chain */ - int firstlabel; /* index of first label in this block */ - int firstgoto; /* index of first pending goto in this block */ - lu_byte nactvar; /* # active locals outside the block */ - lu_byte upval; /* true if some variable in the block is an upvalue */ - lu_byte isloop; /* true if 'block' is a loop */ - lu_byte insidetbc; /* true if inside the scope of a to-be-closed var. */ -} BlockCnt; - - - -/* -** prototypes for recursive non-terminal functions -*/ -static void statement (LexState *ls); -static void expr (LexState *ls, expdesc *v); - - -static l_noret error_expected (LexState *ls, int token) { - luaX_syntaxerror(ls, - luaO_pushfstring(ls->L, "%s expected", luaX_token2str(ls, token))); -} - - -static l_noret errorlimit (FuncState *fs, int limit, const char *what) { - lua_State *L = fs->ls->L; - const char *msg; - int line = fs->f->linedefined; - const char *where = (line == 0) - ? "main function" - : luaO_pushfstring(L, "function at line %d", line); - msg = luaO_pushfstring(L, "too many %s (limit is %d) in %s", - what, limit, where); - luaX_syntaxerror(fs->ls, msg); -} - - -static void checklimit (FuncState *fs, int v, int l, const char *what) { - if (v > l) errorlimit(fs, l, what); -} - - -/* -** Test whether next token is 'c'; if so, skip it. -*/ -static int testnext (LexState *ls, int c) { - if (ls->t.token == c) { - luaX_next(ls); - return 1; - } - else return 0; -} - - -/* -** Check that next token is 'c'. -*/ -static void check (LexState *ls, int c) { - if (ls->t.token != c) - error_expected(ls, c); -} - - -/* -** Check that next token is 'c' and skip it. -*/ -static void checknext (LexState *ls, int c) { - check(ls, c); - luaX_next(ls); -} - - -#define check_condition(ls,c,msg) { if (!(c)) luaX_syntaxerror(ls, msg); } - - -/* -** Check that next token is 'what' and skip it. In case of error, -** raise an error that the expected 'what' should match a 'who' -** in line 'where' (if that is not the current line). -*/ -static void check_match (LexState *ls, int what, int who, int where) { - if (l_unlikely(!testnext(ls, what))) { - if (where == ls->linenumber) /* all in the same line? */ - error_expected(ls, what); /* do not need a complex message */ - else { - luaX_syntaxerror(ls, luaO_pushfstring(ls->L, - "%s expected (to close %s at line %d)", - luaX_token2str(ls, what), luaX_token2str(ls, who), where)); - } - } -} - - -static TString *str_checkname (LexState *ls) { - TString *ts; - check(ls, TK_NAME); - ts = ls->t.seminfo.ts; - luaX_next(ls); - return ts; -} - - -static void init_exp (expdesc *e, expkind k, int i) { - e->f = e->t = NO_JUMP; - e->k = k; - e->u.info = i; -} - - -static void codestring (expdesc *e, TString *s) { - e->f = e->t = NO_JUMP; - e->k = VKSTR; - e->u.strval = s; -} - - -static void codename (LexState *ls, expdesc *e) { - codestring(e, str_checkname(ls)); -} - - -/* -** Register a new local variable in the active 'Proto' (for debug -** information). -*/ -static int registerlocalvar (LexState *ls, FuncState *fs, TString *varname) { - Proto *f = fs->f; - int oldsize = f->sizelocvars; - luaM_growvector(ls->L, f->locvars, fs->ndebugvars, f->sizelocvars, - LocVar, SHRT_MAX, "local variables"); - while (oldsize < f->sizelocvars) - f->locvars[oldsize++].varname = NULL; - f->locvars[fs->ndebugvars].varname = varname; - f->locvars[fs->ndebugvars].startpc = fs->pc; - luaC_objbarrier(ls->L, f, varname); - return fs->ndebugvars++; -} - - -/* -** Create a new local variable with the given 'name' and given 'kind'. -** Return its index in the function. -*/ -static int new_localvarkind (LexState *ls, TString *name, int kind) { - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Dyndata *dyd = ls->dyd; - Vardesc *var; - checklimit(fs, dyd->actvar.n + 1 - fs->firstlocal, - MAXVARS, "local variables"); - luaM_growvector(L, dyd->actvar.arr, dyd->actvar.n + 1, - dyd->actvar.size, Vardesc, USHRT_MAX, "local variables"); - var = &dyd->actvar.arr[dyd->actvar.n++]; - var->vd.kind = kind; /* default */ - var->vd.name = name; - return dyd->actvar.n - 1 - fs->firstlocal; -} - - -/* -** Create a new local variable with the given 'name' and regular kind. -*/ -static int new_localvar (LexState *ls, TString *name) { - return new_localvarkind(ls, name, VDKREG); -} - -#define new_localvarliteral(ls,v) \ - new_localvar(ls, \ - luaX_newstring(ls, "" v, (sizeof(v)/sizeof(char)) - 1)); - - - -/* -** Return the "variable description" (Vardesc) of a given variable. -** (Unless noted otherwise, all variables are referred to by their -** compiler indices.) -*/ -static Vardesc *getlocalvardesc (FuncState *fs, int vidx) { - return &fs->ls->dyd->actvar.arr[fs->firstlocal + vidx]; -} - - -/* -** Convert 'nvar', a compiler index level, to its corresponding -** register. For that, search for the highest variable below that level -** that is in a register and uses its register index ('ridx') plus one. -*/ -static int reglevel (FuncState *fs, int nvar) { - while (nvar-- > 0) { - Vardesc *vd = getlocalvardesc(fs, nvar); /* get previous variable */ - if (vd->vd.kind != RDKCTC) /* is in a register? */ - return vd->vd.ridx + 1; - } - return 0; /* no variables in registers */ -} - - -/* -** Return the number of variables in the register stack for the given -** function. -*/ -int luaY_nvarstack (FuncState *fs) { - return reglevel(fs, fs->nactvar); -} - - -/* -** Get the debug-information entry for current variable 'vidx'. -*/ -static LocVar *localdebuginfo (FuncState *fs, int vidx) { - Vardesc *vd = getlocalvardesc(fs, vidx); - if (vd->vd.kind == RDKCTC) - return NULL; /* no debug info. for constants */ - else { - int idx = vd->vd.pidx; - lua_assert(idx < fs->ndebugvars); - return &fs->f->locvars[idx]; - } -} - - -/* -** Create an expression representing variable 'vidx' -*/ -static void init_var (FuncState *fs, expdesc *e, int vidx) { - e->f = e->t = NO_JUMP; - e->k = VLOCAL; - e->u.var.vidx = vidx; - e->u.var.ridx = getlocalvardesc(fs, vidx)->vd.ridx; -} - - -/* -** Raises an error if variable described by 'e' is read only -*/ -static void check_readonly (LexState *ls, expdesc *e) { - FuncState *fs = ls->fs; - TString *varname = NULL; /* to be set if variable is const */ - switch (e->k) { - case VCONST: { - varname = ls->dyd->actvar.arr[e->u.info].vd.name; - break; - } - case VLOCAL: { - Vardesc *vardesc = getlocalvardesc(fs, e->u.var.vidx); - if (vardesc->vd.kind != VDKREG) /* not a regular variable? */ - varname = vardesc->vd.name; - break; - } - case VUPVAL: { - Upvaldesc *up = &fs->f->upvalues[e->u.info]; - if (up->kind != VDKREG) - varname = up->name; - break; - } - default: - return; /* other cases cannot be read-only */ - } - if (varname) { - const char *msg = luaO_pushfstring(ls->L, - "attempt to assign to const variable '%s'", getstr(varname)); - luaK_semerror(ls, msg); /* error */ - } -} - - -/* -** Start the scope for the last 'nvars' created variables. -*/ -static void adjustlocalvars (LexState *ls, int nvars) { - FuncState *fs = ls->fs; - int reglevel = luaY_nvarstack(fs); - int i; - for (i = 0; i < nvars; i++) { - int vidx = fs->nactvar++; - Vardesc *var = getlocalvardesc(fs, vidx); - var->vd.ridx = reglevel++; - var->vd.pidx = registerlocalvar(ls, fs, var->vd.name); - } -} - - -/* -** Close the scope for all variables up to level 'tolevel'. -** (debug info.) -*/ -static void removevars (FuncState *fs, int tolevel) { - fs->ls->dyd->actvar.n -= (fs->nactvar - tolevel); - while (fs->nactvar > tolevel) { - LocVar *var = localdebuginfo(fs, --fs->nactvar); - if (var) /* does it have debug information? */ - var->endpc = fs->pc; - } -} - - -/* -** Search the upvalues of the function 'fs' for one -** with the given 'name'. -*/ -static int searchupvalue (FuncState *fs, TString *name) { - int i; - Upvaldesc *up = fs->f->upvalues; - for (i = 0; i < fs->nups; i++) { - if (eqstr(up[i].name, name)) return i; - } - return -1; /* not found */ -} - - -static Upvaldesc *allocupvalue (FuncState *fs) { - Proto *f = fs->f; - int oldsize = f->sizeupvalues; - checklimit(fs, fs->nups + 1, MAXUPVAL, "upvalues"); - luaM_growvector(fs->ls->L, f->upvalues, fs->nups, f->sizeupvalues, - Upvaldesc, MAXUPVAL, "upvalues"); - while (oldsize < f->sizeupvalues) - f->upvalues[oldsize++].name = NULL; - return &f->upvalues[fs->nups++]; -} - - -static int newupvalue (FuncState *fs, TString *name, expdesc *v) { - Upvaldesc *up = allocupvalue(fs); - FuncState *prev = fs->prev; - if (v->k == VLOCAL) { - up->instack = 1; - up->idx = v->u.var.ridx; - up->kind = getlocalvardesc(prev, v->u.var.vidx)->vd.kind; - lua_assert(eqstr(name, getlocalvardesc(prev, v->u.var.vidx)->vd.name)); - } - else { - up->instack = 0; - up->idx = cast_byte(v->u.info); - up->kind = prev->f->upvalues[v->u.info].kind; - lua_assert(eqstr(name, prev->f->upvalues[v->u.info].name)); - } - up->name = name; - luaC_objbarrier(fs->ls->L, fs->f, name); - return fs->nups - 1; -} - - -/* -** Look for an active local variable with the name 'n' in the -** function 'fs'. If found, initialize 'var' with it and return -** its expression kind; otherwise return -1. -*/ -static int searchvar (FuncState *fs, TString *n, expdesc *var) { - int i; - for (i = cast_int(fs->nactvar) - 1; i >= 0; i--) { - Vardesc *vd = getlocalvardesc(fs, i); - if (eqstr(n, vd->vd.name)) { /* found? */ - if (vd->vd.kind == RDKCTC) /* compile-time constant? */ - init_exp(var, VCONST, fs->firstlocal + i); - else /* real variable */ - init_var(fs, var, i); - return var->k; - } - } - return -1; /* not found */ -} - - -/* -** Mark block where variable at given level was defined -** (to emit close instructions later). -*/ -static void markupval (FuncState *fs, int level) { - BlockCnt *bl = fs->bl; - while (bl->nactvar > level) - bl = bl->previous; - bl->upval = 1; - fs->needclose = 1; -} - - -/* -** Mark that current block has a to-be-closed variable. -*/ -static void marktobeclosed (FuncState *fs) { - BlockCnt *bl = fs->bl; - bl->upval = 1; - bl->insidetbc = 1; - fs->needclose = 1; -} - - -/* -** Find a variable with the given name 'n'. If it is an upvalue, add -** this upvalue into all intermediate functions. If it is a global, set -** 'var' as 'void' as a flag. -*/ -static void singlevaraux (FuncState *fs, TString *n, expdesc *var, int base) { - if (fs == NULL) /* no more levels? */ - init_exp(var, VVOID, 0); /* default is global */ - else { - int v = searchvar(fs, n, var); /* look up locals at current level */ - if (v >= 0) { /* found? */ - if (v == VLOCAL && !base) - markupval(fs, var->u.var.vidx); /* local will be used as an upval */ - } - else { /* not found as local at current level; try upvalues */ - int idx = searchupvalue(fs, n); /* try existing upvalues */ - if (idx < 0) { /* not found? */ - singlevaraux(fs->prev, n, var, 0); /* try upper levels */ - if (var->k == VLOCAL || var->k == VUPVAL) /* local or upvalue? */ - idx = newupvalue(fs, n, var); /* will be a new upvalue */ - else /* it is a global or a constant */ - return; /* don't need to do anything at this level */ - } - init_exp(var, VUPVAL, idx); /* new or old upvalue */ - } - } -} - - -/* -** Find a variable with the given name 'n', handling global variables -** too. -*/ -static void singlevar (LexState *ls, expdesc *var) { - TString *varname = str_checkname(ls); - FuncState *fs = ls->fs; - singlevaraux(fs, varname, var, 1); - if (var->k == VVOID) { /* global name? */ - expdesc key; - singlevaraux(fs, ls->envn, var, 1); /* get environment variable */ - lua_assert(var->k != VVOID); /* this one must exist */ - luaK_exp2anyregup(fs, var); /* but could be a constant */ - codestring(&key, varname); /* key is variable name */ - luaK_indexed(fs, var, &key); /* env[varname] */ - } -} - - -/* -** Adjust the number of results from an expression list 'e' with 'nexps' -** expressions to 'nvars' values. -*/ -static void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) { - FuncState *fs = ls->fs; - int needed = nvars - nexps; /* extra values needed */ - if (hasmultret(e->k)) { /* last expression has multiple returns? */ - int extra = needed + 1; /* discount last expression itself */ - if (extra < 0) - extra = 0; - luaK_setreturns(fs, e, extra); /* last exp. provides the difference */ - } - else { - if (e->k != VVOID) /* at least one expression? */ - luaK_exp2nextreg(fs, e); /* close last expression */ - if (needed > 0) /* missing values? */ - luaK_nil(fs, fs->freereg, needed); /* complete with nils */ - } - if (needed > 0) - luaK_reserveregs(fs, needed); /* registers for extra values */ - else /* adding 'needed' is actually a subtraction */ - fs->freereg += needed; /* remove extra values */ -} - - -#define enterlevel(ls) luaE_incCstack(ls->L) - - -#define leavelevel(ls) ((ls)->L->nCcalls--) - - -/* -** Generates an error that a goto jumps into the scope of some -** local variable. -*/ -static l_noret jumpscopeerror (LexState *ls, Labeldesc *gt) { - TString *tsname = getlocalvardesc(ls->fs, gt->nactvar)->vd.name; - const char *varname = getstr(tsname); - const char *msg = " at line %d jumps into the scope of local '%s'"; - msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line, varname); - luaK_semerror(ls, msg); /* raise the error */ -} - - -/* -** Solves the goto at index 'g' to given 'label' and removes it -** from the list of pending gotos. -** If it jumps into the scope of some variable, raises an error. -*/ -static void solvegoto (LexState *ls, int g, Labeldesc *label) { - int i; - Labellist *gl = &ls->dyd->gt; /* list of gotos */ - Labeldesc *gt = &gl->arr[g]; /* goto to be resolved */ - lua_assert(eqstr(gt->name, label->name)); - if (l_unlikely(gt->nactvar < label->nactvar)) /* enter some scope? */ - jumpscopeerror(ls, gt); - luaK_patchlist(ls->fs, gt->pc, label->pc); - for (i = g; i < gl->n - 1; i++) /* remove goto from pending list */ - gl->arr[i] = gl->arr[i + 1]; - gl->n--; -} - - -/* -** Search for an active label with the given name. -*/ -static Labeldesc *findlabel (LexState *ls, TString *name) { - int i; - Dyndata *dyd = ls->dyd; - /* check labels in current function for a match */ - for (i = ls->fs->firstlabel; i < dyd->label.n; i++) { - Labeldesc *lb = &dyd->label.arr[i]; - if (eqstr(lb->name, name)) /* correct label? */ - return lb; - } - return NULL; /* label not found */ -} - - -/* -** Adds a new label/goto in the corresponding list. -*/ -static int newlabelentry (LexState *ls, Labellist *l, TString *name, - int line, int pc) { - int n = l->n; - luaM_growvector(ls->L, l->arr, n, l->size, - Labeldesc, SHRT_MAX, "labels/gotos"); - l->arr[n].name = name; - l->arr[n].line = line; - l->arr[n].nactvar = ls->fs->nactvar; - l->arr[n].close = 0; - l->arr[n].pc = pc; - l->n = n + 1; - return n; -} - - -static int newgotoentry (LexState *ls, TString *name, int line, int pc) { - return newlabelentry(ls, &ls->dyd->gt, name, line, pc); -} - - -/* -** Solves forward jumps. Check whether new label 'lb' matches any -** pending gotos in current block and solves them. Return true -** if any of the gotos need to close upvalues. -*/ -static int solvegotos (LexState *ls, Labeldesc *lb) { - Labellist *gl = &ls->dyd->gt; - int i = ls->fs->bl->firstgoto; - int needsclose = 0; - while (i < gl->n) { - if (eqstr(gl->arr[i].name, lb->name)) { - needsclose |= gl->arr[i].close; - solvegoto(ls, i, lb); /* will remove 'i' from the list */ - } - else - i++; - } - return needsclose; -} - - -/* -** Create a new label with the given 'name' at the given 'line'. -** 'last' tells whether label is the last non-op statement in its -** block. Solves all pending gotos to this new label and adds -** a close instruction if necessary. -** Returns true iff it added a close instruction. -*/ -static int createlabel (LexState *ls, TString *name, int line, - int last) { - FuncState *fs = ls->fs; - Labellist *ll = &ls->dyd->label; - int l = newlabelentry(ls, ll, name, line, luaK_getlabel(fs)); - if (last) { /* label is last no-op statement in the block? */ - /* assume that locals are already out of scope */ - ll->arr[l].nactvar = fs->bl->nactvar; - } - if (solvegotos(ls, &ll->arr[l])) { /* need close? */ - luaK_codeABC(fs, OP_CLOSE, luaY_nvarstack(fs), 0, 0); - return 1; - } - return 0; -} - - -/* -** Adjust pending gotos to outer level of a block. -*/ -static void movegotosout (FuncState *fs, BlockCnt *bl) { - int i; - Labellist *gl = &fs->ls->dyd->gt; - /* correct pending gotos to current block */ - for (i = bl->firstgoto; i < gl->n; i++) { /* for each pending goto */ - Labeldesc *gt = &gl->arr[i]; - /* leaving a variable scope? */ - if (reglevel(fs, gt->nactvar) > reglevel(fs, bl->nactvar)) - gt->close |= bl->upval; /* jump may need a close */ - gt->nactvar = bl->nactvar; /* update goto level */ - } -} - - -static void enterblock (FuncState *fs, BlockCnt *bl, lu_byte isloop) { - bl->isloop = isloop; - bl->nactvar = fs->nactvar; - bl->firstlabel = fs->ls->dyd->label.n; - bl->firstgoto = fs->ls->dyd->gt.n; - bl->upval = 0; - bl->insidetbc = (fs->bl != NULL && fs->bl->insidetbc); - bl->previous = fs->bl; - fs->bl = bl; - lua_assert(fs->freereg == luaY_nvarstack(fs)); -} - - -/* -** generates an error for an undefined 'goto'. -*/ -static l_noret undefgoto (LexState *ls, Labeldesc *gt) { - const char *msg; - if (eqstr(gt->name, luaS_newliteral(ls->L, "break"))) { - msg = "break outside loop at line %d"; - msg = luaO_pushfstring(ls->L, msg, gt->line); - } - else { - msg = "no visible label '%s' for at line %d"; - msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line); - } - luaK_semerror(ls, msg); -} - - -static void leaveblock (FuncState *fs) { - BlockCnt *bl = fs->bl; - LexState *ls = fs->ls; - int hasclose = 0; - int stklevel = reglevel(fs, bl->nactvar); /* level outside the block */ - removevars(fs, bl->nactvar); /* remove block locals */ - lua_assert(bl->nactvar == fs->nactvar); /* back to level on entry */ - if (bl->isloop) /* has to fix pending breaks? */ - hasclose = createlabel(ls, luaS_newliteral(ls->L, "break"), 0, 0); - if (!hasclose && bl->previous && bl->upval) /* still need a 'close'? */ - luaK_codeABC(fs, OP_CLOSE, stklevel, 0, 0); - fs->freereg = stklevel; /* free registers */ - ls->dyd->label.n = bl->firstlabel; /* remove local labels */ - fs->bl = bl->previous; /* current block now is previous one */ - if (bl->previous) /* was it a nested block? */ - movegotosout(fs, bl); /* update pending gotos to enclosing block */ - else { - if (bl->firstgoto < ls->dyd->gt.n) /* still pending gotos? */ - undefgoto(ls, &ls->dyd->gt.arr[bl->firstgoto]); /* error */ - } -} - - -/* -** adds a new prototype into list of prototypes -*/ -static Proto *addprototype (LexState *ls) { - Proto *clp; - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Proto *f = fs->f; /* prototype of current function */ - if (fs->np >= f->sizep) { - int oldsize = f->sizep; - luaM_growvector(L, f->p, fs->np, f->sizep, Proto *, MAXARG_Bx, "functions"); - while (oldsize < f->sizep) - f->p[oldsize++] = NULL; - } - f->p[fs->np++] = clp = luaF_newproto(L); - luaC_objbarrier(L, f, clp); - return clp; -} - - -/* -** codes instruction to create new closure in parent function. -** The OP_CLOSURE instruction uses the last available register, -** so that, if it invokes the GC, the GC knows which registers -** are in use at that time. - -*/ -static void codeclosure (LexState *ls, expdesc *v) { - FuncState *fs = ls->fs->prev; - init_exp(v, VRELOC, luaK_codeABx(fs, OP_CLOSURE, 0, fs->np - 1)); - luaK_exp2nextreg(fs, v); /* fix it at the last register */ -} - - -static void open_func (LexState *ls, FuncState *fs, BlockCnt *bl) { - Proto *f = fs->f; - fs->prev = ls->fs; /* linked list of funcstates */ - fs->ls = ls; - ls->fs = fs; - fs->pc = 0; - fs->previousline = f->linedefined; - fs->iwthabs = 0; - fs->lasttarget = 0; - fs->freereg = 0; - fs->nk = 0; - fs->nabslineinfo = 0; - fs->np = 0; - fs->nups = 0; - fs->ndebugvars = 0; - fs->nactvar = 0; - fs->needclose = 0; - fs->firstlocal = ls->dyd->actvar.n; - fs->firstlabel = ls->dyd->label.n; - fs->bl = NULL; - f->source = ls->source; - luaC_objbarrier(ls->L, f, f->source); - f->maxstacksize = 2; /* registers 0/1 are always valid */ - enterblock(fs, bl, 0); -} - - -static void close_func (LexState *ls) { - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Proto *f = fs->f; - luaK_ret(fs, luaY_nvarstack(fs), 0); /* final return */ - leaveblock(fs); - lua_assert(fs->bl == NULL); - luaK_finish(fs); - luaM_shrinkvector(L, f->code, f->sizecode, fs->pc, Instruction); - luaM_shrinkvector(L, f->lineinfo, f->sizelineinfo, fs->pc, ls_byte); - luaM_shrinkvector(L, f->abslineinfo, f->sizeabslineinfo, - fs->nabslineinfo, AbsLineInfo); - luaM_shrinkvector(L, f->k, f->sizek, fs->nk, TValue); - luaM_shrinkvector(L, f->p, f->sizep, fs->np, Proto *); - luaM_shrinkvector(L, f->locvars, f->sizelocvars, fs->ndebugvars, LocVar); - luaM_shrinkvector(L, f->upvalues, f->sizeupvalues, fs->nups, Upvaldesc); - ls->fs = fs->prev; - luaC_checkGC(L); -} - - - -/*============================================================*/ -/* GRAMMAR RULES */ -/*============================================================*/ - - -/* -** check whether current token is in the follow set of a block. -** 'until' closes syntactical blocks, but do not close scope, -** so it is handled in separate. -*/ -static int block_follow (LexState *ls, int withuntil) { - switch (ls->t.token) { - case TK_ELSE: case TK_ELSEIF: - case TK_END: case TK_EOS: - return 1; - case TK_UNTIL: return withuntil; - default: return 0; - } -} - - -static void statlist (LexState *ls) { - /* statlist -> { stat [';'] } */ - while (!block_follow(ls, 1)) { - if (ls->t.token == TK_RETURN) { - statement(ls); - return; /* 'return' must be last statement */ - } - statement(ls); - } -} - - -static void fieldsel (LexState *ls, expdesc *v) { - /* fieldsel -> ['.' | ':'] NAME */ - FuncState *fs = ls->fs; - expdesc key; - luaK_exp2anyregup(fs, v); - luaX_next(ls); /* skip the dot or colon */ - codename(ls, &key); - luaK_indexed(fs, v, &key); -} - - -static void yindex (LexState *ls, expdesc *v) { - /* index -> '[' expr ']' */ - luaX_next(ls); /* skip the '[' */ - expr(ls, v); - luaK_exp2val(ls->fs, v); - checknext(ls, ']'); -} - - -/* -** {====================================================================== -** Rules for Constructors -** ======================================================================= -*/ - - -typedef struct ConsControl { - expdesc v; /* last list item read */ - expdesc *t; /* table descriptor */ - int nh; /* total number of 'record' elements */ - int na; /* number of array elements already stored */ - int tostore; /* number of array elements pending to be stored */ -} ConsControl; - - -static void recfield (LexState *ls, ConsControl *cc) { - /* recfield -> (NAME | '['exp']') = exp */ - FuncState *fs = ls->fs; - int reg = ls->fs->freereg; - expdesc tab, key, val; - if (ls->t.token == TK_NAME) { - checklimit(fs, cc->nh, MAX_INT, "items in a constructor"); - codename(ls, &key); - } - else /* ls->t.token == '[' */ - yindex(ls, &key); - cc->nh++; - checknext(ls, '='); - tab = *cc->t; - luaK_indexed(fs, &tab, &key); - expr(ls, &val); - luaK_storevar(fs, &tab, &val); - fs->freereg = reg; /* free registers */ -} - - -static void closelistfield (FuncState *fs, ConsControl *cc) { - if (cc->v.k == VVOID) return; /* there is no list item */ - luaK_exp2nextreg(fs, &cc->v); - cc->v.k = VVOID; - if (cc->tostore == LFIELDS_PER_FLUSH) { - luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); /* flush */ - cc->na += cc->tostore; - cc->tostore = 0; /* no more items pending */ - } -} - - -static void lastlistfield (FuncState *fs, ConsControl *cc) { - if (cc->tostore == 0) return; - if (hasmultret(cc->v.k)) { - luaK_setmultret(fs, &cc->v); - luaK_setlist(fs, cc->t->u.info, cc->na, LUA_MULTRET); - cc->na--; /* do not count last expression (unknown number of elements) */ - } - else { - if (cc->v.k != VVOID) - luaK_exp2nextreg(fs, &cc->v); - luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); - } - cc->na += cc->tostore; -} - - -static void listfield (LexState *ls, ConsControl *cc) { - /* listfield -> exp */ - expr(ls, &cc->v); - cc->tostore++; -} - - -static void field (LexState *ls, ConsControl *cc) { - /* field -> listfield | recfield */ - switch(ls->t.token) { - case TK_NAME: { /* may be 'listfield' or 'recfield' */ - if (luaX_lookahead(ls) != '=') /* expression? */ - listfield(ls, cc); - else - recfield(ls, cc); - break; - } - case '[': { - recfield(ls, cc); - break; - } - default: { - listfield(ls, cc); - break; - } - } -} - - -static void constructor (LexState *ls, expdesc *t) { - /* constructor -> '{' [ field { sep field } [sep] ] '}' - sep -> ',' | ';' */ - FuncState *fs = ls->fs; - int line = ls->linenumber; - int pc = luaK_codeABC(fs, OP_NEWTABLE, 0, 0, 0); - ConsControl cc; - luaK_code(fs, 0); /* space for extra arg. */ - cc.na = cc.nh = cc.tostore = 0; - cc.t = t; - init_exp(t, VNONRELOC, fs->freereg); /* table will be at stack top */ - luaK_reserveregs(fs, 1); - init_exp(&cc.v, VVOID, 0); /* no value (yet) */ - checknext(ls, '{'); - do { - lua_assert(cc.v.k == VVOID || cc.tostore > 0); - if (ls->t.token == '}') break; - closelistfield(fs, &cc); - field(ls, &cc); - } while (testnext(ls, ',') || testnext(ls, ';')); - check_match(ls, '}', '{', line); - lastlistfield(fs, &cc); - luaK_settablesize(fs, pc, t->u.info, cc.na, cc.nh); -} - -/* }====================================================================== */ - - -static void setvararg (FuncState *fs, int nparams) { - fs->f->flag |= PF_ISVARARG; - luaK_codeABC(fs, OP_VARARGPREP, nparams, 0, 0); -} - - -static void parlist (LexState *ls) { - /* parlist -> [ {NAME ','} (NAME | '...') ] */ - FuncState *fs = ls->fs; - Proto *f = fs->f; - int nparams = 0; - int isvararg = 0; - if (ls->t.token != ')') { /* is 'parlist' not empty? */ - do { - switch (ls->t.token) { - case TK_NAME: { - new_localvar(ls, str_checkname(ls)); - nparams++; - break; - } - case TK_DOTS: { - luaX_next(ls); - isvararg = 1; - break; - } - default: luaX_syntaxerror(ls, " or '...' expected"); - } - } while (!isvararg && testnext(ls, ',')); - } - adjustlocalvars(ls, nparams); - f->numparams = cast_byte(fs->nactvar); - if (isvararg) - setvararg(fs, f->numparams); /* declared vararg */ - luaK_reserveregs(fs, fs->nactvar); /* reserve registers for parameters */ -} - - -static void body (LexState *ls, expdesc *e, int ismethod, int line) { - /* body -> '(' parlist ')' block END */ - FuncState new_fs; - BlockCnt bl; - new_fs.f = addprototype(ls); - new_fs.f->linedefined = line; - open_func(ls, &new_fs, &bl); - checknext(ls, '('); - if (ismethod) { - new_localvarliteral(ls, "self"); /* create 'self' parameter */ - adjustlocalvars(ls, 1); - } - parlist(ls); - checknext(ls, ')'); - statlist(ls); - new_fs.f->lastlinedefined = ls->linenumber; - check_match(ls, TK_END, TK_FUNCTION, line); - codeclosure(ls, e); - close_func(ls); -} - - -static int explist (LexState *ls, expdesc *v) { - /* explist -> expr { ',' expr } */ - int n = 1; /* at least one expression */ - expr(ls, v); - while (testnext(ls, ',')) { - luaK_exp2nextreg(ls->fs, v); - expr(ls, v); - n++; - } - return n; -} - - -static void funcargs (LexState *ls, expdesc *f) { - FuncState *fs = ls->fs; - expdesc args; - int base, nparams; - int line = ls->linenumber; - switch (ls->t.token) { - case '(': { /* funcargs -> '(' [ explist ] ')' */ - luaX_next(ls); - if (ls->t.token == ')') /* arg list is empty? */ - args.k = VVOID; - else { - explist(ls, &args); - if (hasmultret(args.k)) - luaK_setmultret(fs, &args); - } - check_match(ls, ')', '(', line); - break; - } - case '{': { /* funcargs -> constructor */ - constructor(ls, &args); - break; - } - case TK_STRING: { /* funcargs -> STRING */ - codestring(&args, ls->t.seminfo.ts); - luaX_next(ls); /* must use 'seminfo' before 'next' */ - break; - } - default: { - luaX_syntaxerror(ls, "function arguments expected"); - } - } - lua_assert(f->k == VNONRELOC); - base = f->u.info; /* base register for call */ - if (hasmultret(args.k)) - nparams = LUA_MULTRET; /* open call */ - else { - if (args.k != VVOID) - luaK_exp2nextreg(fs, &args); /* close last argument */ - nparams = fs->freereg - (base+1); - } - init_exp(f, VCALL, luaK_codeABC(fs, OP_CALL, base, nparams+1, 2)); - luaK_fixline(fs, line); - fs->freereg = base+1; /* call removes function and arguments and leaves - one result (unless changed later) */ -} - - - - -/* -** {====================================================================== -** Expression parsing -** ======================================================================= -*/ - - -static void primaryexp (LexState *ls, expdesc *v) { - /* primaryexp -> NAME | '(' expr ')' */ - switch (ls->t.token) { - case '(': { - int line = ls->linenumber; - luaX_next(ls); - expr(ls, v); - check_match(ls, ')', '(', line); - luaK_dischargevars(ls->fs, v); - return; - } - case TK_NAME: { - singlevar(ls, v); - return; - } - default: { - luaX_syntaxerror(ls, "unexpected symbol"); - } - } -} - - -static void suffixedexp (LexState *ls, expdesc *v) { - /* suffixedexp -> - primaryexp { '.' NAME | '[' exp ']' | ':' NAME funcargs | funcargs } */ - FuncState *fs = ls->fs; - primaryexp(ls, v); - for (;;) { - switch (ls->t.token) { - case '.': { /* fieldsel */ - fieldsel(ls, v); - break; - } - case '[': { /* '[' exp ']' */ - expdesc key; - luaK_exp2anyregup(fs, v); - yindex(ls, &key); - luaK_indexed(fs, v, &key); - break; - } - case ':': { /* ':' NAME funcargs */ - expdesc key; - luaX_next(ls); - codename(ls, &key); - luaK_self(fs, v, &key); - funcargs(ls, v); - break; - } - case '(': case TK_STRING: case '{': { /* funcargs */ - luaK_exp2nextreg(fs, v); - funcargs(ls, v); - break; - } - default: return; - } - } -} - - -static void simpleexp (LexState *ls, expdesc *v) { - /* simpleexp -> FLT | INT | STRING | NIL | TRUE | FALSE | ... | - constructor | FUNCTION body | suffixedexp */ - switch (ls->t.token) { - case TK_FLT: { - init_exp(v, VKFLT, 0); - v->u.nval = ls->t.seminfo.r; - break; - } - case TK_INT: { - init_exp(v, VKINT, 0); - v->u.ival = ls->t.seminfo.i; - break; - } - case TK_STRING: { - codestring(v, ls->t.seminfo.ts); - break; - } - case TK_NIL: { - init_exp(v, VNIL, 0); - break; - } - case TK_TRUE: { - init_exp(v, VTRUE, 0); - break; - } - case TK_FALSE: { - init_exp(v, VFALSE, 0); - break; - } - case TK_DOTS: { /* vararg */ - FuncState *fs = ls->fs; - check_condition(ls, fs->f->flag & PF_ISVARARG, - "cannot use '...' outside a vararg function"); - init_exp(v, VVARARG, luaK_codeABC(fs, OP_VARARG, 0, 0, 1)); - break; - } - case '{': { /* constructor */ - constructor(ls, v); - return; - } - case TK_FUNCTION: { - luaX_next(ls); - body(ls, v, 0, ls->linenumber); - return; - } - default: { - suffixedexp(ls, v); - return; - } - } - luaX_next(ls); -} - - -static UnOpr getunopr (int op) { - switch (op) { - case TK_NOT: return OPR_NOT; - case '-': return OPR_MINUS; - case '~': return OPR_BNOT; - case '#': return OPR_LEN; - default: return OPR_NOUNOPR; - } -} - - -static BinOpr getbinopr (int op) { - switch (op) { - case '+': return OPR_ADD; - case '-': return OPR_SUB; - case '*': return OPR_MUL; - case '%': return OPR_MOD; - case '^': return OPR_POW; - case '/': return OPR_DIV; - case TK_IDIV: return OPR_IDIV; - case '&': return OPR_BAND; - case '|': return OPR_BOR; - case '~': return OPR_BXOR; - case TK_SHL: return OPR_SHL; - case TK_SHR: return OPR_SHR; - case TK_CONCAT: return OPR_CONCAT; - case TK_NE: return OPR_NE; - case TK_EQ: return OPR_EQ; - case '<': return OPR_LT; - case TK_LE: return OPR_LE; - case '>': return OPR_GT; - case TK_GE: return OPR_GE; - case TK_AND: return OPR_AND; - case TK_OR: return OPR_OR; - default: return OPR_NOBINOPR; - } -} - - -/* -** Priority table for binary operators. -*/ -static const struct { - lu_byte left; /* left priority for each binary operator */ - lu_byte right; /* right priority */ -} priority[] = { /* ORDER OPR */ - {10, 10}, {10, 10}, /* '+' '-' */ - {11, 11}, {11, 11}, /* '*' '%' */ - {14, 13}, /* '^' (right associative) */ - {11, 11}, {11, 11}, /* '/' '//' */ - {6, 6}, {4, 4}, {5, 5}, /* '&' '|' '~' */ - {7, 7}, {7, 7}, /* '<<' '>>' */ - {9, 8}, /* '..' (right associative) */ - {3, 3}, {3, 3}, {3, 3}, /* ==, <, <= */ - {3, 3}, {3, 3}, {3, 3}, /* ~=, >, >= */ - {2, 2}, {1, 1} /* and, or */ -}; - -#define UNARY_PRIORITY 12 /* priority for unary operators */ - - -/* -** subexpr -> (simpleexp | unop subexpr) { binop subexpr } -** where 'binop' is any binary operator with a priority higher than 'limit' -*/ -static BinOpr subexpr (LexState *ls, expdesc *v, int limit) { - BinOpr op; - UnOpr uop; - enterlevel(ls); - uop = getunopr(ls->t.token); - if (uop != OPR_NOUNOPR) { /* prefix (unary) operator? */ - int line = ls->linenumber; - luaX_next(ls); /* skip operator */ - subexpr(ls, v, UNARY_PRIORITY); - luaK_prefix(ls->fs, uop, v, line); - } - else simpleexp(ls, v); - /* expand while operators have priorities higher than 'limit' */ - op = getbinopr(ls->t.token); - while (op != OPR_NOBINOPR && priority[op].left > limit) { - expdesc v2; - BinOpr nextop; - int line = ls->linenumber; - luaX_next(ls); /* skip operator */ - luaK_infix(ls->fs, op, v); - /* read sub-expression with higher priority */ - nextop = subexpr(ls, &v2, priority[op].right); - luaK_posfix(ls->fs, op, v, &v2, line); - op = nextop; - } - leavelevel(ls); - return op; /* return first untreated operator */ -} - - -static void expr (LexState *ls, expdesc *v) { - subexpr(ls, v, 0); -} - -/* }==================================================================== */ - - - -/* -** {====================================================================== -** Rules for Statements -** ======================================================================= -*/ - - -static void block (LexState *ls) { - /* block -> statlist */ - FuncState *fs = ls->fs; - BlockCnt bl; - enterblock(fs, &bl, 0); - statlist(ls); - leaveblock(fs); -} - - -/* -** structure to chain all variables in the left-hand side of an -** assignment -*/ -struct LHS_assign { - struct LHS_assign *prev; - expdesc v; /* variable (global, local, upvalue, or indexed) */ -}; - - -/* -** check whether, in an assignment to an upvalue/local variable, the -** upvalue/local variable is begin used in a previous assignment to a -** table. If so, save original upvalue/local value in a safe place and -** use this safe copy in the previous assignment. -*/ -static void check_conflict (LexState *ls, struct LHS_assign *lh, expdesc *v) { - FuncState *fs = ls->fs; - int extra = fs->freereg; /* eventual position to save local variable */ - int conflict = 0; - for (; lh; lh = lh->prev) { /* check all previous assignments */ - if (vkisindexed(lh->v.k)) { /* assignment to table field? */ - if (lh->v.k == VINDEXUP) { /* is table an upvalue? */ - if (v->k == VUPVAL && lh->v.u.ind.t == v->u.info) { - conflict = 1; /* table is the upvalue being assigned now */ - lh->v.k = VINDEXSTR; - lh->v.u.ind.t = extra; /* assignment will use safe copy */ - } - } - else { /* table is a register */ - if (v->k == VLOCAL && lh->v.u.ind.t == v->u.var.ridx) { - conflict = 1; /* table is the local being assigned now */ - lh->v.u.ind.t = extra; /* assignment will use safe copy */ - } - /* is index the local being assigned? */ - if (lh->v.k == VINDEXED && v->k == VLOCAL && - lh->v.u.ind.idx == v->u.var.ridx) { - conflict = 1; - lh->v.u.ind.idx = extra; /* previous assignment will use safe copy */ - } - } - } - } - if (conflict) { - /* copy upvalue/local value to a temporary (in position 'extra') */ - if (v->k == VLOCAL) - luaK_codeABC(fs, OP_MOVE, extra, v->u.var.ridx, 0); - else - luaK_codeABC(fs, OP_GETUPVAL, extra, v->u.info, 0); - luaK_reserveregs(fs, 1); - } -} - -/* -** Parse and compile a multiple assignment. The first "variable" -** (a 'suffixedexp') was already read by the caller. -** -** assignment -> suffixedexp restassign -** restassign -> ',' suffixedexp restassign | '=' explist -*/ -static void restassign (LexState *ls, struct LHS_assign *lh, int nvars) { - expdesc e; - check_condition(ls, vkisvar(lh->v.k), "syntax private_lua_error"); - check_readonly(ls, &lh->v); - if (testnext(ls, ',')) { /* restassign -> ',' suffixedexp restassign */ - struct LHS_assign nv; - nv.prev = lh; - suffixedexp(ls, &nv.v); - if (!vkisindexed(nv.v.k)) - check_conflict(ls, lh, &nv.v); - enterlevel(ls); /* control recursion depth */ - restassign(ls, &nv, nvars+1); - leavelevel(ls); - } - else { /* restassign -> '=' explist */ - int nexps; - checknext(ls, '='); - nexps = explist(ls, &e); - if (nexps != nvars) - adjust_assign(ls, nvars, nexps, &e); - else { - luaK_setoneret(ls->fs, &e); /* close last expression */ - luaK_storevar(ls->fs, &lh->v, &e); - return; /* avoid default */ - } - } - init_exp(&e, VNONRELOC, ls->fs->freereg-1); /* default assignment */ - luaK_storevar(ls->fs, &lh->v, &e); -} - - -static int cond (LexState *ls) { - /* cond -> exp */ - expdesc v; - expr(ls, &v); /* read condition */ - if (v.k == VNIL) v.k = VFALSE; /* 'falses' are all equal here */ - luaK_goiftrue(ls->fs, &v); - return v.f; -} - - -static void gotostat (LexState *ls) { - FuncState *fs = ls->fs; - int line = ls->linenumber; - TString *name = str_checkname(ls); /* label's name */ - Labeldesc *lb = findlabel(ls, name); - if (lb == NULL) /* no label? */ - /* forward jump; will be resolved when the label is declared */ - newgotoentry(ls, name, line, luaK_jump(fs)); - else { /* found a label */ - /* backward jump; will be resolved here */ - int lblevel = reglevel(fs, lb->nactvar); /* label level */ - if (luaY_nvarstack(fs) > lblevel) /* leaving the scope of a variable? */ - luaK_codeABC(fs, OP_CLOSE, lblevel, 0, 0); - /* create jump and link it to the label */ - luaK_patchlist(fs, luaK_jump(fs), lb->pc); - } -} - - -/* -** Break statement. Semantically equivalent to "goto break". -*/ -static void breakstat (LexState *ls) { - int line = ls->linenumber; - luaX_next(ls); /* skip break */ - newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, luaK_jump(ls->fs)); -} - - -/* -** Check whether there is already a label with the given 'name'. -*/ -static void checkrepeated (LexState *ls, TString *name) { - Labeldesc *lb = findlabel(ls, name); - if (l_unlikely(lb != NULL)) { /* already defined? */ - const char *msg = "label '%s' already defined on line %d"; - msg = luaO_pushfstring(ls->L, msg, getstr(name), lb->line); - luaK_semerror(ls, msg); /* error */ - } -} - - -static void labelstat (LexState *ls, TString *name, int line) { - /* label -> '::' NAME '::' */ - checknext(ls, TK_DBCOLON); /* skip double colon */ - while (ls->t.token == ';' || ls->t.token == TK_DBCOLON) - statement(ls); /* skip other no-op statements */ - checkrepeated(ls, name); /* check for repeated labels */ - createlabel(ls, name, line, block_follow(ls, 0)); -} - - -static void whilestat (LexState *ls, int line) { - /* whilestat -> WHILE cond DO block END */ - FuncState *fs = ls->fs; - int whileinit; - int condexit; - BlockCnt bl; - luaX_next(ls); /* skip WHILE */ - whileinit = luaK_getlabel(fs); - condexit = cond(ls); - enterblock(fs, &bl, 1); - checknext(ls, TK_DO); - block(ls); - luaK_jumpto(fs, whileinit); - check_match(ls, TK_END, TK_WHILE, line); - leaveblock(fs); - luaK_patchtohere(fs, condexit); /* false conditions finish the loop */ -} - - -static void repeatstat (LexState *ls, int line) { - /* repeatstat -> REPEAT block UNTIL cond */ - int condexit; - FuncState *fs = ls->fs; - int repeat_init = luaK_getlabel(fs); - BlockCnt bl1, bl2; - enterblock(fs, &bl1, 1); /* loop block */ - enterblock(fs, &bl2, 0); /* scope block */ - luaX_next(ls); /* skip REPEAT */ - statlist(ls); - check_match(ls, TK_UNTIL, TK_REPEAT, line); - condexit = cond(ls); /* read condition (inside scope block) */ - leaveblock(fs); /* finish scope */ - if (bl2.upval) { /* upvalues? */ - int exit = luaK_jump(fs); /* normal exit must jump over fix */ - luaK_patchtohere(fs, condexit); /* repetition must close upvalues */ - luaK_codeABC(fs, OP_CLOSE, reglevel(fs, bl2.nactvar), 0, 0); - condexit = luaK_jump(fs); /* repeat after closing upvalues */ - luaK_patchtohere(fs, exit); /* normal exit comes to here */ - } - luaK_patchlist(fs, condexit, repeat_init); /* close the loop */ - leaveblock(fs); /* finish loop */ -} - - -/* -** Read an expression and generate code to put its results in next -** stack slot. -** -*/ -static void exp1 (LexState *ls) { - expdesc e; - expr(ls, &e); - luaK_exp2nextreg(ls->fs, &e); - lua_assert(e.k == VNONRELOC); -} - - -/* -** Fix for instruction at position 'pc' to jump to 'dest'. -** (Jump addresses are relative in Lua). 'back' true means -** a back jump. -*/ -static void fixforjump (FuncState *fs, int pc, int dest, int back) { - Instruction *jmp = &fs->f->code[pc]; - int offset = dest - (pc + 1); - if (back) - offset = -offset; - if (l_unlikely(offset > MAXARG_Bx)) - luaX_syntaxerror(fs->ls, "control structure too long"); - SETARG_Bx(*jmp, offset); -} - - -/* -** Generate code for a 'for' loop. -*/ -static void forbody (LexState *ls, int base, int line, int nvars, int isgen) { - /* forbody -> DO block */ - static const OpCode forprep[2] = {OP_FORPREP, OP_TFORPREP}; - static const OpCode forloop[2] = {OP_FORLOOP, OP_TFORLOOP}; - BlockCnt bl; - FuncState *fs = ls->fs; - int prep, endfor; - checknext(ls, TK_DO); - prep = luaK_codeABx(fs, forprep[isgen], base, 0); - fs->freereg--; /* both 'forprep' remove one register from the stack */ - enterblock(fs, &bl, 0); /* scope for declared variables */ - adjustlocalvars(ls, nvars); - luaK_reserveregs(fs, nvars); - block(ls); - leaveblock(fs); /* end of scope for declared variables */ - fixforjump(fs, prep, luaK_getlabel(fs), 0); - if (isgen) { /* generic for? */ - luaK_codeABC(fs, OP_TFORCALL, base, 0, nvars); - luaK_fixline(fs, line); - } - endfor = luaK_codeABx(fs, forloop[isgen], base, 0); - fixforjump(fs, endfor, prep + 1, 1); - luaK_fixline(fs, line); -} - - -static void fornum (LexState *ls, TString *varname, int line) { - /* fornum -> NAME = exp,exp[,exp] forbody */ - FuncState *fs = ls->fs; - int base = fs->freereg; - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvarkind(ls, varname, RDKCONST); /* control variable */ - checknext(ls, '='); - exp1(ls); /* initial value */ - checknext(ls, ','); - exp1(ls); /* limit */ - if (testnext(ls, ',')) - exp1(ls); /* optional step */ - else { /* default step = 1 */ - luaK_int(fs, fs->freereg, 1); - luaK_reserveregs(fs, 1); - } - adjustlocalvars(ls, 2); /* start scope for internal variables */ - forbody(ls, base, line, 1, 0); -} - - -static void forlist (LexState *ls, TString *indexname) { - /* forlist -> NAME {,NAME} IN explist forbody */ - FuncState *fs = ls->fs; - expdesc e; - int nvars = 4; /* function, state, closing, control */ - int line; - int base = fs->freereg; - /* create internal variables */ - new_localvarliteral(ls, "(for state)"); /* iterator function */ - new_localvarliteral(ls, "(for state)"); /* state */ - new_localvarliteral(ls, "(for state)"); /* closing var. (after swap) */ - new_localvarkind(ls, indexname, RDKCONST); /* control variable */ - /* other declared variables */ - while (testnext(ls, ',')) { - new_localvar(ls, str_checkname(ls)); - nvars++; - } - checknext(ls, TK_IN); - line = ls->linenumber; - adjust_assign(ls, 4, explist(ls, &e), &e); - adjustlocalvars(ls, 3); /* start scope for internal variables */ - marktobeclosed(fs); /* last internal var. must be closed */ - luaK_checkstack(fs, 2); /* extra space to call iterator */ - forbody(ls, base, line, nvars - 3, 1); -} - - -static void forstat (LexState *ls, int line) { - /* forstat -> FOR (fornum | forlist) END */ - FuncState *fs = ls->fs; - TString *varname; - BlockCnt bl; - enterblock(fs, &bl, 1); /* scope for loop and control variables */ - luaX_next(ls); /* skip 'for' */ - varname = str_checkname(ls); /* first variable name */ - switch (ls->t.token) { - case '=': fornum(ls, varname, line); break; - case ',': case TK_IN: forlist(ls, varname); break; - default: luaX_syntaxerror(ls, "'=' or 'in' expected"); - } - check_match(ls, TK_END, TK_FOR, line); - leaveblock(fs); /* loop scope ('break' jumps to this point) */ -} - - -static void test_then_block (LexState *ls, int *escapelist) { - /* test_then_block -> [IF | ELSEIF] cond THEN block */ - BlockCnt bl; - FuncState *fs = ls->fs; - expdesc v; - int jf; /* instruction to skip 'then' code (if condition is false) */ - luaX_next(ls); /* skip IF or ELSEIF */ - expr(ls, &v); /* read condition */ - checknext(ls, TK_THEN); - if (ls->t.token == TK_BREAK) { /* 'if x then break' ? */ - int line = ls->linenumber; - luaK_goiffalse(ls->fs, &v); /* will jump if condition is true */ - luaX_next(ls); /* skip 'break' */ - enterblock(fs, &bl, 0); /* must enter block before 'goto' */ - newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, v.t); - while (testnext(ls, ';')) {} /* skip semicolons */ - if (block_follow(ls, 0)) { /* jump is the entire block? */ - leaveblock(fs); - return; /* and that is it */ - } - else /* must skip over 'then' part if condition is false */ - jf = luaK_jump(fs); - } - else { /* regular case (not a break) */ - luaK_goiftrue(ls->fs, &v); /* skip over block if condition is false */ - enterblock(fs, &bl, 0); - jf = v.f; - } - statlist(ls); /* 'then' part */ - leaveblock(fs); - if (ls->t.token == TK_ELSE || - ls->t.token == TK_ELSEIF) /* followed by 'else'/'elseif'? */ - luaK_concat(fs, escapelist, luaK_jump(fs)); /* must jump over it */ - luaK_patchtohere(fs, jf); -} - - -static void ifstat (LexState *ls, int line) { - /* ifstat -> IF cond THEN block {ELSEIF cond THEN block} [ELSE block] END */ - FuncState *fs = ls->fs; - int escapelist = NO_JUMP; /* exit list for finished parts */ - test_then_block(ls, &escapelist); /* IF cond THEN block */ - while (ls->t.token == TK_ELSEIF) - test_then_block(ls, &escapelist); /* ELSEIF cond THEN block */ - if (testnext(ls, TK_ELSE)) - block(ls); /* 'else' part */ - check_match(ls, TK_END, TK_IF, line); - luaK_patchtohere(fs, escapelist); /* patch escape list to 'if' end */ -} - - -static void localfunc (LexState *ls) { - expdesc b; - FuncState *fs = ls->fs; - int fvar = fs->nactvar; /* function's variable index */ - new_localvar(ls, str_checkname(ls)); /* new local variable */ - adjustlocalvars(ls, 1); /* enter its scope */ - body(ls, &b, 0, ls->linenumber); /* function created in next register */ - /* debug information will only see the variable after this point! */ - localdebuginfo(fs, fvar)->startpc = fs->pc; -} - - -static int getlocalattribute (LexState *ls) { - /* ATTRIB -> ['<' Name '>'] */ - if (testnext(ls, '<')) { - TString *ts = str_checkname(ls); - const char *attr = getstr(ts); - checknext(ls, '>'); - if (strcmp(attr, "const") == 0) - return RDKCONST; /* read-only variable */ - else if (strcmp(attr, "close") == 0) - return RDKTOCLOSE; /* to-be-closed variable */ - else - luaK_semerror(ls, - luaO_pushfstring(ls->L, "unknown attribute '%s'", attr)); - } - return VDKREG; /* regular variable */ -} - - -static void checktoclose (FuncState *fs, int level) { - if (level != -1) { /* is there a to-be-closed variable? */ - marktobeclosed(fs); - luaK_codeABC(fs, OP_TBC, reglevel(fs, level), 0, 0); - } -} - - -static void localstat (LexState *ls) { - /* stat -> LOCAL NAME ATTRIB { ',' NAME ATTRIB } ['=' explist] */ - FuncState *fs = ls->fs; - int toclose = -1; /* index of to-be-closed variable (if any) */ - Vardesc *var; /* last variable */ - int vidx; /* index of last variable */ - int nvars = 0; - int nexps; - expdesc e; - do { - TString *vname = str_checkname(ls); - int kind = getlocalattribute(ls); - vidx = new_localvarkind(ls, vname, kind); - if (kind == RDKTOCLOSE) { /* to-be-closed? */ - if (toclose != -1) /* one already present? */ - luaK_semerror(ls, "multiple to-be-closed variables in local list"); - toclose = fs->nactvar + nvars; - } - nvars++; - } while (testnext(ls, ',')); - if (testnext(ls, '=')) - nexps = explist(ls, &e); - else { - e.k = VVOID; - nexps = 0; - } - var = getlocalvardesc(fs, vidx); /* get last variable */ - if (nvars == nexps && /* no adjustments? */ - var->vd.kind == RDKCONST && /* last variable is const? */ - luaK_exp2const(fs, &e, &var->k)) { /* compile-time constant? */ - var->vd.kind = RDKCTC; /* variable is a compile-time constant */ - adjustlocalvars(ls, nvars - 1); /* exclude last variable */ - fs->nactvar++; /* but count it */ - } - else { - adjust_assign(ls, nvars, nexps, &e); - adjustlocalvars(ls, nvars); - } - checktoclose(fs, toclose); -} - - -static int funcname (LexState *ls, expdesc *v) { - /* funcname -> NAME {fieldsel} [':' NAME] */ - int ismethod = 0; - singlevar(ls, v); - while (ls->t.token == '.') - fieldsel(ls, v); - if (ls->t.token == ':') { - ismethod = 1; - fieldsel(ls, v); - } - return ismethod; -} - - -static void funcstat (LexState *ls, int line) { - /* funcstat -> FUNCTION funcname body */ - int ismethod; - expdesc v, b; - luaX_next(ls); /* skip FUNCTION */ - ismethod = funcname(ls, &v); - body(ls, &b, ismethod, line); - check_readonly(ls, &v); - luaK_storevar(ls->fs, &v, &b); - luaK_fixline(ls->fs, line); /* definition "happens" in the first line */ -} - - -static void exprstat (LexState *ls) { - /* stat -> func | assignment */ - FuncState *fs = ls->fs; - struct LHS_assign v; - suffixedexp(ls, &v.v); - if (ls->t.token == '=' || ls->t.token == ',') { /* stat -> assignment ? */ - v.prev = NULL; - restassign(ls, &v, 1); - } - else { /* stat -> func */ - Instruction *inst; - check_condition(ls, v.v.k == VCALL, "syntax private_lua_error"); - inst = &getinstruction(fs, &v.v); - SETARG_C(*inst, 1); /* call statement uses no results */ - } -} - - -static void retstat (LexState *ls) { - /* stat -> RETURN [explist] [';'] */ - FuncState *fs = ls->fs; - expdesc e; - int nret; /* number of values being returned */ - int first = luaY_nvarstack(fs); /* first slot to be returned */ - if (block_follow(ls, 1) || ls->t.token == ';') - nret = 0; /* return no values */ - else { - nret = explist(ls, &e); /* optional return values */ - if (hasmultret(e.k)) { - luaK_setmultret(fs, &e); - if (e.k == VCALL && nret == 1 && !fs->bl->insidetbc) { /* tail call? */ - SET_OPCODE(getinstruction(fs,&e), OP_TAILCALL); - lua_assert(GETARG_A(getinstruction(fs,&e)) == luaY_nvarstack(fs)); - } - nret = LUA_MULTRET; /* return all values */ - } - else { - if (nret == 1) /* only one single value? */ - first = luaK_exp2anyreg(fs, &e); /* can use original slot */ - else { /* values must go to the top of the stack */ - luaK_exp2nextreg(fs, &e); - lua_assert(nret == fs->freereg - first); - } - } - } - luaK_ret(fs, first, nret); - testnext(ls, ';'); /* skip optional semicolon */ -} - - -static void statement (LexState *ls) { - int line = ls->linenumber; /* may be needed for error messages */ - enterlevel(ls); - switch (ls->t.token) { - case ';': { /* stat -> ';' (empty statement) */ - luaX_next(ls); /* skip ';' */ - break; - } - case TK_IF: { /* stat -> ifstat */ - ifstat(ls, line); - break; - } - case TK_WHILE: { /* stat -> whilestat */ - whilestat(ls, line); - break; - } - case TK_DO: { /* stat -> DO block END */ - luaX_next(ls); /* skip DO */ - block(ls); - check_match(ls, TK_END, TK_DO, line); - break; - } - case TK_FOR: { /* stat -> forstat */ - forstat(ls, line); - break; - } - case TK_REPEAT: { /* stat -> repeatstat */ - repeatstat(ls, line); - break; - } - case TK_FUNCTION: { /* stat -> funcstat */ - funcstat(ls, line); - break; - } - case TK_LOCAL: { /* stat -> localstat */ - luaX_next(ls); /* skip LOCAL */ - if (testnext(ls, TK_FUNCTION)) /* local function? */ - localfunc(ls); - else - localstat(ls); - break; - } - case TK_DBCOLON: { /* stat -> label */ - luaX_next(ls); /* skip double colon */ - labelstat(ls, str_checkname(ls), line); - break; - } - case TK_RETURN: { /* stat -> retstat */ - luaX_next(ls); /* skip RETURN */ - retstat(ls); - break; - } - case TK_BREAK: { /* stat -> breakstat */ - breakstat(ls); - break; - } - case TK_GOTO: { /* stat -> 'goto' NAME */ - luaX_next(ls); /* skip 'goto' */ - gotostat(ls); - break; - } - default: { /* stat -> func | assignment */ - exprstat(ls); - break; - } - } - lua_assert(ls->fs->f->maxstacksize >= ls->fs->freereg && - ls->fs->freereg >= luaY_nvarstack(ls->fs)); - ls->fs->freereg = luaY_nvarstack(ls->fs); /* free registers */ - leavelevel(ls); -} - -/* }====================================================================== */ - - -/* -** compiles the main function, which is a regular vararg function with an -** upvalue named LUA_ENV -*/ -static void mainfunc (LexState *ls, FuncState *fs) { - BlockCnt bl; - Upvaldesc *env; - open_func(ls, fs, &bl); - setvararg(fs, 0); /* main function is always declared vararg */ - env = allocupvalue(fs); /* ...set environment upvalue */ - env->instack = 1; - env->idx = 0; - env->kind = VDKREG; - env->name = ls->envn; - luaC_objbarrier(ls->L, fs->f, env->name); - luaX_next(ls); /* read first token */ - statlist(ls); /* parse main body */ - check(ls, TK_EOS); - close_func(ls); -} - - -LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, - Dyndata *dyd, const char *name, int firstchar) { - LexState lexstate; - FuncState funcstate; - LClosure *cl = luaF_newLclosure(L, 1); /* create main closure */ - setclLvalue2s(L, L->top.p, cl); /* anchor it (to avoid being collected) */ - luaD_inctop(L); - lexstate.h = luaH_new(L); /* create table for scanner */ - sethvalue2s(L, L->top.p, lexstate.h); /* anchor it */ - luaD_inctop(L); - funcstate.f = cl->p = luaF_newproto(L); - luaC_objbarrier(L, cl, cl->p); - funcstate.f->source = luaS_new(L, name); /* create and anchor TString */ - luaC_objbarrier(L, funcstate.f, funcstate.f->source); - lexstate.buff = buff; - lexstate.dyd = dyd; - dyd->actvar.n = dyd->gt.n = dyd->label.n = 0; - luaX_setinput(L, &lexstate, z, funcstate.f->source, firstchar); - mainfunc(&lexstate, &funcstate); - lua_assert(!funcstate.prev && funcstate.nups == 1 && !lexstate.fs); - /* all scopes should be correctly finished */ - lua_assert(dyd->actvar.n == 0 && dyd->gt.n == 0 && dyd->label.n == 0); - L->top.p--; /* remove scanner's table */ - return cl; /* closure is on the stack, too */ -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lparser.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lparser.h deleted file mode 100644 index 5e4500f..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lparser.h +++ /dev/null @@ -1,171 +0,0 @@ -/* -** $Id: lparser.h $ -** Lua Parser -** See Copyright Notice in lua.h -*/ - -#ifndef lparser_h -#define lparser_h - -#include "llimits.h" -#include "lobject.h" -#include "lzio.h" - - -/* -** Expression and variable descriptor. -** Code generation for variables and expressions can be delayed to allow -** optimizations; An 'expdesc' structure describes a potentially-delayed -** variable/expression. It has a description of its "main" value plus a -** list of conditional jumps that can also produce its value (generated -** by short-circuit operators 'and'/'or'). -*/ - -/* kinds of variables/expressions */ -typedef enum { - VVOID, /* when 'expdesc' describes the last expression of a list, - this kind means an empty list (so, no expression) */ - VNIL, /* constant nil */ - VTRUE, /* constant true */ - VFALSE, /* constant false */ - VK, /* constant in 'k'; info = index of constant in 'k' */ - VKFLT, /* floating constant; nval = numerical float value */ - VKINT, /* integer constant; ival = numerical integer value */ - VKSTR, /* string constant; strval = TString address; - (string is fixed by the lexer) */ - VNONRELOC, /* expression has its value in a fixed register; - info = result register */ - VLOCAL, /* local variable; var.ridx = register index; - var.vidx = relative index in 'actvar.arr' */ - VUPVAL, /* upvalue variable; info = index of upvalue in 'upvalues' */ - VCONST, /* compile-time variable; - info = absolute index in 'actvar.arr' */ - VINDEXED, /* indexed variable; - ind.t = table register; - ind.idx = key's R index */ - VINDEXUP, /* indexed upvalue; - ind.t = table upvalue; - ind.idx = key's K index */ - VINDEXI, /* indexed variable with constant integer; - ind.t = table register; - ind.idx = key's value */ - VINDEXSTR, /* indexed variable with literal string; - ind.t = table register; - ind.idx = key's K index */ - VJMP, /* expression is a test/comparison; - info = pc of corresponding jump instruction */ - VRELOC, /* expression can put result in any register; - info = instruction pc */ - VCALL, /* expression is a function call; info = instruction pc */ - VVARARG /* vararg expression; info = instruction pc */ -} expkind; - - -#define vkisvar(k) (VLOCAL <= (k) && (k) <= VINDEXSTR) -#define vkisindexed(k) (VINDEXED <= (k) && (k) <= VINDEXSTR) - - -typedef struct expdesc { - expkind k; - union { - lua_Integer ival; /* for VKINT */ - lua_Number nval; /* for VKFLT */ - TString *strval; /* for VKSTR */ - int info; /* for generic use */ - struct { /* for indexed variables */ - short idx; /* index (R or "long" K) */ - lu_byte t; /* table (register or upvalue) */ - } ind; - struct { /* for local variables */ - lu_byte ridx; /* register holding the variable */ - unsigned short vidx; /* compiler index (in 'actvar.arr') */ - } var; - } u; - int t; /* patch list of 'exit when true' */ - int f; /* patch list of 'exit when false' */ -} expdesc; - - -/* kinds of variables */ -#define VDKREG 0 /* regular */ -#define RDKCONST 1 /* constant */ -#define RDKTOCLOSE 2 /* to-be-closed */ -#define RDKCTC 3 /* compile-time constant */ - -/* description of an active local variable */ -typedef union Vardesc { - struct { - TValuefields; /* constant value (if it is a compile-time constant) */ - lu_byte kind; - lu_byte ridx; /* register holding the variable */ - short pidx; /* index of the variable in the Proto's 'locvars' array */ - TString *name; /* variable name */ - } vd; - TValue k; /* constant value (if any) */ -} Vardesc; - - - -/* description of pending goto statements and label statements */ -typedef struct Labeldesc { - TString *name; /* label identifier */ - int pc; /* position in code */ - int line; /* line where it appeared */ - lu_byte nactvar; /* number of active variables in that position */ - lu_byte close; /* goto that escapes upvalues */ -} Labeldesc; - - -/* list of labels or gotos */ -typedef struct Labellist { - Labeldesc *arr; /* array */ - int n; /* number of entries in use */ - int size; /* array size */ -} Labellist; - - -/* dynamic structures used by the parser */ -typedef struct Dyndata { - struct { /* list of all active local variables */ - Vardesc *arr; - int n; - int size; - } actvar; - Labellist gt; /* list of pending gotos */ - Labellist label; /* list of active labels */ -} Dyndata; - - -/* control of blocks */ -struct BlockCnt; /* defined in lparser.c */ - - -/* state needed to generate code for a given function */ -typedef struct FuncState { - Proto *f; /* current function header */ - struct FuncState *prev; /* enclosing function */ - struct LexState *ls; /* lexical state */ - struct BlockCnt *bl; /* chain of current blocks */ - int pc; /* next position to code (equivalent to 'ncode') */ - int lasttarget; /* 'label' of last 'jump label' */ - int previousline; /* last line that was saved in 'lineinfo' */ - int nk; /* number of elements in 'k' */ - int np; /* number of elements in 'p' */ - int nabslineinfo; /* number of elements in 'abslineinfo' */ - int firstlocal; /* index of first local var (in Dyndata array) */ - int firstlabel; /* index of first label (in 'dyd->label->arr') */ - short ndebugvars; /* number of elements in 'f->locvars' */ - lu_byte nactvar; /* number of active local variables */ - lu_byte nups; /* number of upvalues */ - lu_byte freereg; /* first free register */ - lu_byte iwthabs; /* instructions issued since last absolute line info */ - lu_byte needclose; /* function needs to close upvalues when returning */ -} FuncState; - - -LUAI_FUNC int luaY_nvarstack (FuncState *fs); -LUAI_FUNC LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, - Dyndata *dyd, const char *name, int firstchar); - - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lprefix.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lprefix.h deleted file mode 100644 index 484f2ad..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lprefix.h +++ /dev/null @@ -1,45 +0,0 @@ -/* -** $Id: lprefix.h $ -** Definitions for Lua code that must come before any other header file -** See Copyright Notice in lua.h -*/ - -#ifndef lprefix_h -#define lprefix_h - - -/* -** Allows POSIX/XSI stuff -*/ -#if !defined(LUA_USE_C89) /* { */ - -#if !defined(_XOPEN_SOURCE) -#define _XOPEN_SOURCE 600 -#elif _XOPEN_SOURCE == 0 -#undef _XOPEN_SOURCE /* use -D_XOPEN_SOURCE=0 to undefine it */ -#endif - -/* -** Allows manipulation of large files in gcc and some other compilers -*/ -#if !defined(LUA_32BITS) && !defined(_FILE_OFFSET_BITS) -#define _LARGEFILE_SOURCE 1 -#define _FILE_OFFSET_BITS 64 -#endif - -#endif /* } */ - - -/* -** Windows stuff -*/ -#if defined(_WIN32) /* { */ - -#if !defined(_CRT_SECURE_NO_WARNINGS) -#define _CRT_SECURE_NO_WARNINGS /* avoid warnings about ISO C functions */ -#endif - -#endif /* } */ - -#endif - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lstate.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lstate.c deleted file mode 100644 index 476b2b0..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lstate.c +++ /dev/null @@ -1,410 +0,0 @@ -/* -** $Id: lstate.c $ -** Global State -** See Copyright Notice in lua.h -*/ - -#define lstate_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "llex.h" -#include "lmem.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" - - - -/* -** thread state + extra space -*/ -typedef struct LX { - lu_byte extra_[LUA_EXTRASPACE]; - lua_State l; -} LX; - - -/* -** Main thread combines a thread state and the global state -*/ -typedef struct LG { - LX l; - global_State g; -} LG; - - - -#define fromstate(L) (cast(LX *, cast(lu_byte *, (L)) - offsetof(LX, l))) - - -/* -** set GCdebt to a new value keeping the real number of allocated -** objects (totalobjs - GCdebt) invariant and avoiding overflows in -** 'totalobjs'. -*/ -void luaE_setdebt (global_State *g, l_obj debt) { - l_obj tb = gettotalobjs(g); - lua_assert(tb > 0); - if (debt > MAX_LOBJ - tb) - debt = MAX_LOBJ - tb; /* will make 'totalobjs == MAX_LMEM' */ - g->totalobjs = tb + debt; - g->GCdebt = debt; -} - - -CallInfo *luaE_extendCI (lua_State *L) { - CallInfo *ci; - lua_assert(L->ci->next == NULL); - ci = luaM_new(L, CallInfo); - lua_assert(L->ci->next == NULL); - L->ci->next = ci; - ci->previous = L->ci; - ci->next = NULL; - ci->u.l.trap = 0; - L->nci++; - return ci; -} - - -/* -** free all CallInfo structures not in use by a thread -*/ -static void freeCI (lua_State *L) { - CallInfo *ci = L->ci; - CallInfo *next = ci->next; - ci->next = NULL; - while ((ci = next) != NULL) { - next = ci->next; - luaM_free(L, ci); - L->nci--; - } -} - - -/* -** free half of the CallInfo structures not in use by a thread, -** keeping the first one. -*/ -void luaE_shrinkCI (lua_State *L) { - CallInfo *ci = L->ci->next; /* first free CallInfo */ - CallInfo *next; - if (ci == NULL) - return; /* no extra elements */ - while ((next = ci->next) != NULL) { /* two extra elements? */ - CallInfo *next2 = next->next; /* next's next */ - ci->next = next2; /* remove next from the list */ - L->nci--; - luaM_free(L, next); /* free next */ - if (next2 == NULL) - break; /* no more elements */ - else { - next2->previous = ci; - ci = next2; /* continue */ - } - } -} - - -/* -** Called when 'getCcalls(L)' larger or equal to LUAI_MAXCCALLS. -** If equal, raises an overflow error. If value is larger than -** LUAI_MAXCCALLS (which means it is handling an overflow) but -** not much larger, does not report an error (to allow overflow -** handling to work). -*/ -void luaE_checkcstack (lua_State *L) { - if (getCcalls(L) == LUAI_MAXCCALLS) - luaG_runerror(L, "C stack overflow"); - else if (getCcalls(L) >= (LUAI_MAXCCALLS / 10 * 11)) - luaD_throw(L, LUA_ERRERR); /* error while handling stack error */ -} - - -LUAI_FUNC void luaE_incCstack (lua_State *L) { - L->nCcalls++; - if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) - luaE_checkcstack(L); -} - - -static void stack_init (lua_State *L1, lua_State *L) { - int i; CallInfo *ci; - /* initialize stack array */ - L1->stack.p = luaM_newvector(L, BASIC_STACK_SIZE + EXTRA_STACK, StackValue); - L1->tbclist.p = L1->stack.p; - for (i = 0; i < BASIC_STACK_SIZE + EXTRA_STACK; i++) - setnilvalue(s2v(L1->stack.p + i)); /* erase new stack */ - L1->top.p = L1->stack.p; - L1->stack_last.p = L1->stack.p + BASIC_STACK_SIZE; - /* initialize first ci */ - ci = &L1->base_ci; - ci->next = ci->previous = NULL; - ci->callstatus = CIST_C; - ci->func.p = L1->top.p; - ci->u.c.k = NULL; - ci->nresults = 0; - setnilvalue(s2v(L1->top.p)); /* 'function' entry for this 'ci' */ - L1->top.p++; - ci->top.p = L1->top.p + LUA_MINSTACK; - L1->ci = ci; -} - - -static void freestack (lua_State *L) { - if (L->stack.p == NULL) - return; /* stack not completely built yet */ - L->ci = &L->base_ci; /* free the entire 'ci' list */ - freeCI(L); - lua_assert(L->nci == 0); - luaM_freearray(L, L->stack.p, stacksize(L) + EXTRA_STACK); /* free stack */ -} - - -/* -** Create registry table and its predefined values -*/ -static void init_registry (lua_State *L, global_State *g) { - /* create registry */ - TValue aux; - Table *registry = luaH_new(L); - sethvalue(L, &g->l_registry, registry); - luaH_resize(L, registry, LUA_RIDX_LAST, 0); - /* registry[1] = false */ - setbfvalue(&aux); - luaH_setint(L, registry, 1, &aux); - /* registry[LUA_RIDX_MAINTHREAD] = L */ - setthvalue(L, &aux, L); - luaH_setint(L, registry, LUA_RIDX_MAINTHREAD, &aux); - /* registry[LUA_RIDX_GLOBALS] = new table (table of globals) */ - sethvalue(L, &aux, luaH_new(L)); - luaH_setint(L, registry, LUA_RIDX_GLOBALS, &aux); -} - - -/* -** open parts of the state that may cause memory-allocation errors. -*/ -static void f_luaopen (lua_State *L, void *ud) { - global_State *g = G(L); - UNUSED(ud); - stack_init(L, L); /* init stack */ - init_registry(L, g); - luaS_init(L); - luaT_init(L); - luaX_init(L); - g->gcstp = 0; /* allow gc */ - setnilvalue(&g->nilvalue); /* now state is complete */ - luai_userstateopen(L); -} - - -/* -** preinitialize a thread with consistent values without allocating -** any memory (to avoid errors) -*/ -static void preinit_thread (lua_State *L, global_State *g) { - G(L) = g; - L->stack.p = NULL; - L->ci = NULL; - L->nci = 0; - L->twups = L; /* thread has no upvalues */ - L->nCcalls = 0; - L->errorJmp = NULL; - L->hook = NULL; - L->hookmask = 0; - L->basehookcount = 0; - L->allowhook = 1; - resethookcount(L); - L->openupval = NULL; - L->status = LUA_OK; - L->errfunc = 0; - L->oldpc = 0; -} - - -static void close_state (lua_State *L) { - global_State *g = G(L); - if (!completestate(g)) /* closing a partially built state? */ - luaC_freeallobjects(L); /* just collect its objects */ - else { /* closing a fully built state */ - L->ci = &L->base_ci; /* unwind CallInfo list */ - luaD_closeprotected(L, 1, LUA_OK); /* close all upvalues */ - luaC_freeallobjects(L); /* collect all objects */ - luai_userstateclose(L); - } - luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size); - freestack(L); - lua_assert(g->totalbytes == sizeof(LG)); - lua_assert(gettotalobjs(g) == 1); - (*g->frealloc)(g->ud, fromstate(L), sizeof(LG), 0); /* free main block */ -} - - -LUA_API lua_State *lua_newthread (lua_State *L) { - global_State *g = G(L); - GCObject *o; - lua_State *L1; - lua_lock(L); - luaC_checkGC(L); - /* create new thread */ - o = luaC_newobjdt(L, LUA_TTHREAD, sizeof(LX), offsetof(LX, l)); - L1 = gco2th(o); - /* anchor it on L stack */ - setthvalue2s(L, L->top.p, L1); - api_incr_top(L); - preinit_thread(L1, g); - L1->hookmask = L->hookmask; - L1->basehookcount = L->basehookcount; - L1->hook = L->hook; - resethookcount(L1); - /* initialize L1 extra space */ - memcpy(lua_getextraspace(L1), lua_getextraspace(g->mainthread), - LUA_EXTRASPACE); - luai_userstatethread(L, L1); - stack_init(L1, L); /* init stack */ - lua_unlock(L); - return L1; -} - - -void luaE_freethread (lua_State *L, lua_State *L1) { - LX *l = fromstate(L1); - luaF_closeupval(L1, L1->stack.p); /* close all upvalues */ - lua_assert(L1->openupval == NULL); - luai_userstatefree(L, L1); - freestack(L1); - luaM_free(L, l); -} - - -int luaE_resetthread (lua_State *L, int status) { - CallInfo *ci = L->ci = &L->base_ci; /* unwind CallInfo list */ - setnilvalue(s2v(L->stack.p)); /* 'function' entry for basic 'ci' */ - ci->func.p = L->stack.p; - ci->callstatus = CIST_C; - if (status == LUA_YIELD) - status = LUA_OK; - L->status = LUA_OK; /* so it can run __close metamethods */ - status = luaD_closeprotected(L, 1, status); - if (status != LUA_OK) /* errors? */ - luaD_seterrorobj(L, status, L->stack.p + 1); - else - L->top.p = L->stack.p + 1; - ci->top.p = L->top.p + LUA_MINSTACK; - luaD_reallocstack(L, cast_int(ci->top.p - L->stack.p), 0); - return status; -} - - -LUA_API int lua_closethread (lua_State *L, lua_State *from) { - int status; - lua_lock(L); - L->nCcalls = (from) ? getCcalls(from) : 0; - status = luaE_resetthread(L, L->status); - lua_unlock(L); - return status; -} - - -LUA_API lua_State *lua_newstate (lua_Alloc f, void *ud, unsigned seed) { - int i; - lua_State *L; - global_State *g; - LG *l = cast(LG *, (*f)(ud, NULL, LUA_TTHREAD, sizeof(LG))); - if (l == NULL) return NULL; - L = &l->l.l; - g = &l->g; - L->tt = LUA_VTHREAD; - g->currentwhite = bitmask(WHITE0BIT); - L->marked = luaC_white(g); - preinit_thread(L, g); - g->allgc = obj2gco(L); /* by now, only object is the main thread */ - L->next = NULL; - incnny(L); /* main thread is always non yieldable */ - g->frealloc = f; - g->ud = ud; - g->warnf = NULL; - g->ud_warn = NULL; - g->mainthread = L; - g->seed = seed; - g->gcstp = GCSTPGC; /* no GC while building state */ - g->strt.size = g->strt.nuse = 0; - g->strt.hash = NULL; - setnilvalue(&g->l_registry); - g->panic = NULL; - g->gcstate = GCSpause; - g->gckind = KGC_INC; - g->gcstopem = 0; - g->gcemergency = 0; - g->finobj = g->tobefnz = g->fixedgc = NULL; - g->firstold1 = g->survival = g->old1 = g->reallyold = NULL; - g->finobjsur = g->finobjold1 = g->finobjrold = NULL; - g->sweepgc = NULL; - g->gray = g->grayagain = NULL; - g->weak = g->ephemeron = g->allweak = NULL; - g->twups = NULL; - g->totalbytes = sizeof(LG); - g->totalobjs = 1; - g->marked = 0; - g->GCdebt = 0; - setivalue(&g->nilvalue, 0); /* to signal that state is not yet built */ - setgcparam(g, PAUSE, LUAI_GCPAUSE); - setgcparam(g, STEPMUL, LUAI_GCMUL); - setgcparam(g, STEPSIZE, LUAI_GCSTEPSIZE); - setgcparam(g, MINORMUL, LUAI_GENMINORMUL); - setgcparam(g, MINORMAJOR, LUAI_MINORMAJOR); - setgcparam(g, MAJORMINOR, LUAI_MAJORMINOR); - for (i=0; i < LUA_NUMTYPES; i++) g->mt[i] = NULL; - if (luaD_rawrunprotected(L, f_luaopen, NULL) != LUA_OK) { - /* memory allocation error: free partial state */ - close_state(L); - L = NULL; - } - return L; -} - - -LUA_API void lua_close (lua_State *L) { - lua_lock(L); - L = G(L)->mainthread; /* only the main thread can be closed */ - close_state(L); -} - - -void luaE_warning (lua_State *L, const char *msg, int tocont) { - lua_WarnFunction wf = G(L)->warnf; - if (wf != NULL) - wf(G(L)->ud_warn, msg, tocont); -} - - -/* -** Generate a warning from an error message -*/ -void luaE_warnerror (lua_State *L, const char *where) { - TValue *errobj = s2v(L->top.p - 1); /* error object */ - const char *msg = (ttisstring(errobj)) - ? getstr(tsvalue(errobj)) - : "private_lua_error object is not a string"; - /* produce warning "error in %s (%s)" (where, msg) */ - luaE_warning(L, "private_lua_error in ", 1); - luaE_warning(L, where, 1); - luaE_warning(L, " (", 1); - luaE_warning(L, msg, 1); - luaE_warning(L, ")", 0); -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lstate.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lstate.h deleted file mode 100644 index 7f56745..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lstate.h +++ /dev/null @@ -1,407 +0,0 @@ -/* -** $Id: lstate.h $ -** Global State -** See Copyright Notice in lua.h -*/ - -#ifndef lstate_h -#define lstate_h - -#include "lua.h" - - -/* Some header files included here need this definition */ -typedef struct CallInfo CallInfo; - - -#include "lobject.h" -#include "ltm.h" -#include "lzio.h" - - -/* -** Some notes about garbage-collected objects: All objects in Lua must -** be kept somehow accessible until being freed, so all objects always -** belong to one (and only one) of these lists, using field 'next' of -** the 'CommonHeader' for the link: -** -** 'allgc': all objects not marked for finalization; -** 'finobj': all objects marked for finalization; -** 'tobefnz': all objects ready to be finalized; -** 'fixedgc': all objects that are not to be collected (currently -** only small strings, such as reserved words). -** -** For the generational collector, some of these lists have marks for -** generations. Each mark points to the first element in the list for -** that particular generation; that generation goes until the next mark. -** -** 'allgc' -> 'survival': new objects; -** 'survival' -> 'old': objects that survived one collection; -** 'old1' -> 'reallyold': objects that became old in last collection; -** 'reallyold' -> NULL: objects old for more than one cycle. -** -** 'finobj' -> 'finobjsur': new objects marked for finalization; -** 'finobjsur' -> 'finobjold1': survived """"; -** 'finobjold1' -> 'finobjrold': just old """"; -** 'finobjrold' -> NULL: really old """". -** -** All lists can contain elements older than their main ages, due -** to 'luaC_checkfinalizer' and 'udata2finalize', which move -** objects between the normal lists and the "marked for finalization" -** lists. Moreover, barriers can age young objects in young lists as -** OLD0, which then become OLD1. However, a list never contains -** elements younger than their main ages. -** -** The generational collector also uses a pointer 'firstold1', which -** points to the first OLD1 object in the list. It is used to optimize -** 'markold'. (Potentially OLD1 objects can be anywhere between 'allgc' -** and 'reallyold', but often the list has no OLD1 objects or they are -** after 'old1'.) Note the difference between it and 'old1': -** 'firstold1': no OLD1 objects before this point; there can be all -** ages after it. -** 'old1': no objects younger than OLD1 after this point. -*/ - -/* -** Moreover, there is another set of lists that control gray objects. -** These lists are linked by fields 'gclist'. (All objects that -** can become gray have such a field. The field is not the same -** in all objects, but it always has this name.) Any gray object -** must belong to one of these lists, and all objects in these lists -** must be gray (with two exceptions explained below): -** -** 'gray': regular gray objects, still waiting to be visited. -** 'grayagain': objects that must be revisited at the atomic phase. -** That includes -** - black objects got in a write barrier; -** - all kinds of weak tables during propagation phase; -** - all threads. -** 'weak': tables with weak values to be cleared; -** 'ephemeron': ephemeron tables with white->white entries; -** 'allweak': tables with weak keys and/or weak values to be cleared. -** -** The exceptions to that "gray rule" are: -** - TOUCHED2 objects in generational mode stay in a gray list (because -** they must be visited again at the end of the cycle), but they are -** marked black because assignments to them must activate barriers (to -** move them back to TOUCHED1). -** - Open upvales are kept gray to avoid barriers, but they stay out -** of gray lists. (They don't even have a 'gclist' field.) -*/ - - - -/* -** About 'nCcalls': This count has two parts: the lower 16 bits counts -** the number of recursive invocations in the C stack; the higher -** 16 bits counts the number of non-yieldable calls in the stack. -** (They are together so that we can change and save both with one -** instruction.) -*/ - - -/* true if this thread does not have non-yieldable calls in the stack */ -#define yieldable(L) (((L)->nCcalls & 0xffff0000) == 0) - -/* real number of C calls */ -#define getCcalls(L) ((L)->nCcalls & 0xffff) - - -/* Increment the number of non-yieldable calls */ -#define incnny(L) ((L)->nCcalls += 0x10000) - -/* Decrement the number of non-yieldable calls */ -#define decnny(L) ((L)->nCcalls -= 0x10000) - -/* Non-yieldable call increment */ -#define nyci (0x10000 | 1) - - - - -struct lua_longjmp; /* defined in ldo.c */ - - -/* -** Atomic type (relative to signals) to better ensure that 'lua_sethook' -** is thread safe -*/ -#if !defined(l_signalT) -#include -#define l_signalT sig_atomic_t -#endif - - -/* -** Extra stack space to handle TM calls and some other extras. This -** space is not included in 'stack_last'. It is used only to avoid stack -** checks, either because the element will be promptly popped or because -** there will be a stack check soon after the push. Function frames -** never use this extra space, so it does not need to be kept clean. -*/ -#define EXTRA_STACK 5 - - -#define BASIC_STACK_SIZE (2*LUA_MINSTACK) - -#define stacksize(th) cast_int((th)->stack_last.p - (th)->stack.p) - - -/* kinds of Garbage Collection */ -#define KGC_INC 0 /* incremental gc */ -#define KGC_GENMINOR 1 /* generational gc in minor (regular) mode */ -#define KGC_GENMAJOR 2 /* generational in major mode */ - - -typedef struct stringtable { - TString **hash; /* array of buckets (linked lists of strings) */ - int nuse; /* number of elements */ - int size; /* number of buckets */ -} stringtable; - - -/* -** Information about a call. -** About union 'u': -** - field 'l' is used only for Lua functions; -** - field 'c' is used only for C functions. -** About union 'u2': -** - field 'funcidx' is used only by C functions while doing a -** protected call; -** - field 'nyield' is used only while a function is "doing" an -** yield (from the yield until the next resume); -** - field 'nres' is used only while closing tbc variables when -** returning from a function; -** - field 'transferinfo' is used only during call/returnhooks, -** before the function starts or after it ends. -*/ -struct CallInfo { - StkIdRel func; /* function index in the stack */ - StkIdRel top; /* top for this function */ - struct CallInfo *previous, *next; /* dynamic call link */ - union { - struct { /* only for Lua functions */ - const Instruction *savedpc; - volatile l_signalT trap; /* function is tracing lines/counts */ - int nextraargs; /* # of extra arguments in vararg functions */ - } l; - struct { /* only for C functions */ - lua_KFunction k; /* continuation in case of yields */ - ptrdiff_t old_errfunc; - lua_KContext ctx; /* context info. in case of yields */ - } c; - } u; - union { - int funcidx; /* called-function index */ - int nyield; /* number of values yielded */ - int nres; /* number of values returned */ - struct { /* info about transferred values (for call/return hooks) */ - unsigned short ftransfer; /* offset of first value transferred */ - unsigned short ntransfer; /* number of values transferred */ - } transferinfo; - } u2; - short nresults; /* expected number of results from this function */ - unsigned short callstatus; -}; - - -/* -** Bits in CallInfo status -*/ -#define CIST_OAH (1<<0) /* original value of 'allowhook' */ -#define CIST_C (1<<1) /* call is running a C function */ -#define CIST_FRESH (1<<2) /* call is on a fresh "luaV_execute" frame */ -#define CIST_HOOKED (1<<3) /* call is running a debug hook */ -#define CIST_YPCALL (1<<4) /* doing a yieldable protected call */ -#define CIST_TAIL (1<<5) /* call was tail called */ -#define CIST_HOOKYIELD (1<<6) /* last hook called yielded */ -#define CIST_FIN (1<<7) /* function "called" a finalizer */ -#define CIST_TRAN (1<<8) /* 'ci' has transfer information */ -#define CIST_CLSRET (1<<9) /* function is closing tbc variables */ -/* Bits 10-12 are used for CIST_RECST (see below) */ -#define CIST_RECST 10 -#if defined(LUA_COMPAT_LT_LE) -#define CIST_LEQ (1<<13) /* using __lt for __le */ -#endif - - -/* -** Field CIST_RECST stores the "recover status", used to keep the error -** status while closing to-be-closed variables in coroutines, so that -** Lua can correctly resume after an yield from a __close method called -** because of an error. (Three bits are enough for error status.) -*/ -#define getcistrecst(ci) (((ci)->callstatus >> CIST_RECST) & 7) -#define setcistrecst(ci,st) \ - check_exp(((st) & 7) == (st), /* status must fit in three bits */ \ - ((ci)->callstatus = ((ci)->callstatus & ~(7 << CIST_RECST)) \ - | ((st) << CIST_RECST))) - - -/* active function is a Lua function */ -#define isLua(ci) (!((ci)->callstatus & CIST_C)) - -/* call is running Lua code (not a hook) */ -#define isLuacode(ci) (!((ci)->callstatus & (CIST_C | CIST_HOOKED))) - -/* assume that CIST_OAH has offset 0 and that 'v' is strictly 0/1 */ -#define setoah(st,v) ((st) = ((st) & ~CIST_OAH) | (v)) -#define getoah(st) ((st) & CIST_OAH) - - -/* -** 'global state', shared by all threads of this state -*/ -typedef struct global_State { - lua_Alloc frealloc; /* function to reallocate memory */ - void *ud; /* auxiliary data to 'frealloc' */ - lu_mem totalbytes; /* number of bytes currently allocated */ - l_obj totalobjs; /* total number of objects allocated + GCdebt */ - l_obj GCdebt; /* objects counted but not yet allocated */ - l_obj marked; /* number of objects marked in a GC cycle */ - l_obj GCmajorminor; /* auxiliar counter to control major-minor shifts */ - stringtable strt; /* hash table for strings */ - TValue l_registry; - TValue nilvalue; /* a nil value */ - unsigned int seed; /* randomized seed for hashes */ - lu_byte gcparams[LUA_GCPN]; - lu_byte currentwhite; - lu_byte gcstate; /* state of garbage collector */ - lu_byte gckind; /* kind of GC running */ - lu_byte gcstopem; /* stops emergency collections */ - lu_byte gcstp; /* control whether GC is running */ - lu_byte gcemergency; /* true if this is an emergency collection */ - GCObject *allgc; /* list of all collectable objects */ - GCObject **sweepgc; /* current position of sweep in list */ - GCObject *finobj; /* list of collectable objects with finalizers */ - GCObject *gray; /* list of gray objects */ - GCObject *grayagain; /* list of objects to be traversed atomically */ - GCObject *weak; /* list of tables with weak values */ - GCObject *ephemeron; /* list of ephemeron tables (weak keys) */ - GCObject *allweak; /* list of all-weak tables */ - GCObject *tobefnz; /* list of userdata to be GC */ - GCObject *fixedgc; /* list of objects not to be collected */ - /* fields for generational collector */ - GCObject *survival; /* start of objects that survived one GC cycle */ - GCObject *old1; /* start of old1 objects */ - GCObject *reallyold; /* objects more than one cycle old ("really old") */ - GCObject *firstold1; /* first OLD1 object in the list (if any) */ - GCObject *finobjsur; /* list of survival objects with finalizers */ - GCObject *finobjold1; /* list of old1 objects with finalizers */ - GCObject *finobjrold; /* list of really old objects with finalizers */ - struct lua_State *twups; /* list of threads with open upvalues */ - lua_CFunction panic; /* to be called in unprotected errors */ - struct lua_State *mainthread; - TString *memerrmsg; /* message for memory-allocation errors */ - TString *tmname[TM_N]; /* array with tag-method names */ - struct Table *mt[LUA_NUMTYPES]; /* metatables for basic types */ - TString *strcache[STRCACHE_N][STRCACHE_M]; /* cache for strings in API */ - lua_WarnFunction warnf; /* warning function */ - void *ud_warn; /* auxiliary data to 'warnf' */ -} global_State; - - -/* -** 'per thread' state -*/ -struct lua_State { - CommonHeader; - lu_byte status; - lu_byte allowhook; - unsigned short nci; /* number of items in 'ci' list */ - StkIdRel top; /* first free slot in the stack */ - global_State *l_G; - CallInfo *ci; /* call info for current function */ - StkIdRel stack_last; /* end of stack (last element + 1) */ - StkIdRel stack; /* stack base */ - UpVal *openupval; /* list of open upvalues in this stack */ - StkIdRel tbclist; /* list of to-be-closed variables */ - GCObject *gclist; - struct lua_State *twups; /* list of threads with open upvalues */ - struct lua_longjmp *errorJmp; /* current error recover point */ - CallInfo base_ci; /* CallInfo for first level (C calling Lua) */ - volatile lua_Hook hook; - ptrdiff_t errfunc; /* current error handling function (stack index) */ - l_uint32 nCcalls; /* number of nested (non-yieldable | C) calls */ - int oldpc; /* last pc traced */ - int basehookcount; - int hookcount; - volatile l_signalT hookmask; -}; - - -#define G(L) (L->l_G) - -/* -** 'g->nilvalue' being a nil value flags that the state was completely -** build. -*/ -#define completestate(g) ttisnil(&g->nilvalue) - - -/* -** Union of all collectable objects (only for conversions) -** ISO C99, 6.5.2.3 p.5: -** "if a union contains several structures that share a common initial -** sequence [...], and if the union object currently contains one -** of these structures, it is permitted to inspect the common initial -** part of any of them anywhere that a declaration of the complete type -** of the union is visible." -*/ -union GCUnion { - GCObject gc; /* common header */ - struct TString ts; - struct Udata u; - union Closure cl; - struct Table h; - struct Proto p; - struct lua_State th; /* thread */ - struct UpVal upv; -}; - - -/* -** ISO C99, 6.7.2.1 p.14: -** "A pointer to a union object, suitably converted, points to each of -** its members [...], and vice versa." -*/ -#define cast_u(o) cast(union GCUnion *, (o)) - -/* macros to convert a GCObject into a specific value */ -#define gco2ts(o) \ - check_exp(novariant((o)->tt) == LUA_TSTRING, &((cast_u(o))->ts)) -#define gco2u(o) check_exp((o)->tt == LUA_VUSERDATA, &((cast_u(o))->u)) -#define gco2lcl(o) check_exp((o)->tt == LUA_VLCL, &((cast_u(o))->cl.l)) -#define gco2ccl(o) check_exp((o)->tt == LUA_VCCL, &((cast_u(o))->cl.c)) -#define gco2cl(o) \ - check_exp(novariant((o)->tt) == LUA_TFUNCTION, &((cast_u(o))->cl)) -#define gco2t(o) check_exp((o)->tt == LUA_VTABLE, &((cast_u(o))->h)) -#define gco2p(o) check_exp((o)->tt == LUA_VPROTO, &((cast_u(o))->p)) -#define gco2th(o) check_exp((o)->tt == LUA_VTHREAD, &((cast_u(o))->th)) -#define gco2upv(o) check_exp((o)->tt == LUA_VUPVAL, &((cast_u(o))->upv)) - - -/* -** macro to convert a Lua object into a GCObject -** (The access to 'tt' tries to ensure that 'v' is actually a Lua object.) -*/ -#define obj2gco(v) check_exp((v)->tt >= LUA_TSTRING, &(cast_u(v)->gc)) - - -/* actual number of total objects allocated */ -#define gettotalobjs(g) ((g)->totalobjs - (g)->GCdebt) - - -LUAI_FUNC void luaE_setdebt (global_State *g, l_obj debt); -LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1); -LUAI_FUNC CallInfo *luaE_extendCI (lua_State *L); -LUAI_FUNC void luaE_shrinkCI (lua_State *L); -LUAI_FUNC void luaE_checkcstack (lua_State *L); -LUAI_FUNC void luaE_incCstack (lua_State *L); -LUAI_FUNC void luaE_warning (lua_State *L, const char *msg, int tocont); -LUAI_FUNC void luaE_warnerror (lua_State *L, const char *where); -LUAI_FUNC int luaE_resetthread (lua_State *L, int status); - - -#endif - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lstring.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lstring.c deleted file mode 100644 index a374c96..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lstring.c +++ /dev/null @@ -1,349 +0,0 @@ -/* -** $Id: lstring.c $ -** String table (keeps all strings handled by Lua) -** See Copyright Notice in lua.h -*/ - -#define lstring_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" - - -/* -** Maximum size for string table. -*/ -#define MAXSTRTB cast_int(luaM_limitN(MAX_INT, TString*)) - - -/* -** equality for long strings -*/ -int luaS_eqlngstr (TString *a, TString *b) { - size_t len = a->u.lnglen; - lua_assert(a->tt == LUA_VLNGSTR && b->tt == LUA_VLNGSTR); - return (a == b) || /* same instance or... */ - ((len == b->u.lnglen) && /* equal length and ... */ - (memcmp(getlngstr(a), getlngstr(b), len) == 0)); /* equal contents */ -} - - -unsigned luaS_hash (const char *str, size_t l, unsigned seed) { - unsigned int h = seed ^ cast_uint(l); - for (; l > 0; l--) - h ^= ((h<<5) + (h>>2) + cast_byte(str[l - 1])); - return h; -} - - -unsigned luaS_hashlongstr (TString *ts) { - lua_assert(ts->tt == LUA_VLNGSTR); - if (ts->extra == 0) { /* no hash? */ - size_t len = ts->u.lnglen; - ts->hash = luaS_hash(getlngstr(ts), len, ts->hash); - ts->extra = 1; /* now it has its hash */ - } - return ts->hash; -} - - -static void tablerehash (TString **vect, int osize, int nsize) { - int i; - for (i = osize; i < nsize; i++) /* clear new elements */ - vect[i] = NULL; - for (i = 0; i < osize; i++) { /* rehash old part of the array */ - TString *p = vect[i]; - vect[i] = NULL; - while (p) { /* for each string in the list */ - TString *hnext = p->u.hnext; /* save next */ - unsigned int h = lmod(p->hash, nsize); /* new position */ - p->u.hnext = vect[h]; /* chain it into array */ - vect[h] = p; - p = hnext; - } - } -} - - -/* -** Resize the string table. If allocation fails, keep the current size. -** (This can degrade performance, but any non-zero size should work -** correctly.) -*/ -void luaS_resize (lua_State *L, int nsize) { - stringtable *tb = &G(L)->strt; - int osize = tb->size; - TString **newvect; - if (nsize < osize) /* shrinking table? */ - tablerehash(tb->hash, osize, nsize); /* depopulate shrinking part */ - newvect = luaM_reallocvector(L, tb->hash, osize, nsize, TString*); - if (l_unlikely(newvect == NULL)) { /* reallocation failed? */ - if (nsize < osize) /* was it shrinking table? */ - tablerehash(tb->hash, nsize, osize); /* restore to original size */ - /* leave table as it was */ - } - else { /* allocation succeeded */ - tb->hash = newvect; - tb->size = nsize; - if (nsize > osize) - tablerehash(newvect, osize, nsize); /* rehash for new size */ - } -} - - -/* -** Clear API string cache. (Entries cannot be empty, so fill them with -** a non-collectable string.) -*/ -void luaS_clearcache (global_State *g) { - int i, j; - for (i = 0; i < STRCACHE_N; i++) - for (j = 0; j < STRCACHE_M; j++) { - if (iswhite(g->strcache[i][j])) /* will entry be collected? */ - g->strcache[i][j] = g->memerrmsg; /* replace it with something fixed */ - } -} - - -/* -** Initialize the string table and the string cache -*/ -void luaS_init (lua_State *L) { - global_State *g = G(L); - int i, j; - stringtable *tb = &G(L)->strt; - tb->hash = luaM_newvector(L, MINSTRTABSIZE, TString*); - tablerehash(tb->hash, 0, MINSTRTABSIZE); /* clear array */ - tb->size = MINSTRTABSIZE; - /* pre-create memory-error message */ - g->memerrmsg = luaS_newliteral(L, MEMERRMSG); - luaC_fix(L, obj2gco(g->memerrmsg)); /* it should never be collected */ - for (i = 0; i < STRCACHE_N; i++) /* fill cache with valid strings */ - for (j = 0; j < STRCACHE_M; j++) - g->strcache[i][j] = g->memerrmsg; -} - - -size_t luaS_sizelngstr (size_t len, int kind) { - switch (kind) { - case LSTRREG: /* regular long string */ - /* don't need 'falloc'/'ud', but need space for content */ - return offsetof(TString, falloc) + (len + 1) * sizeof(char); - case LSTRFIX: /* fixed external long string */ - /* don't need 'falloc'/'ud' */ - return offsetof(TString, falloc); - default: /* external long string with deallocation */ - lua_assert(kind == LSTRMEM); - return sizeof(TString); - } -} - - -/* -** creates a new string object -*/ -static TString *createstrobj (lua_State *L, size_t totalsize, int tag, - unsigned h) { - TString *ts; - GCObject *o; - o = luaC_newobj(L, tag, totalsize); - ts = gco2ts(o); - ts->hash = h; - ts->extra = 0; - return ts; -} - - -TString *luaS_createlngstrobj (lua_State *L, size_t l) { - size_t totalsize = luaS_sizelngstr(l, LSTRREG); - TString *ts = createstrobj(L, totalsize, LUA_VLNGSTR, G(L)->seed); - ts->u.lnglen = l; - ts->shrlen = LSTRREG; /* signals that it is a regular long string */ - ts->contents = cast_charp(ts) + offsetof(TString, falloc); - ts->contents[l] = '\0'; /* ending 0 */ - return ts; -} - - -void luaS_remove (lua_State *L, TString *ts) { - stringtable *tb = &G(L)->strt; - TString **p = &tb->hash[lmod(ts->hash, tb->size)]; - while (*p != ts) /* find previous element */ - p = &(*p)->u.hnext; - *p = (*p)->u.hnext; /* remove element from its list */ - tb->nuse--; -} - - -static void growstrtab (lua_State *L, stringtable *tb) { - if (l_unlikely(tb->nuse == MAX_INT)) { /* too many strings? */ - luaC_fullgc(L, 1); /* try to free some... */ - if (tb->nuse == MAX_INT) /* still too many? */ - luaM_error(L); /* cannot even create a message... */ - } - if (tb->size <= MAXSTRTB / 2) /* can grow string table? */ - luaS_resize(L, tb->size * 2); -} - - -/* -** Checks whether short string exists and reuses it or creates a new one. -*/ -static TString *internshrstr (lua_State *L, const char *str, size_t l) { - TString *ts; - global_State *g = G(L); - stringtable *tb = &g->strt; - unsigned int h = luaS_hash(str, l, g->seed); - TString **list = &tb->hash[lmod(h, tb->size)]; - lua_assert(str != NULL); /* otherwise 'memcmp'/'memcpy' are undefined */ - for (ts = *list; ts != NULL; ts = ts->u.hnext) { - if (l == cast_uint(ts->shrlen) && - (memcmp(str, getshrstr(ts), l * sizeof(char)) == 0)) { - /* found! */ - if (isdead(g, ts)) /* dead (but not collected yet)? */ - changewhite(ts); /* resurrect it */ - return ts; - } - } - /* else must create a new string */ - if (tb->nuse >= tb->size) { /* need to grow string table? */ - growstrtab(L, tb); - list = &tb->hash[lmod(h, tb->size)]; /* rehash with new size */ - } - ts = createstrobj(L, sizestrshr(l), LUA_VSHRSTR, h); - ts->shrlen = cast_byte(l); - getshrstr(ts)[l] = '\0'; /* ending 0 */ - memcpy(getshrstr(ts), str, l * sizeof(char)); - ts->u.hnext = *list; - *list = ts; - tb->nuse++; - return ts; -} - - -/* -** new string (with explicit length) -*/ -TString *luaS_newlstr (lua_State *L, const char *str, size_t l) { - if (l <= LUAI_MAXSHORTLEN) /* short string? */ - return internshrstr(L, str, l); - else { - TString *ts; - if (l_unlikely(l * sizeof(char) >= (MAX_SIZE - sizeof(TString)))) - luaM_toobig(L); - ts = luaS_createlngstrobj(L, l); - memcpy(getlngstr(ts), str, l * sizeof(char)); - return ts; - } -} - - -/* -** Create or reuse a zero-terminated string, first checking in the -** cache (using the string address as a key). The cache can contain -** only zero-terminated strings, so it is safe to use 'strcmp' to -** check hits. -*/ -TString *luaS_new (lua_State *L, const char *str) { - unsigned int i = point2uint(str) % STRCACHE_N; /* hash */ - int j; - TString **p = G(L)->strcache[i]; - for (j = 0; j < STRCACHE_M; j++) { - if (strcmp(str, getstr(p[j])) == 0) /* hit? */ - return p[j]; /* that is it */ - } - /* normal route */ - for (j = STRCACHE_M - 1; j > 0; j--) - p[j] = p[j - 1]; /* move out last element */ - /* new element is first in the list */ - p[0] = luaS_newlstr(L, str, strlen(str)); - return p[0]; -} - - -Udata *luaS_newudata (lua_State *L, size_t s, int nuvalue) { - Udata *u; - int i; - GCObject *o; - if (l_unlikely(s > MAX_SIZE - udatamemoffset(nuvalue))) - luaM_toobig(L); - o = luaC_newobj(L, LUA_VUSERDATA, sizeudata(nuvalue, s)); - u = gco2u(o); - u->len = s; - u->nuvalue = nuvalue; - u->metatable = NULL; - for (i = 0; i < nuvalue; i++) - setnilvalue(&u->uv[i].uv); - return u; -} - - -struct NewExt { - int kind; - const char *s; - size_t len; - TString *ts; /* output */ -}; - - -static void f_newext (lua_State *L, void *ud) { - struct NewExt *ne = cast(struct NewExt *, ud); - size_t size = luaS_sizelngstr(0, ne->kind); - ne->ts = createstrobj(L, size, LUA_VLNGSTR, G(L)->seed); -} - - -static void f_pintern (lua_State *L, void *ud) { - struct NewExt *ne = cast(struct NewExt *, ud); - ne->ts = internshrstr(L, ne->s, ne->len); -} - - -TString *luaS_newextlstr (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud) { - struct NewExt ne; - if (len <= LUAI_MAXSHORTLEN) { /* short string? */ - ne.s = s; ne.len = len; - if (!falloc) - f_pintern(L, &ne); /* just internalize string */ - else { - int status = luaD_rawrunprotected(L, f_pintern, &ne); - (*falloc)(ud, cast_voidp(s), len + 1, 0); /* free external string */ - if (status != LUA_OK) /* memory error? */ - luaM_error(L); /* re-raise memory error */ - } - return ne.ts; - } - /* "normal" case: long strings */ - if (!falloc) { - ne.kind = LSTRFIX; - f_newext(L, &ne); /* just create header */ - } - else { - ne.kind = LSTRMEM; - if (luaD_rawrunprotected(L, f_newext, &ne) != LUA_OK) { /* mem. error? */ - (*falloc)(ud, cast_voidp(s), len + 1, 0); /* free external string */ - luaM_error(L); /* re-raise memory error */ - } - ne.ts->falloc = falloc; - ne.ts->ud = ud; - } - ne.ts->shrlen = ne.kind; - ne.ts->u.lnglen = len; - ne.ts->contents = cast_charp(s); - return ne.ts; -} - - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lstring.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lstring.h deleted file mode 100644 index b7226d8..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lstring.h +++ /dev/null @@ -1,61 +0,0 @@ -/* -** $Id: lstring.h $ -** String table (keep all strings handled by Lua) -** See Copyright Notice in lua.h -*/ - -#ifndef lstring_h -#define lstring_h - -#include "lgc.h" -#include "lobject.h" -#include "lstate.h" - - -/* -** Memory-allocation error message must be preallocated (it cannot -** be created after memory is exhausted) -*/ -#define MEMERRMSG "not enough memory" - - -/* -** Size of a short TString: Size of the header plus space for the string -** itself (including final '\0'). -*/ -#define sizestrshr(l) \ - (offsetof(TString, contents) + ((l) + 1) * sizeof(char)) - - -#define luaS_newliteral(L, s) (luaS_newlstr(L, "" s, \ - (sizeof(s)/sizeof(char))-1)) - - -/* -** test whether a string is a reserved word -*/ -#define isreserved(s) ((s)->tt == LUA_VSHRSTR && (s)->extra > 0) - - -/* -** equality for short strings, which are always internalized -*/ -#define eqshrstr(a,b) check_exp((a)->tt == LUA_VSHRSTR, (a) == (b)) - - -LUAI_FUNC unsigned luaS_hash (const char *str, size_t l, unsigned seed); -LUAI_FUNC unsigned luaS_hashlongstr (TString *ts); -LUAI_FUNC int luaS_eqlngstr (TString *a, TString *b); -LUAI_FUNC void luaS_resize (lua_State *L, int newsize); -LUAI_FUNC void luaS_clearcache (global_State *g); -LUAI_FUNC void luaS_init (lua_State *L); -LUAI_FUNC void luaS_remove (lua_State *L, TString *ts); -LUAI_FUNC Udata *luaS_newudata (lua_State *L, size_t s, int nuvalue); -LUAI_FUNC TString *luaS_newlstr (lua_State *L, const char *str, size_t l); -LUAI_FUNC TString *luaS_new (lua_State *L, const char *str); -LUAI_FUNC TString *luaS_createlngstrobj (lua_State *L, size_t l); -LUAI_FUNC TString *luaS_newextlstr (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud); -LUAI_FUNC size_t luaS_sizelngstr (size_t len, int kind); - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lstrlib.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lstrlib.c deleted file mode 100644 index a90c4fd..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lstrlib.c +++ /dev/null @@ -1,1880 +0,0 @@ -/* -** $Id: lstrlib.c $ -** Standard library for string operations and pattern-matching -** See Copyright Notice in lua.h -*/ - -#define lstrlib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** maximum number of captures that a pattern can do during -** pattern-matching. This limit is arbitrary, but must fit in -** an unsigned char. -*/ -#if !defined(LUA_MAXCAPTURES) -#define LUA_MAXCAPTURES 32 -#endif - - -/* macro to 'unsign' a character */ -#define uchar(c) ((unsigned char)(c)) - - -/* -** Some sizes are better limited to fit in 'int', but must also fit in -** 'size_t'. (We assume that 'lua_Integer' cannot be smaller than 'int'.) -*/ -#define MAX_SIZET ((size_t)(~(size_t)0)) - -#define MAXSIZE \ - (sizeof(size_t) < sizeof(int) ? MAX_SIZET : (size_t)(INT_MAX)) - - - - -static int str_len (lua_State *L) { - size_t l; - luaL_checklstring(L, 1, &l); - lua_pushinteger(L, (lua_Integer)l); - return 1; -} - - -/* -** translate a relative initial string position -** (negative means back from end): clip result to [1, inf). -** The length of any string in Lua must fit in a lua_Integer, -** so there are no overflows in the casts. -** The inverted comparison avoids a possible overflow -** computing '-pos'. -*/ -static size_t posrelatI (lua_Integer pos, size_t len) { - if (pos > 0) - return (size_t)pos; - else if (pos == 0) - return 1; - else if (pos < -(lua_Integer)len) /* inverted comparison */ - return 1; /* clip to 1 */ - else return len + (size_t)pos + 1; -} - - -/* -** Gets an optional ending string position from argument 'arg', -** with default value 'def'. -** Negative means back from end: clip result to [0, len] -*/ -static size_t getendpos (lua_State *L, int arg, lua_Integer def, - size_t len) { - lua_Integer pos = luaL_optinteger(L, arg, def); - if (pos > (lua_Integer)len) - return len; - else if (pos >= 0) - return (size_t)pos; - else if (pos < -(lua_Integer)len) - return 0; - else return len + (size_t)pos + 1; -} - - -static int str_sub (lua_State *L) { - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - size_t start = posrelatI(luaL_checkinteger(L, 2), l); - size_t end = getendpos(L, 3, -1, l); - if (start <= end) - lua_pushlstring(L, s + start - 1, (end - start) + 1); - else lua_pushliteral(L, ""); - return 1; -} - - -static int str_reverse (lua_State *L) { - size_t l, i; - luaL_Buffer b; - const char *s = luaL_checklstring(L, 1, &l); - char *p = luaL_buffinitsize(L, &b, l); - for (i = 0; i < l; i++) - p[i] = s[l - i - 1]; - luaL_pushresultsize(&b, l); - return 1; -} - - -static int str_lower (lua_State *L) { - size_t l; - size_t i; - luaL_Buffer b; - const char *s = luaL_checklstring(L, 1, &l); - char *p = luaL_buffinitsize(L, &b, l); - for (i=0; i MAXSIZE / n)) - return luaL_error(L, "resulting string too large"); - else { - size_t totallen = (size_t)n * l + (size_t)(n - 1) * lsep; - luaL_Buffer b; - char *p = luaL_buffinitsize(L, &b, totallen); - while (n-- > 1) { /* first n-1 copies (followed by separator) */ - memcpy(p, s, l * sizeof(char)); p += l; - if (lsep > 0) { /* empty 'memcpy' is not that cheap */ - memcpy(p, sep, lsep * sizeof(char)); - p += lsep; - } - } - memcpy(p, s, l * sizeof(char)); /* last copy (not followed by separator) */ - luaL_pushresultsize(&b, totallen); - } - return 1; -} - - -static int str_byte (lua_State *L) { - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - lua_Integer pi = luaL_optinteger(L, 2, 1); - size_t posi = posrelatI(pi, l); - size_t pose = getendpos(L, 3, pi, l); - int n, i; - if (posi > pose) return 0; /* empty interval; return no values */ - if (l_unlikely(pose - posi >= (size_t)INT_MAX)) /* arithmetic overflow? */ - return luaL_error(L, "string slice too long"); - n = (int)(pose - posi) + 1; - luaL_checkstack(L, n, "string slice too long"); - for (i=0; iinit) { - state->init = 1; - luaL_buffinit(L, &state->B); - } - if (b == NULL) { /* finishing dump? */ - luaL_pushresult(&state->B); /* push result */ - lua_replace(L, 1); /* move it to reserved slot */ - } - else - luaL_addlstring(&state->B, (const char *)b, size); - return 0; -} - - -static int str_dump (lua_State *L) { - struct str_Writer state; - int strip = lua_toboolean(L, 2); - luaL_argcheck(L, lua_type(L, 1) == LUA_TFUNCTION && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - /* ensure function is on the top of the stack and vacate slot 1 */ - lua_pushvalue(L, 1); - state.init = 0; - lua_dump(L, writer, &state, strip); - lua_settop(L, 1); /* leave final result on top */ - return 1; -} - - - -/* -** {====================================================== -** METAMETHODS -** ======================================================= -*/ - -#if defined(LUA_NOCVTS2N) /* { */ - -/* no coercion from strings to numbers */ - -static const luaL_Reg stringmetamethods[] = { - {"__index", NULL}, /* placeholder */ - {NULL, NULL} -}; - -#else /* }{ */ - -static int tonum (lua_State *L, int arg) { - if (lua_type(L, arg) == LUA_TNUMBER) { /* already a number? */ - lua_pushvalue(L, arg); - return 1; - } - else { /* check whether it is a numerical string */ - size_t len; - const char *s = lua_tolstring(L, arg, &len); - return (s != NULL && lua_stringtonumber(L, s) == len + 1); - } -} - - -static void trymt (lua_State *L, const char *mtname) { - lua_settop(L, 2); /* back to the original arguments */ - if (l_unlikely(lua_type(L, 2) == LUA_TSTRING || - !luaL_getmetafield(L, 2, mtname))) - luaL_error(L, "attempt to %s a '%s' with a '%s'", mtname + 2, - luaL_typename(L, -2), luaL_typename(L, -1)); - lua_insert(L, -3); /* put metamethod before arguments */ - lua_call(L, 2, 1); /* call metamethod */ -} - - -static int arith (lua_State *L, int op, const char *mtname) { - if (tonum(L, 1) && tonum(L, 2)) - lua_arith(L, op); /* result will be on the top */ - else - trymt(L, mtname); - return 1; -} - - -static int arith_add (lua_State *L) { - return arith(L, LUA_OPADD, "__add"); -} - -static int arith_sub (lua_State *L) { - return arith(L, LUA_OPSUB, "__sub"); -} - -static int arith_mul (lua_State *L) { - return arith(L, LUA_OPMUL, "__mul"); -} - -static int arith_mod (lua_State *L) { - return arith(L, LUA_OPMOD, "__mod"); -} - -static int arith_pow (lua_State *L) { - return arith(L, LUA_OPPOW, "__pow"); -} - -static int arith_div (lua_State *L) { - return arith(L, LUA_OPDIV, "__div"); -} - -static int arith_idiv (lua_State *L) { - return arith(L, LUA_OPIDIV, "__idiv"); -} - -static int arith_unm (lua_State *L) { - return arith(L, LUA_OPUNM, "__unm"); -} - - -static const luaL_Reg stringmetamethods[] = { - {"__add", arith_add}, - {"__sub", arith_sub}, - {"__mul", arith_mul}, - {"__mod", arith_mod}, - {"__pow", arith_pow}, - {"__div", arith_div}, - {"__idiv", arith_idiv}, - {"__unm", arith_unm}, - {"__index", NULL}, /* placeholder */ - {NULL, NULL} -}; - -#endif /* } */ - -/* }====================================================== */ - -/* -** {====================================================== -** PATTERN MATCHING -** ======================================================= -*/ - - -#define CAP_UNFINISHED (-1) -#define CAP_POSITION (-2) - - -typedef struct MatchState { - const char *src_init; /* init of source string */ - const char *src_end; /* end ('\0') of source string */ - const char *p_end; /* end ('\0') of pattern */ - lua_State *L; - int matchdepth; /* control for recursive depth (to avoid C stack overflow) */ - unsigned char level; /* total number of captures (finished or unfinished) */ - struct { - const char *init; - ptrdiff_t len; - } capture[LUA_MAXCAPTURES]; -} MatchState; - - -/* recursive function */ -static const char *match (MatchState *ms, const char *s, const char *p); - - -/* maximum recursion depth for 'match' */ -#if !defined(MAXCCALLS) -#define MAXCCALLS 200 -#endif - - -#define L_ESC '%' -#define SPECIALS "^$*+?.([%-" - - -static int check_capture (MatchState *ms, int l) { - l -= '1'; - if (l_unlikely(l < 0 || l >= ms->level || - ms->capture[l].len == CAP_UNFINISHED)) - return luaL_error(ms->L, "invalid capture index %%%d", l + 1); - return l; -} - - -static int capture_to_close (MatchState *ms) { - int level = ms->level; - for (level--; level>=0; level--) - if (ms->capture[level].len == CAP_UNFINISHED) return level; - return luaL_error(ms->L, "invalid pattern capture"); -} - - -static const char *classend (MatchState *ms, const char *p) { - switch (*p++) { - case L_ESC: { - if (l_unlikely(p == ms->p_end)) - luaL_error(ms->L, "malformed pattern (ends with '%%')"); - return p+1; - } - case '[': { - if (*p == '^') p++; - do { /* look for a ']' */ - if (l_unlikely(p == ms->p_end)) - luaL_error(ms->L, "malformed pattern (missing ']')"); - if (*(p++) == L_ESC && p < ms->p_end) - p++; /* skip escapes (e.g. '%]') */ - } while (*p != ']'); - return p+1; - } - default: { - return p; - } - } -} - - -static int match_class (int c, int cl) { - int res; - switch (tolower(cl)) { - case 'a' : res = isalpha(c); break; - case 'c' : res = iscntrl(c); break; - case 'd' : res = isdigit(c); break; - case 'g' : res = isgraph(c); break; - case 'l' : res = islower(c); break; - case 'p' : res = ispunct(c); break; - case 's' : res = isspace(c); break; - case 'u' : res = isupper(c); break; - case 'w' : res = isalnum(c); break; - case 'x' : res = isxdigit(c); break; - case 'z' : res = (c == 0); break; /* deprecated option */ - default: return (cl == c); - } - return (islower(cl) ? res : !res); -} - - -static int matchbracketclass (int c, const char *p, const char *ec) { - int sig = 1; - if (*(p+1) == '^') { - sig = 0; - p++; /* skip the '^' */ - } - while (++p < ec) { - if (*p == L_ESC) { - p++; - if (match_class(c, uchar(*p))) - return sig; - } - else if ((*(p+1) == '-') && (p+2 < ec)) { - p+=2; - if (uchar(*(p-2)) <= c && c <= uchar(*p)) - return sig; - } - else if (uchar(*p) == c) return sig; - } - return !sig; -} - - -static int singlematch (MatchState *ms, const char *s, const char *p, - const char *ep) { - if (s >= ms->src_end) - return 0; - else { - int c = uchar(*s); - switch (*p) { - case '.': return 1; /* matches any char */ - case L_ESC: return match_class(c, uchar(*(p+1))); - case '[': return matchbracketclass(c, p, ep-1); - default: return (uchar(*p) == c); - } - } -} - - -static const char *matchbalance (MatchState *ms, const char *s, - const char *p) { - if (l_unlikely(p >= ms->p_end - 1)) - luaL_error(ms->L, "malformed pattern (missing arguments to '%%b')"); - if (*s != *p) return NULL; - else { - int b = *p; - int e = *(p+1); - int cont = 1; - while (++s < ms->src_end) { - if (*s == e) { - if (--cont == 0) return s+1; - } - else if (*s == b) cont++; - } - } - return NULL; /* string ends out of balance */ -} - - -static const char *max_expand (MatchState *ms, const char *s, - const char *p, const char *ep) { - ptrdiff_t i = 0; /* counts maximum expand for item */ - while (singlematch(ms, s + i, p, ep)) - i++; - /* keeps trying to match with the maximum repetitions */ - while (i>=0) { - const char *res = match(ms, (s+i), ep+1); - if (res) return res; - i--; /* else didn't match; reduce 1 repetition to try again */ - } - return NULL; -} - - -static const char *min_expand (MatchState *ms, const char *s, - const char *p, const char *ep) { - for (;;) { - const char *res = match(ms, s, ep+1); - if (res != NULL) - return res; - else if (singlematch(ms, s, p, ep)) - s++; /* try with one more repetition */ - else return NULL; - } -} - - -static const char *start_capture (MatchState *ms, const char *s, - const char *p, int what) { - const char *res; - int level = ms->level; - if (level >= LUA_MAXCAPTURES) luaL_error(ms->L, "too many captures"); - ms->capture[level].init = s; - ms->capture[level].len = what; - ms->level = level+1; - if ((res=match(ms, s, p)) == NULL) /* match failed? */ - ms->level--; /* undo capture */ - return res; -} - - -static const char *end_capture (MatchState *ms, const char *s, - const char *p) { - int l = capture_to_close(ms); - const char *res; - ms->capture[l].len = s - ms->capture[l].init; /* close capture */ - if ((res = match(ms, s, p)) == NULL) /* match failed? */ - ms->capture[l].len = CAP_UNFINISHED; /* undo capture */ - return res; -} - - -static const char *match_capture (MatchState *ms, const char *s, int l) { - size_t len; - l = check_capture(ms, l); - len = ms->capture[l].len; - if ((size_t)(ms->src_end-s) >= len && - memcmp(ms->capture[l].init, s, len) == 0) - return s+len; - else return NULL; -} - - -static const char *match (MatchState *ms, const char *s, const char *p) { - if (l_unlikely(ms->matchdepth-- == 0)) - luaL_error(ms->L, "pattern too complex"); - init: /* using goto to optimize tail recursion */ - if (p != ms->p_end) { /* end of pattern? */ - switch (*p) { - case '(': { /* start capture */ - if (*(p + 1) == ')') /* position capture? */ - s = start_capture(ms, s, p + 2, CAP_POSITION); - else - s = start_capture(ms, s, p + 1, CAP_UNFINISHED); - break; - } - case ')': { /* end capture */ - s = end_capture(ms, s, p + 1); - break; - } - case '$': { - if ((p + 1) != ms->p_end) /* is the '$' the last char in pattern? */ - goto dflt; /* no; go to default */ - s = (s == ms->src_end) ? s : NULL; /* check end of string */ - break; - } - case L_ESC: { /* escaped sequences not in the format class[*+?-]? */ - switch (*(p + 1)) { - case 'b': { /* balanced string? */ - s = matchbalance(ms, s, p + 2); - if (s != NULL) { - p += 4; goto init; /* return match(ms, s, p + 4); */ - } /* else fail (s == NULL) */ - break; - } - case 'f': { /* frontier? */ - const char *ep; char previous; - p += 2; - if (l_unlikely(*p != '[')) - luaL_error(ms->L, "missing '[' after '%%f' in pattern"); - ep = classend(ms, p); /* points to what is next */ - previous = (s == ms->src_init) ? '\0' : *(s - 1); - if (!matchbracketclass(uchar(previous), p, ep - 1) && - matchbracketclass(uchar(*s), p, ep - 1)) { - p = ep; goto init; /* return match(ms, s, ep); */ - } - s = NULL; /* match failed */ - break; - } - case '0': case '1': case '2': case '3': - case '4': case '5': case '6': case '7': - case '8': case '9': { /* capture results (%0-%9)? */ - s = match_capture(ms, s, uchar(*(p + 1))); - if (s != NULL) { - p += 2; goto init; /* return match(ms, s, p + 2) */ - } - break; - } - default: goto dflt; - } - break; - } - default: dflt: { /* pattern class plus optional suffix */ - const char *ep = classend(ms, p); /* points to optional suffix */ - /* does not match at least once? */ - if (!singlematch(ms, s, p, ep)) { - if (*ep == '*' || *ep == '?' || *ep == '-') { /* accept empty? */ - p = ep + 1; goto init; /* return match(ms, s, ep + 1); */ - } - else /* '+' or no suffix */ - s = NULL; /* fail */ - } - else { /* matched once */ - switch (*ep) { /* handle optional suffix */ - case '?': { /* optional */ - const char *res; - if ((res = match(ms, s + 1, ep + 1)) != NULL) - s = res; - else { - p = ep + 1; goto init; /* else return match(ms, s, ep + 1); */ - } - break; - } - case '+': /* 1 or more repetitions */ - s++; /* 1 match already done */ - /* FALLTHROUGH */ - case '*': /* 0 or more repetitions */ - s = max_expand(ms, s, p, ep); - break; - case '-': /* 0 or more repetitions (minimum) */ - s = min_expand(ms, s, p, ep); - break; - default: /* no suffix */ - s++; p = ep; goto init; /* return match(ms, s + 1, ep); */ - } - } - break; - } - } - } - ms->matchdepth++; - return s; -} - - - -static const char *lmemfind (const char *s1, size_t l1, - const char *s2, size_t l2) { - if (l2 == 0) return s1; /* empty strings are everywhere */ - else if (l2 > l1) return NULL; /* avoids a negative 'l1' */ - else { - const char *init; /* to search for a '*s2' inside 's1' */ - l2--; /* 1st char will be checked by 'memchr' */ - l1 = l1-l2; /* 's2' cannot be found after that */ - while (l1 > 0 && (init = (const char *)memchr(s1, *s2, l1)) != NULL) { - init++; /* 1st char is already checked */ - if (memcmp(init, s2+1, l2) == 0) - return init-1; - else { /* correct 'l1' and 's1' to try again */ - l1 -= init-s1; - s1 = init; - } - } - return NULL; /* not found */ - } -} - - -/* -** get information about the i-th capture. If there are no captures -** and 'i==0', return information about the whole match, which -** is the range 's'..'e'. If the capture is a string, return -** its length and put its address in '*cap'. If it is an integer -** (a position), push it on the stack and return CAP_POSITION. -*/ -static size_t get_onecapture (MatchState *ms, int i, const char *s, - const char *e, const char **cap) { - if (i >= ms->level) { - if (l_unlikely(i != 0)) - luaL_error(ms->L, "invalid capture index %%%d", i + 1); - *cap = s; - return e - s; - } - else { - ptrdiff_t capl = ms->capture[i].len; - *cap = ms->capture[i].init; - if (l_unlikely(capl == CAP_UNFINISHED)) - luaL_error(ms->L, "unfinished capture"); - else if (capl == CAP_POSITION) - lua_pushinteger(ms->L, (ms->capture[i].init - ms->src_init) + 1); - return capl; - } -} - - -/* -** Push the i-th capture on the stack. -*/ -static void push_onecapture (MatchState *ms, int i, const char *s, - const char *e) { - const char *cap; - ptrdiff_t l = get_onecapture(ms, i, s, e, &cap); - if (l != CAP_POSITION) - lua_pushlstring(ms->L, cap, l); - /* else position was already pushed */ -} - - -static int push_captures (MatchState *ms, const char *s, const char *e) { - int i; - int nlevels = (ms->level == 0 && s) ? 1 : ms->level; - luaL_checkstack(ms->L, nlevels, "too many captures"); - for (i = 0; i < nlevels; i++) - push_onecapture(ms, i, s, e); - return nlevels; /* number of strings pushed */ -} - - -/* check whether pattern has no special characters */ -static int nospecials (const char *p, size_t l) { - size_t upto = 0; - do { - if (strpbrk(p + upto, SPECIALS)) - return 0; /* pattern has a special character */ - upto += strlen(p + upto) + 1; /* may have more after \0 */ - } while (upto <= l); - return 1; /* no special chars found */ -} - - -static void prepstate (MatchState *ms, lua_State *L, - const char *s, size_t ls, const char *p, size_t lp) { - ms->L = L; - ms->matchdepth = MAXCCALLS; - ms->src_init = s; - ms->src_end = s + ls; - ms->p_end = p + lp; -} - - -static void reprepstate (MatchState *ms) { - ms->level = 0; - lua_assert(ms->matchdepth == MAXCCALLS); -} - - -static int str_find_aux (lua_State *L, int find) { - size_t ls, lp; - const char *s = luaL_checklstring(L, 1, &ls); - const char *p = luaL_checklstring(L, 2, &lp); - size_t init = posrelatI(luaL_optinteger(L, 3, 1), ls) - 1; - if (init > ls) { /* start after string's end? */ - luaL_pushfail(L); /* cannot find anything */ - return 1; - } - /* explicit request or no special characters? */ - if (find && (lua_toboolean(L, 4) || nospecials(p, lp))) { - /* do a plain search */ - const char *s2 = lmemfind(s + init, ls - init, p, lp); - if (s2) { - lua_pushinteger(L, (s2 - s) + 1); - lua_pushinteger(L, (s2 - s) + lp); - return 2; - } - } - else { - MatchState ms; - const char *s1 = s + init; - int anchor = (*p == '^'); - if (anchor) { - p++; lp--; /* skip anchor character */ - } - prepstate(&ms, L, s, ls, p, lp); - do { - const char *res; - reprepstate(&ms); - if ((res=match(&ms, s1, p)) != NULL) { - if (find) { - lua_pushinteger(L, (s1 - s) + 1); /* start */ - lua_pushinteger(L, res - s); /* end */ - return push_captures(&ms, NULL, 0) + 2; - } - else - return push_captures(&ms, s1, res); - } - } while (s1++ < ms.src_end && !anchor); - } - luaL_pushfail(L); /* not found */ - return 1; -} - - -static int str_find (lua_State *L) { - return str_find_aux(L, 1); -} - - -static int str_match (lua_State *L) { - return str_find_aux(L, 0); -} - - -/* state for 'gmatch' */ -typedef struct GMatchState { - const char *src; /* current position */ - const char *p; /* pattern */ - const char *lastmatch; /* end of last match */ - MatchState ms; /* match state */ -} GMatchState; - - -static int gmatch_aux (lua_State *L) { - GMatchState *gm = (GMatchState *)lua_touserdata(L, lua_upvalueindex(3)); - const char *src; - gm->ms.L = L; - for (src = gm->src; src <= gm->ms.src_end; src++) { - const char *e; - reprepstate(&gm->ms); - if ((e = match(&gm->ms, src, gm->p)) != NULL && e != gm->lastmatch) { - gm->src = gm->lastmatch = e; - return push_captures(&gm->ms, src, e); - } - } - return 0; /* not found */ -} - - -static int gmatch (lua_State *L) { - size_t ls, lp; - const char *s = luaL_checklstring(L, 1, &ls); - const char *p = luaL_checklstring(L, 2, &lp); - size_t init = posrelatI(luaL_optinteger(L, 3, 1), ls) - 1; - GMatchState *gm; - lua_settop(L, 2); /* keep strings on closure to avoid being collected */ - gm = (GMatchState *)lua_newuserdatauv(L, sizeof(GMatchState), 0); - if (init > ls) /* start after string's end? */ - init = ls + 1; /* avoid overflows in 's + init' */ - prepstate(&gm->ms, L, s, ls, p, lp); - gm->src = s + init; gm->p = p; gm->lastmatch = NULL; - lua_pushcclosure(L, gmatch_aux, 3); - return 1; -} - - -static void add_s (MatchState *ms, luaL_Buffer *b, const char *s, - const char *e) { - size_t l; - lua_State *L = ms->L; - const char *news = lua_tolstring(L, 3, &l); - const char *p; - while ((p = (char *)memchr(news, L_ESC, l)) != NULL) { - luaL_addlstring(b, news, p - news); - p++; /* skip ESC */ - if (*p == L_ESC) /* '%%' */ - luaL_addchar(b, *p); - else if (*p == '0') /* '%0' */ - luaL_addlstring(b, s, e - s); - else if (isdigit(uchar(*p))) { /* '%n' */ - const char *cap; - ptrdiff_t resl = get_onecapture(ms, *p - '1', s, e, &cap); - if (resl == CAP_POSITION) - luaL_addvalue(b); /* add position to accumulated result */ - else - luaL_addlstring(b, cap, resl); - } - else - luaL_error(L, "invalid use of '%c' in replacement string", L_ESC); - l -= p + 1 - news; - news = p + 1; - } - luaL_addlstring(b, news, l); -} - - -/* -** Add the replacement value to the string buffer 'b'. -** Return true if the original string was changed. (Function calls and -** table indexing resulting in nil or false do not change the subject.) -*/ -static int add_value (MatchState *ms, luaL_Buffer *b, const char *s, - const char *e, int tr) { - lua_State *L = ms->L; - switch (tr) { - case LUA_TFUNCTION: { /* call the function */ - int n; - lua_pushvalue(L, 3); /* push the function */ - n = push_captures(ms, s, e); /* all captures as arguments */ - lua_call(L, n, 1); /* call it */ - break; - } - case LUA_TTABLE: { /* index the table */ - push_onecapture(ms, 0, s, e); /* first capture is the index */ - lua_gettable(L, 3); - break; - } - default: { /* LUA_TNUMBER or LUA_TSTRING */ - add_s(ms, b, s, e); /* add value to the buffer */ - return 1; /* something changed */ - } - } - if (!lua_toboolean(L, -1)) { /* nil or false? */ - lua_pop(L, 1); /* remove value */ - luaL_addlstring(b, s, e - s); /* keep original text */ - return 0; /* no changes */ - } - else if (l_unlikely(!lua_isstring(L, -1))) - return luaL_error(L, "invalid replacement value (a %s)", - luaL_typename(L, -1)); - else { - luaL_addvalue(b); /* add result to accumulator */ - return 1; /* something changed */ - } -} - - -static int str_gsub (lua_State *L) { - size_t srcl, lp; - const char *src = luaL_checklstring(L, 1, &srcl); /* subject */ - const char *p = luaL_checklstring(L, 2, &lp); /* pattern */ - const char *lastmatch = NULL; /* end of last match */ - int tr = lua_type(L, 3); /* replacement type */ - lua_Integer max_s = luaL_optinteger(L, 4, srcl + 1); /* max replacements */ - int anchor = (*p == '^'); - lua_Integer n = 0; /* replacement count */ - int changed = 0; /* change flag */ - MatchState ms; - luaL_Buffer b; - luaL_argexpected(L, tr == LUA_TNUMBER || tr == LUA_TSTRING || - tr == LUA_TFUNCTION || tr == LUA_TTABLE, 3, - "string/function/table"); - luaL_buffinit(L, &b); - if (anchor) { - p++; lp--; /* skip anchor character */ - } - prepstate(&ms, L, src, srcl, p, lp); - while (n < max_s) { - const char *e; - reprepstate(&ms); /* (re)prepare state for new match */ - if ((e = match(&ms, src, p)) != NULL && e != lastmatch) { /* match? */ - n++; - changed = add_value(&ms, &b, src, e, tr) | changed; - src = lastmatch = e; - } - else if (src < ms.src_end) /* otherwise, skip one character */ - luaL_addchar(&b, *src++); - else break; /* end of subject */ - if (anchor) break; - } - if (!changed) /* no changes? */ - lua_pushvalue(L, 1); /* return original string */ - else { /* something changed */ - luaL_addlstring(&b, src, ms.src_end-src); - luaL_pushresult(&b); /* create and return new string */ - } - lua_pushinteger(L, n); /* number of substitutions */ - return 2; -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** STRING FORMAT -** ======================================================= -*/ - -#if !defined(lua_number2strx) /* { */ - -/* -** Hexadecimal floating-point formatter -*/ - -#define SIZELENMOD (sizeof(LUA_NUMBER_FRMLEN)/sizeof(char)) - - -/* -** Number of bits that goes into the first digit. It can be any value -** between 1 and 4; the following definition tries to align the number -** to nibble boundaries by making what is left after that first digit a -** multiple of 4. -*/ -#define L_NBFD ((l_floatatt(MANT_DIG) - 1)%4 + 1) - - -/* -** Add integer part of 'x' to buffer and return new 'x' -*/ -static lua_Number adddigit (char *buff, int n, lua_Number x) { - lua_Number dd = l_mathop(floor)(x); /* get integer part from 'x' */ - int d = (int)dd; - buff[n] = (d < 10 ? d + '0' : d - 10 + 'a'); /* add to buffer */ - return x - dd; /* return what is left */ -} - - -static int num2straux (char *buff, int sz, lua_Number x) { - /* if 'inf' or 'NaN', format it like '%g' */ - if (x != x || x == (lua_Number)HUGE_VAL || x == -(lua_Number)HUGE_VAL) - return l_sprintf(buff, sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)x); - else if (x == 0) { /* can be -0... */ - /* create "0" or "-0" followed by exponent */ - return l_sprintf(buff, sz, LUA_NUMBER_FMT "x0p+0", (LUAI_UACNUMBER)x); - } - else { - int e; - lua_Number m = l_mathop(frexp)(x, &e); /* 'x' fraction and exponent */ - int n = 0; /* character count */ - if (m < 0) { /* is number negative? */ - buff[n++] = '-'; /* add sign */ - m = -m; /* make it positive */ - } - buff[n++] = '0'; buff[n++] = 'x'; /* add "0x" */ - m = adddigit(buff, n++, m * (1 << L_NBFD)); /* add first digit */ - e -= L_NBFD; /* this digit goes before the radix point */ - if (m > 0) { /* more digits? */ - buff[n++] = lua_getlocaledecpoint(); /* add radix point */ - do { /* add as many digits as needed */ - m = adddigit(buff, n++, m * 16); - } while (m > 0); - } - n += l_sprintf(buff + n, sz - n, "p%+d", e); /* add exponent */ - lua_assert(n < sz); - return n; - } -} - - -static int lua_number2strx (lua_State *L, char *buff, int sz, - const char *fmt, lua_Number x) { - int n = num2straux(buff, sz, x); - if (fmt[SIZELENMOD] == 'A') { - int i; - for (i = 0; i < n; i++) - buff[i] = toupper(uchar(buff[i])); - } - else if (l_unlikely(fmt[SIZELENMOD] != 'a')) - return luaL_error(L, "modifiers for format '%%a'/'%%A' not implemented"); - return n; -} - -#endif /* } */ - - -/* -** Maximum size for items formatted with '%f'. This size is produced -** by format('%.99f', -maxfloat), and is equal to 99 + 3 ('-', '.', -** and '\0') + number of decimal digits to represent maxfloat (which -** is maximum exponent + 1). (99+3+1, adding some extra, 110) -*/ -#define MAX_ITEMF (110 + l_floatatt(MAX_10_EXP)) - - -/* -** All formats except '%f' do not need that large limit. The other -** float formats use exponents, so that they fit in the 99 limit for -** significant digits; 's' for large strings and 'q' add items directly -** to the buffer; all integer formats also fit in the 99 limit. The -** worst case are floats: they may need 99 significant digits, plus -** '0x', '-', '.', 'e+XXXX', and '\0'. Adding some extra, 120. -*/ -#define MAX_ITEM 120 - - -/* valid flags in a format specification */ -#if !defined(L_FMTFLAGSF) - -/* valid flags for a, A, e, E, f, F, g, and G conversions */ -#define L_FMTFLAGSF "-+#0 " - -/* valid flags for o, x, and X conversions */ -#define L_FMTFLAGSX "-#0" - -/* valid flags for d and i conversions */ -#define L_FMTFLAGSI "-+0 " - -/* valid flags for u conversions */ -#define L_FMTFLAGSU "-0" - -/* valid flags for c, p, and s conversions */ -#define L_FMTFLAGSC "-" - -#endif - - -/* -** Maximum size of each format specification (such as "%-099.99d"): -** Initial '%', flags (up to 5), width (2), period, precision (2), -** length modifier (8), conversion specifier, and final '\0', plus some -** extra. -*/ -#define MAX_FORMAT 32 - - -static void addquoted (luaL_Buffer *b, const char *s, size_t len) { - luaL_addchar(b, '"'); - while (len--) { - if (*s == '"' || *s == '\\' || *s == '\n') { - luaL_addchar(b, '\\'); - luaL_addchar(b, *s); - } - else if (iscntrl(uchar(*s))) { - char buff[10]; - if (!isdigit(uchar(*(s+1)))) - l_sprintf(buff, sizeof(buff), "\\%d", (int)uchar(*s)); - else - l_sprintf(buff, sizeof(buff), "\\%03d", (int)uchar(*s)); - luaL_addstring(b, buff); - } - else - luaL_addchar(b, *s); - s++; - } - luaL_addchar(b, '"'); -} - - -/* -** Serialize a floating-point number in such a way that it can be -** scanned back by Lua. Use hexadecimal format for "common" numbers -** (to preserve precision); inf, -inf, and NaN are handled separately. -** (NaN cannot be expressed as a numeral, so we write '(0/0)' for it.) -*/ -static int quotefloat (lua_State *L, char *buff, lua_Number n) { - const char *s; /* for the fixed representations */ - if (n == (lua_Number)HUGE_VAL) /* inf? */ - s = "1e9999"; - else if (n == -(lua_Number)HUGE_VAL) /* -inf? */ - s = "-1e9999"; - else if (n != n) /* NaN? */ - s = "(0/0)"; - else { /* format number as hexadecimal */ - int nb = lua_number2strx(L, buff, MAX_ITEM, - "%" LUA_NUMBER_FRMLEN "a", n); - /* ensures that 'buff' string uses a dot as the radix character */ - if (memchr(buff, '.', nb) == NULL) { /* no dot? */ - char point = lua_getlocaledecpoint(); /* try locale point */ - char *ppoint = (char *)memchr(buff, point, nb); - if (ppoint) *ppoint = '.'; /* change it to a dot */ - } - return nb; - } - /* for the fixed representations */ - return l_sprintf(buff, MAX_ITEM, "%s", s); -} - - -static void addliteral (lua_State *L, luaL_Buffer *b, int arg) { - switch (lua_type(L, arg)) { - case LUA_TSTRING: { - size_t len; - const char *s = lua_tolstring(L, arg, &len); - addquoted(b, s, len); - break; - } - case LUA_TNUMBER: { - char *buff = luaL_prepbuffsize(b, MAX_ITEM); - int nb; - if (!lua_isinteger(L, arg)) /* float? */ - nb = quotefloat(L, buff, lua_tonumber(L, arg)); - else { /* integers */ - lua_Integer n = lua_tointeger(L, arg); - const char *format = (n == LUA_MININTEGER) /* corner case? */ - ? "0x%" LUA_INTEGER_FRMLEN "x" /* use hex */ - : LUA_INTEGER_FMT; /* else use default format */ - nb = l_sprintf(buff, MAX_ITEM, format, (LUAI_UACINT)n); - } - luaL_addsize(b, nb); - break; - } - case LUA_TNIL: case LUA_TBOOLEAN: { - luaL_tolstring(L, arg, NULL); - luaL_addvalue(b); - break; - } - default: { - luaL_argerror(L, arg, "value has no literal form"); - } - } -} - - -static const char *get2digits (const char *s) { - if (isdigit(uchar(*s))) { - s++; - if (isdigit(uchar(*s))) s++; /* (2 digits at most) */ - } - return s; -} - - -/* -** Check whether a conversion specification is valid. When called, -** first character in 'form' must be '%' and last character must -** be a valid conversion specifier. 'flags' are the accepted flags; -** 'precision' signals whether to accept a precision. -*/ -static void checkformat (lua_State *L, const char *form, const char *flags, - int precision) { - const char *spec = form + 1; /* skip '%' */ - spec += strspn(spec, flags); /* skip flags */ - if (*spec != '0') { /* a width cannot start with '0' */ - spec = get2digits(spec); /* skip width */ - if (*spec == '.' && precision) { - spec++; - spec = get2digits(spec); /* skip precision */ - } - } - if (!isalpha(uchar(*spec))) /* did not go to the end? */ - luaL_error(L, "invalid conversion specification: '%s'", form); -} - - -/* -** Get a conversion specification and copy it to 'form'. -** Return the address of its last character. -*/ -static const char *getformat (lua_State *L, const char *strfrmt, - char *form) { - /* spans flags, width, and precision ('0' is included as a flag) */ - size_t len = strspn(strfrmt, L_FMTFLAGSF "123456789."); - len++; /* adds following character (should be the specifier) */ - /* still needs space for '%', '\0', plus a length modifier */ - if (len >= MAX_FORMAT - 10) - luaL_error(L, "invalid format (too long)"); - *(form++) = '%'; - memcpy(form, strfrmt, len * sizeof(char)); - *(form + len) = '\0'; - return strfrmt + len - 1; -} - - -/* -** add length modifier into formats -*/ -static void addlenmod (char *form, const char *lenmod) { - size_t l = strlen(form); - size_t lm = strlen(lenmod); - char spec = form[l - 1]; - strcpy(form + l - 1, lenmod); - form[l + lm - 1] = spec; - form[l + lm] = '\0'; -} - - -static int str_format (lua_State *L) { - int top = lua_gettop(L); - int arg = 1; - size_t sfl; - const char *strfrmt = luaL_checklstring(L, arg, &sfl); - const char *strfrmt_end = strfrmt+sfl; - const char *flags; - luaL_Buffer b; - luaL_buffinit(L, &b); - while (strfrmt < strfrmt_end) { - if (*strfrmt != L_ESC) - luaL_addchar(&b, *strfrmt++); - else if (*++strfrmt == L_ESC) - luaL_addchar(&b, *strfrmt++); /* %% */ - else { /* format item */ - char form[MAX_FORMAT]; /* to store the format ('%...') */ - int maxitem = MAX_ITEM; /* maximum length for the result */ - char *buff = luaL_prepbuffsize(&b, maxitem); /* to put result */ - int nb = 0; /* number of bytes in result */ - if (++arg > top) - return luaL_argerror(L, arg, "no value"); - strfrmt = getformat(L, strfrmt, form); - switch (*strfrmt++) { - case 'c': { - checkformat(L, form, L_FMTFLAGSC, 0); - nb = l_sprintf(buff, maxitem, form, (int)luaL_checkinteger(L, arg)); - break; - } - case 'd': case 'i': - flags = L_FMTFLAGSI; - goto intcase; - case 'u': - flags = L_FMTFLAGSU; - goto intcase; - case 'o': case 'x': case 'X': - flags = L_FMTFLAGSX; - intcase: { - lua_Integer n = luaL_checkinteger(L, arg); - checkformat(L, form, flags, 1); - addlenmod(form, LUA_INTEGER_FRMLEN); - nb = l_sprintf(buff, maxitem, form, (LUAI_UACINT)n); - break; - } - case 'a': case 'A': - checkformat(L, form, L_FMTFLAGSF, 1); - addlenmod(form, LUA_NUMBER_FRMLEN); - nb = lua_number2strx(L, buff, maxitem, form, - luaL_checknumber(L, arg)); - break; - case 'f': - maxitem = MAX_ITEMF; /* extra space for '%f' */ - buff = luaL_prepbuffsize(&b, maxitem); - /* FALLTHROUGH */ - case 'e': case 'E': case 'g': case 'G': { - lua_Number n = luaL_checknumber(L, arg); - checkformat(L, form, L_FMTFLAGSF, 1); - addlenmod(form, LUA_NUMBER_FRMLEN); - nb = l_sprintf(buff, maxitem, form, (LUAI_UACNUMBER)n); - break; - } - case 'p': { - const void *p = lua_topointer(L, arg); - checkformat(L, form, L_FMTFLAGSC, 0); - if (p == NULL) { /* avoid calling 'printf' with argument NULL */ - p = "(null)"; /* result */ - form[strlen(form) - 1] = 's'; /* format it as a string */ - } - nb = l_sprintf(buff, maxitem, form, p); - break; - } - case 'q': { - if (form[2] != '\0') /* modifiers? */ - return luaL_error(L, "specifier '%%q' cannot have modifiers"); - addliteral(L, &b, arg); - break; - } - case 's': { - size_t l; - const char *s = luaL_tolstring(L, arg, &l); - if (form[2] == '\0') /* no modifiers? */ - luaL_addvalue(&b); /* keep entire string */ - else { - luaL_argcheck(L, l == strlen(s), arg, "string contains zeros"); - checkformat(L, form, L_FMTFLAGSC, 1); - if (strchr(form, '.') == NULL && l >= 100) { - /* no precision and string is too long to be formatted */ - luaL_addvalue(&b); /* keep entire string */ - } - else { /* format the string into 'buff' */ - nb = l_sprintf(buff, maxitem, form, s); - lua_pop(L, 1); /* remove result from 'luaL_tolstring' */ - } - } - break; - } - default: { /* also treat cases 'pnLlh' */ - return luaL_error(L, "invalid conversion '%s' to 'format'", form); - } - } - lua_assert(nb < maxitem); - luaL_addsize(&b, nb); - } - } - luaL_pushresult(&b); - return 1; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** PACK/UNPACK -** ======================================================= -*/ - - -/* value used for padding */ -#if !defined(LUAL_PACKPADBYTE) -#define LUAL_PACKPADBYTE 0x00 -#endif - -/* maximum size for the binary representation of an integer */ -#define MAXINTSIZE 16 - -/* number of bits in a character */ -#define NB CHAR_BIT - -/* mask for one character (NB 1's) */ -#define MC ((1 << NB) - 1) - -/* size of a lua_Integer */ -#define SZINT ((int)sizeof(lua_Integer)) - - -/* dummy union to get native endianness */ -static const union { - int dummy; - char little; /* true iff machine is little endian */ -} nativeendian = {1}; - - -/* -** information to pack/unpack stuff -*/ -typedef struct Header { - lua_State *L; - int islittle; - int maxalign; -} Header; - - -/* -** options for pack/unpack -*/ -typedef enum KOption { - Kint, /* signed integers */ - Kuint, /* unsigned integers */ - Kfloat, /* single-precision floating-point numbers */ - Knumber, /* Lua "native" floating-point numbers */ - Kdouble, /* double-precision floating-point numbers */ - Kchar, /* fixed-length strings */ - Kstring, /* strings with prefixed length */ - Kzstr, /* zero-terminated strings */ - Kpadding, /* padding */ - Kpaddalign, /* padding for alignment */ - Knop /* no-op (configuration or spaces) */ -} KOption; - - -/* -** Read an integer numeral from string 'fmt' or return 'df' if -** there is no numeral -*/ -static int digit (int c) { return '0' <= c && c <= '9'; } - -static int getnum (const char **fmt, int df) { - if (!digit(**fmt)) /* no number? */ - return df; /* return default value */ - else { - int a = 0; - do { - a = a*10 + (*((*fmt)++) - '0'); - } while (digit(**fmt) && a <= ((int)MAXSIZE - 9)/10); - return a; - } -} - - -/* -** Read an integer numeral and raises an error if it is larger -** than the maximum size for integers. -*/ -static int getnumlimit (Header *h, const char **fmt, int df) { - int sz = getnum(fmt, df); - if (l_unlikely(sz > MAXINTSIZE || sz <= 0)) - return luaL_error(h->L, "integral size (%d) out of limits [1,%d]", - sz, MAXINTSIZE); - return sz; -} - - -/* -** Initialize Header -*/ -static void initheader (lua_State *L, Header *h) { - h->L = L; - h->islittle = nativeendian.little; - h->maxalign = 1; -} - - -/* -** Read and classify next option. 'size' is filled with option's size. -*/ -static KOption getoption (Header *h, const char **fmt, int *size) { - /* dummy structure to get native alignment requirements */ - struct cD { char c; union { LUAI_MAXALIGN; } u; }; - int opt = *((*fmt)++); - *size = 0; /* default */ - switch (opt) { - case 'b': *size = sizeof(char); return Kint; - case 'B': *size = sizeof(char); return Kuint; - case 'h': *size = sizeof(short); return Kint; - case 'H': *size = sizeof(short); return Kuint; - case 'l': *size = sizeof(long); return Kint; - case 'L': *size = sizeof(long); return Kuint; - case 'j': *size = sizeof(lua_Integer); return Kint; - case 'J': *size = sizeof(lua_Integer); return Kuint; - case 'T': *size = sizeof(size_t); return Kuint; - case 'f': *size = sizeof(float); return Kfloat; - case 'n': *size = sizeof(lua_Number); return Knumber; - case 'd': *size = sizeof(double); return Kdouble; - case 'i': *size = getnumlimit(h, fmt, sizeof(int)); return Kint; - case 'I': *size = getnumlimit(h, fmt, sizeof(int)); return Kuint; - case 's': *size = getnumlimit(h, fmt, sizeof(size_t)); return Kstring; - case 'c': - *size = getnum(fmt, -1); - if (l_unlikely(*size == -1)) - luaL_error(h->L, "missing size for format option 'c'"); - return Kchar; - case 'z': return Kzstr; - case 'x': *size = 1; return Kpadding; - case 'X': return Kpaddalign; - case ' ': break; - case '<': h->islittle = 1; break; - case '>': h->islittle = 0; break; - case '=': h->islittle = nativeendian.little; break; - case '!': { - const int maxalign = offsetof(struct cD, u); - h->maxalign = getnumlimit(h, fmt, maxalign); - break; - } - default: luaL_error(h->L, "invalid format option '%c'", opt); - } - return Knop; -} - - -/* -** Read, classify, and fill other details about the next option. -** 'psize' is filled with option's size, 'notoalign' with its -** alignment requirements. -** Local variable 'size' gets the size to be aligned. (Kpadal option -** always gets its full alignment, other options are limited by -** the maximum alignment ('maxalign'). Kchar option needs no alignment -** despite its size. -*/ -static KOption getdetails (Header *h, size_t totalsize, - const char **fmt, int *psize, int *ntoalign) { - KOption opt = getoption(h, fmt, psize); - int align = *psize; /* usually, alignment follows size */ - if (opt == Kpaddalign) { /* 'X' gets alignment from following option */ - if (**fmt == '\0' || getoption(h, fmt, &align) == Kchar || align == 0) - luaL_argerror(h->L, 1, "invalid next option for option 'X'"); - } - if (align <= 1 || opt == Kchar) /* need no alignment? */ - *ntoalign = 0; - else { - if (align > h->maxalign) /* enforce maximum alignment */ - align = h->maxalign; - if (l_unlikely((align & (align - 1)) != 0)) /* not a power of 2? */ - luaL_argerror(h->L, 1, "format asks for alignment not power of 2"); - *ntoalign = (align - (int)(totalsize & (align - 1))) & (align - 1); - } - return opt; -} - - -/* -** Pack integer 'n' with 'size' bytes and 'islittle' endianness. -** The final 'if' handles the case when 'size' is larger than -** the size of a Lua integer, correcting the extra sign-extension -** bytes if necessary (by default they would be zeros). -*/ -static void packint (luaL_Buffer *b, lua_Unsigned n, - int islittle, int size, int neg) { - char *buff = luaL_prepbuffsize(b, size); - int i; - buff[islittle ? 0 : size - 1] = (char)(n & MC); /* first byte */ - for (i = 1; i < size; i++) { - n >>= NB; - buff[islittle ? i : size - 1 - i] = (char)(n & MC); - } - if (neg && size > SZINT) { /* negative number need sign extension? */ - for (i = SZINT; i < size; i++) /* correct extra bytes */ - buff[islittle ? i : size - 1 - i] = (char)MC; - } - luaL_addsize(b, size); /* add result to buffer */ -} - - -/* -** Copy 'size' bytes from 'src' to 'dest', correcting endianness if -** given 'islittle' is different from native endianness. -*/ -static void copywithendian (char *dest, const char *src, - int size, int islittle) { - if (islittle == nativeendian.little) - memcpy(dest, src, size); - else { - dest += size - 1; - while (size-- != 0) - *(dest--) = *(src++); - } -} - - -static int str_pack (lua_State *L) { - luaL_Buffer b; - Header h; - const char *fmt = luaL_checkstring(L, 1); /* format string */ - int arg = 1; /* current argument to pack */ - size_t totalsize = 0; /* accumulate total size of result */ - initheader(L, &h); - lua_pushnil(L); /* mark to separate arguments from string buffer */ - luaL_buffinit(L, &b); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, totalsize, &fmt, &size, &ntoalign); - totalsize += ntoalign + size; - while (ntoalign-- > 0) - luaL_addchar(&b, LUAL_PACKPADBYTE); /* fill alignment */ - arg++; - switch (opt) { - case Kint: { /* signed integers */ - lua_Integer n = luaL_checkinteger(L, arg); - if (size < SZINT) { /* need overflow check? */ - lua_Integer lim = (lua_Integer)1 << ((size * NB) - 1); - luaL_argcheck(L, -lim <= n && n < lim, arg, "integer overflow"); - } - packint(&b, (lua_Unsigned)n, h.islittle, size, (n < 0)); - break; - } - case Kuint: { /* unsigned integers */ - lua_Integer n = luaL_checkinteger(L, arg); - if (size < SZINT) /* need overflow check? */ - luaL_argcheck(L, (lua_Unsigned)n < ((lua_Unsigned)1 << (size * NB)), - arg, "unsigned overflow"); - packint(&b, (lua_Unsigned)n, h.islittle, size, 0); - break; - } - case Kfloat: { /* C float */ - float f = (float)luaL_checknumber(L, arg); /* get argument */ - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - /* move 'f' to final result, correcting endianness if needed */ - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Knumber: { /* Lua float */ - lua_Number f = luaL_checknumber(L, arg); /* get argument */ - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - /* move 'f' to final result, correcting endianness if needed */ - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Kdouble: { /* C double */ - double f = (double)luaL_checknumber(L, arg); /* get argument */ - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - /* move 'f' to final result, correcting endianness if needed */ - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Kchar: { /* fixed-size string */ - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, len <= (size_t)size, arg, - "string longer than given size"); - luaL_addlstring(&b, s, len); /* add string */ - while (len++ < (size_t)size) /* pad extra space */ - luaL_addchar(&b, LUAL_PACKPADBYTE); - break; - } - case Kstring: { /* strings with length count */ - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, size >= (int)sizeof(size_t) || - len < ((size_t)1 << (size * NB)), - arg, "string length does not fit in given size"); - packint(&b, (lua_Unsigned)len, h.islittle, size, 0); /* pack length */ - luaL_addlstring(&b, s, len); - totalsize += len; - break; - } - case Kzstr: { /* zero-terminated string */ - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, strlen(s) == len, arg, "string contains zeros"); - luaL_addlstring(&b, s, len); - luaL_addchar(&b, '\0'); /* add zero at the end */ - totalsize += len + 1; - break; - } - case Kpadding: luaL_addchar(&b, LUAL_PACKPADBYTE); /* FALLTHROUGH */ - case Kpaddalign: case Knop: - arg--; /* undo increment */ - break; - } - } - luaL_pushresult(&b); - return 1; -} - - -static int str_packsize (lua_State *L) { - Header h; - const char *fmt = luaL_checkstring(L, 1); /* format string */ - size_t totalsize = 0; /* accumulate total size of result */ - initheader(L, &h); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, totalsize, &fmt, &size, &ntoalign); - luaL_argcheck(L, opt != Kstring && opt != Kzstr, 1, - "variable-length format"); - size += ntoalign; /* total space used by option */ - luaL_argcheck(L, totalsize <= MAXSIZE - size, 1, - "format result too large"); - totalsize += size; - } - lua_pushinteger(L, (lua_Integer)totalsize); - return 1; -} - - -/* -** Unpack an integer with 'size' bytes and 'islittle' endianness. -** If size is smaller than the size of a Lua integer and integer -** is signed, must do sign extension (propagating the sign to the -** higher bits); if size is larger than the size of a Lua integer, -** it must check the unread bytes to see whether they do not cause an -** overflow. -*/ -static lua_Integer unpackint (lua_State *L, const char *str, - int islittle, int size, int issigned) { - lua_Unsigned res = 0; - int i; - int limit = (size <= SZINT) ? size : SZINT; - for (i = limit - 1; i >= 0; i--) { - res <<= NB; - res |= (lua_Unsigned)(unsigned char)str[islittle ? i : size - 1 - i]; - } - if (size < SZINT) { /* real size smaller than lua_Integer? */ - if (issigned) { /* needs sign extension? */ - lua_Unsigned mask = (lua_Unsigned)1 << (size*NB - 1); - res = ((res ^ mask) - mask); /* do sign extension */ - } - } - else if (size > SZINT) { /* must check unread bytes */ - int mask = (!issigned || (lua_Integer)res >= 0) ? 0 : MC; - for (i = limit; i < size; i++) { - if (l_unlikely((unsigned char)str[islittle ? i : size - 1 - i] != mask)) - luaL_error(L, "%d-byte integer does not fit into Lua Integer", size); - } - } - return (lua_Integer)res; -} - - -static int str_unpack (lua_State *L) { - Header h; - const char *fmt = luaL_checkstring(L, 1); - size_t ld; - const char *data = luaL_checklstring(L, 2, &ld); - size_t pos = posrelatI(luaL_optinteger(L, 3, 1), ld) - 1; - int n = 0; /* number of results */ - luaL_argcheck(L, pos <= ld, 3, "initial position out of string"); - initheader(L, &h); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, pos, &fmt, &size, &ntoalign); - luaL_argcheck(L, (size_t)ntoalign + size <= ld - pos, 2, - "data string too short"); - pos += ntoalign; /* skip alignment */ - /* stack space for item + next position */ - luaL_checkstack(L, 2, "too many results"); - n++; - switch (opt) { - case Kint: - case Kuint: { - lua_Integer res = unpackint(L, data + pos, h.islittle, size, - (opt == Kint)); - lua_pushinteger(L, res); - break; - } - case Kfloat: { - float f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, (lua_Number)f); - break; - } - case Knumber: { - lua_Number f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, f); - break; - } - case Kdouble: { - double f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, (lua_Number)f); - break; - } - case Kchar: { - lua_pushlstring(L, data + pos, size); - break; - } - case Kstring: { - size_t len = (size_t)unpackint(L, data + pos, h.islittle, size, 0); - luaL_argcheck(L, len <= ld - pos - size, 2, "data string too short"); - lua_pushlstring(L, data + pos + size, len); - pos += len; /* skip string */ - break; - } - case Kzstr: { - size_t len = strlen(data + pos); - luaL_argcheck(L, pos + len < ld, 2, - "unfinished string for format 'z'"); - lua_pushlstring(L, data + pos, len); - pos += len + 1; /* skip string plus final '\0' */ - break; - } - case Kpaddalign: case Kpadding: case Knop: - n--; /* undo increment */ - break; - } - pos += size; - } - lua_pushinteger(L, pos + 1); /* next position */ - return n + 1; -} - -/* }====================================================== */ - - -static const luaL_Reg strlib[] = { - {"byte", str_byte}, - {"char", str_char}, - {"dump", str_dump}, - {"find", str_find}, - {"format", str_format}, - {"gmatch", gmatch}, - {"gsub", str_gsub}, - {"len", str_len}, - {"lower", str_lower}, - {"match", str_match}, - {"rep", str_rep}, - {"reverse", str_reverse}, - {"sub", str_sub}, - {"upper", str_upper}, - {"pack", str_pack}, - {"packsize", str_packsize}, - {"unpack", str_unpack}, - {NULL, NULL} -}; - - -static void createmetatable (lua_State *L) { - /* table to be metatable for strings */ - luaL_newlibtable(L, stringmetamethods); - luaL_setfuncs(L, stringmetamethods, 0); - lua_pushliteral(L, ""); /* dummy string */ - lua_pushvalue(L, -2); /* copy table */ - lua_setmetatable(L, -2); /* set table as metatable for strings */ - lua_pop(L, 1); /* pop dummy string */ - lua_pushvalue(L, -2); /* get string library */ - lua_setfield(L, -2, "__index"); /* metatable.__index = string */ - lua_pop(L, 1); /* pop metatable */ -} - - -/* -** Open string library -*/ -LUAMOD_API int luaopen_string (lua_State *L) { - luaL_newlib(L, strlib); - createmetatable(L); - return 1; -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltable.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltable.c deleted file mode 100644 index ef19a5c..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltable.c +++ /dev/null @@ -1,1257 +0,0 @@ -/* -** $Id: ltable.c $ -** Lua tables (hash) -** See Copyright Notice in lua.h -*/ - -#define ltable_c -#define LUA_CORE - -#include "lprefix.h" - - -/* -** Implementation of tables (aka arrays, objects, or hash tables). -** Tables keep its elements in two parts: an array part and a hash part. -** Non-negative integer keys are all candidates to be kept in the array -** part. The actual size of the array is the largest 'n' such that -** more than half the slots between 1 and n are in use. -** Hash uses a mix of chained scatter table with Brent's variation. -** A main invariant of these tables is that, if an element is not -** in its main position (i.e. the 'original' position that its hash gives -** to it), then the colliding element is in its own main position. -** Hence even when the load factor reaches 100%, performance remains good. -*/ - -#include -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "lvm.h" - - -/* -** Only tables with hash parts larger than 2^LIMFORLAST has a 'lastfree' -** field that optimizes finding a free slot. That field is stored just -** before the array of nodes, in the same block. Smaller tables do a -** complete search when looking for a free slot. -*/ -#define LIMFORLAST 2 /* log2 of real limit */ - -/* -** The union 'Limbox' stores 'lastfree' and ensures that what follows it -** is properly aligned to store a Node. -*/ -typedef struct { Node *dummy; Node follows_pNode; } Limbox_aux; - -typedef union { - Node *lastfree; - char padding[offsetof(Limbox_aux, follows_pNode)]; -} Limbox; - -#define haslastfree(t) ((t)->lsizenode > LIMFORLAST) -#define getlastfree(t) ((cast(Limbox *, (t)->node) - 1)->lastfree) - - -/* -** MAXABITS is the largest integer such that 2^MAXABITS fits in an -** unsigned int. -*/ -#define MAXABITS cast_int(sizeof(int) * CHAR_BIT - 1) - - -/* -** MAXASIZEB is the maximum number of elements in the array part such -** that the size of the array fits in 'size_t'. -*/ -#define MAXASIZEB ((MAX_SIZET/sizeof(ArrayCell)) * NM) - - -/* -** MAXASIZE is the maximum size of the array part. It is the minimum -** between 2^MAXABITS and MAXASIZEB. -*/ -#define MAXASIZE \ - (((1u << MAXABITS) < MAXASIZEB) ? (1u << MAXABITS) : cast_uint(MAXASIZEB)) - -/* -** MAXHBITS is the largest integer such that 2^MAXHBITS fits in a -** signed int. -*/ -#define MAXHBITS (MAXABITS - 1) - - -/* -** MAXHSIZE is the maximum size of the hash part. It is the minimum -** between 2^MAXHBITS and the maximum size such that, measured in bytes, -** it fits in a 'size_t'. -*/ -#define MAXHSIZE luaM_limitN(1u << MAXHBITS, Node) - - -/* -** When the original hash value is good, hashing by a power of 2 -** avoids the cost of '%'. -*/ -#define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t)))) - -/* -** for other types, it is better to avoid modulo by power of 2, as -** they can have many 2 factors. -*/ -#define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1)))) - - -#define hashstr(t,str) hashpow2(t, (str)->hash) -#define hashboolean(t,p) hashpow2(t, p) - - -#define hashpointer(t,p) hashmod(t, point2uint(p)) - - -#define dummynode (&dummynode_) - -static const Node dummynode_ = { - {{NULL}, LUA_VEMPTY, /* value's value and type */ - LUA_VNIL, 0, {NULL}} /* key type, next, and key value */ -}; - - -static const TValue absentkey = {ABSTKEYCONSTANT}; - - -/* -** Hash for integers. To allow a good hash, use the remainder operator -** ('%'). If integer fits as a non-negative int, compute an int -** remainder, which is faster. Otherwise, use an unsigned-integer -** remainder, which uses all bits and ensures a non-negative result. -*/ -static Node *hashint (const Table *t, lua_Integer i) { - lua_Unsigned ui = l_castS2U(i); - if (ui <= cast_uint(INT_MAX)) - return hashmod(t, cast_int(ui)); - else - return hashmod(t, ui); -} - - -/* -** Hash for floating-point numbers. -** The main computation should be just -** n = frexp(n, &i); return (n * INT_MAX) + i -** but there are some numerical subtleties. -** In a two-complement representation, INT_MAX does not has an exact -** representation as a float, but INT_MIN does; because the absolute -** value of 'frexp' is smaller than 1 (unless 'n' is inf/NaN), the -** absolute value of the product 'frexp * -INT_MIN' is smaller or equal -** to INT_MAX. Next, the use of 'unsigned int' avoids overflows when -** adding 'i'; the use of '~u' (instead of '-u') avoids problems with -** INT_MIN. -*/ -#if !defined(l_hashfloat) -static int l_hashfloat (lua_Number n) { - int i; - lua_Integer ni; - n = l_mathop(frexp)(n, &i) * -cast_num(INT_MIN); - if (!lua_numbertointeger(n, &ni)) { /* is 'n' inf/-inf/NaN? */ - lua_assert(luai_numisnan(n) || l_mathop(fabs)(n) == cast_num(HUGE_VAL)); - return 0; - } - else { /* normal case */ - unsigned int u = cast_uint(i) + cast_uint(ni); - return cast_int(u <= cast_uint(INT_MAX) ? u : ~u); - } -} -#endif - - -/* -** returns the 'main' position of an element in a table (that is, -** the index of its hash value). -*/ -static Node *mainpositionTV (const Table *t, const TValue *key) { - switch (ttypetag(key)) { - case LUA_VNUMINT: { - lua_Integer i = ivalue(key); - return hashint(t, i); - } - case LUA_VNUMFLT: { - lua_Number n = fltvalue(key); - return hashmod(t, l_hashfloat(n)); - } - case LUA_VSHRSTR: { - TString *ts = tsvalue(key); - return hashstr(t, ts); - } - case LUA_VLNGSTR: { - TString *ts = tsvalue(key); - return hashpow2(t, luaS_hashlongstr(ts)); - } - case LUA_VFALSE: - return hashboolean(t, 0); - case LUA_VTRUE: - return hashboolean(t, 1); - case LUA_VLIGHTUSERDATA: { - void *p = pvalue(key); - return hashpointer(t, p); - } - case LUA_VLCF: { - lua_CFunction f = fvalue(key); - return hashpointer(t, f); - } - default: { - GCObject *o = gcvalue(key); - return hashpointer(t, o); - } - } -} - - -l_sinline Node *mainpositionfromnode (const Table *t, Node *nd) { - TValue key; - getnodekey(cast(lua_State *, NULL), &key, nd); - return mainpositionTV(t, &key); -} - - -/* -** Check whether key 'k1' is equal to the key in node 'n2'. This -** equality is raw, so there are no metamethods. Floats with integer -** values have been normalized, so integers cannot be equal to -** floats. It is assumed that 'eqshrstr' is simply pointer equality, so -** that short strings are handled in the default case. -** A true 'deadok' means to accept dead keys as equal to their original -** values. All dead keys are compared in the default case, by pointer -** identity. (Only collectable objects can produce dead keys.) Note that -** dead long strings are also compared by identity. -** Once a key is dead, its corresponding value may be collected, and -** then another value can be created with the same address. If this -** other value is given to 'next', 'equalkey' will signal a false -** positive. In a regular traversal, this situation should never happen, -** as all keys given to 'next' came from the table itself, and therefore -** could not have been collected. Outside a regular traversal, we -** have garbage in, garbage out. What is relevant is that this false -** positive does not break anything. (In particular, 'next' will return -** some other valid item on the table or nil.) -*/ -static int equalkey (const TValue *k1, const Node *n2, int deadok) { - if ((rawtt(k1) != keytt(n2)) && /* not the same variants? */ - !(deadok && keyisdead(n2) && iscollectable(k1))) - return 0; /* cannot be same key */ - switch (keytt(n2)) { - case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: - return 1; - case LUA_VNUMINT: - return (ivalue(k1) == keyival(n2)); - case LUA_VNUMFLT: - return luai_numeq(fltvalue(k1), fltvalueraw(keyval(n2))); - case LUA_VLIGHTUSERDATA: - return pvalue(k1) == pvalueraw(keyval(n2)); - case LUA_VLCF: - return fvalue(k1) == fvalueraw(keyval(n2)); - case ctb(LUA_VLNGSTR): - return luaS_eqlngstr(tsvalue(k1), keystrval(n2)); - default: - return gcvalue(k1) == gcvalueraw(keyval(n2)); - } -} - - -/* -** True if value of 'alimit' is equal to the real size of the array -** part of table 't'. (Otherwise, the array part must be larger than -** 'alimit'.) -*/ -#define limitequalsasize(t) (isrealasize(t) || ispow2((t)->alimit)) - - -/* -** Returns the real size of the 'array' array -*/ -LUAI_FUNC unsigned int luaH_realasize (const Table *t) { - if (limitequalsasize(t)) - return t->alimit; /* this is the size */ - else { - unsigned int size = t->alimit; - /* compute the smallest power of 2 not smaller than 'size' */ - size |= (size >> 1); - size |= (size >> 2); - size |= (size >> 4); - size |= (size >> 8); -#if (UINT_MAX >> 14) > 3 /* unsigned int has more than 16 bits */ - size |= (size >> 16); -#if (UINT_MAX >> 30) > 3 - size |= (size >> 32); /* unsigned int has more than 32 bits */ -#endif -#endif - size++; - lua_assert(ispow2(size) && size/2 < t->alimit && t->alimit < size); - return size; - } -} - - -/* -** Check whether real size of the array is a power of 2. -** (If it is not, 'alimit' cannot be changed to any other value -** without changing the real size.) -*/ -static int ispow2realasize (const Table *t) { - return (!isrealasize(t) || ispow2(t->alimit)); -} - - -static unsigned int setlimittosize (Table *t) { - t->alimit = luaH_realasize(t); - setrealasize(t); - return t->alimit; -} - - -#define limitasasize(t) check_exp(isrealasize(t), t->alimit) - - - -/* -** "Generic" get version. (Not that generic: not valid for integers, -** which may be in array part, nor for floats with integral values.) -** See explanation about 'deadok' in function 'equalkey'. -*/ -static const TValue *getgeneric (Table *t, const TValue *key, int deadok) { - Node *n = mainpositionTV(t, key); - for (;;) { /* check whether 'key' is somewhere in the chain */ - if (equalkey(key, n, deadok)) - return gval(n); /* that's it */ - else { - int nx = gnext(n); - if (nx == 0) - return &absentkey; /* not found */ - n += nx; - } - } -} - - -/* -** returns the index for 'k' if 'k' is an appropriate key to live in -** the array part of a table, 0 otherwise. -*/ -static unsigned int arrayindex (lua_Integer k) { - if (l_castS2U(k) - 1u < MAXASIZE) /* 'k' in [1, MAXASIZE]? */ - return cast_uint(k); /* 'key' is an appropriate array index */ - else - return 0; -} - - -/* -** returns the index of a 'key' for table traversals. First goes all -** elements in the array part, then elements in the hash part. The -** beginning of a traversal is signaled by 0. -*/ -static unsigned findindex (lua_State *L, Table *t, TValue *key, - unsigned asize) { - unsigned int i; - if (ttisnil(key)) return 0; /* first iteration */ - i = ttisinteger(key) ? arrayindex(ivalue(key)) : 0; - if (i - 1u < asize) /* is 'key' inside array part? */ - return i; /* yes; that's the index */ - else { - const TValue *n = getgeneric(t, key, 1); - if (l_unlikely(isabstkey(n))) - luaG_runerror(L, "invalid key to 'next'"); /* key not found */ - i = cast_int(nodefromval(n) - gnode(t, 0)); /* key index in hash table */ - /* hash elements are numbered after array ones */ - return (i + 1) + asize; - } -} - - -int luaH_next (lua_State *L, Table *t, StkId key) { - unsigned int asize = luaH_realasize(t); - unsigned int i = findindex(L, t, s2v(key), asize); /* find original key */ - for (; i < asize; i++) { /* try first array part */ - int tag = *getArrTag(t, i); - if (!tagisempty(tag)) { /* a non-empty entry? */ - setivalue(s2v(key), i + 1); - farr2val(t, i + 1, tag, s2v(key + 1)); - return 1; - } - } - for (i -= asize; cast_int(i) < sizenode(t); i++) { /* hash part */ - if (!isempty(gval(gnode(t, i)))) { /* a non-empty entry? */ - Node *n = gnode(t, i); - getnodekey(L, s2v(key), n); - setobj2s(L, key + 1, gval(n)); - return 1; - } - } - return 0; /* no more elements */ -} - - -static void freehash (lua_State *L, Table *t) { - if (!isdummy(t)) { - size_t bsize = sizenode(t) * sizeof(Node); /* 'node' size in bytes */ - char *arr = cast_charp(t->node); - if (haslastfree(t)) { - bsize += sizeof(Limbox); - arr -= sizeof(Limbox); - } - luaM_freearray(L, arr, bsize); - } -} - - -/* -** Check whether an integer key is in the array part. If 'alimit' is -** not the real size of the array, the key still can be in the array -** part. In this case, do the "Xmilia trick" to check whether 'key-1' -** is smaller than the real size. -** The trick works as follow: let 'p' be the integer such that -** '2^(p+1) >= alimit > 2^p', or '2^(p+1) > alimit-1 >= 2^p'. That is, -** 'p' is the highest 1-bit in 'alimit-1', and 2^(p+1) is the real size -** of the array. What we have to check becomes 'key-1 < 2^(p+1)'. We -** compute '(key-1) & ~(alimit-1)', which we call 'res'; it will have -** the 'p' bit cleared. (It may also clear other bits smaller than 'p', -** but no bit higher than 'p'.) If the key is outside the array, that -** is, 'key-1 >= 2^(p+1)', then 'res' will have some 1-bit higher than -** 'p', therefore it will be larger or equal to 'alimit', and the check -** will fail. If 'key-1 < 2^(p+1)', then 'res' has no 1-bit higher than -** 'p', and as the bit 'p' itself was cleared, 'res' will be smaller -** than 2^p, therefore smaller than 'alimit', and the check succeeds. -** As special cases, when 'alimit' is 0 the condition is trivially false, -** and when 'alimit' is 1 the condition simplifies to 'key-1 < alimit'. -** If key is 0 or negative, 'res' will have its higher bit on, so that -** it cannot be smaller than 'alimit'. -*/ -static int keyinarray (Table *t, lua_Integer key) { - lua_Unsigned alimit = t->alimit; - if (l_castS2U(key) - 1u < alimit) /* 'key' in [1, t->alimit]? */ - return 1; - else if (!isrealasize(t) && /* key still may be in the array part? */ - (((l_castS2U(key) - 1u) & ~(alimit - 1u)) < alimit)) { - t->alimit = cast_uint(key); /* probably '#t' is here now */ - return 1; - } - else - return 0; -} - - -/* -** {============================================================= -** Rehash -** ============================================================== -*/ - -/* -** Compute the optimal size for the array part of table 't'. 'nums' is a -** "count array" where 'nums[i]' is the number of integers in the table -** between 2^(i - 1) + 1 and 2^i. 'pna' enters with the total number of -** integer keys in the table and leaves with the number of keys that -** will go to the array part; return the optimal size. (The condition -** 'twotoi > 0' in the for loop stops the loop if 'twotoi' overflows.) -*/ -static unsigned computesizes (unsigned nums[], unsigned *pna) { - int i; - unsigned int twotoi; /* 2^i (candidate for optimal size) */ - unsigned int a = 0; /* number of elements smaller than 2^i */ - unsigned int na = 0; /* number of elements to go to array part */ - unsigned int optimal = 0; /* optimal size for array part */ - /* loop while keys can fill more than half of total size */ - for (i = 0, twotoi = 1; - twotoi > 0 && *pna > twotoi / 2; - i++, twotoi *= 2) { - a += nums[i]; - if (a > twotoi/2) { /* more than half elements present? */ - optimal = twotoi; /* optimal size (till now) */ - na = a; /* all elements up to 'optimal' will go to array part */ - } - } - lua_assert((optimal == 0 || optimal / 2 < na) && na <= optimal); - *pna = na; - return optimal; -} - - -static int countint (lua_Integer key, unsigned int *nums) { - unsigned int k = arrayindex(key); - if (k != 0) { /* is 'key' an appropriate array index? */ - nums[luaO_ceillog2(k)]++; /* count as such */ - return 1; - } - else - return 0; -} - - -l_sinline int arraykeyisempty (const Table *t, lua_Integer key) { - int tag = *getArrTag(t, key - 1); - return tagisempty(tag); -} - - -/* -** Count keys in array part of table 't': Fill 'nums[i]' with -** number of keys that will go into corresponding slice and return -** total number of non-nil keys. -*/ -static unsigned numusearray (const Table *t, unsigned *nums) { - int lg; - unsigned int ttlg; /* 2^lg */ - unsigned int ause = 0; /* summation of 'nums' */ - unsigned int i = 1; /* count to traverse all array keys */ - unsigned int asize = limitasasize(t); /* real array size */ - /* traverse each slice */ - for (lg = 0, ttlg = 1; lg <= MAXABITS; lg++, ttlg *= 2) { - unsigned int lc = 0; /* counter */ - unsigned int lim = ttlg; - if (lim > asize) { - lim = asize; /* adjust upper limit */ - if (i > lim) - break; /* no more elements to count */ - } - /* count elements in range (2^(lg - 1), 2^lg] */ - for (; i <= lim; i++) { - if (!arraykeyisempty(t, i)) - lc++; - } - nums[lg] += lc; - ause += lc; - } - return ause; -} - - -static int numusehash (const Table *t, unsigned *nums, unsigned *pna) { - int totaluse = 0; /* total number of elements */ - int ause = 0; /* elements added to 'nums' (can go to array part) */ - int i = sizenode(t); - while (i--) { - Node *n = &t->node[i]; - if (!isempty(gval(n))) { - if (keyisinteger(n)) - ause += countint(keyival(n), nums); - totaluse++; - } - } - *pna += ause; - return totaluse; -} - - -/* -** Convert an "abstract size" (number of slots in an array) to -** "concrete size" (number of bytes in the array). -** If the abstract size is not a multiple of NM, the last cell is -** incomplete, so we don't need to allocate memory for the whole cell. -** 'extra' computes how many values are not needed in that last cell. -** It will be zero when 'size' is a multiple of NM, and from there it -** increases as 'size' decreases, up to (NM - 1). -*/ -static size_t concretesize (unsigned int size) { - unsigned int numcells = (size + NM - 1) / NM; /* (size / NM) rounded up */ - unsigned int extra = NM - 1 - ((size + NM - 1) % NM); - return numcells * sizeof(ArrayCell) - extra * sizeof(Value); -} - - -static ArrayCell *resizearray (lua_State *L , Table *t, - unsigned oldasize, - unsigned newasize) { - size_t oldasizeb = concretesize(oldasize); - size_t newasizeb = concretesize(newasize); - void *a = luaM_reallocvector(L, t->array, oldasizeb, newasizeb, lu_byte); - return cast(ArrayCell*, a); -} - - -/* -** Creates an array for the hash part of a table with the given -** size, or reuses the dummy node if size is zero. -** The computation for size overflow is in two steps: the first -** comparison ensures that the shift in the second one does not -** overflow. -*/ -static void setnodevector (lua_State *L, Table *t, unsigned size) { - if (size == 0) { /* no elements to hash part? */ - t->node = cast(Node *, dummynode); /* use common 'dummynode' */ - t->lsizenode = 0; - setdummy(t); /* signal that it is using dummy node */ - } - else { - int i; - int lsize = luaO_ceillog2(size); - if (lsize > MAXHBITS || (1u << lsize) > MAXHSIZE) - luaG_runerror(L, "table overflow"); - size = twoto(lsize); - if (lsize <= LIMFORLAST) /* no 'lastfree' field? */ - t->node = luaM_newvector(L, size, Node); - else { - size_t bsize = size * sizeof(Node) + sizeof(Limbox); - char *node = luaM_newblock(L, bsize); - t->node = cast(Node *, node + sizeof(Limbox)); - getlastfree(t) = gnode(t, size); /* all positions are free */ - } - t->lsizenode = cast_byte(lsize); - setnodummy(t); - for (i = 0; i < cast_int(size); i++) { - Node *n = gnode(t, i); - gnext(n) = 0; - setnilkey(n); - setempty(gval(n)); - } - } -} - - -/* -** (Re)insert all elements from the hash part of 'ot' into table 't'. -*/ -static void reinsert (lua_State *L, Table *ot, Table *t) { - int j; - int size = sizenode(ot); - for (j = 0; j < size; j++) { - Node *old = gnode(ot, j); - if (!isempty(gval(old))) { - /* doesn't need barrier/invalidate cache, as entry was - already present in the table */ - TValue k; - getnodekey(L, &k, old); - luaH_set(L, t, &k, gval(old)); - } - } -} - - -/* -** Exchange the hash part of 't1' and 't2'. (In 'flags', only the -** dummy bit must be exchanged: The 'isrealasize' is not related -** to the hash part, and the metamethod bits do not change during -** a resize, so the "real" table can keep their values.) -*/ -static void exchangehashpart (Table *t1, Table *t2) { - lu_byte lsizenode = t1->lsizenode; - Node *node = t1->node; - int bitdummy1 = t1->flags & BITDUMMY; - t1->lsizenode = t2->lsizenode; - t1->node = t2->node; - t1->flags = (t1->flags & NOTBITDUMMY) | (t2->flags & BITDUMMY); - t2->lsizenode = lsizenode; - t2->node = node; - t2->flags = (t2->flags & NOTBITDUMMY) | bitdummy1; -} - - -/* -** Re-insert into the new hash part of a table the elements from the -** vanishing slice of the array part. -*/ -static void reinsertOldSlice (lua_State *L, Table *t, unsigned oldasize, - unsigned newasize) { - unsigned i; - t->alimit = newasize; /* pretend array has new size... */ - for (i = newasize; i < oldasize; i++) { /* traverse vanishing slice */ - int tag = *getArrTag(t, i); - if (!tagisempty(tag)) { /* a non-empty entry? */ - TValue aux; - farr2val(t, i + 1, tag, &aux); /* copy entry into 'aux' */ - luaH_setint(L, t, i + 1, &aux); /* re-insert it into the table */ - } - } - t->alimit = oldasize; /* restore current size... */ -} - - -/* -** Clear new slice of the array. -*/ -static void clearNewSlice (Table *t, unsigned oldasize, unsigned newasize) { - for (; oldasize < newasize; oldasize++) - *getArrTag(t, oldasize) = LUA_VEMPTY; -} - - -/* -** Resize table 't' for the new given sizes. Both allocations (for -** the hash part and for the array part) can fail, which creates some -** subtleties. If the first allocation, for the hash part, fails, an -** error is raised and that is it. Otherwise, it copies the elements from -** the shrinking part of the array (if it is shrinking) into the new -** hash. Then it reallocates the array part. If that fails, the table -** is in its original state; the function frees the new hash part and then -** raises the allocation error. Otherwise, it sets the new hash part -** into the table, initializes the new part of the array (if any) with -** nils and reinserts the elements of the old hash back into the new -** parts of the table. -*/ -void luaH_resize (lua_State *L, Table *t, unsigned newasize, - unsigned nhsize) { - Table newt; /* to keep the new hash part */ - unsigned int oldasize = setlimittosize(t); - ArrayCell *newarray; - if (newasize > MAXASIZE) - luaG_runerror(L, "table overflow"); - /* create new hash part with appropriate size into 'newt' */ - newt.flags = 0; - setnodevector(L, &newt, nhsize); - if (newasize < oldasize) { /* will array shrink? */ - /* re-insert into the new hash the elements from vanishing slice */ - exchangehashpart(t, &newt); /* pretend table has new hash */ - reinsertOldSlice(L, t, oldasize, newasize); - exchangehashpart(t, &newt); /* restore old hash (in case of errors) */ - } - /* allocate new array */ - newarray = resizearray(L, t, oldasize, newasize); - if (l_unlikely(newarray == NULL && newasize > 0)) { /* allocation failed? */ - freehash(L, &newt); /* release new hash part */ - luaM_error(L); /* raise error (with array unchanged) */ - } - /* allocation ok; initialize new part of the array */ - exchangehashpart(t, &newt); /* 't' has the new hash ('newt' has the old) */ - t->array = newarray; /* set new array part */ - t->alimit = newasize; - clearNewSlice(t, oldasize, newasize); - /* re-insert elements from old hash part into new parts */ - reinsert(L, &newt, t); /* 'newt' now has the old hash */ - freehash(L, &newt); /* free old hash part */ -} - - -void luaH_resizearray (lua_State *L, Table *t, unsigned int nasize) { - int nsize = allocsizenode(t); - luaH_resize(L, t, nasize, nsize); -} - -/* -** nums[i] = number of keys 'k' where 2^(i - 1) < k <= 2^i -*/ -static void rehash (lua_State *L, Table *t, const TValue *ek) { - unsigned int asize; /* optimal size for array part */ - unsigned int na; /* number of keys in the array part */ - unsigned int nums[MAXABITS + 1]; - int i; - int totaluse; - for (i = 0; i <= MAXABITS; i++) nums[i] = 0; /* reset counts */ - setlimittosize(t); - na = numusearray(t, nums); /* count keys in array part */ - totaluse = na; /* all those keys are integer keys */ - totaluse += numusehash(t, nums, &na); /* count keys in hash part */ - /* count extra key */ - if (ttisinteger(ek)) - na += countint(ivalue(ek), nums); - totaluse++; - /* compute new size for array part */ - asize = computesizes(nums, &na); - /* resize the table to new computed sizes */ - luaH_resize(L, t, asize, totaluse - na); -} - - - -/* -** }============================================================= -*/ - - -Table *luaH_new (lua_State *L) { - GCObject *o = luaC_newobj(L, LUA_VTABLE, sizeof(Table)); - Table *t = gco2t(o); - t->metatable = NULL; - t->flags = cast_byte(maskflags); /* table has no metamethod fields */ - t->array = NULL; - t->alimit = 0; - setnodevector(L, t, 0); - return t; -} - - -/* -** Frees a table. The assert ensures the correctness of 'concretesize', -** checking its result against the address of the last element in the -** array part of the table, computed abstractly. -*/ -void luaH_free (lua_State *L, Table *t) { - unsigned int realsize = luaH_realasize(t); - size_t sizeb = concretesize(realsize); - lua_assert((sizeb == 0 && realsize == 0) || - cast_charp(t->array) + sizeb - sizeof(Value) == - cast_charp(getArrVal(t, realsize - 1))); - freehash(L, t); - luaM_freemem(L, t->array, sizeb); - luaM_free(L, t); -} - - -static Node *getfreepos (Table *t) { - if (haslastfree(t)) { /* does it have 'lastfree' information? */ - /* look for a spot before 'lastfree', updating 'lastfree' */ - while (getlastfree(t) > t->node) { - Node *free = --getlastfree(t); - if (keyisnil(free)) - return free; - } - } - else { /* no 'lastfree' information */ - if (!isdummy(t)) { - int i = sizenode(t); - while (i--) { /* do a linear search */ - Node *free = gnode(t, i); - if (keyisnil(free)) - return free; - } - } - } - return NULL; /* could not find a free place */ -} - - - -/* -** Inserts a new key into a hash table; first, check whether key's main -** position is free. If not, check whether colliding node is in its main -** position or not: if it is not, move colliding node to an empty place -** and put new key in its main position; otherwise (colliding node is in -** its main position), new key goes to an empty position. -*/ -static void luaH_newkey (lua_State *L, Table *t, const TValue *key, - TValue *value) { - Node *mp; - TValue aux; - if (l_unlikely(ttisnil(key))) - luaG_runerror(L, "table index is nil"); - else if (ttisfloat(key)) { - lua_Number f = fltvalue(key); - lua_Integer k; - if (luaV_flttointeger(f, &k, F2Ieq)) { /* does key fit in an integer? */ - setivalue(&aux, k); - key = &aux; /* insert it as an integer */ - } - else if (l_unlikely(luai_numisnan(f))) - luaG_runerror(L, "table index is NaN"); - } - if (ttisnil(value)) - return; /* do not insert nil values */ - mp = mainpositionTV(t, key); - if (!isempty(gval(mp)) || isdummy(t)) { /* main position is taken? */ - Node *othern; - Node *f = getfreepos(t); /* get a free place */ - if (f == NULL) { /* cannot find a free place? */ - rehash(L, t, key); /* grow table */ - /* whatever called 'newkey' takes care of TM cache */ - luaH_set(L, t, key, value); /* insert key into grown table */ - return; - } - lua_assert(!isdummy(t)); - othern = mainpositionfromnode(t, mp); - if (othern != mp) { /* is colliding node out of its main position? */ - /* yes; move colliding node into free position */ - while (othern + gnext(othern) != mp) /* find previous */ - othern += gnext(othern); - gnext(othern) = cast_int(f - othern); /* rechain to point to 'f' */ - *f = *mp; /* copy colliding node into free pos. (mp->next also goes) */ - if (gnext(mp) != 0) { - gnext(f) += cast_int(mp - f); /* correct 'next' */ - gnext(mp) = 0; /* now 'mp' is free */ - } - setempty(gval(mp)); - } - else { /* colliding node is in its own main position */ - /* new node will go into free position */ - if (gnext(mp) != 0) - gnext(f) = cast_int((mp + gnext(mp)) - f); /* chain new position */ - else lua_assert(gnext(f) == 0); - gnext(mp) = cast_int(f - mp); - mp = f; - } - } - setnodekey(L, mp, key); - luaC_barrierback(L, obj2gco(t), key); - lua_assert(isempty(gval(mp))); - setobj2t(L, gval(mp), value); -} - - -static const TValue *getintfromhash (Table *t, lua_Integer key) { - Node *n = hashint(t, key); - lua_assert(l_castS2U(key) - 1u >= luaH_realasize(t)); - for (;;) { /* check whether 'key' is somewhere in the chain */ - if (keyisinteger(n) && keyival(n) == key) - return gval(n); /* that's it */ - else { - int nx = gnext(n); - if (nx == 0) break; - n += nx; - } - } - return &absentkey; -} - - -static int hashkeyisempty (Table *t, lua_Integer key) { - const TValue *val = getintfromhash(t, key); - return isempty(val); -} - - -static int finishnodeget (const TValue *val, TValue *res) { - if (!ttisnil(val)) { - setobj(((lua_State*)NULL), res, val); - } - return ttypetag(val); -} - - -int luaH_getint (Table *t, lua_Integer key, TValue *res) { - if (keyinarray(t, key)) { - int tag = *getArrTag(t, key - 1); - if (!tagisempty(tag)) - farr2val(t, key, tag, res); - return tag; - } - else - return finishnodeget(getintfromhash(t, key), res); -} - - -/* -** search function for short strings -*/ -const TValue *luaH_Hgetshortstr (Table *t, TString *key) { - Node *n = hashstr(t, key); - lua_assert(key->tt == LUA_VSHRSTR); - for (;;) { /* check whether 'key' is somewhere in the chain */ - if (keyisshrstr(n) && eqshrstr(keystrval(n), key)) - return gval(n); /* that's it */ - else { - int nx = gnext(n); - if (nx == 0) - return &absentkey; /* not found */ - n += nx; - } - } -} - - -int luaH_getshortstr (Table *t, TString *key, TValue *res) { - return finishnodeget(luaH_Hgetshortstr(t, key), res); -} - - -static const TValue *Hgetstr (Table *t, TString *key) { - if (key->tt == LUA_VSHRSTR) - return luaH_Hgetshortstr(t, key); - else { /* for long strings, use generic case */ - TValue ko; - setsvalue(cast(lua_State *, NULL), &ko, key); - return getgeneric(t, &ko, 0); - } -} - - -int luaH_getstr (Table *t, TString *key, TValue *res) { - return finishnodeget(Hgetstr(t, key), res); -} - - -TString *luaH_getstrkey (Table *t, TString *key) { - const TValue *o = Hgetstr(t, key); - if (!isabstkey(o)) /* string already present? */ - return keystrval(nodefromval(o)); /* get saved copy */ - else - return NULL; -} - - -/* -** main search function -*/ -int luaH_get (Table *t, const TValue *key, TValue *res) { - const TValue *slot; - switch (ttypetag(key)) { - case LUA_VSHRSTR: - slot = luaH_Hgetshortstr(t, tsvalue(key)); - break; - case LUA_VNUMINT: - return luaH_getint(t, ivalue(key), res); - case LUA_VNIL: - slot = &absentkey; - break; - case LUA_VNUMFLT: { - lua_Integer k; - if (luaV_flttointeger(fltvalue(key), &k, F2Ieq)) /* integral index? */ - return luaH_getint(t, k, res); /* use specialized version */ - /* else... */ - } /* FALLTHROUGH */ - default: - slot = getgeneric(t, key, 0); - break; - } - return finishnodeget(slot, res); -} - - -static int finishnodeset (Table *t, const TValue *slot, TValue *val) { - if (!ttisnil(slot)) { - setobj(((lua_State*)NULL), cast(TValue*, slot), val); - return HOK; /* success */ - } - else if (isabstkey(slot)) - return HNOTFOUND; /* no slot with that key */ - else /* return node encoded */ - return cast_int((cast(Node*, slot) - t->node)) + HFIRSTNODE; -} - - -static int rawfinishnodeset (const TValue *slot, TValue *val) { - if (isabstkey(slot)) - return 0; /* no slot with that key */ - else { - setobj(((lua_State*)NULL), cast(TValue*, slot), val); - return 1; /* success */ - } -} - - -int luaH_psetint (Table *t, lua_Integer key, TValue *val) { - if (keyinarray(t, key)) { - lu_byte *tag = getArrTag(t, key - 1); - if (!tagisempty(*tag) || checknoTM(t->metatable, TM_NEWINDEX)) { - fval2arr(t, key, tag, val); - return HOK; /* success */ - } - else - return ~cast_int(key); /* empty slot in the array part */ - } - else - return finishnodeset(t, getintfromhash(t, key), val); -} - - -int luaH_psetshortstr (Table *t, TString *key, TValue *val) { - return finishnodeset(t, luaH_Hgetshortstr(t, key), val); -} - - -int luaH_psetstr (Table *t, TString *key, TValue *val) { - return finishnodeset(t, Hgetstr(t, key), val); -} - - -int luaH_pset (Table *t, const TValue *key, TValue *val) { - switch (ttypetag(key)) { - case LUA_VSHRSTR: return luaH_psetshortstr(t, tsvalue(key), val); - case LUA_VNUMINT: return luaH_psetint(t, ivalue(key), val); - case LUA_VNIL: return HNOTFOUND; - case LUA_VNUMFLT: { - lua_Integer k; - if (luaV_flttointeger(fltvalue(key), &k, F2Ieq)) /* integral index? */ - return luaH_psetint(t, k, val); /* use specialized version */ - /* else... */ - } /* FALLTHROUGH */ - default: - return finishnodeset(t, getgeneric(t, key, 0), val); - } -} - -/* -** Finish a raw "set table" operation, where 'slot' is where the value -** should have been (the result of a previous "get table"). -** Beware: when using this function you probably need to check a GC -** barrier and invalidate the TM cache. -*/ - - -void luaH_finishset (lua_State *L, Table *t, const TValue *key, - TValue *value, int hres) { - lua_assert(hres != HOK); - if (hres == HNOTFOUND) { - luaH_newkey(L, t, key, value); - } - else if (hres > 0) { /* regular Node? */ - setobj2t(L, gval(gnode(t, hres - HFIRSTNODE)), value); - } - else { /* array entry */ - hres = ~hres; /* real index */ - obj2arr(t, hres, value); - } -} - - -/* -** beware: when using this function you probably need to check a GC -** barrier and invalidate the TM cache. -*/ -void luaH_set (lua_State *L, Table *t, const TValue *key, TValue *value) { - int hres = luaH_pset(t, key, value); - if (hres != HOK) - luaH_finishset(L, t, key, value, hres); -} - - -/* -** Ditto for a GC barrier. (No need to invalidate the TM cache, as -** integers cannot be keys to metamethods.) -*/ -void luaH_setint (lua_State *L, Table *t, lua_Integer key, TValue *value) { - if (keyinarray(t, key)) - obj2arr(t, key, value); - else { - int ok = rawfinishnodeset(getintfromhash(t, key), value); - if (!ok) { - TValue k; - setivalue(&k, key); - luaH_newkey(L, t, &k, value); - } - } -} - - -/* -** Try to find a boundary in the hash part of table 't'. From the -** caller, we know that 'j' is zero or present and that 'j + 1' is -** present. We want to find a larger key that is absent from the -** table, so that we can do a binary search between the two keys to -** find a boundary. We keep doubling 'j' until we get an absent index. -** If the doubling would overflow, we try LUA_MAXINTEGER. If it is -** absent, we are ready for the binary search. ('j', being max integer, -** is larger or equal to 'i', but it cannot be equal because it is -** absent while 'i' is present; so 'j > i'.) Otherwise, 'j' is a -** boundary. ('j + 1' cannot be a present integer key because it is -** not a valid integer in Lua.) -*/ -static lua_Unsigned hash_search (Table *t, lua_Unsigned j) { - lua_Unsigned i; - if (j == 0) j++; /* the caller ensures 'j + 1' is present */ - do { - i = j; /* 'i' is a present index */ - if (j <= l_castS2U(LUA_MAXINTEGER) / 2) - j *= 2; - else { - j = LUA_MAXINTEGER; - if (hashkeyisempty(t, j)) /* t[j] not present? */ - break; /* 'j' now is an absent index */ - else /* weird case */ - return j; /* well, max integer is a boundary... */ - } - } while (!hashkeyisempty(t, j)); /* repeat until an absent t[j] */ - /* i < j && t[i] present && t[j] absent */ - while (j - i > 1u) { /* do a binary search between them */ - lua_Unsigned m = (i + j) / 2; - if (hashkeyisempty(t, m)) j = m; - else i = m; - } - return i; -} - - -static unsigned int binsearch (Table *array, unsigned int i, unsigned int j) { - while (j - i > 1u) { /* binary search */ - unsigned int m = (i + j) / 2; - if (arraykeyisempty(array, m)) j = m; - else i = m; - } - return i; -} - - -/* -** Try to find a boundary in table 't'. (A 'boundary' is an integer index -** such that t[i] is present and t[i+1] is absent, or 0 if t[1] is absent -** and 'maxinteger' if t[maxinteger] is present.) -** (In the next explanation, we use Lua indices, that is, with base 1. -** The code itself uses base 0 when indexing the array part of the table.) -** The code starts with 'limit = t->alimit', a position in the array -** part that may be a boundary. -** -** (1) If 't[limit]' is empty, there must be a boundary before it. -** As a common case (e.g., after 't[#t]=nil'), check whether 'limit-1' -** is present. If so, it is a boundary. Otherwise, do a binary search -** between 0 and limit to find a boundary. In both cases, try to -** use this boundary as the new 'alimit', as a hint for the next call. -** -** (2) If 't[limit]' is not empty and the array has more elements -** after 'limit', try to find a boundary there. Again, try first -** the special case (which should be quite frequent) where 'limit+1' -** is empty, so that 'limit' is a boundary. Otherwise, check the -** last element of the array part. If it is empty, there must be a -** boundary between the old limit (present) and the last element -** (absent), which is found with a binary search. (This boundary always -** can be a new limit.) -** -** (3) The last case is when there are no elements in the array part -** (limit == 0) or its last element (the new limit) is present. -** In this case, must check the hash part. If there is no hash part -** or 'limit+1' is absent, 'limit' is a boundary. Otherwise, call -** 'hash_search' to find a boundary in the hash part of the table. -** (In those cases, the boundary is not inside the array part, and -** therefore cannot be used as a new limit.) -*/ -lua_Unsigned luaH_getn (Table *t) { - unsigned int limit = t->alimit; - if (limit > 0 && arraykeyisempty(t, limit)) { /* (1)? */ - /* there must be a boundary before 'limit' */ - if (limit >= 2 && !arraykeyisempty(t, limit - 1)) { - /* 'limit - 1' is a boundary; can it be a new limit? */ - if (ispow2realasize(t) && !ispow2(limit - 1)) { - t->alimit = limit - 1; - setnorealasize(t); /* now 'alimit' is not the real size */ - } - return limit - 1; - } - else { /* must search for a boundary in [0, limit] */ - unsigned int boundary = binsearch(t, 0, limit); - /* can this boundary represent the real size of the array? */ - if (ispow2realasize(t) && boundary > luaH_realasize(t) / 2) { - t->alimit = boundary; /* use it as the new limit */ - setnorealasize(t); - } - return boundary; - } - } - /* 'limit' is zero or present in table */ - if (!limitequalsasize(t)) { /* (2)? */ - /* 'limit' > 0 and array has more elements after 'limit' */ - if (arraykeyisempty(t, limit + 1)) /* 'limit + 1' is empty? */ - return limit; /* this is the boundary */ - /* else, try last element in the array */ - limit = luaH_realasize(t); - if (arraykeyisempty(t, limit)) { /* empty? */ - /* there must be a boundary in the array after old limit, - and it must be a valid new limit */ - unsigned int boundary = binsearch(t, t->alimit, limit); - t->alimit = boundary; - return boundary; - } - /* else, new limit is present in the table; check the hash part */ - } - /* (3) 'limit' is the last element and either is zero or present in table */ - lua_assert(limit == luaH_realasize(t) && - (limit == 0 || !arraykeyisempty(t, limit))); - if (isdummy(t) || hashkeyisempty(t, cast(lua_Integer, limit + 1))) - return limit; /* 'limit + 1' is absent */ - else /* 'limit + 1' is also present */ - return hash_search(t, limit); -} - - - -#if defined(LUA_DEBUG) - -/* export these functions for the test library */ - -Node *luaH_mainposition (const Table *t, const TValue *key) { - return mainpositionTV(t, key); -} - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltable.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltable.h deleted file mode 100644 index 4734bd5..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltable.h +++ /dev/null @@ -1,168 +0,0 @@ -/* -** $Id: ltable.h $ -** Lua tables (hash) -** See Copyright Notice in lua.h -*/ - -#ifndef ltable_h -#define ltable_h - -#include "lobject.h" - - -#define gnode(t,i) (&(t)->node[i]) -#define gval(n) (&(n)->i_val) -#define gnext(n) ((n)->u.next) - - -/* -** Clear all bits of fast-access metamethods, which means that the table -** may have any of these metamethods. (First access that fails after the -** clearing will set the bit again.) -*/ -#define invalidateTMcache(t) ((t)->flags &= ~maskflags) - - -/* -** Bit BITDUMMY set in 'flags' means the table is using the dummy node -** for its hash part. -*/ - -#define BITDUMMY (1 << 6) -#define NOTBITDUMMY cast_byte(~BITDUMMY) -#define isdummy(t) ((t)->flags & BITDUMMY) - -#define setnodummy(t) ((t)->flags &= NOTBITDUMMY) -#define setdummy(t) ((t)->flags |= BITDUMMY) - - - -/* allocated size for hash nodes */ -#define allocsizenode(t) (isdummy(t) ? 0 : sizenode(t)) - - -/* returns the Node, given the value of a table entry */ -#define nodefromval(v) cast(Node *, (v)) - - - -#define luaH_fastgeti(t,k,res,tag) \ - { Table *h = t; lua_Unsigned u = l_castS2U(k); \ - if ((u - 1u < h->alimit)) { \ - tag = *getArrTag(h,(u)-1u); \ - if (!tagisempty(tag)) { farr2val(h, u, tag, res); }} \ - else { tag = luaH_getint(h, u, res); }} - - -#define luaH_fastseti(t,k,val,hres) \ - { Table *h = t; lua_Unsigned u = l_castS2U(k); \ - if ((u - 1u < h->alimit)) { \ - lu_byte *tag = getArrTag(h,(u)-1u); \ - if (tagisempty(*tag)) hres = ~cast_int(u); \ - else { fval2arr(h, u, tag, val); hres = HOK; }} \ - else { hres = luaH_psetint(h, u, val); }} - - -/* results from pset */ -#define HOK 0 -#define HNOTFOUND 1 -#define HNOTATABLE 2 -#define HFIRSTNODE 3 - -/* -** 'luaH_get*' operations set 'res', unless the value is absent, and -** return the tag of the result, -** The 'luaH_pset*' (pre-set) operations set the given value and return -** HOK, unless the original value is absent. In that case, if the key -** is really absent, they return HNOTFOUND. Otherwise, if there is a -** slot with that key but with no value, 'luaH_pset*' return an encoding -** of where the key is (usually called 'hres'). (pset cannot set that -** value because there might be a metamethod.) If the slot is in the -** hash part, the encoding is (HFIRSTNODE + hash index); if the slot is -** in the array part, the encoding is (~array index), a negative value. -** The value HNOTATABLE is used by the fast macros to signal that the -** value being indexed is not a table. -*/ - - -/* -** The array part of a table is represented by an array of cells. -** Each cell is composed of NM tags followed by NM values, so that -** no space is wasted in padding. The last cell may be incomplete, -** that is, it may have fewer than NM values. -*/ -#define NM cast_uint(sizeof(Value)) - -struct ArrayCell { - lu_byte tag[NM]; - Value value[NM]; -}; - - -/* Computes the address of the tag for the abstract index 'k' */ -#define getArrTag(t,k) (&(t)->array[(k)/NM].tag[(k)%NM]) - -/* Computes the address of the value for the abstract index 'k' */ -#define getArrVal(t,k) (&(t)->array[(k)/NM].value[(k)%NM]) - - -/* -** Move TValues to/from arrays, using Lua indices -*/ -#define arr2obj(h,k,val) \ - ((val)->tt_ = *getArrTag(h,(k)-1u), (val)->value_ = *getArrVal(h,(k)-1u)) - -#define obj2arr(h,k,val) \ - (*getArrTag(h,(k)-1u) = (val)->tt_, *getArrVal(h,(k)-1u) = (val)->value_) - - -/* -** Often, we need to check the tag of a value before moving it. These -** macros also move TValues to/from arrays, but receive the precomputed -** tag value or address as an extra argument. -*/ -#define farr2val(h,k,tag,res) \ - ((res)->tt_ = tag, (res)->value_ = *getArrVal(h,(k)-1u)) - -#define fval2arr(h,k,tag,val) \ - (*tag = (val)->tt_, *getArrVal(h,(k)-1u) = (val)->value_) - - -LUAI_FUNC int luaH_get (Table *t, const TValue *key, TValue *res); -LUAI_FUNC int luaH_getshortstr (Table *t, TString *key, TValue *res); -LUAI_FUNC int luaH_getstr (Table *t, TString *key, TValue *res); -LUAI_FUNC int luaH_getint (Table *t, lua_Integer key, TValue *res); - -/* Special get for metamethods */ -LUAI_FUNC const TValue *luaH_Hgetshortstr (Table *t, TString *key); - -LUAI_FUNC TString *luaH_getstrkey (Table *t, TString *key); - -LUAI_FUNC int luaH_psetint (Table *t, lua_Integer key, TValue *val); -LUAI_FUNC int luaH_psetshortstr (Table *t, TString *key, TValue *val); -LUAI_FUNC int luaH_psetstr (Table *t, TString *key, TValue *val); -LUAI_FUNC int luaH_pset (Table *t, const TValue *key, TValue *val); - -LUAI_FUNC void luaH_setint (lua_State *L, Table *t, lua_Integer key, - TValue *value); -LUAI_FUNC void luaH_set (lua_State *L, Table *t, const TValue *key, - TValue *value); - -LUAI_FUNC void luaH_finishset (lua_State *L, Table *t, const TValue *key, - TValue *value, int hres); -LUAI_FUNC Table *luaH_new (lua_State *L); -LUAI_FUNC void luaH_resize (lua_State *L, Table *t, unsigned nasize, - unsigned nhsize); -LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, unsigned nasize); -LUAI_FUNC void luaH_free (lua_State *L, Table *t); -LUAI_FUNC int luaH_next (lua_State *L, Table *t, StkId key); -LUAI_FUNC lua_Unsigned luaH_getn (Table *t); -LUAI_FUNC unsigned luaH_realasize (const Table *t); - - -#if defined(LUA_DEBUG) -LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key); -#endif - - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltablib.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltablib.c deleted file mode 100644 index a402dae..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltablib.c +++ /dev/null @@ -1,417 +0,0 @@ -/* -** $Id: ltablib.c $ -** Library for Table Manipulation -** See Copyright Notice in lua.h -*/ - -#define ltablib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** Operations that an object must define to mimic a table -** (some functions only need some of them) -*/ -#define TAB_R 1 /* read */ -#define TAB_W 2 /* write */ -#define TAB_L 4 /* length */ -#define TAB_RW (TAB_R | TAB_W) /* read/write */ - - -#define aux_getn(L,n,w) (checktab(L, n, (w) | TAB_L), luaL_len(L, n)) - - -static int checkfield (lua_State *L, const char *key, int n) { - lua_pushstring(L, key); - return (lua_rawget(L, -n) != LUA_TNIL); -} - - -/* -** Check that 'arg' either is a table or can behave like one (that is, -** has a metatable with the required metamethods) -*/ -static void checktab (lua_State *L, int arg, int what) { - if (lua_type(L, arg) != LUA_TTABLE) { /* is it not a table? */ - int n = 1; /* number of elements to pop */ - if (lua_getmetatable(L, arg) && /* must have metatable */ - (!(what & TAB_R) || checkfield(L, "__index", ++n)) && - (!(what & TAB_W) || checkfield(L, "__newindex", ++n)) && - (!(what & TAB_L) || checkfield(L, "__len", ++n))) { - lua_pop(L, n); /* pop metatable and tested metamethods */ - } - else - luaL_checktype(L, arg, LUA_TTABLE); /* force an error */ - } -} - - -static int tcreate (lua_State *L) { - lua_Unsigned sizeseq = (lua_Unsigned)luaL_checkinteger(L, 1); - lua_Unsigned sizerest = (lua_Unsigned)luaL_optinteger(L, 2, 0); - luaL_argcheck(L, sizeseq <= UINT_MAX, 1, "out of range"); - luaL_argcheck(L, sizerest <= UINT_MAX, 2, "out of range"); - lua_createtable(L, (unsigned)sizeseq, (unsigned)sizerest); - return 1; -} - - -static int tinsert (lua_State *L) { - lua_Integer pos; /* where to insert new element */ - lua_Integer e = aux_getn(L, 1, TAB_RW); - e = luaL_intop(+, e, 1); /* first empty element */ - switch (lua_gettop(L)) { - case 2: { /* called with only 2 arguments */ - pos = e; /* insert new element at the end */ - break; - } - case 3: { - lua_Integer i; - pos = luaL_checkinteger(L, 2); /* 2nd argument is the position */ - /* check whether 'pos' is in [1, e] */ - luaL_argcheck(L, (lua_Unsigned)pos - 1u < (lua_Unsigned)e, 2, - "position out of bounds"); - for (i = e; i > pos; i--) { /* move up elements */ - lua_geti(L, 1, i - 1); - lua_seti(L, 1, i); /* t[i] = t[i - 1] */ - } - break; - } - default: { - return luaL_error(L, "wrong number of arguments to 'insert'"); - } - } - lua_seti(L, 1, pos); /* t[pos] = v */ - return 0; -} - - -static int tremove (lua_State *L) { - lua_Integer size = aux_getn(L, 1, TAB_RW); - lua_Integer pos = luaL_optinteger(L, 2, size); - if (pos != size) /* validate 'pos' if given */ - /* check whether 'pos' is in [1, size + 1] */ - luaL_argcheck(L, (lua_Unsigned)pos - 1u <= (lua_Unsigned)size, 2, - "position out of bounds"); - lua_geti(L, 1, pos); /* result = t[pos] */ - for ( ; pos < size; pos++) { - lua_geti(L, 1, pos + 1); - lua_seti(L, 1, pos); /* t[pos] = t[pos + 1] */ - } - lua_pushnil(L); - lua_seti(L, 1, pos); /* remove entry t[pos] */ - return 1; -} - - -/* -** Copy elements (1[f], ..., 1[e]) into (tt[t], tt[t+1], ...). Whenever -** possible, copy in increasing order, which is better for rehashing. -** "possible" means destination after original range, or smaller -** than origin, or copying to another table. -*/ -static int tmove (lua_State *L) { - lua_Integer f = luaL_checkinteger(L, 2); - lua_Integer e = luaL_checkinteger(L, 3); - lua_Integer t = luaL_checkinteger(L, 4); - int tt = !lua_isnoneornil(L, 5) ? 5 : 1; /* destination table */ - checktab(L, 1, TAB_R); - checktab(L, tt, TAB_W); - if (e >= f) { /* otherwise, nothing to move */ - lua_Integer n, i; - luaL_argcheck(L, f > 0 || e < LUA_MAXINTEGER + f, 3, - "too many elements to move"); - n = e - f + 1; /* number of elements to move */ - luaL_argcheck(L, t <= LUA_MAXINTEGER - n + 1, 4, - "destination wrap around"); - if (t > e || t <= f || (tt != 1 && !lua_compare(L, 1, tt, LUA_OPEQ))) { - for (i = 0; i < n; i++) { - lua_geti(L, 1, f + i); - lua_seti(L, tt, t + i); - } - } - else { - for (i = n - 1; i >= 0; i--) { - lua_geti(L, 1, f + i); - lua_seti(L, tt, t + i); - } - } - } - lua_pushvalue(L, tt); /* return destination table */ - return 1; -} - - -static void addfield (lua_State *L, luaL_Buffer *b, lua_Integer i) { - lua_geti(L, 1, i); - if (l_unlikely(!lua_isstring(L, -1))) - luaL_error(L, "invalid value (%s) at index %I in table for 'concat'", - luaL_typename(L, -1), (LUAI_UACINT)i); - luaL_addvalue(b); -} - - -static int tconcat (lua_State *L) { - luaL_Buffer b; - lua_Integer last = aux_getn(L, 1, TAB_R); - size_t lsep; - const char *sep = luaL_optlstring(L, 2, "", &lsep); - lua_Integer i = luaL_optinteger(L, 3, 1); - last = luaL_optinteger(L, 4, last); - luaL_buffinit(L, &b); - for (; i < last; i++) { - addfield(L, &b, i); - luaL_addlstring(&b, sep, lsep); - } - if (i == last) /* add last value (if interval was not empty) */ - addfield(L, &b, i); - luaL_pushresult(&b); - return 1; -} - - -/* -** {====================================================== -** Pack/unpack -** ======================================================= -*/ - -static int tpack (lua_State *L) { - int i; - int n = lua_gettop(L); /* number of elements to pack */ - lua_createtable(L, n, 1); /* create result table */ - lua_insert(L, 1); /* put it at index 1 */ - for (i = n; i >= 1; i--) /* assign elements */ - lua_seti(L, 1, i); - lua_pushinteger(L, n); - lua_setfield(L, 1, "n"); /* t.n = number of elements */ - return 1; /* return table */ -} - - -static int tunpack (lua_State *L) { - lua_Unsigned n; - lua_Integer i = luaL_optinteger(L, 2, 1); - lua_Integer e = luaL_opt(L, luaL_checkinteger, 3, luaL_len(L, 1)); - if (i > e) return 0; /* empty range */ - n = (lua_Unsigned)e - i; /* number of elements minus 1 (avoid overflows) */ - if (l_unlikely(n >= (unsigned int)INT_MAX || - !lua_checkstack(L, (int)(++n)))) - return luaL_error(L, "too many results to unpack"); - for (; i < e; i++) { /* push arg[i..e - 1] (to avoid overflows) */ - lua_geti(L, 1, i); - } - lua_geti(L, 1, e); /* push last element */ - return (int)n; -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Quicksort -** (based on 'Algorithms in MODULA-3', Robert Sedgewick; -** Addison-Wesley, 1993.) -** ======================================================= -*/ - - -/* type for array indices */ -typedef unsigned int IdxT; - - -/* -** Produce a "random" 'unsigned int' to randomize pivot choice. This -** macro is used only when 'sort' detects a big imbalance in the result -** of a partition. (If you don't want/need this "randomness", ~0 is a -** good choice.) -*/ -#if !defined(l_randomizePivot) -#define l_randomizePivot(L) luaL_makeseed(L) -#endif /* } */ - - -/* arrays larger than 'RANLIMIT' may use randomized pivots */ -#define RANLIMIT 100u - - -static void set2 (lua_State *L, IdxT i, IdxT j) { - lua_seti(L, 1, i); - lua_seti(L, 1, j); -} - - -/* -** Return true iff value at stack index 'a' is less than the value at -** index 'b' (according to the order of the sort). -*/ -static int sort_comp (lua_State *L, int a, int b) { - if (lua_isnil(L, 2)) /* no function? */ - return lua_compare(L, a, b, LUA_OPLT); /* a < b */ - else { /* function */ - int res; - lua_pushvalue(L, 2); /* push function */ - lua_pushvalue(L, a-1); /* -1 to compensate function */ - lua_pushvalue(L, b-2); /* -2 to compensate function and 'a' */ - lua_call(L, 2, 1); /* call function */ - res = lua_toboolean(L, -1); /* get result */ - lua_pop(L, 1); /* pop result */ - return res; - } -} - - -/* -** Does the partition: Pivot P is at the top of the stack. -** precondition: a[lo] <= P == a[up-1] <= a[up], -** so it only needs to do the partition from lo + 1 to up - 2. -** Pos-condition: a[lo .. i - 1] <= a[i] == P <= a[i + 1 .. up] -** returns 'i'. -*/ -static IdxT partition (lua_State *L, IdxT lo, IdxT up) { - IdxT i = lo; /* will be incremented before first use */ - IdxT j = up - 1; /* will be decremented before first use */ - /* loop invariant: a[lo .. i] <= P <= a[j .. up] */ - for (;;) { - /* next loop: repeat ++i while a[i] < P */ - while ((void)lua_geti(L, 1, ++i), sort_comp(L, -1, -2)) { - if (l_unlikely(i == up - 1)) /* a[i] < P but a[up - 1] == P ?? */ - luaL_error(L, "invalid order function for sorting"); - lua_pop(L, 1); /* remove a[i] */ - } - /* after the loop, a[i] >= P and a[lo .. i - 1] < P */ - /* next loop: repeat --j while P < a[j] */ - while ((void)lua_geti(L, 1, --j), sort_comp(L, -3, -1)) { - if (l_unlikely(j < i)) /* j < i but a[j] > P ?? */ - luaL_error(L, "invalid order function for sorting"); - lua_pop(L, 1); /* remove a[j] */ - } - /* after the loop, a[j] <= P and a[j + 1 .. up] >= P */ - if (j < i) { /* no elements out of place? */ - /* a[lo .. i - 1] <= P <= a[j + 1 .. i .. up] */ - lua_pop(L, 1); /* pop a[j] */ - /* swap pivot (a[up - 1]) with a[i] to satisfy pos-condition */ - set2(L, up - 1, i); - return i; - } - /* otherwise, swap a[i] - a[j] to restore invariant and repeat */ - set2(L, i, j); - } -} - - -/* -** Choose an element in the middle (2nd-3th quarters) of [lo,up] -** "randomized" by 'rnd' -*/ -static IdxT choosePivot (IdxT lo, IdxT up, unsigned int rnd) { - IdxT r4 = (up - lo) / 4; /* range/4 */ - IdxT p = (rnd ^ lo ^ up) % (r4 * 2) + (lo + r4); - lua_assert(lo + r4 <= p && p <= up - r4); - return p; -} - - -/* -** Quicksort algorithm (recursive function) -*/ -static void auxsort (lua_State *L, IdxT lo, IdxT up, unsigned rnd) { - while (lo < up) { /* loop for tail recursion */ - IdxT p; /* Pivot index */ - IdxT n; /* to be used later */ - /* sort elements 'lo', 'p', and 'up' */ - lua_geti(L, 1, lo); - lua_geti(L, 1, up); - if (sort_comp(L, -1, -2)) /* a[up] < a[lo]? */ - set2(L, lo, up); /* swap a[lo] - a[up] */ - else - lua_pop(L, 2); /* remove both values */ - if (up - lo == 1) /* only 2 elements? */ - return; /* already sorted */ - if (up - lo < RANLIMIT || rnd == 0) /* small interval or no randomize? */ - p = (lo + up)/2; /* middle element is a good pivot */ - else /* for larger intervals, it is worth a random pivot */ - p = choosePivot(lo, up, rnd); - lua_geti(L, 1, p); - lua_geti(L, 1, lo); - if (sort_comp(L, -2, -1)) /* a[p] < a[lo]? */ - set2(L, p, lo); /* swap a[p] - a[lo] */ - else { - lua_pop(L, 1); /* remove a[lo] */ - lua_geti(L, 1, up); - if (sort_comp(L, -1, -2)) /* a[up] < a[p]? */ - set2(L, p, up); /* swap a[up] - a[p] */ - else - lua_pop(L, 2); - } - if (up - lo == 2) /* only 3 elements? */ - return; /* already sorted */ - lua_geti(L, 1, p); /* get middle element (Pivot) */ - lua_pushvalue(L, -1); /* push Pivot */ - lua_geti(L, 1, up - 1); /* push a[up - 1] */ - set2(L, p, up - 1); /* swap Pivot (a[p]) with a[up - 1] */ - p = partition(L, lo, up); - /* a[lo .. p - 1] <= a[p] == P <= a[p + 1 .. up] */ - if (p - lo < up - p) { /* lower interval is smaller? */ - auxsort(L, lo, p - 1, rnd); /* call recursively for lower interval */ - n = p - lo; /* size of smaller interval */ - lo = p + 1; /* tail call for [p + 1 .. up] (upper interval) */ - } - else { - auxsort(L, p + 1, up, rnd); /* call recursively for upper interval */ - n = up - p; /* size of smaller interval */ - up = p - 1; /* tail call for [lo .. p - 1] (lower interval) */ - } - if ((up - lo) / 128 > n) /* partition too imbalanced? */ - rnd = l_randomizePivot(L); /* try a new randomization */ - } /* tail call auxsort(L, lo, up, rnd) */ -} - - -static int sort (lua_State *L) { - lua_Integer n = aux_getn(L, 1, TAB_RW); - if (n > 1) { /* non-trivial interval? */ - luaL_argcheck(L, n < INT_MAX, 1, "array too big"); - if (!lua_isnoneornil(L, 2)) /* is there a 2nd argument? */ - luaL_checktype(L, 2, LUA_TFUNCTION); /* must be a function */ - lua_settop(L, 2); /* make sure there are two arguments */ - auxsort(L, 1, (IdxT)n, 0); - } - return 0; -} - -/* }====================================================== */ - - -static const luaL_Reg tab_funcs[] = { - {"concat", tconcat}, - {"create", tcreate}, - {"insert", tinsert}, - {"pack", tpack}, - {"unpack", tunpack}, - {"remove", tremove}, - {"move", tmove}, - {"sort", sort}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_table (lua_State *L) { - luaL_newlib(L, tab_funcs); - return 1; -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltests.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltests.c deleted file mode 100644 index 4780673..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltests.c +++ /dev/null @@ -1,2067 +0,0 @@ -/* -** $Id: ltests.c $ -** Internal Module for Debugging of the Lua Implementation -** See Copyright Notice in lua.h -*/ - -#define ltests_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "lauxlib.h" -#include "lcode.h" -#include "lctype.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lmem.h" -#include "lopcodes.h" -#include "lopnames.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "lualib.h" - - - -/* -** The whole module only makes sense with LUA_DEBUG on -*/ -#if defined(LUA_DEBUG) - - -void *l_Trick = 0; - - -#define obj_at(L,k) s2v(L->ci->func.p + (k)) - - -static int runC (lua_State *L, lua_State *L1, const char *pc); - - -static void setnameval (lua_State *L, const char *name, int val) { - lua_pushinteger(L, val); - lua_setfield(L, -2, name); -} - - -static void pushobject (lua_State *L, const TValue *o) { - setobj2s(L, L->top.p, o); - api_incr_top(L); -} - - -static void badexit (const char *fmt, const char *s1, const char *s2) { - fprintf(stderr, fmt, s1); - if (s2) - fprintf(stderr, "extra info: %s\n", s2); - /* avoid assertion failures when exiting */ - l_memcontrol.numblocks = l_memcontrol.total = 0; - exit(EXIT_FAILURE); -} - - -static int tpanic (lua_State *L) { - const char *msg = (lua_type(L, -1) == LUA_TSTRING) - ? lua_tostring(L, -1) - : "error object is not a string"; - return (badexit("PANIC: unprotected error in call to Lua API (%s)\n", - msg, NULL), - 0); /* do not return to Lua */ -} - - -/* -** Warning function for tests. First, it concatenates all parts of -** a warning in buffer 'buff'. Then, it has three modes: -** - 0.normal: messages starting with '#' are shown on standard output; -** - other messages abort the tests (they represent real warning -** conditions; the standard tests should not generate these conditions -** unexpectedly); -** - 1.allow: all messages are shown; -** - 2.store: all warnings go to the global '_WARN'; -*/ -static void warnf (void *ud, const char *msg, int tocont) { - lua_State *L = cast(lua_State *, ud); - static char buff[200] = ""; /* should be enough for tests... */ - static int onoff = 0; - static int mode = 0; /* start in normal mode */ - static int lasttocont = 0; - if (!lasttocont && !tocont && *msg == '@') { /* control message? */ - if (buff[0] != '\0') - badexit("Control warning during warning: %s\naborting...\n", msg, buff); - if (strcmp(msg, "@off") == 0) - onoff = 0; - else if (strcmp(msg, "@on") == 0) - onoff = 1; - else if (strcmp(msg, "@normal") == 0) - mode = 0; - else if (strcmp(msg, "@allow") == 0) - mode = 1; - else if (strcmp(msg, "@store") == 0) - mode = 2; - else - badexit("Invalid control warning in test mode: %s\naborting...\n", - msg, NULL); - return; - } - lasttocont = tocont; - if (strlen(msg) >= sizeof(buff) - strlen(buff)) - badexit("warnf-buffer overflow (%s)\n", msg, buff); - strcat(buff, msg); /* add new message to current warning */ - if (!tocont) { /* message finished? */ - lua_unlock(L); - luaL_checkstack(L, 1, "warn stack space"); - lua_getglobal(L, "_WARN"); - if (!lua_toboolean(L, -1)) - lua_pop(L, 1); /* ok, no previous unexpected warning */ - else { - badexit("Unhandled warning in store mode: %s\naborting...\n", - lua_tostring(L, -1), buff); - } - lua_lock(L); - switch (mode) { - case 0: { /* normal */ - if (buff[0] != '#' && onoff) /* unexpected warning? */ - badexit("Unexpected warning in test mode: %s\naborting...\n", - buff, NULL); - } /* FALLTHROUGH */ - case 1: { /* allow */ - if (onoff) - fprintf(stderr, "Lua warning: %s\n", buff); /* print warning */ - break; - } - case 2: { /* store */ - lua_unlock(L); - luaL_checkstack(L, 1, "warn stack space"); - lua_pushstring(L, buff); - lua_setglobal(L, "_WARN"); /* assign message to global '_WARN' */ - lua_lock(L); - break; - } - } - buff[0] = '\0'; /* prepare buffer for next warning */ - } -} - - -/* -** {====================================================================== -** Controlled version for realloc. -** ======================================================================= -*/ - -#define MARK 0x55 /* 01010101 (a nice pattern) */ - -typedef union Header { - LUAI_MAXALIGN; - struct { - size_t size; - int type; - } d; -} Header; - - -#if !defined(EXTERNMEMCHECK) - -/* full memory check */ -#define MARKSIZE 16 /* size of marks after each block */ -#define fillmem(mem,size) memset(mem, -MARK, size) - -#else - -/* external memory check: don't do it twice */ -#define MARKSIZE 0 -#define fillmem(mem,size) /* empty */ - -#endif - - -Memcontrol l_memcontrol = - {0, 0UL, 0UL, 0UL, 0UL, (~0UL), - {0UL, 0UL, 0UL, 0UL, 0UL, 0UL, 0UL, 0UL, 0UL}}; - - -static void freeblock (Memcontrol *mc, Header *block) { - if (block) { - size_t size = block->d.size; - int i; - for (i = 0; i < MARKSIZE; i++) /* check marks after block */ - lua_assert(*(cast_charp(block + 1) + size + i) == MARK); - mc->objcount[block->d.type]--; - fillmem(block, sizeof(Header) + size + MARKSIZE); /* erase block */ - free(block); /* actually free block */ - mc->numblocks--; /* update counts */ - mc->total -= size; - } -} - - -void *debug_realloc (void *ud, void *b, size_t oldsize, size_t size) { - Memcontrol *mc = cast(Memcontrol *, ud); - Header *block = cast(Header *, b); - int type; - if (mc->memlimit == 0) { /* first time? */ - char *limit = getenv("MEMLIMIT"); /* initialize memory limit */ - mc->memlimit = limit ? strtoul(limit, NULL, 10) : ULONG_MAX; - } - if (block == NULL) { - type = (oldsize < LUA_NUMTYPES) ? oldsize : 0; - oldsize = 0; - } - else { - block--; /* go to real header */ - type = block->d.type; - lua_assert(oldsize == block->d.size); - } - if (size == 0) { - freeblock(mc, block); - return NULL; - } - if (mc->failnext) { - mc->failnext = 0; - return NULL; /* fake a single memory allocation error */ - } - if (mc->countlimit != ~0UL && size != oldsize) { /* count limit in use? */ - if (mc->countlimit == 0) - return NULL; /* fake a memory allocation error */ - mc->countlimit--; - } - if (size > oldsize && mc->total+size-oldsize > mc->memlimit) - return NULL; /* fake a memory allocation error */ - else { - Header *newblock; - int i; - size_t commonsize = (oldsize < size) ? oldsize : size; - size_t realsize = sizeof(Header) + size + MARKSIZE; - if (realsize < size) return NULL; /* arithmetic overflow! */ - newblock = cast(Header *, malloc(realsize)); /* alloc a new block */ - if (newblock == NULL) - return NULL; /* really out of memory? */ - if (block) { - memcpy(newblock + 1, block + 1, commonsize); /* copy old contents */ - freeblock(mc, block); /* erase (and check) old copy */ - } - /* initialize new part of the block with something weird */ - fillmem(cast_charp(newblock + 1) + commonsize, size - commonsize); - /* initialize marks after block */ - for (i = 0; i < MARKSIZE; i++) - *(cast_charp(newblock + 1) + size + i) = MARK; - newblock->d.size = size; - newblock->d.type = type; - mc->total += size; - if (mc->total > mc->maxmem) - mc->maxmem = mc->total; - mc->numblocks++; - mc->objcount[type]++; - return newblock + 1; - } -} - - -/* }====================================================================== */ - - - -/* -** {===================================================================== -** Functions to check memory consistency. -** Most of these checks are done through asserts, so this code does -** not make sense with asserts off. For this reason, it uses 'assert' -** directly, instead of 'lua_assert'. -** ====================================================================== -*/ - -#include - -/* -** Check GC invariants. For incremental mode, a black object cannot -** point to a white one. For generational mode, really old objects -** cannot point to young objects. Both old1 and touched2 objects -** cannot point to new objects (but can point to survivals). -** (Threads and open upvalues, despite being marked "really old", -** continue to be visited in all collections, and therefore can point to -** new objects. They, and only they, are old but gray.) -*/ -static int testobjref1 (global_State *g, GCObject *f, GCObject *t) { - if (isdead(g,t)) return 0; - if (issweepphase(g)) - return 1; /* no invariants */ - else if (g->gckind != KGC_GENMINOR) - return !(isblack(f) && iswhite(t)); /* basic incremental invariant */ - else { /* generational mode */ - if ((getage(f) == G_OLD && isblack(f)) && !isold(t)) - return 0; - if ((getage(f) == G_OLD1 || getage(f) == G_TOUCHED2) && - getage(t) == G_NEW) - return 0; - return 1; - } -} - - -static void printobj (global_State *g, GCObject *o) { - printf("||%s(%p)-%c%c(%02X)||", - ttypename(novariant(o->tt)), (void *)o, - isdead(g,o) ? 'd' : isblack(o) ? 'b' : iswhite(o) ? 'w' : 'g', - "ns01oTt"[getage(o)], o->marked); - if (o->tt == LUA_VSHRSTR || o->tt == LUA_VLNGSTR) - printf(" '%s'", getstr(gco2ts(o))); -} - - -void lua_printobj (lua_State *L, struct GCObject *o) { - printobj(G(L), o); -} - -static int testobjref (global_State *g, GCObject *f, GCObject *t) { - int r1 = testobjref1(g, f, t); - if (!r1) { - printf("%d(%02X) - ", g->gcstate, g->currentwhite); - printobj(g, f); - printf(" -> "); - printobj(g, t); - printf("\n"); - } - return r1; -} - - -static void checkobjref (global_State *g, GCObject *f, GCObject *t) { - assert(testobjref(g, f, t)); -} - - -/* -** Version where 't' can be NULL. In that case, it should not apply the -** macro 'obj2gco' over the object. ('t' may have several types, so this -** definition must be a macro.) Most checks need this version, because -** the check may run while an object is still being created. -*/ -#define checkobjrefN(g,f,t) { if (t) checkobjref(g,f,obj2gco(t)); } - - -static void checkvalref (global_State *g, GCObject *f, const TValue *t) { - assert(!iscollectable(t) || (righttt(t) && testobjref(g, f, gcvalue(t)))); -} - - -static void checktable (global_State *g, Table *h) { - unsigned int i; - unsigned int asize = luaH_realasize(h); - Node *n, *limit = gnode(h, sizenode(h)); - GCObject *hgc = obj2gco(h); - checkobjrefN(g, hgc, h->metatable); - for (i = 0; i < asize; i++) { - TValue aux; - arr2obj(h, i + 1, &aux); - checkvalref(g, hgc, &aux); - } - for (n = gnode(h, 0); n < limit; n++) { - if (!isempty(gval(n))) { - TValue k; - getnodekey(g->mainthread, &k, n); - assert(!keyisnil(n)); - checkvalref(g, hgc, &k); - checkvalref(g, hgc, gval(n)); - } - } -} - - -static void checkudata (global_State *g, Udata *u) { - int i; - GCObject *hgc = obj2gco(u); - checkobjrefN(g, hgc, u->metatable); - for (i = 0; i < u->nuvalue; i++) - checkvalref(g, hgc, &u->uv[i].uv); -} - - -static void checkproto (global_State *g, Proto *f) { - int i; - GCObject *fgc = obj2gco(f); - checkobjrefN(g, fgc, f->source); - for (i=0; isizek; i++) { - if (iscollectable(f->k + i)) - checkobjref(g, fgc, gcvalue(f->k + i)); - } - for (i=0; isizeupvalues; i++) - checkobjrefN(g, fgc, f->upvalues[i].name); - for (i=0; isizep; i++) - checkobjrefN(g, fgc, f->p[i]); - for (i=0; isizelocvars; i++) - checkobjrefN(g, fgc, f->locvars[i].varname); -} - - -static void checkCclosure (global_State *g, CClosure *cl) { - GCObject *clgc = obj2gco(cl); - int i; - for (i = 0; i < cl->nupvalues; i++) - checkvalref(g, clgc, &cl->upvalue[i]); -} - - -static void checkLclosure (global_State *g, LClosure *cl) { - GCObject *clgc = obj2gco(cl); - int i; - checkobjrefN(g, clgc, cl->p); - for (i=0; inupvalues; i++) { - UpVal *uv = cl->upvals[i]; - if (uv) { - checkobjrefN(g, clgc, uv); - if (!upisopen(uv)) - checkvalref(g, obj2gco(uv), uv->v.p); - } - } -} - - -static int lua_checkpc (CallInfo *ci) { - if (!isLua(ci)) return 1; - else { - StkId f = ci->func.p; - Proto *p = clLvalue(s2v(f))->p; - return p->code <= ci->u.l.savedpc && - ci->u.l.savedpc <= p->code + p->sizecode; - } -} - - -static void checkstack (global_State *g, lua_State *L1) { - StkId o; - CallInfo *ci; - UpVal *uv; - assert(!isdead(g, L1)); - if (L1->stack.p == NULL) { /* incomplete thread? */ - assert(L1->openupval == NULL && L1->ci == NULL); - return; - } - for (uv = L1->openupval; uv != NULL; uv = uv->u.open.next) - assert(upisopen(uv)); /* must be open */ - assert(L1->top.p <= L1->stack_last.p); - assert(L1->tbclist.p <= L1->top.p); - for (ci = L1->ci; ci != NULL; ci = ci->previous) { - assert(ci->top.p <= L1->stack_last.p); - assert(lua_checkpc(ci)); - } - for (o = L1->stack.p; o < L1->stack_last.p; o++) - checkliveness(L1, s2v(o)); /* entire stack must have valid values */ -} - - -static void checkrefs (global_State *g, GCObject *o) { - switch (o->tt) { - case LUA_VUSERDATA: { - checkudata(g, gco2u(o)); - break; - } - case LUA_VUPVAL: { - checkvalref(g, o, gco2upv(o)->v.p); - break; - } - case LUA_VTABLE: { - checktable(g, gco2t(o)); - break; - } - case LUA_VTHREAD: { - checkstack(g, gco2th(o)); - break; - } - case LUA_VLCL: { - checkLclosure(g, gco2lcl(o)); - break; - } - case LUA_VCCL: { - checkCclosure(g, gco2ccl(o)); - break; - } - case LUA_VPROTO: { - checkproto(g, gco2p(o)); - break; - } - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - assert(!isgray(o)); /* strings are never gray */ - break; - } - default: assert(0); - } -} - - -/* -** Check consistency of an object: -** - Dead objects can only happen in the 'allgc' list during a sweep -** phase (controlled by the caller through 'maybedead'). -** - During pause, all objects must be white. -** - In generational mode: -** * objects must be old enough for their lists ('listage'). -** * old objects cannot be white. -** * old objects must be black, except for 'touched1', 'old0', -** threads, and open upvalues. -** * 'touched1' objects must be gray. -*/ -static void checkobject (global_State *g, GCObject *o, int maybedead, - int listage) { - if (isdead(g, o)) - assert(maybedead); - else { - assert(g->gcstate != GCSpause || iswhite(o)); - if (g->gckind == KGC_GENMINOR) { /* generational mode? */ - assert(getage(o) >= listage); - if (isold(o)) { - assert(!iswhite(o)); - assert(isblack(o) || - getage(o) == G_TOUCHED1 || - getage(o) == G_OLD0 || - o->tt == LUA_VTHREAD || - (o->tt == LUA_VUPVAL && upisopen(gco2upv(o)))); - } - assert(getage(o) != G_TOUCHED1 || isgray(o)); - } - checkrefs(g, o); - } -} - - -static l_obj checkgraylist (global_State *g, GCObject *o) { - int total = 0; /* count number of elements in the list */ - cast_void(g); /* better to keep it if we need to print an object */ - while (o) { - assert(!!isgray(o) ^ (getage(o) == G_TOUCHED2)); - assert(!testbit(o->marked, TESTBIT)); - if (keepinvariant(g)) - l_setbit(o->marked, TESTBIT); /* mark that object is in a gray list */ - total++; - switch (o->tt) { - case LUA_VTABLE: o = gco2t(o)->gclist; break; - case LUA_VLCL: o = gco2lcl(o)->gclist; break; - case LUA_VCCL: o = gco2ccl(o)->gclist; break; - case LUA_VTHREAD: o = gco2th(o)->gclist; break; - case LUA_VPROTO: o = gco2p(o)->gclist; break; - case LUA_VUSERDATA: - assert(gco2u(o)->nuvalue > 0); - o = gco2u(o)->gclist; - break; - default: assert(0); /* other objects cannot be in a gray list */ - } - } - return total; -} - - -/* -** Check objects in gray lists. -*/ -static l_obj checkgrays (global_State *g) { - int total = 0; /* count number of elements in all lists */ - if (!keepinvariant(g)) return total; - total += checkgraylist(g, g->gray); - total += checkgraylist(g, g->grayagain); - total += checkgraylist(g, g->weak); - total += checkgraylist(g, g->allweak); - total += checkgraylist(g, g->ephemeron); - return total; -} - - -/* -** Check whether 'o' should be in a gray list. If so, increment -** 'count' and check its TESTBIT. (It must have been previously set by -** 'checkgraylist'.) -*/ -static void incifingray (global_State *g, GCObject *o, l_obj *count) { - if (!keepinvariant(g)) - return; /* gray lists not being kept in these phases */ - if (o->tt == LUA_VUPVAL) { - /* only open upvalues can be gray */ - assert(!isgray(o) || upisopen(gco2upv(o))); - return; /* upvalues are never in gray lists */ - } - /* these are the ones that must be in gray lists */ - if (isgray(o) || getage(o) == G_TOUCHED2) { - (*count)++; - assert(testbit(o->marked, TESTBIT)); - resetbit(o->marked, TESTBIT); /* prepare for next cycle */ - } -} - - -static l_obj checklist (global_State *g, int maybedead, int tof, - GCObject *newl, GCObject *survival, GCObject *old, GCObject *reallyold) { - GCObject *o; - l_obj total = 0; /* number of object that should be in gray lists */ - for (o = newl; o != survival; o = o->next) { - checkobject(g, o, maybedead, G_NEW); - incifingray(g, o, &total); - assert(!tof == !tofinalize(o)); - } - for (o = survival; o != old; o = o->next) { - checkobject(g, o, 0, G_SURVIVAL); - incifingray(g, o, &total); - assert(!tof == !tofinalize(o)); - } - for (o = old; o != reallyold; o = o->next) { - checkobject(g, o, 0, G_OLD1); - incifingray(g, o, &total); - assert(!tof == !tofinalize(o)); - } - for (o = reallyold; o != NULL; o = o->next) { - checkobject(g, o, 0, G_OLD); - incifingray(g, o, &total); - assert(!tof == !tofinalize(o)); - } - return total; -} - - -int lua_checkmemory (lua_State *L) { - global_State *g = G(L); - GCObject *o; - int maybedead; - l_obj totalin; /* total of objects that are in gray lists */ - l_obj totalshould; /* total of objects that should be in gray lists */ - if (keepinvariant(g)) { - assert(!iswhite(g->mainthread)); - assert(!iswhite(gcvalue(&g->l_registry))); - } - assert(!isdead(g, gcvalue(&g->l_registry))); - assert(g->sweepgc == NULL || issweepphase(g)); - totalin = checkgrays(g); - - /* check 'fixedgc' list */ - for (o = g->fixedgc; o != NULL; o = o->next) { - assert(o->tt == LUA_VSHRSTR && isgray(o) && getage(o) == G_OLD); - } - - /* check 'allgc' list */ - maybedead = (GCSatomic < g->gcstate && g->gcstate <= GCSswpallgc); - totalshould = checklist(g, maybedead, 0, g->allgc, - g->survival, g->old1, g->reallyold); - - /* check 'finobj' list */ - totalshould += checklist(g, 0, 1, g->finobj, - g->finobjsur, g->finobjold1, g->finobjrold); - - /* check 'tobefnz' list */ - for (o = g->tobefnz; o != NULL; o = o->next) { - checkobject(g, o, 0, G_NEW); - incifingray(g, o, &totalshould); - assert(tofinalize(o)); - assert(o->tt == LUA_VUSERDATA || o->tt == LUA_VTABLE); - } - if (keepinvariant(g)) - assert(totalin == totalshould); - return 0; -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Disassembler -** ======================================================= -*/ - - -static char *buildop (Proto *p, int pc, char *buff) { - char *obuff = buff; - Instruction i = p->code[pc]; - OpCode o = GET_OPCODE(i); - const char *name = opnames[o]; - int line = luaG_getfuncline(p, pc); - int lineinfo = (p->lineinfo != NULL) ? p->lineinfo[pc] : 0; - if (lineinfo == ABSLINEINFO) - buff += sprintf(buff, "(__"); - else - buff += sprintf(buff, "(%2d", lineinfo); - buff += sprintf(buff, " - %4d) %4d - ", line, pc); - switch (getOpMode(o)) { - case iABC: - sprintf(buff, "%-12s%4d %4d %4d%s", name, - GETARG_A(i), GETARG_B(i), GETARG_C(i), - GETARG_k(i) ? " (k)" : ""); - break; - case iABx: - sprintf(buff, "%-12s%4d %4d", name, GETARG_A(i), GETARG_Bx(i)); - break; - case iAsBx: - sprintf(buff, "%-12s%4d %4d", name, GETARG_A(i), GETARG_sBx(i)); - break; - case iAx: - sprintf(buff, "%-12s%4d", name, GETARG_Ax(i)); - break; - case isJ: - sprintf(buff, "%-12s%4d", name, GETARG_sJ(i)); - break; - } - return obuff; -} - - -#if 0 -void luaI_printcode (Proto *pt, int size) { - int pc; - for (pc=0; pcmaxstacksize); - setnameval(L, "numparams", p->numparams); - for (pc=0; pcsizecode; pc++) { - char buff[100]; - lua_pushinteger(L, pc+1); - lua_pushstring(L, buildop(p, pc, buff)); - lua_settable(L, -3); - } - return 1; -} - - -static int printcode (lua_State *L) { - int pc; - Proto *p; - luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - p = getproto(obj_at(L, 1)); - printf("maxstack: %d\n", p->maxstacksize); - printf("numparams: %d\n", p->numparams); - for (pc=0; pcsizecode; pc++) { - char buff[100]; - printf("%s\n", buildop(p, pc, buff)); - } - return 0; -} - - -static int listk (lua_State *L) { - Proto *p; - int i; - luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - p = getproto(obj_at(L, 1)); - lua_createtable(L, p->sizek, 0); - for (i=0; isizek; i++) { - pushobject(L, p->k+i); - lua_rawseti(L, -2, i+1); - } - return 1; -} - - -static int listabslineinfo (lua_State *L) { - Proto *p; - int i; - luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - p = getproto(obj_at(L, 1)); - luaL_argcheck(L, p->abslineinfo != NULL, 1, "function has no debug info"); - lua_createtable(L, 2 * p->sizeabslineinfo, 0); - for (i=0; i < p->sizeabslineinfo; i++) { - lua_pushinteger(L, p->abslineinfo[i].pc); - lua_rawseti(L, -2, 2 * i + 1); - lua_pushinteger(L, p->abslineinfo[i].line); - lua_rawseti(L, -2, 2 * i + 2); - } - return 1; -} - - -static int listlocals (lua_State *L) { - Proto *p; - int pc = cast_int(luaL_checkinteger(L, 2)) - 1; - int i = 0; - const char *name; - luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - p = getproto(obj_at(L, 1)); - while ((name = luaF_getlocalname(p, ++i, pc)) != NULL) - lua_pushstring(L, name); - return i-1; -} - -/* }====================================================== */ - - - -static void printstack (lua_State *L) { - int i; - int n = lua_gettop(L); - printf("stack: >>\n"); - for (i = 1; i <= n; i++) { - printf("%3d: %s\n", i, luaL_tolstring(L, i, NULL)); - lua_pop(L, 1); - } - printf("<<\n"); -} - - -static int get_limits (lua_State *L) { - lua_createtable(L, 0, 6); - setnameval(L, "IS32INT", LUAI_IS32INT); - setnameval(L, "MAXARG_Ax", MAXARG_Ax); - setnameval(L, "MAXARG_Bx", MAXARG_Bx); - setnameval(L, "OFFSET_sBx", OFFSET_sBx); - setnameval(L, "LFPF", LFIELDS_PER_FLUSH); - setnameval(L, "NUM_OPCODES", NUM_OPCODES); - return 1; -} - - -static int mem_query (lua_State *L) { - if (lua_isnone(L, 1)) { - lua_pushinteger(L, l_memcontrol.total); - lua_pushinteger(L, l_memcontrol.numblocks); - lua_pushinteger(L, l_memcontrol.maxmem); - return 3; - } - else if (lua_isnumber(L, 1)) { - unsigned long limit = cast(unsigned long, luaL_checkinteger(L, 1)); - if (limit == 0) limit = ULONG_MAX; - l_memcontrol.memlimit = limit; - return 0; - } - else { - const char *t = luaL_checkstring(L, 1); - int i; - for (i = LUA_NUMTYPES - 1; i >= 0; i--) { - if (strcmp(t, ttypename(i)) == 0) { - lua_pushinteger(L, l_memcontrol.objcount[i]); - return 1; - } - } - return luaL_error(L, "unknown type '%s'", t); - } -} - - -static int alloc_count (lua_State *L) { - if (lua_isnone(L, 1)) - l_memcontrol.countlimit = ~0L; - else - l_memcontrol.countlimit = luaL_checkinteger(L, 1); - return 0; -} - - -static int alloc_failnext (lua_State *L) { - UNUSED(L); - l_memcontrol.failnext = 1; - return 0; -} - - -static int settrick (lua_State *L) { - if (ttisnil(obj_at(L, 1))) - l_Trick = NULL; - else - l_Trick = gcvalue(obj_at(L, 1)); - return 0; -} - - -static int gc_color (lua_State *L) { - TValue *o; - luaL_checkany(L, 1); - o = obj_at(L, 1); - if (!iscollectable(o)) - lua_pushstring(L, "no collectable"); - else { - GCObject *obj = gcvalue(o); - lua_pushstring(L, isdead(G(L), obj) ? "dead" : - iswhite(obj) ? "white" : - isblack(obj) ? "black" : "gray"); - } - return 1; -} - - -static int gc_age (lua_State *L) { - TValue *o; - luaL_checkany(L, 1); - o = obj_at(L, 1); - if (!iscollectable(o)) - lua_pushstring(L, "no collectable"); - else { - static const char *gennames[] = {"new", "survival", "old0", "old1", - "old", "touched1", "touched2"}; - GCObject *obj = gcvalue(o); - lua_pushstring(L, gennames[getage(obj)]); - } - return 1; -} - - -static int gc_printobj (lua_State *L) { - TValue *o; - luaL_checkany(L, 1); - o = obj_at(L, 1); - if (!iscollectable(o)) - printf("no collectable\n"); - else { - GCObject *obj = gcvalue(o); - printobj(G(L), obj); - printf("\n"); - } - return 0; -} - - -static int gc_state (lua_State *L) { - static const char *statenames[] = { - "propagate", "atomic", "sweepallgc", "sweepfinobj", - "sweeptobefnz", "sweepend", "callfin", "pause", ""}; - static const int states[] = { - GCSpropagate, GCSenteratomic, GCSswpallgc, GCSswpfinobj, - GCSswptobefnz, GCSswpend, GCScallfin, GCSpause, -1}; - int option = states[luaL_checkoption(L, 1, "", statenames)]; - if (option == -1) { - lua_pushstring(L, statenames[G(L)->gcstate]); - return 1; - } - else { - global_State *g = G(L); - if (G(L)->gckind != KGC_INC) - luaL_error(L, "cannot change states in generational mode"); - lua_lock(L); - if (option < g->gcstate) { /* must cross 'pause'? */ - luaC_runtilstate(L, GCSpause, 1); /* run until pause */ - } - luaC_runtilstate(L, option, 0); /* do not skip propagation state */ - lua_assert(G(L)->gcstate == option); - lua_unlock(L); - return 0; - } -} - - -static int hash_query (lua_State *L) { - if (lua_isnone(L, 2)) { - luaL_argcheck(L, lua_type(L, 1) == LUA_TSTRING, 1, "string expected"); - lua_pushinteger(L, tsvalue(obj_at(L, 1))->hash); - } - else { - TValue *o = obj_at(L, 1); - Table *t; - luaL_checktype(L, 2, LUA_TTABLE); - t = hvalue(obj_at(L, 2)); - lua_pushinteger(L, luaH_mainposition(t, o) - t->node); - } - return 1; -} - - -static int stacklevel (lua_State *L) { - unsigned long a = 0; - lua_pushinteger(L, (L->top.p - L->stack.p)); - lua_pushinteger(L, stacksize(L)); - lua_pushinteger(L, L->nCcalls); - lua_pushinteger(L, L->nci); - lua_pushinteger(L, (unsigned long)&a); - return 5; -} - - -static int table_query (lua_State *L) { - const Table *t; - int i = cast_int(luaL_optinteger(L, 2, -1)); - unsigned int asize; - luaL_checktype(L, 1, LUA_TTABLE); - t = hvalue(obj_at(L, 1)); - asize = luaH_realasize(t); - if (i == -1) { - lua_pushinteger(L, asize); - lua_pushinteger(L, allocsizenode(t)); - lua_pushinteger(L, t->alimit); - return 3; - } - else if (cast_uint(i) < asize) { - lua_pushinteger(L, i); - arr2obj(t, i + 1, s2v(L->top.p)); - api_incr_top(L); - lua_pushnil(L); - } - else if ((i -= asize) < sizenode(t)) { - TValue k; - getnodekey(L, &k, gnode(t, i)); - if (!isempty(gval(gnode(t, i))) || - ttisnil(&k) || - ttisnumber(&k)) { - pushobject(L, &k); - } - else - lua_pushliteral(L, ""); - pushobject(L, gval(gnode(t, i))); - if (gnext(&t->node[i]) != 0) - lua_pushinteger(L, gnext(&t->node[i])); - else - lua_pushnil(L); - } - return 3; -} - - -static int query_GCparams (lua_State *L) { - global_State *g = G(L); - lua_pushinteger(L, gettotalobjs(g)); - lua_pushinteger(L, g->GCdebt); - lua_pushinteger(L, applygcparam(g, MINORMUL, 100)); - lua_pushinteger(L, applygcparam(g, MAJORMINOR, 100)); - lua_pushinteger(L, applygcparam(g, MINORMAJOR, 100)); - lua_pushinteger(L, applygcparam(g, PAUSE, 100)); - lua_pushinteger(L, applygcparam(g, STEPMUL, 100)); - lua_pushinteger(L, applygcparam(g, STEPSIZE, 100)); - return 8; -} - - -static int test_codeparam (lua_State *L) { - lua_Integer p = luaL_checkinteger(L, 1); - lua_pushinteger(L, luaO_codeparam(p)); - return 1; -} - - -static int test_applyparam (lua_State *L) { - lua_Integer p = luaL_checkinteger(L, 1); - lua_Integer x = luaL_checkinteger(L, 2); - lua_pushinteger(L, luaO_applyparam(p, x)); - return 1; -} - - -static int string_query (lua_State *L) { - stringtable *tb = &G(L)->strt; - int s = cast_int(luaL_optinteger(L, 1, 0)) - 1; - if (s == -1) { - lua_pushinteger(L ,tb->size); - lua_pushinteger(L ,tb->nuse); - return 2; - } - else if (s < tb->size) { - TString *ts; - int n = 0; - for (ts = tb->hash[s]; ts != NULL; ts = ts->u.hnext) { - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - n++; - } - return n; - } - else return 0; -} - - -static int getreftable (lua_State *L) { - if (lua_istable(L, 2)) /* is there a table as second argument? */ - return 2; /* use it as the table */ - else - return LUA_REGISTRYINDEX; /* default is to use the register */ -} - - -static int tref (lua_State *L) { - int t = getreftable(L); - int level = lua_gettop(L); - luaL_checkany(L, 1); - lua_pushvalue(L, 1); - lua_pushinteger(L, luaL_ref(L, t)); - cast_void(level); /* to avoid warnings */ - lua_assert(lua_gettop(L) == level+1); /* +1 for result */ - return 1; -} - - -static int getref (lua_State *L) { - int t = getreftable(L); - int level = lua_gettop(L); - lua_rawgeti(L, t, luaL_checkinteger(L, 1)); - cast_void(level); /* to avoid warnings */ - lua_assert(lua_gettop(L) == level+1); - return 1; -} - -static int unref (lua_State *L) { - int t = getreftable(L); - int level = lua_gettop(L); - luaL_unref(L, t, cast_int(luaL_checkinteger(L, 1))); - cast_void(level); /* to avoid warnings */ - lua_assert(lua_gettop(L) == level); - return 0; -} - - -static int upvalue (lua_State *L) { - int n = cast_int(luaL_checkinteger(L, 2)); - luaL_checktype(L, 1, LUA_TFUNCTION); - if (lua_isnone(L, 3)) { - const char *name = lua_getupvalue(L, 1, n); - if (name == NULL) return 0; - lua_pushstring(L, name); - return 2; - } - else { - const char *name = lua_setupvalue(L, 1, n); - lua_pushstring(L, name); - return 1; - } -} - - -static int newuserdata (lua_State *L) { - size_t size = cast_sizet(luaL_optinteger(L, 1, 0)); - int nuv = luaL_optinteger(L, 2, 0); - char *p = cast_charp(lua_newuserdatauv(L, size, nuv)); - while (size--) *p++ = '\0'; - return 1; -} - - -static int pushuserdata (lua_State *L) { - lua_Integer u = luaL_checkinteger(L, 1); - lua_pushlightuserdata(L, cast_voidp(cast_sizet(u))); - return 1; -} - - -static int udataval (lua_State *L) { - lua_pushinteger(L, cast(long, lua_touserdata(L, 1))); - return 1; -} - - -static int doonnewstack (lua_State *L) { - lua_State *L1 = lua_newthread(L); - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - int status = luaL_loadbuffer(L1, s, l, s); - if (status == LUA_OK) - status = lua_pcall(L1, 0, 0, 0); - lua_pushinteger(L, status); - return 1; -} - - -static int s2d (lua_State *L) { - lua_pushnumber(L, cast_num(*cast(const double *, luaL_checkstring(L, 1)))); - return 1; -} - - -static int d2s (lua_State *L) { - double d = cast(double, luaL_checknumber(L, 1)); - lua_pushlstring(L, cast_charp(&d), sizeof(d)); - return 1; -} - - -static int num2int (lua_State *L) { - lua_pushinteger(L, lua_tointeger(L, 1)); - return 1; -} - - -static int makeseed (lua_State *L) { - lua_pushinteger(L, luaL_makeseed(L)); - return 1; -} - - -static int newstate (lua_State *L) { - void *ud; - lua_Alloc f = lua_getallocf(L, &ud); - lua_State *L1 = lua_newstate(f, ud, 0); - if (L1) { - lua_atpanic(L1, tpanic); - lua_pushlightuserdata(L, L1); - } - else - lua_pushnil(L); - return 1; -} - - -static lua_State *getstate (lua_State *L) { - lua_State *L1 = cast(lua_State *, lua_touserdata(L, 1)); - luaL_argcheck(L, L1 != NULL, 1, "state expected"); - return L1; -} - - -static int loadlib (lua_State *L) { - lua_State *L1 = getstate(L); - int load = luaL_checkinteger(L, 2); - int preload = luaL_checkinteger(L, 3); - luaL_openselectedlibs(L1, load, preload); - luaL_requiref(L1, "T", luaB_opentests, 0); - lua_assert(lua_type(L1, -1) == LUA_TTABLE); - /* 'requiref' should not reload module already loaded... */ - luaL_requiref(L1, "T", NULL, 1); /* seg. fault if it reloads */ - /* ...but should return the same module */ - lua_assert(lua_compare(L1, -1, -2, LUA_OPEQ)); - return 0; -} - -static int closestate (lua_State *L) { - lua_State *L1 = getstate(L); - lua_close(L1); - return 0; -} - -static int doremote (lua_State *L) { - lua_State *L1 = getstate(L); - size_t lcode; - const char *code = luaL_checklstring(L, 2, &lcode); - int status; - lua_settop(L1, 0); - status = luaL_loadbuffer(L1, code, lcode, code); - if (status == LUA_OK) - status = lua_pcall(L1, 0, LUA_MULTRET, 0); - if (status != LUA_OK) { - lua_pushnil(L); - lua_pushstring(L, lua_tostring(L1, -1)); - lua_pushinteger(L, status); - return 3; - } - else { - int i = 0; - while (!lua_isnone(L1, ++i)) - lua_pushstring(L, lua_tostring(L1, i)); - lua_pop(L1, i-1); - return i-1; - } -} - - -static int log2_aux (lua_State *L) { - unsigned int x = (unsigned int)luaL_checkinteger(L, 1); - lua_pushinteger(L, luaO_ceillog2(x)); - return 1; -} - - -struct Aux { jmp_buf jb; const char *paniccode; lua_State *L; }; - -/* -** does a long-jump back to "main program". -*/ -static int panicback (lua_State *L) { - struct Aux *b; - lua_checkstack(L, 1); /* open space for 'Aux' struct */ - lua_getfield(L, LUA_REGISTRYINDEX, "_jmpbuf"); /* get 'Aux' struct */ - b = (struct Aux *)lua_touserdata(L, -1); - lua_pop(L, 1); /* remove 'Aux' struct */ - runC(b->L, L, b->paniccode); /* run optional panic code */ - longjmp(b->jb, 1); - return 1; /* to avoid warnings */ -} - -static int checkpanic (lua_State *L) { - struct Aux b; - void *ud; - lua_State *L1; - const char *code = luaL_checkstring(L, 1); - lua_Alloc f = lua_getallocf(L, &ud); - b.paniccode = luaL_optstring(L, 2, ""); - b.L = L; - L1 = lua_newstate(f, ud, 0); /* create new state */ - if (L1 == NULL) { /* error? */ - lua_pushnil(L); - return 1; - } - lua_atpanic(L1, panicback); /* set its panic function */ - lua_pushlightuserdata(L1, &b); - lua_setfield(L1, LUA_REGISTRYINDEX, "_jmpbuf"); /* store 'Aux' struct */ - if (setjmp(b.jb) == 0) { /* set jump buffer */ - runC(L, L1, code); /* run code unprotected */ - lua_pushliteral(L, "no errors"); - } - else { /* error handling */ - /* move error message to original state */ - lua_pushstring(L, lua_tostring(L1, -1)); - } - lua_close(L1); - return 1; -} - - -static int externKstr (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_pushextlstring(L, s, len, NULL, NULL); - return 1; -} - - -/* -** Create a buffer with the content of a given string and then -** create an external string using that buffer. Use the allocation -** function from Lua to create and free the buffer. -*/ -static int externstr (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); /* get allocation function */ - /* create the buffer */ - char *buff = cast_charp((*allocf)(ud, NULL, 0, len + 1)); - if (buff == NULL) { /* memory error? */ - lua_pushliteral(L, "not enough memory"); - lua_error(L); /* raise a memory error */ - } - /* copy string content to buffer, including ending 0 */ - memcpy(buff, s, (len + 1) * sizeof(char)); - /* create external string */ - lua_pushextlstring(L, buff, len, allocf, ud); - return 1; -} - - -/* -** {==================================================================== -** function to test the API with C. It interprets a kind of assembler -** language with calls to the API, so the test can be driven by Lua code -** ===================================================================== -*/ - - -static void sethookaux (lua_State *L, int mask, int count, const char *code); - -static const char *const delimits = " \t\n,;"; - -static void skip (const char **pc) { - for (;;) { - if (**pc != '\0' && strchr(delimits, **pc)) (*pc)++; - else if (**pc == '#') { /* comment? */ - while (**pc != '\n' && **pc != '\0') (*pc)++; /* until end-of-line */ - } - else break; - } -} - -static int getnum_aux (lua_State *L, lua_State *L1, const char **pc) { - int res = 0; - int sig = 1; - skip(pc); - if (**pc == '.') { - res = cast_int(lua_tointeger(L1, -1)); - lua_pop(L1, 1); - (*pc)++; - return res; - } - else if (**pc == '*') { - res = lua_gettop(L1); - (*pc)++; - return res; - } - else if (**pc == '!') { - (*pc)++; - if (**pc == 'G') - res = LUA_RIDX_GLOBALS; - else if (**pc == 'M') - res = LUA_RIDX_MAINTHREAD; - else lua_assert(0); - (*pc)++; - return res; - } - else if (**pc == '-') { - sig = -1; - (*pc)++; - } - if (!lisdigit(cast_uchar(**pc))) - luaL_error(L, "number expected (%s)", *pc); - while (lisdigit(cast_uchar(**pc))) res = res*10 + (*(*pc)++) - '0'; - return sig*res; -} - -static const char *getstring_aux (lua_State *L, char *buff, const char **pc) { - int i = 0; - skip(pc); - if (**pc == '"' || **pc == '\'') { /* quoted string? */ - int quote = *(*pc)++; - while (**pc != quote) { - if (**pc == '\0') luaL_error(L, "unfinished string in C script"); - buff[i++] = *(*pc)++; - } - (*pc)++; - } - else { - while (**pc != '\0' && !strchr(delimits, **pc)) - buff[i++] = *(*pc)++; - } - buff[i] = '\0'; - return buff; -} - - -static int getindex_aux (lua_State *L, lua_State *L1, const char **pc) { - skip(pc); - switch (*(*pc)++) { - case 'R': return LUA_REGISTRYINDEX; - case 'G': return luaL_error(L, "deprecated index 'G'"); - case 'U': return lua_upvalueindex(getnum_aux(L, L1, pc)); - default: (*pc)--; return getnum_aux(L, L1, pc); - } -} - - -static const char *const statcodes[] = {"OK", "YIELD", "ERRRUN", - "ERRSYNTAX", MEMERRMSG, "ERRGCMM", "ERRERR"}; - -/* -** Avoid these stat codes from being collected, to avoid possible -** memory error when pushing them. -*/ -static void regcodes (lua_State *L) { - unsigned int i; - for (i = 0; i < sizeof(statcodes) / sizeof(statcodes[0]); i++) { - lua_pushboolean(L, 1); - lua_setfield(L, LUA_REGISTRYINDEX, statcodes[i]); - } -} - - -#define EQ(s1) (strcmp(s1, inst) == 0) - -#define getnum (getnum_aux(L, L1, &pc)) -#define getstring (getstring_aux(L, buff, &pc)) -#define getindex (getindex_aux(L, L1, &pc)) - - -static int testC (lua_State *L); -static int Cfunck (lua_State *L, int status, lua_KContext ctx); - -/* -** arithmetic operation encoding for 'arith' instruction -** LUA_OPIDIV -> \ -** LUA_OPSHL -> < -** LUA_OPSHR -> > -** LUA_OPUNM -> _ -** LUA_OPBNOT -> ! -*/ -static const char ops[] = "+-*%^/\\&|~<>_!"; - -static int runC (lua_State *L, lua_State *L1, const char *pc) { - char buff[300]; - int status = 0; - if (pc == NULL) return luaL_error(L, "attempt to runC null script"); - for (;;) { - const char *inst = getstring; - if EQ("") return 0; - else if EQ("absindex") { - lua_pushnumber(L1, lua_absindex(L1, getindex)); - } - else if EQ("append") { - int t = getindex; - int i = lua_rawlen(L1, t); - lua_rawseti(L1, t, i + 1); - } - else if EQ("arith") { - int op; - skip(&pc); - op = strchr(ops, *pc++) - ops; - lua_arith(L1, op); - } - else if EQ("call") { - int narg = getnum; - int nres = getnum; - lua_call(L1, narg, nres); - } - else if EQ("callk") { - int narg = getnum; - int nres = getnum; - int i = getindex; - lua_callk(L1, narg, nres, i, Cfunck); - } - else if EQ("checkstack") { - int sz = getnum; - const char *msg = getstring; - if (*msg == '\0') - msg = NULL; /* to test 'luaL_checkstack' with no message */ - luaL_checkstack(L1, sz, msg); - } - else if EQ("rawcheckstack") { - int sz = getnum; - lua_pushboolean(L1, lua_checkstack(L1, sz)); - } - else if EQ("compare") { - const char *opt = getstring; /* EQ, LT, or LE */ - int op = (opt[0] == 'E') ? LUA_OPEQ - : (opt[1] == 'T') ? LUA_OPLT : LUA_OPLE; - int a = getindex; - int b = getindex; - lua_pushboolean(L1, lua_compare(L1, a, b, op)); - } - else if EQ("concat") { - lua_concat(L1, getnum); - } - else if EQ("copy") { - int f = getindex; - lua_copy(L1, f, getindex); - } - else if EQ("func2num") { - lua_CFunction func = lua_tocfunction(L1, getindex); - lua_pushnumber(L1, cast_sizet(func)); - } - else if EQ("getfield") { - int t = getindex; - int tp = lua_getfield(L1, t, getstring); - lua_assert(tp == lua_type(L1, -1)); - } - else if EQ("getglobal") { - lua_getglobal(L1, getstring); - } - else if EQ("getmetatable") { - if (lua_getmetatable(L1, getindex) == 0) - lua_pushnil(L1); - } - else if EQ("gettable") { - int tp = lua_gettable(L1, getindex); - lua_assert(tp == lua_type(L1, -1)); - } - else if EQ("gettop") { - lua_pushinteger(L1, lua_gettop(L1)); - } - else if EQ("gsub") { - int a = getnum; int b = getnum; int c = getnum; - luaL_gsub(L1, lua_tostring(L1, a), - lua_tostring(L1, b), - lua_tostring(L1, c)); - } - else if EQ("insert") { - lua_insert(L1, getnum); - } - else if EQ("iscfunction") { - lua_pushboolean(L1, lua_iscfunction(L1, getindex)); - } - else if EQ("isfunction") { - lua_pushboolean(L1, lua_isfunction(L1, getindex)); - } - else if EQ("isnil") { - lua_pushboolean(L1, lua_isnil(L1, getindex)); - } - else if EQ("isnull") { - lua_pushboolean(L1, lua_isnone(L1, getindex)); - } - else if EQ("isnumber") { - lua_pushboolean(L1, lua_isnumber(L1, getindex)); - } - else if EQ("isstring") { - lua_pushboolean(L1, lua_isstring(L1, getindex)); - } - else if EQ("istable") { - lua_pushboolean(L1, lua_istable(L1, getindex)); - } - else if EQ("isudataval") { - lua_pushboolean(L1, lua_islightuserdata(L1, getindex)); - } - else if EQ("isuserdata") { - lua_pushboolean(L1, lua_isuserdata(L1, getindex)); - } - else if EQ("len") { - lua_len(L1, getindex); - } - else if EQ("Llen") { - lua_pushinteger(L1, luaL_len(L1, getindex)); - } - else if EQ("loadfile") { - luaL_loadfile(L1, luaL_checkstring(L1, getnum)); - } - else if EQ("loadstring") { - size_t slen; - const char *s = luaL_checklstring(L1, getnum, &slen); - const char *name = getstring; - const char *mode = getstring; - luaL_loadbufferx(L1, s, slen, name, mode); - } - else if EQ("newmetatable") { - lua_pushboolean(L1, luaL_newmetatable(L1, getstring)); - } - else if EQ("newtable") { - lua_newtable(L1); - } - else if EQ("newthread") { - lua_newthread(L1); - } - else if EQ("resetthread") { - lua_pushinteger(L1, lua_resetthread(L1)); /* deprecated */ - } - else if EQ("newuserdata") { - lua_newuserdata(L1, getnum); - } - else if EQ("next") { - lua_next(L1, -2); - } - else if EQ("objsize") { - lua_pushinteger(L1, lua_rawlen(L1, getindex)); - } - else if EQ("pcall") { - int narg = getnum; - int nres = getnum; - status = lua_pcall(L1, narg, nres, getnum); - } - else if EQ("pcallk") { - int narg = getnum; - int nres = getnum; - int i = getindex; - status = lua_pcallk(L1, narg, nres, 0, i, Cfunck); - } - else if EQ("pop") { - lua_pop(L1, getnum); - } - else if EQ("printstack") { - int n = getnum; - if (n != 0) { - printf("%s\n", luaL_tolstring(L1, n, NULL)); - lua_pop(L1, 1); - } - else printstack(L1); - } - else if EQ("print") { - const char *msg = getstring; - printf("%s\n", msg); - } - else if EQ("warningC") { - const char *msg = getstring; - lua_warning(L1, msg, 1); - } - else if EQ("warning") { - const char *msg = getstring; - lua_warning(L1, msg, 0); - } - else if EQ("pushbool") { - lua_pushboolean(L1, getnum); - } - else if EQ("pushcclosure") { - lua_pushcclosure(L1, testC, getnum); - } - else if EQ("pushint") { - lua_pushinteger(L1, getnum); - } - else if EQ("pushnil") { - lua_pushnil(L1); - } - else if EQ("pushnum") { - lua_pushnumber(L1, (lua_Number)getnum); - } - else if EQ("pushstatus") { - lua_pushstring(L1, statcodes[status]); - } - else if EQ("pushstring") { - lua_pushstring(L1, getstring); - } - else if EQ("pushupvalueindex") { - lua_pushinteger(L1, lua_upvalueindex(getnum)); - } - else if EQ("pushvalue") { - lua_pushvalue(L1, getindex); - } - else if EQ("pushfstringI") { - lua_pushfstring(L1, lua_tostring(L, -2), (int)lua_tointeger(L, -1)); - } - else if EQ("pushfstringS") { - lua_pushfstring(L1, lua_tostring(L, -2), lua_tostring(L, -1)); - } - else if EQ("pushfstringP") { - lua_pushfstring(L1, lua_tostring(L, -2), lua_topointer(L, -1)); - } - else if EQ("rawget") { - int t = getindex; - lua_rawget(L1, t); - } - else if EQ("rawgeti") { - int t = getindex; - lua_rawgeti(L1, t, getnum); - } - else if EQ("rawgetp") { - int t = getindex; - lua_rawgetp(L1, t, cast_voidp(cast_sizet(getnum))); - } - else if EQ("rawset") { - int t = getindex; - lua_rawset(L1, t); - } - else if EQ("rawseti") { - int t = getindex; - lua_rawseti(L1, t, getnum); - } - else if EQ("rawsetp") { - int t = getindex; - lua_rawsetp(L1, t, cast_voidp(cast_sizet(getnum))); - } - else if EQ("remove") { - lua_remove(L1, getnum); - } - else if EQ("replace") { - lua_replace(L1, getindex); - } - else if EQ("resume") { - int i = getindex; - int nres; - status = lua_resume(lua_tothread(L1, i), L, getnum, &nres); - } - else if EQ("return") { - int n = getnum; - if (L1 != L) { - int i; - for (i = 0; i < n; i++) { - int idx = -(n - i); - switch (lua_type(L1, idx)) { - case LUA_TBOOLEAN: - lua_pushboolean(L, lua_toboolean(L1, idx)); - break; - default: - lua_pushstring(L, lua_tostring(L1, idx)); - break; - } - } - } - return n; - } - else if EQ("rotate") { - int i = getindex; - lua_rotate(L1, i, getnum); - } - else if EQ("setfield") { - int t = getindex; - const char *s = getstring; - lua_setfield(L1, t, s); - } - else if EQ("seti") { - int t = getindex; - lua_seti(L1, t, getnum); - } - else if EQ("setglobal") { - const char *s = getstring; - lua_setglobal(L1, s); - } - else if EQ("sethook") { - int mask = getnum; - int count = getnum; - const char *s = getstring; - sethookaux(L1, mask, count, s); - } - else if EQ("setmetatable") { - int idx = getindex; - lua_setmetatable(L1, idx); - } - else if EQ("settable") { - lua_settable(L1, getindex); - } - else if EQ("settop") { - lua_settop(L1, getnum); - } - else if EQ("testudata") { - int i = getindex; - lua_pushboolean(L1, luaL_testudata(L1, i, getstring) != NULL); - } - else if EQ("error") { - lua_error(L1); - } - else if EQ("abort") { - abort(); - } - else if EQ("throw") { -#if defined(__cplusplus) -static struct X { int x; } x; - throw x; -#else - luaL_error(L1, "C++"); -#endif - break; - } - else if EQ("tobool") { - lua_pushboolean(L1, lua_toboolean(L1, getindex)); - } - else if EQ("tocfunction") { - lua_pushcfunction(L1, lua_tocfunction(L1, getindex)); - } - else if EQ("tointeger") { - lua_pushinteger(L1, lua_tointeger(L1, getindex)); - } - else if EQ("tonumber") { - lua_pushnumber(L1, lua_tonumber(L1, getindex)); - } - else if EQ("topointer") { - lua_pushlightuserdata(L1, cast_voidp(lua_topointer(L1, getindex))); - } - else if EQ("touserdata") { - lua_pushlightuserdata(L1, lua_touserdata(L1, getindex)); - } - else if EQ("tostring") { - const char *s = lua_tostring(L1, getindex); - const char *s1 = lua_pushstring(L1, s); - cast_void(s1); /* to avoid warnings */ - lua_longassert((s == NULL && s1 == NULL) || strcmp(s, s1) == 0); - } - else if EQ("Ltolstring") { - luaL_tolstring(L1, getindex, NULL); - } - else if EQ("type") { - lua_pushstring(L1, luaL_typename(L1, getnum)); - } - else if EQ("xmove") { - int f = getindex; - int t = getindex; - lua_State *fs = (f == 0) ? L1 : lua_tothread(L1, f); - lua_State *ts = (t == 0) ? L1 : lua_tothread(L1, t); - int n = getnum; - if (n == 0) n = lua_gettop(fs); - lua_xmove(fs, ts, n); - } - else if EQ("isyieldable") { - lua_pushboolean(L1, lua_isyieldable(lua_tothread(L1, getindex))); - } - else if EQ("yield") { - return lua_yield(L1, getnum); - } - else if EQ("yieldk") { - int nres = getnum; - int i = getindex; - return lua_yieldk(L1, nres, i, Cfunck); - } - else if EQ("toclose") { - lua_toclose(L1, getnum); - } - else if EQ("closeslot") { - lua_closeslot(L1, getnum); - } - else luaL_error(L, "unknown instruction %s", buff); - } - return 0; -} - - -static int testC (lua_State *L) { - lua_State *L1; - const char *pc; - if (lua_isuserdata(L, 1)) { - L1 = getstate(L); - pc = luaL_checkstring(L, 2); - } - else if (lua_isthread(L, 1)) { - L1 = lua_tothread(L, 1); - pc = luaL_checkstring(L, 2); - } - else { - L1 = L; - pc = luaL_checkstring(L, 1); - } - return runC(L, L1, pc); -} - - -static int Cfunc (lua_State *L) { - return runC(L, L, lua_tostring(L, lua_upvalueindex(1))); -} - - -static int Cfunck (lua_State *L, int status, lua_KContext ctx) { - lua_pushstring(L, statcodes[status]); - lua_setglobal(L, "status"); - lua_pushinteger(L, ctx); - lua_setglobal(L, "ctx"); - return runC(L, L, lua_tostring(L, ctx)); -} - - -static int makeCfunc (lua_State *L) { - luaL_checkstring(L, 1); - lua_pushcclosure(L, Cfunc, lua_gettop(L)); - return 1; -} - - -/* }====================================================== */ - - -/* -** {====================================================== -** tests for C hooks -** ======================================================= -*/ - -/* -** C hook that runs the C script stored in registry.C_HOOK[L] -*/ -static void Chook (lua_State *L, lua_Debug *ar) { - const char *scpt; - const char *const events [] = {"call", "ret", "line", "count", "tailcall"}; - lua_getfield(L, LUA_REGISTRYINDEX, "C_HOOK"); - lua_pushlightuserdata(L, L); - lua_gettable(L, -2); /* get C_HOOK[L] (script saved by sethookaux) */ - scpt = lua_tostring(L, -1); /* not very religious (string will be popped) */ - lua_pop(L, 2); /* remove C_HOOK and script */ - lua_pushstring(L, events[ar->event]); /* may be used by script */ - lua_pushinteger(L, ar->currentline); /* may be used by script */ - runC(L, L, scpt); /* run script from C_HOOK[L] */ -} - - -/* -** sets 'registry.C_HOOK[L] = scpt' and sets 'Chook' as a hook -*/ -static void sethookaux (lua_State *L, int mask, int count, const char *scpt) { - if (*scpt == '\0') { /* no script? */ - lua_sethook(L, NULL, 0, 0); /* turn off hooks */ - return; - } - lua_getfield(L, LUA_REGISTRYINDEX, "C_HOOK"); /* get C_HOOK table */ - if (!lua_istable(L, -1)) { /* no hook table? */ - lua_pop(L, 1); /* remove previous value */ - lua_newtable(L); /* create new C_HOOK table */ - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, "C_HOOK"); /* register it */ - } - lua_pushlightuserdata(L, L); - lua_pushstring(L, scpt); - lua_settable(L, -3); /* C_HOOK[L] = script */ - lua_sethook(L, Chook, mask, count); -} - - -static int sethook (lua_State *L) { - if (lua_isnoneornil(L, 1)) - lua_sethook(L, NULL, 0, 0); /* turn off hooks */ - else { - const char *scpt = luaL_checkstring(L, 1); - const char *smask = luaL_checkstring(L, 2); - int count = cast_int(luaL_optinteger(L, 3, 0)); - int mask = 0; - if (strchr(smask, 'c')) mask |= LUA_MASKCALL; - if (strchr(smask, 'r')) mask |= LUA_MASKRET; - if (strchr(smask, 'l')) mask |= LUA_MASKLINE; - if (count > 0) mask |= LUA_MASKCOUNT; - sethookaux(L, mask, count, scpt); - } - return 0; -} - - -static int coresume (lua_State *L) { - int status, nres; - lua_State *co = lua_tothread(L, 1); - luaL_argcheck(L, co, 1, "coroutine expected"); - status = lua_resume(co, L, 0, &nres); - if (status != LUA_OK && status != LUA_YIELD) { - lua_pushboolean(L, 0); - lua_insert(L, -2); - return 2; /* return false + error message */ - } - else { - lua_pushboolean(L, 1); - return 1; - } -} - -/* }====================================================== */ - - - -static const struct luaL_Reg tests_funcs[] = { - {"checkmemory", lua_checkmemory}, - {"closestate", closestate}, - {"d2s", d2s}, - {"doonnewstack", doonnewstack}, - {"doremote", doremote}, - {"gccolor", gc_color}, - {"gcage", gc_age}, - {"gcstate", gc_state}, - {"pobj", gc_printobj}, - {"getref", getref}, - {"hash", hash_query}, - {"log2", log2_aux}, - {"limits", get_limits}, - {"listcode", listcode}, - {"printcode", printcode}, - {"listk", listk}, - {"listabslineinfo", listabslineinfo}, - {"listlocals", listlocals}, - {"loadlib", loadlib}, - {"checkpanic", checkpanic}, - {"newstate", newstate}, - {"newuserdata", newuserdata}, - {"num2int", num2int}, - {"makeseed", makeseed}, - {"pushuserdata", pushuserdata}, - {"querystr", string_query}, - {"querytab", table_query}, - {"queryGCparams", query_GCparams}, - {"codeparam", test_codeparam}, - {"applyparam", test_applyparam}, - {"ref", tref}, - {"resume", coresume}, - {"s2d", s2d}, - {"sethook", sethook}, - {"stacklevel", stacklevel}, - {"testC", testC}, - {"makeCfunc", makeCfunc}, - {"totalmem", mem_query}, - {"alloccount", alloc_count}, - {"allocfailnext", alloc_failnext}, - {"trick", settrick}, - {"udataval", udataval}, - {"unref", unref}, - {"upvalue", upvalue}, - {"externKstr", externKstr}, - {"externstr", externstr}, - {NULL, NULL} -}; - - -static void checkfinalmem (void) { - lua_assert(l_memcontrol.numblocks == 0); - lua_assert(l_memcontrol.total == 0); -} - - -int luaB_opentests (lua_State *L) { - void *ud; - lua_Alloc f = lua_getallocf(L, &ud); - lua_atpanic(L, &tpanic); - lua_setwarnf(L, &warnf, L); - lua_pushboolean(L, 0); - lua_setglobal(L, "_WARN"); /* _WARN = false */ - regcodes(L); - atexit(checkfinalmem); - lua_assert(f == debug_realloc && ud == cast_voidp(&l_memcontrol)); - lua_setallocf(L, f, ud); /* exercise this function */ - luaL_newlib(L, tests_funcs); - return 1; -} - -#endif - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltests.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltests.h deleted file mode 100644 index da773d6..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltests.h +++ /dev/null @@ -1,152 +0,0 @@ -/* -** $Id: ltests.h $ -** Internal Header for Debugging of the Lua Implementation -** See Copyright Notice in lua.h -*/ - -#ifndef ltests_h -#define ltests_h - - -#include -#include - -/* test Lua with compatibility code */ -#define LUA_COMPAT_MATHLIB -#define LUA_COMPAT_LT_LE - - -#define LUA_DEBUG - - -/* turn on assertions */ -#define LUAI_ASSERT - - -/* to avoid warnings, and to make sure value is really unused */ -#define UNUSED(x) (x=0, (void)(x)) - - -/* test for sizes in 'l_sprintf' (make sure whole buffer is available) */ -#undef l_sprintf -#if !defined(LUA_USE_C89) -#define l_sprintf(s,sz,f,i) (memset(s,0xAB,sz), snprintf(s,sz,f,i)) -#else -#define l_sprintf(s,sz,f,i) (memset(s,0xAB,sz), sprintf(s,f,i)) -#endif - - -/* get a chance to test code without jump tables */ -#define LUA_USE_JUMPTABLE 0 - - -/* use 32-bit integers in random generator */ -#define LUA_RAND32 - - -/* memory-allocator control variables */ -typedef struct Memcontrol { - int failnext; - unsigned long numblocks; - unsigned long total; - unsigned long maxmem; - unsigned long memlimit; - unsigned long countlimit; - unsigned long objcount[LUA_NUMTYPES]; -} Memcontrol; - -LUA_API Memcontrol l_memcontrol; - - -/* -** generic variable for debug tricks -*/ -extern void *l_Trick; - - - -/* -** Function to traverse and check all memory used by Lua -*/ -LUAI_FUNC int lua_checkmemory (lua_State *L); - -/* -** Function to print an object GC-friendly -*/ -struct GCObject; -LUAI_FUNC void lua_printobj (lua_State *L, struct GCObject *o); - - -/* test for lock/unlock */ - -struct L_EXTRA { int lock; int *plock; }; -#undef LUA_EXTRASPACE -#define LUA_EXTRASPACE sizeof(struct L_EXTRA) -#define getlock(l) cast(struct L_EXTRA*, lua_getextraspace(l)) -#define luai_userstateopen(l) \ - (getlock(l)->lock = 0, getlock(l)->plock = &(getlock(l)->lock)) -#define luai_userstateclose(l) \ - lua_assert(getlock(l)->lock == 1 && getlock(l)->plock == &(getlock(l)->lock)) -#define luai_userstatethread(l,l1) \ - lua_assert(getlock(l1)->plock == getlock(l)->plock) -#define luai_userstatefree(l,l1) \ - lua_assert(getlock(l)->plock == getlock(l1)->plock) -#define lua_lock(l) lua_assert((*getlock(l)->plock)++ == 0) -#define lua_unlock(l) lua_assert(--(*getlock(l)->plock) == 0) - - - -LUA_API int luaB_opentests (lua_State *L); - -LUA_API void *debug_realloc (void *ud, void *block, - size_t osize, size_t nsize); - -#if defined(lua_c) -#define luaL_newstate() \ - lua_newstate(debug_realloc, &l_memcontrol, luaL_makeseed(NULL)) -#define luai_openlibs(L) \ - { luaL_openlibs(L); \ - luaL_requiref(L, "T", luaB_opentests, 1); \ - lua_pop(L, 1); } -#endif - - - -/* change some sizes to give some bugs a chance */ - -#undef LUAL_BUFFERSIZE -#define LUAL_BUFFERSIZE 23 -#define MINSTRTABSIZE 2 -#define MAXIWTHABS 3 - -#define STRCACHE_N 23 -#define STRCACHE_M 5 - -#undef LUAI_USER_ALIGNMENT_T -#define LUAI_USER_ALIGNMENT_T union { char b[sizeof(void*) * 8]; } - - -/* -** This one is not compatible with tests for opcode optimizations, -** as it blocks some optimizations -#define MAXINDEXRK 0 -*/ - - -/* make stack-overflow tests run faster */ -#undef LUAI_MAXSTACK -#define LUAI_MAXSTACK 50000 - - -/* test mode uses more stack space */ -#undef LUAI_MAXCCALLS -#define LUAI_MAXCCALLS 180 - - -/* force Lua to use its own implementations */ -#undef lua_strx2number -#undef lua_number2strx - - -#endif - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltm.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltm.c deleted file mode 100644 index 236f3bb..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltm.c +++ /dev/null @@ -1,276 +0,0 @@ -/* -** $Id: ltm.c $ -** Tag methods -** See Copyright Notice in lua.h -*/ - -#define ltm_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lvm.h" - - -static const char udatatypename[] = "userdata"; - -LUAI_DDEF const char *const luaT_typenames_[LUA_TOTALTYPES] = { - "no value", - "nil", "boolean", udatatypename, "number", - "string", "table", "function", udatatypename, "thread", - "upvalue", "proto" /* these last cases are used for tests only */ -}; - - -void luaT_init (lua_State *L) { - static const char *const luaT_eventname[] = { /* ORDER TM */ - "__index", "__newindex", - "__gc", "__mode", "__len", "__eq", - "__add", "__sub", "__mul", "__mod", "__pow", - "__div", "__idiv", - "__band", "__bor", "__bxor", "__shl", "__shr", - "__unm", "__bnot", "__lt", "__le", - "__concat", "__call", "__close" - }; - int i; - for (i=0; itmname[i] = luaS_new(L, luaT_eventname[i]); - luaC_fix(L, obj2gco(G(L)->tmname[i])); /* never collect these names */ - } -} - - -/* -** function to be used with macro "fasttm": optimized for absence of -** tag methods -*/ -const TValue *luaT_gettm (Table *events, TMS event, TString *ename) { - const TValue *tm = luaH_Hgetshortstr(events, ename); - lua_assert(event <= TM_EQ); - if (notm(tm)) { /* no tag method? */ - events->flags |= cast_byte(1u<metatable; - break; - case LUA_TUSERDATA: - mt = uvalue(o)->metatable; - break; - default: - mt = G(L)->mt[ttype(o)]; - } - return (mt ? luaH_Hgetshortstr(mt, G(L)->tmname[event]) : &G(L)->nilvalue); -} - - -/* -** Return the name of the type of an object. For tables and userdata -** with metatable, use their '__name' metafield, if present. -*/ -const char *luaT_objtypename (lua_State *L, const TValue *o) { - Table *mt; - if ((ttistable(o) && (mt = hvalue(o)->metatable) != NULL) || - (ttisfulluserdata(o) && (mt = uvalue(o)->metatable) != NULL)) { - const TValue *name = luaH_Hgetshortstr(mt, luaS_new(L, "__name")); - if (ttisstring(name)) /* is '__name' a string? */ - return getstr(tsvalue(name)); /* use it as type name */ - } - return ttypename(ttype(o)); /* else use standard type name */ -} - - -void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, const TValue *p3) { - StkId func = L->top.p; - setobj2s(L, func, f); /* push function (assume EXTRA_STACK) */ - setobj2s(L, func + 1, p1); /* 1st argument */ - setobj2s(L, func + 2, p2); /* 2nd argument */ - setobj2s(L, func + 3, p3); /* 3rd argument */ - L->top.p = func + 4; - /* metamethod may yield only when called from Lua code */ - if (isLuacode(L->ci)) - luaD_call(L, func, 0); - else - luaD_callnoyield(L, func, 0); -} - - -int luaT_callTMres (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, StkId res) { - ptrdiff_t result = savestack(L, res); - StkId func = L->top.p; - setobj2s(L, func, f); /* push function (assume EXTRA_STACK) */ - setobj2s(L, func + 1, p1); /* 1st argument */ - setobj2s(L, func + 2, p2); /* 2nd argument */ - L->top.p += 3; - /* metamethod may yield only when called from Lua code */ - if (isLuacode(L->ci)) - luaD_call(L, func, 1); - else - luaD_callnoyield(L, func, 1); - res = restorestack(L, result); - setobjs2s(L, res, --L->top.p); /* move result to its place */ - return ttypetag(s2v(res)); /* return tag of the result */ -} - - -static int callbinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event) { - const TValue *tm = luaT_gettmbyobj(L, p1, event); /* try first operand */ - if (notm(tm)) - tm = luaT_gettmbyobj(L, p2, event); /* try second operand */ - if (notm(tm)) - return -1; /* tag method not found */ - else /* call tag method and return the tag of the result */ - return luaT_callTMres(L, tm, p1, p2, res); -} - - -void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event) { - if (l_unlikely(callbinTM(L, p1, p2, res, event) < 0)) { - switch (event) { - case TM_BAND: case TM_BOR: case TM_BXOR: - case TM_SHL: case TM_SHR: case TM_BNOT: { - if (ttisnumber(p1) && ttisnumber(p2)) - luaG_tointerror(L, p1, p2); - else - luaG_opinterror(L, p1, p2, "perform bitwise operation on"); - } - /* calls never return, but to avoid warnings: *//* FALLTHROUGH */ - default: - luaG_opinterror(L, p1, p2, "perform arithmetic on"); - } - } -} - - -/* -** The use of 'p1' after 'callbinTM' is safe because, when a tag -** method is not found, 'callbinTM' cannot change the stack. -*/ -void luaT_tryconcatTM (lua_State *L) { - StkId p1 = L->top.p - 2; /* first argument */ - if (l_unlikely(callbinTM(L, s2v(p1), s2v(p1 + 1), p1, TM_CONCAT) < 0)) - luaG_concaterror(L, s2v(p1), s2v(p1 + 1)); -} - - -void luaT_trybinassocTM (lua_State *L, const TValue *p1, const TValue *p2, - int flip, StkId res, TMS event) { - if (flip) - luaT_trybinTM(L, p2, p1, res, event); - else - luaT_trybinTM(L, p1, p2, res, event); -} - - -void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, - int flip, StkId res, TMS event) { - TValue aux; - setivalue(&aux, i2); - luaT_trybinassocTM(L, p1, &aux, flip, res, event); -} - - -/* -** Calls an order tag method. -** For lessequal, LUA_COMPAT_LT_LE keeps compatibility with old -** behavior: if there is no '__le', try '__lt', based on l <= r iff -** !(r < l) (assuming a total order). If the metamethod yields during -** this substitution, the continuation has to know about it (to negate -** the result of rtop.p, event); /* try original event */ - if (tag >= 0) /* found tag method? */ - return !tagisfalse(tag); -#if defined(LUA_COMPAT_LT_LE) - else if (event == TM_LE) { - /* try '!(p2 < p1)' for '(p1 <= p2)' */ - L->ci->callstatus |= CIST_LEQ; /* mark it is doing 'lt' for 'le' */ - tag = callbinTM(L, p2, p1, L->top.p, TM_LT); - L->ci->callstatus ^= CIST_LEQ; /* clear mark */ - if (tag >= 0) /* found tag method? */ - return tagisfalse(tag); - } -#endif - luaG_ordererror(L, p1, p2); /* no metamethod found */ - return 0; /* to avoid warnings */ -} - - -int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, - int flip, int isfloat, TMS event) { - TValue aux; const TValue *p2; - if (isfloat) { - setfltvalue(&aux, cast_num(v2)); - } - else - setivalue(&aux, v2); - if (flip) { /* arguments were exchanged? */ - p2 = p1; p1 = &aux; /* correct them */ - } - else - p2 = &aux; - return luaT_callorderTM(L, p1, p2, event); -} - - -void luaT_adjustvarargs (lua_State *L, int nfixparams, CallInfo *ci, - const Proto *p) { - int i; - int actual = cast_int(L->top.p - ci->func.p) - 1; /* number of arguments */ - int nextra = actual - nfixparams; /* number of extra arguments */ - ci->u.l.nextraargs = nextra; - luaD_checkstack(L, p->maxstacksize + 1); - /* copy function to the top of the stack */ - setobjs2s(L, L->top.p++, ci->func.p); - /* move fixed parameters to the top of the stack */ - for (i = 1; i <= nfixparams; i++) { - setobjs2s(L, L->top.p++, ci->func.p + i); - setnilvalue(s2v(ci->func.p + i)); /* erase original parameter (for GC) */ - } - ci->func.p += actual + 1; - ci->top.p += actual + 1; - lua_assert(L->top.p <= ci->top.p && ci->top.p <= L->stack_last.p); -} - - -void luaT_getvarargs (lua_State *L, CallInfo *ci, StkId where, int wanted) { - int i; - int nextra = ci->u.l.nextraargs; - if (wanted < 0) { - wanted = nextra; /* get all extra arguments available */ - checkstackp(L, nextra, where); /* ensure stack space */ - L->top.p = where + nextra; /* next instruction will need top */ - } - for (i = 0; i < wanted && i < nextra; i++) - setobjs2s(L, where + i, ci->func.p - nextra + i); - for (; i < wanted; i++) /* complete required results with nil */ - setnilvalue(s2v(where + i)); -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltm.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltm.h deleted file mode 100644 index df05b74..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/ltm.h +++ /dev/null @@ -1,104 +0,0 @@ -/* -** $Id: ltm.h $ -** Tag methods -** See Copyright Notice in lua.h -*/ - -#ifndef ltm_h -#define ltm_h - - -#include "lobject.h" - - -/* -* WARNING: if you change the order of this enumeration, -* grep "ORDER TM" and "ORDER OP" -*/ -typedef enum { - TM_INDEX, - TM_NEWINDEX, - TM_GC, - TM_MODE, - TM_LEN, - TM_EQ, /* last tag method with fast access */ - TM_ADD, - TM_SUB, - TM_MUL, - TM_MOD, - TM_POW, - TM_DIV, - TM_IDIV, - TM_BAND, - TM_BOR, - TM_BXOR, - TM_SHL, - TM_SHR, - TM_UNM, - TM_BNOT, - TM_LT, - TM_LE, - TM_CONCAT, - TM_CALL, - TM_CLOSE, - TM_N /* number of elements in the enum */ -} TMS; - - -/* -** Mask with 1 in all fast-access methods. A 1 in any of these bits -** in the flag of a (meta)table means the metatable does not have the -** corresponding metamethod field. (Bit 6 of the flag indicates that -** the table is using the dummy node; bit 7 is used for 'isrealasize'.) -*/ -#define maskflags (~(~0u << (TM_EQ + 1))) - - -/* -** Test whether there is no tagmethod. -** (Because tagmethods use raw accesses, the result may be an "empty" nil.) -*/ -#define notm(tm) ttisnil(tm) - -#define checknoTM(mt,e) ((mt) == NULL || (mt)->flags & (1u<<(e))) - -#define gfasttm(g,mt,e) \ - (checknoTM(mt, e) ? NULL : luaT_gettm(mt, e, (g)->tmname[e])) - -#define fasttm(l,mt,e) gfasttm(G(l), mt, e) - -#define ttypename(x) luaT_typenames_[(x) + 1] - -LUAI_DDEC(const char *const luaT_typenames_[LUA_TOTALTYPES];) - - -LUAI_FUNC const char *luaT_objtypename (lua_State *L, const TValue *o); - -LUAI_FUNC const TValue *luaT_gettm (Table *events, TMS event, TString *ename); -LUAI_FUNC const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, - TMS event); -LUAI_FUNC void luaT_init (lua_State *L); - -LUAI_FUNC void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, const TValue *p3); -LUAI_FUNC int luaT_callTMres (lua_State *L, const TValue *f, - const TValue *p1, const TValue *p2, StkId p3); -LUAI_FUNC void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event); -LUAI_FUNC void luaT_tryconcatTM (lua_State *L); -LUAI_FUNC void luaT_trybinassocTM (lua_State *L, const TValue *p1, - const TValue *p2, int inv, StkId res, TMS event); -LUAI_FUNC void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, - int inv, StkId res, TMS event); -LUAI_FUNC int luaT_callorderTM (lua_State *L, const TValue *p1, - const TValue *p2, TMS event); -LUAI_FUNC int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, - int inv, int isfloat, TMS event); - -LUAI_FUNC void luaT_adjustvarargs (lua_State *L, int nfixparams, - struct CallInfo *ci, const Proto *p); -LUAI_FUNC void luaT_getvarargs (lua_State *L, struct CallInfo *ci, - StkId where, int wanted); - - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lua.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lua.c deleted file mode 100644 index 65cf1d4..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lua.c +++ /dev/null @@ -1,673 +0,0 @@ -/* -** $Id: lua.c $ -** Lua stand-alone interpreter -** See Copyright Notice in lua.h -*/ - -#define lua_c - -#include "lprefix.h" - - -#include -#include -#include - -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -#if !defined(LUA_PROGNAME) -#define LUA_PROGNAME "lua" -#endif - -#if !defined(LUA_INIT_VAR) -#define LUA_INIT_VAR "LUA_INIT" -#endif - -#define LUA_INITVARVERSION LUA_INIT_VAR LUA_VERSUFFIX - - -static lua_State *globalL = NULL; - -static const char *progname = LUA_PROGNAME; - - -#if defined(LUA_USE_POSIX) /* { */ - -/* -** Use 'sigaction' when available. -*/ -static void setsignal (int sig, void (*handler)(int)) { - struct sigaction sa; - sa.sa_handler = handler; - sa.sa_flags = 0; - sigemptyset(&sa.sa_mask); /* do not mask any signal */ - sigaction(sig, &sa, NULL); -} - -#else /* }{ */ - -#define setsignal signal - -#endif /* } */ - - -/* -** Hook set by signal function to stop the interpreter. -*/ -static void lstop (lua_State *L, lua_Debug *ar) { - (void)ar; /* unused arg. */ - lua_sethook(L, NULL, 0, 0); /* reset hook */ - luaL_error(L, "interrupted!"); -} - - -/* -** Function to be called at a C signal. Because a C signal cannot -** just change a Lua state (as there is no proper synchronization), -** this function only sets a hook that, when called, will stop the -** interpreter. -*/ -static void laction (int i) { - int flag = LUA_MASKCALL | LUA_MASKRET | LUA_MASKLINE | LUA_MASKCOUNT; - setsignal(i, SIG_DFL); /* if another SIGINT happens, terminate process */ - lua_sethook(globalL, lstop, flag, 1); -} - - -static void print_usage (const char *badoption) { - lua_writestringerror("%s: ", progname); - if (badoption[1] == 'e' || badoption[1] == 'l') - lua_writestringerror("'%s' needs argument\n", badoption); - else - lua_writestringerror("unrecognized option '%s'\n", badoption); - lua_writestringerror( - "usage: %s [options] [script [args]]\n" - "Available options are:\n" - " -e stat execute string 'stat'\n" - " -i enter interactive mode after executing 'script'\n" - " -l mod require library 'mod' into global 'mod'\n" - " -l g=mod require library 'mod' into global 'g'\n" - " -v show version information\n" - " -E ignore environment variables\n" - " -W turn warnings on\n" - " -- stop handling options\n" - " - stop handling options and execute stdin\n" - , - progname); -} - - -/* -** Prints an error message, adding the program name in front of it -** (if present) -*/ -static void l_message (const char *pname, const char *msg) { - if (pname) lua_writestringerror("%s: ", pname); - lua_writestringerror("%s\n", msg); -} - - -/* -** Check whether 'status' is not OK and, if so, prints the error -** message on the top of the stack. It assumes that the error object -** is a string, as it was either generated by Lua or by 'msghandler'. -*/ -static int report (lua_State *L, int status) { - if (status != LUA_OK) { - const char *msg = lua_tostring(L, -1); - l_message(progname, msg); - lua_pop(L, 1); /* remove message */ - } - return status; -} - - -/* -** Message handler used to run all chunks -*/ -static int msghandler (lua_State *L) { - const char *msg = lua_tostring(L, 1); - if (msg == NULL) { /* is error object not a string? */ - if (luaL_callmeta(L, 1, "__tostring") && /* does it have a metamethod */ - lua_type(L, -1) == LUA_TSTRING) /* that produces a string? */ - return 1; /* that is the message */ - else - msg = lua_pushfstring(L, "(error object is a %s value)", - luaL_typename(L, 1)); - } - luaL_traceback(L, L, msg, 1); /* append a standard traceback */ - return 1; /* return the traceback */ -} - - -/* -** Interface to 'lua_pcall', which sets appropriate message function -** and C-signal handler. Used to run all chunks. -*/ -static int docall (lua_State *L, int narg, int nres) { - int status; - int base = lua_gettop(L) - narg; /* function index */ - lua_pushcfunction(L, msghandler); /* push message handler */ - lua_insert(L, base); /* put it under function and args */ - globalL = L; /* to be available to 'laction' */ - setsignal(SIGINT, laction); /* set C-signal handler */ - status = lua_pcall(L, narg, nres, base); - setsignal(SIGINT, SIG_DFL); /* reset C-signal handler */ - lua_remove(L, base); /* remove message handler from the stack */ - return status; -} - - -static void print_version (void) { - lua_writestring(LUA_COPYRIGHT, strlen(LUA_COPYRIGHT)); - lua_writeline(); -} - - -/* -** Create the 'arg' table, which stores all arguments from the -** command line ('argv'). It should be aligned so that, at index 0, -** it has 'argv[script]', which is the script name. The arguments -** to the script (everything after 'script') go to positive indices; -** other arguments (before the script name) go to negative indices. -** If there is no script name, assume interpreter's name as base. -** (If there is no interpreter's name either, 'script' is -1, so -** table sizes are zero.) -*/ -static void createargtable (lua_State *L, char **argv, int argc, int script) { - int i, narg; - narg = argc - (script + 1); /* number of positive indices */ - lua_createtable(L, narg, script + 1); - for (i = 0; i < argc; i++) { - lua_pushstring(L, argv[i]); - lua_rawseti(L, -2, i - script); - } - lua_setglobal(L, "arg"); -} - - -static int dochunk (lua_State *L, int status) { - if (status == LUA_OK) status = docall(L, 0, 0); - return report(L, status); -} - - -static int dofile (lua_State *L, const char *name) { - return dochunk(L, luaL_loadfile(L, name)); -} - - -static int dostring (lua_State *L, const char *s, const char *name) { - return dochunk(L, luaL_loadbuffer(L, s, strlen(s), name)); -} - - -/* -** Receives 'globname[=modname]' and runs 'globname = require(modname)'. -** If there is no explicit modname and globname contains a '-', cut -** the sufix after '-' (the "version") to make the global name. -*/ -static int dolibrary (lua_State *L, char *globname) { - int status; - char *suffix = NULL; - char *modname = strchr(globname, '='); - if (modname == NULL) { /* no explicit name? */ - modname = globname; /* module name is equal to global name */ - suffix = strchr(modname, *LUA_IGMARK); /* look for a suffix mark */ - } - else { - *modname = '\0'; /* global name ends here */ - modname++; /* module name starts after the '=' */ - } - lua_getglobal(L, "require"); - lua_pushstring(L, modname); - status = docall(L, 1, 1); /* call 'require(modname)' */ - if (status == LUA_OK) { - if (suffix != NULL) /* is there a suffix mark? */ - *suffix = '\0'; /* remove sufix from global name */ - lua_setglobal(L, globname); /* globname = require(modname) */ - } - return report(L, status); -} - - -/* -** Push on the stack the contents of table 'arg' from 1 to #arg -*/ -static int pushargs (lua_State *L) { - int i, n; - if (lua_getglobal(L, "arg") != LUA_TTABLE) - luaL_error(L, "'arg' is not a table"); - n = (int)luaL_len(L, -1); - luaL_checkstack(L, n + 3, "too many arguments to script"); - for (i = 1; i <= n; i++) - lua_rawgeti(L, -i, i); - lua_remove(L, -i); /* remove table from the stack */ - return n; -} - - -static int handle_script (lua_State *L, char **argv) { - int status; - const char *fname = argv[0]; - if (strcmp(fname, "-") == 0 && strcmp(argv[-1], "--") != 0) - fname = NULL; /* stdin */ - status = luaL_loadfile(L, fname); - if (status == LUA_OK) { - int n = pushargs(L); /* push arguments to script */ - status = docall(L, n, LUA_MULTRET); - } - return report(L, status); -} - - -/* bits of various argument indicators in 'args' */ -#define has_error 1 /* bad option */ -#define has_i 2 /* -i */ -#define has_v 4 /* -v */ -#define has_e 8 /* -e */ -#define has_E 16 /* -E */ - - -/* -** Traverses all arguments from 'argv', returning a mask with those -** needed before running any Lua code or an error code if it finds any -** invalid argument. In case of error, 'first' is the index of the bad -** argument. Otherwise, 'first' is -1 if there is no program name, -** 0 if there is no script name, or the index of the script name. -*/ -static int collectargs (char **argv, int *first) { - int args = 0; - int i; - if (argv[0] != NULL) { /* is there a program name? */ - if (argv[0][0]) /* not empty? */ - progname = argv[0]; /* save it */ - } - else { /* no program name */ - *first = -1; - return 0; - } - for (i = 1; argv[i] != NULL; i++) { /* handle arguments */ - *first = i; - if (argv[i][0] != '-') /* not an option? */ - return args; /* stop handling options */ - switch (argv[i][1]) { /* else check option */ - case '-': /* '--' */ - if (argv[i][2] != '\0') /* extra characters after '--'? */ - return has_error; /* invalid option */ - *first = i + 1; - return args; - case '\0': /* '-' */ - return args; /* script "name" is '-' */ - case 'E': - if (argv[i][2] != '\0') /* extra characters? */ - return has_error; /* invalid option */ - args |= has_E; - break; - case 'W': - if (argv[i][2] != '\0') /* extra characters? */ - return has_error; /* invalid option */ - break; - case 'i': - args |= has_i; /* (-i implies -v) *//* FALLTHROUGH */ - case 'v': - if (argv[i][2] != '\0') /* extra characters? */ - return has_error; /* invalid option */ - args |= has_v; - break; - case 'e': - args |= has_e; /* FALLTHROUGH */ - case 'l': /* both options need an argument */ - if (argv[i][2] == '\0') { /* no concatenated argument? */ - i++; /* try next 'argv' */ - if (argv[i] == NULL || argv[i][0] == '-') - return has_error; /* no next argument or it is another option */ - } - break; - default: /* invalid option */ - return has_error; - } - } - *first = 0; /* no script name */ - return args; -} - - -/* -** Processes options 'e' and 'l', which involve running Lua code, and -** 'W', which also affects the state. -** Returns 0 if some code raises an error. -*/ -static int runargs (lua_State *L, char **argv, int n) { - int i; - for (i = 1; i < n; i++) { - int option = argv[i][1]; - lua_assert(argv[i][0] == '-'); /* already checked */ - switch (option) { - case 'e': case 'l': { - int status; - char *extra = argv[i] + 2; /* both options need an argument */ - if (*extra == '\0') extra = argv[++i]; - lua_assert(extra != NULL); - status = (option == 'e') - ? dostring(L, extra, "=(command line)") - : dolibrary(L, extra); - if (status != LUA_OK) return 0; - break; - } - case 'W': - lua_warning(L, "@on", 0); /* warnings on */ - break; - } - } - return 1; -} - - -static int handle_luainit (lua_State *L) { - const char *name = "=" LUA_INITVARVERSION; - const char *init = getenv(name + 1); - if (init == NULL) { - name = "=" LUA_INIT_VAR; - init = getenv(name + 1); /* try alternative name */ - } - if (init == NULL) return LUA_OK; - else if (init[0] == '@') - return dofile(L, init+1); - else - return dostring(L, init, name); -} - - -/* -** {================================================================== -** Read-Eval-Print Loop (REPL) -** =================================================================== -*/ - -#if !defined(LUA_PROMPT) -#define LUA_PROMPT "> " -#define LUA_PROMPT2 ">> " -#endif - -#if !defined(LUA_MAXINPUT) -#define LUA_MAXINPUT 512 -#endif - - -/* -** lua_stdin_is_tty detects whether the standard input is a 'tty' (that -** is, whether we're running lua interactively). -*/ -#if !defined(lua_stdin_is_tty) /* { */ - -#if defined(LUA_USE_POSIX) /* { */ - -#include -#define lua_stdin_is_tty() isatty(0) - -#elif defined(LUA_USE_WINDOWS) /* }{ */ - -#include -#include - -#define lua_stdin_is_tty() _isatty(_fileno(stdin)) - -#else /* }{ */ - -/* ISO C definition */ -#define lua_stdin_is_tty() 1 /* assume stdin is a tty */ - -#endif /* } */ - -#endif /* } */ - - -/* -** lua_readline defines how to show a prompt and then read a line from -** the standard input. -** lua_saveline defines how to "save" a read line in a "history". -** lua_freeline defines how to free a line read by lua_readline. -*/ -#if !defined(lua_readline) /* { */ - -#if defined(LUA_USE_READLINE) /* { */ - -#include -#include -#define lua_initreadline(L) ((void)L, rl_readline_name="lua") -#define lua_readline(L,b,p) ((void)L, ((b)=readline(p)) != NULL) -#define lua_saveline(L,line) ((void)L, add_history(line)) -#define lua_freeline(L,b) ((void)L, free(b)) - -#else /* }{ */ - -#define lua_initreadline(L) ((void)L) -#define lua_readline(L,b,p) \ - ((void)L, fputs(p, stdout), fflush(stdout), /* show prompt */ \ - fgets(b, LUA_MAXINPUT, stdin) != NULL) /* get line */ -#define lua_saveline(L,line) { (void)L; (void)line; } -#define lua_freeline(L,b) { (void)L; (void)b; } - -#endif /* } */ - -#endif /* } */ - - -/* -** Return the string to be used as a prompt by the interpreter. Leave -** the string (or nil, if using the default value) on the stack, to keep -** it anchored. -*/ -static const char *get_prompt (lua_State *L, int firstline) { - if (lua_getglobal(L, firstline ? "_PROMPT" : "_PROMPT2") == LUA_TNIL) - return (firstline ? LUA_PROMPT : LUA_PROMPT2); /* use the default */ - else { /* apply 'tostring' over the value */ - const char *p = luaL_tolstring(L, -1, NULL); - lua_remove(L, -2); /* remove original value */ - return p; - } -} - -/* mark in error messages for incomplete statements */ -#define EOFMARK "" -#define marklen (sizeof(EOFMARK)/sizeof(char) - 1) - - -/* -** Check whether 'status' signals a syntax error and the error -** message at the top of the stack ends with the above mark for -** incomplete statements. -*/ -static int incomplete (lua_State *L, int status) { - if (status == LUA_ERRSYNTAX) { - size_t lmsg; - const char *msg = lua_tolstring(L, -1, &lmsg); - if (lmsg >= marklen && strcmp(msg + lmsg - marklen, EOFMARK) == 0) { - lua_pop(L, 1); - return 1; - } - } - return 0; /* else... */ -} - - -/* -** Prompt the user, read a line, and push it into the Lua stack. -*/ -static int pushline (lua_State *L, int firstline) { - char buffer[LUA_MAXINPUT]; - char *b = buffer; - size_t l; - const char *prmt = get_prompt(L, firstline); - int readstatus = lua_readline(L, b, prmt); - if (readstatus == 0) - return 0; /* no input (prompt will be popped by caller) */ - lua_pop(L, 1); /* remove prompt */ - l = strlen(b); - if (l > 0 && b[l-1] == '\n') /* line ends with newline? */ - b[--l] = '\0'; /* remove it */ - if (firstline && b[0] == '=') /* for compatibility with 5.2, ... */ - lua_pushfstring(L, "return %s", b + 1); /* change '=' to 'return' */ - else - lua_pushlstring(L, b, l); - lua_freeline(L, b); - return 1; -} - - -/* -** Try to compile line on the stack as 'return ;'; on return, stack -** has either compiled chunk or original line (if compilation failed). -*/ -static int addreturn (lua_State *L) { - const char *line = lua_tostring(L, -1); /* original line */ - const char *retline = lua_pushfstring(L, "return %s;", line); - int status = luaL_loadbuffer(L, retline, strlen(retline), "=stdin"); - if (status == LUA_OK) { - lua_remove(L, -2); /* remove modified line */ - if (line[0] != '\0') /* non empty? */ - lua_saveline(L, line); /* keep history */ - } - else - lua_pop(L, 2); /* pop result from 'luaL_loadbuffer' and modified line */ - return status; -} - - -/* -** Read multiple lines until a complete Lua statement -*/ -static int multiline (lua_State *L) { - for (;;) { /* repeat until gets a complete statement */ - size_t len; - const char *line = lua_tolstring(L, 1, &len); /* get what it has */ - int status = luaL_loadbuffer(L, line, len, "=stdin"); /* try it */ - if (!incomplete(L, status) || !pushline(L, 0)) { - lua_saveline(L, line); /* keep history */ - return status; /* cannot or should not try to add continuation line */ - } - lua_pushliteral(L, "\n"); /* add newline... */ - lua_insert(L, -2); /* ...between the two lines */ - lua_concat(L, 3); /* join them */ - } -} - - -/* -** Read a line and try to load (compile) it first as an expression (by -** adding "return " in front of it) and second as a statement. Return -** the final status of load/call with the resulting function (if any) -** in the top of the stack. -*/ -static int loadline (lua_State *L) { - int status; - lua_settop(L, 0); - if (!pushline(L, 1)) - return -1; /* no input */ - if ((status = addreturn(L)) != LUA_OK) /* 'return ...' did not work? */ - status = multiline(L); /* try as command, maybe with continuation lines */ - lua_remove(L, 1); /* remove line from the stack */ - lua_assert(lua_gettop(L) == 1); - return status; -} - - -/* -** Prints (calling the Lua 'print' function) any values on the stack -*/ -static void l_print (lua_State *L) { - int n = lua_gettop(L); - if (n > 0) { /* any result to be printed? */ - luaL_checkstack(L, LUA_MINSTACK, "too many results to print"); - lua_getglobal(L, "print"); - lua_insert(L, 1); - if (lua_pcall(L, n, 0, 0) != LUA_OK) - l_message(progname, lua_pushfstring(L, "error calling 'print' (%s)", - lua_tostring(L, -1))); - } -} - - -/* -** Do the REPL: repeatedly read (load) a line, evaluate (call) it, and -** print any results. -*/ -static void doREPL (lua_State *L) { - int status; - const char *oldprogname = progname; - progname = NULL; /* no 'progname' on errors in interactive mode */ - lua_initreadline(L); - while ((status = loadline(L)) != -1) { - if (status == LUA_OK) - status = docall(L, 0, LUA_MULTRET); - if (status == LUA_OK) l_print(L); - else report(L, status); - } - lua_settop(L, 0); /* clear stack */ - lua_writeline(); - progname = oldprogname; -} - -/* }================================================================== */ - -#if !defined(luai_openlibs) -#define luai_openlibs(L) luaL_openselectedlibs(L, ~0, 0) -#endif - - -/* -** Main body of stand-alone interpreter (to be called in protected mode). -** Reads the options and handles them all. -*/ -static int pmain (lua_State *L) { - int argc = (int)lua_tointeger(L, 1); - char **argv = (char **)lua_touserdata(L, 2); - int script; - int args = collectargs(argv, &script); - int optlim = (script > 0) ? script : argc; /* first argv not an option */ - luaL_checkversion(L); /* check that interpreter has correct version */ - if (args == has_error) { /* bad arg? */ - print_usage(argv[script]); /* 'script' has index of bad arg. */ - return 0; - } - if (args & has_v) /* option '-v'? */ - print_version(); - if (args & has_E) { /* option '-E'? */ - lua_pushboolean(L, 1); /* signal for libraries to ignore env. vars. */ - lua_setfield(L, LUA_REGISTRYINDEX, "LUA_NOENV"); - } - luai_openlibs(L); /* open standard libraries */ - createargtable(L, argv, argc, script); /* create table 'arg' */ - lua_gc(L, LUA_GCRESTART); /* start GC... */ - lua_gc(L, LUA_GCGEN); /* ...in generational mode */ - if (!(args & has_E)) { /* no option '-E'? */ - if (handle_luainit(L) != LUA_OK) /* run LUA_INIT */ - return 0; /* error running LUA_INIT */ - } - if (!runargs(L, argv, optlim)) /* execute arguments -e and -l */ - return 0; /* something failed */ - if (script > 0) { /* execute main script (if there is one) */ - if (handle_script(L, argv + script) != LUA_OK) - return 0; /* interrupt in case of error */ - } - if (args & has_i) /* -i option? */ - doREPL(L); /* do read-eval-print loop */ - else if (script < 1 && !(args & (has_e | has_v))) { /* no active option? */ - if (lua_stdin_is_tty()) { /* running in interactive mode? */ - print_version(); - doREPL(L); /* do read-eval-print loop */ - } - else dofile(L, NULL); /* executes stdin as a file */ - } - lua_pushboolean(L, 1); /* signal no errors */ - return 1; -} - - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lua.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lua.h deleted file mode 100644 index b6934e6..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lua.h +++ /dev/null @@ -1,551 +0,0 @@ -/* -** $Id: lua.h $ -** Lua - A Scripting Language -** Lua.org, PUC-Rio, Brazil (www.lua.org) -** See Copyright Notice at the end of this file -*/ - - -#ifndef lua_h -#define lua_h - -#include -#include - - -#define LUA_COPYRIGHT LUA_RELEASE " Copyright (C) 1994-2023 Lua.org, PUC-Rio" -#define LUA_AUTHORS "R. Ierusalimschy, L. H. de Figueiredo, W. Celes" - - -#define LUA_VERSION_MAJOR_N 5 -#define LUA_VERSION_MINOR_N 5 -#define LUA_VERSION_RELEASE_N 0 - -#define LUA_VERSION_NUM (LUA_VERSION_MAJOR_N * 100 + LUA_VERSION_MINOR_N) -#define LUA_VERSION_RELEASE_NUM (LUA_VERSION_NUM * 100 + LUA_VERSION_RELEASE_N) - - -#include "luaconf.h" - - -/* mark for precompiled code ('Lua') */ -#define LUA_SIGNATURE "\x1bLua" - -/* option for multiple returns in 'lua_pcall' and 'lua_call' */ -#define LUA_MULTRET (-1) - - -/* -** Pseudo-indices -** (-LUAI_MAXSTACK is the minimum valid index; we keep some free empty -** space after that to help overflow detection) -*/ -#define LUA_REGISTRYINDEX (-LUAI_MAXSTACK - 1000) -#define lua_upvalueindex(i) (LUA_REGISTRYINDEX - (i)) - - -/* thread status */ -#define LUA_OK 0 -#define LUA_YIELD 1 -#define LUA_ERRRUN 2 -#define LUA_ERRSYNTAX 3 -#define LUA_ERRMEM 4 -#define LUA_ERRERR 5 - - -typedef struct lua_State lua_State; - - -/* -** basic types -*/ -#define LUA_TNONE (-1) - -#define LUA_TNIL 0 -#define LUA_TBOOLEAN 1 -#define LUA_TLIGHTUSERDATA 2 -#define LUA_TNUMBER 3 -#define LUA_TSTRING 4 -#define LUA_TTABLE 5 -#define LUA_TFUNCTION 6 -#define LUA_TUSERDATA 7 -#define LUA_TTHREAD 8 - -#define LUA_NUMTYPES 9 - - - -/* minimum Lua stack available to a C function */ -#define LUA_MINSTACK 20 - - -/* predefined values in the registry */ -/* index 1 is reserved for the reference mechanism */ -#define LUA_RIDX_GLOBALS 2 -#define LUA_RIDX_MAINTHREAD 3 -#define LUA_RIDX_LAST 3 - - -/* type of numbers in Lua */ -typedef LUA_NUMBER lua_Number; - - -/* type for integer functions */ -typedef LUA_INTEGER lua_Integer; - -/* unsigned integer type */ -typedef LUA_UNSIGNED lua_Unsigned; - -/* type for continuation-function contexts */ -typedef LUA_KCONTEXT lua_KContext; - - -/* -** Type for C functions registered with Lua -*/ -typedef int (*lua_CFunction) (lua_State *L); - -/* -** Type for continuation functions -*/ -typedef int (*lua_KFunction) (lua_State *L, int status, lua_KContext ctx); - - -/* -** Type for functions that read/write blocks when loading/dumping Lua chunks -*/ -typedef const char * (*lua_Reader) (lua_State *L, void *ud, size_t *sz); - -typedef int (*lua_Writer) (lua_State *L, const void *p, size_t sz, void *ud); - - -/* -** Type for memory-allocation functions -*/ -typedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize); - - -/* -** Type for warning functions -*/ -typedef void (*lua_WarnFunction) (void *ud, const char *msg, int tocont); - - -/* -** Type used by the debug API to collect debug information -*/ -typedef struct lua_Debug lua_Debug; - - -/* -** Functions to be called by the debugger in specific events -*/ -typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar); - - -/* -** generic extra include file -*/ -#if defined(LUA_USER_H) -#include LUA_USER_H -#endif - - -/* -** RCS ident string -*/ -extern const char lua_ident[]; - - -/* -** state manipulation -*/ -LUA_API lua_State *(lua_newstate) (lua_Alloc f, void *ud, unsigned seed); -LUA_API void (lua_close) (lua_State *L); -LUA_API lua_State *(lua_newthread) (lua_State *L); -LUA_API int (lua_closethread) (lua_State *L, lua_State *from); - -LUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf); - - -LUA_API lua_Number (lua_version) (lua_State *L); - - -/* -** basic stack manipulation -*/ -LUA_API int (lua_absindex) (lua_State *L, int idx); -LUA_API int (lua_gettop) (lua_State *L); -LUA_API void (lua_settop) (lua_State *L, int idx); -LUA_API void (lua_pushvalue) (lua_State *L, int idx); -LUA_API void (lua_rotate) (lua_State *L, int idx, int n); -LUA_API void (lua_copy) (lua_State *L, int fromidx, int toidx); -LUA_API int (lua_checkstack) (lua_State *L, int n); - -LUA_API void (lua_xmove) (lua_State *from, lua_State *to, int n); - - -/* -** access functions (stack -> C) -*/ - -LUA_API int (lua_isnumber) (lua_State *L, int idx); -LUA_API int (lua_isstring) (lua_State *L, int idx); -LUA_API int (lua_iscfunction) (lua_State *L, int idx); -LUA_API int (lua_isinteger) (lua_State *L, int idx); -LUA_API int (lua_isuserdata) (lua_State *L, int idx); -LUA_API int (lua_type) (lua_State *L, int idx); -LUA_API const char *(lua_typename) (lua_State *L, int tp); - -LUA_API lua_Number (lua_tonumberx) (lua_State *L, int idx, int *isnum); -LUA_API lua_Integer (lua_tointegerx) (lua_State *L, int idx, int *isnum); -LUA_API int (lua_toboolean) (lua_State *L, int idx); -LUA_API const char *(lua_tolstring) (lua_State *L, int idx, size_t *len); -LUA_API lua_Unsigned (lua_rawlen) (lua_State *L, int idx); -LUA_API lua_CFunction (lua_tocfunction) (lua_State *L, int idx); -LUA_API void *(lua_touserdata) (lua_State *L, int idx); -LUA_API lua_State *(lua_tothread) (lua_State *L, int idx); -LUA_API const void *(lua_topointer) (lua_State *L, int idx); - - -/* -** Comparison and arithmetic functions -*/ - -#define LUA_OPADD 0 /* ORDER TM, ORDER OP */ -#define LUA_OPSUB 1 -#define LUA_OPMUL 2 -#define LUA_OPMOD 3 -#define LUA_OPPOW 4 -#define LUA_OPDIV 5 -#define LUA_OPIDIV 6 -#define LUA_OPBAND 7 -#define LUA_OPBOR 8 -#define LUA_OPBXOR 9 -#define LUA_OPSHL 10 -#define LUA_OPSHR 11 -#define LUA_OPUNM 12 -#define LUA_OPBNOT 13 - -LUA_API void (lua_arith) (lua_State *L, int op); - -#define LUA_OPEQ 0 -#define LUA_OPLT 1 -#define LUA_OPLE 2 - -LUA_API int (lua_rawequal) (lua_State *L, int idx1, int idx2); -LUA_API int (lua_compare) (lua_State *L, int idx1, int idx2, int op); - - -/* -** push functions (C -> stack) -*/ -LUA_API void (lua_pushnil) (lua_State *L); -LUA_API void (lua_pushnumber) (lua_State *L, lua_Number n); -LUA_API void (lua_pushinteger) (lua_State *L, lua_Integer n); -LUA_API const char *(lua_pushlstring) (lua_State *L, const char *s, size_t len); -LUA_API const char *(lua_pushextlstring) (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud); -LUA_API const char *(lua_pushstring) (lua_State *L, const char *s); -LUA_API const char *(lua_pushvfstring) (lua_State *L, const char *fmt, - va_list argp); -LUA_API const char *(lua_pushfstring) (lua_State *L, const char *fmt, ...); -LUA_API void (lua_pushcclosure) (lua_State *L, lua_CFunction fn, int n); -LUA_API void (lua_pushboolean) (lua_State *L, int b); -LUA_API void (lua_pushlightuserdata) (lua_State *L, void *p); -LUA_API int (lua_pushthread) (lua_State *L); - - -/* -** get functions (Lua -> stack) -*/ -LUA_API int (lua_getglobal) (lua_State *L, const char *name); -LUA_API int (lua_gettable) (lua_State *L, int idx); -LUA_API int (lua_getfield) (lua_State *L, int idx, const char *k); -LUA_API int (lua_geti) (lua_State *L, int idx, lua_Integer n); -LUA_API int (lua_rawget) (lua_State *L, int idx); -LUA_API int (lua_rawgeti) (lua_State *L, int idx, lua_Integer n); -LUA_API int (lua_rawgetp) (lua_State *L, int idx, const void *p); - -LUA_API void (lua_createtable) (lua_State *L, unsigned narr, unsigned nrec); -LUA_API void *(lua_newuserdatauv) (lua_State *L, size_t sz, int nuvalue); -LUA_API int (lua_getmetatable) (lua_State *L, int objindex); -LUA_API int (lua_getiuservalue) (lua_State *L, int idx, int n); - - -/* -** set functions (stack -> Lua) -*/ -LUA_API void (lua_setglobal) (lua_State *L, const char *name); -LUA_API void (lua_settable) (lua_State *L, int idx); -LUA_API void (lua_setfield) (lua_State *L, int idx, const char *k); -LUA_API void (lua_seti) (lua_State *L, int idx, lua_Integer n); -LUA_API void (lua_rawset) (lua_State *L, int idx); -LUA_API void (lua_rawseti) (lua_State *L, int idx, lua_Integer n); -LUA_API void (lua_rawsetp) (lua_State *L, int idx, const void *p); -LUA_API int (lua_setmetatable) (lua_State *L, int objindex); -LUA_API int (lua_setiuservalue) (lua_State *L, int idx, int n); - - -/* -** 'load' and 'call' functions (load and run Lua code) -*/ -LUA_API void (lua_callk) (lua_State *L, int nargs, int nresults, - lua_KContext ctx, lua_KFunction k); -#define lua_call(L,n,r) lua_callk(L, (n), (r), 0, NULL) - -LUA_API int (lua_pcallk) (lua_State *L, int nargs, int nresults, int errfunc, - lua_KContext ctx, lua_KFunction k); -#define lua_pcall(L,n,r,f) lua_pcallk(L, (n), (r), (f), 0, NULL) - -LUA_API int (lua_load) (lua_State *L, lua_Reader reader, void *dt, - const char *chunkname, const char *mode); - -LUA_API int (lua_dump) (lua_State *L, lua_Writer writer, void *data, int strip); - - -/* -** coroutine functions -*/ -LUA_API int (lua_yieldk) (lua_State *L, int nresults, lua_KContext ctx, - lua_KFunction k); -LUA_API int (lua_resume) (lua_State *L, lua_State *from, int narg, - int *nres); -LUA_API int (lua_status) (lua_State *L); -LUA_API int (lua_isyieldable) (lua_State *L); - -#define lua_yield(L,n) lua_yieldk(L, (n), 0, NULL) - - -/* -** Warning-related functions -*/ -LUA_API void (lua_setwarnf) (lua_State *L, lua_WarnFunction f, void *ud); -LUA_API void (lua_warning) (lua_State *L, const char *msg, int tocont); - - -/* -** garbage-collection options -*/ - -#define LUA_GCSTOP 0 -#define LUA_GCRESTART 1 -#define LUA_GCCOLLECT 2 -#define LUA_GCCOUNT 3 -#define LUA_GCCOUNTB 4 -#define LUA_GCSTEP 5 -#define LUA_GCISRUNNING 6 -#define LUA_GCGEN 7 -#define LUA_GCINC 8 -#define LUA_GCPARAM 9 - - -/* -** garbage-collection parameters -*/ -/* parameters for generational mode */ -#define LUA_GCPMINORMUL 0 /* control minor collections */ -#define LUA_GCPMAJORMINOR 1 /* control shift major->minor */ -#define LUA_GCPMINORMAJOR 2 /* control shift minor->major */ - -/* parameters for incremental mode */ -#define LUA_GCPPAUSE 3 /* size of pause between successive GCs */ -#define LUA_GCPSTEPMUL 4 /* GC "speed" */ -#define LUA_GCPSTEPSIZE 5 /* GC granularity */ - -/* number of parameters */ -#define LUA_GCPN 6 - - -LUA_API int (lua_gc) (lua_State *L, int what, ...); - - -/* -** miscellaneous functions -*/ - -LUA_API int (lua_error) (lua_State *L); - -LUA_API int (lua_next) (lua_State *L, int idx); - -LUA_API void (lua_concat) (lua_State *L, int n); -LUA_API void (lua_len) (lua_State *L, int idx); - -LUA_API size_t (lua_stringtonumber) (lua_State *L, const char *s); - -LUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud); -LUA_API void (lua_setallocf) (lua_State *L, lua_Alloc f, void *ud); - -LUA_API void (lua_toclose) (lua_State *L, int idx); -LUA_API void (lua_closeslot) (lua_State *L, int idx); - - -/* -** {============================================================== -** some useful macros -** =============================================================== -*/ - -#define lua_getextraspace(L) ((void *)((char *)(L) - LUA_EXTRASPACE)) - -#define lua_tonumber(L,i) lua_tonumberx(L,(i),NULL) -#define lua_tointeger(L,i) lua_tointegerx(L,(i),NULL) - -#define lua_pop(L,n) lua_settop(L, -(n)-1) - -#define lua_newtable(L) lua_createtable(L, 0, 0) - -#define lua_register(L,n,f) (lua_pushcfunction(L, (f)), lua_setglobal(L, (n))) - -#define lua_pushcfunction(L,f) lua_pushcclosure(L, (f), 0) - -#define lua_isfunction(L,n) (lua_type(L, (n)) == LUA_TFUNCTION) -#define lua_istable(L,n) (lua_type(L, (n)) == LUA_TTABLE) -#define lua_islightuserdata(L,n) (lua_type(L, (n)) == LUA_TLIGHTUSERDATA) -#define lua_isnil(L,n) (lua_type(L, (n)) == LUA_TNIL) -#define lua_isboolean(L,n) (lua_type(L, (n)) == LUA_TBOOLEAN) -#define lua_isthread(L,n) (lua_type(L, (n)) == LUA_TTHREAD) -#define lua_isnone(L,n) (lua_type(L, (n)) == LUA_TNONE) -#define lua_isnoneornil(L, n) (lua_type(L, (n)) <= 0) - -#define lua_pushliteral(L, s) lua_pushstring(L, "" s) - -#define lua_pushglobaltable(L) \ - ((void)lua_rawgeti(L, LUA_REGISTRYINDEX, LUA_RIDX_GLOBALS)) - -#define lua_tostring(L,i) lua_tolstring(L, (i), NULL) - - -#define lua_insert(L,idx) lua_rotate(L, (idx), 1) - -#define lua_remove(L,idx) (lua_rotate(L, (idx), -1), lua_pop(L, 1)) - -#define lua_replace(L,idx) (lua_copy(L, -1, (idx)), lua_pop(L, 1)) - -/* }============================================================== */ - - -/* -** {============================================================== -** compatibility macros -** =============================================================== -*/ -#if defined(LUA_COMPAT_APIINTCASTS) - -#define lua_pushunsigned(L,n) lua_pushinteger(L, (lua_Integer)(n)) -#define lua_tounsignedx(L,i,is) ((lua_Unsigned)lua_tointegerx(L,i,is)) -#define lua_tounsigned(L,i) lua_tounsignedx(L,(i),NULL) - -#endif - -#define lua_newuserdata(L,s) lua_newuserdatauv(L,s,1) -#define lua_getuservalue(L,idx) lua_getiuservalue(L,idx,1) -#define lua_setuservalue(L,idx) lua_setiuservalue(L,idx,1) - -#define lua_resetthread(L) lua_closethread(L,NULL) - -/* }============================================================== */ - -/* -** {====================================================================== -** Debug API -** ======================================================================= -*/ - - -/* -** Event codes -*/ -#define LUA_HOOKCALL 0 -#define LUA_HOOKRET 1 -#define LUA_HOOKLINE 2 -#define LUA_HOOKCOUNT 3 -#define LUA_HOOKTAILCALL 4 - - -/* -** Event masks -*/ -#define LUA_MASKCALL (1 << LUA_HOOKCALL) -#define LUA_MASKRET (1 << LUA_HOOKRET) -#define LUA_MASKLINE (1 << LUA_HOOKLINE) -#define LUA_MASKCOUNT (1 << LUA_HOOKCOUNT) - - -LUA_API int (lua_getstack) (lua_State *L, int level, lua_Debug *ar); -LUA_API int (lua_getinfo) (lua_State *L, const char *what, lua_Debug *ar); -LUA_API const char *(lua_getlocal) (lua_State *L, const lua_Debug *ar, int n); -LUA_API const char *(lua_setlocal) (lua_State *L, const lua_Debug *ar, int n); -LUA_API const char *(lua_getupvalue) (lua_State *L, int funcindex, int n); -LUA_API const char *(lua_setupvalue) (lua_State *L, int funcindex, int n); - -LUA_API void *(lua_upvalueid) (lua_State *L, int fidx, int n); -LUA_API void (lua_upvaluejoin) (lua_State *L, int fidx1, int n1, - int fidx2, int n2); - -LUA_API void (lua_sethook) (lua_State *L, lua_Hook func, int mask, int count); -LUA_API lua_Hook (lua_gethook) (lua_State *L); -LUA_API int (lua_gethookmask) (lua_State *L); -LUA_API int (lua_gethookcount) (lua_State *L); - - -struct lua_Debug { - int event; - const char *name; /* (n) */ - const char *namewhat; /* (n) 'global', 'local', 'field', 'method' */ - const char *what; /* (S) 'Lua', 'C', 'main', 'tail' */ - const char *source; /* (S) */ - size_t srclen; /* (S) */ - int currentline; /* (l) */ - int linedefined; /* (S) */ - int lastlinedefined; /* (S) */ - unsigned char nups; /* (u) number of upvalues */ - unsigned char nparams;/* (u) number of parameters */ - char isvararg; /* (u) */ - char istailcall; /* (t) */ - unsigned short ftransfer; /* (r) index of first value transferred */ - unsigned short ntransfer; /* (r) number of transferred values */ - char short_src[LUA_IDSIZE]; /* (S) */ - /* private part */ - struct CallInfo *i_ci; /* active function */ -}; - -/* }====================================================================== */ - - -#define LUAI_TOSTRAUX(x) #x -#define LUAI_TOSTR(x) LUAI_TOSTRAUX(x) - -#define LUA_VERSION_MAJOR LUAI_TOSTR(LUA_VERSION_MAJOR_N) -#define LUA_VERSION_MINOR LUAI_TOSTR(LUA_VERSION_MINOR_N) -#define LUA_VERSION_RELEASE LUAI_TOSTR(LUA_VERSION_RELEASE_N) - -#define LUA_VERSION "Lua " LUA_VERSION_MAJOR "." LUA_VERSION_MINOR -#define LUA_RELEASE LUA_VERSION "." LUA_VERSION_RELEASE - - -/****************************************************************************** -* Copyright (C) 1994-2023 Lua.org, PUC-Rio. -* -* Permission is hereby granted, free of charge, to any person obtaining -* a copy of this software and associated documentation files (the -* "Software"), to deal in the Software without restriction, including -* without limitation the rights to use, copy, modify, merge, publish, -* distribute, sublicense, and/or sell copies of the Software, and to -* permit persons to whom the Software is furnished to do so, subject to -* the following conditions: -* -* The above copyright notice and this permission notice shall be -* included in all copies or substantial portions of the Software. -* -* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. -* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY -* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, -* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE -* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. -******************************************************************************/ - - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/luaconf.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/luaconf.h deleted file mode 100644 index aea48de..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/luaconf.h +++ /dev/null @@ -1,802 +0,0 @@ -/* -** $Id: luaconf.h $ -** Configuration file for Lua -** See Copyright Notice in lua.h -*/ - - -#ifndef luaconf_h -#define luaconf_h - -#include -#include - - -/* -** =================================================================== -** General Configuration File for Lua -** -** Some definitions here can be changed externally, through the compiler -** (e.g., with '-D' options): They are commented out or protected -** by '#if !defined' guards. However, several other definitions -** should be changed directly here, either because they affect the -** Lua ABI (by making the changes here, you ensure that all software -** connected to Lua, such as C libraries, will be compiled with the same -** configuration); or because they are seldom changed. -** -** Search for "@@" to find all configurable definitions. -** =================================================================== -*/ - - -/* -** {==================================================================== -** System Configuration: macros to adapt (if needed) Lua to some -** particular platform, for instance restricting it to C89. -** ===================================================================== -*/ - -/* -@@ LUA_USE_C89 controls the use of non-ISO-C89 features. -** Define it if you want Lua to avoid the use of a few C99 features -** or Windows-specific features on Windows. -*/ -/* #define LUA_USE_C89 */ - - -/* -** By default, Lua on Windows use (some) specific Windows features -*/ -#if !defined(LUA_USE_C89) && defined(_WIN32) && !defined(_WIN32_WCE) -#define LUA_USE_WINDOWS /* enable goodies for regular Windows */ -#endif - - -#if defined(LUA_USE_WINDOWS) -#define LUA_DL_DLL /* enable support for DLL */ -#define LUA_USE_C89 /* broadly, Windows is C89 */ -#endif - - -#if defined(LUA_USE_LINUX) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN /* needs an extra library: -ldl */ -#endif - - -#if defined(LUA_USE_MACOSX) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN /* MacOS does not need -ldl */ -#endif - - -#if defined(LUA_USE_IOS) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN -#endif - - -/* -@@ LUAI_IS32INT is true iff 'int' has (at least) 32 bits. -*/ -#define LUAI_IS32INT ((UINT_MAX >> 30) >= 3) - -/* }================================================================== */ - - - -/* -** {================================================================== -** Configuration for Number types. These options should not be -** set externally, because any other code connected to Lua must -** use the same configuration. -** =================================================================== -*/ - -/* -@@ LUA_INT_TYPE defines the type for Lua integers. -@@ LUA_FLOAT_TYPE defines the type for Lua floats. -** Lua should work fine with any mix of these options supported -** by your C compiler. The usual configurations are 64-bit integers -** and 'double' (the default), 32-bit integers and 'float' (for -** restricted platforms), and 'long'/'double' (for C compilers not -** compliant with C99, which may not have support for 'long long'). -*/ - -/* predefined options for LUA_INT_TYPE */ -#define LUA_INT_INT 1 -#define LUA_INT_LONG 2 -#define LUA_INT_LONGLONG 3 - -/* predefined options for LUA_FLOAT_TYPE */ -#define LUA_FLOAT_FLOAT 1 -#define LUA_FLOAT_DOUBLE 2 -#define LUA_FLOAT_LONGDOUBLE 3 - - -/* Default configuration ('long long' and 'double', for 64-bit Lua) */ -#define LUA_INT_DEFAULT LUA_INT_LONGLONG -#define LUA_FLOAT_DEFAULT LUA_FLOAT_DOUBLE - - -/* -@@ LUA_32BITS enables Lua with 32-bit integers and 32-bit floats. -*/ -#define LUA_32BITS 0 - - -/* -@@ LUA_C89_NUMBERS ensures that Lua uses the largest types available for -** C89 ('long' and 'double'); Windows always has '__int64', so it does -** not need to use this case. -*/ -#if defined(LUA_USE_C89) && !defined(LUA_USE_WINDOWS) -#define LUA_C89_NUMBERS 1 -#else -#define LUA_C89_NUMBERS 0 -#endif - - -#if LUA_32BITS /* { */ -/* -** 32-bit integers and 'float' -*/ -#if LUAI_IS32INT /* use 'int' if big enough */ -#define LUA_INT_TYPE LUA_INT_INT -#else /* otherwise use 'long' */ -#define LUA_INT_TYPE LUA_INT_LONG -#endif -#define LUA_FLOAT_TYPE LUA_FLOAT_FLOAT - -#elif LUA_C89_NUMBERS /* }{ */ -/* -** largest types available for C89 ('long' and 'double') -*/ -#define LUA_INT_TYPE LUA_INT_LONG -#define LUA_FLOAT_TYPE LUA_FLOAT_DOUBLE - -#else /* }{ */ -/* use defaults */ - -#define LUA_INT_TYPE LUA_INT_DEFAULT -#define LUA_FLOAT_TYPE LUA_FLOAT_DEFAULT - -#endif /* } */ - - -/* }================================================================== */ - - - -/* -** {================================================================== -** Configuration for Paths. -** =================================================================== -*/ - -/* -** LUA_PATH_SEP is the character that separates templates in a path. -** LUA_PATH_MARK is the string that marks the substitution points in a -** template. -** LUA_EXEC_DIR in a Windows path is replaced by the executable's -** directory. -*/ -#define LUA_PATH_SEP ";" -#define LUA_PATH_MARK "?" -#define LUA_EXEC_DIR "!" - - -/* -@@ LUA_PATH_DEFAULT is the default path that Lua uses to look for -** Lua libraries. -@@ LUA_CPATH_DEFAULT is the default path that Lua uses to look for -** C libraries. -** CHANGE them if your machine has a non-conventional directory -** hierarchy or if you want to install your libraries in -** non-conventional directories. -*/ - -#define LUA_VDIR LUA_VERSION_MAJOR "." LUA_VERSION_MINOR -#if defined(_WIN32) /* { */ -/* -** In Windows, any exclamation mark ('!') in the path is replaced by the -** path of the directory of the executable file of the current process. -*/ -#define LUA_LDIR "!\\lua\\" -#define LUA_CDIR "!\\" -#define LUA_SHRDIR "!\\..\\share\\lua\\" LUA_VDIR "\\" - -#if !defined(LUA_PATH_DEFAULT) -#define LUA_PATH_DEFAULT \ - LUA_LDIR"?.lua;" LUA_LDIR"?\\init.lua;" \ - LUA_CDIR"?.lua;" LUA_CDIR"?\\init.lua;" \ - LUA_SHRDIR"?.lua;" LUA_SHRDIR"?\\init.lua;" \ - ".\\?.lua;" ".\\?\\init.lua" -#endif - -#if !defined(LUA_CPATH_DEFAULT) -#define LUA_CPATH_DEFAULT \ - LUA_CDIR"?.dll;" \ - LUA_CDIR"..\\lib\\lua\\" LUA_VDIR "\\?.dll;" \ - LUA_CDIR"loadall.dll;" ".\\?.dll" -#endif - -#else /* }{ */ - -#define LUA_ROOT "/usr/local/" -#define LUA_LDIR LUA_ROOT "share/lua/" LUA_VDIR "/" -#define LUA_CDIR LUA_ROOT "lib/lua/" LUA_VDIR "/" - -#if !defined(LUA_PATH_DEFAULT) -#define LUA_PATH_DEFAULT \ - LUA_LDIR"?.lua;" LUA_LDIR"?/init.lua;" \ - LUA_CDIR"?.lua;" LUA_CDIR"?/init.lua;" \ - "./?.lua;" "./?/init.lua" -#endif - -#if !defined(LUA_CPATH_DEFAULT) -#define LUA_CPATH_DEFAULT \ - LUA_CDIR"?.so;" LUA_CDIR"loadall.so;" "./?.so" -#endif - -#endif /* } */ - - -/* -@@ LUA_DIRSEP is the directory separator (for submodules). -** CHANGE it if your machine does not use "/" as the directory separator -** and is not Windows. (On Windows Lua automatically uses "\".) -*/ -#if !defined(LUA_DIRSEP) - -#if defined(_WIN32) -#define LUA_DIRSEP "\\" -#else -#define LUA_DIRSEP "/" -#endif - -#endif - - -/* -** LUA_IGMARK is a mark to ignore all after it when building the -** module name (e.g., used to build the luaopen_ function name). -** Typically, the sufix after the mark is the module version, -** as in "mod-v1.2.so". -*/ -#define LUA_IGMARK "-" - -/* }================================================================== */ - - -/* -** {================================================================== -** Marks for exported symbols in the C code -** =================================================================== -*/ - -/* -@@ LUA_API is a mark for all core API functions. -@@ LUALIB_API is a mark for all auxiliary library functions. -@@ LUAMOD_API is a mark for all standard library opening functions. -** CHANGE them if you need to define those functions in some special way. -** For instance, if you want to create one Windows DLL with the core and -** the libraries, you may want to use the following definition (define -** LUA_BUILD_AS_DLL to get it). -*/ -#if defined(LUA_BUILD_AS_DLL) /* { */ - -#if defined(LUA_CORE) || defined(LUA_LIB) /* { */ -#define LUA_API __declspec(dllexport) -#else /* }{ */ -#define LUA_API __declspec(dllimport) -#endif /* } */ - -#else /* }{ */ - -#define LUA_API extern - -#endif /* } */ - - -/* -** More often than not the libs go together with the core. -*/ -#define LUALIB_API LUA_API -#define LUAMOD_API LUA_API - - -/* -@@ LUAI_FUNC is a mark for all extern functions that are not to be -** exported to outside modules. -@@ LUAI_DDEF and LUAI_DDEC are marks for all extern (const) variables, -** none of which to be exported to outside modules (LUAI_DDEF for -** definitions and LUAI_DDEC for declarations). -** CHANGE them if you need to mark them in some special way. Elf/gcc -** (versions 3.2 and later) mark them as "hidden" to optimize access -** when Lua is compiled as a shared library. Not all elf targets support -** this attribute. Unfortunately, gcc does not offer a way to check -** whether the target offers that support, and those without support -** give a warning about it. To avoid these warnings, change to the -** default definition. -*/ -#if defined(__GNUC__) && ((__GNUC__*100 + __GNUC_MINOR__) >= 302) && \ - defined(__ELF__) /* { */ -#define LUAI_FUNC __attribute__((visibility("internal"))) extern -#else /* }{ */ -#define LUAI_FUNC extern -#endif /* } */ - -#define LUAI_DDEC(dec) LUAI_FUNC dec -#define LUAI_DDEF /* empty */ - -/* }================================================================== */ - - -/* -** {================================================================== -** Compatibility with previous versions -** =================================================================== -*/ - -/* -@@ LUA_COMPAT_5_3 controls other macros for compatibility with Lua 5.3. -** You can define it to get all options, or change specific options -** to fit your specific needs. -*/ -#if defined(LUA_COMPAT_5_3) /* { */ - -/* -@@ LUA_COMPAT_MATHLIB controls the presence of several deprecated -** functions in the mathematical library. -** (These functions were already officially removed in 5.3; -** nevertheless they are still available here.) -*/ -#define LUA_COMPAT_MATHLIB - -/* -@@ LUA_COMPAT_APIINTCASTS controls the presence of macros for -** manipulating other integer types (lua_pushunsigned, lua_tounsigned, -** luaL_checkint, luaL_checklong, etc.) -** (These macros were also officially removed in 5.3, but they are still -** available here.) -*/ -#define LUA_COMPAT_APIINTCASTS - - -/* -@@ LUA_COMPAT_LT_LE controls the emulation of the '__le' metamethod -** using '__lt'. -*/ -#define LUA_COMPAT_LT_LE - - -/* -@@ The following macros supply trivial compatibility for some -** changes in the API. The macros themselves document how to -** change your code to avoid using them. -** (Once more, these macros were officially removed in 5.3, but they are -** still available here.) -*/ -#define lua_strlen(L,i) lua_rawlen(L, (i)) - -#define lua_objlen(L,i) lua_rawlen(L, (i)) - -#define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ) -#define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT) - -#endif /* } */ - -/* }================================================================== */ - - - -/* -** {================================================================== -** Configuration for Numbers (low-level part). -** Change these definitions if no predefined LUA_FLOAT_* / LUA_INT_* -** satisfy your needs. -** =================================================================== -*/ - -/* -@@ LUAI_UACNUMBER is the result of a 'default argument promotion' -@@ over a floating number. -@@ l_floatatt(x) corrects float attribute 'x' to the proper float type -** by prefixing it with one of FLT/DBL/LDBL. -@@ LUA_NUMBER_FRMLEN is the length modifier for writing floats. -@@ LUA_NUMBER_FMT is the format for writing floats. -@@ lua_number2str converts a float to a string. -@@ l_mathop allows the addition of an 'l' or 'f' to all math operations. -@@ l_floor takes the floor of a float. -@@ lua_str2number converts a decimal numeral to a number. -*/ - - -/* The following definitions are good for most cases here */ - -#define l_floor(x) (l_mathop(private_lua_embed_floor)(x)) - -#define lua_number2str(s,sz,n) \ - l_sprintf((s), sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)(n)) - -/* -@@ lua_numbertointeger converts a float number with an integral value -** to an integer, or returns 0 if float is not within the range of -** a lua_Integer. (The range comparisons are tricky because of -** rounding. The tests here assume a two-complement representation, -** where MININTEGER always has an exact representation as a float; -** MAXINTEGER may not have one, and therefore its conversion to float -** may have an ill-defined value.) -*/ -#define lua_numbertointeger(n,p) \ - ((n) >= (LUA_NUMBER)(LUA_MININTEGER) && \ - (n) < -(LUA_NUMBER)(LUA_MININTEGER) && \ - (*(p) = (LUA_INTEGER)(n), 1)) - - -/* now the variable definitions */ - -#if LUA_FLOAT_TYPE == LUA_FLOAT_FLOAT /* { single float */ - -#define LUA_NUMBER float - -#define l_floatatt(n) (FLT_##n) - -#define LUAI_UACNUMBER double - -#define LUA_NUMBER_FRMLEN "" -#define LUA_NUMBER_FMT "%.7g" - -#define l_mathop(op) op##f - -#define lua_str2number(s,p) strtof((s), (p)) - - -#elif LUA_FLOAT_TYPE == LUA_FLOAT_LONGDOUBLE /* }{ long double */ - -#define LUA_NUMBER long double - -#define l_floatatt(n) (LDBL_##n) - -#define LUAI_UACNUMBER long double - -#define LUA_NUMBER_FRMLEN "L" -#define LUA_NUMBER_FMT "%.19Lg" - -#define l_mathop(op) op##l - -#define lua_str2number(s,p) strtold((s), (p)) - -#elif LUA_FLOAT_TYPE == LUA_FLOAT_DOUBLE /* }{ double */ - -#define LUA_NUMBER double - -#define l_floatatt(n) (DBL_##n) - -#define LUAI_UACNUMBER double - -#define LUA_NUMBER_FRMLEN "" -#define LUA_NUMBER_FMT "%.14g" - -#define l_mathop(op) op - -#define lua_str2number(s,p) strtod((s), (p)) - -#else /* }{ */ - -#error "numeric float type not defined" - -#endif /* } */ - - - -/* -@@ LUA_UNSIGNED is the unsigned version of LUA_INTEGER. -@@ LUAI_UACINT is the result of a 'default argument promotion' -@@ over a LUA_INTEGER. -@@ LUA_INTEGER_FRMLEN is the length modifier for reading/writing integers. -@@ LUA_INTEGER_FMT is the format for writing integers. -@@ LUA_MAXINTEGER is the maximum value for a LUA_INTEGER. -@@ LUA_MININTEGER is the minimum value for a LUA_INTEGER. -@@ LUA_MAXUNSIGNED is the maximum value for a LUA_UNSIGNED. -@@ lua_integer2str converts an integer to a string. -*/ - - -/* The following definitions are good for most cases here */ - -#define LUA_INTEGER_FMT "%" LUA_INTEGER_FRMLEN "d" - -#define LUAI_UACINT LUA_INTEGER - -#define lua_integer2str(s,sz,n) \ - l_sprintf((s), sz, LUA_INTEGER_FMT, (LUAI_UACINT)(n)) - -/* -** use LUAI_UACINT here to avoid problems with promotions (which -** can turn a comparison between unsigneds into a signed comparison) -*/ -#define LUA_UNSIGNED unsigned LUAI_UACINT - - -/* now the variable definitions */ - -#if LUA_INT_TYPE == LUA_INT_INT /* { int */ - -#define LUA_INTEGER int -#define LUA_INTEGER_FRMLEN "" - -#define LUA_MAXINTEGER INT_MAX -#define LUA_MININTEGER INT_MIN - -#define LUA_MAXUNSIGNED UINT_MAX - -#elif LUA_INT_TYPE == LUA_INT_LONG /* }{ long */ - -#define LUA_INTEGER long -#define LUA_INTEGER_FRMLEN "l" - -#define LUA_MAXINTEGER LONG_MAX -#define LUA_MININTEGER LONG_MIN - -#define LUA_MAXUNSIGNED ULONG_MAX - -#elif LUA_INT_TYPE == LUA_INT_LONGLONG /* }{ long long */ - -/* use presence of macro LLONG_MAX as proxy for C99 compliance */ -#if defined(LLONG_MAX) /* { */ -/* use ISO C99 stuff */ - -#define LUA_INTEGER long long -#define LUA_INTEGER_FRMLEN "ll" - -#define LUA_MAXINTEGER LLONG_MAX -#define LUA_MININTEGER LLONG_MIN - -#define LUA_MAXUNSIGNED ULLONG_MAX - -#elif defined(LUA_USE_WINDOWS) /* }{ */ -/* in Windows, can use specific Windows types */ - -#define LUA_INTEGER __int64 -#define LUA_INTEGER_FRMLEN "I64" - -#define LUA_MAXINTEGER _I64_MAX -#define LUA_MININTEGER _I64_MIN - -#define LUA_MAXUNSIGNED _UI64_MAX - -#else /* }{ */ - -#error "Compiler does not support 'long long'. Use option '-DLUA_32BITS' \ - or '-DLUA_C89_NUMBERS' (see file 'luaconf.h' for details)" - -#endif /* } */ - -#else /* }{ */ - -#error "numeric integer type not defined" - -#endif /* } */ - -/* }================================================================== */ - - -/* -** {================================================================== -** Dependencies with C99 and other C details -** =================================================================== -*/ - -/* -@@ l_sprintf is equivalent to 'snprintf' or 'sprintf' in C89. -** (All uses in Lua have only one format item.) -*/ -#if !defined(LUA_USE_C89) -#define l_sprintf(s,sz,f,i) snprintf(s,sz,f,i) -#else -#define l_sprintf(s,sz,f,i) ((void)(sz), sprintf(s,f,i)) -#endif - - -/* -@@ lua_strx2number converts a hexadecimal numeral to a number. -** In C99, 'strtod' does that conversion. Otherwise, you can -** leave 'lua_strx2number' undefined and Lua will provide its own -** implementation. -*/ -#if !defined(LUA_USE_C89) -#define lua_strx2number(s,p) lua_str2number(s,p) -#endif - - -/* -@@ lua_pointer2str converts a pointer to a readable string in a -** non-specified way. -*/ -#define lua_pointer2str(buff,sz,p) l_sprintf(buff,sz,"%p",p) - - -/* -@@ lua_number2strx converts a float to a hexadecimal numeral. -** In C99, 'sprintf' (with format specifiers '%a'/'%A') does that. -** Otherwise, you can leave 'lua_number2strx' undefined and Lua will -** provide its own implementation. -*/ -#if !defined(LUA_USE_C89) -#define lua_number2strx(L,b,sz,f,n) \ - ((void)L, l_sprintf(b,sz,f,(LUAI_UACNUMBER)(n))) -#endif - - -/* -** 'strtof' and 'opf' variants for math functions are not valid in -** C89. Otherwise, the macro 'HUGE_VALF' is a good proxy for testing the -** availability of these variants. ('math.h' is already included in -** all files that use these macros.) -*/ -#if defined(LUA_USE_C89) || (defined(HUGE_VAL) && !defined(HUGE_VALF)) -#undef l_mathop /* variants not available */ -#undef lua_str2number -#define l_mathop(op) (lua_Number)op /* no variant */ -#define lua_str2number(s,p) ((lua_Number)strtod((s), (p))) -#endif - - -/* -@@ LUA_KCONTEXT is the type of the context ('ctx') for continuation -** functions. It must be a numerical type; Lua will use 'intptr_t' if -** available, otherwise it will use 'ptrdiff_t' (the nearest thing to -** 'intptr_t' in C89) -*/ -#define LUA_KCONTEXT ptrdiff_t - -#if !defined(LUA_USE_C89) && defined(__STDC_VERSION__) && \ - __STDC_VERSION__ >= 199901L -#include -#if defined(INTPTR_MAX) /* even in C99 this type is optional */ -#undef LUA_KCONTEXT -#define LUA_KCONTEXT intptr_t -#endif -#endif - - -/* -@@ lua_getlocaledecpoint gets the locale "radix character" (decimal point). -** Change that if you do not want to use C locales. (Code using this -** macro must include the header 'locale.h'.) -*/ -#if !defined(lua_getlocaledecpoint) -#define lua_getlocaledecpoint() (localeconv()->decimal_point[0]) -#endif - - -/* -** macros to improve jump prediction, used mostly for error handling -** and debug facilities. (Some macros in the Lua API use these macros. -** Define LUA_NOBUILTIN if you do not want '__builtin_expect' in your -** code.) -*/ -#if !defined(luai_likely) - -#if defined(__GNUC__) && !defined(LUA_NOBUILTIN) -#define luai_likely(x) (__builtin_expect(((x) != 0), 1)) -#define luai_unlikely(x) (__builtin_expect(((x) != 0), 0)) -#else -#define luai_likely(x) (x) -#define luai_unlikely(x) (x) -#endif - -#endif - - -#if defined(LUA_CORE) || defined(LUA_LIB) -/* shorter names for Lua's own use */ -#define l_likely(x) luai_likely(x) -#define l_unlikely(x) luai_unlikely(x) -#endif - - - -/* }================================================================== */ - - -/* -** {================================================================== -** Language Variations -** ===================================================================== -*/ - -/* -@@ LUA_NOCVTN2S/LUA_NOCVTS2N control how Lua performs some -** coercions. Define LUA_NOCVTN2S to turn off automatic coercion from -** numbers to strings. Define LUA_NOCVTS2N to turn off automatic -** coercion from strings to numbers. -*/ -/* #define LUA_NOCVTN2S */ -/* #define LUA_NOCVTS2N */ - - -/* -@@ LUA_USE_APICHECK turns on several consistency checks on the C API. -** Define it as a help when debugging C code. -*/ -#if defined(LUA_USE_APICHECK) -#include -#define luai_apicheck(l,e) assert(e) -#endif - -/* }================================================================== */ - - -/* -** {================================================================== -** Macros that affect the API and must be stable (that is, must be the -** same when you compile Lua and when you compile code that links to -** Lua). -** ===================================================================== -*/ - -/* -@@ LUAI_MAXSTACK limits the size of the Lua stack. -** CHANGE it if you need a different limit. This limit is arbitrary; -** its only purpose is to stop Lua from consuming unlimited stack -** space (and to reserve some numbers for pseudo-indices). -** (It must fit into max(size_t)/32 and max(int)/2.) -*/ -#if LUAI_IS32INT -#define LUAI_MAXSTACK 1000000 -#else -#define LUAI_MAXSTACK 15000 -#endif - - -/* -@@ LUA_EXTRASPACE defines the size of a raw memory area associated with -** a Lua state with very fast access. -** CHANGE it if you need a different size. -*/ -#define LUA_EXTRASPACE (sizeof(void *)) - - -/* -@@ LUA_IDSIZE gives the maximum size for the description of the source -** of a function in debug information. -** CHANGE it if you want a different size. -*/ -#define LUA_IDSIZE 60 - - -/* -@@ LUAL_BUFFERSIZE is the initial buffer size used by the lauxlib -** buffer system. -*/ -#define LUAL_BUFFERSIZE ((int)(16 * sizeof(void*) * sizeof(lua_Number))) - - -/* -@@ LUAI_MAXALIGN defines fields that, when used in a union, ensure -** maximum alignment for the other items in that union. -*/ -#define LUAI_MAXALIGN lua_Number n; double u; void *s; lua_Integer i; long l - -/* }================================================================== */ - - - - - -/* =================================================================== */ - -/* -** Local configuration. You can use this space to add your redefinitions -** without modifying the main part of the file. -*/ - - - - - -#endif - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lualib.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lualib.h deleted file mode 100644 index 068f60a..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lualib.h +++ /dev/null @@ -1,65 +0,0 @@ -/* -** $Id: lualib.h $ -** Lua standard libraries -** See Copyright Notice in lua.h -*/ - - -#ifndef lualib_h -#define lualib_h - -#include "lua.h" - - -/* version suffix for environment variable names */ -#define LUA_VERSUFFIX "_" LUA_VERSION_MAJOR "_" LUA_VERSION_MINOR - -#define LUA_GLIBK 1 -LUAMOD_API int (luaopen_base) (lua_State *L); - -#define LUA_LOADLIBNAME "package" -#define LUA_LOADLIBK (LUA_GLIBK << 1) -LUAMOD_API int (luaopen_package) (lua_State *L); - - -#define LUA_COLIBNAME "coroutine" -#define LUA_COLIBK (LUA_LOADLIBK << 1) -LUAMOD_API int (luaopen_coroutine) (lua_State *L); - -#define LUA_DBLIBNAME "debug" -#define LUA_DBLIBK (LUA_COLIBK << 1) -LUAMOD_API int (luaopen_debug) (lua_State *L); - -#define LUA_IOLIBNAME "io" -#define LUA_IOLIBK (LUA_DBLIBK << 1) -LUAMOD_API int (luaopen_io) (lua_State *L); - -#define LUA_MATHLIBNAME "math" -#define LUA_MATHLIBK (LUA_IOLIBK << 1) -LUAMOD_API int (luaopen_math) (lua_State *L); - -#define LUA_OSLIBNAME "os" -#define LUA_OSLIBK (LUA_MATHLIBK << 1) -LUAMOD_API int (luaopen_os) (lua_State *L); - -#define LUA_STRLIBNAME "string" -#define LUA_STRLIBK (LUA_OSLIBK << 1) -LUAMOD_API int (luaopen_string) (lua_State *L); - -#define LUA_TABLIBNAME "table" -#define LUA_TABLIBK (LUA_STRLIBK << 1) -LUAMOD_API int (luaopen_table) (lua_State *L); - -#define LUA_UTF8LIBNAME "utf8" -#define LUA_UTF8LIBK (LUA_TABLIBK << 1) -LUAMOD_API int (luaopen_utf8) (lua_State *L); - - -/* open selected libraries */ -LUALIB_API void (luaL_openselectedlibs) (lua_State *L, int load, int preload); - -/* open all libraries */ -#define luaL_openlibs(L) luaL_openselectedlibs(L, ~0, 0) - - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lundump.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lundump.c deleted file mode 100644 index ed03ab8..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lundump.c +++ /dev/null @@ -1,405 +0,0 @@ -/* -** $Id: lundump.c $ -** load precompiled Lua chunks -** See Copyright Notice in lua.h -*/ - -#define lundump_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstring.h" -#include "ltable.h" -#include "lundump.h" -#include "lzio.h" - - -#if !defined(luai_verifycode) -#define luai_verifycode(L,f) /* empty */ -#endif - - -typedef struct { - lua_State *L; - ZIO *Z; - const char *name; - Table *h; /* list for string reuse */ - lu_mem offset; /* current position relative to beginning of dump */ - lua_Integer nstr; /* number of strings in the list */ - lu_byte fixed; /* dump is fixed in memory */ -} LoadState; - - -static l_noret private_lua_error (LoadState *S, const char *why) { - luaO_pushfstring(S->L, "%s: bad binary format (%s)", S->name, why); - luaD_throw(S->L, LUA_ERRSYNTAX); -} - - -/* -** All high-level loads go through loadVector; you can change it to -** adapt to the endianness of the input -*/ -#define loadVector(S,b,n) loadBlock(S,b,(n)*sizeof((b)[0])) - -static void loadBlock (LoadState *S, void *b, size_t size) { - if (luaZ_read(S->Z, b, size) != 0) - private_lua_error(S, "truncated chunk"); - S->offset += size; -} - - -static void loadAlign (LoadState *S, int align) { - int padding = align - (S->offset % align); - if (padding < align) { /* apd == align means no padding */ - lua_Integer paddingContent; - loadBlock(S, &paddingContent, padding); - lua_assert(S->offset % align == 0); - } -} - - -#define getaddr(S,n,t) cast(t *, getaddr_(S,(n) * sizeof(t))) - -static const void *getaddr_ (LoadState *S, size_t size) { - const void *block = luaZ_getaddr(S->Z, size); - S->offset += size; - if (block == NULL) - private_lua_error(S, "truncated fixed buffer"); - return block; -} - - -#define loadVar(S,x) loadVector(S,&x,1) - - -static lu_byte loadByte (LoadState *S) { - int b = zgetc(S->Z); - if (b == EOZ) - private_lua_error(S, "truncated chunk"); - S->offset++; - return cast_byte(b); -} - - -static size_t loadVarint (LoadState *S, size_t limit) { - size_t x = 0; - int b; - limit >>= 7; - do { - b = loadByte(S); - if (x > limit) - private_lua_error(S, "integer overflow"); - x = (x << 7) | (b & 0x7f); - } while ((b & 0x80) != 0); - return x; -} - - -static size_t loadSize (LoadState *S) { - return loadVarint(S, MAX_SIZET); -} - - -static int loadInt (LoadState *S) { - return cast_int(loadVarint(S, cast_sizet(INT_MAX))); -} - - -static lua_Number loadNumber (LoadState *S) { - lua_Number x; - loadVar(S, x); - return x; -} - - -static lua_Integer loadInteger (LoadState *S) { - lua_Integer x; - loadVar(S, x); - return x; -} - - -/* -** Load a nullable string into slot 'sl' from prototype 'p'. The -** assignment to the slot and the barrier must be performed before any -** possible GC activity, to anchor the string. (Both 'loadVector' and -** 'luaH_setint' can call the GC.) -*/ -static void loadString (LoadState *S, Proto *p, TString **sl) { - lua_State *L = S->L; - TString *ts; - TValue sv; - size_t size = loadSize(S); - if (size == 0) { /* no string? */ - lua_assert(*sl == NULL); /* must be prefilled */ - return; - } - else if (size == 1) { /* previously saved string? */ - lua_Integer idx = cast(lua_Integer, loadSize(S)); /* get its index */ - TValue stv; - luaH_getint(S->h, idx, &stv); /* get its value */ - *sl = ts = tsvalue(&stv); - luaC_objbarrier(L, p, ts); - return; /* do not save it again */ - } - else if ((size -= 2) <= LUAI_MAXSHORTLEN) { /* short string? */ - char buff[LUAI_MAXSHORTLEN + 1]; /* extra space for '\0' */ - loadVector(S, buff, size + 1); /* load string into buffer */ - *sl = ts = luaS_newlstr(L, buff, size); /* create string */ - luaC_objbarrier(L, p, ts); - } - else if (S->fixed) { /* for a fixed buffer, use a fixed string */ - const char *s = getaddr(S, size + 1, char); /* get content address */ - *sl = ts = luaS_newextlstr(L, s, size, NULL, NULL); - luaC_objbarrier(L, p, ts); - } - else { /* create internal copy */ - *sl = ts = luaS_createlngstrobj(L, size); /* create string */ - luaC_objbarrier(L, p, ts); - loadVector(S, getlngstr(ts), size + 1); /* load directly in final place */ - } - /* add string to list of saved strings */ - S->nstr++; - setsvalue(L, &sv, ts); - luaH_setint(L, S->h, S->nstr, &sv); - luaC_objbarrierback(L, obj2gco(S->h), ts); -} - - -static void loadCode (LoadState *S, Proto *f) { - int n = loadInt(S); - loadAlign(S, sizeof(f->code[0])); - if (S->fixed) { - f->code = getaddr(S, n, Instruction); - f->sizecode = n; - } - else { - f->code = luaM_newvectorchecked(S->L, n, Instruction); - f->sizecode = n; - loadVector(S, f->code, n); - } -} - - -static void loadFunction(LoadState *S, Proto *f); - - -static void loadConstants (LoadState *S, Proto *f) { - int i; - int n = loadInt(S); - f->k = luaM_newvectorchecked(S->L, n, TValue); - f->sizek = n; - for (i = 0; i < n; i++) - setnilvalue(&f->k[i]); - for (i = 0; i < n; i++) { - TValue *o = &f->k[i]; - int t = loadByte(S); - switch (t) { - case LUA_VNIL: - setnilvalue(o); - break; - case LUA_VFALSE: - setbfvalue(o); - break; - case LUA_VTRUE: - setbtvalue(o); - break; - case LUA_VNUMFLT: - setfltvalue(o, loadNumber(S)); - break; - case LUA_VNUMINT: - setivalue(o, loadInteger(S)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - lua_assert(f->source == NULL); - loadString(S, f, &f->source); /* use 'source' to anchor string */ - if (f->source == NULL) - private_lua_error(S, "bad format for constant string"); - setsvalue2n(S->L, o, f->source); /* save it in the right place */ - f->source = NULL; - break; - } - default: lua_assert(0); - } - } -} - - -static void loadProtos (LoadState *S, Proto *f) { - int i; - int n = loadInt(S); - f->p = luaM_newvectorchecked(S->L, n, Proto *); - f->sizep = n; - for (i = 0; i < n; i++) - f->p[i] = NULL; - for (i = 0; i < n; i++) { - f->p[i] = luaF_newproto(S->L); - luaC_objbarrier(S->L, f, f->p[i]); - loadFunction(S, f->p[i]); - } -} - - -/* -** Load the upvalues for a function. The names must be filled first, -** because the filling of the other fields can raise read errors and -** the creation of the error message can call an emergency collection; -** in that case all prototypes must be consistent for the GC. -*/ -static void loadUpvalues (LoadState *S, Proto *f) { - int i, n; - n = loadInt(S); - f->upvalues = luaM_newvectorchecked(S->L, n, Upvaldesc); - f->sizeupvalues = n; - for (i = 0; i < n; i++) /* make array valid for GC */ - f->upvalues[i].name = NULL; - for (i = 0; i < n; i++) { /* following calls can raise errors */ - f->upvalues[i].instack = loadByte(S); - f->upvalues[i].idx = loadByte(S); - f->upvalues[i].kind = loadByte(S); - } -} - - -static void loadDebug (LoadState *S, Proto *f) { - int i, n; - n = loadInt(S); - if (S->fixed) { - f->lineinfo = getaddr(S, n, ls_byte); - f->sizelineinfo = n; - } - else { - f->lineinfo = luaM_newvectorchecked(S->L, n, ls_byte); - f->sizelineinfo = n; - loadVector(S, f->lineinfo, n); - } - n = loadInt(S); - if (n > 0) { - loadAlign(S, sizeof(int)); - if (S->fixed) { - f->abslineinfo = getaddr(S, n, AbsLineInfo); - f->sizeabslineinfo = n; - } - else { - f->abslineinfo = luaM_newvectorchecked(S->L, n, AbsLineInfo); - f->sizeabslineinfo = n; - loadVector(S, f->abslineinfo, n); - } - } - n = loadInt(S); - f->locvars = luaM_newvectorchecked(S->L, n, LocVar); - f->sizelocvars = n; - for (i = 0; i < n; i++) - f->locvars[i].varname = NULL; - for (i = 0; i < n; i++) { - loadString(S, f, &f->locvars[i].varname); - f->locvars[i].startpc = loadInt(S); - f->locvars[i].endpc = loadInt(S); - } - n = loadInt(S); - if (n != 0) /* does it have debug information? */ - n = f->sizeupvalues; /* must be this many */ - for (i = 0; i < n; i++) - loadString(S, f, &f->upvalues[i].name); -} - - -static void loadFunction (LoadState *S, Proto *f) { - f->linedefined = loadInt(S); - f->lastlinedefined = loadInt(S); - f->numparams = loadByte(S); - f->flag = loadByte(S) & PF_ISVARARG; /* get only the meaningful flags */ - if (S->fixed) - f->flag |= PF_FIXED; /* signal that code is fixed */ - f->maxstacksize = loadByte(S); - loadCode(S, f); - loadConstants(S, f); - loadUpvalues(S, f); - loadProtos(S, f); - loadString(S, f, &f->source); - loadDebug(S, f); -} - - -static void checkliteral (LoadState *S, const char *s, const char *msg) { - char buff[sizeof(LUA_SIGNATURE) + sizeof(LUAC_DATA)]; /* larger than both */ - size_t len = strlen(s); - loadVector(S, buff, len); - if (memcmp(s, buff, len) != 0) - private_lua_error(S, msg); -} - - -static void fchecksize (LoadState *S, size_t size, const char *tname) { - if (loadByte(S) != size) - private_lua_error(S, luaO_pushfstring(S->L, "%s size mismatch", tname)); -} - - -#define checksize(S,t) fchecksize(S,sizeof(t),#t) - -static void checkHeader (LoadState *S) { - /* skip 1st char (already read and checked) */ - checkliteral(S, &LUA_SIGNATURE[1], "not a binary chunk"); - if (loadByte(S) != LUAC_VERSION) - private_lua_error(S, "version mismatch"); - if (loadByte(S) != LUAC_FORMAT) - private_lua_error(S, "format mismatch"); - checkliteral(S, LUAC_DATA, "corrupted chunk"); - checksize(S, Instruction); - checksize(S, lua_Integer); - checksize(S, lua_Number); - if (loadInteger(S) != LUAC_INT) - private_lua_error(S, "integer format mismatch"); - if (loadNumber(S) != LUAC_NUM) - private_lua_error(S, "float format mismatch"); -} - - -/* -** Load precompiled chunk. -*/ -LClosure *luaU_undump (lua_State *L, ZIO *Z, const char *name, int fixed) { - LoadState S; - LClosure *cl; - if (*name == '@' || *name == '=') - S.name = name + 1; - else if (*name == LUA_SIGNATURE[0]) - S.name = "binary string"; - else - S.name = name; - S.L = L; - S.Z = Z; - S.fixed = fixed; - S.offset = 1; /* fist byte was already read */ - checkHeader(&S); - cl = luaF_newLclosure(L, loadByte(&S)); - setclLvalue2s(L, L->top.p, cl); - luaD_inctop(L); - S.h = luaH_new(L); /* create list of saved strings */ - S.nstr = 0; - sethvalue2s(L, L->top.p, S.h); /* anchor it */ - luaD_inctop(L); - cl->p = luaF_newproto(L); - luaC_objbarrier(L, cl, cl->p); - loadFunction(&S, cl->p); - lua_assert(cl->nupvalues == cl->p->sizeupvalues); - luai_verifycode(L, cl->p); - L->top.p--; /* pop table */ - return cl; -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lundump.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lundump.h deleted file mode 100644 index 1d6e50e..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lundump.h +++ /dev/null @@ -1,39 +0,0 @@ -/* -** $Id: lundump.h $ -** load precompiled Lua chunks -** See Copyright Notice in lua.h -*/ - -#ifndef lundump_h -#define lundump_h - -#include - -#include "llimits.h" -#include "lobject.h" -#include "lzio.h" - - -/* data to catch conversion errors */ -#define LUAC_DATA "\x19\x93\r\n\x1a\n" - -#define LUAC_INT 0x5678 -#define LUAC_NUM cast_num(370.5) - -/* -** Encode major-minor version in one byte, one nibble for each -*/ -#define LUAC_VERSION (LUA_VERSION_MAJOR_N*16+LUA_VERSION_MINOR_N) - -#define LUAC_FORMAT 0 /* this is the official format */ - - -/* load one chunk; from lundump.c */ -LUAI_FUNC LClosure* luaU_undump (lua_State* L, ZIO* Z, const char* name, - int fixed); - -/* dump one chunk; from ldump.c */ -LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, - void* data, int strip); - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lutf8lib.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lutf8lib.c deleted file mode 100644 index 3a5b9bc..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lutf8lib.c +++ /dev/null @@ -1,291 +0,0 @@ -/* -** $Id: lutf8lib.c $ -** Standard library for UTF-8 manipulation -** See Copyright Notice in lua.h -*/ - -#define lutf8lib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -#define MAXUNICODE 0x10FFFFu - -#define MAXUTF 0x7FFFFFFFu - - -#define MSGInvalid "invalid UTF-8 code" - -/* -** Integer type for decoded UTF-8 values; MAXUTF needs 31 bits. -*/ -#if (UINT_MAX >> 30) >= 1 -typedef unsigned int utfint; -#else -typedef unsigned long utfint; -#endif - - -#define iscont(c) (((c) & 0xC0) == 0x80) -#define iscontp(p) iscont(*(p)) - - -/* from strlib */ -/* translate a relative string position: negative means back from end */ -static lua_Integer u_posrelat (lua_Integer pos, size_t len) { - if (pos >= 0) return pos; - else if (0u - (size_t)pos > len) return 0; - else return (lua_Integer)len + pos + 1; -} - - -/* -** Decode one UTF-8 sequence, returning NULL if byte sequence is -** invalid. The array 'limits' stores the minimum value for each -** sequence length, to check for overlong representations. Its first -** entry forces an error for non-ascii bytes with no continuation -** bytes (count == 0). -*/ -static const char *utf8_decode (const char *s, utfint *val, int strict) { - static const utfint limits[] = - {~(utfint)0, 0x80, 0x800, 0x10000u, 0x200000u, 0x4000000u}; - unsigned int c = (unsigned char)s[0]; - utfint res = 0; /* final result */ - if (c < 0x80) /* ascii? */ - res = c; - else { - int count = 0; /* to count number of continuation bytes */ - for (; c & 0x40; c <<= 1) { /* while it needs continuation bytes... */ - unsigned int cc = (unsigned char)s[++count]; /* read next byte */ - if (!iscont(cc)) /* not a continuation byte? */ - return NULL; /* invalid byte sequence */ - res = (res << 6) | (cc & 0x3F); /* add lower 6 bits from cont. byte */ - } - res |= ((utfint)(c & 0x7F) << (count * 5)); /* add first byte */ - if (count > 5 || res > MAXUTF || res < limits[count]) - return NULL; /* invalid byte sequence */ - s += count; /* skip continuation bytes read */ - } - if (strict) { - /* check for invalid code points; too large or surrogates */ - if (res > MAXUNICODE || (0xD800u <= res && res <= 0xDFFFu)) - return NULL; - } - if (val) *val = res; - return s + 1; /* +1 to include first byte */ -} - - -/* -** utf8len(s [, i [, j [, lax]]]) --> number of characters that -** start in the range [i,j], or nil + current position if 's' is not -** well formed in that interval -*/ -static int utflen (lua_State *L) { - lua_Integer n = 0; /* counter for the number of characters */ - size_t len; /* string length in bytes */ - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer posi = u_posrelat(luaL_optinteger(L, 2, 1), len); - lua_Integer posj = u_posrelat(luaL_optinteger(L, 3, -1), len); - int lax = lua_toboolean(L, 4); - luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 2, - "initial position out of bounds"); - luaL_argcheck(L, --posj < (lua_Integer)len, 3, - "final position out of bounds"); - while (posi <= posj) { - const char *s1 = utf8_decode(s + posi, NULL, !lax); - if (s1 == NULL) { /* conversion error? */ - luaL_pushfail(L); /* return fail ... */ - lua_pushinteger(L, posi + 1); /* ... and current position */ - return 2; - } - posi = s1 - s; - n++; - } - lua_pushinteger(L, n); - return 1; -} - - -/* -** codepoint(s, [i, [j [, lax]]]) -> returns codepoints for all -** characters that start in the range [i,j] -*/ -static int codepoint (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer posi = u_posrelat(luaL_optinteger(L, 2, 1), len); - lua_Integer pose = u_posrelat(luaL_optinteger(L, 3, posi), len); - int lax = lua_toboolean(L, 4); - int n; - const char *se; - luaL_argcheck(L, posi >= 1, 2, "out of bounds"); - luaL_argcheck(L, pose <= (lua_Integer)len, 3, "out of bounds"); - if (posi > pose) return 0; /* empty interval; return no values */ - if (pose - posi >= INT_MAX) /* (lua_Integer -> int) overflow? */ - return luaL_error(L, "string slice too long"); - n = (int)(pose - posi) + 1; /* upper bound for number of returns */ - luaL_checkstack(L, n, "string slice too long"); - n = 0; /* count the number of returns */ - se = s + pose; /* string end */ - for (s += posi - 1; s < se;) { - utfint code; - s = utf8_decode(s, &code, !lax); - if (s == NULL) - return luaL_error(L, MSGInvalid); - lua_pushinteger(L, code); - n++; - } - return n; -} - - -static void pushutfchar (lua_State *L, int arg) { - lua_Unsigned code = (lua_Unsigned)luaL_checkinteger(L, arg); - luaL_argcheck(L, code <= MAXUTF, arg, "value out of range"); - lua_pushfstring(L, "%U", (long)code); -} - - -/* -** utfchar(n1, n2, ...) -> char(n1)..char(n2)... -*/ -static int utfchar (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - if (n == 1) /* optimize common case of single char */ - pushutfchar(L, 1); - else { - int i; - luaL_Buffer b; - luaL_buffinit(L, &b); - for (i = 1; i <= n; i++) { - pushutfchar(L, i); - luaL_addvalue(&b); - } - luaL_pushresult(&b); - } - return 1; -} - - -/* -** offset(s, n, [i]) -> index where n-th character counting from -** position 'i' starts; 0 means character at 'i'. -*/ -static int byteoffset (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer n = luaL_checkinteger(L, 2); - lua_Integer posi = (n >= 0) ? 1 : len + 1; - posi = u_posrelat(luaL_optinteger(L, 3, posi), len); - luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 3, - "position out of bounds"); - if (n == 0) { - /* find beginning of current byte sequence */ - while (posi > 0 && iscontp(s + posi)) posi--; - } - else { - if (iscontp(s + posi)) - return luaL_error(L, "initial position is a continuation byte"); - if (n < 0) { - while (n < 0 && posi > 0) { /* move back */ - do { /* find beginning of previous character */ - posi--; - } while (posi > 0 && iscontp(s + posi)); - n++; - } - } - else { - n--; /* do not move for 1st character */ - while (n > 0 && posi < (lua_Integer)len) { - do { /* find beginning of next character */ - posi++; - } while (iscontp(s + posi)); /* (cannot pass final '\0') */ - n--; - } - } - } - if (n == 0) /* did it find given character? */ - lua_pushinteger(L, posi + 1); - else /* no such character */ - luaL_pushfail(L); - return 1; -} - - -static int iter_aux (lua_State *L, int strict) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Unsigned n = (lua_Unsigned)lua_tointeger(L, 2); - if (n < len) { - while (iscontp(s + n)) n++; /* go to next character */ - } - if (n >= len) /* (also handles original 'n' being negative) */ - return 0; /* no more codepoints */ - else { - utfint code; - const char *next = utf8_decode(s + n, &code, strict); - if (next == NULL || iscontp(next)) - return luaL_error(L, MSGInvalid); - lua_pushinteger(L, n + 1); - lua_pushinteger(L, code); - return 2; - } -} - - -static int iter_auxstrict (lua_State *L) { - return iter_aux(L, 1); -} - -static int iter_auxlax (lua_State *L) { - return iter_aux(L, 0); -} - - -static int iter_codes (lua_State *L) { - int lax = lua_toboolean(L, 2); - const char *s = luaL_checkstring(L, 1); - luaL_argcheck(L, !iscontp(s), 1, MSGInvalid); - lua_pushcfunction(L, lax ? iter_auxlax : iter_auxstrict); - lua_pushvalue(L, 1); - lua_pushinteger(L, 0); - return 3; -} - - -/* pattern to match a single UTF-8 character */ -#define UTF8PATT "[\0-\x7F\xC2-\xFD][\x80-\xBF]*" - - -static const luaL_Reg funcs[] = { - {"offset", byteoffset}, - {"codepoint", codepoint}, - {"char", utfchar}, - {"len", utflen}, - {"codes", iter_codes}, - /* placeholders */ - {"charpattern", NULL}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_utf8 (lua_State *L) { - luaL_newlib(L, funcs); - lua_pushlstring(L, UTF8PATT, sizeof(UTF8PATT)/sizeof(char) - 1); - lua_setfield(L, -2, "charpattern"); - return 1; -} - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lvm.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lvm.c deleted file mode 100644 index 37023af..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lvm.c +++ /dev/null @@ -1,1896 +0,0 @@ -/* -** $Id: lvm.c $ -** Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#define lvm_c -#define LUA_CORE - -#include "lprefix.h" - -#include -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lvm.h" - - -/* -** By default, use jump tables in the main interpreter loop on gcc -** and compatible compilers. -*/ -#if !defined(LUA_USE_JUMPTABLE) -#if defined(__GNUC__) -#define LUA_USE_JUMPTABLE 1 -#else -#define LUA_USE_JUMPTABLE 0 -#endif -#endif - - - -/* limit for table tag-method chains (to avoid infinite loops) */ -#define MAXTAGLOOP 2000 - - -/* -** 'l_intfitsf' checks whether a given integer is in the range that -** can be converted to a float without rounding. Used in comparisons. -*/ - -/* number of bits in the mantissa of a float */ -#define NBM (l_floatatt(MANT_DIG)) - -/* -** Check whether some integers may not fit in a float, testing whether -** (maxinteger >> NBM) > 0. (That implies (1 << NBM) <= maxinteger.) -** (The shifts are done in parts, to avoid shifting by more than the size -** of an integer. In a worst case, NBM == 113 for long double and -** sizeof(long) == 32.) -*/ -#if ((((LUA_MAXINTEGER >> (NBM / 4)) >> (NBM / 4)) >> (NBM / 4)) \ - >> (NBM - (3 * (NBM / 4)))) > 0 - -/* limit for integers that fit in a float */ -#define MAXINTFITSF ((lua_Unsigned)1 << NBM) - -/* check whether 'i' is in the interval [-MAXINTFITSF, MAXINTFITSF] */ -#define l_intfitsf(i) ((MAXINTFITSF + l_castS2U(i)) <= (2 * MAXINTFITSF)) - -#else /* all integers fit in a float precisely */ - -#define l_intfitsf(i) 1 - -#endif - - -/* -** Try to convert a value from string to a number value. -** If the value is not a string or is a string not representing -** a valid numeral (or if coercions from strings to numbers -** are disabled via macro 'cvt2num'), do not modify 'result' -** and return 0. -*/ -static int l_strton (const TValue *obj, TValue *result) { - lua_assert(obj != result); - if (!cvt2num(obj)) /* is object not a string? */ - return 0; - else { - TString *st = tsvalue(obj); - size_t stlen; - const char *s = getlstr(st, stlen); - return (luaO_str2num(s, result) == stlen + 1); - } -} - - -/* -** Try to convert a value to a float. The float case is already handled -** by the macro 'tonumber'. -*/ -int luaV_tonumber_ (const TValue *obj, lua_Number *n) { - TValue v; - if (ttisinteger(obj)) { - *n = cast_num(ivalue(obj)); - return 1; - } - else if (l_strton(obj, &v)) { /* string coercible to number? */ - *n = nvalue(&v); /* convert result of 'luaO_str2num' to a float */ - return 1; - } - else - return 0; /* conversion failed */ -} - - -/* -** try to convert a float to an integer, rounding according to 'mode'. -*/ -int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode) { - lua_Number f = l_floor(n); - if (n != f) { /* not an integral value? */ - if (mode == F2Ieq) return 0; /* fails if mode demands integral value */ - else if (mode == F2Iceil) /* needs ceil? */ - f += 1; /* convert floor to ceil (remember: n != f) */ - } - return lua_numbertointeger(f, p); -} - - -/* -** try to convert a value to an integer, rounding according to 'mode', -** without string coercion. -** ("Fast track" handled by macro 'tointegerns'.) -*/ -int luaV_tointegerns (const TValue *obj, lua_Integer *p, F2Imod mode) { - if (ttisfloat(obj)) - return luaV_flttointeger(fltvalue(obj), p, mode); - else if (ttisinteger(obj)) { - *p = ivalue(obj); - return 1; - } - else - return 0; -} - - -/* -** try to convert a value to an integer. -*/ -int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode) { - TValue v; - if (l_strton(obj, &v)) /* does 'obj' point to a numerical string? */ - obj = &v; /* change it to point to its corresponding number */ - return luaV_tointegerns(obj, p, mode); -} - - -/* -** Try to convert a 'for' limit to an integer, preserving the semantics -** of the loop. Return true if the loop must not run; otherwise, '*p' -** gets the integer limit. -** (The following explanation assumes a positive step; it is valid for -** negative steps mutatis mutandis.) -** If the limit is an integer or can be converted to an integer, -** rounding down, that is the limit. -** Otherwise, check whether the limit can be converted to a float. If -** the float is too large, clip it to LUA_MAXINTEGER. If the float -** is too negative, the loop should not run, because any initial -** integer value is greater than such limit; so, the function returns -** true to signal that. (For this latter case, no integer limit would be -** correct; even a limit of LUA_MININTEGER would run the loop once for -** an initial value equal to LUA_MININTEGER.) -*/ -static int forlimit (lua_State *L, lua_Integer init, const TValue *lim, - lua_Integer *p, lua_Integer step) { - if (!luaV_tointeger(lim, p, (step < 0 ? F2Iceil : F2Ifloor))) { - /* not coercible to in integer */ - lua_Number flim; /* try to convert to float */ - if (!tonumber(lim, &flim)) /* cannot convert to float? */ - luaG_forerror(L, lim, "limit"); - /* else 'flim' is a float out of integer bounds */ - if (luai_numlt(0, flim)) { /* if it is positive, it is too large */ - if (step < 0) return 1; /* initial value must be less than it */ - *p = LUA_MAXINTEGER; /* truncate */ - } - else { /* it is less than min integer */ - if (step > 0) return 1; /* initial value must be greater than it */ - *p = LUA_MININTEGER; /* truncate */ - } - } - return (step > 0 ? init > *p : init < *p); /* not to run? */ -} - - -/* -** Prepare a numerical for loop (opcode OP_FORPREP). -** Before execution, stack is as follows: -** ra : initial value -** ra + 1 : limit -** ra + 2 : step -** Return true to skip the loop. Otherwise, -** after preparation, stack will be as follows: -** ra : loop counter (integer loops) or limit (float loops) -** ra + 1 : step -** ra + 2 : control variable -*/ -static int forprep (lua_State *L, StkId ra) { - TValue *pinit = s2v(ra); - TValue *plimit = s2v(ra + 1); - TValue *pstep = s2v(ra + 2); - if (ttisinteger(pinit) && ttisinteger(pstep)) { /* integer loop? */ - lua_Integer init = ivalue(pinit); - lua_Integer step = ivalue(pstep); - lua_Integer limit; - if (step == 0) - luaG_runerror(L, "'for' step is zero"); - if (forlimit(L, init, plimit, &limit, step)) - return 1; /* skip the loop */ - else { /* prepare loop counter */ - lua_Unsigned count; - if (step > 0) { /* ascending loop? */ - count = l_castS2U(limit) - l_castS2U(init); - if (step != 1) /* avoid division in the too common case */ - count /= l_castS2U(step); - } - else { /* step < 0; descending loop */ - count = l_castS2U(init) - l_castS2U(limit); - /* 'step+1' avoids negating 'mininteger' */ - count /= l_castS2U(-(step + 1)) + 1u; - } - /* use 'chgivalue' for places that for sure had integers */ - chgivalue(s2v(ra), l_castU2S(count)); /* change init to count */ - setivalue(s2v(ra + 1), step); /* change limit to step */ - chgivalue(s2v(ra + 2), init); /* change step to init */ - } - } - else { /* try making all values floats */ - lua_Number init; lua_Number limit; lua_Number step; - if (l_unlikely(!tonumber(plimit, &limit))) - luaG_forerror(L, plimit, "limit"); - if (l_unlikely(!tonumber(pstep, &step))) - luaG_forerror(L, pstep, "step"); - if (l_unlikely(!tonumber(pinit, &init))) - luaG_forerror(L, pinit, "initial value"); - if (step == 0) - luaG_runerror(L, "'for' step is zero"); - if (luai_numlt(0, step) ? luai_numlt(limit, init) - : luai_numlt(init, limit)) - return 1; /* skip the loop */ - else { - /* make sure all values are floats */ - setfltvalue(s2v(ra), limit); - setfltvalue(s2v(ra + 1), step); - setfltvalue(s2v(ra + 2), init); /* control variable */ - } - } - return 0; -} - - -/* -** Execute a step of a float numerical for loop, returning -** true iff the loop must continue. (The integer case is -** written online with opcode OP_FORLOOP, for performance.) -*/ -static int floatforloop (StkId ra) { - lua_Number step = fltvalue(s2v(ra + 1)); - lua_Number limit = fltvalue(s2v(ra)); - lua_Number idx = fltvalue(s2v(ra + 2)); /* control variable */ - idx = luai_numadd(L, idx, step); /* increment index */ - if (luai_numlt(0, step) ? luai_numle(idx, limit) - : luai_numle(limit, idx)) { - chgfltvalue(s2v(ra + 2), idx); /* update control variable */ - return 1; /* jump back */ - } - else - return 0; /* finish the loop */ -} - - -/* -** Finish the table access 'val = t[key]' and return the tag of the result. -*/ -int luaV_finishget (lua_State *L, const TValue *t, TValue *key, StkId val, - int tag) { - int loop; /* counter to avoid infinite loops */ - const TValue *tm; /* metamethod */ - for (loop = 0; loop < MAXTAGLOOP; loop++) { - if (tag == LUA_VNOTABLE) { /* 't' is not a table? */ - lua_assert(!ttistable(t)); - tm = luaT_gettmbyobj(L, t, TM_INDEX); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, t, "index"); /* no metamethod */ - /* else will try the metamethod */ - } - else { /* 't' is a table */ - tm = fasttm(L, hvalue(t)->metatable, TM_INDEX); /* table's metamethod */ - if (tm == NULL) { /* no metamethod? */ - setnilvalue(s2v(val)); /* result is nil */ - return LUA_VNIL; - } - /* else will try the metamethod */ - } - if (ttisfunction(tm)) { /* is metamethod a function? */ - tag = luaT_callTMres(L, tm, t, key, val); /* call it */ - return tag; /* return tag of the result */ - } - t = tm; /* else try to access 'tm[key]' */ - luaV_fastget(t, key, s2v(val), luaH_get, tag); - if (!tagisempty(tag)) - return tag; /* done */ - /* else repeat (tail call 'luaV_finishget') */ - } - luaG_runerror(L, "'__index' chain too long; possible loop"); - return 0; /* to avoid warnings */ -} - - -/* -** Finish a table assignment 't[key] = val'. -*/ -void luaV_finishset (lua_State *L, const TValue *t, TValue *key, - TValue *val, int hres) { - int loop; /* counter to avoid infinite loops */ - for (loop = 0; loop < MAXTAGLOOP; loop++) { - const TValue *tm; /* '__newindex' metamethod */ - if (hres != HNOTATABLE) { /* is 't' a table? */ - Table *h = hvalue(t); /* save 't' table */ - tm = fasttm(L, h->metatable, TM_NEWINDEX); /* get metamethod */ - if (tm == NULL) { /* no metamethod? */ - luaH_finishset(L, h, key, val, hres); /* set new value */ - invalidateTMcache(h); - luaC_barrierback(L, obj2gco(h), val); - return; - } - /* else will try the metamethod */ - } - else { /* not a table; check metamethod */ - tm = luaT_gettmbyobj(L, t, TM_NEWINDEX); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, t, "index"); - } - /* try the metamethod */ - if (ttisfunction(tm)) { - luaT_callTM(L, tm, t, key, val); - return; - } - t = tm; /* else repeat assignment over 'tm' */ - luaV_fastset(t, key, val, hres, luaH_pset); - if (hres == HOK) - return; /* done */ - /* else 'return luaV_finishset(L, t, key, val, slot)' (loop) */ - } - luaG_runerror(L, "'__newindex' chain too long; possible loop"); -} - - -/* -** Compare two strings 'ts1' x 'ts2', returning an integer less-equal- -** -greater than zero if 'ts1' is less-equal-greater than 'ts2'. -** The code is a little tricky because it allows '\0' in the strings -** and it uses 'strcoll' (to respect locales) for each segment -** of the strings. Note that segments can compare equal but still -** have different lengths. -*/ -static int l_strcmp (const TString *ts1, const TString *ts2) { - size_t rl1; /* real length */ - const char *s1 = getlstr(ts1, rl1); - size_t rl2; - const char *s2 = getlstr(ts2, rl2); - for (;;) { /* for each segment */ - int temp = strcoll(s1, s2); - if (temp != 0) /* not equal? */ - return temp; /* done */ - else { /* strings are equal up to a '\0' */ - size_t zl1 = strlen(s1); /* index of first '\0' in 's1' */ - size_t zl2 = strlen(s2); /* index of first '\0' in 's2' */ - if (zl2 == rl2) /* 's2' is finished? */ - return (zl1 == rl1) ? 0 : 1; /* check 's1' */ - else if (zl1 == rl1) /* 's1' is finished? */ - return -1; /* 's1' is less than 's2' ('s2' is not finished) */ - /* both strings longer than 'zl'; go on comparing after the '\0' */ - zl1++; zl2++; - s1 += zl1; rl1 -= zl1; s2 += zl2; rl2 -= zl2; - } - } -} - - -/* -** Check whether integer 'i' is less than float 'f'. If 'i' has an -** exact representation as a float ('l_intfitsf'), compare numbers as -** floats. Otherwise, use the equivalence 'i < f <=> i < ceil(f)'. -** If 'ceil(f)' is out of integer range, either 'f' is greater than -** all integers or less than all integers. -** (The test with 'l_intfitsf' is only for performance; the else -** case is correct for all values, but it is slow due to the conversion -** from float to int.) -** When 'f' is NaN, comparisons must result in false. -*/ -l_sinline int LTintfloat (lua_Integer i, lua_Number f) { - if (l_intfitsf(i)) - return luai_numlt(cast_num(i), f); /* compare them as floats */ - else { /* i < f <=> i < ceil(f) */ - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Iceil)) /* fi = ceil(f) */ - return i < fi; /* compare them as integers */ - else /* 'f' is either greater or less than all integers */ - return f > 0; /* greater? */ - } -} - - -/* -** Check whether integer 'i' is less than or equal to float 'f'. -** See comments on previous function. -*/ -l_sinline int LEintfloat (lua_Integer i, lua_Number f) { - if (l_intfitsf(i)) - return luai_numle(cast_num(i), f); /* compare them as floats */ - else { /* i <= f <=> i <= floor(f) */ - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ifloor)) /* fi = floor(f) */ - return i <= fi; /* compare them as integers */ - else /* 'f' is either greater or less than all integers */ - return f > 0; /* greater? */ - } -} - - -/* -** Check whether float 'f' is less than integer 'i'. -** See comments on previous function. -*/ -l_sinline int LTfloatint (lua_Number f, lua_Integer i) { - if (l_intfitsf(i)) - return luai_numlt(f, cast_num(i)); /* compare them as floats */ - else { /* f < i <=> floor(f) < i */ - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ifloor)) /* fi = floor(f) */ - return fi < i; /* compare them as integers */ - else /* 'f' is either greater or less than all integers */ - return f < 0; /* less? */ - } -} - - -/* -** Check whether float 'f' is less than or equal to integer 'i'. -** See comments on previous function. -*/ -l_sinline int LEfloatint (lua_Number f, lua_Integer i) { - if (l_intfitsf(i)) - return luai_numle(f, cast_num(i)); /* compare them as floats */ - else { /* f <= i <=> ceil(f) <= i */ - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Iceil)) /* fi = ceil(f) */ - return fi <= i; /* compare them as integers */ - else /* 'f' is either greater or less than all integers */ - return f < 0; /* less? */ - } -} - - -/* -** Return 'l < r', for numbers. -*/ -l_sinline int LTnum (const TValue *l, const TValue *r) { - lua_assert(ttisnumber(l) && ttisnumber(r)); - if (ttisinteger(l)) { - lua_Integer li = ivalue(l); - if (ttisinteger(r)) - return li < ivalue(r); /* both are integers */ - else /* 'l' is int and 'r' is float */ - return LTintfloat(li, fltvalue(r)); /* l < r ? */ - } - else { - lua_Number lf = fltvalue(l); /* 'l' must be float */ - if (ttisfloat(r)) - return luai_numlt(lf, fltvalue(r)); /* both are float */ - else /* 'l' is float and 'r' is int */ - return LTfloatint(lf, ivalue(r)); - } -} - - -/* -** Return 'l <= r', for numbers. -*/ -l_sinline int LEnum (const TValue *l, const TValue *r) { - lua_assert(ttisnumber(l) && ttisnumber(r)); - if (ttisinteger(l)) { - lua_Integer li = ivalue(l); - if (ttisinteger(r)) - return li <= ivalue(r); /* both are integers */ - else /* 'l' is int and 'r' is float */ - return LEintfloat(li, fltvalue(r)); /* l <= r ? */ - } - else { - lua_Number lf = fltvalue(l); /* 'l' must be float */ - if (ttisfloat(r)) - return luai_numle(lf, fltvalue(r)); /* both are float */ - else /* 'l' is float and 'r' is int */ - return LEfloatint(lf, ivalue(r)); - } -} - - -/* -** return 'l < r' for non-numbers. -*/ -static int lessthanothers (lua_State *L, const TValue *l, const TValue *r) { - lua_assert(!ttisnumber(l) || !ttisnumber(r)); - if (ttisstring(l) && ttisstring(r)) /* both are strings? */ - return l_strcmp(tsvalue(l), tsvalue(r)) < 0; - else - return luaT_callorderTM(L, l, r, TM_LT); -} - - -/* -** Main operation less than; return 'l < r'. -*/ -int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) { - if (ttisnumber(l) && ttisnumber(r)) /* both operands are numbers? */ - return LTnum(l, r); - else return lessthanothers(L, l, r); -} - - -/* -** return 'l <= r' for non-numbers. -*/ -static int lessequalothers (lua_State *L, const TValue *l, const TValue *r) { - lua_assert(!ttisnumber(l) || !ttisnumber(r)); - if (ttisstring(l) && ttisstring(r)) /* both are strings? */ - return l_strcmp(tsvalue(l), tsvalue(r)) <= 0; - else - return luaT_callorderTM(L, l, r, TM_LE); -} - - -/* -** Main operation less than or equal to; return 'l <= r'. -*/ -int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r) { - if (ttisnumber(l) && ttisnumber(r)) /* both operands are numbers? */ - return LEnum(l, r); - else return lessequalothers(L, l, r); -} - - -/* -** Main operation for equality of Lua values; return 't1 == t2'. -** L == NULL means raw equality (no metamethods) -*/ -int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2) { - const TValue *tm; - if (ttypetag(t1) != ttypetag(t2)) { /* not the same variant? */ - if (ttype(t1) != ttype(t2) || ttype(t1) != LUA_TNUMBER) - return 0; /* only numbers can be equal with different variants */ - else { /* two numbers with different variants */ - /* One of them is an integer. If the other does not have an - integer value, they cannot be equal; otherwise, compare their - integer values. */ - lua_Integer i1, i2; - return (luaV_tointegerns(t1, &i1, F2Ieq) && - luaV_tointegerns(t2, &i2, F2Ieq) && - i1 == i2); - } - } - /* values have same type and same variant */ - switch (ttypetag(t1)) { - case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: return 1; - case LUA_VNUMINT: return (ivalue(t1) == ivalue(t2)); - case LUA_VNUMFLT: return luai_numeq(fltvalue(t1), fltvalue(t2)); - case LUA_VLIGHTUSERDATA: return pvalue(t1) == pvalue(t2); - case LUA_VLCF: return fvalue(t1) == fvalue(t2); - case LUA_VSHRSTR: return eqshrstr(tsvalue(t1), tsvalue(t2)); - case LUA_VLNGSTR: return luaS_eqlngstr(tsvalue(t1), tsvalue(t2)); - case LUA_VUSERDATA: { - if (uvalue(t1) == uvalue(t2)) return 1; - else if (L == NULL) return 0; - tm = fasttm(L, uvalue(t1)->metatable, TM_EQ); - if (tm == NULL) - tm = fasttm(L, uvalue(t2)->metatable, TM_EQ); - break; /* will try TM */ - } - case LUA_VTABLE: { - if (hvalue(t1) == hvalue(t2)) return 1; - else if (L == NULL) return 0; - tm = fasttm(L, hvalue(t1)->metatable, TM_EQ); - if (tm == NULL) - tm = fasttm(L, hvalue(t2)->metatable, TM_EQ); - break; /* will try TM */ - } - default: - return gcvalue(t1) == gcvalue(t2); - } - if (tm == NULL) /* no TM? */ - return 0; /* objects are different */ - else { - int tag = luaT_callTMres(L, tm, t1, t2, L->top.p); /* call TM */ - return !tagisfalse(tag); - } -} - - -/* macro used by 'luaV_concat' to ensure that element at 'o' is a string */ -#define tostring(L,o) \ - (ttisstring(o) || (cvt2str(o) && (luaO_tostring(L, o), 1))) - -#define isemptystr(o) (ttisshrstring(o) && tsvalue(o)->shrlen == 0) - -/* copy strings in stack from top - n up to top - 1 to buffer */ -static void copy2buff (StkId top, int n, char *buff) { - size_t tl = 0; /* size already copied */ - do { - TString *st = tsvalue(s2v(top - n)); - size_t l; /* length of string being copied */ - const char *s = getlstr(st, l); - memcpy(buff + tl, s, l * sizeof(char)); - tl += l; - } while (--n > 0); -} - - -/* -** Main operation for concatenation: concat 'total' values in the stack, -** from 'L->top.p - total' up to 'L->top.p - 1'. -*/ -void luaV_concat (lua_State *L, int total) { - if (total == 1) - return; /* "all" values already concatenated */ - do { - StkId top = L->top.p; - int n = 2; /* number of elements handled in this pass (at least 2) */ - if (!(ttisstring(s2v(top - 2)) || cvt2str(s2v(top - 2))) || - !tostring(L, s2v(top - 1))) - luaT_tryconcatTM(L); /* may invalidate 'top' */ - else if (isemptystr(s2v(top - 1))) /* second operand is empty? */ - cast_void(tostring(L, s2v(top - 2))); /* result is first operand */ - else if (isemptystr(s2v(top - 2))) { /* first operand is empty string? */ - setobjs2s(L, top - 2, top - 1); /* result is second op. */ - } - else { - /* at least two non-empty string values; get as many as possible */ - size_t tl = tsslen(tsvalue(s2v(top - 1))); - TString *ts; - /* collect total length and number of strings */ - for (n = 1; n < total && tostring(L, s2v(top - n - 1)); n++) { - size_t l = tsslen(tsvalue(s2v(top - n - 1))); - if (l_unlikely(l >= MAX_SIZE - sizeof(TString) - tl)) { - L->top.p = top - total; /* pop strings to avoid wasting stack */ - luaG_runerror(L, "string length overflow"); - } - tl += l; - } - if (tl <= LUAI_MAXSHORTLEN) { /* is result a short string? */ - char buff[LUAI_MAXSHORTLEN]; - copy2buff(top, n, buff); /* copy strings to buffer */ - ts = luaS_newlstr(L, buff, tl); - } - else { /* long string; copy strings directly to final result */ - ts = luaS_createlngstrobj(L, tl); - copy2buff(top, n, getlngstr(ts)); - } - setsvalue2s(L, top - n, ts); /* create result */ - } - total -= n - 1; /* got 'n' strings to create one new */ - L->top.p -= n - 1; /* popped 'n' strings and pushed one */ - } while (total > 1); /* repeat until only 1 result left */ -} - - -/* -** Main operation 'ra = #rb'. -*/ -void luaV_objlen (lua_State *L, StkId ra, const TValue *rb) { - const TValue *tm; - switch (ttypetag(rb)) { - case LUA_VTABLE: { - Table *h = hvalue(rb); - tm = fasttm(L, h->metatable, TM_LEN); - if (tm) break; /* metamethod? break switch to call it */ - setivalue(s2v(ra), luaH_getn(h)); /* else primitive len */ - return; - } - case LUA_VSHRSTR: { - setivalue(s2v(ra), tsvalue(rb)->shrlen); - return; - } - case LUA_VLNGSTR: { - setivalue(s2v(ra), tsvalue(rb)->u.lnglen); - return; - } - default: { /* try metamethod */ - tm = luaT_gettmbyobj(L, rb, TM_LEN); - if (l_unlikely(notm(tm))) /* no metamethod? */ - luaG_typeerror(L, rb, "get length of"); - break; - } - } - luaT_callTMres(L, tm, rb, rb, ra); -} - - -/* -** Integer division; return 'm // n', that is, floor(m/n). -** C division truncates its result (rounds towards zero). -** 'floor(q) == trunc(q)' when 'q >= 0' or when 'q' is integer, -** otherwise 'floor(q) == trunc(q) - 1'. -*/ -lua_Integer luaV_idiv (lua_State *L, lua_Integer m, lua_Integer n) { - if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { /* special cases: -1 or 0 */ - if (n == 0) - luaG_runerror(L, "attempt to divide by zero"); - return intop(-, 0, m); /* n==-1; avoid overflow with 0x80000...//-1 */ - } - else { - lua_Integer q = m / n; /* perform C division */ - if ((m ^ n) < 0 && m % n != 0) /* 'm/n' would be negative non-integer? */ - q -= 1; /* correct result for different rounding */ - return q; - } -} - - -/* -** Integer modulus; return 'm % n'. (Assume that C '%' with -** negative operands follows C99 behavior. See previous comment -** about luaV_idiv.) -*/ -lua_Integer luaV_mod (lua_State *L, lua_Integer m, lua_Integer n) { - if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { /* special cases: -1 or 0 */ - if (n == 0) - luaG_runerror(L, "attempt to perform 'n%%0'"); - return 0; /* m % -1 == 0; avoid overflow with 0x80000...%-1 */ - } - else { - lua_Integer r = m % n; - if (r != 0 && (r ^ n) < 0) /* 'm/n' would be non-integer negative? */ - r += n; /* correct result for different rounding */ - return r; - } -} - - -/* -** Float modulus -*/ -lua_Number luaV_modf (lua_State *L, lua_Number m, lua_Number n) { - lua_Number r; - luai_nummod(L, m, n, r); - return r; -} - - -/* number of bits in an integer */ -#define NBITS cast_int(sizeof(lua_Integer) * CHAR_BIT) - - -/* -** Shift left operation. (Shift right just negates 'y'.) -*/ -lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y) { - if (y < 0) { /* shift right? */ - if (y <= -NBITS) return 0; - else return intop(>>, x, -y); - } - else { /* shift left */ - if (y >= NBITS) return 0; - else return intop(<<, x, y); - } -} - - -/* -** create a new Lua closure, push it in the stack, and initialize -** its upvalues. -*/ -static void pushclosure (lua_State *L, Proto *p, UpVal **encup, StkId base, - StkId ra) { - int nup = p->sizeupvalues; - Upvaldesc *uv = p->upvalues; - int i; - LClosure *ncl = luaF_newLclosure(L, nup); - ncl->p = p; - setclLvalue2s(L, ra, ncl); /* anchor new closure in stack */ - for (i = 0; i < nup; i++) { /* fill in its upvalues */ - if (uv[i].instack) /* upvalue refers to local variable? */ - ncl->upvals[i] = luaF_findupval(L, base + uv[i].idx); - else /* get upvalue from enclosing function */ - ncl->upvals[i] = encup[uv[i].idx]; - luaC_objbarrier(L, ncl, ncl->upvals[i]); - } -} - - -/* -** finish execution of an opcode interrupted by a yield -*/ -void luaV_finishOp (lua_State *L) { - CallInfo *ci = L->ci; - StkId base = ci->func.p + 1; - Instruction inst = *(ci->u.l.savedpc - 1); /* interrupted instruction */ - OpCode op = GET_OPCODE(inst); - switch (op) { /* finish its execution */ - case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { - setobjs2s(L, base + GETARG_A(*(ci->u.l.savedpc - 2)), --L->top.p); - break; - } - case OP_UNM: case OP_BNOT: case OP_LEN: - case OP_GETTABUP: case OP_GETTABLE: case OP_GETI: - case OP_GETFIELD: case OP_SELF: { - setobjs2s(L, base + GETARG_A(inst), --L->top.p); - break; - } - case OP_LT: case OP_LE: - case OP_LTI: case OP_LEI: - case OP_GTI: case OP_GEI: - case OP_EQ: { /* note that 'OP_EQI'/'OP_EQK' cannot yield */ - int res = !l_isfalse(s2v(L->top.p - 1)); - L->top.p--; -#if defined(LUA_COMPAT_LT_LE) - if (ci->callstatus & CIST_LEQ) { /* "<=" using "<" instead? */ - ci->callstatus ^= CIST_LEQ; /* clear mark */ - res = !res; /* negate result */ - } -#endif - lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_JMP); - if (res != GETARG_k(inst)) /* condition failed? */ - ci->u.l.savedpc++; /* skip jump instruction */ - break; - } - case OP_CONCAT: { - StkId top = L->top.p - 1; /* top when 'luaT_tryconcatTM' was called */ - int a = GETARG_A(inst); /* first element to concatenate */ - int total = cast_int(top - 1 - (base + a)); /* yet to concatenate */ - setobjs2s(L, top - 2, top); /* put TM result in proper position */ - L->top.p = top - 1; /* top is one after last element (at top-2) */ - luaV_concat(L, total); /* concat them (may yield again) */ - break; - } - case OP_CLOSE: { /* yielded closing variables */ - ci->u.l.savedpc--; /* repeat instruction to close other vars. */ - break; - } - case OP_RETURN: { /* yielded closing variables */ - StkId ra = base + GETARG_A(inst); - /* adjust top to signal correct number of returns, in case the - return is "up to top" ('isIT') */ - L->top.p = ra + ci->u2.nres; - /* repeat instruction to close other vars. and complete the return */ - ci->u.l.savedpc--; - break; - } - default: { - /* only these other opcodes can yield */ - lua_assert(op == OP_TFORCALL || op == OP_CALL || - op == OP_TAILCALL || op == OP_SETTABUP || op == OP_SETTABLE || - op == OP_SETI || op == OP_SETFIELD); - break; - } - } -} - - - - -/* -** {================================================================== -** Macros for arithmetic/bitwise/comparison opcodes in 'luaV_execute' -** =================================================================== -*/ - -#define l_addi(L,a,b) intop(+, a, b) -#define l_subi(L,a,b) intop(-, a, b) -#define l_muli(L,a,b) intop(*, a, b) -#define l_band(a,b) intop(&, a, b) -#define l_bor(a,b) intop(|, a, b) -#define l_bxor(a,b) intop(^, a, b) - -#define l_lti(a,b) (a < b) -#define l_lei(a,b) (a <= b) -#define l_gti(a,b) (a > b) -#define l_gei(a,b) (a >= b) - - -/* -** Arithmetic operations with immediate operands. 'iop' is the integer -** operation, 'fop' is the float operation. -*/ -#define op_arithI(L,iop,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - int imm = GETARG_sC(i); \ - if (ttisinteger(v1)) { \ - lua_Integer iv1 = ivalue(v1); \ - pc++; setivalue(s2v(ra), iop(L, iv1, imm)); \ - } \ - else if (ttisfloat(v1)) { \ - lua_Number nb = fltvalue(v1); \ - lua_Number fimm = cast_num(imm); \ - pc++; setfltvalue(s2v(ra), fop(L, nb, fimm)); \ - }} - - -/* -** Auxiliary function for arithmetic operations over floats and others -** with two operands. -*/ -#define op_arithf_aux(L,v1,v2,fop) { \ - lua_Number n1; lua_Number n2; \ - if (tonumberns(v1, n1) && tonumberns(v2, n2)) { \ - pc++; setfltvalue(s2v(ra), fop(L, n1, n2)); \ - }} - - -/* -** Arithmetic operations over floats and others with register operands. -*/ -#define op_arithf(L,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - op_arithf_aux(L, v1, v2, fop); } - - -/* -** Arithmetic operations with K operands for floats. -*/ -#define op_arithfK(L,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ - op_arithf_aux(L, v1, v2, fop); } - - -/* -** Arithmetic operations over integers and floats. -*/ -#define op_arith_aux(L,v1,v2,iop,fop) { \ - StkId ra = RA(i); \ - if (ttisinteger(v1) && ttisinteger(v2)) { \ - lua_Integer i1 = ivalue(v1); lua_Integer i2 = ivalue(v2); \ - pc++; setivalue(s2v(ra), iop(L, i1, i2)); \ - } \ - else op_arithf_aux(L, v1, v2, fop); } - - -/* -** Arithmetic operations with register operands. -*/ -#define op_arith(L,iop,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - op_arith_aux(L, v1, v2, iop, fop); } - - -/* -** Arithmetic operations with K operands. -*/ -#define op_arithK(L,iop,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ - op_arith_aux(L, v1, v2, iop, fop); } - - -/* -** Bitwise operations with constant operand. -*/ -#define op_bitwiseK(L,op) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); \ - lua_Integer i1; \ - lua_Integer i2 = ivalue(v2); \ - if (tointegerns(v1, &i1)) { \ - pc++; setivalue(s2v(ra), op(i1, i2)); \ - }} - - -/* -** Bitwise operations with register operands. -*/ -#define op_bitwise(L,op) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - lua_Integer i1; lua_Integer i2; \ - if (tointegerns(v1, &i1) && tointegerns(v2, &i2)) { \ - pc++; setivalue(s2v(ra), op(i1, i2)); \ - }} - - -/* -** Order operations with register operands. 'opn' actually works -** for all numbers, but the fast track improves performance for -** integers. -*/ -#define op_order(L,opi,opn,other) { \ - StkId ra = RA(i); \ - int cond; \ - TValue *rb = vRB(i); \ - if (ttisinteger(s2v(ra)) && ttisinteger(rb)) { \ - lua_Integer ia = ivalue(s2v(ra)); \ - lua_Integer ib = ivalue(rb); \ - cond = opi(ia, ib); \ - } \ - else if (ttisnumber(s2v(ra)) && ttisnumber(rb)) \ - cond = opn(s2v(ra), rb); \ - else \ - Protect(cond = other(L, s2v(ra), rb)); \ - docondjump(); } - - -/* -** Order operations with immediate operand. (Immediate operand is -** always small enough to have an exact representation as a float.) -*/ -#define op_orderI(L,opi,opf,inv,tm) { \ - StkId ra = RA(i); \ - int cond; \ - int im = GETARG_sB(i); \ - if (ttisinteger(s2v(ra))) \ - cond = opi(ivalue(s2v(ra)), im); \ - else if (ttisfloat(s2v(ra))) { \ - lua_Number fa = fltvalue(s2v(ra)); \ - lua_Number fim = cast_num(im); \ - cond = opf(fa, fim); \ - } \ - else { \ - int isf = GETARG_C(i); \ - Protect(cond = luaT_callorderiTM(L, s2v(ra), im, inv, isf, tm)); \ - } \ - docondjump(); } - -/* }================================================================== */ - - -/* -** {================================================================== -** Function 'luaV_execute': main interpreter loop -** =================================================================== -*/ - -/* -** some macros for common tasks in 'luaV_execute' -*/ - - -#define RA(i) (base+GETARG_A(i)) -#define RB(i) (base+GETARG_B(i)) -#define vRB(i) s2v(RB(i)) -#define KB(i) (k+GETARG_B(i)) -#define RC(i) (base+GETARG_C(i)) -#define vRC(i) s2v(RC(i)) -#define KC(i) (k+GETARG_C(i)) -#define RKC(i) ((TESTARG_k(i)) ? k + GETARG_C(i) : s2v(base + GETARG_C(i))) - - - -#define updatetrap(ci) (trap = ci->u.l.trap) - -#define updatebase(ci) (base = ci->func.p + 1) - - -#define updatestack(ci) \ - { if (l_unlikely(trap)) { updatebase(ci); ra = RA(i); } } - - -/* -** Execute a jump instruction. The 'updatetrap' allows signals to stop -** tight loops. (Without it, the local copy of 'trap' could never change.) -*/ -#define dojump(ci,i,e) { pc += GETARG_sJ(i) + e; updatetrap(ci); } - - -/* for test instructions, execute the jump instruction that follows it */ -#define donextjump(ci) { Instruction ni = *pc; dojump(ci, ni, 1); } - -/* -** do a conditional jump: skip next instruction if 'cond' is not what -** was expected (parameter 'k'), else do next instruction, which must -** be a jump. -*/ -#define docondjump() if (cond != GETARG_k(i)) pc++; else donextjump(ci); - - -/* -** Correct global 'pc'. -*/ -#define savepc(L) (ci->u.l.savedpc = pc) - - -/* -** Whenever code can raise errors, the global 'pc' and the global -** 'top' must be correct to report occasional errors. -*/ -#define savestate(L,ci) (savepc(L), L->top.p = ci->top.p) - - -/* -** Protect code that, in general, can raise errors, reallocate the -** stack, and change the hooks. -*/ -#define Protect(exp) (savestate(L,ci), (exp), updatetrap(ci)) - -/* special version that does not change the top */ -#define ProtectNT(exp) (savepc(L), (exp), updatetrap(ci)) - -/* -** Protect code that can only raise errors. (That is, it cannot change -** the stack or hooks.) -*/ -#define halfProtect(exp) (savestate(L,ci), (exp)) - -/* 'c' is the limit of live values in the stack */ -#define checkGC(L,c) \ - { luaC_condGC(L, (savepc(L), L->top.p = (c)), \ - updatetrap(ci)); \ - luai_threadyield(L); } - - -/* fetch an instruction and prepare its execution */ -#define vmfetch() { \ - if (l_unlikely(trap)) { /* stack reallocation or hooks? */ \ - trap = luaG_traceexec(L, pc); /* handle hooks */ \ - updatebase(ci); /* correct stack */ \ - } \ - i = *(pc++); \ -} - -#define vmdispatch(o) switch(o) -#define vmcase(l) case l: -#define vmbreak break - - -void luaV_execute (lua_State *L, CallInfo *ci) { - LClosure *cl; - TValue *k; - StkId base; - const Instruction *pc; - int trap; -#if LUA_USE_JUMPTABLE -#include "ljumptab.h" -#endif - startfunc: - trap = L->hookmask; - returning: /* trap already set */ - cl = ci_func(ci); - k = cl->p->k; - pc = ci->u.l.savedpc; - if (l_unlikely(trap)) - trap = luaG_tracecall(L); - base = ci->func.p + 1; - /* main loop of interpreter */ - for (;;) { - Instruction i; /* instruction being executed */ - vmfetch(); - #if 0 - /* low-level line tracing for debugging Lua */ - printf("line: %d\n", luaG_getfuncline(cl->p, pcRel(pc, cl->p))); - #endif - lua_assert(base == ci->func.p + 1); - lua_assert(base <= L->top.p && L->top.p <= L->stack_last.p); - /* invalidate top for instructions not expecting it */ - lua_assert(isIT(i) || (cast_void(L->top.p = base), 1)); - vmdispatch (GET_OPCODE(i)) { - vmcase(OP_MOVE) { - StkId ra = RA(i); - setobjs2s(L, ra, RB(i)); - vmbreak; - } - vmcase(OP_LOADI) { - StkId ra = RA(i); - lua_Integer b = GETARG_sBx(i); - setivalue(s2v(ra), b); - vmbreak; - } - vmcase(OP_LOADF) { - StkId ra = RA(i); - int b = GETARG_sBx(i); - setfltvalue(s2v(ra), cast_num(b)); - vmbreak; - } - vmcase(OP_LOADK) { - StkId ra = RA(i); - TValue *rb = k + GETARG_Bx(i); - setobj2s(L, ra, rb); - vmbreak; - } - vmcase(OP_LOADKX) { - StkId ra = RA(i); - TValue *rb; - rb = k + GETARG_Ax(*pc); pc++; - setobj2s(L, ra, rb); - vmbreak; - } - vmcase(OP_LOADFALSE) { - StkId ra = RA(i); - setbfvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LFALSESKIP) { - StkId ra = RA(i); - setbfvalue(s2v(ra)); - pc++; /* skip next instruction */ - vmbreak; - } - vmcase(OP_LOADTRUE) { - StkId ra = RA(i); - setbtvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LOADNIL) { - StkId ra = RA(i); - int b = GETARG_B(i); - do { - setnilvalue(s2v(ra++)); - } while (b--); - vmbreak; - } - vmcase(OP_GETUPVAL) { - StkId ra = RA(i); - int b = GETARG_B(i); - setobj2s(L, ra, cl->upvals[b]->v.p); - vmbreak; - } - vmcase(OP_SETUPVAL) { - StkId ra = RA(i); - UpVal *uv = cl->upvals[GETARG_B(i)]; - setobj(L, uv->v.p, s2v(ra)); - luaC_barrier(L, uv, s2v(ra)); - vmbreak; - } - vmcase(OP_GETTABUP) { - StkId ra = RA(i); - TValue *upval = cl->upvals[GETARG_B(i)]->v.p; - TValue *rc = KC(i); - TString *key = tsvalue(rc); /* key must be a short string */ - int tag; - luaV_fastget(upval, key, s2v(ra), luaH_getshortstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, upval, rc, ra, tag)); - vmbreak; - } - vmcase(OP_GETTABLE) { - StkId ra = RA(i); - TValue *rb = vRB(i); - TValue *rc = vRC(i); - int tag; - if (ttisinteger(rc)) { /* fast track for integers? */ - luaV_fastgeti(rb, ivalue(rc), s2v(ra), tag); - } - else - luaV_fastget(rb, rc, s2v(ra), luaH_get, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_GETI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int c = GETARG_C(i); - int tag; - luaV_fastgeti(rb, c, s2v(ra), tag); - if (tagisempty(tag)) { - TValue key; - setivalue(&key, c); - Protect(luaV_finishget(L, rb, &key, ra, tag)); - } - vmbreak; - } - vmcase(OP_GETFIELD) { - StkId ra = RA(i); - TValue *rb = vRB(i); - TValue *rc = KC(i); - TString *key = tsvalue(rc); /* key must be a short string */ - int tag; - luaV_fastget(rb, key, s2v(ra), luaH_getshortstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_SETTABUP) { - int hres; - TValue *upval = cl->upvals[GETARG_A(i)]->v.p; - TValue *rb = KB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rb); /* key must be a short string */ - luaV_fastset(upval, key, rc, hres, luaH_psetshortstr); - if (hres == HOK) - luaV_finishfastset(L, upval, rc); - else - Protect(luaV_finishset(L, upval, rb, rc, hres)); - vmbreak; - } - vmcase(OP_SETTABLE) { - StkId ra = RA(i); - int hres; - TValue *rb = vRB(i); /* key (table is in 'ra') */ - TValue *rc = RKC(i); /* value */ - if (ttisinteger(rb)) { /* fast track for integers? */ - luaV_fastseti(s2v(ra), ivalue(rb), rc, hres); - } - else { - luaV_fastset(s2v(ra), rb, rc, hres, luaH_pset); - } - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else - Protect(luaV_finishset(L, s2v(ra), rb, rc, hres)); - vmbreak; - } - vmcase(OP_SETI) { - StkId ra = RA(i); - int hres; - int b = GETARG_B(i); - TValue *rc = RKC(i); - luaV_fastseti(s2v(ra), b, rc, hres); - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else { - TValue key; - setivalue(&key, b); - Protect(luaV_finishset(L, s2v(ra), &key, rc, hres)); - } - vmbreak; - } - vmcase(OP_SETFIELD) { - StkId ra = RA(i); - int hres; - TValue *rb = KB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rb); /* key must be a short string */ - luaV_fastset(s2v(ra), key, rc, hres, luaH_psetshortstr); - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else - Protect(luaV_finishset(L, s2v(ra), rb, rc, hres)); - vmbreak; - } - vmcase(OP_NEWTABLE) { - StkId ra = RA(i); - int b = GETARG_B(i); /* log2(hash size) + 1 */ - int c = GETARG_C(i); /* array size */ - Table *t; - if (b > 0) - b = 1 << (b - 1); /* size is 2^(b - 1) */ - lua_assert((!TESTARG_k(i)) == (GETARG_Ax(*pc) == 0)); - if (TESTARG_k(i)) /* non-zero extra argument? */ - c += GETARG_Ax(*pc) * (MAXARG_C + 1); /* add it to size */ - pc++; /* skip extra argument */ - L->top.p = ra + 1; /* correct top in case of emergency GC */ - t = luaH_new(L); /* memory allocation */ - sethvalue2s(L, ra, t); - if (b != 0 || c != 0) - luaH_resize(L, t, c, b); /* idem */ - checkGC(L, ra + 1); - vmbreak; - } - vmcase(OP_SELF) { - StkId ra = RA(i); - int tag; - TValue *rb = vRB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rc); /* key must be a string */ - setobj2s(L, ra + 1, rb); - luaV_fastget(rb, key, s2v(ra), luaH_getstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_ADDI) { - op_arithI(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_ADDK) { - op_arithK(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_SUBK) { - op_arithK(L, l_subi, luai_numsub); - vmbreak; - } - vmcase(OP_MULK) { - op_arithK(L, l_muli, luai_nummul); - vmbreak; - } - vmcase(OP_MODK) { - savestate(L, ci); /* in case of division by 0 */ - op_arithK(L, luaV_mod, luaV_modf); - vmbreak; - } - vmcase(OP_POWK) { - op_arithfK(L, luai_numpow); - vmbreak; - } - vmcase(OP_DIVK) { - op_arithfK(L, luai_numdiv); - vmbreak; - } - vmcase(OP_IDIVK) { - savestate(L, ci); /* in case of division by 0 */ - op_arithK(L, luaV_idiv, luai_numidiv); - vmbreak; - } - vmcase(OP_BANDK) { - op_bitwiseK(L, l_band); - vmbreak; - } - vmcase(OP_BORK) { - op_bitwiseK(L, l_bor); - vmbreak; - } - vmcase(OP_BXORK) { - op_bitwiseK(L, l_bxor); - vmbreak; - } - vmcase(OP_SHRI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int ic = GETARG_sC(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - pc++; setivalue(s2v(ra), luaV_shiftl(ib, -ic)); - } - vmbreak; - } - vmcase(OP_SHLI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int ic = GETARG_sC(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - pc++; setivalue(s2v(ra), luaV_shiftl(ic, ib)); - } - vmbreak; - } - vmcase(OP_ADD) { - op_arith(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_SUB) { - op_arith(L, l_subi, luai_numsub); - vmbreak; - } - vmcase(OP_MUL) { - op_arith(L, l_muli, luai_nummul); - vmbreak; - } - vmcase(OP_MOD) { - savestate(L, ci); /* in case of division by 0 */ - op_arith(L, luaV_mod, luaV_modf); - vmbreak; - } - vmcase(OP_POW) { - op_arithf(L, luai_numpow); - vmbreak; - } - vmcase(OP_DIV) { /* float division (always with floats) */ - op_arithf(L, luai_numdiv); - vmbreak; - } - vmcase(OP_IDIV) { /* floor division */ - savestate(L, ci); /* in case of division by 0 */ - op_arith(L, luaV_idiv, luai_numidiv); - vmbreak; - } - vmcase(OP_BAND) { - op_bitwise(L, l_band); - vmbreak; - } - vmcase(OP_BOR) { - op_bitwise(L, l_bor); - vmbreak; - } - vmcase(OP_BXOR) { - op_bitwise(L, l_bxor); - vmbreak; - } - vmcase(OP_SHR) { - op_bitwise(L, luaV_shiftr); - vmbreak; - } - vmcase(OP_SHL) { - op_bitwise(L, luaV_shiftl); - vmbreak; - } - vmcase(OP_MMBIN) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); /* original arith. expression */ - TValue *rb = vRB(i); - TMS tm = (TMS)GETARG_C(i); - StkId result = RA(pi); - lua_assert(OP_ADD <= GET_OPCODE(pi) && GET_OPCODE(pi) <= OP_SHR); - Protect(luaT_trybinTM(L, s2v(ra), rb, result, tm)); - vmbreak; - } - vmcase(OP_MMBINI) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); /* original arith. expression */ - int imm = GETARG_sB(i); - TMS tm = (TMS)GETARG_C(i); - int flip = GETARG_k(i); - StkId result = RA(pi); - Protect(luaT_trybiniTM(L, s2v(ra), imm, flip, result, tm)); - vmbreak; - } - vmcase(OP_MMBINK) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); /* original arith. expression */ - TValue *imm = KB(i); - TMS tm = (TMS)GETARG_C(i); - int flip = GETARG_k(i); - StkId result = RA(pi); - Protect(luaT_trybinassocTM(L, s2v(ra), imm, flip, result, tm)); - vmbreak; - } - vmcase(OP_UNM) { - StkId ra = RA(i); - TValue *rb = vRB(i); - lua_Number nb; - if (ttisinteger(rb)) { - lua_Integer ib = ivalue(rb); - setivalue(s2v(ra), intop(-, 0, ib)); - } - else if (tonumberns(rb, nb)) { - setfltvalue(s2v(ra), luai_numunm(L, nb)); - } - else - Protect(luaT_trybinTM(L, rb, rb, ra, TM_UNM)); - vmbreak; - } - vmcase(OP_BNOT) { - StkId ra = RA(i); - TValue *rb = vRB(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - setivalue(s2v(ra), intop(^, ~l_castS2U(0), ib)); - } - else - Protect(luaT_trybinTM(L, rb, rb, ra, TM_BNOT)); - vmbreak; - } - vmcase(OP_NOT) { - StkId ra = RA(i); - TValue *rb = vRB(i); - if (l_isfalse(rb)) - setbtvalue(s2v(ra)); - else - setbfvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LEN) { - StkId ra = RA(i); - Protect(luaV_objlen(L, ra, vRB(i))); - vmbreak; - } - vmcase(OP_CONCAT) { - StkId ra = RA(i); - int n = GETARG_B(i); /* number of elements to concatenate */ - L->top.p = ra + n; /* mark the end of concat operands */ - ProtectNT(luaV_concat(L, n)); - checkGC(L, L->top.p); /* 'luaV_concat' ensures correct top */ - vmbreak; - } - vmcase(OP_CLOSE) { - StkId ra = RA(i); - Protect(luaF_close(L, ra, LUA_OK, 1)); - vmbreak; - } - vmcase(OP_TBC) { - StkId ra = RA(i); - /* create new to-be-closed upvalue */ - halfProtect(luaF_newtbcupval(L, ra)); - vmbreak; - } - vmcase(OP_JMP) { - dojump(ci, i, 0); - vmbreak; - } - vmcase(OP_EQ) { - StkId ra = RA(i); - int cond; - TValue *rb = vRB(i); - Protect(cond = luaV_equalobj(L, s2v(ra), rb)); - docondjump(); - vmbreak; - } - vmcase(OP_LT) { - op_order(L, l_lti, LTnum, lessthanothers); - vmbreak; - } - vmcase(OP_LE) { - op_order(L, l_lei, LEnum, lessequalothers); - vmbreak; - } - vmcase(OP_EQK) { - StkId ra = RA(i); - TValue *rb = KB(i); - /* basic types do not use '__eq'; we can use raw equality */ - int cond = luaV_rawequalobj(s2v(ra), rb); - docondjump(); - vmbreak; - } - vmcase(OP_EQI) { - StkId ra = RA(i); - int cond; - int im = GETARG_sB(i); - if (ttisinteger(s2v(ra))) - cond = (ivalue(s2v(ra)) == im); - else if (ttisfloat(s2v(ra))) - cond = luai_numeq(fltvalue(s2v(ra)), cast_num(im)); - else - cond = 0; /* other types cannot be equal to a number */ - docondjump(); - vmbreak; - } - vmcase(OP_LTI) { - op_orderI(L, l_lti, luai_numlt, 0, TM_LT); - vmbreak; - } - vmcase(OP_LEI) { - op_orderI(L, l_lei, luai_numle, 0, TM_LE); - vmbreak; - } - vmcase(OP_GTI) { - op_orderI(L, l_gti, luai_numgt, 1, TM_LT); - vmbreak; - } - vmcase(OP_GEI) { - op_orderI(L, l_gei, luai_numge, 1, TM_LE); - vmbreak; - } - vmcase(OP_TEST) { - StkId ra = RA(i); - int cond = !l_isfalse(s2v(ra)); - docondjump(); - vmbreak; - } - vmcase(OP_TESTSET) { - StkId ra = RA(i); - TValue *rb = vRB(i); - if (l_isfalse(rb) == GETARG_k(i)) - pc++; - else { - setobj2s(L, ra, rb); - donextjump(ci); - } - vmbreak; - } - vmcase(OP_CALL) { - StkId ra = RA(i); - CallInfo *newci; - int b = GETARG_B(i); - int nresults = GETARG_C(i) - 1; - if (b != 0) /* fixed number of arguments? */ - L->top.p = ra + b; /* top signals number of arguments */ - /* else previous instruction set top */ - savepc(L); /* in case of errors */ - if ((newci = luaD_precall(L, ra, nresults)) == NULL) - updatetrap(ci); /* C call; nothing else to be done */ - else { /* Lua call: run function in this same C frame */ - ci = newci; - goto startfunc; - } - vmbreak; - } - vmcase(OP_TAILCALL) { - StkId ra = RA(i); - int b = GETARG_B(i); /* number of arguments + 1 (function) */ - int n; /* number of results when calling a C function */ - int nparams1 = GETARG_C(i); - /* delta is virtual 'func' - real 'func' (vararg functions) */ - int delta = (nparams1) ? ci->u.l.nextraargs + nparams1 : 0; - if (b != 0) - L->top.p = ra + b; - else /* previous instruction set top */ - b = cast_int(L->top.p - ra); - savepc(ci); /* several calls here can raise errors */ - if (TESTARG_k(i)) { - luaF_closeupval(L, base); /* close upvalues from current call */ - lua_assert(L->tbclist.p < base); /* no pending tbc variables */ - lua_assert(base == ci->func.p + 1); - } - if ((n = luaD_pretailcall(L, ci, ra, b, delta)) < 0) /* Lua function? */ - goto startfunc; /* execute the callee */ - else { /* C function? */ - ci->func.p -= delta; /* restore 'func' (if vararg) */ - luaD_poscall(L, ci, n); /* finish caller */ - updatetrap(ci); /* 'luaD_poscall' can change hooks */ - goto ret; /* caller returns after the tail call */ - } - } - vmcase(OP_RETURN) { - StkId ra = RA(i); - int n = GETARG_B(i) - 1; /* number of results */ - int nparams1 = GETARG_C(i); - if (n < 0) /* not fixed? */ - n = cast_int(L->top.p - ra); /* get what is available */ - savepc(ci); - if (TESTARG_k(i)) { /* may there be open upvalues? */ - ci->u2.nres = n; /* save number of returns */ - if (L->top.p < ci->top.p) - L->top.p = ci->top.p; - luaF_close(L, base, CLOSEKTOP, 1); - updatetrap(ci); - updatestack(ci); - } - if (nparams1) /* vararg function? */ - ci->func.p -= ci->u.l.nextraargs + nparams1; - L->top.p = ra + n; /* set call for 'luaD_poscall' */ - luaD_poscall(L, ci, n); - updatetrap(ci); /* 'luaD_poscall' can change hooks */ - goto ret; - } - vmcase(OP_RETURN0) { - if (l_unlikely(L->hookmask)) { - StkId ra = RA(i); - L->top.p = ra; - savepc(ci); - luaD_poscall(L, ci, 0); /* no hurry... */ - trap = 1; - } - else { /* do the 'poscall' here */ - int nres; - L->ci = ci->previous; /* back to caller */ - L->top.p = base - 1; - for (nres = ci->nresults; l_unlikely(nres > 0); nres--) - setnilvalue(s2v(L->top.p++)); /* all results are nil */ - } - goto ret; - } - vmcase(OP_RETURN1) { - if (l_unlikely(L->hookmask)) { - StkId ra = RA(i); - L->top.p = ra + 1; - savepc(ci); - luaD_poscall(L, ci, 1); /* no hurry... */ - trap = 1; - } - else { /* do the 'poscall' here */ - int nres = ci->nresults; - L->ci = ci->previous; /* back to caller */ - if (nres == 0) - L->top.p = base - 1; /* asked for no results */ - else { - StkId ra = RA(i); - setobjs2s(L, base - 1, ra); /* at least this result */ - L->top.p = base; - for (; l_unlikely(nres > 1); nres--) - setnilvalue(s2v(L->top.p++)); /* complete missing results */ - } - } - ret: /* return from a Lua function */ - if (ci->callstatus & CIST_FRESH) - return; /* end this frame */ - else { - ci = ci->previous; - goto returning; /* continue running caller in this frame */ - } - } - vmcase(OP_FORLOOP) { - StkId ra = RA(i); - if (ttisinteger(s2v(ra + 1))) { /* integer loop? */ - lua_Unsigned count = l_castS2U(ivalue(s2v(ra))); - if (count > 0) { /* still more iterations? */ - lua_Integer step = ivalue(s2v(ra + 1)); - lua_Integer idx = ivalue(s2v(ra + 2)); /* control variable */ - chgivalue(s2v(ra), count - 1); /* update counter */ - idx = intop(+, idx, step); /* add step to index */ - chgivalue(s2v(ra + 2), idx); /* update control variable */ - pc -= GETARG_Bx(i); /* jump back */ - } - } - else if (floatforloop(ra)) /* float loop */ - pc -= GETARG_Bx(i); /* jump back */ - updatetrap(ci); /* allows a signal to break the loop */ - vmbreak; - } - vmcase(OP_FORPREP) { - StkId ra = RA(i); - savestate(L, ci); /* in case of errors */ - if (forprep(L, ra)) - pc += GETARG_Bx(i) + 1; /* skip the loop */ - vmbreak; - } - vmcase(OP_TFORPREP) { - /* before: 'ra' has the iterator function, 'ra + 1' has the state, - 'ra + 2' has the initial value for the control variable, and - 'ra + 3' has the closing variable. This opcode then swaps the - control and the closing variables and marks the closing variable - as to-be-closed. - */ - StkId ra = RA(i); - TValue temp; /* to swap control and closing variables */ - setobj(L, &temp, s2v(ra + 3)); - setobjs2s(L, ra + 3, ra + 2); - setobj2s(L, ra + 2, &temp); - /* create to-be-closed upvalue (if closing var. is not nil) */ - halfProtect(luaF_newtbcupval(L, ra + 2)); - pc += GETARG_Bx(i); /* go to end of the loop */ - i = *(pc++); /* fetch next instruction */ - lua_assert(GET_OPCODE(i) == OP_TFORCALL && ra == RA(i)); - goto l_tforcall; - } - vmcase(OP_TFORCALL) { - l_tforcall: { - /* 'ra' has the iterator function, 'ra + 1' has the state, - 'ra + 2' has the closing variable, and 'ra + 3' has the control - variable. The call will use the stack starting at 'ra + 3', - so that it preserves the first three values, and the first - return will be the new value for the control variable. - */ - StkId ra = RA(i); - setobjs2s(L, ra + 5, ra + 3); /* copy the control variable */ - setobjs2s(L, ra + 4, ra + 1); /* copy state */ - setobjs2s(L, ra + 3, ra); /* copy function */ - L->top.p = ra + 3 + 3; - ProtectNT(luaD_call(L, ra + 3, GETARG_C(i))); /* do the call */ - updatestack(ci); /* stack may have changed */ - i = *(pc++); /* go to next instruction */ - lua_assert(GET_OPCODE(i) == OP_TFORLOOP && ra == RA(i)); - goto l_tforloop; - }} - vmcase(OP_TFORLOOP) { - l_tforloop: { - StkId ra = RA(i); - if (!ttisnil(s2v(ra + 3))) /* continue loop? */ - pc -= GETARG_Bx(i); /* jump back */ - vmbreak; - }} - vmcase(OP_SETLIST) { - StkId ra = RA(i); - int n = GETARG_B(i); - unsigned int last = GETARG_C(i); - Table *h = hvalue(s2v(ra)); - if (n == 0) - n = cast_int(L->top.p - ra) - 1; /* get up to the top */ - else - L->top.p = ci->top.p; /* correct top in case of emergency GC */ - last += n; - if (TESTARG_k(i)) { - last += GETARG_Ax(*pc) * (MAXARG_C + 1); - pc++; - } - if (last > luaH_realasize(h)) /* needs more space? */ - luaH_resizearray(L, h, last); /* preallocate it at once */ - for (; n > 0; n--) { - TValue *val = s2v(ra + n); - obj2arr(h, last, val); - last--; - luaC_barrierback(L, obj2gco(h), val); - } - vmbreak; - } - vmcase(OP_CLOSURE) { - StkId ra = RA(i); - Proto *p = cl->p->p[GETARG_Bx(i)]; - halfProtect(pushclosure(L, p, cl->upvals, base, ra)); - checkGC(L, ra + 1); - vmbreak; - } - vmcase(OP_VARARG) { - StkId ra = RA(i); - int n = GETARG_C(i) - 1; /* required results */ - Protect(luaT_getvarargs(L, ci, ra, n)); - vmbreak; - } - vmcase(OP_VARARGPREP) { - ProtectNT(luaT_adjustvarargs(L, GETARG_A(i), ci, cl->p)); - if (l_unlikely(trap)) { /* previous "Protect" updated trap */ - luaD_hookcall(L, ci); - L->oldpc = 1; /* next opcode will be seen as a "new" line */ - } - updatebase(ci); /* function has new base after adjustment */ - vmbreak; - } - vmcase(OP_EXTRAARG) { - lua_assert(0); - vmbreak; - } - } - } -} - -/* }================================================================== */ diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lvm.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lvm.h deleted file mode 100644 index a11db83..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lvm.h +++ /dev/null @@ -1,136 +0,0 @@ -/* -** $Id: lvm.h $ -** Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#ifndef lvm_h -#define lvm_h - - -#include "ldo.h" -#include "lobject.h" -#include "ltm.h" - - -#if !defined(LUA_NOCVTN2S) -#define cvt2str(o) ttisnumber(o) -#else -#define cvt2str(o) 0 /* no conversion from numbers to strings */ -#endif - - -#if !defined(LUA_NOCVTS2N) -#define cvt2num(o) ttisstring(o) -#else -#define cvt2num(o) 0 /* no conversion from strings to numbers */ -#endif - - -/* -** You can define LUA_FLOORN2I if you want to convert floats to integers -** by flooring them (instead of raising an error if they are not -** integral values) -*/ -#if !defined(LUA_FLOORN2I) -#define LUA_FLOORN2I F2Ieq -#endif - - -/* -** Rounding modes for float->integer coercion - */ -typedef enum { - F2Ieq, /* no rounding; accepts only integral values */ - F2Ifloor, /* takes the floor of the number */ - F2Iceil /* takes the ceil of the number */ -} F2Imod; - - -/* convert an object to a float (including string coercion) */ -#define tonumber(o,n) \ - (ttisfloat(o) ? (*(n) = fltvalue(o), 1) : luaV_tonumber_(o,n)) - - -/* convert an object to a float (without string coercion) */ -#define tonumberns(o,n) \ - (ttisfloat(o) ? ((n) = fltvalue(o), 1) : \ - (ttisinteger(o) ? ((n) = cast_num(ivalue(o)), 1) : 0)) - - -/* convert an object to an integer (including string coercion) */ -#define tointeger(o,i) \ - (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ - : luaV_tointeger(o,i,LUA_FLOORN2I)) - - -/* convert an object to an integer (without string coercion) */ -#define tointegerns(o,i) \ - (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ - : luaV_tointegerns(o,i,LUA_FLOORN2I)) - - -#define intop(op,v1,v2) l_castU2S(l_castS2U(v1) op l_castS2U(v2)) - -#define luaV_rawequalobj(t1,t2) luaV_equalobj(NULL,t1,t2) - - -/* -** fast track for 'gettable' -*/ -#define luaV_fastget(t,k,res,f, tag) \ - (tag = (!ttistable(t) ? LUA_VNOTABLE : f(hvalue(t), k, res))) - - -/* -** Special case of 'luaV_fastget' for integers, inlining the fast case -** of 'luaH_getint'. -*/ -#define luaV_fastgeti(t,k,res,tag) \ - if (!ttistable(t)) tag = LUA_VNOTABLE; \ - else { luaH_fastgeti(hvalue(t), k, res, tag); } - - -#define luaV_fastset(t,k,val,hres,f) \ - (hres = (!ttistable(t) ? HNOTATABLE : f(hvalue(t), k, val))) - -#define luaV_fastseti(t,k,val,hres) \ - if (!ttistable(t)) hres = HNOTATABLE; \ - else { luaH_fastseti(hvalue(t), k, val, hres); } - - -/* -** Finish a fast set operation (when fast set succeeds). -*/ -#define luaV_finishfastset(L,t,v) luaC_barrierback(L, gcvalue(t), v) - - -/* -** Shift right is the same as shift left with a negative 'y' -*/ -#define luaV_shiftr(x,y) luaV_shiftl(x,intop(-, 0, y)) - - - -LUAI_FUNC int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2); -LUAI_FUNC int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r); -LUAI_FUNC int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r); -LUAI_FUNC int luaV_tonumber_ (const TValue *obj, lua_Number *n); -LUAI_FUNC int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode); -LUAI_FUNC int luaV_tointegerns (const TValue *obj, lua_Integer *p, - F2Imod mode); -LUAI_FUNC int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode); -LUAI_FUNC int luaV_finishget (lua_State *L, const TValue *t, TValue *key, - StkId val, int tag); -LUAI_FUNC void luaV_finishset (lua_State *L, const TValue *t, TValue *key, - TValue *val, int aux); -LUAI_FUNC void luaV_finishOp (lua_State *L); -LUAI_FUNC void luaV_execute (lua_State *L, CallInfo *ci); -LUAI_FUNC void luaV_concat (lua_State *L, int total); -LUAI_FUNC lua_Integer luaV_idiv (lua_State *L, lua_Integer x, lua_Integer y); -LUAI_FUNC lua_Integer luaV_mod (lua_State *L, lua_Integer x, lua_Integer y); -LUAI_FUNC lua_Number luaV_modf (lua_State *L, lua_Number x, lua_Number y); -LUAI_FUNC lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y); -LUAI_FUNC void luaV_objlen (lua_State *L, StkId ra, const TValue *rb); - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lzio.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lzio.c deleted file mode 100644 index 78f7ac8..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lzio.c +++ /dev/null @@ -1,88 +0,0 @@ -/* -** $Id: lzio.c $ -** Buffered streams -** See Copyright Notice in lua.h -*/ - -#define lzio_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "llimits.h" -#include "lmem.h" -#include "lstate.h" -#include "lzio.h" - - -int luaZ_fill (ZIO *z) { - size_t size; - lua_State *L = z->L; - const char *buff; - lua_unlock(L); - buff = z->reader(L, z->data, &size); - lua_lock(L); - if (buff == NULL || size == 0) - return EOZ; - z->n = size - 1; /* discount char being returned */ - z->p = buff; - return cast_uchar(*(z->p++)); -} - - -void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, void *data) { - z->L = L; - z->reader = reader; - z->data = data; - z->n = 0; - z->p = NULL; -} - - -/* --------------------------------------------------------------- read --- */ - -static int checkbuffer (ZIO *z) { - if (z->n == 0) { /* no bytes in buffer? */ - if (luaZ_fill(z) == EOZ) /* try to read more */ - return 0; /* no more input */ - else { - z->n++; /* luaZ_fill consumed first byte; put it back */ - z->p--; - } - } - return 1; /* now buffer has something */ -} - - -size_t luaZ_read (ZIO *z, void *b, size_t n) { - while (n) { - size_t m; - if (!checkbuffer(z)) - return n; /* no more input; return number of missing bytes */ - m = (n <= z->n) ? n : z->n; /* min. between n and z->n */ - memcpy(b, z->p, m); - z->n -= m; - z->p += m; - b = (char *)b + m; - n -= m; - } - return 0; -} - - -const void *luaZ_getaddr (ZIO* z, size_t n) { - const void *res; - if (!checkbuffer(z)) - return NULL; /* no more input */ - if (z->n < n) /* not enough bytes? */ - return NULL; /* block not whole; cannot give an address */ - res = z->p; /* get block address */ - z->n -= n; /* consume these bytes */ - z->p += n; - return res; -} diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lzio.h b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lzio.h deleted file mode 100644 index 55cc74a..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/lzio.h +++ /dev/null @@ -1,67 +0,0 @@ -/* -** $Id: lzio.h $ -** Buffered streams -** See Copyright Notice in lua.h -*/ - - -#ifndef lzio_h -#define lzio_h - -#include "lua.h" - -#include "lmem.h" - - -#define EOZ (-1) /* end of stream */ - -typedef struct Zio ZIO; - -#define zgetc(z) (((z)->n--)>0 ? cast_uchar(*(z)->p++) : luaZ_fill(z)) - - -typedef struct Mbuffer { - char *buffer; - size_t n; - size_t buffsize; -} Mbuffer; - -#define luaZ_initbuffer(L, buff) ((buff)->buffer = NULL, (buff)->buffsize = 0) - -#define luaZ_buffer(buff) ((buff)->buffer) -#define luaZ_sizebuffer(buff) ((buff)->buffsize) -#define luaZ_bufflen(buff) ((buff)->n) - -#define luaZ_buffremove(buff,i) ((buff)->n -= (i)) -#define luaZ_resetbuffer(buff) ((buff)->n = 0) - - -#define luaZ_resizebuffer(L, buff, size) \ - ((buff)->buffer = luaM_reallocvchar(L, (buff)->buffer, \ - (buff)->buffsize, size), \ - (buff)->buffsize = size) - -#define luaZ_freebuffer(L, buff) luaZ_resizebuffer(L, buff, 0) - - -LUAI_FUNC void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, - void *data); -LUAI_FUNC size_t luaZ_read (ZIO* z, void *b, size_t n); /* read next n bytes */ - -LUAI_FUNC const void *luaZ_getaddr (ZIO* z, size_t n); - - -/* --------- Private Part ------------------ */ - -struct Zio { - size_t n; /* bytes still unread */ - const char *p; /* current position in buffer */ - lua_Reader reader; /* reader function */ - void *data; /* additional data */ - lua_State *L; /* Lua state (for reader) */ -}; - - -LUAI_FUNC int luaZ_fill (ZIO *z); - -#endif diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/onelua.c b/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/onelua.c deleted file mode 100644 index 320dfc0..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/dependencies/lua/onelua.c +++ /dev/null @@ -1,100 +0,0 @@ -/* -** Lua core, libraries, and interpreter in a single file. -** Compiling just this file generates a complete Lua stand-alone -** program: -** -** $ gcc -O2 -std=c99 -o lua onelua.c -lm -** -** or -** -** $ gcc -O2 -std=c89 -DLUA_USE_C89 -o lua onelua.c -lm -** -*/ - -/* default is to build the full interpreter */ -#ifndef MAKE_LIB -#ifndef MAKE_LUAC -#ifndef MAKE_LUA -#define MAKE_LUA -#endif -#endif -#endif - - -/* -** Choose suitable platform-specific features. Default is no -** platform-specific features. Some of these options may need extra -** libraries such as -ldl -lreadline -lncurses -*/ -#if 0 -#define LUA_USE_LINUX -#define LUA_USE_MACOSX -#define LUA_USE_POSIX -#define LUA_ANSI -#endif - - -/* no need to change anything below this line ----------------------------- */ - -#include "lprefix.h" - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -#include "custom_math/custom_math.h" - -/* setup for luaconf.h */ -#define LUA_CORE -#define LUA_LIB -#define ltable_c -#define lvm_c -#include "luaconf.h" - -/* do not export internal symbols */ -#undef LUAI_FUNC -#undef LUAI_DDEC -#undef LUAI_DDEF -#define LUAI_FUNC static -#define LUAI_DDEC(def) /* empty */ -#define LUAI_DDEF static - -/* core -- used by all */ -#include "custom_math/custom_math.c" -#include "lzio.c" -#include "lctype.c" -#include "lopcodes.c" -#include "lmem.c" -#include "lundump.c" -#include "ldump.c" -#include "lstate.c" -#include "lgc.c" -#include "llex.c" -#include "lcode.c" -#include "lparser.c" -#include "ldebug.c" -#include "lfunc.c" -#include "lobject.c" -#include "ltm.c" -#include "lstring.c" -#include "ltable.c" -#include "ldo.c" -#include "lvm.c" -#include "lapi.c" - -/* auxiliary library -- used by all */ -#include "lauxlib.c" - - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/extra/extra.c b/build/c/dependencies/CTextEngine/luaCEmbed/extra/extra.c deleted file mode 100644 index fc501a9..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/extra/extra.c +++ /dev/null @@ -1,47 +0,0 @@ - - -const char * LuaCembed_convert_arg_code(int arg_code){ - if(arg_code == LUA_CEMBED_NOT_FOUND){ - return PRIVATE_LUA_CEMBED_NOT_FOUND_STRING; - } - - if(arg_code == LUA_CEMBED_STRING){ - return PRIVATE_LUA_CEMBED_STRING_STRING; - - } - if(arg_code == LUA_CEMBED_NUMBER){ - return PRIVATE_LUA_CEMBED_NUMBER_STRING; - } - if(arg_code == LUA_CEMBED_BOOL){ - return PRIVATE_LUA_CEMBED_BOOL_STRING; - } - if(arg_code == LUA_CEMBED_NIL){ - return PRIVATE_LUA_CEMBED_NIL_STRING; - } - if(arg_code == LUA_CEMBED_TABLE){ - return PRIVATE_LUA_CEMBED_TABLE_STRING; - } - if(arg_code == LUA_CEMBED_FUNCTION){ - return PRIVATE_LUA_CEMBED_FUNCTION_STRING; - } - - return PRIVATE_LUA_CEMBED_UNKNOW_STRING; -} - -char * private_LuaCembed_format_vaarg(const char *expresion, va_list args){ - - va_list args_copy; - va_copy(args_copy, args); - long required_size = vsnprintf(NULL, 0,expresion,args_copy); - va_end(args_copy); - char *buffer = (char*)malloc(sizeof(char) * required_size + 2); - vsnprintf(buffer,sizeof (char) * required_size+1,expresion,args); - return buffer; -} -char * private_LuaCembed_format(const char *expresion, ...){ - va_list args; - va_start(args,expresion); - char *result = private_LuaCembed_format_vaarg(expresion,args); - va_end(args); - return result; -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/extra/extra.h b/build/c/dependencies/CTextEngine/luaCEmbed/extra/extra.h deleted file mode 100644 index 2796612..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/extra/extra.h +++ /dev/null @@ -1,10 +0,0 @@ - - -const char * LuaCembed_convert_arg_code(int arg_code); - - -char * private_LuaCembed_format_vaarg(const char *expresion, va_list args); - -char * private_LuaCembed_format(const char *expresion, ...); - - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/LuaCEmbedNamespace/LuaCEmbedNamespace.c b/build/c/dependencies/CTextEngine/luaCEmbed/namespace/LuaCEmbedNamespace/LuaCEmbedNamespace.c deleted file mode 100644 index 5d049f9..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/LuaCEmbedNamespace/LuaCEmbedNamespace.c +++ /dev/null @@ -1,46 +0,0 @@ - - -#include "../../LuaCEmbed/basic/basic.h" - -LuaCEmbedNamespace newLuaCEmbedNamespace(){ - LuaCEmbedNamespace self = {0}; - self.newLuaLib = newLuaCEmbedLib; - self.load_lib_from_c = LuaCEmbed_load_lib_from_c; - self.newLuaEvaluation = newLuaCEmbedEvaluation; - self.set_delete_function = LuaCembed_set_delete_function; - self.perform = LuaCembed_perform; - self.set_memory_limit = LuaCEmbed_set_memory_limit; - self.clear_errors = LuaCEmbed_clear_errors; - self.convert_arg_code = LuaCembed_convert_arg_code; - self.tables = newLuaCembedTableModule(); - self.args = newLuaCembedArgsModule(); - self.types = newLuaCEmbedTypeModule(); - self.globals = newLuaCEmbedGlobalModule(); - self.response = newLuaCEmbedResponseModule(); - self.get_error_message = LuaCEmbed_get_error_message; - self.has_errors = LuaCEmbed_has_errors; - self.set_timeout = LuaCEmbed_set_timeout; - self.evaluate = LuaCEmbed_evaluate; - self.get_string_evaluation = LuaCEmbed_get_evaluation_string; - self.get_evaluation_type = LuaCEmbed_get_evaluation_type; - self.get_evaluation_size = LuaCEmbed_get_evaluation_table_size; - self.get_evaluation_long = LuaCEmbed_get_evaluation_long; - self.get_evaluation_double = LuaCEmbed_get_evaluation_double; - self.get_evaluation_bool = LuaCEmbed_get_evaluation_bool; - self.evaluete_file = LuaCEmbed_evaluete_file; - self.add_callback = LuaCEmbed_add_callback; - self.add_global_callback = LuaCEmbed_add_global_callback; - self.set_bool_lib_prop = LuaCEmbed_set_bool_lib_prop; - self.set_long_lib_prop = LuaCEmbed_set_long_lib_prop; - self.set_double_lib_prop = LuaCEmbed_set_double_lib_prop; - self.set_string_lib_prop = LuaCEmbed_set_string_lib_prop; - self.set_table_lib_prop = LuaCEmbed_set_table_lib_prop; - self.get_long_lib_prop = LuaCEmbed_get_long_lib_prop; - self.get_double_lib_prop = LuaCEmbed_get_double_lib_prop; - self.get_bool_lib_prop = LuaCEmbed_get_bool_lib_prop; - self.get_string_lib_prop = LuaCEmbed_get_string_lib_prop; - self.get_table_lib_prop = LuaCEmbed_get_table_lib_prop; - - self.free = LuaCEmbed_free; - return self; -} diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/LuaCEmbedNamespace/LuaCEmbedNamespace.h b/build/c/dependencies/CTextEngine/luaCEmbed/namespace/LuaCEmbedNamespace/LuaCEmbedNamespace.h deleted file mode 100644 index 0b84877..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/LuaCEmbedNamespace/LuaCEmbedNamespace.h +++ /dev/null @@ -1,51 +0,0 @@ - - -typedef struct{ - LuaCEmbedTypeModule types; - LuaCEmbedResponseModule response; - LuaCembedArgsModule args; - LuaCEmbedGlobalModule globals; - LuaCembedTableModule tables; - void (*clear_errors)(LuaCEmbed *self); - LuaCEmbed * (*newLuaLib)(lua_State *state); - void (*set_delete_function)(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)); - LuaCEmbed * (*newLuaEvaluation)(); - void (*load_lib_from_c)(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name); - int (*perform)(LuaCEmbed *self); - const char * (*convert_arg_code)(int arg_code); - void (*set_memory_limit)(LuaCEmbed *self, double limit); - - char * (*get_error_message)(LuaCEmbed *self); - bool (*has_errors)(LuaCEmbed *self); - void (*set_timeout)(int seconds); - int (*evaluate)(LuaCEmbed *self, const char *code, ...); - char * (*get_string_evaluation)(LuaCEmbed *self,const char *code, ...); - int (*get_evaluation_type)(LuaCEmbed *self,const char *code,...); - long (*get_evaluation_size)(LuaCEmbed *self,const char *code,...); - long long (*get_evaluation_long)(LuaCEmbed *self,const char *code,...); - double (*get_evaluation_double)(LuaCEmbed *self,const char *code,...); - bool (*get_evaluation_bool)(LuaCEmbed *self, const char *code,...); - - void (*set_long_lib_prop)(LuaCEmbed *self,const char *name,long long value); - - void (*set_double_lib_prop)(LuaCEmbed *self,const char *name,double value); - void (*set_bool_lib_prop)(LuaCEmbed *self,const char *name,bool value); - void (*set_string_lib_prop)(LuaCEmbed *self,const char *name,const char * value); - void (*set_table_lib_prop)(LuaCEmbed *self,const char *name,LuaCEmbedTable *value); - - long long (*get_long_lib_prop)(LuaCEmbed *self,const char *name); - double (*get_double_lib_prop)(LuaCEmbed *self,const char *name); - bool (*get_bool_lib_prop)(LuaCEmbed *self,const char *name); - char * (*get_string_lib_prop)(LuaCEmbed *self,const char *name); - LuaCEmbedTable *(*get_table_lib_prop)(LuaCEmbed *self,const char *name); - - int (*evaluete_file)(LuaCEmbed *self, const char *file); - void (*add_callback)(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - void (*add_global_callback)(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - - void (*free)(LuaCEmbed *self); - -} LuaCEmbedNamespace; - -LuaCEmbedNamespace newLuaCEmbedNamespace(); - diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/args/args.c b/build/c/dependencies/CTextEngine/luaCEmbed/namespace/args/args.c deleted file mode 100644 index eff0f29..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/args/args.c +++ /dev/null @@ -1,21 +0,0 @@ - - -LuaCembedArgsModule newLuaCembedArgsModule(){ - LuaCembedArgsModule self = {0}; - self.get_bool = LuaCEmbed_get_bool_arg; - self.get_long = LuaCEmbed_get_long_arg; - self.get_double = LuaCEmbed_get_double_arg; - self.get_str = LuaCEmbed_get_str_arg; - self.get_raw_str = LuaCEmbed_get_raw_str_arg; - self.get_type = LuaCEmbed_get_arg_type; - self.get_table = LuaCEmbed_get_arg_table; - self.size = LuaCEmbed_get_total_args; - self.get_type_clojure_evalation = LuaCEmbed_get_type_clojure_evalation; - self.generate_arg_clojure_evalation = LuaCEmbed_generate_arg_clojure_evalation; - self.get_bool_arg_clojure_evalation = LuaCEmbed_get_bool_arg_clojure_evalation; - self.get_long_arg_clojure_evalation = LuaCEmbed_get_long_arg_clojure_evalation; - self.get_double_arg_clojure_evalation = LuaCEmbed_get_double_arg_clojure_evalation; - self.get_string_arg_clojure_evalation = LuaCEmbed_get_string_arg_clojure_evalation; - self.run_lambda = LuaCEmbed_run_args_lambda; - return self; -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/args/args.h b/build/c/dependencies/CTextEngine/luaCEmbed/namespace/args/args.h deleted file mode 100644 index 060d971..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/args/args.h +++ /dev/null @@ -1,26 +0,0 @@ - -typedef struct { - - - int (*size)(LuaCEmbed *self); - int (*get_type)(LuaCEmbed *self,int index); - long long (*get_long)(LuaCEmbed *self, int index); - double (*get_double)(LuaCEmbed *self, int index); - bool (*get_bool)(LuaCEmbed *self, int index); - char * (*get_raw_str)(LuaCEmbed *self, long *size, int index); - char * (*get_str)(LuaCEmbed *self, int index); - LuaCEmbedTable * (*get_table)(LuaCEmbed *self,int index); - int (*generate_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - int (*get_type_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - long long (*get_long_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - double (*get_double_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - bool (*get_bool_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - char* (*get_string_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - LuaCEmbedTable* (*run_lambda)(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call,int total_returns); - - - - -} LuaCembedArgsModule; - -LuaCembedArgsModule newLuaCembedArgsModule(); \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/declaration.h b/build/c/dependencies/CTextEngine/luaCEmbed/namespace/declaration.h deleted file mode 100644 index 672f719..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/declaration.h +++ /dev/null @@ -1,7 +0,0 @@ - -#include "types/types.h" -#include "response/response.h" -#include "globals/globals.h" -#include "args/args.h" -#include "table/table.h" -#include "LuaCEmbedNamespace/LuaCEmbedNamespace.h" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/definition.h b/build/c/dependencies/CTextEngine/luaCEmbed/namespace/definition.h deleted file mode 100644 index e488a6d..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/definition.h +++ /dev/null @@ -1,7 +0,0 @@ - -#include "types/types.c" -#include "response/response.c" -#include "globals/globals.c" -#include "args/args.c" -#include "table/table.c" -#include "LuaCEmbedNamespace/LuaCEmbedNamespace.c" \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/globals/globals.c b/build/c/dependencies/CTextEngine/luaCEmbed/namespace/globals/globals.c deleted file mode 100644 index 970e64e..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/globals/globals.c +++ /dev/null @@ -1,23 +0,0 @@ - - -LuaCEmbedGlobalModule newLuaCEmbedGlobalModule(){ - LuaCEmbedGlobalModule self = {0}; - self.ensure_type = LuaCEmbed_ensure_global_type; - self.get_double = LuaCEmbed_get_global_double; - self.get_string = LuaCEmbed_get_global_string; - self.get_long = LuaCEmbed_get_global_long; - self.get_raw_string = LuaCEmbed_get_global_raw_string; - self.set_raw_string = LuaCEmbed_set_global_raw_string; - self.get_bool = LuaCEmbed_get_global_bool; - self.get_type = LuaCEmbed_get_global_type; - self.run_global_lambda = LuaCEmbed_run_global_lambda; - self.set_table = LuaCEmbed_set_global_table; - self.set_string = LuaCEmbed_set_global_string; - self.set_bool = LuaCEmbed_set_global_bool; - self.set_double = LuaCEmbed_set_global_double; - self.set_long = LuaCEmbed_set_global_long; - self.new_table = LuaCembed_new_global_table; - self.get_table = LuaCembed_get_global_table; - - return self; -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/globals/globals.h b/build/c/dependencies/CTextEngine/luaCEmbed/namespace/globals/globals.h deleted file mode 100644 index d1e6e78..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/globals/globals.h +++ /dev/null @@ -1,28 +0,0 @@ - - -typedef struct { - - int (*ensure_type)(LuaCEmbed *self, const char *name,int expected_type); - int (*get_type)(LuaCEmbed *self,const char *name); - long long (*get_long)(LuaCEmbed *self,const char *name); - double (*get_double)(LuaCEmbed *self,const char *name); - bool (*get_bool)(LuaCEmbed *self,const char *name); - char * (*get_string)(LuaCEmbed *self,const char *name); - LuaCEmbedTable* (*run_global_lambda)(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns); - void (*set_table)(LuaCEmbed *self, const char *name, LuaCEmbedTable *table); - void (*set_raw_string)(LuaCEmbed *self, const char *name, const char *value, long size); - char * (*get_raw_string)(LuaCEmbed *self, const char *name, long *size); - - - void (*set_string)(LuaCEmbed *self,const char *name,const char *value); - void (*set_long)(LuaCEmbed *self,const char *name,long long value); - void (*set_double)(LuaCEmbed *self,const char *name,double value); - void (*set_bool)(LuaCEmbed *self,const char *name,bool value); - - LuaCEmbedTable * (*get_table)(LuaCEmbed *self, const char *name); - LuaCEmbedTable * (*new_table)(LuaCEmbed *self, const char *name); - - -}LuaCEmbedGlobalModule; - -LuaCEmbedGlobalModule newLuaCEmbedGlobalModule(); \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/response/response.c b/build/c/dependencies/CTextEngine/luaCEmbed/namespace/response/response.c deleted file mode 100644 index 0e58669..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/response/response.c +++ /dev/null @@ -1,17 +0,0 @@ - - -LuaCEmbedResponseModule newLuaCEmbedResponseModule(){ - LuaCEmbedResponseModule self = {0}; - self.send_multi_return = LuaCEmbed_send_multi_return; - self.send_str = LuaCEmbed_send_str; - self.send_str_reference = LuaCEmbed_send_str_reference; - self.send_raw_string = LuaCEmbed_send_raw_string; - self.send_raw_string_reference = LuaCEmbed_send_raw_string_reference; - self.send_bool = LuaCEmbed_send_bool; - self.send_double = LuaCEmbed_send_double; - self.send_evaluation_function = LuaCEmbed_send_evaluation; - self.send_long = LuaCEmbed_send_long; - self.send_table = LuaCEmbed_send_table; - self.send_error = LuaCEmbed_send_error; - return self; -} diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/response/response.h b/build/c/dependencies/CTextEngine/luaCEmbed/namespace/response/response.h deleted file mode 100644 index 52edc41..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/response/response.h +++ /dev/null @@ -1,18 +0,0 @@ - - -typedef struct { - LuaCEmbedResponse * (*send_multi_return)(LuaCEmbedTable *table); - LuaCEmbedResponse * (*send_str)(const char *text); - LuaCEmbedResponse * (*send_raw_string)(const char *text,long size); - LuaCEmbedResponse * (*send_str_reference)( const char *text); - LuaCEmbedResponse * (*send_raw_string_reference)(const char *text,long size); - LuaCEmbedResponse * (*send_table)(LuaCEmbedTable *table); - LuaCEmbedResponse * (*send_evaluation_function)(const char *function); - LuaCEmbedResponse * (*send_double)(double value); - LuaCEmbedResponse * (*send_bool)(bool value); - LuaCEmbedResponse * (*send_long)(long value); - LuaCEmbedResponse * (*send_error)(const char *format,...); - -}LuaCEmbedResponseModule; - -LuaCEmbedResponseModule newLuaCEmbedResponseModule(); \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/table/table.c b/build/c/dependencies/CTextEngine/luaCEmbed/namespace/table/table.c deleted file mode 100644 index f06b17d..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/table/table.c +++ /dev/null @@ -1,58 +0,0 @@ - - -LuaCembedTableModule newLuaCembedTableModule(){ - LuaCembedTableModule self ={0}; - - self.append_string = LuaCEmbedTable_append_string; - self.append_bool = LuaCEmbedTable_append_bool; - self.append_double = LuaCEmbedTable_append_double; - self.append_long = LuaCEmbedTable_append_long; - self.append_table = LuaCEmbedTable_append_table; - self.append_evaluation = LuaCEmbedTable_append_evaluation; - - self.insert_string_at_index = LuaCEmbedTable_insert_string_at_index; - self.insert_double_at_index = LuaCEmbedTable_insert_double_at_index; - self.insert_long_at_index = LuaCEmbedTable_insert_long_at_index; - self.insert_table_at_index = LuaCEmbedTable_insert_table_at_index; - - self.set_evaluation_prop = LuaCEmbedTable_set_evaluation_prop; - self.set_method = LuaCEmbedTable_set_method; - self.set_method = LuaCEmbedTable_set_method; - self.set_bool_prop = LuaCEmbedTable_set_bool_prop; - self.set_double_prop = LuaCEmbedTable_set_double_prop; - self.set_long_prop = LuaCEmbedTable_set_long_prop; - self.set_string_prop = LuaCEmbedTable_set_string_prop; - - self.get_sub_table_prop = LuaCEmbedTable_get_sub_table_by_key; - self.new_sub_table_prop = LuaCEmbedTable_new_sub_table_by_key; - self.set_sub_table_prop = LuaCEmbedTable_set_sub_table_prop; - self.new_anonymous_table = LuaCembed_new_anonymous_table; - - self.set_sub_table_by_index = LuaCEmbedTable_set_sub_table_by_index; - self.get_bool_prop = LuaCembedTable_get_bool_prop; - self.get_double_prop = LuaCembedTable_get_double_prop; - self.get_long_prop = LuaCembedTable_get_long_prop; - self.get_string_prop = LuaCembedTable_get_string_prop; - self.get_type_prop = LuaCEmbedTable_get_type_prop; - self.destroy_prop = LuaCembedTable_destroy_prop; - - self.set_long_by_index = LuaCEmbedTable_set_long_by_index; - self.set_bool_by_index= LuaCEmbedTable_set_bool_by_index; - self.set_double_by_index =LuaCEmbedTable_set_double_by_index; - self.set_string_by_index = LuaCEmbedTable_set_string_by_index; - self.set_evaluation_by_index = LuaCEmbedTable_set_evaluation_by_index; - - self.get_listable_size = LuaCEmbedTable_get_listable_size; - - self.new_sub_table_appending = LuaCEmbedTable_new_sub_table_appending; - self.has_key = LuaCembedTable_has_key_at_index; - self.get_key_by_index = LuaCembedTable_get_key_by_index; - self.get_size = LuaCEmbedTable_get_full_size; - self.get_type_by_index = LuaCEmbedTable_get_type_by_index; - self.get_long_by_index = LuaCEmbedTable_get_long_by_index; - self.get_double_by_index = LuaCEmbedTable_get_double_by_index; - self.get_bool_by_index = LuaCEmbedTable_get_bool_by_index; - self.get_string_by_index= LuaCEmbedTable_get_string_by_index; - self.get_sub_table_by_index = LuaCEmbedTable_get_sub_table_by_index; - return self; -} diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/table/table.h b/build/c/dependencies/CTextEngine/luaCEmbed/namespace/table/table.h deleted file mode 100644 index 5fbbf9f..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/table/table.h +++ /dev/null @@ -1,59 +0,0 @@ - -typedef struct { - - void (*append_string)(LuaCEmbedTable *self, const char *value); - void (*append_long)(LuaCEmbedTable *self, long long value); - void (*append_double)(LuaCEmbedTable *self, double value); - void (*append_bool)(LuaCEmbedTable *self, bool value); - void (*append_table)(LuaCEmbedTable *self, LuaCEmbedTable *table); - void (*set_evaluation_prop)(LuaCEmbedTable *self, const char *name, const char *code, ...); - void (*append_evaluation)(LuaCEmbedTable *self, const char *code, ...); - - void (*insert_string_at_index)(LuaCEmbedTable *self, long index, const char *value); - void (*insert_bool_at_index)(LuaCEmbedTable *self, long index,bool value); - void (*insert_long_at_index)(LuaCEmbedTable *self, long long index,long value); - void (*insert_double_at_index)(LuaCEmbedTable *self, long index,double value); - void (*insert_table_at_index)(LuaCEmbedTable *self, long index,LuaCEmbedTable *table); - - - - void (*set_sub_table_by_index)(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table); - void (*set_string_by_index)(LuaCEmbedTable *self, long index, const char *value); - void (*set_long_by_index)(LuaCEmbedTable *self, long long index, long value); - void (*set_double_by_index)(LuaCEmbedTable *self, long index, double value); - void (*set_bool_by_index)(LuaCEmbedTable *self, long index, bool value); - void (*set_evaluation_by_index)(LuaCEmbedTable *self, long index, const char *code, ...); - long (*get_listable_size)(LuaCEmbedTable *self); - LuaCEmbedTable *(*get_sub_table_by_index)(LuaCEmbedTable *self, long index); - - LuaCEmbedTable *(*new_sub_table_appending)(LuaCEmbedTable *self); - - void (*set_method)(LuaCEmbedTable *self , const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)); - void (*set_string_prop)(LuaCEmbedTable *self , const char *name, const char *value); - void (*set_long_prop)(LuaCEmbedTable *self , const char *name, long long value); - void (*set_double_prop)(LuaCEmbedTable *self , const char *name, double value); - void (*set_bool_prop)(LuaCEmbedTable *self , const char *name, bool value); - int (*get_type_prop)(LuaCEmbedTable *self, const char *name); - char* (*get_string_prop)(LuaCEmbedTable *self , const char *name); - long long (*get_long_prop)(LuaCEmbedTable *self , const char *name); - double (*get_double_prop)(LuaCEmbedTable *self , const char *name); - bool (*get_bool_prop)(LuaCEmbedTable *self , const char *name); - LuaCEmbedTable * (*new_anonymous_table)(LuaCEmbed *self); - void (*destroy_prop)(LuaCEmbedTable *self, const char *name); - - LuaCEmbedTable *(*get_sub_table_prop)(LuaCEmbedTable *self, const char *name); - LuaCEmbedTable *(*new_sub_table_prop)(LuaCEmbedTable *self, const char *name); - void (*set_sub_table_prop)(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table); - char *(*get_key_by_index)(LuaCEmbedTable *self, long index); - bool (*has_key)(LuaCEmbedTable *self,long index); - - long (*get_size)(LuaCEmbedTable *self); - int (*get_type_by_index)(LuaCEmbedTable *self, int index); - long long (*get_long_by_index)(LuaCEmbedTable *self, int index); - double (*get_double_by_index)(LuaCEmbedTable *self, int index); - char * (*get_string_by_index)(LuaCEmbedTable *self, int index); - bool (*get_bool_by_index)(LuaCEmbedTable *self, int index); - -}LuaCembedTableModule; - -LuaCembedTableModule newLuaCembedTableModule(); diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/types/types.c b/build/c/dependencies/CTextEngine/luaCEmbed/namespace/types/types.c deleted file mode 100644 index 34cd409..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/types/types.c +++ /dev/null @@ -1,12 +0,0 @@ - -LuaCEmbedTypeModule newLuaCEmbedTypeModule(){ - LuaCEmbedTypeModule self = {0}; - self.NOT_FOUND = LUA_CEMBED_NOT_FOUND; - self.STRING = LUA_CEMBED_STRING; - self.NUMBER = LUA_CEMBED_NUMBER; - self.BOOL = LUA_CEMBED_BOOL; - self.NILL = LUA_CEMBED_NIL; - self.TABLE = LUA_CEMBED_TABLE; - self.FUNCTION = LUA_CEMBED_FUNCTION; - return self; -} \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/types/types.h b/build/c/dependencies/CTextEngine/luaCEmbed/namespace/types/types.h deleted file mode 100644 index fe1475b..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/namespace/types/types.h +++ /dev/null @@ -1,15 +0,0 @@ - - -typedef struct { - int NOT_FOUND; - int STRING; - int NUMBER; - int BOOL; - int NILL; - int TABLE; - int FUNCTION; - - -}LuaCEmbedTypeModule; - -LuaCEmbedTypeModule newLuaCEmbedTypeModule(); \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/luaCEmbed/one.c b/build/c/dependencies/CTextEngine/luaCEmbed/one.c deleted file mode 100644 index 1c342f7..0000000 --- a/build/c/dependencies/CTextEngine/luaCEmbed/one.c +++ /dev/null @@ -1,9 +0,0 @@ - - -#ifndef LUACEMBED_H - -#include "declaration.h" -#include "definition.h" - -#define LUACEMBED_H -#endif \ No newline at end of file diff --git a/build/c/dependencies/CTextEngine/macros.h b/build/c/dependencies/CTextEngine/macros.h deleted file mode 100644 index e6a753f..0000000 --- a/build/c/dependencies/CTextEngine/macros.h +++ /dev/null @@ -1,8 +0,0 @@ - -#define CTextScope(s,t)\ -ctext_open(s, t);\ -for(int snaunduwwqwetjsdvda = 0; snaunduwwqwetjsdvda < 1; ctext_close(s, t), ++snaunduwwqwetjsdvda) - -#define CText$Scope(s,t, ...)\ -CTextStack_$open(s,t,__VA_ARGS__);\ -for(int snaunduwwqwetjsdvda = 0; snaunduwwqwetjsdvda < 1; ctext_close(s, t), ++snaunduwwqwetjsdvda) diff --git a/build/c/dependencies/CTextEngine/tags.h b/build/c/dependencies/CTextEngine/tags.h deleted file mode 100644 index 9653974..0000000 --- a/build/c/dependencies/CTextEngine/tags.h +++ /dev/null @@ -1,66 +0,0 @@ -// -// Created by jurandi on 18-04-2023. -// -#define CTEXT_HTML "html" -#define CTEXT_BODY "body" -#define CTEXT_DIV "div" -#define CTEXT_H1 "h1" -#define CTEXT_H2 "h2" -#define CTEXT_H3 "h3" -#define CTEXT_H4 "h4" -#define CTEXT_H5 "h5" -#define CTEXT_H6 "h6" -#define CTEXT_P "p" -#define CTEXT_SPAN "span" -#define CTEXT_A "a" -#define CTEXT_IMG "img" -#define CTEXT_INPUT "input" -#define CTEXT_BUTTON "button" -#define CTEXT_TABLE "table" -#define CTEXT_TR "tr" -#define CTEXT_TD "td" -#define TH "th" -#define CTEXT_THEAD "thead" -#define CTEXT_TBODY "tbody" -#define CTEXT_TFOOT "tfoot" -#define CTEXT_UL "ul" -#define CTEXT_LI "li" -#define CTEXT_OL "ol" -#define CTEXT_FORM "form" -#define CTEXT_LABEL "label" -#define CTEXT_SELECT "select" -#define CTEXT_OPTION "option" -#define CTEXT_TEXTAREA "textarea" -#define CTEXT_SCRIPT "script" -#define CTEXT_STYLE "style" -#define CTEXT_META "meta" -#define CTEXT_LINK "link" -#define CTEXT_HEAD "head" -#define CTEXT_BASE "base" -#define CTEXT_BR "br" -#define CTEXT_HR "hr" -#define CTEXT_TITLE "title" -#define CTEXT_IFRAME "iframe" -#define CTEXT_NAV "nav" -#define CTEXT_HEADER "header" -#define CTEXT_FOOTER "footer" -#define CTEXT_SECTION "section" -#define CTEXT_ARTICLE "article" -#define CTEXT_ASIDE "aside" -#define CTEXT_DETAILS "details" -#define CTEXT_SUMMARY "summary" -#define CTEXT_DIALOG "dialog" -#define MENU "menu" -#define MENUITEM "menuitem" -#define CTEXT_MAIN "main" -#define CTEXT_CANVAS "canvas" -#define CTEXT_AUDIO "audio" -#define CTEXT_VIDEO "video" -#define CTEXT_SOURCE "source" -#define CTEXT_TRACK "track" -#define CTEXT_EMBED "embed" -#define CTEXT_PARAM "param" - - - - diff --git a/build/c/dependencies/all.h b/build/c/dependencies/all.h deleted file mode 100644 index 08f1f07..0000000 --- a/build/c/dependencies/all.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "luaCEmbed/one.c" -#include "luaDoTheWorld/one.c" -#include "CTextEngine/CTextEngineMain.h" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/LuaCEmbed.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/LuaCEmbed.h deleted file mode 100644 index 6c5e92e..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/LuaCEmbed.h +++ /dev/null @@ -1,19 +0,0 @@ - -typedef struct LuaCEmbed{ - lua_State *state; - const char *current_function; - bool is_lib; - int total_args; - char *error_msg; - void (*delete_function)(struct LuaCEmbed *self); - void *global_tables; - void *func_tables; - int lib_identifier; - int stack_leve; - char *main_lib_table; - bool field_protection; -}LuaCEmbed; - -int lua_cembed_timeout = -1; -LuaCEmbed *global_current_lua_embed_object; - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/args/args_error/args_error.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/args/args_error/args_error.c deleted file mode 100644 index 982d1cd..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/args/args_error/args_error.c +++ /dev/null @@ -1,33 +0,0 @@ - - -int LuaCEmbed_ensure_arg_exist(LuaCEmbed *self, private_lua_cembed_incremented_arg index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(index > self->total_args){ - - privateLuaCEmbed_raise_error_not_jumping(self, PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,index,self->current_function); - return LUA_CEMBED_GENERIC_ERROR; - } - return LUA_CEMBED_OK; - -} - -int private_LuaCEmbed_ensure_top_stack_arg_type(LuaCEmbed *self, int index,int arg_type) { - PRIVATE_LUA_CEMBED_PROTECT_NUM - int type = lua_type(self->state, -1); - if (type != arg_type) { - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_ARG_WRONG_TYPE, - index + LUA_CEMBED_INDEX_DIF, - self->current_function, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(arg_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - - return LUA_CEMBED_OK; - -} - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/args/args_error/args_error.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/args/args_error/args_error.h deleted file mode 100644 index 7300a8e..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/args/args_error/args_error.h +++ /dev/null @@ -1,5 +0,0 @@ - - -int LuaCEmbed_ensure_arg_exist(LuaCEmbed *self, private_lua_cembed_incremented_arg index); - -int private_LuaCEmbed_ensure_top_stack_arg_type(LuaCEmbed *self, int index,int arg_type); diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/args/basic/basic.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/args/basic/basic.c deleted file mode 100644 index aa07bad..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/args/basic/basic.c +++ /dev/null @@ -1,206 +0,0 @@ - -int privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(formatted_index > self->total_args){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,formatted_index,self->current_function); - return LUA_CEMBED_GENERIC_ERROR; - } - - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - lua_getglobal(self->state,formated_arg); - int type = lua_type(self->state,-1); - if(type == LUA_CEMBED_NOT_FOUND || type == LUA_CEMBED_NIL){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,formatted_index,self->current_function); - free(formated_arg); - return LUA_CEMBED_GENERIC_ERROR; - } - - free(formated_arg); - return LUA_OK; -} - -int LuaCEmbed_get_total_args(LuaCEmbed *self){ - return self->total_args; -} - - - -int LuaCEmbed_get_arg_type(LuaCEmbed *self,int index){ - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(formatted_index > self->total_args){ - return LUA_CEMBED_NIL; - } - - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - lua_getglobal(self->state,formated_arg); - int type = lua_type(self->state, -1); - free(formated_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return type; -} - - -long long LuaCEmbed_get_long_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_NUMBER)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - - long long result = (long long)lua_tonumber(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - - -double LuaCEmbed_get_double_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_NUMBER)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - double result = lua_tonumber(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - -bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_BOOL)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - bool result = lua_toboolean(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - - -char * LuaCEmbed_get_str_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - PRIVATE_LUA_CEMBED_CLEAR_STACK - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_STRING)){ - return NULL; - } - char *result = (char*)lua_tostring(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} -char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,long *size, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - PRIVATE_LUA_CEMBED_CLEAR_STACK - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_STRING)){ - return NULL; - } - char *result = (char*)lua_tolstring(self->state,-1,(size_t*)size); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - -LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_TABLE)){ - return NULL; - } - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - LuaCEmbedTable *created = LuaCembed_get_global_table(self,formated_arg); - free(formated_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return created; - -} - -LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call, int total_returns){ - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - char *formatted_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - free(formatted_arg); - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_FUNCTION)){ - free(formatted_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - int total_args = private_lua_cEmbed_unpack(args_to_call,formatted_arg); - if(lua_pcall(self->state,total_args,total_returns,0)){ - - privateLuaCEmbed_raise_error_not_jumping(self, lua_tostring(self->state,-1)); - free(formatted_arg); - - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - - for(int i = 0; i < total_returns; i++){ - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - int position = (i +1) * -1; - lua_pushvalue(self->state,position); - lua_setglobal(self->state,formatted); - free(formatted); - } - - - - LuaCEmbedTable *result = LuaCembed_new_anonymous_table(self); - for(int i = 0; i < total_returns; i++){ - lua_getglobal(self->state,result->global_name); - lua_pushinteger(self->state,i+1); - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - lua_getglobal(self->state,formatted); - lua_settable(self->state,-3); - free(formatted); - } - free(formatted_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; - -} - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/args/basic/basic.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/args/basic/basic.h deleted file mode 100644 index 6263703..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/args/basic/basic.h +++ /dev/null @@ -1,23 +0,0 @@ - -int privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, int index); - -int LuaCEmbed_get_total_args(LuaCEmbed *self); - -int LuaCEmbed_get_arg_type(LuaCEmbed *self,int index); - - - -long long LuaCEmbed_get_long_arg(LuaCEmbed *self, int index); - -double LuaCEmbed_get_double_arg(LuaCEmbed *self, int index); - -bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, int index); - -char * LuaCEmbed_get_str_arg(LuaCEmbed *self, int index); - -char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,long *size, int index); - -LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,int index); - -LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call, int total_returns); - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/args/declaration.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/args/declaration.h deleted file mode 100644 index d99c5c3..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/args/declaration.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "args_error/args_error.h" -#include "basic/basic.h" -#include "evaluation/evaluation.h" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/args/definition.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/args/definition.h deleted file mode 100644 index ecfe1d9..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/args/definition.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "args_error/args_error.c" -#include "basic/basic.c" -#include "evaluation/evaluation.c" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/args/evaluation/evaluation.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/args/evaluation/evaluation.c deleted file mode 100644 index 3524958..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/args/evaluation/evaluation.c +++ /dev/null @@ -1,155 +0,0 @@ - - -int private_LuaCembed_run_code_with_args(LuaCEmbed *self,int index,const char *code,va_list args){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(LuaCEmbed_ensure_arg_exist(self,formatted_index)){ - return LUA_CEMBED_GENERIC_ERROR; - } - - char *formated_expresion = private_LuaCembed_format_vaarg(code,args); - - char *buffer = private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - formated_expresion - ); - - if(LuaCEmbed_evaluate(self, buffer)){ - free(formated_expresion); - free(buffer); - return LUA_CEMBED_GENERIC_ERROR; - } - free(buffer); - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - - int type = lua_type(self->state,-1); - - if(type != LUA_CEMBED_FUNCTION){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_CODE_ITS_NOT_A_FUNCTION,formated_expresion); - free(formated_expresion); - return LUA_CEMBED_GENERIC_ERROR; - } - - free(formated_expresion); - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - privateLuaCEmbed_put_arg_on_top(self,index); - - if(lua_pcall(self->state,1,1,0)){ - const char *generated_error = lua_tostring(self->state,-1); - privateLuaCEmbed_raise_error_not_jumping(self, generated_error); - } - return LUA_CEMBED_OK; -} - -int privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,int index,int expected_type){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - int actual_type = lua_type(self->state,-1); - if(actual_type== expected_type){ - return LUA_CEMBED_OK; - } - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_RESULT_EVALUATION_ARG_WRONG_TYPE, - self->current_function, - index, - LuaCembed_convert_arg_code(actual_type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} -int LuaCEmbed_get_type_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - return lua_type(self->state,-1); -} -int LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - return LUA_CEMBED_OK; -} -long long LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (long long) lua_tonumber(self->state,-1); - -} - - -double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (double ) lua_tonumber(self->state,-1); - -} - -bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return false; - } - return lua_toboolean(self->state,-1); - -} - -char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return NULL; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); - -} - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/args/evaluation/evaluation.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/args/evaluation/evaluation.h deleted file mode 100644 index da15cac..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/args/evaluation/evaluation.h +++ /dev/null @@ -1,19 +0,0 @@ - - -int private_LuaCembed_run_code_with_args(LuaCEmbed *self,int index,const char *code,va_list args); - -int privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,int index,int expected_type); - -int LuaCEmbed_get_type_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -int LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -long long LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - - -double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/basic/basic.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/basic/basic.c deleted file mode 100644 index 1100fc3..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/basic/basic.c +++ /dev/null @@ -1,136 +0,0 @@ - - -LuaCEmbed * newLuaCEmbedEvaluation(){ - LuaCEmbed *self = (LuaCEmbed*) malloc(sizeof (LuaCEmbed)); - *self = (LuaCEmbed){0}; - self->state = luaL_newstate(); - - self->global_tables = (void*)newprivateLuaCEmbedTableArray(); - - return self; -} -void LuaCEmbed_load_lib_from_c(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name){ - int result = callback(self->state); - if(result > 0){ - lua_setglobal(self->state,name); - } -} - - - - - -void LuaCembed_set_delete_function(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)){ - self->delete_function = delelte_function; -} - - - - -void LuaCEmbed_set_timeout(int seconds){ - lua_cembed_timeout = seconds; -} - -char * LuaCEmbed_get_error_message(LuaCEmbed *self){ - if(!self){ - return NULL; - } - - return self->error_msg; -} -void LuaCEmbed_clear_errors(LuaCEmbed *self){ - if(!self){ - return; - } - - if(self->error_msg){ - free(self->error_msg); - self->error_msg = NULL; - } -} -void * privateLuaCEmbed_get_current_table_array(LuaCEmbed *self){ - if(self->current_function){ - return self->func_tables; - } - return self->global_tables; -} -void privateLuaCEmbed_raise_error_not_jumping(LuaCEmbed *self, const char *error_msg, ...){ - - if(LuaCEmbed_has_errors(self)){ - return; - } - - va_list args; - va_start(args,error_msg); - self->error_msg = private_LuaCembed_format_vaarg(error_msg, args); - va_end(args); - -} - - - -bool LuaCEmbed_has_errors(LuaCEmbed *self){ - if(!self){ - return true; - } - - if(self->error_msg){ - return true; - } - - return false; -} - - - - - - -void privata_LuaCEmbed_increment_stack_(LuaCEmbed *self){ - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - int value = 0; - if(lua_type(self->state,-1) == LUA_CEMBED_NUMBER){ - value = lua_tonumber(self->state,-1); - } - int new_value = value+1; - lua_pushinteger(self->state,new_value); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve =new_value; -} - - -void privata_LuaCEmbed_decrement_stack(LuaCEmbed *self){ - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - int value = 0; - if(lua_type(self->state,-1) == LUA_CEMBED_NUMBER){ - value = lua_tointeger(self->state,-1); - } - if(value> 0){ - int new_value = value -1; - lua_pushinteger(self->state,new_value); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve = new_value; - } - -} - -void privateLuaCEmbd_get_field_protected(LuaCEmbed *self,const char *name){ - bool old_field_proection = self->field_protection; - self->field_protection = true; - lua_getfield(self->state,-1,name); - self->field_protection = old_field_proection; -} - -void LuaCEmbed_free(LuaCEmbed *self){ - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->global_tables); - if(!self->is_lib){ //se for do próprio lua, o lua cuidará de limpar - lua_close(self->state); // Fecha o estado Lua - } - if(self->error_msg){ - free(self->error_msg); - } - if(self->main_lib_table){ - free(self->main_lib_table); - } - free(self); -} diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/basic/basic.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/basic/basic.h deleted file mode 100644 index b7ea79d..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/basic/basic.h +++ /dev/null @@ -1,38 +0,0 @@ - - - -LuaCEmbed * newLuaCEmbedEvaluation(); - - -int private_LuaCemb_internal_free(lua_State *L); - -void LuaCEmbed_load_lib_from_c(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name); - -void LuaCembed_set_delete_function(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)); - -char * LuaCEmbed_get_error_message(LuaCEmbed *self); - - -bool LuaCEmbed_has_errors(LuaCEmbed *self); - -void LuaCEmbed_clear_errors(LuaCEmbed *self); - -void privateLuaCEmbd_get_field_protected(LuaCEmbed *self,const char *name); - -void privateLuaCEmbed_raise_error_not_jumping(LuaCEmbed *self, const char *error, ...); - -void * privateLuaCEmbed_get_current_table_array(LuaCEmbed *self); - - -void LuaCEmbed_set_timeout(int seconds); - - - -void privata_LuaCEmbed_increment_stack_(LuaCEmbed *self); - - -void privata_LuaCEmbed_decrement_stack(LuaCEmbed *self); - -void LuaCEmbed_free(LuaCEmbed *self); - - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/callback_handle/callback_handle.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/callback_handle/callback_handle.c deleted file mode 100644 index 3d30475..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/callback_handle/callback_handle.c +++ /dev/null @@ -1,231 +0,0 @@ - - -int privateLuaCEmbed_main_callback_handler(lua_State *L){ - - bool is_a_method = lua_toboolean(L, lua_upvalueindex(1)); - bool is_a_function = !is_a_method; - LuaCEmbedResponse *possible_return = NULL; - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(L,lua_upvalueindex(2)); - int old_total_args = self->total_args; - self->total_args = lua_gettop(self->state); - privata_LuaCEmbed_increment_stack_(self); - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve = (int)lua_tonumber(self->state,-1); - - for(int i = 0; i < self->total_args; i++){ - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,i); - lua_pushvalue(L,i+1); - lua_setglobal(L,formated_arg); - free(formated_arg); - } - - const char *func_name = lua_tostring(L,lua_upvalueindex(3)); - self->current_function = func_name; - void *old_funct_tables = self->func_tables; - self->func_tables = (void*)newprivateLuaCEmbedTableArray(); - if(is_a_method){ - LuaCEmbedResponse *(*method_callback)(LuaCEmbedTable *tb, LuaCEmbed *self); - - //equivalent of PRIVATE_LUA_CEMBED_SELFNAME = index[4] - lua_pushvalue(L, lua_upvalueindex(4)); - lua_setglobal(L,PRIVATE_LUA_CEMBED_SELFNAME); - - LuaCEmbedTable *table = private_newLuaCembedTable(self, PRIVATE_LUA_CEMBED_SELFNAME); - method_callback = (LuaCEmbedResponse *(*)(LuaCEmbedTable *tb, LuaCEmbed *self))lua_touserdata(L, lua_upvalueindex(5)); - possible_return = method_callback(table,self); - privateLuaCEmbedTable_free(table); - } - - if(is_a_function){ - LuaCEmbedResponse *(*function_callback)(LuaCEmbed *self); - function_callback = (LuaCEmbedResponse *(*)(LuaCEmbed *self))lua_touserdata(L, lua_upvalueindex(4)); - possible_return = function_callback(self); - } - - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->func_tables); - self->func_tables = old_funct_tables; - self->total_args = old_total_args; - privata_LuaCEmbed_decrement_stack(self); - PRIVATE_LUA_CEMBED_CLEAR_STACK - self->current_function = NULL; - - if(possible_return==NULL){ - return PRIVATE_LUACEMBED_NO_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_ERROR_RESPONSE){ - - if(self->field_protection){ - private_LuaCEmbedResponse_free(possible_return); - if(self->error_msg){ - free(self->error_msg); - self->error_msg = NULL; - } - - return PRIVATE_LUACEMBED_NO_RETURN; - } - - lua_pushstring(L, possible_return->string_val); - privateLuaCEmbed_raise_error_not_jumping(self,possible_return->string_val); - private_LuaCEmbedResponse_free(possible_return); - lua_error(L); - return PRIVATE_LUACEMBED_NO_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_LONG_RESPONSE){ - lua_pushinteger(L, (int)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_BOOL_RESPONSE){ - lua_pushboolean(L, (bool)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE){ - lua_pushnumber(L, possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_STRING_RESPONSE){ - lua_pushlstring(self->state,possible_return->string_val,possible_return->string_size); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE){ - lua_pushboolean(L, (bool)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_TABLE_RESPONSE){ - lua_getglobal(self->state, PRIVATE_LUA_CEMBED_TABLE_RETURN); - lua_pushvalue(self->state,-1); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_MULTI_RESPONSE){ - LuaCEmbedTable *table = private_newLuaCembedTable(self, PRIVATE_LUA_CEMBED_TABLE_RETURN); - int size =private_lua_cEmbed_unpack(table,NULL); - private_LuaCEmbedResponse_free(possible_return); - privateLuaCEmbedTable_free(table); - - return size; - } - - - if(possible_return->type == PRIVATE_LUA_CEMBED_EVALUATION){ - char *formated_function =private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - possible_return->string_val - ); - - int error_code = LuaCEmbed_evaluate(self, formated_function); - free(formated_function); - - if(error_code){ - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - } - - lua_getglobal(self->state, PRIVATE_LUA_CEMBED_EVALUATION_NAME); - int v_type = lua_type(self->state,-1); - if(v_type == LUA_CEMBED_FUNCTION){ - const int TOTAL_ARGS =0; - const int TOTAL_RETURNS =1; - if(lua_pcall(self->state,TOTAL_ARGS,TOTAL_RETURNS,0)){ - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - } - } - - lua_pushvalue(self->state,-1); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - - } - - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - -} - - -void private_LuaCEmbed_add_lib_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args),bool global_functions ){ - - char *main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - //get the table - lua_getglobal(self->state,main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,callback_name); - - //creating the clojure - - //creating the clojure - lua_pushboolean(self->state,false);//is a method - lua_pushlightuserdata(self->state,(void*)self); //self - lua_pushstring(self->state,callback_name);//calback name - lua_pushlightuserdata(self->state,(void*)callback);//calback - - lua_pushcclosure(self->state,privateLuaCEmbed_main_callback_handler,4); - - - lua_settable(self->state,-3); - if(global_functions){ - //it points the function to a global function - //like: callback = private_lua_c_embed_main_lib_table.callback - lua_getglobal(self->state, main_lib_table); - lua_getfield(self->state,-1,callback_name); - lua_setglobal(self->state, callback_name); - } - - lua_settop(self->state, 0); - free(main_lib_table); - -} - -void private_LuaCEmbed_add_evaluation_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - //creating the clojure - lua_pushboolean(self->state,false);//is a method - lua_pushlightuserdata(self->state,(void*)self); //self - lua_pushstring(self->state,callback_name);//calback name - lua_pushlightuserdata(self->state,(void*)callback);//calback - - lua_pushcclosure(self->state,privateLuaCEmbed_main_callback_handler,4); - lua_setglobal(self->state, callback_name); - lua_settop(self->state, 0); - -} - - -void LuaCEmbed_add_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - if(self->is_lib){ - private_LuaCEmbed_add_lib_callback(self,callback_name,callback,false); - return; - } - private_LuaCEmbed_add_evaluation_callback(self,callback_name,callback); - -} - -void LuaCEmbed_add_global_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args)){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - if(self->is_lib){ - private_LuaCEmbed_add_lib_callback(self,callback_name,callback,true); - return; - } - private_LuaCEmbed_add_evaluation_callback(self,callback_name,callback); -} \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/callback_handle/callback_handle.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/callback_handle/callback_handle.h deleted file mode 100644 index 20c5c8e..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/callback_handle/callback_handle.h +++ /dev/null @@ -1,13 +0,0 @@ - - -int privateLuaCEmbed_main_callback_handler(lua_State *L); - -void private_LuaCEmbed_add_lib_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args),bool global_functions ); - -void private_LuaCEmbed_add_evaluation_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - -void LuaCEmbed_add_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - - -void LuaCEmbed_add_global_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args)); - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/declaration.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/declaration.h deleted file mode 100644 index 8188bd9..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/declaration.h +++ /dev/null @@ -1,13 +0,0 @@ -typedef long private_lua_cembed_incremented_arg ; -#include "LuaCEmbed.h" -#include "memory/memory.h" - -#include "lib_start/lib_start.h" -#include "basic/basic.h" -#include "table/declaration.h" -#include "args/declaration.h" -#include "globals/declaration.h" -#include "callback_handle/callback_handle.h" -#include "evaluation/evaluation.h" -#include "protection_macros.h" -#include "lib_props/lib_props.h" diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/definition.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/definition.h deleted file mode 100644 index 7f45e5a..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/definition.h +++ /dev/null @@ -1,9 +0,0 @@ -#include "memory/memory.c" -#include "lib_start/lib_start.c" -#include "basic/basic.c" -#include "args/definition.h" -#include "table/definition.h" -#include "globals/definition.h" -#include "callback_handle/callback_handle.c" -#include "evaluation/evaluation.c" -#include "lib_props/lib_props.c" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/evaluation/evaluation.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/evaluation/evaluation.c deleted file mode 100644 index 29b3ee9..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/evaluation/evaluation.c +++ /dev/null @@ -1,247 +0,0 @@ - - -#ifdef _WIN32 -VOID CALLBACK TimerHandler(HWND hwnd, UINT uMsg, UINT_PTR idEvent, DWORD dwTime) { - - privateLuaCEmbed_raise_error_not_jumping(global_current_lua_embed_object, PRIVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_pushstring(global_current_lua_embed_object->state,PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_error(global_current_lua_embed_object->state); -} - -#else - -void private_LuaCembed_handle_timeout(int signum) { - - privateLuaCEmbed_raise_error_not_jumping(global_current_lua_embed_object, PRIVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_pushstring(global_current_lua_embed_object->state,PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_error(global_current_lua_embed_object->state); -} - -#endif - - - -int privateLuaCEmbed_start_func_evaluation(lua_State *state){ - - int evaluation_type = lua_tointeger(state, lua_upvalueindex(1)); - char *text_value = (char*)lua_touserdata(state,lua_upvalueindex(2)); - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(state,lua_upvalueindex(3)); - global_current_lua_embed_object = self; - #ifdef _WIN32 - if (lua_cembed_timeout > 0) { - SetTimer(NULL, 0,lua_cembed_timeout > 0 * 1000, TimerHandler); - } - #else - if (lua_cembed_timeout > 0) { - signal(SIGALRM, private_LuaCembed_handle_timeout); - alarm(lua_cembed_timeout); - } - #endif - - int error = 0; - if(evaluation_type == PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE){ - error =luaL_dofile(self->state,text_value); - } - if(evaluation_type == PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE){ - error = luaL_dostring(self->state,text_value); - } - if(error){ - privateLuaCEmbed_raise_error_not_jumping(self,lua_tostring(self->state,-1)); - } - lua_pushinteger(self->state,error); - - return 1; - -} -int LuaCEmbed_evaluate(LuaCEmbed *self, const char *code, ...){ - - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - char * formated_expresion = private_LuaCembed_format_vaarg(code,args); - va_end(args); - lua_pushinteger(self->state,PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE); - lua_pushlightuserdata(self->state,(void*)formated_expresion); //code - lua_pushlightuserdata(self->state,(void*)self); //code - lua_pushcclosure(self->state,privateLuaCEmbed_start_func_evaluation,3); - lua_pcall(self->state,0,1,0); - int error = lua_tointeger(self->state,-1); - free(formated_expresion); - - return error; - -} - -int LuaCEmbed_evaluete_file(LuaCEmbed *self, const char *file){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - - lua_pushinteger(self->state,PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE); - lua_pushlightuserdata(self->state,(void*)file); //code - lua_pushlightuserdata(self->state,(void*)self); //code - lua_pushcclosure(self->state,privateLuaCEmbed_start_func_evaluation,3); - lua_pcall(self->state,0,1,0); - int error = lua_tointeger(self->state,-1); - return error; - -} - -int private_LuaCEmbed_evaluate_puting_on_top_of_stack(LuaCEmbed *self,const char *code, va_list args){ - - char * formated_expresion =private_LuaCembed_format_vaarg(code,args); - - char * buffer =private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - formated_expresion - ); - - if(LuaCEmbed_evaluate(self, buffer)){ - free(formated_expresion); - free(buffer); - return LUA_CEMBED_GENERIC_ERROR; - } - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - - int type = lua_type(self->state,-1); - - if(type == LUA_CEMBED_FUNCTION){ - if(lua_pcall(self->state,0,1,0)){ - const char *generated_error = lua_tostring(self->state,-1); - privateLuaCEmbed_raise_error_not_jumping(self, generated_error); - } - } - free(formated_expresion); - free(buffer); - return LUA_CEMBED_OK; - -} -int private_LuaCEmbed_ensure_evaluation_type(LuaCEmbed *self,int type){ - - int actual_type = lua_type(self->state,-1); - if(actual_type== type){ - return LUA_CEMBED_OK; - } - - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_RESULT_EVALUATION_WRONG_TYPE, - LuaCembed_convert_arg_code(actual_type), - LuaCembed_convert_arg_code(type) - ); - - return LUA_CEMBED_GENERIC_ERROR; -} - -char * LuaCEmbed_get_evaluation_string(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return NULL; - } - - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_STRING)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); - -} - - -int LuaCEmbed_get_evaluation_type(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - - return lua_type(self->state,-1); -} - - -long LuaCEmbed_get_evaluation_table_size(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_TABLE)){ - return LUA_CEMBED_GENERIC_ERROR; - } - /* - long size = 0; - lua_pushnil(self->state); // Coloca a chave nula na pilha - while (lua_next(self->state, -1) != 0) { // Enquanto houver elementos na tabela - size+=1; - lua_pop(self->state, 1); - } - */ - - return (long)lua_rawlen(self->state,-1); -} - - - -long long LuaCEmbed_get_evaluation_long(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (long)lua_tonumber(self->state,-1); - -} - -double LuaCEmbed_get_evaluation_double(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (double)lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_evaluation_bool(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (bool)lua_toboolean(self->state,-1); -} - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/evaluation/evaluation.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/evaluation/evaluation.h deleted file mode 100644 index fa7c95d..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/evaluation/evaluation.h +++ /dev/null @@ -1,36 +0,0 @@ - - -#ifdef _WIN32 -VOID CALLBACK TimerHandler(HWND hwnd, UINT uMsg, UINT_PTR idEvent, DWORD dwTime); -#else - -void private_LuaCembed_handle_timeout(int signum); - -#endif - -int privateLuaCEmbed_start_func_evaluation(lua_State *state); - -int LuaCEmbed_evaluate(LuaCEmbed *self, const char *code, ...); - -int LuaCEmbed_evaluete_file(LuaCEmbed *self, const char *file); - - -int private_LuaCEmbed_ensure_evaluation_type(LuaCEmbed *self,int type); - -int private_LuaCEmbed_evaluate_puting_on_top_of_stack(LuaCEmbed *self,const char *code, va_list args); - -char * LuaCEmbed_get_evaluation_string(LuaCEmbed *self,const char *code, ...); - - -int LuaCEmbed_get_evaluation_type(LuaCEmbed *self,const char *code, ...); - - -long LuaCEmbed_get_evaluation_table_size(LuaCEmbed *self,const char *code, ...); - -long long LuaCEmbed_get_evaluation_long(LuaCEmbed *self,const char *code, ...); - -double LuaCEmbed_get_evaluation_double(LuaCEmbed *self,const char *code, ...); - -bool LuaCEmbed_get_evaluation_bool(LuaCEmbed *self,const char *code, ...); - - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/declaration.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/declaration.h deleted file mode 100644 index c7e0d1f..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/declaration.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "errors/errors.h" -#include "getters/getters.h" -#include "setters/setters.h" diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/definition.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/definition.h deleted file mode 100644 index 8882f59..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/definition.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "errors/errors.c" -#include "getters/getters.c" -#include "setters/setters.c" diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/errors/errors.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/errors/errors.c deleted file mode 100644 index 17b897b..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/errors/errors.c +++ /dev/null @@ -1,23 +0,0 @@ - - - - -int LuaCEmbed_ensure_global_type(LuaCEmbed *self, const char *name,int expected_type){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - lua_getglobal(self->state,name); - int type = lua_type(self->state,-1); - - if(type != expected_type){ - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_GLOBAL_WRONG_TYPE, - name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - - return LUA_CEMBED_OK; - -} \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/errors/errors.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/errors/errors.h deleted file mode 100644 index 16ae62f..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/errors/errors.h +++ /dev/null @@ -1,4 +0,0 @@ - - - -int LuaCEmbed_ensure_global_type(LuaCEmbed *self, const char *name,int expected_type); diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/getters/getters.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/getters/getters.c deleted file mode 100644 index 12481b6..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/getters/getters.c +++ /dev/null @@ -1,156 +0,0 @@ - - -int LuaCEmbed_get_global_type(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - lua_getglobal(self->state, name); - return lua_type(self->state,-1); -} - -long long LuaCEmbed_get_global_long(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return (long )lua_tonumber(self->state,-1); -} - -double LuaCEmbed_get_global_double(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return (double )lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_global_bool(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return lua_toboolean(self->state,-1); -} - -char * LuaCEmbed_get_global_raw_string(LuaCEmbed *self,const char *name,long *size){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - lua_getglobal(self->state, name); - return (char*)lua_tolstring(self->state,-1,(size_t*)size); -} - -char * LuaCEmbed_get_global_string(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - lua_getglobal(self->state, name); - return (char*)lua_tostring(self->state,-1); -} - -LuaCEmbedTable * LuaCembed_new_anonymous_table(LuaCEmbed *self){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - - const char *format_raw = PRIVATE_LUA_CEMBED_ANONYMOUS_TABLE_; - if(self->current_function){ - format_raw =PRIVATE_LUA_CEMBED_ANONYMOUS_FUNC_TABLE_; - } - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - char *buffer= private_LuaCembed_format(format_raw, self->stack_leve, target->size); - LuaCEmbedTable *created_table =LuaCembed_new_global_table(self,buffer); - - free(buffer); - return created_table; -} - - - -LuaCEmbedTable * LuaCembed_get_global_table(LuaCEmbed *self, const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_TABLE)){ - return NULL; - } - - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,name); - if(possible){ - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s", name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} - -LuaCEmbedTable * LuaCembed_new_global_table(LuaCEmbed *self, const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - lua_newtable(self->state); - lua_setglobal(self->state,name); - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,name); - if(possible){ - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s", name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} - -LuaCEmbedTable* LuaCEmbed_run_global_lambda(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns){ - - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_FUNCTION)){ - return NULL; - } - - int total_args = private_lua_cEmbed_unpack(args_to_call,name); - if(lua_pcall(self->state,total_args,total_returns,0)){ - privateLuaCEmbed_raise_error_not_jumping(self, lua_tostring(self->state,-1)); - return NULL; - } - - for(int i = 0; i < total_returns; i++){ - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_, self->stack_leve, i); - int position = (i +1) * -1; - lua_pushvalue(self->state,position); - lua_setglobal(self->state,formatted); - free(formatted); - } - - LuaCEmbedTable *result = LuaCembed_new_anonymous_table(self); - for(int i = 0; i < total_returns; i++){ - lua_getglobal(self->state,result->global_name); - lua_pushinteger(self->state,i+1); - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - lua_getglobal(self->state,formatted); - lua_settable(self->state,-3); - free(formatted); - } - - return result; -} - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/getters/getters.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/getters/getters.h deleted file mode 100644 index c0e915c..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/getters/getters.h +++ /dev/null @@ -1,22 +0,0 @@ - - -int LuaCEmbed_get_global_type(LuaCEmbed *self,const char *name); - -long long LuaCEmbed_get_global_long(LuaCEmbed *self,const char *name); - -double LuaCEmbed_get_global_double(LuaCEmbed *self,const char *name); - -bool LuaCEmbed_get_global_bool(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_global_string(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_global_raw_string(LuaCEmbed *self,const char *name,long *size); - - -LuaCEmbedTable * LuaCembed_new_anonymous_table(LuaCEmbed *self); - -LuaCEmbedTable* LuaCEmbed_run_global_lambda(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns); - -LuaCEmbedTable * LuaCembed_get_global_table(LuaCEmbed *self, const char *name); - -LuaCEmbedTable * LuaCembed_new_global_table(LuaCEmbed *self, const char *name); diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/setters/setters.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/setters/setters.c deleted file mode 100644 index 48a1082..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/setters/setters.c +++ /dev/null @@ -1,43 +0,0 @@ - - -void LuaCEmbed_set_global_string(LuaCEmbed *self, const char *name, const char *value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushstring(self->state,value); - lua_setglobal(self->state,name); -} -void LuaCEmbed_set_global_raw_string(LuaCEmbed *self, const char *name, const char *value,long size){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushlstring(self->state,value,size); - lua_setglobal(self->state,name); -} - - -void LuaCEmbed_set_global_long(LuaCEmbed *self, const char *name, long long value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushnumber(self->state,(double )value); - lua_setglobal(self->state,name); -} - -void LuaCEmbed_set_global_double(LuaCEmbed *self, const char *name, double value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushnumber(self->state,(double )value); - lua_setglobal(self->state,name); -} - -void LuaCEmbed_set_global_bool(LuaCEmbed *self, const char *name, bool value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - lua_pushboolean(self->state,value); - lua_setglobal(self->state,name); -} - - -void LuaCEmbed_set_global_table(LuaCEmbed *self, const char *name, LuaCEmbedTable *table){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_getglobal(self->state,table->global_name); - lua_setglobal(self->state,name); -} \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/setters/setters.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/setters/setters.h deleted file mode 100644 index 1f22314..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/globals/setters/setters.h +++ /dev/null @@ -1,12 +0,0 @@ - -void LuaCEmbed_set_global_string(LuaCEmbed *self, const char *name, const char *value); - -void LuaCEmbed_set_global_raw_string(LuaCEmbed *self, const char *name, const char *value,long size); - -void LuaCEmbed_set_global_long(LuaCEmbed *self, const char *name, long long value); - -void LuaCEmbed_set_global_double(LuaCEmbed *self, const char *name, double value); - -void LuaCEmbed_set_global_bool(LuaCEmbed *self, const char *name, bool value); - -void LuaCEmbed_set_global_table(LuaCEmbed *self, const char *name, LuaCEmbedTable *table); diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/lib_props/lib_props.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/lib_props/lib_props.c deleted file mode 100644 index cfcf894..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/lib_props/lib_props.c +++ /dev/null @@ -1,147 +0,0 @@ - - -void LuaCEmbed_set_long_lib_prop(LuaCEmbed *self,const char *name,long long value){ - char *main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - lua_getglobal(self->state,main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushinteger(self->state,value); - lua_settable(self->state,-3); - free(main_lib_table); -} - -void LuaCEmbed_set_double_lib_prop(LuaCEmbed *self,const char *name,double value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushnumber(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_bool_lib_prop(LuaCEmbed *self,const char *name,bool value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushboolean(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_string_lib_prop(LuaCEmbed *self,const char *name,const char * value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushstring(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_table_lib_prop(LuaCEmbed *self,const char *name,LuaCEmbedTable *value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - lua_pushstring(self->state,name); - lua_getglobal(self->state,value->global_name); - lua_settable(self->state,-3); - -} - -int private_LuaCEmbed_ensure_lib_prop_type(LuaCEmbed *self,const char *name,int expected_type){ - int type = lua_type(self->state,-1); - if(type!= expected_type){ - privateLuaCEmbed_raise_error_not_jumping( - self, - PRIVATE_LUA_CEMBED_LIB_PROP_WRONG_TYPE, - name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - return LUA_CEMBED_OK; -} - -long long LuaCEmbed_get_long_lib_prop(LuaCEmbed *self,const char *name){ - lua_getglobal(self->state,self->main_lib_table); - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_tointeger(self->state,-1); - -} - -double LuaCEmbed_get_double_lib_prop(LuaCEmbed *self,const char *name){ - - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_bool_lib_prop(LuaCEmbed *self,const char *name){ - - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_toboolean(self->state,-1); -} - -char * LuaCEmbed_get_string_lib_prop(LuaCEmbed *self,const char *name){ - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); -} - -LuaCEmbedTable *LuaCEmbed_get_table_lib_prop(LuaCEmbed *self,const char *name){ -; - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_TABLE)){ - return NULL; - } - - char *global_sub_table_name = private_LuaCembed_format( - PRIVATE_LUA_CEMBED_MAIN_LIB_SUB_TABLE, - self->lib_identifier, - name - ); - lua_setglobal(self->state,global_sub_table_name); - - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,global_sub_table_name); - if(possible){ - free(global_sub_table_name); - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s",global_sub_table_name); - free(global_sub_table_name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/lib_props/lib_props.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/lib_props/lib_props.h deleted file mode 100644 index 58f8e59..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/lib_props/lib_props.h +++ /dev/null @@ -1,25 +0,0 @@ - - -void LuaCEmbed_set_long_lib_prop(LuaCEmbed *self,const char *name,long long value); - -void LuaCEmbed_set_double_lib_prop(LuaCEmbed *self,const char *name,double value); - -void LuaCEmbed_set_bool_lib_prop(LuaCEmbed *self,const char *name,bool value); - -void LuaCEmbed_set_string_lib_prop(LuaCEmbed *self,const char *name,const char * value); - -void LuaCEmbed_set_table_lib_prop(LuaCEmbed *self,const char *name,LuaCEmbedTable *value); - -int private_LuaCEmbed_ensure_lib_prop_type(LuaCEmbed *self,const char *name,int expected_type);; - - -long long LuaCEmbed_get_long_lib_prop(LuaCEmbed *self,const char *name); - -double LuaCEmbed_get_double_lib_prop(LuaCEmbed *self,const char *name); - -bool LuaCEmbed_get_bool_lib_prop(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_string_lib_prop(LuaCEmbed *self,const char *name); - -LuaCEmbedTable *LuaCEmbed_get_table_lib_prop(LuaCEmbed *self,const char *name); - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/lib_start/lib_start.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/lib_start/lib_start.c deleted file mode 100644 index e021dc3..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/lib_start/lib_start.c +++ /dev/null @@ -1,66 +0,0 @@ - -int private_LuaCemb_internal_free(lua_State *L){ - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(L, lua_upvalueindex(1)); - if(self->delete_function){ - self->delete_function(self); - } - LuaCEmbed_free(self); - return 0; -} -LuaCEmbed * newLuaCEmbedLib(lua_State *state){ - LuaCEmbed *self = (LuaCEmbed*) malloc(sizeof (LuaCEmbed)); - *self = (LuaCEmbed){0}; - - self->state = state; - - self->lib_identifier = 0; - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_TOTAL_LIBS); - if(lua_type(self->state,-1) == LUA_CEMBED_NIL){ - self->lib_identifier = lua_tointeger(self->state,-1); - } - - self->lib_identifier +=1; - - self->main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - lua_pushinteger(self->state,self->lib_identifier); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_TOTAL_LIBS); - - - self->is_lib = true; - self->global_tables = (void*)newprivateLuaCEmbedTableArray(); - - - UniversalGarbage *garbage = newUniversalGarbage(); - char *lib_meta_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_META_TABLE__,self->lib_identifier); - UniversalGarbage_add_simple(garbage,lib_meta_table); - //creating the metatable - luaL_newmetatable(self->state, lib_meta_table); - //seting the clojure key - lua_pushstring(self->state,PRIVATE_LUA_CEMBED_DEL_PREFIX); - //set self as first clojure argument - lua_pushlightuserdata(self->state,(void*)self); - lua_pushcclosure(self->state,private_LuaCemb_internal_free,1); - lua_settable(self->state, -3); - - - char *lib_main_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - UniversalGarbage_add_simple(garbage,lib_main_table); - //creating the global table to store the elements - lua_newtable(self->state); - lua_setglobal(self->state,lib_main_table); - luaL_setmetatable(self->state, lib_meta_table); - - UniversalGarbage_free(garbage); - return self; -} - -int LuaCembed_perform(LuaCEmbed *self){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - char *lib_main_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - lua_getglobal(self->state,lib_main_table); - free(lib_main_table); - return 1; -} diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/lib_start/lib_start.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/lib_start/lib_start.h deleted file mode 100644 index 8bc3150..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/lib_start/lib_start.h +++ /dev/null @@ -1,6 +0,0 @@ - -int private_LuaCemb_internal_free(lua_State *L); - -LuaCEmbed * newLuaCEmbedLib(lua_State *state); - -int LuaCembed_perform(LuaCEmbed *self); diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/memory/memory.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/memory/memory.c deleted file mode 100644 index 64626f8..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/memory/memory.c +++ /dev/null @@ -1,28 +0,0 @@ - - -void LuaCEmbed_set_memory_limit(LuaCEmbed *self, double limit){ - lua_setallocf(self->state, private_LuaCembed_custom_allocator, &lua_cembed_used_memory); - lua_cembed_memory_limit = limit; -} -static void *private_LuaCembed_custom_allocator(void *ud, void *ptr, size_t osize, size_t nsize) { - int *used = (int *)ud; - - if (ptr == NULL) { - osize = 0; - } - - if (nsize == 0) { - free(ptr); - *used -= osize; /* subtract old size from used memory */ - return NULL; - } else { - long custom_limit = (long)(lua_cembed_memory_limit * PRIVATE_LUA_CEMBED_ONE_MB); - if (*used + (nsize - osize) > custom_limit) /* too much memory in use */ - return NULL; - ptr = realloc(ptr, nsize); - if (ptr) /* reallocation successful? */ - *used += (nsize - osize); - return ptr; - } -} - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/memory/memory.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/memory/memory.h deleted file mode 100644 index 3975fc5..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/memory/memory.h +++ /dev/null @@ -1,10 +0,0 @@ - - -long lua_cembed_used_memory = 0; -long lua_cembed_memory_limit = -1; - -void LuaCEmbed_set_memory_limit(LuaCEmbed *self, double limit); - - -static void *private_LuaCembed_custom_allocator(void *ud, void *ptr, size_t osize, size_t nsize) ; - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/protection_macros.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/protection_macros.h deleted file mode 100644 index 7164a30..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/protection_macros.h +++ /dev/null @@ -1,24 +0,0 @@ -#define PRIVATE_LUA_CEMBED_PROTECT_VOID \ - if(!self){ \ - return; \ - } - - -#define PRIVATE_LUA_CEMBED_PROTECT_NUM \ - if(!self){ \ - return LUA_CEMBED_GENERIC_ERROR; \ - } - -#define PRIVATE_LUA_CEMBED_PROTECT_BOOL \ - if(!self){ \ - return false; \ - } - -#define PRIVATE_LUA_CEMBED_PROTECT_NULL \ - if(!self){ \ - return NULL; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK if(lua_gettop(self->main_object->state)){lua_settop(self->main_object->state,0);} - -#define PRIVATE_LUA_CEMBED_CLEAR_STACK if(lua_gettop(self->state)){lua_settop(self->state,0);} diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/declaration.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/declaration.h deleted file mode 100644 index da9d43f..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/declaration.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "table/declaration.h" -#include "table_array/table_array.h" -#include "protection_macros.h" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/definition.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/definition.h deleted file mode 100644 index fd0a7b8..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/definition.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "table/definition.h" -#include "table_array/table_array.c" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/protection_macros.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/protection_macros.h deleted file mode 100644 index c21cd13..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/protection_macros.h +++ /dev/null @@ -1,19 +0,0 @@ -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID \ - if(!self){ \ - return; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM \ - if(!self){ \ - return LUA_CEMBED_GENERIC_ERROR; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL \ - if(!self){ \ - return false; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL \ - if(!self){ \ - return NULL; \ - } diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/append/append.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/append/append.c deleted file mode 100644 index 6f914a6..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/append/append.c +++ /dev/null @@ -1,85 +0,0 @@ -void LuaCEmbedTable_append_table(LuaCEmbedTable *self, LuaCEmbedTable *table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_getglobal(self->main_object->state,table->global_name); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_string(LuaCEmbedTable *self, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushstring(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_long(LuaCEmbedTable *self, long long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushnumber(self->main_object->state,(double)value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_double(LuaCEmbedTable *self, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushnumber(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_bool(LuaCEmbedTable *self, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushboolean(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_evaluation(LuaCEmbedTable *self, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - va_list args; - va_start(args,code); - char *buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate( - self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); -} \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/append/append.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/append/append.h deleted file mode 100644 index 8b29b86..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/append/append.h +++ /dev/null @@ -1,14 +0,0 @@ - - -void LuaCEmbedTable_append_table(LuaCEmbedTable *self, LuaCEmbedTable *table); - - -void LuaCEmbedTable_append_evaluation(LuaCEmbedTable *self, const char *code, ...); - -void LuaCEmbedTable_append_string(LuaCEmbedTable *self, const char *value); - -void LuaCEmbedTable_append_long(LuaCEmbedTable *self, long long value); - -void LuaCEmbedTable_append_double(LuaCEmbedTable *self, double value); - -void LuaCEmbedTable_append_bool(LuaCEmbedTable *self, bool value); \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/basic/basic.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/basic/basic.c deleted file mode 100644 index 550c772..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/basic/basic.c +++ /dev/null @@ -1,65 +0,0 @@ - - - - -LuaCEmbedTable * private_newLuaCembedTable(LuaCEmbed *main_embed, const char *format, ...){ - - LuaCEmbedTable *self = (LuaCEmbedTable*)malloc(sizeof (LuaCEmbedTable)); - *self = (LuaCEmbedTable){0}; - self->main_object =main_embed; - - va_list args; - va_start(args,format); - self->global_name = private_LuaCembed_format_vaarg(format,args); - va_end(args); - - self->sub_tables = (void*)newprivateLuaCEmbedTableArray(); - - return self; -} - - int private_lua_cEmbed_unpack(LuaCEmbedTable *self,const char * previews_function){ - - long size = LuaCEmbedTable_get_listable_size(self); - lua_settop(self->main_object->state, 0); - - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - int total = 0; - - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - - lua_pushvalue(self->main_object->state,-1); - char *formated = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->main_object->stack_leve,total); - - lua_setglobal(self->main_object->state,formated); - free(formated); - lua_pop(self->main_object->state,1); - total+=1; - } - if(previews_function){ - lua_getglobal(self->main_object->state,previews_function); - } - for(int i = 0; i < size; i++){ - char *formated = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->main_object->stack_leve,i); - lua_getglobal(self->main_object->state,formated); - free(formated); - } - - return (int)size; -} -void privateLuaCEmbedTable_free(LuaCEmbedTable *self){ - - free(self->global_name); - - if(self->prop_name){ - free(self->prop_name); - } - - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->sub_tables); - free(self); -} - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/basic/basic.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/basic/basic.h deleted file mode 100644 index 6c03fab..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/basic/basic.h +++ /dev/null @@ -1,9 +0,0 @@ - - -LuaCEmbedTable * private_newLuaCembedTable(LuaCEmbed *main_embed, const char *format, ...); - -int private_lua_cEmbed_unpack(LuaCEmbedTable *self,const char * previews_function); - -void privateLuaCEmbedTable_free(LuaCEmbedTable *self); - -void privateLuaCEmbedTable_free_setting_nill(LuaCEmbedTable *self); \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/declaration.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/declaration.h deleted file mode 100644 index bbecb17..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/declaration.h +++ /dev/null @@ -1,8 +0,0 @@ -#include "table.h" -#include "basic/basic.h" -#include "getters/declaration.h" -#include "setters/declaration.h" -#include "errors/errors.h" -#include "sub_tables/declaration.h" -#include "append/append.h" -#include "destroy/destroy.h" diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/definition.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/definition.h deleted file mode 100644 index 02a20e6..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/definition.h +++ /dev/null @@ -1,8 +0,0 @@ - -#include "basic/basic.c" -#include "getters/definition.h" -#include "setters/definition.h" -#include "errors/errors.c" -#include "sub_tables/definition.h" -#include "append/append.c" -#include "destroy/destroy.c" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/destroy/destroy.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/destroy/destroy.c deleted file mode 100644 index 90da9b0..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/destroy/destroy.c +++ /dev/null @@ -1,52 +0,0 @@ - - -void LuaCembedTable_destroy_prop(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnil(self->main_object->state); - lua_settable(self->main_object->state,-3); -} -void LuaCEmbedTable_destroy_by_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(LuaCembedTable_has_key_at_index(self,index)){ - char *key = LuaCembedTable_get_key_by_index(self,index); - LuaCembedTable_destroy_prop(self,key); - return; - } - - lua_getglobal(self->main_object->state,self->global_name); - - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int table_index = lua_gettop(self->main_object->state); - int total = 0; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total >= converted_index){ - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)(total)); - lua_pushvalue(self->main_object->state,-3); - lua_settable(self->main_object->state,-3); - lua_pop(self->main_object->state,1); - - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,total); - lua_pushnil(self->main_object->state); - lua_settable(self->main_object->state,-3); - - - -} \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/destroy/destroy.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/destroy/destroy.h deleted file mode 100644 index 23f506d..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/destroy/destroy.h +++ /dev/null @@ -1,5 +0,0 @@ - - -void LuaCembedTable_destroy_prop(LuaCEmbedTable *self, const char *name); - -void LuaCEmbedTable_destroy_by_index(LuaCEmbedTable *self, long index); \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/errors/errors.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/errors/errors.c deleted file mode 100644 index b56a963..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/errors/errors.c +++ /dev/null @@ -1,42 +0,0 @@ - - - -int privateLuaCEmbedTable_ensure_type_with_key(LuaCEmbedTable *self, const char *name, int expected_type){ - if(!self){ - return LUA_CEMBED_GENERIC_ERROR; - } - - int type = lua_type(self->main_object->state,-1); - if(type == expected_type){ - return LUA_CEMBED_OK; - } - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_PROPETY, - name, - self->global_name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} - -int privateLuaCEmbedTable_ensure_type_with_index(LuaCEmbedTable *self, long index, int expected_type){ - if(!self){ - return LUA_CEMBED_GENERIC_ERROR; - } - - int type = lua_type(self->main_object->state,-1); - if(type == expected_type){ - return LUA_CEMBED_OK; - } - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/errors/errors.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/errors/errors.h deleted file mode 100644 index 0474819..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/errors/errors.h +++ /dev/null @@ -1,4 +0,0 @@ - -int privateLuaCEmbedTable_ensure_type_with_key(LuaCEmbedTable *self, const char *name, int expected_type); - -int privateLuaCEmbedTable_ensure_type_with_index(LuaCEmbedTable *self, long index, int expected_type); diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/declaration.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/declaration.h deleted file mode 100644 index 11daa6f..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/declaration.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "index/index.h" -#include "keys/keys.h" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/definition.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/definition.h deleted file mode 100644 index 92a5e82..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/definition.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "index/index.c" -#include "keys/keys.c" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/index/index.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/index/index.c deleted file mode 100644 index 0c2e505..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/index/index.c +++ /dev/null @@ -1,277 +0,0 @@ - - -long LuaCEmbedTable_get_full_size(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - - - lua_getglobal(self->main_object->state,self->global_name); - int index = lua_gettop(self->main_object->state); - long total = 0; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,index)){ - total+=1; - lua_pop(self->main_object->state,1); - } - - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return total; -} - -long LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - lua_getglobal(self->main_object->state,self->global_name); - return (long)lua_rawlen(self->main_object->state,-1); -} - - -long privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cembed_incremented_arg index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - if(index >= 0){ - return index; - } - - return LuaCEmbedTable_get_full_size(self) + index; -} - -int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - int type = lua_type(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return type; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_NOT_FOUND; -} -char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - - if(total == converted_index){ - if(lua_type(self->main_object->state,-2) != LUA_CEMBED_STRING ){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - char* result = (char*)lua_tostring(self->main_object->state,-2); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - - lua_pop(self->main_object->state,1); - total+=1; - - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} -bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - lua_settop(self->main_object->state,0); - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - bool has_key =lua_type(self->main_object->state,-2) == LUA_CEMBED_STRING; - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return has_key; - } - - lua_pop(self->main_object->state,1); - total+=1; - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return false; -} - -long long LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - lua_settop(self->main_object->state,0); - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_NUMBER)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - long result = (long)lua_tonumber(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_NUMBER) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} - -double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_NUMBER)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - double result = (double )lua_tonumber(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_NUMBER) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} - -char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_STRING)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - char * result = (char*)lua_tostring(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_STRING) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} - -bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_BOOL)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - bool result = lua_toboolean(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - converted_index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_BOOL) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/index/index.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/index/index.h deleted file mode 100644 index f72364d..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/index/index.h +++ /dev/null @@ -1,24 +0,0 @@ - - -char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, long index); - -bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, long index); - -long LuaCEmbedTable_get_full_size(LuaCEmbedTable *self); - -long LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self); - - -long privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cembed_incremented_arg index); - -int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, int index); - -long long LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, int index); - -double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, int index); - -char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, int index); - -bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, int index); - - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/keys/keys.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/keys/keys.c deleted file mode 100644 index 7f77463..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/keys/keys.c +++ /dev/null @@ -1,69 +0,0 @@ - -int LuaCEmbedTable_get_type_prop(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - return lua_type(self->main_object->state,-1); - -} - -char* LuaCembedTable_get_string_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_STRING)){ - return NULL; - } - - char *value = (char*)lua_tostring(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - - -long long LuaCembedTable_get_long_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - long long value = (long long)lua_tonumber(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - -double LuaCembedTable_get_double_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - double value = (double )lua_tonumber(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - -bool LuaCembedTable_get_bool_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - bool value = lua_toboolean(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/keys/keys.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/keys/keys.h deleted file mode 100644 index ec5de2b..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/getters/keys/keys.h +++ /dev/null @@ -1,12 +0,0 @@ - - - -char* LuaCembedTable_get_string_prop(LuaCEmbedTable *self, const char *name); - -long long LuaCembedTable_get_long_prop(LuaCEmbedTable *self, const char *name); - -double LuaCembedTable_get_double_prop(LuaCEmbedTable *self, const char *name); - -bool LuaCembedTable_get_bool_prop(LuaCEmbedTable *self, const char *name); - -int LuaCEmbedTable_get_type_prop(LuaCEmbedTable *self, const char *name); diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/declaration.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/declaration.h deleted file mode 100644 index caac5e4..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/declaration.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "index/index.h" -#include "keys/keys.h" -#include "insert/insert.h" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/definition.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/definition.h deleted file mode 100644 index c99d93c..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/definition.h +++ /dev/null @@ -1,3 +0,0 @@ -#include "index/index.c" -#include "keys/keys.c" -#include "insert/insert.c" diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/index/index.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/index/index.c deleted file mode 100644 index c608625..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/index/index.c +++ /dev/null @@ -1,98 +0,0 @@ - - -void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, long index, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_string_prop(self,possible_key,value); - return; - } - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushstring(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_long_by_index(LuaCEmbedTable *self, long long index, long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_long_prop(self,possible_key,value); - return; - } - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushnumber(self->main_object->state,(double )value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, long index, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_double_prop(self,possible_key,value); - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushnumber(self->main_object->state,(double )value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, long index, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_bool_prop(self,possible_key,value); - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushboolean(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - - -void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, long index, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - va_list args; - va_start(args,code); - char * buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate(self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/index/index.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/index/index.h deleted file mode 100644 index 1fce205..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/index/index.h +++ /dev/null @@ -1,11 +0,0 @@ - -void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, long index, const char *value); - -void LuaCEmbedTable_set_long_by_index(LuaCEmbedTable *self, long long index, long value); - -void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, long index, double value); - -void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, long index, bool value); - - -void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, long index, const char *code, ...); diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/insert/insert.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/insert/insert.c deleted file mode 100644 index 8763c59..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/insert/insert.c +++ /dev/null @@ -1,118 +0,0 @@ - -void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, long formatted_index){ - - - lua_newtable(self->main_object->state); - lua_setglobal(self->main_object->state,PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - - lua_getglobal(self->main_object->state, self->global_name); - int table_index = lua_gettop(self->main_object->state); - int total = 1; - lua_pushnil(self->main_object->state); // Empilhando o primeiro par chave-valor - while (lua_next(self->main_object->state, table_index)) { - - if (total >= formatted_index) { - lua_getglobal(self->main_object->state, PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - lua_pushinteger(self->main_object->state, total + 1); - lua_pushvalue(self->main_object->state, -3); - lua_settable(self->main_object->state, -3); - lua_pop(self->main_object->state, 1); - } - lua_pop(self->main_object->state, 1); // Removendo o valor atual - total+=1; - } - - lua_getglobal(self->main_object->state, PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - table_index = lua_gettop(self->main_object->state); - lua_pushnil(self->main_object->state); - - while (lua_next(self->main_object->state, table_index)) { - lua_getglobal(self->main_object->state,self->global_name); - lua_pushvalue(self->main_object->state,-3); //table[index] = stage_area[index] - lua_pushvalue(self->main_object->state,-3); //table[index] = stage_area[index] - lua_settable(self->main_object->state,-3); - lua_pop(self->main_object->state, 2); // Removendo o valor atual - } - - lua_getglobal(self->main_object->state, "stage_arrea"); - lua_pushnil(self->main_object->state); -} - -void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, long index, const char *value) { - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushstring(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - - -void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, long index,bool value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushboolean(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, long long index,long value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushinteger(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, long index,double value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushnumber(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_table_at_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *table){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_getglobal(self->main_object->state,table->global_name); - lua_settable(self->main_object->state, -3); - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/insert/insert.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/insert/insert.h deleted file mode 100644 index c226d8f..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/insert/insert.h +++ /dev/null @@ -1,14 +0,0 @@ - - -void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, long formatted_index); - -void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, long index, const char *value); - -void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, long index,bool value); - -void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, long long index,long value); - -void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, long index,double value); - -void LuaCEmbedTable_insert_table_at_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *table); - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/keys/keys.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/keys/keys.c deleted file mode 100644 index b031400..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/keys/keys.c +++ /dev/null @@ -1,128 +0,0 @@ - - - - -void LuaCEmbedTable_set_method(LuaCEmbedTable *self , const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - bool is_meta = false; - - if(strlen(name) > 3){ - if(name[0] == '_' && name[1] == '_' ){ - is_meta = true; - } - } - lua_getglobal(self->main_object->state,self->global_name); - - if(is_meta){ - - - int found =lua_getmetatable(self->main_object->state,-1); - if(!found){ - - //equivalent of meta ={} ;setmetatable(table,meta) - lua_getglobal(self->main_object->state,self->global_name); - lua_newtable(self->main_object->state); - lua_setmetatable(self->main_object->state,-2); - - lua_getglobal(self->main_object->state,self->global_name); - lua_getmetatable(self->main_object->state,-1); - } - } - - - lua_pushstring(self->main_object->state,name); - //creating the clojure - - lua_pushboolean(self->main_object->state,true);//is a method - - lua_pushlightuserdata(self->main_object->state,(void*)self->main_object); //self - lua_pushstring(self->main_object->state,name);//calback name - lua_getglobal(self->main_object->state,self->global_name);//table - lua_pushlightuserdata(self->main_object->state,(void*)callback); - - //add these clojure to be handled by the callbacks - lua_pushcclosure(self->main_object->state,privateLuaCEmbed_main_callback_handler,5); - lua_settable(self->main_object->state,-3); - - if(is_meta){ - //equivalent of meta ={} ;setmetatable(table,meta) - lua_getglobal(self->main_object->state,self->global_name); - lua_getmetatable(self->main_object->state,-1); - lua_setmetatable(self->main_object->state,-2); - } - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_string_prop(LuaCEmbedTable *self , const char *name, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushstring(self->main_object->state,value); - - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_long_prop(LuaCEmbedTable *self , const char *name, long long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnumber(self->main_object->state,(double)value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_double_prop(LuaCEmbedTable *self , const char *name, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnumber(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_bool_prop(LuaCEmbedTable *self , const char *name, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushboolean(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_evaluation_prop(LuaCEmbedTable *self, const char *name, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - va_list args; - va_start(args,code); - char *buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate(self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/keys/keys.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/keys/keys.h deleted file mode 100644 index 45f9f48..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/setters/keys/keys.h +++ /dev/null @@ -1,18 +0,0 @@ - - - - - -void LuaCEmbedTable_set_method(LuaCEmbedTable *self, const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)); - -void LuaCEmbedTable_set_string_prop(LuaCEmbedTable *self, const char *name, const char *value); - -void LuaCEmbedTable_set_long_prop(LuaCEmbedTable *self, const char *name, long long value); - -void LuaCEmbedTable_set_double_prop(LuaCEmbedTable *self, const char *name, double value); - -void LuaCEmbedTable_set_bool_prop(LuaCEmbedTable *self, const char *name, bool value); - - -void LuaCEmbedTable_set_evaluation_prop(LuaCEmbedTable *self, const char *name, const char *code, ...); - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/declaration.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/declaration.h deleted file mode 100644 index 0e30419..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/declaration.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "key/key.h" -#include "index/index.h" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/definition.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/definition.h deleted file mode 100644 index 78d5a47..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/definition.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "key/key.c" -#include "index/index.c" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/index/index.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/index/index.c deleted file mode 100644 index 8daf216..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/index/index.c +++ /dev/null @@ -1,131 +0,0 @@ - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_appending(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - - //equivalent of: full_sub_table_name = {} - long index= LuaCEmbedTable_get_listable_size(self) +1; - char *full_sub_table_name = private_LuaCembed_format("%s_%d", self->global_name, index); - lua_newtable(self->main_object->state); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - //equivalent of: table[index] = full_sub_table_name - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,index); - lua_getglobal(self->main_object->state,full_sub_table_name); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_internal_index( - (privateLuaCEmbedTableArray *) self->sub_tables, - index - ); - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->index = index; - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; -} - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, long index){ - - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_TABLE)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - - //equivalent of full_sub_table_name = table[index] - char *full_sub_table_name = private_LuaCembed_format("%s_%d", self->global_name, index); - lua_setglobal(self->main_object->state,full_sub_table_name); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_internal_index( - (privateLuaCEmbedTableArray *) self->sub_tables, - index - ); - - if(possible){ - free(full_sub_table_name); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->index = index; - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_TABLE) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} - -void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_sub_table_prop(self,possible_key,sub_table); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,formatted_index); - lua_getglobal(self->main_object->state,sub_table->global_name); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK -} diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/index/index.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/index/index.h deleted file mode 100644 index 3244198..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/index/index.h +++ /dev/null @@ -1,12 +0,0 @@ - - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_appending(LuaCEmbedTable *self); - - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, long index); - - -void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table); - - - diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/key/key.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/key/key.c deleted file mode 100644 index d82f31a..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/key/key.c +++ /dev/null @@ -1,110 +0,0 @@ - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_by_key(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - //equivalent of: table.sub_table = {} - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_newtable(self->main_object->state); - lua_settable(self->main_object->state,-3); - - - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state, name); - lua_gettable(self->main_object->state, -2); - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_prop_name( - (privateLuaCEmbedTableArray *) self->sub_tables, - name - ); - - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->prop_name = strdup(name); - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; -} - - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_key(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_TABLE)){ - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_prop_name( - (privateLuaCEmbedTableArray *) self->sub_tables, - name - ); - - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->prop_name = strdup(name); - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; - -} - - - -void LuaCEmbedTable_set_sub_table_prop(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - //equivalent of table.name = sub_table; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_getglobal(self->main_object->state,sub_table->global_name); - lua_settable(self->main_object->state,-3); - - - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK -} \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/key/key.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/key/key.h deleted file mode 100644 index ac17850..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/sub_tables/key/key.h +++ /dev/null @@ -1,6 +0,0 @@ - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_by_key(LuaCEmbedTable *self, const char *name); - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_key(LuaCEmbedTable *self, const char *name); - -void LuaCEmbedTable_set_sub_table_prop(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table); \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/table.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/table.h deleted file mode 100644 index a8e5391..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table/table.h +++ /dev/null @@ -1,10 +0,0 @@ - - -typedef struct { - LuaCEmbed *main_object; - char *prop_name; - char *global_name; - void *sub_tables; - long index; - -}LuaCEmbedTable; diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table_array/table_array.c b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table_array/table_array.c deleted file mode 100644 index ff47a8f..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table_array/table_array.c +++ /dev/null @@ -1,62 +0,0 @@ - - -privateLuaCEmbedTableArray *newprivateLuaCEmbedTableArray(){ - privateLuaCEmbedTableArray *self = (privateLuaCEmbedTableArray*) malloc(sizeof (privateLuaCEmbedTableArray)); - *self = (privateLuaCEmbedTableArray){0}; - self->tables = (LuaCEmbedTable**)malloc(0); - return self; -} - -void privateLuaCEmbedTableArray_append(privateLuaCEmbedTableArray *self,LuaCEmbedTable *element){ - - self->tables = (LuaCEmbedTable **)realloc( - self->tables, - (self->size+1)* sizeof (LuaCEmbedTable**) - ); - self->tables[self->size] = element; - self->size+=1; -} - - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_prop_name(privateLuaCEmbedTableArray *self, const char *name){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(current_table->prop_name){ - if(strcmp(current_table->prop_name,name) ==0){ - return current_table; - } - } - } - return NULL; -} - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_global_name(privateLuaCEmbedTableArray *self, const char *name){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(strcmp(current_table->global_name,name) ==0){ - return current_table; - } - } - return NULL; -} - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_internal_index(privateLuaCEmbedTableArray *self, long internal_index){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(current_table->index == internal_index){ - return current_table; - } - } - return NULL; -} - -void privateLuaCEmbedTableArray_free(privateLuaCEmbedTableArray *self){ - - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - privateLuaCEmbedTable_free(current_table); - } - - free(self->tables); - free(self); -} diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table_array/table_array.h b/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table_array/table_array.h deleted file mode 100644 index 4c878ca..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbed/table/table_array/table_array.h +++ /dev/null @@ -1,20 +0,0 @@ - - -typedef struct { - - LuaCEmbedTable **tables; - long size; - -}privateLuaCEmbedTableArray; - -privateLuaCEmbedTableArray *newprivateLuaCEmbedTableArray(); - -void privateLuaCEmbedTableArray_append(privateLuaCEmbedTableArray *self,LuaCEmbedTable *element); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_global_name(privateLuaCEmbedTableArray *self, const char *name); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_prop_name(privateLuaCEmbedTableArray *self, const char *name); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_internal_index(privateLuaCEmbedTableArray *self, long internal_index); - -void privateLuaCEmbedTableArray_free(privateLuaCEmbedTableArray *self); diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbedResponse/LuaCEmbedResponse.c b/build/c/dependencies/luaCEmbed/LuaCEmbedResponse/LuaCEmbedResponse.c deleted file mode 100644 index 58b6912..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbedResponse/LuaCEmbedResponse.c +++ /dev/null @@ -1,117 +0,0 @@ - - - -LuaCEmbedResponse *private_LuaCEmbedReturn_raw(){ - LuaCEmbedResponse *self = (LuaCEmbedResponse*)malloc(sizeof(LuaCEmbedResponse)); - *self = (LuaCEmbedResponse){0}; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_bool(bool value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_BOOL_RESPONSE; - self->num_val = (double)value; - return self; -} - - -LuaCEmbedResponse * LuaCEmbed_send_str(const char *text){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = (long)strlen(text); - self->string_val = (char*)malloc(sizeof(char) * self->string_size +1); - memcpy(self->string_val,text,self->string_size); - self->string_val[self->string_size] = '\0'; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_raw_string(const char *text,long size){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = size; - self->string_val = (char*)malloc(sizeof(char) * self->string_size +1); - memcpy(self->string_val,text,self->string_size); - self->string_val[self->string_size] = '\0'; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_str_reference(const char *text){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = (long)strlen(text); - self->string_val = (char*)text; - self->its_string_ref = true; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_raw_string_reference(const char *text,long size){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = size; - self->string_val = (char*)text; - self->its_string_ref = true; - return self; -} - - - -LuaCEmbedResponse * LuaCEmbed_send_error(const char *format,...){ - - va_list args; - va_start(args,format); - char *error = private_LuaCembed_format_vaarg(format,args); - va_end(args); - - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_ERROR_RESPONSE; - self->string_val = error; - return self; -} - - -LuaCEmbedResponse * LuaCEmbed_send_multi_return(LuaCEmbedTable *table){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_MULTI_RESPONSE; - lua_getglobal(table->main_object->state,table->global_name); - lua_setglobal(table->main_object->state,PRIVATE_LUA_CEMBED_TABLE_RETURN); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_table(LuaCEmbedTable *table){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_TABLE_RESPONSE; - lua_getglobal(table->main_object->state,table->global_name); - lua_setglobal(table->main_object->state,PRIVATE_LUA_CEMBED_TABLE_RETURN); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_evaluation(const char *code){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_EVALUATION; - self->string_val = strdup(code); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_double(double value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE; - self->num_val = value; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_long(long value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_LONG_RESPONSE; - self->num_val = (double)value; - return self; -} - - - -void private_LuaCEmbedResponse_free(LuaCEmbedResponse *self){ - - if(self->string_val && self->its_string_ref == false){ - free(self->string_val); - } - free(self); -} diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbedResponse/LuaCEmbedResponse.h b/build/c/dependencies/luaCEmbed/LuaCEmbedResponse/LuaCEmbedResponse.h deleted file mode 100644 index 0d5e909..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbedResponse/LuaCEmbedResponse.h +++ /dev/null @@ -1,40 +0,0 @@ - -typedef struct { - - int type; - double num_val; - bool its_string_ref; - long string_size; - char *string_val; - -}LuaCEmbedResponse; - -LuaCEmbedResponse *private_LuaCEmbedReturn_raw(); - - -LuaCEmbedResponse * LuaCEmbed_send_str(const char *text); - -LuaCEmbedResponse * LuaCEmbed_send_raw_string(const char *text,long size); - -LuaCEmbedResponse * LuaCEmbed_send_str_reference( const char *text); - -LuaCEmbedResponse * LuaCEmbed_send_raw_string_reference(const char *text,long size); - -LuaCEmbedResponse * LuaCEmbed_send_error(const char *format,...); - - -LuaCEmbedResponse * LuaCEmbed_send_evaluation(const char *code); - - - - - -LuaCEmbedResponse * LuaCEmbed_send_double(double value); - -LuaCEmbedResponse * LuaCEmbed_send_bool(bool value); - - -LuaCEmbedResponse * LuaCEmbed_send_long(long value); - - -void private_LuaCEmbedResponse_free(LuaCEmbedResponse *self); diff --git a/build/c/dependencies/luaCEmbed/LuaCEmbedResponse/LuaCembedResponse_pt2.h b/build/c/dependencies/luaCEmbed/LuaCEmbedResponse/LuaCembedResponse_pt2.h deleted file mode 100644 index 353c88b..0000000 --- a/build/c/dependencies/luaCEmbed/LuaCEmbedResponse/LuaCembedResponse_pt2.h +++ /dev/null @@ -1,6 +0,0 @@ - - -LuaCEmbedResponse * LuaCEmbed_send_table(LuaCEmbedTable *table); - - -LuaCEmbedResponse * LuaCEmbed_send_multi_return(LuaCEmbedTable *table); diff --git a/build/c/dependencies/luaCEmbed/constants/all.h b/build/c/dependencies/luaCEmbed/constants/all.h deleted file mode 100644 index e72bb69..0000000 --- a/build/c/dependencies/luaCEmbed/constants/all.h +++ /dev/null @@ -1,6 +0,0 @@ -#include "main_callback.h" -#include "types.h" -#include "responses.h" -#include "lua_code.h" -#include "errors.h" -#include "aplication.h" diff --git a/build/c/dependencies/luaCEmbed/constants/aplication.h b/build/c/dependencies/luaCEmbed/constants/aplication.h deleted file mode 100644 index 0d1ca0f..0000000 --- a/build/c/dependencies/luaCEmbed/constants/aplication.h +++ /dev/null @@ -1,10 +0,0 @@ -#ifndef LUA_CEMBED_INDEX_DIF -#define LUA_CEMBED_INDEX_DIF 1 -#endif - -#define PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE 1 -#define PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE 2 -#define LUA_CEMBED_DEFAULT_TIMEOUT 10 -#define LUA_CEMBED_DEFAULT_MEMORY_LIMIT 100 - -#define PRIVATE_LUA_CEMBED_ONE_MB (1024 * 1024) diff --git a/build/c/dependencies/luaCEmbed/constants/errors.h b/build/c/dependencies/luaCEmbed/constants/errors.h deleted file mode 100644 index 2c384ea..0000000 --- a/build/c/dependencies/luaCEmbed/constants/errors.h +++ /dev/null @@ -1,15 +0,0 @@ - - -#define PRIVATE_LUA_CEMBED_TIMEOUT_ERROR "timeout error" -#define PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED "arg %ld at function:%s not provided" -#define PRIVATE_LUA_CEMBED_ARG_WRONG_TYPE "arg %d at function:%s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_GLOBAL_WRONG_TYPE "global variable:%s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_RESULT_EVALUATION_WRONG_TYPE "result evaluation its:%s instead of %s" -#define PRIVATE_LUA_CEMBED_RESULT_EVALUATION_ARG_WRONG_TYPE "result evaluation of function %s at index %d its:%s instead of %s" - -#define PRIVATE_LUA_CEMBED_CODE_ITS_NOT_A_FUNCTION "value %s its not a function" -#define PRIVATE_LUA_CEMBED_WRONG_TYPE_PROPETY "propety %s at object %s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX "index %d at object %s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_ELEMENT_DOES_NOT_HAVE_KEY "index %d at object %s not have a key" -#define PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR "timeout error" -#define PRIVATE_LUA_CEMBED_LIB_PROP_WRONG_TYPE "lib prop %s its %s insteadd of %s" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/constants/lua_code.h b/build/c/dependencies/luaCEmbed/constants/lua_code.h deleted file mode 100644 index 59da360..0000000 --- a/build/c/dependencies/luaCEmbed/constants/lua_code.h +++ /dev/null @@ -1,23 +0,0 @@ - -#define PRIVATE_LUA_CEMBED_TOTAL_LIBS "private_lua_c_embed_total_running_libs" -#define PRIVATE_LUA_CEMBED_STACK_LEVEL "private_lua_c_embed_stack_level" - -#define PRIVATE_LUA_CEMBED_EVALUATION_NAME "private_lua_c_embed_evaluation" -#define PRIVATE_LUA_CEMBED_DEL_PREFIX "__gc" -#define PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE "%s = %s\n" - - - - -#define PRIVATE_LUA_CEMBED_SELFNAME "private_lua_c_embed_self" -#define PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE "private_lua_c_embed_stage_area_table" -#define PRIVATE_LUA_CEMBED_TABLE_RETURN "private_lua_embed_table_return" - -#define PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__ "private_lua_c_embed_main_lib_table_%d" -#define PRIVATE_LUA_CEMBED_MAIN_LIB_SUB_TABLE "private_lua_c_embed_main_lib_table_%d_%s" - -#define PRIVATE_LUA_CEMBED_MAIN_META_TABLE__ "private_lua_c_embed_main_meta_table_%d" -#define PRIVATE_LUA_CEMBED_ANONYMOUS_TABLE_ "private_lua_c_embed_anononymous_table_%d_%d" -#define PRIVATE_LUA_CEMBED_ANONYMOUS_FUNC_TABLE_ "private_lua_c_embed_anononymous_func_table_%d_%d" -#define PRIVATE_LUA_CEMBED_ARGS_ "private_lua_c_embed_args_%d_%d" -#define PRIVATE_LUA_CEMBED_MULTIRETURN_ "private_lua_c_embed_multi_return_%d_%d" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/constants/main_callback.h b/build/c/dependencies/luaCEmbed/constants/main_callback.h deleted file mode 100644 index 71d2f20..0000000 --- a/build/c/dependencies/luaCEmbed/constants/main_callback.h +++ /dev/null @@ -1,4 +0,0 @@ - -#define PRIVATE_LUACEMBED_NO_RETURN 0 -#define PRIVATE_LUACEMBED_ONE_RETURN 1 - diff --git a/build/c/dependencies/luaCEmbed/constants/responses.h b/build/c/dependencies/luaCEmbed/constants/responses.h deleted file mode 100644 index 897978e..0000000 --- a/build/c/dependencies/luaCEmbed/constants/responses.h +++ /dev/null @@ -1,12 +0,0 @@ -#define PRIVATE_LUA_CEMBED_STRING_RESPONSE 1 -#define PRIVATE_LUA_CEMBED_LONG_RESPONSE 2 -#define PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE 3 -#define PRIVATE_LUA_CEMBED_BOOL_RESPONSE 4 -#define PRIVATE_LUA_CEMBED_TABLE_RESPONSE 5 - -#define PRIVATE_LUA_CEMBED_EVALUATION 6 -#define PRIVATE_LUA_CEMBED_ERROR_RESPONSE 7 -#define PRIVATE_LUA_CEMBED_MULTI_RESPONSE 8 - -#define LUA_CEMBED_OK 0 -#define LUA_CEMBED_GENERIC_ERROR (-1) \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/constants/types.h b/build/c/dependencies/luaCEmbed/constants/types.h deleted file mode 100644 index d00b857..0000000 --- a/build/c/dependencies/luaCEmbed/constants/types.h +++ /dev/null @@ -1,17 +0,0 @@ -#define LUA_CEMBED_NOT_FOUND LUA_TNONE -#define LUA_CEMBED_STRING LUA_TSTRING -#define LUA_CEMBED_NUMBER LUA_TNUMBER -#define LUA_CEMBED_BOOL LUA_TBOOLEAN -#define LUA_CEMBED_NIL LUA_TNIL -#define LUA_CEMBED_FUNCTION LUA_TFUNCTION -#define LUA_CEMBED_TABLE LUA_TTABLE - -#define PRIVATE_LUA_CEMBED_NOT_FOUND_STRING "not Found" -#define PRIVATE_LUA_CEMBED_STRING_STRING "string" -#define PRIVATE_LUA_CEMBED_NUMBER_STRING "number" -#define PRIVATE_LUA_CEMBED_BOOL_STRING "boolean" -#define PRIVATE_LUA_CEMBED_NIL_STRING "nil" -#define PRIVATE_LUA_CEMBED_TABLE_STRING "table" -#define PRIVATE_LUA_CEMBED_FUNCTION_STRING "function" - -#define PRIVATE_LUA_CEMBED_UNKNOW_STRING "unknow" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/declaration.h b/build/c/dependencies/luaCEmbed/declaration.h deleted file mode 100644 index 3361d02..0000000 --- a/build/c/dependencies/luaCEmbed/declaration.h +++ /dev/null @@ -1,19 +0,0 @@ -#ifdef _WIN32 -#include -#else -#include -#include -#endif - -#include -#include -#include -#include -#include "dependencies/dependencies.h" -#include "constants/all.h" -#include "LuaCEmbedResponse/LuaCEmbedResponse.h" -#include "LuaCEmbed/declaration.h" -#include "LuaCEmbedResponse/LuaCembedResponse_pt2.h" - -#include "extra/extra.h" -#include "namespace/declaration.h" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/definition.h b/build/c/dependencies/luaCEmbed/definition.h deleted file mode 100644 index 7efa5f0..0000000 --- a/build/c/dependencies/luaCEmbed/definition.h +++ /dev/null @@ -1,4 +0,0 @@ -#include "LuaCEmbedResponse/LuaCEmbedResponse.c" -#include "LuaCEmbed/definition.h" -#include "extra/extra.c" -#include "namespace/definition.h" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/dependencies/UniversalGarbage.h b/build/c/dependencies/luaCEmbed/dependencies/UniversalGarbage.h deleted file mode 100644 index 6ba5987..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/UniversalGarbage.h +++ /dev/null @@ -1,321 +0,0 @@ - - - -#ifndef UNIVERSAL_GARBAGE_H - - -#include -#include -#include -#include - - - - - -#define UniversalGarbage_create_empty_struct(name,element_type) \ -(element_type*)malloc(sizeof(element_type)); \ -*name = (element_type){0}; - - -#define UniversalGarbage_cast(value) ((void**)&value) - - -#define UniversalGarbage_add(garbage,deallocator_callback,value) \ - rawUniversalGarbage_add(garbage,(void*)deallocator_callback,UniversalGarbage_cast(value)) - -#define UniversalGarbage_add_simple(garbage,value) \ - UniversalGarbage_add(garbage,free,value) - - -#define UniversalGarbage_add_return(garbage,deallocator_callback,value) \ - UniversalGarbage_add(garbage->return_values,deallocator_callback,value) - - -#define UniversalGarbage_add_simple_return(garbage,value) \ - UniversalGarbage_add_simple(garbage->return_values,value) - - - -#define UniversalGarbage_remove(garbage,value) \ - rawUniversalGarbage_remove(garbage,UniversalGarbage_cast(value)); - - -#define UniversalGarbage_disconnect(garbage,value) \ - rawUniversalGarbage_disconnect(garbage,UniversalGarbage_cast(value)); - - - - -#define UniversalGarbage_reallocate(garbage,value) \ - rawUniversalGarbage_reallocate(garbage,UniversalGarbage_cast(value)) - - -#define UniversalGarbage_resset(garbage,value) \ - rawUniversalGarbage_resset(garbage,UniversalGarbage_cast(value)) - - - - - - -typedef struct privateUniversalGarbageElement{ - void **pointer; - void (*deallocator_callback)(void *element); - void *pointed_value; -}privateUniversalGarbageElement; - -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self); - - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self); - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer); - - - -typedef struct UniversalGarbage{ - - struct UniversalGarbage *return_values; - privateUniversalGarbageElement **elements; - int elements_size; - bool is_the_root; - -}UniversalGarbage; - -UniversalGarbage * newUniversalGarbage(); - -UniversalGarbage * private_new_MainUniversalGarbage(); - - - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer); - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self); - -void UniversalGarbage_free_including_return(UniversalGarbage *self); - -void UniversalGarbage_free(UniversalGarbage *self); - - - - - - - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer){ - - privateUniversalGarbageElement * self = UniversalGarbage_create_empty_struct( - self, - privateUniversalGarbageElement - ); - self->pointer = pointer; - self->deallocator_callback = dealocator_callback; - self->pointed_value = *pointer; - return self; -} -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self){ - if(self->pointed_value){ - self->deallocator_callback(self->pointed_value); - self->pointed_value = NULL; - } -} - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self){ - private_UniversalGarbageSimpleElement_free_pointed_value(self); - free(self); -} - - -UniversalGarbage * private_new_MainUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->is_the_root = false; - return self; -} - -UniversalGarbage * newUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->is_the_root = true; - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->return_values =private_new_MainUniversalGarbage(); - - return self; -} - - - - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - - if(rawUniversalGarbage_reallocate(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - - privateUniversalGarbageElement *current = self->elements[i]; - bool reallocate = current->pointer == pointer; - - if(reallocate){ - current->pointed_value = *pointer; - return true; - } - } - return false; -} - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - if(rawUniversalGarbage_resset(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - bool resset = current->pointer == pointer; - if(resset){ - private_UniversalGarbageSimpleElement_free_pointed_value(current); - current->pointed_value = *pointer; - return true; - } - } - return false; - -} -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_remove(self->return_values,pointer)){ - *pointer = NULL; - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - private_UniversalGarbageSimpleElement_free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - - } - *pointer = NULL; - return true; - } - } - return false; -} -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_disconnect(self->return_values,pointer)){ - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - } - return true; - } - } - return false; - - - -} -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer){ - - if(!pointer){ - return false; - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - return false; - } - } - - self->elements = (privateUniversalGarbageElement**)realloc( - self->elements, - (self->elements_size + 1) * sizeof(privateUniversalGarbageElement*) - ); - void (*dealocator_callback)(void *element); -#ifdef __cplusplus - dealocator_callback =reinterpret_cast(release_callback); -#else - dealocator_callback = (void*)(void*)release_callback; - -#endif - - - - self->elements[self->elements_size] = private_newUniversalGarbageSimpleElement(dealocator_callback, pointer); - self->elements_size+=1; - return true; -} - - - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self){ - for(int i = 0; i < self->elements_size; i++){ - private_UniversalGarbageSimpleElement_free(self->elements[i]); - } - free(self->elements); -} - -void UniversalGarbage_free_including_return(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - if(self->is_the_root){ - UniversalGarbage_free(self->return_values); - } - free(self); -} - -void UniversalGarbage_free(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - - if(self->is_the_root){ - - UniversalGarbage *return_garbage = self->return_values; - for(int i = 0; i < return_garbage->elements_size; i++){ - free(return_garbage->elements[i]); - } - - free(return_garbage->elements); - free(return_garbage); - } - - - free(self); -} - - - - -#define UNIVERSAL_GARBAGE_H -#endif \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/dependencies/dependencies.h b/build/c/dependencies/luaCEmbed/dependencies/dependencies.h deleted file mode 100644 index 383bdb8..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/dependencies.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "UniversalGarbage.h" -#include "lua/onelua.c" diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/custom_math/custom_math.c b/build/c/dependencies/luaCEmbed/dependencies/lua/custom_math/custom_math.c deleted file mode 100644 index 2b189e8..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/custom_math/custom_math.c +++ /dev/null @@ -1,44 +0,0 @@ -double private_lua_embed_fmod(double x, double y) { - while (y != 0.0) { - while (x >= y) { - x -= y; - } - if (x < y) { - return x; - } - } - return 0.0 / 0.0; -} - -double private_lua_embed_pow(double b, double e) { - double resultado = 1.0; - int i; - - if (e == 0.0) { - return 1.0; - } - if (e < 0.0) { - b = 1.0 / b; - e = -e; - } - - for (i = 0; i < e; i++) { - resultado *= b; - } - - return resultado; -} - -double private_lua_embed_floor(double x) { - int i = (int)x; - - if (x == (double)i) { - return x; - } - - if (x < 0.0) { - return (double)(i - 1); - } - - return (double)i; -} \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/custom_math/custom_math.h b/build/c/dependencies/luaCEmbed/dependencies/lua/custom_math/custom_math.h deleted file mode 100644 index 5c05b0d..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/custom_math/custom_math.h +++ /dev/null @@ -1,8 +0,0 @@ - -double private_lua_embed_fmod(double x, double y); - -// Implementação simples da função pow -double private_lua_embed_pow(double b, double e); - -// Implementação simples da função floor -double private_lua_embed_floor(double x); \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lapi.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lapi.c deleted file mode 100644 index 5de3767..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lapi.c +++ /dev/null @@ -1,1471 +0,0 @@ -/* -** $Id: lapi.c $ -** Lua API -** See Copyright Notice in lua.h -*/ - -#define lapi_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lundump.h" -#include "lvm.h" - - - -const char lua_ident[] = - "$LuaVersion: " LUA_COPYRIGHT " $" - "$LuaAuthors: " LUA_AUTHORS " $"; - - - -/* -** Test for a valid index (one that is not the 'nilvalue'). -** '!ttisnil(o)' implies 'o != &G(L)->nilvalue', so it is not needed. -** However, it covers the most common cases in a faster way. -*/ -#define isvalid(L, o) (!ttisnil(o) || o != &G(L)->nilvalue) - - -/* test for pseudo index */ -#define ispseudo(i) ((i) <= LUA_REGISTRYINDEX) - -/* test for upvalue */ -#define isupvalue(i) ((i) < LUA_REGISTRYINDEX) - - -/* Advance the garbage collector when creating large objects */ -static void advancegc (lua_State *L, size_t delta) { - delta >>= 5; /* one object for each 32 bytes (empirical) */ - if (delta > 0) { - global_State *g = G(L); - luaE_setdebt(g, g->GCdebt - delta); - } -} - - -/* -** Convert an acceptable index to a pointer to its respective value. -** Non-valid indices return the special nil value 'G(L)->nilvalue'. -*/ -static TValue *index2value (lua_State *L, int idx) { - CallInfo *ci = L->ci; - if (idx > 0) { - StkId o = ci->func.p + idx; - api_check(L, idx <= ci->top.p - (ci->func.p + 1), "unacceptable index"); - if (o >= L->top.p) return &G(L)->nilvalue; - else return s2v(o); - } - else if (!ispseudo(idx)) { /* negative index */ - api_check(L, idx != 0 && -idx <= L->top.p - (ci->func.p + 1), - "invalid index"); - return s2v(L->top.p + idx); - } - else if (idx == LUA_REGISTRYINDEX) - return &G(L)->l_registry; - else { /* upvalues */ - idx = LUA_REGISTRYINDEX - idx; - api_check(L, idx <= MAXUPVAL + 1, "upvalue index too large"); - if (ttisCclosure(s2v(ci->func.p))) { /* C closure? */ - CClosure *func = clCvalue(s2v(ci->func.p)); - return (idx <= func->nupvalues) ? &func->upvalue[idx-1] - : &G(L)->nilvalue; - } - else { /* light C function or Lua function (through a hook)?) */ - api_check(L, ttislcf(s2v(ci->func.p)), "caller not a C function"); - return &G(L)->nilvalue; /* no upvalues */ - } - } -} - - - -/* -** Convert a valid actual index (not a pseudo-index) to its address. -*/ -static StkId index2stack (lua_State *L, int idx) { - CallInfo *ci = L->ci; - if (idx > 0) { - StkId o = ci->func.p + idx; - api_check(L, o < L->top.p, "invalid index"); - return o; - } - else { /* non-positive index */ - api_check(L, idx != 0 && -idx <= L->top.p - (ci->func.p + 1), - "invalid index"); - api_check(L, !ispseudo(idx), "invalid index"); - return L->top.p + idx; - } -} - - -LUA_API int lua_checkstack (lua_State *L, int n) { - int res; - CallInfo *ci; - lua_lock(L); - ci = L->ci; - api_check(L, n >= 0, "negative 'n'"); - if (L->stack_last.p - L->top.p > n) /* stack large enough? */ - res = 1; /* yes; check is OK */ - else /* need to grow stack */ - res = luaD_growstack(L, n, 0); - if (res && ci->top.p < L->top.p + n) - ci->top.p = L->top.p + n; /* adjust frame top */ - lua_unlock(L); - return res; -} - - -LUA_API void lua_xmove (lua_State *from, lua_State *to, int n) { - int i; - if (from == to) return; - lua_lock(to); - api_checkpop(from, n); - api_check(from, G(from) == G(to), "moving among independent states"); - api_check(from, to->ci->top.p - to->top.p >= n, "stack overflow"); - from->top.p -= n; - for (i = 0; i < n; i++) { - setobjs2s(to, to->top.p, from->top.p + i); - to->top.p++; /* stack already checked by previous 'api_check' */ - } - lua_unlock(to); -} - - -LUA_API lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf) { - lua_CFunction old; - lua_lock(L); - old = G(L)->panic; - G(L)->panic = panicf; - lua_unlock(L); - return old; -} - - -LUA_API lua_Number lua_version (lua_State *L) { - UNUSED(L); - return LUA_VERSION_NUM; -} - - - -/* -** basic stack manipulation -*/ - - -/* -** convert an acceptable stack index into an absolute index -*/ -LUA_API int lua_absindex (lua_State *L, int idx) { - return (idx > 0 || ispseudo(idx)) - ? idx - : cast_int(L->top.p - L->ci->func.p) + idx; -} - - -LUA_API int lua_gettop (lua_State *L) { - return cast_int(L->top.p - (L->ci->func.p + 1)); -} - - -LUA_API void lua_settop (lua_State *L, int idx) { - CallInfo *ci; - StkId func, newtop; - ptrdiff_t diff; /* difference for new top */ - lua_lock(L); - ci = L->ci; - func = ci->func.p; - if (idx >= 0) { - api_check(L, idx <= ci->top.p - (func + 1), "new top too large"); - diff = ((func + 1) + idx) - L->top.p; - for (; diff > 0; diff--) - setnilvalue(s2v(L->top.p++)); /* clear new slots */ - } - else { - api_check(L, -(idx+1) <= (L->top.p - (func + 1)), "invalid new top"); - diff = idx + 1; /* will "subtract" index (as it is negative) */ - } - newtop = L->top.p + diff; - if (diff < 0 && L->tbclist.p >= newtop) { - lua_assert(hastocloseCfunc(ci->nresults)); - newtop = luaF_close(L, newtop, CLOSEKTOP, 0); - } - L->top.p = newtop; /* correct top only after closing any upvalue */ - lua_unlock(L); -} - - -LUA_API void lua_closeslot (lua_State *L, int idx) { - StkId level; - lua_lock(L); - level = index2stack(L, idx); - api_check(L, hastocloseCfunc(L->ci->nresults) && L->tbclist.p == level, - "no variable to close at given level"); - level = luaF_close(L, level, CLOSEKTOP, 0); - setnilvalue(s2v(level)); - lua_unlock(L); -} - - -/* -** Reverse the stack segment from 'from' to 'to' -** (auxiliary to 'lua_rotate') -** Note that we move(copy) only the value inside the stack. -** (We do not move additional fields that may exist.) -*/ -static void reverse (lua_State *L, StkId from, StkId to) { - for (; from < to; from++, to--) { - TValue temp; - setobj(L, &temp, s2v(from)); - setobjs2s(L, from, to); - setobj2s(L, to, &temp); - } -} - - -/* -** Let x = AB, where A is a prefix of length 'n'. Then, -** rotate x n == BA. But BA == (A^r . B^r)^r. -*/ -LUA_API void lua_rotate (lua_State *L, int idx, int n) { - StkId p, t, m; - lua_lock(L); - t = L->top.p - 1; /* end of stack segment being rotated */ - p = index2stack(L, idx); /* start of segment */ - api_check(L, L->tbclist.p < p, "moving a to-be-closed slot"); - api_check(L, (n >= 0 ? n : -n) <= (t - p + 1), "invalid 'n'"); - m = (n >= 0 ? t - n : p - n - 1); /* end of prefix */ - reverse(L, p, m); /* reverse the prefix with length 'n' */ - reverse(L, m + 1, t); /* reverse the suffix */ - reverse(L, p, t); /* reverse the entire segment */ - lua_unlock(L); -} - - -LUA_API void lua_copy (lua_State *L, int fromidx, int toidx) { - TValue *fr, *to; - lua_lock(L); - fr = index2value(L, fromidx); - to = index2value(L, toidx); - api_check(L, isvalid(L, to), "invalid index"); - setobj(L, to, fr); - if (isupvalue(toidx)) /* function upvalue? */ - luaC_barrier(L, clCvalue(s2v(L->ci->func.p)), fr); - /* LUA_REGISTRYINDEX does not need gc barrier - (collector revisits it before finishing collection) */ - lua_unlock(L); -} - - -LUA_API void lua_pushvalue (lua_State *L, int idx) { - lua_lock(L); - setobj2s(L, L->top.p, index2value(L, idx)); - api_incr_top(L); - lua_unlock(L); -} - - - -/* -** access functions (stack -> C) -*/ - - -LUA_API int lua_type (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (isvalid(L, o) ? ttype(o) : LUA_TNONE); -} - - -LUA_API const char *lua_typename (lua_State *L, int t) { - UNUSED(L); - api_check(L, LUA_TNONE <= t && t < LUA_NUMTYPES, "invalid type"); - return ttypename(t); -} - - -LUA_API int lua_iscfunction (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttislcf(o) || (ttisCclosure(o))); -} - - -LUA_API int lua_isinteger (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return ttisinteger(o); -} - - -LUA_API int lua_isnumber (lua_State *L, int idx) { - lua_Number n; - const TValue *o = index2value(L, idx); - return tonumber(o, &n); -} - - -LUA_API int lua_isstring (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttisstring(o) || cvt2str(o)); -} - - -LUA_API int lua_isuserdata (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttisfulluserdata(o) || ttislightuserdata(o)); -} - - -LUA_API int lua_rawequal (lua_State *L, int index1, int index2) { - const TValue *o1 = index2value(L, index1); - const TValue *o2 = index2value(L, index2); - return (isvalid(L, o1) && isvalid(L, o2)) ? luaV_rawequalobj(o1, o2) : 0; -} - - -LUA_API void lua_arith (lua_State *L, int op) { - lua_lock(L); - if (op != LUA_OPUNM && op != LUA_OPBNOT) - api_checkpop(L, 2); /* all other operations expect two operands */ - else { /* for unary operations, add fake 2nd operand */ - api_checkpop(L, 1); - setobjs2s(L, L->top.p, L->top.p - 1); - api_incr_top(L); - } - /* first operand at top - 2, second at top - 1; result go to top - 2 */ - luaO_arith(L, op, s2v(L->top.p - 2), s2v(L->top.p - 1), L->top.p - 2); - L->top.p--; /* pop second operand */ - lua_unlock(L); -} - - -LUA_API int lua_compare (lua_State *L, int index1, int index2, int op) { - const TValue *o1; - const TValue *o2; - int i = 0; - lua_lock(L); /* may call tag method */ - o1 = index2value(L, index1); - o2 = index2value(L, index2); - if (isvalid(L, o1) && isvalid(L, o2)) { - switch (op) { - case LUA_OPEQ: i = luaV_equalobj(L, o1, o2); break; - case LUA_OPLT: i = luaV_lessthan(L, o1, o2); break; - case LUA_OPLE: i = luaV_lessequal(L, o1, o2); break; - default: api_check(L, 0, "invalid option"); - } - } - lua_unlock(L); - return i; -} - - -LUA_API size_t lua_stringtonumber (lua_State *L, const char *s) { - size_t sz = luaO_str2num(s, s2v(L->top.p)); - if (sz != 0) - api_incr_top(L); - return sz; -} - - -LUA_API lua_Number lua_tonumberx (lua_State *L, int idx, int *pisnum) { - lua_Number n = 0; - const TValue *o = index2value(L, idx); - int isnum = tonumber(o, &n); - if (pisnum) - *pisnum = isnum; - return n; -} - - -LUA_API lua_Integer lua_tointegerx (lua_State *L, int idx, int *pisnum) { - lua_Integer res = 0; - const TValue *o = index2value(L, idx); - int isnum = tointeger(o, &res); - if (pisnum) - *pisnum = isnum; - return res; -} - - -LUA_API int lua_toboolean (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return !l_isfalse(o); -} - - -LUA_API const char *lua_tolstring (lua_State *L, int idx, size_t *len) { - TValue *o; - lua_lock(L); - o = index2value(L, idx); - if (!ttisstring(o)) { - if (!cvt2str(o)) { /* not convertible? */ - if (len != NULL) *len = 0; - lua_unlock(L); - return NULL; - } - luaO_tostring(L, o); - luaC_checkGC(L); - o = index2value(L, idx); /* previous call may reallocate the stack */ - } - lua_unlock(L); - if (len != NULL) - return getlstr(tsvalue(o), *len); - else - return getstr(tsvalue(o)); -} - - -LUA_API lua_Unsigned lua_rawlen (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - switch (ttypetag(o)) { - case LUA_VSHRSTR: return tsvalue(o)->shrlen; - case LUA_VLNGSTR: return tsvalue(o)->u.lnglen; - case LUA_VUSERDATA: return uvalue(o)->len; - case LUA_VTABLE: return luaH_getn(hvalue(o)); - default: return 0; - } -} - - -LUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - if (ttislcf(o)) return fvalue(o); - else if (ttisCclosure(o)) - return clCvalue(o)->f; - else return NULL; /* not a C function */ -} - - -l_sinline void *touserdata (const TValue *o) { - switch (ttype(o)) { - case LUA_TUSERDATA: return getudatamem(uvalue(o)); - case LUA_TLIGHTUSERDATA: return pvalue(o); - default: return NULL; - } -} - - -LUA_API void *lua_touserdata (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return touserdata(o); -} - - -LUA_API lua_State *lua_tothread (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (!ttisthread(o)) ? NULL : thvalue(o); -} - - -/* -** Returns a pointer to the internal representation of an object. -** Note that ANSI C does not allow the conversion of a pointer to -** function to a 'void*', so the conversion here goes through -** a 'size_t'. (As the returned pointer is only informative, this -** conversion should not be a problem.) -*/ -LUA_API const void *lua_topointer (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - switch (ttypetag(o)) { - case LUA_VLCF: return cast_voidp(cast_sizet(fvalue(o))); - case LUA_VUSERDATA: case LUA_VLIGHTUSERDATA: - return touserdata(o); - default: { - if (iscollectable(o)) - return gcvalue(o); - else - return NULL; - } - } -} - - - -/* -** push functions (C -> stack) -*/ - - -LUA_API void lua_pushnil (lua_State *L) { - lua_lock(L); - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushnumber (lua_State *L, lua_Number n) { - lua_lock(L); - setfltvalue(s2v(L->top.p), n); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushinteger (lua_State *L, lua_Integer n) { - lua_lock(L); - setivalue(s2v(L->top.p), n); - api_incr_top(L); - lua_unlock(L); -} - - -/* -** Pushes on the stack a string with given length. Avoid using 's' when -** 'len' == 0 (as 's' can be NULL in that case), due to later use of -** 'memcmp' and 'memcpy'. -*/ -LUA_API const char *lua_pushlstring (lua_State *L, const char *s, size_t len) { - TString *ts; - lua_lock(L); - ts = (len == 0) ? luaS_new(L, "") : luaS_newlstr(L, s, len); - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - advancegc(L, len); - luaC_checkGC(L); - lua_unlock(L); - return getstr(ts); -} - - -LUA_API const char *lua_pushextlstring (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud) { - TString *ts; - lua_lock(L); - api_check(L, s[len] == '\0', "string not ending with zero"); - ts = luaS_newextlstr (L, s, len, falloc, ud); - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - if (falloc != NULL) /* non-static string? */ - advancegc(L, len); /* count its memory */ - luaC_checkGC(L); - lua_unlock(L); - return getstr(ts); -} - - -LUA_API const char *lua_pushstring (lua_State *L, const char *s) { - lua_lock(L); - if (s == NULL) - setnilvalue(s2v(L->top.p)); - else { - TString *ts; - ts = luaS_new(L, s); - setsvalue2s(L, L->top.p, ts); - s = getstr(ts); /* internal copy's address */ - } - api_incr_top(L); - luaC_checkGC(L); - lua_unlock(L); - return s; -} - - -LUA_API const char *lua_pushvfstring (lua_State *L, const char *fmt, - va_list argp) { - const char *ret; - lua_lock(L); - ret = luaO_pushvfstring(L, fmt, argp); - luaC_checkGC(L); - lua_unlock(L); - return ret; -} - - -LUA_API const char *lua_pushfstring (lua_State *L, const char *fmt, ...) { - const char *ret; - va_list argp; - lua_lock(L); - va_start(argp, fmt); - ret = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - luaC_checkGC(L); - lua_unlock(L); - return ret; -} - - -LUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) { - lua_lock(L); - if (n == 0) { - setfvalue(s2v(L->top.p), fn); - api_incr_top(L); - } - else { - int i; - CClosure *cl; - api_checkpop(L, n); - api_check(L, n <= MAXUPVAL, "upvalue index too large"); - cl = luaF_newCclosure(L, n); - cl->f = fn; - for (i = 0; i < n; i++) { - setobj2n(L, &cl->upvalue[i], s2v(L->top.p - n + i)); - /* does not need barrier because closure is white */ - lua_assert(iswhite(cl)); - } - L->top.p -= n; - setclCvalue(L, s2v(L->top.p), cl); - api_incr_top(L); - luaC_checkGC(L); - } - lua_unlock(L); -} - - -LUA_API void lua_pushboolean (lua_State *L, int b) { - lua_lock(L); - if (b) - setbtvalue(s2v(L->top.p)); - else - setbfvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushlightuserdata (lua_State *L, void *p) { - lua_lock(L); - setpvalue(s2v(L->top.p), p); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API int lua_pushthread (lua_State *L) { - lua_lock(L); - setthvalue(L, s2v(L->top.p), L); - api_incr_top(L); - lua_unlock(L); - return (G(L)->mainthread == L); -} - - - -/* -** get functions (Lua -> stack) -*/ - - -static int auxgetstr (lua_State *L, const TValue *t, const char *k) { - int tag; - TString *str = luaS_new(L, k); - luaV_fastget(t, str, s2v(L->top.p), luaH_getstr, tag); - if (!tagisempty(tag)) { - api_incr_top(L); - } - else { - setsvalue2s(L, L->top.p, str); - api_incr_top(L); - tag = luaV_finishget(L, t, s2v(L->top.p - 1), L->top.p - 1, tag); - } - lua_unlock(L); - return novariant(tag); -} - - -static void getGlobalTable (lua_State *L, TValue *gt) { - Table *registry = hvalue(&G(L)->l_registry); - int tag = luaH_getint(registry, LUA_RIDX_GLOBALS, gt); - (void)tag; /* avoid not-used warnings when checks are off */ - api_check(L, novariant(tag) == LUA_TTABLE, "global table must exist"); -} - - -LUA_API int lua_getglobal (lua_State *L, const char *name) { - TValue gt; - lua_lock(L); - getGlobalTable(L, >); - return auxgetstr(L, >, name); -} - - -LUA_API int lua_gettable (lua_State *L, int idx) { - int tag; - TValue *t; - lua_lock(L); - api_checkpop(L, 1); - t = index2value(L, idx); - luaV_fastget(t, s2v(L->top.p - 1), s2v(L->top.p - 1), luaH_get, tag); - if (tagisempty(tag)) - tag = luaV_finishget(L, t, s2v(L->top.p - 1), L->top.p - 1, tag); - lua_unlock(L); - return novariant(tag); -} - - -LUA_API int lua_getfield (lua_State *L, int idx, const char *k) { - lua_lock(L); - return auxgetstr(L, index2value(L, idx), k); -} - - -LUA_API int lua_geti (lua_State *L, int idx, lua_Integer n) { - TValue *t; - int tag; - lua_lock(L); - t = index2value(L, idx); - luaV_fastgeti(t, n, s2v(L->top.p), tag); - if (tagisempty(tag)) { - TValue key; - setivalue(&key, n); - tag = luaV_finishget(L, t, &key, L->top.p, tag); - } - api_incr_top(L); - lua_unlock(L); - return novariant(tag); -} - - -static int finishrawget (lua_State *L, int tag) { - if (tagisempty(tag)) /* avoid copying empty items to the stack */ - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); - return novariant(tag); -} - - -l_sinline Table *gettable (lua_State *L, int idx) { - TValue *t = index2value(L, idx); - api_check(L, ttistable(t), "table expected"); - return hvalue(t); -} - - -LUA_API int lua_rawget (lua_State *L, int idx) { - Table *t; - int tag; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - tag = luaH_get(t, s2v(L->top.p - 1), s2v(L->top.p - 1)); - L->top.p--; /* pop key */ - return finishrawget(L, tag); -} - - -LUA_API int lua_rawgeti (lua_State *L, int idx, lua_Integer n) { - Table *t; - int tag; - lua_lock(L); - t = gettable(L, idx); - luaH_fastgeti(t, n, s2v(L->top.p), tag); - return finishrawget(L, tag); -} - - -LUA_API int lua_rawgetp (lua_State *L, int idx, const void *p) { - Table *t; - TValue k; - lua_lock(L); - t = gettable(L, idx); - setpvalue(&k, cast_voidp(p)); - return finishrawget(L, luaH_get(t, &k, s2v(L->top.p))); -} - - -LUA_API void lua_createtable (lua_State *L, unsigned narray, unsigned nrec) { - Table *t; - lua_lock(L); - t = luaH_new(L); - sethvalue2s(L, L->top.p, t); - api_incr_top(L); - if (narray > 0 || nrec > 0) - luaH_resize(L, t, narray, nrec); - luaC_checkGC(L); - lua_unlock(L); -} - - -LUA_API int lua_getmetatable (lua_State *L, int objindex) { - const TValue *obj; - Table *mt; - int res = 0; - lua_lock(L); - obj = index2value(L, objindex); - switch (ttype(obj)) { - case LUA_TTABLE: - mt = hvalue(obj)->metatable; - break; - case LUA_TUSERDATA: - mt = uvalue(obj)->metatable; - break; - default: - mt = G(L)->mt[ttype(obj)]; - break; - } - if (mt != NULL) { - sethvalue2s(L, L->top.p, mt); - api_incr_top(L); - res = 1; - } - lua_unlock(L); - return res; -} - - -LUA_API int lua_getiuservalue (lua_State *L, int idx, int n) { - TValue *o; - int t; - lua_lock(L); - o = index2value(L, idx); - api_check(L, ttisfulluserdata(o), "full userdata expected"); - if (n <= 0 || n > uvalue(o)->nuvalue) { - setnilvalue(s2v(L->top.p)); - t = LUA_TNONE; - } - else { - setobj2s(L, L->top.p, &uvalue(o)->uv[n - 1].uv); - t = ttype(s2v(L->top.p)); - } - api_incr_top(L); - lua_unlock(L); - return t; -} - - -/* -** set functions (stack -> Lua) -*/ - -/* -** t[k] = value at the top of the stack (where 'k' is a string) -*/ -static void auxsetstr (lua_State *L, const TValue *t, const char *k) { - int hres; - TString *str = luaS_new(L, k); - api_checkpop(L, 1); - luaV_fastset(t, str, s2v(L->top.p - 1), hres, luaH_psetstr); - if (hres == HOK) { - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - L->top.p--; /* pop value */ - } - else { - setsvalue2s(L, L->top.p, str); /* push 'str' (to make it a TValue) */ - api_incr_top(L); - luaV_finishset(L, t, s2v(L->top.p - 1), s2v(L->top.p - 2), hres); - L->top.p -= 2; /* pop value and key */ - } - lua_unlock(L); /* lock done by caller */ -} - - -LUA_API void lua_setglobal (lua_State *L, const char *name) { - TValue gt; - lua_lock(L); /* unlock done in 'auxsetstr' */ - getGlobalTable(L, >); - auxsetstr(L, >, name); -} - - -LUA_API void lua_settable (lua_State *L, int idx) { - TValue *t; - int hres; - lua_lock(L); - api_checkpop(L, 2); - t = index2value(L, idx); - luaV_fastset(t, s2v(L->top.p - 2), s2v(L->top.p - 1), hres, luaH_pset); - if (hres == HOK) { - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - } - else - luaV_finishset(L, t, s2v(L->top.p - 2), s2v(L->top.p - 1), hres); - L->top.p -= 2; /* pop index and value */ - lua_unlock(L); -} - - -LUA_API void lua_setfield (lua_State *L, int idx, const char *k) { - lua_lock(L); /* unlock done in 'auxsetstr' */ - auxsetstr(L, index2value(L, idx), k); -} - - -LUA_API void lua_seti (lua_State *L, int idx, lua_Integer n) { - TValue *t; - int hres; - lua_lock(L); - api_checkpop(L, 1); - t = index2value(L, idx); - luaV_fastseti(t, n, s2v(L->top.p - 1), hres); - if (hres == HOK) - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - else { - TValue temp; - setivalue(&temp, n); - luaV_finishset(L, t, &temp, s2v(L->top.p - 1), hres); - } - L->top.p--; /* pop value */ - lua_unlock(L); -} - - -static void aux_rawset (lua_State *L, int idx, TValue *key, int n) { - Table *t; - lua_lock(L); - api_checkpop(L, n); - t = gettable(L, idx); - luaH_set(L, t, key, s2v(L->top.p - 1)); - invalidateTMcache(t); - luaC_barrierback(L, obj2gco(t), s2v(L->top.p - 1)); - L->top.p -= n; - lua_unlock(L); -} - - -LUA_API void lua_rawset (lua_State *L, int idx) { - aux_rawset(L, idx, s2v(L->top.p - 2), 2); -} - - -LUA_API void lua_rawsetp (lua_State *L, int idx, const void *p) { - TValue k; - setpvalue(&k, cast_voidp(p)); - aux_rawset(L, idx, &k, 1); -} - - -LUA_API void lua_rawseti (lua_State *L, int idx, lua_Integer n) { - Table *t; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - luaH_setint(L, t, n, s2v(L->top.p - 1)); - luaC_barrierback(L, obj2gco(t), s2v(L->top.p - 1)); - L->top.p--; - lua_unlock(L); -} - - -LUA_API int lua_setmetatable (lua_State *L, int objindex) { - TValue *obj; - Table *mt; - lua_lock(L); - api_checkpop(L, 1); - obj = index2value(L, objindex); - if (ttisnil(s2v(L->top.p - 1))) - mt = NULL; - else { - api_check(L, ttistable(s2v(L->top.p - 1)), "table expected"); - mt = hvalue(s2v(L->top.p - 1)); - } - switch (ttype(obj)) { - case LUA_TTABLE: { - hvalue(obj)->metatable = mt; - if (mt) { - luaC_objbarrier(L, gcvalue(obj), mt); - luaC_checkfinalizer(L, gcvalue(obj), mt); - } - break; - } - case LUA_TUSERDATA: { - uvalue(obj)->metatable = mt; - if (mt) { - luaC_objbarrier(L, uvalue(obj), mt); - luaC_checkfinalizer(L, gcvalue(obj), mt); - } - break; - } - default: { - G(L)->mt[ttype(obj)] = mt; - break; - } - } - L->top.p--; - lua_unlock(L); - return 1; -} - - -LUA_API int lua_setiuservalue (lua_State *L, int idx, int n) { - TValue *o; - int res; - lua_lock(L); - api_checkpop(L, 1); - o = index2value(L, idx); - api_check(L, ttisfulluserdata(o), "full userdata expected"); - if (!(cast_uint(n) - 1u < cast_uint(uvalue(o)->nuvalue))) - res = 0; /* 'n' not in [1, uvalue(o)->nuvalue] */ - else { - setobj(L, &uvalue(o)->uv[n - 1].uv, s2v(L->top.p - 1)); - luaC_barrierback(L, gcvalue(o), s2v(L->top.p - 1)); - res = 1; - } - L->top.p--; - lua_unlock(L); - return res; -} - - -/* -** 'load' and 'call' functions (run Lua code) -*/ - - -#define checkresults(L,na,nr) \ - api_check(L, (nr) == LUA_MULTRET \ - || (L->ci->top.p - L->top.p >= (nr) - (na)), \ - "results from function overflow current stack size") - - -LUA_API void lua_callk (lua_State *L, int nargs, int nresults, - lua_KContext ctx, lua_KFunction k) { - StkId func; - lua_lock(L); - api_check(L, k == NULL || !isLua(L->ci), - "cannot use continuations inside hooks"); - api_checkpop(L, nargs + 1); - api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); - checkresults(L, nargs, nresults); - func = L->top.p - (nargs+1); - if (k != NULL && yieldable(L)) { /* need to prepare continuation? */ - L->ci->u.c.k = k; /* save continuation */ - L->ci->u.c.ctx = ctx; /* save context */ - luaD_call(L, func, nresults); /* do the call */ - } - else /* no continuation or no yieldable */ - luaD_callnoyield(L, func, nresults); /* just do the call */ - adjustresults(L, nresults); - lua_unlock(L); -} - - - -/* -** Execute a protected call. -*/ -struct CallS { /* data to 'f_call' */ - StkId func; - int nresults; -}; - - -static void f_call (lua_State *L, void *ud) { - struct CallS *c = cast(struct CallS *, ud); - luaD_callnoyield(L, c->func, c->nresults); -} - - - -LUA_API int lua_pcallk (lua_State *L, int nargs, int nresults, int errfunc, - lua_KContext ctx, lua_KFunction k) { - struct CallS c; - int status; - ptrdiff_t func; - lua_lock(L); - api_check(L, k == NULL || !isLua(L->ci), - "cannot use continuations inside hooks"); - api_checkpop(L, nargs + 1); - api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); - checkresults(L, nargs, nresults); - if (errfunc == 0) - func = 0; - else { - StkId o = index2stack(L, errfunc); - api_check(L, ttisfunction(s2v(o)), "private_lua_error handler must be a function"); - func = savestack(L, o); - } - c.func = L->top.p - (nargs+1); /* function to be called */ - if (k == NULL || !yieldable(L)) { /* no continuation or no yieldable? */ - c.nresults = nresults; /* do a 'conventional' protected call */ - status = luaD_pcall(L, f_call, &c, savestack(L, c.func), func); - } - else { /* prepare continuation (call is already protected by 'resume') */ - CallInfo *ci = L->ci; - ci->u.c.k = k; /* save continuation */ - ci->u.c.ctx = ctx; /* save context */ - /* save information for error recovery */ - ci->u2.funcidx = cast_int(savestack(L, c.func)); - ci->u.c.old_errfunc = L->errfunc; - L->errfunc = func; - setoah(ci->callstatus, L->allowhook); /* save value of 'allowhook' */ - ci->callstatus |= CIST_YPCALL; /* function can do error recovery */ - luaD_call(L, c.func, nresults); /* do the call */ - ci->callstatus &= ~CIST_YPCALL; - L->errfunc = ci->u.c.old_errfunc; - status = LUA_OK; /* if it is here, there were no errors */ - } - adjustresults(L, nresults); - lua_unlock(L); - return status; -} - - -LUA_API int lua_load (lua_State *L, lua_Reader reader, void *data, - const char *chunkname, const char *mode) { - ZIO z; - int status; - lua_lock(L); - if (!chunkname) chunkname = "?"; - luaZ_init(L, &z, reader, data); - status = luaD_protectedparser(L, &z, chunkname, mode); - if (status == LUA_OK) { /* no errors? */ - LClosure *f = clLvalue(s2v(L->top.p - 1)); /* get new function */ - if (f->nupvalues >= 1) { /* does it have an upvalue? */ - /* get global table from registry */ - TValue gt; - getGlobalTable(L, >); - /* set global table as 1st upvalue of 'f' (may be LUA_ENV) */ - setobj(L, f->upvals[0]->v.p, >); - luaC_barrier(L, f->upvals[0], >); - } - } - lua_unlock(L); - return status; -} - - -/* -** Dump a Lua function, calling 'writer' to write its parts. Ensure -** the stack returns with its original size. -*/ -LUA_API int lua_dump (lua_State *L, lua_Writer writer, void *data, int strip) { - int status; - ptrdiff_t otop = savestack(L, L->top.p); /* original top */ - TValue *f = s2v(L->top.p - 1); /* function to be dumped */ - lua_lock(L); - api_checkpop(L, 1); - api_check(L, isLfunction(f), "Lua function expected"); - status = luaU_dump(L, clLvalue(f)->p, writer, data, strip); - L->top.p = restorestack(L, otop); /* restore top */ - lua_unlock(L); - return status; -} - - -LUA_API int lua_status (lua_State *L) { - return L->status; -} - - -/* -** Garbage-collection function -*/ -LUA_API int lua_gc (lua_State *L, int what, ...) { - va_list argp; - int res = 0; - global_State *g = G(L); - if (g->gcstp & (GCSTPGC | GCSTPCLS)) /* internal stop? */ - return -1; /* all options are invalid when stopped */ - lua_lock(L); - va_start(argp, what); - switch (what) { - case LUA_GCSTOP: { - g->gcstp = GCSTPUSR; /* stopped by the user */ - break; - } - case LUA_GCRESTART: { - luaE_setdebt(g, 0); - g->gcstp = 0; /* (other bits must be zero here) */ - break; - } - case LUA_GCCOLLECT: { - luaC_fullgc(L, 0); - break; - } - case LUA_GCCOUNT: { - /* GC values are expressed in Kbytes: #bytes/2^10 */ - res = cast_int(g->totalbytes >> 10); - break; - } - case LUA_GCCOUNTB: { - res = cast_int(g->totalbytes & 0x3ff); - break; - } - case LUA_GCSTEP: { - lu_byte oldstp = g->gcstp; - l_obj n = va_arg(argp, int); - int work = 0; /* true if GC did some work */ - g->gcstp = 0; /* allow GC to run (other bits must be zero here) */ - if (n <= 0) - n = g->GCdebt; /* force to run one basic step */ - luaE_setdebt(g, g->GCdebt - n); - luaC_condGC(L, (void)0, work = 1); - if (work && g->gcstate == GCSpause) /* end of cycle? */ - res = 1; /* signal it */ - g->gcstp = oldstp; /* restore previous state */ - break; - } - case LUA_GCISRUNNING: { - res = gcrunning(g); - break; - } - case LUA_GCGEN: { - res = (g->gckind == KGC_INC) ? LUA_GCINC : LUA_GCGEN; - luaC_changemode(L, KGC_GENMINOR); - break; - } - case LUA_GCINC: { - res = (g->gckind == KGC_INC) ? LUA_GCINC : LUA_GCGEN; - luaC_changemode(L, KGC_INC); - break; - } - case LUA_GCPARAM: { - int param = va_arg(argp, int); - int value = va_arg(argp, int); - api_check(L, 0 <= param && param < LUA_GCPN, "invalid parameter"); - res = cast_int(luaO_applyparam(g->gcparams[param], 100)); - if (value >= 0) - g->gcparams[param] = luaO_codeparam(value); - break; - } - default: res = -1; /* invalid option */ - } - va_end(argp); - lua_unlock(L); - return res; -} - - - -/* -** miscellaneous functions -*/ - - -LUA_API int lua_error (lua_State *L) { - TValue *errobj; - lua_lock(L); - errobj = s2v(L->top.p - 1); - api_checkpop(L, 1); - /* error object is the memory error message? */ - if (ttisshrstring(errobj) && eqshrstr(tsvalue(errobj), G(L)->memerrmsg)) - luaM_error(L); /* raise a memory error */ - else - luaG_errormsg(L); /* raise a regular error */ - /* code unreachable; will unlock when control actually leaves the kernel */ - return 0; /* to avoid warnings */ -} - - -LUA_API int lua_next (lua_State *L, int idx) { - Table *t; - int more; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - more = luaH_next(L, t, L->top.p - 1); - if (more) - api_incr_top(L); - else /* no more elements */ - L->top.p--; /* pop key */ - lua_unlock(L); - return more; -} - - -LUA_API void lua_toclose (lua_State *L, int idx) { - int nresults; - StkId o; - lua_lock(L); - o = index2stack(L, idx); - nresults = L->ci->nresults; - api_check(L, L->tbclist.p < o, "given index below or equal a marked one"); - luaF_newtbcupval(L, o); /* create new to-be-closed upvalue */ - if (!hastocloseCfunc(nresults)) /* function not marked yet? */ - L->ci->nresults = codeNresults(nresults); /* mark it */ - lua_assert(hastocloseCfunc(L->ci->nresults)); - lua_unlock(L); -} - - -LUA_API void lua_concat (lua_State *L, int n) { - lua_lock(L); - api_checknelems(L, n); - if (n > 0) { - luaV_concat(L, n); - luaC_checkGC(L); - } - else { /* nothing to concatenate */ - setsvalue2s(L, L->top.p, luaS_newlstr(L, "", 0)); /* push empty string */ - api_incr_top(L); - } - lua_unlock(L); -} - - -LUA_API void lua_len (lua_State *L, int idx) { - TValue *t; - lua_lock(L); - t = index2value(L, idx); - luaV_objlen(L, L->top.p, t); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API lua_Alloc lua_getallocf (lua_State *L, void **ud) { - lua_Alloc f; - lua_lock(L); - if (ud) *ud = G(L)->ud; - f = G(L)->frealloc; - lua_unlock(L); - return f; -} - - -LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud) { - lua_lock(L); - G(L)->ud = ud; - G(L)->frealloc = f; - lua_unlock(L); -} - - -void lua_setwarnf (lua_State *L, lua_WarnFunction f, void *ud) { - lua_lock(L); - G(L)->ud_warn = ud; - G(L)->warnf = f; - lua_unlock(L); -} - - -void lua_warning (lua_State *L, const char *msg, int tocont) { - lua_lock(L); - luaE_warning(L, msg, tocont); - lua_unlock(L); -} - - - -LUA_API void *lua_newuserdatauv (lua_State *L, size_t size, int nuvalue) { - Udata *u; - lua_lock(L); - api_check(L, 0 <= nuvalue && nuvalue < USHRT_MAX, "invalid value"); - u = luaS_newudata(L, size, nuvalue); - setuvalue(L, s2v(L->top.p), u); - api_incr_top(L); - advancegc(L, size); - luaC_checkGC(L); - lua_unlock(L); - return getudatamem(u); -} - - - -static const char *aux_upvalue (TValue *fi, int n, TValue **val, - GCObject **owner) { - switch (ttypetag(fi)) { - case LUA_VCCL: { /* C closure */ - CClosure *f = clCvalue(fi); - if (!(cast_uint(n) - 1u < cast_uint(f->nupvalues))) - return NULL; /* 'n' not in [1, f->nupvalues] */ - *val = &f->upvalue[n-1]; - if (owner) *owner = obj2gco(f); - return ""; - } - case LUA_VLCL: { /* Lua closure */ - LClosure *f = clLvalue(fi); - TString *name; - Proto *p = f->p; - if (!(cast_uint(n) - 1u < cast_uint(p->sizeupvalues))) - return NULL; /* 'n' not in [1, p->sizeupvalues] */ - *val = f->upvals[n-1]->v.p; - if (owner) *owner = obj2gco(f->upvals[n - 1]); - name = p->upvalues[n-1].name; - return (name == NULL) ? "(no name)" : getstr(name); - } - default: return NULL; /* not a closure */ - } -} - - -LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n) { - const char *name; - TValue *val = NULL; /* to avoid warnings */ - lua_lock(L); - name = aux_upvalue(index2value(L, funcindex), n, &val, NULL); - if (name) { - setobj2s(L, L->top.p, val); - api_incr_top(L); - } - lua_unlock(L); - return name; -} - - -LUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n) { - const char *name; - TValue *val = NULL; /* to avoid warnings */ - GCObject *owner = NULL; /* to avoid warnings */ - TValue *fi; - lua_lock(L); - fi = index2value(L, funcindex); - api_checknelems(L, 1); - name = aux_upvalue(fi, n, &val, &owner); - if (name) { - L->top.p--; - setobj(L, val, s2v(L->top.p)); - luaC_barrier(L, owner, val); - } - lua_unlock(L); - return name; -} - - -static UpVal **getupvalref (lua_State *L, int fidx, int n, LClosure **pf) { - static const UpVal *const nullup = NULL; - LClosure *f; - TValue *fi = index2value(L, fidx); - api_check(L, ttisLclosure(fi), "Lua function expected"); - f = clLvalue(fi); - if (pf) *pf = f; - if (1 <= n && n <= f->p->sizeupvalues) - return &f->upvals[n - 1]; /* get its upvalue pointer */ - else - return (UpVal**)&nullup; -} - - -LUA_API void *lua_upvalueid (lua_State *L, int fidx, int n) { - TValue *fi = index2value(L, fidx); - switch (ttypetag(fi)) { - case LUA_VLCL: { /* lua closure */ - return *getupvalref(L, fidx, n, NULL); - } - case LUA_VCCL: { /* C closure */ - CClosure *f = clCvalue(fi); - if (1 <= n && n <= f->nupvalues) - return &f->upvalue[n - 1]; - /* else */ - } /* FALLTHROUGH */ - case LUA_VLCF: - return NULL; /* light C functions have no upvalues */ - default: { - api_check(L, 0, "function expected"); - return NULL; - } - } -} - - -LUA_API void lua_upvaluejoin (lua_State *L, int fidx1, int n1, - int fidx2, int n2) { - LClosure *f1; - UpVal **up1 = getupvalref(L, fidx1, n1, &f1); - UpVal **up2 = getupvalref(L, fidx2, n2, NULL); - api_check(L, *up1 != NULL && *up2 != NULL, "invalid upvalue index"); - *up1 = *up2; - luaC_objbarrier(L, f1, *up1); -} - - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lapi.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lapi.h deleted file mode 100644 index 757bf3d..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lapi.h +++ /dev/null @@ -1,61 +0,0 @@ -/* -** $Id: lapi.h $ -** Auxiliary functions from Lua API -** See Copyright Notice in lua.h -*/ - -#ifndef lapi_h -#define lapi_h - - -#include "llimits.h" -#include "lstate.h" - - -/* Increments 'L->top.p', checking for stack overflows */ -#define api_incr_top(L) \ - (L->top.p++, api_check(L, L->top.p <= L->ci->top.p, "stack overflow")) - - -/* -** If a call returns too many multiple returns, the callee may not have -** stack space to accommodate all results. In this case, this macro -** increases its stack space ('L->ci->top.p'). -*/ -#define adjustresults(L,nres) \ - { if ((nres) <= LUA_MULTRET && L->ci->top.p < L->top.p) \ - L->ci->top.p = L->top.p; } - - -/* Ensure the stack has at least 'n' elements */ -#define api_checknelems(L,n) \ - api_check(L, (n) < (L->top.p - L->ci->func.p), \ - "not enough elements in the stack") - - -/* Ensure the stack has at least 'n' elements to be popped. (Some -** functions only update a slot after checking it for popping, but that -** is only an optimization for a pop followed by a push.) -*/ -#define api_checkpop(L,n) \ - api_check(L, (n) < L->top.p - L->ci->func.p && \ - L->tbclist.p < L->top.p - (n), \ - "not enough free elements in the stack") - - -/* -** To reduce the overhead of returning from C functions, the presence of -** to-be-closed variables in these functions is coded in the CallInfo's -** field 'nresults', in a way that functions with no to-be-closed variables -** with zero, one, or "all" wanted results have no overhead. Functions -** with other number of wanted results, as well as functions with -** variables to be closed, have an extra check. -*/ - -#define hastocloseCfunc(n) ((n) < LUA_MULTRET) - -/* Map [-1, inf) (range of 'nresults') into (-inf, -2] */ -#define codeNresults(n) (-(n) - 3) -#define decodeNresults(n) (-(n) - 3) - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lauxlib.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lauxlib.c deleted file mode 100644 index 45d033b..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lauxlib.c +++ /dev/null @@ -1,1184 +0,0 @@ -/* -** $Id: lauxlib.c $ -** Auxiliary functions for building Lua libraries -** See Copyright Notice in lua.h -*/ - -#define lauxlib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include - - -/* -** This file uses only the official API of Lua. -** Any function declared here could be written as an application function. -*/ - -#include "lua.h" - -#include "lauxlib.h" - - -#if !defined(MAX_SIZET) -/* maximum value for size_t */ -#define MAX_SIZET ((size_t)(~(size_t)0)) -#endif - - -/* -** {====================================================== -** Traceback -** ======================================================= -*/ - - -#define LEVELS1 10 /* size of the first part of the stack */ -#define LEVELS2 11 /* size of the second part of the stack */ - - - -/* -** Search for 'objidx' in table at index -1. ('objidx' must be an -** absolute index.) Return 1 + string at top if it found a good name. -*/ -static int findfield (lua_State *L, int objidx, int level) { - if (level == 0 || !lua_istable(L, -1)) - return 0; /* not found */ - lua_pushnil(L); /* start 'next' loop */ - while (lua_next(L, -2)) { /* for each pair in table */ - if (lua_type(L, -2) == LUA_TSTRING) { /* ignore non-string keys */ - if (lua_rawequal(L, objidx, -1)) { /* found object? */ - lua_pop(L, 1); /* remove value (but keep name) */ - return 1; - } - else if (findfield(L, objidx, level - 1)) { /* try recursively */ - /* stack: lib_name, lib_table, field_name (top) */ - lua_pushliteral(L, "."); /* place '.' between the two names */ - lua_replace(L, -3); /* (in the slot occupied by table) */ - lua_concat(L, 3); /* lib_name.field_name */ - return 1; - } - } - lua_pop(L, 1); /* remove value */ - } - return 0; /* not found */ -} - - -/* -** Search for a name for a function in all loaded modules -*/ -static int pushglobalfuncname (lua_State *L, lua_Debug *ar) { - int top = lua_gettop(L); - lua_getinfo(L, "f", ar); /* push function */ - lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - if (findfield(L, top + 1, 2)) { - const char *name = lua_tostring(L, -1); - if (strncmp(name, LUA_GNAME ".", 3) == 0) { /* name start with '_G.'? */ - lua_pushstring(L, name + 3); /* push name without prefix */ - lua_remove(L, -2); /* remove original name */ - } - lua_copy(L, -1, top + 1); /* copy name to proper place */ - lua_settop(L, top + 1); /* remove table "loaded" and name copy */ - return 1; - } - else { - lua_settop(L, top); /* remove function and global table */ - return 0; - } -} - - -static void pushfuncname (lua_State *L, lua_Debug *ar) { - if (pushglobalfuncname(L, ar)) { /* try first a global name */ - lua_pushfstring(L, "function '%s'", lua_tostring(L, -1)); - lua_remove(L, -2); /* remove name */ - } - else if (*ar->namewhat != '\0') /* is there a name from code? */ - lua_pushfstring(L, "%s '%s'", ar->namewhat, ar->name); /* use it */ - else if (*ar->what == 'm') /* main? */ - lua_pushliteral(L, "main chunk"); - else if (*ar->what != 'C') /* for Lua functions, use */ - lua_pushfstring(L, "function <%s:%d>", ar->short_src, ar->linedefined); - else /* nothing left... */ - lua_pushliteral(L, "?"); -} - - -static int lastlevel (lua_State *L) { - lua_Debug ar; - int li = 1, le = 1; - /* find an upper bound */ - while (lua_getstack(L, le, &ar)) { li = le; le *= 2; } - /* do a binary search */ - while (li < le) { - int m = (li + le)/2; - if (lua_getstack(L, m, &ar)) li = m + 1; - else le = m; - } - return le - 1; -} - - -LUALIB_API void luaL_traceback (lua_State *L, lua_State *L1, - const char *msg, int level) { - luaL_Buffer b; - lua_Debug ar; - int last = lastlevel(L1); - int limit2show = (last - level > LEVELS1 + LEVELS2) ? LEVELS1 : -1; - luaL_buffinit(L, &b); - if (msg) { - luaL_addstring(&b, msg); - luaL_addchar(&b, '\n'); - } - luaL_addstring(&b, "stack traceback:"); - while (lua_getstack(L1, level++, &ar)) { - if (limit2show-- == 0) { /* too many levels? */ - int n = last - level - LEVELS2 + 1; /* number of levels to skip */ - lua_pushfstring(L, "\n\t...\t(skipping %d levels)", n); - luaL_addvalue(&b); /* add warning about skip */ - level += n; /* and skip to last levels */ - } - else { - lua_getinfo(L1, "Slnt", &ar); - if (ar.currentline <= 0) - lua_pushfstring(L, "\n\t%s: in ", ar.short_src); - else - lua_pushfstring(L, "\n\t%s:%d: in ", ar.short_src, ar.currentline); - luaL_addvalue(&b); - pushfuncname(L, &ar); - luaL_addvalue(&b); - if (ar.istailcall) - luaL_addstring(&b, "\n\t(...tail calls...)"); - } - } - luaL_pushresult(&b); -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Error-report functions -** ======================================================= -*/ - -LUALIB_API int luaL_argerror (lua_State *L, int arg, const char *extramsg) { - lua_Debug ar; - if (!lua_getstack(L, 0, &ar)) /* no stack frame? */ - return luaL_error(L, "bad argument #%d (%s)", arg, extramsg); - lua_getinfo(L, "n", &ar); - if (strcmp(ar.namewhat, "method") == 0) { - arg--; /* do not count 'self' */ - if (arg == 0) /* error is in the self argument itself? */ - return luaL_error(L, "calling '%s' on bad self (%s)", - ar.name, extramsg); - } - if (ar.name == NULL) - ar.name = (pushglobalfuncname(L, &ar)) ? lua_tostring(L, -1) : "?"; - return luaL_error(L, "bad argument #%d to '%s' (%s)", - arg, ar.name, extramsg); -} - - -LUALIB_API int luaL_typeerror (lua_State *L, int arg, const char *tname) { - const char *msg; - const char *typearg; /* name for the type of the actual argument */ - if (luaL_getmetafield(L, arg, "__name") == LUA_TSTRING) - typearg = lua_tostring(L, -1); /* use the given type name */ - else if (lua_type(L, arg) == LUA_TLIGHTUSERDATA) - typearg = "light userdata"; /* special name for messages */ - else - typearg = luaL_typename(L, arg); /* standard name */ - msg = lua_pushfstring(L, "%s expected, got %s", tname, typearg); - return luaL_argerror(L, arg, msg); -} - - -static void tag_error (lua_State *L, int arg, int tag) { - luaL_typeerror(L, arg, lua_typename(L, tag)); -} - - -/* -** The use of 'lua_pushfstring' ensures this function does not -** need reserved stack space when called. -*/ -LUALIB_API void luaL_where (lua_State *L, int level) { - lua_Debug ar; - if (lua_getstack(L, level, &ar)) { /* check function at level */ - lua_getinfo(L, "Sl", &ar); /* get info about it */ - if (ar.currentline > 0) { /* is there info? */ - lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline); - return; - } - } - lua_pushfstring(L, ""); /* else, no information available... */ -} - - -/* -** Again, the use of 'lua_pushvfstring' ensures this function does -** not need reserved stack space when called. (At worst, it generates -** an error with "stack overflow" instead of the given message.) -*/ -LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) { - va_list argp; - va_start(argp, fmt); - luaL_where(L, 1); - lua_pushvfstring(L, fmt, argp); - va_end(argp); - lua_concat(L, 2); - return lua_error(L); -} - - -LUALIB_API int luaL_fileresult (lua_State *L, int stat, const char *fname) { - int en = errno; /* calls to Lua API may change this value */ - if (stat) { - lua_pushboolean(L, 1); - return 1; - } - else { - luaL_pushfail(L); - if (fname) - lua_pushfstring(L, "%s: %s", fname, strerror(en)); - else - lua_pushstring(L, strerror(en)); - lua_pushinteger(L, en); - return 3; - } -} - - -#if !defined(l_inspectstat) /* { */ - -#if defined(LUA_USE_POSIX) - -#include - -/* -** use appropriate macros to interpret 'pclose' return status -*/ -#define l_inspectstat(stat,what) \ - if (WIFEXITED(stat)) { stat = WEXITSTATUS(stat); } \ - else if (WIFSIGNALED(stat)) { stat = WTERMSIG(stat); what = "signal"; } - -#else - -#define l_inspectstat(stat,what) /* no op */ - -#endif - -#endif /* } */ - - -LUALIB_API int luaL_execresult (lua_State *L, int stat) { - if (stat != 0 && errno != 0) /* error with an 'errno'? */ - return luaL_fileresult(L, 0, NULL); - else { - const char *what = "exit"; /* type of termination */ - l_inspectstat(stat, what); /* interpret result */ - if (*what == 'e' && stat == 0) /* successful termination? */ - lua_pushboolean(L, 1); - else - luaL_pushfail(L); - lua_pushstring(L, what); - lua_pushinteger(L, stat); - return 3; /* return true/fail,what,code */ - } -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Userdata's metatable manipulation -** ======================================================= -*/ - -LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) { - if (luaL_getmetatable(L, tname) != LUA_TNIL) /* name already in use? */ - return 0; /* leave previous value on top, but return 0 */ - lua_pop(L, 1); - lua_createtable(L, 0, 2); /* create metatable */ - lua_pushstring(L, tname); - lua_setfield(L, -2, "__name"); /* metatable.__name = tname */ - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, tname); /* registry.name = metatable */ - return 1; -} - - -LUALIB_API void luaL_setmetatable (lua_State *L, const char *tname) { - luaL_getmetatable(L, tname); - lua_setmetatable(L, -2); -} - - -LUALIB_API void *luaL_testudata (lua_State *L, int ud, const char *tname) { - void *p = lua_touserdata(L, ud); - if (p != NULL) { /* value is a userdata? */ - if (lua_getmetatable(L, ud)) { /* does it have a metatable? */ - luaL_getmetatable(L, tname); /* get correct metatable */ - if (!lua_rawequal(L, -1, -2)) /* not the same? */ - p = NULL; /* value is a userdata with wrong metatable */ - lua_pop(L, 2); /* remove both metatables */ - return p; - } - } - return NULL; /* value is not a userdata with a metatable */ -} - - -LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) { - void *p = luaL_testudata(L, ud, tname); - luaL_argexpected(L, p != NULL, ud, tname); - return p; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Argument check functions -** ======================================================= -*/ - -LUALIB_API int luaL_checkoption (lua_State *L, int arg, const char *def, - const char *const lst[]) { - const char *name = (def) ? luaL_optstring(L, arg, def) : - luaL_checkstring(L, arg); - int i; - for (i=0; lst[i]; i++) - if (strcmp(lst[i], name) == 0) - return i; - return luaL_argerror(L, arg, - lua_pushfstring(L, "invalid option '%s'", name)); -} - - -/* -** Ensures the stack has at least 'space' extra slots, raising an error -** if it cannot fulfill the request. (The error handling needs a few -** extra slots to format the error message. In case of an error without -** this extra space, Lua will generate the same 'stack overflow' error, -** but without 'msg'.) -*/ -LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *msg) { - if (l_unlikely(!lua_checkstack(L, space))) { - if (msg) - luaL_error(L, "stack overflow (%s)", msg); - else - luaL_error(L, "stack overflow"); - } -} - - -LUALIB_API void luaL_checktype (lua_State *L, int arg, int t) { - if (l_unlikely(lua_type(L, arg) != t)) - tag_error(L, arg, t); -} - - -LUALIB_API void luaL_checkany (lua_State *L, int arg) { - if (l_unlikely(lua_type(L, arg) == LUA_TNONE)) - luaL_argerror(L, arg, "value expected"); -} - - -LUALIB_API const char *luaL_checklstring (lua_State *L, int arg, size_t *len) { - const char *s = lua_tolstring(L, arg, len); - if (l_unlikely(!s)) tag_error(L, arg, LUA_TSTRING); - return s; -} - - -LUALIB_API const char *luaL_optlstring (lua_State *L, int arg, - const char *def, size_t *len) { - if (lua_isnoneornil(L, arg)) { - if (len) - *len = (def ? strlen(def) : 0); - return def; - } - else return luaL_checklstring(L, arg, len); -} - - -LUALIB_API lua_Number luaL_checknumber (lua_State *L, int arg) { - int isnum; - lua_Number d = lua_tonumberx(L, arg, &isnum); - if (l_unlikely(!isnum)) - tag_error(L, arg, LUA_TNUMBER); - return d; -} - - -LUALIB_API lua_Number luaL_optnumber (lua_State *L, int arg, lua_Number def) { - return luaL_opt(L, luaL_checknumber, arg, def); -} - - -static void interror (lua_State *L, int arg) { - if (lua_isnumber(L, arg)) - luaL_argerror(L, arg, "number has no integer representation"); - else - tag_error(L, arg, LUA_TNUMBER); -} - - -LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int arg) { - int isnum; - lua_Integer d = lua_tointegerx(L, arg, &isnum); - if (l_unlikely(!isnum)) { - interror(L, arg); - } - return d; -} - - -LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int arg, - lua_Integer def) { - return luaL_opt(L, luaL_checkinteger, arg, def); -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Generic Buffer manipulation -** ======================================================= -*/ - -/* userdata to box arbitrary data */ -typedef struct UBox { - void *box; - size_t bsize; -} UBox; - - -/* Resize the buffer used by a box. Optimize for the common case of -** resizing to the old size. (For instance, __gc will resize the box -** to 0 even after it was closed. 'pushresult' may also resize it to a -** final size that is equal to the one set when the buffer was created.) -*/ -static void *resizebox (lua_State *L, int idx, size_t newsize) { - UBox *box = (UBox *)lua_touserdata(L, idx); - if (box->bsize == newsize) /* not changing size? */ - return box->box; /* keep the buffer */ - else { - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); - void *temp = allocf(ud, box->box, box->bsize, newsize); - if (l_unlikely(temp == NULL && newsize > 0)) { /* allocation error? */ - lua_pushliteral(L, "not enough memory"); - lua_error(L); /* raise a memory error */ - } - box->box = temp; - box->bsize = newsize; - return temp; - } -} - - -static int boxgc (lua_State *L) { - resizebox(L, 1, 0); - return 0; -} - - -static const luaL_Reg boxmt[] = { /* box metamethods */ - {"__gc", boxgc}, - {"__close", boxgc}, - {NULL, NULL} -}; - - -static void newbox (lua_State *L) { - UBox *box = (UBox *)lua_newuserdatauv(L, sizeof(UBox), 0); - box->box = NULL; - box->bsize = 0; - if (luaL_newmetatable(L, "_UBOX*")) /* creating metatable? */ - luaL_setfuncs(L, boxmt, 0); /* set its metamethods */ - lua_setmetatable(L, -2); -} - - -/* -** check whether buffer is using a userdata on the stack as a temporary -** buffer -*/ -#define buffonstack(B) ((B)->b != (B)->init.b) - - -/* -** Whenever buffer is accessed, slot 'idx' must either be a box (which -** cannot be NULL) or it is a placeholder for the buffer. -*/ -#define checkbufferlevel(B,idx) \ - lua_assert(buffonstack(B) ? lua_touserdata(B->L, idx) != NULL \ - : lua_touserdata(B->L, idx) == (void*)B) - - -/* -** Compute new size for buffer 'B', enough to accommodate extra 'sz' -** bytes plus one for a terminating zero. (The test for "not big enough" -** also gets the case when the computation of 'newsize' overflows.) -*/ -static size_t newbuffsize (luaL_Buffer *B, size_t sz) { - size_t newsize = (B->size / 2) * 3; /* buffer size * 1.5 */ - if (l_unlikely(MAX_SIZET - sz - 1 < B->n)) /* overflow in (B->n + sz + 1)? */ - return luaL_error(B->L, "buffer too large"); - if (newsize < B->n + sz + 1) /* not big enough? */ - newsize = B->n + sz + 1; - return newsize; -} - - -/* -** Returns a pointer to a free area with at least 'sz' bytes in buffer -** 'B'. 'boxidx' is the relative position in the stack where is the -** buffer's box or its placeholder. -*/ -static char *prepbuffsize (luaL_Buffer *B, size_t sz, int boxidx) { - checkbufferlevel(B, boxidx); - if (B->size - B->n >= sz) /* enough space? */ - return B->b + B->n; - else { - lua_State *L = B->L; - char *newbuff; - size_t newsize = newbuffsize(B, sz); - /* create larger buffer */ - if (buffonstack(B)) /* buffer already has a box? */ - newbuff = (char *)resizebox(L, boxidx, newsize); /* resize it */ - else { /* no box yet */ - lua_remove(L, boxidx); /* remove placeholder */ - newbox(L); /* create a new box */ - lua_insert(L, boxidx); /* move box to its intended position */ - lua_toclose(L, boxidx); - newbuff = (char *)resizebox(L, boxidx, newsize); - memcpy(newbuff, B->b, B->n * sizeof(char)); /* copy original content */ - } - B->b = newbuff; - B->size = newsize; - return newbuff + B->n; - } -} - -/* -** returns a pointer to a free area with at least 'sz' bytes -*/ -LUALIB_API char *luaL_prepbuffsize (luaL_Buffer *B, size_t sz) { - return prepbuffsize(B, sz, -1); -} - - -LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) { - if (l > 0) { /* avoid 'memcpy' when 's' can be NULL */ - char *b = prepbuffsize(B, l, -1); - memcpy(b, s, l * sizeof(char)); - luaL_addsize(B, l); - } -} - - -LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) { - luaL_addlstring(B, s, strlen(s)); -} - - -LUALIB_API void luaL_pushresult (luaL_Buffer *B) { - lua_State *L = B->L; - checkbufferlevel(B, -1); - if (!buffonstack(B)) /* using static buffer? */ - lua_pushlstring(L, B->b, B->n); /* save result as regular string */ - else { /* reuse buffer already allocated */ - UBox *box = (UBox *)lua_touserdata(L, -1); - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); /* function to free buffer */ - size_t len = B->n; /* final string length */ - char *s; - resizebox(L, -1, len + 1); /* adjust box size to content size */ - s = (char*)box->box; /* final buffer address */ - s[len] = '\0'; /* add ending zero */ - /* clear box, as 'lua_pushextlstring' will take control over buffer */ - box->bsize = 0; box->box = NULL; - lua_pushextlstring(L, s, len, allocf, ud); - lua_closeslot(L, -2); /* close the box */ - } - lua_remove(L, -2); /* remove box or placeholder from the stack */ -} - - -LUALIB_API void luaL_pushresultsize (luaL_Buffer *B, size_t sz) { - luaL_addsize(B, sz); - luaL_pushresult(B); -} - - -/* -** 'luaL_addvalue' is the only function in the Buffer system where the -** box (if existent) is not on the top of the stack. So, instead of -** calling 'luaL_addlstring', it replicates the code using -2 as the -** last argument to 'prepbuffsize', signaling that the box is (or will -** be) below the string being added to the buffer. (Box creation can -** trigger an emergency GC, so we should not remove the string from the -** stack before we have the space guaranteed.) -*/ -LUALIB_API void luaL_addvalue (luaL_Buffer *B) { - lua_State *L = B->L; - size_t len; - const char *s = lua_tolstring(L, -1, &len); - char *b = prepbuffsize(B, len, -2); - memcpy(b, s, len * sizeof(char)); - luaL_addsize(B, len); - lua_pop(L, 1); /* pop string */ -} - - -LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) { - B->L = L; - B->b = B->init.b; - B->n = 0; - B->size = LUAL_BUFFERSIZE; - lua_pushlightuserdata(L, (void*)B); /* push placeholder */ -} - - -LUALIB_API char *luaL_buffinitsize (lua_State *L, luaL_Buffer *B, size_t sz) { - luaL_buffinit(L, B); - return prepbuffsize(B, sz, -1); -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Reference system -** ======================================================= -*/ - -/* -** The previously freed references form a linked list: t[1] is the index -** of a first free index, t[t[1]] is the index of the second element, -** etc. A zero signals the end of the list. -*/ -LUALIB_API int luaL_ref (lua_State *L, int t) { - int ref; - if (lua_isnil(L, -1)) { - lua_pop(L, 1); /* remove from stack */ - return LUA_REFNIL; /* 'nil' has a unique fixed reference */ - } - t = lua_absindex(L, t); - if (lua_rawgeti(L, t, 1) == LUA_TNUMBER) /* already initialized? */ - ref = (int)lua_tointeger(L, -1); /* ref = t[1] */ - else { /* first access */ - lua_assert(!lua_toboolean(L, -1)); /* must be nil or false */ - ref = 0; /* list is empty */ - lua_pushinteger(L, 0); /* initialize as an empty list */ - lua_rawseti(L, t, 1); /* ref = t[1] = 0 */ - } - lua_pop(L, 1); /* remove element from stack */ - if (ref != 0) { /* any free element? */ - lua_rawgeti(L, t, ref); /* remove it from list */ - lua_rawseti(L, t, 1); /* (t[1] = t[ref]) */ - } - else /* no free elements */ - ref = (int)lua_rawlen(L, t) + 1; /* get a new reference */ - lua_rawseti(L, t, ref); - return ref; -} - - -LUALIB_API void luaL_unref (lua_State *L, int t, int ref) { - if (ref >= 0) { - t = lua_absindex(L, t); - lua_rawgeti(L, t, 1); - lua_assert(lua_isinteger(L, -1)); - lua_rawseti(L, t, ref); /* t[ref] = t[1] */ - lua_pushinteger(L, ref); - lua_rawseti(L, t, 1); /* t[1] = ref */ - } -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Load functions -** ======================================================= -*/ - -typedef struct LoadF { - int n; /* number of pre-read characters */ - FILE *f; /* file being read */ - char buff[BUFSIZ]; /* area for reading file */ -} LoadF; - - -static const char *getF (lua_State *L, void *ud, size_t *size) { - LoadF *lf = (LoadF *)ud; - (void)L; /* not used */ - if (lf->n > 0) { /* are there pre-read characters to be read? */ - *size = lf->n; /* return them (chars already in buffer) */ - lf->n = 0; /* no more pre-read characters */ - } - else { /* read a block from file */ - /* 'fread' can return > 0 *and* set the EOF flag. If next call to - 'getF' called 'fread', it might still wait for user input. - The next check avoids this problem. */ - if (feof(lf->f)) return NULL; - *size = fread(lf->buff, 1, sizeof(lf->buff), lf->f); /* read block */ - } - return lf->buff; -} - - -static int errfile (lua_State *L, const char *what, int fnameindex) { - const char *serr = strerror(errno); - const char *filename = lua_tostring(L, fnameindex) + 1; - lua_pushfstring(L, "cannot %s %s: %s", what, filename, serr); - lua_remove(L, fnameindex); - return LUA_ERRFILE; -} - - -/* -** Skip an optional BOM at the start of a stream. If there is an -** incomplete BOM (the first character is correct but the rest is -** not), returns the first character anyway to force an error -** (as no chunk can start with 0xEF). -*/ -static int skipBOM (FILE *f) { - int c = getc(f); /* read first character */ - if (c == 0xEF && getc(f) == 0xBB && getc(f) == 0xBF) /* correct BOM? */ - return getc(f); /* ignore BOM and return next char */ - else /* no (valid) BOM */ - return c; /* return first character */ -} - - -/* -** reads the first character of file 'f' and skips an optional BOM mark -** in its beginning plus its first line if it starts with '#'. Returns -** true if it skipped the first line. In any case, '*cp' has the -** first "valid" character of the file (after the optional BOM and -** a first-line comment). -*/ -static int skipcomment (FILE *f, int *cp) { - int c = *cp = skipBOM(f); - if (c == '#') { /* first line is a comment (Unix exec. file)? */ - do { /* skip first line */ - c = getc(f); - } while (c != EOF && c != '\n'); - *cp = getc(f); /* next character after comment, if present */ - return 1; /* there was a comment */ - } - else return 0; /* no comment */ -} - - -LUALIB_API int luaL_loadfilex (lua_State *L, const char *filename, - const char *mode) { - LoadF lf; - int status, readstatus; - int c; - int fnameindex = lua_gettop(L) + 1; /* index of filename on the stack */ - if (filename == NULL) { - lua_pushliteral(L, "=stdin"); - lf.f = stdin; - } - else { - lua_pushfstring(L, "@%s", filename); - lf.f = fopen(filename, "r"); - if (lf.f == NULL) return errfile(L, "open", fnameindex); - } - lf.n = 0; - if (skipcomment(lf.f, &c)) /* read initial portion */ - lf.buff[lf.n++] = '\n'; /* add newline to correct line numbers */ - if (c == LUA_SIGNATURE[0]) { /* binary file? */ - lf.n = 0; /* remove possible newline */ - if (filename) { /* "real" file? */ - lf.f = freopen(filename, "rb", lf.f); /* reopen in binary mode */ - if (lf.f == NULL) return errfile(L, "reopen", fnameindex); - skipcomment(lf.f, &c); /* re-read initial portion */ - } - } - if (c != EOF) - lf.buff[lf.n++] = c; /* 'c' is the first character of the stream */ - status = lua_load(L, getF, &lf, lua_tostring(L, -1), mode); - readstatus = ferror(lf.f); - if (filename) fclose(lf.f); /* close file (even in case of errors) */ - if (readstatus) { - lua_settop(L, fnameindex); /* ignore results from 'lua_load' */ - return errfile(L, "read", fnameindex); - } - lua_remove(L, fnameindex); - return status; -} - - -typedef struct LoadS { - const char *s; - size_t size; -} LoadS; - - -static const char *getS (lua_State *L, void *ud, size_t *size) { - LoadS *ls = (LoadS *)ud; - (void)L; /* not used */ - if (ls->size == 0) return NULL; - *size = ls->size; - ls->size = 0; - return ls->s; -} - - -LUALIB_API int luaL_loadbufferx (lua_State *L, const char *buff, size_t size, - const char *name, const char *mode) { - LoadS ls; - ls.s = buff; - ls.size = size; - return lua_load(L, getS, &ls, name, mode); -} - - -LUALIB_API int luaL_loadstring (lua_State *L, const char *s) { - return luaL_loadbuffer(L, s, strlen(s), s); -} - -/* }====================================================== */ - - - -LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) { - if (!lua_getmetatable(L, obj)) /* no metatable? */ - return LUA_TNIL; - else { - int tt; - lua_pushstring(L, event); - tt = lua_rawget(L, -2); - if (tt == LUA_TNIL) /* is metafield nil? */ - lua_pop(L, 2); /* remove metatable and metafield */ - else - lua_remove(L, -2); /* remove only metatable */ - return tt; /* return metafield type */ - } -} - - -LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) { - obj = lua_absindex(L, obj); - if (luaL_getmetafield(L, obj, event) == LUA_TNIL) /* no metafield? */ - return 0; - lua_pushvalue(L, obj); - lua_call(L, 1, 1); - return 1; -} - - -LUALIB_API lua_Integer luaL_len (lua_State *L, int idx) { - lua_Integer l; - int isnum; - lua_len(L, idx); - l = lua_tointegerx(L, -1, &isnum); - if (l_unlikely(!isnum)) - luaL_error(L, "object length is not an integer"); - lua_pop(L, 1); /* remove object */ - return l; -} - - -LUALIB_API const char *luaL_tolstring (lua_State *L, int idx, size_t *len) { - idx = lua_absindex(L,idx); - if (luaL_callmeta(L, idx, "__tostring")) { /* metafield? */ - if (!lua_isstring(L, -1)) - luaL_error(L, "'__tostring' must return a string"); - } - else { - switch (lua_type(L, idx)) { - case LUA_TNUMBER: { - if (lua_isinteger(L, idx)) - lua_pushfstring(L, "%I", (LUAI_UACINT)lua_tointeger(L, idx)); - else - lua_pushfstring(L, "%f", (LUAI_UACNUMBER)lua_tonumber(L, idx)); - break; - } - case LUA_TSTRING: - lua_pushvalue(L, idx); - break; - case LUA_TBOOLEAN: - lua_pushstring(L, (lua_toboolean(L, idx) ? "true" : "false")); - break; - case LUA_TNIL: - lua_pushliteral(L, "nil"); - break; - default: { - int tt = luaL_getmetafield(L, idx, "__name"); /* try name */ - const char *kind = (tt == LUA_TSTRING) ? lua_tostring(L, -1) : - luaL_typename(L, idx); - lua_pushfstring(L, "%s: %p", kind, lua_topointer(L, idx)); - if (tt != LUA_TNIL) - lua_remove(L, -2); /* remove '__name' */ - break; - } - } - } - return lua_tolstring(L, -1, len); -} - - -/* -** set functions from list 'l' into table at top - 'nup'; each -** function gets the 'nup' elements at the top as upvalues. -** Returns with only the table at the stack. -*/ -LUALIB_API void luaL_setfuncs (lua_State *L, const luaL_Reg *l, int nup) { - luaL_checkstack(L, nup, "too many upvalues"); - for (; l->name != NULL; l++) { /* fill the table with given functions */ - if (l->func == NULL) /* place holder? */ - lua_pushboolean(L, 0); - else { - int i; - for (i = 0; i < nup; i++) /* copy upvalues to the top */ - lua_pushvalue(L, -nup); - lua_pushcclosure(L, l->func, nup); /* closure with those upvalues */ - } - lua_setfield(L, -(nup + 2), l->name); - } - lua_pop(L, nup); /* remove upvalues */ -} - - -/* -** ensure that stack[idx][fname] has a table and push that table -** into the stack -*/ -LUALIB_API int luaL_getsubtable (lua_State *L, int idx, const char *fname) { - if (lua_getfield(L, idx, fname) == LUA_TTABLE) - return 1; /* table already there */ - else { - lua_pop(L, 1); /* remove previous result */ - idx = lua_absindex(L, idx); - lua_newtable(L); - lua_pushvalue(L, -1); /* copy to be left at top */ - lua_setfield(L, idx, fname); /* assign new table to field */ - return 0; /* false, because did not find table there */ - } -} - - -/* -** Stripped-down 'require': After checking "loaded" table, calls 'openf' -** to open a module, registers the result in 'package.loaded' table and, -** if 'glb' is true, also registers the result in the global table. -** Leaves resulting module on the top. -*/ -LUALIB_API void luaL_requiref (lua_State *L, const char *modname, - lua_CFunction openf, int glb) { - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_getfield(L, -1, modname); /* LOADED[modname] */ - if (!lua_toboolean(L, -1)) { /* package not already loaded? */ - lua_pop(L, 1); /* remove field */ - lua_pushcfunction(L, openf); - lua_pushstring(L, modname); /* argument to open function */ - lua_call(L, 1, 1); /* call 'openf' to open module */ - lua_pushvalue(L, -1); /* make copy of module (call result) */ - lua_setfield(L, -3, modname); /* LOADED[modname] = module */ - } - lua_remove(L, -2); /* remove LOADED table */ - if (glb) { - lua_pushvalue(L, -1); /* copy of module */ - lua_setglobal(L, modname); /* _G[modname] = module */ - } -} - - -LUALIB_API void luaL_addgsub (luaL_Buffer *b, const char *s, - const char *p, const char *r) { - const char *wild; - size_t l = strlen(p); - while ((wild = strstr(s, p)) != NULL) { - luaL_addlstring(b, s, wild - s); /* push prefix */ - luaL_addstring(b, r); /* push replacement in place of pattern */ - s = wild + l; /* continue after 'p' */ - } - luaL_addstring(b, s); /* push last suffix */ -} - - -LUALIB_API const char *luaL_gsub (lua_State *L, const char *s, - const char *p, const char *r) { - luaL_Buffer b; - luaL_buffinit(L, &b); - luaL_addgsub(&b, s, p, r); - luaL_pushresult(&b); - return lua_tostring(L, -1); -} - - -static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) { - (void)ud; (void)osize; /* not used */ - if (nsize == 0) { - free(ptr); - return NULL; - } - else - return realloc(ptr, nsize); -} - - -/* -** Standard panic funcion just prints an error message. The test -** with 'lua_type' avoids possible memory errors in 'lua_tostring'. -*/ -static int panic (lua_State *L) { - const char *msg = (lua_type(L, -1) == LUA_TSTRING) - ? lua_tostring(L, -1) - : "private_lua_error object is not a string"; - lua_writestringerror("PANIC: unprotected private_lua_error in call to Lua API (%s)\n", - msg); - return 0; /* return to Lua to abort */ -} - - -/* -** Warning functions: -** warnfoff: warning system is off -** warnfon: ready to start a new message -** warnfcont: previous message is to be continued -*/ -static void warnfoff (void *ud, const char *message, int tocont); -static void warnfon (void *ud, const char *message, int tocont); -static void warnfcont (void *ud, const char *message, int tocont); - - -/* -** Check whether message is a control message. If so, execute the -** control or ignore it if unknown. -*/ -static int checkcontrol (lua_State *L, const char *message, int tocont) { - if (tocont || *(message++) != '@') /* not a control message? */ - return 0; - else { - if (strcmp(message, "off") == 0) - lua_setwarnf(L, warnfoff, L); /* turn warnings off */ - else if (strcmp(message, "on") == 0) - lua_setwarnf(L, warnfon, L); /* turn warnings on */ - return 1; /* it was a control message */ - } -} - - -static void warnfoff (void *ud, const char *message, int tocont) { - checkcontrol((lua_State *)ud, message, tocont); -} - - -/* -** Writes the message and handle 'tocont', finishing the message -** if needed and setting the next warn function. -*/ -static void warnfcont (void *ud, const char *message, int tocont) { - lua_State *L = (lua_State *)ud; - lua_writestringerror("%s", message); /* write message */ - if (tocont) /* not the last part? */ - lua_setwarnf(L, warnfcont, L); /* to be continued */ - else { /* last part */ - lua_writestringerror("%s", "\n"); /* finish message with end-of-line */ - lua_setwarnf(L, warnfon, L); /* next call is a new message */ - } -} - - -static void warnfon (void *ud, const char *message, int tocont) { - if (checkcontrol((lua_State *)ud, message, tocont)) /* control message? */ - return; /* nothing else to be done */ - lua_writestringerror("%s", "Lua warning: "); /* start a new warning */ - warnfcont(ud, message, tocont); /* finish processing */ -} - - - -/* -** A function to compute an unsigned int with some level of -** randomness. Rely on Address Space Layout Randomization (if present) -** and the current time. -*/ -#if !defined(luai_makeseed) - -#include - - -/* Size for the buffer, in bytes */ -#define BUFSEEDB (sizeof(void*) + sizeof(time_t)) - -/* Size for the buffer in int's, rounded up */ -#define BUFSEED ((BUFSEEDB + sizeof(int) - 1) / sizeof(int)) - -/* -** Copy the contents of variable 'v' into the buffer pointed by 'b'. -** (The '&b[0]' disguises 'b' to fix an absurd warning from clang.) -*/ -#define addbuff(b,v) (memcpy(&b[0], &(v), sizeof(v)), b += sizeof(v)) - - -static unsigned int luai_makeseed (void) { - unsigned int buff[BUFSEED]; - unsigned int res; - unsigned int i; - time_t t = time(NULL); - char *b = (char*)buff; - addbuff(b, b); /* local variable's address */ - addbuff(b, t); /* time */ - /* fill (rare but possible) remain of the buffer with zeros */ - memset(b, 0, sizeof(buff) - BUFSEEDB); - res = buff[0]; - for (i = 1; i < BUFSEED; i++) - res ^= (res >> 3) + (res << 7) + buff[i]; - return res; -} - -#endif - - -LUALIB_API unsigned int luaL_makeseed (lua_State *L) { - (void)L; /* unused */ - return luai_makeseed(); -} - - -LUALIB_API lua_State *luaL_newstate (void) { - lua_State *L = lua_newstate(l_alloc, NULL, luai_makeseed()); - if (l_likely(L)) { - lua_atpanic(L, &panic); - lua_setwarnf(L, warnfoff, L); /* default is warnings off */ - } - return L; -} - - -LUALIB_API void luaL_checkversion_ (lua_State *L, lua_Number ver, size_t sz) { - lua_Number v = lua_version(L); - if (sz != LUAL_NUMSIZES) /* check numeric types */ - luaL_error(L, "core and library have incompatible numeric types"); - else if (v != ver) - luaL_error(L, "version mismatch: app. needs %f, Lua core provides %f", - (LUAI_UACNUMBER)ver, (LUAI_UACNUMBER)v); -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lauxlib.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lauxlib.h deleted file mode 100644 index 3c37068..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lauxlib.h +++ /dev/null @@ -1,303 +0,0 @@ -/* -** $Id: lauxlib.h $ -** Auxiliary functions for building Lua libraries -** See Copyright Notice in lua.h -*/ - - -#ifndef lauxlib_h -#define lauxlib_h - - -#include -#include - -#include "luaconf.h" -#include "lua.h" - - -/* global table */ -#define LUA_GNAME "_G" - - -typedef struct luaL_Buffer luaL_Buffer; - - -/* extra error code for 'luaL_loadfilex' */ -#define LUA_ERRFILE (LUA_ERRERR+1) - - -/* key, in the registry, for table of loaded modules */ -#define LUA_LOADED_TABLE "_LOADED" - - -/* key, in the registry, for table of preloaded loaders */ -#define LUA_PRELOAD_TABLE "_PRELOAD" - - -typedef struct luaL_Reg { - const char *name; - lua_CFunction func; -} luaL_Reg; - - -#define LUAL_NUMSIZES (sizeof(lua_Integer)*16 + sizeof(lua_Number)) - -LUALIB_API void (luaL_checkversion_) (lua_State *L, lua_Number ver, size_t sz); -#define luaL_checkversion(L) \ - luaL_checkversion_(L, LUA_VERSION_NUM, LUAL_NUMSIZES) - -LUALIB_API int (luaL_getmetafield) (lua_State *L, int obj, const char *e); -LUALIB_API int (luaL_callmeta) (lua_State *L, int obj, const char *e); -LUALIB_API const char *(luaL_tolstring) (lua_State *L, int idx, size_t *len); -LUALIB_API int (luaL_argerror) (lua_State *L, int arg, const char *extramsg); -LUALIB_API int (luaL_typeerror) (lua_State *L, int arg, const char *tname); -LUALIB_API const char *(luaL_checklstring) (lua_State *L, int arg, - size_t *l); -LUALIB_API const char *(luaL_optlstring) (lua_State *L, int arg, - const char *def, size_t *l); -LUALIB_API lua_Number (luaL_checknumber) (lua_State *L, int arg); -LUALIB_API lua_Number (luaL_optnumber) (lua_State *L, int arg, lua_Number def); - -LUALIB_API lua_Integer (luaL_checkinteger) (lua_State *L, int arg); -LUALIB_API lua_Integer (luaL_optinteger) (lua_State *L, int arg, - lua_Integer def); - -LUALIB_API void (luaL_checkstack) (lua_State *L, int sz, const char *msg); -LUALIB_API void (luaL_checktype) (lua_State *L, int arg, int t); -LUALIB_API void (luaL_checkany) (lua_State *L, int arg); - -LUALIB_API int (luaL_newmetatable) (lua_State *L, const char *tname); -LUALIB_API void (luaL_setmetatable) (lua_State *L, const char *tname); -LUALIB_API void *(luaL_testudata) (lua_State *L, int ud, const char *tname); -LUALIB_API void *(luaL_checkudata) (lua_State *L, int ud, const char *tname); - -LUALIB_API void (luaL_where) (lua_State *L, int lvl); -LUALIB_API int (luaL_error) (lua_State *L, const char *fmt, ...); - -LUALIB_API int (luaL_checkoption) (lua_State *L, int arg, const char *def, - const char *const lst[]); - -LUALIB_API int (luaL_fileresult) (lua_State *L, int stat, const char *fname); -LUALIB_API int (luaL_execresult) (lua_State *L, int stat); - - -/* predefined references */ -#define LUA_NOREF (-2) -#define LUA_REFNIL (-1) - -LUALIB_API int (luaL_ref) (lua_State *L, int t); -LUALIB_API void (luaL_unref) (lua_State *L, int t, int ref); - -LUALIB_API int (luaL_loadfilex) (lua_State *L, const char *filename, - const char *mode); - -#define luaL_loadfile(L,f) luaL_loadfilex(L,f,NULL) - -LUALIB_API int (luaL_loadbufferx) (lua_State *L, const char *buff, size_t sz, - const char *name, const char *mode); -LUALIB_API int (luaL_loadstring) (lua_State *L, const char *s); - -LUALIB_API lua_State *(luaL_newstate) (void); - -LUALIB_API unsigned luaL_makeseed (lua_State *L); - -LUALIB_API lua_Integer (luaL_len) (lua_State *L, int idx); - -LUALIB_API void (luaL_addgsub) (luaL_Buffer *b, const char *s, - const char *p, const char *r); -LUALIB_API const char *(luaL_gsub) (lua_State *L, const char *s, - const char *p, const char *r); - -LUALIB_API void (luaL_setfuncs) (lua_State *L, const luaL_Reg *l, int nup); - -LUALIB_API int (luaL_getsubtable) (lua_State *L, int idx, const char *fname); - -LUALIB_API void (luaL_traceback) (lua_State *L, lua_State *L1, - const char *msg, int level); - -LUALIB_API void (luaL_requiref) (lua_State *L, const char *modname, - lua_CFunction openf, int glb); - -/* -** =============================================================== -** some useful macros -** =============================================================== -*/ - - -#define luaL_newlibtable(L,l) \ - lua_createtable(L, 0, sizeof(l)/sizeof((l)[0]) - 1) - -#define luaL_newlib(L,l) \ - (luaL_checkversion(L), luaL_newlibtable(L,l), luaL_setfuncs(L,l,0)) - -#define luaL_argcheck(L, cond,arg,extramsg) \ - ((void)(luai_likely(cond) || luaL_argerror(L, (arg), (extramsg)))) - -#define luaL_argexpected(L,cond,arg,tname) \ - ((void)(luai_likely(cond) || luaL_typeerror(L, (arg), (tname)))) - -#define luaL_checkstring(L,n) (luaL_checklstring(L, (n), NULL)) -#define luaL_optstring(L,n,d) (luaL_optlstring(L, (n), (d), NULL)) - -#define luaL_typename(L,i) lua_typename(L, lua_type(L,(i))) - -#define luaL_dofile(L, fn) \ - (luaL_loadfile(L, fn) || lua_pcall(L, 0, LUA_MULTRET, 0)) - -#define luaL_dostring(L, s) \ - (luaL_loadstring(L, s) || lua_pcall(L, 0, LUA_MULTRET, 0)) - -#define luaL_getmetatable(L,n) (lua_getfield(L, LUA_REGISTRYINDEX, (n))) - -#define luaL_opt(L,f,n,d) (lua_isnoneornil(L,(n)) ? (d) : f(L,(n))) - -#define luaL_loadbuffer(L,s,sz,n) luaL_loadbufferx(L,s,sz,n,NULL) - - -/* -** Perform arithmetic operations on lua_Integer values with wrap-around -** semantics, as the Lua core does. -*/ -#define luaL_intop(op,v1,v2) \ - ((lua_Integer)((lua_Unsigned)(v1) op (lua_Unsigned)(v2))) - - -/* push the value used to represent failure/error */ -#define luaL_pushfail(L) lua_pushnil(L) - - -/* -** Internal assertions for in-house debugging -*/ -#if !defined(lua_assert) - -#if defined LUAI_ASSERT - #include - #define lua_assert(c) assert(c) -#else - #define lua_assert(c) ((void)0) -#endif - -#endif - - - -/* -** {====================================================== -** Generic Buffer manipulation -** ======================================================= -*/ - -struct luaL_Buffer { - char *b; /* buffer address */ - size_t size; /* buffer size */ - size_t n; /* number of characters in buffer */ - lua_State *L; - union { - LUAI_MAXALIGN; /* ensure maximum alignment for buffer */ - char b[LUAL_BUFFERSIZE]; /* initial buffer */ - } init; -}; - - -#define luaL_bufflen(bf) ((bf)->n) -#define luaL_buffaddr(bf) ((bf)->b) - - -#define luaL_addchar(B,c) \ - ((void)((B)->n < (B)->size || luaL_prepbuffsize((B), 1)), \ - ((B)->b[(B)->n++] = (c))) - -#define luaL_addsize(B,s) ((B)->n += (s)) - -#define luaL_buffsub(B,s) ((B)->n -= (s)) - -LUALIB_API void (luaL_buffinit) (lua_State *L, luaL_Buffer *B); -LUALIB_API char *(luaL_prepbuffsize) (luaL_Buffer *B, size_t sz); -LUALIB_API void (luaL_addlstring) (luaL_Buffer *B, const char *s, size_t l); -LUALIB_API void (luaL_addstring) (luaL_Buffer *B, const char *s); -LUALIB_API void (luaL_addvalue) (luaL_Buffer *B); -LUALIB_API void (luaL_pushresult) (luaL_Buffer *B); -LUALIB_API void (luaL_pushresultsize) (luaL_Buffer *B, size_t sz); -LUALIB_API char *(luaL_buffinitsize) (lua_State *L, luaL_Buffer *B, size_t sz); - -#define luaL_prepbuffer(B) luaL_prepbuffsize(B, LUAL_BUFFERSIZE) - -/* }====================================================== */ - - - -/* -** {====================================================== -** File handles for IO library -** ======================================================= -*/ - -/* -** A file handle is a userdata with metatable 'LUA_FILEHANDLE' and -** initial structure 'luaL_Stream' (it may contain other fields -** after that initial structure). -*/ - -#define LUA_FILEHANDLE "FILE*" - - -typedef struct luaL_Stream { - FILE *f; /* stream (NULL for incompletely created streams) */ - lua_CFunction closef; /* to close stream (NULL for closed streams) */ -} luaL_Stream; - -/* }====================================================== */ - -/* -** {================================================================== -** "Abstraction Layer" for basic report of messages and errors -** =================================================================== -*/ - -/* print a string */ -#if !defined(lua_writestring) -#define lua_writestring(s,l) fwrite((s), sizeof(char), (l), stdout) -#endif - -/* print a newline and flush the output */ -#if !defined(lua_writeline) -#define lua_writeline() (lua_writestring("\n", 1), fflush(stdout)) -#endif - -/* print an error message */ -#if !defined(lua_writestringerror) -#define lua_writestringerror(s,p) \ - (fprintf(stderr, (s), (p)), fflush(stderr)) -#endif - -/* }================================================================== */ - - -/* -** {============================================================ -** Compatibility with deprecated conversions -** ============================================================= -*/ -#if defined(LUA_COMPAT_APIINTCASTS) - -#define luaL_checkunsigned(L,a) ((lua_Unsigned)luaL_checkinteger(L,a)) -#define luaL_optunsigned(L,a,d) \ - ((lua_Unsigned)luaL_optinteger(L,a,(lua_Integer)(d))) - -#define luaL_checkint(L,n) ((int)luaL_checkinteger(L, (n))) -#define luaL_optint(L,n,d) ((int)luaL_optinteger(L, (n), (d))) - -#define luaL_checklong(L,n) ((long)luaL_checkinteger(L, (n))) -#define luaL_optlong(L,n,d) ((long)luaL_optinteger(L, (n), (d))) - -#endif -/* }============================================================ */ - - - -#endif - - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lbaselib.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lbaselib.c deleted file mode 100644 index 4238f96..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lbaselib.c +++ /dev/null @@ -1,556 +0,0 @@ -/* -** $Id: lbaselib.c $ -** Basic library -** See Copyright Notice in lua.h -*/ - -#define lbaselib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -static int luaB_print (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - int i; - for (i = 1; i <= n; i++) { /* for each argument */ - size_t l; - const char *s = luaL_tolstring(L, i, &l); /* convert it to string */ - if (i > 1) /* not the first element? */ - lua_writestring("\t", 1); /* add a tab before it */ - lua_writestring(s, l); /* print it */ - lua_pop(L, 1); /* pop result */ - } - lua_writeline(); - return 0; -} - - -/* -** Creates a warning with all given arguments. -** Check first for errors; otherwise an error may interrupt -** the composition of a warning, leaving it unfinished. -*/ -static int luaB_warn (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - int i; - luaL_checkstring(L, 1); /* at least one argument */ - for (i = 2; i <= n; i++) - luaL_checkstring(L, i); /* make sure all arguments are strings */ - for (i = 1; i < n; i++) /* compose warning */ - lua_warning(L, lua_tostring(L, i), 1); - lua_warning(L, lua_tostring(L, n), 0); /* close warning */ - return 0; -} - - -#define SPACECHARS " \f\n\r\t\v" - -static const char *b_str2int (const char *s, int base, lua_Integer *pn) { - lua_Unsigned n = 0; - int neg = 0; - s += strspn(s, SPACECHARS); /* skip initial spaces */ - if (*s == '-') { s++; neg = 1; } /* handle sign */ - else if (*s == '+') s++; - if (!isalnum((unsigned char)*s)) /* no digit? */ - return NULL; - do { - int digit = (isdigit((unsigned char)*s)) ? *s - '0' - : (toupper((unsigned char)*s) - 'A') + 10; - if (digit >= base) return NULL; /* invalid numeral */ - n = n * base + digit; - s++; - } while (isalnum((unsigned char)*s)); - s += strspn(s, SPACECHARS); /* skip trailing spaces */ - *pn = (lua_Integer)((neg) ? (0u - n) : n); - return s; -} - - -static int luaB_tonumber (lua_State *L) { - if (lua_isnoneornil(L, 2)) { /* standard conversion? */ - if (lua_type(L, 1) == LUA_TNUMBER) { /* already a number? */ - lua_settop(L, 1); /* yes; return it */ - return 1; - } - else { - size_t l; - const char *s = lua_tolstring(L, 1, &l); - if (s != NULL && lua_stringtonumber(L, s) == l + 1) - return 1; /* successful conversion to number */ - /* else not a number */ - luaL_checkany(L, 1); /* (but there must be some parameter) */ - } - } - else { - size_t l; - const char *s; - lua_Integer n = 0; /* to avoid warnings */ - lua_Integer base = luaL_checkinteger(L, 2); - luaL_checktype(L, 1, LUA_TSTRING); /* no numbers as strings */ - s = lua_tolstring(L, 1, &l); - luaL_argcheck(L, 2 <= base && base <= 36, 2, "base out of range"); - if (b_str2int(s, (int)base, &n) == s + l) { - lua_pushinteger(L, n); - return 1; - } /* else not a number */ - } /* else not a number */ - luaL_pushfail(L); /* not a number */ - return 1; -} - - -static int luaB_error (lua_State *L) { - int level = (int)luaL_optinteger(L, 2, 1); - lua_settop(L, 1); - if (lua_type(L, 1) == LUA_TSTRING && level > 0) { - luaL_where(L, level); /* add extra information */ - lua_pushvalue(L, 1); - lua_concat(L, 2); - } - return lua_error(L); -} - - -static int luaB_getmetatable (lua_State *L) { - luaL_checkany(L, 1); - if (!lua_getmetatable(L, 1)) { - lua_pushnil(L); - return 1; /* no metatable */ - } - luaL_getmetafield(L, 1, "__metatable"); - return 1; /* returns either __metatable field (if present) or metatable */ -} - - -static int luaB_setmetatable (lua_State *L) { - int t = lua_type(L, 2); - luaL_checktype(L, 1, LUA_TTABLE); - luaL_argexpected(L, t == LUA_TNIL || t == LUA_TTABLE, 2, "nil or table"); - if (l_unlikely(luaL_getmetafield(L, 1, "__metatable") != LUA_TNIL)) - return luaL_error(L, "cannot change a protected metatable"); - lua_settop(L, 2); - lua_setmetatable(L, 1); - return 1; -} - - -static int luaB_rawequal (lua_State *L) { - luaL_checkany(L, 1); - luaL_checkany(L, 2); - lua_pushboolean(L, lua_rawequal(L, 1, 2)); - return 1; -} - - -static int luaB_rawlen (lua_State *L) { - int t = lua_type(L, 1); - luaL_argexpected(L, t == LUA_TTABLE || t == LUA_TSTRING, 1, - "table or string"); - lua_pushinteger(L, lua_rawlen(L, 1)); - return 1; -} - - -static int luaB_rawget (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - luaL_checkany(L, 2); - lua_settop(L, 2); - lua_rawget(L, 1); - return 1; -} - -static int luaB_rawset (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - luaL_checkany(L, 2); - luaL_checkany(L, 3); - lua_settop(L, 3); - lua_rawset(L, 1); - return 1; -} - - -static int pushmode (lua_State *L, int oldmode) { - if (oldmode == -1) - luaL_pushfail(L); /* invalid call to 'lua_gc' */ - else - lua_pushstring(L, (oldmode == LUA_GCINC) ? "incremental" - : "generational"); - return 1; -} - - -/* -** check whether call to 'lua_gc' was valid (not inside a finalizer) -*/ -#define checkvalres(res) { if (res == -1) break; } - -static int luaB_collectgarbage (lua_State *L) { - static const char *const opts[] = {"stop", "restart", "collect", - "count", "step", "isrunning", "generational", "incremental", - "param", NULL}; - static const char optsnum[] = {LUA_GCSTOP, LUA_GCRESTART, LUA_GCCOLLECT, - LUA_GCCOUNT, LUA_GCSTEP, LUA_GCISRUNNING, LUA_GCGEN, LUA_GCINC, - LUA_GCPARAM}; - int o = optsnum[luaL_checkoption(L, 1, "collect", opts)]; - switch (o) { - case LUA_GCCOUNT: { - int k = lua_gc(L, o); - int b = lua_gc(L, LUA_GCCOUNTB); - checkvalres(k); - lua_pushnumber(L, (lua_Number)k + ((lua_Number)b/1024)); - return 1; - } - case LUA_GCSTEP: { - lua_Integer n = luaL_optinteger(L, 2, 0); - int res = lua_gc(L, o, (int)n); - checkvalres(res); - lua_pushboolean(L, res); - return 1; - } - case LUA_GCISRUNNING: { - int res = lua_gc(L, o); - checkvalres(res); - lua_pushboolean(L, res); - return 1; - } - case LUA_GCGEN: { - return pushmode(L, lua_gc(L, o)); - } - case LUA_GCINC: { - return pushmode(L, lua_gc(L, o)); - } - case LUA_GCPARAM: { - static const char *const params[] = { - "minormul", "majorminor", "minormajor", - "pause", "stepmul", "stepsize", NULL}; - static const char pnum[] = { - LUA_GCPMINORMUL, LUA_GCPMAJORMINOR, LUA_GCPMINORMAJOR, - LUA_GCPPAUSE, LUA_GCPSTEPMUL, LUA_GCPSTEPSIZE}; - int p = pnum[luaL_checkoption(L, 2, NULL, params)]; - lua_Integer value = luaL_optinteger(L, 3, -1); - lua_pushinteger(L, lua_gc(L, o, p, (int)value)); - return 1; - } - default: { - int res = lua_gc(L, o); - checkvalres(res); - lua_pushinteger(L, res); - return 1; - } - } - luaL_pushfail(L); /* invalid call (inside a finalizer) */ - return 1; -} - - -static int luaB_type (lua_State *L) { - int t = lua_type(L, 1); - luaL_argcheck(L, t != LUA_TNONE, 1, "value expected"); - lua_pushstring(L, lua_typename(L, t)); - return 1; -} - - -static int luaB_next (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - lua_settop(L, 2); /* create a 2nd argument if there isn't one */ - if (lua_next(L, 1)) - return 2; - else { - lua_pushnil(L); - return 1; - } -} - - -static int pairscont (lua_State *L, int status, lua_KContext k) { - (void)L; (void)status; (void)k; /* unused */ - return 3; -} - -static int luaB_pairs (lua_State *L) { - luaL_checkany(L, 1); - if (luaL_getmetafield(L, 1, "__pairs") == LUA_TNIL) { /* no metamethod? */ - lua_pushcfunction(L, luaB_next); /* will return generator, */ - lua_pushvalue(L, 1); /* state, */ - lua_pushnil(L); /* and initial value */ - } - else { - lua_pushvalue(L, 1); /* argument 'self' to metamethod */ - lua_callk(L, 1, 3, 0, pairscont); /* get 3 values from metamethod */ - } - return 3; -} - - -/* -** Traversal function for 'ipairs' -*/ -static int ipairsaux (lua_State *L) { - lua_Integer i = luaL_checkinteger(L, 2); - i = luaL_intop(+, i, 1); - lua_pushinteger(L, i); - return (lua_geti(L, 1, i) == LUA_TNIL) ? 1 : 2; -} - - -/* -** 'ipairs' function. Returns 'ipairsaux', given "table", 0. -** (The given "table" may not be a table.) -*/ -static int luaB_ipairs (lua_State *L) { - luaL_checkany(L, 1); - lua_pushcfunction(L, ipairsaux); /* iteration function */ - lua_pushvalue(L, 1); /* state */ - lua_pushinteger(L, 0); /* initial value */ - return 3; -} - - -static int load_aux (lua_State *L, int status, int envidx) { - if (l_likely(status == LUA_OK)) { - if (envidx != 0) { /* 'env' parameter? */ - lua_pushvalue(L, envidx); /* environment for loaded function */ - if (!lua_setupvalue(L, -2, 1)) /* set it as 1st upvalue */ - lua_pop(L, 1); /* remove 'env' if not used by previous call */ - } - return 1; - } - else { /* error (message is on top of the stack) */ - luaL_pushfail(L); - lua_insert(L, -2); /* put before error message */ - return 2; /* return fail plus error message */ - } -} - - -static const char *getmode (lua_State *L, int idx) { - const char *mode = luaL_optstring(L, idx, "bt"); - if (strchr(mode, 'B') != NULL) /* Lua code cannot use fixed buffers */ - luaL_argerror(L, idx, "invalid mode"); - return mode; -} - - -static int luaB_loadfile (lua_State *L) { - const char *fname = luaL_optstring(L, 1, NULL); - const char *mode = getmode(L, 2); - int env = (!lua_isnone(L, 3) ? 3 : 0); /* 'env' index or 0 if no 'env' */ - int status = luaL_loadfilex(L, fname, mode); - return load_aux(L, status, env); -} - - -/* -** {====================================================== -** Generic Read function -** ======================================================= -*/ - - -/* -** reserved slot, above all arguments, to hold a copy of the returned -** string to avoid it being collected while parsed. 'load' has four -** optional arguments (chunk, source name, mode, and environment). -*/ -#define RESERVEDSLOT 5 - - -/* -** Reader for generic 'load' function: 'lua_load' uses the -** stack for internal stuff, so the reader cannot change the -** stack top. Instead, it keeps its resulting string in a -** reserved slot inside the stack. -*/ -static const char *generic_reader (lua_State *L, void *ud, size_t *size) { - (void)(ud); /* not used */ - luaL_checkstack(L, 2, "too many nested functions"); - lua_pushvalue(L, 1); /* get function */ - lua_call(L, 0, 1); /* call it */ - if (lua_isnil(L, -1)) { - lua_pop(L, 1); /* pop result */ - *size = 0; - return NULL; - } - else if (l_unlikely(!lua_isstring(L, -1))) - luaL_error(L, "reader function must return a string"); - lua_replace(L, RESERVEDSLOT); /* save string in reserved slot */ - return lua_tolstring(L, RESERVEDSLOT, size); -} - - -static int luaB_load (lua_State *L) { - int status; - size_t l; - const char *s = lua_tolstring(L, 1, &l); - const char *mode = getmode(L, 3); - int env = (!lua_isnone(L, 4) ? 4 : 0); /* 'env' index or 0 if no 'env' */ - if (s != NULL) { /* loading a string? */ - const char *chunkname = luaL_optstring(L, 2, s); - status = luaL_loadbufferx(L, s, l, chunkname, mode); - } - else { /* loading from a reader function */ - const char *chunkname = luaL_optstring(L, 2, "=(load)"); - luaL_checktype(L, 1, LUA_TFUNCTION); - lua_settop(L, RESERVEDSLOT); /* create reserved slot */ - status = lua_load(L, generic_reader, NULL, chunkname, mode); - } - return load_aux(L, status, env); -} - -/* }====================================================== */ - - -static int dofilecont (lua_State *L, int d1, lua_KContext d2) { - (void)d1; (void)d2; /* only to match 'lua_Kfunction' prototype */ - return lua_gettop(L) - 1; -} - - -static int luaB_dofile (lua_State *L) { - const char *fname = luaL_optstring(L, 1, NULL); - lua_settop(L, 1); - if (l_unlikely(luaL_loadfile(L, fname) != LUA_OK)) - return lua_error(L); - lua_callk(L, 0, LUA_MULTRET, 0, dofilecont); - return dofilecont(L, 0, 0); -} - - -static int luaB_assert (lua_State *L) { - if (l_likely(lua_toboolean(L, 1))) /* condition is true? */ - return lua_gettop(L); /* return all arguments */ - else { /* error */ - luaL_checkany(L, 1); /* there must be a condition */ - lua_remove(L, 1); /* remove it */ - lua_pushliteral(L, "assertion failed!"); /* default message */ - lua_settop(L, 1); /* leave only message (default if no other one) */ - return luaB_error(L); /* call 'error' */ - } -} - - -static int luaB_select (lua_State *L) { - int n = lua_gettop(L); - if (lua_type(L, 1) == LUA_TSTRING && *lua_tostring(L, 1) == '#') { - lua_pushinteger(L, n-1); - return 1; - } - else { - lua_Integer i = luaL_checkinteger(L, 1); - if (i < 0) i = n + i; - else if (i > n) i = n; - luaL_argcheck(L, 1 <= i, 1, "index out of range"); - return n - (int)i; - } -} - - -/* -** Continuation function for 'pcall' and 'xpcall'. Both functions -** already pushed a 'true' before doing the call, so in case of success -** 'finishpcall' only has to return everything in the stack minus -** 'extra' values (where 'extra' is exactly the number of items to be -** ignored). -*/ -static int finishpcall (lua_State *L, int status, lua_KContext extra) { - if (l_unlikely(status != LUA_OK && status != LUA_YIELD)) { /* error? */ - lua_pushboolean(L, 0); /* first result (false) */ - lua_pushvalue(L, -2); /* error message */ - return 2; /* return false, msg */ - } - else - return lua_gettop(L) - (int)extra; /* return all results */ -} - - -static int luaB_pcall (lua_State *L) { - int status; - luaL_checkany(L, 1); - lua_pushboolean(L, 1); /* first result if no errors */ - lua_insert(L, 1); /* put it in place */ - status = lua_pcallk(L, lua_gettop(L) - 2, LUA_MULTRET, 0, 0, finishpcall); - return finishpcall(L, status, 0); -} - - -/* -** Do a protected call with error handling. After 'lua_rotate', the -** stack will have ; so, the function passes -** 2 to 'finishpcall' to skip the 2 first values when returning results. -*/ -static int luaB_xpcall (lua_State *L) { - int status; - int n = lua_gettop(L); - luaL_checktype(L, 2, LUA_TFUNCTION); /* check error function */ - lua_pushboolean(L, 1); /* first result */ - lua_pushvalue(L, 1); /* function */ - lua_rotate(L, 3, 2); /* move them below function's arguments */ - status = lua_pcallk(L, n - 2, LUA_MULTRET, 2, 2, finishpcall); - return finishpcall(L, status, 2); -} - - -static int luaB_tostring (lua_State *L) { - luaL_checkany(L, 1); - luaL_tolstring(L, 1, NULL); - return 1; -} - - -static const luaL_Reg base_funcs[] = { - {"assert", luaB_assert}, - {"collectgarbage", luaB_collectgarbage}, - {"dofile", luaB_dofile}, - {"error", luaB_error}, - {"getmetatable", luaB_getmetatable}, - {"ipairs", luaB_ipairs}, - {"loadfile", luaB_loadfile}, - {"load", luaB_load}, - {"next", luaB_next}, - {"pairs", luaB_pairs}, - {"pcall", luaB_pcall}, - {"print", luaB_print}, - {"warn", luaB_warn}, - {"rawequal", luaB_rawequal}, - {"rawlen", luaB_rawlen}, - {"rawget", luaB_rawget}, - {"rawset", luaB_rawset}, - {"select", luaB_select}, - {"setmetatable", luaB_setmetatable}, - {"tonumber", luaB_tonumber}, - {"tostring", luaB_tostring}, - {"type", luaB_type}, - {"xpcall", luaB_xpcall}, - /* placeholders */ - {LUA_GNAME, NULL}, - {"_VERSION", NULL}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_base (lua_State *L) { - /* open lib into global table */ - lua_pushglobaltable(L); - luaL_setfuncs(L, base_funcs, 0); - /* set global _G */ - lua_pushvalue(L, -1); - lua_setfield(L, -2, LUA_GNAME); - /* set global _VERSION */ - lua_pushliteral(L, LUA_VERSION); - lua_setfield(L, -2, "_VERSION"); - return 1; -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lcode.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lcode.c deleted file mode 100644 index 2c57fda..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lcode.c +++ /dev/null @@ -1,1872 +0,0 @@ -/* -** $Id: lcode.c $ -** Code generator for Lua -** See Copyright Notice in lua.h -*/ - -#define lcode_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include -#include - -#include "lua.h" - -#include "lcode.h" -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "llex.h" -#include "lmem.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lparser.h" -#include "lstring.h" -#include "ltable.h" -#include "lvm.h" - - -/* Maximum number of registers in a Lua function (must fit in 8 bits) */ -#define MAXREGS 255 - - -#define hasjumps(e) ((e)->t != (e)->f) - - -static int codesJ (FuncState *fs, OpCode o, int sj, int k); - - - -/* semantic error */ -l_noret luaK_semerror (LexState *ls, const char *msg) { - ls->t.token = 0; /* remove "near " from final message */ - luaX_syntaxerror(ls, msg); -} - - -/* -** If expression is a numeric constant, fills 'v' with its value -** and returns 1. Otherwise, returns 0. -*/ -static int tonumeral (const expdesc *e, TValue *v) { - if (hasjumps(e)) - return 0; /* not a numeral */ - switch (e->k) { - case VKINT: - if (v) setivalue(v, e->u.ival); - return 1; - case VKFLT: - if (v) setfltvalue(v, e->u.nval); - return 1; - default: return 0; - } -} - - -/* -** Get the constant value from a constant expression -*/ -static TValue *const2val (FuncState *fs, const expdesc *e) { - lua_assert(e->k == VCONST); - return &fs->ls->dyd->actvar.arr[e->u.info].k; -} - - -/* -** If expression is a constant, fills 'v' with its value -** and returns 1. Otherwise, returns 0. -*/ -int luaK_exp2const (FuncState *fs, const expdesc *e, TValue *v) { - if (hasjumps(e)) - return 0; /* not a constant */ - switch (e->k) { - case VFALSE: - setbfvalue(v); - return 1; - case VTRUE: - setbtvalue(v); - return 1; - case VNIL: - setnilvalue(v); - return 1; - case VKSTR: { - setsvalue(fs->ls->L, v, e->u.strval); - return 1; - } - case VCONST: { - setobj(fs->ls->L, v, const2val(fs, e)); - return 1; - } - default: return tonumeral(e, v); - } -} - - -/* -** Return the previous instruction of the current code. If there -** may be a jump target between the current instruction and the -** previous one, return an invalid instruction (to avoid wrong -** optimizations). -*/ -static Instruction *previousinstruction (FuncState *fs) { - static const Instruction invalidinstruction = ~(Instruction)0; - if (fs->pc > fs->lasttarget) - return &fs->f->code[fs->pc - 1]; /* previous instruction */ - else - return cast(Instruction*, &invalidinstruction); -} - - -/* -** Create a OP_LOADNIL instruction, but try to optimize: if the previous -** instruction is also OP_LOADNIL and ranges are compatible, adjust -** range of previous instruction instead of emitting a new one. (For -** instance, 'local a; local b' will generate a single opcode.) -*/ -void luaK_nil (FuncState *fs, int from, int n) { - int l = from + n - 1; /* last register to set nil */ - Instruction *previous = previousinstruction(fs); - if (GET_OPCODE(*previous) == OP_LOADNIL) { /* previous is LOADNIL? */ - int pfrom = GETARG_A(*previous); /* get previous range */ - int pl = pfrom + GETARG_B(*previous); - if ((pfrom <= from && from <= pl + 1) || - (from <= pfrom && pfrom <= l + 1)) { /* can connect both? */ - if (pfrom < from) from = pfrom; /* from = min(from, pfrom) */ - if (pl > l) l = pl; /* l = max(l, pl) */ - SETARG_A(*previous, from); - SETARG_B(*previous, l - from); - return; - } /* else go through */ - } - luaK_codeABC(fs, OP_LOADNIL, from, n - 1, 0); /* else no optimization */ -} - - -/* -** Gets the destination address of a jump instruction. Used to traverse -** a list of jumps. -*/ -static int getjump (FuncState *fs, int pc) { - int offset = GETARG_sJ(fs->f->code[pc]); - if (offset == NO_JUMP) /* point to itself represents end of list */ - return NO_JUMP; /* end of list */ - else - return (pc+1)+offset; /* turn offset into absolute position */ -} - - -/* -** Fix jump instruction at position 'pc' to jump to 'dest'. -** (Jump addresses are relative in Lua) -*/ -static void fixjump (FuncState *fs, int pc, int dest) { - Instruction *jmp = &fs->f->code[pc]; - int offset = dest - (pc + 1); - lua_assert(dest != NO_JUMP); - if (!(-OFFSET_sJ <= offset && offset <= MAXARG_sJ - OFFSET_sJ)) - luaX_syntaxerror(fs->ls, "control structure too long"); - lua_assert(GET_OPCODE(*jmp) == OP_JMP); - SETARG_sJ(*jmp, offset); -} - - -/* -** Concatenate jump-list 'l2' into jump-list 'l1' -*/ -void luaK_concat (FuncState *fs, int *l1, int l2) { - if (l2 == NO_JUMP) return; /* nothing to concatenate? */ - else if (*l1 == NO_JUMP) /* no original list? */ - *l1 = l2; /* 'l1' points to 'l2' */ - else { - int list = *l1; - int next; - while ((next = getjump(fs, list)) != NO_JUMP) /* find last element */ - list = next; - fixjump(fs, list, l2); /* last element links to 'l2' */ - } -} - - -/* -** Create a jump instruction and return its position, so its destination -** can be fixed later (with 'fixjump'). -*/ -int luaK_jump (FuncState *fs) { - return codesJ(fs, OP_JMP, NO_JUMP, 0); -} - - -/* -** Code a 'return' instruction -*/ -void luaK_ret (FuncState *fs, int first, int nret) { - OpCode op; - switch (nret) { - case 0: op = OP_RETURN0; break; - case 1: op = OP_RETURN1; break; - default: op = OP_RETURN; break; - } - luaK_codeABC(fs, op, first, nret + 1, 0); -} - - -/* -** Code a "conditional jump", that is, a test or comparison opcode -** followed by a jump. Return jump position. -*/ -static int condjump (FuncState *fs, OpCode op, int A, int B, int C, int k) { - luaK_codeABCk(fs, op, A, B, C, k); - return luaK_jump(fs); -} - - -/* -** returns current 'pc' and marks it as a jump target (to avoid wrong -** optimizations with consecutive instructions not in the same basic block). -*/ -int luaK_getlabel (FuncState *fs) { - fs->lasttarget = fs->pc; - return fs->pc; -} - - -/* -** Returns the position of the instruction "controlling" a given -** jump (that is, its condition), or the jump itself if it is -** unconditional. -*/ -static Instruction *getjumpcontrol (FuncState *fs, int pc) { - Instruction *pi = &fs->f->code[pc]; - if (pc >= 1 && testTMode(GET_OPCODE(*(pi-1)))) - return pi-1; - else - return pi; -} - - -/* -** Patch destination register for a TESTSET instruction. -** If instruction in position 'node' is not a TESTSET, return 0 ("fails"). -** Otherwise, if 'reg' is not 'NO_REG', set it as the destination -** register. Otherwise, change instruction to a simple 'TEST' (produces -** no register value) -*/ -static int patchtestreg (FuncState *fs, int node, int reg) { - Instruction *i = getjumpcontrol(fs, node); - if (GET_OPCODE(*i) != OP_TESTSET) - return 0; /* cannot patch other instructions */ - if (reg != NO_REG && reg != GETARG_B(*i)) - SETARG_A(*i, reg); - else { - /* no register to put value or register already has the value; - change instruction to simple test */ - *i = CREATE_ABCk(OP_TEST, GETARG_B(*i), 0, 0, GETARG_k(*i)); - } - return 1; -} - - -/* -** Traverse a list of tests ensuring no one produces a value -*/ -static void removevalues (FuncState *fs, int list) { - for (; list != NO_JUMP; list = getjump(fs, list)) - patchtestreg(fs, list, NO_REG); -} - - -/* -** Traverse a list of tests, patching their destination address and -** registers: tests producing values jump to 'vtarget' (and put their -** values in 'reg'), other tests jump to 'dtarget'. -*/ -static void patchlistaux (FuncState *fs, int list, int vtarget, int reg, - int dtarget) { - while (list != NO_JUMP) { - int next = getjump(fs, list); - if (patchtestreg(fs, list, reg)) - fixjump(fs, list, vtarget); - else - fixjump(fs, list, dtarget); /* jump to default target */ - list = next; - } -} - - -/* -** Path all jumps in 'list' to jump to 'target'. -** (The assert means that we cannot fix a jump to a forward address -** because we only know addresses once code is generated.) -*/ -void luaK_patchlist (FuncState *fs, int list, int target) { - lua_assert(target <= fs->pc); - patchlistaux(fs, list, target, NO_REG, target); -} - - -void luaK_patchtohere (FuncState *fs, int list) { - int hr = luaK_getlabel(fs); /* mark "here" as a jump target */ - luaK_patchlist(fs, list, hr); -} - - -/* limit for difference between lines in relative line info. */ -#define LIMLINEDIFF 0x80 - - -/* -** Save line info for a new instruction. If difference from last line -** does not fit in a byte, of after that many instructions, save a new -** absolute line info; (in that case, the special value 'ABSLINEINFO' -** in 'lineinfo' signals the existence of this absolute information.) -** Otherwise, store the difference from last line in 'lineinfo'. -*/ -static void savelineinfo (FuncState *fs, Proto *f, int line) { - int linedif = line - fs->previousline; - int pc = fs->pc - 1; /* last instruction coded */ - if (abs(linedif) >= LIMLINEDIFF || fs->iwthabs++ >= MAXIWTHABS) { - luaM_growvector(fs->ls->L, f->abslineinfo, fs->nabslineinfo, - f->sizeabslineinfo, AbsLineInfo, MAX_INT, "lines"); - f->abslineinfo[fs->nabslineinfo].pc = pc; - f->abslineinfo[fs->nabslineinfo++].line = line; - linedif = ABSLINEINFO; /* signal that there is absolute information */ - fs->iwthabs = 1; /* restart counter */ - } - luaM_growvector(fs->ls->L, f->lineinfo, pc, f->sizelineinfo, ls_byte, - MAX_INT, "opcodes"); - f->lineinfo[pc] = linedif; - fs->previousline = line; /* last line saved */ -} - - -/* -** Remove line information from the last instruction. -** If line information for that instruction is absolute, set 'iwthabs' -** above its max to force the new (replacing) instruction to have -** absolute line info, too. -*/ -static void removelastlineinfo (FuncState *fs) { - Proto *f = fs->f; - int pc = fs->pc - 1; /* last instruction coded */ - if (f->lineinfo[pc] != ABSLINEINFO) { /* relative line info? */ - fs->previousline -= f->lineinfo[pc]; /* correct last line saved */ - fs->iwthabs--; /* undo previous increment */ - } - else { /* absolute line information */ - lua_assert(f->abslineinfo[fs->nabslineinfo - 1].pc == pc); - fs->nabslineinfo--; /* remove it */ - fs->iwthabs = MAXIWTHABS + 1; /* force next line info to be absolute */ - } -} - - -/* -** Remove the last instruction created, correcting line information -** accordingly. -*/ -static void removelastinstruction (FuncState *fs) { - removelastlineinfo(fs); - fs->pc--; -} - - -/* -** Emit instruction 'i', checking for array sizes and saving also its -** line information. Return 'i' position. -*/ -int luaK_code (FuncState *fs, Instruction i) { - Proto *f = fs->f; - /* put new instruction in code array */ - luaM_growvector(fs->ls->L, f->code, fs->pc, f->sizecode, Instruction, - MAX_INT, "opcodes"); - f->code[fs->pc++] = i; - savelineinfo(fs, f, fs->ls->lastline); - return fs->pc - 1; /* index of new instruction */ -} - - -/* -** Format and emit an 'iABC' instruction. (Assertions check consistency -** of parameters versus opcode.) -*/ -int luaK_codeABCk (FuncState *fs, OpCode o, int a, int b, int c, int k) { - lua_assert(getOpMode(o) == iABC); - lua_assert(a <= MAXARG_A && b <= MAXARG_B && - c <= MAXARG_C && (k & ~1) == 0); - return luaK_code(fs, CREATE_ABCk(o, a, b, c, k)); -} - - -/* -** Format and emit an 'iABx' instruction. -*/ -int luaK_codeABx (FuncState *fs, OpCode o, int a, unsigned int bc) { - lua_assert(getOpMode(o) == iABx); - lua_assert(a <= MAXARG_A && bc <= MAXARG_Bx); - return luaK_code(fs, CREATE_ABx(o, a, bc)); -} - - -/* -** Format and emit an 'iAsBx' instruction. -*/ -static int codeAsBx (FuncState *fs, OpCode o, int a, int bc) { - unsigned int b = bc + OFFSET_sBx; - lua_assert(getOpMode(o) == iAsBx); - lua_assert(a <= MAXARG_A && b <= MAXARG_Bx); - return luaK_code(fs, CREATE_ABx(o, a, b)); -} - - -/* -** Format and emit an 'isJ' instruction. -*/ -static int codesJ (FuncState *fs, OpCode o, int sj, int k) { - unsigned int j = sj + OFFSET_sJ; - lua_assert(getOpMode(o) == isJ); - lua_assert(j <= MAXARG_sJ && (k & ~1) == 0); - return luaK_code(fs, CREATE_sJ(o, j, k)); -} - - -/* -** Emit an "extra argument" instruction (format 'iAx') -*/ -static int codeextraarg (FuncState *fs, int a) { - lua_assert(a <= MAXARG_Ax); - return luaK_code(fs, CREATE_Ax(OP_EXTRAARG, a)); -} - - -/* -** Emit a "load constant" instruction, using either 'OP_LOADK' -** (if constant index 'k' fits in 18 bits) or an 'OP_LOADKX' -** instruction with "extra argument". -*/ -static int luaK_codek (FuncState *fs, int reg, int k) { - if (k <= MAXARG_Bx) - return luaK_codeABx(fs, OP_LOADK, reg, k); - else { - int p = luaK_codeABx(fs, OP_LOADKX, reg, 0); - codeextraarg(fs, k); - return p; - } -} - - -/* -** Check register-stack level, keeping track of its maximum size -** in field 'maxstacksize' -*/ -void luaK_checkstack (FuncState *fs, int n) { - int newstack = fs->freereg + n; - if (newstack > fs->f->maxstacksize) { - if (newstack >= MAXREGS) - luaX_syntaxerror(fs->ls, - "function or expression needs too many registers"); - fs->f->maxstacksize = cast_byte(newstack); - } -} - - -/* -** Reserve 'n' registers in register stack -*/ -void luaK_reserveregs (FuncState *fs, int n) { - luaK_checkstack(fs, n); - fs->freereg += n; -} - - -/* -** Free register 'reg', if it is neither a constant index nor -** a local variable. -) -*/ -static void freereg (FuncState *fs, int reg) { - if (reg >= luaY_nvarstack(fs)) { - fs->freereg--; - lua_assert(reg == fs->freereg); - } -} - - -/* -** Free two registers in proper order -*/ -static void freeregs (FuncState *fs, int r1, int r2) { - if (r1 > r2) { - freereg(fs, r1); - freereg(fs, r2); - } - else { - freereg(fs, r2); - freereg(fs, r1); - } -} - - -/* -** Free register used by expression 'e' (if any) -*/ -static void freeexp (FuncState *fs, expdesc *e) { - if (e->k == VNONRELOC) - freereg(fs, e->u.info); -} - - -/* -** Free registers used by expressions 'e1' and 'e2' (if any) in proper -** order. -*/ -static void freeexps (FuncState *fs, expdesc *e1, expdesc *e2) { - int r1 = (e1->k == VNONRELOC) ? e1->u.info : -1; - int r2 = (e2->k == VNONRELOC) ? e2->u.info : -1; - freeregs(fs, r1, r2); -} - - -/* -** Add constant 'v' to prototype's list of constants (field 'k'). -** Use scanner's table to cache position of constants in constant list -** and try to reuse constants. Because some values should not be used -** as keys (nil cannot be a key, integer keys can collapse with float -** keys), the caller must provide a useful 'key' for indexing the cache. -** Note that all functions share the same table, so entering or exiting -** a function can make some indices wrong. -*/ -static int addk (FuncState *fs, TValue *key, TValue *v) { - TValue val; - lua_State *L = fs->ls->L; - Proto *f = fs->f; - int tag = luaH_get(fs->ls->h, key, &val); /* query scanner table */ - int k, oldsize; - if (tag == LUA_VNUMINT) { /* is there an index there? */ - k = cast_int(ivalue(&val)); - /* correct value? (warning: must distinguish floats from integers!) */ - if (k < fs->nk && ttypetag(&f->k[k]) == ttypetag(v) && - luaV_rawequalobj(&f->k[k], v)) - return k; /* reuse index */ - } - /* constant not found; create a new entry */ - oldsize = f->sizek; - k = fs->nk; - /* numerical value does not need GC barrier; - table has no metatable, so it does not need to invalidate cache */ - setivalue(&val, k); - luaH_set(L, fs->ls->h, key, &val); - luaM_growvector(L, f->k, k, f->sizek, TValue, MAXARG_Ax, "constants"); - while (oldsize < f->sizek) setnilvalue(&f->k[oldsize++]); - setobj(L, &f->k[k], v); - fs->nk++; - luaC_barrier(L, f, v); - return k; -} - - -/* -** Add a string to list of constants and return its index. -*/ -static int stringK (FuncState *fs, TString *s) { - TValue o; - setsvalue(fs->ls->L, &o, s); - return addk(fs, &o, &o); /* use string itself as key */ -} - - -/* -** Add an integer to list of constants and return its index. -*/ -static int luaK_intK (FuncState *fs, lua_Integer n) { - TValue o; - setivalue(&o, n); - return addk(fs, &o, &o); /* use integer itself as key */ -} - -/* -** Add a float to list of constants and return its index. Floats -** with integral values need a different key, to avoid collision -** with actual integers. To that, we add to the number its smaller -** power-of-two fraction that is still significant in its scale. -** For doubles, that would be 1/2^52. -** (This method is not bulletproof: there may be another float -** with that value, and for floats larger than 2^53 the result is -** still an integer. At worst, this only wastes an entry with -** a duplicate.) -*/ -static int luaK_numberK (FuncState *fs, lua_Number r) { - TValue o; - lua_Integer ik; - setfltvalue(&o, r); - if (!luaV_flttointeger(r, &ik, F2Ieq)) /* not an integral value? */ - return addk(fs, &o, &o); /* use number itself as key */ - else { /* must build an alternative key */ - const int nbm = l_floatatt(MANT_DIG); - const lua_Number q = l_mathop(ldexp)(l_mathop(1.0), -nbm + 1); - const lua_Number k = (ik == 0) ? q : r + r*q; /* new key */ - TValue kv; - setfltvalue(&kv, k); - /* result is not an integral value, unless value is too large */ - lua_assert(!luaV_flttointeger(k, &ik, F2Ieq) || - l_mathop(fabs)(r) >= l_mathop(1e6)); - return addk(fs, &kv, &o); - } -} - - -/* -** Add a false to list of constants and return its index. -*/ -static int boolF (FuncState *fs) { - TValue o; - setbfvalue(&o); - return addk(fs, &o, &o); /* use boolean itself as key */ -} - - -/* -** Add a true to list of constants and return its index. -*/ -static int boolT (FuncState *fs) { - TValue o; - setbtvalue(&o); - return addk(fs, &o, &o); /* use boolean itself as key */ -} - - -/* -** Add nil to list of constants and return its index. -*/ -static int nilK (FuncState *fs) { - TValue k, v; - setnilvalue(&v); - /* cannot use nil as key; instead use table itself to represent nil */ - sethvalue(fs->ls->L, &k, fs->ls->h); - return addk(fs, &k, &v); -} - - -/* -** Check whether 'i' can be stored in an 'sC' operand. Equivalent to -** (0 <= int2sC(i) && int2sC(i) <= MAXARG_C) but without risk of -** overflows in the hidden addition inside 'int2sC'. -*/ -static int fitsC (lua_Integer i) { - return (l_castS2U(i) + OFFSET_sC <= cast_uint(MAXARG_C)); -} - - -/* -** Check whether 'i' can be stored in an 'sBx' operand. -*/ -static int fitsBx (lua_Integer i) { - return (-OFFSET_sBx <= i && i <= MAXARG_Bx - OFFSET_sBx); -} - - -void luaK_int (FuncState *fs, int reg, lua_Integer i) { - if (fitsBx(i)) - codeAsBx(fs, OP_LOADI, reg, cast_int(i)); - else - luaK_codek(fs, reg, luaK_intK(fs, i)); -} - - -static void luaK_float (FuncState *fs, int reg, lua_Number f) { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ieq) && fitsBx(fi)) - codeAsBx(fs, OP_LOADF, reg, cast_int(fi)); - else - luaK_codek(fs, reg, luaK_numberK(fs, f)); -} - - -/* -** Convert a constant in 'v' into an expression description 'e' -*/ -static void const2exp (TValue *v, expdesc *e) { - switch (ttypetag(v)) { - case LUA_VNUMINT: - e->k = VKINT; e->u.ival = ivalue(v); - break; - case LUA_VNUMFLT: - e->k = VKFLT; e->u.nval = fltvalue(v); - break; - case LUA_VFALSE: - e->k = VFALSE; - break; - case LUA_VTRUE: - e->k = VTRUE; - break; - case LUA_VNIL: - e->k = VNIL; - break; - case LUA_VSHRSTR: case LUA_VLNGSTR: - e->k = VKSTR; e->u.strval = tsvalue(v); - break; - default: lua_assert(0); - } -} - - -/* -** Fix an expression to return the number of results 'nresults'. -** 'e' must be a multi-ret expression (function call or vararg). -*/ -void luaK_setreturns (FuncState *fs, expdesc *e, int nresults) { - Instruction *pc = &getinstruction(fs, e); - if (e->k == VCALL) /* expression is an open function call? */ - SETARG_C(*pc, nresults + 1); - else { - lua_assert(e->k == VVARARG); - SETARG_C(*pc, nresults + 1); - SETARG_A(*pc, fs->freereg); - luaK_reserveregs(fs, 1); - } -} - - -/* -** Convert a VKSTR to a VK -*/ -static void str2K (FuncState *fs, expdesc *e) { - lua_assert(e->k == VKSTR); - e->u.info = stringK(fs, e->u.strval); - e->k = VK; -} - - -/* -** Fix an expression to return one result. -** If expression is not a multi-ret expression (function call or -** vararg), it already returns one result, so nothing needs to be done. -** Function calls become VNONRELOC expressions (as its result comes -** fixed in the base register of the call), while vararg expressions -** become VRELOC (as OP_VARARG puts its results where it wants). -** (Calls are created returning one result, so that does not need -** to be fixed.) -*/ -void luaK_setoneret (FuncState *fs, expdesc *e) { - if (e->k == VCALL) { /* expression is an open function call? */ - /* already returns 1 value */ - lua_assert(GETARG_C(getinstruction(fs, e)) == 2); - e->k = VNONRELOC; /* result has fixed position */ - e->u.info = GETARG_A(getinstruction(fs, e)); - } - else if (e->k == VVARARG) { - SETARG_C(getinstruction(fs, e), 2); - e->k = VRELOC; /* can relocate its simple result */ - } -} - - -/* -** Ensure that expression 'e' is not a variable (nor a ). -** (Expression still may have jump lists.) -*/ -void luaK_dischargevars (FuncState *fs, expdesc *e) { - switch (e->k) { - case VCONST: { - const2exp(const2val(fs, e), e); - break; - } - case VLOCAL: { /* already in a register */ - e->u.info = e->u.var.ridx; - e->k = VNONRELOC; /* becomes a non-relocatable value */ - break; - } - case VUPVAL: { /* move value to some (pending) register */ - e->u.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.info, 0); - e->k = VRELOC; - break; - } - case VINDEXUP: { - e->u.info = luaK_codeABC(fs, OP_GETTABUP, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXI: { - freereg(fs, e->u.ind.t); - e->u.info = luaK_codeABC(fs, OP_GETI, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXSTR: { - freereg(fs, e->u.ind.t); - e->u.info = luaK_codeABC(fs, OP_GETFIELD, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXED: { - freeregs(fs, e->u.ind.t, e->u.ind.idx); - e->u.info = luaK_codeABC(fs, OP_GETTABLE, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VVARARG: case VCALL: { - luaK_setoneret(fs, e); - break; - } - default: break; /* there is one value available (somewhere) */ - } -} - - -/* -** Ensure expression value is in register 'reg', making 'e' a -** non-relocatable expression. -** (Expression still may have jump lists.) -*/ -static void discharge2reg (FuncState *fs, expdesc *e, int reg) { - luaK_dischargevars(fs, e); - switch (e->k) { - case VNIL: { - luaK_nil(fs, reg, 1); - break; - } - case VFALSE: { - luaK_codeABC(fs, OP_LOADFALSE, reg, 0, 0); - break; - } - case VTRUE: { - luaK_codeABC(fs, OP_LOADTRUE, reg, 0, 0); - break; - } - case VKSTR: { - str2K(fs, e); - } /* FALLTHROUGH */ - case VK: { - luaK_codek(fs, reg, e->u.info); - break; - } - case VKFLT: { - luaK_float(fs, reg, e->u.nval); - break; - } - case VKINT: { - luaK_int(fs, reg, e->u.ival); - break; - } - case VRELOC: { - Instruction *pc = &getinstruction(fs, e); - SETARG_A(*pc, reg); /* instruction will put result in 'reg' */ - break; - } - case VNONRELOC: { - if (reg != e->u.info) - luaK_codeABC(fs, OP_MOVE, reg, e->u.info, 0); - break; - } - default: { - lua_assert(e->k == VJMP); - return; /* nothing to do... */ - } - } - e->u.info = reg; - e->k = VNONRELOC; -} - - -/* -** Ensure expression value is in a register, making 'e' a -** non-relocatable expression. -** (Expression still may have jump lists.) -*/ -static void discharge2anyreg (FuncState *fs, expdesc *e) { - if (e->k != VNONRELOC) { /* no fixed register yet? */ - luaK_reserveregs(fs, 1); /* get a register */ - discharge2reg(fs, e, fs->freereg-1); /* put value there */ - } -} - - -static int code_loadbool (FuncState *fs, int A, OpCode op) { - luaK_getlabel(fs); /* those instructions may be jump targets */ - return luaK_codeABC(fs, op, A, 0, 0); -} - - -/* -** check whether list has any jump that do not produce a value -** or produce an inverted value -*/ -static int need_value (FuncState *fs, int list) { - for (; list != NO_JUMP; list = getjump(fs, list)) { - Instruction i = *getjumpcontrol(fs, list); - if (GET_OPCODE(i) != OP_TESTSET) return 1; - } - return 0; /* not found */ -} - - -/* -** Ensures final expression result (which includes results from its -** jump lists) is in register 'reg'. -** If expression has jumps, need to patch these jumps either to -** its final position or to "load" instructions (for those tests -** that do not produce values). -*/ -static void exp2reg (FuncState *fs, expdesc *e, int reg) { - discharge2reg(fs, e, reg); - if (e->k == VJMP) /* expression itself is a test? */ - luaK_concat(fs, &e->t, e->u.info); /* put this jump in 't' list */ - if (hasjumps(e)) { - int final; /* position after whole expression */ - int p_f = NO_JUMP; /* position of an eventual LOAD false */ - int p_t = NO_JUMP; /* position of an eventual LOAD true */ - if (need_value(fs, e->t) || need_value(fs, e->f)) { - int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs); - p_f = code_loadbool(fs, reg, OP_LFALSESKIP); /* skip next inst. */ - p_t = code_loadbool(fs, reg, OP_LOADTRUE); - /* jump around these booleans if 'e' is not a test */ - luaK_patchtohere(fs, fj); - } - final = luaK_getlabel(fs); - patchlistaux(fs, e->f, final, reg, p_f); - patchlistaux(fs, e->t, final, reg, p_t); - } - e->f = e->t = NO_JUMP; - e->u.info = reg; - e->k = VNONRELOC; -} - - -/* -** Ensures final expression result is in next available register. -*/ -void luaK_exp2nextreg (FuncState *fs, expdesc *e) { - luaK_dischargevars(fs, e); - freeexp(fs, e); - luaK_reserveregs(fs, 1); - exp2reg(fs, e, fs->freereg - 1); -} - - -/* -** Ensures final expression result is in some (any) register -** and return that register. -*/ -int luaK_exp2anyreg (FuncState *fs, expdesc *e) { - luaK_dischargevars(fs, e); - if (e->k == VNONRELOC) { /* expression already has a register? */ - if (!hasjumps(e)) /* no jumps? */ - return e->u.info; /* result is already in a register */ - if (e->u.info >= luaY_nvarstack(fs)) { /* reg. is not a local? */ - exp2reg(fs, e, e->u.info); /* put final result in it */ - return e->u.info; - } - /* else expression has jumps and cannot change its register - to hold the jump values, because it is a local variable. - Go through to the default case. */ - } - luaK_exp2nextreg(fs, e); /* default: use next available register */ - return e->u.info; -} - - -/* -** Ensures final expression result is either in a register -** or in an upvalue. -*/ -void luaK_exp2anyregup (FuncState *fs, expdesc *e) { - if (e->k != VUPVAL || hasjumps(e)) - luaK_exp2anyreg(fs, e); -} - - -/* -** Ensures final expression result is either in a register -** or it is a constant. -*/ -void luaK_exp2val (FuncState *fs, expdesc *e) { - if (hasjumps(e)) - luaK_exp2anyreg(fs, e); - else - luaK_dischargevars(fs, e); -} - - -/* -** Try to make 'e' a K expression with an index in the range of R/K -** indices. Return true iff succeeded. -*/ -static int luaK_exp2K (FuncState *fs, expdesc *e) { - if (!hasjumps(e)) { - int info; - switch (e->k) { /* move constants to 'k' */ - case VTRUE: info = boolT(fs); break; - case VFALSE: info = boolF(fs); break; - case VNIL: info = nilK(fs); break; - case VKINT: info = luaK_intK(fs, e->u.ival); break; - case VKFLT: info = luaK_numberK(fs, e->u.nval); break; - case VKSTR: info = stringK(fs, e->u.strval); break; - case VK: info = e->u.info; break; - default: return 0; /* not a constant */ - } - if (info <= MAXINDEXRK) { /* does constant fit in 'argC'? */ - e->k = VK; /* make expression a 'K' expression */ - e->u.info = info; - return 1; - } - } - /* else, expression doesn't fit; leave it unchanged */ - return 0; -} - - -/* -** Ensures final expression result is in a valid R/K index -** (that is, it is either in a register or in 'k' with an index -** in the range of R/K indices). -** Returns 1 iff expression is K. -*/ -static int exp2RK (FuncState *fs, expdesc *e) { - if (luaK_exp2K(fs, e)) - return 1; - else { /* not a constant in the right range: put it in a register */ - luaK_exp2anyreg(fs, e); - return 0; - } -} - - -static void codeABRK (FuncState *fs, OpCode o, int a, int b, - expdesc *ec) { - int k = exp2RK(fs, ec); - luaK_codeABCk(fs, o, a, b, ec->u.info, k); -} - - -/* -** Generate code to store result of expression 'ex' into variable 'var'. -*/ -void luaK_storevar (FuncState *fs, expdesc *var, expdesc *ex) { - switch (var->k) { - case VLOCAL: { - freeexp(fs, ex); - exp2reg(fs, ex, var->u.var.ridx); /* compute 'ex' into proper place */ - return; - } - case VUPVAL: { - int e = luaK_exp2anyreg(fs, ex); - luaK_codeABC(fs, OP_SETUPVAL, e, var->u.info, 0); - break; - } - case VINDEXUP: { - codeABRK(fs, OP_SETTABUP, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXI: { - codeABRK(fs, OP_SETI, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXSTR: { - codeABRK(fs, OP_SETFIELD, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXED: { - codeABRK(fs, OP_SETTABLE, var->u.ind.t, var->u.ind.idx, ex); - break; - } - default: lua_assert(0); /* invalid var kind to store */ - } - freeexp(fs, ex); -} - - -/* -** Emit SELF instruction (convert expression 'e' into 'e:key(e,'). -*/ -void luaK_self (FuncState *fs, expdesc *e, expdesc *key) { - int ereg; - luaK_exp2anyreg(fs, e); - ereg = e->u.info; /* register where 'e' was placed */ - freeexp(fs, e); - e->u.info = fs->freereg; /* base register for op_self */ - e->k = VNONRELOC; /* self expression has a fixed register */ - luaK_reserveregs(fs, 2); /* function and 'self' produced by op_self */ - codeABRK(fs, OP_SELF, e->u.info, ereg, key); - freeexp(fs, key); -} - - -/* -** Negate condition 'e' (where 'e' is a comparison). -*/ -static void negatecondition (FuncState *fs, expdesc *e) { - Instruction *pc = getjumpcontrol(fs, e->u.info); - lua_assert(testTMode(GET_OPCODE(*pc)) && GET_OPCODE(*pc) != OP_TESTSET && - GET_OPCODE(*pc) != OP_TEST); - SETARG_k(*pc, (GETARG_k(*pc) ^ 1)); -} - - -/* -** Emit instruction to jump if 'e' is 'cond' (that is, if 'cond' -** is true, code will jump if 'e' is true.) Return jump position. -** Optimize when 'e' is 'not' something, inverting the condition -** and removing the 'not'. -*/ -static int jumponcond (FuncState *fs, expdesc *e, int cond) { - if (e->k == VRELOC) { - Instruction ie = getinstruction(fs, e); - if (GET_OPCODE(ie) == OP_NOT) { - removelastinstruction(fs); /* remove previous OP_NOT */ - return condjump(fs, OP_TEST, GETARG_B(ie), 0, 0, !cond); - } - /* else go through */ - } - discharge2anyreg(fs, e); - freeexp(fs, e); - return condjump(fs, OP_TESTSET, NO_REG, e->u.info, 0, cond); -} - - -/* -** Emit code to go through if 'e' is true, jump otherwise. -*/ -void luaK_goiftrue (FuncState *fs, expdesc *e) { - int pc; /* pc of new jump */ - luaK_dischargevars(fs, e); - switch (e->k) { - case VJMP: { /* condition? */ - negatecondition(fs, e); /* jump when it is false */ - pc = e->u.info; /* save jump position */ - break; - } - case VK: case VKFLT: case VKINT: case VKSTR: case VTRUE: { - pc = NO_JUMP; /* always true; do nothing */ - break; - } - default: { - pc = jumponcond(fs, e, 0); /* jump when false */ - break; - } - } - luaK_concat(fs, &e->f, pc); /* insert new jump in false list */ - luaK_patchtohere(fs, e->t); /* true list jumps to here (to go through) */ - e->t = NO_JUMP; -} - - -/* -** Emit code to go through if 'e' is false, jump otherwise. -*/ -void luaK_goiffalse (FuncState *fs, expdesc *e) { - int pc; /* pc of new jump */ - luaK_dischargevars(fs, e); - switch (e->k) { - case VJMP: { - pc = e->u.info; /* already jump if true */ - break; - } - case VNIL: case VFALSE: { - pc = NO_JUMP; /* always false; do nothing */ - break; - } - default: { - pc = jumponcond(fs, e, 1); /* jump if true */ - break; - } - } - luaK_concat(fs, &e->t, pc); /* insert new jump in 't' list */ - luaK_patchtohere(fs, e->f); /* false list jumps to here (to go through) */ - e->f = NO_JUMP; -} - - -/* -** Code 'not e', doing constant folding. -*/ -static void codenot (FuncState *fs, expdesc *e) { - switch (e->k) { - case VNIL: case VFALSE: { - e->k = VTRUE; /* true == not nil == not false */ - break; - } - case VK: case VKFLT: case VKINT: case VKSTR: case VTRUE: { - e->k = VFALSE; /* false == not "x" == not 0.5 == not 1 == not true */ - break; - } - case VJMP: { - negatecondition(fs, e); - break; - } - case VRELOC: - case VNONRELOC: { - discharge2anyreg(fs, e); - freeexp(fs, e); - e->u.info = luaK_codeABC(fs, OP_NOT, 0, e->u.info, 0); - e->k = VRELOC; - break; - } - default: lua_assert(0); /* cannot happen */ - } - /* interchange true and false lists */ - { int temp = e->f; e->f = e->t; e->t = temp; } - removevalues(fs, e->f); /* values are useless when negated */ - removevalues(fs, e->t); -} - - -/* -** Check whether expression 'e' is a short literal string -*/ -static int isKstr (FuncState *fs, expdesc *e) { - return (e->k == VK && !hasjumps(e) && e->u.info <= MAXARG_B && - ttisshrstring(&fs->f->k[e->u.info])); -} - -/* -** Check whether expression 'e' is a literal integer. -*/ -static int isKint (expdesc *e) { - return (e->k == VKINT && !hasjumps(e)); -} - - -/* -** Check whether expression 'e' is a literal integer in -** proper range to fit in register C -*/ -static int isCint (expdesc *e) { - return isKint(e) && (l_castS2U(e->u.ival) <= l_castS2U(MAXARG_C)); -} - - -/* -** Check whether expression 'e' is a literal integer in -** proper range to fit in register sC -*/ -static int isSCint (expdesc *e) { - return isKint(e) && fitsC(e->u.ival); -} - - -/* -** Check whether expression 'e' is a literal integer or float in -** proper range to fit in a register (sB or sC). -*/ -static int isSCnumber (expdesc *e, int *pi, int *isfloat) { - lua_Integer i; - if (e->k == VKINT) - i = e->u.ival; - else if (e->k == VKFLT && luaV_flttointeger(e->u.nval, &i, F2Ieq)) - *isfloat = 1; - else - return 0; /* not a number */ - if (!hasjumps(e) && fitsC(i)) { - *pi = int2sC(cast_int(i)); - return 1; - } - else - return 0; -} - - -/* -** Create expression 't[k]'. 't' must have its final result already in a -** register or upvalue. Upvalues can only be indexed by literal strings. -** Keys can be literal strings in the constant table or arbitrary -** values in registers. -*/ -void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) { - if (k->k == VKSTR) - str2K(fs, k); - lua_assert(!hasjumps(t) && - (t->k == VLOCAL || t->k == VNONRELOC || t->k == VUPVAL)); - if (t->k == VUPVAL && !isKstr(fs, k)) /* upvalue indexed by non 'Kstr'? */ - luaK_exp2anyreg(fs, t); /* put it in a register */ - if (t->k == VUPVAL) { - lua_assert(isKstr(fs, k)); - t->u.ind.t = t->u.info; /* upvalue index */ - t->u.ind.idx = k->u.info; /* literal short string */ - t->k = VINDEXUP; - } - else { - /* register index of the table */ - t->u.ind.t = (t->k == VLOCAL) ? t->u.var.ridx: t->u.info; - if (isKstr(fs, k)) { - t->u.ind.idx = k->u.info; /* literal short string */ - t->k = VINDEXSTR; - } - else if (isCint(k)) { - t->u.ind.idx = cast_int(k->u.ival); /* int. constant in proper range */ - t->k = VINDEXI; - } - else { - t->u.ind.idx = luaK_exp2anyreg(fs, k); /* register */ - t->k = VINDEXED; - } - } -} - - -/* -** Return false if folding can raise an error. -** Bitwise operations need operands convertible to integers; division -** operations cannot have 0 as divisor. -*/ -static int validop (int op, TValue *v1, TValue *v2) { - switch (op) { - case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: - case LUA_OPSHL: case LUA_OPSHR: case LUA_OPBNOT: { /* conversion errors */ - lua_Integer i; - return (luaV_tointegerns(v1, &i, LUA_FLOORN2I) && - luaV_tointegerns(v2, &i, LUA_FLOORN2I)); - } - case LUA_OPDIV: case LUA_OPIDIV: case LUA_OPMOD: /* division by 0 */ - return (nvalue(v2) != 0); - default: return 1; /* everything else is valid */ - } -} - - -/* -** Try to "constant-fold" an operation; return 1 iff successful. -** (In this case, 'e1' has the final result.) -*/ -static int constfolding (FuncState *fs, int op, expdesc *e1, - const expdesc *e2) { - TValue v1, v2, res; - if (!tonumeral(e1, &v1) || !tonumeral(e2, &v2) || !validop(op, &v1, &v2)) - return 0; /* non-numeric operands or not safe to fold */ - luaO_rawarith(fs->ls->L, op, &v1, &v2, &res); /* does operation */ - if (ttisinteger(&res)) { - e1->k = VKINT; - e1->u.ival = ivalue(&res); - } - else { /* folds neither NaN nor 0.0 (to avoid problems with -0.0) */ - lua_Number n = fltvalue(&res); - if (luai_numisnan(n) || n == 0) - return 0; - e1->k = VKFLT; - e1->u.nval = n; - } - return 1; -} - - -/* -** Convert a BinOpr to an OpCode (ORDER OPR - ORDER OP) -*/ -l_sinline OpCode binopr2op (BinOpr opr, BinOpr baser, OpCode base) { - lua_assert(baser <= opr && - ((baser == OPR_ADD && opr <= OPR_SHR) || - (baser == OPR_LT && opr <= OPR_LE))); - return cast(OpCode, (cast_int(opr) - cast_int(baser)) + cast_int(base)); -} - - -/* -** Convert a UnOpr to an OpCode (ORDER OPR - ORDER OP) -*/ -l_sinline OpCode unopr2op (UnOpr opr) { - return cast(OpCode, (cast_int(opr) - cast_int(OPR_MINUS)) + - cast_int(OP_UNM)); -} - - -/* -** Convert a BinOpr to a tag method (ORDER OPR - ORDER TM) -*/ -l_sinline TMS binopr2TM (BinOpr opr) { - lua_assert(OPR_ADD <= opr && opr <= OPR_SHR); - return cast(TMS, (cast_int(opr) - cast_int(OPR_ADD)) + cast_int(TM_ADD)); -} - - -/* -** Emit code for unary expressions that "produce values" -** (everything but 'not'). -** Expression to produce final result will be encoded in 'e'. -*/ -static void codeunexpval (FuncState *fs, OpCode op, expdesc *e, int line) { - int r = luaK_exp2anyreg(fs, e); /* opcodes operate only on registers */ - freeexp(fs, e); - e->u.info = luaK_codeABC(fs, op, 0, r, 0); /* generate opcode */ - e->k = VRELOC; /* all those operations are relocatable */ - luaK_fixline(fs, line); -} - - -/* -** Emit code for binary expressions that "produce values" -** (everything but logical operators 'and'/'or' and comparison -** operators). -** Expression to produce final result will be encoded in 'e1'. -*/ -static void finishbinexpval (FuncState *fs, expdesc *e1, expdesc *e2, - OpCode op, int v2, int flip, int line, - OpCode mmop, TMS event) { - int v1 = luaK_exp2anyreg(fs, e1); - int pc = luaK_codeABCk(fs, op, 0, v1, v2, 0); - freeexps(fs, e1, e2); - e1->u.info = pc; - e1->k = VRELOC; /* all those operations are relocatable */ - luaK_fixline(fs, line); - luaK_codeABCk(fs, mmop, v1, v2, event, flip); /* to call metamethod */ - luaK_fixline(fs, line); -} - - -/* -** Emit code for binary expressions that "produce values" over -** two registers. -*/ -static void codebinexpval (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - OpCode op = binopr2op(opr, OPR_ADD, OP_ADD); - int v2 = luaK_exp2anyreg(fs, e2); /* make sure 'e2' is in a register */ - /* 'e1' must be already in a register or it is a constant */ - lua_assert((VNIL <= e1->k && e1->k <= VKSTR) || - e1->k == VNONRELOC || e1->k == VRELOC); - lua_assert(OP_ADD <= op && op <= OP_SHR); - finishbinexpval(fs, e1, e2, op, v2, 0, line, OP_MMBIN, binopr2TM(opr)); -} - - -/* -** Code binary operators with immediate operands. -*/ -static void codebini (FuncState *fs, OpCode op, - expdesc *e1, expdesc *e2, int flip, int line, - TMS event) { - int v2 = int2sC(cast_int(e2->u.ival)); /* immediate operand */ - lua_assert(e2->k == VKINT); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINI, event); -} - - -/* -** Code binary operators with K operand. -*/ -static void codebinK (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - TMS event = binopr2TM(opr); - int v2 = e2->u.info; /* K index */ - OpCode op = binopr2op(opr, OPR_ADD, OP_ADDK); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINK, event); -} - - -/* Try to code a binary operator negating its second operand. -** For the metamethod, 2nd operand must keep its original value. -*/ -static int finishbinexpneg (FuncState *fs, expdesc *e1, expdesc *e2, - OpCode op, int line, TMS event) { - if (!isKint(e2)) - return 0; /* not an integer constant */ - else { - lua_Integer i2 = e2->u.ival; - if (!(fitsC(i2) && fitsC(-i2))) - return 0; /* not in the proper range */ - else { /* operating a small integer constant */ - int v2 = cast_int(i2); - finishbinexpval(fs, e1, e2, op, int2sC(-v2), 0, line, OP_MMBINI, event); - /* correct metamethod argument */ - SETARG_B(fs->f->code[fs->pc - 1], int2sC(v2)); - return 1; /* successfully coded */ - } - } -} - - -static void swapexps (expdesc *e1, expdesc *e2) { - expdesc temp = *e1; *e1 = *e2; *e2 = temp; /* swap 'e1' and 'e2' */ -} - - -/* -** Code binary operators with no constant operand. -*/ -static void codebinNoK (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - if (flip) - swapexps(e1, e2); /* back to original order */ - codebinexpval(fs, opr, e1, e2, line); /* use standard operators */ -} - - -/* -** Code arithmetic operators ('+', '-', ...). If second operand is a -** constant in the proper range, use variant opcodes with K operands. -*/ -static void codearith (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - if (tonumeral(e2, NULL) && luaK_exp2K(fs, e2)) /* K operand? */ - codebinK(fs, opr, e1, e2, flip, line); - else /* 'e2' is neither an immediate nor a K operand */ - codebinNoK(fs, opr, e1, e2, flip, line); -} - - -/* -** Code commutative operators ('+', '*'). If first operand is a -** numeric constant, change order of operands to try to use an -** immediate or K operator. -*/ -static void codecommutative (FuncState *fs, BinOpr op, - expdesc *e1, expdesc *e2, int line) { - int flip = 0; - if (tonumeral(e1, NULL)) { /* is first operand a numeric constant? */ - swapexps(e1, e2); /* change order */ - flip = 1; - } - if (op == OPR_ADD && isSCint(e2)) /* immediate operand? */ - codebini(fs, OP_ADDI, e1, e2, flip, line, TM_ADD); - else - codearith(fs, op, e1, e2, flip, line); -} - - -/* -** Code bitwise operations; they are all commutative, so the function -** tries to put an integer constant as the 2nd operand (a K operand). -*/ -static void codebitwise (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - int flip = 0; - if (e1->k == VKINT) { - swapexps(e1, e2); /* 'e2' will be the constant operand */ - flip = 1; - } - if (e2->k == VKINT && luaK_exp2K(fs, e2)) /* K operand? */ - codebinK(fs, opr, e1, e2, flip, line); - else /* no constants */ - codebinNoK(fs, opr, e1, e2, flip, line); -} - - -/* -** Emit code for order comparisons. When using an immediate operand, -** 'isfloat' tells whether the original value was a float. -*/ -static void codeorder (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { - int r1, r2; - int im; - int isfloat = 0; - OpCode op; - if (isSCnumber(e2, &im, &isfloat)) { - /* use immediate operand */ - r1 = luaK_exp2anyreg(fs, e1); - r2 = im; - op = binopr2op(opr, OPR_LT, OP_LTI); - } - else if (isSCnumber(e1, &im, &isfloat)) { - /* transform (A < B) to (B > A) and (A <= B) to (B >= A) */ - r1 = luaK_exp2anyreg(fs, e2); - r2 = im; - op = binopr2op(opr, OPR_LT, OP_GTI); - } - else { /* regular case, compare two registers */ - r1 = luaK_exp2anyreg(fs, e1); - r2 = luaK_exp2anyreg(fs, e2); - op = binopr2op(opr, OPR_LT, OP_LT); - } - freeexps(fs, e1, e2); - e1->u.info = condjump(fs, op, r1, r2, isfloat, 1); - e1->k = VJMP; -} - - -/* -** Emit code for equality comparisons ('==', '~='). -** 'e1' was already put as RK by 'luaK_infix'. -*/ -static void codeeq (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { - int r1, r2; - int im; - int isfloat = 0; /* not needed here, but kept for symmetry */ - OpCode op; - if (e1->k != VNONRELOC) { - lua_assert(e1->k == VK || e1->k == VKINT || e1->k == VKFLT); - swapexps(e1, e2); - } - r1 = luaK_exp2anyreg(fs, e1); /* 1st expression must be in register */ - if (isSCnumber(e2, &im, &isfloat)) { - op = OP_EQI; - r2 = im; /* immediate operand */ - } - else if (exp2RK(fs, e2)) { /* 2nd expression is constant? */ - op = OP_EQK; - r2 = e2->u.info; /* constant index */ - } - else { - op = OP_EQ; /* will compare two registers */ - r2 = luaK_exp2anyreg(fs, e2); - } - freeexps(fs, e1, e2); - e1->u.info = condjump(fs, op, r1, r2, isfloat, (opr == OPR_EQ)); - e1->k = VJMP; -} - - -/* -** Apply prefix operation 'op' to expression 'e'. -*/ -void luaK_prefix (FuncState *fs, UnOpr opr, expdesc *e, int line) { - static const expdesc ef = {VKINT, {0}, NO_JUMP, NO_JUMP}; - luaK_dischargevars(fs, e); - switch (opr) { - case OPR_MINUS: case OPR_BNOT: /* use 'ef' as fake 2nd operand */ - if (constfolding(fs, opr + LUA_OPUNM, e, &ef)) - break; - /* else */ /* FALLTHROUGH */ - case OPR_LEN: - codeunexpval(fs, unopr2op(opr), e, line); - break; - case OPR_NOT: codenot(fs, e); break; - default: lua_assert(0); - } -} - - -/* -** Process 1st operand 'v' of binary operation 'op' before reading -** 2nd operand. -*/ -void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) { - luaK_dischargevars(fs, v); - switch (op) { - case OPR_AND: { - luaK_goiftrue(fs, v); /* go ahead only if 'v' is true */ - break; - } - case OPR_OR: { - luaK_goiffalse(fs, v); /* go ahead only if 'v' is false */ - break; - } - case OPR_CONCAT: { - luaK_exp2nextreg(fs, v); /* operand must be on the stack */ - break; - } - case OPR_ADD: case OPR_SUB: - case OPR_MUL: case OPR_DIV: case OPR_IDIV: - case OPR_MOD: case OPR_POW: - case OPR_BAND: case OPR_BOR: case OPR_BXOR: - case OPR_SHL: case OPR_SHR: { - if (!tonumeral(v, NULL)) - luaK_exp2anyreg(fs, v); - /* else keep numeral, which may be folded or used as an immediate - operand */ - break; - } - case OPR_EQ: case OPR_NE: { - if (!tonumeral(v, NULL)) - exp2RK(fs, v); - /* else keep numeral, which may be an immediate operand */ - break; - } - case OPR_LT: case OPR_LE: - case OPR_GT: case OPR_GE: { - int dummy, dummy2; - if (!isSCnumber(v, &dummy, &dummy2)) - luaK_exp2anyreg(fs, v); - /* else keep numeral, which may be an immediate operand */ - break; - } - default: lua_assert(0); - } -} - -/* -** Create code for '(e1 .. e2)'. -** For '(e1 .. e2.1 .. e2.2)' (which is '(e1 .. (e2.1 .. e2.2))', -** because concatenation is right associative), merge both CONCATs. -*/ -static void codeconcat (FuncState *fs, expdesc *e1, expdesc *e2, int line) { - Instruction *ie2 = previousinstruction(fs); - if (GET_OPCODE(*ie2) == OP_CONCAT) { /* is 'e2' a concatenation? */ - int n = GETARG_B(*ie2); /* # of elements concatenated in 'e2' */ - lua_assert(e1->u.info + 1 == GETARG_A(*ie2)); - freeexp(fs, e2); - SETARG_A(*ie2, e1->u.info); /* correct first element ('e1') */ - SETARG_B(*ie2, n + 1); /* will concatenate one more element */ - } - else { /* 'e2' is not a concatenation */ - luaK_codeABC(fs, OP_CONCAT, e1->u.info, 2, 0); /* new concat opcode */ - freeexp(fs, e2); - luaK_fixline(fs, line); - } -} - - -/* -** Finalize code for binary operation, after reading 2nd operand. -*/ -void luaK_posfix (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - luaK_dischargevars(fs, e2); - if (foldbinop(opr) && constfolding(fs, opr + LUA_OPADD, e1, e2)) - return; /* done by folding */ - switch (opr) { - case OPR_AND: { - lua_assert(e1->t == NO_JUMP); /* list closed by 'luaK_infix' */ - luaK_concat(fs, &e2->f, e1->f); - *e1 = *e2; - break; - } - case OPR_OR: { - lua_assert(e1->f == NO_JUMP); /* list closed by 'luaK_infix' */ - luaK_concat(fs, &e2->t, e1->t); - *e1 = *e2; - break; - } - case OPR_CONCAT: { /* e1 .. e2 */ - luaK_exp2nextreg(fs, e2); - codeconcat(fs, e1, e2, line); - break; - } - case OPR_ADD: case OPR_MUL: { - codecommutative(fs, opr, e1, e2, line); - break; - } - case OPR_SUB: { - if (finishbinexpneg(fs, e1, e2, OP_ADDI, line, TM_SUB)) - break; /* coded as (r1 + -I) */ - /* ELSE */ - } /* FALLTHROUGH */ - case OPR_DIV: case OPR_IDIV: case OPR_MOD: case OPR_POW: { - codearith(fs, opr, e1, e2, 0, line); - break; - } - case OPR_BAND: case OPR_BOR: case OPR_BXOR: { - codebitwise(fs, opr, e1, e2, line); - break; - } - case OPR_SHL: { - if (isSCint(e1)) { - swapexps(e1, e2); - codebini(fs, OP_SHLI, e1, e2, 1, line, TM_SHL); /* I << r2 */ - } - else if (finishbinexpneg(fs, e1, e2, OP_SHRI, line, TM_SHL)) { - /* coded as (r1 >> -I) */; - } - else /* regular case (two registers) */ - codebinexpval(fs, opr, e1, e2, line); - break; - } - case OPR_SHR: { - if (isSCint(e2)) - codebini(fs, OP_SHRI, e1, e2, 0, line, TM_SHR); /* r1 >> I */ - else /* regular case (two registers) */ - codebinexpval(fs, opr, e1, e2, line); - break; - } - case OPR_EQ: case OPR_NE: { - codeeq(fs, opr, e1, e2); - break; - } - case OPR_GT: case OPR_GE: { - /* '(a > b)' <=> '(b < a)'; '(a >= b)' <=> '(b <= a)' */ - swapexps(e1, e2); - opr = cast(BinOpr, (opr - OPR_GT) + OPR_LT); - } /* FALLTHROUGH */ - case OPR_LT: case OPR_LE: { - codeorder(fs, opr, e1, e2); - break; - } - default: lua_assert(0); - } -} - - -/* -** Change line information associated with current position, by removing -** previous info and adding it again with new line. -*/ -void luaK_fixline (FuncState *fs, int line) { - removelastlineinfo(fs); - savelineinfo(fs, fs->f, line); -} - - -void luaK_settablesize (FuncState *fs, int pc, int ra, int asize, int hsize) { - Instruction *inst = &fs->f->code[pc]; - int rb = (hsize != 0) ? luaO_ceillog2(hsize) + 1 : 0; /* hash size */ - int extra = asize / (MAXARG_C + 1); /* higher bits of array size */ - int rc = asize % (MAXARG_C + 1); /* lower bits of array size */ - int k = (extra > 0); /* true iff needs extra argument */ - *inst = CREATE_ABCk(OP_NEWTABLE, ra, rb, rc, k); - *(inst + 1) = CREATE_Ax(OP_EXTRAARG, extra); -} - - -/* -** Emit a SETLIST instruction. -** 'base' is register that keeps table; -** 'nelems' is #table plus those to be stored now; -** 'tostore' is number of values (in registers 'base + 1',...) to add to -** table (or LUA_MULTRET to add up to stack top). -*/ -void luaK_setlist (FuncState *fs, int base, int nelems, int tostore) { - lua_assert(tostore != 0 && tostore <= LFIELDS_PER_FLUSH); - if (tostore == LUA_MULTRET) - tostore = 0; - if (nelems <= MAXARG_C) - luaK_codeABC(fs, OP_SETLIST, base, tostore, nelems); - else { - int extra = nelems / (MAXARG_C + 1); - nelems %= (MAXARG_C + 1); - luaK_codeABCk(fs, OP_SETLIST, base, tostore, nelems, 1); - codeextraarg(fs, extra); - } - fs->freereg = base + 1; /* free registers with list values */ -} - - -/* -** return the final target of a jump (skipping jumps to jumps) -*/ -static int finaltarget (Instruction *code, int i) { - int count; - for (count = 0; count < 100; count++) { /* avoid infinite loops */ - Instruction pc = code[i]; - if (GET_OPCODE(pc) != OP_JMP) - break; - else - i += GETARG_sJ(pc) + 1; - } - return i; -} - - -/* -** Do a final pass over the code of a function, doing small peephole -** optimizations and adjustments. -*/ -void luaK_finish (FuncState *fs) { - int i; - Proto *p = fs->f; - for (i = 0; i < fs->pc; i++) { - Instruction *pc = &p->code[i]; - lua_assert(i == 0 || isOT(*(pc - 1)) == isIT(*pc)); - switch (GET_OPCODE(*pc)) { - case OP_RETURN0: case OP_RETURN1: { - if (!(fs->needclose || (p->flag & PF_ISVARARG))) - break; /* no extra work */ - /* else use OP_RETURN to do the extra work */ - SET_OPCODE(*pc, OP_RETURN); - } /* FALLTHROUGH */ - case OP_RETURN: case OP_TAILCALL: { - if (fs->needclose) - SETARG_k(*pc, 1); /* signal that it needs to close */ - if (p->flag & PF_ISVARARG) - SETARG_C(*pc, p->numparams + 1); /* signal that it is vararg */ - break; - } - case OP_JMP: { - int target = finaltarget(p->code, i); - fixjump(fs, i, target); - break; - } - default: break; - } - } -} diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lcode.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lcode.h deleted file mode 100644 index 5b8eb29..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lcode.h +++ /dev/null @@ -1,101 +0,0 @@ -/* -** $Id: lcode.h $ -** Code generator for Lua -** See Copyright Notice in lua.h -*/ - -#ifndef lcode_h -#define lcode_h - -#include "llex.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lparser.h" - - -/* -** Marks the end of a patch list. It is an invalid value both as an absolute -** address, and as a list link (would link an element to itself). -*/ -#define NO_JUMP (-1) - - -/* -** grep "ORDER OPR" if you change these enums (ORDER OP) -*/ -typedef enum BinOpr { - /* arithmetic operators */ - OPR_ADD, OPR_SUB, OPR_MUL, OPR_MOD, OPR_POW, - OPR_DIV, OPR_IDIV, - /* bitwise operators */ - OPR_BAND, OPR_BOR, OPR_BXOR, - OPR_SHL, OPR_SHR, - /* string operator */ - OPR_CONCAT, - /* comparison operators */ - OPR_EQ, OPR_LT, OPR_LE, - OPR_NE, OPR_GT, OPR_GE, - /* logical operators */ - OPR_AND, OPR_OR, - OPR_NOBINOPR -} BinOpr; - - -/* true if operation is foldable (that is, it is arithmetic or bitwise) */ -#define foldbinop(op) ((op) <= OPR_SHR) - - -#define luaK_codeABC(fs,o,a,b,c) luaK_codeABCk(fs,o,a,b,c,0) - - -typedef enum UnOpr { OPR_MINUS, OPR_BNOT, OPR_NOT, OPR_LEN, OPR_NOUNOPR } UnOpr; - - -/* get (pointer to) instruction of given 'expdesc' */ -#define getinstruction(fs,e) ((fs)->f->code[(e)->u.info]) - - -#define luaK_setmultret(fs,e) luaK_setreturns(fs, e, LUA_MULTRET) - -#define luaK_jumpto(fs,t) luaK_patchlist(fs, luaK_jump(fs), t) - -LUAI_FUNC int luaK_code (FuncState *fs, Instruction i); -LUAI_FUNC int luaK_codeABx (FuncState *fs, OpCode o, int A, unsigned Bx); -LUAI_FUNC int luaK_codeABCk (FuncState *fs, OpCode o, int A, - int B, int C, int k); -LUAI_FUNC int luaK_exp2const (FuncState *fs, const expdesc *e, TValue *v); -LUAI_FUNC void luaK_fixline (FuncState *fs, int line); -LUAI_FUNC void luaK_nil (FuncState *fs, int from, int n); -LUAI_FUNC void luaK_reserveregs (FuncState *fs, int n); -LUAI_FUNC void luaK_checkstack (FuncState *fs, int n); -LUAI_FUNC void luaK_int (FuncState *fs, int reg, lua_Integer n); -LUAI_FUNC void luaK_dischargevars (FuncState *fs, expdesc *e); -LUAI_FUNC int luaK_exp2anyreg (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2anyregup (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2nextreg (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2val (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_self (FuncState *fs, expdesc *e, expdesc *key); -LUAI_FUNC void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k); -LUAI_FUNC void luaK_goiftrue (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_goiffalse (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_storevar (FuncState *fs, expdesc *var, expdesc *e); -LUAI_FUNC void luaK_setreturns (FuncState *fs, expdesc *e, int nresults); -LUAI_FUNC void luaK_setoneret (FuncState *fs, expdesc *e); -LUAI_FUNC int luaK_jump (FuncState *fs); -LUAI_FUNC void luaK_ret (FuncState *fs, int first, int nret); -LUAI_FUNC void luaK_patchlist (FuncState *fs, int list, int target); -LUAI_FUNC void luaK_patchtohere (FuncState *fs, int list); -LUAI_FUNC void luaK_concat (FuncState *fs, int *l1, int l2); -LUAI_FUNC int luaK_getlabel (FuncState *fs); -LUAI_FUNC void luaK_prefix (FuncState *fs, UnOpr op, expdesc *v, int line); -LUAI_FUNC void luaK_infix (FuncState *fs, BinOpr op, expdesc *v); -LUAI_FUNC void luaK_posfix (FuncState *fs, BinOpr op, expdesc *v1, - expdesc *v2, int line); -LUAI_FUNC void luaK_settablesize (FuncState *fs, int pc, - int ra, int asize, int hsize); -LUAI_FUNC void luaK_setlist (FuncState *fs, int base, int nelems, int tostore); -LUAI_FUNC void luaK_finish (FuncState *fs); -LUAI_FUNC l_noret luaK_semerror (LexState *ls, const char *msg); - - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lcorolib.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lcorolib.c deleted file mode 100644 index c64adf0..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lcorolib.c +++ /dev/null @@ -1,210 +0,0 @@ -/* -** $Id: lcorolib.c $ -** Coroutine Library -** See Copyright Notice in lua.h -*/ - -#define lcorolib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -static lua_State *getco (lua_State *L) { - lua_State *co = lua_tothread(L, 1); - luaL_argexpected(L, co, 1, "thread"); - return co; -} - - -/* -** Resumes a coroutine. Returns the number of results for non-error -** cases or -1 for errors. -*/ -static int auxresume (lua_State *L, lua_State *co, int narg) { - int status, nres; - if (l_unlikely(!lua_checkstack(co, narg))) { - lua_pushliteral(L, "too many arguments to resume"); - return -1; /* error flag */ - } - lua_xmove(L, co, narg); - status = lua_resume(co, L, narg, &nres); - if (l_likely(status == LUA_OK || status == LUA_YIELD)) { - if (l_unlikely(!lua_checkstack(L, nres + 1))) { - lua_pop(co, nres); /* remove results anyway */ - lua_pushliteral(L, "too many results to resume"); - return -1; /* error flag */ - } - lua_xmove(co, L, nres); /* move yielded values */ - return nres; - } - else { - lua_xmove(co, L, 1); /* move error message */ - return -1; /* error flag */ - } -} - - -static int luaB_coresume (lua_State *L) { - lua_State *co = getco(L); - int r; - r = auxresume(L, co, lua_gettop(L) - 1); - if (l_unlikely(r < 0)) { - lua_pushboolean(L, 0); - lua_insert(L, -2); - return 2; /* return false + error message */ - } - else { - lua_pushboolean(L, 1); - lua_insert(L, -(r + 1)); - return r + 1; /* return true + 'resume' returns */ - } -} - - -static int luaB_auxwrap (lua_State *L) { - lua_State *co = lua_tothread(L, lua_upvalueindex(1)); - int r = auxresume(L, co, lua_gettop(L)); - if (l_unlikely(r < 0)) { /* error? */ - int stat = lua_status(co); - if (stat != LUA_OK && stat != LUA_YIELD) { /* error in the coroutine? */ - stat = lua_closethread(co, L); /* close its tbc variables */ - lua_assert(stat != LUA_OK); - lua_xmove(co, L, 1); /* move error message to the caller */ - } - if (stat != LUA_ERRMEM && /* not a memory error and ... */ - lua_type(L, -1) == LUA_TSTRING) { /* ... error object is a string? */ - luaL_where(L, 1); /* add extra info, if available */ - lua_insert(L, -2); - lua_concat(L, 2); - } - return lua_error(L); /* propagate error */ - } - return r; -} - - -static int luaB_cocreate (lua_State *L) { - lua_State *NL; - luaL_checktype(L, 1, LUA_TFUNCTION); - NL = lua_newthread(L); - lua_pushvalue(L, 1); /* move function to top */ - lua_xmove(L, NL, 1); /* move function from L to NL */ - return 1; -} - - -static int luaB_cowrap (lua_State *L) { - luaB_cocreate(L); - lua_pushcclosure(L, luaB_auxwrap, 1); - return 1; -} - - -static int luaB_yield (lua_State *L) { - return lua_yield(L, lua_gettop(L)); -} - - -#define COS_RUN 0 -#define COS_DEAD 1 -#define COS_YIELD 2 -#define COS_NORM 3 - - -static const char *const statname[] = - {"running", "dead", "suspended", "normal"}; - - -static int auxstatus (lua_State *L, lua_State *co) { - if (L == co) return COS_RUN; - else { - switch (lua_status(co)) { - case LUA_YIELD: - return COS_YIELD; - case LUA_OK: { - lua_Debug ar; - if (lua_getstack(co, 0, &ar)) /* does it have frames? */ - return COS_NORM; /* it is running */ - else if (lua_gettop(co) == 0) - return COS_DEAD; - else - return COS_YIELD; /* initial state */ - } - default: /* some error occurred */ - return COS_DEAD; - } - } -} - - -static int luaB_costatus (lua_State *L) { - lua_State *co = getco(L); - lua_pushstring(L, statname[auxstatus(L, co)]); - return 1; -} - - -static int luaB_yieldable (lua_State *L) { - lua_State *co = lua_isnone(L, 1) ? L : getco(L); - lua_pushboolean(L, lua_isyieldable(co)); - return 1; -} - - -static int luaB_corunning (lua_State *L) { - int ismain = lua_pushthread(L); - lua_pushboolean(L, ismain); - return 2; -} - - -static int luaB_close (lua_State *L) { - lua_State *co = getco(L); - int status = auxstatus(L, co); - switch (status) { - case COS_DEAD: case COS_YIELD: { - status = lua_closethread(co, L); - if (status == LUA_OK) { - lua_pushboolean(L, 1); - return 1; - } - else { - lua_pushboolean(L, 0); - lua_xmove(co, L, 1); /* move error message */ - return 2; - } - } - default: /* normal or running coroutine */ - return luaL_error(L, "cannot close a %s coroutine", statname[status]); - } -} - - -static const luaL_Reg co_funcs[] = { - {"create", luaB_cocreate}, - {"resume", luaB_coresume}, - {"running", luaB_corunning}, - {"status", luaB_costatus}, - {"wrap", luaB_cowrap}, - {"yield", luaB_yield}, - {"isyieldable", luaB_yieldable}, - {"close", luaB_close}, - {NULL, NULL} -}; - - - -LUAMOD_API int luaopen_coroutine (lua_State *L) { - luaL_newlib(L, co_funcs); - return 1; -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lctype.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lctype.c deleted file mode 100644 index 9542280..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lctype.c +++ /dev/null @@ -1,64 +0,0 @@ -/* -** $Id: lctype.c $ -** 'ctype' functions for Lua -** See Copyright Notice in lua.h -*/ - -#define lctype_c -#define LUA_CORE - -#include "lprefix.h" - - -#include "lctype.h" - -#if !LUA_USE_CTYPE /* { */ - -#include - - -#if defined (LUA_UCID) /* accept UniCode IDentifiers? */ -/* consider all non-ascii codepoints to be alphabetic */ -#define NONA 0x01 -#else -#define NONA 0x00 /* default */ -#endif - - -LUAI_DDEF const lu_byte luai_ctype_[UCHAR_MAX + 2] = { - 0x00, /* EOZ */ - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0. */ - 0x00, 0x08, 0x08, 0x08, 0x08, 0x08, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 1. */ - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x0c, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, /* 2. */ - 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, /* 3. */ - 0x16, 0x16, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x04, 0x15, 0x15, 0x15, 0x15, 0x15, 0x15, 0x05, /* 4. */ - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, /* 5. */ - 0x05, 0x05, 0x05, 0x04, 0x04, 0x04, 0x04, 0x05, - 0x04, 0x15, 0x15, 0x15, 0x15, 0x15, 0x15, 0x05, /* 6. */ - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, /* 7. */ - 0x05, 0x05, 0x05, 0x04, 0x04, 0x04, 0x04, 0x00, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* 8. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* 9. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* a. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* b. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - 0x00, 0x00, NONA, NONA, NONA, NONA, NONA, NONA, /* c. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* d. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* e. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, 0x00, 0x00, 0x00, /* f. */ - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 -}; - -#endif /* } */ diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lctype.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lctype.h deleted file mode 100644 index 864e190..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lctype.h +++ /dev/null @@ -1,101 +0,0 @@ -/* -** $Id: lctype.h $ -** 'ctype' functions for Lua -** See Copyright Notice in lua.h -*/ - -#ifndef lctype_h -#define lctype_h - -#include "lua.h" - - -/* -** WARNING: the functions defined here do not necessarily correspond -** to the similar functions in the standard C ctype.h. They are -** optimized for the specific needs of Lua. -*/ - -#if !defined(LUA_USE_CTYPE) - -#if 'A' == 65 && '0' == 48 -/* ASCII case: can use its own tables; faster and fixed */ -#define LUA_USE_CTYPE 0 -#else -/* must use standard C ctype */ -#define LUA_USE_CTYPE 1 -#endif - -#endif - - -#if !LUA_USE_CTYPE /* { */ - -#include - -#include "llimits.h" - - -#define ALPHABIT 0 -#define DIGITBIT 1 -#define PRINTBIT 2 -#define SPACEBIT 3 -#define XDIGITBIT 4 - - -#define MASK(B) (1 << (B)) - - -/* -** add 1 to char to allow index -1 (EOZ) -*/ -#define testprop(c,p) (luai_ctype_[(c)+1] & (p)) - -/* -** 'lalpha' (Lua alphabetic) and 'lalnum' (Lua alphanumeric) both include '_' -*/ -#define lislalpha(c) testprop(c, MASK(ALPHABIT)) -#define lislalnum(c) testprop(c, (MASK(ALPHABIT) | MASK(DIGITBIT))) -#define lisdigit(c) testprop(c, MASK(DIGITBIT)) -#define lisspace(c) testprop(c, MASK(SPACEBIT)) -#define lisprint(c) testprop(c, MASK(PRINTBIT)) -#define lisxdigit(c) testprop(c, MASK(XDIGITBIT)) - - -/* -** In ASCII, this 'ltolower' is correct for alphabetic characters and -** for '.'. That is enough for Lua needs. ('check_exp' ensures that -** the character either is an upper-case letter or is unchanged by -** the transformation, which holds for lower-case letters and '.'.) -*/ -#define ltolower(c) \ - check_exp(('A' <= (c) && (c) <= 'Z') || (c) == ((c) | ('A' ^ 'a')), \ - (c) | ('A' ^ 'a')) - - -/* one entry for each character and for -1 (EOZ) */ -LUAI_DDEC(const lu_byte luai_ctype_[UCHAR_MAX + 2];) - - -#else /* }{ */ - -/* -** use standard C ctypes -*/ - -#include - - -#define lislalpha(c) (isalpha(c) || (c) == '_') -#define lislalnum(c) (isalnum(c) || (c) == '_') -#define lisdigit(c) (isdigit(c)) -#define lisspace(c) (isspace(c)) -#define lisprint(c) (isprint(c)) -#define lisxdigit(c) (isxdigit(c)) - -#define ltolower(c) (tolower(c)) - -#endif /* } */ - -#endif - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/ldblib.c b/build/c/dependencies/luaCEmbed/dependencies/lua/ldblib.c deleted file mode 100644 index 2c94138..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/ldblib.c +++ /dev/null @@ -1,474 +0,0 @@ -/* -** $Id: ldblib.c $ -** Interface from Lua to its debug API -** See Copyright Notice in lua.h -*/ - -#define ldblib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** The hook table at registry[HOOKKEY] maps threads to their current -** hook function. -*/ -static const char *const HOOKKEY = "_HOOKKEY"; - - -/* -** If L1 != L, L1 can be in any state, and therefore there are no -** guarantees about its stack space; any push in L1 must be -** checked. -*/ -static void checkstack (lua_State *L, lua_State *L1, int n) { - if (l_unlikely(L != L1 && !lua_checkstack(L1, n))) - luaL_error(L, "stack overflow"); -} - - -static int db_getregistry (lua_State *L) { - lua_pushvalue(L, LUA_REGISTRYINDEX); - return 1; -} - - -static int db_getmetatable (lua_State *L) { - luaL_checkany(L, 1); - if (!lua_getmetatable(L, 1)) { - lua_pushnil(L); /* no metatable */ - } - return 1; -} - - -static int db_setmetatable (lua_State *L) { - int t = lua_type(L, 2); - luaL_argexpected(L, t == LUA_TNIL || t == LUA_TTABLE, 2, "nil or table"); - lua_settop(L, 2); - lua_setmetatable(L, 1); - return 1; /* return 1st argument */ -} - - -static int db_getuservalue (lua_State *L) { - int n = (int)luaL_optinteger(L, 2, 1); - if (lua_type(L, 1) != LUA_TUSERDATA) - luaL_pushfail(L); - else if (lua_getiuservalue(L, 1, n) != LUA_TNONE) { - lua_pushboolean(L, 1); - return 2; - } - return 1; -} - - -static int db_setuservalue (lua_State *L) { - int n = (int)luaL_optinteger(L, 3, 1); - luaL_checktype(L, 1, LUA_TUSERDATA); - luaL_checkany(L, 2); - lua_settop(L, 2); - if (!lua_setiuservalue(L, 1, n)) - luaL_pushfail(L); - return 1; -} - - -/* -** Auxiliary function used by several library functions: check for -** an optional thread as function's first argument and set 'arg' with -** 1 if this argument is present (so that functions can skip it to -** access their other arguments) -*/ -static lua_State *getthread (lua_State *L, int *arg) { - if (lua_isthread(L, 1)) { - *arg = 1; - return lua_tothread(L, 1); - } - else { - *arg = 0; - return L; /* function will operate over current thread */ - } -} - - -/* -** Variations of 'lua_settable', used by 'db_getinfo' to put results -** from 'lua_getinfo' into result table. Key is always a string; -** value can be a string, an int, or a boolean. -*/ -static void settabss (lua_State *L, const char *k, const char *v) { - lua_pushstring(L, v); - lua_setfield(L, -2, k); -} - -static void settabsi (lua_State *L, const char *k, int v) { - lua_pushinteger(L, v); - lua_setfield(L, -2, k); -} - -static void settabsb (lua_State *L, const char *k, int v) { - lua_pushboolean(L, v); - lua_setfield(L, -2, k); -} - - -/* -** In function 'db_getinfo', the call to 'lua_getinfo' may push -** results on the stack; later it creates the result table to put -** these objects. Function 'treatstackoption' puts the result from -** 'lua_getinfo' on top of the result table so that it can call -** 'lua_setfield'. -*/ -static void treatstackoption (lua_State *L, lua_State *L1, const char *fname) { - if (L == L1) - lua_rotate(L, -2, 1); /* exchange object and table */ - else - lua_xmove(L1, L, 1); /* move object to the "main" stack */ - lua_setfield(L, -2, fname); /* put object into table */ -} - - -/* -** Calls 'lua_getinfo' and collects all results in a new table. -** L1 needs stack space for an optional input (function) plus -** two optional outputs (function and line table) from function -** 'lua_getinfo'. -*/ -static int db_getinfo (lua_State *L) { - lua_Debug ar; - int arg; - lua_State *L1 = getthread(L, &arg); - const char *options = luaL_optstring(L, arg+2, "flnSrtu"); - checkstack(L, L1, 3); - luaL_argcheck(L, options[0] != '>', arg + 2, "invalid option '>'"); - if (lua_isfunction(L, arg + 1)) { /* info about a function? */ - options = lua_pushfstring(L, ">%s", options); /* add '>' to 'options' */ - lua_pushvalue(L, arg + 1); /* move function to 'L1' stack */ - lua_xmove(L, L1, 1); - } - else { /* stack level */ - if (!lua_getstack(L1, (int)luaL_checkinteger(L, arg + 1), &ar)) { - luaL_pushfail(L); /* level out of range */ - return 1; - } - } - if (!lua_getinfo(L1, options, &ar)) - return luaL_argerror(L, arg+2, "invalid option"); - lua_newtable(L); /* table to collect results */ - if (strchr(options, 'S')) { - lua_pushlstring(L, ar.source, ar.srclen); - lua_setfield(L, -2, "source"); - settabss(L, "short_src", ar.short_src); - settabsi(L, "linedefined", ar.linedefined); - settabsi(L, "lastlinedefined", ar.lastlinedefined); - settabss(L, "what", ar.what); - } - if (strchr(options, 'l')) - settabsi(L, "currentline", ar.currentline); - if (strchr(options, 'u')) { - settabsi(L, "nups", ar.nups); - settabsi(L, "nparams", ar.nparams); - settabsb(L, "isvararg", ar.isvararg); - } - if (strchr(options, 'n')) { - settabss(L, "name", ar.name); - settabss(L, "namewhat", ar.namewhat); - } - if (strchr(options, 'r')) { - settabsi(L, "ftransfer", ar.ftransfer); - settabsi(L, "ntransfer", ar.ntransfer); - } - if (strchr(options, 't')) - settabsb(L, "istailcall", ar.istailcall); - if (strchr(options, 'L')) - treatstackoption(L, L1, "activelines"); - if (strchr(options, 'f')) - treatstackoption(L, L1, "func"); - return 1; /* return table */ -} - - -static int db_getlocal (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - int nvar = (int)luaL_checkinteger(L, arg + 2); /* local-variable index */ - if (lua_isfunction(L, arg + 1)) { /* function argument? */ - lua_pushvalue(L, arg + 1); /* push function */ - lua_pushstring(L, lua_getlocal(L, NULL, nvar)); /* push local name */ - return 1; /* return only name (there is no value) */ - } - else { /* stack-level argument */ - lua_Debug ar; - const char *name; - int level = (int)luaL_checkinteger(L, arg + 1); - if (l_unlikely(!lua_getstack(L1, level, &ar))) /* out of range? */ - return luaL_argerror(L, arg+1, "level out of range"); - checkstack(L, L1, 1); - name = lua_getlocal(L1, &ar, nvar); - if (name) { - lua_xmove(L1, L, 1); /* move local value */ - lua_pushstring(L, name); /* push name */ - lua_rotate(L, -2, 1); /* re-order */ - return 2; - } - else { - luaL_pushfail(L); /* no name (nor value) */ - return 1; - } - } -} - - -static int db_setlocal (lua_State *L) { - int arg; - const char *name; - lua_State *L1 = getthread(L, &arg); - lua_Debug ar; - int level = (int)luaL_checkinteger(L, arg + 1); - int nvar = (int)luaL_checkinteger(L, arg + 2); - if (l_unlikely(!lua_getstack(L1, level, &ar))) /* out of range? */ - return luaL_argerror(L, arg+1, "level out of range"); - luaL_checkany(L, arg+3); - lua_settop(L, arg+3); - checkstack(L, L1, 1); - lua_xmove(L, L1, 1); - name = lua_setlocal(L1, &ar, nvar); - if (name == NULL) - lua_pop(L1, 1); /* pop value (if not popped by 'lua_setlocal') */ - lua_pushstring(L, name); - return 1; -} - - -/* -** get (if 'get' is true) or set an upvalue from a closure -*/ -static int auxupvalue (lua_State *L, int get) { - const char *name; - int n = (int)luaL_checkinteger(L, 2); /* upvalue index */ - luaL_checktype(L, 1, LUA_TFUNCTION); /* closure */ - name = get ? lua_getupvalue(L, 1, n) : lua_setupvalue(L, 1, n); - if (name == NULL) return 0; - lua_pushstring(L, name); - lua_insert(L, -(get+1)); /* no-op if get is false */ - return get + 1; -} - - -static int db_getupvalue (lua_State *L) { - return auxupvalue(L, 1); -} - - -static int db_setupvalue (lua_State *L) { - luaL_checkany(L, 3); - return auxupvalue(L, 0); -} - - -/* -** Check whether a given upvalue from a given closure exists and -** returns its index -*/ -static void *checkupval (lua_State *L, int argf, int argnup, int *pnup) { - void *id; - int nup = (int)luaL_checkinteger(L, argnup); /* upvalue index */ - luaL_checktype(L, argf, LUA_TFUNCTION); /* closure */ - id = lua_upvalueid(L, argf, nup); - if (pnup) { - luaL_argcheck(L, id != NULL, argnup, "invalid upvalue index"); - *pnup = nup; - } - return id; -} - - -static int db_upvalueid (lua_State *L) { - void *id = checkupval(L, 1, 2, NULL); - if (id != NULL) - lua_pushlightuserdata(L, id); - else - luaL_pushfail(L); - return 1; -} - - -static int db_upvaluejoin (lua_State *L) { - int n1, n2; - checkupval(L, 1, 2, &n1); - checkupval(L, 3, 4, &n2); - luaL_argcheck(L, !lua_iscfunction(L, 1), 1, "Lua function expected"); - luaL_argcheck(L, !lua_iscfunction(L, 3), 3, "Lua function expected"); - lua_upvaluejoin(L, 1, n1, 3, n2); - return 0; -} - - -/* -** Call hook function registered at hook table for the current -** thread (if there is one) -*/ -static void hookf (lua_State *L, lua_Debug *ar) { - static const char *const hooknames[] = - {"call", "return", "line", "count", "tail call"}; - lua_getfield(L, LUA_REGISTRYINDEX, HOOKKEY); - lua_pushthread(L); - if (lua_rawget(L, -2) == LUA_TFUNCTION) { /* is there a hook function? */ - lua_pushstring(L, hooknames[(int)ar->event]); /* push event name */ - if (ar->currentline >= 0) - lua_pushinteger(L, ar->currentline); /* push current line */ - else lua_pushnil(L); - lua_assert(lua_getinfo(L, "lS", ar)); - lua_call(L, 2, 0); /* call hook function */ - } -} - - -/* -** Convert a string mask (for 'sethook') into a bit mask -*/ -static int makemask (const char *smask, int count) { - int mask = 0; - if (strchr(smask, 'c')) mask |= LUA_MASKCALL; - if (strchr(smask, 'r')) mask |= LUA_MASKRET; - if (strchr(smask, 'l')) mask |= LUA_MASKLINE; - if (count > 0) mask |= LUA_MASKCOUNT; - return mask; -} - - -/* -** Convert a bit mask (for 'gethook') into a string mask -*/ -static char *unmakemask (int mask, char *smask) { - int i = 0; - if (mask & LUA_MASKCALL) smask[i++] = 'c'; - if (mask & LUA_MASKRET) smask[i++] = 'r'; - if (mask & LUA_MASKLINE) smask[i++] = 'l'; - smask[i] = '\0'; - return smask; -} - - -static int db_sethook (lua_State *L) { - int arg, mask, count; - lua_Hook func; - lua_State *L1 = getthread(L, &arg); - if (lua_isnoneornil(L, arg+1)) { /* no hook? */ - lua_settop(L, arg+1); - func = NULL; mask = 0; count = 0; /* turn off hooks */ - } - else { - const char *smask = luaL_checkstring(L, arg+2); - luaL_checktype(L, arg+1, LUA_TFUNCTION); - count = (int)luaL_optinteger(L, arg + 3, 0); - func = hookf; mask = makemask(smask, count); - } - if (!luaL_getsubtable(L, LUA_REGISTRYINDEX, HOOKKEY)) { - /* table just created; initialize it */ - lua_pushliteral(L, "k"); - lua_setfield(L, -2, "__mode"); /** hooktable.__mode = "k" */ - lua_pushvalue(L, -1); - lua_setmetatable(L, -2); /* metatable(hooktable) = hooktable */ - } - checkstack(L, L1, 1); - lua_pushthread(L1); lua_xmove(L1, L, 1); /* key (thread) */ - lua_pushvalue(L, arg + 1); /* value (hook function) */ - lua_rawset(L, -3); /* hooktable[L1] = new Lua hook */ - lua_sethook(L1, func, mask, count); - return 0; -} - - -static int db_gethook (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - char buff[5]; - int mask = lua_gethookmask(L1); - lua_Hook hook = lua_gethook(L1); - if (hook == NULL) { /* no hook? */ - luaL_pushfail(L); - return 1; - } - else if (hook != hookf) /* external hook? */ - lua_pushliteral(L, "external hook"); - else { /* hook table must exist */ - lua_getfield(L, LUA_REGISTRYINDEX, HOOKKEY); - checkstack(L, L1, 1); - lua_pushthread(L1); lua_xmove(L1, L, 1); - lua_rawget(L, -2); /* 1st result = hooktable[L1] */ - lua_remove(L, -2); /* remove hook table */ - } - lua_pushstring(L, unmakemask(mask, buff)); /* 2nd result = mask */ - lua_pushinteger(L, lua_gethookcount(L1)); /* 3rd result = count */ - return 3; -} - - -static int db_debug (lua_State *L) { - for (;;) { - char buffer[250]; - lua_writestringerror("%s", "lua_debug> "); - if (fgets(buffer, sizeof(buffer), stdin) == NULL || - strcmp(buffer, "cont\n") == 0) - return 0; - if (luaL_loadbuffer(L, buffer, strlen(buffer), "=(debug command)") || - lua_pcall(L, 0, 0, 0)) - lua_writestringerror("%s\n", luaL_tolstring(L, -1, NULL)); - lua_settop(L, 0); /* remove eventual returns */ - } -} - - -static int db_traceback (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - const char *msg = lua_tostring(L, arg + 1); - if (msg == NULL && !lua_isnoneornil(L, arg + 1)) /* non-string 'msg'? */ - lua_pushvalue(L, arg + 1); /* return it untouched */ - else { - int level = (int)luaL_optinteger(L, arg + 2, (L == L1) ? 1 : 0); - luaL_traceback(L, L1, msg, level); - } - return 1; -} - - -static const luaL_Reg dblib[] = { - {"debug", db_debug}, - {"getuservalue", db_getuservalue}, - {"gethook", db_gethook}, - {"getinfo", db_getinfo}, - {"getlocal", db_getlocal}, - {"getregistry", db_getregistry}, - {"getmetatable", db_getmetatable}, - {"getupvalue", db_getupvalue}, - {"upvaluejoin", db_upvaluejoin}, - {"upvalueid", db_upvalueid}, - {"setuservalue", db_setuservalue}, - {"sethook", db_sethook}, - {"setlocal", db_setlocal}, - {"setmetatable", db_setmetatable}, - {"setupvalue", db_setupvalue}, - {"traceback", db_traceback}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_debug (lua_State *L) { - luaL_newlib(L, dblib); - return 1; -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/ldebug.c b/build/c/dependencies/luaCEmbed/dependencies/lua/ldebug.c deleted file mode 100644 index daa979a..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/ldebug.c +++ /dev/null @@ -1,963 +0,0 @@ -/* -** $Id: ldebug.c $ -** Debug Interface -** See Copyright Notice in lua.h -*/ - -#define ldebug_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "lcode.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lvm.h" - - - -#define noLuaClosure(f) ((f) == NULL || (f)->c.tt == LUA_VCCL) - - -static const char *funcnamefromcall (lua_State *L, CallInfo *ci, - const char **name); - - -static int currentpc (CallInfo *ci) { - lua_assert(isLua(ci)); - return pcRel(ci->u.l.savedpc, ci_func(ci)->p); -} - - -/* -** Get a "base line" to find the line corresponding to an instruction. -** Base lines are regularly placed at MAXIWTHABS intervals, so usually -** an integer division gets the right place. When the source file has -** large sequences of empty/comment lines, it may need extra entries, -** so the original estimate needs a correction. -** If the original estimate is -1, the initial 'if' ensures that the -** 'while' will run at least once. -** The assertion that the estimate is a lower bound for the correct base -** is valid as long as the debug info has been generated with the same -** value for MAXIWTHABS or smaller. (Previous releases use a little -** smaller value.) -*/ -static int getbaseline (const Proto *f, int pc, int *basepc) { - if (f->sizeabslineinfo == 0 || pc < f->abslineinfo[0].pc) { - *basepc = -1; /* start from the beginning */ - return f->linedefined; - } - else { - int i = cast_uint(pc) / MAXIWTHABS - 1; /* get an estimate */ - /* estimate must be a lower bound of the correct base */ - lua_assert(i < 0 || - (i < f->sizeabslineinfo && f->abslineinfo[i].pc <= pc)); - while (i + 1 < f->sizeabslineinfo && pc >= f->abslineinfo[i + 1].pc) - i++; /* low estimate; adjust it */ - *basepc = f->abslineinfo[i].pc; - return f->abslineinfo[i].line; - } -} - - -/* -** Get the line corresponding to instruction 'pc' in function 'f'; -** first gets a base line and from there does the increments until -** the desired instruction. -*/ -int luaG_getfuncline (const Proto *f, int pc) { - if (f->lineinfo == NULL) /* no debug information? */ - return -1; - else { - int basepc; - int baseline = getbaseline(f, pc, &basepc); - while (basepc++ < pc) { /* walk until given instruction */ - lua_assert(f->lineinfo[basepc] != ABSLINEINFO); - baseline += f->lineinfo[basepc]; /* correct line */ - } - return baseline; - } -} - - -static int getcurrentline (CallInfo *ci) { - return luaG_getfuncline(ci_func(ci)->p, currentpc(ci)); -} - - -/* -** Set 'trap' for all active Lua frames. -** This function can be called during a signal, under "reasonable" -** assumptions. A new 'ci' is completely linked in the list before it -** becomes part of the "active" list, and we assume that pointers are -** atomic; see comment in next function. -** (A compiler doing interprocedural optimizations could, theoretically, -** reorder memory writes in such a way that the list could be -** temporarily broken while inserting a new element. We simply assume it -** has no good reasons to do that.) -*/ -static void settraps (CallInfo *ci) { - for (; ci != NULL; ci = ci->previous) - if (isLua(ci)) - ci->u.l.trap = 1; -} - - -/* -** This function can be called during a signal, under "reasonable" -** assumptions. -** Fields 'basehookcount' and 'hookcount' (set by 'resethookcount') -** are for debug only, and it is no problem if they get arbitrary -** values (causes at most one wrong hook call). 'hookmask' is an atomic -** value. We assume that pointers are atomic too (e.g., gcc ensures that -** for all platforms where it runs). Moreover, 'hook' is always checked -** before being called (see 'luaD_hook'). -*/ -LUA_API void lua_sethook (lua_State *L, lua_Hook func, int mask, int count) { - if (func == NULL || mask == 0) { /* turn off hooks? */ - mask = 0; - func = NULL; - } - L->hook = func; - L->basehookcount = count; - resethookcount(L); - L->hookmask = cast_byte(mask); - if (mask) - settraps(L->ci); /* to trace inside 'luaV_execute' */ -} - - -LUA_API lua_Hook lua_gethook (lua_State *L) { - return L->hook; -} - - -LUA_API int lua_gethookmask (lua_State *L) { - return L->hookmask; -} - - -LUA_API int lua_gethookcount (lua_State *L) { - return L->basehookcount; -} - - -LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar) { - int status; - CallInfo *ci; - if (level < 0) return 0; /* invalid (negative) level */ - lua_lock(L); - for (ci = L->ci; level > 0 && ci != &L->base_ci; ci = ci->previous) - level--; - if (level == 0 && ci != &L->base_ci) { /* level found? */ - status = 1; - ar->i_ci = ci; - } - else status = 0; /* no such level */ - lua_unlock(L); - return status; -} - - -static const char *upvalname (const Proto *p, int uv) { - TString *s = check_exp(uv < p->sizeupvalues, p->upvalues[uv].name); - if (s == NULL) return "?"; - else return getstr(s); -} - - -static const char *findvararg (CallInfo *ci, int n, StkId *pos) { - if (clLvalue(s2v(ci->func.p))->p->flag & PF_ISVARARG) { - int nextra = ci->u.l.nextraargs; - if (n >= -nextra) { /* 'n' is negative */ - *pos = ci->func.p - nextra - (n + 1); - return "(vararg)"; /* generic name for any vararg */ - } - } - return NULL; /* no such vararg */ -} - - -const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, StkId *pos) { - StkId base = ci->func.p + 1; - const char *name = NULL; - if (isLua(ci)) { - if (n < 0) /* access to vararg values? */ - return findvararg(ci, n, pos); - else - name = luaF_getlocalname(ci_func(ci)->p, n, currentpc(ci)); - } - if (name == NULL) { /* no 'standard' name? */ - StkId limit = (ci == L->ci) ? L->top.p : ci->next->func.p; - if (limit - base >= n && n > 0) { /* is 'n' inside 'ci' stack? */ - /* generic name for any valid slot */ - name = isLua(ci) ? "(temporary)" : "(C temporary)"; - } - else - return NULL; /* no name */ - } - if (pos) - *pos = base + (n - 1); - return name; -} - - -LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) { - const char *name; - lua_lock(L); - if (ar == NULL) { /* information about non-active function? */ - if (!isLfunction(s2v(L->top.p - 1))) /* not a Lua function? */ - name = NULL; - else /* consider live variables at function start (parameters) */ - name = luaF_getlocalname(clLvalue(s2v(L->top.p - 1))->p, n, 0); - } - else { /* active function; get information through 'ar' */ - StkId pos = NULL; /* to avoid warnings */ - name = luaG_findlocal(L, ar->i_ci, n, &pos); - if (name) { - setobjs2s(L, L->top.p, pos); - api_incr_top(L); - } - } - lua_unlock(L); - return name; -} - - -LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) { - StkId pos = NULL; /* to avoid warnings */ - const char *name; - lua_lock(L); - name = luaG_findlocal(L, ar->i_ci, n, &pos); - if (name) { - api_checkpop(L, 1); - setobjs2s(L, pos, L->top.p - 1); - L->top.p--; /* pop value */ - } - lua_unlock(L); - return name; -} - - -static void funcinfo (lua_Debug *ar, Closure *cl) { - if (noLuaClosure(cl)) { - ar->source = "=[C]"; - ar->srclen = LL("=[C]"); - ar->linedefined = -1; - ar->lastlinedefined = -1; - ar->what = "C"; - } - else { - const Proto *p = cl->l.p; - if (p->source) { - ar->source = getlstr(p->source, ar->srclen); - } - else { - ar->source = "=?"; - ar->srclen = LL("=?"); - } - ar->linedefined = p->linedefined; - ar->lastlinedefined = p->lastlinedefined; - ar->what = (ar->linedefined == 0) ? "main" : "Lua"; - } - luaO_chunkid(ar->short_src, ar->source, ar->srclen); -} - - -static int nextline (const Proto *p, int currentline, int pc) { - if (p->lineinfo[pc] != ABSLINEINFO) - return currentline + p->lineinfo[pc]; - else - return luaG_getfuncline(p, pc); -} - - -static void collectvalidlines (lua_State *L, Closure *f) { - if (noLuaClosure(f)) { - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - } - else { - int i; - TValue v; - const Proto *p = f->l.p; - int currentline = p->linedefined; - Table *t = luaH_new(L); /* new table to store active lines */ - sethvalue2s(L, L->top.p, t); /* push it on stack */ - api_incr_top(L); - setbtvalue(&v); /* boolean 'true' to be the value of all indices */ - if (!(p->flag & PF_ISVARARG)) /* regular function? */ - i = 0; /* consider all instructions */ - else { /* vararg function */ - lua_assert(GET_OPCODE(p->code[0]) == OP_VARARGPREP); - currentline = nextline(p, currentline, 0); - i = 1; /* skip first instruction (OP_VARARGPREP) */ - } - for (; i < p->sizelineinfo; i++) { /* for each instruction */ - currentline = nextline(p, currentline, i); /* get its line */ - luaH_setint(L, t, currentline, &v); /* table[line] = true */ - } - } -} - - -static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name) { - /* calling function is a known function? */ - if (ci != NULL && !(ci->callstatus & CIST_TAIL)) - return funcnamefromcall(L, ci->previous, name); - else return NULL; /* no way to find a name */ -} - - -static int auxgetinfo (lua_State *L, const char *what, lua_Debug *ar, - Closure *f, CallInfo *ci) { - int status = 1; - for (; *what; what++) { - switch (*what) { - case 'S': { - funcinfo(ar, f); - break; - } - case 'l': { - ar->currentline = (ci && isLua(ci)) ? getcurrentline(ci) : -1; - break; - } - case 'u': { - ar->nups = (f == NULL) ? 0 : f->c.nupvalues; - if (noLuaClosure(f)) { - ar->isvararg = 1; - ar->nparams = 0; - } - else { - ar->isvararg = f->l.p->flag & PF_ISVARARG; - ar->nparams = f->l.p->numparams; - } - break; - } - case 't': { - ar->istailcall = (ci) ? ci->callstatus & CIST_TAIL : 0; - break; - } - case 'n': { - ar->namewhat = getfuncname(L, ci, &ar->name); - if (ar->namewhat == NULL) { - ar->namewhat = ""; /* not found */ - ar->name = NULL; - } - break; - } - case 'r': { - if (ci == NULL || !(ci->callstatus & CIST_TRAN)) - ar->ftransfer = ar->ntransfer = 0; - else { - ar->ftransfer = ci->u2.transferinfo.ftransfer; - ar->ntransfer = ci->u2.transferinfo.ntransfer; - } - break; - } - case 'L': - case 'f': /* handled by lua_getinfo */ - break; - default: status = 0; /* invalid option */ - } - } - return status; -} - - -LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) { - int status; - Closure *cl; - CallInfo *ci; - TValue *func; - lua_lock(L); - if (*what == '>') { - ci = NULL; - func = s2v(L->top.p - 1); - api_check(L, ttisfunction(func), "function expected"); - what++; /* skip the '>' */ - L->top.p--; /* pop function */ - } - else { - ci = ar->i_ci; - func = s2v(ci->func.p); - lua_assert(ttisfunction(func)); - } - cl = ttisclosure(func) ? clvalue(func) : NULL; - status = auxgetinfo(L, what, ar, cl, ci); - if (strchr(what, 'f')) { - setobj2s(L, L->top.p, func); - api_incr_top(L); - } - if (strchr(what, 'L')) - collectvalidlines(L, cl); - lua_unlock(L); - return status; -} - - -/* -** {====================================================== -** Symbolic Execution -** ======================================================= -*/ - - -static int filterpc (int pc, int jmptarget) { - if (pc < jmptarget) /* is code conditional (inside a jump)? */ - return -1; /* cannot know who sets that register */ - else return pc; /* current position sets that register */ -} - - -/* -** Try to find last instruction before 'lastpc' that modified register 'reg'. -*/ -static int findsetreg (const Proto *p, int lastpc, int reg) { - int pc; - int setreg = -1; /* keep last instruction that changed 'reg' */ - int jmptarget = 0; /* any code before this address is conditional */ - if (testMMMode(GET_OPCODE(p->code[lastpc]))) - lastpc--; /* previous instruction was not actually executed */ - for (pc = 0; pc < lastpc; pc++) { - Instruction i = p->code[pc]; - OpCode op = GET_OPCODE(i); - int a = GETARG_A(i); - int change; /* true if current instruction changed 'reg' */ - switch (op) { - case OP_LOADNIL: { /* set registers from 'a' to 'a+b' */ - int b = GETARG_B(i); - change = (a <= reg && reg <= a + b); - break; - } - case OP_TFORCALL: { /* affect all regs above its base */ - change = (reg >= a + 2); - break; - } - case OP_CALL: - case OP_TAILCALL: { /* affect all registers above base */ - change = (reg >= a); - break; - } - case OP_JMP: { /* doesn't change registers, but changes 'jmptarget' */ - int b = GETARG_sJ(i); - int dest = pc + 1 + b; - /* jump does not skip 'lastpc' and is larger than current one? */ - if (dest <= lastpc && dest > jmptarget) - jmptarget = dest; /* update 'jmptarget' */ - change = 0; - break; - } - default: /* any instruction that sets A */ - change = (testAMode(op) && reg == a); - break; - } - if (change) - setreg = filterpc(pc, jmptarget); - } - return setreg; -} - - -/* -** Find a "name" for the constant 'c'. -*/ -static const char *kname (const Proto *p, int index, const char **name) { - TValue *kvalue = &p->k[index]; - if (ttisstring(kvalue)) { - *name = getstr(tsvalue(kvalue)); - return "constant"; - } - else { - *name = "?"; - return NULL; - } -} - - -static const char *basicgetobjname (const Proto *p, int *ppc, int reg, - const char **name) { - int pc = *ppc; - *name = luaF_getlocalname(p, reg + 1, pc); - if (*name) /* is a local? */ - return "local"; - /* else try symbolic execution */ - *ppc = pc = findsetreg(p, pc, reg); - if (pc != -1) { /* could find instruction? */ - Instruction i = p->code[pc]; - OpCode op = GET_OPCODE(i); - switch (op) { - case OP_MOVE: { - int b = GETARG_B(i); /* move from 'b' to 'a' */ - if (b < GETARG_A(i)) - return basicgetobjname(p, ppc, b, name); /* get name for 'b' */ - break; - } - case OP_GETUPVAL: { - *name = upvalname(p, GETARG_B(i)); - return "upvalue"; - } - case OP_LOADK: return kname(p, GETARG_Bx(i), name); - case OP_LOADKX: return kname(p, GETARG_Ax(p->code[pc + 1]), name); - default: break; - } - } - return NULL; /* could not find reasonable name */ -} - - -/* -** Find a "name" for the register 'c'. -*/ -static void rname (const Proto *p, int pc, int c, const char **name) { - const char *what = basicgetobjname(p, &pc, c, name); /* search for 'c' */ - if (!(what && *what == 'c')) /* did not find a constant name? */ - *name = "?"; -} - - -/* -** Find a "name" for a 'C' value in an RK instruction. -*/ -static void rkname (const Proto *p, int pc, Instruction i, const char **name) { - int c = GETARG_C(i); /* key index */ - if (GETARG_k(i)) /* is 'c' a constant? */ - kname(p, c, name); - else /* 'c' is a register */ - rname(p, pc, c, name); -} - - -/* -** Check whether table being indexed by instruction 'i' is the -** environment '_ENV' -*/ -static const char *isEnv (const Proto *p, int pc, Instruction i, int isup) { - int t = GETARG_B(i); /* table index */ - const char *name; /* name of indexed variable */ - if (isup) /* is 't' an upvalue? */ - name = upvalname(p, t); - else /* 't' is a register */ - basicgetobjname(p, &pc, t, &name); - return (name && strcmp(name, LUA_ENV) == 0) ? "global" : "field"; -} - - -/* -** Extend 'basicgetobjname' to handle table accesses -*/ -static const char *getobjname (const Proto *p, int lastpc, int reg, - const char **name) { - const char *kind = basicgetobjname(p, &lastpc, reg, name); - if (kind != NULL) - return kind; - else if (lastpc != -1) { /* could find instruction? */ - Instruction i = p->code[lastpc]; - OpCode op = GET_OPCODE(i); - switch (op) { - case OP_GETTABUP: { - int k = GETARG_C(i); /* key index */ - kname(p, k, name); - return isEnv(p, lastpc, i, 1); - } - case OP_GETTABLE: { - int k = GETARG_C(i); /* key index */ - rname(p, lastpc, k, name); - return isEnv(p, lastpc, i, 0); - } - case OP_GETI: { - *name = "integer index"; - return "field"; - } - case OP_GETFIELD: { - int k = GETARG_C(i); /* key index */ - kname(p, k, name); - return isEnv(p, lastpc, i, 0); - } - case OP_SELF: { - rkname(p, lastpc, i, name); - return "method"; - } - default: break; /* go through to return NULL */ - } - } - return NULL; /* could not find reasonable name */ -} - - -/* -** Try to find a name for a function based on the code that called it. -** (Only works when function was called by a Lua function.) -** Returns what the name is (e.g., "for iterator", "method", -** "metamethod") and sets '*name' to point to the name. -*/ -static const char *funcnamefromcode (lua_State *L, const Proto *p, - int pc, const char **name) { - TMS tm = (TMS)0; /* (initial value avoids warnings) */ - Instruction i = p->code[pc]; /* calling instruction */ - switch (GET_OPCODE(i)) { - case OP_CALL: - case OP_TAILCALL: - return getobjname(p, pc, GETARG_A(i), name); /* get function name */ - case OP_TFORCALL: { /* for iterator */ - *name = "for iterator"; - return "for iterator"; - } - /* other instructions can do calls through metamethods */ - case OP_SELF: case OP_GETTABUP: case OP_GETTABLE: - case OP_GETI: case OP_GETFIELD: - tm = TM_INDEX; - break; - case OP_SETTABUP: case OP_SETTABLE: case OP_SETI: case OP_SETFIELD: - tm = TM_NEWINDEX; - break; - case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { - tm = cast(TMS, GETARG_C(i)); - break; - } - case OP_UNM: tm = TM_UNM; break; - case OP_BNOT: tm = TM_BNOT; break; - case OP_LEN: tm = TM_LEN; break; - case OP_CONCAT: tm = TM_CONCAT; break; - case OP_EQ: tm = TM_EQ; break; - /* no cases for OP_EQI and OP_EQK, as they don't call metamethods */ - case OP_LT: case OP_LTI: case OP_GTI: tm = TM_LT; break; - case OP_LE: case OP_LEI: case OP_GEI: tm = TM_LE; break; - case OP_CLOSE: case OP_RETURN: tm = TM_CLOSE; break; - default: - return NULL; /* cannot find a reasonable name */ - } - *name = getshrstr(G(L)->tmname[tm]) + 2; - return "metamethod"; -} - - -/* -** Try to find a name for a function based on how it was called. -*/ -static const char *funcnamefromcall (lua_State *L, CallInfo *ci, - const char **name) { - if (ci->callstatus & CIST_HOOKED) { /* was it called inside a hook? */ - *name = "?"; - return "hook"; - } - else if (ci->callstatus & CIST_FIN) { /* was it called as a finalizer? */ - *name = "__gc"; - return "metamethod"; /* report it as such */ - } - else if (isLua(ci)) - return funcnamefromcode(L, ci_func(ci)->p, currentpc(ci), name); - else - return NULL; -} - -/* }====================================================== */ - - - -/* -** Check whether pointer 'o' points to some value in the stack frame of -** the current function and, if so, returns its index. Because 'o' may -** not point to a value in this stack, we cannot compare it with the -** region boundaries (undefined behavior in ISO C). -*/ -static int instack (CallInfo *ci, const TValue *o) { - int pos; - StkId base = ci->func.p + 1; - for (pos = 0; base + pos < ci->top.p; pos++) { - if (o == s2v(base + pos)) - return pos; - } - return -1; /* not found */ -} - - -/* -** Checks whether value 'o' came from an upvalue. (That can only happen -** with instructions OP_GETTABUP/OP_SETTABUP, which operate directly on -** upvalues.) -*/ -static const char *getupvalname (CallInfo *ci, const TValue *o, - const char **name) { - LClosure *c = ci_func(ci); - int i; - for (i = 0; i < c->nupvalues; i++) { - if (c->upvals[i]->v.p == o) { - *name = upvalname(c->p, i); - return "upvalue"; - } - } - return NULL; -} - - -static const char *formatvarinfo (lua_State *L, const char *kind, - const char *name) { - if (kind == NULL) - return ""; /* no information */ - else - return luaO_pushfstring(L, " (%s '%s')", kind, name); -} - -/* -** Build a string with a "description" for the value 'o', such as -** "variable 'x'" or "upvalue 'y'". -*/ -static const char *varinfo (lua_State *L, const TValue *o) { - CallInfo *ci = L->ci; - const char *name = NULL; /* to avoid warnings */ - const char *kind = NULL; - if (isLua(ci)) { - kind = getupvalname(ci, o, &name); /* check whether 'o' is an upvalue */ - if (!kind) { /* not an upvalue? */ - int reg = instack(ci, o); /* try a register */ - if (reg >= 0) /* is 'o' a register? */ - kind = getobjname(ci_func(ci)->p, currentpc(ci), reg, &name); - } - } - return formatvarinfo(L, kind, name); -} - - -/* -** Raise a type error -*/ -static l_noret typeerror (lua_State *L, const TValue *o, const char *op, - const char *extra) { - const char *t = luaT_objtypename(L, o); - luaG_runerror(L, "attempt to %s a %s value%s", op, t, extra); -} - - -/* -** Raise a type error with "standard" information about the faulty -** object 'o' (using 'varinfo'). -*/ -l_noret luaG_typeerror (lua_State *L, const TValue *o, const char *op) { - typeerror(L, o, op, varinfo(L, o)); -} - - -/* -** Raise an error for calling a non-callable object. Try to find a name -** for the object based on how it was called ('funcnamefromcall'); if it -** cannot get a name there, try 'varinfo'. -*/ -l_noret luaG_callerror (lua_State *L, const TValue *o) { - CallInfo *ci = L->ci; - const char *name = NULL; /* to avoid warnings */ - const char *kind = funcnamefromcall(L, ci, &name); - const char *extra = kind ? formatvarinfo(L, kind, name) : varinfo(L, o); - typeerror(L, o, "call", extra); -} - - -l_noret luaG_forerror (lua_State *L, const TValue *o, const char *what) { - luaG_runerror(L, "bad 'for' %s (number expected, got %s)", - what, luaT_objtypename(L, o)); -} - - -l_noret luaG_concaterror (lua_State *L, const TValue *p1, const TValue *p2) { - if (ttisstring(p1) || cvt2str(p1)) p1 = p2; - luaG_typeerror(L, p1, "concatenate"); -} - - -l_noret luaG_opinterror (lua_State *L, const TValue *p1, - const TValue *p2, const char *msg) { - if (!ttisnumber(p1)) /* first operand is wrong? */ - p2 = p1; /* now second is wrong */ - luaG_typeerror(L, p2, msg); -} - - -/* -** Error when both values are convertible to numbers, but not to integers -*/ -l_noret luaG_tointerror (lua_State *L, const TValue *p1, const TValue *p2) { - lua_Integer temp; - if (!luaV_tointegerns(p1, &temp, LUA_FLOORN2I)) - p2 = p1; - luaG_runerror(L, "number%s has no integer representation", varinfo(L, p2)); -} - - -l_noret luaG_ordererror (lua_State *L, const TValue *p1, const TValue *p2) { - const char *t1 = luaT_objtypename(L, p1); - const char *t2 = luaT_objtypename(L, p2); - if (strcmp(t1, t2) == 0) - luaG_runerror(L, "attempt to compare two %s values", t1); - else - luaG_runerror(L, "attempt to compare %s with %s", t1, t2); -} - - -/* add src:line information to 'msg' */ -const char *luaG_addinfo (lua_State *L, const char *msg, TString *src, - int line) { - char buff[LUA_IDSIZE]; - if (src) { - size_t idlen; - const char *id = getlstr(src, idlen); - luaO_chunkid(buff, id, idlen); - } - else { /* no source available; use "?" instead */ - buff[0] = '?'; buff[1] = '\0'; - } - return luaO_pushfstring(L, "%s:%d: %s", buff, line, msg); -} - - -l_noret luaG_errormsg (lua_State *L) { - if (L->errfunc != 0) { /* is there an error handling function? */ - StkId errfunc = restorestack(L, L->errfunc); - lua_assert(ttisfunction(s2v(errfunc))); - setobjs2s(L, L->top.p, L->top.p - 1); /* move argument */ - setobjs2s(L, L->top.p - 1, errfunc); /* push function */ - L->top.p++; /* assume EXTRA_STACK */ - luaD_callnoyield(L, L->top.p - 2, 1); /* call it */ - } - luaD_throw(L, LUA_ERRRUN); -} - - -l_noret luaG_runerror (lua_State *L, const char *fmt, ...) { - CallInfo *ci = L->ci; - const char *msg; - va_list argp; - luaC_checkGC(L); /* error message uses memory */ - va_start(argp, fmt); - msg = luaO_pushvfstring(L, fmt, argp); /* format message */ - va_end(argp); - if (isLua(ci)) { /* if Lua function, add source:line information */ - luaG_addinfo(L, msg, ci_func(ci)->p->source, getcurrentline(ci)); - setobjs2s(L, L->top.p - 2, L->top.p - 1); /* remove 'msg' */ - L->top.p--; - } - luaG_errormsg(L); -} - - -/* -** Check whether new instruction 'newpc' is in a different line from -** previous instruction 'oldpc'. More often than not, 'newpc' is only -** one or a few instructions after 'oldpc' (it must be after, see -** caller), so try to avoid calling 'luaG_getfuncline'. If they are -** too far apart, there is a good chance of a ABSLINEINFO in the way, -** so it goes directly to 'luaG_getfuncline'. -*/ -static int changedline (const Proto *p, int oldpc, int newpc) { - if (p->lineinfo == NULL) /* no debug information? */ - return 0; - if (newpc - oldpc < MAXIWTHABS / 2) { /* not too far apart? */ - int delta = 0; /* line difference */ - int pc = oldpc; - for (;;) { - int lineinfo = p->lineinfo[++pc]; - if (lineinfo == ABSLINEINFO) - break; /* cannot compute delta; fall through */ - delta += lineinfo; - if (pc == newpc) - return (delta != 0); /* delta computed successfully */ - } - } - /* either instructions are too far apart or there is an absolute line - info in the way; compute line difference explicitly */ - return (luaG_getfuncline(p, oldpc) != luaG_getfuncline(p, newpc)); -} - - -/* -** Traces Lua calls. If code is running the first instruction of a function, -** and function is not vararg, and it is not coming from an yield, -** calls 'luaD_hookcall'. (Vararg functions will call 'luaD_hookcall' -** after adjusting its variable arguments; otherwise, they could call -** a line/count hook before the call hook. Functions coming from -** an yield already called 'luaD_hookcall' before yielding.) -*/ -int luaG_tracecall (lua_State *L) { - CallInfo *ci = L->ci; - Proto *p = ci_func(ci)->p; - ci->u.l.trap = 1; /* ensure hooks will be checked */ - if (ci->u.l.savedpc == p->code) { /* first instruction (not resuming)? */ - if (p->flag & PF_ISVARARG) - return 0; /* hooks will start at VARARGPREP instruction */ - else if (!(ci->callstatus & CIST_HOOKYIELD)) /* not yieded? */ - luaD_hookcall(L, ci); /* check 'call' hook */ - } - return 1; /* keep 'trap' on */ -} - - -/* -** Traces the execution of a Lua function. Called before the execution -** of each opcode, when debug is on. 'L->oldpc' stores the last -** instruction traced, to detect line changes. When entering a new -** function, 'npci' will be zero and will test as a new line whatever -** the value of 'oldpc'. Some exceptional conditions may return to -** a function without setting 'oldpc'. In that case, 'oldpc' may be -** invalid; if so, use zero as a valid value. (A wrong but valid 'oldpc' -** at most causes an extra call to a line hook.) -** This function is not "Protected" when called, so it should correct -** 'L->top.p' before calling anything that can run the GC. -*/ -int luaG_traceexec (lua_State *L, const Instruction *pc) { - CallInfo *ci = L->ci; - lu_byte mask = L->hookmask; - const Proto *p = ci_func(ci)->p; - int counthook; - if (!(mask & (LUA_MASKLINE | LUA_MASKCOUNT))) { /* no hooks? */ - ci->u.l.trap = 0; /* don't need to stop again */ - return 0; /* turn off 'trap' */ - } - pc++; /* reference is always next instruction */ - ci->u.l.savedpc = pc; /* save 'pc' */ - counthook = (mask & LUA_MASKCOUNT) && (--L->hookcount == 0); - if (counthook) - resethookcount(L); /* reset count */ - else if (!(mask & LUA_MASKLINE)) - return 1; /* no line hook and count != 0; nothing to be done now */ - if (ci->callstatus & CIST_HOOKYIELD) { /* hook yielded last time? */ - ci->callstatus &= ~CIST_HOOKYIELD; /* erase mark */ - return 1; /* do not call hook again (VM yielded, so it did not move) */ - } - if (!isIT(*(ci->u.l.savedpc - 1))) /* top not being used? */ - L->top.p = ci->top.p; /* correct top */ - if (counthook) - luaD_hook(L, LUA_HOOKCOUNT, -1, 0, 0); /* call count hook */ - if (mask & LUA_MASKLINE) { - /* 'L->oldpc' may be invalid; use zero in this case */ - int oldpc = (L->oldpc < p->sizecode) ? L->oldpc : 0; - int npci = pcRel(pc, p); - if (npci <= oldpc || /* call hook when jump back (loop), */ - changedline(p, oldpc, npci)) { /* or when enter new line */ - int newline = luaG_getfuncline(p, npci); - luaD_hook(L, LUA_HOOKLINE, newline, 0, 0); /* call line hook */ - } - L->oldpc = npci; /* 'pc' of last call to line hook */ - } - if (L->status == LUA_YIELD) { /* did hook yield? */ - if (counthook) - L->hookcount = 1; /* undo decrement to zero */ - ci->callstatus |= CIST_HOOKYIELD; /* mark that it yielded */ - luaD_throw(L, LUA_YIELD); - } - return 1; /* keep 'trap' on */ -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/ldebug.h b/build/c/dependencies/luaCEmbed/dependencies/lua/ldebug.h deleted file mode 100644 index 2bfce3c..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/ldebug.h +++ /dev/null @@ -1,64 +0,0 @@ -/* -** $Id: ldebug.h $ -** Auxiliary functions from Debug Interface module -** See Copyright Notice in lua.h -*/ - -#ifndef ldebug_h -#define ldebug_h - - -#include "lstate.h" - - -#define pcRel(pc, p) (cast_int((pc) - (p)->code) - 1) - - -/* Active Lua function (given call info) */ -#define ci_func(ci) (clLvalue(s2v((ci)->func.p))) - - -#define resethookcount(L) (L->hookcount = L->basehookcount) - -/* -** mark for entries in 'lineinfo' array that has absolute information in -** 'abslineinfo' array -*/ -#define ABSLINEINFO (-0x80) - - -/* -** MAXimum number of successive Instructions WiTHout ABSolute line -** information. (A power of two allows fast divisions.) -*/ -#if !defined(MAXIWTHABS) -#define MAXIWTHABS 128 -#endif - - -LUAI_FUNC int luaG_getfuncline (const Proto *f, int pc); -LUAI_FUNC const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, - StkId *pos); -LUAI_FUNC l_noret luaG_typeerror (lua_State *L, const TValue *o, - const char *opname); -LUAI_FUNC l_noret luaG_callerror (lua_State *L, const TValue *o); -LUAI_FUNC l_noret luaG_forerror (lua_State *L, const TValue *o, - const char *what); -LUAI_FUNC l_noret luaG_concaterror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_opinterror (lua_State *L, const TValue *p1, - const TValue *p2, - const char *msg); -LUAI_FUNC l_noret luaG_tointerror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_ordererror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_runerror (lua_State *L, const char *fmt, ...); -LUAI_FUNC const char *luaG_addinfo (lua_State *L, const char *msg, - TString *src, int line); -LUAI_FUNC l_noret luaG_errormsg (lua_State *L); -LUAI_FUNC int luaG_traceexec (lua_State *L, const Instruction *pc); -LUAI_FUNC int luaG_tracecall (lua_State *L); - - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/ldo.c b/build/c/dependencies/luaCEmbed/dependencies/lua/ldo.c deleted file mode 100644 index b8d36cc..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/ldo.c +++ /dev/null @@ -1,1034 +0,0 @@ -/* -** $Id: ldo.c $ -** Stack and Call structure of Lua -** See Copyright Notice in lua.h -*/ - -#define ldo_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lparser.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lundump.h" -#include "lvm.h" -#include "lzio.h" - - - -#define errorstatus(s) ((s) > LUA_YIELD) - - -/* -** {====================================================== -** Error-recovery functions -** ======================================================= -*/ - -/* -** LUAI_THROW/LUAI_TRY define how Lua does exception handling. By -** default, Lua handles errors with exceptions when compiling as -** C++ code, with _longjmp/_setjmp when asked to use them, and with -** longjmp/setjmp otherwise. -*/ -#if !defined(LUAI_THROW) /* { */ - -#if defined(__cplusplus) && !defined(LUA_USE_LONGJMP) /* { */ - -/* C++ exceptions */ -#define LUAI_THROW(L,c) throw(c) -#define LUAI_TRY(L,c,a) \ - try { a } catch(...) { if ((c)->status == 0) (c)->status = -1; } -#define luai_jmpbuf int /* dummy variable */ - -#elif defined(LUA_USE_POSIX) /* }{ */ - -/* in POSIX, try _longjmp/_setjmp (more efficient) */ -#define LUAI_THROW(L,c) _longjmp((c)->b, 1) -#define LUAI_TRY(L,c,a) if (_setjmp((c)->b) == 0) { a } -#define luai_jmpbuf jmp_buf - -#else /* }{ */ - -/* ISO C handling with long jumps */ -#define LUAI_THROW(L,c) longjmp((c)->b, 1) -#define LUAI_TRY(L,c,a) if (setjmp((c)->b) == 0) { a } -#define luai_jmpbuf jmp_buf - -#endif /* } */ - -#endif /* } */ - - - -/* chain list of long jump buffers */ -struct lua_longjmp { - struct lua_longjmp *previous; - luai_jmpbuf b; - volatile int status; /* error code */ -}; - - -void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop) { - switch (errcode) { - case LUA_ERRMEM: { /* memory error? */ - setsvalue2s(L, oldtop, G(L)->memerrmsg); /* reuse preregistered msg. */ - break; - } - case LUA_ERRERR: { - setsvalue2s(L, oldtop, luaS_newliteral(L, "error in private_lua_error handling")); - break; - } - case LUA_OK: { /* special case only for closing upvalues */ - setnilvalue(s2v(oldtop)); /* no error message */ - break; - } - default: { - lua_assert(errorstatus(errcode)); /* real error */ - setobjs2s(L, oldtop, L->top.p - 1); /* error message on current top */ - break; - } - } - L->top.p = oldtop + 1; -} - - -l_noret luaD_throw (lua_State *L, int errcode) { - if (L->errorJmp) { /* thread has an error handler? */ - L->errorJmp->status = errcode; /* set status */ - LUAI_THROW(L, L->errorJmp); /* jump to it */ - } - else { /* thread has no error handler */ - global_State *g = G(L); - errcode = luaE_resetthread(L, errcode); /* close all upvalues */ - if (g->mainthread->errorJmp) { /* main thread has a handler? */ - setobjs2s(L, g->mainthread->top.p++, L->top.p - 1); /* copy error obj. */ - luaD_throw(g->mainthread, errcode); /* re-throw in main thread */ - } - else { /* no handler at all; abort */ - if (g->panic) { /* panic function? */ - lua_unlock(L); - g->panic(L); /* call panic function (last chance to jump out) */ - } - abort(); - } - } -} - - -int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) { - l_uint32 oldnCcalls = L->nCcalls; - struct lua_longjmp lj; - lj.status = LUA_OK; - lj.previous = L->errorJmp; /* chain new error handler */ - L->errorJmp = &lj; - LUAI_TRY(L, &lj, - (*f)(L, ud); - ); - L->errorJmp = lj.previous; /* restore old error handler */ - L->nCcalls = oldnCcalls; - return lj.status; -} - -/* }====================================================== */ - - -/* -** {================================================================== -** Stack reallocation -** =================================================================== -*/ - - -/* -** Change all pointers to the stack into offsets. -*/ -static void relstack (lua_State *L) { - CallInfo *ci; - UpVal *up; - L->top.offset = savestack(L, L->top.p); - L->tbclist.offset = savestack(L, L->tbclist.p); - for (up = L->openupval; up != NULL; up = up->u.open.next) - up->v.offset = savestack(L, uplevel(up)); - for (ci = L->ci; ci != NULL; ci = ci->previous) { - ci->top.offset = savestack(L, ci->top.p); - ci->func.offset = savestack(L, ci->func.p); - } -} - - -/* -** Change back all offsets into pointers. -*/ -static void correctstack (lua_State *L) { - CallInfo *ci; - UpVal *up; - L->top.p = restorestack(L, L->top.offset); - L->tbclist.p = restorestack(L, L->tbclist.offset); - for (up = L->openupval; up != NULL; up = up->u.open.next) - up->v.p = s2v(restorestack(L, up->v.offset)); - for (ci = L->ci; ci != NULL; ci = ci->previous) { - ci->top.p = restorestack(L, ci->top.offset); - ci->func.p = restorestack(L, ci->func.offset); - if (isLua(ci)) - ci->u.l.trap = 1; /* signal to update 'trap' in 'luaV_execute' */ - } -} - - -/* some space for error handling */ -#define ERRORSTACKSIZE (LUAI_MAXSTACK + 200) - -/* -** Reallocate the stack to a new size, correcting all pointers into it. -** In ISO C, any pointer use after the pointer has been deallocated is -** undefined behavior. So, before the reallocation, all pointers are -** changed to offsets, and after the reallocation they are changed back -** to pointers. As during the reallocation the pointers are invalid, the -** reallocation cannot run emergency collections. -** -** In case of allocation error, raise an error or return false according -** to 'raiseerror'. -*/ -int luaD_reallocstack (lua_State *L, int newsize, int raiseerror) { - int oldsize = stacksize(L); - int i; - StkId newstack; - int oldgcstop = G(L)->gcstopem; - lua_assert(newsize <= LUAI_MAXSTACK || newsize == ERRORSTACKSIZE); - relstack(L); /* change pointers to offsets */ - G(L)->gcstopem = 1; /* stop emergency collection */ - newstack = luaM_reallocvector(L, L->stack.p, oldsize + EXTRA_STACK, - newsize + EXTRA_STACK, StackValue); - G(L)->gcstopem = oldgcstop; /* restore emergency collection */ - if (l_unlikely(newstack == NULL)) { /* reallocation failed? */ - correctstack(L); /* change offsets back to pointers */ - if (raiseerror) - luaM_error(L); - else return 0; /* do not raise an error */ - } - L->stack.p = newstack; - correctstack(L); /* change offsets back to pointers */ - L->stack_last.p = L->stack.p + newsize; - for (i = oldsize + EXTRA_STACK; i < newsize + EXTRA_STACK; i++) - setnilvalue(s2v(newstack + i)); /* erase new segment */ - return 1; -} - - -/* -** Try to grow the stack by at least 'n' elements. When 'raiseerror' -** is true, raises any error; otherwise, return 0 in case of errors. -*/ -int luaD_growstack (lua_State *L, int n, int raiseerror) { - int size = stacksize(L); - if (l_unlikely(size > LUAI_MAXSTACK)) { - /* if stack is larger than maximum, thread is already using the - extra space reserved for errors, that is, thread is handling - a stack error; cannot grow further than that. */ - lua_assert(stacksize(L) == ERRORSTACKSIZE); - if (raiseerror) - luaD_throw(L, LUA_ERRERR); /* error inside message handler */ - return 0; /* if not 'raiseerror', just signal it */ - } - else if (n < LUAI_MAXSTACK) { /* avoids arithmetic overflows */ - int newsize = 2 * size; /* tentative new size */ - int needed = cast_int(L->top.p - L->stack.p) + n; - if (newsize > LUAI_MAXSTACK) /* cannot cross the limit */ - newsize = LUAI_MAXSTACK; - if (newsize < needed) /* but must respect what was asked for */ - newsize = needed; - if (l_likely(newsize <= LUAI_MAXSTACK)) - return luaD_reallocstack(L, newsize, raiseerror); - } - /* else stack overflow */ - /* add extra size to be able to handle the error message */ - luaD_reallocstack(L, ERRORSTACKSIZE, raiseerror); - if (raiseerror) - luaG_runerror(L, "stack overflow"); - return 0; -} - - -/* -** Compute how much of the stack is being used, by computing the -** maximum top of all call frames in the stack and the current top. -*/ -static int stackinuse (lua_State *L) { - CallInfo *ci; - int res; - StkId lim = L->top.p; - for (ci = L->ci; ci != NULL; ci = ci->previous) { - if (lim < ci->top.p) lim = ci->top.p; - } - lua_assert(lim <= L->stack_last.p + EXTRA_STACK); - res = cast_int(lim - L->stack.p) + 1; /* part of stack in use */ - if (res < LUA_MINSTACK) - res = LUA_MINSTACK; /* ensure a minimum size */ - return res; -} - - -/* -** If stack size is more than 3 times the current use, reduce that size -** to twice the current use. (So, the final stack size is at most 2/3 the -** previous size, and half of its entries are empty.) -** As a particular case, if stack was handling a stack overflow and now -** it is not, 'max' (limited by LUAI_MAXSTACK) will be smaller than -** stacksize (equal to ERRORSTACKSIZE in this case), and so the stack -** will be reduced to a "regular" size. -*/ -void luaD_shrinkstack (lua_State *L) { - int inuse = stackinuse(L); - int max = (inuse > LUAI_MAXSTACK / 3) ? LUAI_MAXSTACK : inuse * 3; - /* if thread is currently not handling a stack overflow and its - size is larger than maximum "reasonable" size, shrink it */ - if (inuse <= LUAI_MAXSTACK && stacksize(L) > max) { - int nsize = (inuse > LUAI_MAXSTACK / 2) ? LUAI_MAXSTACK : inuse * 2; - luaD_reallocstack(L, nsize, 0); /* ok if that fails */ - } - else /* don't change stack */ - condmovestack(L,{},{}); /* (change only for debugging) */ - luaE_shrinkCI(L); /* shrink CI list */ -} - - -void luaD_inctop (lua_State *L) { - luaD_checkstack(L, 1); - L->top.p++; -} - -/* }================================================================== */ - - -/* -** Call a hook for the given event. Make sure there is a hook to be -** called. (Both 'L->hook' and 'L->hookmask', which trigger this -** function, can be changed asynchronously by signals.) -*/ -void luaD_hook (lua_State *L, int event, int line, - int ftransfer, int ntransfer) { - lua_Hook hook = L->hook; - if (hook && L->allowhook) { /* make sure there is a hook */ - int mask = CIST_HOOKED; - CallInfo *ci = L->ci; - ptrdiff_t top = savestack(L, L->top.p); /* preserve original 'top' */ - ptrdiff_t ci_top = savestack(L, ci->top.p); /* idem for 'ci->top' */ - lua_Debug ar; - ar.event = event; - ar.currentline = line; - ar.i_ci = ci; - if (ntransfer != 0) { - mask |= CIST_TRAN; /* 'ci' has transfer information */ - ci->u2.transferinfo.ftransfer = ftransfer; - ci->u2.transferinfo.ntransfer = ntransfer; - } - if (isLua(ci) && L->top.p < ci->top.p) - L->top.p = ci->top.p; /* protect entire activation register */ - luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */ - if (ci->top.p < L->top.p + LUA_MINSTACK) - ci->top.p = L->top.p + LUA_MINSTACK; - L->allowhook = 0; /* cannot call hooks inside a hook */ - ci->callstatus |= mask; - lua_unlock(L); - (*hook)(L, &ar); - lua_lock(L); - lua_assert(!L->allowhook); - L->allowhook = 1; - ci->top.p = restorestack(L, ci_top); - L->top.p = restorestack(L, top); - ci->callstatus &= ~mask; - } -} - - -/* -** Executes a call hook for Lua functions. This function is called -** whenever 'hookmask' is not zero, so it checks whether call hooks are -** active. -*/ -void luaD_hookcall (lua_State *L, CallInfo *ci) { - L->oldpc = 0; /* set 'oldpc' for new function */ - if (L->hookmask & LUA_MASKCALL) { /* is call hook on? */ - int event = (ci->callstatus & CIST_TAIL) ? LUA_HOOKTAILCALL - : LUA_HOOKCALL; - Proto *p = ci_func(ci)->p; - ci->u.l.savedpc++; /* hooks assume 'pc' is already incremented */ - luaD_hook(L, event, -1, 1, p->numparams); - ci->u.l.savedpc--; /* correct 'pc' */ - } -} - - -/* -** Executes a return hook for Lua and C functions and sets/corrects -** 'oldpc'. (Note that this correction is needed by the line hook, so it -** is done even when return hooks are off.) -*/ -static void rethook (lua_State *L, CallInfo *ci, int nres) { - if (L->hookmask & LUA_MASKRET) { /* is return hook on? */ - StkId firstres = L->top.p - nres; /* index of first result */ - int delta = 0; /* correction for vararg functions */ - int ftransfer; - if (isLua(ci)) { - Proto *p = ci_func(ci)->p; - if (p->flag & PF_ISVARARG) - delta = ci->u.l.nextraargs + p->numparams + 1; - } - ci->func.p += delta; /* if vararg, back to virtual 'func' */ - ftransfer = cast(unsigned short, firstres - ci->func.p); - luaD_hook(L, LUA_HOOKRET, -1, ftransfer, nres); /* call it */ - ci->func.p -= delta; - } - if (isLua(ci = ci->previous)) - L->oldpc = pcRel(ci->u.l.savedpc, ci_func(ci)->p); /* set 'oldpc' */ -} - - -/* -** Check whether 'func' has a '__call' metafield. If so, put it in the -** stack, below original 'func', so that 'luaD_precall' can call it. Raise -** an error if there is no '__call' metafield. -*/ -static StkId tryfuncTM (lua_State *L, StkId func) { - const TValue *tm; - StkId p; - checkstackp(L, 1, func); /* space for metamethod */ - tm = luaT_gettmbyobj(L, s2v(func), TM_CALL); /* (after previous GC) */ - if (l_unlikely(ttisnil(tm))) - luaG_callerror(L, s2v(func)); /* nothing to call */ - for (p = L->top.p; p > func; p--) /* open space for metamethod */ - setobjs2s(L, p, p-1); - L->top.p++; /* stack space pre-allocated by the caller */ - setobj2s(L, func, tm); /* metamethod is the new function to be called */ - return func; -} - - -/* -** Given 'nres' results at 'firstResult', move 'wanted' of them to 'res'. -** Handle most typical cases (zero results for commands, one result for -** expressions, multiple results for tail calls/single parameters) -** separated. -*/ -l_sinline void moveresults (lua_State *L, StkId res, int nres, int wanted) { - StkId firstresult; - int i; - switch (wanted) { /* handle typical cases separately */ - case 0: /* no values needed */ - L->top.p = res; - return; - case 1: /* one value needed */ - if (nres == 0) /* no results? */ - setnilvalue(s2v(res)); /* adjust with nil */ - else /* at least one result */ - setobjs2s(L, res, L->top.p - nres); /* move it to proper place */ - L->top.p = res + 1; - return; - case LUA_MULTRET: - wanted = nres; /* we want all results */ - break; - default: /* two/more results and/or to-be-closed variables */ - if (hastocloseCfunc(wanted)) { /* to-be-closed variables? */ - L->ci->callstatus |= CIST_CLSRET; /* in case of yields */ - L->ci->u2.nres = nres; - res = luaF_close(L, res, CLOSEKTOP, 1); - L->ci->callstatus &= ~CIST_CLSRET; - if (L->hookmask) { /* if needed, call hook after '__close's */ - ptrdiff_t savedres = savestack(L, res); - rethook(L, L->ci, nres); - res = restorestack(L, savedres); /* hook can move stack */ - } - wanted = decodeNresults(wanted); - if (wanted == LUA_MULTRET) - wanted = nres; /* we want all results */ - } - break; - } - /* generic case */ - firstresult = L->top.p - nres; /* index of first result */ - if (nres > wanted) /* extra results? */ - nres = wanted; /* don't need them */ - for (i = 0; i < nres; i++) /* move all results to correct place */ - setobjs2s(L, res + i, firstresult + i); - for (; i < wanted; i++) /* complete wanted number of results */ - setnilvalue(s2v(res + i)); - L->top.p = res + wanted; /* top points after the last result */ -} - - -/* -** Finishes a function call: calls hook if necessary, moves current -** number of results to proper place, and returns to previous call -** info. If function has to close variables, hook must be called after -** that. -*/ -void luaD_poscall (lua_State *L, CallInfo *ci, int nres) { - int wanted = ci->nresults; - if (l_unlikely(L->hookmask && !hastocloseCfunc(wanted))) - rethook(L, ci, nres); - /* move results to proper place */ - moveresults(L, ci->func.p, nres, wanted); - /* function cannot be in any of these cases when returning */ - lua_assert(!(ci->callstatus & - (CIST_HOOKED | CIST_YPCALL | CIST_FIN | CIST_TRAN | CIST_CLSRET))); - L->ci = ci->previous; /* back to caller (after closing variables) */ -} - - - -#define next_ci(L) (L->ci->next ? L->ci->next : luaE_extendCI(L)) - - -l_sinline CallInfo *prepCallInfo (lua_State *L, StkId func, int nret, - int mask, StkId top) { - CallInfo *ci = L->ci = next_ci(L); /* new frame */ - ci->func.p = func; - ci->nresults = nret; - ci->callstatus = mask; - ci->top.p = top; - return ci; -} - - -/* -** precall for C functions -*/ -l_sinline int precallC (lua_State *L, StkId func, int nresults, - lua_CFunction f) { - int n; /* number of returns */ - CallInfo *ci; - checkstackp(L, LUA_MINSTACK, func); /* ensure minimum stack size */ - L->ci = ci = prepCallInfo(L, func, nresults, CIST_C, - L->top.p + LUA_MINSTACK); - lua_assert(ci->top.p <= L->stack_last.p); - if (l_unlikely(L->hookmask & LUA_MASKCALL)) { - int narg = cast_int(L->top.p - func) - 1; - luaD_hook(L, LUA_HOOKCALL, -1, 1, narg); - } - lua_unlock(L); - n = (*f)(L); /* do the actual call */ - lua_lock(L); - api_checknelems(L, n); - luaD_poscall(L, ci, n); - return n; -} - - -/* -** Prepare a function for a tail call, building its call info on top -** of the current call info. 'narg1' is the number of arguments plus 1 -** (so that it includes the function itself). Return the number of -** results, if it was a C function, or -1 for a Lua function. -*/ -int luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, - int narg1, int delta) { - retry: - switch (ttypetag(s2v(func))) { - case LUA_VCCL: /* C closure */ - return precallC(L, func, LUA_MULTRET, clCvalue(s2v(func))->f); - case LUA_VLCF: /* light C function */ - return precallC(L, func, LUA_MULTRET, fvalue(s2v(func))); - case LUA_VLCL: { /* Lua function */ - Proto *p = clLvalue(s2v(func))->p; - int fsize = p->maxstacksize; /* frame size */ - int nfixparams = p->numparams; - int i; - checkstackp(L, fsize - delta, func); - ci->func.p -= delta; /* restore 'func' (if vararg) */ - for (i = 0; i < narg1; i++) /* move down function and arguments */ - setobjs2s(L, ci->func.p + i, func + i); - func = ci->func.p; /* moved-down function */ - for (; narg1 <= nfixparams; narg1++) - setnilvalue(s2v(func + narg1)); /* complete missing arguments */ - ci->top.p = func + 1 + fsize; /* top for new function */ - lua_assert(ci->top.p <= L->stack_last.p); - ci->u.l.savedpc = p->code; /* starting point */ - ci->callstatus |= CIST_TAIL; - L->top.p = func + narg1; /* set top */ - return -1; - } - default: { /* not a function */ - func = tryfuncTM(L, func); /* try to get '__call' metamethod */ - /* return luaD_pretailcall(L, ci, func, narg1 + 1, delta); */ - narg1++; - goto retry; /* try again */ - } - } -} - - -/* -** Prepares the call to a function (C or Lua). For C functions, also do -** the call. The function to be called is at '*func'. The arguments -** are on the stack, right after the function. Returns the CallInfo -** to be executed, if it was a Lua function. Otherwise (a C function) -** returns NULL, with all the results on the stack, starting at the -** original function position. -*/ -CallInfo *luaD_precall (lua_State *L, StkId func, int nresults) { - retry: - switch (ttypetag(s2v(func))) { - case LUA_VCCL: /* C closure */ - precallC(L, func, nresults, clCvalue(s2v(func))->f); - return NULL; - case LUA_VLCF: /* light C function */ - precallC(L, func, nresults, fvalue(s2v(func))); - return NULL; - case LUA_VLCL: { /* Lua function */ - CallInfo *ci; - Proto *p = clLvalue(s2v(func))->p; - int narg = cast_int(L->top.p - func) - 1; /* number of real arguments */ - int nfixparams = p->numparams; - int fsize = p->maxstacksize; /* frame size */ - checkstackp(L, fsize, func); - L->ci = ci = prepCallInfo(L, func, nresults, 0, func + 1 + fsize); - ci->u.l.savedpc = p->code; /* starting point */ - for (; narg < nfixparams; narg++) - setnilvalue(s2v(L->top.p++)); /* complete missing arguments */ - lua_assert(ci->top.p <= L->stack_last.p); - return ci; - } - default: { /* not a function */ - func = tryfuncTM(L, func); /* try to get '__call' metamethod */ - /* return luaD_precall(L, func, nresults); */ - goto retry; /* try again with metamethod */ - } - } -} - - -/* -** Call a function (C or Lua) through C. 'inc' can be 1 (increment -** number of recursive invocations in the C stack) or nyci (the same -** plus increment number of non-yieldable calls). -** This function can be called with some use of EXTRA_STACK, so it should -** check the stack before doing anything else. 'luaD_precall' already -** does that. -*/ -l_sinline void ccall (lua_State *L, StkId func, int nResults, l_uint32 inc) { - CallInfo *ci; - L->nCcalls += inc; - if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) { - checkstackp(L, 0, func); /* free any use of EXTRA_STACK */ - luaE_checkcstack(L); - } - if ((ci = luaD_precall(L, func, nResults)) != NULL) { /* Lua function? */ - ci->callstatus = CIST_FRESH; /* mark that it is a "fresh" execute */ - luaV_execute(L, ci); /* call it */ - } - L->nCcalls -= inc; -} - - -/* -** External interface for 'ccall' -*/ -void luaD_call (lua_State *L, StkId func, int nResults) { - ccall(L, func, nResults, 1); -} - - -/* -** Similar to 'luaD_call', but does not allow yields during the call. -*/ -void luaD_callnoyield (lua_State *L, StkId func, int nResults) { - ccall(L, func, nResults, nyci); -} - - -/* -** Finish the job of 'lua_pcallk' after it was interrupted by an yield. -** (The caller, 'finishCcall', does the final call to 'adjustresults'.) -** The main job is to complete the 'luaD_pcall' called by 'lua_pcallk'. -** If a '__close' method yields here, eventually control will be back -** to 'finishCcall' (when that '__close' method finally returns) and -** 'finishpcallk' will run again and close any still pending '__close' -** methods. Similarly, if a '__close' method errs, 'precover' calls -** 'unroll' which calls ''finishCcall' and we are back here again, to -** close any pending '__close' methods. -** Note that, up to the call to 'luaF_close', the corresponding -** 'CallInfo' is not modified, so that this repeated run works like the -** first one (except that it has at least one less '__close' to do). In -** particular, field CIST_RECST preserves the error status across these -** multiple runs, changing only if there is a new error. -*/ -static int finishpcallk (lua_State *L, CallInfo *ci) { - int status = getcistrecst(ci); /* get original status */ - if (l_likely(status == LUA_OK)) /* no error? */ - status = LUA_YIELD; /* was interrupted by an yield */ - else { /* error */ - StkId func = restorestack(L, ci->u2.funcidx); - L->allowhook = getoah(ci->callstatus); /* restore 'allowhook' */ - func = luaF_close(L, func, status, 1); /* can yield or raise an error */ - luaD_seterrorobj(L, status, func); - luaD_shrinkstack(L); /* restore stack size in case of overflow */ - setcistrecst(ci, LUA_OK); /* clear original status */ - } - ci->callstatus &= ~CIST_YPCALL; - L->errfunc = ci->u.c.old_errfunc; - /* if it is here, there were errors or yields; unlike 'lua_pcallk', - do not change status */ - return status; -} - - -/* -** Completes the execution of a C function interrupted by an yield. -** The interruption must have happened while the function was either -** closing its tbc variables in 'moveresults' or executing -** 'lua_callk'/'lua_pcallk'. In the first case, it just redoes -** 'luaD_poscall'. In the second case, the call to 'finishpcallk' -** finishes the interrupted execution of 'lua_pcallk'. After that, it -** calls the continuation of the interrupted function and finally it -** completes the job of the 'luaD_call' that called the function. In -** the call to 'adjustresults', we do not know the number of results -** of the function called by 'lua_callk'/'lua_pcallk', so we are -** conservative and use LUA_MULTRET (always adjust). -*/ -static void finishCcall (lua_State *L, CallInfo *ci) { - int n; /* actual number of results from C function */ - if (ci->callstatus & CIST_CLSRET) { /* was returning? */ - lua_assert(hastocloseCfunc(ci->nresults)); - n = ci->u2.nres; /* just redo 'luaD_poscall' */ - /* don't need to reset CIST_CLSRET, as it will be set again anyway */ - } - else { - int status = LUA_YIELD; /* default if there were no errors */ - /* must have a continuation and must be able to call it */ - lua_assert(ci->u.c.k != NULL && yieldable(L)); - if (ci->callstatus & CIST_YPCALL) /* was inside a 'lua_pcallk'? */ - status = finishpcallk(L, ci); /* finish it */ - adjustresults(L, LUA_MULTRET); /* finish 'lua_callk' */ - lua_unlock(L); - n = (*ci->u.c.k)(L, status, ci->u.c.ctx); /* call continuation */ - lua_lock(L); - api_checknelems(L, n); - } - luaD_poscall(L, ci, n); /* finish 'luaD_call' */ -} - - -/* -** Executes "full continuation" (everything in the stack) of a -** previously interrupted coroutine until the stack is empty (or another -** interruption long-jumps out of the loop). -*/ -static void unroll (lua_State *L, void *ud) { - CallInfo *ci; - UNUSED(ud); - while ((ci = L->ci) != &L->base_ci) { /* something in the stack */ - if (!isLua(ci)) /* C function? */ - finishCcall(L, ci); /* complete its execution */ - else { /* Lua function */ - luaV_finishOp(L); /* finish interrupted instruction */ - luaV_execute(L, ci); /* execute down to higher C 'boundary' */ - } - } -} - - -/* -** Try to find a suspended protected call (a "recover point") for the -** given thread. -*/ -static CallInfo *findpcall (lua_State *L) { - CallInfo *ci; - for (ci = L->ci; ci != NULL; ci = ci->previous) { /* search for a pcall */ - if (ci->callstatus & CIST_YPCALL) - return ci; - } - return NULL; /* no pending pcall */ -} - - -/* -** Signal an error in the call to 'lua_resume', not in the execution -** of the coroutine itself. (Such errors should not be handled by any -** coroutine error handler and should not kill the coroutine.) -*/ -static int resume_error (lua_State *L, const char *msg, int narg) { - api_checkpop(L, narg); - L->top.p -= narg; /* remove args from the stack */ - setsvalue2s(L, L->top.p, luaS_new(L, msg)); /* push error message */ - api_incr_top(L); - lua_unlock(L); - return LUA_ERRRUN; -} - - -/* -** Do the work for 'lua_resume' in protected mode. Most of the work -** depends on the status of the coroutine: initial state, suspended -** inside a hook, or regularly suspended (optionally with a continuation -** function), plus erroneous cases: non-suspended coroutine or dead -** coroutine. -*/ -static void resume (lua_State *L, void *ud) { - int n = *(cast(int*, ud)); /* number of arguments */ - StkId firstArg = L->top.p - n; /* first argument */ - CallInfo *ci = L->ci; - if (L->status == LUA_OK) /* starting a coroutine? */ - ccall(L, firstArg - 1, LUA_MULTRET, 0); /* just call its body */ - else { /* resuming from previous yield */ - lua_assert(L->status == LUA_YIELD); - L->status = LUA_OK; /* mark that it is running (again) */ - if (isLua(ci)) { /* yielded inside a hook? */ - /* undo increment made by 'luaG_traceexec': instruction was not - executed yet */ - lua_assert(ci->callstatus & CIST_HOOKYIELD); - ci->u.l.savedpc--; - L->top.p = firstArg; /* discard arguments */ - luaV_execute(L, ci); /* just continue running Lua code */ - } - else { /* 'common' yield */ - if (ci->u.c.k != NULL) { /* does it have a continuation function? */ - lua_unlock(L); - n = (*ci->u.c.k)(L, LUA_YIELD, ci->u.c.ctx); /* call continuation */ - lua_lock(L); - api_checknelems(L, n); - } - luaD_poscall(L, ci, n); /* finish 'luaD_call' */ - } - unroll(L, NULL); /* run continuation */ - } -} - - -/* -** Unrolls a coroutine in protected mode while there are recoverable -** errors, that is, errors inside a protected call. (Any error -** interrupts 'unroll', and this loop protects it again so it can -** continue.) Stops with a normal end (status == LUA_OK), an yield -** (status == LUA_YIELD), or an unprotected error ('findpcall' doesn't -** find a recover point). -*/ -static int precover (lua_State *L, int status) { - CallInfo *ci; - while (errorstatus(status) && (ci = findpcall(L)) != NULL) { - L->ci = ci; /* go down to recovery functions */ - setcistrecst(ci, status); /* status to finish 'pcall' */ - status = luaD_rawrunprotected(L, unroll, NULL); - } - return status; -} - - -LUA_API int lua_resume (lua_State *L, lua_State *from, int nargs, - int *nresults) { - int status; - lua_lock(L); - if (L->status == LUA_OK) { /* may be starting a coroutine */ - if (L->ci != &L->base_ci) /* not in base level? */ - return resume_error(L, "cannot resume non-suspended coroutine", nargs); - else if (L->top.p - (L->ci->func.p + 1) == nargs) /* no function? */ - return resume_error(L, "cannot resume dead coroutine", nargs); - } - else if (L->status != LUA_YIELD) /* ended with errors? */ - return resume_error(L, "cannot resume dead coroutine", nargs); - L->nCcalls = (from) ? getCcalls(from) : 0; - if (getCcalls(L) >= LUAI_MAXCCALLS) - return resume_error(L, "C stack overflow", nargs); - L->nCcalls++; - luai_userstateresume(L, nargs); - api_checkpop(L, (L->status == LUA_OK) ? nargs + 1 : nargs); - status = luaD_rawrunprotected(L, resume, &nargs); - /* continue running after recoverable errors */ - status = precover(L, status); - if (l_likely(!errorstatus(status))) - lua_assert(status == L->status); /* normal end or yield */ - else { /* unrecoverable error */ - L->status = cast_byte(status); /* mark thread as 'dead' */ - luaD_seterrorobj(L, status, L->top.p); /* push error message */ - L->ci->top.p = L->top.p; - } - *nresults = (status == LUA_YIELD) ? L->ci->u2.nyield - : cast_int(L->top.p - (L->ci->func.p + 1)); - lua_unlock(L); - return status; -} - - -LUA_API int lua_isyieldable (lua_State *L) { - return yieldable(L); -} - - -LUA_API int lua_yieldk (lua_State *L, int nresults, lua_KContext ctx, - lua_KFunction k) { - CallInfo *ci; - luai_userstateyield(L, nresults); - lua_lock(L); - ci = L->ci; - api_checkpop(L, nresults); - if (l_unlikely(!yieldable(L))) { - if (L != G(L)->mainthread) - luaG_runerror(L, "attempt to yield across a C-call boundary"); - else - luaG_runerror(L, "attempt to yield from outside a coroutine"); - } - L->status = LUA_YIELD; - ci->u2.nyield = nresults; /* save number of results */ - if (isLua(ci)) { /* inside a hook? */ - lua_assert(!isLuacode(ci)); - api_check(L, nresults == 0, "hooks cannot yield values"); - api_check(L, k == NULL, "hooks cannot continue after yielding"); - } - else { - if ((ci->u.c.k = k) != NULL) /* is there a continuation? */ - ci->u.c.ctx = ctx; /* save context */ - luaD_throw(L, LUA_YIELD); - } - lua_assert(ci->callstatus & CIST_HOOKED); /* must be inside a hook */ - lua_unlock(L); - return 0; /* return to 'luaD_hook' */ -} - - -/* -** Auxiliary structure to call 'luaF_close' in protected mode. -*/ -struct CloseP { - StkId level; - int status; -}; - - -/* -** Auxiliary function to call 'luaF_close' in protected mode. -*/ -static void closepaux (lua_State *L, void *ud) { - struct CloseP *pcl = cast(struct CloseP *, ud); - luaF_close(L, pcl->level, pcl->status, 0); -} - - -/* -** Calls 'luaF_close' in protected mode. Return the original status -** or, in case of errors, the new status. -*/ -int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status) { - CallInfo *old_ci = L->ci; - lu_byte old_allowhooks = L->allowhook; - for (;;) { /* keep closing upvalues until no more errors */ - struct CloseP pcl; - pcl.level = restorestack(L, level); pcl.status = status; - status = luaD_rawrunprotected(L, &closepaux, &pcl); - if (l_likely(status == LUA_OK)) /* no more errors? */ - return pcl.status; - else { /* an error occurred; restore saved state and repeat */ - L->ci = old_ci; - L->allowhook = old_allowhooks; - } - } -} - - -/* -** Call the C function 'func' in protected mode, restoring basic -** thread information ('allowhook', etc.) and in particular -** its stack level in case of errors. -*/ -int luaD_pcall (lua_State *L, Pfunc func, void *u, - ptrdiff_t old_top, ptrdiff_t ef) { - int status; - CallInfo *old_ci = L->ci; - lu_byte old_allowhooks = L->allowhook; - ptrdiff_t old_errfunc = L->errfunc; - L->errfunc = ef; - status = luaD_rawrunprotected(L, func, u); - if (l_unlikely(status != LUA_OK)) { /* an error occurred? */ - L->ci = old_ci; - L->allowhook = old_allowhooks; - status = luaD_closeprotected(L, old_top, status); - luaD_seterrorobj(L, status, restorestack(L, old_top)); - luaD_shrinkstack(L); /* restore stack size in case of overflow */ - } - L->errfunc = old_errfunc; - return status; -} - - - -/* -** Execute a protected parser. -*/ -struct SParser { /* data to 'f_parser' */ - ZIO *z; - Mbuffer buff; /* dynamic structure used by the scanner */ - Dyndata dyd; /* dynamic structures used by the parser */ - const char *mode; - const char *name; -}; - - -static void checkmode (lua_State *L, const char *mode, const char *x) { - if (strchr(mode, x[0]) == NULL) { - luaO_pushfstring(L, - "attempt to load a %s chunk (mode is '%s')", x, mode); - luaD_throw(L, LUA_ERRSYNTAX); - } -} - - -static void f_parser (lua_State *L, void *ud) { - LClosure *cl; - struct SParser *p = cast(struct SParser *, ud); - const char *mode = p->mode ? p->mode : "bt"; - int c = zgetc(p->z); /* read first character */ - if (c == LUA_SIGNATURE[0]) { - int fixed = 0; - if (strchr(mode, 'B') != NULL) - fixed = 1; - else - checkmode(L, mode, "binary"); - cl = luaU_undump(L, p->z, p->name, fixed); - } - else { - checkmode(L, mode, "text"); - cl = luaY_parser(L, p->z, &p->buff, &p->dyd, p->name, c); - } - lua_assert(cl->nupvalues == cl->p->sizeupvalues); - luaF_initupvals(L, cl); -} - - -int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, - const char *mode) { - struct SParser p; - int status; - incnny(L); /* cannot yield during parsing */ - p.z = z; p.name = name; p.mode = mode; - p.dyd.actvar.arr = NULL; p.dyd.actvar.size = 0; - p.dyd.gt.arr = NULL; p.dyd.gt.size = 0; - p.dyd.label.arr = NULL; p.dyd.label.size = 0; - luaZ_initbuffer(L, &p.buff); - status = luaD_pcall(L, f_parser, &p, savestack(L, L->top.p), L->errfunc); - luaZ_freebuffer(L, &p.buff); - luaM_freearray(L, p.dyd.actvar.arr, p.dyd.actvar.size); - luaM_freearray(L, p.dyd.gt.arr, p.dyd.gt.size); - luaM_freearray(L, p.dyd.label.arr, p.dyd.label.size); - decnny(L); - return status; -} - - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/ldo.h b/build/c/dependencies/luaCEmbed/dependencies/lua/ldo.h deleted file mode 100644 index 4bc7503..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/ldo.h +++ /dev/null @@ -1,75 +0,0 @@ -/* -** $Id: ldo.h $ -** Stack and Call structure of Lua -** See Copyright Notice in lua.h -*/ - -#ifndef ldo_h -#define ldo_h - - -#include "llimits.h" -#include "lobject.h" -#include "lstate.h" -#include "lzio.h" - - -/* -** Macro to check stack size and grow stack if needed. Parameters -** 'pre'/'pos' allow the macro to preserve a pointer into the -** stack across reallocations, doing the work only when needed. -** It also allows the running of one GC step when the stack is -** reallocated. -** 'condmovestack' is used in heavy tests to force a stack reallocation -** at every check. -*/ -#define luaD_checkstackaux(L,n,pre,pos) \ - if (l_unlikely(L->stack_last.p - L->top.p <= (n))) \ - { pre; luaD_growstack(L, n, 1); pos; } \ - else { condmovestack(L,pre,pos); } - -/* In general, 'pre'/'pos' are empty (nothing to save) */ -#define luaD_checkstack(L,n) luaD_checkstackaux(L,n,(void)0,(void)0) - - - -#define savestack(L,pt) (cast_charp(pt) - cast_charp(L->stack.p)) -#define restorestack(L,n) cast(StkId, cast_charp(L->stack.p) + (n)) - - -/* macro to check stack size, preserving 'p' */ -#define checkstackp(L,n,p) \ - luaD_checkstackaux(L, n, \ - ptrdiff_t t__ = savestack(L, p), /* save 'p' */ \ - p = restorestack(L, t__)) /* 'pos' part: restore 'p' */ - - - -/* type of protected functions, to be ran by 'runprotected' */ -typedef void (*Pfunc) (lua_State *L, void *ud); - -LUAI_FUNC void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop); -LUAI_FUNC int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, - const char *mode); -LUAI_FUNC void luaD_hook (lua_State *L, int event, int line, - int fTransfer, int nTransfer); -LUAI_FUNC void luaD_hookcall (lua_State *L, CallInfo *ci); -LUAI_FUNC int luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, - int narg1, int delta); -LUAI_FUNC CallInfo *luaD_precall (lua_State *L, StkId func, int nResults); -LUAI_FUNC void luaD_call (lua_State *L, StkId func, int nResults); -LUAI_FUNC void luaD_callnoyield (lua_State *L, StkId func, int nResults); -LUAI_FUNC int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status); -LUAI_FUNC int luaD_pcall (lua_State *L, Pfunc func, void *u, - ptrdiff_t oldtop, ptrdiff_t ef); -LUAI_FUNC void luaD_poscall (lua_State *L, CallInfo *ci, int nres); -LUAI_FUNC int luaD_reallocstack (lua_State *L, int newsize, int raiseerror); -LUAI_FUNC int luaD_growstack (lua_State *L, int n, int raiseerror); -LUAI_FUNC void luaD_shrinkstack (lua_State *L); -LUAI_FUNC void luaD_inctop (lua_State *L); - -LUAI_FUNC l_noret luaD_throw (lua_State *L, int errcode); -LUAI_FUNC int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud); - -#endif - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/ldump.c b/build/c/dependencies/luaCEmbed/dependencies/lua/ldump.c deleted file mode 100644 index ca708a4..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/ldump.c +++ /dev/null @@ -1,290 +0,0 @@ -/* -** $Id: ldump.c $ -** save precompiled Lua chunks -** See Copyright Notice in lua.h -*/ - -#define ldump_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "lgc.h" -#include "lobject.h" -#include "lstate.h" -#include "ltable.h" -#include "lundump.h" - - -typedef struct { - lua_State *L; - lua_Writer writer; - void *data; - lu_mem offset; /* current position relative to beginning of dump */ - int strip; - int status; - Table *h; /* table to track saved strings */ - lua_Integer nstr; /* counter for counting saved strings */ -} DumpState; - - -/* -** All high-level dumps go through dumpVector; you can change it to -** change the endianness of the result -*/ -#define dumpVector(D,v,n) dumpBlock(D,v,(n)*sizeof((v)[0])) - -#define dumpLiteral(D, s) dumpBlock(D,s,sizeof(s) - sizeof(char)) - - -/* -** Dump the block of memory pointed by 'b' with given 'size'. -** 'b' should not be NULL, except for the last call signaling the end -** of the dump. -*/ -static void dumpBlock (DumpState *D, const void *b, size_t size) { - if (D->status == 0) { /* do not write anything after an error */ - lua_unlock(D->L); - D->status = (*D->writer)(D->L, b, size, D->data); - lua_lock(D->L); - D->offset += size; - } -} - - -/* -** Dump enough zeros to ensure that current position is a multiple of -** 'align'. -*/ -static void dumpAlign (DumpState *D, int align) { - int padding = align - (D->offset % align); - if (padding < align) { /* padding == align means no padding */ - static lua_Integer paddingContent = 0; - lua_assert(cast_uint(align) <= sizeof(lua_Integer)); - dumpBlock(D, &paddingContent, padding); - } - lua_assert(D->offset % align == 0); -} - - -#define dumpVar(D,x) dumpVector(D,&x,1) - - -static void dumpByte (DumpState *D, int y) { - lu_byte x = (lu_byte)y; - dumpVar(D, x); -} - - -/* -** size for 'dumpVarint' buffer: each byte can store up to 7 bits. -** (The "+6" rounds up the division.) -*/ -#define DIBS ((sizeof(size_t) * CHAR_BIT + 6) / 7) - -/* -** Dumps an unsigned integer using the MSB Varint encoding -*/ -static void dumpVarint (DumpState *D, size_t x) { - lu_byte buff[DIBS]; - int n = 1; - buff[DIBS - 1] = x & 0x7f; /* fill least-significant byte */ - while ((x >>= 7) != 0) /* fill other bytes in reverse order */ - buff[DIBS - (++n)] = (x & 0x7f) | 0x80; - dumpVector(D, buff + DIBS - n, n); -} - - -static void dumpSize (DumpState *D, size_t sz) { - dumpVarint(D, sz); -} - -static void dumpInt (DumpState *D, int x) { - lua_assert(x >= 0); - dumpVarint(D, cast(size_t, x)); -} - - -static void dumpNumber (DumpState *D, lua_Number x) { - dumpVar(D, x); -} - - -static void dumpInteger (DumpState *D, lua_Integer x) { - dumpVar(D, x); -} - - -/* -** Dump a String. First dump its "size": size==0 means NULL; -** size==1 is followed by an index and means "reuse saved string with -** that index"; size>=2 is followed by the string contents with real -** size==size-2 and means that string, which will be saved with -** the next available index. -*/ -static void dumpString (DumpState *D, TString *ts) { - if (ts == NULL) - dumpSize(D, 0); - else { - TValue idx; - int tag = luaH_getstr(D->h, ts, &idx); - if (!tagisempty(tag)) { /* string already saved? */ - dumpSize(D, 1); /* reuse a saved string */ - dumpSize(D, cast_sizet(ivalue(&idx))); /* index of saved string */ - } - else { /* must write and save the string */ - TValue key, value; /* to save the string in the hash */ - size_t size; - const char *s = getlstr(ts, size); - dumpSize(D, size + 2); - dumpVector(D, s, size + 1); /* include ending '\0' */ - D->nstr++; /* one more saved string */ - setsvalue(D->L, &key, ts); /* the string is the key */ - setivalue(&value, D->nstr); /* its index is the value */ - luaH_set(D->L, D->h, &key, &value); /* h[ts] = nstr */ - /* integer value does not need barrier */ - } - } -} - - -static void dumpCode (DumpState *D, const Proto *f) { - dumpInt(D, f->sizecode); - dumpAlign(D, sizeof(f->code[0])); - lua_assert(f->code != NULL); - dumpVector(D, f->code, f->sizecode); -} - - -static void dumpFunction (DumpState *D, const Proto *f); - -static void dumpConstants (DumpState *D, const Proto *f) { - int i; - int n = f->sizek; - dumpInt(D, n); - for (i = 0; i < n; i++) { - const TValue *o = &f->k[i]; - int tt = ttypetag(o); - dumpByte(D, tt); - switch (tt) { - case LUA_VNUMFLT: - dumpNumber(D, fltvalue(o)); - break; - case LUA_VNUMINT: - dumpInteger(D, ivalue(o)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - dumpString(D, tsvalue(o)); - break; - default: - lua_assert(tt == LUA_VNIL || tt == LUA_VFALSE || tt == LUA_VTRUE); - } - } -} - - -static void dumpProtos (DumpState *D, const Proto *f) { - int i; - int n = f->sizep; - dumpInt(D, n); - for (i = 0; i < n; i++) - dumpFunction(D, f->p[i]); -} - - -static void dumpUpvalues (DumpState *D, const Proto *f) { - int i, n = f->sizeupvalues; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpByte(D, f->upvalues[i].instack); - dumpByte(D, f->upvalues[i].idx); - dumpByte(D, f->upvalues[i].kind); - } -} - - -static void dumpDebug (DumpState *D, const Proto *f) { - int i, n; - n = (D->strip) ? 0 : f->sizelineinfo; - dumpInt(D, n); - if (f->lineinfo != NULL) - dumpVector(D, f->lineinfo, n); - n = (D->strip) ? 0 : f->sizeabslineinfo; - dumpInt(D, n); - if (n > 0) { - /* 'abslineinfo' is an array of structures of int's */ - dumpAlign(D, sizeof(int)); - dumpVector(D, f->abslineinfo, n); - } - n = (D->strip) ? 0 : f->sizelocvars; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpString(D, f->locvars[i].varname); - dumpInt(D, f->locvars[i].startpc); - dumpInt(D, f->locvars[i].endpc); - } - n = (D->strip) ? 0 : f->sizeupvalues; - dumpInt(D, n); - for (i = 0; i < n; i++) - dumpString(D, f->upvalues[i].name); -} - - -static void dumpFunction (DumpState *D, const Proto *f) { - dumpInt(D, f->linedefined); - dumpInt(D, f->lastlinedefined); - dumpByte(D, f->numparams); - dumpByte(D, f->flag); - dumpByte(D, f->maxstacksize); - dumpCode(D, f); - dumpConstants(D, f); - dumpUpvalues(D, f); - dumpProtos(D, f); - dumpString(D, D->strip ? NULL : f->source); - dumpDebug(D, f); -} - - -static void dumpHeader (DumpState *D) { - dumpLiteral(D, LUA_SIGNATURE); - dumpByte(D, LUAC_VERSION); - dumpByte(D, LUAC_FORMAT); - dumpLiteral(D, LUAC_DATA); - dumpByte(D, sizeof(Instruction)); - dumpByte(D, sizeof(lua_Integer)); - dumpByte(D, sizeof(lua_Number)); - dumpInteger(D, LUAC_INT); - dumpNumber(D, LUAC_NUM); -} - - -/* -** dump Lua function as precompiled chunk -*/ -int luaU_dump (lua_State *L, const Proto *f, lua_Writer w, void *data, - int strip) { - DumpState D; - D.h = luaH_new(L); /* aux. table to keep strings already dumped */ - sethvalue2s(L, L->top.p, D.h); /* anchor it */ - L->top.p++; - D.L = L; - D.writer = w; - D.offset = 0; - D.data = data; - D.strip = strip; - D.status = 0; - D.nstr = 0; - dumpHeader(&D); - dumpByte(&D, f->sizeupvalues); - dumpFunction(&D, f); - dumpBlock(&D, NULL, 0); /* signal end of dump */ - return D.status; -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lfunc.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lfunc.c deleted file mode 100644 index d63d05f..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lfunc.c +++ /dev/null @@ -1,296 +0,0 @@ -/* -** $Id: lfunc.c $ -** Auxiliary functions to manipulate prototypes and closures -** See Copyright Notice in lua.h -*/ - -#define lfunc_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" - - - -CClosure *luaF_newCclosure (lua_State *L, int nupvals) { - GCObject *o = luaC_newobj(L, LUA_VCCL, sizeCclosure(nupvals)); - CClosure *c = gco2ccl(o); - c->nupvalues = cast_byte(nupvals); - return c; -} - - -LClosure *luaF_newLclosure (lua_State *L, int nupvals) { - GCObject *o = luaC_newobj(L, LUA_VLCL, sizeLclosure(nupvals)); - LClosure *c = gco2lcl(o); - c->p = NULL; - c->nupvalues = cast_byte(nupvals); - while (nupvals--) c->upvals[nupvals] = NULL; - return c; -} - - -/* -** fill a closure with new closed upvalues -*/ -void luaF_initupvals (lua_State *L, LClosure *cl) { - int i; - for (i = 0; i < cl->nupvalues; i++) { - GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); - UpVal *uv = gco2upv(o); - uv->v.p = &uv->u.value; /* make it closed */ - setnilvalue(uv->v.p); - cl->upvals[i] = uv; - luaC_objbarrier(L, cl, uv); - } -} - - -/* -** Create a new upvalue at the given level, and link it to the list of -** open upvalues of 'L' after entry 'prev'. -**/ -static UpVal *newupval (lua_State *L, StkId level, UpVal **prev) { - GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); - UpVal *uv = gco2upv(o); - UpVal *next = *prev; - uv->v.p = s2v(level); /* current value lives in the stack */ - uv->u.open.next = next; /* link it to list of open upvalues */ - uv->u.open.previous = prev; - if (next) - next->u.open.previous = &uv->u.open.next; - *prev = uv; - if (!isintwups(L)) { /* thread not in list of threads with upvalues? */ - L->twups = G(L)->twups; /* link it to the list */ - G(L)->twups = L; - } - return uv; -} - - -/* -** Find and reuse, or create if it does not exist, an upvalue -** at the given level. -*/ -UpVal *luaF_findupval (lua_State *L, StkId level) { - UpVal **pp = &L->openupval; - UpVal *p; - lua_assert(isintwups(L) || L->openupval == NULL); - while ((p = *pp) != NULL && uplevel(p) >= level) { /* search for it */ - lua_assert(!isdead(G(L), p)); - if (uplevel(p) == level) /* corresponding upvalue? */ - return p; /* return it */ - pp = &p->u.open.next; - } - /* not found: create a new upvalue after 'pp' */ - return newupval(L, level, pp); -} - - -/* -** Call closing method for object 'obj' with error message 'err'. The -** boolean 'yy' controls whether the call is yieldable. -** (This function assumes EXTRA_STACK.) -*/ -static void callclosemethod (lua_State *L, TValue *obj, TValue *err, int yy) { - StkId top = L->top.p; - const TValue *tm = luaT_gettmbyobj(L, obj, TM_CLOSE); - setobj2s(L, top, tm); /* will call metamethod... */ - setobj2s(L, top + 1, obj); /* with 'self' as the 1st argument */ - setobj2s(L, top + 2, err); /* and error msg. as 2nd argument */ - L->top.p = top + 3; /* add function and arguments */ - if (yy) - luaD_call(L, top, 0); - else - luaD_callnoyield(L, top, 0); -} - - -/* -** Check whether object at given level has a close metamethod and raise -** an error if not. -*/ -static void checkclosemth (lua_State *L, StkId level) { - const TValue *tm = luaT_gettmbyobj(L, s2v(level), TM_CLOSE); - if (ttisnil(tm)) { /* no metamethod? */ - int idx = cast_int(level - L->ci->func.p); /* variable index */ - const char *vname = luaG_findlocal(L, L->ci, idx, NULL); - if (vname == NULL) vname = "?"; - luaG_runerror(L, "variable '%s' got a non-closable value", vname); - } -} - - -/* -** Prepare and call a closing method. -** If status is CLOSEKTOP, the call to the closing method will be pushed -** at the top of the stack. Otherwise, values can be pushed right after -** the 'level' of the upvalue being closed, as everything after that -** won't be used again. -*/ -static void prepcallclosemth (lua_State *L, StkId level, int status, int yy) { - TValue *uv = s2v(level); /* value being closed */ - TValue *errobj; - if (status == CLOSEKTOP) - errobj = &G(L)->nilvalue; /* error object is nil */ - else { /* 'luaD_seterrorobj' will set top to level + 2 */ - errobj = s2v(level + 1); /* error object goes after 'uv' */ - luaD_seterrorobj(L, status, level + 1); /* set error object */ - } - callclosemethod(L, uv, errobj, yy); -} - - -/* -** Maximum value for deltas in 'tbclist', dependent on the type -** of delta. (This macro assumes that an 'L' is in scope where it -** is used.) -*/ -#define MAXDELTA \ - ((256ul << ((sizeof(L->stack.p->tbclist.delta) - 1) * 8)) - 1) - - -/* -** Insert a variable in the list of to-be-closed variables. -*/ -void luaF_newtbcupval (lua_State *L, StkId level) { - lua_assert(level > L->tbclist.p); - if (l_isfalse(s2v(level))) - return; /* false doesn't need to be closed */ - checkclosemth(L, level); /* value must have a close method */ - while (cast_uint(level - L->tbclist.p) > MAXDELTA) { - L->tbclist.p += MAXDELTA; /* create a dummy node at maximum delta */ - L->tbclist.p->tbclist.delta = 0; - } - level->tbclist.delta = cast(unsigned short, level - L->tbclist.p); - L->tbclist.p = level; -} - - -void luaF_unlinkupval (UpVal *uv) { - lua_assert(upisopen(uv)); - *uv->u.open.previous = uv->u.open.next; - if (uv->u.open.next) - uv->u.open.next->u.open.previous = uv->u.open.previous; -} - - -/* -** Close all upvalues up to the given stack level. -*/ -void luaF_closeupval (lua_State *L, StkId level) { - UpVal *uv; - StkId upl; /* stack index pointed by 'uv' */ - while ((uv = L->openupval) != NULL && (upl = uplevel(uv)) >= level) { - TValue *slot = &uv->u.value; /* new position for value */ - lua_assert(uplevel(uv) < L->top.p); - luaF_unlinkupval(uv); /* remove upvalue from 'openupval' list */ - setobj(L, slot, uv->v.p); /* move value to upvalue slot */ - uv->v.p = slot; /* now current value lives here */ - if (!iswhite(uv)) { /* neither white nor dead? */ - nw2black(uv); /* closed upvalues cannot be gray */ - luaC_barrier(L, uv, slot); - } - } -} - - -/* -** Remove first element from the tbclist plus its dummy nodes. -*/ -static void poptbclist (lua_State *L) { - StkId tbc = L->tbclist.p; - lua_assert(tbc->tbclist.delta > 0); /* first element cannot be dummy */ - tbc -= tbc->tbclist.delta; - while (tbc > L->stack.p && tbc->tbclist.delta == 0) - tbc -= MAXDELTA; /* remove dummy nodes */ - L->tbclist.p = tbc; -} - - -/* -** Close all upvalues and to-be-closed variables up to the given stack -** level. Return restored 'level'. -*/ -StkId luaF_close (lua_State *L, StkId level, int status, int yy) { - ptrdiff_t levelrel = savestack(L, level); - luaF_closeupval(L, level); /* first, close the upvalues */ - while (L->tbclist.p >= level) { /* traverse tbc's down to that level */ - StkId tbc = L->tbclist.p; /* get variable index */ - poptbclist(L); /* remove it from list */ - prepcallclosemth(L, tbc, status, yy); /* close variable */ - level = restorestack(L, levelrel); - } - return level; -} - - -Proto *luaF_newproto (lua_State *L) { - GCObject *o = luaC_newobj(L, LUA_VPROTO, sizeof(Proto)); - Proto *f = gco2p(o); - f->k = NULL; - f->sizek = 0; - f->p = NULL; - f->sizep = 0; - f->code = NULL; - f->sizecode = 0; - f->lineinfo = NULL; - f->sizelineinfo = 0; - f->abslineinfo = NULL; - f->sizeabslineinfo = 0; - f->upvalues = NULL; - f->sizeupvalues = 0; - f->numparams = 0; - f->flag = 0; - f->maxstacksize = 0; - f->locvars = NULL; - f->sizelocvars = 0; - f->linedefined = 0; - f->lastlinedefined = 0; - f->source = NULL; - return f; -} - - -void luaF_freeproto (lua_State *L, Proto *f) { - if (!(f->flag & PF_FIXED)) { - luaM_freearray(L, f->code, f->sizecode); - luaM_freearray(L, f->lineinfo, f->sizelineinfo); - luaM_freearray(L, f->abslineinfo, f->sizeabslineinfo); - } - luaM_freearray(L, f->p, f->sizep); - luaM_freearray(L, f->k, f->sizek); - luaM_freearray(L, f->locvars, f->sizelocvars); - luaM_freearray(L, f->upvalues, f->sizeupvalues); - luaM_free(L, f); -} - - -/* -** Look for n-th local variable at line 'line' in function 'func'. -** Returns NULL if not found. -*/ -const char *luaF_getlocalname (const Proto *f, int local_number, int pc) { - int i; - for (i = 0; isizelocvars && f->locvars[i].startpc <= pc; i++) { - if (pc < f->locvars[i].endpc) { /* is variable active? */ - local_number--; - if (local_number == 0) - return getstr(f->locvars[i].varname); - } - } - return NULL; /* not found */ -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lfunc.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lfunc.h deleted file mode 100644 index 3be265e..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lfunc.h +++ /dev/null @@ -1,64 +0,0 @@ -/* -** $Id: lfunc.h $ -** Auxiliary functions to manipulate prototypes and closures -** See Copyright Notice in lua.h -*/ - -#ifndef lfunc_h -#define lfunc_h - - -#include "lobject.h" - - -#define sizeCclosure(n) (cast_int(offsetof(CClosure, upvalue)) + \ - cast_int(sizeof(TValue)) * (n)) - -#define sizeLclosure(n) (cast_int(offsetof(LClosure, upvals)) + \ - cast_int(sizeof(TValue *)) * (n)) - - -/* test whether thread is in 'twups' list */ -#define isintwups(L) (L->twups != L) - - -/* -** maximum number of upvalues in a closure (both C and Lua). (Value -** must fit in a VM register.) -*/ -#define MAXUPVAL 255 - - -#define upisopen(up) ((up)->v.p != &(up)->u.value) - - -#define uplevel(up) check_exp(upisopen(up), cast(StkId, (up)->v.p)) - - -/* -** maximum number of misses before giving up the cache of closures -** in prototypes -*/ -#define MAXMISS 10 - - - -/* special status to close upvalues preserving the top of the stack */ -#define CLOSEKTOP (-1) - - -LUAI_FUNC Proto *luaF_newproto (lua_State *L); -LUAI_FUNC CClosure *luaF_newCclosure (lua_State *L, int nupvals); -LUAI_FUNC LClosure *luaF_newLclosure (lua_State *L, int nupvals); -LUAI_FUNC void luaF_initupvals (lua_State *L, LClosure *cl); -LUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_newtbcupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_closeupval (lua_State *L, StkId level); -LUAI_FUNC StkId luaF_close (lua_State *L, StkId level, int status, int yy); -LUAI_FUNC void luaF_unlinkupval (UpVal *uv); -LUAI_FUNC void luaF_freeproto (lua_State *L, Proto *f); -LUAI_FUNC const char *luaF_getlocalname (const Proto *func, int local_number, - int pc); - - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lgc.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lgc.c deleted file mode 100644 index 700390d..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lgc.c +++ /dev/null @@ -1,1724 +0,0 @@ -/* -** $Id: lgc.c $ -** Garbage Collector -** See Copyright Notice in lua.h -*/ - -#define lgc_c -#define LUA_CORE - -#include "lprefix.h" - -#include - - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "llex.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" - - -/* -** Number of fixed (luaC_fix) objects in a Lua state: metafield names, -** plus reserved words, plus "_ENV", plus the memory-error message. -*/ -#define NFIXED (TM_N + NUM_RESERVED + 2) - - -/* -** Maximum number of elements to sweep in each single step. -** (Large enough to dissipate fixed overheads but small enough -** to allow small steps for the collector.) -*/ -#define GCSWEEPMAX 20 - - -/* mask with all color bits */ -#define maskcolors (bitmask(BLACKBIT) | WHITEBITS) - -/* mask with all GC bits */ -#define maskgcbits (maskcolors | AGEBITS) - - -/* macro to erase all color bits then set only the current white bit */ -#define makewhite(g,x) \ - (x->marked = cast_byte((x->marked & ~maskcolors) | luaC_white(g))) - -/* make an object gray (neither white nor black) */ -#define set2gray(x) resetbits(x->marked, maskcolors) - - -/* make an object black (coming from any color) */ -#define set2black(x) \ - (x->marked = cast_byte((x->marked & ~WHITEBITS) | bitmask(BLACKBIT))) - - -#define valiswhite(x) (iscollectable(x) && iswhite(gcvalue(x))) - -#define keyiswhite(n) (keyiscollectable(n) && iswhite(gckey(n))) - - -/* -** Protected access to objects in values -*/ -#define gcvalueN(o) (iscollectable(o) ? gcvalue(o) : NULL) - - -/* -** Access to collectable objects in array part of tables -*/ -#define gcvalarr(t,i) \ - ((*getArrTag(t,i) & BIT_ISCOLLECTABLE) ? getArrVal(t,i)->gc : NULL) - - -#define markvalue(g,o) { checkliveness(g->mainthread,o); \ - if (valiswhite(o)) reallymarkobject(g,gcvalue(o)); } - -#define markkey(g, n) { if keyiswhite(n) reallymarkobject(g,gckey(n)); } - -#define markobject(g,t) { if (iswhite(t)) reallymarkobject(g, obj2gco(t)); } - -/* -** mark an object that can be NULL (either because it is really optional, -** or it was stripped as debug info, or inside an uncompleted structure) -*/ -#define markobjectN(g,t) { if (t) markobject(g,t); } - - -static void reallymarkobject (global_State *g, GCObject *o); -static l_obj atomic (lua_State *L); -static void entersweep (lua_State *L); - - -/* -** {====================================================== -** Generic functions -** ======================================================= -*/ - - -/* -** one after last element in a hash array -*/ -#define gnodelast(h) gnode(h, cast_sizet(sizenode(h))) - - -static GCObject **getgclist (GCObject *o) { - switch (o->tt) { - case LUA_VTABLE: return &gco2t(o)->gclist; - case LUA_VLCL: return &gco2lcl(o)->gclist; - case LUA_VCCL: return &gco2ccl(o)->gclist; - case LUA_VTHREAD: return &gco2th(o)->gclist; - case LUA_VPROTO: return &gco2p(o)->gclist; - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - lua_assert(u->nuvalue > 0); - return &u->gclist; - } - default: lua_assert(0); return 0; - } -} - - -/* -** Link a collectable object 'o' with a known type into the list 'p'. -** (Must be a macro to access the 'gclist' field in different types.) -*/ -#define linkgclist(o,p) linkgclist_(obj2gco(o), &(o)->gclist, &(p)) - -static void linkgclist_ (GCObject *o, GCObject **pnext, GCObject **list) { - lua_assert(!isgray(o)); /* cannot be in a gray list */ - *pnext = *list; - *list = o; - set2gray(o); /* now it is */ -} - - -/* -** Link a generic collectable object 'o' into the list 'p'. -*/ -#define linkobjgclist(o,p) linkgclist_(obj2gco(o), getgclist(o), &(p)) - - - -/* -** Clear keys for empty entries in tables. If entry is empty, mark its -** entry as dead. This allows the collection of the key, but keeps its -** entry in the table: its removal could break a chain and could break -** a table traversal. Other places never manipulate dead keys, because -** its associated empty value is enough to signal that the entry is -** logically empty. -*/ -static void clearkey (Node *n) { - lua_assert(isempty(gval(n))); - if (keyiscollectable(n)) - setdeadkey(n); /* unused key; remove it */ -} - - -/* -** tells whether a key or value can be cleared from a weak -** table. Non-collectable objects are never removed from weak -** tables. Strings behave as 'values', so are never removed too. for -** other objects: if really collected, cannot keep them; for objects -** being finalized, keep them in keys, but not in values -*/ -static int iscleared (global_State *g, const GCObject *o) { - if (o == NULL) return 0; /* non-collectable value */ - else if (novariant(o->tt) == LUA_TSTRING) { - markobject(g, o); /* strings are 'values', so are never weak */ - return 0; - } - else return iswhite(o); -} - - -/* -** Barrier that moves collector forward, that is, marks the white object -** 'v' being pointed by the black object 'o'. In the generational -** mode, 'v' must also become old, if 'o' is old; however, it cannot -** be changed directly to OLD, because it may still point to non-old -** objects. So, it is marked as OLD0. In the next cycle it will become -** OLD1, and in the next it will finally become OLD (regular old). By -** then, any object it points to will also be old. If called in the -** incremental sweep phase, it clears the black object to white (sweep -** it) to avoid other barrier calls for this same object. (That cannot -** be done is generational mode, as its sweep does not distinguish -** whites from deads.) -*/ -void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v) { - global_State *g = G(L); - lua_assert(isblack(o) && iswhite(v) && !isdead(g, v) && !isdead(g, o)); - if (keepinvariant(g)) { /* must keep invariant? */ - reallymarkobject(g, v); /* restore invariant */ - if (isold(o)) { - lua_assert(!isold(v)); /* white object could not be old */ - setage(v, G_OLD0); /* restore generational invariant */ - } - } - else { /* sweep phase */ - lua_assert(issweepphase(g)); - if (g->gckind != KGC_GENMINOR) /* incremental mode? */ - makewhite(g, o); /* mark 'o' as white to avoid other barriers */ - } -} - - -/* -** barrier that moves collector backward, that is, mark the black object -** pointing to a white object as gray again. -*/ -void luaC_barrierback_ (lua_State *L, GCObject *o) { - global_State *g = G(L); - lua_assert(isblack(o) && !isdead(g, o)); - lua_assert((g->gckind != KGC_GENMINOR) - || (isold(o) && getage(o) != G_TOUCHED1)); - if (getage(o) == G_TOUCHED2) /* already in gray list? */ - set2gray(o); /* make it gray to become touched1 */ - else /* link it in 'grayagain' and paint it gray */ - linkobjgclist(o, g->grayagain); - if (isold(o)) /* generational mode? */ - setage(o, G_TOUCHED1); /* touched in current cycle */ -} - - -void luaC_fix (lua_State *L, GCObject *o) { - global_State *g = G(L); - lua_assert(g->allgc == o); /* object must be 1st in 'allgc' list! */ - set2gray(o); /* they will be gray forever */ - setage(o, G_OLD); /* and old forever */ - g->allgc = o->next; /* remove object from 'allgc' list */ - o->next = g->fixedgc; /* link it to 'fixedgc' list */ - g->fixedgc = o; -} - - -/* -** create a new collectable object (with given type, size, and offset) -** and link it to 'allgc' list. -*/ -GCObject *luaC_newobjdt (lua_State *L, int tt, size_t sz, size_t offset) { - global_State *g = G(L); - char *p = cast_charp(luaM_newobject(L, novariant(tt), sz)); - GCObject *o = cast(GCObject *, p + offset); - g->GCdebt--; - o->marked = luaC_white(g); - o->tt = tt; - o->next = g->allgc; - g->allgc = o; - return o; -} - - -/* -** create a new collectable object with no offset. -*/ -GCObject *luaC_newobj (lua_State *L, int tt, size_t sz) { - return luaC_newobjdt(L, tt, sz, 0); -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Mark functions -** ======================================================= -*/ - - -/* -** Mark an object. Userdata with no user values, strings, and closed -** upvalues are visited and turned black here. Open upvalues are -** already indirectly linked through their respective threads in the -** 'twups' list, so they don't go to the gray list; nevertheless, they -** are kept gray to avoid barriers, as their values will be revisited -** by the thread or by 'remarkupvals'. Other objects are added to the -** gray list to be visited (and turned black) later. Both userdata and -** upvalues can call this function recursively, but this recursion goes -** for at most two levels: An upvalue cannot refer to another upvalue -** (only closures can), and a userdata's metatable must be a table. -*/ -static void reallymarkobject (global_State *g, GCObject *o) { - g->marked++; - switch (o->tt) { - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - set2black(o); /* nothing to visit */ - break; - } - case LUA_VUPVAL: { - UpVal *uv = gco2upv(o); - if (upisopen(uv)) - set2gray(uv); /* open upvalues are kept gray */ - else - set2black(uv); /* closed upvalues are visited here */ - markvalue(g, uv->v.p); /* mark its content */ - break; - } - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - if (u->nuvalue == 0) { /* no user values? */ - markobjectN(g, u->metatable); /* mark its metatable */ - set2black(u); /* nothing else to mark */ - break; - } - /* else... */ - } /* FALLTHROUGH */ - case LUA_VLCL: case LUA_VCCL: case LUA_VTABLE: - case LUA_VTHREAD: case LUA_VPROTO: { - linkobjgclist(o, g->gray); /* to be visited later */ - break; - } - default: lua_assert(0); break; - } -} - - -/* -** mark metamethods for basic types -*/ -static void markmt (global_State *g) { - int i; - for (i=0; i < LUA_NUMTYPES; i++) - markobjectN(g, g->mt[i]); -} - - -/* -** mark all objects in list of being-finalized -*/ -static l_obj markbeingfnz (global_State *g) { - GCObject *o; - l_obj count = 0; - for (o = g->tobefnz; o != NULL; o = o->next) { - count++; - markobject(g, o); - } - return count; -} - - -/* -** For each non-marked thread, simulates a barrier between each open -** upvalue and its value. (If the thread is collected, the value will be -** assigned to the upvalue, but then it can be too late for the barrier -** to act. The "barrier" does not need to check colors: A non-marked -** thread must be young; upvalues cannot be older than their threads; so -** any visited upvalue must be young too.) Also removes the thread from -** the list, as it was already visited. Removes also threads with no -** upvalues, as they have nothing to be checked. (If the thread gets an -** upvalue later, it will be linked in the list again.) -*/ -static l_obj remarkupvals (global_State *g) { - l_obj work = 0; - lua_State *thread; - lua_State **p = &g->twups; - while ((thread = *p) != NULL) { - if (!iswhite(thread) && thread->openupval != NULL) - p = &thread->twups; /* keep marked thread with upvalues in the list */ - else { /* thread is not marked or without upvalues */ - UpVal *uv; - lua_assert(!isold(thread) || thread->openupval == NULL); - *p = thread->twups; /* remove thread from the list */ - thread->twups = thread; /* mark that it is out of list */ - for (uv = thread->openupval; uv != NULL; uv = uv->u.open.next) { - lua_assert(getage(uv) <= getage(thread)); - if (!iswhite(uv)) { /* upvalue already visited? */ - lua_assert(upisopen(uv) && isgray(uv)); - markvalue(g, uv->v.p); /* mark its value */ - } - } - } - work++; - } - return work; -} - - -static void cleargraylists (global_State *g) { - g->gray = g->grayagain = NULL; - g->weak = g->allweak = g->ephemeron = NULL; -} - - -/* -** mark root set and reset all gray lists, to start a new collection. -** 'marked' is initialized with the number of fixed objects in the state, -** to count the total number of live objects during a cycle. (That is -** the metafield names, plus the reserved words, plus "_ENV" plus the -** memory-error message.) -*/ -static void restartcollection (global_State *g) { - cleargraylists(g); - g->marked = NFIXED; - markobject(g, g->mainthread); - markvalue(g, &g->l_registry); - markmt(g); - markbeingfnz(g); /* mark any finalizing object left from previous cycle */ -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Traverse functions -** ======================================================= -*/ - - -/* -** Check whether object 'o' should be kept in the 'grayagain' list for -** post-processing by 'correctgraylist'. (It could put all old objects -** in the list and leave all the work to 'correctgraylist', but it is -** more efficient to avoid adding elements that will be removed.) Only -** TOUCHED1 objects need to be in the list. TOUCHED2 doesn't need to go -** back to a gray list, but then it must become OLD. (That is what -** 'correctgraylist' does when it finds a TOUCHED2 object.) -*/ -static void genlink (global_State *g, GCObject *o) { - lua_assert(isblack(o)); - if (getage(o) == G_TOUCHED1) { /* touched in this cycle? */ - linkobjgclist(o, g->grayagain); /* link it back in 'grayagain' */ - } /* everything else do not need to be linked back */ - else if (getage(o) == G_TOUCHED2) - setage(o, G_OLD); /* advance age */ -} - - -/* -** Traverse a table with weak values and link it to proper list. During -** propagate phase, keep it in 'grayagain' list, to be revisited in the -** atomic phase. In the atomic phase, if table has any white value, -** put it in 'weak' list, to be cleared. -*/ -static void traverseweakvalue (global_State *g, Table *h) { - Node *n, *limit = gnodelast(h); - /* if there is array part, assume it may have white values (it is not - worth traversing it now just to check) */ - int hasclears = (h->alimit > 0); - for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ - if (isempty(gval(n))) /* entry is empty? */ - clearkey(n); /* clear its key */ - else { - lua_assert(!keyisnil(n)); - markkey(g, n); - if (!hasclears && iscleared(g, gcvalueN(gval(n)))) /* a white value? */ - hasclears = 1; /* table will have to be cleared */ - } - } - if (g->gcstate == GCSatomic && hasclears) - linkgclist(h, g->weak); /* has to be cleared later */ - else - linkgclist(h, g->grayagain); /* must retraverse it in atomic phase */ -} - - -/* -** Traverse the array part of a table. -*/ -static int traversearray (global_State *g, Table *h) { - unsigned asize = luaH_realasize(h); - int marked = 0; /* true if some object is marked in this traversal */ - unsigned i; - for (i = 0; i < asize; i++) { - GCObject *o = gcvalarr(h, i); - if (o != NULL && iswhite(o)) { - marked = 1; - reallymarkobject(g, o); - } - } - return marked; -} - - -/* -** Traverse an ephemeron table and link it to proper list. Returns true -** iff any object was marked during this traversal (which implies that -** convergence has to continue). During propagation phase, keep table -** in 'grayagain' list, to be visited again in the atomic phase. In -** the atomic phase, if table has any white->white entry, it has to -** be revisited during ephemeron convergence (as that key may turn -** black). Otherwise, if it has any white key, table has to be cleared -** (in the atomic phase). In generational mode, some tables -** must be kept in some gray list for post-processing; this is done -** by 'genlink'. -*/ -static int traverseephemeron (global_State *g, Table *h, int inv) { - int hasclears = 0; /* true if table has white keys */ - int hasww = 0; /* true if table has entry "white-key -> white-value" */ - unsigned int i; - unsigned int nsize = sizenode(h); - int marked = traversearray(g, h); /* traverse array part */ - /* traverse hash part; if 'inv', traverse descending - (see 'convergeephemerons') */ - for (i = 0; i < nsize; i++) { - Node *n = inv ? gnode(h, nsize - 1 - i) : gnode(h, i); - if (isempty(gval(n))) /* entry is empty? */ - clearkey(n); /* clear its key */ - else if (iscleared(g, gckeyN(n))) { /* key is not marked (yet)? */ - hasclears = 1; /* table must be cleared */ - if (valiswhite(gval(n))) /* value not marked yet? */ - hasww = 1; /* white-white entry */ - } - else if (valiswhite(gval(n))) { /* value not marked yet? */ - marked = 1; - reallymarkobject(g, gcvalue(gval(n))); /* mark it now */ - } - } - /* link table into proper list */ - if (g->gcstate == GCSpropagate) - linkgclist(h, g->grayagain); /* must retraverse it in atomic phase */ - else if (hasww) /* table has white->white entries? */ - linkgclist(h, g->ephemeron); /* have to propagate again */ - else if (hasclears) /* table has white keys? */ - linkgclist(h, g->allweak); /* may have to clean white keys */ - else - genlink(g, obj2gco(h)); /* check whether collector still needs to see it */ - return marked; -} - - -static void traversestrongtable (global_State *g, Table *h) { - Node *n, *limit = gnodelast(h); - traversearray(g, h); - for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ - if (isempty(gval(n))) /* entry is empty? */ - clearkey(n); /* clear its key */ - else { - lua_assert(!keyisnil(n)); - markkey(g, n); - markvalue(g, gval(n)); - } - } - genlink(g, obj2gco(h)); -} - - -static void traversetable (global_State *g, Table *h) { - const char *weakkey, *weakvalue; - const TValue *mode = gfasttm(g, h->metatable, TM_MODE); - TString *smode; - markobjectN(g, h->metatable); - if (mode && ttisshrstring(mode) && /* is there a weak mode? */ - (cast_void(smode = tsvalue(mode)), - cast_void(weakkey = strchr(getshrstr(smode), 'k')), - cast_void(weakvalue = strchr(getshrstr(smode), 'v')), - (weakkey || weakvalue))) { /* is really weak? */ - if (!weakkey) /* strong keys? */ - traverseweakvalue(g, h); - else if (!weakvalue) /* strong values? */ - traverseephemeron(g, h, 0); - else /* all weak */ - linkgclist(h, g->allweak); /* nothing to traverse now */ - } - else /* not weak */ - traversestrongtable(g, h); -} - - -static void traverseudata (global_State *g, Udata *u) { - int i; - markobjectN(g, u->metatable); /* mark its metatable */ - for (i = 0; i < u->nuvalue; i++) - markvalue(g, &u->uv[i].uv); - genlink(g, obj2gco(u)); -} - - -/* -** Traverse a prototype. (While a prototype is being build, its -** arrays can be larger than needed; the extra slots are filled with -** NULL, so the use of 'markobjectN') -*/ -static void traverseproto (global_State *g, Proto *f) { - int i; - markobjectN(g, f->source); - for (i = 0; i < f->sizek; i++) /* mark literals */ - markvalue(g, &f->k[i]); - for (i = 0; i < f->sizeupvalues; i++) /* mark upvalue names */ - markobjectN(g, f->upvalues[i].name); - for (i = 0; i < f->sizep; i++) /* mark nested protos */ - markobjectN(g, f->p[i]); - for (i = 0; i < f->sizelocvars; i++) /* mark local-variable names */ - markobjectN(g, f->locvars[i].varname); -} - - -static void traverseCclosure (global_State *g, CClosure *cl) { - int i; - for (i = 0; i < cl->nupvalues; i++) /* mark its upvalues */ - markvalue(g, &cl->upvalue[i]); -} - -/* -** Traverse a Lua closure, marking its prototype and its upvalues. -** (Both can be NULL while closure is being created.) -*/ -static void traverseLclosure (global_State *g, LClosure *cl) { - int i; - markobjectN(g, cl->p); /* mark its prototype */ - for (i = 0; i < cl->nupvalues; i++) { /* visit its upvalues */ - UpVal *uv = cl->upvals[i]; - markobjectN(g, uv); /* mark upvalue */ - } -} - - -/* -** Traverse a thread, marking the elements in the stack up to its top -** and cleaning the rest of the stack in the final traversal. That -** ensures that the entire stack have valid (non-dead) objects. -** Threads have no barriers. In gen. mode, old threads must be visited -** at every cycle, because they might point to young objects. In inc. -** mode, the thread can still be modified before the end of the cycle, -** and therefore it must be visited again in the atomic phase. To ensure -** these visits, threads must return to a gray list if they are not new -** (which can only happen in generational mode) or if the traverse is in -** the propagate phase (which can only happen in incremental mode). -*/ -static void traversethread (global_State *g, lua_State *th) { - UpVal *uv; - StkId o = th->stack.p; - if (isold(th) || g->gcstate == GCSpropagate) - linkgclist(th, g->grayagain); /* insert into 'grayagain' list */ - if (o == NULL) - return; /* stack not completely built yet */ - lua_assert(g->gcstate == GCSatomic || - th->openupval == NULL || isintwups(th)); - for (; o < th->top.p; o++) /* mark live elements in the stack */ - markvalue(g, s2v(o)); - for (uv = th->openupval; uv != NULL; uv = uv->u.open.next) - markobject(g, uv); /* open upvalues cannot be collected */ - if (g->gcstate == GCSatomic) { /* final traversal? */ - if (!g->gcemergency) - luaD_shrinkstack(th); /* do not change stack in emergency cycle */ - for (o = th->top.p; o < th->stack_last.p + EXTRA_STACK; o++) - setnilvalue(s2v(o)); /* clear dead stack slice */ - /* 'remarkupvals' may have removed thread from 'twups' list */ - if (!isintwups(th) && th->openupval != NULL) { - th->twups = g->twups; /* link it back to the list */ - g->twups = th; - } - } -} - - -/* -** traverse one gray object, turning it to black. -*/ -static void propagatemark (global_State *g) { - GCObject *o = g->gray; - nw2black(o); - g->gray = *getgclist(o); /* remove from 'gray' list */ - switch (o->tt) { - case LUA_VTABLE: traversetable(g, gco2t(o)); break; - case LUA_VUSERDATA: traverseudata(g, gco2u(o)); break; - case LUA_VLCL: traverseLclosure(g, gco2lcl(o)); break; - case LUA_VCCL: traverseCclosure(g, gco2ccl(o)); break; - case LUA_VPROTO: traverseproto(g, gco2p(o)); break; - case LUA_VTHREAD: traversethread(g, gco2th(o)); break; - default: lua_assert(0); - } -} - - -static l_obj propagateall (global_State *g) { - l_obj work = 0; - while (g->gray) { - propagatemark(g); - work++; - } - return work; -} - - -/* -** Traverse all ephemeron tables propagating marks from keys to values. -** Repeat until it converges, that is, nothing new is marked. 'dir' -** inverts the direction of the traversals, trying to speed up -** convergence on chains in the same table. -*/ -static l_obj convergeephemerons (global_State *g) { - int changed; - l_obj work = 0; - int dir = 0; - do { - GCObject *w; - GCObject *next = g->ephemeron; /* get ephemeron list */ - g->ephemeron = NULL; /* tables may return to this list when traversed */ - changed = 0; - while ((w = next) != NULL) { /* for each ephemeron table */ - Table *h = gco2t(w); - next = h->gclist; /* list is rebuilt during loop */ - nw2black(h); /* out of the list (for now) */ - if (traverseephemeron(g, h, dir)) { /* marked some value? */ - propagateall(g); /* propagate changes */ - changed = 1; /* will have to revisit all ephemeron tables */ - } - work++; - } - dir = !dir; /* invert direction next time */ - } while (changed); /* repeat until no more changes */ - return work; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Sweep Functions -** ======================================================= -*/ - - -/* -** clear entries with unmarked keys from all weaktables in list 'l' -*/ -static l_obj clearbykeys (global_State *g, GCObject *l) { - l_obj work = 0; - for (; l; l = gco2t(l)->gclist) { - Table *h = gco2t(l); - Node *limit = gnodelast(h); - Node *n; - for (n = gnode(h, 0); n < limit; n++) { - if (iscleared(g, gckeyN(n))) /* unmarked key? */ - setempty(gval(n)); /* remove entry */ - if (isempty(gval(n))) /* is entry empty? */ - clearkey(n); /* clear its key */ - } - work++; - } - return work; -} - - -/* -** clear entries with unmarked values from all weaktables in list 'l' up -** to element 'f' -*/ -static l_obj clearbyvalues (global_State *g, GCObject *l, GCObject *f) { - l_obj work = 0; - for (; l != f; l = gco2t(l)->gclist) { - Table *h = gco2t(l); - Node *n, *limit = gnodelast(h); - unsigned int i; - unsigned int asize = luaH_realasize(h); - for (i = 0; i < asize; i++) { - GCObject *o = gcvalarr(h, i); - if (iscleared(g, o)) /* value was collected? */ - *getArrTag(h, i) = LUA_VEMPTY; /* remove entry */ - } - for (n = gnode(h, 0); n < limit; n++) { - if (iscleared(g, gcvalueN(gval(n)))) /* unmarked value? */ - setempty(gval(n)); /* remove entry */ - if (isempty(gval(n))) /* is entry empty? */ - clearkey(n); /* clear its key */ - } - work++; - } - return work; -} - - -static void freeupval (lua_State *L, UpVal *uv) { - if (upisopen(uv)) - luaF_unlinkupval(uv); - luaM_free(L, uv); -} - - -static void freeobj (lua_State *L, GCObject *o) { - G(L)->totalobjs--; - switch (o->tt) { - case LUA_VPROTO: - luaF_freeproto(L, gco2p(o)); - break; - case LUA_VUPVAL: - freeupval(L, gco2upv(o)); - break; - case LUA_VLCL: { - LClosure *cl = gco2lcl(o); - luaM_freemem(L, cl, sizeLclosure(cl->nupvalues)); - break; - } - case LUA_VCCL: { - CClosure *cl = gco2ccl(o); - luaM_freemem(L, cl, sizeCclosure(cl->nupvalues)); - break; - } - case LUA_VTABLE: - luaH_free(L, gco2t(o)); - break; - case LUA_VTHREAD: - luaE_freethread(L, gco2th(o)); - break; - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - luaM_freemem(L, o, sizeudata(u->nuvalue, u->len)); - break; - } - case LUA_VSHRSTR: { - TString *ts = gco2ts(o); - luaS_remove(L, ts); /* remove it from hash table */ - luaM_freemem(L, ts, sizestrshr(ts->shrlen)); - break; - } - case LUA_VLNGSTR: { - TString *ts = gco2ts(o); - if (ts->shrlen == LSTRMEM) /* must free external string? */ - (*ts->falloc)(ts->ud, ts->contents, ts->u.lnglen + 1, 0); - luaM_freemem(L, ts, luaS_sizelngstr(ts->u.lnglen, ts->shrlen)); - break; - } - default: lua_assert(0); - } -} - - -/* -** sweep at most 'countin' elements from a list of GCObjects erasing dead -** objects, where a dead object is one marked with the old (non current) -** white; change all non-dead objects back to white (and new), preparing -** for next collection cycle. Return where to continue the traversal or -** NULL if list is finished. -*/ -static GCObject **sweeplist (lua_State *L, GCObject **p, l_obj countin) { - global_State *g = G(L); - int ow = otherwhite(g); - l_obj i; - int white = luaC_white(g); /* current white */ - for (i = 0; *p != NULL && i < countin; i++) { - GCObject *curr = *p; - int marked = curr->marked; - if (isdeadm(ow, marked)) { /* is 'curr' dead? */ - *p = curr->next; /* remove 'curr' from list */ - freeobj(L, curr); /* erase 'curr' */ - } - else { /* change mark to 'white' and age to 'new' */ - curr->marked = cast_byte((marked & ~maskgcbits) | white | G_NEW); - p = &curr->next; /* go to next element */ - } - } - return (*p == NULL) ? NULL : p; -} - - -/* -** sweep a list until a live object (or end of list) -*/ -static GCObject **sweeptolive (lua_State *L, GCObject **p) { - GCObject **old = p; - do { - p = sweeplist(L, p, 1); - } while (p == old); - return p; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Finalization -** ======================================================= -*/ - -/* -** If possible, shrink string table. -*/ -static void checkSizes (lua_State *L, global_State *g) { - if (!g->gcemergency) { - if (g->strt.nuse < g->strt.size / 4) /* string table too big? */ - luaS_resize(L, g->strt.size / 2); - } -} - - -/* -** Get the next udata to be finalized from the 'tobefnz' list, and -** link it back into the 'allgc' list. -*/ -static GCObject *udata2finalize (global_State *g) { - GCObject *o = g->tobefnz; /* get first element */ - lua_assert(tofinalize(o)); - g->tobefnz = o->next; /* remove it from 'tobefnz' list */ - o->next = g->allgc; /* return it to 'allgc' list */ - g->allgc = o; - resetbit(o->marked, FINALIZEDBIT); /* object is "normal" again */ - if (issweepphase(g)) - makewhite(g, o); /* "sweep" object */ - else if (getage(o) == G_OLD1) - g->firstold1 = o; /* it is the first OLD1 object in the list */ - return o; -} - - -static void dothecall (lua_State *L, void *ud) { - UNUSED(ud); - luaD_callnoyield(L, L->top.p - 2, 0); -} - - -static void GCTM (lua_State *L) { - global_State *g = G(L); - const TValue *tm; - TValue v; - lua_assert(!g->gcemergency); - setgcovalue(L, &v, udata2finalize(g)); - tm = luaT_gettmbyobj(L, &v, TM_GC); - if (!notm(tm)) { /* is there a finalizer? */ - int status; - lu_byte oldah = L->allowhook; - int oldgcstp = g->gcstp; - g->gcstp |= GCSTPGC; /* avoid GC steps */ - L->allowhook = 0; /* stop debug hooks during GC metamethod */ - setobj2s(L, L->top.p++, tm); /* push finalizer... */ - setobj2s(L, L->top.p++, &v); /* ... and its argument */ - L->ci->callstatus |= CIST_FIN; /* will run a finalizer */ - status = luaD_pcall(L, dothecall, NULL, savestack(L, L->top.p - 2), 0); - L->ci->callstatus &= ~CIST_FIN; /* not running a finalizer anymore */ - L->allowhook = oldah; /* restore hooks */ - g->gcstp = oldgcstp; /* restore state */ - if (l_unlikely(status != LUA_OK)) { /* error while running __gc? */ - luaE_warnerror(L, "__gc"); - L->top.p--; /* pops error object */ - } - } -} - - -/* -** call all pending finalizers -*/ -static void callallpendingfinalizers (lua_State *L) { - global_State *g = G(L); - while (g->tobefnz) - GCTM(L); -} - - -/* -** find last 'next' field in list 'p' list (to add elements in its end) -*/ -static GCObject **findlast (GCObject **p) { - while (*p != NULL) - p = &(*p)->next; - return p; -} - - -/* -** Move all unreachable objects (or 'all' objects) that need -** finalization from list 'finobj' to list 'tobefnz' (to be finalized). -** (Note that objects after 'finobjold1' cannot be white, so they -** don't need to be traversed. In incremental mode, 'finobjold1' is NULL, -** so the whole list is traversed.) -*/ -static void separatetobefnz (global_State *g, int all) { - GCObject *curr; - GCObject **p = &g->finobj; - GCObject **lastnext = findlast(&g->tobefnz); - while ((curr = *p) != g->finobjold1) { /* traverse all finalizable objects */ - lua_assert(tofinalize(curr)); - if (!(iswhite(curr) || all)) /* not being collected? */ - p = &curr->next; /* don't bother with it */ - else { - if (curr == g->finobjsur) /* removing 'finobjsur'? */ - g->finobjsur = curr->next; /* correct it */ - *p = curr->next; /* remove 'curr' from 'finobj' list */ - curr->next = *lastnext; /* link at the end of 'tobefnz' list */ - *lastnext = curr; - lastnext = &curr->next; - } - } -} - - -/* -** If pointer 'p' points to 'o', move it to the next element. -*/ -static void checkpointer (GCObject **p, GCObject *o) { - if (o == *p) - *p = o->next; -} - - -/* -** Correct pointers to objects inside 'allgc' list when -** object 'o' is being removed from the list. -*/ -static void correctpointers (global_State *g, GCObject *o) { - checkpointer(&g->survival, o); - checkpointer(&g->old1, o); - checkpointer(&g->reallyold, o); - checkpointer(&g->firstold1, o); -} - - -/* -** if object 'o' has a finalizer, remove it from 'allgc' list (must -** search the list to find it) and link it in 'finobj' list. -*/ -void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt) { - global_State *g = G(L); - if (tofinalize(o) || /* obj. is already marked... */ - gfasttm(g, mt, TM_GC) == NULL || /* or has no finalizer... */ - (g->gcstp & GCSTPCLS)) /* or closing state? */ - return; /* nothing to be done */ - else { /* move 'o' to 'finobj' list */ - GCObject **p; - if (issweepphase(g)) { - makewhite(g, o); /* "sweep" object 'o' */ - if (g->sweepgc == &o->next) /* should not remove 'sweepgc' object */ - g->sweepgc = sweeptolive(L, g->sweepgc); /* change 'sweepgc' */ - } - else - correctpointers(g, o); - /* search for pointer pointing to 'o' */ - for (p = &g->allgc; *p != o; p = &(*p)->next) { /* empty */ } - *p = o->next; /* remove 'o' from 'allgc' list */ - o->next = g->finobj; /* link it in 'finobj' list */ - g->finobj = o; - l_setbit(o->marked, FINALIZEDBIT); /* mark it as such */ - } -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Generational Collector -** ======================================================= -*/ - - -/* -** Set the "time" to wait before starting a new incremental cycle; -** cycle will start when number of objects in use hits the threshold of -** approximately (marked * pause / 100). -*/ -static void setpause (global_State *g) { - l_obj threshold = applygcparam(g, PAUSE, g->marked); - l_obj debt = threshold - gettotalobjs(g); - if (debt < 0) debt = 0; - luaE_setdebt(g, debt); -} - - -/* -** Sweep a list of objects to enter generational mode. Deletes dead -** objects and turns the non dead to old. All non-dead threads---which -** are now old---must be in a gray list. Everything else is not in a -** gray list. Open upvalues are also kept gray. -*/ -static void sweep2old (lua_State *L, GCObject **p) { - GCObject *curr; - global_State *g = G(L); - while ((curr = *p) != NULL) { - if (iswhite(curr)) { /* is 'curr' dead? */ - lua_assert(isdead(g, curr)); - *p = curr->next; /* remove 'curr' from list */ - freeobj(L, curr); /* erase 'curr' */ - } - else { /* all surviving objects become old */ - setage(curr, G_OLD); - if (curr->tt == LUA_VTHREAD) { /* threads must be watched */ - lua_State *th = gco2th(curr); - linkgclist(th, g->grayagain); /* insert into 'grayagain' list */ - } - else if (curr->tt == LUA_VUPVAL && upisopen(gco2upv(curr))) - set2gray(curr); /* open upvalues are always gray */ - else /* everything else is black */ - nw2black(curr); - p = &curr->next; /* go to next element */ - } - } -} - - -/* -** Sweep for generational mode. Delete dead objects. (Because the -** collection is not incremental, there are no "new white" objects -** during the sweep. So, any white object must be dead.) For -** non-dead objects, advance their ages and clear the color of -** new objects. (Old objects keep their colors.) -** The ages of G_TOUCHED1 and G_TOUCHED2 objects cannot be advanced -** here, because these old-generation objects are usually not swept -** here. They will all be advanced in 'correctgraylist'. That function -** will also remove objects turned white here from any gray list. -*/ -static GCObject **sweepgen (lua_State *L, global_State *g, GCObject **p, - GCObject *limit, GCObject **pfirstold1, - l_obj *paddedold) { - static const lu_byte nextage[] = { - G_SURVIVAL, /* from G_NEW */ - G_OLD1, /* from G_SURVIVAL */ - G_OLD1, /* from G_OLD0 */ - G_OLD, /* from G_OLD1 */ - G_OLD, /* from G_OLD (do not change) */ - G_TOUCHED1, /* from G_TOUCHED1 (do not change) */ - G_TOUCHED2 /* from G_TOUCHED2 (do not change) */ - }; - l_obj addedold = 0; - int white = luaC_white(g); - GCObject *curr; - while ((curr = *p) != limit) { - if (iswhite(curr)) { /* is 'curr' dead? */ - lua_assert(!isold(curr) && isdead(g, curr)); - *p = curr->next; /* remove 'curr' from list */ - freeobj(L, curr); /* erase 'curr' */ - } - else { /* correct mark and age */ - int age = getage(curr); - if (age == G_NEW) { /* new objects go back to white */ - int marked = curr->marked & ~maskgcbits; /* erase GC bits */ - curr->marked = cast_byte(marked | G_SURVIVAL | white); - } - else { /* all other objects will be old, and so keep their color */ - lua_assert(age != G_OLD1); /* advanced in 'markold' */ - setage(curr, nextage[age]); - if (getage(curr) == G_OLD1) { - addedold++; /* one more object becoming old */ - if (*pfirstold1 == NULL) - *pfirstold1 = curr; /* first OLD1 object in the list */ - } - } - p = &curr->next; /* go to next element */ - } - } - *paddedold += addedold; - return p; -} - - -/* -** Correct a list of gray objects. Return a pointer to the last element -** left on the list, so that we can link another list to the end of -** this one. -** Because this correction is done after sweeping, young objects might -** be turned white and still be in the list. They are only removed. -** 'TOUCHED1' objects are advanced to 'TOUCHED2' and remain on the list; -** Non-white threads also remain on the list. 'TOUCHED2' objects and -** anything else become regular old, are marked black, and are removed -** from the list. -*/ -static GCObject **correctgraylist (GCObject **p) { - GCObject *curr; - while ((curr = *p) != NULL) { - GCObject **next = getgclist(curr); - if (iswhite(curr)) - goto remove; /* remove all white objects */ - else if (getage(curr) == G_TOUCHED1) { /* touched in this cycle? */ - lua_assert(isgray(curr)); - nw2black(curr); /* make it black, for next barrier */ - setage(curr, G_TOUCHED2); - goto remain; /* keep it in the list and go to next element */ - } - else if (curr->tt == LUA_VTHREAD) { - lua_assert(isgray(curr)); - goto remain; /* keep non-white threads on the list */ - } - else { /* everything else is removed */ - lua_assert(isold(curr)); /* young objects should be white here */ - if (getage(curr) == G_TOUCHED2) /* advance from TOUCHED2... */ - setage(curr, G_OLD); /* ... to OLD */ - nw2black(curr); /* make object black (to be removed) */ - goto remove; - } - remove: *p = *next; continue; - remain: p = next; continue; - } - return p; -} - - -/* -** Correct all gray lists, coalescing them into 'grayagain'. -*/ -static void correctgraylists (global_State *g) { - GCObject **list = correctgraylist(&g->grayagain); - *list = g->weak; g->weak = NULL; - list = correctgraylist(list); - *list = g->allweak; g->allweak = NULL; - list = correctgraylist(list); - *list = g->ephemeron; g->ephemeron = NULL; - correctgraylist(list); -} - - -/* -** Mark black 'OLD1' objects when starting a new young collection. -** Gray objects are already in some gray list, and so will be visited in -** the atomic step. -*/ -static void markold (global_State *g, GCObject *from, GCObject *to) { - GCObject *p; - for (p = from; p != to; p = p->next) { - if (getage(p) == G_OLD1) { - lua_assert(!iswhite(p)); - setage(p, G_OLD); /* now they are old */ - if (isblack(p)) - reallymarkobject(g, p); - } - } -} - - -/* -** Finish a young-generation collection. -*/ -static void finishgencycle (lua_State *L, global_State *g) { - correctgraylists(g); - checkSizes(L, g); - g->gcstate = GCSpropagate; /* skip restart */ - if (!g->gcemergency) - callallpendingfinalizers(L); -} - - -/* -** Shifts from a minor collection to major collections. It starts in -** the "sweep all" state to clear all objects, which are mostly black -** in generational mode. -*/ -static void minor2inc (lua_State *L, global_State *g, int kind) { - g->GCmajorminor = g->marked; /* number of live objects */ - g->gckind = kind; - g->reallyold = g->old1 = g->survival = NULL; - g->finobjrold = g->finobjold1 = g->finobjsur = NULL; - entersweep(L); /* continue as an incremental cycle */ - /* set a debt equal to the step size */ - luaE_setdebt(g, applygcparam(g, STEPSIZE, 100)); -} - - -/* -** Decide whether to shift to major mode. It tests two conditions: -** 1) Whether the number of added old objects in this collection is more -** than half the number of new objects. ('step' is the number of objects -** created between minor collections. Except for forward barriers, it -** is the maximum number of objects that can become old in each minor -** collection.) -** 2) Whether the accumulated number of added old objects is larger -** than 'minormajor'% of the number of lived objects after the last -** major collection. (That percentage is computed in 'limit'.) -*/ -static int checkminormajor (global_State *g, l_obj addedold1) { - l_obj step = applygcparam(g, MINORMUL, g->GCmajorminor); - l_obj limit = applygcparam(g, MINORMAJOR, g->GCmajorminor); - return (addedold1 >= (step >> 1) || g->marked >= limit); -} - -/* -** Does a young collection. First, mark 'OLD1' objects. Then does the -** atomic step. Then, check whether to continue in minor mode. If so, -** sweep all lists and advance pointers. Finally, finish the collection. -*/ -static void youngcollection (lua_State *L, global_State *g) { - l_obj addedold1 = 0; - l_obj marked = g->marked; /* preserve 'g->marked' */ - GCObject **psurvival; /* to point to first non-dead survival object */ - GCObject *dummy; /* dummy out parameter to 'sweepgen' */ - lua_assert(g->gcstate == GCSpropagate); - if (g->firstold1) { /* are there regular OLD1 objects? */ - markold(g, g->firstold1, g->reallyold); /* mark them */ - g->firstold1 = NULL; /* no more OLD1 objects (for now) */ - } - markold(g, g->finobj, g->finobjrold); - markold(g, g->tobefnz, NULL); - - atomic(L); /* will lose 'g->marked' */ - - /* sweep nursery and get a pointer to its last live element */ - g->gcstate = GCSswpallgc; - psurvival = sweepgen(L, g, &g->allgc, g->survival, &g->firstold1, &addedold1); - /* sweep 'survival' */ - sweepgen(L, g, psurvival, g->old1, &g->firstold1, &addedold1); - g->reallyold = g->old1; - g->old1 = *psurvival; /* 'survival' survivals are old now */ - g->survival = g->allgc; /* all news are survivals */ - - /* repeat for 'finobj' lists */ - dummy = NULL; /* no 'firstold1' optimization for 'finobj' lists */ - psurvival = sweepgen(L, g, &g->finobj, g->finobjsur, &dummy, &addedold1); - /* sweep 'survival' */ - sweepgen(L, g, psurvival, g->finobjold1, &dummy, &addedold1); - g->finobjrold = g->finobjold1; - g->finobjold1 = *psurvival; /* 'survival' survivals are old now */ - g->finobjsur = g->finobj; /* all news are survivals */ - - sweepgen(L, g, &g->tobefnz, NULL, &dummy, &addedold1); - - /* keep total number of added old1 objects */ - g->marked = marked + addedold1; - - /* decide whether to shift to major mode */ - if (checkminormajor(g, addedold1)) { - minor2inc(L, g, KGC_GENMAJOR); /* go to major mode */ - g->marked = 0; /* avoid pause in first major cycle */ - } - else - finishgencycle(L, g); /* still in minor mode; finish it */ -} - - -/* -** Clears all gray lists, sweeps objects, and prepare sublists to enter -** generational mode. The sweeps remove dead objects and turn all -** surviving objects to old. Threads go back to 'grayagain'; everything -** else is turned black (not in any gray list). -*/ -static void atomic2gen (lua_State *L, global_State *g) { - cleargraylists(g); - /* sweep all elements making them old */ - g->gcstate = GCSswpallgc; - sweep2old(L, &g->allgc); - /* everything alive now is old */ - g->reallyold = g->old1 = g->survival = g->allgc; - g->firstold1 = NULL; /* there are no OLD1 objects anywhere */ - - /* repeat for 'finobj' lists */ - sweep2old(L, &g->finobj); - g->finobjrold = g->finobjold1 = g->finobjsur = g->finobj; - - sweep2old(L, &g->tobefnz); - - g->gckind = KGC_GENMINOR; - g->GCmajorminor = g->marked; /* "base" for number of objects */ - g->marked = 0; /* to count the number of added old1 objects */ - finishgencycle(L, g); -} - - -/* -** Set debt for the next minor collection, which will happen when -** total number of objects grows 'genminormul'%. -*/ -static void setminordebt (global_State *g) { - luaE_setdebt(g, applygcparam(g, MINORMUL, g->GCmajorminor)); -} - - -/* -** Enter generational mode. Must go until the end of an atomic cycle -** to ensure that all objects are correctly marked and weak tables -** are cleared. Then, turn all objects into old and finishes the -** collection. -*/ -static void entergen (lua_State *L, global_State *g) { - luaC_runtilstate(L, GCSpause, 1); /* prepare to start a new cycle */ - luaC_runtilstate(L, GCSpropagate, 1); /* start new cycle */ - atomic(L); /* propagates all and then do the atomic stuff */ - atomic2gen(L, g); - setminordebt(g); /* set debt assuming next cycle will be minor */ -} - - -/* -** Change collector mode to 'newmode'. -*/ -void luaC_changemode (lua_State *L, int newmode) { - global_State *g = G(L); - if (g->gckind == KGC_GENMAJOR) /* doing major collections? */ - g->gckind = KGC_INC; /* already incremental but in name */ - if (newmode != g->gckind) { /* does it need to change? */ - if (newmode == KGC_INC) /* entering incremental mode? */ - minor2inc(L, g, KGC_INC); /* entering incremental mode */ - else { - lua_assert(newmode == KGC_GENMINOR); - entergen(L, g); - } - } -} - - -/* -** Does a full collection in generational mode. -*/ -static void fullgen (lua_State *L, global_State *g) { - minor2inc(L, g, KGC_INC); - entergen(L, g); -} - - -/* -** After an atomic incremental step from a major collection, -** check whether collector could return to minor collections. -** It checks whether the number of objects 'tobecollected' -** is greater than 'majorminor'% of the number of objects added -** since the last collection ('addedobjs'). -*/ -static int checkmajorminor (lua_State *L, global_State *g) { - if (g->gckind == KGC_GENMAJOR) { /* generational mode? */ - l_obj numobjs = gettotalobjs(g); - l_obj addedobjs = numobjs - g->GCmajorminor; - l_obj limit = applygcparam(g, MAJORMINOR, addedobjs); - l_obj tobecollected = numobjs - g->marked; - if (tobecollected > limit) { - atomic2gen(L, g); /* return to generational mode */ - setminordebt(g); - return 0; /* exit incremental collection */ - } - } - g->GCmajorminor = g->marked; /* prepare for next collection */ - return 1; /* stay doing incremental collections */ -} - -/* }====================================================== */ - - -/* -** {====================================================== -** GC control -** ======================================================= -*/ - - -/* -** Enter first sweep phase. -** The call to 'sweeptolive' makes the pointer point to an object -** inside the list (instead of to the header), so that the real sweep do -** not need to skip objects created between "now" and the start of the -** real sweep. -*/ -static void entersweep (lua_State *L) { - global_State *g = G(L); - g->gcstate = GCSswpallgc; - lua_assert(g->sweepgc == NULL); - g->sweepgc = sweeptolive(L, &g->allgc); -} - - -/* -** Delete all objects in list 'p' until (but not including) object -** 'limit'. -*/ -static void deletelist (lua_State *L, GCObject *p, GCObject *limit) { - while (p != limit) { - GCObject *next = p->next; - freeobj(L, p); - p = next; - } -} - - -/* -** Call all finalizers of the objects in the given Lua state, and -** then free all objects, except for the main thread. -*/ -void luaC_freeallobjects (lua_State *L) { - global_State *g = G(L); - g->gcstp = GCSTPCLS; /* no extra finalizers after here */ - luaC_changemode(L, KGC_INC); - separatetobefnz(g, 1); /* separate all objects with finalizers */ - lua_assert(g->finobj == NULL); - callallpendingfinalizers(L); - deletelist(L, g->allgc, obj2gco(g->mainthread)); - lua_assert(g->finobj == NULL); /* no new finalizers */ - deletelist(L, g->fixedgc, NULL); /* collect fixed objects */ - lua_assert(g->strt.nuse == 0); -} - - -static l_obj atomic (lua_State *L) { - l_obj work = 0; - global_State *g = G(L); - GCObject *origweak, *origall; - GCObject *grayagain = g->grayagain; /* save original list */ - g->grayagain = NULL; - lua_assert(g->ephemeron == NULL && g->weak == NULL); - lua_assert(!iswhite(g->mainthread)); - g->gcstate = GCSatomic; - markobject(g, L); /* mark running thread */ - /* registry and global metatables may be changed by API */ - markvalue(g, &g->l_registry); - markmt(g); /* mark global metatables */ - work += propagateall(g); /* empties 'gray' list */ - /* remark occasional upvalues of (maybe) dead threads */ - work += remarkupvals(g); - work += propagateall(g); /* propagate changes */ - g->gray = grayagain; - work += propagateall(g); /* traverse 'grayagain' list */ - work += convergeephemerons(g); - /* at this point, all strongly accessible objects are marked. */ - /* Clear values from weak tables, before checking finalizers */ - work += clearbyvalues(g, g->weak, NULL); - work += clearbyvalues(g, g->allweak, NULL); - origweak = g->weak; origall = g->allweak; - separatetobefnz(g, 0); /* separate objects to be finalized */ - work += markbeingfnz(g); /* mark objects that will be finalized */ - work += propagateall(g); /* remark, to propagate 'resurrection' */ - work += convergeephemerons(g); - /* at this point, all resurrected objects are marked. */ - /* remove dead objects from weak tables */ - work += clearbykeys(g, g->ephemeron); /* clear keys from all ephemeron */ - work += clearbykeys(g, g->allweak); /* clear keys from all 'allweak' */ - /* clear values from resurrected weak tables */ - work += clearbyvalues(g, g->weak, origweak); - work += clearbyvalues(g, g->allweak, origall); - luaS_clearcache(g); - g->currentwhite = cast_byte(otherwhite(g)); /* flip current white */ - lua_assert(g->gray == NULL); - return work; -} - - -/* -** Do a sweep step. The normal case (not fast) sweeps at most GCSWEEPMAX -** elements. The fast case sweeps the whole list. -*/ -static void sweepstep (lua_State *L, global_State *g, - int nextstate, GCObject **nextlist, int fast) { - if (g->sweepgc) - g->sweepgc = sweeplist(L, g->sweepgc, fast ? MAX_LOBJ : GCSWEEPMAX); - else { /* enter next state */ - g->gcstate = nextstate; - g->sweepgc = nextlist; - } -} - - -/* -** Performs one incremental "step" in an incremental garbage collection. -** For indivisible work, a step goes to the next state. When marking -** (propagating), a step traverses one object. When sweeping, a step -** sweeps GCSWEEPMAX objects, to avoid a big overhead for sweeping -** objects one by one. (Sweeping is inexpensive, no matter the -** object.) When 'fast' is true, 'singlestep' tries to finish a state -** "as fast as possible". In particular, it skips the propagation -** phase and leaves all objects to be traversed by the atomic phase: -** That avoids traversing twice some objects, such as theads and -** weak tables. -*/ -static l_obj singlestep (lua_State *L, int fast) { - global_State *g = G(L); - l_obj work; - lua_assert(!g->gcstopem); /* collector is not reentrant */ - g->gcstopem = 1; /* no emergency collections while collecting */ - switch (g->gcstate) { - case GCSpause: { - restartcollection(g); - g->gcstate = GCSpropagate; - work = 1; - break; - } - case GCSpropagate: { - if (fast || g->gray == NULL) { - g->gcstate = GCSenteratomic; /* finish propagate phase */ - work = 0; - } - else { - propagatemark(g); /* traverse one gray object */ - work = 1; - } - break; - } - case GCSenteratomic: { - work = atomic(L); - if (checkmajorminor(L, g)) - entersweep(L); - break; - } - case GCSswpallgc: { /* sweep "regular" objects */ - sweepstep(L, g, GCSswpfinobj, &g->finobj, fast); - work = GCSWEEPMAX; - break; - } - case GCSswpfinobj: { /* sweep objects with finalizers */ - sweepstep(L, g, GCSswptobefnz, &g->tobefnz, fast); - work = GCSWEEPMAX; - break; - } - case GCSswptobefnz: { /* sweep objects to be finalized */ - sweepstep(L, g, GCSswpend, NULL, fast); - work = GCSWEEPMAX; - break; - } - case GCSswpend: { /* finish sweeps */ - checkSizes(L, g); - g->gcstate = GCScallfin; - work = 0; - break; - } - case GCScallfin: { /* call finalizers */ - if (g->tobefnz && !g->gcemergency) { - g->gcstopem = 0; /* ok collections during finalizers */ - GCTM(L); /* call one finalizer */ - work = 1; - } - else { /* emergency mode or no more finalizers */ - g->gcstate = GCSpause; /* finish collection */ - work = 0; - } - break; - } - default: lua_assert(0); return 0; - } - g->gcstopem = 0; - return work; -} - - -/* -** Advances the garbage collector until it reaches the given state. -** (The option 'fast' is only for testing; in normal code, 'fast' -** here is always true.) -*/ -void luaC_runtilstate (lua_State *L, int state, int fast) { - global_State *g = G(L); - lua_assert(g->gckind == KGC_INC); - while (state != g->gcstate) - singlestep(L, fast); -} - - - -/* -** Performs a basic incremental step. The debt and step size are -** converted from bytes to "units of work"; then the function loops -** running single steps until adding that many units of work or -** finishing a cycle (pause state). Finally, it sets the debt that -** controls when next step will be performed. -*/ -static void incstep (lua_State *L, global_State *g) { - l_obj stepsize = applygcparam(g, STEPSIZE, 100); - l_obj work2do = applygcparam(g, STEPMUL, stepsize); - int fast = 0; - if (work2do == 0) { /* special case: do a full collection */ - work2do = MAX_LOBJ; /* do unlimited work */ - fast = 1; - } - do { /* repeat until pause or enough work */ - l_obj work = singlestep(L, fast); /* perform one single step */ - if (g->gckind == KGC_GENMINOR) /* returned to minor collections? */ - return; /* nothing else to be done here */ - work2do -= work; - } while (work2do > 0 && g->gcstate != GCSpause); - if (g->gcstate == GCSpause) - setpause(g); /* pause until next cycle */ - else - luaE_setdebt(g, stepsize); -} - -/* -** Performs a basic GC step if collector is running. (If collector is -** not running, set a reasonable debt to avoid it being called at -** every single check.) -*/ -void luaC_step (lua_State *L) { - global_State *g = G(L); - lua_assert(!g->gcemergency); - if (!gcrunning(g)) /* not running? */ - luaE_setdebt(g, 2000); - else { - switch (g->gckind) { - case KGC_INC: case KGC_GENMAJOR: - incstep(L, g); - break; - case KGC_GENMINOR: - youngcollection(L, g); - setminordebt(g); - break; - } - } -} - - -/* -** Perform a full collection in incremental mode. -** Before running the collection, check 'keepinvariant'; if it is true, -** there may be some objects marked as black, so the collector has -** to sweep all objects to turn them back to white (as white has not -** changed, nothing will be collected). -*/ -static void fullinc (lua_State *L, global_State *g) { - if (keepinvariant(g)) /* black objects? */ - entersweep(L); /* sweep everything to turn them back to white */ - /* finish any pending sweep phase to start a new cycle */ - luaC_runtilstate(L, GCSpause, 1); - luaC_runtilstate(L, GCScallfin, 1); /* run up to finalizers */ - /* 'marked' must be correct after a full GC cycle */ - lua_assert(g->marked == gettotalobjs(g)); - luaC_runtilstate(L, GCSpause, 1); /* finish collection */ - setpause(g); -} - - -/* -** Performs a full GC cycle; if 'isemergency', set a flag to avoid -** some operations which could change the interpreter state in some -** unexpected ways (running finalizers and shrinking some structures). -*/ -void luaC_fullgc (lua_State *L, int isemergency) { - global_State *g = G(L); - lua_assert(!g->gcemergency); - g->gcemergency = isemergency; /* set flag */ - switch (g->gckind) { - case KGC_GENMINOR: fullgen(L, g); break; - case KGC_INC: fullinc(L, g); break; - case KGC_GENMAJOR: - g->gckind = KGC_INC; - fullinc(L, g); - g->gckind = KGC_GENMAJOR; - break; - } - g->gcemergency = 0; -} - -/* }====================================================== */ - - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lgc.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lgc.h deleted file mode 100644 index 5e47411..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lgc.h +++ /dev/null @@ -1,249 +0,0 @@ -/* -** $Id: lgc.h $ -** Garbage Collector -** See Copyright Notice in lua.h -*/ - -#ifndef lgc_h -#define lgc_h - - -#include - - -#include "lobject.h" -#include "lstate.h" - -/* -** Collectable objects may have one of three colors: white, which means -** the object is not marked; gray, which means the object is marked, but -** its references may be not marked; and black, which means that the -** object and all its references are marked. The main invariant of the -** garbage collector, while marking objects, is that a black object can -** never point to a white one. Moreover, any gray object must be in a -** "gray list" (gray, grayagain, weak, allweak, ephemeron) so that it -** can be visited again before finishing the collection cycle. (Open -** upvalues are an exception to this rule.) These lists have no meaning -** when the invariant is not being enforced (e.g., sweep phase). -*/ - - -/* -** Possible states of the Garbage Collector -*/ -#define GCSpropagate 0 -#define GCSenteratomic 1 -#define GCSatomic 2 -#define GCSswpallgc 3 -#define GCSswpfinobj 4 -#define GCSswptobefnz 5 -#define GCSswpend 6 -#define GCScallfin 7 -#define GCSpause 8 - - -#define issweepphase(g) \ - (GCSswpallgc <= (g)->gcstate && (g)->gcstate <= GCSswpend) - - -/* -** macro to tell when main invariant (white objects cannot point to black -** ones) must be kept. During a collection, the sweep -** phase may break the invariant, as objects turned white may point to -** still-black objects. The invariant is restored when sweep ends and -** all objects are white again. -*/ - -#define keepinvariant(g) ((g)->gcstate <= GCSatomic) - - -/* -** some useful bit tricks -*/ -#define resetbits(x,m) ((x) &= cast_byte(~(m))) -#define setbits(x,m) ((x) |= (m)) -#define testbits(x,m) ((x) & (m)) -#define bitmask(b) (1<<(b)) -#define bit2mask(b1,b2) (bitmask(b1) | bitmask(b2)) -#define l_setbit(x,b) setbits(x, bitmask(b)) -#define resetbit(x,b) resetbits(x, bitmask(b)) -#define testbit(x,b) testbits(x, bitmask(b)) - - -/* -** Layout for bit use in 'marked' field. First three bits are -** used for object "age" in generational mode. Last bit is used -** by tests. -*/ -#define WHITE0BIT 3 /* object is white (type 0) */ -#define WHITE1BIT 4 /* object is white (type 1) */ -#define BLACKBIT 5 /* object is black */ -#define FINALIZEDBIT 6 /* object has been marked for finalization */ - -#define TESTBIT 7 - - - -#define WHITEBITS bit2mask(WHITE0BIT, WHITE1BIT) - - -#define iswhite(x) testbits((x)->marked, WHITEBITS) -#define isblack(x) testbit((x)->marked, BLACKBIT) -#define isgray(x) /* neither white nor black */ \ - (!testbits((x)->marked, WHITEBITS | bitmask(BLACKBIT))) - -#define tofinalize(x) testbit((x)->marked, FINALIZEDBIT) - -#define otherwhite(g) ((g)->currentwhite ^ WHITEBITS) -#define isdeadm(ow,m) ((m) & (ow)) -#define isdead(g,v) isdeadm(otherwhite(g), (v)->marked) - -#define changewhite(x) ((x)->marked ^= WHITEBITS) -#define nw2black(x) \ - check_exp(!iswhite(x), l_setbit((x)->marked, BLACKBIT)) - -#define luaC_white(g) cast_byte((g)->currentwhite & WHITEBITS) - - -/* object age in generational mode */ -#define G_NEW 0 /* created in current cycle */ -#define G_SURVIVAL 1 /* created in previous cycle */ -#define G_OLD0 2 /* marked old by frw. barrier in this cycle */ -#define G_OLD1 3 /* first full cycle as old */ -#define G_OLD 4 /* really old object (not to be visited) */ -#define G_TOUCHED1 5 /* old object touched this cycle */ -#define G_TOUCHED2 6 /* old object touched in previous cycle */ - -#define AGEBITS 7 /* all age bits (111) */ - -#define getage(o) ((o)->marked & AGEBITS) -#define setage(o,a) ((o)->marked = cast_byte(((o)->marked & (~AGEBITS)) | a)) -#define isold(o) (getage(o) > G_SURVIVAL) - - -/* -** In generational mode, objects are created 'new'. After surviving one -** cycle, they become 'survival'. Both 'new' and 'survival' can point -** to any other object, as they are traversed at the end of the cycle. -** We call them both 'young' objects. -** If a survival object survives another cycle, it becomes 'old1'. -** 'old1' objects can still point to survival objects (but not to -** new objects), so they still must be traversed. After another cycle -** (that, being old, 'old1' objects will "survive" no matter what) -** finally the 'old1' object becomes really 'old', and then they -** are no more traversed. -** -** To keep its invariants, the generational mode uses the same barriers -** also used by the incremental mode. If a young object is caught in a -** foward barrier, it cannot become old immediately, because it can -** still point to other young objects. Instead, it becomes 'old0', -** which in the next cycle becomes 'old1'. So, 'old0' objects is -** old but can point to new and survival objects; 'old1' is old -** but cannot point to new objects; and 'old' cannot point to any -** young object. -** -** If any old object ('old0', 'old1', 'old') is caught in a back -** barrier, it becomes 'touched1' and goes into a gray list, to be -** visited at the end of the cycle. There it evolves to 'touched2', -** which can point to survivals but not to new objects. In yet another -** cycle then it becomes 'old' again. -** -** The generational mode must also control the colors of objects, -** because of the barriers. While the mutator is running, young objects -** are kept white. 'old', 'old1', and 'touched2' objects are kept black, -** as they cannot point to new objects; exceptions are threads and open -** upvalues, which age to 'old1' and 'old' but are kept gray. 'old0' -** objects may be gray or black, as in the incremental mode. 'touched1' -** objects are kept gray, as they must be visited again at the end of -** the cycle. -*/ - - -/* Default Values for GC parameters */ - -/* -** Minor collections will shift to major ones after LUAI_MINORMAJOR% -** objects become old. -*/ -#define LUAI_MINORMAJOR 100 - -/* -** Major collections will shift to minor ones after a collection -** collects at least LUAI_MAJORMINOR% of the new objects. -*/ -#define LUAI_MAJORMINOR 50 - -/* -** A young (minor) collection will run after creating LUAI_GENMINORMUL% -** new objects. -*/ -#define LUAI_GENMINORMUL 25 - - -/* incremental */ - -/* Number of objects must be LUAI_GCPAUSE% before starting new cycle */ -#define LUAI_GCPAUSE 200 - -/* Step multiplier. (Roughly, the collector handles LUAI_GCMUL% objects - for each new allocated object.) */ -#define LUAI_GCMUL 200 - -/* How many objects to allocate before next GC step */ -#define LUAI_GCSTEPSIZE 250 - - -#define setgcparam(g,p,v) (g->gcparams[LUA_GCP##p] = luaO_codeparam(v)) -#define applygcparam(g,p,x) luaO_applyparam(g->gcparams[LUA_GCP##p], x) - -/* -** Control when GC is running: -*/ -#define GCSTPUSR 1 /* bit true when GC stopped by user */ -#define GCSTPGC 2 /* bit true when GC stopped by itself */ -#define GCSTPCLS 4 /* bit true when closing Lua state */ -#define gcrunning(g) ((g)->gcstp == 0) - - -/* -** Does one step of collection when debt becomes zero. 'pre'/'pos' -** allows some adjustments to be done only when needed. macro -** 'condchangemem' is used only for heavy tests (forcing a full -** GC cycle on every opportunity) -*/ -#define luaC_condGC(L,pre,pos) \ - { if (G(L)->GCdebt <= 0) { pre; luaC_step(L); pos;}; \ - condchangemem(L,pre,pos); } - -/* more often than not, 'pre'/'pos' are empty */ -#define luaC_checkGC(L) luaC_condGC(L,(void)0,(void)0) - - -#define luaC_objbarrier(L,p,o) ( \ - (isblack(p) && iswhite(o)) ? \ - luaC_barrier_(L,obj2gco(p),obj2gco(o)) : cast_void(0)) - -#define luaC_barrier(L,p,v) ( \ - iscollectable(v) ? luaC_objbarrier(L,p,gcvalue(v)) : cast_void(0)) - -#define luaC_objbarrierback(L,p,o) ( \ - (isblack(p) && iswhite(o)) ? luaC_barrierback_(L,p) : cast_void(0)) - -#define luaC_barrierback(L,p,v) ( \ - iscollectable(v) ? luaC_objbarrierback(L, p, gcvalue(v)) : cast_void(0)) - -LUAI_FUNC void luaC_fix (lua_State *L, GCObject *o); -LUAI_FUNC void luaC_freeallobjects (lua_State *L); -LUAI_FUNC void luaC_step (lua_State *L); -LUAI_FUNC void luaC_runtilstate (lua_State *L, int state, int fast); -LUAI_FUNC void luaC_fullgc (lua_State *L, int isemergency); -LUAI_FUNC GCObject *luaC_newobj (lua_State *L, int tt, size_t sz); -LUAI_FUNC GCObject *luaC_newobjdt (lua_State *L, int tt, size_t sz, - size_t offset); -LUAI_FUNC void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v); -LUAI_FUNC void luaC_barrierback_ (lua_State *L, GCObject *o); -LUAI_FUNC void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt); -LUAI_FUNC void luaC_changemode (lua_State *L, int newmode); - - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/linit.c b/build/c/dependencies/luaCEmbed/dependencies/lua/linit.c deleted file mode 100644 index 140f6d7..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/linit.c +++ /dev/null @@ -1,62 +0,0 @@ -/* -** $Id: linit.c $ -** Initialization of libraries for lua.c and other clients -** See Copyright Notice in lua.h -*/ - - -#define linit_c -#define LUA_LIB - - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "lualib.h" -#include "lauxlib.h" - - -/* -** Standard Libraries. (Must be listed in the same ORDER of their -** respective constants LUA_K.) -*/ -static const luaL_Reg stdlibs[] = { - {LUA_GNAME, luaopen_base}, - {LUA_LOADLIBNAME, luaopen_package}, - {LUA_COLIBNAME, luaopen_coroutine}, - {LUA_DBLIBNAME, luaopen_debug}, - {LUA_IOLIBNAME, luaopen_io}, - {LUA_MATHLIBNAME, luaopen_math}, - {LUA_OSLIBNAME, luaopen_os}, - {LUA_STRLIBNAME, luaopen_string}, - {LUA_TABLIBNAME, luaopen_table}, - {LUA_UTF8LIBNAME, luaopen_utf8}, - {NULL, NULL} -}; - - -/* -** require and preload selected standard libraries -*/ -LUALIB_API void luaL_openselectedlibs (lua_State *L, int load, int preload) { - int mask; - const luaL_Reg *lib; - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - for (lib = stdlibs, mask = 1; lib->name != NULL; lib++, mask <<= 1) { - if (load & mask) { /* selected? */ - luaL_requiref(L, lib->name, lib->func, 1); /* require library */ - lua_pop(L, 1); /* remove result from the stack */ - } - else if (preload & mask) { /* selected? */ - lua_pushcfunction(L, lib->func); - lua_setfield(L, -2, lib->name); /* add library to PRELOAD table */ - } - } - lua_assert((mask >> 1) == LUA_UTF8LIBK); - lua_pop(L, 1); /* remove PRELOAD table */ -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/liolib.c b/build/c/dependencies/luaCEmbed/dependencies/lua/liolib.c deleted file mode 100644 index b08397d..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/liolib.c +++ /dev/null @@ -1,828 +0,0 @@ -/* -** $Id: liolib.c $ -** Standard I/O (and system) library -** See Copyright Notice in lua.h -*/ - -#define liolib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - - - -/* -** Change this macro to accept other modes for 'fopen' besides -** the standard ones. -*/ -#if !defined(l_checkmode) - -/* accepted extensions to 'mode' in 'fopen' */ -#if !defined(L_MODEEXT) -#define L_MODEEXT "b" -#endif - -/* Check whether 'mode' matches '[rwa]%+?[L_MODEEXT]*' */ -static int l_checkmode (const char *mode) { - return (*mode != '\0' && strchr("rwa", *(mode++)) != NULL && - (*mode != '+' || ((void)(++mode), 1)) && /* skip if char is '+' */ - (strspn(mode, L_MODEEXT) == strlen(mode))); /* check extensions */ -} - -#endif - -/* -** {====================================================== -** l_popen spawns a new process connected to the current -** one through the file streams. -** ======================================================= -*/ - -#if !defined(l_popen) /* { */ - -#if defined(LUA_USE_POSIX) /* { */ - -#define l_popen(L,c,m) (fflush(NULL), popen(c,m)) -#define l_pclose(L,file) (pclose(file)) - -#elif defined(LUA_USE_WINDOWS) /* }{ */ - -#define l_popen(L,c,m) (_popen(c,m)) -#define l_pclose(L,file) (_pclose(file)) - -#if !defined(l_checkmodep) -/* Windows accepts "[rw][bt]?" as valid modes */ -#define l_checkmodep(m) ((m[0] == 'r' || m[0] == 'w') && \ - (m[1] == '\0' || ((m[1] == 'b' || m[1] == 't') && m[2] == '\0'))) -#endif - -#else /* }{ */ - -/* ISO C definitions */ -#define l_popen(L,c,m) \ - ((void)c, (void)m, \ - luaL_error(L, "'popen' not supported"), \ - (FILE*)0) -#define l_pclose(L,file) ((void)L, (void)file, -1) - -#endif /* } */ - -#endif /* } */ - - -#if !defined(l_checkmodep) -/* By default, Lua accepts only "r" or "w" as valid modes */ -#define l_checkmodep(m) ((m[0] == 'r' || m[0] == 'w') && m[1] == '\0') -#endif - -/* }====================================================== */ - - -#if !defined(l_getc) /* { */ - -#if defined(LUA_USE_POSIX) -#define l_getc(f) getc_unlocked(f) -#define l_lockfile(f) flockfile(f) -#define l_unlockfile(f) funlockfile(f) -#else -#define l_getc(f) getc(f) -#define l_lockfile(f) ((void)0) -#define l_unlockfile(f) ((void)0) -#endif - -#endif /* } */ - - -/* -** {====================================================== -** l_fseek: configuration for longer offsets -** ======================================================= -*/ - -#if !defined(l_fseek) /* { */ - -#if defined(LUA_USE_POSIX) /* { */ - -#include - -#define l_fseek(f,o,w) fseeko(f,o,w) -#define l_ftell(f) ftello(f) -#define l_seeknum off_t - -#elif defined(LUA_USE_WINDOWS) && !defined(_CRTIMP_TYPEINFO) \ - && defined(_MSC_VER) && (_MSC_VER >= 1400) /* }{ */ - -/* Windows (but not DDK) and Visual C++ 2005 or higher */ -#define l_fseek(f,o,w) _fseeki64(f,o,w) -#define l_ftell(f) _ftelli64(f) -#define l_seeknum __int64 - -#else /* }{ */ - -/* ISO C definitions */ -#define l_fseek(f,o,w) fseek(f,o,w) -#define l_ftell(f) ftell(f) -#define l_seeknum long - -#endif /* } */ - -#endif /* } */ - -/* }====================================================== */ - - - -#define IO_PREFIX "_IO_" -#define IOPREF_LEN (sizeof(IO_PREFIX)/sizeof(char) - 1) -#define IO_INPUT (IO_PREFIX "input") -#define IO_OUTPUT (IO_PREFIX "output") - - -typedef luaL_Stream LStream; - - -#define tolstream(L) ((LStream *)luaL_checkudata(L, 1, LUA_FILEHANDLE)) - -#define isclosed(p) ((p)->closef == NULL) - - -static int io_type (lua_State *L) { - LStream *p; - luaL_checkany(L, 1); - p = (LStream *)luaL_testudata(L, 1, LUA_FILEHANDLE); - if (p == NULL) - luaL_pushfail(L); /* not a file */ - else if (isclosed(p)) - lua_pushliteral(L, "closed file"); - else - lua_pushliteral(L, "file"); - return 1; -} - - -static int f_tostring (lua_State *L) { - LStream *p = tolstream(L); - if (isclosed(p)) - lua_pushliteral(L, "file (closed)"); - else - lua_pushfstring(L, "file (%p)", p->f); - return 1; -} - - -static FILE *tofile (lua_State *L) { - LStream *p = tolstream(L); - if (l_unlikely(isclosed(p))) - luaL_error(L, "attempt to use a closed file"); - lua_assert(p->f); - return p->f; -} - - -/* -** When creating file handles, always creates a 'closed' file handle -** before opening the actual file; so, if there is a memory error, the -** handle is in a consistent state. -*/ -static LStream *newprefile (lua_State *L) { - LStream *p = (LStream *)lua_newuserdatauv(L, sizeof(LStream), 0); - p->closef = NULL; /* mark file handle as 'closed' */ - luaL_setmetatable(L, LUA_FILEHANDLE); - return p; -} - - -/* -** Calls the 'close' function from a file handle. The 'volatile' avoids -** a bug in some versions of the Clang compiler (e.g., clang 3.0 for -** 32 bits). -*/ -static int aux_close (lua_State *L) { - LStream *p = tolstream(L); - volatile lua_CFunction cf = p->closef; - p->closef = NULL; /* mark stream as closed */ - return (*cf)(L); /* close it */ -} - - -static int f_close (lua_State *L) { - tofile(L); /* make sure argument is an open stream */ - return aux_close(L); -} - - -static int io_close (lua_State *L) { - if (lua_isnone(L, 1)) /* no argument? */ - lua_getfield(L, LUA_REGISTRYINDEX, IO_OUTPUT); /* use default output */ - return f_close(L); -} - - -static int f_gc (lua_State *L) { - LStream *p = tolstream(L); - if (!isclosed(p) && p->f != NULL) - aux_close(L); /* ignore closed and incompletely open files */ - return 0; -} - - -/* -** function to close regular files -*/ -static int io_fclose (lua_State *L) { - LStream *p = tolstream(L); - int res = fclose(p->f); - return luaL_fileresult(L, (res == 0), NULL); -} - - -static LStream *newfile (lua_State *L) { - LStream *p = newprefile(L); - p->f = NULL; - p->closef = &io_fclose; - return p; -} - - -static void opencheck (lua_State *L, const char *fname, const char *mode) { - LStream *p = newfile(L); - p->f = fopen(fname, mode); - if (l_unlikely(p->f == NULL)) - luaL_error(L, "cannot open file '%s' (%s)", fname, strerror(errno)); -} - - -static int io_open (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - const char *mode = luaL_optstring(L, 2, "r"); - LStream *p = newfile(L); - const char *md = mode; /* to traverse/check mode */ - luaL_argcheck(L, l_checkmode(md), 2, "invalid mode"); - p->f = fopen(filename, mode); - return (p->f == NULL) ? luaL_fileresult(L, 0, filename) : 1; -} - - -/* -** function to close 'popen' files -*/ -static int io_pclose (lua_State *L) { - LStream *p = tolstream(L); - errno = 0; - return luaL_execresult(L, l_pclose(L, p->f)); -} - - -static int io_popen (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - const char *mode = luaL_optstring(L, 2, "r"); - LStream *p = newprefile(L); - luaL_argcheck(L, l_checkmodep(mode), 2, "invalid mode"); - p->f = l_popen(L, filename, mode); - p->closef = &io_pclose; - return (p->f == NULL) ? luaL_fileresult(L, 0, filename) : 1; -} - - -static int io_tmpfile (lua_State *L) { - LStream *p = newfile(L); - p->f = tmpfile(); - return (p->f == NULL) ? luaL_fileresult(L, 0, NULL) : 1; -} - - -static FILE *getiofile (lua_State *L, const char *findex) { - LStream *p; - lua_getfield(L, LUA_REGISTRYINDEX, findex); - p = (LStream *)lua_touserdata(L, -1); - if (l_unlikely(isclosed(p))) - luaL_error(L, "default %s file is closed", findex + IOPREF_LEN); - return p->f; -} - - -static int g_iofile (lua_State *L, const char *f, const char *mode) { - if (!lua_isnoneornil(L, 1)) { - const char *filename = lua_tostring(L, 1); - if (filename) - opencheck(L, filename, mode); - else { - tofile(L); /* check that it's a valid file handle */ - lua_pushvalue(L, 1); - } - lua_setfield(L, LUA_REGISTRYINDEX, f); - } - /* return current value */ - lua_getfield(L, LUA_REGISTRYINDEX, f); - return 1; -} - - -static int io_input (lua_State *L) { - return g_iofile(L, IO_INPUT, "r"); -} - - -static int io_output (lua_State *L) { - return g_iofile(L, IO_OUTPUT, "w"); -} - - -static int io_readline (lua_State *L); - - -/* -** maximum number of arguments to 'f:lines'/'io.lines' (it + 3 must fit -** in the limit for upvalues of a closure) -*/ -#define MAXARGLINE 250 - -/* -** Auxiliary function to create the iteration function for 'lines'. -** The iteration function is a closure over 'io_readline', with -** the following upvalues: -** 1) The file being read (first value in the stack) -** 2) the number of arguments to read -** 3) a boolean, true iff file has to be closed when finished ('toclose') -** *) a variable number of format arguments (rest of the stack) -*/ -static void aux_lines (lua_State *L, int toclose) { - int n = lua_gettop(L) - 1; /* number of arguments to read */ - luaL_argcheck(L, n <= MAXARGLINE, MAXARGLINE + 2, "too many arguments"); - lua_pushvalue(L, 1); /* file */ - lua_pushinteger(L, n); /* number of arguments to read */ - lua_pushboolean(L, toclose); /* close/not close file when finished */ - lua_rotate(L, 2, 3); /* move the three values to their positions */ - lua_pushcclosure(L, io_readline, 3 + n); -} - - -static int f_lines (lua_State *L) { - tofile(L); /* check that it's a valid file handle */ - aux_lines(L, 0); - return 1; -} - - -/* -** Return an iteration function for 'io.lines'. If file has to be -** closed, also returns the file itself as a second result (to be -** closed as the state at the exit of a generic for). -*/ -static int io_lines (lua_State *L) { - int toclose; - if (lua_isnone(L, 1)) lua_pushnil(L); /* at least one argument */ - if (lua_isnil(L, 1)) { /* no file name? */ - lua_getfield(L, LUA_REGISTRYINDEX, IO_INPUT); /* get default input */ - lua_replace(L, 1); /* put it at index 1 */ - tofile(L); /* check that it's a valid file handle */ - toclose = 0; /* do not close it after iteration */ - } - else { /* open a new file */ - const char *filename = luaL_checkstring(L, 1); - opencheck(L, filename, "r"); - lua_replace(L, 1); /* put file at index 1 */ - toclose = 1; /* close it after iteration */ - } - aux_lines(L, toclose); /* push iteration function */ - if (toclose) { - lua_pushnil(L); /* state */ - lua_pushnil(L); /* control */ - lua_pushvalue(L, 1); /* file is the to-be-closed variable (4th result) */ - return 4; - } - else - return 1; -} - - -/* -** {====================================================== -** READ -** ======================================================= -*/ - - -/* maximum length of a numeral */ -#if !defined (L_MAXLENNUM) -#define L_MAXLENNUM 200 -#endif - - -/* auxiliary structure used by 'read_number' */ -typedef struct { - FILE *f; /* file being read */ - int c; /* current character (look ahead) */ - int n; /* number of elements in buffer 'buff' */ - char buff[L_MAXLENNUM + 1]; /* +1 for ending '\0' */ -} RN; - - -/* -** Add current char to buffer (if not out of space) and read next one -*/ -static int nextc (RN *rn) { - if (l_unlikely(rn->n >= L_MAXLENNUM)) { /* buffer overflow? */ - rn->buff[0] = '\0'; /* invalidate result */ - return 0; /* fail */ - } - else { - rn->buff[rn->n++] = rn->c; /* save current char */ - rn->c = l_getc(rn->f); /* read next one */ - return 1; - } -} - - -/* -** Accept current char if it is in 'set' (of size 2) -*/ -static int test2 (RN *rn, const char *set) { - if (rn->c == set[0] || rn->c == set[1]) - return nextc(rn); - else return 0; -} - - -/* -** Read a sequence of (hex)digits -*/ -static int readdigits (RN *rn, int hex) { - int count = 0; - while ((hex ? isxdigit(rn->c) : isdigit(rn->c)) && nextc(rn)) - count++; - return count; -} - - -/* -** Read a number: first reads a valid prefix of a numeral into a buffer. -** Then it calls 'lua_stringtonumber' to check whether the format is -** correct and to convert it to a Lua number. -*/ -static int read_number (lua_State *L, FILE *f) { - RN rn; - int count = 0; - int hex = 0; - char decp[2]; - rn.f = f; rn.n = 0; - decp[0] = lua_getlocaledecpoint(); /* get decimal point from locale */ - decp[1] = '.'; /* always accept a dot */ - l_lockfile(rn.f); - do { rn.c = l_getc(rn.f); } while (isspace(rn.c)); /* skip spaces */ - test2(&rn, "-+"); /* optional sign */ - if (test2(&rn, "00")) { - if (test2(&rn, "xX")) hex = 1; /* numeral is hexadecimal */ - else count = 1; /* count initial '0' as a valid digit */ - } - count += readdigits(&rn, hex); /* integral part */ - if (test2(&rn, decp)) /* decimal point? */ - count += readdigits(&rn, hex); /* fractional part */ - if (count > 0 && test2(&rn, (hex ? "pP" : "eE"))) { /* exponent mark? */ - test2(&rn, "-+"); /* exponent sign */ - readdigits(&rn, 0); /* exponent digits */ - } - ungetc(rn.c, rn.f); /* unread look-ahead char */ - l_unlockfile(rn.f); - rn.buff[rn.n] = '\0'; /* finish string */ - if (l_likely(lua_stringtonumber(L, rn.buff))) - return 1; /* ok, it is a valid number */ - else { /* invalid format */ - lua_pushnil(L); /* "result" to be removed */ - return 0; /* read fails */ - } -} - - -static int test_eof (lua_State *L, FILE *f) { - int c = getc(f); - ungetc(c, f); /* no-op when c == EOF */ - lua_pushliteral(L, ""); - return (c != EOF); -} - - -static int read_line (lua_State *L, FILE *f, int chop) { - luaL_Buffer b; - int c; - luaL_buffinit(L, &b); - do { /* may need to read several chunks to get whole line */ - char *buff = luaL_prepbuffer(&b); /* preallocate buffer space */ - int i = 0; - l_lockfile(f); /* no memory errors can happen inside the lock */ - while (i < LUAL_BUFFERSIZE && (c = l_getc(f)) != EOF && c != '\n') - buff[i++] = c; /* read up to end of line or buffer limit */ - l_unlockfile(f); - luaL_addsize(&b, i); - } while (c != EOF && c != '\n'); /* repeat until end of line */ - if (!chop && c == '\n') /* want a newline and have one? */ - luaL_addchar(&b, c); /* add ending newline to result */ - luaL_pushresult(&b); /* close buffer */ - /* return ok if read something (either a newline or something else) */ - return (c == '\n' || lua_rawlen(L, -1) > 0); -} - - -static void read_all (lua_State *L, FILE *f) { - size_t nr; - luaL_Buffer b; - luaL_buffinit(L, &b); - do { /* read file in chunks of LUAL_BUFFERSIZE bytes */ - char *p = luaL_prepbuffer(&b); - nr = fread(p, sizeof(char), LUAL_BUFFERSIZE, f); - luaL_addsize(&b, nr); - } while (nr == LUAL_BUFFERSIZE); - luaL_pushresult(&b); /* close buffer */ -} - - -static int read_chars (lua_State *L, FILE *f, size_t n) { - size_t nr; /* number of chars actually read */ - char *p; - luaL_Buffer b; - luaL_buffinit(L, &b); - p = luaL_prepbuffsize(&b, n); /* prepare buffer to read whole block */ - nr = fread(p, sizeof(char), n, f); /* try to read 'n' chars */ - luaL_addsize(&b, nr); - luaL_pushresult(&b); /* close buffer */ - return (nr > 0); /* true iff read something */ -} - - -static int g_read (lua_State *L, FILE *f, int first) { - int nargs = lua_gettop(L) - 1; - int n, success; - clearerr(f); - if (nargs == 0) { /* no arguments? */ - success = read_line(L, f, 1); - n = first + 1; /* to return 1 result */ - } - else { - /* ensure stack space for all results and for auxlib's buffer */ - luaL_checkstack(L, nargs+LUA_MINSTACK, "too many arguments"); - success = 1; - for (n = first; nargs-- && success; n++) { - if (lua_type(L, n) == LUA_TNUMBER) { - size_t l = (size_t)luaL_checkinteger(L, n); - success = (l == 0) ? test_eof(L, f) : read_chars(L, f, l); - } - else { - const char *p = luaL_checkstring(L, n); - if (*p == '*') p++; /* skip optional '*' (for compatibility) */ - switch (*p) { - case 'n': /* number */ - success = read_number(L, f); - break; - case 'l': /* line */ - success = read_line(L, f, 1); - break; - case 'L': /* line with end-of-line */ - success = read_line(L, f, 0); - break; - case 'a': /* file */ - read_all(L, f); /* read entire file */ - success = 1; /* always success */ - break; - default: - return luaL_argerror(L, n, "invalid format"); - } - } - } - } - if (ferror(f)) - return luaL_fileresult(L, 0, NULL); - if (!success) { - lua_pop(L, 1); /* remove last result */ - luaL_pushfail(L); /* push nil instead */ - } - return n - first; -} - - -static int io_read (lua_State *L) { - return g_read(L, getiofile(L, IO_INPUT), 1); -} - - -static int f_read (lua_State *L) { - return g_read(L, tofile(L), 2); -} - - -/* -** Iteration function for 'lines'. -*/ -static int io_readline (lua_State *L) { - LStream *p = (LStream *)lua_touserdata(L, lua_upvalueindex(1)); - int i; - int n = (int)lua_tointeger(L, lua_upvalueindex(2)); - if (isclosed(p)) /* file is already closed? */ - return luaL_error(L, "file is already closed"); - lua_settop(L , 1); - luaL_checkstack(L, n, "too many arguments"); - for (i = 1; i <= n; i++) /* push arguments to 'g_read' */ - lua_pushvalue(L, lua_upvalueindex(3 + i)); - n = g_read(L, p->f, 2); /* 'n' is number of results */ - lua_assert(n > 0); /* should return at least a nil */ - if (lua_toboolean(L, -n)) /* read at least one value? */ - return n; /* return them */ - else { /* first result is false: EOF or error */ - if (n > 1) { /* is there error information? */ - /* 2nd result is error message */ - return luaL_error(L, "%s", lua_tostring(L, -n + 1)); - } - if (lua_toboolean(L, lua_upvalueindex(3))) { /* generator created file? */ - lua_settop(L, 0); /* clear stack */ - lua_pushvalue(L, lua_upvalueindex(1)); /* push file at index 1 */ - aux_close(L); /* close it */ - } - return 0; - } -} - -/* }====================================================== */ - - -static int g_write (lua_State *L, FILE *f, int arg) { - int nargs = lua_gettop(L) - arg; - int status = 1; - for (; nargs--; arg++) { - if (lua_type(L, arg) == LUA_TNUMBER) { - /* optimization: could be done exactly as for strings */ - int len = lua_isinteger(L, arg) - ? fprintf(f, LUA_INTEGER_FMT, - (LUAI_UACINT)lua_tointeger(L, arg)) - : fprintf(f, LUA_NUMBER_FMT, - (LUAI_UACNUMBER)lua_tonumber(L, arg)); - status = status && (len > 0); - } - else { - size_t l; - const char *s = luaL_checklstring(L, arg, &l); - status = status && (fwrite(s, sizeof(char), l, f) == l); - } - } - if (l_likely(status)) - return 1; /* file handle already on stack top */ - else return luaL_fileresult(L, status, NULL); -} - - -static int io_write (lua_State *L) { - return g_write(L, getiofile(L, IO_OUTPUT), 1); -} - - -static int f_write (lua_State *L) { - FILE *f = tofile(L); - lua_pushvalue(L, 1); /* push file at the stack top (to be returned) */ - return g_write(L, f, 2); -} - - -static int f_seek (lua_State *L) { - static const int mode[] = {SEEK_SET, SEEK_CUR, SEEK_END}; - static const char *const modenames[] = {"set", "cur", "end", NULL}; - FILE *f = tofile(L); - int op = luaL_checkoption(L, 2, "cur", modenames); - lua_Integer p3 = luaL_optinteger(L, 3, 0); - l_seeknum offset = (l_seeknum)p3; - luaL_argcheck(L, (lua_Integer)offset == p3, 3, - "not an integer in proper range"); - op = l_fseek(f, offset, mode[op]); - if (l_unlikely(op)) - return luaL_fileresult(L, 0, NULL); /* error */ - else { - lua_pushinteger(L, (lua_Integer)l_ftell(f)); - return 1; - } -} - - -static int f_setvbuf (lua_State *L) { - static const int mode[] = {_IONBF, _IOFBF, _IOLBF}; - static const char *const modenames[] = {"no", "full", "line", NULL}; - FILE *f = tofile(L); - int op = luaL_checkoption(L, 2, NULL, modenames); - lua_Integer sz = luaL_optinteger(L, 3, LUAL_BUFFERSIZE); - int res = setvbuf(f, NULL, mode[op], (size_t)sz); - return luaL_fileresult(L, res == 0, NULL); -} - - - -static int io_flush (lua_State *L) { - return luaL_fileresult(L, fflush(getiofile(L, IO_OUTPUT)) == 0, NULL); -} - - -static int f_flush (lua_State *L) { - return luaL_fileresult(L, fflush(tofile(L)) == 0, NULL); -} - - -/* -** functions for 'io' library -*/ -static const luaL_Reg iolib[] = { - {"close", io_close}, - {"flush", io_flush}, - {"input", io_input}, - {"lines", io_lines}, - {"open", io_open}, - {"output", io_output}, - {"popen", io_popen}, - {"read", io_read}, - {"tmpfile", io_tmpfile}, - {"type", io_type}, - {"write", io_write}, - {NULL, NULL} -}; - - -/* -** methods for file handles -*/ -static const luaL_Reg meth[] = { - {"read", f_read}, - {"write", f_write}, - {"lines", f_lines}, - {"flush", f_flush}, - {"seek", f_seek}, - {"close", f_close}, - {"setvbuf", f_setvbuf}, - {NULL, NULL} -}; - - -/* -** metamethods for file handles -*/ -static const luaL_Reg metameth[] = { - {"__index", NULL}, /* place holder */ - {"__gc", f_gc}, - {"__close", f_gc}, - {"__tostring", f_tostring}, - {NULL, NULL} -}; - - -static void createmeta (lua_State *L) { - luaL_newmetatable(L, LUA_FILEHANDLE); /* metatable for file handles */ - luaL_setfuncs(L, metameth, 0); /* add metamethods to new metatable */ - luaL_newlibtable(L, meth); /* create method table */ - luaL_setfuncs(L, meth, 0); /* add file methods to method table */ - lua_setfield(L, -2, "__index"); /* metatable.__index = method table */ - lua_pop(L, 1); /* pop metatable */ -} - - -/* -** function to (not) close the standard files stdin, stdout, and stderr -*/ -static int io_noclose (lua_State *L) { - LStream *p = tolstream(L); - p->closef = &io_noclose; /* keep file opened */ - luaL_pushfail(L); - lua_pushliteral(L, "cannot close standard file"); - return 2; -} - - -static void createstdfile (lua_State *L, FILE *f, const char *k, - const char *fname) { - LStream *p = newprefile(L); - p->f = f; - p->closef = &io_noclose; - if (k != NULL) { - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, k); /* add file to registry */ - } - lua_setfield(L, -2, fname); /* add file to module */ -} - - -LUAMOD_API int luaopen_io (lua_State *L) { - luaL_newlib(L, iolib); /* new module */ - createmeta(L); - /* create (and set) default files */ - createstdfile(L, stdin, IO_INPUT, "stdin"); - createstdfile(L, stdout, IO_OUTPUT, "stdout"); - createstdfile(L, stderr, NULL, "stderr"); - return 1; -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/ljumptab.h b/build/c/dependencies/luaCEmbed/dependencies/lua/ljumptab.h deleted file mode 100644 index 8306f25..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/ljumptab.h +++ /dev/null @@ -1,112 +0,0 @@ -/* -** $Id: ljumptab.h $ -** Jump Table for the Lua interpreter -** See Copyright Notice in lua.h -*/ - - -#undef vmdispatch -#undef vmcase -#undef vmbreak - -#define vmdispatch(x) goto *disptab[x]; - -#define vmcase(l) L_##l: - -#define vmbreak vmfetch(); vmdispatch(GET_OPCODE(i)); - - -static const void *const disptab[NUM_OPCODES] = { - -#if 0 -** you can update the following list with this command: -** -** sed -n '/^OP_/\!d; s/OP_/\&\&L_OP_/ ; s/,.*/,/ ; s/\/.*// ; p' lopcodes.h -** -#endif - -&&L_OP_MOVE, -&&L_OP_LOADI, -&&L_OP_LOADF, -&&L_OP_LOADK, -&&L_OP_LOADKX, -&&L_OP_LOADFALSE, -&&L_OP_LFALSESKIP, -&&L_OP_LOADTRUE, -&&L_OP_LOADNIL, -&&L_OP_GETUPVAL, -&&L_OP_SETUPVAL, -&&L_OP_GETTABUP, -&&L_OP_GETTABLE, -&&L_OP_GETI, -&&L_OP_GETFIELD, -&&L_OP_SETTABUP, -&&L_OP_SETTABLE, -&&L_OP_SETI, -&&L_OP_SETFIELD, -&&L_OP_NEWTABLE, -&&L_OP_SELF, -&&L_OP_ADDI, -&&L_OP_ADDK, -&&L_OP_SUBK, -&&L_OP_MULK, -&&L_OP_MODK, -&&L_OP_POWK, -&&L_OP_DIVK, -&&L_OP_IDIVK, -&&L_OP_BANDK, -&&L_OP_BORK, -&&L_OP_BXORK, -&&L_OP_SHRI, -&&L_OP_SHLI, -&&L_OP_ADD, -&&L_OP_SUB, -&&L_OP_MUL, -&&L_OP_MOD, -&&L_OP_POW, -&&L_OP_DIV, -&&L_OP_IDIV, -&&L_OP_BAND, -&&L_OP_BOR, -&&L_OP_BXOR, -&&L_OP_SHL, -&&L_OP_SHR, -&&L_OP_MMBIN, -&&L_OP_MMBINI, -&&L_OP_MMBINK, -&&L_OP_UNM, -&&L_OP_BNOT, -&&L_OP_NOT, -&&L_OP_LEN, -&&L_OP_CONCAT, -&&L_OP_CLOSE, -&&L_OP_TBC, -&&L_OP_JMP, -&&L_OP_EQ, -&&L_OP_LT, -&&L_OP_LE, -&&L_OP_EQK, -&&L_OP_EQI, -&&L_OP_LTI, -&&L_OP_LEI, -&&L_OP_GTI, -&&L_OP_GEI, -&&L_OP_TEST, -&&L_OP_TESTSET, -&&L_OP_CALL, -&&L_OP_TAILCALL, -&&L_OP_RETURN, -&&L_OP_RETURN0, -&&L_OP_RETURN1, -&&L_OP_FORLOOP, -&&L_OP_FORPREP, -&&L_OP_TFORPREP, -&&L_OP_TFORCALL, -&&L_OP_TFORLOOP, -&&L_OP_SETLIST, -&&L_OP_CLOSURE, -&&L_OP_VARARG, -&&L_OP_VARARGPREP, -&&L_OP_EXTRAARG - -}; diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/llex.c b/build/c/dependencies/luaCEmbed/dependencies/lua/llex.c deleted file mode 100644 index 9f20d3c..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/llex.c +++ /dev/null @@ -1,581 +0,0 @@ -/* -** $Id: llex.c $ -** Lexical Analyzer -** See Copyright Notice in lua.h -*/ - -#define llex_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "lctype.h" -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "llex.h" -#include "lobject.h" -#include "lparser.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "lzio.h" - - - -#define next(ls) (ls->current = zgetc(ls->z)) - - - -#define currIsNewline(ls) (ls->current == '\n' || ls->current == '\r') - - -/* ORDER RESERVED */ -static const char *const luaX_tokens [] = { - "and", "break", "do", "else", "elseif", - "end", "false", "for", "function", "goto", "if", - "in", "local", "nil", "not", "or", "repeat", - "return", "then", "true", "until", "while", - "//", "..", "...", "==", ">=", "<=", "~=", - "<<", ">>", "::", "", - "", "", "", "" -}; - - -#define save_and_next(ls) (save(ls, ls->current), next(ls)) - - -static l_noret lexerror (LexState *ls, const char *msg, int token); - - -static void save (LexState *ls, int c) { - Mbuffer *b = ls->buff; - if (luaZ_bufflen(b) + 1 > luaZ_sizebuffer(b)) { - size_t newsize; - if (luaZ_sizebuffer(b) >= MAX_SIZE/2) - lexerror(ls, "lexical element too long", 0); - newsize = luaZ_sizebuffer(b) * 2; - luaZ_resizebuffer(ls->L, b, newsize); - } - b->buffer[luaZ_bufflen(b)++] = cast_char(c); -} - - -void luaX_init (lua_State *L) { - int i; - TString *e = luaS_newliteral(L, LUA_ENV); /* create env name */ - luaC_fix(L, obj2gco(e)); /* never collect this name */ - for (i=0; iextra = cast_byte(i+1); /* reserved word */ - } -} - - -const char *luaX_token2str (LexState *ls, int token) { - if (token < FIRST_RESERVED) { /* single-byte symbols? */ - if (lisprint(token)) - return luaO_pushfstring(ls->L, "'%c'", token); - else /* control character */ - return luaO_pushfstring(ls->L, "'<\\%d>'", token); - } - else { - const char *s = luaX_tokens[token - FIRST_RESERVED]; - if (token < TK_EOS) /* fixed format (symbols and reserved words)? */ - return luaO_pushfstring(ls->L, "'%s'", s); - else /* names, strings, and numerals */ - return s; - } -} - - -static const char *txtToken (LexState *ls, int token) { - switch (token) { - case TK_NAME: case TK_STRING: - case TK_FLT: case TK_INT: - save(ls, '\0'); - return luaO_pushfstring(ls->L, "'%s'", luaZ_buffer(ls->buff)); - default: - return luaX_token2str(ls, token); - } -} - - -static l_noret lexerror (LexState *ls, const char *msg, int token) { - msg = luaG_addinfo(ls->L, msg, ls->source, ls->linenumber); - if (token) - luaO_pushfstring(ls->L, "%s near %s", msg, txtToken(ls, token)); - luaD_throw(ls->L, LUA_ERRSYNTAX); -} - - -l_noret luaX_syntaxerror (LexState *ls, const char *msg) { - lexerror(ls, msg, ls->t.token); -} - - -/* -** Creates a new string and anchors it in scanner's table so that it -** will not be collected until the end of the compilation; by that time -** it should be anchored somewhere. It also internalizes long strings, -** ensuring there is only one copy of each unique string. The table -** here is used as a set: the string enters as the key, while its value -** is irrelevant. We use the string itself as the value only because it -** is a TValue readily available. Later, the code generation can change -** this value. -*/ -TString *luaX_newstring (LexState *ls, const char *str, size_t l) { - lua_State *L = ls->L; - TString *ts = luaS_newlstr(L, str, l); /* create new string */ - TString *oldts = luaH_getstrkey(ls->h, ts); - if (oldts != NULL) /* string already present? */ - return oldts; /* use it */ - else { /* create a new entry */ - TValue *stv = s2v(L->top.p++); /* reserve stack space for string */ - setsvalue(L, stv, ts); /* temporarily anchor the string */ - luaH_set(L, ls->h, stv, stv); /* t[string] = string */ - /* table is not a metatable, so it does not need to invalidate cache */ - luaC_checkGC(L); - L->top.p--; /* remove string from stack */ - } - return ts; -} - - -/* -** increment line number and skips newline sequence (any of -** \n, \r, \n\r, or \r\n) -*/ -static void inclinenumber (LexState *ls) { - int old = ls->current; - lua_assert(currIsNewline(ls)); - next(ls); /* skip '\n' or '\r' */ - if (currIsNewline(ls) && ls->current != old) - next(ls); /* skip '\n\r' or '\r\n' */ - if (++ls->linenumber >= MAX_INT) - lexerror(ls, "chunk has too many lines", 0); -} - - -void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source, - int firstchar) { - ls->t.token = 0; - ls->L = L; - ls->current = firstchar; - ls->lookahead.token = TK_EOS; /* no look-ahead token */ - ls->z = z; - ls->fs = NULL; - ls->linenumber = 1; - ls->lastline = 1; - ls->source = source; - ls->envn = luaS_newliteral(L, LUA_ENV); /* get env name */ - luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER); /* initialize buffer */ -} - - - -/* -** ======================================================= -** LEXICAL ANALYZER -** ======================================================= -*/ - - -static int check_next1 (LexState *ls, int c) { - if (ls->current == c) { - next(ls); - return 1; - } - else return 0; -} - - -/* -** Check whether current char is in set 'set' (with two chars) and -** saves it -*/ -static int check_next2 (LexState *ls, const char *set) { - lua_assert(set[2] == '\0'); - if (ls->current == set[0] || ls->current == set[1]) { - save_and_next(ls); - return 1; - } - else return 0; -} - - -/* LUA_NUMBER */ -/* -** This function is quite liberal in what it accepts, as 'luaO_str2num' -** will reject ill-formed numerals. Roughly, it accepts the following -** pattern: -** -** %d(%x|%.|([Ee][+-]?))* | 0[Xx](%x|%.|([Pp][+-]?))* -** -** The only tricky part is to accept [+-] only after a valid exponent -** mark, to avoid reading '3-4' or '0xe+1' as a single number. -** -** The caller might have already read an initial dot. -*/ -static int read_numeral (LexState *ls, SemInfo *seminfo) { - TValue obj; - const char *expo = "Ee"; - int first = ls->current; - lua_assert(lisdigit(ls->current)); - save_and_next(ls); - if (first == '0' && check_next2(ls, "xX")) /* hexadecimal? */ - expo = "Pp"; - for (;;) { - if (check_next2(ls, expo)) /* exponent mark? */ - check_next2(ls, "-+"); /* optional exponent sign */ - else if (lisxdigit(ls->current) || ls->current == '.') /* '%x|%.' */ - save_and_next(ls); - else break; - } - if (lislalpha(ls->current)) /* is numeral touching a letter? */ - save_and_next(ls); /* force an error */ - save(ls, '\0'); - if (luaO_str2num(luaZ_buffer(ls->buff), &obj) == 0) /* format error? */ - lexerror(ls, "malformed number", TK_FLT); - if (ttisinteger(&obj)) { - seminfo->i = ivalue(&obj); - return TK_INT; - } - else { - lua_assert(ttisfloat(&obj)); - seminfo->r = fltvalue(&obj); - return TK_FLT; - } -} - - -/* -** read a sequence '[=*[' or ']=*]', leaving the last bracket. If -** sequence is well formed, return its number of '='s + 2; otherwise, -** return 1 if it is a single bracket (no '='s and no 2nd bracket); -** otherwise (an unfinished '[==...') return 0. -*/ -static size_t skip_sep (LexState *ls) { - size_t count = 0; - int s = ls->current; - lua_assert(s == '[' || s == ']'); - save_and_next(ls); - while (ls->current == '=') { - save_and_next(ls); - count++; - } - return (ls->current == s) ? count + 2 - : (count == 0) ? 1 - : 0; -} - - -static void read_long_string (LexState *ls, SemInfo *seminfo, size_t sep) { - int line = ls->linenumber; /* initial line (for error message) */ - save_and_next(ls); /* skip 2nd '[' */ - if (currIsNewline(ls)) /* string starts with a newline? */ - inclinenumber(ls); /* skip it */ - for (;;) { - switch (ls->current) { - case EOZ: { /* error */ - const char *what = (seminfo ? "string" : "comment"); - const char *msg = luaO_pushfstring(ls->L, - "unfinished long %s (starting at line %d)", what, line); - lexerror(ls, msg, TK_EOS); - break; /* to avoid warnings */ - } - case ']': { - if (skip_sep(ls) == sep) { - save_and_next(ls); /* skip 2nd ']' */ - goto endloop; - } - break; - } - case '\n': case '\r': { - save(ls, '\n'); - inclinenumber(ls); - if (!seminfo) luaZ_resetbuffer(ls->buff); /* avoid wasting space */ - break; - } - default: { - if (seminfo) save_and_next(ls); - else next(ls); - } - } - } endloop: - if (seminfo) - seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + sep, - luaZ_bufflen(ls->buff) - 2 * sep); -} - - -static void esccheck (LexState *ls, int c, const char *msg) { - if (!c) { - if (ls->current != EOZ) - save_and_next(ls); /* add current to buffer for error message */ - lexerror(ls, msg, TK_STRING); - } -} - - -static int gethexa (LexState *ls) { - save_and_next(ls); - esccheck (ls, lisxdigit(ls->current), "hexadecimal digit expected"); - return luaO_hexavalue(ls->current); -} - - -static int readhexaesc (LexState *ls) { - int r = gethexa(ls); - r = (r << 4) + gethexa(ls); - luaZ_buffremove(ls->buff, 2); /* remove saved chars from buffer */ - return r; -} - - -static unsigned long readutf8esc (LexState *ls) { - unsigned long r; - int i = 4; /* chars to be removed: '\', 'u', '{', and first digit */ - save_and_next(ls); /* skip 'u' */ - esccheck(ls, ls->current == '{', "missing '{'"); - r = gethexa(ls); /* must have at least one digit */ - while (cast_void(save_and_next(ls)), lisxdigit(ls->current)) { - i++; - esccheck(ls, r <= (0x7FFFFFFFu >> 4), "UTF-8 value too large"); - r = (r << 4) + luaO_hexavalue(ls->current); - } - esccheck(ls, ls->current == '}', "missing '}'"); - next(ls); /* skip '}' */ - luaZ_buffremove(ls->buff, i); /* remove saved chars from buffer */ - return r; -} - - -static void utf8esc (LexState *ls) { - char buff[UTF8BUFFSZ]; - int n = luaO_utf8esc(buff, readutf8esc(ls)); - for (; n > 0; n--) /* add 'buff' to string */ - save(ls, buff[UTF8BUFFSZ - n]); -} - - -static int readdecesc (LexState *ls) { - int i; - int r = 0; /* result accumulator */ - for (i = 0; i < 3 && lisdigit(ls->current); i++) { /* read up to 3 digits */ - r = 10*r + ls->current - '0'; - save_and_next(ls); - } - esccheck(ls, r <= UCHAR_MAX, "decimal escape too large"); - luaZ_buffremove(ls->buff, i); /* remove read digits from buffer */ - return r; -} - - -static void read_string (LexState *ls, int del, SemInfo *seminfo) { - save_and_next(ls); /* keep delimiter (for error messages) */ - while (ls->current != del) { - switch (ls->current) { - case EOZ: - lexerror(ls, "unfinished string", TK_EOS); - break; /* to avoid warnings */ - case '\n': - case '\r': - lexerror(ls, "unfinished string", TK_STRING); - break; /* to avoid warnings */ - case '\\': { /* escape sequences */ - int c; /* final character to be saved */ - save_and_next(ls); /* keep '\\' for error messages */ - switch (ls->current) { - case 'a': c = '\a'; goto read_save; - case 'b': c = '\b'; goto read_save; - case 'f': c = '\f'; goto read_save; - case 'n': c = '\n'; goto read_save; - case 'r': c = '\r'; goto read_save; - case 't': c = '\t'; goto read_save; - case 'v': c = '\v'; goto read_save; - case 'x': c = readhexaesc(ls); goto read_save; - case 'u': utf8esc(ls); goto no_save; - case '\n': case '\r': - inclinenumber(ls); c = '\n'; goto only_save; - case '\\': case '\"': case '\'': - c = ls->current; goto read_save; - case EOZ: goto no_save; /* will raise an error next loop */ - case 'z': { /* zap following span of spaces */ - luaZ_buffremove(ls->buff, 1); /* remove '\\' */ - next(ls); /* skip the 'z' */ - while (lisspace(ls->current)) { - if (currIsNewline(ls)) inclinenumber(ls); - else next(ls); - } - goto no_save; - } - default: { - esccheck(ls, lisdigit(ls->current), "invalid escape sequence"); - c = readdecesc(ls); /* digital escape '\ddd' */ - goto only_save; - } - } - read_save: - next(ls); - /* go through */ - only_save: - luaZ_buffremove(ls->buff, 1); /* remove '\\' */ - save(ls, c); - /* go through */ - no_save: break; - } - default: - save_and_next(ls); - } - } - save_and_next(ls); /* skip delimiter */ - seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1, - luaZ_bufflen(ls->buff) - 2); -} - - -static int llex (LexState *ls, SemInfo *seminfo) { - luaZ_resetbuffer(ls->buff); - for (;;) { - switch (ls->current) { - case '\n': case '\r': { /* line breaks */ - inclinenumber(ls); - break; - } - case ' ': case '\f': case '\t': case '\v': { /* spaces */ - next(ls); - break; - } - case '-': { /* '-' or '--' (comment) */ - next(ls); - if (ls->current != '-') return '-'; - /* else is a comment */ - next(ls); - if (ls->current == '[') { /* long comment? */ - size_t sep = skip_sep(ls); - luaZ_resetbuffer(ls->buff); /* 'skip_sep' may dirty the buffer */ - if (sep >= 2) { - read_long_string(ls, NULL, sep); /* skip long comment */ - luaZ_resetbuffer(ls->buff); /* previous call may dirty the buff. */ - break; - } - } - /* else short comment */ - while (!currIsNewline(ls) && ls->current != EOZ) - next(ls); /* skip until end of line (or end of file) */ - break; - } - case '[': { /* long string or simply '[' */ - size_t sep = skip_sep(ls); - if (sep >= 2) { - read_long_string(ls, seminfo, sep); - return TK_STRING; - } - else if (sep == 0) /* '[=...' missing second bracket? */ - lexerror(ls, "invalid long string delimiter", TK_STRING); - return '['; - } - case '=': { - next(ls); - if (check_next1(ls, '=')) return TK_EQ; /* '==' */ - else return '='; - } - case '<': { - next(ls); - if (check_next1(ls, '=')) return TK_LE; /* '<=' */ - else if (check_next1(ls, '<')) return TK_SHL; /* '<<' */ - else return '<'; - } - case '>': { - next(ls); - if (check_next1(ls, '=')) return TK_GE; /* '>=' */ - else if (check_next1(ls, '>')) return TK_SHR; /* '>>' */ - else return '>'; - } - case '/': { - next(ls); - if (check_next1(ls, '/')) return TK_IDIV; /* '//' */ - else return '/'; - } - case '~': { - next(ls); - if (check_next1(ls, '=')) return TK_NE; /* '~=' */ - else return '~'; - } - case ':': { - next(ls); - if (check_next1(ls, ':')) return TK_DBCOLON; /* '::' */ - else return ':'; - } - case '"': case '\'': { /* short literal strings */ - read_string(ls, ls->current, seminfo); - return TK_STRING; - } - case '.': { /* '.', '..', '...', or number */ - save_and_next(ls); - if (check_next1(ls, '.')) { - if (check_next1(ls, '.')) - return TK_DOTS; /* '...' */ - else return TK_CONCAT; /* '..' */ - } - else if (!lisdigit(ls->current)) return '.'; - else return read_numeral(ls, seminfo); - } - case '0': case '1': case '2': case '3': case '4': - case '5': case '6': case '7': case '8': case '9': { - return read_numeral(ls, seminfo); - } - case EOZ: { - return TK_EOS; - } - default: { - if (lislalpha(ls->current)) { /* identifier or reserved word? */ - TString *ts; - do { - save_and_next(ls); - } while (lislalnum(ls->current)); - ts = luaX_newstring(ls, luaZ_buffer(ls->buff), - luaZ_bufflen(ls->buff)); - seminfo->ts = ts; - if (isreserved(ts)) /* reserved word? */ - return ts->extra - 1 + FIRST_RESERVED; - else { - return TK_NAME; - } - } - else { /* single-char tokens ('+', '*', '%', '{', '}', ...) */ - int c = ls->current; - next(ls); - return c; - } - } - } - } -} - - -void luaX_next (LexState *ls) { - ls->lastline = ls->linenumber; - if (ls->lookahead.token != TK_EOS) { /* is there a look-ahead token? */ - ls->t = ls->lookahead; /* use this one */ - ls->lookahead.token = TK_EOS; /* and discharge it */ - } - else - ls->t.token = llex(ls, &ls->t.seminfo); /* read next token */ -} - - -int luaX_lookahead (LexState *ls) { - lua_assert(ls->lookahead.token == TK_EOS); - ls->lookahead.token = llex(ls, &ls->lookahead.seminfo); - return ls->lookahead.token; -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/llex.h b/build/c/dependencies/luaCEmbed/dependencies/lua/llex.h deleted file mode 100644 index 389d2f8..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/llex.h +++ /dev/null @@ -1,91 +0,0 @@ -/* -** $Id: llex.h $ -** Lexical Analyzer -** See Copyright Notice in lua.h -*/ - -#ifndef llex_h -#define llex_h - -#include - -#include "lobject.h" -#include "lzio.h" - - -/* -** Single-char tokens (terminal symbols) are represented by their own -** numeric code. Other tokens start at the following value. -*/ -#define FIRST_RESERVED (UCHAR_MAX + 1) - - -#if !defined(LUA_ENV) -#define LUA_ENV "_ENV" -#endif - - -/* -* WARNING: if you change the order of this enumeration, -* grep "ORDER RESERVED" -*/ -enum RESERVED { - /* terminal symbols denoted by reserved words */ - TK_AND = FIRST_RESERVED, TK_BREAK, - TK_DO, TK_ELSE, TK_ELSEIF, TK_END, TK_FALSE, TK_FOR, TK_FUNCTION, - TK_GOTO, TK_IF, TK_IN, TK_LOCAL, TK_NIL, TK_NOT, TK_OR, TK_REPEAT, - TK_RETURN, TK_THEN, TK_TRUE, TK_UNTIL, TK_WHILE, - /* other terminal symbols */ - TK_IDIV, TK_CONCAT, TK_DOTS, TK_EQ, TK_GE, TK_LE, TK_NE, - TK_SHL, TK_SHR, - TK_DBCOLON, TK_EOS, - TK_FLT, TK_INT, TK_NAME, TK_STRING -}; - -/* number of reserved words */ -#define NUM_RESERVED (cast_int(TK_WHILE-FIRST_RESERVED + 1)) - - -typedef union { - lua_Number r; - lua_Integer i; - TString *ts; -} SemInfo; /* semantics information */ - - -typedef struct Token { - int token; - SemInfo seminfo; -} Token; - - -/* state of the lexer plus state of the parser when shared by all - functions */ -typedef struct LexState { - int current; /* current character (charint) */ - int linenumber; /* input line counter */ - int lastline; /* line of last token 'consumed' */ - Token t; /* current token */ - Token lookahead; /* look ahead token */ - struct FuncState *fs; /* current function (parser) */ - struct lua_State *L; - ZIO *z; /* input stream */ - Mbuffer *buff; /* buffer for tokens */ - Table *h; /* to avoid collection/reuse strings */ - struct Dyndata *dyd; /* dynamic structures used by the parser */ - TString *source; /* current source name */ - TString *envn; /* environment variable name */ -} LexState; - - -LUAI_FUNC void luaX_init (lua_State *L); -LUAI_FUNC void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, - TString *source, int firstchar); -LUAI_FUNC TString *luaX_newstring (LexState *ls, const char *str, size_t l); -LUAI_FUNC void luaX_next (LexState *ls); -LUAI_FUNC int luaX_lookahead (LexState *ls); -LUAI_FUNC l_noret luaX_syntaxerror (LexState *ls, const char *s); -LUAI_FUNC const char *luaX_token2str (LexState *ls, int token); - - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/llimits.h b/build/c/dependencies/luaCEmbed/dependencies/lua/llimits.h deleted file mode 100644 index a32e977..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/llimits.h +++ /dev/null @@ -1,383 +0,0 @@ -/* -** $Id: llimits.h $ -** Limits, basic types, and some other 'installation-dependent' definitions -** See Copyright Notice in lua.h -*/ - -#ifndef llimits_h -#define llimits_h - - -#include -#include - - -#include "lua.h" - - -/* -** 'lu_mem' is an unsigned integer big enough to count the total memory -** used by Lua (in bytes). 'l_obj' is a signed integer big enough to -** count the total number of objects used by Lua. (It is signed due -** to the use of debt in several computations.) Usually, 'size_t' and -** 'ptrdiff_t' should work, but we use 'long' for 16-bit machines. -*/ -#if defined(LUAI_MEM) /* { external definitions? */ -typedef LUAI_UMEM lu_mem; -typedef LUAI_MEM l_obj; -#elif LUAI_IS32INT /* }{ */ -typedef size_t lu_mem; -typedef ptrdiff_t l_obj; -#else /* 16-bit ints */ /* }{ */ -typedef unsigned long lu_mem; -typedef long l_obj; -#endif /* } */ - -#define MAX_LOBJ \ - cast(l_obj, (cast(lu_mem, 1) << (sizeof(l_obj) * CHAR_BIT - 1)) - 1) - - -/* chars used as small naturals (so that 'char' is reserved for characters) */ -typedef unsigned char lu_byte; -typedef signed char ls_byte; - - -/* maximum value for size_t */ -#define MAX_SIZET ((size_t)(~(size_t)0)) - -/* -** Maximum size for strings and userdata visible for Lua (should be -** representable in a lua_Integer) -*/ -#define MAX_SIZE (sizeof(size_t) < sizeof(lua_Integer) ? MAX_SIZET \ - : (size_t)(LUA_MAXINTEGER)) - - -#define MAX_INT INT_MAX /* maximum value of an int */ - - -/* -** floor of the log2 of the maximum signed value for integral type 't'. -** (That is, maximum 'n' such that '2^n' fits in the given signed type.) -*/ -#define log2maxs(t) cast_int(sizeof(t) * 8 - 2) - - -/* -** test whether an unsigned value is a power of 2 (or zero) -*/ -#define ispow2(x) (((x) & ((x) - 1)) == 0) - - -/* number of chars of a literal string without the ending \0 */ -#define LL(x) (sizeof(x)/sizeof(char) - 1) - - -/* -** conversion of pointer to unsigned integer: this is for hashing only; -** there is no problem if the integer cannot hold the whole pointer -** value. (In strict ISO C this may cause undefined behavior, but no -** actual machine seems to bother.) -*/ -#if !defined(LUA_USE_C89) && defined(__STDC_VERSION__) && \ - __STDC_VERSION__ >= 199901L -#include -#if defined(UINTPTR_MAX) /* even in C99 this type is optional */ -#define L_P2I uintptr_t -#else /* no 'intptr'? */ -#define L_P2I uintmax_t /* use the largest available integer */ -#endif -#else /* C89 option */ -#define L_P2I size_t -#endif - -#define point2uint(p) cast_uint((L_P2I)(p) & UINT_MAX) - - - -/* types of 'usual argument conversions' for lua_Number and lua_Integer */ -typedef LUAI_UACNUMBER l_uacNumber; -typedef LUAI_UACINT l_uacInt; - - -/* -** Internal assertions for in-house debugging -*/ -#if defined LUAI_ASSERT -#undef NDEBUG -#include -#define lua_assert(c) assert(c) -#endif - -#if defined(lua_assert) -#define check_exp(c,e) (lua_assert(c), (e)) -/* to avoid problems with conditions too long */ -#define lua_longassert(c) ((c) ? (void)0 : lua_assert(0)) -#else -#define lua_assert(c) ((void)0) -#define check_exp(c,e) (e) -#define lua_longassert(c) ((void)0) -#endif - -/* -** assertion for checking API calls -*/ -#if !defined(luai_apicheck) -#define luai_apicheck(l,e) ((void)l, lua_assert(e)) -#endif - -#define api_check(l,e,msg) luai_apicheck(l,(e) && msg) - - -/* macro to avoid warnings about unused variables */ -#if !defined(UNUSED) -#define UNUSED(x) ((void)(x)) -#endif - - -/* type casts (a macro highlights casts in the code) */ -#define cast(t, exp) ((t)(exp)) - -#define cast_void(i) cast(void, (i)) -#define cast_voidp(i) cast(void *, (i)) -#define cast_num(i) cast(lua_Number, (i)) -#define cast_int(i) cast(int, (i)) -#define cast_uint(i) cast(unsigned int, (i)) -#define cast_byte(i) cast(lu_byte, (i)) -#define cast_uchar(i) cast(unsigned char, (i)) -#define cast_char(i) cast(char, (i)) -#define cast_charp(i) cast(char *, (i)) -#define cast_sizet(i) cast(size_t, (i)) - - -/* cast a signed lua_Integer to lua_Unsigned */ -#if !defined(l_castS2U) -#define l_castS2U(i) ((lua_Unsigned)(i)) -#endif - -/* -** cast a lua_Unsigned to a signed lua_Integer; this cast is -** not strict ISO C, but two-complement architectures should -** work fine. -*/ -#if !defined(l_castU2S) -#define l_castU2S(i) ((lua_Integer)(i)) -#endif - - -/* -** non-return type -*/ -#if !defined(l_noret) - -#if defined(__GNUC__) -#define l_noret void __attribute__((noreturn)) -#elif defined(_MSC_VER) && _MSC_VER >= 1200 -#define l_noret void __declspec(noreturn) -#else -#define l_noret void -#endif - -#endif - - -/* -** Inline functions -*/ -#if !defined(LUA_USE_C89) -#define l_inline inline -#elif defined(__GNUC__) -#define l_inline __inline__ -#else -#define l_inline /* empty */ -#endif - -#define l_sinline static l_inline - - -/* -** type for virtual-machine instructions; -** must be an unsigned with (at least) 4 bytes (see details in lopcodes.h) -*/ -#if LUAI_IS32INT -typedef unsigned int l_uint32; -#else -typedef unsigned long l_uint32; -#endif - -typedef l_uint32 Instruction; - - - -/* -** Maximum length for short strings, that is, strings that are -** internalized. (Cannot be smaller than reserved words or tags for -** metamethods, as these strings must be internalized; -** #("function") = 8, #("__newindex") = 10.) -*/ -#if !defined(LUAI_MAXSHORTLEN) -#define LUAI_MAXSHORTLEN 40 -#endif - - -/* -** Initial size for the string table (must be power of 2). -** The Lua core alone registers ~50 strings (reserved words + -** metaevent keys + a few others). Libraries would typically add -** a few dozens more. -*/ -#if !defined(MINSTRTABSIZE) -#define MINSTRTABSIZE 128 -#endif - - -/* -** Size of cache for strings in the API. 'N' is the number of -** sets (better be a prime) and "M" is the size of each set (M == 1 -** makes a direct cache.) -*/ -#if !defined(STRCACHE_N) -#define STRCACHE_N 53 -#define STRCACHE_M 2 -#endif - - -/* minimum size for string buffer */ -#if !defined(LUA_MINBUFFER) -#define LUA_MINBUFFER 32 -#endif - - -/* -** Maximum depth for nested C calls, syntactical nested non-terminals, -** and other features implemented through recursion in C. (Value must -** fit in a 16-bit unsigned integer. It must also be compatible with -** the size of the C stack.) -*/ -#if !defined(LUAI_MAXCCALLS) -#define LUAI_MAXCCALLS 200 -#endif - - -/* -** macros that are executed whenever program enters the Lua core -** ('lua_lock') and leaves the core ('lua_unlock') -*/ -#if !defined(lua_lock) -#define lua_lock(L) ((void) 0) -#define lua_unlock(L) ((void) 0) -#endif - -/* -** macro executed during Lua functions at points where the -** function can yield. -*/ -#if !defined(luai_threadyield) -#define luai_threadyield(L) {lua_unlock(L); lua_lock(L);} -#endif - - -/* -** these macros allow user-specific actions when a thread is -** created/deleted/resumed/yielded. -*/ -#if !defined(luai_userstateopen) -#define luai_userstateopen(L) ((void)L) -#endif - -#if !defined(luai_userstateclose) -#define luai_userstateclose(L) ((void)L) -#endif - -#if !defined(luai_userstatethread) -#define luai_userstatethread(L,L1) ((void)L) -#endif - -#if !defined(luai_userstatefree) -#define luai_userstatefree(L,L1) ((void)L) -#endif - -#if !defined(luai_userstateresume) -#define luai_userstateresume(L,n) ((void)L) -#endif - -#if !defined(luai_userstateyield) -#define luai_userstateyield(L,n) ((void)L) -#endif - - - -/* -** The luai_num* macros define the primitive operations over numbers. -*/ - -/* floor division (defined as 'floor(a/b)') */ -#if !defined(luai_numidiv) -#define luai_numidiv(L,a,b) ((void)L, l_floor(luai_numdiv(L,a,b))) -#endif - -/* float division */ -#if !defined(luai_numdiv) -#define luai_numdiv(L,a,b) ((a)/(b)) -#endif - -/* -** modulo: defined as 'a - floor(a/b)*b'; the direct computation -** using this definition has several problems with rounding errors, -** so it is better to use 'fmod'. 'fmod' gives the result of -** 'a - trunc(a/b)*b', and therefore must be corrected when -** 'trunc(a/b) ~= floor(a/b)'. That happens when the division has a -** non-integer negative result: non-integer result is equivalent to -** a non-zero remainder 'm'; negative result is equivalent to 'a' and -** 'b' with different signs, or 'm' and 'b' with different signs -** (as the result 'm' of 'fmod' has the same sign of 'a'). -*/ -#if !defined(luai_nummod) -#define luai_nummod(L,a,b,m) \ - { (void)L; (m) = l_mathop(private_lua_embed_fmod)(a,b); \ - if (((m) > 0) ? (b) < 0 : ((m) < 0 && (b) > 0)) (m) += (b); } -#endif - -/* exponentiation */ -#if !defined(luai_numpow) -#define luai_numpow(L,a,b) \ - ((void)L, (b == 2) ? (a)*(a) : l_mathop(private_lua_embed_pow)(a,b)) -#endif - -/* the others are quite standard operations */ -#if !defined(luai_numadd) -#define luai_numadd(L,a,b) ((a)+(b)) -#define luai_numsub(L,a,b) ((a)-(b)) -#define luai_nummul(L,a,b) ((a)*(b)) -#define luai_numunm(L,a) (-(a)) -#define luai_numeq(a,b) ((a)==(b)) -#define luai_numlt(a,b) ((a)<(b)) -#define luai_numle(a,b) ((a)<=(b)) -#define luai_numgt(a,b) ((a)>(b)) -#define luai_numge(a,b) ((a)>=(b)) -#define luai_numisnan(a) (!luai_numeq((a), (a))) -#endif - - - - - -/* -** macro to control inclusion of some hard tests on stack reallocation -*/ -#if !defined(HARDSTACKTESTS) -#define condmovestack(L,pre,pos) ((void)0) -#else -/* realloc stack keeping its size */ -#define condmovestack(L,pre,pos) \ - { int sz_ = stacksize(L); pre; luaD_reallocstack((L), sz_, 0); pos; } -#endif - -#if !defined(HARDMEMTESTS) -#define condchangemem(L,pre,pos) ((void)0) -#else -#define condchangemem(L,pre,pos) \ - { if (gcrunning(G(L))) { pre; luaC_fullgc(L, 0); pos; } } -#endif - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lmathlib.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lmathlib.c deleted file mode 100644 index 768e965..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lmathlib.c +++ /dev/null @@ -1,771 +0,0 @@ -/* -** $Id: lmathlib.c $ -** Standard mathematical library -** See Copyright Notice in lua.h -*/ - -#define lmathlib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -#undef PI -#define PI (l_mathop(3.141592653589793238462643383279502884)) - - -static int math_abs (lua_State *L) { - if (lua_isinteger(L, 1)) { - lua_Integer n = lua_tointeger(L, 1); - if (n < 0) n = (lua_Integer)(0u - (lua_Unsigned)n); - lua_pushinteger(L, n); - } - else - lua_pushnumber(L, l_mathop(fabs)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_sin (lua_State *L) { - lua_pushnumber(L, l_mathop(sin)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_cos (lua_State *L) { - lua_pushnumber(L, l_mathop(cos)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_tan (lua_State *L) { - lua_pushnumber(L, l_mathop(tan)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_asin (lua_State *L) { - lua_pushnumber(L, l_mathop(asin)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_acos (lua_State *L) { - lua_pushnumber(L, l_mathop(acos)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_atan (lua_State *L) { - lua_Number y = luaL_checknumber(L, 1); - lua_Number x = luaL_optnumber(L, 2, 1); - lua_pushnumber(L, l_mathop(atan2)(y, x)); - return 1; -} - - -static int math_toint (lua_State *L) { - int valid; - lua_Integer n = lua_tointegerx(L, 1, &valid); - if (l_likely(valid)) - lua_pushinteger(L, n); - else { - luaL_checkany(L, 1); - luaL_pushfail(L); /* value is not convertible to integer */ - } - return 1; -} - - -static void pushnumint (lua_State *L, lua_Number d) { - lua_Integer n; - if (lua_numbertointeger(d, &n)) /* does 'd' fit in an integer? */ - lua_pushinteger(L, n); /* result is integer */ - else - lua_pushnumber(L, d); /* result is float */ -} - - -static int math_floor (lua_State *L) { - if (lua_isinteger(L, 1)) - lua_settop(L, 1); /* integer is its own floor */ - else { - lua_Number d = l_mathop(floor)(luaL_checknumber(L, 1)); - pushnumint(L, d); - } - return 1; -} - - -static int math_ceil (lua_State *L) { - if (lua_isinteger(L, 1)) - lua_settop(L, 1); /* integer is its own ceil */ - else { - lua_Number d = l_mathop(ceil)(luaL_checknumber(L, 1)); - pushnumint(L, d); - } - return 1; -} - - -static int math_fmod (lua_State *L) { - if (lua_isinteger(L, 1) && lua_isinteger(L, 2)) { - lua_Integer d = lua_tointeger(L, 2); - if ((lua_Unsigned)d + 1u <= 1u) { /* special cases: -1 or 0 */ - luaL_argcheck(L, d != 0, 2, "zero"); - lua_pushinteger(L, 0); /* avoid overflow with 0x80000... / -1 */ - } - else - lua_pushinteger(L, lua_tointeger(L, 1) % d); - } - else - lua_pushnumber(L, l_mathop(private_lua_embed_fmod)(luaL_checknumber(L, 1), - luaL_checknumber(L, 2))); - return 1; -} - - -/* -** next function does not use 'modf', avoiding problems with 'double*' -** (which is not compatible with 'float*') when lua_Number is not -** 'double'. -*/ -static int math_modf (lua_State *L) { - if (lua_isinteger(L ,1)) { - lua_settop(L, 1); /* number is its own integer part */ - lua_pushnumber(L, 0); /* no fractional part */ - } - else { - lua_Number n = luaL_checknumber(L, 1); - /* integer part (rounds toward zero) */ - lua_Number ip = (n < 0) ? l_mathop(ceil)(n) : l_mathop(floor)(n); - pushnumint(L, ip); - /* fractional part (test needed for inf/-inf) */ - lua_pushnumber(L, (n == ip) ? l_mathop(0.0) : (n - ip)); - } - return 2; -} - - -static int math_sqrt (lua_State *L) { - lua_pushnumber(L, l_mathop(sqrt)(luaL_checknumber(L, 1))); - return 1; -} - - -static int math_ult (lua_State *L) { - lua_Integer a = luaL_checkinteger(L, 1); - lua_Integer b = luaL_checkinteger(L, 2); - lua_pushboolean(L, (lua_Unsigned)a < (lua_Unsigned)b); - return 1; -} - -static int math_log (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - lua_Number res; - if (lua_isnoneornil(L, 2)) - res = l_mathop(log)(x); - else { - lua_Number base = luaL_checknumber(L, 2); -#if !defined(LUA_USE_C89) - if (base == l_mathop(2.0)) - res = l_mathop(log2)(x); - else -#endif - if (base == l_mathop(10.0)) - res = l_mathop(log10)(x); - else - res = l_mathop(log)(x)/l_mathop(log)(base); - } - lua_pushnumber(L, res); - return 1; -} - -static int math_exp (lua_State *L) { - lua_pushnumber(L, l_mathop(exp)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_deg (lua_State *L) { - lua_pushnumber(L, luaL_checknumber(L, 1) * (l_mathop(180.0) / PI)); - return 1; -} - -static int math_rad (lua_State *L) { - lua_pushnumber(L, luaL_checknumber(L, 1) * (PI / l_mathop(180.0))); - return 1; -} - - -static int math_min (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - int imin = 1; /* index of current minimum value */ - int i; - luaL_argcheck(L, n >= 1, 1, "value expected"); - for (i = 2; i <= n; i++) { - if (lua_compare(L, i, imin, LUA_OPLT)) - imin = i; - } - lua_pushvalue(L, imin); - return 1; -} - - -static int math_max (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - int imax = 1; /* index of current maximum value */ - int i; - luaL_argcheck(L, n >= 1, 1, "value expected"); - for (i = 2; i <= n; i++) { - if (lua_compare(L, imax, i, LUA_OPLT)) - imax = i; - } - lua_pushvalue(L, imax); - return 1; -} - - -static int math_type (lua_State *L) { - if (lua_type(L, 1) == LUA_TNUMBER) - lua_pushstring(L, (lua_isinteger(L, 1)) ? "integer" : "float"); - else { - luaL_checkany(L, 1); - luaL_pushfail(L); - } - return 1; -} - - - -/* -** {================================================================== -** Pseudo-Random Number Generator based on 'xoshiro256**'. -** =================================================================== -*/ - -/* -** This code uses lots of shifts. ANSI C does not allow shifts greater -** than or equal to the width of the type being shifted, so some shifts -** are written in convoluted ways to match that restriction. For -** preprocessor tests, it assumes a width of 32 bits, so the maximum -** shift there is 31 bits. -*/ - - -/* number of binary digits in the mantissa of a float */ -#define FIGS l_floatatt(MANT_DIG) - -#if FIGS > 64 -/* there are only 64 random bits; use them all */ -#undef FIGS -#define FIGS 64 -#endif - - -/* -** LUA_RAND32 forces the use of 32-bit integers in the implementation -** of the PRN generator (mainly for testing). -*/ -#if !defined(LUA_RAND32) && !defined(Rand64) - -/* try to find an integer type with at least 64 bits */ - -#if ((ULONG_MAX >> 31) >> 31) >= 3 - -/* 'long' has at least 64 bits */ -#define Rand64 unsigned long -#define SRand64 long - -#elif !defined(LUA_USE_C89) && defined(LLONG_MAX) - -/* there is a 'long long' type (which must have at least 64 bits) */ -#define Rand64 unsigned long long -#define SRand64 long long - -#elif ((LUA_MAXUNSIGNED >> 31) >> 31) >= 3 - -/* 'lua_Unsigned' has at least 64 bits */ -#define Rand64 lua_Unsigned -#define SRand64 lua_Integer - -#endif - -#endif - - -#if defined(Rand64) /* { */ - -/* -** Standard implementation, using 64-bit integers. -** If 'Rand64' has more than 64 bits, the extra bits do not interfere -** with the 64 initial bits, except in a right shift. Moreover, the -** final result has to discard the extra bits. -*/ - -/* avoid using extra bits when needed */ -#define trim64(x) ((x) & 0xffffffffffffffffu) - - -/* rotate left 'x' by 'n' bits */ -static Rand64 rotl (Rand64 x, int n) { - return (x << n) | (trim64(x) >> (64 - n)); -} - -static Rand64 nextrand (Rand64 *state) { - Rand64 state0 = state[0]; - Rand64 state1 = state[1]; - Rand64 state2 = state[2] ^ state0; - Rand64 state3 = state[3] ^ state1; - Rand64 res = rotl(state1 * 5, 7) * 9; - state[0] = state0 ^ state3; - state[1] = state1 ^ state2; - state[2] = state2 ^ (state1 << 17); - state[3] = rotl(state3, 45); - return res; -} - - -/* -** Convert bits from a random integer into a float in the -** interval [0,1), getting the higher FIG bits from the -** random unsigned integer and converting that to a float. -** Some old Microsoft compilers cannot cast an unsigned long -** to a floating-point number, so we use a signed long as an -** intermediary. When lua_Number is float or double, the shift ensures -** that 'sx' is non negative; in that case, a good compiler will remove -** the correction. -*/ - -/* must throw out the extra (64 - FIGS) bits */ -#define shift64_FIG (64 - FIGS) - -/* 2^(-FIGS) == 2^-1 / 2^(FIGS-1) */ -#define scaleFIG (l_mathop(0.5) / ((Rand64)1 << (FIGS - 1))) - -static lua_Number I2d (Rand64 x) { - SRand64 sx = (SRand64)(trim64(x) >> shift64_FIG); - lua_Number res = (lua_Number)(sx) * scaleFIG; - if (sx < 0) - res += l_mathop(1.0); /* correct the two's complement if negative */ - lua_assert(0 <= res && res < 1); - return res; -} - -/* convert a 'Rand64' to a 'lua_Unsigned' */ -#define I2UInt(x) ((lua_Unsigned)trim64(x)) - -/* convert a 'lua_Unsigned' to a 'Rand64' */ -#define Int2I(x) ((Rand64)(x)) - - -#else /* no 'Rand64' }{ */ - -/* get an integer with at least 32 bits */ -#if LUAI_IS32INT -typedef unsigned int lu_int32; -#else -typedef unsigned long lu_int32; -#endif - - -/* -** Use two 32-bit integers to represent a 64-bit quantity. -*/ -typedef struct Rand64 { - lu_int32 h; /* higher half */ - lu_int32 l; /* lower half */ -} Rand64; - - -/* -** If 'lu_int32' has more than 32 bits, the extra bits do not interfere -** with the 32 initial bits, except in a right shift and comparisons. -** Moreover, the final result has to discard the extra bits. -*/ - -/* avoid using extra bits when needed */ -#define trim32(x) ((x) & 0xffffffffu) - - -/* -** basic operations on 'Rand64' values -*/ - -/* build a new Rand64 value */ -static Rand64 packI (lu_int32 h, lu_int32 l) { - Rand64 result; - result.h = h; - result.l = l; - return result; -} - -/* return i << n */ -static Rand64 Ishl (Rand64 i, int n) { - lua_assert(n > 0 && n < 32); - return packI((i.h << n) | (trim32(i.l) >> (32 - n)), i.l << n); -} - -/* i1 ^= i2 */ -static void Ixor (Rand64 *i1, Rand64 i2) { - i1->h ^= i2.h; - i1->l ^= i2.l; -} - -/* return i1 + i2 */ -static Rand64 Iadd (Rand64 i1, Rand64 i2) { - Rand64 result = packI(i1.h + i2.h, i1.l + i2.l); - if (trim32(result.l) < trim32(i1.l)) /* carry? */ - result.h++; - return result; -} - -/* return i * 5 */ -static Rand64 times5 (Rand64 i) { - return Iadd(Ishl(i, 2), i); /* i * 5 == (i << 2) + i */ -} - -/* return i * 9 */ -static Rand64 times9 (Rand64 i) { - return Iadd(Ishl(i, 3), i); /* i * 9 == (i << 3) + i */ -} - -/* return 'i' rotated left 'n' bits */ -static Rand64 rotl (Rand64 i, int n) { - lua_assert(n > 0 && n < 32); - return packI((i.h << n) | (trim32(i.l) >> (32 - n)), - (trim32(i.h) >> (32 - n)) | (i.l << n)); -} - -/* for offsets larger than 32, rotate right by 64 - offset */ -static Rand64 rotl1 (Rand64 i, int n) { - lua_assert(n > 32 && n < 64); - n = 64 - n; - return packI((trim32(i.h) >> n) | (i.l << (32 - n)), - (i.h << (32 - n)) | (trim32(i.l) >> n)); -} - -/* -** implementation of 'xoshiro256**' algorithm on 'Rand64' values -*/ -static Rand64 nextrand (Rand64 *state) { - Rand64 res = times9(rotl(times5(state[1]), 7)); - Rand64 t = Ishl(state[1], 17); - Ixor(&state[2], state[0]); - Ixor(&state[3], state[1]); - Ixor(&state[1], state[2]); - Ixor(&state[0], state[3]); - Ixor(&state[2], t); - state[3] = rotl1(state[3], 45); - return res; -} - - -/* -** Converts a 'Rand64' into a float. -*/ - -/* an unsigned 1 with proper type */ -#define UONE ((lu_int32)1) - - -#if FIGS <= 32 - -/* 2^(-FIGS) */ -#define scaleFIG (l_mathop(0.5) / (UONE << (FIGS - 1))) - -/* -** get up to 32 bits from higher half, shifting right to -** throw out the extra bits. -*/ -static lua_Number I2d (Rand64 x) { - lua_Number h = (lua_Number)(trim32(x.h) >> (32 - FIGS)); - return h * scaleFIG; -} - -#else /* 32 < FIGS <= 64 */ - -/* 2^(-FIGS) = 1.0 / 2^30 / 2^3 / 2^(FIGS-33) */ -#define scaleFIG \ - (l_mathop(1.0) / (UONE << 30) / l_mathop(8.0) / (UONE << (FIGS - 33))) - -/* -** use FIGS - 32 bits from lower half, throwing out the other -** (32 - (FIGS - 32)) = (64 - FIGS) bits -*/ -#define shiftLOW (64 - FIGS) - -/* -** higher 32 bits go after those (FIGS - 32) bits: shiftHI = 2^(FIGS - 32) -*/ -#define shiftHI ((lua_Number)(UONE << (FIGS - 33)) * l_mathop(2.0)) - - -static lua_Number I2d (Rand64 x) { - lua_Number h = (lua_Number)trim32(x.h) * shiftHI; - lua_Number l = (lua_Number)(trim32(x.l) >> shiftLOW); - return (h + l) * scaleFIG; -} - -#endif - - -/* convert a 'Rand64' to a 'lua_Unsigned' */ -static lua_Unsigned I2UInt (Rand64 x) { - return (((lua_Unsigned)trim32(x.h) << 31) << 1) | (lua_Unsigned)trim32(x.l); -} - -/* convert a 'lua_Unsigned' to a 'Rand64' */ -static Rand64 Int2I (lua_Unsigned n) { - return packI((lu_int32)((n >> 31) >> 1), (lu_int32)n); -} - -#endif /* } */ - - -/* -** A state uses four 'Rand64' values. -*/ -typedef struct { - Rand64 s[4]; -} RanState; - - -/* -** Project the random integer 'ran' into the interval [0, n]. -** Because 'ran' has 2^B possible values, the projection can only be -** uniform when the size of the interval is a power of 2 (exact -** division). Otherwise, to get a uniform projection into [0, n], we -** first compute 'lim', the smallest Mersenne number not smaller than -** 'n'. We then project 'ran' into the interval [0, lim]. If the result -** is inside [0, n], we are done. Otherwise, we try with another 'ran', -** until we have a result inside the interval. -*/ -static lua_Unsigned project (lua_Unsigned ran, lua_Unsigned n, - RanState *state) { - if ((n & (n + 1)) == 0) /* is 'n + 1' a power of 2? */ - return ran & n; /* no bias */ - else { - lua_Unsigned lim = n; - /* compute the smallest (2^b - 1) not smaller than 'n' */ - lim |= (lim >> 1); - lim |= (lim >> 2); - lim |= (lim >> 4); - lim |= (lim >> 8); - lim |= (lim >> 16); -#if (LUA_MAXUNSIGNED >> 31) >= 3 - lim |= (lim >> 32); /* integer type has more than 32 bits */ -#endif - lua_assert((lim & (lim + 1)) == 0 /* 'lim + 1' is a power of 2, */ - && lim >= n /* not smaller than 'n', */ - && (lim >> 1) < n); /* and it is the smallest one */ - while ((ran &= lim) > n) /* project 'ran' into [0..lim] */ - ran = I2UInt(nextrand(state->s)); /* not inside [0..n]? try again */ - return ran; - } -} - - -static int math_random (lua_State *L) { - lua_Integer low, up; - lua_Unsigned p; - RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1)); - Rand64 rv = nextrand(state->s); /* next pseudo-random value */ - switch (lua_gettop(L)) { /* check number of arguments */ - case 0: { /* no arguments */ - lua_pushnumber(L, I2d(rv)); /* float between 0 and 1 */ - return 1; - } - case 1: { /* only upper limit */ - low = 1; - up = luaL_checkinteger(L, 1); - if (up == 0) { /* single 0 as argument? */ - lua_pushinteger(L, I2UInt(rv)); /* full random integer */ - return 1; - } - break; - } - case 2: { /* lower and upper limits */ - low = luaL_checkinteger(L, 1); - up = luaL_checkinteger(L, 2); - break; - } - default: return luaL_error(L, "wrong number of arguments"); - } - /* random integer in the interval [low, up] */ - luaL_argcheck(L, low <= up, 1, "interval is empty"); - /* project random integer into the interval [0, up - low] */ - p = project(I2UInt(rv), (lua_Unsigned)up - (lua_Unsigned)low, state); - lua_pushinteger(L, p + (lua_Unsigned)low); - return 1; -} - - -static void setseed (lua_State *L, Rand64 *state, - lua_Unsigned n1, lua_Unsigned n2) { - int i; - state[0] = Int2I(n1); - state[1] = Int2I(0xff); /* avoid a zero state */ - state[2] = Int2I(n2); - state[3] = Int2I(0); - for (i = 0; i < 16; i++) - nextrand(state); /* discard initial values to "spread" seed */ - lua_pushinteger(L, n1); - lua_pushinteger(L, n2); -} - - -static int math_randomseed (lua_State *L) { - RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1)); - lua_Unsigned n1, n2; - if (lua_isnone(L, 1)) { - n1 = luaL_makeseed(L); /* "random" seed */ - n2 = I2UInt(nextrand(state->s)); /* in case seed is not that random... */ - } - else { - n1 = luaL_checkinteger(L, 1); - n2 = luaL_optinteger(L, 2, 0); - } - setseed(L, state->s, n1, n2); - return 2; /* return seeds */ -} - - -static const luaL_Reg randfuncs[] = { - {"random", math_random}, - {"randomseed", math_randomseed}, - {NULL, NULL} -}; - - -/* -** Register the random functions and initialize their state. -*/ -static void setrandfunc (lua_State *L) { - RanState *state = (RanState *)lua_newuserdatauv(L, sizeof(RanState), 0); - setseed(L, state->s, luaL_makeseed(L), 0); /* initialize with random seed */ - lua_pop(L, 2); /* remove pushed seeds */ - luaL_setfuncs(L, randfuncs, 1); -} - -/* }================================================================== */ - - -/* -** {================================================================== -** Deprecated functions (for compatibility only) -** =================================================================== -*/ -#if defined(LUA_COMPAT_MATHLIB) - -static int math_cosh (lua_State *L) { - lua_pushnumber(L, l_mathop(cosh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_sinh (lua_State *L) { - lua_pushnumber(L, l_mathop(sinh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_tanh (lua_State *L) { - lua_pushnumber(L, l_mathop(tanh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_pow (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - lua_Number y = luaL_checknumber(L, 2); - lua_pushnumber(L, l_mathop(pow)(x, y)); - return 1; -} - -static int math_frexp (lua_State *L) { - int e; - lua_pushnumber(L, l_mathop(frexp)(luaL_checknumber(L, 1), &e)); - lua_pushinteger(L, e); - return 2; -} - -static int math_ldexp (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - int ep = (int)luaL_checkinteger(L, 2); - lua_pushnumber(L, l_mathop(ldexp)(x, ep)); - return 1; -} - -static int math_log10 (lua_State *L) { - lua_pushnumber(L, l_mathop(log10)(luaL_checknumber(L, 1))); - return 1; -} - -#endif -/* }================================================================== */ - - - -static const luaL_Reg mathlib[] = { - {"abs", math_abs}, - {"acos", math_acos}, - {"asin", math_asin}, - {"atan", math_atan}, - {"ceil", math_ceil}, - {"cos", math_cos}, - {"deg", math_deg}, - {"exp", math_exp}, - {"tointeger", math_toint}, - {"floor", math_floor}, - {"fmod", math_fmod}, - {"ult", math_ult}, - {"log", math_log}, - {"max", math_max}, - {"min", math_min}, - {"modf", math_modf}, - {"rad", math_rad}, - {"sin", math_sin}, - {"sqrt", math_sqrt}, - {"tan", math_tan}, - {"type", math_type}, -#if defined(LUA_COMPAT_MATHLIB) - {"atan2", math_atan}, - {"cosh", math_cosh}, - {"sinh", math_sinh}, - {"tanh", math_tanh}, - {"pow", math_pow}, - {"frexp", math_frexp}, - {"ldexp", math_ldexp}, - {"log10", math_log10}, -#endif - /* placeholders */ - {"random", NULL}, - {"randomseed", NULL}, - {"pi", NULL}, - {"huge", NULL}, - {"maxinteger", NULL}, - {"mininteger", NULL}, - {NULL, NULL} -}; - - -/* -** Open math library -*/ -LUAMOD_API int luaopen_math (lua_State *L) { - luaL_newlib(L, mathlib); - lua_pushnumber(L, PI); - lua_setfield(L, -2, "pi"); - lua_pushnumber(L, (lua_Number)HUGE_VAL); - lua_setfield(L, -2, "huge"); - lua_pushinteger(L, LUA_MAXINTEGER); - lua_setfield(L, -2, "maxinteger"); - lua_pushinteger(L, LUA_MININTEGER); - lua_setfield(L, -2, "mininteger"); - setrandfunc(L); - return 1; -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lmem.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lmem.c deleted file mode 100644 index f6a3d95..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lmem.c +++ /dev/null @@ -1,215 +0,0 @@ -/* -** $Id: lmem.c $ -** Interface to Memory Manager -** See Copyright Notice in lua.h -*/ - -#define lmem_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" - - - -/* -** About the realloc function: -** void *frealloc (void *ud, void *ptr, size_t osize, size_t nsize); -** ('osize' is the old size, 'nsize' is the new size) -** -** - frealloc(ud, p, x, 0) frees the block 'p' and returns NULL. -** Particularly, frealloc(ud, NULL, 0, 0) does nothing, -** which is equivalent to free(NULL) in ISO C. -** -** - frealloc(ud, NULL, x, s) creates a new block of size 's' -** (no matter 'x'). Returns NULL if it cannot create the new block. -** -** - otherwise, frealloc(ud, b, x, y) reallocates the block 'b' from -** size 'x' to size 'y'. Returns NULL if it cannot reallocate the -** block to the new size. -*/ - - -/* -** Macro to call the allocation function. -*/ -#define callfrealloc(g,block,os,ns) ((*g->frealloc)(g->ud, block, os, ns)) - - -/* -** When an allocation fails, it will try again after an emergency -** collection, except when it cannot run a collection. The GC should -** not be called while the state is not fully built, as the collector -** is not yet fully initialized. Also, it should not be called when -** 'gcstopem' is true, because then the interpreter is in the middle of -** a collection step. -*/ -#define cantryagain(g) (completestate(g) && !g->gcstopem) - - - - -#if defined(EMERGENCYGCTESTS) -/* -** First allocation will fail except when freeing a block (frees never -** fail) and when it cannot try again; this fail will trigger 'tryagain' -** and a full GC cycle at every allocation. -*/ -static void *firsttry (global_State *g, void *block, size_t os, size_t ns) { - if (ns > 0 && cantryagain(g)) - return NULL; /* fail */ - else /* normal allocation */ - return callfrealloc(g, block, os, ns); -} -#else -#define firsttry(g,block,os,ns) callfrealloc(g, block, os, ns) -#endif - - - - - -/* -** {================================================================== -** Functions to allocate/deallocate arrays for the Parser -** =================================================================== -*/ - -/* -** Minimum size for arrays during parsing, to avoid overhead of -** reallocating to size 1, then 2, and then 4. All these arrays -** will be reallocated to exact sizes or erased when parsing ends. -*/ -#define MINSIZEARRAY 4 - - -void *luaM_growaux_ (lua_State *L, void *block, int nelems, int *psize, - int size_elems, int limit, const char *what) { - void *newblock; - int size = *psize; - if (nelems + 1 <= size) /* does one extra element still fit? */ - return block; /* nothing to be done */ - if (size >= limit / 2) { /* cannot double it? */ - if (l_unlikely(size >= limit)) /* cannot grow even a little? */ - luaG_runerror(L, "too many %s (limit is %d)", what, limit); - size = limit; /* still have at least one free place */ - } - else { - size *= 2; - if (size < MINSIZEARRAY) - size = MINSIZEARRAY; /* minimum size */ - } - lua_assert(nelems + 1 <= size && size <= limit); - /* 'limit' ensures that multiplication will not overflow */ - newblock = luaM_saferealloc_(L, block, cast_sizet(*psize) * size_elems, - cast_sizet(size) * size_elems); - *psize = size; /* update only when everything else is OK */ - return newblock; -} - - -/* -** In prototypes, the size of the array is also its number of -** elements (to save memory). So, if it cannot shrink an array -** to its number of elements, the only option is to raise an -** error. -*/ -void *luaM_shrinkvector_ (lua_State *L, void *block, int *size, - int final_n, int size_elem) { - void *newblock; - size_t oldsize = cast_sizet((*size) * size_elem); - size_t newsize = cast_sizet(final_n * size_elem); - lua_assert(newsize <= oldsize); - newblock = luaM_saferealloc_(L, block, oldsize, newsize); - *size = final_n; - return newblock; -} - -/* }================================================================== */ - - -l_noret luaM_toobig (lua_State *L) { - luaG_runerror(L, "memory allocation private_lua_error: block too big"); -} - - -/* -** Free memory -*/ -void luaM_free_ (lua_State *L, void *block, size_t osize) { - global_State *g = G(L); - lua_assert((osize == 0) == (block == NULL)); - callfrealloc(g, block, osize, 0); - g->totalbytes -= osize; -} - - -/* -** In case of allocation fail, this function will do an emergency -** collection to free some memory and then try the allocation again. -*/ -static void *tryagain (lua_State *L, void *block, - size_t osize, size_t nsize) { - global_State *g = G(L); - if (cantryagain(g)) { - luaC_fullgc(L, 1); /* try to free some memory... */ - return callfrealloc(g, block, osize, nsize); /* try again */ - } - else return NULL; /* cannot run an emergency collection */ -} - - -/* -** Generic allocation routine. -*/ -void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) { - void *newblock; - global_State *g = G(L); - lua_assert((osize == 0) == (block == NULL)); - newblock = firsttry(g, block, osize, nsize); - if (l_unlikely(newblock == NULL && nsize > 0)) { - newblock = tryagain(L, block, osize, nsize); - if (newblock == NULL) /* still no memory? */ - return NULL; /* do not update 'totalbytes' */ - } - lua_assert((nsize == 0) == (newblock == NULL)); - g->totalbytes += nsize - osize; - return newblock; -} - - -void *luaM_saferealloc_ (lua_State *L, void *block, size_t osize, - size_t nsize) { - void *newblock = luaM_realloc_(L, block, osize, nsize); - if (l_unlikely(newblock == NULL && nsize > 0)) /* allocation failed? */ - luaM_error(L); - return newblock; -} - - -void *luaM_malloc_ (lua_State *L, size_t size, int tag) { - if (size == 0) - return NULL; /* that's all */ - else { - global_State *g = G(L); - void *newblock = firsttry(g, NULL, tag, size); - if (l_unlikely(newblock == NULL)) { - newblock = tryagain(L, NULL, tag, size); - if (newblock == NULL) - luaM_error(L); - } - g->totalbytes += size; - return newblock; - } -} diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lmem.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lmem.h deleted file mode 100644 index c5dada9..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lmem.h +++ /dev/null @@ -1,95 +0,0 @@ -/* -** $Id: lmem.h $ -** Interface to Memory Manager -** See Copyright Notice in lua.h -*/ - -#ifndef lmem_h -#define lmem_h - - -#include - -#include "llimits.h" -#include "lua.h" - - -#define luaM_error(L) luaD_throw(L, LUA_ERRMEM) - - -/* -** This macro tests whether it is safe to multiply 'n' by the size of -** type 't' without overflows. Because 'e' is always constant, it avoids -** the runtime division MAX_SIZET/(e). -** (The macro is somewhat complex to avoid warnings: The 'sizeof' -** comparison avoids a runtime comparison when overflow cannot occur. -** The compiler should be able to optimize the real test by itself, but -** when it does it, it may give a warning about "comparison is always -** false due to limited range of data type"; the +1 tricks the compiler, -** avoiding this warning but also this optimization.) -*/ -#define luaM_testsize(n,e) \ - (sizeof(n) >= sizeof(size_t) && cast_sizet((n)) + 1 > MAX_SIZET/(e)) - -#define luaM_checksize(L,n,e) \ - (luaM_testsize(n,e) ? luaM_toobig(L) : cast_void(0)) - - -/* -** Computes the minimum between 'n' and 'MAX_SIZET/sizeof(t)', so that -** the result is not larger than 'n' and cannot overflow a 'size_t' -** when multiplied by the size of type 't'. (Assumes that 'n' is an -** 'int' or 'unsigned int' and that 'int' is not larger than 'size_t'.) -*/ -#define luaM_limitN(n,t) \ - ((cast_sizet(n) <= MAX_SIZET/sizeof(t)) ? (n) : \ - cast_uint((MAX_SIZET/sizeof(t)))) - - -/* -** Arrays of chars do not need any test -*/ -#define luaM_reallocvchar(L,b,on,n) \ - cast_charp(luaM_saferealloc_(L, (b), (on)*sizeof(char), (n)*sizeof(char))) - -#define luaM_freemem(L, b, s) luaM_free_(L, (b), (s)) -#define luaM_free(L, b) luaM_free_(L, (b), sizeof(*(b))) -#define luaM_freearray(L, b, n) luaM_free_(L, (b), (n)*sizeof(*(b))) - -#define luaM_new(L,t) cast(t*, luaM_malloc_(L, sizeof(t), 0)) -#define luaM_newvector(L,n,t) cast(t*, luaM_malloc_(L, (n)*sizeof(t), 0)) -#define luaM_newvectorchecked(L,n,t) \ - (luaM_checksize(L,n,sizeof(t)), luaM_newvector(L,n,t)) - -#define luaM_newobject(L,tag,s) luaM_malloc_(L, (s), tag) - -#define luaM_newblock(L, size) luaM_newvector(L, size, char) - -#define luaM_growvector(L,v,nelems,size,t,limit,e) \ - ((v)=cast(t *, luaM_growaux_(L,v,nelems,&(size),sizeof(t), \ - luaM_limitN(limit,t),e))) - -#define luaM_reallocvector(L, v,oldn,n,t) \ - (cast(t *, luaM_realloc_(L, v, cast_sizet(oldn) * sizeof(t), \ - cast_sizet(n) * sizeof(t)))) - -#define luaM_shrinkvector(L,v,size,fs,t) \ - ((v)=cast(t *, luaM_shrinkvector_(L, v, &(size), fs, sizeof(t)))) - -LUAI_FUNC l_noret luaM_toobig (lua_State *L); - -/* not to be called directly */ -LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize, - size_t size); -LUAI_FUNC void *luaM_saferealloc_ (lua_State *L, void *block, size_t oldsize, - size_t size); -LUAI_FUNC void luaM_free_ (lua_State *L, void *block, size_t osize); -LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int nelems, - int *size, int size_elem, int limit, - const char *what); -LUAI_FUNC void *luaM_shrinkvector_ (lua_State *L, void *block, int *nelem, - int final_n, int size_elem); -LUAI_FUNC void *luaM_malloc_ (lua_State *L, size_t size, int tag); - -#endif - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/loadlib.c b/build/c/dependencies/luaCEmbed/dependencies/lua/loadlib.c deleted file mode 100644 index 4f8024c..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/loadlib.c +++ /dev/null @@ -1,759 +0,0 @@ -/* -** $Id: loadlib.c $ -** Dynamic library loader for Lua -** See Copyright Notice in lua.h -** -** This module contains an implementation of loadlib for Unix systems -** that have dlfcn, an implementation for Windows, and a stub for other -** systems. -*/ - -#define loadlib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** LUA_CSUBSEP is the character that replaces dots in submodule names -** when searching for a C loader. -** LUA_LSUBSEP is the character that replaces dots in submodule names -** when searching for a Lua loader. -*/ -#if !defined(LUA_CSUBSEP) -#define LUA_CSUBSEP LUA_DIRSEP -#endif - -#if !defined(LUA_LSUBSEP) -#define LUA_LSUBSEP LUA_DIRSEP -#endif - - -/* prefix for open functions in C libraries */ -#define LUA_POF "luaopen_" - -/* separator for open functions in C libraries */ -#define LUA_OFSEP "_" - - -/* -** key for table in the registry that keeps handles -** for all loaded C libraries -*/ -static const char *const CLIBS = "_CLIBS"; - -#define LIB_FAIL "open" - - -#define setprogdir(L) ((void)0) - - -/* -** Special type equivalent to '(void*)' for functions in gcc -** (to suppress warnings when converting function pointers) -*/ -typedef void (*voidf)(void); - - -/* -** system-dependent functions -*/ - -/* -** unload library 'lib' -*/ -static void lsys_unloadlib (void *lib); - -/* -** load C library in file 'path'. If 'seeglb', load with all names in -** the library global. -** Returns the library; in case of error, returns NULL plus an -** error string in the stack. -*/ -static void *lsys_load (lua_State *L, const char *path, int seeglb); - -/* -** Try to find a function named 'sym' in library 'lib'. -** Returns the function; in case of error, returns NULL plus an -** error string in the stack. -*/ -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym); - - - - -#if defined(LUA_USE_DLOPEN) /* { */ -/* -** {======================================================================== -** This is an implementation of loadlib based on the dlfcn interface. -** The dlfcn interface is available in Linux, SunOS, Solaris, IRIX, FreeBSD, -** NetBSD, AIX 4.2, HPUX 11, and probably most other Unix flavors, at least -** as an emulation layer on top of native functions. -** ========================================================================= -*/ - -#include - -/* -** Macro to convert pointer-to-void* to pointer-to-function. This cast -** is undefined according to ISO C, but POSIX assumes that it works. -** (The '__extension__' in gnu compilers is only to avoid warnings.) -*/ -#if defined(__GNUC__) -#define cast_func(p) (__extension__ (lua_CFunction)(p)) -#else -#define cast_func(p) ((lua_CFunction)(p)) -#endif - - -static void lsys_unloadlib (void *lib) { - dlclose(lib); -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - void *lib = dlopen(path, RTLD_NOW | (seeglb ? RTLD_GLOBAL : RTLD_LOCAL)); - if (l_unlikely(lib == NULL)) - lua_pushstring(L, dlerror()); - return lib; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - lua_CFunction f = cast_func(dlsym(lib, sym)); - if (l_unlikely(f == NULL)) - lua_pushstring(L, dlerror()); - return f; -} - -/* }====================================================== */ - - - -#elif defined(LUA_DL_DLL) /* }{ */ -/* -** {====================================================================== -** This is an implementation of loadlib for Windows using native functions. -** ======================================================================= -*/ - -#include - - -/* -** optional flags for LoadLibraryEx -*/ -#if !defined(LUA_LLE_FLAGS) -#define LUA_LLE_FLAGS 0 -#endif - - -#undef setprogdir - - -/* -** Replace in the path (on the top of the stack) any occurrence -** of LUA_EXEC_DIR with the executable's path. -*/ -static void setprogdir (lua_State *L) { - char buff[MAX_PATH + 1]; - char *lb; - DWORD nsize = sizeof(buff)/sizeof(char); - DWORD n = GetModuleFileNameA(NULL, buff, nsize); /* get exec. name */ - if (n == 0 || n == nsize || (lb = strrchr(buff, '\\')) == NULL) - luaL_error(L, "unable to get ModuleFileName"); - else { - *lb = '\0'; /* cut name on the last '\\' to get the path */ - luaL_gsub(L, lua_tostring(L, -1), LUA_EXEC_DIR, buff); - lua_remove(L, -2); /* remove original string */ - } -} - - - - -static void pusherror (lua_State *L) { - int error = GetLastError(); - char buffer[128]; - if (FormatMessageA(FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM, - NULL, error, 0, buffer, sizeof(buffer)/sizeof(char), NULL)) - lua_pushstring(L, buffer); - else - lua_pushfstring(L, "system error %d\n", error); -} - -static void lsys_unloadlib (void *lib) { - FreeLibrary((HMODULE)lib); -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - HMODULE lib = LoadLibraryExA(path, NULL, LUA_LLE_FLAGS); - (void)(seeglb); /* not used: symbols are 'global' by default */ - if (lib == NULL) pusherror(L); - return lib; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - lua_CFunction f = (lua_CFunction)(voidf)GetProcAddress((HMODULE)lib, sym); - if (f == NULL) pusherror(L); - return f; -} - -/* }====================================================== */ - - -#else /* }{ */ -/* -** {====================================================== -** Fallback for other systems -** ======================================================= -*/ - -#undef LIB_FAIL -#define LIB_FAIL "absent" - - -#define DLMSG "dynamic libraries not enabled; check your Lua installation" - - -static void lsys_unloadlib (void *lib) { - (void)(lib); /* not used */ -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - (void)(path); (void)(seeglb); /* not used */ - lua_pushliteral(L, DLMSG); - return NULL; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - (void)(lib); (void)(sym); /* not used */ - lua_pushliteral(L, DLMSG); - return NULL; -} - -/* }====================================================== */ -#endif /* } */ - - -/* -** {================================================================== -** Set Paths -** =================================================================== -*/ - -/* -** LUA_PATH_VAR and LUA_CPATH_VAR are the names of the environment -** variables that Lua check to set its paths. -*/ -#if !defined(LUA_PATH_VAR) -#define LUA_PATH_VAR "LUA_PATH" -#endif - -#if !defined(LUA_CPATH_VAR) -#define LUA_CPATH_VAR "LUA_CPATH" -#endif - - - -/* -** return registry.LUA_NOENV as a boolean -*/ -static int noenv (lua_State *L) { - int b; - lua_getfield(L, LUA_REGISTRYINDEX, "LUA_NOENV"); - b = lua_toboolean(L, -1); - lua_pop(L, 1); /* remove value */ - return b; -} - - -/* -** Set a path. (If using the default path, assume it is a string -** literal in C and create it as an external string.) -*/ -static void setpath (lua_State *L, const char *fieldname, - const char *envname, - const char *dft) { - const char *dftmark; - const char *nver = lua_pushfstring(L, "%s%s", envname, LUA_VERSUFFIX); - const char *path = getenv(nver); /* try versioned name */ - if (path == NULL) /* no versioned environment variable? */ - path = getenv(envname); /* try unversioned name */ - if (path == NULL || noenv(L)) /* no environment variable? */ - lua_pushextlstring(L, dft, strlen(dft), NULL, NULL); /* use default */ - else if ((dftmark = strstr(path, LUA_PATH_SEP LUA_PATH_SEP)) == NULL) - lua_pushstring(L, path); /* nothing to change */ - else { /* path contains a ";;": insert default path in its place */ - size_t len = strlen(path); - luaL_Buffer b; - luaL_buffinit(L, &b); - if (path < dftmark) { /* is there a prefix before ';;'? */ - luaL_addlstring(&b, path, dftmark - path); /* add it */ - luaL_addchar(&b, *LUA_PATH_SEP); - } - luaL_addstring(&b, dft); /* add default */ - if (dftmark < path + len - 2) { /* is there a suffix after ';;'? */ - luaL_addchar(&b, *LUA_PATH_SEP); - luaL_addlstring(&b, dftmark + 2, (path + len - 2) - dftmark); - } - luaL_pushresult(&b); - } - setprogdir(L); - lua_setfield(L, -3, fieldname); /* package[fieldname] = path value */ - lua_pop(L, 1); /* pop versioned variable name ('nver') */ -} - -/* }================================================================== */ - - -/* -** return registry.CLIBS[path] -*/ -static void *checkclib (lua_State *L, const char *path) { - void *plib; - lua_getfield(L, LUA_REGISTRYINDEX, CLIBS); - lua_getfield(L, -1, path); - plib = lua_touserdata(L, -1); /* plib = CLIBS[path] */ - lua_pop(L, 2); /* pop CLIBS table and 'plib' */ - return plib; -} - - -/* -** registry.CLIBS[path] = plib -- for queries -** registry.CLIBS[#CLIBS + 1] = plib -- also keep a list of all libraries -*/ -static void addtoclib (lua_State *L, const char *path, void *plib) { - lua_getfield(L, LUA_REGISTRYINDEX, CLIBS); - lua_pushlightuserdata(L, plib); - lua_pushvalue(L, -1); - lua_setfield(L, -3, path); /* CLIBS[path] = plib */ - lua_rawseti(L, -2, luaL_len(L, -2) + 1); /* CLIBS[#CLIBS + 1] = plib */ - lua_pop(L, 1); /* pop CLIBS table */ -} - - -/* -** __gc tag method for CLIBS table: calls 'lsys_unloadlib' for all lib -** handles in list CLIBS -*/ -static int gctm (lua_State *L) { - lua_Integer n = luaL_len(L, 1); - for (; n >= 1; n--) { /* for each handle, in reverse order */ - lua_rawgeti(L, 1, n); /* get handle CLIBS[n] */ - lsys_unloadlib(lua_touserdata(L, -1)); - lua_pop(L, 1); /* pop handle */ - } - return 0; -} - - - -/* error codes for 'lookforfunc' */ -#define ERRLIB 1 -#define ERRFUNC 2 - -/* -** Look for a C function named 'sym' in a dynamically loaded library -** 'path'. -** First, check whether the library is already loaded; if not, try -** to load it. -** Then, if 'sym' is '*', return true (as library has been loaded). -** Otherwise, look for symbol 'sym' in the library and push a -** C function with that symbol. -** Return 0 and 'true' or a function in the stack; in case of -** errors, return an error code and an error message in the stack. -*/ -static int lookforfunc (lua_State *L, const char *path, const char *sym) { - void *reg = checkclib(L, path); /* check loaded C libraries */ - if (reg == NULL) { /* must load library? */ - reg = lsys_load(L, path, *sym == '*'); /* global symbols if 'sym'=='*' */ - if (reg == NULL) return ERRLIB; /* unable to load library */ - addtoclib(L, path, reg); - } - if (*sym == '*') { /* loading only library (no function)? */ - lua_pushboolean(L, 1); /* return 'true' */ - return 0; /* no errors */ - } - else { - lua_CFunction f = lsys_sym(L, reg, sym); - if (f == NULL) - return ERRFUNC; /* unable to find function */ - lua_pushcfunction(L, f); /* else create new function */ - return 0; /* no errors */ - } -} - - -static int ll_loadlib (lua_State *L) { - const char *path = luaL_checkstring(L, 1); - const char *init = luaL_checkstring(L, 2); - int stat = lookforfunc(L, path, init); - if (l_likely(stat == 0)) /* no errors? */ - return 1; /* return the loaded function */ - else { /* error; error message is on stack top */ - luaL_pushfail(L); - lua_insert(L, -2); - lua_pushstring(L, (stat == ERRLIB) ? LIB_FAIL : "init"); - return 3; /* return fail, error message, and where */ - } -} - - - -/* -** {====================================================== -** 'require' function -** ======================================================= -*/ - - -static int readable (const char *filename) { - FILE *f = fopen(filename, "r"); /* try to open file */ - if (f == NULL) return 0; /* open failed */ - fclose(f); - return 1; -} - - -/* -** Get the next name in '*path' = 'name1;name2;name3;...', changing -** the ending ';' to '\0' to create a zero-terminated string. Return -** NULL when list ends. -*/ -static const char *getnextfilename (char **path, char *end) { - char *sep; - char *name = *path; - if (name == end) - return NULL; /* no more names */ - else if (*name == '\0') { /* from previous iteration? */ - *name = *LUA_PATH_SEP; /* restore separator */ - name++; /* skip it */ - } - sep = strchr(name, *LUA_PATH_SEP); /* find next separator */ - if (sep == NULL) /* separator not found? */ - sep = end; /* name goes until the end */ - *sep = '\0'; /* finish file name */ - *path = sep; /* will start next search from here */ - return name; -} - - -/* -** Given a path such as ";blabla.so;blublu.so", pushes the string -** -** no file 'blabla.so' -** no file 'blublu.so' -*/ -static void pusherrornotfound (lua_State *L, const char *path) { - luaL_Buffer b; - luaL_buffinit(L, &b); - luaL_addstring(&b, "no file '"); - luaL_addgsub(&b, path, LUA_PATH_SEP, "'\n\tno file '"); - luaL_addstring(&b, "'"); - luaL_pushresult(&b); -} - - -static const char *searchpath (lua_State *L, const char *name, - const char *path, - const char *sep, - const char *dirsep) { - luaL_Buffer buff; - char *pathname; /* path with name inserted */ - char *endpathname; /* its end */ - const char *filename; - /* separator is non-empty and appears in 'name'? */ - if (*sep != '\0' && strchr(name, *sep) != NULL) - name = luaL_gsub(L, name, sep, dirsep); /* replace it by 'dirsep' */ - luaL_buffinit(L, &buff); - /* add path to the buffer, replacing marks ('?') with the file name */ - luaL_addgsub(&buff, path, LUA_PATH_MARK, name); - luaL_addchar(&buff, '\0'); - pathname = luaL_buffaddr(&buff); /* writable list of file names */ - endpathname = pathname + luaL_bufflen(&buff) - 1; - while ((filename = getnextfilename(&pathname, endpathname)) != NULL) { - if (readable(filename)) /* does file exist and is readable? */ - return lua_pushstring(L, filename); /* save and return name */ - } - luaL_pushresult(&buff); /* push path to create error message */ - pusherrornotfound(L, lua_tostring(L, -1)); /* create error message */ - return NULL; /* not found */ -} - - -static int ll_searchpath (lua_State *L) { - const char *f = searchpath(L, luaL_checkstring(L, 1), - luaL_checkstring(L, 2), - luaL_optstring(L, 3, "."), - luaL_optstring(L, 4, LUA_DIRSEP)); - if (f != NULL) return 1; - else { /* error message is on top of the stack */ - luaL_pushfail(L); - lua_insert(L, -2); - return 2; /* return fail + error message */ - } -} - - -static const char *findfile (lua_State *L, const char *name, - const char *pname, - const char *dirsep) { - const char *path; - lua_getfield(L, lua_upvalueindex(1), pname); - path = lua_tostring(L, -1); - if (l_unlikely(path == NULL)) - luaL_error(L, "'package.%s' must be a string", pname); - return searchpath(L, name, path, ".", dirsep); -} - - -static int checkload (lua_State *L, int stat, const char *filename) { - if (l_likely(stat)) { /* module loaded successfully? */ - lua_pushstring(L, filename); /* will be 2nd argument to module */ - return 2; /* return open function and file name */ - } - else - return luaL_error(L, "error loading module '%s' from file '%s':\n\t%s", - lua_tostring(L, 1), filename, lua_tostring(L, -1)); -} - - -static int searcher_Lua (lua_State *L) { - const char *filename; - const char *name = luaL_checkstring(L, 1); - filename = findfile(L, name, "path", LUA_LSUBSEP); - if (filename == NULL) return 1; /* module not found in this path */ - return checkload(L, (luaL_loadfile(L, filename) == LUA_OK), filename); -} - - -/* -** Try to find a load function for module 'modname' at file 'filename'. -** First, change '.' to '_' in 'modname'; then, if 'modname' has -** the form X-Y (that is, it has an "ignore mark"), build a function -** name "luaopen_X" and look for it. (For compatibility, if that -** fails, it also tries "luaopen_Y".) If there is no ignore mark, -** look for a function named "luaopen_modname". -*/ -static int loadfunc (lua_State *L, const char *filename, const char *modname) { - const char *openfunc; - const char *mark; - modname = luaL_gsub(L, modname, ".", LUA_OFSEP); - mark = strchr(modname, *LUA_IGMARK); - if (mark) { - int stat; - openfunc = lua_pushlstring(L, modname, mark - modname); - openfunc = lua_pushfstring(L, LUA_POF"%s", openfunc); - stat = lookforfunc(L, filename, openfunc); - if (stat != ERRFUNC) return stat; - modname = mark + 1; /* else go ahead and try old-style name */ - } - openfunc = lua_pushfstring(L, LUA_POF"%s", modname); - return lookforfunc(L, filename, openfunc); -} - - -static int searcher_C (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - const char *filename = findfile(L, name, "cpath", LUA_CSUBSEP); - if (filename == NULL) return 1; /* module not found in this path */ - return checkload(L, (loadfunc(L, filename, name) == 0), filename); -} - - -static int searcher_Croot (lua_State *L) { - const char *filename; - const char *name = luaL_checkstring(L, 1); - const char *p = strchr(name, '.'); - int stat; - if (p == NULL) return 0; /* is root */ - lua_pushlstring(L, name, p - name); - filename = findfile(L, lua_tostring(L, -1), "cpath", LUA_CSUBSEP); - if (filename == NULL) return 1; /* root not found */ - if ((stat = loadfunc(L, filename, name)) != 0) { - if (stat != ERRFUNC) - return checkload(L, 0, filename); /* real error */ - else { /* open function not found */ - lua_pushfstring(L, "no module '%s' in file '%s'", name, filename); - return 1; - } - } - lua_pushstring(L, filename); /* will be 2nd argument to module */ - return 2; -} - - -static int searcher_preload (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - lua_getfield(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - if (lua_getfield(L, -1, name) == LUA_TNIL) { /* not found? */ - lua_pushfstring(L, "no field package.preload['%s']", name); - return 1; - } - else { - lua_pushliteral(L, ":preload:"); - return 2; - } -} - - -static void findloader (lua_State *L, const char *name) { - int i; - luaL_Buffer msg; /* to build error message */ - /* push 'package.searchers' to index 3 in the stack */ - if (l_unlikely(lua_getfield(L, lua_upvalueindex(1), "searchers") - != LUA_TTABLE)) - luaL_error(L, "'package.searchers' must be a table"); - luaL_buffinit(L, &msg); - /* iterate over available searchers to find a loader */ - for (i = 1; ; i++) { - luaL_addstring(&msg, "\n\t"); /* error-message prefix */ - if (l_unlikely(lua_rawgeti(L, 3, i) == LUA_TNIL)) { /* no more searchers? */ - lua_pop(L, 1); /* remove nil */ - luaL_buffsub(&msg, 2); /* remove prefix */ - luaL_pushresult(&msg); /* create error message */ - luaL_error(L, "module '%s' not found:%s", name, lua_tostring(L, -1)); - } - lua_pushstring(L, name); - lua_call(L, 1, 2); /* call it */ - if (lua_isfunction(L, -2)) /* did it find a loader? */ - return; /* module loader found */ - else if (lua_isstring(L, -2)) { /* searcher returned error message? */ - lua_pop(L, 1); /* remove extra return */ - luaL_addvalue(&msg); /* concatenate error message */ - } - else { /* no error message */ - lua_pop(L, 2); /* remove both returns */ - luaL_buffsub(&msg, 2); /* remove prefix */ - } - } -} - - -static int ll_require (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - lua_settop(L, 1); /* LOADED table will be at index 2 */ - lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_getfield(L, 2, name); /* LOADED[name] */ - if (lua_toboolean(L, -1)) /* is it there? */ - return 1; /* package is already loaded */ - /* else must load package */ - lua_pop(L, 1); /* remove 'getfield' result */ - findloader(L, name); - lua_rotate(L, -2, 1); /* function <-> loader data */ - lua_pushvalue(L, 1); /* name is 1st argument to module loader */ - lua_pushvalue(L, -3); /* loader data is 2nd argument */ - /* stack: ...; loader data; loader function; mod. name; loader data */ - lua_call(L, 2, 1); /* run loader to load module */ - /* stack: ...; loader data; result from loader */ - if (!lua_isnil(L, -1)) /* non-nil return? */ - lua_setfield(L, 2, name); /* LOADED[name] = returned value */ - else - lua_pop(L, 1); /* pop nil */ - if (lua_getfield(L, 2, name) == LUA_TNIL) { /* module set no value? */ - lua_pushboolean(L, 1); /* use true as result */ - lua_copy(L, -1, -2); /* replace loader result */ - lua_setfield(L, 2, name); /* LOADED[name] = true */ - } - lua_rotate(L, -2, 1); /* loader data <-> module result */ - return 2; /* return module result and loader data */ -} - -/* }====================================================== */ - - - - -static const luaL_Reg pk_funcs[] = { - {"loadlib", ll_loadlib}, - {"searchpath", ll_searchpath}, - /* placeholders */ - {"preload", NULL}, - {"cpath", NULL}, - {"path", NULL}, - {"searchers", NULL}, - {"loaded", NULL}, - {NULL, NULL} -}; - - -static const luaL_Reg ll_funcs[] = { - {"require", ll_require}, - {NULL, NULL} -}; - - -static void createsearcherstable (lua_State *L) { - static const lua_CFunction searchers[] = { - searcher_preload, - searcher_Lua, - searcher_C, - searcher_Croot, - NULL - }; - int i; - /* create 'searchers' table */ - lua_createtable(L, sizeof(searchers)/sizeof(searchers[0]) - 1, 0); - /* fill it with predefined searchers */ - for (i=0; searchers[i] != NULL; i++) { - lua_pushvalue(L, -2); /* set 'package' as upvalue for all searchers */ - lua_pushcclosure(L, searchers[i], 1); - lua_rawseti(L, -2, i+1); - } - lua_setfield(L, -2, "searchers"); /* put it in field 'searchers' */ -} - - -/* -** create table CLIBS to keep track of loaded C libraries, -** setting a finalizer to close all libraries when closing state. -*/ -static void createclibstable (lua_State *L) { - luaL_getsubtable(L, LUA_REGISTRYINDEX, CLIBS); /* create CLIBS table */ - lua_createtable(L, 0, 1); /* create metatable for CLIBS */ - lua_pushcfunction(L, gctm); - lua_setfield(L, -2, "__gc"); /* set finalizer for CLIBS table */ - lua_setmetatable(L, -2); -} - - -LUAMOD_API int luaopen_package (lua_State *L) { - createclibstable(L); - luaL_newlib(L, pk_funcs); /* create 'package' table */ - createsearcherstable(L); - /* set paths */ - setpath(L, "path", LUA_PATH_VAR, LUA_PATH_DEFAULT); - setpath(L, "cpath", LUA_CPATH_VAR, LUA_CPATH_DEFAULT); - /* store config information */ - lua_pushliteral(L, LUA_DIRSEP "\n" LUA_PATH_SEP "\n" LUA_PATH_MARK "\n" - LUA_EXEC_DIR "\n" LUA_IGMARK "\n"); - lua_setfield(L, -2, "config"); - /* set field 'loaded' */ - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_setfield(L, -2, "loaded"); - /* set field 'preload' */ - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - lua_setfield(L, -2, "preload"); - lua_pushglobaltable(L); - lua_pushvalue(L, -2); /* set 'package' as upvalue for next lib */ - luaL_setfuncs(L, ll_funcs, 1); /* open lib into global table */ - lua_pop(L, 1); /* pop global table */ - return 1; /* return 'package' table */ -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lobject.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lobject.c deleted file mode 100644 index 45a2731..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lobject.c +++ /dev/null @@ -1,659 +0,0 @@ -/* -** $Id: lobject.c $ -** Some generic functions over Lua objects -** See Copyright Notice in lua.h -*/ - -#define lobject_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lctype.h" -#include "ldebug.h" -#include "ldo.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "lvm.h" - - -/* -** Computes ceil(log2(x)) -*/ -int luaO_ceillog2 (unsigned int x) { - static const lu_byte log_2[256] = { /* log_2[i - 1] = ceil(log2(i)) */ - 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, - 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, - 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, - 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8 - }; - int l = 0; - x--; - while (x >= 256) { l += 8; x >>= 8; } - return l + log_2[x]; -} - -/* -** Encodes 'p'% as a floating-point byte, represented as (eeeexxxx). -** The exponent is represented using excess-7. Mimicking IEEE 754, the -** representation normalizes the number when possible, assuming an extra -** 1 before the mantissa (xxxx) and adding one to the exponent (eeee) -** to signal that. So, the real value is (1xxxx) * 2^(eeee - 7 - 1) if -** eeee != 0, and (xxxx) * 2^-7 otherwise (subnormal numbers). -*/ -unsigned int luaO_codeparam (unsigned int p) { - if (p >= (cast(lu_mem, 0x1F) << (0xF - 7 - 1)) * 100u) /* overflow? */ - return 0xFF; /* return maximum value */ - else { - p = (cast(l_uint32, p) * 128 + 99) / 100; /* round up the division */ - if (p < 0x10) /* subnormal number? */ - return p; /* exponent bits are already zero; nothing else to do */ - else { - int log = luaO_ceillog2(p + 1) - 5; /* preserve 5 bits */ - return ((p >> log) - 0x10) | ((log + 1) << 4); - } - } -} - - -/* -** Computes 'p' times 'x', where 'p' is a floating-point byte. Roughly, -** we have to multiply 'x' by the mantissa and then shift accordingly to -** the exponent. If the exponent is positive, both the multiplication -** and the shift increase 'x', so we have to care only about overflows. -** For negative exponents, however, multiplying before the shift keeps -** more significant bits, as long as the multiplication does not -** overflow, so we check which order is best. -*/ -l_obj luaO_applyparam (unsigned int p, l_obj x) { - unsigned int m = p & 0xF; /* mantissa */ - int e = (p >> 4); /* exponent */ - if (e > 0) { /* normalized? */ - e--; /* correct exponent */ - m += 0x10; /* correct mantissa; maximum value is 0x1F */ - } - e -= 7; /* correct excess-7 */ - if (e >= 0) { - if (x < (MAX_LOBJ / 0x1F) >> e) /* no overflow? */ - return (x * m) << e; /* order doesn't matter here */ - else /* real overflow */ - return MAX_LOBJ; - } - else { /* negative exponent */ - e = -e; - if (x < MAX_LOBJ / 0x1F) /* multiplication cannot overflow? */ - return (x * m) >> e; /* multiplying first gives more precision */ - else if ((x >> e) < MAX_LOBJ / 0x1F) /* cannot overflow after shift? */ - return (x >> e) * m; - else /* real overflow */ - return MAX_LOBJ; - } -} - - -static lua_Integer intarith (lua_State *L, int op, lua_Integer v1, - lua_Integer v2) { - switch (op) { - case LUA_OPADD: return intop(+, v1, v2); - case LUA_OPSUB:return intop(-, v1, v2); - case LUA_OPMUL:return intop(*, v1, v2); - case LUA_OPMOD: return luaV_mod(L, v1, v2); - case LUA_OPIDIV: return luaV_idiv(L, v1, v2); - case LUA_OPBAND: return intop(&, v1, v2); - case LUA_OPBOR: return intop(|, v1, v2); - case LUA_OPBXOR: return intop(^, v1, v2); - case LUA_OPSHL: return luaV_shiftl(v1, v2); - case LUA_OPSHR: return luaV_shiftr(v1, v2); - case LUA_OPUNM: return intop(-, 0, v1); - case LUA_OPBNOT: return intop(^, ~l_castS2U(0), v1); - default: lua_assert(0); return 0; - } -} - - -static lua_Number numarith (lua_State *L, int op, lua_Number v1, - lua_Number v2) { - switch (op) { - case LUA_OPADD: return luai_numadd(L, v1, v2); - case LUA_OPSUB: return luai_numsub(L, v1, v2); - case LUA_OPMUL: return luai_nummul(L, v1, v2); - case LUA_OPDIV: return luai_numdiv(L, v1, v2); - case LUA_OPPOW: return luai_numpow(L, v1, v2); - case LUA_OPIDIV: return luai_numidiv(L, v1, v2); - case LUA_OPUNM: return luai_numunm(L, v1); - case LUA_OPMOD: return luaV_modf(L, v1, v2); - default: lua_assert(0); return 0; - } -} - - -int luaO_rawarith (lua_State *L, int op, const TValue *p1, const TValue *p2, - TValue *res) { - switch (op) { - case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: - case LUA_OPSHL: case LUA_OPSHR: - case LUA_OPBNOT: { /* operate only on integers */ - lua_Integer i1; lua_Integer i2; - if (tointegerns(p1, &i1) && tointegerns(p2, &i2)) { - setivalue(res, intarith(L, op, i1, i2)); - return 1; - } - else return 0; /* fail */ - } - case LUA_OPDIV: case LUA_OPPOW: { /* operate only on floats */ - lua_Number n1; lua_Number n2; - if (tonumberns(p1, n1) && tonumberns(p2, n2)) { - setfltvalue(res, numarith(L, op, n1, n2)); - return 1; - } - else return 0; /* fail */ - } - default: { /* other operations */ - lua_Number n1; lua_Number n2; - if (ttisinteger(p1) && ttisinteger(p2)) { - setivalue(res, intarith(L, op, ivalue(p1), ivalue(p2))); - return 1; - } - else if (tonumberns(p1, n1) && tonumberns(p2, n2)) { - setfltvalue(res, numarith(L, op, n1, n2)); - return 1; - } - else return 0; /* fail */ - } - } -} - - -void luaO_arith (lua_State *L, int op, const TValue *p1, const TValue *p2, - StkId res) { - if (!luaO_rawarith(L, op, p1, p2, s2v(res))) { - /* could not perform raw operation; try metamethod */ - luaT_trybinTM(L, p1, p2, res, cast(TMS, (op - LUA_OPADD) + TM_ADD)); - } -} - - -int luaO_hexavalue (int c) { - if (lisdigit(c)) return c - '0'; - else return (ltolower(c) - 'a') + 10; -} - - -static int isneg (const char **s) { - if (**s == '-') { (*s)++; return 1; } - else if (**s == '+') (*s)++; - return 0; -} - - - -/* -** {================================================================== -** Lua's implementation for 'lua_strx2number' -** =================================================================== -*/ - -#if !defined(lua_strx2number) - -/* maximum number of significant digits to read (to avoid overflows - even with single floats) */ -#define MAXSIGDIG 30 - -/* -** convert a hexadecimal numeric string to a number, following -** C99 specification for 'strtod' -*/ -static lua_Number lua_strx2number (const char *s, char **endptr) { - int dot = lua_getlocaledecpoint(); - lua_Number r = l_mathop(0.0); /* result (accumulator) */ - int sigdig = 0; /* number of significant digits */ - int nosigdig = 0; /* number of non-significant digits */ - int e = 0; /* exponent correction */ - int neg; /* 1 if number is negative */ - int hasdot = 0; /* true after seen a dot */ - *endptr = cast_charp(s); /* nothing is valid yet */ - while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */ - neg = isneg(&s); /* check sign */ - if (!(*s == '0' && (*(s + 1) == 'x' || *(s + 1) == 'X'))) /* check '0x' */ - return l_mathop(0.0); /* invalid format (no '0x') */ - for (s += 2; ; s++) { /* skip '0x' and read numeral */ - if (*s == dot) { - if (hasdot) break; /* second dot? stop loop */ - else hasdot = 1; - } - else if (lisxdigit(cast_uchar(*s))) { - if (sigdig == 0 && *s == '0') /* non-significant digit (zero)? */ - nosigdig++; - else if (++sigdig <= MAXSIGDIG) /* can read it without overflow? */ - r = (r * l_mathop(16.0)) + luaO_hexavalue(*s); - else e++; /* too many digits; ignore, but still count for exponent */ - if (hasdot) e--; /* decimal digit? correct exponent */ - } - else break; /* neither a dot nor a digit */ - } - if (nosigdig + sigdig == 0) /* no digits? */ - return l_mathop(0.0); /* invalid format */ - *endptr = cast_charp(s); /* valid up to here */ - e *= 4; /* each digit multiplies/divides value by 2^4 */ - if (*s == 'p' || *s == 'P') { /* exponent part? */ - int exp1 = 0; /* exponent value */ - int neg1; /* exponent sign */ - s++; /* skip 'p' */ - neg1 = isneg(&s); /* sign */ - if (!lisdigit(cast_uchar(*s))) - return l_mathop(0.0); /* invalid; must have at least one digit */ - while (lisdigit(cast_uchar(*s))) /* read exponent */ - exp1 = exp1 * 10 + *(s++) - '0'; - if (neg1) exp1 = -exp1; - e += exp1; - *endptr = cast_charp(s); /* valid up to here */ - } - if (neg) r = -r; - return l_mathop(ldexp)(r, e); -} - -#endif -/* }====================================================== */ - - -/* maximum length of a numeral to be converted to a number */ -#if !defined (L_MAXLENNUM) -#define L_MAXLENNUM 200 -#endif - -/* -** Convert string 's' to a Lua number (put in 'result'). Return NULL on -** fail or the address of the ending '\0' on success. ('mode' == 'x') -** means a hexadecimal numeral. -*/ -static const char *l_str2dloc (const char *s, lua_Number *result, int mode) { - char *endptr; - *result = (mode == 'x') ? lua_strx2number(s, &endptr) /* try to convert */ - : lua_str2number(s, &endptr); - if (endptr == s) return NULL; /* nothing recognized? */ - while (lisspace(cast_uchar(*endptr))) endptr++; /* skip trailing spaces */ - return (*endptr == '\0') ? endptr : NULL; /* OK iff no trailing chars */ -} - - -/* -** Convert string 's' to a Lua number (put in 'result') handling the -** current locale. -** This function accepts both the current locale or a dot as the radix -** mark. If the conversion fails, it may mean number has a dot but -** locale accepts something else. In that case, the code copies 's' -** to a buffer (because 's' is read-only), changes the dot to the -** current locale radix mark, and tries to convert again. -** The variable 'mode' checks for special characters in the string: -** - 'n' means 'inf' or 'nan' (which should be rejected) -** - 'x' means a hexadecimal numeral -** - '.' just optimizes the search for the common case (no special chars) -*/ -static const char *l_str2d (const char *s, lua_Number *result) { - const char *endptr; - const char *pmode = strpbrk(s, ".xXnN"); /* look for special chars */ - int mode = pmode ? ltolower(cast_uchar(*pmode)) : 0; - if (mode == 'n') /* reject 'inf' and 'nan' */ - return NULL; - endptr = l_str2dloc(s, result, mode); /* try to convert */ - if (endptr == NULL) { /* failed? may be a different locale */ - char buff[L_MAXLENNUM + 1]; - const char *pdot = strchr(s, '.'); - if (pdot == NULL || strlen(s) > L_MAXLENNUM) - return NULL; /* string too long or no dot; fail */ - strcpy(buff, s); /* copy string to buffer */ - buff[pdot - s] = lua_getlocaledecpoint(); /* correct decimal point */ - endptr = l_str2dloc(buff, result, mode); /* try again */ - if (endptr != NULL) - endptr = s + (endptr - buff); /* make relative to 's' */ - } - return endptr; -} - - -#define MAXBY10 cast(lua_Unsigned, LUA_MAXINTEGER / 10) -#define MAXLASTD cast_int(LUA_MAXINTEGER % 10) - -static const char *l_str2int (const char *s, lua_Integer *result) { - lua_Unsigned a = 0; - int empty = 1; - int neg; - while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */ - neg = isneg(&s); - if (s[0] == '0' && - (s[1] == 'x' || s[1] == 'X')) { /* hex? */ - s += 2; /* skip '0x' */ - for (; lisxdigit(cast_uchar(*s)); s++) { - a = a * 16 + luaO_hexavalue(*s); - empty = 0; - } - } - else { /* decimal */ - for (; lisdigit(cast_uchar(*s)); s++) { - int d = *s - '0'; - if (a >= MAXBY10 && (a > MAXBY10 || d > MAXLASTD + neg)) /* overflow? */ - return NULL; /* do not accept it (as integer) */ - a = a * 10 + d; - empty = 0; - } - } - while (lisspace(cast_uchar(*s))) s++; /* skip trailing spaces */ - if (empty || *s != '\0') return NULL; /* something wrong in the numeral */ - else { - *result = l_castU2S((neg) ? 0u - a : a); - return s; - } -} - - -size_t luaO_str2num (const char *s, TValue *o) { - lua_Integer i; lua_Number n; - const char *e; - if ((e = l_str2int(s, &i)) != NULL) { /* try as an integer */ - setivalue(o, i); - } - else if ((e = l_str2d(s, &n)) != NULL) { /* else try as a float */ - setfltvalue(o, n); - } - else - return 0; /* conversion failed */ - return (e - s) + 1; /* success; return string size */ -} - - -int luaO_utf8esc (char *buff, unsigned long x) { - int n = 1; /* number of bytes put in buffer (backwards) */ - lua_assert(x <= 0x7FFFFFFFu); - if (x < 0x80) /* ascii? */ - buff[UTF8BUFFSZ - 1] = cast_char(x); - else { /* need continuation bytes */ - unsigned int mfb = 0x3f; /* maximum that fits in first byte */ - do { /* add continuation bytes */ - buff[UTF8BUFFSZ - (n++)] = cast_char(0x80 | (x & 0x3f)); - x >>= 6; /* remove added bits */ - mfb >>= 1; /* now there is one less bit available in first byte */ - } while (x > mfb); /* still needs continuation byte? */ - buff[UTF8BUFFSZ - n] = cast_char((~mfb << 1) | x); /* add first byte */ - } - return n; -} - - -/* -** Maximum length of the conversion of a number to a string. Must be -** enough to accommodate both LUA_INTEGER_FMT and LUA_NUMBER_FMT. -** (For a long long int, this is 19 digits plus a sign and a final '\0', -** adding to 21. For a long double, it can go to a sign, 33 digits, -** the dot, an exponent letter, an exponent sign, 5 exponent digits, -** and a final '\0', adding to 43.) -*/ -#define MAXNUMBER2STR 44 - - -/* -** Convert a number object to a string, adding it to a buffer -*/ -static int tostringbuff (TValue *obj, char *buff) { - int len; - lua_assert(ttisnumber(obj)); - if (ttisinteger(obj)) - len = lua_integer2str(buff, MAXNUMBER2STR, ivalue(obj)); - else { - len = lua_number2str(buff, MAXNUMBER2STR, fltvalue(obj)); - if (buff[strspn(buff, "-0123456789")] == '\0') { /* looks like an int? */ - buff[len++] = lua_getlocaledecpoint(); - buff[len++] = '0'; /* adds '.0' to result */ - } - } - return len; -} - - -/* -** Convert a number object to a Lua string, replacing the value at 'obj' -*/ -void luaO_tostring (lua_State *L, TValue *obj) { - char buff[MAXNUMBER2STR]; - int len = tostringbuff(obj, buff); - setsvalue(L, obj, luaS_newlstr(L, buff, len)); -} - - - - -/* -** {================================================================== -** 'luaO_pushvfstring' -** =================================================================== -*/ - -/* -** Size for buffer space used by 'luaO_pushvfstring'. It should be -** (LUA_IDSIZE + MAXNUMBER2STR) + a minimal space for basic messages, -** so that 'luaG_addinfo' can work directly on the buffer. -*/ -#define BUFVFS (LUA_IDSIZE + MAXNUMBER2STR + 95) - -/* buffer used by 'luaO_pushvfstring' */ -typedef struct BuffFS { - lua_State *L; - int pushed; /* true if there is a part of the result on the stack */ - int blen; /* length of partial string in 'space' */ - char space[BUFVFS]; /* holds last part of the result */ -} BuffFS; - - -/* -** Push given string to the stack, as part of the result, and -** join it to previous partial result if there is one. -** It may call 'luaV_concat' while using one slot from EXTRA_STACK. -** This call cannot invoke metamethods, as both operands must be -** strings. It can, however, raise an error if the result is too -** long. In that case, 'luaV_concat' frees the extra slot before -** raising the error. -*/ -static void pushstr (BuffFS *buff, const char *str, size_t lstr) { - lua_State *L = buff->L; - setsvalue2s(L, L->top.p, luaS_newlstr(L, str, lstr)); - L->top.p++; /* may use one slot from EXTRA_STACK */ - if (!buff->pushed) /* no previous string on the stack? */ - buff->pushed = 1; /* now there is one */ - else /* join previous string with new one */ - luaV_concat(L, 2); -} - - -/* -** empty the buffer space into the stack -*/ -static void clearbuff (BuffFS *buff) { - pushstr(buff, buff->space, buff->blen); /* push buffer contents */ - buff->blen = 0; /* space now is empty */ -} - - -/* -** Get a space of size 'sz' in the buffer. If buffer has not enough -** space, empty it. 'sz' must fit in an empty buffer. -*/ -static char *getbuff (BuffFS *buff, int sz) { - lua_assert(buff->blen <= BUFVFS); lua_assert(sz <= BUFVFS); - if (sz > BUFVFS - buff->blen) /* not enough space? */ - clearbuff(buff); - return buff->space + buff->blen; -} - - -#define addsize(b,sz) ((b)->blen += (sz)) - - -/* -** Add 'str' to the buffer. If string is larger than the buffer space, -** push the string directly to the stack. -*/ -static void addstr2buff (BuffFS *buff, const char *str, size_t slen) { - if (slen <= BUFVFS) { /* does string fit into buffer? */ - char *bf = getbuff(buff, cast_int(slen)); - memcpy(bf, str, slen); /* add string to buffer */ - addsize(buff, cast_int(slen)); - } - else { /* string larger than buffer */ - clearbuff(buff); /* string comes after buffer's content */ - pushstr(buff, str, slen); /* push string */ - } -} - - -/* -** Add a numeral to the buffer. -*/ -static void addnum2buff (BuffFS *buff, TValue *num) { - char *numbuff = getbuff(buff, MAXNUMBER2STR); - int len = tostringbuff(num, numbuff); /* format number into 'numbuff' */ - addsize(buff, len); -} - - -/* -** this function handles only '%d', '%c', '%f', '%p', '%s', and '%%' - conventional formats, plus Lua-specific '%I' and '%U' -*/ -const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) { - BuffFS buff; /* holds last part of the result */ - const char *e; /* points to next '%' */ - buff.pushed = buff.blen = 0; - buff.L = L; - while ((e = strchr(fmt, '%')) != NULL) { - addstr2buff(&buff, fmt, e - fmt); /* add 'fmt' up to '%' */ - switch (*(e + 1)) { /* conversion specifier */ - case 's': { /* zero-terminated string */ - const char *s = va_arg(argp, char *); - if (s == NULL) s = "(null)"; - addstr2buff(&buff, s, strlen(s)); - break; - } - case 'c': { /* an 'int' as a character */ - char c = cast_uchar(va_arg(argp, int)); - addstr2buff(&buff, &c, sizeof(char)); - break; - } - case 'd': { /* an 'int' */ - TValue num; - setivalue(&num, va_arg(argp, int)); - addnum2buff(&buff, &num); - break; - } - case 'I': { /* a 'lua_Integer' */ - TValue num; - setivalue(&num, cast(lua_Integer, va_arg(argp, l_uacInt))); - addnum2buff(&buff, &num); - break; - } - case 'f': { /* a 'lua_Number' */ - TValue num; - setfltvalue(&num, cast_num(va_arg(argp, l_uacNumber))); - addnum2buff(&buff, &num); - break; - } - case 'p': { /* a pointer */ - const int sz = 3 * sizeof(void*) + 8; /* enough space for '%p' */ - char *bf = getbuff(&buff, sz); - void *p = va_arg(argp, void *); - int len = lua_pointer2str(bf, sz, p); - addsize(&buff, len); - break; - } - case 'U': { /* a 'long' as a UTF-8 sequence */ - char bf[UTF8BUFFSZ]; - int len = luaO_utf8esc(bf, va_arg(argp, long)); - addstr2buff(&buff, bf + UTF8BUFFSZ - len, len); - break; - } - case '%': { - addstr2buff(&buff, "%", 1); - break; - } - default: { - luaG_runerror(L, "invalid option '%%%c' to 'lua_pushfstring'", - *(e + 1)); - } - } - fmt = e + 2; /* skip '%' and the specifier */ - } - addstr2buff(&buff, fmt, strlen(fmt)); /* rest of 'fmt' */ - clearbuff(&buff); /* empty buffer into the stack */ - lua_assert(buff.pushed == 1); - return getstr(tsvalue(s2v(L->top.p - 1))); -} - - -const char *luaO_pushfstring (lua_State *L, const char *fmt, ...) { - const char *msg; - va_list argp; - va_start(argp, fmt); - msg = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - return msg; -} - -/* }================================================================== */ - - -#define RETS "..." -#define PRE "[string \"" -#define POS "\"]" - -#define addstr(a,b,l) ( memcpy(a,b,(l) * sizeof(char)), a += (l) ) - -void luaO_chunkid (char *out, const char *source, size_t srclen) { - size_t bufflen = LUA_IDSIZE; /* free space in buffer */ - if (*source == '=') { /* 'literal' source */ - if (srclen <= bufflen) /* small enough? */ - memcpy(out, source + 1, srclen * sizeof(char)); - else { /* truncate it */ - addstr(out, source + 1, bufflen - 1); - *out = '\0'; - } - } - else if (*source == '@') { /* file name */ - if (srclen <= bufflen) /* small enough? */ - memcpy(out, source + 1, srclen * sizeof(char)); - else { /* add '...' before rest of name */ - addstr(out, RETS, LL(RETS)); - bufflen -= LL(RETS); - memcpy(out, source + 1 + srclen - bufflen, bufflen * sizeof(char)); - } - } - else { /* string; format as [string "source"] */ - const char *nl = strchr(source, '\n'); /* find first new line (if any) */ - addstr(out, PRE, LL(PRE)); /* add prefix */ - bufflen -= LL(PRE RETS POS) + 1; /* save space for prefix+suffix+'\0' */ - if (srclen < bufflen && nl == NULL) { /* small one-line source? */ - addstr(out, source, srclen); /* keep it */ - } - else { - if (nl != NULL) srclen = nl - source; /* stop at first newline */ - if (srclen > bufflen) srclen = bufflen; - addstr(out, source, srclen); - addstr(out, RETS, LL(RETS)); - } - memcpy(out, POS, (LL(POS) + 1) * sizeof(char)); - } -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lobject.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lobject.h deleted file mode 100644 index 169512f..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lobject.h +++ /dev/null @@ -1,857 +0,0 @@ -/* -** $Id: lobject.h $ -** Type definitions for Lua objects -** See Copyright Notice in lua.h -*/ - - -#ifndef lobject_h -#define lobject_h - - -#include - - -#include "llimits.h" -#include "lua.h" - - -/* -** Extra types for collectable non-values -*/ -#define LUA_TUPVAL LUA_NUMTYPES /* upvalues */ -#define LUA_TPROTO (LUA_NUMTYPES+1) /* function prototypes */ -#define LUA_TDEADKEY (LUA_NUMTYPES+2) /* removed keys in tables */ - - - -/* -** number of all possible types (including LUA_TNONE but excluding DEADKEY) -*/ -#define LUA_TOTALTYPES (LUA_TPROTO + 2) - - -/* -** tags for Tagged Values have the following use of bits: -** bits 0-3: actual tag (a LUA_T* constant) -** bits 4-5: variant bits -** bit 6: whether value is collectable -*/ - -/* add variant bits to a type */ -#define makevariant(t,v) ((t) | ((v) << 4)) - - - -/* -** Union of all Lua values -*/ -typedef union Value { - struct GCObject *gc; /* collectable objects */ - void *p; /* light userdata */ - lua_CFunction f; /* light C functions */ - lua_Integer i; /* integer numbers */ - lua_Number n; /* float numbers */ - /* not used, but may avoid warnings for uninitialized value */ - lu_byte ub; -} Value; - - -/* -** Tagged Values. This is the basic representation of values in Lua: -** an actual value plus a tag with its type. -*/ - -#define TValuefields Value value_; lu_byte tt_ - -typedef struct TValue { - TValuefields; -} TValue; - - -#define val_(o) ((o)->value_) -#define valraw(o) (val_(o)) - - -/* raw type tag of a TValue */ -#define rawtt(o) ((o)->tt_) - -/* tag with no variants (bits 0-3) */ -#define novariant(t) ((t) & 0x0F) - -/* type tag of a TValue (bits 0-3 for tags + variant bits 4-5) */ -#define withvariant(t) ((t) & 0x3F) -#define ttypetag(o) withvariant(rawtt(o)) - -/* type of a TValue */ -#define ttype(o) (novariant(rawtt(o))) - - -/* Macros to test type */ -#define checktag(o,t) (rawtt(o) == (t)) -#define checktype(o,t) (ttype(o) == (t)) - - -/* Macros for internal tests */ - -/* collectable object has the same tag as the original value */ -#define righttt(obj) (ttypetag(obj) == gcvalue(obj)->tt) - -/* -** Any value being manipulated by the program either is non -** collectable, or the collectable object has the right tag -** and it is not dead. The option 'L == NULL' allows other -** macros using this one to be used where L is not available. -*/ -#define checkliveness(L,obj) \ - ((void)L, lua_longassert(!iscollectable(obj) || \ - (righttt(obj) && (L == NULL || !isdead(G(L),gcvalue(obj)))))) - - -/* Macros to set values */ - -/* set a value's tag */ -#define settt_(o,t) ((o)->tt_=(t)) - - -/* main macro to copy values (from 'obj2' to 'obj1') */ -#define setobj(L,obj1,obj2) \ - { TValue *io1=(obj1); const TValue *io2=(obj2); \ - io1->value_ = io2->value_; settt_(io1, io2->tt_); \ - checkliveness(L,io1); lua_assert(!isnonstrictnil(io1)); } - -/* -** Different types of assignments, according to source and destination. -** (They are mostly equal now, but may be different in the future.) -*/ - -/* from stack to stack */ -#define setobjs2s(L,o1,o2) setobj(L,s2v(o1),s2v(o2)) -/* to stack (not from same stack) */ -#define setobj2s(L,o1,o2) setobj(L,s2v(o1),o2) -/* from table to same table */ -#define setobjt2t setobj -/* to new object */ -#define setobj2n setobj -/* to table */ -#define setobj2t setobj - - -/* -** Entries in a Lua stack. Field 'tbclist' forms a list of all -** to-be-closed variables active in this stack. Dummy entries are -** used when the distance between two tbc variables does not fit -** in an unsigned short. They are represented by delta==0, and -** their real delta is always the maximum value that fits in -** that field. -*/ -typedef union StackValue { - TValue val; - struct { - TValuefields; - unsigned short delta; - } tbclist; -} StackValue; - - -/* index to stack elements */ -typedef StackValue *StkId; - - -/* -** When reallocating the stack, change all pointers to the stack into -** proper offsets. -*/ -typedef union { - StkId p; /* actual pointer */ - ptrdiff_t offset; /* used while the stack is being reallocated */ -} StkIdRel; - - -/* convert a 'StackValue' to a 'TValue' */ -#define s2v(o) (&(o)->val) - - - -/* -** {================================================================== -** Nil -** =================================================================== -*/ - -/* Standard nil */ -#define LUA_VNIL makevariant(LUA_TNIL, 0) - -/* Empty slot (which might be different from a slot containing nil) */ -#define LUA_VEMPTY makevariant(LUA_TNIL, 1) - -/* Value returned for a key not found in a table (absent key) */ -#define LUA_VABSTKEY makevariant(LUA_TNIL, 2) - -/* Special variant to signal that a fast get is accessing a non-table */ -#define LUA_VNOTABLE makevariant(LUA_TNIL, 3) - - -/* macro to test for (any kind of) nil */ -#define ttisnil(v) checktype((v), LUA_TNIL) - -/* -** Macro to test the result of a table access. Formally, it should -** distinguish between LUA_VEMPTY/LUA_VABSTKEY/LUA_VNOTABLE and -** other tags. As currently nil is equivalent to LUA_VEMPTY, it is -** simpler to just test whether the value is nil. -*/ -#define tagisempty(tag) (novariant(tag) == LUA_TNIL) - - -/* macro to test for a standard nil */ -#define ttisstrictnil(o) checktag((o), LUA_VNIL) - - -#define setnilvalue(obj) settt_(obj, LUA_VNIL) - - -#define isabstkey(v) checktag((v), LUA_VABSTKEY) - - -/* -** macro to detect non-standard nils (used only in assertions) -*/ -#define isnonstrictnil(v) (ttisnil(v) && !ttisstrictnil(v)) - - -/* -** By default, entries with any kind of nil are considered empty. -** (In any definition, values associated with absent keys must also -** be accepted as empty.) -*/ -#define isempty(v) ttisnil(v) - - -/* macro defining a value corresponding to an absent key */ -#define ABSTKEYCONSTANT {NULL}, LUA_VABSTKEY - - -/* mark an entry as empty */ -#define setempty(v) settt_(v, LUA_VEMPTY) - - - -/* }================================================================== */ - - -/* -** {================================================================== -** Booleans -** =================================================================== -*/ - - -#define LUA_VFALSE makevariant(LUA_TBOOLEAN, 0) -#define LUA_VTRUE makevariant(LUA_TBOOLEAN, 1) - -#define ttisboolean(o) checktype((o), LUA_TBOOLEAN) -#define ttisfalse(o) checktag((o), LUA_VFALSE) -#define ttistrue(o) checktag((o), LUA_VTRUE) - - -#define l_isfalse(o) (ttisfalse(o) || ttisnil(o)) -#define tagisfalse(t) ((t) == LUA_VFALSE || novariant(t) == LUA_TNIL) - - - -#define setbfvalue(obj) settt_(obj, LUA_VFALSE) -#define setbtvalue(obj) settt_(obj, LUA_VTRUE) - -/* }================================================================== */ - - -/* -** {================================================================== -** Threads -** =================================================================== -*/ - -#define LUA_VTHREAD makevariant(LUA_TTHREAD, 0) - -#define ttisthread(o) checktag((o), ctb(LUA_VTHREAD)) - -#define thvalue(o) check_exp(ttisthread(o), gco2th(val_(o).gc)) - -#define setthvalue(L,obj,x) \ - { TValue *io = (obj); lua_State *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTHREAD)); \ - checkliveness(L,io); } - -#define setthvalue2s(L,o,t) setthvalue(L,s2v(o),t) - -/* }================================================================== */ - - -/* -** {================================================================== -** Collectable Objects -** =================================================================== -*/ - -/* -** Common Header for all collectable objects (in macro form, to be -** included in other objects) -*/ -#define CommonHeader struct GCObject *next; lu_byte tt; lu_byte marked - - -/* Common type for all collectable objects */ -typedef struct GCObject { - CommonHeader; -} GCObject; - - -/* Bit mark for collectable types */ -#define BIT_ISCOLLECTABLE (1 << 6) - -#define iscollectable(o) (rawtt(o) & BIT_ISCOLLECTABLE) - -/* mark a tag as collectable */ -#define ctb(t) ((t) | BIT_ISCOLLECTABLE) - -#define gcvalue(o) check_exp(iscollectable(o), val_(o).gc) - -#define gcvalueraw(v) ((v).gc) - -#define setgcovalue(L,obj,x) \ - { TValue *io = (obj); GCObject *i_g=(x); \ - val_(io).gc = i_g; settt_(io, ctb(i_g->tt)); } - -/* }================================================================== */ - - -/* -** {================================================================== -** Numbers -** =================================================================== -*/ - -/* Variant tags for numbers */ -#define LUA_VNUMINT makevariant(LUA_TNUMBER, 0) /* integer numbers */ -#define LUA_VNUMFLT makevariant(LUA_TNUMBER, 1) /* float numbers */ - -#define ttisnumber(o) checktype((o), LUA_TNUMBER) -#define ttisfloat(o) checktag((o), LUA_VNUMFLT) -#define ttisinteger(o) checktag((o), LUA_VNUMINT) - -#define nvalue(o) check_exp(ttisnumber(o), \ - (ttisinteger(o) ? cast_num(ivalue(o)) : fltvalue(o))) -#define fltvalue(o) check_exp(ttisfloat(o), val_(o).n) -#define ivalue(o) check_exp(ttisinteger(o), val_(o).i) - -#define fltvalueraw(v) ((v).n) -#define ivalueraw(v) ((v).i) - -#define setfltvalue(obj,x) \ - { TValue *io=(obj); val_(io).n=(x); settt_(io, LUA_VNUMFLT); } - -#define chgfltvalue(obj,x) \ - { TValue *io=(obj); lua_assert(ttisfloat(io)); val_(io).n=(x); } - -#define setivalue(obj,x) \ - { TValue *io=(obj); val_(io).i=(x); settt_(io, LUA_VNUMINT); } - -#define chgivalue(obj,x) \ - { TValue *io=(obj); lua_assert(ttisinteger(io)); val_(io).i=(x); } - -/* }================================================================== */ - - -/* -** {================================================================== -** Strings -** =================================================================== -*/ - -/* Variant tags for strings */ -#define LUA_VSHRSTR makevariant(LUA_TSTRING, 0) /* short strings */ -#define LUA_VLNGSTR makevariant(LUA_TSTRING, 1) /* long strings */ - -#define ttisstring(o) checktype((o), LUA_TSTRING) -#define ttisshrstring(o) checktag((o), ctb(LUA_VSHRSTR)) -#define ttislngstring(o) checktag((o), ctb(LUA_VLNGSTR)) - -#define tsvalueraw(v) (gco2ts((v).gc)) - -#define tsvalue(o) check_exp(ttisstring(o), gco2ts(val_(o).gc)) - -#define setsvalue(L,obj,x) \ - { TValue *io = (obj); TString *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(x_->tt)); \ - checkliveness(L,io); } - -/* set a string to the stack */ -#define setsvalue2s(L,o,s) setsvalue(L,s2v(o),s) - -/* set a string to a new object */ -#define setsvalue2n setsvalue - - -/* Kinds of long strings (stored in 'shrlen') */ -#define LSTRREG -1 /* regular long string */ -#define LSTRFIX -2 /* fixed external long string */ -#define LSTRMEM -3 /* external long string with deallocation */ - - -/* -** Header for a string value. -*/ -typedef struct TString { - CommonHeader; - lu_byte extra; /* reserved words for short strings; "has hash" for longs */ - ls_byte shrlen; /* length for short strings, negative for long strings */ - unsigned int hash; - union { - size_t lnglen; /* length for long strings */ - struct TString *hnext; /* linked list for hash table */ - } u; - char *contents; /* pointer to content in long strings */ - lua_Alloc falloc; /* deallocation function for external strings */ - void *ud; /* user data for external strings */ -} TString; - - -#define strisshr(ts) ((ts)->shrlen >= 0) - - -/* -** Get the actual string (array of bytes) from a 'TString'. (Generic -** version and specialized versions for long and short strings.) -*/ -#define rawgetshrstr(ts) (cast_charp(&(ts)->contents)) -#define getshrstr(ts) check_exp(strisshr(ts), rawgetshrstr(ts)) -#define getlngstr(ts) check_exp(!strisshr(ts), (ts)->contents) -#define getstr(ts) (strisshr(ts) ? rawgetshrstr(ts) : (ts)->contents) - - -/* get string length from 'TString *ts' */ -#define tsslen(ts) \ - (strisshr(ts) ? cast_uint((ts)->shrlen) : (ts)->u.lnglen) - -/* -** Get string and length */ -#define getlstr(ts, len) \ - (strisshr(ts) \ - ? (cast_void((len) = (ts)->shrlen), rawgetshrstr(ts)) \ - : (cast_void((len) = (ts)->u.lnglen), (ts)->contents)) - -/* }================================================================== */ - - -/* -** {================================================================== -** Userdata -** =================================================================== -*/ - - -/* -** Light userdata should be a variant of userdata, but for compatibility -** reasons they are also different types. -*/ -#define LUA_VLIGHTUSERDATA makevariant(LUA_TLIGHTUSERDATA, 0) - -#define LUA_VUSERDATA makevariant(LUA_TUSERDATA, 0) - -#define ttislightuserdata(o) checktag((o), LUA_VLIGHTUSERDATA) -#define ttisfulluserdata(o) checktag((o), ctb(LUA_VUSERDATA)) - -#define pvalue(o) check_exp(ttislightuserdata(o), val_(o).p) -#define uvalue(o) check_exp(ttisfulluserdata(o), gco2u(val_(o).gc)) - -#define pvalueraw(v) ((v).p) - -#define setpvalue(obj,x) \ - { TValue *io=(obj); val_(io).p=(x); settt_(io, LUA_VLIGHTUSERDATA); } - -#define setuvalue(L,obj,x) \ - { TValue *io = (obj); Udata *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VUSERDATA)); \ - checkliveness(L,io); } - - -/* Ensures that addresses after this type are always fully aligned. */ -typedef union UValue { - TValue uv; - LUAI_MAXALIGN; /* ensures maximum alignment for udata bytes */ -} UValue; - - -/* -** Header for userdata with user values; -** memory area follows the end of this structure. -*/ -typedef struct Udata { - CommonHeader; - unsigned short nuvalue; /* number of user values */ - size_t len; /* number of bytes */ - struct Table *metatable; - GCObject *gclist; - UValue uv[1]; /* user values */ -} Udata; - - -/* -** Header for userdata with no user values. These userdata do not need -** to be gray during GC, and therefore do not need a 'gclist' field. -** To simplify, the code always use 'Udata' for both kinds of userdata, -** making sure it never accesses 'gclist' on userdata with no user values. -** This structure here is used only to compute the correct size for -** this representation. (The 'bindata' field in its end ensures correct -** alignment for binary data following this header.) -*/ -typedef struct Udata0 { - CommonHeader; - unsigned short nuvalue; /* number of user values */ - size_t len; /* number of bytes */ - struct Table *metatable; - union {LUAI_MAXALIGN;} bindata; -} Udata0; - - -/* compute the offset of the memory area of a userdata */ -#define udatamemoffset(nuv) \ - ((nuv) == 0 ? offsetof(Udata0, bindata) \ - : offsetof(Udata, uv) + (sizeof(UValue) * (nuv))) - -/* get the address of the memory block inside 'Udata' */ -#define getudatamem(u) (cast_charp(u) + udatamemoffset((u)->nuvalue)) - -/* compute the size of a userdata */ -#define sizeudata(nuv,nb) (udatamemoffset(nuv) + (nb)) - -/* }================================================================== */ - - -/* -** {================================================================== -** Prototypes -** =================================================================== -*/ - -#define LUA_VPROTO makevariant(LUA_TPROTO, 0) - - -/* -** Description of an upvalue for function prototypes -*/ -typedef struct Upvaldesc { - TString *name; /* upvalue name (for debug information) */ - lu_byte instack; /* whether it is in stack (register) */ - lu_byte idx; /* index of upvalue (in stack or in outer function's list) */ - lu_byte kind; /* kind of corresponding variable */ -} Upvaldesc; - - -/* -** Description of a local variable for function prototypes -** (used for debug information) -*/ -typedef struct LocVar { - TString *varname; - int startpc; /* first point where variable is active */ - int endpc; /* first point where variable is dead */ -} LocVar; - - -/* -** Associates the absolute line source for a given instruction ('pc'). -** The array 'lineinfo' gives, for each instruction, the difference in -** lines from the previous instruction. When that difference does not -** fit into a byte, Lua saves the absolute line for that instruction. -** (Lua also saves the absolute line periodically, to speed up the -** computation of a line number: we can use binary search in the -** absolute-line array, but we must traverse the 'lineinfo' array -** linearly to compute a line.) -*/ -typedef struct AbsLineInfo { - int pc; - int line; -} AbsLineInfo; - - -/* -** Flags in Prototypes -*/ -#define PF_ISVARARG 1 -#define PF_FIXED 2 /* prototype has parts in fixed memory */ - - -/* -** Function Prototypes -*/ -typedef struct Proto { - CommonHeader; - lu_byte numparams; /* number of fixed (named) parameters */ - lu_byte flag; - lu_byte maxstacksize; /* number of registers needed by this function */ - int sizeupvalues; /* size of 'upvalues' */ - int sizek; /* size of 'k' */ - int sizecode; - int sizelineinfo; - int sizep; /* size of 'p' */ - int sizelocvars; - int sizeabslineinfo; /* size of 'abslineinfo' */ - int linedefined; /* debug information */ - int lastlinedefined; /* debug information */ - TValue *k; /* constants used by the function */ - Instruction *code; /* opcodes */ - struct Proto **p; /* functions defined inside the function */ - Upvaldesc *upvalues; /* upvalue information */ - ls_byte *lineinfo; /* information about source lines (debug information) */ - AbsLineInfo *abslineinfo; /* idem */ - LocVar *locvars; /* information about local variables (debug information) */ - TString *source; /* used for debug information */ - GCObject *gclist; -} Proto; - -/* }================================================================== */ - - -/* -** {================================================================== -** Functions -** =================================================================== -*/ - -#define LUA_VUPVAL makevariant(LUA_TUPVAL, 0) - - -/* Variant tags for functions */ -#define LUA_VLCL makevariant(LUA_TFUNCTION, 0) /* Lua closure */ -#define LUA_VLCF makevariant(LUA_TFUNCTION, 1) /* light C function */ -#define LUA_VCCL makevariant(LUA_TFUNCTION, 2) /* C closure */ - -#define ttisfunction(o) checktype(o, LUA_TFUNCTION) -#define ttisLclosure(o) checktag((o), ctb(LUA_VLCL)) -#define ttislcf(o) checktag((o), LUA_VLCF) -#define ttisCclosure(o) checktag((o), ctb(LUA_VCCL)) -#define ttisclosure(o) (ttisLclosure(o) || ttisCclosure(o)) - - -#define isLfunction(o) ttisLclosure(o) - -#define clvalue(o) check_exp(ttisclosure(o), gco2cl(val_(o).gc)) -#define clLvalue(o) check_exp(ttisLclosure(o), gco2lcl(val_(o).gc)) -#define fvalue(o) check_exp(ttislcf(o), val_(o).f) -#define clCvalue(o) check_exp(ttisCclosure(o), gco2ccl(val_(o).gc)) - -#define fvalueraw(v) ((v).f) - -#define setclLvalue(L,obj,x) \ - { TValue *io = (obj); LClosure *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VLCL)); \ - checkliveness(L,io); } - -#define setclLvalue2s(L,o,cl) setclLvalue(L,s2v(o),cl) - -#define setfvalue(obj,x) \ - { TValue *io=(obj); val_(io).f=(x); settt_(io, LUA_VLCF); } - -#define setclCvalue(L,obj,x) \ - { TValue *io = (obj); CClosure *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VCCL)); \ - checkliveness(L,io); } - - -/* -** Upvalues for Lua closures -*/ -typedef struct UpVal { - CommonHeader; - union { - TValue *p; /* points to stack or to its own value */ - ptrdiff_t offset; /* used while the stack is being reallocated */ - } v; - union { - struct { /* (when open) */ - struct UpVal *next; /* linked list */ - struct UpVal **previous; - } open; - TValue value; /* the value (when closed) */ - } u; -} UpVal; - - - -#define ClosureHeader \ - CommonHeader; lu_byte nupvalues; GCObject *gclist - -typedef struct CClosure { - ClosureHeader; - lua_CFunction f; - TValue upvalue[1]; /* list of upvalues */ -} CClosure; - - -typedef struct LClosure { - ClosureHeader; - struct Proto *p; - UpVal *upvals[1]; /* list of upvalues */ -} LClosure; - - -typedef union Closure { - CClosure c; - LClosure l; -} Closure; - - -#define getproto(o) (clLvalue(o)->p) - -/* }================================================================== */ - - -/* -** {================================================================== -** Tables -** =================================================================== -*/ - -#define LUA_VTABLE makevariant(LUA_TTABLE, 0) - -#define ttistable(o) checktag((o), ctb(LUA_VTABLE)) - -#define hvalue(o) check_exp(ttistable(o), gco2t(val_(o).gc)) - -#define sethvalue(L,obj,x) \ - { TValue *io = (obj); Table *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTABLE)); \ - checkliveness(L,io); } - -#define sethvalue2s(L,o,h) sethvalue(L,s2v(o),h) - - -/* -** Nodes for Hash tables: A pack of two TValue's (key-value pairs) -** plus a 'next' field to link colliding entries. The distribution -** of the key's fields ('key_tt' and 'key_val') not forming a proper -** 'TValue' allows for a smaller size for 'Node' both in 4-byte -** and 8-byte alignments. -*/ -typedef union Node { - struct NodeKey { - TValuefields; /* fields for value */ - lu_byte key_tt; /* key type */ - int next; /* for chaining */ - Value key_val; /* key value */ - } u; - TValue i_val; /* direct access to node's value as a proper 'TValue' */ -} Node; - - -/* copy a value into a key */ -#define setnodekey(L,node,obj) \ - { Node *n_=(node); const TValue *io_=(obj); \ - n_->u.key_val = io_->value_; n_->u.key_tt = io_->tt_; \ - checkliveness(L,io_); } - - -/* copy a value from a key */ -#define getnodekey(L,obj,node) \ - { TValue *io_=(obj); const Node *n_=(node); \ - io_->value_ = n_->u.key_val; io_->tt_ = n_->u.key_tt; \ - checkliveness(L,io_); } - - -/* -** About 'alimit': if 'isrealasize(t)' is true, then 'alimit' is the -** real size of 'array'. Otherwise, the real size of 'array' is the -** smallest power of two not smaller than 'alimit' (or zero iff 'alimit' -** is zero); 'alimit' is then used as a hint for #t. -*/ - -#define BITRAS (1 << 7) -#define isrealasize(t) (!((t)->flags & BITRAS)) -#define setrealasize(t) ((t)->flags &= cast_byte(~BITRAS)) -#define setnorealasize(t) ((t)->flags |= BITRAS) - - -typedef struct ArrayCell ArrayCell; - - -typedef struct Table { - CommonHeader; - lu_byte flags; /* 1<

u.key_tt) -#define keyval(node) ((node)->u.key_val) - -#define keyisnil(node) (keytt(node) == LUA_TNIL) -#define keyisinteger(node) (keytt(node) == LUA_VNUMINT) -#define keyival(node) (keyval(node).i) -#define keyisshrstr(node) (keytt(node) == ctb(LUA_VSHRSTR)) -#define keystrval(node) (gco2ts(keyval(node).gc)) - -#define setnilkey(node) (keytt(node) = LUA_TNIL) - -#define keyiscollectable(n) (keytt(n) & BIT_ISCOLLECTABLE) - -#define gckey(n) (keyval(n).gc) -#define gckeyN(n) (keyiscollectable(n) ? gckey(n) : NULL) - - -/* -** Dead keys in tables have the tag DEADKEY but keep their original -** gcvalue. This distinguishes them from regular keys but allows them to -** be found when searched in a special way. ('next' needs that to find -** keys removed from a table during a traversal.) -*/ -#define setdeadkey(node) (keytt(node) = LUA_TDEADKEY) -#define keyisdead(node) (keytt(node) == LUA_TDEADKEY) - -/* }================================================================== */ - - - -/* -** 'module' operation for hashing (size is always a power of 2) -*/ -#define lmod(s,size) \ - (check_exp((size&(size-1))==0, (cast_int((s) & ((size)-1))))) - - -#define twoto(x) (1<<(x)) -#define sizenode(t) (twoto((t)->lsizenode)) - - -/* size of buffer for 'luaO_utf8esc' function */ -#define UTF8BUFFSZ 8 - -LUAI_FUNC int luaO_utf8esc (char *buff, unsigned long x); -LUAI_FUNC int luaO_ceillog2 (unsigned int x); -LUAI_FUNC unsigned int luaO_codeparam (unsigned int p); -LUAI_FUNC l_obj luaO_applyparam (unsigned int p, l_obj x); - -LUAI_FUNC int luaO_rawarith (lua_State *L, int op, const TValue *p1, - const TValue *p2, TValue *res); -LUAI_FUNC void luaO_arith (lua_State *L, int op, const TValue *p1, - const TValue *p2, StkId res); -LUAI_FUNC size_t luaO_str2num (const char *s, TValue *o); -LUAI_FUNC int luaO_hexavalue (int c); -LUAI_FUNC void luaO_tostring (lua_State *L, TValue *obj); -LUAI_FUNC const char *luaO_pushvfstring (lua_State *L, const char *fmt, - va_list argp); -LUAI_FUNC const char *luaO_pushfstring (lua_State *L, const char *fmt, ...); -LUAI_FUNC void luaO_chunkid (char *out, const char *source, size_t srclen); - - -#endif - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lopcodes.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lopcodes.c deleted file mode 100644 index c67aa22..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lopcodes.c +++ /dev/null @@ -1,104 +0,0 @@ -/* -** $Id: lopcodes.c $ -** Opcodes for Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#define lopcodes_c -#define LUA_CORE - -#include "lprefix.h" - - -#include "lopcodes.h" - - -/* ORDER OP */ - -LUAI_DDEF const lu_byte luaP_opmodes[NUM_OPCODES] = { -/* MM OT IT T A mode opcode */ - opmode(0, 0, 0, 0, 1, iABC) /* OP_MOVE */ - ,opmode(0, 0, 0, 0, 1, iAsBx) /* OP_LOADI */ - ,opmode(0, 0, 0, 0, 1, iAsBx) /* OP_LOADF */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_LOADK */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_LOADKX */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LOADFALSE */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LFALSESKIP */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LOADTRUE */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LOADNIL */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETUPVAL */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETUPVAL */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETTABUP */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETTABLE */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETI */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETFIELD */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETTABUP */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETTABLE */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETI */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETFIELD */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_NEWTABLE */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SELF */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_ADDI */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_ADDK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SUBK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MULK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MODK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_POWK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_DIVK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_IDIVK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BANDK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BORK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BXORK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHRI */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHLI */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_ADD */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SUB */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MUL */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MOD */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_POW */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_DIV */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_IDIV */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BAND */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BOR */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BXOR */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHL */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHR */ - ,opmode(1, 0, 0, 0, 0, iABC) /* OP_MMBIN */ - ,opmode(1, 0, 0, 0, 0, iABC) /* OP_MMBINI*/ - ,opmode(1, 0, 0, 0, 0, iABC) /* OP_MMBINK*/ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_UNM */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BNOT */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_NOT */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LEN */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_CONCAT */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_CLOSE */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_TBC */ - ,opmode(0, 0, 0, 0, 0, isJ) /* OP_JMP */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_EQ */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LT */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LE */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_EQK */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_EQI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LTI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LEI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_GTI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_GEI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_TEST */ - ,opmode(0, 0, 0, 1, 1, iABC) /* OP_TESTSET */ - ,opmode(0, 1, 1, 0, 1, iABC) /* OP_CALL */ - ,opmode(0, 1, 1, 0, 1, iABC) /* OP_TAILCALL */ - ,opmode(0, 0, 1, 0, 0, iABC) /* OP_RETURN */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_RETURN0 */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_RETURN1 */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_FORLOOP */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_FORPREP */ - ,opmode(0, 0, 0, 0, 0, iABx) /* OP_TFORPREP */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_TFORCALL */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_TFORLOOP */ - ,opmode(0, 0, 1, 0, 0, iABC) /* OP_SETLIST */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_CLOSURE */ - ,opmode(0, 1, 0, 0, 1, iABC) /* OP_VARARG */ - ,opmode(0, 0, 1, 0, 1, iABC) /* OP_VARARGPREP */ - ,opmode(0, 0, 0, 0, 0, iAx) /* OP_EXTRAARG */ -}; - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lopcodes.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lopcodes.h deleted file mode 100644 index 46911ca..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lopcodes.h +++ /dev/null @@ -1,405 +0,0 @@ -/* -** $Id: lopcodes.h $ -** Opcodes for Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#ifndef lopcodes_h -#define lopcodes_h - -#include "llimits.h" - - -/*=========================================================================== - We assume that instructions are unsigned 32-bit integers. - All instructions have an opcode in the first 7 bits. - Instructions can have the following formats: - - 3 3 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 - 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 -iABC C(8) | B(8) |k| A(8) | Op(7) | -iABx Bx(17) | A(8) | Op(7) | -iAsBx sBx (signed)(17) | A(8) | Op(7) | -iAx Ax(25) | Op(7) | -isJ sJ (signed)(25) | Op(7) | - - A signed argument is represented in excess K: the represented value is - the written unsigned value minus K, where K is half the maximum for the - corresponding unsigned argument. -===========================================================================*/ - - -enum OpMode {iABC, iABx, iAsBx, iAx, isJ}; /* basic instruction formats */ - - -/* -** size and position of opcode arguments. -*/ -#define SIZE_C 8 -#define SIZE_B 8 -#define SIZE_Bx (SIZE_C + SIZE_B + 1) -#define SIZE_A 8 -#define SIZE_Ax (SIZE_Bx + SIZE_A) -#define SIZE_sJ (SIZE_Bx + SIZE_A) - -#define SIZE_OP 7 - -#define POS_OP 0 - -#define POS_A (POS_OP + SIZE_OP) -#define POS_k (POS_A + SIZE_A) -#define POS_B (POS_k + 1) -#define POS_C (POS_B + SIZE_B) - -#define POS_Bx POS_k - -#define POS_Ax POS_A - -#define POS_sJ POS_A - - -/* -** limits for opcode arguments. -** we use (signed) 'int' to manipulate most arguments, -** so they must fit in ints. -*/ - -/* Check whether type 'int' has at least 'b' bits ('b' < 32) */ -#define L_INTHASBITS(b) ((UINT_MAX >> ((b) - 1)) >= 1) - - -#if L_INTHASBITS(SIZE_Bx) -#define MAXARG_Bx ((1<>1) /* 'sBx' is signed */ - - -#if L_INTHASBITS(SIZE_Ax) -#define MAXARG_Ax ((1<> 1) - - -#define MAXARG_A ((1<> 1) - -#define int2sC(i) ((i) + OFFSET_sC) -#define sC2int(i) ((i) - OFFSET_sC) - - -/* creates a mask with 'n' 1 bits at position 'p' */ -#define MASK1(n,p) ((~((~(Instruction)0)<<(n)))<<(p)) - -/* creates a mask with 'n' 0 bits at position 'p' */ -#define MASK0(n,p) (~MASK1(n,p)) - -/* -** the following macros help to manipulate instructions -*/ - -#define GET_OPCODE(i) (cast(OpCode, ((i)>>POS_OP) & MASK1(SIZE_OP,0))) -#define SET_OPCODE(i,o) ((i) = (((i)&MASK0(SIZE_OP,POS_OP)) | \ - ((cast(Instruction, o)<>(pos)) & MASK1(size,0))) -#define setarg(i,v,pos,size) ((i) = (((i)&MASK0(size,pos)) | \ - ((cast(Instruction, v)<> sC */ -OP_SHLI,/* A B sC R[A] := sC << R[B] */ - -OP_ADD,/* A B C R[A] := R[B] + R[C] */ -OP_SUB,/* A B C R[A] := R[B] - R[C] */ -OP_MUL,/* A B C R[A] := R[B] * R[C] */ -OP_MOD,/* A B C R[A] := R[B] % R[C] */ -OP_POW,/* A B C R[A] := R[B] ^ R[C] */ -OP_DIV,/* A B C R[A] := R[B] / R[C] */ -OP_IDIV,/* A B C R[A] := R[B] // R[C] */ - -OP_BAND,/* A B C R[A] := R[B] & R[C] */ -OP_BOR,/* A B C R[A] := R[B] | R[C] */ -OP_BXOR,/* A B C R[A] := R[B] ~ R[C] */ -OP_SHL,/* A B C R[A] := R[B] << R[C] */ -OP_SHR,/* A B C R[A] := R[B] >> R[C] */ - -OP_MMBIN,/* A B C call C metamethod over R[A] and R[B] (*) */ -OP_MMBINI,/* A sB C k call C metamethod over R[A] and sB */ -OP_MMBINK,/* A B C k call C metamethod over R[A] and K[B] */ - -OP_UNM,/* A B R[A] := -R[B] */ -OP_BNOT,/* A B R[A] := ~R[B] */ -OP_NOT,/* A B R[A] := not R[B] */ -OP_LEN,/* A B R[A] := #R[B] (length operator) */ - -OP_CONCAT,/* A B R[A] := R[A].. ... ..R[A + B - 1] */ - -OP_CLOSE,/* A close all upvalues >= R[A] */ -OP_TBC,/* A mark variable A "to be closed" */ -OP_JMP,/* sJ pc += sJ */ -OP_EQ,/* A B k if ((R[A] == R[B]) ~= k) then pc++ */ -OP_LT,/* A B k if ((R[A] < R[B]) ~= k) then pc++ */ -OP_LE,/* A B k if ((R[A] <= R[B]) ~= k) then pc++ */ - -OP_EQK,/* A B k if ((R[A] == K[B]) ~= k) then pc++ */ -OP_EQI,/* A sB k if ((R[A] == sB) ~= k) then pc++ */ -OP_LTI,/* A sB k if ((R[A] < sB) ~= k) then pc++ */ -OP_LEI,/* A sB k if ((R[A] <= sB) ~= k) then pc++ */ -OP_GTI,/* A sB k if ((R[A] > sB) ~= k) then pc++ */ -OP_GEI,/* A sB k if ((R[A] >= sB) ~= k) then pc++ */ - -OP_TEST,/* A k if (not R[A] == k) then pc++ */ -OP_TESTSET,/* A B k if (not R[B] == k) then pc++ else R[A] := R[B] (*) */ - -OP_CALL,/* A B C R[A], ... ,R[A+C-2] := R[A](R[A+1], ... ,R[A+B-1]) */ -OP_TAILCALL,/* A B C k return R[A](R[A+1], ... ,R[A+B-1]) */ - -OP_RETURN,/* A B C k return R[A], ... ,R[A+B-2] (see note) */ -OP_RETURN0,/* return */ -OP_RETURN1,/* A return R[A] */ - -OP_FORLOOP,/* A Bx update counters; if loop continues then pc-=Bx; */ -OP_FORPREP,/* A Bx ; - if not to run then pc+=Bx+1; */ - -OP_TFORPREP,/* A Bx create upvalue for R[A + 3]; pc+=Bx */ -OP_TFORCALL,/* A C R[A+4], ... ,R[A+3+C] := R[A](R[A+1], R[A+2]); */ -OP_TFORLOOP,/* A Bx if R[A+2] ~= nil then { R[A]=R[A+2]; pc -= Bx } */ - -OP_SETLIST,/* A B C k R[A][C+i] := R[A+i], 1 <= i <= B */ - -OP_CLOSURE,/* A Bx R[A] := closure(KPROTO[Bx]) */ - -OP_VARARG,/* A C R[A], R[A+1], ..., R[A+C-2] = vararg */ - -OP_VARARGPREP,/*A (adjust vararg parameters) */ - -OP_EXTRAARG/* Ax extra (larger) argument for previous opcode */ -} OpCode; - - -#define NUM_OPCODES ((int)(OP_EXTRAARG) + 1) - - - -/*=========================================================================== - Notes: - - (*) Opcode OP_LFALSESKIP is used to convert a condition to a boolean - value, in a code equivalent to (not cond ? false : true). (It - produces false and skips the next instruction producing true.) - - (*) Opcodes OP_MMBIN and variants follow each arithmetic and - bitwise opcode. If the operation succeeds, it skips this next - opcode. Otherwise, this opcode calls the corresponding metamethod. - - (*) Opcode OP_TESTSET is used in short-circuit expressions that need - both to jump and to produce a value, such as (a = b or c). - - (*) In OP_CALL, if (B == 0) then B = top - A. If (C == 0), then - 'top' is set to last_result+1, so next open instruction (OP_CALL, - OP_RETURN*, OP_SETLIST) may use 'top'. - - (*) In OP_VARARG, if (C == 0) then use actual number of varargs and - set top (like in OP_CALL with C == 0). - - (*) In OP_RETURN, if (B == 0) then return up to 'top'. - - (*) In OP_LOADKX and OP_NEWTABLE, the next instruction is always - OP_EXTRAARG. - - (*) In OP_SETLIST, if (B == 0) then real B = 'top'; if k, then - real C = EXTRAARG _ C (the bits of EXTRAARG concatenated with the - bits of C). - - (*) In OP_NEWTABLE, B is log2 of the hash size (which is always a - power of 2) plus 1, or zero for size zero. If not k, the array size - is C. Otherwise, the array size is EXTRAARG _ C. - - (*) For comparisons, k specifies what condition the test should accept - (true or false). - - (*) In OP_MMBINI/OP_MMBINK, k means the arguments were flipped - (the constant is the first operand). - - (*) All 'skips' (pc++) assume that next instruction is a jump. - - (*) In instructions OP_RETURN/OP_TAILCALL, 'k' specifies that the - function builds upvalues, which may need to be closed. C > 0 means - the function is vararg, so that its 'func' must be corrected before - returning; in this case, (C - 1) is its number of fixed parameters. - - (*) In comparisons with an immediate operand, C signals whether the - original operand was a float. (It must be corrected in case of - metamethods.) - -===========================================================================*/ - - -/* -** masks for instruction properties. The format is: -** bits 0-2: op mode -** bit 3: instruction set register A -** bit 4: operator is a test (next instruction must be a jump) -** bit 5: instruction uses 'L->top' set by previous instruction (when B == 0) -** bit 6: instruction sets 'L->top' for next instruction (when C == 0) -** bit 7: instruction is an MM instruction (call a metamethod) -*/ - -LUAI_DDEC(const lu_byte luaP_opmodes[NUM_OPCODES];) - -#define getOpMode(m) (cast(enum OpMode, luaP_opmodes[m] & 7)) -#define testAMode(m) (luaP_opmodes[m] & (1 << 3)) -#define testTMode(m) (luaP_opmodes[m] & (1 << 4)) -#define testITMode(m) (luaP_opmodes[m] & (1 << 5)) -#define testOTMode(m) (luaP_opmodes[m] & (1 << 6)) -#define testMMMode(m) (luaP_opmodes[m] & (1 << 7)) - -/* "out top" (set top for next instruction) */ -#define isOT(i) \ - ((testOTMode(GET_OPCODE(i)) && GETARG_C(i) == 0) || \ - GET_OPCODE(i) == OP_TAILCALL) - -/* "in top" (uses top from previous instruction) */ -#define isIT(i) (testITMode(GET_OPCODE(i)) && GETARG_B(i) == 0) - -#define opmode(mm,ot,it,t,a,m) \ - (((mm) << 7) | ((ot) << 6) | ((it) << 5) | ((t) << 4) | ((a) << 3) | (m)) - - -/* number of list items to accumulate before a SETLIST instruction */ -#define LFIELDS_PER_FLUSH 50 - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lopnames.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lopnames.h deleted file mode 100644 index 965cec9..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lopnames.h +++ /dev/null @@ -1,103 +0,0 @@ -/* -** $Id: lopnames.h $ -** Opcode names -** See Copyright Notice in lua.h -*/ - -#if !defined(lopnames_h) -#define lopnames_h - -#include - - -/* ORDER OP */ - -static const char *const opnames[] = { - "MOVE", - "LOADI", - "LOADF", - "LOADK", - "LOADKX", - "LOADFALSE", - "LFALSESKIP", - "LOADTRUE", - "LOADNIL", - "GETUPVAL", - "SETUPVAL", - "GETTABUP", - "GETTABLE", - "GETI", - "GETFIELD", - "SETTABUP", - "SETTABLE", - "SETI", - "SETFIELD", - "NEWTABLE", - "SELF", - "ADDI", - "ADDK", - "SUBK", - "MULK", - "MODK", - "POWK", - "DIVK", - "IDIVK", - "BANDK", - "BORK", - "BXORK", - "SHRI", - "SHLI", - "ADD", - "SUB", - "MUL", - "MOD", - "POW", - "DIV", - "IDIV", - "BAND", - "BOR", - "BXOR", - "SHL", - "SHR", - "MMBIN", - "MMBINI", - "MMBINK", - "UNM", - "BNOT", - "NOT", - "LEN", - "CONCAT", - "CLOSE", - "TBC", - "JMP", - "EQ", - "LT", - "LE", - "EQK", - "EQI", - "LTI", - "LEI", - "GTI", - "GEI", - "TEST", - "TESTSET", - "CALL", - "TAILCALL", - "RETURN", - "RETURN0", - "RETURN1", - "FORLOOP", - "FORPREP", - "TFORPREP", - "TFORCALL", - "TFORLOOP", - "SETLIST", - "CLOSURE", - "VARARG", - "VARARGPREP", - "EXTRAARG", - NULL -}; - -#endif - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/loslib.c b/build/c/dependencies/luaCEmbed/dependencies/lua/loslib.c deleted file mode 100644 index ad5a927..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/loslib.c +++ /dev/null @@ -1,428 +0,0 @@ -/* -** $Id: loslib.c $ -** Standard Operating System library -** See Copyright Notice in lua.h -*/ - -#define loslib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** {================================================================== -** List of valid conversion specifiers for the 'strftime' function; -** options are grouped by length; group of length 2 start with '||'. -** =================================================================== -*/ -#if !defined(LUA_STRFTIMEOPTIONS) /* { */ - -#if defined(LUA_USE_WINDOWS) -#define LUA_STRFTIMEOPTIONS "aAbBcdHIjmMpSUwWxXyYzZ%" \ - "||" "#c#x#d#H#I#j#m#M#S#U#w#W#y#Y" /* two-char options */ -#elif defined(LUA_USE_C89) /* ANSI C 89 (only 1-char options) */ -#define LUA_STRFTIMEOPTIONS "aAbBcdHIjmMpSUwWxXyYZ%" -#else /* C99 specification */ -#define LUA_STRFTIMEOPTIONS "aAbBcCdDeFgGhHIjmMnprRStTuUVwWxXyYzZ%" \ - "||" "EcECExEXEyEY" "OdOeOHOIOmOMOSOuOUOVOwOWOy" /* two-char options */ -#endif - -#endif /* } */ -/* }================================================================== */ - - -/* -** {================================================================== -** Configuration for time-related stuff -** =================================================================== -*/ - -/* -** type to represent time_t in Lua -*/ -#if !defined(LUA_NUMTIME) /* { */ - -#define l_timet lua_Integer -#define l_pushtime(L,t) lua_pushinteger(L,(lua_Integer)(t)) -#define l_gettime(L,arg) luaL_checkinteger(L, arg) - -#else /* }{ */ - -#define l_timet lua_Number -#define l_pushtime(L,t) lua_pushnumber(L,(lua_Number)(t)) -#define l_gettime(L,arg) luaL_checknumber(L, arg) - -#endif /* } */ - - -#if !defined(l_gmtime) /* { */ -/* -** By default, Lua uses gmtime/localtime, except when POSIX is available, -** where it uses gmtime_r/localtime_r -*/ - -#if defined(LUA_USE_POSIX) /* { */ - -#define l_gmtime(t,r) gmtime_r(t,r) -#define l_localtime(t,r) localtime_r(t,r) - -#else /* }{ */ - -/* ISO C definitions */ -#define l_gmtime(t,r) ((void)(r)->tm_sec, gmtime(t)) -#define l_localtime(t,r) ((void)(r)->tm_sec, localtime(t)) - -#endif /* } */ - -#endif /* } */ - -/* }================================================================== */ - - -/* -** {================================================================== -** Configuration for 'tmpnam': -** By default, Lua uses tmpnam except when POSIX is available, where -** it uses mkstemp. -** =================================================================== -*/ -#if !defined(lua_tmpnam) /* { */ - -#if defined(LUA_USE_POSIX) /* { */ - -#include - -#define LUA_TMPNAMBUFSIZE 32 - -#if !defined(LUA_TMPNAMTEMPLATE) -#define LUA_TMPNAMTEMPLATE "/tmp/lua_XXXXXX" -#endif - -#define lua_tmpnam(b,e) { \ - strcpy(b, LUA_TMPNAMTEMPLATE); \ - e = mkstemp(b); \ - if (e != -1) close(e); \ - e = (e == -1); } - -#else /* }{ */ - -/* ISO C definitions */ -#define LUA_TMPNAMBUFSIZE L_tmpnam -#define lua_tmpnam(b,e) { e = (tmpnam(b) == NULL); } - -#endif /* } */ - -#endif /* } */ -/* }================================================================== */ - - -#if !defined(l_system) -#if defined(LUA_USE_IOS) -/* Despite claiming to be ISO C, iOS does not implement 'system'. */ -#define l_system(cmd) ((cmd) == NULL ? 0 : -1) -#else -#define l_system(cmd) system(cmd) /* default definition */ -#endif -#endif - - -static int os_execute (lua_State *L) { - const char *cmd = luaL_optstring(L, 1, NULL); - int stat; - errno = 0; - stat = l_system(cmd); - if (cmd != NULL) - return luaL_execresult(L, stat); - else { - lua_pushboolean(L, stat); /* true if there is a shell */ - return 1; - } -} - - -static int os_remove (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - return luaL_fileresult(L, remove(filename) == 0, filename); -} - - -static int os_rename (lua_State *L) { - const char *fromname = luaL_checkstring(L, 1); - const char *toname = luaL_checkstring(L, 2); - return luaL_fileresult(L, rename(fromname, toname) == 0, NULL); -} - - -static int os_tmpname (lua_State *L) { - char buff[LUA_TMPNAMBUFSIZE]; - int err; - lua_tmpnam(buff, err); - if (l_unlikely(err)) - return luaL_error(L, "unable to generate a unique filename"); - lua_pushstring(L, buff); - return 1; -} - - -static int os_getenv (lua_State *L) { - lua_pushstring(L, getenv(luaL_checkstring(L, 1))); /* if NULL push nil */ - return 1; -} - - -static int os_clock (lua_State *L) { - lua_pushnumber(L, ((lua_Number)clock())/(lua_Number)CLOCKS_PER_SEC); - return 1; -} - - -/* -** {====================================================== -** Time/Date operations -** { year=%Y, month=%m, day=%d, hour=%H, min=%M, sec=%S, -** wday=%w+1, yday=%j, isdst=? } -** ======================================================= -*/ - -/* -** About the overflow check: an overflow cannot occur when time -** is represented by a lua_Integer, because either lua_Integer is -** large enough to represent all int fields or it is not large enough -** to represent a time that cause a field to overflow. However, if -** times are represented as doubles and lua_Integer is int, then the -** time 0x1.e1853b0d184f6p+55 would cause an overflow when adding 1900 -** to compute the year. -*/ -static void setfield (lua_State *L, const char *key, int value, int delta) { - #if (defined(LUA_NUMTIME) && LUA_MAXINTEGER <= INT_MAX) - if (l_unlikely(value > LUA_MAXINTEGER - delta)) - luaL_error(L, "field '%s' is out-of-bound", key); - #endif - lua_pushinteger(L, (lua_Integer)value + delta); - lua_setfield(L, -2, key); -} - - -static void setboolfield (lua_State *L, const char *key, int value) { - if (value < 0) /* undefined? */ - return; /* does not set field */ - lua_pushboolean(L, value); - lua_setfield(L, -2, key); -} - - -/* -** Set all fields from structure 'tm' in the table on top of the stack -*/ -static void setallfields (lua_State *L, struct tm *stm) { - setfield(L, "year", stm->tm_year, 1900); - setfield(L, "month", stm->tm_mon, 1); - setfield(L, "day", stm->tm_mday, 0); - setfield(L, "hour", stm->tm_hour, 0); - setfield(L, "min", stm->tm_min, 0); - setfield(L, "sec", stm->tm_sec, 0); - setfield(L, "yday", stm->tm_yday, 1); - setfield(L, "wday", stm->tm_wday, 1); - setboolfield(L, "isdst", stm->tm_isdst); -} - - -static int getboolfield (lua_State *L, const char *key) { - int res; - res = (lua_getfield(L, -1, key) == LUA_TNIL) ? -1 : lua_toboolean(L, -1); - lua_pop(L, 1); - return res; -} - - -static int getfield (lua_State *L, const char *key, int d, int delta) { - int isnum; - int t = lua_getfield(L, -1, key); /* get field and its type */ - lua_Integer res = lua_tointegerx(L, -1, &isnum); - if (!isnum) { /* field is not an integer? */ - if (l_unlikely(t != LUA_TNIL)) /* some other value? */ - return luaL_error(L, "field '%s' is not an integer", key); - else if (l_unlikely(d < 0)) /* absent field; no default? */ - return luaL_error(L, "field '%s' missing in date table", key); - res = d; - } - else { - if (!(res >= 0 ? res - delta <= INT_MAX : INT_MIN + delta <= res)) - return luaL_error(L, "field '%s' is out-of-bound", key); - res -= delta; - } - lua_pop(L, 1); - return (int)res; -} - - -static const char *checkoption (lua_State *L, const char *conv, - ptrdiff_t convlen, char *buff) { - const char *option = LUA_STRFTIMEOPTIONS; - int oplen = 1; /* length of options being checked */ - for (; *option != '\0' && oplen <= convlen; option += oplen) { - if (*option == '|') /* next block? */ - oplen++; /* will check options with next length (+1) */ - else if (memcmp(conv, option, oplen) == 0) { /* match? */ - memcpy(buff, conv, oplen); /* copy valid option to buffer */ - buff[oplen] = '\0'; - return conv + oplen; /* return next item */ - } - } - luaL_argerror(L, 1, - lua_pushfstring(L, "invalid conversion specifier '%%%s'", conv)); - return conv; /* to avoid warnings */ -} - - -static time_t l_checktime (lua_State *L, int arg) { - l_timet t = l_gettime(L, arg); - luaL_argcheck(L, (time_t)t == t, arg, "time out-of-bounds"); - return (time_t)t; -} - - -/* maximum size for an individual 'strftime' item */ -#define SIZETIMEFMT 250 - - -static int os_date (lua_State *L) { - size_t slen; - const char *s = luaL_optlstring(L, 1, "%c", &slen); - time_t t = luaL_opt(L, l_checktime, 2, time(NULL)); - const char *se = s + slen; /* 's' end */ - struct tm tmr, *stm; - if (*s == '!') { /* UTC? */ - stm = l_gmtime(&t, &tmr); - s++; /* skip '!' */ - } - else - stm = l_localtime(&t, &tmr); - if (stm == NULL) /* invalid date? */ - return luaL_error(L, - "date result cannot be represented in this installation"); - if (strcmp(s, "*t") == 0) { - lua_createtable(L, 0, 9); /* 9 = number of fields */ - setallfields(L, stm); - } - else { - char cc[4]; /* buffer for individual conversion specifiers */ - luaL_Buffer b; - cc[0] = '%'; - luaL_buffinit(L, &b); - while (s < se) { - if (*s != '%') /* not a conversion specifier? */ - luaL_addchar(&b, *s++); - else { - size_t reslen; - char *buff = luaL_prepbuffsize(&b, SIZETIMEFMT); - s++; /* skip '%' */ - s = checkoption(L, s, se - s, cc + 1); /* copy specifier to 'cc' */ - reslen = strftime(buff, SIZETIMEFMT, cc, stm); - luaL_addsize(&b, reslen); - } - } - luaL_pushresult(&b); - } - return 1; -} - - -static int os_time (lua_State *L) { - time_t t; - if (lua_isnoneornil(L, 1)) /* called without args? */ - t = time(NULL); /* get current time */ - else { - struct tm ts; - luaL_checktype(L, 1, LUA_TTABLE); - lua_settop(L, 1); /* make sure table is at the top */ - ts.tm_year = getfield(L, "year", -1, 1900); - ts.tm_mon = getfield(L, "month", -1, 1); - ts.tm_mday = getfield(L, "day", -1, 0); - ts.tm_hour = getfield(L, "hour", 12, 0); - ts.tm_min = getfield(L, "min", 0, 0); - ts.tm_sec = getfield(L, "sec", 0, 0); - ts.tm_isdst = getboolfield(L, "isdst"); - t = mktime(&ts); - setallfields(L, &ts); /* update fields with normalized values */ - } - if (t != (time_t)(l_timet)t || t == (time_t)(-1)) - return luaL_error(L, - "time result cannot be represented in this installation"); - l_pushtime(L, t); - return 1; -} - - -static int os_difftime (lua_State *L) { - time_t t1 = l_checktime(L, 1); - time_t t2 = l_checktime(L, 2); - lua_pushnumber(L, (lua_Number)difftime(t1, t2)); - return 1; -} - -/* }====================================================== */ - - -static int os_setlocale (lua_State *L) { - static const int cat[] = {LC_ALL, LC_COLLATE, LC_CTYPE, LC_MONETARY, - LC_NUMERIC, LC_TIME}; - static const char *const catnames[] = {"all", "collate", "ctype", "monetary", - "numeric", "time", NULL}; - const char *l = luaL_optstring(L, 1, NULL); - int op = luaL_checkoption(L, 2, "all", catnames); - lua_pushstring(L, setlocale(cat[op], l)); - return 1; -} - - -static int os_exit (lua_State *L) { - int status; - if (lua_isboolean(L, 1)) - status = (lua_toboolean(L, 1) ? EXIT_SUCCESS : EXIT_FAILURE); - else - status = (int)luaL_optinteger(L, 1, EXIT_SUCCESS); - if (lua_toboolean(L, 2)) - lua_close(L); - if (L) exit(status); /* 'if' to avoid warnings for unreachable 'return' */ - return 0; -} - - -static const luaL_Reg syslib[] = { - {"clock", os_clock}, - {"date", os_date}, - {"difftime", os_difftime}, - {"execute", os_execute}, - {"exit", os_exit}, - {"getenv", os_getenv}, - {"remove", os_remove}, - {"rename", os_rename}, - {"setlocale", os_setlocale}, - {"time", os_time}, - {"tmpname", os_tmpname}, - {NULL, NULL} -}; - -/* }====================================================== */ - - - -LUAMOD_API int luaopen_os (lua_State *L) { - luaL_newlib(L, syslib); - return 1; -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lparser.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lparser.c deleted file mode 100644 index 48cba06..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lparser.c +++ /dev/null @@ -1,1976 +0,0 @@ -/* -** $Id: lparser.c $ -** Lua Parser -** See Copyright Notice in lua.h -*/ - -#define lparser_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "lcode.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "llex.h" -#include "lmem.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lparser.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" - - - -/* maximum number of local variables per function (must be smaller - than 250, due to the bytecode format) */ -#define MAXVARS 200 - - -#define hasmultret(k) ((k) == VCALL || (k) == VVARARG) - - -/* because all strings are unified by the scanner, the parser - can use pointer equality for string equality */ -#define eqstr(a,b) ((a) == (b)) - - -/* -** nodes for block list (list of active blocks) -*/ -typedef struct BlockCnt { - struct BlockCnt *previous; /* chain */ - int firstlabel; /* index of first label in this block */ - int firstgoto; /* index of first pending goto in this block */ - lu_byte nactvar; /* # active locals outside the block */ - lu_byte upval; /* true if some variable in the block is an upvalue */ - lu_byte isloop; /* true if 'block' is a loop */ - lu_byte insidetbc; /* true if inside the scope of a to-be-closed var. */ -} BlockCnt; - - - -/* -** prototypes for recursive non-terminal functions -*/ -static void statement (LexState *ls); -static void expr (LexState *ls, expdesc *v); - - -static l_noret error_expected (LexState *ls, int token) { - luaX_syntaxerror(ls, - luaO_pushfstring(ls->L, "%s expected", luaX_token2str(ls, token))); -} - - -static l_noret errorlimit (FuncState *fs, int limit, const char *what) { - lua_State *L = fs->ls->L; - const char *msg; - int line = fs->f->linedefined; - const char *where = (line == 0) - ? "main function" - : luaO_pushfstring(L, "function at line %d", line); - msg = luaO_pushfstring(L, "too many %s (limit is %d) in %s", - what, limit, where); - luaX_syntaxerror(fs->ls, msg); -} - - -static void checklimit (FuncState *fs, int v, int l, const char *what) { - if (v > l) errorlimit(fs, l, what); -} - - -/* -** Test whether next token is 'c'; if so, skip it. -*/ -static int testnext (LexState *ls, int c) { - if (ls->t.token == c) { - luaX_next(ls); - return 1; - } - else return 0; -} - - -/* -** Check that next token is 'c'. -*/ -static void check (LexState *ls, int c) { - if (ls->t.token != c) - error_expected(ls, c); -} - - -/* -** Check that next token is 'c' and skip it. -*/ -static void checknext (LexState *ls, int c) { - check(ls, c); - luaX_next(ls); -} - - -#define check_condition(ls,c,msg) { if (!(c)) luaX_syntaxerror(ls, msg); } - - -/* -** Check that next token is 'what' and skip it. In case of error, -** raise an error that the expected 'what' should match a 'who' -** in line 'where' (if that is not the current line). -*/ -static void check_match (LexState *ls, int what, int who, int where) { - if (l_unlikely(!testnext(ls, what))) { - if (where == ls->linenumber) /* all in the same line? */ - error_expected(ls, what); /* do not need a complex message */ - else { - luaX_syntaxerror(ls, luaO_pushfstring(ls->L, - "%s expected (to close %s at line %d)", - luaX_token2str(ls, what), luaX_token2str(ls, who), where)); - } - } -} - - -static TString *str_checkname (LexState *ls) { - TString *ts; - check(ls, TK_NAME); - ts = ls->t.seminfo.ts; - luaX_next(ls); - return ts; -} - - -static void init_exp (expdesc *e, expkind k, int i) { - e->f = e->t = NO_JUMP; - e->k = k; - e->u.info = i; -} - - -static void codestring (expdesc *e, TString *s) { - e->f = e->t = NO_JUMP; - e->k = VKSTR; - e->u.strval = s; -} - - -static void codename (LexState *ls, expdesc *e) { - codestring(e, str_checkname(ls)); -} - - -/* -** Register a new local variable in the active 'Proto' (for debug -** information). -*/ -static int registerlocalvar (LexState *ls, FuncState *fs, TString *varname) { - Proto *f = fs->f; - int oldsize = f->sizelocvars; - luaM_growvector(ls->L, f->locvars, fs->ndebugvars, f->sizelocvars, - LocVar, SHRT_MAX, "local variables"); - while (oldsize < f->sizelocvars) - f->locvars[oldsize++].varname = NULL; - f->locvars[fs->ndebugvars].varname = varname; - f->locvars[fs->ndebugvars].startpc = fs->pc; - luaC_objbarrier(ls->L, f, varname); - return fs->ndebugvars++; -} - - -/* -** Create a new local variable with the given 'name' and given 'kind'. -** Return its index in the function. -*/ -static int new_localvarkind (LexState *ls, TString *name, int kind) { - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Dyndata *dyd = ls->dyd; - Vardesc *var; - checklimit(fs, dyd->actvar.n + 1 - fs->firstlocal, - MAXVARS, "local variables"); - luaM_growvector(L, dyd->actvar.arr, dyd->actvar.n + 1, - dyd->actvar.size, Vardesc, USHRT_MAX, "local variables"); - var = &dyd->actvar.arr[dyd->actvar.n++]; - var->vd.kind = kind; /* default */ - var->vd.name = name; - return dyd->actvar.n - 1 - fs->firstlocal; -} - - -/* -** Create a new local variable with the given 'name' and regular kind. -*/ -static int new_localvar (LexState *ls, TString *name) { - return new_localvarkind(ls, name, VDKREG); -} - -#define new_localvarliteral(ls,v) \ - new_localvar(ls, \ - luaX_newstring(ls, "" v, (sizeof(v)/sizeof(char)) - 1)); - - - -/* -** Return the "variable description" (Vardesc) of a given variable. -** (Unless noted otherwise, all variables are referred to by their -** compiler indices.) -*/ -static Vardesc *getlocalvardesc (FuncState *fs, int vidx) { - return &fs->ls->dyd->actvar.arr[fs->firstlocal + vidx]; -} - - -/* -** Convert 'nvar', a compiler index level, to its corresponding -** register. For that, search for the highest variable below that level -** that is in a register and uses its register index ('ridx') plus one. -*/ -static int reglevel (FuncState *fs, int nvar) { - while (nvar-- > 0) { - Vardesc *vd = getlocalvardesc(fs, nvar); /* get previous variable */ - if (vd->vd.kind != RDKCTC) /* is in a register? */ - return vd->vd.ridx + 1; - } - return 0; /* no variables in registers */ -} - - -/* -** Return the number of variables in the register stack for the given -** function. -*/ -int luaY_nvarstack (FuncState *fs) { - return reglevel(fs, fs->nactvar); -} - - -/* -** Get the debug-information entry for current variable 'vidx'. -*/ -static LocVar *localdebuginfo (FuncState *fs, int vidx) { - Vardesc *vd = getlocalvardesc(fs, vidx); - if (vd->vd.kind == RDKCTC) - return NULL; /* no debug info. for constants */ - else { - int idx = vd->vd.pidx; - lua_assert(idx < fs->ndebugvars); - return &fs->f->locvars[idx]; - } -} - - -/* -** Create an expression representing variable 'vidx' -*/ -static void init_var (FuncState *fs, expdesc *e, int vidx) { - e->f = e->t = NO_JUMP; - e->k = VLOCAL; - e->u.var.vidx = vidx; - e->u.var.ridx = getlocalvardesc(fs, vidx)->vd.ridx; -} - - -/* -** Raises an error if variable described by 'e' is read only -*/ -static void check_readonly (LexState *ls, expdesc *e) { - FuncState *fs = ls->fs; - TString *varname = NULL; /* to be set if variable is const */ - switch (e->k) { - case VCONST: { - varname = ls->dyd->actvar.arr[e->u.info].vd.name; - break; - } - case VLOCAL: { - Vardesc *vardesc = getlocalvardesc(fs, e->u.var.vidx); - if (vardesc->vd.kind != VDKREG) /* not a regular variable? */ - varname = vardesc->vd.name; - break; - } - case VUPVAL: { - Upvaldesc *up = &fs->f->upvalues[e->u.info]; - if (up->kind != VDKREG) - varname = up->name; - break; - } - default: - return; /* other cases cannot be read-only */ - } - if (varname) { - const char *msg = luaO_pushfstring(ls->L, - "attempt to assign to const variable '%s'", getstr(varname)); - luaK_semerror(ls, msg); /* error */ - } -} - - -/* -** Start the scope for the last 'nvars' created variables. -*/ -static void adjustlocalvars (LexState *ls, int nvars) { - FuncState *fs = ls->fs; - int reglevel = luaY_nvarstack(fs); - int i; - for (i = 0; i < nvars; i++) { - int vidx = fs->nactvar++; - Vardesc *var = getlocalvardesc(fs, vidx); - var->vd.ridx = reglevel++; - var->vd.pidx = registerlocalvar(ls, fs, var->vd.name); - } -} - - -/* -** Close the scope for all variables up to level 'tolevel'. -** (debug info.) -*/ -static void removevars (FuncState *fs, int tolevel) { - fs->ls->dyd->actvar.n -= (fs->nactvar - tolevel); - while (fs->nactvar > tolevel) { - LocVar *var = localdebuginfo(fs, --fs->nactvar); - if (var) /* does it have debug information? */ - var->endpc = fs->pc; - } -} - - -/* -** Search the upvalues of the function 'fs' for one -** with the given 'name'. -*/ -static int searchupvalue (FuncState *fs, TString *name) { - int i; - Upvaldesc *up = fs->f->upvalues; - for (i = 0; i < fs->nups; i++) { - if (eqstr(up[i].name, name)) return i; - } - return -1; /* not found */ -} - - -static Upvaldesc *allocupvalue (FuncState *fs) { - Proto *f = fs->f; - int oldsize = f->sizeupvalues; - checklimit(fs, fs->nups + 1, MAXUPVAL, "upvalues"); - luaM_growvector(fs->ls->L, f->upvalues, fs->nups, f->sizeupvalues, - Upvaldesc, MAXUPVAL, "upvalues"); - while (oldsize < f->sizeupvalues) - f->upvalues[oldsize++].name = NULL; - return &f->upvalues[fs->nups++]; -} - - -static int newupvalue (FuncState *fs, TString *name, expdesc *v) { - Upvaldesc *up = allocupvalue(fs); - FuncState *prev = fs->prev; - if (v->k == VLOCAL) { - up->instack = 1; - up->idx = v->u.var.ridx; - up->kind = getlocalvardesc(prev, v->u.var.vidx)->vd.kind; - lua_assert(eqstr(name, getlocalvardesc(prev, v->u.var.vidx)->vd.name)); - } - else { - up->instack = 0; - up->idx = cast_byte(v->u.info); - up->kind = prev->f->upvalues[v->u.info].kind; - lua_assert(eqstr(name, prev->f->upvalues[v->u.info].name)); - } - up->name = name; - luaC_objbarrier(fs->ls->L, fs->f, name); - return fs->nups - 1; -} - - -/* -** Look for an active local variable with the name 'n' in the -** function 'fs'. If found, initialize 'var' with it and return -** its expression kind; otherwise return -1. -*/ -static int searchvar (FuncState *fs, TString *n, expdesc *var) { - int i; - for (i = cast_int(fs->nactvar) - 1; i >= 0; i--) { - Vardesc *vd = getlocalvardesc(fs, i); - if (eqstr(n, vd->vd.name)) { /* found? */ - if (vd->vd.kind == RDKCTC) /* compile-time constant? */ - init_exp(var, VCONST, fs->firstlocal + i); - else /* real variable */ - init_var(fs, var, i); - return var->k; - } - } - return -1; /* not found */ -} - - -/* -** Mark block where variable at given level was defined -** (to emit close instructions later). -*/ -static void markupval (FuncState *fs, int level) { - BlockCnt *bl = fs->bl; - while (bl->nactvar > level) - bl = bl->previous; - bl->upval = 1; - fs->needclose = 1; -} - - -/* -** Mark that current block has a to-be-closed variable. -*/ -static void marktobeclosed (FuncState *fs) { - BlockCnt *bl = fs->bl; - bl->upval = 1; - bl->insidetbc = 1; - fs->needclose = 1; -} - - -/* -** Find a variable with the given name 'n'. If it is an upvalue, add -** this upvalue into all intermediate functions. If it is a global, set -** 'var' as 'void' as a flag. -*/ -static void singlevaraux (FuncState *fs, TString *n, expdesc *var, int base) { - if (fs == NULL) /* no more levels? */ - init_exp(var, VVOID, 0); /* default is global */ - else { - int v = searchvar(fs, n, var); /* look up locals at current level */ - if (v >= 0) { /* found? */ - if (v == VLOCAL && !base) - markupval(fs, var->u.var.vidx); /* local will be used as an upval */ - } - else { /* not found as local at current level; try upvalues */ - int idx = searchupvalue(fs, n); /* try existing upvalues */ - if (idx < 0) { /* not found? */ - singlevaraux(fs->prev, n, var, 0); /* try upper levels */ - if (var->k == VLOCAL || var->k == VUPVAL) /* local or upvalue? */ - idx = newupvalue(fs, n, var); /* will be a new upvalue */ - else /* it is a global or a constant */ - return; /* don't need to do anything at this level */ - } - init_exp(var, VUPVAL, idx); /* new or old upvalue */ - } - } -} - - -/* -** Find a variable with the given name 'n', handling global variables -** too. -*/ -static void singlevar (LexState *ls, expdesc *var) { - TString *varname = str_checkname(ls); - FuncState *fs = ls->fs; - singlevaraux(fs, varname, var, 1); - if (var->k == VVOID) { /* global name? */ - expdesc key; - singlevaraux(fs, ls->envn, var, 1); /* get environment variable */ - lua_assert(var->k != VVOID); /* this one must exist */ - luaK_exp2anyregup(fs, var); /* but could be a constant */ - codestring(&key, varname); /* key is variable name */ - luaK_indexed(fs, var, &key); /* env[varname] */ - } -} - - -/* -** Adjust the number of results from an expression list 'e' with 'nexps' -** expressions to 'nvars' values. -*/ -static void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) { - FuncState *fs = ls->fs; - int needed = nvars - nexps; /* extra values needed */ - if (hasmultret(e->k)) { /* last expression has multiple returns? */ - int extra = needed + 1; /* discount last expression itself */ - if (extra < 0) - extra = 0; - luaK_setreturns(fs, e, extra); /* last exp. provides the difference */ - } - else { - if (e->k != VVOID) /* at least one expression? */ - luaK_exp2nextreg(fs, e); /* close last expression */ - if (needed > 0) /* missing values? */ - luaK_nil(fs, fs->freereg, needed); /* complete with nils */ - } - if (needed > 0) - luaK_reserveregs(fs, needed); /* registers for extra values */ - else /* adding 'needed' is actually a subtraction */ - fs->freereg += needed; /* remove extra values */ -} - - -#define enterlevel(ls) luaE_incCstack(ls->L) - - -#define leavelevel(ls) ((ls)->L->nCcalls--) - - -/* -** Generates an error that a goto jumps into the scope of some -** local variable. -*/ -static l_noret jumpscopeerror (LexState *ls, Labeldesc *gt) { - TString *tsname = getlocalvardesc(ls->fs, gt->nactvar)->vd.name; - const char *varname = getstr(tsname); - const char *msg = " at line %d jumps into the scope of local '%s'"; - msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line, varname); - luaK_semerror(ls, msg); /* raise the error */ -} - - -/* -** Solves the goto at index 'g' to given 'label' and removes it -** from the list of pending gotos. -** If it jumps into the scope of some variable, raises an error. -*/ -static void solvegoto (LexState *ls, int g, Labeldesc *label) { - int i; - Labellist *gl = &ls->dyd->gt; /* list of gotos */ - Labeldesc *gt = &gl->arr[g]; /* goto to be resolved */ - lua_assert(eqstr(gt->name, label->name)); - if (l_unlikely(gt->nactvar < label->nactvar)) /* enter some scope? */ - jumpscopeerror(ls, gt); - luaK_patchlist(ls->fs, gt->pc, label->pc); - for (i = g; i < gl->n - 1; i++) /* remove goto from pending list */ - gl->arr[i] = gl->arr[i + 1]; - gl->n--; -} - - -/* -** Search for an active label with the given name. -*/ -static Labeldesc *findlabel (LexState *ls, TString *name) { - int i; - Dyndata *dyd = ls->dyd; - /* check labels in current function for a match */ - for (i = ls->fs->firstlabel; i < dyd->label.n; i++) { - Labeldesc *lb = &dyd->label.arr[i]; - if (eqstr(lb->name, name)) /* correct label? */ - return lb; - } - return NULL; /* label not found */ -} - - -/* -** Adds a new label/goto in the corresponding list. -*/ -static int newlabelentry (LexState *ls, Labellist *l, TString *name, - int line, int pc) { - int n = l->n; - luaM_growvector(ls->L, l->arr, n, l->size, - Labeldesc, SHRT_MAX, "labels/gotos"); - l->arr[n].name = name; - l->arr[n].line = line; - l->arr[n].nactvar = ls->fs->nactvar; - l->arr[n].close = 0; - l->arr[n].pc = pc; - l->n = n + 1; - return n; -} - - -static int newgotoentry (LexState *ls, TString *name, int line, int pc) { - return newlabelentry(ls, &ls->dyd->gt, name, line, pc); -} - - -/* -** Solves forward jumps. Check whether new label 'lb' matches any -** pending gotos in current block and solves them. Return true -** if any of the gotos need to close upvalues. -*/ -static int solvegotos (LexState *ls, Labeldesc *lb) { - Labellist *gl = &ls->dyd->gt; - int i = ls->fs->bl->firstgoto; - int needsclose = 0; - while (i < gl->n) { - if (eqstr(gl->arr[i].name, lb->name)) { - needsclose |= gl->arr[i].close; - solvegoto(ls, i, lb); /* will remove 'i' from the list */ - } - else - i++; - } - return needsclose; -} - - -/* -** Create a new label with the given 'name' at the given 'line'. -** 'last' tells whether label is the last non-op statement in its -** block. Solves all pending gotos to this new label and adds -** a close instruction if necessary. -** Returns true iff it added a close instruction. -*/ -static int createlabel (LexState *ls, TString *name, int line, - int last) { - FuncState *fs = ls->fs; - Labellist *ll = &ls->dyd->label; - int l = newlabelentry(ls, ll, name, line, luaK_getlabel(fs)); - if (last) { /* label is last no-op statement in the block? */ - /* assume that locals are already out of scope */ - ll->arr[l].nactvar = fs->bl->nactvar; - } - if (solvegotos(ls, &ll->arr[l])) { /* need close? */ - luaK_codeABC(fs, OP_CLOSE, luaY_nvarstack(fs), 0, 0); - return 1; - } - return 0; -} - - -/* -** Adjust pending gotos to outer level of a block. -*/ -static void movegotosout (FuncState *fs, BlockCnt *bl) { - int i; - Labellist *gl = &fs->ls->dyd->gt; - /* correct pending gotos to current block */ - for (i = bl->firstgoto; i < gl->n; i++) { /* for each pending goto */ - Labeldesc *gt = &gl->arr[i]; - /* leaving a variable scope? */ - if (reglevel(fs, gt->nactvar) > reglevel(fs, bl->nactvar)) - gt->close |= bl->upval; /* jump may need a close */ - gt->nactvar = bl->nactvar; /* update goto level */ - } -} - - -static void enterblock (FuncState *fs, BlockCnt *bl, lu_byte isloop) { - bl->isloop = isloop; - bl->nactvar = fs->nactvar; - bl->firstlabel = fs->ls->dyd->label.n; - bl->firstgoto = fs->ls->dyd->gt.n; - bl->upval = 0; - bl->insidetbc = (fs->bl != NULL && fs->bl->insidetbc); - bl->previous = fs->bl; - fs->bl = bl; - lua_assert(fs->freereg == luaY_nvarstack(fs)); -} - - -/* -** generates an error for an undefined 'goto'. -*/ -static l_noret undefgoto (LexState *ls, Labeldesc *gt) { - const char *msg; - if (eqstr(gt->name, luaS_newliteral(ls->L, "break"))) { - msg = "break outside loop at line %d"; - msg = luaO_pushfstring(ls->L, msg, gt->line); - } - else { - msg = "no visible label '%s' for at line %d"; - msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line); - } - luaK_semerror(ls, msg); -} - - -static void leaveblock (FuncState *fs) { - BlockCnt *bl = fs->bl; - LexState *ls = fs->ls; - int hasclose = 0; - int stklevel = reglevel(fs, bl->nactvar); /* level outside the block */ - removevars(fs, bl->nactvar); /* remove block locals */ - lua_assert(bl->nactvar == fs->nactvar); /* back to level on entry */ - if (bl->isloop) /* has to fix pending breaks? */ - hasclose = createlabel(ls, luaS_newliteral(ls->L, "break"), 0, 0); - if (!hasclose && bl->previous && bl->upval) /* still need a 'close'? */ - luaK_codeABC(fs, OP_CLOSE, stklevel, 0, 0); - fs->freereg = stklevel; /* free registers */ - ls->dyd->label.n = bl->firstlabel; /* remove local labels */ - fs->bl = bl->previous; /* current block now is previous one */ - if (bl->previous) /* was it a nested block? */ - movegotosout(fs, bl); /* update pending gotos to enclosing block */ - else { - if (bl->firstgoto < ls->dyd->gt.n) /* still pending gotos? */ - undefgoto(ls, &ls->dyd->gt.arr[bl->firstgoto]); /* error */ - } -} - - -/* -** adds a new prototype into list of prototypes -*/ -static Proto *addprototype (LexState *ls) { - Proto *clp; - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Proto *f = fs->f; /* prototype of current function */ - if (fs->np >= f->sizep) { - int oldsize = f->sizep; - luaM_growvector(L, f->p, fs->np, f->sizep, Proto *, MAXARG_Bx, "functions"); - while (oldsize < f->sizep) - f->p[oldsize++] = NULL; - } - f->p[fs->np++] = clp = luaF_newproto(L); - luaC_objbarrier(L, f, clp); - return clp; -} - - -/* -** codes instruction to create new closure in parent function. -** The OP_CLOSURE instruction uses the last available register, -** so that, if it invokes the GC, the GC knows which registers -** are in use at that time. - -*/ -static void codeclosure (LexState *ls, expdesc *v) { - FuncState *fs = ls->fs->prev; - init_exp(v, VRELOC, luaK_codeABx(fs, OP_CLOSURE, 0, fs->np - 1)); - luaK_exp2nextreg(fs, v); /* fix it at the last register */ -} - - -static void open_func (LexState *ls, FuncState *fs, BlockCnt *bl) { - Proto *f = fs->f; - fs->prev = ls->fs; /* linked list of funcstates */ - fs->ls = ls; - ls->fs = fs; - fs->pc = 0; - fs->previousline = f->linedefined; - fs->iwthabs = 0; - fs->lasttarget = 0; - fs->freereg = 0; - fs->nk = 0; - fs->nabslineinfo = 0; - fs->np = 0; - fs->nups = 0; - fs->ndebugvars = 0; - fs->nactvar = 0; - fs->needclose = 0; - fs->firstlocal = ls->dyd->actvar.n; - fs->firstlabel = ls->dyd->label.n; - fs->bl = NULL; - f->source = ls->source; - luaC_objbarrier(ls->L, f, f->source); - f->maxstacksize = 2; /* registers 0/1 are always valid */ - enterblock(fs, bl, 0); -} - - -static void close_func (LexState *ls) { - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Proto *f = fs->f; - luaK_ret(fs, luaY_nvarstack(fs), 0); /* final return */ - leaveblock(fs); - lua_assert(fs->bl == NULL); - luaK_finish(fs); - luaM_shrinkvector(L, f->code, f->sizecode, fs->pc, Instruction); - luaM_shrinkvector(L, f->lineinfo, f->sizelineinfo, fs->pc, ls_byte); - luaM_shrinkvector(L, f->abslineinfo, f->sizeabslineinfo, - fs->nabslineinfo, AbsLineInfo); - luaM_shrinkvector(L, f->k, f->sizek, fs->nk, TValue); - luaM_shrinkvector(L, f->p, f->sizep, fs->np, Proto *); - luaM_shrinkvector(L, f->locvars, f->sizelocvars, fs->ndebugvars, LocVar); - luaM_shrinkvector(L, f->upvalues, f->sizeupvalues, fs->nups, Upvaldesc); - ls->fs = fs->prev; - luaC_checkGC(L); -} - - - -/*============================================================*/ -/* GRAMMAR RULES */ -/*============================================================*/ - - -/* -** check whether current token is in the follow set of a block. -** 'until' closes syntactical blocks, but do not close scope, -** so it is handled in separate. -*/ -static int block_follow (LexState *ls, int withuntil) { - switch (ls->t.token) { - case TK_ELSE: case TK_ELSEIF: - case TK_END: case TK_EOS: - return 1; - case TK_UNTIL: return withuntil; - default: return 0; - } -} - - -static void statlist (LexState *ls) { - /* statlist -> { stat [';'] } */ - while (!block_follow(ls, 1)) { - if (ls->t.token == TK_RETURN) { - statement(ls); - return; /* 'return' must be last statement */ - } - statement(ls); - } -} - - -static void fieldsel (LexState *ls, expdesc *v) { - /* fieldsel -> ['.' | ':'] NAME */ - FuncState *fs = ls->fs; - expdesc key; - luaK_exp2anyregup(fs, v); - luaX_next(ls); /* skip the dot or colon */ - codename(ls, &key); - luaK_indexed(fs, v, &key); -} - - -static void yindex (LexState *ls, expdesc *v) { - /* index -> '[' expr ']' */ - luaX_next(ls); /* skip the '[' */ - expr(ls, v); - luaK_exp2val(ls->fs, v); - checknext(ls, ']'); -} - - -/* -** {====================================================================== -** Rules for Constructors -** ======================================================================= -*/ - - -typedef struct ConsControl { - expdesc v; /* last list item read */ - expdesc *t; /* table descriptor */ - int nh; /* total number of 'record' elements */ - int na; /* number of array elements already stored */ - int tostore; /* number of array elements pending to be stored */ -} ConsControl; - - -static void recfield (LexState *ls, ConsControl *cc) { - /* recfield -> (NAME | '['exp']') = exp */ - FuncState *fs = ls->fs; - int reg = ls->fs->freereg; - expdesc tab, key, val; - if (ls->t.token == TK_NAME) { - checklimit(fs, cc->nh, MAX_INT, "items in a constructor"); - codename(ls, &key); - } - else /* ls->t.token == '[' */ - yindex(ls, &key); - cc->nh++; - checknext(ls, '='); - tab = *cc->t; - luaK_indexed(fs, &tab, &key); - expr(ls, &val); - luaK_storevar(fs, &tab, &val); - fs->freereg = reg; /* free registers */ -} - - -static void closelistfield (FuncState *fs, ConsControl *cc) { - if (cc->v.k == VVOID) return; /* there is no list item */ - luaK_exp2nextreg(fs, &cc->v); - cc->v.k = VVOID; - if (cc->tostore == LFIELDS_PER_FLUSH) { - luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); /* flush */ - cc->na += cc->tostore; - cc->tostore = 0; /* no more items pending */ - } -} - - -static void lastlistfield (FuncState *fs, ConsControl *cc) { - if (cc->tostore == 0) return; - if (hasmultret(cc->v.k)) { - luaK_setmultret(fs, &cc->v); - luaK_setlist(fs, cc->t->u.info, cc->na, LUA_MULTRET); - cc->na--; /* do not count last expression (unknown number of elements) */ - } - else { - if (cc->v.k != VVOID) - luaK_exp2nextreg(fs, &cc->v); - luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); - } - cc->na += cc->tostore; -} - - -static void listfield (LexState *ls, ConsControl *cc) { - /* listfield -> exp */ - expr(ls, &cc->v); - cc->tostore++; -} - - -static void field (LexState *ls, ConsControl *cc) { - /* field -> listfield | recfield */ - switch(ls->t.token) { - case TK_NAME: { /* may be 'listfield' or 'recfield' */ - if (luaX_lookahead(ls) != '=') /* expression? */ - listfield(ls, cc); - else - recfield(ls, cc); - break; - } - case '[': { - recfield(ls, cc); - break; - } - default: { - listfield(ls, cc); - break; - } - } -} - - -static void constructor (LexState *ls, expdesc *t) { - /* constructor -> '{' [ field { sep field } [sep] ] '}' - sep -> ',' | ';' */ - FuncState *fs = ls->fs; - int line = ls->linenumber; - int pc = luaK_codeABC(fs, OP_NEWTABLE, 0, 0, 0); - ConsControl cc; - luaK_code(fs, 0); /* space for extra arg. */ - cc.na = cc.nh = cc.tostore = 0; - cc.t = t; - init_exp(t, VNONRELOC, fs->freereg); /* table will be at stack top */ - luaK_reserveregs(fs, 1); - init_exp(&cc.v, VVOID, 0); /* no value (yet) */ - checknext(ls, '{'); - do { - lua_assert(cc.v.k == VVOID || cc.tostore > 0); - if (ls->t.token == '}') break; - closelistfield(fs, &cc); - field(ls, &cc); - } while (testnext(ls, ',') || testnext(ls, ';')); - check_match(ls, '}', '{', line); - lastlistfield(fs, &cc); - luaK_settablesize(fs, pc, t->u.info, cc.na, cc.nh); -} - -/* }====================================================================== */ - - -static void setvararg (FuncState *fs, int nparams) { - fs->f->flag |= PF_ISVARARG; - luaK_codeABC(fs, OP_VARARGPREP, nparams, 0, 0); -} - - -static void parlist (LexState *ls) { - /* parlist -> [ {NAME ','} (NAME | '...') ] */ - FuncState *fs = ls->fs; - Proto *f = fs->f; - int nparams = 0; - int isvararg = 0; - if (ls->t.token != ')') { /* is 'parlist' not empty? */ - do { - switch (ls->t.token) { - case TK_NAME: { - new_localvar(ls, str_checkname(ls)); - nparams++; - break; - } - case TK_DOTS: { - luaX_next(ls); - isvararg = 1; - break; - } - default: luaX_syntaxerror(ls, " or '...' expected"); - } - } while (!isvararg && testnext(ls, ',')); - } - adjustlocalvars(ls, nparams); - f->numparams = cast_byte(fs->nactvar); - if (isvararg) - setvararg(fs, f->numparams); /* declared vararg */ - luaK_reserveregs(fs, fs->nactvar); /* reserve registers for parameters */ -} - - -static void body (LexState *ls, expdesc *e, int ismethod, int line) { - /* body -> '(' parlist ')' block END */ - FuncState new_fs; - BlockCnt bl; - new_fs.f = addprototype(ls); - new_fs.f->linedefined = line; - open_func(ls, &new_fs, &bl); - checknext(ls, '('); - if (ismethod) { - new_localvarliteral(ls, "self"); /* create 'self' parameter */ - adjustlocalvars(ls, 1); - } - parlist(ls); - checknext(ls, ')'); - statlist(ls); - new_fs.f->lastlinedefined = ls->linenumber; - check_match(ls, TK_END, TK_FUNCTION, line); - codeclosure(ls, e); - close_func(ls); -} - - -static int explist (LexState *ls, expdesc *v) { - /* explist -> expr { ',' expr } */ - int n = 1; /* at least one expression */ - expr(ls, v); - while (testnext(ls, ',')) { - luaK_exp2nextreg(ls->fs, v); - expr(ls, v); - n++; - } - return n; -} - - -static void funcargs (LexState *ls, expdesc *f) { - FuncState *fs = ls->fs; - expdesc args; - int base, nparams; - int line = ls->linenumber; - switch (ls->t.token) { - case '(': { /* funcargs -> '(' [ explist ] ')' */ - luaX_next(ls); - if (ls->t.token == ')') /* arg list is empty? */ - args.k = VVOID; - else { - explist(ls, &args); - if (hasmultret(args.k)) - luaK_setmultret(fs, &args); - } - check_match(ls, ')', '(', line); - break; - } - case '{': { /* funcargs -> constructor */ - constructor(ls, &args); - break; - } - case TK_STRING: { /* funcargs -> STRING */ - codestring(&args, ls->t.seminfo.ts); - luaX_next(ls); /* must use 'seminfo' before 'next' */ - break; - } - default: { - luaX_syntaxerror(ls, "function arguments expected"); - } - } - lua_assert(f->k == VNONRELOC); - base = f->u.info; /* base register for call */ - if (hasmultret(args.k)) - nparams = LUA_MULTRET; /* open call */ - else { - if (args.k != VVOID) - luaK_exp2nextreg(fs, &args); /* close last argument */ - nparams = fs->freereg - (base+1); - } - init_exp(f, VCALL, luaK_codeABC(fs, OP_CALL, base, nparams+1, 2)); - luaK_fixline(fs, line); - fs->freereg = base+1; /* call removes function and arguments and leaves - one result (unless changed later) */ -} - - - - -/* -** {====================================================================== -** Expression parsing -** ======================================================================= -*/ - - -static void primaryexp (LexState *ls, expdesc *v) { - /* primaryexp -> NAME | '(' expr ')' */ - switch (ls->t.token) { - case '(': { - int line = ls->linenumber; - luaX_next(ls); - expr(ls, v); - check_match(ls, ')', '(', line); - luaK_dischargevars(ls->fs, v); - return; - } - case TK_NAME: { - singlevar(ls, v); - return; - } - default: { - luaX_syntaxerror(ls, "unexpected symbol"); - } - } -} - - -static void suffixedexp (LexState *ls, expdesc *v) { - /* suffixedexp -> - primaryexp { '.' NAME | '[' exp ']' | ':' NAME funcargs | funcargs } */ - FuncState *fs = ls->fs; - primaryexp(ls, v); - for (;;) { - switch (ls->t.token) { - case '.': { /* fieldsel */ - fieldsel(ls, v); - break; - } - case '[': { /* '[' exp ']' */ - expdesc key; - luaK_exp2anyregup(fs, v); - yindex(ls, &key); - luaK_indexed(fs, v, &key); - break; - } - case ':': { /* ':' NAME funcargs */ - expdesc key; - luaX_next(ls); - codename(ls, &key); - luaK_self(fs, v, &key); - funcargs(ls, v); - break; - } - case '(': case TK_STRING: case '{': { /* funcargs */ - luaK_exp2nextreg(fs, v); - funcargs(ls, v); - break; - } - default: return; - } - } -} - - -static void simpleexp (LexState *ls, expdesc *v) { - /* simpleexp -> FLT | INT | STRING | NIL | TRUE | FALSE | ... | - constructor | FUNCTION body | suffixedexp */ - switch (ls->t.token) { - case TK_FLT: { - init_exp(v, VKFLT, 0); - v->u.nval = ls->t.seminfo.r; - break; - } - case TK_INT: { - init_exp(v, VKINT, 0); - v->u.ival = ls->t.seminfo.i; - break; - } - case TK_STRING: { - codestring(v, ls->t.seminfo.ts); - break; - } - case TK_NIL: { - init_exp(v, VNIL, 0); - break; - } - case TK_TRUE: { - init_exp(v, VTRUE, 0); - break; - } - case TK_FALSE: { - init_exp(v, VFALSE, 0); - break; - } - case TK_DOTS: { /* vararg */ - FuncState *fs = ls->fs; - check_condition(ls, fs->f->flag & PF_ISVARARG, - "cannot use '...' outside a vararg function"); - init_exp(v, VVARARG, luaK_codeABC(fs, OP_VARARG, 0, 0, 1)); - break; - } - case '{': { /* constructor */ - constructor(ls, v); - return; - } - case TK_FUNCTION: { - luaX_next(ls); - body(ls, v, 0, ls->linenumber); - return; - } - default: { - suffixedexp(ls, v); - return; - } - } - luaX_next(ls); -} - - -static UnOpr getunopr (int op) { - switch (op) { - case TK_NOT: return OPR_NOT; - case '-': return OPR_MINUS; - case '~': return OPR_BNOT; - case '#': return OPR_LEN; - default: return OPR_NOUNOPR; - } -} - - -static BinOpr getbinopr (int op) { - switch (op) { - case '+': return OPR_ADD; - case '-': return OPR_SUB; - case '*': return OPR_MUL; - case '%': return OPR_MOD; - case '^': return OPR_POW; - case '/': return OPR_DIV; - case TK_IDIV: return OPR_IDIV; - case '&': return OPR_BAND; - case '|': return OPR_BOR; - case '~': return OPR_BXOR; - case TK_SHL: return OPR_SHL; - case TK_SHR: return OPR_SHR; - case TK_CONCAT: return OPR_CONCAT; - case TK_NE: return OPR_NE; - case TK_EQ: return OPR_EQ; - case '<': return OPR_LT; - case TK_LE: return OPR_LE; - case '>': return OPR_GT; - case TK_GE: return OPR_GE; - case TK_AND: return OPR_AND; - case TK_OR: return OPR_OR; - default: return OPR_NOBINOPR; - } -} - - -/* -** Priority table for binary operators. -*/ -static const struct { - lu_byte left; /* left priority for each binary operator */ - lu_byte right; /* right priority */ -} priority[] = { /* ORDER OPR */ - {10, 10}, {10, 10}, /* '+' '-' */ - {11, 11}, {11, 11}, /* '*' '%' */ - {14, 13}, /* '^' (right associative) */ - {11, 11}, {11, 11}, /* '/' '//' */ - {6, 6}, {4, 4}, {5, 5}, /* '&' '|' '~' */ - {7, 7}, {7, 7}, /* '<<' '>>' */ - {9, 8}, /* '..' (right associative) */ - {3, 3}, {3, 3}, {3, 3}, /* ==, <, <= */ - {3, 3}, {3, 3}, {3, 3}, /* ~=, >, >= */ - {2, 2}, {1, 1} /* and, or */ -}; - -#define UNARY_PRIORITY 12 /* priority for unary operators */ - - -/* -** subexpr -> (simpleexp | unop subexpr) { binop subexpr } -** where 'binop' is any binary operator with a priority higher than 'limit' -*/ -static BinOpr subexpr (LexState *ls, expdesc *v, int limit) { - BinOpr op; - UnOpr uop; - enterlevel(ls); - uop = getunopr(ls->t.token); - if (uop != OPR_NOUNOPR) { /* prefix (unary) operator? */ - int line = ls->linenumber; - luaX_next(ls); /* skip operator */ - subexpr(ls, v, UNARY_PRIORITY); - luaK_prefix(ls->fs, uop, v, line); - } - else simpleexp(ls, v); - /* expand while operators have priorities higher than 'limit' */ - op = getbinopr(ls->t.token); - while (op != OPR_NOBINOPR && priority[op].left > limit) { - expdesc v2; - BinOpr nextop; - int line = ls->linenumber; - luaX_next(ls); /* skip operator */ - luaK_infix(ls->fs, op, v); - /* read sub-expression with higher priority */ - nextop = subexpr(ls, &v2, priority[op].right); - luaK_posfix(ls->fs, op, v, &v2, line); - op = nextop; - } - leavelevel(ls); - return op; /* return first untreated operator */ -} - - -static void expr (LexState *ls, expdesc *v) { - subexpr(ls, v, 0); -} - -/* }==================================================================== */ - - - -/* -** {====================================================================== -** Rules for Statements -** ======================================================================= -*/ - - -static void block (LexState *ls) { - /* block -> statlist */ - FuncState *fs = ls->fs; - BlockCnt bl; - enterblock(fs, &bl, 0); - statlist(ls); - leaveblock(fs); -} - - -/* -** structure to chain all variables in the left-hand side of an -** assignment -*/ -struct LHS_assign { - struct LHS_assign *prev; - expdesc v; /* variable (global, local, upvalue, or indexed) */ -}; - - -/* -** check whether, in an assignment to an upvalue/local variable, the -** upvalue/local variable is begin used in a previous assignment to a -** table. If so, save original upvalue/local value in a safe place and -** use this safe copy in the previous assignment. -*/ -static void check_conflict (LexState *ls, struct LHS_assign *lh, expdesc *v) { - FuncState *fs = ls->fs; - int extra = fs->freereg; /* eventual position to save local variable */ - int conflict = 0; - for (; lh; lh = lh->prev) { /* check all previous assignments */ - if (vkisindexed(lh->v.k)) { /* assignment to table field? */ - if (lh->v.k == VINDEXUP) { /* is table an upvalue? */ - if (v->k == VUPVAL && lh->v.u.ind.t == v->u.info) { - conflict = 1; /* table is the upvalue being assigned now */ - lh->v.k = VINDEXSTR; - lh->v.u.ind.t = extra; /* assignment will use safe copy */ - } - } - else { /* table is a register */ - if (v->k == VLOCAL && lh->v.u.ind.t == v->u.var.ridx) { - conflict = 1; /* table is the local being assigned now */ - lh->v.u.ind.t = extra; /* assignment will use safe copy */ - } - /* is index the local being assigned? */ - if (lh->v.k == VINDEXED && v->k == VLOCAL && - lh->v.u.ind.idx == v->u.var.ridx) { - conflict = 1; - lh->v.u.ind.idx = extra; /* previous assignment will use safe copy */ - } - } - } - } - if (conflict) { - /* copy upvalue/local value to a temporary (in position 'extra') */ - if (v->k == VLOCAL) - luaK_codeABC(fs, OP_MOVE, extra, v->u.var.ridx, 0); - else - luaK_codeABC(fs, OP_GETUPVAL, extra, v->u.info, 0); - luaK_reserveregs(fs, 1); - } -} - -/* -** Parse and compile a multiple assignment. The first "variable" -** (a 'suffixedexp') was already read by the caller. -** -** assignment -> suffixedexp restassign -** restassign -> ',' suffixedexp restassign | '=' explist -*/ -static void restassign (LexState *ls, struct LHS_assign *lh, int nvars) { - expdesc e; - check_condition(ls, vkisvar(lh->v.k), "syntax private_lua_error"); - check_readonly(ls, &lh->v); - if (testnext(ls, ',')) { /* restassign -> ',' suffixedexp restassign */ - struct LHS_assign nv; - nv.prev = lh; - suffixedexp(ls, &nv.v); - if (!vkisindexed(nv.v.k)) - check_conflict(ls, lh, &nv.v); - enterlevel(ls); /* control recursion depth */ - restassign(ls, &nv, nvars+1); - leavelevel(ls); - } - else { /* restassign -> '=' explist */ - int nexps; - checknext(ls, '='); - nexps = explist(ls, &e); - if (nexps != nvars) - adjust_assign(ls, nvars, nexps, &e); - else { - luaK_setoneret(ls->fs, &e); /* close last expression */ - luaK_storevar(ls->fs, &lh->v, &e); - return; /* avoid default */ - } - } - init_exp(&e, VNONRELOC, ls->fs->freereg-1); /* default assignment */ - luaK_storevar(ls->fs, &lh->v, &e); -} - - -static int cond (LexState *ls) { - /* cond -> exp */ - expdesc v; - expr(ls, &v); /* read condition */ - if (v.k == VNIL) v.k = VFALSE; /* 'falses' are all equal here */ - luaK_goiftrue(ls->fs, &v); - return v.f; -} - - -static void gotostat (LexState *ls) { - FuncState *fs = ls->fs; - int line = ls->linenumber; - TString *name = str_checkname(ls); /* label's name */ - Labeldesc *lb = findlabel(ls, name); - if (lb == NULL) /* no label? */ - /* forward jump; will be resolved when the label is declared */ - newgotoentry(ls, name, line, luaK_jump(fs)); - else { /* found a label */ - /* backward jump; will be resolved here */ - int lblevel = reglevel(fs, lb->nactvar); /* label level */ - if (luaY_nvarstack(fs) > lblevel) /* leaving the scope of a variable? */ - luaK_codeABC(fs, OP_CLOSE, lblevel, 0, 0); - /* create jump and link it to the label */ - luaK_patchlist(fs, luaK_jump(fs), lb->pc); - } -} - - -/* -** Break statement. Semantically equivalent to "goto break". -*/ -static void breakstat (LexState *ls) { - int line = ls->linenumber; - luaX_next(ls); /* skip break */ - newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, luaK_jump(ls->fs)); -} - - -/* -** Check whether there is already a label with the given 'name'. -*/ -static void checkrepeated (LexState *ls, TString *name) { - Labeldesc *lb = findlabel(ls, name); - if (l_unlikely(lb != NULL)) { /* already defined? */ - const char *msg = "label '%s' already defined on line %d"; - msg = luaO_pushfstring(ls->L, msg, getstr(name), lb->line); - luaK_semerror(ls, msg); /* error */ - } -} - - -static void labelstat (LexState *ls, TString *name, int line) { - /* label -> '::' NAME '::' */ - checknext(ls, TK_DBCOLON); /* skip double colon */ - while (ls->t.token == ';' || ls->t.token == TK_DBCOLON) - statement(ls); /* skip other no-op statements */ - checkrepeated(ls, name); /* check for repeated labels */ - createlabel(ls, name, line, block_follow(ls, 0)); -} - - -static void whilestat (LexState *ls, int line) { - /* whilestat -> WHILE cond DO block END */ - FuncState *fs = ls->fs; - int whileinit; - int condexit; - BlockCnt bl; - luaX_next(ls); /* skip WHILE */ - whileinit = luaK_getlabel(fs); - condexit = cond(ls); - enterblock(fs, &bl, 1); - checknext(ls, TK_DO); - block(ls); - luaK_jumpto(fs, whileinit); - check_match(ls, TK_END, TK_WHILE, line); - leaveblock(fs); - luaK_patchtohere(fs, condexit); /* false conditions finish the loop */ -} - - -static void repeatstat (LexState *ls, int line) { - /* repeatstat -> REPEAT block UNTIL cond */ - int condexit; - FuncState *fs = ls->fs; - int repeat_init = luaK_getlabel(fs); - BlockCnt bl1, bl2; - enterblock(fs, &bl1, 1); /* loop block */ - enterblock(fs, &bl2, 0); /* scope block */ - luaX_next(ls); /* skip REPEAT */ - statlist(ls); - check_match(ls, TK_UNTIL, TK_REPEAT, line); - condexit = cond(ls); /* read condition (inside scope block) */ - leaveblock(fs); /* finish scope */ - if (bl2.upval) { /* upvalues? */ - int exit = luaK_jump(fs); /* normal exit must jump over fix */ - luaK_patchtohere(fs, condexit); /* repetition must close upvalues */ - luaK_codeABC(fs, OP_CLOSE, reglevel(fs, bl2.nactvar), 0, 0); - condexit = luaK_jump(fs); /* repeat after closing upvalues */ - luaK_patchtohere(fs, exit); /* normal exit comes to here */ - } - luaK_patchlist(fs, condexit, repeat_init); /* close the loop */ - leaveblock(fs); /* finish loop */ -} - - -/* -** Read an expression and generate code to put its results in next -** stack slot. -** -*/ -static void exp1 (LexState *ls) { - expdesc e; - expr(ls, &e); - luaK_exp2nextreg(ls->fs, &e); - lua_assert(e.k == VNONRELOC); -} - - -/* -** Fix for instruction at position 'pc' to jump to 'dest'. -** (Jump addresses are relative in Lua). 'back' true means -** a back jump. -*/ -static void fixforjump (FuncState *fs, int pc, int dest, int back) { - Instruction *jmp = &fs->f->code[pc]; - int offset = dest - (pc + 1); - if (back) - offset = -offset; - if (l_unlikely(offset > MAXARG_Bx)) - luaX_syntaxerror(fs->ls, "control structure too long"); - SETARG_Bx(*jmp, offset); -} - - -/* -** Generate code for a 'for' loop. -*/ -static void forbody (LexState *ls, int base, int line, int nvars, int isgen) { - /* forbody -> DO block */ - static const OpCode forprep[2] = {OP_FORPREP, OP_TFORPREP}; - static const OpCode forloop[2] = {OP_FORLOOP, OP_TFORLOOP}; - BlockCnt bl; - FuncState *fs = ls->fs; - int prep, endfor; - checknext(ls, TK_DO); - prep = luaK_codeABx(fs, forprep[isgen], base, 0); - fs->freereg--; /* both 'forprep' remove one register from the stack */ - enterblock(fs, &bl, 0); /* scope for declared variables */ - adjustlocalvars(ls, nvars); - luaK_reserveregs(fs, nvars); - block(ls); - leaveblock(fs); /* end of scope for declared variables */ - fixforjump(fs, prep, luaK_getlabel(fs), 0); - if (isgen) { /* generic for? */ - luaK_codeABC(fs, OP_TFORCALL, base, 0, nvars); - luaK_fixline(fs, line); - } - endfor = luaK_codeABx(fs, forloop[isgen], base, 0); - fixforjump(fs, endfor, prep + 1, 1); - luaK_fixline(fs, line); -} - - -static void fornum (LexState *ls, TString *varname, int line) { - /* fornum -> NAME = exp,exp[,exp] forbody */ - FuncState *fs = ls->fs; - int base = fs->freereg; - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvarkind(ls, varname, RDKCONST); /* control variable */ - checknext(ls, '='); - exp1(ls); /* initial value */ - checknext(ls, ','); - exp1(ls); /* limit */ - if (testnext(ls, ',')) - exp1(ls); /* optional step */ - else { /* default step = 1 */ - luaK_int(fs, fs->freereg, 1); - luaK_reserveregs(fs, 1); - } - adjustlocalvars(ls, 2); /* start scope for internal variables */ - forbody(ls, base, line, 1, 0); -} - - -static void forlist (LexState *ls, TString *indexname) { - /* forlist -> NAME {,NAME} IN explist forbody */ - FuncState *fs = ls->fs; - expdesc e; - int nvars = 4; /* function, state, closing, control */ - int line; - int base = fs->freereg; - /* create internal variables */ - new_localvarliteral(ls, "(for state)"); /* iterator function */ - new_localvarliteral(ls, "(for state)"); /* state */ - new_localvarliteral(ls, "(for state)"); /* closing var. (after swap) */ - new_localvarkind(ls, indexname, RDKCONST); /* control variable */ - /* other declared variables */ - while (testnext(ls, ',')) { - new_localvar(ls, str_checkname(ls)); - nvars++; - } - checknext(ls, TK_IN); - line = ls->linenumber; - adjust_assign(ls, 4, explist(ls, &e), &e); - adjustlocalvars(ls, 3); /* start scope for internal variables */ - marktobeclosed(fs); /* last internal var. must be closed */ - luaK_checkstack(fs, 2); /* extra space to call iterator */ - forbody(ls, base, line, nvars - 3, 1); -} - - -static void forstat (LexState *ls, int line) { - /* forstat -> FOR (fornum | forlist) END */ - FuncState *fs = ls->fs; - TString *varname; - BlockCnt bl; - enterblock(fs, &bl, 1); /* scope for loop and control variables */ - luaX_next(ls); /* skip 'for' */ - varname = str_checkname(ls); /* first variable name */ - switch (ls->t.token) { - case '=': fornum(ls, varname, line); break; - case ',': case TK_IN: forlist(ls, varname); break; - default: luaX_syntaxerror(ls, "'=' or 'in' expected"); - } - check_match(ls, TK_END, TK_FOR, line); - leaveblock(fs); /* loop scope ('break' jumps to this point) */ -} - - -static void test_then_block (LexState *ls, int *escapelist) { - /* test_then_block -> [IF | ELSEIF] cond THEN block */ - BlockCnt bl; - FuncState *fs = ls->fs; - expdesc v; - int jf; /* instruction to skip 'then' code (if condition is false) */ - luaX_next(ls); /* skip IF or ELSEIF */ - expr(ls, &v); /* read condition */ - checknext(ls, TK_THEN); - if (ls->t.token == TK_BREAK) { /* 'if x then break' ? */ - int line = ls->linenumber; - luaK_goiffalse(ls->fs, &v); /* will jump if condition is true */ - luaX_next(ls); /* skip 'break' */ - enterblock(fs, &bl, 0); /* must enter block before 'goto' */ - newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, v.t); - while (testnext(ls, ';')) {} /* skip semicolons */ - if (block_follow(ls, 0)) { /* jump is the entire block? */ - leaveblock(fs); - return; /* and that is it */ - } - else /* must skip over 'then' part if condition is false */ - jf = luaK_jump(fs); - } - else { /* regular case (not a break) */ - luaK_goiftrue(ls->fs, &v); /* skip over block if condition is false */ - enterblock(fs, &bl, 0); - jf = v.f; - } - statlist(ls); /* 'then' part */ - leaveblock(fs); - if (ls->t.token == TK_ELSE || - ls->t.token == TK_ELSEIF) /* followed by 'else'/'elseif'? */ - luaK_concat(fs, escapelist, luaK_jump(fs)); /* must jump over it */ - luaK_patchtohere(fs, jf); -} - - -static void ifstat (LexState *ls, int line) { - /* ifstat -> IF cond THEN block {ELSEIF cond THEN block} [ELSE block] END */ - FuncState *fs = ls->fs; - int escapelist = NO_JUMP; /* exit list for finished parts */ - test_then_block(ls, &escapelist); /* IF cond THEN block */ - while (ls->t.token == TK_ELSEIF) - test_then_block(ls, &escapelist); /* ELSEIF cond THEN block */ - if (testnext(ls, TK_ELSE)) - block(ls); /* 'else' part */ - check_match(ls, TK_END, TK_IF, line); - luaK_patchtohere(fs, escapelist); /* patch escape list to 'if' end */ -} - - -static void localfunc (LexState *ls) { - expdesc b; - FuncState *fs = ls->fs; - int fvar = fs->nactvar; /* function's variable index */ - new_localvar(ls, str_checkname(ls)); /* new local variable */ - adjustlocalvars(ls, 1); /* enter its scope */ - body(ls, &b, 0, ls->linenumber); /* function created in next register */ - /* debug information will only see the variable after this point! */ - localdebuginfo(fs, fvar)->startpc = fs->pc; -} - - -static int getlocalattribute (LexState *ls) { - /* ATTRIB -> ['<' Name '>'] */ - if (testnext(ls, '<')) { - TString *ts = str_checkname(ls); - const char *attr = getstr(ts); - checknext(ls, '>'); - if (strcmp(attr, "const") == 0) - return RDKCONST; /* read-only variable */ - else if (strcmp(attr, "close") == 0) - return RDKTOCLOSE; /* to-be-closed variable */ - else - luaK_semerror(ls, - luaO_pushfstring(ls->L, "unknown attribute '%s'", attr)); - } - return VDKREG; /* regular variable */ -} - - -static void checktoclose (FuncState *fs, int level) { - if (level != -1) { /* is there a to-be-closed variable? */ - marktobeclosed(fs); - luaK_codeABC(fs, OP_TBC, reglevel(fs, level), 0, 0); - } -} - - -static void localstat (LexState *ls) { - /* stat -> LOCAL NAME ATTRIB { ',' NAME ATTRIB } ['=' explist] */ - FuncState *fs = ls->fs; - int toclose = -1; /* index of to-be-closed variable (if any) */ - Vardesc *var; /* last variable */ - int vidx; /* index of last variable */ - int nvars = 0; - int nexps; - expdesc e; - do { - TString *vname = str_checkname(ls); - int kind = getlocalattribute(ls); - vidx = new_localvarkind(ls, vname, kind); - if (kind == RDKTOCLOSE) { /* to-be-closed? */ - if (toclose != -1) /* one already present? */ - luaK_semerror(ls, "multiple to-be-closed variables in local list"); - toclose = fs->nactvar + nvars; - } - nvars++; - } while (testnext(ls, ',')); - if (testnext(ls, '=')) - nexps = explist(ls, &e); - else { - e.k = VVOID; - nexps = 0; - } - var = getlocalvardesc(fs, vidx); /* get last variable */ - if (nvars == nexps && /* no adjustments? */ - var->vd.kind == RDKCONST && /* last variable is const? */ - luaK_exp2const(fs, &e, &var->k)) { /* compile-time constant? */ - var->vd.kind = RDKCTC; /* variable is a compile-time constant */ - adjustlocalvars(ls, nvars - 1); /* exclude last variable */ - fs->nactvar++; /* but count it */ - } - else { - adjust_assign(ls, nvars, nexps, &e); - adjustlocalvars(ls, nvars); - } - checktoclose(fs, toclose); -} - - -static int funcname (LexState *ls, expdesc *v) { - /* funcname -> NAME {fieldsel} [':' NAME] */ - int ismethod = 0; - singlevar(ls, v); - while (ls->t.token == '.') - fieldsel(ls, v); - if (ls->t.token == ':') { - ismethod = 1; - fieldsel(ls, v); - } - return ismethod; -} - - -static void funcstat (LexState *ls, int line) { - /* funcstat -> FUNCTION funcname body */ - int ismethod; - expdesc v, b; - luaX_next(ls); /* skip FUNCTION */ - ismethod = funcname(ls, &v); - body(ls, &b, ismethod, line); - check_readonly(ls, &v); - luaK_storevar(ls->fs, &v, &b); - luaK_fixline(ls->fs, line); /* definition "happens" in the first line */ -} - - -static void exprstat (LexState *ls) { - /* stat -> func | assignment */ - FuncState *fs = ls->fs; - struct LHS_assign v; - suffixedexp(ls, &v.v); - if (ls->t.token == '=' || ls->t.token == ',') { /* stat -> assignment ? */ - v.prev = NULL; - restassign(ls, &v, 1); - } - else { /* stat -> func */ - Instruction *inst; - check_condition(ls, v.v.k == VCALL, "syntax private_lua_error"); - inst = &getinstruction(fs, &v.v); - SETARG_C(*inst, 1); /* call statement uses no results */ - } -} - - -static void retstat (LexState *ls) { - /* stat -> RETURN [explist] [';'] */ - FuncState *fs = ls->fs; - expdesc e; - int nret; /* number of values being returned */ - int first = luaY_nvarstack(fs); /* first slot to be returned */ - if (block_follow(ls, 1) || ls->t.token == ';') - nret = 0; /* return no values */ - else { - nret = explist(ls, &e); /* optional return values */ - if (hasmultret(e.k)) { - luaK_setmultret(fs, &e); - if (e.k == VCALL && nret == 1 && !fs->bl->insidetbc) { /* tail call? */ - SET_OPCODE(getinstruction(fs,&e), OP_TAILCALL); - lua_assert(GETARG_A(getinstruction(fs,&e)) == luaY_nvarstack(fs)); - } - nret = LUA_MULTRET; /* return all values */ - } - else { - if (nret == 1) /* only one single value? */ - first = luaK_exp2anyreg(fs, &e); /* can use original slot */ - else { /* values must go to the top of the stack */ - luaK_exp2nextreg(fs, &e); - lua_assert(nret == fs->freereg - first); - } - } - } - luaK_ret(fs, first, nret); - testnext(ls, ';'); /* skip optional semicolon */ -} - - -static void statement (LexState *ls) { - int line = ls->linenumber; /* may be needed for error messages */ - enterlevel(ls); - switch (ls->t.token) { - case ';': { /* stat -> ';' (empty statement) */ - luaX_next(ls); /* skip ';' */ - break; - } - case TK_IF: { /* stat -> ifstat */ - ifstat(ls, line); - break; - } - case TK_WHILE: { /* stat -> whilestat */ - whilestat(ls, line); - break; - } - case TK_DO: { /* stat -> DO block END */ - luaX_next(ls); /* skip DO */ - block(ls); - check_match(ls, TK_END, TK_DO, line); - break; - } - case TK_FOR: { /* stat -> forstat */ - forstat(ls, line); - break; - } - case TK_REPEAT: { /* stat -> repeatstat */ - repeatstat(ls, line); - break; - } - case TK_FUNCTION: { /* stat -> funcstat */ - funcstat(ls, line); - break; - } - case TK_LOCAL: { /* stat -> localstat */ - luaX_next(ls); /* skip LOCAL */ - if (testnext(ls, TK_FUNCTION)) /* local function? */ - localfunc(ls); - else - localstat(ls); - break; - } - case TK_DBCOLON: { /* stat -> label */ - luaX_next(ls); /* skip double colon */ - labelstat(ls, str_checkname(ls), line); - break; - } - case TK_RETURN: { /* stat -> retstat */ - luaX_next(ls); /* skip RETURN */ - retstat(ls); - break; - } - case TK_BREAK: { /* stat -> breakstat */ - breakstat(ls); - break; - } - case TK_GOTO: { /* stat -> 'goto' NAME */ - luaX_next(ls); /* skip 'goto' */ - gotostat(ls); - break; - } - default: { /* stat -> func | assignment */ - exprstat(ls); - break; - } - } - lua_assert(ls->fs->f->maxstacksize >= ls->fs->freereg && - ls->fs->freereg >= luaY_nvarstack(ls->fs)); - ls->fs->freereg = luaY_nvarstack(ls->fs); /* free registers */ - leavelevel(ls); -} - -/* }====================================================================== */ - - -/* -** compiles the main function, which is a regular vararg function with an -** upvalue named LUA_ENV -*/ -static void mainfunc (LexState *ls, FuncState *fs) { - BlockCnt bl; - Upvaldesc *env; - open_func(ls, fs, &bl); - setvararg(fs, 0); /* main function is always declared vararg */ - env = allocupvalue(fs); /* ...set environment upvalue */ - env->instack = 1; - env->idx = 0; - env->kind = VDKREG; - env->name = ls->envn; - luaC_objbarrier(ls->L, fs->f, env->name); - luaX_next(ls); /* read first token */ - statlist(ls); /* parse main body */ - check(ls, TK_EOS); - close_func(ls); -} - - -LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, - Dyndata *dyd, const char *name, int firstchar) { - LexState lexstate; - FuncState funcstate; - LClosure *cl = luaF_newLclosure(L, 1); /* create main closure */ - setclLvalue2s(L, L->top.p, cl); /* anchor it (to avoid being collected) */ - luaD_inctop(L); - lexstate.h = luaH_new(L); /* create table for scanner */ - sethvalue2s(L, L->top.p, lexstate.h); /* anchor it */ - luaD_inctop(L); - funcstate.f = cl->p = luaF_newproto(L); - luaC_objbarrier(L, cl, cl->p); - funcstate.f->source = luaS_new(L, name); /* create and anchor TString */ - luaC_objbarrier(L, funcstate.f, funcstate.f->source); - lexstate.buff = buff; - lexstate.dyd = dyd; - dyd->actvar.n = dyd->gt.n = dyd->label.n = 0; - luaX_setinput(L, &lexstate, z, funcstate.f->source, firstchar); - mainfunc(&lexstate, &funcstate); - lua_assert(!funcstate.prev && funcstate.nups == 1 && !lexstate.fs); - /* all scopes should be correctly finished */ - lua_assert(dyd->actvar.n == 0 && dyd->gt.n == 0 && dyd->label.n == 0); - L->top.p--; /* remove scanner's table */ - return cl; /* closure is on the stack, too */ -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lparser.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lparser.h deleted file mode 100644 index 5e4500f..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lparser.h +++ /dev/null @@ -1,171 +0,0 @@ -/* -** $Id: lparser.h $ -** Lua Parser -** See Copyright Notice in lua.h -*/ - -#ifndef lparser_h -#define lparser_h - -#include "llimits.h" -#include "lobject.h" -#include "lzio.h" - - -/* -** Expression and variable descriptor. -** Code generation for variables and expressions can be delayed to allow -** optimizations; An 'expdesc' structure describes a potentially-delayed -** variable/expression. It has a description of its "main" value plus a -** list of conditional jumps that can also produce its value (generated -** by short-circuit operators 'and'/'or'). -*/ - -/* kinds of variables/expressions */ -typedef enum { - VVOID, /* when 'expdesc' describes the last expression of a list, - this kind means an empty list (so, no expression) */ - VNIL, /* constant nil */ - VTRUE, /* constant true */ - VFALSE, /* constant false */ - VK, /* constant in 'k'; info = index of constant in 'k' */ - VKFLT, /* floating constant; nval = numerical float value */ - VKINT, /* integer constant; ival = numerical integer value */ - VKSTR, /* string constant; strval = TString address; - (string is fixed by the lexer) */ - VNONRELOC, /* expression has its value in a fixed register; - info = result register */ - VLOCAL, /* local variable; var.ridx = register index; - var.vidx = relative index in 'actvar.arr' */ - VUPVAL, /* upvalue variable; info = index of upvalue in 'upvalues' */ - VCONST, /* compile-time variable; - info = absolute index in 'actvar.arr' */ - VINDEXED, /* indexed variable; - ind.t = table register; - ind.idx = key's R index */ - VINDEXUP, /* indexed upvalue; - ind.t = table upvalue; - ind.idx = key's K index */ - VINDEXI, /* indexed variable with constant integer; - ind.t = table register; - ind.idx = key's value */ - VINDEXSTR, /* indexed variable with literal string; - ind.t = table register; - ind.idx = key's K index */ - VJMP, /* expression is a test/comparison; - info = pc of corresponding jump instruction */ - VRELOC, /* expression can put result in any register; - info = instruction pc */ - VCALL, /* expression is a function call; info = instruction pc */ - VVARARG /* vararg expression; info = instruction pc */ -} expkind; - - -#define vkisvar(k) (VLOCAL <= (k) && (k) <= VINDEXSTR) -#define vkisindexed(k) (VINDEXED <= (k) && (k) <= VINDEXSTR) - - -typedef struct expdesc { - expkind k; - union { - lua_Integer ival; /* for VKINT */ - lua_Number nval; /* for VKFLT */ - TString *strval; /* for VKSTR */ - int info; /* for generic use */ - struct { /* for indexed variables */ - short idx; /* index (R or "long" K) */ - lu_byte t; /* table (register or upvalue) */ - } ind; - struct { /* for local variables */ - lu_byte ridx; /* register holding the variable */ - unsigned short vidx; /* compiler index (in 'actvar.arr') */ - } var; - } u; - int t; /* patch list of 'exit when true' */ - int f; /* patch list of 'exit when false' */ -} expdesc; - - -/* kinds of variables */ -#define VDKREG 0 /* regular */ -#define RDKCONST 1 /* constant */ -#define RDKTOCLOSE 2 /* to-be-closed */ -#define RDKCTC 3 /* compile-time constant */ - -/* description of an active local variable */ -typedef union Vardesc { - struct { - TValuefields; /* constant value (if it is a compile-time constant) */ - lu_byte kind; - lu_byte ridx; /* register holding the variable */ - short pidx; /* index of the variable in the Proto's 'locvars' array */ - TString *name; /* variable name */ - } vd; - TValue k; /* constant value (if any) */ -} Vardesc; - - - -/* description of pending goto statements and label statements */ -typedef struct Labeldesc { - TString *name; /* label identifier */ - int pc; /* position in code */ - int line; /* line where it appeared */ - lu_byte nactvar; /* number of active variables in that position */ - lu_byte close; /* goto that escapes upvalues */ -} Labeldesc; - - -/* list of labels or gotos */ -typedef struct Labellist { - Labeldesc *arr; /* array */ - int n; /* number of entries in use */ - int size; /* array size */ -} Labellist; - - -/* dynamic structures used by the parser */ -typedef struct Dyndata { - struct { /* list of all active local variables */ - Vardesc *arr; - int n; - int size; - } actvar; - Labellist gt; /* list of pending gotos */ - Labellist label; /* list of active labels */ -} Dyndata; - - -/* control of blocks */ -struct BlockCnt; /* defined in lparser.c */ - - -/* state needed to generate code for a given function */ -typedef struct FuncState { - Proto *f; /* current function header */ - struct FuncState *prev; /* enclosing function */ - struct LexState *ls; /* lexical state */ - struct BlockCnt *bl; /* chain of current blocks */ - int pc; /* next position to code (equivalent to 'ncode') */ - int lasttarget; /* 'label' of last 'jump label' */ - int previousline; /* last line that was saved in 'lineinfo' */ - int nk; /* number of elements in 'k' */ - int np; /* number of elements in 'p' */ - int nabslineinfo; /* number of elements in 'abslineinfo' */ - int firstlocal; /* index of first local var (in Dyndata array) */ - int firstlabel; /* index of first label (in 'dyd->label->arr') */ - short ndebugvars; /* number of elements in 'f->locvars' */ - lu_byte nactvar; /* number of active local variables */ - lu_byte nups; /* number of upvalues */ - lu_byte freereg; /* first free register */ - lu_byte iwthabs; /* instructions issued since last absolute line info */ - lu_byte needclose; /* function needs to close upvalues when returning */ -} FuncState; - - -LUAI_FUNC int luaY_nvarstack (FuncState *fs); -LUAI_FUNC LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, - Dyndata *dyd, const char *name, int firstchar); - - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lprefix.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lprefix.h deleted file mode 100644 index 484f2ad..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lprefix.h +++ /dev/null @@ -1,45 +0,0 @@ -/* -** $Id: lprefix.h $ -** Definitions for Lua code that must come before any other header file -** See Copyright Notice in lua.h -*/ - -#ifndef lprefix_h -#define lprefix_h - - -/* -** Allows POSIX/XSI stuff -*/ -#if !defined(LUA_USE_C89) /* { */ - -#if !defined(_XOPEN_SOURCE) -#define _XOPEN_SOURCE 600 -#elif _XOPEN_SOURCE == 0 -#undef _XOPEN_SOURCE /* use -D_XOPEN_SOURCE=0 to undefine it */ -#endif - -/* -** Allows manipulation of large files in gcc and some other compilers -*/ -#if !defined(LUA_32BITS) && !defined(_FILE_OFFSET_BITS) -#define _LARGEFILE_SOURCE 1 -#define _FILE_OFFSET_BITS 64 -#endif - -#endif /* } */ - - -/* -** Windows stuff -*/ -#if defined(_WIN32) /* { */ - -#if !defined(_CRT_SECURE_NO_WARNINGS) -#define _CRT_SECURE_NO_WARNINGS /* avoid warnings about ISO C functions */ -#endif - -#endif /* } */ - -#endif - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lstate.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lstate.c deleted file mode 100644 index 476b2b0..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lstate.c +++ /dev/null @@ -1,410 +0,0 @@ -/* -** $Id: lstate.c $ -** Global State -** See Copyright Notice in lua.h -*/ - -#define lstate_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "llex.h" -#include "lmem.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" - - - -/* -** thread state + extra space -*/ -typedef struct LX { - lu_byte extra_[LUA_EXTRASPACE]; - lua_State l; -} LX; - - -/* -** Main thread combines a thread state and the global state -*/ -typedef struct LG { - LX l; - global_State g; -} LG; - - - -#define fromstate(L) (cast(LX *, cast(lu_byte *, (L)) - offsetof(LX, l))) - - -/* -** set GCdebt to a new value keeping the real number of allocated -** objects (totalobjs - GCdebt) invariant and avoiding overflows in -** 'totalobjs'. -*/ -void luaE_setdebt (global_State *g, l_obj debt) { - l_obj tb = gettotalobjs(g); - lua_assert(tb > 0); - if (debt > MAX_LOBJ - tb) - debt = MAX_LOBJ - tb; /* will make 'totalobjs == MAX_LMEM' */ - g->totalobjs = tb + debt; - g->GCdebt = debt; -} - - -CallInfo *luaE_extendCI (lua_State *L) { - CallInfo *ci; - lua_assert(L->ci->next == NULL); - ci = luaM_new(L, CallInfo); - lua_assert(L->ci->next == NULL); - L->ci->next = ci; - ci->previous = L->ci; - ci->next = NULL; - ci->u.l.trap = 0; - L->nci++; - return ci; -} - - -/* -** free all CallInfo structures not in use by a thread -*/ -static void freeCI (lua_State *L) { - CallInfo *ci = L->ci; - CallInfo *next = ci->next; - ci->next = NULL; - while ((ci = next) != NULL) { - next = ci->next; - luaM_free(L, ci); - L->nci--; - } -} - - -/* -** free half of the CallInfo structures not in use by a thread, -** keeping the first one. -*/ -void luaE_shrinkCI (lua_State *L) { - CallInfo *ci = L->ci->next; /* first free CallInfo */ - CallInfo *next; - if (ci == NULL) - return; /* no extra elements */ - while ((next = ci->next) != NULL) { /* two extra elements? */ - CallInfo *next2 = next->next; /* next's next */ - ci->next = next2; /* remove next from the list */ - L->nci--; - luaM_free(L, next); /* free next */ - if (next2 == NULL) - break; /* no more elements */ - else { - next2->previous = ci; - ci = next2; /* continue */ - } - } -} - - -/* -** Called when 'getCcalls(L)' larger or equal to LUAI_MAXCCALLS. -** If equal, raises an overflow error. If value is larger than -** LUAI_MAXCCALLS (which means it is handling an overflow) but -** not much larger, does not report an error (to allow overflow -** handling to work). -*/ -void luaE_checkcstack (lua_State *L) { - if (getCcalls(L) == LUAI_MAXCCALLS) - luaG_runerror(L, "C stack overflow"); - else if (getCcalls(L) >= (LUAI_MAXCCALLS / 10 * 11)) - luaD_throw(L, LUA_ERRERR); /* error while handling stack error */ -} - - -LUAI_FUNC void luaE_incCstack (lua_State *L) { - L->nCcalls++; - if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) - luaE_checkcstack(L); -} - - -static void stack_init (lua_State *L1, lua_State *L) { - int i; CallInfo *ci; - /* initialize stack array */ - L1->stack.p = luaM_newvector(L, BASIC_STACK_SIZE + EXTRA_STACK, StackValue); - L1->tbclist.p = L1->stack.p; - for (i = 0; i < BASIC_STACK_SIZE + EXTRA_STACK; i++) - setnilvalue(s2v(L1->stack.p + i)); /* erase new stack */ - L1->top.p = L1->stack.p; - L1->stack_last.p = L1->stack.p + BASIC_STACK_SIZE; - /* initialize first ci */ - ci = &L1->base_ci; - ci->next = ci->previous = NULL; - ci->callstatus = CIST_C; - ci->func.p = L1->top.p; - ci->u.c.k = NULL; - ci->nresults = 0; - setnilvalue(s2v(L1->top.p)); /* 'function' entry for this 'ci' */ - L1->top.p++; - ci->top.p = L1->top.p + LUA_MINSTACK; - L1->ci = ci; -} - - -static void freestack (lua_State *L) { - if (L->stack.p == NULL) - return; /* stack not completely built yet */ - L->ci = &L->base_ci; /* free the entire 'ci' list */ - freeCI(L); - lua_assert(L->nci == 0); - luaM_freearray(L, L->stack.p, stacksize(L) + EXTRA_STACK); /* free stack */ -} - - -/* -** Create registry table and its predefined values -*/ -static void init_registry (lua_State *L, global_State *g) { - /* create registry */ - TValue aux; - Table *registry = luaH_new(L); - sethvalue(L, &g->l_registry, registry); - luaH_resize(L, registry, LUA_RIDX_LAST, 0); - /* registry[1] = false */ - setbfvalue(&aux); - luaH_setint(L, registry, 1, &aux); - /* registry[LUA_RIDX_MAINTHREAD] = L */ - setthvalue(L, &aux, L); - luaH_setint(L, registry, LUA_RIDX_MAINTHREAD, &aux); - /* registry[LUA_RIDX_GLOBALS] = new table (table of globals) */ - sethvalue(L, &aux, luaH_new(L)); - luaH_setint(L, registry, LUA_RIDX_GLOBALS, &aux); -} - - -/* -** open parts of the state that may cause memory-allocation errors. -*/ -static void f_luaopen (lua_State *L, void *ud) { - global_State *g = G(L); - UNUSED(ud); - stack_init(L, L); /* init stack */ - init_registry(L, g); - luaS_init(L); - luaT_init(L); - luaX_init(L); - g->gcstp = 0; /* allow gc */ - setnilvalue(&g->nilvalue); /* now state is complete */ - luai_userstateopen(L); -} - - -/* -** preinitialize a thread with consistent values without allocating -** any memory (to avoid errors) -*/ -static void preinit_thread (lua_State *L, global_State *g) { - G(L) = g; - L->stack.p = NULL; - L->ci = NULL; - L->nci = 0; - L->twups = L; /* thread has no upvalues */ - L->nCcalls = 0; - L->errorJmp = NULL; - L->hook = NULL; - L->hookmask = 0; - L->basehookcount = 0; - L->allowhook = 1; - resethookcount(L); - L->openupval = NULL; - L->status = LUA_OK; - L->errfunc = 0; - L->oldpc = 0; -} - - -static void close_state (lua_State *L) { - global_State *g = G(L); - if (!completestate(g)) /* closing a partially built state? */ - luaC_freeallobjects(L); /* just collect its objects */ - else { /* closing a fully built state */ - L->ci = &L->base_ci; /* unwind CallInfo list */ - luaD_closeprotected(L, 1, LUA_OK); /* close all upvalues */ - luaC_freeallobjects(L); /* collect all objects */ - luai_userstateclose(L); - } - luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size); - freestack(L); - lua_assert(g->totalbytes == sizeof(LG)); - lua_assert(gettotalobjs(g) == 1); - (*g->frealloc)(g->ud, fromstate(L), sizeof(LG), 0); /* free main block */ -} - - -LUA_API lua_State *lua_newthread (lua_State *L) { - global_State *g = G(L); - GCObject *o; - lua_State *L1; - lua_lock(L); - luaC_checkGC(L); - /* create new thread */ - o = luaC_newobjdt(L, LUA_TTHREAD, sizeof(LX), offsetof(LX, l)); - L1 = gco2th(o); - /* anchor it on L stack */ - setthvalue2s(L, L->top.p, L1); - api_incr_top(L); - preinit_thread(L1, g); - L1->hookmask = L->hookmask; - L1->basehookcount = L->basehookcount; - L1->hook = L->hook; - resethookcount(L1); - /* initialize L1 extra space */ - memcpy(lua_getextraspace(L1), lua_getextraspace(g->mainthread), - LUA_EXTRASPACE); - luai_userstatethread(L, L1); - stack_init(L1, L); /* init stack */ - lua_unlock(L); - return L1; -} - - -void luaE_freethread (lua_State *L, lua_State *L1) { - LX *l = fromstate(L1); - luaF_closeupval(L1, L1->stack.p); /* close all upvalues */ - lua_assert(L1->openupval == NULL); - luai_userstatefree(L, L1); - freestack(L1); - luaM_free(L, l); -} - - -int luaE_resetthread (lua_State *L, int status) { - CallInfo *ci = L->ci = &L->base_ci; /* unwind CallInfo list */ - setnilvalue(s2v(L->stack.p)); /* 'function' entry for basic 'ci' */ - ci->func.p = L->stack.p; - ci->callstatus = CIST_C; - if (status == LUA_YIELD) - status = LUA_OK; - L->status = LUA_OK; /* so it can run __close metamethods */ - status = luaD_closeprotected(L, 1, status); - if (status != LUA_OK) /* errors? */ - luaD_seterrorobj(L, status, L->stack.p + 1); - else - L->top.p = L->stack.p + 1; - ci->top.p = L->top.p + LUA_MINSTACK; - luaD_reallocstack(L, cast_int(ci->top.p - L->stack.p), 0); - return status; -} - - -LUA_API int lua_closethread (lua_State *L, lua_State *from) { - int status; - lua_lock(L); - L->nCcalls = (from) ? getCcalls(from) : 0; - status = luaE_resetthread(L, L->status); - lua_unlock(L); - return status; -} - - -LUA_API lua_State *lua_newstate (lua_Alloc f, void *ud, unsigned seed) { - int i; - lua_State *L; - global_State *g; - LG *l = cast(LG *, (*f)(ud, NULL, LUA_TTHREAD, sizeof(LG))); - if (l == NULL) return NULL; - L = &l->l.l; - g = &l->g; - L->tt = LUA_VTHREAD; - g->currentwhite = bitmask(WHITE0BIT); - L->marked = luaC_white(g); - preinit_thread(L, g); - g->allgc = obj2gco(L); /* by now, only object is the main thread */ - L->next = NULL; - incnny(L); /* main thread is always non yieldable */ - g->frealloc = f; - g->ud = ud; - g->warnf = NULL; - g->ud_warn = NULL; - g->mainthread = L; - g->seed = seed; - g->gcstp = GCSTPGC; /* no GC while building state */ - g->strt.size = g->strt.nuse = 0; - g->strt.hash = NULL; - setnilvalue(&g->l_registry); - g->panic = NULL; - g->gcstate = GCSpause; - g->gckind = KGC_INC; - g->gcstopem = 0; - g->gcemergency = 0; - g->finobj = g->tobefnz = g->fixedgc = NULL; - g->firstold1 = g->survival = g->old1 = g->reallyold = NULL; - g->finobjsur = g->finobjold1 = g->finobjrold = NULL; - g->sweepgc = NULL; - g->gray = g->grayagain = NULL; - g->weak = g->ephemeron = g->allweak = NULL; - g->twups = NULL; - g->totalbytes = sizeof(LG); - g->totalobjs = 1; - g->marked = 0; - g->GCdebt = 0; - setivalue(&g->nilvalue, 0); /* to signal that state is not yet built */ - setgcparam(g, PAUSE, LUAI_GCPAUSE); - setgcparam(g, STEPMUL, LUAI_GCMUL); - setgcparam(g, STEPSIZE, LUAI_GCSTEPSIZE); - setgcparam(g, MINORMUL, LUAI_GENMINORMUL); - setgcparam(g, MINORMAJOR, LUAI_MINORMAJOR); - setgcparam(g, MAJORMINOR, LUAI_MAJORMINOR); - for (i=0; i < LUA_NUMTYPES; i++) g->mt[i] = NULL; - if (luaD_rawrunprotected(L, f_luaopen, NULL) != LUA_OK) { - /* memory allocation error: free partial state */ - close_state(L); - L = NULL; - } - return L; -} - - -LUA_API void lua_close (lua_State *L) { - lua_lock(L); - L = G(L)->mainthread; /* only the main thread can be closed */ - close_state(L); -} - - -void luaE_warning (lua_State *L, const char *msg, int tocont) { - lua_WarnFunction wf = G(L)->warnf; - if (wf != NULL) - wf(G(L)->ud_warn, msg, tocont); -} - - -/* -** Generate a warning from an error message -*/ -void luaE_warnerror (lua_State *L, const char *where) { - TValue *errobj = s2v(L->top.p - 1); /* error object */ - const char *msg = (ttisstring(errobj)) - ? getstr(tsvalue(errobj)) - : "private_lua_error object is not a string"; - /* produce warning "error in %s (%s)" (where, msg) */ - luaE_warning(L, "private_lua_error in ", 1); - luaE_warning(L, where, 1); - luaE_warning(L, " (", 1); - luaE_warning(L, msg, 1); - luaE_warning(L, ")", 0); -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lstate.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lstate.h deleted file mode 100644 index 7f56745..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lstate.h +++ /dev/null @@ -1,407 +0,0 @@ -/* -** $Id: lstate.h $ -** Global State -** See Copyright Notice in lua.h -*/ - -#ifndef lstate_h -#define lstate_h - -#include "lua.h" - - -/* Some header files included here need this definition */ -typedef struct CallInfo CallInfo; - - -#include "lobject.h" -#include "ltm.h" -#include "lzio.h" - - -/* -** Some notes about garbage-collected objects: All objects in Lua must -** be kept somehow accessible until being freed, so all objects always -** belong to one (and only one) of these lists, using field 'next' of -** the 'CommonHeader' for the link: -** -** 'allgc': all objects not marked for finalization; -** 'finobj': all objects marked for finalization; -** 'tobefnz': all objects ready to be finalized; -** 'fixedgc': all objects that are not to be collected (currently -** only small strings, such as reserved words). -** -** For the generational collector, some of these lists have marks for -** generations. Each mark points to the first element in the list for -** that particular generation; that generation goes until the next mark. -** -** 'allgc' -> 'survival': new objects; -** 'survival' -> 'old': objects that survived one collection; -** 'old1' -> 'reallyold': objects that became old in last collection; -** 'reallyold' -> NULL: objects old for more than one cycle. -** -** 'finobj' -> 'finobjsur': new objects marked for finalization; -** 'finobjsur' -> 'finobjold1': survived """"; -** 'finobjold1' -> 'finobjrold': just old """"; -** 'finobjrold' -> NULL: really old """". -** -** All lists can contain elements older than their main ages, due -** to 'luaC_checkfinalizer' and 'udata2finalize', which move -** objects between the normal lists and the "marked for finalization" -** lists. Moreover, barriers can age young objects in young lists as -** OLD0, which then become OLD1. However, a list never contains -** elements younger than their main ages. -** -** The generational collector also uses a pointer 'firstold1', which -** points to the first OLD1 object in the list. It is used to optimize -** 'markold'. (Potentially OLD1 objects can be anywhere between 'allgc' -** and 'reallyold', but often the list has no OLD1 objects or they are -** after 'old1'.) Note the difference between it and 'old1': -** 'firstold1': no OLD1 objects before this point; there can be all -** ages after it. -** 'old1': no objects younger than OLD1 after this point. -*/ - -/* -** Moreover, there is another set of lists that control gray objects. -** These lists are linked by fields 'gclist'. (All objects that -** can become gray have such a field. The field is not the same -** in all objects, but it always has this name.) Any gray object -** must belong to one of these lists, and all objects in these lists -** must be gray (with two exceptions explained below): -** -** 'gray': regular gray objects, still waiting to be visited. -** 'grayagain': objects that must be revisited at the atomic phase. -** That includes -** - black objects got in a write barrier; -** - all kinds of weak tables during propagation phase; -** - all threads. -** 'weak': tables with weak values to be cleared; -** 'ephemeron': ephemeron tables with white->white entries; -** 'allweak': tables with weak keys and/or weak values to be cleared. -** -** The exceptions to that "gray rule" are: -** - TOUCHED2 objects in generational mode stay in a gray list (because -** they must be visited again at the end of the cycle), but they are -** marked black because assignments to them must activate barriers (to -** move them back to TOUCHED1). -** - Open upvales are kept gray to avoid barriers, but they stay out -** of gray lists. (They don't even have a 'gclist' field.) -*/ - - - -/* -** About 'nCcalls': This count has two parts: the lower 16 bits counts -** the number of recursive invocations in the C stack; the higher -** 16 bits counts the number of non-yieldable calls in the stack. -** (They are together so that we can change and save both with one -** instruction.) -*/ - - -/* true if this thread does not have non-yieldable calls in the stack */ -#define yieldable(L) (((L)->nCcalls & 0xffff0000) == 0) - -/* real number of C calls */ -#define getCcalls(L) ((L)->nCcalls & 0xffff) - - -/* Increment the number of non-yieldable calls */ -#define incnny(L) ((L)->nCcalls += 0x10000) - -/* Decrement the number of non-yieldable calls */ -#define decnny(L) ((L)->nCcalls -= 0x10000) - -/* Non-yieldable call increment */ -#define nyci (0x10000 | 1) - - - - -struct lua_longjmp; /* defined in ldo.c */ - - -/* -** Atomic type (relative to signals) to better ensure that 'lua_sethook' -** is thread safe -*/ -#if !defined(l_signalT) -#include -#define l_signalT sig_atomic_t -#endif - - -/* -** Extra stack space to handle TM calls and some other extras. This -** space is not included in 'stack_last'. It is used only to avoid stack -** checks, either because the element will be promptly popped or because -** there will be a stack check soon after the push. Function frames -** never use this extra space, so it does not need to be kept clean. -*/ -#define EXTRA_STACK 5 - - -#define BASIC_STACK_SIZE (2*LUA_MINSTACK) - -#define stacksize(th) cast_int((th)->stack_last.p - (th)->stack.p) - - -/* kinds of Garbage Collection */ -#define KGC_INC 0 /* incremental gc */ -#define KGC_GENMINOR 1 /* generational gc in minor (regular) mode */ -#define KGC_GENMAJOR 2 /* generational in major mode */ - - -typedef struct stringtable { - TString **hash; /* array of buckets (linked lists of strings) */ - int nuse; /* number of elements */ - int size; /* number of buckets */ -} stringtable; - - -/* -** Information about a call. -** About union 'u': -** - field 'l' is used only for Lua functions; -** - field 'c' is used only for C functions. -** About union 'u2': -** - field 'funcidx' is used only by C functions while doing a -** protected call; -** - field 'nyield' is used only while a function is "doing" an -** yield (from the yield until the next resume); -** - field 'nres' is used only while closing tbc variables when -** returning from a function; -** - field 'transferinfo' is used only during call/returnhooks, -** before the function starts or after it ends. -*/ -struct CallInfo { - StkIdRel func; /* function index in the stack */ - StkIdRel top; /* top for this function */ - struct CallInfo *previous, *next; /* dynamic call link */ - union { - struct { /* only for Lua functions */ - const Instruction *savedpc; - volatile l_signalT trap; /* function is tracing lines/counts */ - int nextraargs; /* # of extra arguments in vararg functions */ - } l; - struct { /* only for C functions */ - lua_KFunction k; /* continuation in case of yields */ - ptrdiff_t old_errfunc; - lua_KContext ctx; /* context info. in case of yields */ - } c; - } u; - union { - int funcidx; /* called-function index */ - int nyield; /* number of values yielded */ - int nres; /* number of values returned */ - struct { /* info about transferred values (for call/return hooks) */ - unsigned short ftransfer; /* offset of first value transferred */ - unsigned short ntransfer; /* number of values transferred */ - } transferinfo; - } u2; - short nresults; /* expected number of results from this function */ - unsigned short callstatus; -}; - - -/* -** Bits in CallInfo status -*/ -#define CIST_OAH (1<<0) /* original value of 'allowhook' */ -#define CIST_C (1<<1) /* call is running a C function */ -#define CIST_FRESH (1<<2) /* call is on a fresh "luaV_execute" frame */ -#define CIST_HOOKED (1<<3) /* call is running a debug hook */ -#define CIST_YPCALL (1<<4) /* doing a yieldable protected call */ -#define CIST_TAIL (1<<5) /* call was tail called */ -#define CIST_HOOKYIELD (1<<6) /* last hook called yielded */ -#define CIST_FIN (1<<7) /* function "called" a finalizer */ -#define CIST_TRAN (1<<8) /* 'ci' has transfer information */ -#define CIST_CLSRET (1<<9) /* function is closing tbc variables */ -/* Bits 10-12 are used for CIST_RECST (see below) */ -#define CIST_RECST 10 -#if defined(LUA_COMPAT_LT_LE) -#define CIST_LEQ (1<<13) /* using __lt for __le */ -#endif - - -/* -** Field CIST_RECST stores the "recover status", used to keep the error -** status while closing to-be-closed variables in coroutines, so that -** Lua can correctly resume after an yield from a __close method called -** because of an error. (Three bits are enough for error status.) -*/ -#define getcistrecst(ci) (((ci)->callstatus >> CIST_RECST) & 7) -#define setcistrecst(ci,st) \ - check_exp(((st) & 7) == (st), /* status must fit in three bits */ \ - ((ci)->callstatus = ((ci)->callstatus & ~(7 << CIST_RECST)) \ - | ((st) << CIST_RECST))) - - -/* active function is a Lua function */ -#define isLua(ci) (!((ci)->callstatus & CIST_C)) - -/* call is running Lua code (not a hook) */ -#define isLuacode(ci) (!((ci)->callstatus & (CIST_C | CIST_HOOKED))) - -/* assume that CIST_OAH has offset 0 and that 'v' is strictly 0/1 */ -#define setoah(st,v) ((st) = ((st) & ~CIST_OAH) | (v)) -#define getoah(st) ((st) & CIST_OAH) - - -/* -** 'global state', shared by all threads of this state -*/ -typedef struct global_State { - lua_Alloc frealloc; /* function to reallocate memory */ - void *ud; /* auxiliary data to 'frealloc' */ - lu_mem totalbytes; /* number of bytes currently allocated */ - l_obj totalobjs; /* total number of objects allocated + GCdebt */ - l_obj GCdebt; /* objects counted but not yet allocated */ - l_obj marked; /* number of objects marked in a GC cycle */ - l_obj GCmajorminor; /* auxiliar counter to control major-minor shifts */ - stringtable strt; /* hash table for strings */ - TValue l_registry; - TValue nilvalue; /* a nil value */ - unsigned int seed; /* randomized seed for hashes */ - lu_byte gcparams[LUA_GCPN]; - lu_byte currentwhite; - lu_byte gcstate; /* state of garbage collector */ - lu_byte gckind; /* kind of GC running */ - lu_byte gcstopem; /* stops emergency collections */ - lu_byte gcstp; /* control whether GC is running */ - lu_byte gcemergency; /* true if this is an emergency collection */ - GCObject *allgc; /* list of all collectable objects */ - GCObject **sweepgc; /* current position of sweep in list */ - GCObject *finobj; /* list of collectable objects with finalizers */ - GCObject *gray; /* list of gray objects */ - GCObject *grayagain; /* list of objects to be traversed atomically */ - GCObject *weak; /* list of tables with weak values */ - GCObject *ephemeron; /* list of ephemeron tables (weak keys) */ - GCObject *allweak; /* list of all-weak tables */ - GCObject *tobefnz; /* list of userdata to be GC */ - GCObject *fixedgc; /* list of objects not to be collected */ - /* fields for generational collector */ - GCObject *survival; /* start of objects that survived one GC cycle */ - GCObject *old1; /* start of old1 objects */ - GCObject *reallyold; /* objects more than one cycle old ("really old") */ - GCObject *firstold1; /* first OLD1 object in the list (if any) */ - GCObject *finobjsur; /* list of survival objects with finalizers */ - GCObject *finobjold1; /* list of old1 objects with finalizers */ - GCObject *finobjrold; /* list of really old objects with finalizers */ - struct lua_State *twups; /* list of threads with open upvalues */ - lua_CFunction panic; /* to be called in unprotected errors */ - struct lua_State *mainthread; - TString *memerrmsg; /* message for memory-allocation errors */ - TString *tmname[TM_N]; /* array with tag-method names */ - struct Table *mt[LUA_NUMTYPES]; /* metatables for basic types */ - TString *strcache[STRCACHE_N][STRCACHE_M]; /* cache for strings in API */ - lua_WarnFunction warnf; /* warning function */ - void *ud_warn; /* auxiliary data to 'warnf' */ -} global_State; - - -/* -** 'per thread' state -*/ -struct lua_State { - CommonHeader; - lu_byte status; - lu_byte allowhook; - unsigned short nci; /* number of items in 'ci' list */ - StkIdRel top; /* first free slot in the stack */ - global_State *l_G; - CallInfo *ci; /* call info for current function */ - StkIdRel stack_last; /* end of stack (last element + 1) */ - StkIdRel stack; /* stack base */ - UpVal *openupval; /* list of open upvalues in this stack */ - StkIdRel tbclist; /* list of to-be-closed variables */ - GCObject *gclist; - struct lua_State *twups; /* list of threads with open upvalues */ - struct lua_longjmp *errorJmp; /* current error recover point */ - CallInfo base_ci; /* CallInfo for first level (C calling Lua) */ - volatile lua_Hook hook; - ptrdiff_t errfunc; /* current error handling function (stack index) */ - l_uint32 nCcalls; /* number of nested (non-yieldable | C) calls */ - int oldpc; /* last pc traced */ - int basehookcount; - int hookcount; - volatile l_signalT hookmask; -}; - - -#define G(L) (L->l_G) - -/* -** 'g->nilvalue' being a nil value flags that the state was completely -** build. -*/ -#define completestate(g) ttisnil(&g->nilvalue) - - -/* -** Union of all collectable objects (only for conversions) -** ISO C99, 6.5.2.3 p.5: -** "if a union contains several structures that share a common initial -** sequence [...], and if the union object currently contains one -** of these structures, it is permitted to inspect the common initial -** part of any of them anywhere that a declaration of the complete type -** of the union is visible." -*/ -union GCUnion { - GCObject gc; /* common header */ - struct TString ts; - struct Udata u; - union Closure cl; - struct Table h; - struct Proto p; - struct lua_State th; /* thread */ - struct UpVal upv; -}; - - -/* -** ISO C99, 6.7.2.1 p.14: -** "A pointer to a union object, suitably converted, points to each of -** its members [...], and vice versa." -*/ -#define cast_u(o) cast(union GCUnion *, (o)) - -/* macros to convert a GCObject into a specific value */ -#define gco2ts(o) \ - check_exp(novariant((o)->tt) == LUA_TSTRING, &((cast_u(o))->ts)) -#define gco2u(o) check_exp((o)->tt == LUA_VUSERDATA, &((cast_u(o))->u)) -#define gco2lcl(o) check_exp((o)->tt == LUA_VLCL, &((cast_u(o))->cl.l)) -#define gco2ccl(o) check_exp((o)->tt == LUA_VCCL, &((cast_u(o))->cl.c)) -#define gco2cl(o) \ - check_exp(novariant((o)->tt) == LUA_TFUNCTION, &((cast_u(o))->cl)) -#define gco2t(o) check_exp((o)->tt == LUA_VTABLE, &((cast_u(o))->h)) -#define gco2p(o) check_exp((o)->tt == LUA_VPROTO, &((cast_u(o))->p)) -#define gco2th(o) check_exp((o)->tt == LUA_VTHREAD, &((cast_u(o))->th)) -#define gco2upv(o) check_exp((o)->tt == LUA_VUPVAL, &((cast_u(o))->upv)) - - -/* -** macro to convert a Lua object into a GCObject -** (The access to 'tt' tries to ensure that 'v' is actually a Lua object.) -*/ -#define obj2gco(v) check_exp((v)->tt >= LUA_TSTRING, &(cast_u(v)->gc)) - - -/* actual number of total objects allocated */ -#define gettotalobjs(g) ((g)->totalobjs - (g)->GCdebt) - - -LUAI_FUNC void luaE_setdebt (global_State *g, l_obj debt); -LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1); -LUAI_FUNC CallInfo *luaE_extendCI (lua_State *L); -LUAI_FUNC void luaE_shrinkCI (lua_State *L); -LUAI_FUNC void luaE_checkcstack (lua_State *L); -LUAI_FUNC void luaE_incCstack (lua_State *L); -LUAI_FUNC void luaE_warning (lua_State *L, const char *msg, int tocont); -LUAI_FUNC void luaE_warnerror (lua_State *L, const char *where); -LUAI_FUNC int luaE_resetthread (lua_State *L, int status); - - -#endif - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lstring.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lstring.c deleted file mode 100644 index a374c96..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lstring.c +++ /dev/null @@ -1,349 +0,0 @@ -/* -** $Id: lstring.c $ -** String table (keeps all strings handled by Lua) -** See Copyright Notice in lua.h -*/ - -#define lstring_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" - - -/* -** Maximum size for string table. -*/ -#define MAXSTRTB cast_int(luaM_limitN(MAX_INT, TString*)) - - -/* -** equality for long strings -*/ -int luaS_eqlngstr (TString *a, TString *b) { - size_t len = a->u.lnglen; - lua_assert(a->tt == LUA_VLNGSTR && b->tt == LUA_VLNGSTR); - return (a == b) || /* same instance or... */ - ((len == b->u.lnglen) && /* equal length and ... */ - (memcmp(getlngstr(a), getlngstr(b), len) == 0)); /* equal contents */ -} - - -unsigned luaS_hash (const char *str, size_t l, unsigned seed) { - unsigned int h = seed ^ cast_uint(l); - for (; l > 0; l--) - h ^= ((h<<5) + (h>>2) + cast_byte(str[l - 1])); - return h; -} - - -unsigned luaS_hashlongstr (TString *ts) { - lua_assert(ts->tt == LUA_VLNGSTR); - if (ts->extra == 0) { /* no hash? */ - size_t len = ts->u.lnglen; - ts->hash = luaS_hash(getlngstr(ts), len, ts->hash); - ts->extra = 1; /* now it has its hash */ - } - return ts->hash; -} - - -static void tablerehash (TString **vect, int osize, int nsize) { - int i; - for (i = osize; i < nsize; i++) /* clear new elements */ - vect[i] = NULL; - for (i = 0; i < osize; i++) { /* rehash old part of the array */ - TString *p = vect[i]; - vect[i] = NULL; - while (p) { /* for each string in the list */ - TString *hnext = p->u.hnext; /* save next */ - unsigned int h = lmod(p->hash, nsize); /* new position */ - p->u.hnext = vect[h]; /* chain it into array */ - vect[h] = p; - p = hnext; - } - } -} - - -/* -** Resize the string table. If allocation fails, keep the current size. -** (This can degrade performance, but any non-zero size should work -** correctly.) -*/ -void luaS_resize (lua_State *L, int nsize) { - stringtable *tb = &G(L)->strt; - int osize = tb->size; - TString **newvect; - if (nsize < osize) /* shrinking table? */ - tablerehash(tb->hash, osize, nsize); /* depopulate shrinking part */ - newvect = luaM_reallocvector(L, tb->hash, osize, nsize, TString*); - if (l_unlikely(newvect == NULL)) { /* reallocation failed? */ - if (nsize < osize) /* was it shrinking table? */ - tablerehash(tb->hash, nsize, osize); /* restore to original size */ - /* leave table as it was */ - } - else { /* allocation succeeded */ - tb->hash = newvect; - tb->size = nsize; - if (nsize > osize) - tablerehash(newvect, osize, nsize); /* rehash for new size */ - } -} - - -/* -** Clear API string cache. (Entries cannot be empty, so fill them with -** a non-collectable string.) -*/ -void luaS_clearcache (global_State *g) { - int i, j; - for (i = 0; i < STRCACHE_N; i++) - for (j = 0; j < STRCACHE_M; j++) { - if (iswhite(g->strcache[i][j])) /* will entry be collected? */ - g->strcache[i][j] = g->memerrmsg; /* replace it with something fixed */ - } -} - - -/* -** Initialize the string table and the string cache -*/ -void luaS_init (lua_State *L) { - global_State *g = G(L); - int i, j; - stringtable *tb = &G(L)->strt; - tb->hash = luaM_newvector(L, MINSTRTABSIZE, TString*); - tablerehash(tb->hash, 0, MINSTRTABSIZE); /* clear array */ - tb->size = MINSTRTABSIZE; - /* pre-create memory-error message */ - g->memerrmsg = luaS_newliteral(L, MEMERRMSG); - luaC_fix(L, obj2gco(g->memerrmsg)); /* it should never be collected */ - for (i = 0; i < STRCACHE_N; i++) /* fill cache with valid strings */ - for (j = 0; j < STRCACHE_M; j++) - g->strcache[i][j] = g->memerrmsg; -} - - -size_t luaS_sizelngstr (size_t len, int kind) { - switch (kind) { - case LSTRREG: /* regular long string */ - /* don't need 'falloc'/'ud', but need space for content */ - return offsetof(TString, falloc) + (len + 1) * sizeof(char); - case LSTRFIX: /* fixed external long string */ - /* don't need 'falloc'/'ud' */ - return offsetof(TString, falloc); - default: /* external long string with deallocation */ - lua_assert(kind == LSTRMEM); - return sizeof(TString); - } -} - - -/* -** creates a new string object -*/ -static TString *createstrobj (lua_State *L, size_t totalsize, int tag, - unsigned h) { - TString *ts; - GCObject *o; - o = luaC_newobj(L, tag, totalsize); - ts = gco2ts(o); - ts->hash = h; - ts->extra = 0; - return ts; -} - - -TString *luaS_createlngstrobj (lua_State *L, size_t l) { - size_t totalsize = luaS_sizelngstr(l, LSTRREG); - TString *ts = createstrobj(L, totalsize, LUA_VLNGSTR, G(L)->seed); - ts->u.lnglen = l; - ts->shrlen = LSTRREG; /* signals that it is a regular long string */ - ts->contents = cast_charp(ts) + offsetof(TString, falloc); - ts->contents[l] = '\0'; /* ending 0 */ - return ts; -} - - -void luaS_remove (lua_State *L, TString *ts) { - stringtable *tb = &G(L)->strt; - TString **p = &tb->hash[lmod(ts->hash, tb->size)]; - while (*p != ts) /* find previous element */ - p = &(*p)->u.hnext; - *p = (*p)->u.hnext; /* remove element from its list */ - tb->nuse--; -} - - -static void growstrtab (lua_State *L, stringtable *tb) { - if (l_unlikely(tb->nuse == MAX_INT)) { /* too many strings? */ - luaC_fullgc(L, 1); /* try to free some... */ - if (tb->nuse == MAX_INT) /* still too many? */ - luaM_error(L); /* cannot even create a message... */ - } - if (tb->size <= MAXSTRTB / 2) /* can grow string table? */ - luaS_resize(L, tb->size * 2); -} - - -/* -** Checks whether short string exists and reuses it or creates a new one. -*/ -static TString *internshrstr (lua_State *L, const char *str, size_t l) { - TString *ts; - global_State *g = G(L); - stringtable *tb = &g->strt; - unsigned int h = luaS_hash(str, l, g->seed); - TString **list = &tb->hash[lmod(h, tb->size)]; - lua_assert(str != NULL); /* otherwise 'memcmp'/'memcpy' are undefined */ - for (ts = *list; ts != NULL; ts = ts->u.hnext) { - if (l == cast_uint(ts->shrlen) && - (memcmp(str, getshrstr(ts), l * sizeof(char)) == 0)) { - /* found! */ - if (isdead(g, ts)) /* dead (but not collected yet)? */ - changewhite(ts); /* resurrect it */ - return ts; - } - } - /* else must create a new string */ - if (tb->nuse >= tb->size) { /* need to grow string table? */ - growstrtab(L, tb); - list = &tb->hash[lmod(h, tb->size)]; /* rehash with new size */ - } - ts = createstrobj(L, sizestrshr(l), LUA_VSHRSTR, h); - ts->shrlen = cast_byte(l); - getshrstr(ts)[l] = '\0'; /* ending 0 */ - memcpy(getshrstr(ts), str, l * sizeof(char)); - ts->u.hnext = *list; - *list = ts; - tb->nuse++; - return ts; -} - - -/* -** new string (with explicit length) -*/ -TString *luaS_newlstr (lua_State *L, const char *str, size_t l) { - if (l <= LUAI_MAXSHORTLEN) /* short string? */ - return internshrstr(L, str, l); - else { - TString *ts; - if (l_unlikely(l * sizeof(char) >= (MAX_SIZE - sizeof(TString)))) - luaM_toobig(L); - ts = luaS_createlngstrobj(L, l); - memcpy(getlngstr(ts), str, l * sizeof(char)); - return ts; - } -} - - -/* -** Create or reuse a zero-terminated string, first checking in the -** cache (using the string address as a key). The cache can contain -** only zero-terminated strings, so it is safe to use 'strcmp' to -** check hits. -*/ -TString *luaS_new (lua_State *L, const char *str) { - unsigned int i = point2uint(str) % STRCACHE_N; /* hash */ - int j; - TString **p = G(L)->strcache[i]; - for (j = 0; j < STRCACHE_M; j++) { - if (strcmp(str, getstr(p[j])) == 0) /* hit? */ - return p[j]; /* that is it */ - } - /* normal route */ - for (j = STRCACHE_M - 1; j > 0; j--) - p[j] = p[j - 1]; /* move out last element */ - /* new element is first in the list */ - p[0] = luaS_newlstr(L, str, strlen(str)); - return p[0]; -} - - -Udata *luaS_newudata (lua_State *L, size_t s, int nuvalue) { - Udata *u; - int i; - GCObject *o; - if (l_unlikely(s > MAX_SIZE - udatamemoffset(nuvalue))) - luaM_toobig(L); - o = luaC_newobj(L, LUA_VUSERDATA, sizeudata(nuvalue, s)); - u = gco2u(o); - u->len = s; - u->nuvalue = nuvalue; - u->metatable = NULL; - for (i = 0; i < nuvalue; i++) - setnilvalue(&u->uv[i].uv); - return u; -} - - -struct NewExt { - int kind; - const char *s; - size_t len; - TString *ts; /* output */ -}; - - -static void f_newext (lua_State *L, void *ud) { - struct NewExt *ne = cast(struct NewExt *, ud); - size_t size = luaS_sizelngstr(0, ne->kind); - ne->ts = createstrobj(L, size, LUA_VLNGSTR, G(L)->seed); -} - - -static void f_pintern (lua_State *L, void *ud) { - struct NewExt *ne = cast(struct NewExt *, ud); - ne->ts = internshrstr(L, ne->s, ne->len); -} - - -TString *luaS_newextlstr (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud) { - struct NewExt ne; - if (len <= LUAI_MAXSHORTLEN) { /* short string? */ - ne.s = s; ne.len = len; - if (!falloc) - f_pintern(L, &ne); /* just internalize string */ - else { - int status = luaD_rawrunprotected(L, f_pintern, &ne); - (*falloc)(ud, cast_voidp(s), len + 1, 0); /* free external string */ - if (status != LUA_OK) /* memory error? */ - luaM_error(L); /* re-raise memory error */ - } - return ne.ts; - } - /* "normal" case: long strings */ - if (!falloc) { - ne.kind = LSTRFIX; - f_newext(L, &ne); /* just create header */ - } - else { - ne.kind = LSTRMEM; - if (luaD_rawrunprotected(L, f_newext, &ne) != LUA_OK) { /* mem. error? */ - (*falloc)(ud, cast_voidp(s), len + 1, 0); /* free external string */ - luaM_error(L); /* re-raise memory error */ - } - ne.ts->falloc = falloc; - ne.ts->ud = ud; - } - ne.ts->shrlen = ne.kind; - ne.ts->u.lnglen = len; - ne.ts->contents = cast_charp(s); - return ne.ts; -} - - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lstring.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lstring.h deleted file mode 100644 index b7226d8..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lstring.h +++ /dev/null @@ -1,61 +0,0 @@ -/* -** $Id: lstring.h $ -** String table (keep all strings handled by Lua) -** See Copyright Notice in lua.h -*/ - -#ifndef lstring_h -#define lstring_h - -#include "lgc.h" -#include "lobject.h" -#include "lstate.h" - - -/* -** Memory-allocation error message must be preallocated (it cannot -** be created after memory is exhausted) -*/ -#define MEMERRMSG "not enough memory" - - -/* -** Size of a short TString: Size of the header plus space for the string -** itself (including final '\0'). -*/ -#define sizestrshr(l) \ - (offsetof(TString, contents) + ((l) + 1) * sizeof(char)) - - -#define luaS_newliteral(L, s) (luaS_newlstr(L, "" s, \ - (sizeof(s)/sizeof(char))-1)) - - -/* -** test whether a string is a reserved word -*/ -#define isreserved(s) ((s)->tt == LUA_VSHRSTR && (s)->extra > 0) - - -/* -** equality for short strings, which are always internalized -*/ -#define eqshrstr(a,b) check_exp((a)->tt == LUA_VSHRSTR, (a) == (b)) - - -LUAI_FUNC unsigned luaS_hash (const char *str, size_t l, unsigned seed); -LUAI_FUNC unsigned luaS_hashlongstr (TString *ts); -LUAI_FUNC int luaS_eqlngstr (TString *a, TString *b); -LUAI_FUNC void luaS_resize (lua_State *L, int newsize); -LUAI_FUNC void luaS_clearcache (global_State *g); -LUAI_FUNC void luaS_init (lua_State *L); -LUAI_FUNC void luaS_remove (lua_State *L, TString *ts); -LUAI_FUNC Udata *luaS_newudata (lua_State *L, size_t s, int nuvalue); -LUAI_FUNC TString *luaS_newlstr (lua_State *L, const char *str, size_t l); -LUAI_FUNC TString *luaS_new (lua_State *L, const char *str); -LUAI_FUNC TString *luaS_createlngstrobj (lua_State *L, size_t l); -LUAI_FUNC TString *luaS_newextlstr (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud); -LUAI_FUNC size_t luaS_sizelngstr (size_t len, int kind); - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lstrlib.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lstrlib.c deleted file mode 100644 index a90c4fd..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lstrlib.c +++ /dev/null @@ -1,1880 +0,0 @@ -/* -** $Id: lstrlib.c $ -** Standard library for string operations and pattern-matching -** See Copyright Notice in lua.h -*/ - -#define lstrlib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** maximum number of captures that a pattern can do during -** pattern-matching. This limit is arbitrary, but must fit in -** an unsigned char. -*/ -#if !defined(LUA_MAXCAPTURES) -#define LUA_MAXCAPTURES 32 -#endif - - -/* macro to 'unsign' a character */ -#define uchar(c) ((unsigned char)(c)) - - -/* -** Some sizes are better limited to fit in 'int', but must also fit in -** 'size_t'. (We assume that 'lua_Integer' cannot be smaller than 'int'.) -*/ -#define MAX_SIZET ((size_t)(~(size_t)0)) - -#define MAXSIZE \ - (sizeof(size_t) < sizeof(int) ? MAX_SIZET : (size_t)(INT_MAX)) - - - - -static int str_len (lua_State *L) { - size_t l; - luaL_checklstring(L, 1, &l); - lua_pushinteger(L, (lua_Integer)l); - return 1; -} - - -/* -** translate a relative initial string position -** (negative means back from end): clip result to [1, inf). -** The length of any string in Lua must fit in a lua_Integer, -** so there are no overflows in the casts. -** The inverted comparison avoids a possible overflow -** computing '-pos'. -*/ -static size_t posrelatI (lua_Integer pos, size_t len) { - if (pos > 0) - return (size_t)pos; - else if (pos == 0) - return 1; - else if (pos < -(lua_Integer)len) /* inverted comparison */ - return 1; /* clip to 1 */ - else return len + (size_t)pos + 1; -} - - -/* -** Gets an optional ending string position from argument 'arg', -** with default value 'def'. -** Negative means back from end: clip result to [0, len] -*/ -static size_t getendpos (lua_State *L, int arg, lua_Integer def, - size_t len) { - lua_Integer pos = luaL_optinteger(L, arg, def); - if (pos > (lua_Integer)len) - return len; - else if (pos >= 0) - return (size_t)pos; - else if (pos < -(lua_Integer)len) - return 0; - else return len + (size_t)pos + 1; -} - - -static int str_sub (lua_State *L) { - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - size_t start = posrelatI(luaL_checkinteger(L, 2), l); - size_t end = getendpos(L, 3, -1, l); - if (start <= end) - lua_pushlstring(L, s + start - 1, (end - start) + 1); - else lua_pushliteral(L, ""); - return 1; -} - - -static int str_reverse (lua_State *L) { - size_t l, i; - luaL_Buffer b; - const char *s = luaL_checklstring(L, 1, &l); - char *p = luaL_buffinitsize(L, &b, l); - for (i = 0; i < l; i++) - p[i] = s[l - i - 1]; - luaL_pushresultsize(&b, l); - return 1; -} - - -static int str_lower (lua_State *L) { - size_t l; - size_t i; - luaL_Buffer b; - const char *s = luaL_checklstring(L, 1, &l); - char *p = luaL_buffinitsize(L, &b, l); - for (i=0; i MAXSIZE / n)) - return luaL_error(L, "resulting string too large"); - else { - size_t totallen = (size_t)n * l + (size_t)(n - 1) * lsep; - luaL_Buffer b; - char *p = luaL_buffinitsize(L, &b, totallen); - while (n-- > 1) { /* first n-1 copies (followed by separator) */ - memcpy(p, s, l * sizeof(char)); p += l; - if (lsep > 0) { /* empty 'memcpy' is not that cheap */ - memcpy(p, sep, lsep * sizeof(char)); - p += lsep; - } - } - memcpy(p, s, l * sizeof(char)); /* last copy (not followed by separator) */ - luaL_pushresultsize(&b, totallen); - } - return 1; -} - - -static int str_byte (lua_State *L) { - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - lua_Integer pi = luaL_optinteger(L, 2, 1); - size_t posi = posrelatI(pi, l); - size_t pose = getendpos(L, 3, pi, l); - int n, i; - if (posi > pose) return 0; /* empty interval; return no values */ - if (l_unlikely(pose - posi >= (size_t)INT_MAX)) /* arithmetic overflow? */ - return luaL_error(L, "string slice too long"); - n = (int)(pose - posi) + 1; - luaL_checkstack(L, n, "string slice too long"); - for (i=0; iinit) { - state->init = 1; - luaL_buffinit(L, &state->B); - } - if (b == NULL) { /* finishing dump? */ - luaL_pushresult(&state->B); /* push result */ - lua_replace(L, 1); /* move it to reserved slot */ - } - else - luaL_addlstring(&state->B, (const char *)b, size); - return 0; -} - - -static int str_dump (lua_State *L) { - struct str_Writer state; - int strip = lua_toboolean(L, 2); - luaL_argcheck(L, lua_type(L, 1) == LUA_TFUNCTION && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - /* ensure function is on the top of the stack and vacate slot 1 */ - lua_pushvalue(L, 1); - state.init = 0; - lua_dump(L, writer, &state, strip); - lua_settop(L, 1); /* leave final result on top */ - return 1; -} - - - -/* -** {====================================================== -** METAMETHODS -** ======================================================= -*/ - -#if defined(LUA_NOCVTS2N) /* { */ - -/* no coercion from strings to numbers */ - -static const luaL_Reg stringmetamethods[] = { - {"__index", NULL}, /* placeholder */ - {NULL, NULL} -}; - -#else /* }{ */ - -static int tonum (lua_State *L, int arg) { - if (lua_type(L, arg) == LUA_TNUMBER) { /* already a number? */ - lua_pushvalue(L, arg); - return 1; - } - else { /* check whether it is a numerical string */ - size_t len; - const char *s = lua_tolstring(L, arg, &len); - return (s != NULL && lua_stringtonumber(L, s) == len + 1); - } -} - - -static void trymt (lua_State *L, const char *mtname) { - lua_settop(L, 2); /* back to the original arguments */ - if (l_unlikely(lua_type(L, 2) == LUA_TSTRING || - !luaL_getmetafield(L, 2, mtname))) - luaL_error(L, "attempt to %s a '%s' with a '%s'", mtname + 2, - luaL_typename(L, -2), luaL_typename(L, -1)); - lua_insert(L, -3); /* put metamethod before arguments */ - lua_call(L, 2, 1); /* call metamethod */ -} - - -static int arith (lua_State *L, int op, const char *mtname) { - if (tonum(L, 1) && tonum(L, 2)) - lua_arith(L, op); /* result will be on the top */ - else - trymt(L, mtname); - return 1; -} - - -static int arith_add (lua_State *L) { - return arith(L, LUA_OPADD, "__add"); -} - -static int arith_sub (lua_State *L) { - return arith(L, LUA_OPSUB, "__sub"); -} - -static int arith_mul (lua_State *L) { - return arith(L, LUA_OPMUL, "__mul"); -} - -static int arith_mod (lua_State *L) { - return arith(L, LUA_OPMOD, "__mod"); -} - -static int arith_pow (lua_State *L) { - return arith(L, LUA_OPPOW, "__pow"); -} - -static int arith_div (lua_State *L) { - return arith(L, LUA_OPDIV, "__div"); -} - -static int arith_idiv (lua_State *L) { - return arith(L, LUA_OPIDIV, "__idiv"); -} - -static int arith_unm (lua_State *L) { - return arith(L, LUA_OPUNM, "__unm"); -} - - -static const luaL_Reg stringmetamethods[] = { - {"__add", arith_add}, - {"__sub", arith_sub}, - {"__mul", arith_mul}, - {"__mod", arith_mod}, - {"__pow", arith_pow}, - {"__div", arith_div}, - {"__idiv", arith_idiv}, - {"__unm", arith_unm}, - {"__index", NULL}, /* placeholder */ - {NULL, NULL} -}; - -#endif /* } */ - -/* }====================================================== */ - -/* -** {====================================================== -** PATTERN MATCHING -** ======================================================= -*/ - - -#define CAP_UNFINISHED (-1) -#define CAP_POSITION (-2) - - -typedef struct MatchState { - const char *src_init; /* init of source string */ - const char *src_end; /* end ('\0') of source string */ - const char *p_end; /* end ('\0') of pattern */ - lua_State *L; - int matchdepth; /* control for recursive depth (to avoid C stack overflow) */ - unsigned char level; /* total number of captures (finished or unfinished) */ - struct { - const char *init; - ptrdiff_t len; - } capture[LUA_MAXCAPTURES]; -} MatchState; - - -/* recursive function */ -static const char *match (MatchState *ms, const char *s, const char *p); - - -/* maximum recursion depth for 'match' */ -#if !defined(MAXCCALLS) -#define MAXCCALLS 200 -#endif - - -#define L_ESC '%' -#define SPECIALS "^$*+?.([%-" - - -static int check_capture (MatchState *ms, int l) { - l -= '1'; - if (l_unlikely(l < 0 || l >= ms->level || - ms->capture[l].len == CAP_UNFINISHED)) - return luaL_error(ms->L, "invalid capture index %%%d", l + 1); - return l; -} - - -static int capture_to_close (MatchState *ms) { - int level = ms->level; - for (level--; level>=0; level--) - if (ms->capture[level].len == CAP_UNFINISHED) return level; - return luaL_error(ms->L, "invalid pattern capture"); -} - - -static const char *classend (MatchState *ms, const char *p) { - switch (*p++) { - case L_ESC: { - if (l_unlikely(p == ms->p_end)) - luaL_error(ms->L, "malformed pattern (ends with '%%')"); - return p+1; - } - case '[': { - if (*p == '^') p++; - do { /* look for a ']' */ - if (l_unlikely(p == ms->p_end)) - luaL_error(ms->L, "malformed pattern (missing ']')"); - if (*(p++) == L_ESC && p < ms->p_end) - p++; /* skip escapes (e.g. '%]') */ - } while (*p != ']'); - return p+1; - } - default: { - return p; - } - } -} - - -static int match_class (int c, int cl) { - int res; - switch (tolower(cl)) { - case 'a' : res = isalpha(c); break; - case 'c' : res = iscntrl(c); break; - case 'd' : res = isdigit(c); break; - case 'g' : res = isgraph(c); break; - case 'l' : res = islower(c); break; - case 'p' : res = ispunct(c); break; - case 's' : res = isspace(c); break; - case 'u' : res = isupper(c); break; - case 'w' : res = isalnum(c); break; - case 'x' : res = isxdigit(c); break; - case 'z' : res = (c == 0); break; /* deprecated option */ - default: return (cl == c); - } - return (islower(cl) ? res : !res); -} - - -static int matchbracketclass (int c, const char *p, const char *ec) { - int sig = 1; - if (*(p+1) == '^') { - sig = 0; - p++; /* skip the '^' */ - } - while (++p < ec) { - if (*p == L_ESC) { - p++; - if (match_class(c, uchar(*p))) - return sig; - } - else if ((*(p+1) == '-') && (p+2 < ec)) { - p+=2; - if (uchar(*(p-2)) <= c && c <= uchar(*p)) - return sig; - } - else if (uchar(*p) == c) return sig; - } - return !sig; -} - - -static int singlematch (MatchState *ms, const char *s, const char *p, - const char *ep) { - if (s >= ms->src_end) - return 0; - else { - int c = uchar(*s); - switch (*p) { - case '.': return 1; /* matches any char */ - case L_ESC: return match_class(c, uchar(*(p+1))); - case '[': return matchbracketclass(c, p, ep-1); - default: return (uchar(*p) == c); - } - } -} - - -static const char *matchbalance (MatchState *ms, const char *s, - const char *p) { - if (l_unlikely(p >= ms->p_end - 1)) - luaL_error(ms->L, "malformed pattern (missing arguments to '%%b')"); - if (*s != *p) return NULL; - else { - int b = *p; - int e = *(p+1); - int cont = 1; - while (++s < ms->src_end) { - if (*s == e) { - if (--cont == 0) return s+1; - } - else if (*s == b) cont++; - } - } - return NULL; /* string ends out of balance */ -} - - -static const char *max_expand (MatchState *ms, const char *s, - const char *p, const char *ep) { - ptrdiff_t i = 0; /* counts maximum expand for item */ - while (singlematch(ms, s + i, p, ep)) - i++; - /* keeps trying to match with the maximum repetitions */ - while (i>=0) { - const char *res = match(ms, (s+i), ep+1); - if (res) return res; - i--; /* else didn't match; reduce 1 repetition to try again */ - } - return NULL; -} - - -static const char *min_expand (MatchState *ms, const char *s, - const char *p, const char *ep) { - for (;;) { - const char *res = match(ms, s, ep+1); - if (res != NULL) - return res; - else if (singlematch(ms, s, p, ep)) - s++; /* try with one more repetition */ - else return NULL; - } -} - - -static const char *start_capture (MatchState *ms, const char *s, - const char *p, int what) { - const char *res; - int level = ms->level; - if (level >= LUA_MAXCAPTURES) luaL_error(ms->L, "too many captures"); - ms->capture[level].init = s; - ms->capture[level].len = what; - ms->level = level+1; - if ((res=match(ms, s, p)) == NULL) /* match failed? */ - ms->level--; /* undo capture */ - return res; -} - - -static const char *end_capture (MatchState *ms, const char *s, - const char *p) { - int l = capture_to_close(ms); - const char *res; - ms->capture[l].len = s - ms->capture[l].init; /* close capture */ - if ((res = match(ms, s, p)) == NULL) /* match failed? */ - ms->capture[l].len = CAP_UNFINISHED; /* undo capture */ - return res; -} - - -static const char *match_capture (MatchState *ms, const char *s, int l) { - size_t len; - l = check_capture(ms, l); - len = ms->capture[l].len; - if ((size_t)(ms->src_end-s) >= len && - memcmp(ms->capture[l].init, s, len) == 0) - return s+len; - else return NULL; -} - - -static const char *match (MatchState *ms, const char *s, const char *p) { - if (l_unlikely(ms->matchdepth-- == 0)) - luaL_error(ms->L, "pattern too complex"); - init: /* using goto to optimize tail recursion */ - if (p != ms->p_end) { /* end of pattern? */ - switch (*p) { - case '(': { /* start capture */ - if (*(p + 1) == ')') /* position capture? */ - s = start_capture(ms, s, p + 2, CAP_POSITION); - else - s = start_capture(ms, s, p + 1, CAP_UNFINISHED); - break; - } - case ')': { /* end capture */ - s = end_capture(ms, s, p + 1); - break; - } - case '$': { - if ((p + 1) != ms->p_end) /* is the '$' the last char in pattern? */ - goto dflt; /* no; go to default */ - s = (s == ms->src_end) ? s : NULL; /* check end of string */ - break; - } - case L_ESC: { /* escaped sequences not in the format class[*+?-]? */ - switch (*(p + 1)) { - case 'b': { /* balanced string? */ - s = matchbalance(ms, s, p + 2); - if (s != NULL) { - p += 4; goto init; /* return match(ms, s, p + 4); */ - } /* else fail (s == NULL) */ - break; - } - case 'f': { /* frontier? */ - const char *ep; char previous; - p += 2; - if (l_unlikely(*p != '[')) - luaL_error(ms->L, "missing '[' after '%%f' in pattern"); - ep = classend(ms, p); /* points to what is next */ - previous = (s == ms->src_init) ? '\0' : *(s - 1); - if (!matchbracketclass(uchar(previous), p, ep - 1) && - matchbracketclass(uchar(*s), p, ep - 1)) { - p = ep; goto init; /* return match(ms, s, ep); */ - } - s = NULL; /* match failed */ - break; - } - case '0': case '1': case '2': case '3': - case '4': case '5': case '6': case '7': - case '8': case '9': { /* capture results (%0-%9)? */ - s = match_capture(ms, s, uchar(*(p + 1))); - if (s != NULL) { - p += 2; goto init; /* return match(ms, s, p + 2) */ - } - break; - } - default: goto dflt; - } - break; - } - default: dflt: { /* pattern class plus optional suffix */ - const char *ep = classend(ms, p); /* points to optional suffix */ - /* does not match at least once? */ - if (!singlematch(ms, s, p, ep)) { - if (*ep == '*' || *ep == '?' || *ep == '-') { /* accept empty? */ - p = ep + 1; goto init; /* return match(ms, s, ep + 1); */ - } - else /* '+' or no suffix */ - s = NULL; /* fail */ - } - else { /* matched once */ - switch (*ep) { /* handle optional suffix */ - case '?': { /* optional */ - const char *res; - if ((res = match(ms, s + 1, ep + 1)) != NULL) - s = res; - else { - p = ep + 1; goto init; /* else return match(ms, s, ep + 1); */ - } - break; - } - case '+': /* 1 or more repetitions */ - s++; /* 1 match already done */ - /* FALLTHROUGH */ - case '*': /* 0 or more repetitions */ - s = max_expand(ms, s, p, ep); - break; - case '-': /* 0 or more repetitions (minimum) */ - s = min_expand(ms, s, p, ep); - break; - default: /* no suffix */ - s++; p = ep; goto init; /* return match(ms, s + 1, ep); */ - } - } - break; - } - } - } - ms->matchdepth++; - return s; -} - - - -static const char *lmemfind (const char *s1, size_t l1, - const char *s2, size_t l2) { - if (l2 == 0) return s1; /* empty strings are everywhere */ - else if (l2 > l1) return NULL; /* avoids a negative 'l1' */ - else { - const char *init; /* to search for a '*s2' inside 's1' */ - l2--; /* 1st char will be checked by 'memchr' */ - l1 = l1-l2; /* 's2' cannot be found after that */ - while (l1 > 0 && (init = (const char *)memchr(s1, *s2, l1)) != NULL) { - init++; /* 1st char is already checked */ - if (memcmp(init, s2+1, l2) == 0) - return init-1; - else { /* correct 'l1' and 's1' to try again */ - l1 -= init-s1; - s1 = init; - } - } - return NULL; /* not found */ - } -} - - -/* -** get information about the i-th capture. If there are no captures -** and 'i==0', return information about the whole match, which -** is the range 's'..'e'. If the capture is a string, return -** its length and put its address in '*cap'. If it is an integer -** (a position), push it on the stack and return CAP_POSITION. -*/ -static size_t get_onecapture (MatchState *ms, int i, const char *s, - const char *e, const char **cap) { - if (i >= ms->level) { - if (l_unlikely(i != 0)) - luaL_error(ms->L, "invalid capture index %%%d", i + 1); - *cap = s; - return e - s; - } - else { - ptrdiff_t capl = ms->capture[i].len; - *cap = ms->capture[i].init; - if (l_unlikely(capl == CAP_UNFINISHED)) - luaL_error(ms->L, "unfinished capture"); - else if (capl == CAP_POSITION) - lua_pushinteger(ms->L, (ms->capture[i].init - ms->src_init) + 1); - return capl; - } -} - - -/* -** Push the i-th capture on the stack. -*/ -static void push_onecapture (MatchState *ms, int i, const char *s, - const char *e) { - const char *cap; - ptrdiff_t l = get_onecapture(ms, i, s, e, &cap); - if (l != CAP_POSITION) - lua_pushlstring(ms->L, cap, l); - /* else position was already pushed */ -} - - -static int push_captures (MatchState *ms, const char *s, const char *e) { - int i; - int nlevels = (ms->level == 0 && s) ? 1 : ms->level; - luaL_checkstack(ms->L, nlevels, "too many captures"); - for (i = 0; i < nlevels; i++) - push_onecapture(ms, i, s, e); - return nlevels; /* number of strings pushed */ -} - - -/* check whether pattern has no special characters */ -static int nospecials (const char *p, size_t l) { - size_t upto = 0; - do { - if (strpbrk(p + upto, SPECIALS)) - return 0; /* pattern has a special character */ - upto += strlen(p + upto) + 1; /* may have more after \0 */ - } while (upto <= l); - return 1; /* no special chars found */ -} - - -static void prepstate (MatchState *ms, lua_State *L, - const char *s, size_t ls, const char *p, size_t lp) { - ms->L = L; - ms->matchdepth = MAXCCALLS; - ms->src_init = s; - ms->src_end = s + ls; - ms->p_end = p + lp; -} - - -static void reprepstate (MatchState *ms) { - ms->level = 0; - lua_assert(ms->matchdepth == MAXCCALLS); -} - - -static int str_find_aux (lua_State *L, int find) { - size_t ls, lp; - const char *s = luaL_checklstring(L, 1, &ls); - const char *p = luaL_checklstring(L, 2, &lp); - size_t init = posrelatI(luaL_optinteger(L, 3, 1), ls) - 1; - if (init > ls) { /* start after string's end? */ - luaL_pushfail(L); /* cannot find anything */ - return 1; - } - /* explicit request or no special characters? */ - if (find && (lua_toboolean(L, 4) || nospecials(p, lp))) { - /* do a plain search */ - const char *s2 = lmemfind(s + init, ls - init, p, lp); - if (s2) { - lua_pushinteger(L, (s2 - s) + 1); - lua_pushinteger(L, (s2 - s) + lp); - return 2; - } - } - else { - MatchState ms; - const char *s1 = s + init; - int anchor = (*p == '^'); - if (anchor) { - p++; lp--; /* skip anchor character */ - } - prepstate(&ms, L, s, ls, p, lp); - do { - const char *res; - reprepstate(&ms); - if ((res=match(&ms, s1, p)) != NULL) { - if (find) { - lua_pushinteger(L, (s1 - s) + 1); /* start */ - lua_pushinteger(L, res - s); /* end */ - return push_captures(&ms, NULL, 0) + 2; - } - else - return push_captures(&ms, s1, res); - } - } while (s1++ < ms.src_end && !anchor); - } - luaL_pushfail(L); /* not found */ - return 1; -} - - -static int str_find (lua_State *L) { - return str_find_aux(L, 1); -} - - -static int str_match (lua_State *L) { - return str_find_aux(L, 0); -} - - -/* state for 'gmatch' */ -typedef struct GMatchState { - const char *src; /* current position */ - const char *p; /* pattern */ - const char *lastmatch; /* end of last match */ - MatchState ms; /* match state */ -} GMatchState; - - -static int gmatch_aux (lua_State *L) { - GMatchState *gm = (GMatchState *)lua_touserdata(L, lua_upvalueindex(3)); - const char *src; - gm->ms.L = L; - for (src = gm->src; src <= gm->ms.src_end; src++) { - const char *e; - reprepstate(&gm->ms); - if ((e = match(&gm->ms, src, gm->p)) != NULL && e != gm->lastmatch) { - gm->src = gm->lastmatch = e; - return push_captures(&gm->ms, src, e); - } - } - return 0; /* not found */ -} - - -static int gmatch (lua_State *L) { - size_t ls, lp; - const char *s = luaL_checklstring(L, 1, &ls); - const char *p = luaL_checklstring(L, 2, &lp); - size_t init = posrelatI(luaL_optinteger(L, 3, 1), ls) - 1; - GMatchState *gm; - lua_settop(L, 2); /* keep strings on closure to avoid being collected */ - gm = (GMatchState *)lua_newuserdatauv(L, sizeof(GMatchState), 0); - if (init > ls) /* start after string's end? */ - init = ls + 1; /* avoid overflows in 's + init' */ - prepstate(&gm->ms, L, s, ls, p, lp); - gm->src = s + init; gm->p = p; gm->lastmatch = NULL; - lua_pushcclosure(L, gmatch_aux, 3); - return 1; -} - - -static void add_s (MatchState *ms, luaL_Buffer *b, const char *s, - const char *e) { - size_t l; - lua_State *L = ms->L; - const char *news = lua_tolstring(L, 3, &l); - const char *p; - while ((p = (char *)memchr(news, L_ESC, l)) != NULL) { - luaL_addlstring(b, news, p - news); - p++; /* skip ESC */ - if (*p == L_ESC) /* '%%' */ - luaL_addchar(b, *p); - else if (*p == '0') /* '%0' */ - luaL_addlstring(b, s, e - s); - else if (isdigit(uchar(*p))) { /* '%n' */ - const char *cap; - ptrdiff_t resl = get_onecapture(ms, *p - '1', s, e, &cap); - if (resl == CAP_POSITION) - luaL_addvalue(b); /* add position to accumulated result */ - else - luaL_addlstring(b, cap, resl); - } - else - luaL_error(L, "invalid use of '%c' in replacement string", L_ESC); - l -= p + 1 - news; - news = p + 1; - } - luaL_addlstring(b, news, l); -} - - -/* -** Add the replacement value to the string buffer 'b'. -** Return true if the original string was changed. (Function calls and -** table indexing resulting in nil or false do not change the subject.) -*/ -static int add_value (MatchState *ms, luaL_Buffer *b, const char *s, - const char *e, int tr) { - lua_State *L = ms->L; - switch (tr) { - case LUA_TFUNCTION: { /* call the function */ - int n; - lua_pushvalue(L, 3); /* push the function */ - n = push_captures(ms, s, e); /* all captures as arguments */ - lua_call(L, n, 1); /* call it */ - break; - } - case LUA_TTABLE: { /* index the table */ - push_onecapture(ms, 0, s, e); /* first capture is the index */ - lua_gettable(L, 3); - break; - } - default: { /* LUA_TNUMBER or LUA_TSTRING */ - add_s(ms, b, s, e); /* add value to the buffer */ - return 1; /* something changed */ - } - } - if (!lua_toboolean(L, -1)) { /* nil or false? */ - lua_pop(L, 1); /* remove value */ - luaL_addlstring(b, s, e - s); /* keep original text */ - return 0; /* no changes */ - } - else if (l_unlikely(!lua_isstring(L, -1))) - return luaL_error(L, "invalid replacement value (a %s)", - luaL_typename(L, -1)); - else { - luaL_addvalue(b); /* add result to accumulator */ - return 1; /* something changed */ - } -} - - -static int str_gsub (lua_State *L) { - size_t srcl, lp; - const char *src = luaL_checklstring(L, 1, &srcl); /* subject */ - const char *p = luaL_checklstring(L, 2, &lp); /* pattern */ - const char *lastmatch = NULL; /* end of last match */ - int tr = lua_type(L, 3); /* replacement type */ - lua_Integer max_s = luaL_optinteger(L, 4, srcl + 1); /* max replacements */ - int anchor = (*p == '^'); - lua_Integer n = 0; /* replacement count */ - int changed = 0; /* change flag */ - MatchState ms; - luaL_Buffer b; - luaL_argexpected(L, tr == LUA_TNUMBER || tr == LUA_TSTRING || - tr == LUA_TFUNCTION || tr == LUA_TTABLE, 3, - "string/function/table"); - luaL_buffinit(L, &b); - if (anchor) { - p++; lp--; /* skip anchor character */ - } - prepstate(&ms, L, src, srcl, p, lp); - while (n < max_s) { - const char *e; - reprepstate(&ms); /* (re)prepare state for new match */ - if ((e = match(&ms, src, p)) != NULL && e != lastmatch) { /* match? */ - n++; - changed = add_value(&ms, &b, src, e, tr) | changed; - src = lastmatch = e; - } - else if (src < ms.src_end) /* otherwise, skip one character */ - luaL_addchar(&b, *src++); - else break; /* end of subject */ - if (anchor) break; - } - if (!changed) /* no changes? */ - lua_pushvalue(L, 1); /* return original string */ - else { /* something changed */ - luaL_addlstring(&b, src, ms.src_end-src); - luaL_pushresult(&b); /* create and return new string */ - } - lua_pushinteger(L, n); /* number of substitutions */ - return 2; -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** STRING FORMAT -** ======================================================= -*/ - -#if !defined(lua_number2strx) /* { */ - -/* -** Hexadecimal floating-point formatter -*/ - -#define SIZELENMOD (sizeof(LUA_NUMBER_FRMLEN)/sizeof(char)) - - -/* -** Number of bits that goes into the first digit. It can be any value -** between 1 and 4; the following definition tries to align the number -** to nibble boundaries by making what is left after that first digit a -** multiple of 4. -*/ -#define L_NBFD ((l_floatatt(MANT_DIG) - 1)%4 + 1) - - -/* -** Add integer part of 'x' to buffer and return new 'x' -*/ -static lua_Number adddigit (char *buff, int n, lua_Number x) { - lua_Number dd = l_mathop(floor)(x); /* get integer part from 'x' */ - int d = (int)dd; - buff[n] = (d < 10 ? d + '0' : d - 10 + 'a'); /* add to buffer */ - return x - dd; /* return what is left */ -} - - -static int num2straux (char *buff, int sz, lua_Number x) { - /* if 'inf' or 'NaN', format it like '%g' */ - if (x != x || x == (lua_Number)HUGE_VAL || x == -(lua_Number)HUGE_VAL) - return l_sprintf(buff, sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)x); - else if (x == 0) { /* can be -0... */ - /* create "0" or "-0" followed by exponent */ - return l_sprintf(buff, sz, LUA_NUMBER_FMT "x0p+0", (LUAI_UACNUMBER)x); - } - else { - int e; - lua_Number m = l_mathop(frexp)(x, &e); /* 'x' fraction and exponent */ - int n = 0; /* character count */ - if (m < 0) { /* is number negative? */ - buff[n++] = '-'; /* add sign */ - m = -m; /* make it positive */ - } - buff[n++] = '0'; buff[n++] = 'x'; /* add "0x" */ - m = adddigit(buff, n++, m * (1 << L_NBFD)); /* add first digit */ - e -= L_NBFD; /* this digit goes before the radix point */ - if (m > 0) { /* more digits? */ - buff[n++] = lua_getlocaledecpoint(); /* add radix point */ - do { /* add as many digits as needed */ - m = adddigit(buff, n++, m * 16); - } while (m > 0); - } - n += l_sprintf(buff + n, sz - n, "p%+d", e); /* add exponent */ - lua_assert(n < sz); - return n; - } -} - - -static int lua_number2strx (lua_State *L, char *buff, int sz, - const char *fmt, lua_Number x) { - int n = num2straux(buff, sz, x); - if (fmt[SIZELENMOD] == 'A') { - int i; - for (i = 0; i < n; i++) - buff[i] = toupper(uchar(buff[i])); - } - else if (l_unlikely(fmt[SIZELENMOD] != 'a')) - return luaL_error(L, "modifiers for format '%%a'/'%%A' not implemented"); - return n; -} - -#endif /* } */ - - -/* -** Maximum size for items formatted with '%f'. This size is produced -** by format('%.99f', -maxfloat), and is equal to 99 + 3 ('-', '.', -** and '\0') + number of decimal digits to represent maxfloat (which -** is maximum exponent + 1). (99+3+1, adding some extra, 110) -*/ -#define MAX_ITEMF (110 + l_floatatt(MAX_10_EXP)) - - -/* -** All formats except '%f' do not need that large limit. The other -** float formats use exponents, so that they fit in the 99 limit for -** significant digits; 's' for large strings and 'q' add items directly -** to the buffer; all integer formats also fit in the 99 limit. The -** worst case are floats: they may need 99 significant digits, plus -** '0x', '-', '.', 'e+XXXX', and '\0'. Adding some extra, 120. -*/ -#define MAX_ITEM 120 - - -/* valid flags in a format specification */ -#if !defined(L_FMTFLAGSF) - -/* valid flags for a, A, e, E, f, F, g, and G conversions */ -#define L_FMTFLAGSF "-+#0 " - -/* valid flags for o, x, and X conversions */ -#define L_FMTFLAGSX "-#0" - -/* valid flags for d and i conversions */ -#define L_FMTFLAGSI "-+0 " - -/* valid flags for u conversions */ -#define L_FMTFLAGSU "-0" - -/* valid flags for c, p, and s conversions */ -#define L_FMTFLAGSC "-" - -#endif - - -/* -** Maximum size of each format specification (such as "%-099.99d"): -** Initial '%', flags (up to 5), width (2), period, precision (2), -** length modifier (8), conversion specifier, and final '\0', plus some -** extra. -*/ -#define MAX_FORMAT 32 - - -static void addquoted (luaL_Buffer *b, const char *s, size_t len) { - luaL_addchar(b, '"'); - while (len--) { - if (*s == '"' || *s == '\\' || *s == '\n') { - luaL_addchar(b, '\\'); - luaL_addchar(b, *s); - } - else if (iscntrl(uchar(*s))) { - char buff[10]; - if (!isdigit(uchar(*(s+1)))) - l_sprintf(buff, sizeof(buff), "\\%d", (int)uchar(*s)); - else - l_sprintf(buff, sizeof(buff), "\\%03d", (int)uchar(*s)); - luaL_addstring(b, buff); - } - else - luaL_addchar(b, *s); - s++; - } - luaL_addchar(b, '"'); -} - - -/* -** Serialize a floating-point number in such a way that it can be -** scanned back by Lua. Use hexadecimal format for "common" numbers -** (to preserve precision); inf, -inf, and NaN are handled separately. -** (NaN cannot be expressed as a numeral, so we write '(0/0)' for it.) -*/ -static int quotefloat (lua_State *L, char *buff, lua_Number n) { - const char *s; /* for the fixed representations */ - if (n == (lua_Number)HUGE_VAL) /* inf? */ - s = "1e9999"; - else if (n == -(lua_Number)HUGE_VAL) /* -inf? */ - s = "-1e9999"; - else if (n != n) /* NaN? */ - s = "(0/0)"; - else { /* format number as hexadecimal */ - int nb = lua_number2strx(L, buff, MAX_ITEM, - "%" LUA_NUMBER_FRMLEN "a", n); - /* ensures that 'buff' string uses a dot as the radix character */ - if (memchr(buff, '.', nb) == NULL) { /* no dot? */ - char point = lua_getlocaledecpoint(); /* try locale point */ - char *ppoint = (char *)memchr(buff, point, nb); - if (ppoint) *ppoint = '.'; /* change it to a dot */ - } - return nb; - } - /* for the fixed representations */ - return l_sprintf(buff, MAX_ITEM, "%s", s); -} - - -static void addliteral (lua_State *L, luaL_Buffer *b, int arg) { - switch (lua_type(L, arg)) { - case LUA_TSTRING: { - size_t len; - const char *s = lua_tolstring(L, arg, &len); - addquoted(b, s, len); - break; - } - case LUA_TNUMBER: { - char *buff = luaL_prepbuffsize(b, MAX_ITEM); - int nb; - if (!lua_isinteger(L, arg)) /* float? */ - nb = quotefloat(L, buff, lua_tonumber(L, arg)); - else { /* integers */ - lua_Integer n = lua_tointeger(L, arg); - const char *format = (n == LUA_MININTEGER) /* corner case? */ - ? "0x%" LUA_INTEGER_FRMLEN "x" /* use hex */ - : LUA_INTEGER_FMT; /* else use default format */ - nb = l_sprintf(buff, MAX_ITEM, format, (LUAI_UACINT)n); - } - luaL_addsize(b, nb); - break; - } - case LUA_TNIL: case LUA_TBOOLEAN: { - luaL_tolstring(L, arg, NULL); - luaL_addvalue(b); - break; - } - default: { - luaL_argerror(L, arg, "value has no literal form"); - } - } -} - - -static const char *get2digits (const char *s) { - if (isdigit(uchar(*s))) { - s++; - if (isdigit(uchar(*s))) s++; /* (2 digits at most) */ - } - return s; -} - - -/* -** Check whether a conversion specification is valid. When called, -** first character in 'form' must be '%' and last character must -** be a valid conversion specifier. 'flags' are the accepted flags; -** 'precision' signals whether to accept a precision. -*/ -static void checkformat (lua_State *L, const char *form, const char *flags, - int precision) { - const char *spec = form + 1; /* skip '%' */ - spec += strspn(spec, flags); /* skip flags */ - if (*spec != '0') { /* a width cannot start with '0' */ - spec = get2digits(spec); /* skip width */ - if (*spec == '.' && precision) { - spec++; - spec = get2digits(spec); /* skip precision */ - } - } - if (!isalpha(uchar(*spec))) /* did not go to the end? */ - luaL_error(L, "invalid conversion specification: '%s'", form); -} - - -/* -** Get a conversion specification and copy it to 'form'. -** Return the address of its last character. -*/ -static const char *getformat (lua_State *L, const char *strfrmt, - char *form) { - /* spans flags, width, and precision ('0' is included as a flag) */ - size_t len = strspn(strfrmt, L_FMTFLAGSF "123456789."); - len++; /* adds following character (should be the specifier) */ - /* still needs space for '%', '\0', plus a length modifier */ - if (len >= MAX_FORMAT - 10) - luaL_error(L, "invalid format (too long)"); - *(form++) = '%'; - memcpy(form, strfrmt, len * sizeof(char)); - *(form + len) = '\0'; - return strfrmt + len - 1; -} - - -/* -** add length modifier into formats -*/ -static void addlenmod (char *form, const char *lenmod) { - size_t l = strlen(form); - size_t lm = strlen(lenmod); - char spec = form[l - 1]; - strcpy(form + l - 1, lenmod); - form[l + lm - 1] = spec; - form[l + lm] = '\0'; -} - - -static int str_format (lua_State *L) { - int top = lua_gettop(L); - int arg = 1; - size_t sfl; - const char *strfrmt = luaL_checklstring(L, arg, &sfl); - const char *strfrmt_end = strfrmt+sfl; - const char *flags; - luaL_Buffer b; - luaL_buffinit(L, &b); - while (strfrmt < strfrmt_end) { - if (*strfrmt != L_ESC) - luaL_addchar(&b, *strfrmt++); - else if (*++strfrmt == L_ESC) - luaL_addchar(&b, *strfrmt++); /* %% */ - else { /* format item */ - char form[MAX_FORMAT]; /* to store the format ('%...') */ - int maxitem = MAX_ITEM; /* maximum length for the result */ - char *buff = luaL_prepbuffsize(&b, maxitem); /* to put result */ - int nb = 0; /* number of bytes in result */ - if (++arg > top) - return luaL_argerror(L, arg, "no value"); - strfrmt = getformat(L, strfrmt, form); - switch (*strfrmt++) { - case 'c': { - checkformat(L, form, L_FMTFLAGSC, 0); - nb = l_sprintf(buff, maxitem, form, (int)luaL_checkinteger(L, arg)); - break; - } - case 'd': case 'i': - flags = L_FMTFLAGSI; - goto intcase; - case 'u': - flags = L_FMTFLAGSU; - goto intcase; - case 'o': case 'x': case 'X': - flags = L_FMTFLAGSX; - intcase: { - lua_Integer n = luaL_checkinteger(L, arg); - checkformat(L, form, flags, 1); - addlenmod(form, LUA_INTEGER_FRMLEN); - nb = l_sprintf(buff, maxitem, form, (LUAI_UACINT)n); - break; - } - case 'a': case 'A': - checkformat(L, form, L_FMTFLAGSF, 1); - addlenmod(form, LUA_NUMBER_FRMLEN); - nb = lua_number2strx(L, buff, maxitem, form, - luaL_checknumber(L, arg)); - break; - case 'f': - maxitem = MAX_ITEMF; /* extra space for '%f' */ - buff = luaL_prepbuffsize(&b, maxitem); - /* FALLTHROUGH */ - case 'e': case 'E': case 'g': case 'G': { - lua_Number n = luaL_checknumber(L, arg); - checkformat(L, form, L_FMTFLAGSF, 1); - addlenmod(form, LUA_NUMBER_FRMLEN); - nb = l_sprintf(buff, maxitem, form, (LUAI_UACNUMBER)n); - break; - } - case 'p': { - const void *p = lua_topointer(L, arg); - checkformat(L, form, L_FMTFLAGSC, 0); - if (p == NULL) { /* avoid calling 'printf' with argument NULL */ - p = "(null)"; /* result */ - form[strlen(form) - 1] = 's'; /* format it as a string */ - } - nb = l_sprintf(buff, maxitem, form, p); - break; - } - case 'q': { - if (form[2] != '\0') /* modifiers? */ - return luaL_error(L, "specifier '%%q' cannot have modifiers"); - addliteral(L, &b, arg); - break; - } - case 's': { - size_t l; - const char *s = luaL_tolstring(L, arg, &l); - if (form[2] == '\0') /* no modifiers? */ - luaL_addvalue(&b); /* keep entire string */ - else { - luaL_argcheck(L, l == strlen(s), arg, "string contains zeros"); - checkformat(L, form, L_FMTFLAGSC, 1); - if (strchr(form, '.') == NULL && l >= 100) { - /* no precision and string is too long to be formatted */ - luaL_addvalue(&b); /* keep entire string */ - } - else { /* format the string into 'buff' */ - nb = l_sprintf(buff, maxitem, form, s); - lua_pop(L, 1); /* remove result from 'luaL_tolstring' */ - } - } - break; - } - default: { /* also treat cases 'pnLlh' */ - return luaL_error(L, "invalid conversion '%s' to 'format'", form); - } - } - lua_assert(nb < maxitem); - luaL_addsize(&b, nb); - } - } - luaL_pushresult(&b); - return 1; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** PACK/UNPACK -** ======================================================= -*/ - - -/* value used for padding */ -#if !defined(LUAL_PACKPADBYTE) -#define LUAL_PACKPADBYTE 0x00 -#endif - -/* maximum size for the binary representation of an integer */ -#define MAXINTSIZE 16 - -/* number of bits in a character */ -#define NB CHAR_BIT - -/* mask for one character (NB 1's) */ -#define MC ((1 << NB) - 1) - -/* size of a lua_Integer */ -#define SZINT ((int)sizeof(lua_Integer)) - - -/* dummy union to get native endianness */ -static const union { - int dummy; - char little; /* true iff machine is little endian */ -} nativeendian = {1}; - - -/* -** information to pack/unpack stuff -*/ -typedef struct Header { - lua_State *L; - int islittle; - int maxalign; -} Header; - - -/* -** options for pack/unpack -*/ -typedef enum KOption { - Kint, /* signed integers */ - Kuint, /* unsigned integers */ - Kfloat, /* single-precision floating-point numbers */ - Knumber, /* Lua "native" floating-point numbers */ - Kdouble, /* double-precision floating-point numbers */ - Kchar, /* fixed-length strings */ - Kstring, /* strings with prefixed length */ - Kzstr, /* zero-terminated strings */ - Kpadding, /* padding */ - Kpaddalign, /* padding for alignment */ - Knop /* no-op (configuration or spaces) */ -} KOption; - - -/* -** Read an integer numeral from string 'fmt' or return 'df' if -** there is no numeral -*/ -static int digit (int c) { return '0' <= c && c <= '9'; } - -static int getnum (const char **fmt, int df) { - if (!digit(**fmt)) /* no number? */ - return df; /* return default value */ - else { - int a = 0; - do { - a = a*10 + (*((*fmt)++) - '0'); - } while (digit(**fmt) && a <= ((int)MAXSIZE - 9)/10); - return a; - } -} - - -/* -** Read an integer numeral and raises an error if it is larger -** than the maximum size for integers. -*/ -static int getnumlimit (Header *h, const char **fmt, int df) { - int sz = getnum(fmt, df); - if (l_unlikely(sz > MAXINTSIZE || sz <= 0)) - return luaL_error(h->L, "integral size (%d) out of limits [1,%d]", - sz, MAXINTSIZE); - return sz; -} - - -/* -** Initialize Header -*/ -static void initheader (lua_State *L, Header *h) { - h->L = L; - h->islittle = nativeendian.little; - h->maxalign = 1; -} - - -/* -** Read and classify next option. 'size' is filled with option's size. -*/ -static KOption getoption (Header *h, const char **fmt, int *size) { - /* dummy structure to get native alignment requirements */ - struct cD { char c; union { LUAI_MAXALIGN; } u; }; - int opt = *((*fmt)++); - *size = 0; /* default */ - switch (opt) { - case 'b': *size = sizeof(char); return Kint; - case 'B': *size = sizeof(char); return Kuint; - case 'h': *size = sizeof(short); return Kint; - case 'H': *size = sizeof(short); return Kuint; - case 'l': *size = sizeof(long); return Kint; - case 'L': *size = sizeof(long); return Kuint; - case 'j': *size = sizeof(lua_Integer); return Kint; - case 'J': *size = sizeof(lua_Integer); return Kuint; - case 'T': *size = sizeof(size_t); return Kuint; - case 'f': *size = sizeof(float); return Kfloat; - case 'n': *size = sizeof(lua_Number); return Knumber; - case 'd': *size = sizeof(double); return Kdouble; - case 'i': *size = getnumlimit(h, fmt, sizeof(int)); return Kint; - case 'I': *size = getnumlimit(h, fmt, sizeof(int)); return Kuint; - case 's': *size = getnumlimit(h, fmt, sizeof(size_t)); return Kstring; - case 'c': - *size = getnum(fmt, -1); - if (l_unlikely(*size == -1)) - luaL_error(h->L, "missing size for format option 'c'"); - return Kchar; - case 'z': return Kzstr; - case 'x': *size = 1; return Kpadding; - case 'X': return Kpaddalign; - case ' ': break; - case '<': h->islittle = 1; break; - case '>': h->islittle = 0; break; - case '=': h->islittle = nativeendian.little; break; - case '!': { - const int maxalign = offsetof(struct cD, u); - h->maxalign = getnumlimit(h, fmt, maxalign); - break; - } - default: luaL_error(h->L, "invalid format option '%c'", opt); - } - return Knop; -} - - -/* -** Read, classify, and fill other details about the next option. -** 'psize' is filled with option's size, 'notoalign' with its -** alignment requirements. -** Local variable 'size' gets the size to be aligned. (Kpadal option -** always gets its full alignment, other options are limited by -** the maximum alignment ('maxalign'). Kchar option needs no alignment -** despite its size. -*/ -static KOption getdetails (Header *h, size_t totalsize, - const char **fmt, int *psize, int *ntoalign) { - KOption opt = getoption(h, fmt, psize); - int align = *psize; /* usually, alignment follows size */ - if (opt == Kpaddalign) { /* 'X' gets alignment from following option */ - if (**fmt == '\0' || getoption(h, fmt, &align) == Kchar || align == 0) - luaL_argerror(h->L, 1, "invalid next option for option 'X'"); - } - if (align <= 1 || opt == Kchar) /* need no alignment? */ - *ntoalign = 0; - else { - if (align > h->maxalign) /* enforce maximum alignment */ - align = h->maxalign; - if (l_unlikely((align & (align - 1)) != 0)) /* not a power of 2? */ - luaL_argerror(h->L, 1, "format asks for alignment not power of 2"); - *ntoalign = (align - (int)(totalsize & (align - 1))) & (align - 1); - } - return opt; -} - - -/* -** Pack integer 'n' with 'size' bytes and 'islittle' endianness. -** The final 'if' handles the case when 'size' is larger than -** the size of a Lua integer, correcting the extra sign-extension -** bytes if necessary (by default they would be zeros). -*/ -static void packint (luaL_Buffer *b, lua_Unsigned n, - int islittle, int size, int neg) { - char *buff = luaL_prepbuffsize(b, size); - int i; - buff[islittle ? 0 : size - 1] = (char)(n & MC); /* first byte */ - for (i = 1; i < size; i++) { - n >>= NB; - buff[islittle ? i : size - 1 - i] = (char)(n & MC); - } - if (neg && size > SZINT) { /* negative number need sign extension? */ - for (i = SZINT; i < size; i++) /* correct extra bytes */ - buff[islittle ? i : size - 1 - i] = (char)MC; - } - luaL_addsize(b, size); /* add result to buffer */ -} - - -/* -** Copy 'size' bytes from 'src' to 'dest', correcting endianness if -** given 'islittle' is different from native endianness. -*/ -static void copywithendian (char *dest, const char *src, - int size, int islittle) { - if (islittle == nativeendian.little) - memcpy(dest, src, size); - else { - dest += size - 1; - while (size-- != 0) - *(dest--) = *(src++); - } -} - - -static int str_pack (lua_State *L) { - luaL_Buffer b; - Header h; - const char *fmt = luaL_checkstring(L, 1); /* format string */ - int arg = 1; /* current argument to pack */ - size_t totalsize = 0; /* accumulate total size of result */ - initheader(L, &h); - lua_pushnil(L); /* mark to separate arguments from string buffer */ - luaL_buffinit(L, &b); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, totalsize, &fmt, &size, &ntoalign); - totalsize += ntoalign + size; - while (ntoalign-- > 0) - luaL_addchar(&b, LUAL_PACKPADBYTE); /* fill alignment */ - arg++; - switch (opt) { - case Kint: { /* signed integers */ - lua_Integer n = luaL_checkinteger(L, arg); - if (size < SZINT) { /* need overflow check? */ - lua_Integer lim = (lua_Integer)1 << ((size * NB) - 1); - luaL_argcheck(L, -lim <= n && n < lim, arg, "integer overflow"); - } - packint(&b, (lua_Unsigned)n, h.islittle, size, (n < 0)); - break; - } - case Kuint: { /* unsigned integers */ - lua_Integer n = luaL_checkinteger(L, arg); - if (size < SZINT) /* need overflow check? */ - luaL_argcheck(L, (lua_Unsigned)n < ((lua_Unsigned)1 << (size * NB)), - arg, "unsigned overflow"); - packint(&b, (lua_Unsigned)n, h.islittle, size, 0); - break; - } - case Kfloat: { /* C float */ - float f = (float)luaL_checknumber(L, arg); /* get argument */ - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - /* move 'f' to final result, correcting endianness if needed */ - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Knumber: { /* Lua float */ - lua_Number f = luaL_checknumber(L, arg); /* get argument */ - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - /* move 'f' to final result, correcting endianness if needed */ - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Kdouble: { /* C double */ - double f = (double)luaL_checknumber(L, arg); /* get argument */ - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - /* move 'f' to final result, correcting endianness if needed */ - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Kchar: { /* fixed-size string */ - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, len <= (size_t)size, arg, - "string longer than given size"); - luaL_addlstring(&b, s, len); /* add string */ - while (len++ < (size_t)size) /* pad extra space */ - luaL_addchar(&b, LUAL_PACKPADBYTE); - break; - } - case Kstring: { /* strings with length count */ - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, size >= (int)sizeof(size_t) || - len < ((size_t)1 << (size * NB)), - arg, "string length does not fit in given size"); - packint(&b, (lua_Unsigned)len, h.islittle, size, 0); /* pack length */ - luaL_addlstring(&b, s, len); - totalsize += len; - break; - } - case Kzstr: { /* zero-terminated string */ - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, strlen(s) == len, arg, "string contains zeros"); - luaL_addlstring(&b, s, len); - luaL_addchar(&b, '\0'); /* add zero at the end */ - totalsize += len + 1; - break; - } - case Kpadding: luaL_addchar(&b, LUAL_PACKPADBYTE); /* FALLTHROUGH */ - case Kpaddalign: case Knop: - arg--; /* undo increment */ - break; - } - } - luaL_pushresult(&b); - return 1; -} - - -static int str_packsize (lua_State *L) { - Header h; - const char *fmt = luaL_checkstring(L, 1); /* format string */ - size_t totalsize = 0; /* accumulate total size of result */ - initheader(L, &h); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, totalsize, &fmt, &size, &ntoalign); - luaL_argcheck(L, opt != Kstring && opt != Kzstr, 1, - "variable-length format"); - size += ntoalign; /* total space used by option */ - luaL_argcheck(L, totalsize <= MAXSIZE - size, 1, - "format result too large"); - totalsize += size; - } - lua_pushinteger(L, (lua_Integer)totalsize); - return 1; -} - - -/* -** Unpack an integer with 'size' bytes and 'islittle' endianness. -** If size is smaller than the size of a Lua integer and integer -** is signed, must do sign extension (propagating the sign to the -** higher bits); if size is larger than the size of a Lua integer, -** it must check the unread bytes to see whether they do not cause an -** overflow. -*/ -static lua_Integer unpackint (lua_State *L, const char *str, - int islittle, int size, int issigned) { - lua_Unsigned res = 0; - int i; - int limit = (size <= SZINT) ? size : SZINT; - for (i = limit - 1; i >= 0; i--) { - res <<= NB; - res |= (lua_Unsigned)(unsigned char)str[islittle ? i : size - 1 - i]; - } - if (size < SZINT) { /* real size smaller than lua_Integer? */ - if (issigned) { /* needs sign extension? */ - lua_Unsigned mask = (lua_Unsigned)1 << (size*NB - 1); - res = ((res ^ mask) - mask); /* do sign extension */ - } - } - else if (size > SZINT) { /* must check unread bytes */ - int mask = (!issigned || (lua_Integer)res >= 0) ? 0 : MC; - for (i = limit; i < size; i++) { - if (l_unlikely((unsigned char)str[islittle ? i : size - 1 - i] != mask)) - luaL_error(L, "%d-byte integer does not fit into Lua Integer", size); - } - } - return (lua_Integer)res; -} - - -static int str_unpack (lua_State *L) { - Header h; - const char *fmt = luaL_checkstring(L, 1); - size_t ld; - const char *data = luaL_checklstring(L, 2, &ld); - size_t pos = posrelatI(luaL_optinteger(L, 3, 1), ld) - 1; - int n = 0; /* number of results */ - luaL_argcheck(L, pos <= ld, 3, "initial position out of string"); - initheader(L, &h); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, pos, &fmt, &size, &ntoalign); - luaL_argcheck(L, (size_t)ntoalign + size <= ld - pos, 2, - "data string too short"); - pos += ntoalign; /* skip alignment */ - /* stack space for item + next position */ - luaL_checkstack(L, 2, "too many results"); - n++; - switch (opt) { - case Kint: - case Kuint: { - lua_Integer res = unpackint(L, data + pos, h.islittle, size, - (opt == Kint)); - lua_pushinteger(L, res); - break; - } - case Kfloat: { - float f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, (lua_Number)f); - break; - } - case Knumber: { - lua_Number f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, f); - break; - } - case Kdouble: { - double f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, (lua_Number)f); - break; - } - case Kchar: { - lua_pushlstring(L, data + pos, size); - break; - } - case Kstring: { - size_t len = (size_t)unpackint(L, data + pos, h.islittle, size, 0); - luaL_argcheck(L, len <= ld - pos - size, 2, "data string too short"); - lua_pushlstring(L, data + pos + size, len); - pos += len; /* skip string */ - break; - } - case Kzstr: { - size_t len = strlen(data + pos); - luaL_argcheck(L, pos + len < ld, 2, - "unfinished string for format 'z'"); - lua_pushlstring(L, data + pos, len); - pos += len + 1; /* skip string plus final '\0' */ - break; - } - case Kpaddalign: case Kpadding: case Knop: - n--; /* undo increment */ - break; - } - pos += size; - } - lua_pushinteger(L, pos + 1); /* next position */ - return n + 1; -} - -/* }====================================================== */ - - -static const luaL_Reg strlib[] = { - {"byte", str_byte}, - {"char", str_char}, - {"dump", str_dump}, - {"find", str_find}, - {"format", str_format}, - {"gmatch", gmatch}, - {"gsub", str_gsub}, - {"len", str_len}, - {"lower", str_lower}, - {"match", str_match}, - {"rep", str_rep}, - {"reverse", str_reverse}, - {"sub", str_sub}, - {"upper", str_upper}, - {"pack", str_pack}, - {"packsize", str_packsize}, - {"unpack", str_unpack}, - {NULL, NULL} -}; - - -static void createmetatable (lua_State *L) { - /* table to be metatable for strings */ - luaL_newlibtable(L, stringmetamethods); - luaL_setfuncs(L, stringmetamethods, 0); - lua_pushliteral(L, ""); /* dummy string */ - lua_pushvalue(L, -2); /* copy table */ - lua_setmetatable(L, -2); /* set table as metatable for strings */ - lua_pop(L, 1); /* pop dummy string */ - lua_pushvalue(L, -2); /* get string library */ - lua_setfield(L, -2, "__index"); /* metatable.__index = string */ - lua_pop(L, 1); /* pop metatable */ -} - - -/* -** Open string library -*/ -LUAMOD_API int luaopen_string (lua_State *L) { - luaL_newlib(L, strlib); - createmetatable(L); - return 1; -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/ltable.c b/build/c/dependencies/luaCEmbed/dependencies/lua/ltable.c deleted file mode 100644 index ef19a5c..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/ltable.c +++ /dev/null @@ -1,1257 +0,0 @@ -/* -** $Id: ltable.c $ -** Lua tables (hash) -** See Copyright Notice in lua.h -*/ - -#define ltable_c -#define LUA_CORE - -#include "lprefix.h" - - -/* -** Implementation of tables (aka arrays, objects, or hash tables). -** Tables keep its elements in two parts: an array part and a hash part. -** Non-negative integer keys are all candidates to be kept in the array -** part. The actual size of the array is the largest 'n' such that -** more than half the slots between 1 and n are in use. -** Hash uses a mix of chained scatter table with Brent's variation. -** A main invariant of these tables is that, if an element is not -** in its main position (i.e. the 'original' position that its hash gives -** to it), then the colliding element is in its own main position. -** Hence even when the load factor reaches 100%, performance remains good. -*/ - -#include -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "lvm.h" - - -/* -** Only tables with hash parts larger than 2^LIMFORLAST has a 'lastfree' -** field that optimizes finding a free slot. That field is stored just -** before the array of nodes, in the same block. Smaller tables do a -** complete search when looking for a free slot. -*/ -#define LIMFORLAST 2 /* log2 of real limit */ - -/* -** The union 'Limbox' stores 'lastfree' and ensures that what follows it -** is properly aligned to store a Node. -*/ -typedef struct { Node *dummy; Node follows_pNode; } Limbox_aux; - -typedef union { - Node *lastfree; - char padding[offsetof(Limbox_aux, follows_pNode)]; -} Limbox; - -#define haslastfree(t) ((t)->lsizenode > LIMFORLAST) -#define getlastfree(t) ((cast(Limbox *, (t)->node) - 1)->lastfree) - - -/* -** MAXABITS is the largest integer such that 2^MAXABITS fits in an -** unsigned int. -*/ -#define MAXABITS cast_int(sizeof(int) * CHAR_BIT - 1) - - -/* -** MAXASIZEB is the maximum number of elements in the array part such -** that the size of the array fits in 'size_t'. -*/ -#define MAXASIZEB ((MAX_SIZET/sizeof(ArrayCell)) * NM) - - -/* -** MAXASIZE is the maximum size of the array part. It is the minimum -** between 2^MAXABITS and MAXASIZEB. -*/ -#define MAXASIZE \ - (((1u << MAXABITS) < MAXASIZEB) ? (1u << MAXABITS) : cast_uint(MAXASIZEB)) - -/* -** MAXHBITS is the largest integer such that 2^MAXHBITS fits in a -** signed int. -*/ -#define MAXHBITS (MAXABITS - 1) - - -/* -** MAXHSIZE is the maximum size of the hash part. It is the minimum -** between 2^MAXHBITS and the maximum size such that, measured in bytes, -** it fits in a 'size_t'. -*/ -#define MAXHSIZE luaM_limitN(1u << MAXHBITS, Node) - - -/* -** When the original hash value is good, hashing by a power of 2 -** avoids the cost of '%'. -*/ -#define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t)))) - -/* -** for other types, it is better to avoid modulo by power of 2, as -** they can have many 2 factors. -*/ -#define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1)))) - - -#define hashstr(t,str) hashpow2(t, (str)->hash) -#define hashboolean(t,p) hashpow2(t, p) - - -#define hashpointer(t,p) hashmod(t, point2uint(p)) - - -#define dummynode (&dummynode_) - -static const Node dummynode_ = { - {{NULL}, LUA_VEMPTY, /* value's value and type */ - LUA_VNIL, 0, {NULL}} /* key type, next, and key value */ -}; - - -static const TValue absentkey = {ABSTKEYCONSTANT}; - - -/* -** Hash for integers. To allow a good hash, use the remainder operator -** ('%'). If integer fits as a non-negative int, compute an int -** remainder, which is faster. Otherwise, use an unsigned-integer -** remainder, which uses all bits and ensures a non-negative result. -*/ -static Node *hashint (const Table *t, lua_Integer i) { - lua_Unsigned ui = l_castS2U(i); - if (ui <= cast_uint(INT_MAX)) - return hashmod(t, cast_int(ui)); - else - return hashmod(t, ui); -} - - -/* -** Hash for floating-point numbers. -** The main computation should be just -** n = frexp(n, &i); return (n * INT_MAX) + i -** but there are some numerical subtleties. -** In a two-complement representation, INT_MAX does not has an exact -** representation as a float, but INT_MIN does; because the absolute -** value of 'frexp' is smaller than 1 (unless 'n' is inf/NaN), the -** absolute value of the product 'frexp * -INT_MIN' is smaller or equal -** to INT_MAX. Next, the use of 'unsigned int' avoids overflows when -** adding 'i'; the use of '~u' (instead of '-u') avoids problems with -** INT_MIN. -*/ -#if !defined(l_hashfloat) -static int l_hashfloat (lua_Number n) { - int i; - lua_Integer ni; - n = l_mathop(frexp)(n, &i) * -cast_num(INT_MIN); - if (!lua_numbertointeger(n, &ni)) { /* is 'n' inf/-inf/NaN? */ - lua_assert(luai_numisnan(n) || l_mathop(fabs)(n) == cast_num(HUGE_VAL)); - return 0; - } - else { /* normal case */ - unsigned int u = cast_uint(i) + cast_uint(ni); - return cast_int(u <= cast_uint(INT_MAX) ? u : ~u); - } -} -#endif - - -/* -** returns the 'main' position of an element in a table (that is, -** the index of its hash value). -*/ -static Node *mainpositionTV (const Table *t, const TValue *key) { - switch (ttypetag(key)) { - case LUA_VNUMINT: { - lua_Integer i = ivalue(key); - return hashint(t, i); - } - case LUA_VNUMFLT: { - lua_Number n = fltvalue(key); - return hashmod(t, l_hashfloat(n)); - } - case LUA_VSHRSTR: { - TString *ts = tsvalue(key); - return hashstr(t, ts); - } - case LUA_VLNGSTR: { - TString *ts = tsvalue(key); - return hashpow2(t, luaS_hashlongstr(ts)); - } - case LUA_VFALSE: - return hashboolean(t, 0); - case LUA_VTRUE: - return hashboolean(t, 1); - case LUA_VLIGHTUSERDATA: { - void *p = pvalue(key); - return hashpointer(t, p); - } - case LUA_VLCF: { - lua_CFunction f = fvalue(key); - return hashpointer(t, f); - } - default: { - GCObject *o = gcvalue(key); - return hashpointer(t, o); - } - } -} - - -l_sinline Node *mainpositionfromnode (const Table *t, Node *nd) { - TValue key; - getnodekey(cast(lua_State *, NULL), &key, nd); - return mainpositionTV(t, &key); -} - - -/* -** Check whether key 'k1' is equal to the key in node 'n2'. This -** equality is raw, so there are no metamethods. Floats with integer -** values have been normalized, so integers cannot be equal to -** floats. It is assumed that 'eqshrstr' is simply pointer equality, so -** that short strings are handled in the default case. -** A true 'deadok' means to accept dead keys as equal to their original -** values. All dead keys are compared in the default case, by pointer -** identity. (Only collectable objects can produce dead keys.) Note that -** dead long strings are also compared by identity. -** Once a key is dead, its corresponding value may be collected, and -** then another value can be created with the same address. If this -** other value is given to 'next', 'equalkey' will signal a false -** positive. In a regular traversal, this situation should never happen, -** as all keys given to 'next' came from the table itself, and therefore -** could not have been collected. Outside a regular traversal, we -** have garbage in, garbage out. What is relevant is that this false -** positive does not break anything. (In particular, 'next' will return -** some other valid item on the table or nil.) -*/ -static int equalkey (const TValue *k1, const Node *n2, int deadok) { - if ((rawtt(k1) != keytt(n2)) && /* not the same variants? */ - !(deadok && keyisdead(n2) && iscollectable(k1))) - return 0; /* cannot be same key */ - switch (keytt(n2)) { - case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: - return 1; - case LUA_VNUMINT: - return (ivalue(k1) == keyival(n2)); - case LUA_VNUMFLT: - return luai_numeq(fltvalue(k1), fltvalueraw(keyval(n2))); - case LUA_VLIGHTUSERDATA: - return pvalue(k1) == pvalueraw(keyval(n2)); - case LUA_VLCF: - return fvalue(k1) == fvalueraw(keyval(n2)); - case ctb(LUA_VLNGSTR): - return luaS_eqlngstr(tsvalue(k1), keystrval(n2)); - default: - return gcvalue(k1) == gcvalueraw(keyval(n2)); - } -} - - -/* -** True if value of 'alimit' is equal to the real size of the array -** part of table 't'. (Otherwise, the array part must be larger than -** 'alimit'.) -*/ -#define limitequalsasize(t) (isrealasize(t) || ispow2((t)->alimit)) - - -/* -** Returns the real size of the 'array' array -*/ -LUAI_FUNC unsigned int luaH_realasize (const Table *t) { - if (limitequalsasize(t)) - return t->alimit; /* this is the size */ - else { - unsigned int size = t->alimit; - /* compute the smallest power of 2 not smaller than 'size' */ - size |= (size >> 1); - size |= (size >> 2); - size |= (size >> 4); - size |= (size >> 8); -#if (UINT_MAX >> 14) > 3 /* unsigned int has more than 16 bits */ - size |= (size >> 16); -#if (UINT_MAX >> 30) > 3 - size |= (size >> 32); /* unsigned int has more than 32 bits */ -#endif -#endif - size++; - lua_assert(ispow2(size) && size/2 < t->alimit && t->alimit < size); - return size; - } -} - - -/* -** Check whether real size of the array is a power of 2. -** (If it is not, 'alimit' cannot be changed to any other value -** without changing the real size.) -*/ -static int ispow2realasize (const Table *t) { - return (!isrealasize(t) || ispow2(t->alimit)); -} - - -static unsigned int setlimittosize (Table *t) { - t->alimit = luaH_realasize(t); - setrealasize(t); - return t->alimit; -} - - -#define limitasasize(t) check_exp(isrealasize(t), t->alimit) - - - -/* -** "Generic" get version. (Not that generic: not valid for integers, -** which may be in array part, nor for floats with integral values.) -** See explanation about 'deadok' in function 'equalkey'. -*/ -static const TValue *getgeneric (Table *t, const TValue *key, int deadok) { - Node *n = mainpositionTV(t, key); - for (;;) { /* check whether 'key' is somewhere in the chain */ - if (equalkey(key, n, deadok)) - return gval(n); /* that's it */ - else { - int nx = gnext(n); - if (nx == 0) - return &absentkey; /* not found */ - n += nx; - } - } -} - - -/* -** returns the index for 'k' if 'k' is an appropriate key to live in -** the array part of a table, 0 otherwise. -*/ -static unsigned int arrayindex (lua_Integer k) { - if (l_castS2U(k) - 1u < MAXASIZE) /* 'k' in [1, MAXASIZE]? */ - return cast_uint(k); /* 'key' is an appropriate array index */ - else - return 0; -} - - -/* -** returns the index of a 'key' for table traversals. First goes all -** elements in the array part, then elements in the hash part. The -** beginning of a traversal is signaled by 0. -*/ -static unsigned findindex (lua_State *L, Table *t, TValue *key, - unsigned asize) { - unsigned int i; - if (ttisnil(key)) return 0; /* first iteration */ - i = ttisinteger(key) ? arrayindex(ivalue(key)) : 0; - if (i - 1u < asize) /* is 'key' inside array part? */ - return i; /* yes; that's the index */ - else { - const TValue *n = getgeneric(t, key, 1); - if (l_unlikely(isabstkey(n))) - luaG_runerror(L, "invalid key to 'next'"); /* key not found */ - i = cast_int(nodefromval(n) - gnode(t, 0)); /* key index in hash table */ - /* hash elements are numbered after array ones */ - return (i + 1) + asize; - } -} - - -int luaH_next (lua_State *L, Table *t, StkId key) { - unsigned int asize = luaH_realasize(t); - unsigned int i = findindex(L, t, s2v(key), asize); /* find original key */ - for (; i < asize; i++) { /* try first array part */ - int tag = *getArrTag(t, i); - if (!tagisempty(tag)) { /* a non-empty entry? */ - setivalue(s2v(key), i + 1); - farr2val(t, i + 1, tag, s2v(key + 1)); - return 1; - } - } - for (i -= asize; cast_int(i) < sizenode(t); i++) { /* hash part */ - if (!isempty(gval(gnode(t, i)))) { /* a non-empty entry? */ - Node *n = gnode(t, i); - getnodekey(L, s2v(key), n); - setobj2s(L, key + 1, gval(n)); - return 1; - } - } - return 0; /* no more elements */ -} - - -static void freehash (lua_State *L, Table *t) { - if (!isdummy(t)) { - size_t bsize = sizenode(t) * sizeof(Node); /* 'node' size in bytes */ - char *arr = cast_charp(t->node); - if (haslastfree(t)) { - bsize += sizeof(Limbox); - arr -= sizeof(Limbox); - } - luaM_freearray(L, arr, bsize); - } -} - - -/* -** Check whether an integer key is in the array part. If 'alimit' is -** not the real size of the array, the key still can be in the array -** part. In this case, do the "Xmilia trick" to check whether 'key-1' -** is smaller than the real size. -** The trick works as follow: let 'p' be the integer such that -** '2^(p+1) >= alimit > 2^p', or '2^(p+1) > alimit-1 >= 2^p'. That is, -** 'p' is the highest 1-bit in 'alimit-1', and 2^(p+1) is the real size -** of the array. What we have to check becomes 'key-1 < 2^(p+1)'. We -** compute '(key-1) & ~(alimit-1)', which we call 'res'; it will have -** the 'p' bit cleared. (It may also clear other bits smaller than 'p', -** but no bit higher than 'p'.) If the key is outside the array, that -** is, 'key-1 >= 2^(p+1)', then 'res' will have some 1-bit higher than -** 'p', therefore it will be larger or equal to 'alimit', and the check -** will fail. If 'key-1 < 2^(p+1)', then 'res' has no 1-bit higher than -** 'p', and as the bit 'p' itself was cleared, 'res' will be smaller -** than 2^p, therefore smaller than 'alimit', and the check succeeds. -** As special cases, when 'alimit' is 0 the condition is trivially false, -** and when 'alimit' is 1 the condition simplifies to 'key-1 < alimit'. -** If key is 0 or negative, 'res' will have its higher bit on, so that -** it cannot be smaller than 'alimit'. -*/ -static int keyinarray (Table *t, lua_Integer key) { - lua_Unsigned alimit = t->alimit; - if (l_castS2U(key) - 1u < alimit) /* 'key' in [1, t->alimit]? */ - return 1; - else if (!isrealasize(t) && /* key still may be in the array part? */ - (((l_castS2U(key) - 1u) & ~(alimit - 1u)) < alimit)) { - t->alimit = cast_uint(key); /* probably '#t' is here now */ - return 1; - } - else - return 0; -} - - -/* -** {============================================================= -** Rehash -** ============================================================== -*/ - -/* -** Compute the optimal size for the array part of table 't'. 'nums' is a -** "count array" where 'nums[i]' is the number of integers in the table -** between 2^(i - 1) + 1 and 2^i. 'pna' enters with the total number of -** integer keys in the table and leaves with the number of keys that -** will go to the array part; return the optimal size. (The condition -** 'twotoi > 0' in the for loop stops the loop if 'twotoi' overflows.) -*/ -static unsigned computesizes (unsigned nums[], unsigned *pna) { - int i; - unsigned int twotoi; /* 2^i (candidate for optimal size) */ - unsigned int a = 0; /* number of elements smaller than 2^i */ - unsigned int na = 0; /* number of elements to go to array part */ - unsigned int optimal = 0; /* optimal size for array part */ - /* loop while keys can fill more than half of total size */ - for (i = 0, twotoi = 1; - twotoi > 0 && *pna > twotoi / 2; - i++, twotoi *= 2) { - a += nums[i]; - if (a > twotoi/2) { /* more than half elements present? */ - optimal = twotoi; /* optimal size (till now) */ - na = a; /* all elements up to 'optimal' will go to array part */ - } - } - lua_assert((optimal == 0 || optimal / 2 < na) && na <= optimal); - *pna = na; - return optimal; -} - - -static int countint (lua_Integer key, unsigned int *nums) { - unsigned int k = arrayindex(key); - if (k != 0) { /* is 'key' an appropriate array index? */ - nums[luaO_ceillog2(k)]++; /* count as such */ - return 1; - } - else - return 0; -} - - -l_sinline int arraykeyisempty (const Table *t, lua_Integer key) { - int tag = *getArrTag(t, key - 1); - return tagisempty(tag); -} - - -/* -** Count keys in array part of table 't': Fill 'nums[i]' with -** number of keys that will go into corresponding slice and return -** total number of non-nil keys. -*/ -static unsigned numusearray (const Table *t, unsigned *nums) { - int lg; - unsigned int ttlg; /* 2^lg */ - unsigned int ause = 0; /* summation of 'nums' */ - unsigned int i = 1; /* count to traverse all array keys */ - unsigned int asize = limitasasize(t); /* real array size */ - /* traverse each slice */ - for (lg = 0, ttlg = 1; lg <= MAXABITS; lg++, ttlg *= 2) { - unsigned int lc = 0; /* counter */ - unsigned int lim = ttlg; - if (lim > asize) { - lim = asize; /* adjust upper limit */ - if (i > lim) - break; /* no more elements to count */ - } - /* count elements in range (2^(lg - 1), 2^lg] */ - for (; i <= lim; i++) { - if (!arraykeyisempty(t, i)) - lc++; - } - nums[lg] += lc; - ause += lc; - } - return ause; -} - - -static int numusehash (const Table *t, unsigned *nums, unsigned *pna) { - int totaluse = 0; /* total number of elements */ - int ause = 0; /* elements added to 'nums' (can go to array part) */ - int i = sizenode(t); - while (i--) { - Node *n = &t->node[i]; - if (!isempty(gval(n))) { - if (keyisinteger(n)) - ause += countint(keyival(n), nums); - totaluse++; - } - } - *pna += ause; - return totaluse; -} - - -/* -** Convert an "abstract size" (number of slots in an array) to -** "concrete size" (number of bytes in the array). -** If the abstract size is not a multiple of NM, the last cell is -** incomplete, so we don't need to allocate memory for the whole cell. -** 'extra' computes how many values are not needed in that last cell. -** It will be zero when 'size' is a multiple of NM, and from there it -** increases as 'size' decreases, up to (NM - 1). -*/ -static size_t concretesize (unsigned int size) { - unsigned int numcells = (size + NM - 1) / NM; /* (size / NM) rounded up */ - unsigned int extra = NM - 1 - ((size + NM - 1) % NM); - return numcells * sizeof(ArrayCell) - extra * sizeof(Value); -} - - -static ArrayCell *resizearray (lua_State *L , Table *t, - unsigned oldasize, - unsigned newasize) { - size_t oldasizeb = concretesize(oldasize); - size_t newasizeb = concretesize(newasize); - void *a = luaM_reallocvector(L, t->array, oldasizeb, newasizeb, lu_byte); - return cast(ArrayCell*, a); -} - - -/* -** Creates an array for the hash part of a table with the given -** size, or reuses the dummy node if size is zero. -** The computation for size overflow is in two steps: the first -** comparison ensures that the shift in the second one does not -** overflow. -*/ -static void setnodevector (lua_State *L, Table *t, unsigned size) { - if (size == 0) { /* no elements to hash part? */ - t->node = cast(Node *, dummynode); /* use common 'dummynode' */ - t->lsizenode = 0; - setdummy(t); /* signal that it is using dummy node */ - } - else { - int i; - int lsize = luaO_ceillog2(size); - if (lsize > MAXHBITS || (1u << lsize) > MAXHSIZE) - luaG_runerror(L, "table overflow"); - size = twoto(lsize); - if (lsize <= LIMFORLAST) /* no 'lastfree' field? */ - t->node = luaM_newvector(L, size, Node); - else { - size_t bsize = size * sizeof(Node) + sizeof(Limbox); - char *node = luaM_newblock(L, bsize); - t->node = cast(Node *, node + sizeof(Limbox)); - getlastfree(t) = gnode(t, size); /* all positions are free */ - } - t->lsizenode = cast_byte(lsize); - setnodummy(t); - for (i = 0; i < cast_int(size); i++) { - Node *n = gnode(t, i); - gnext(n) = 0; - setnilkey(n); - setempty(gval(n)); - } - } -} - - -/* -** (Re)insert all elements from the hash part of 'ot' into table 't'. -*/ -static void reinsert (lua_State *L, Table *ot, Table *t) { - int j; - int size = sizenode(ot); - for (j = 0; j < size; j++) { - Node *old = gnode(ot, j); - if (!isempty(gval(old))) { - /* doesn't need barrier/invalidate cache, as entry was - already present in the table */ - TValue k; - getnodekey(L, &k, old); - luaH_set(L, t, &k, gval(old)); - } - } -} - - -/* -** Exchange the hash part of 't1' and 't2'. (In 'flags', only the -** dummy bit must be exchanged: The 'isrealasize' is not related -** to the hash part, and the metamethod bits do not change during -** a resize, so the "real" table can keep their values.) -*/ -static void exchangehashpart (Table *t1, Table *t2) { - lu_byte lsizenode = t1->lsizenode; - Node *node = t1->node; - int bitdummy1 = t1->flags & BITDUMMY; - t1->lsizenode = t2->lsizenode; - t1->node = t2->node; - t1->flags = (t1->flags & NOTBITDUMMY) | (t2->flags & BITDUMMY); - t2->lsizenode = lsizenode; - t2->node = node; - t2->flags = (t2->flags & NOTBITDUMMY) | bitdummy1; -} - - -/* -** Re-insert into the new hash part of a table the elements from the -** vanishing slice of the array part. -*/ -static void reinsertOldSlice (lua_State *L, Table *t, unsigned oldasize, - unsigned newasize) { - unsigned i; - t->alimit = newasize; /* pretend array has new size... */ - for (i = newasize; i < oldasize; i++) { /* traverse vanishing slice */ - int tag = *getArrTag(t, i); - if (!tagisempty(tag)) { /* a non-empty entry? */ - TValue aux; - farr2val(t, i + 1, tag, &aux); /* copy entry into 'aux' */ - luaH_setint(L, t, i + 1, &aux); /* re-insert it into the table */ - } - } - t->alimit = oldasize; /* restore current size... */ -} - - -/* -** Clear new slice of the array. -*/ -static void clearNewSlice (Table *t, unsigned oldasize, unsigned newasize) { - for (; oldasize < newasize; oldasize++) - *getArrTag(t, oldasize) = LUA_VEMPTY; -} - - -/* -** Resize table 't' for the new given sizes. Both allocations (for -** the hash part and for the array part) can fail, which creates some -** subtleties. If the first allocation, for the hash part, fails, an -** error is raised and that is it. Otherwise, it copies the elements from -** the shrinking part of the array (if it is shrinking) into the new -** hash. Then it reallocates the array part. If that fails, the table -** is in its original state; the function frees the new hash part and then -** raises the allocation error. Otherwise, it sets the new hash part -** into the table, initializes the new part of the array (if any) with -** nils and reinserts the elements of the old hash back into the new -** parts of the table. -*/ -void luaH_resize (lua_State *L, Table *t, unsigned newasize, - unsigned nhsize) { - Table newt; /* to keep the new hash part */ - unsigned int oldasize = setlimittosize(t); - ArrayCell *newarray; - if (newasize > MAXASIZE) - luaG_runerror(L, "table overflow"); - /* create new hash part with appropriate size into 'newt' */ - newt.flags = 0; - setnodevector(L, &newt, nhsize); - if (newasize < oldasize) { /* will array shrink? */ - /* re-insert into the new hash the elements from vanishing slice */ - exchangehashpart(t, &newt); /* pretend table has new hash */ - reinsertOldSlice(L, t, oldasize, newasize); - exchangehashpart(t, &newt); /* restore old hash (in case of errors) */ - } - /* allocate new array */ - newarray = resizearray(L, t, oldasize, newasize); - if (l_unlikely(newarray == NULL && newasize > 0)) { /* allocation failed? */ - freehash(L, &newt); /* release new hash part */ - luaM_error(L); /* raise error (with array unchanged) */ - } - /* allocation ok; initialize new part of the array */ - exchangehashpart(t, &newt); /* 't' has the new hash ('newt' has the old) */ - t->array = newarray; /* set new array part */ - t->alimit = newasize; - clearNewSlice(t, oldasize, newasize); - /* re-insert elements from old hash part into new parts */ - reinsert(L, &newt, t); /* 'newt' now has the old hash */ - freehash(L, &newt); /* free old hash part */ -} - - -void luaH_resizearray (lua_State *L, Table *t, unsigned int nasize) { - int nsize = allocsizenode(t); - luaH_resize(L, t, nasize, nsize); -} - -/* -** nums[i] = number of keys 'k' where 2^(i - 1) < k <= 2^i -*/ -static void rehash (lua_State *L, Table *t, const TValue *ek) { - unsigned int asize; /* optimal size for array part */ - unsigned int na; /* number of keys in the array part */ - unsigned int nums[MAXABITS + 1]; - int i; - int totaluse; - for (i = 0; i <= MAXABITS; i++) nums[i] = 0; /* reset counts */ - setlimittosize(t); - na = numusearray(t, nums); /* count keys in array part */ - totaluse = na; /* all those keys are integer keys */ - totaluse += numusehash(t, nums, &na); /* count keys in hash part */ - /* count extra key */ - if (ttisinteger(ek)) - na += countint(ivalue(ek), nums); - totaluse++; - /* compute new size for array part */ - asize = computesizes(nums, &na); - /* resize the table to new computed sizes */ - luaH_resize(L, t, asize, totaluse - na); -} - - - -/* -** }============================================================= -*/ - - -Table *luaH_new (lua_State *L) { - GCObject *o = luaC_newobj(L, LUA_VTABLE, sizeof(Table)); - Table *t = gco2t(o); - t->metatable = NULL; - t->flags = cast_byte(maskflags); /* table has no metamethod fields */ - t->array = NULL; - t->alimit = 0; - setnodevector(L, t, 0); - return t; -} - - -/* -** Frees a table. The assert ensures the correctness of 'concretesize', -** checking its result against the address of the last element in the -** array part of the table, computed abstractly. -*/ -void luaH_free (lua_State *L, Table *t) { - unsigned int realsize = luaH_realasize(t); - size_t sizeb = concretesize(realsize); - lua_assert((sizeb == 0 && realsize == 0) || - cast_charp(t->array) + sizeb - sizeof(Value) == - cast_charp(getArrVal(t, realsize - 1))); - freehash(L, t); - luaM_freemem(L, t->array, sizeb); - luaM_free(L, t); -} - - -static Node *getfreepos (Table *t) { - if (haslastfree(t)) { /* does it have 'lastfree' information? */ - /* look for a spot before 'lastfree', updating 'lastfree' */ - while (getlastfree(t) > t->node) { - Node *free = --getlastfree(t); - if (keyisnil(free)) - return free; - } - } - else { /* no 'lastfree' information */ - if (!isdummy(t)) { - int i = sizenode(t); - while (i--) { /* do a linear search */ - Node *free = gnode(t, i); - if (keyisnil(free)) - return free; - } - } - } - return NULL; /* could not find a free place */ -} - - - -/* -** Inserts a new key into a hash table; first, check whether key's main -** position is free. If not, check whether colliding node is in its main -** position or not: if it is not, move colliding node to an empty place -** and put new key in its main position; otherwise (colliding node is in -** its main position), new key goes to an empty position. -*/ -static void luaH_newkey (lua_State *L, Table *t, const TValue *key, - TValue *value) { - Node *mp; - TValue aux; - if (l_unlikely(ttisnil(key))) - luaG_runerror(L, "table index is nil"); - else if (ttisfloat(key)) { - lua_Number f = fltvalue(key); - lua_Integer k; - if (luaV_flttointeger(f, &k, F2Ieq)) { /* does key fit in an integer? */ - setivalue(&aux, k); - key = &aux; /* insert it as an integer */ - } - else if (l_unlikely(luai_numisnan(f))) - luaG_runerror(L, "table index is NaN"); - } - if (ttisnil(value)) - return; /* do not insert nil values */ - mp = mainpositionTV(t, key); - if (!isempty(gval(mp)) || isdummy(t)) { /* main position is taken? */ - Node *othern; - Node *f = getfreepos(t); /* get a free place */ - if (f == NULL) { /* cannot find a free place? */ - rehash(L, t, key); /* grow table */ - /* whatever called 'newkey' takes care of TM cache */ - luaH_set(L, t, key, value); /* insert key into grown table */ - return; - } - lua_assert(!isdummy(t)); - othern = mainpositionfromnode(t, mp); - if (othern != mp) { /* is colliding node out of its main position? */ - /* yes; move colliding node into free position */ - while (othern + gnext(othern) != mp) /* find previous */ - othern += gnext(othern); - gnext(othern) = cast_int(f - othern); /* rechain to point to 'f' */ - *f = *mp; /* copy colliding node into free pos. (mp->next also goes) */ - if (gnext(mp) != 0) { - gnext(f) += cast_int(mp - f); /* correct 'next' */ - gnext(mp) = 0; /* now 'mp' is free */ - } - setempty(gval(mp)); - } - else { /* colliding node is in its own main position */ - /* new node will go into free position */ - if (gnext(mp) != 0) - gnext(f) = cast_int((mp + gnext(mp)) - f); /* chain new position */ - else lua_assert(gnext(f) == 0); - gnext(mp) = cast_int(f - mp); - mp = f; - } - } - setnodekey(L, mp, key); - luaC_barrierback(L, obj2gco(t), key); - lua_assert(isempty(gval(mp))); - setobj2t(L, gval(mp), value); -} - - -static const TValue *getintfromhash (Table *t, lua_Integer key) { - Node *n = hashint(t, key); - lua_assert(l_castS2U(key) - 1u >= luaH_realasize(t)); - for (;;) { /* check whether 'key' is somewhere in the chain */ - if (keyisinteger(n) && keyival(n) == key) - return gval(n); /* that's it */ - else { - int nx = gnext(n); - if (nx == 0) break; - n += nx; - } - } - return &absentkey; -} - - -static int hashkeyisempty (Table *t, lua_Integer key) { - const TValue *val = getintfromhash(t, key); - return isempty(val); -} - - -static int finishnodeget (const TValue *val, TValue *res) { - if (!ttisnil(val)) { - setobj(((lua_State*)NULL), res, val); - } - return ttypetag(val); -} - - -int luaH_getint (Table *t, lua_Integer key, TValue *res) { - if (keyinarray(t, key)) { - int tag = *getArrTag(t, key - 1); - if (!tagisempty(tag)) - farr2val(t, key, tag, res); - return tag; - } - else - return finishnodeget(getintfromhash(t, key), res); -} - - -/* -** search function for short strings -*/ -const TValue *luaH_Hgetshortstr (Table *t, TString *key) { - Node *n = hashstr(t, key); - lua_assert(key->tt == LUA_VSHRSTR); - for (;;) { /* check whether 'key' is somewhere in the chain */ - if (keyisshrstr(n) && eqshrstr(keystrval(n), key)) - return gval(n); /* that's it */ - else { - int nx = gnext(n); - if (nx == 0) - return &absentkey; /* not found */ - n += nx; - } - } -} - - -int luaH_getshortstr (Table *t, TString *key, TValue *res) { - return finishnodeget(luaH_Hgetshortstr(t, key), res); -} - - -static const TValue *Hgetstr (Table *t, TString *key) { - if (key->tt == LUA_VSHRSTR) - return luaH_Hgetshortstr(t, key); - else { /* for long strings, use generic case */ - TValue ko; - setsvalue(cast(lua_State *, NULL), &ko, key); - return getgeneric(t, &ko, 0); - } -} - - -int luaH_getstr (Table *t, TString *key, TValue *res) { - return finishnodeget(Hgetstr(t, key), res); -} - - -TString *luaH_getstrkey (Table *t, TString *key) { - const TValue *o = Hgetstr(t, key); - if (!isabstkey(o)) /* string already present? */ - return keystrval(nodefromval(o)); /* get saved copy */ - else - return NULL; -} - - -/* -** main search function -*/ -int luaH_get (Table *t, const TValue *key, TValue *res) { - const TValue *slot; - switch (ttypetag(key)) { - case LUA_VSHRSTR: - slot = luaH_Hgetshortstr(t, tsvalue(key)); - break; - case LUA_VNUMINT: - return luaH_getint(t, ivalue(key), res); - case LUA_VNIL: - slot = &absentkey; - break; - case LUA_VNUMFLT: { - lua_Integer k; - if (luaV_flttointeger(fltvalue(key), &k, F2Ieq)) /* integral index? */ - return luaH_getint(t, k, res); /* use specialized version */ - /* else... */ - } /* FALLTHROUGH */ - default: - slot = getgeneric(t, key, 0); - break; - } - return finishnodeget(slot, res); -} - - -static int finishnodeset (Table *t, const TValue *slot, TValue *val) { - if (!ttisnil(slot)) { - setobj(((lua_State*)NULL), cast(TValue*, slot), val); - return HOK; /* success */ - } - else if (isabstkey(slot)) - return HNOTFOUND; /* no slot with that key */ - else /* return node encoded */ - return cast_int((cast(Node*, slot) - t->node)) + HFIRSTNODE; -} - - -static int rawfinishnodeset (const TValue *slot, TValue *val) { - if (isabstkey(slot)) - return 0; /* no slot with that key */ - else { - setobj(((lua_State*)NULL), cast(TValue*, slot), val); - return 1; /* success */ - } -} - - -int luaH_psetint (Table *t, lua_Integer key, TValue *val) { - if (keyinarray(t, key)) { - lu_byte *tag = getArrTag(t, key - 1); - if (!tagisempty(*tag) || checknoTM(t->metatable, TM_NEWINDEX)) { - fval2arr(t, key, tag, val); - return HOK; /* success */ - } - else - return ~cast_int(key); /* empty slot in the array part */ - } - else - return finishnodeset(t, getintfromhash(t, key), val); -} - - -int luaH_psetshortstr (Table *t, TString *key, TValue *val) { - return finishnodeset(t, luaH_Hgetshortstr(t, key), val); -} - - -int luaH_psetstr (Table *t, TString *key, TValue *val) { - return finishnodeset(t, Hgetstr(t, key), val); -} - - -int luaH_pset (Table *t, const TValue *key, TValue *val) { - switch (ttypetag(key)) { - case LUA_VSHRSTR: return luaH_psetshortstr(t, tsvalue(key), val); - case LUA_VNUMINT: return luaH_psetint(t, ivalue(key), val); - case LUA_VNIL: return HNOTFOUND; - case LUA_VNUMFLT: { - lua_Integer k; - if (luaV_flttointeger(fltvalue(key), &k, F2Ieq)) /* integral index? */ - return luaH_psetint(t, k, val); /* use specialized version */ - /* else... */ - } /* FALLTHROUGH */ - default: - return finishnodeset(t, getgeneric(t, key, 0), val); - } -} - -/* -** Finish a raw "set table" operation, where 'slot' is where the value -** should have been (the result of a previous "get table"). -** Beware: when using this function you probably need to check a GC -** barrier and invalidate the TM cache. -*/ - - -void luaH_finishset (lua_State *L, Table *t, const TValue *key, - TValue *value, int hres) { - lua_assert(hres != HOK); - if (hres == HNOTFOUND) { - luaH_newkey(L, t, key, value); - } - else if (hres > 0) { /* regular Node? */ - setobj2t(L, gval(gnode(t, hres - HFIRSTNODE)), value); - } - else { /* array entry */ - hres = ~hres; /* real index */ - obj2arr(t, hres, value); - } -} - - -/* -** beware: when using this function you probably need to check a GC -** barrier and invalidate the TM cache. -*/ -void luaH_set (lua_State *L, Table *t, const TValue *key, TValue *value) { - int hres = luaH_pset(t, key, value); - if (hres != HOK) - luaH_finishset(L, t, key, value, hres); -} - - -/* -** Ditto for a GC barrier. (No need to invalidate the TM cache, as -** integers cannot be keys to metamethods.) -*/ -void luaH_setint (lua_State *L, Table *t, lua_Integer key, TValue *value) { - if (keyinarray(t, key)) - obj2arr(t, key, value); - else { - int ok = rawfinishnodeset(getintfromhash(t, key), value); - if (!ok) { - TValue k; - setivalue(&k, key); - luaH_newkey(L, t, &k, value); - } - } -} - - -/* -** Try to find a boundary in the hash part of table 't'. From the -** caller, we know that 'j' is zero or present and that 'j + 1' is -** present. We want to find a larger key that is absent from the -** table, so that we can do a binary search between the two keys to -** find a boundary. We keep doubling 'j' until we get an absent index. -** If the doubling would overflow, we try LUA_MAXINTEGER. If it is -** absent, we are ready for the binary search. ('j', being max integer, -** is larger or equal to 'i', but it cannot be equal because it is -** absent while 'i' is present; so 'j > i'.) Otherwise, 'j' is a -** boundary. ('j + 1' cannot be a present integer key because it is -** not a valid integer in Lua.) -*/ -static lua_Unsigned hash_search (Table *t, lua_Unsigned j) { - lua_Unsigned i; - if (j == 0) j++; /* the caller ensures 'j + 1' is present */ - do { - i = j; /* 'i' is a present index */ - if (j <= l_castS2U(LUA_MAXINTEGER) / 2) - j *= 2; - else { - j = LUA_MAXINTEGER; - if (hashkeyisempty(t, j)) /* t[j] not present? */ - break; /* 'j' now is an absent index */ - else /* weird case */ - return j; /* well, max integer is a boundary... */ - } - } while (!hashkeyisempty(t, j)); /* repeat until an absent t[j] */ - /* i < j && t[i] present && t[j] absent */ - while (j - i > 1u) { /* do a binary search between them */ - lua_Unsigned m = (i + j) / 2; - if (hashkeyisempty(t, m)) j = m; - else i = m; - } - return i; -} - - -static unsigned int binsearch (Table *array, unsigned int i, unsigned int j) { - while (j - i > 1u) { /* binary search */ - unsigned int m = (i + j) / 2; - if (arraykeyisempty(array, m)) j = m; - else i = m; - } - return i; -} - - -/* -** Try to find a boundary in table 't'. (A 'boundary' is an integer index -** such that t[i] is present and t[i+1] is absent, or 0 if t[1] is absent -** and 'maxinteger' if t[maxinteger] is present.) -** (In the next explanation, we use Lua indices, that is, with base 1. -** The code itself uses base 0 when indexing the array part of the table.) -** The code starts with 'limit = t->alimit', a position in the array -** part that may be a boundary. -** -** (1) If 't[limit]' is empty, there must be a boundary before it. -** As a common case (e.g., after 't[#t]=nil'), check whether 'limit-1' -** is present. If so, it is a boundary. Otherwise, do a binary search -** between 0 and limit to find a boundary. In both cases, try to -** use this boundary as the new 'alimit', as a hint for the next call. -** -** (2) If 't[limit]' is not empty and the array has more elements -** after 'limit', try to find a boundary there. Again, try first -** the special case (which should be quite frequent) where 'limit+1' -** is empty, so that 'limit' is a boundary. Otherwise, check the -** last element of the array part. If it is empty, there must be a -** boundary between the old limit (present) and the last element -** (absent), which is found with a binary search. (This boundary always -** can be a new limit.) -** -** (3) The last case is when there are no elements in the array part -** (limit == 0) or its last element (the new limit) is present. -** In this case, must check the hash part. If there is no hash part -** or 'limit+1' is absent, 'limit' is a boundary. Otherwise, call -** 'hash_search' to find a boundary in the hash part of the table. -** (In those cases, the boundary is not inside the array part, and -** therefore cannot be used as a new limit.) -*/ -lua_Unsigned luaH_getn (Table *t) { - unsigned int limit = t->alimit; - if (limit > 0 && arraykeyisempty(t, limit)) { /* (1)? */ - /* there must be a boundary before 'limit' */ - if (limit >= 2 && !arraykeyisempty(t, limit - 1)) { - /* 'limit - 1' is a boundary; can it be a new limit? */ - if (ispow2realasize(t) && !ispow2(limit - 1)) { - t->alimit = limit - 1; - setnorealasize(t); /* now 'alimit' is not the real size */ - } - return limit - 1; - } - else { /* must search for a boundary in [0, limit] */ - unsigned int boundary = binsearch(t, 0, limit); - /* can this boundary represent the real size of the array? */ - if (ispow2realasize(t) && boundary > luaH_realasize(t) / 2) { - t->alimit = boundary; /* use it as the new limit */ - setnorealasize(t); - } - return boundary; - } - } - /* 'limit' is zero or present in table */ - if (!limitequalsasize(t)) { /* (2)? */ - /* 'limit' > 0 and array has more elements after 'limit' */ - if (arraykeyisempty(t, limit + 1)) /* 'limit + 1' is empty? */ - return limit; /* this is the boundary */ - /* else, try last element in the array */ - limit = luaH_realasize(t); - if (arraykeyisempty(t, limit)) { /* empty? */ - /* there must be a boundary in the array after old limit, - and it must be a valid new limit */ - unsigned int boundary = binsearch(t, t->alimit, limit); - t->alimit = boundary; - return boundary; - } - /* else, new limit is present in the table; check the hash part */ - } - /* (3) 'limit' is the last element and either is zero or present in table */ - lua_assert(limit == luaH_realasize(t) && - (limit == 0 || !arraykeyisempty(t, limit))); - if (isdummy(t) || hashkeyisempty(t, cast(lua_Integer, limit + 1))) - return limit; /* 'limit + 1' is absent */ - else /* 'limit + 1' is also present */ - return hash_search(t, limit); -} - - - -#if defined(LUA_DEBUG) - -/* export these functions for the test library */ - -Node *luaH_mainposition (const Table *t, const TValue *key) { - return mainpositionTV(t, key); -} - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/ltable.h b/build/c/dependencies/luaCEmbed/dependencies/lua/ltable.h deleted file mode 100644 index 4734bd5..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/ltable.h +++ /dev/null @@ -1,168 +0,0 @@ -/* -** $Id: ltable.h $ -** Lua tables (hash) -** See Copyright Notice in lua.h -*/ - -#ifndef ltable_h -#define ltable_h - -#include "lobject.h" - - -#define gnode(t,i) (&(t)->node[i]) -#define gval(n) (&(n)->i_val) -#define gnext(n) ((n)->u.next) - - -/* -** Clear all bits of fast-access metamethods, which means that the table -** may have any of these metamethods. (First access that fails after the -** clearing will set the bit again.) -*/ -#define invalidateTMcache(t) ((t)->flags &= ~maskflags) - - -/* -** Bit BITDUMMY set in 'flags' means the table is using the dummy node -** for its hash part. -*/ - -#define BITDUMMY (1 << 6) -#define NOTBITDUMMY cast_byte(~BITDUMMY) -#define isdummy(t) ((t)->flags & BITDUMMY) - -#define setnodummy(t) ((t)->flags &= NOTBITDUMMY) -#define setdummy(t) ((t)->flags |= BITDUMMY) - - - -/* allocated size for hash nodes */ -#define allocsizenode(t) (isdummy(t) ? 0 : sizenode(t)) - - -/* returns the Node, given the value of a table entry */ -#define nodefromval(v) cast(Node *, (v)) - - - -#define luaH_fastgeti(t,k,res,tag) \ - { Table *h = t; lua_Unsigned u = l_castS2U(k); \ - if ((u - 1u < h->alimit)) { \ - tag = *getArrTag(h,(u)-1u); \ - if (!tagisempty(tag)) { farr2val(h, u, tag, res); }} \ - else { tag = luaH_getint(h, u, res); }} - - -#define luaH_fastseti(t,k,val,hres) \ - { Table *h = t; lua_Unsigned u = l_castS2U(k); \ - if ((u - 1u < h->alimit)) { \ - lu_byte *tag = getArrTag(h,(u)-1u); \ - if (tagisempty(*tag)) hres = ~cast_int(u); \ - else { fval2arr(h, u, tag, val); hres = HOK; }} \ - else { hres = luaH_psetint(h, u, val); }} - - -/* results from pset */ -#define HOK 0 -#define HNOTFOUND 1 -#define HNOTATABLE 2 -#define HFIRSTNODE 3 - -/* -** 'luaH_get*' operations set 'res', unless the value is absent, and -** return the tag of the result, -** The 'luaH_pset*' (pre-set) operations set the given value and return -** HOK, unless the original value is absent. In that case, if the key -** is really absent, they return HNOTFOUND. Otherwise, if there is a -** slot with that key but with no value, 'luaH_pset*' return an encoding -** of where the key is (usually called 'hres'). (pset cannot set that -** value because there might be a metamethod.) If the slot is in the -** hash part, the encoding is (HFIRSTNODE + hash index); if the slot is -** in the array part, the encoding is (~array index), a negative value. -** The value HNOTATABLE is used by the fast macros to signal that the -** value being indexed is not a table. -*/ - - -/* -** The array part of a table is represented by an array of cells. -** Each cell is composed of NM tags followed by NM values, so that -** no space is wasted in padding. The last cell may be incomplete, -** that is, it may have fewer than NM values. -*/ -#define NM cast_uint(sizeof(Value)) - -struct ArrayCell { - lu_byte tag[NM]; - Value value[NM]; -}; - - -/* Computes the address of the tag for the abstract index 'k' */ -#define getArrTag(t,k) (&(t)->array[(k)/NM].tag[(k)%NM]) - -/* Computes the address of the value for the abstract index 'k' */ -#define getArrVal(t,k) (&(t)->array[(k)/NM].value[(k)%NM]) - - -/* -** Move TValues to/from arrays, using Lua indices -*/ -#define arr2obj(h,k,val) \ - ((val)->tt_ = *getArrTag(h,(k)-1u), (val)->value_ = *getArrVal(h,(k)-1u)) - -#define obj2arr(h,k,val) \ - (*getArrTag(h,(k)-1u) = (val)->tt_, *getArrVal(h,(k)-1u) = (val)->value_) - - -/* -** Often, we need to check the tag of a value before moving it. These -** macros also move TValues to/from arrays, but receive the precomputed -** tag value or address as an extra argument. -*/ -#define farr2val(h,k,tag,res) \ - ((res)->tt_ = tag, (res)->value_ = *getArrVal(h,(k)-1u)) - -#define fval2arr(h,k,tag,val) \ - (*tag = (val)->tt_, *getArrVal(h,(k)-1u) = (val)->value_) - - -LUAI_FUNC int luaH_get (Table *t, const TValue *key, TValue *res); -LUAI_FUNC int luaH_getshortstr (Table *t, TString *key, TValue *res); -LUAI_FUNC int luaH_getstr (Table *t, TString *key, TValue *res); -LUAI_FUNC int luaH_getint (Table *t, lua_Integer key, TValue *res); - -/* Special get for metamethods */ -LUAI_FUNC const TValue *luaH_Hgetshortstr (Table *t, TString *key); - -LUAI_FUNC TString *luaH_getstrkey (Table *t, TString *key); - -LUAI_FUNC int luaH_psetint (Table *t, lua_Integer key, TValue *val); -LUAI_FUNC int luaH_psetshortstr (Table *t, TString *key, TValue *val); -LUAI_FUNC int luaH_psetstr (Table *t, TString *key, TValue *val); -LUAI_FUNC int luaH_pset (Table *t, const TValue *key, TValue *val); - -LUAI_FUNC void luaH_setint (lua_State *L, Table *t, lua_Integer key, - TValue *value); -LUAI_FUNC void luaH_set (lua_State *L, Table *t, const TValue *key, - TValue *value); - -LUAI_FUNC void luaH_finishset (lua_State *L, Table *t, const TValue *key, - TValue *value, int hres); -LUAI_FUNC Table *luaH_new (lua_State *L); -LUAI_FUNC void luaH_resize (lua_State *L, Table *t, unsigned nasize, - unsigned nhsize); -LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, unsigned nasize); -LUAI_FUNC void luaH_free (lua_State *L, Table *t); -LUAI_FUNC int luaH_next (lua_State *L, Table *t, StkId key); -LUAI_FUNC lua_Unsigned luaH_getn (Table *t); -LUAI_FUNC unsigned luaH_realasize (const Table *t); - - -#if defined(LUA_DEBUG) -LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key); -#endif - - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/ltablib.c b/build/c/dependencies/luaCEmbed/dependencies/lua/ltablib.c deleted file mode 100644 index a402dae..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/ltablib.c +++ /dev/null @@ -1,417 +0,0 @@ -/* -** $Id: ltablib.c $ -** Library for Table Manipulation -** See Copyright Notice in lua.h -*/ - -#define ltablib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** Operations that an object must define to mimic a table -** (some functions only need some of them) -*/ -#define TAB_R 1 /* read */ -#define TAB_W 2 /* write */ -#define TAB_L 4 /* length */ -#define TAB_RW (TAB_R | TAB_W) /* read/write */ - - -#define aux_getn(L,n,w) (checktab(L, n, (w) | TAB_L), luaL_len(L, n)) - - -static int checkfield (lua_State *L, const char *key, int n) { - lua_pushstring(L, key); - return (lua_rawget(L, -n) != LUA_TNIL); -} - - -/* -** Check that 'arg' either is a table or can behave like one (that is, -** has a metatable with the required metamethods) -*/ -static void checktab (lua_State *L, int arg, int what) { - if (lua_type(L, arg) != LUA_TTABLE) { /* is it not a table? */ - int n = 1; /* number of elements to pop */ - if (lua_getmetatable(L, arg) && /* must have metatable */ - (!(what & TAB_R) || checkfield(L, "__index", ++n)) && - (!(what & TAB_W) || checkfield(L, "__newindex", ++n)) && - (!(what & TAB_L) || checkfield(L, "__len", ++n))) { - lua_pop(L, n); /* pop metatable and tested metamethods */ - } - else - luaL_checktype(L, arg, LUA_TTABLE); /* force an error */ - } -} - - -static int tcreate (lua_State *L) { - lua_Unsigned sizeseq = (lua_Unsigned)luaL_checkinteger(L, 1); - lua_Unsigned sizerest = (lua_Unsigned)luaL_optinteger(L, 2, 0); - luaL_argcheck(L, sizeseq <= UINT_MAX, 1, "out of range"); - luaL_argcheck(L, sizerest <= UINT_MAX, 2, "out of range"); - lua_createtable(L, (unsigned)sizeseq, (unsigned)sizerest); - return 1; -} - - -static int tinsert (lua_State *L) { - lua_Integer pos; /* where to insert new element */ - lua_Integer e = aux_getn(L, 1, TAB_RW); - e = luaL_intop(+, e, 1); /* first empty element */ - switch (lua_gettop(L)) { - case 2: { /* called with only 2 arguments */ - pos = e; /* insert new element at the end */ - break; - } - case 3: { - lua_Integer i; - pos = luaL_checkinteger(L, 2); /* 2nd argument is the position */ - /* check whether 'pos' is in [1, e] */ - luaL_argcheck(L, (lua_Unsigned)pos - 1u < (lua_Unsigned)e, 2, - "position out of bounds"); - for (i = e; i > pos; i--) { /* move up elements */ - lua_geti(L, 1, i - 1); - lua_seti(L, 1, i); /* t[i] = t[i - 1] */ - } - break; - } - default: { - return luaL_error(L, "wrong number of arguments to 'insert'"); - } - } - lua_seti(L, 1, pos); /* t[pos] = v */ - return 0; -} - - -static int tremove (lua_State *L) { - lua_Integer size = aux_getn(L, 1, TAB_RW); - lua_Integer pos = luaL_optinteger(L, 2, size); - if (pos != size) /* validate 'pos' if given */ - /* check whether 'pos' is in [1, size + 1] */ - luaL_argcheck(L, (lua_Unsigned)pos - 1u <= (lua_Unsigned)size, 2, - "position out of bounds"); - lua_geti(L, 1, pos); /* result = t[pos] */ - for ( ; pos < size; pos++) { - lua_geti(L, 1, pos + 1); - lua_seti(L, 1, pos); /* t[pos] = t[pos + 1] */ - } - lua_pushnil(L); - lua_seti(L, 1, pos); /* remove entry t[pos] */ - return 1; -} - - -/* -** Copy elements (1[f], ..., 1[e]) into (tt[t], tt[t+1], ...). Whenever -** possible, copy in increasing order, which is better for rehashing. -** "possible" means destination after original range, or smaller -** than origin, or copying to another table. -*/ -static int tmove (lua_State *L) { - lua_Integer f = luaL_checkinteger(L, 2); - lua_Integer e = luaL_checkinteger(L, 3); - lua_Integer t = luaL_checkinteger(L, 4); - int tt = !lua_isnoneornil(L, 5) ? 5 : 1; /* destination table */ - checktab(L, 1, TAB_R); - checktab(L, tt, TAB_W); - if (e >= f) { /* otherwise, nothing to move */ - lua_Integer n, i; - luaL_argcheck(L, f > 0 || e < LUA_MAXINTEGER + f, 3, - "too many elements to move"); - n = e - f + 1; /* number of elements to move */ - luaL_argcheck(L, t <= LUA_MAXINTEGER - n + 1, 4, - "destination wrap around"); - if (t > e || t <= f || (tt != 1 && !lua_compare(L, 1, tt, LUA_OPEQ))) { - for (i = 0; i < n; i++) { - lua_geti(L, 1, f + i); - lua_seti(L, tt, t + i); - } - } - else { - for (i = n - 1; i >= 0; i--) { - lua_geti(L, 1, f + i); - lua_seti(L, tt, t + i); - } - } - } - lua_pushvalue(L, tt); /* return destination table */ - return 1; -} - - -static void addfield (lua_State *L, luaL_Buffer *b, lua_Integer i) { - lua_geti(L, 1, i); - if (l_unlikely(!lua_isstring(L, -1))) - luaL_error(L, "invalid value (%s) at index %I in table for 'concat'", - luaL_typename(L, -1), (LUAI_UACINT)i); - luaL_addvalue(b); -} - - -static int tconcat (lua_State *L) { - luaL_Buffer b; - lua_Integer last = aux_getn(L, 1, TAB_R); - size_t lsep; - const char *sep = luaL_optlstring(L, 2, "", &lsep); - lua_Integer i = luaL_optinteger(L, 3, 1); - last = luaL_optinteger(L, 4, last); - luaL_buffinit(L, &b); - for (; i < last; i++) { - addfield(L, &b, i); - luaL_addlstring(&b, sep, lsep); - } - if (i == last) /* add last value (if interval was not empty) */ - addfield(L, &b, i); - luaL_pushresult(&b); - return 1; -} - - -/* -** {====================================================== -** Pack/unpack -** ======================================================= -*/ - -static int tpack (lua_State *L) { - int i; - int n = lua_gettop(L); /* number of elements to pack */ - lua_createtable(L, n, 1); /* create result table */ - lua_insert(L, 1); /* put it at index 1 */ - for (i = n; i >= 1; i--) /* assign elements */ - lua_seti(L, 1, i); - lua_pushinteger(L, n); - lua_setfield(L, 1, "n"); /* t.n = number of elements */ - return 1; /* return table */ -} - - -static int tunpack (lua_State *L) { - lua_Unsigned n; - lua_Integer i = luaL_optinteger(L, 2, 1); - lua_Integer e = luaL_opt(L, luaL_checkinteger, 3, luaL_len(L, 1)); - if (i > e) return 0; /* empty range */ - n = (lua_Unsigned)e - i; /* number of elements minus 1 (avoid overflows) */ - if (l_unlikely(n >= (unsigned int)INT_MAX || - !lua_checkstack(L, (int)(++n)))) - return luaL_error(L, "too many results to unpack"); - for (; i < e; i++) { /* push arg[i..e - 1] (to avoid overflows) */ - lua_geti(L, 1, i); - } - lua_geti(L, 1, e); /* push last element */ - return (int)n; -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Quicksort -** (based on 'Algorithms in MODULA-3', Robert Sedgewick; -** Addison-Wesley, 1993.) -** ======================================================= -*/ - - -/* type for array indices */ -typedef unsigned int IdxT; - - -/* -** Produce a "random" 'unsigned int' to randomize pivot choice. This -** macro is used only when 'sort' detects a big imbalance in the result -** of a partition. (If you don't want/need this "randomness", ~0 is a -** good choice.) -*/ -#if !defined(l_randomizePivot) -#define l_randomizePivot(L) luaL_makeseed(L) -#endif /* } */ - - -/* arrays larger than 'RANLIMIT' may use randomized pivots */ -#define RANLIMIT 100u - - -static void set2 (lua_State *L, IdxT i, IdxT j) { - lua_seti(L, 1, i); - lua_seti(L, 1, j); -} - - -/* -** Return true iff value at stack index 'a' is less than the value at -** index 'b' (according to the order of the sort). -*/ -static int sort_comp (lua_State *L, int a, int b) { - if (lua_isnil(L, 2)) /* no function? */ - return lua_compare(L, a, b, LUA_OPLT); /* a < b */ - else { /* function */ - int res; - lua_pushvalue(L, 2); /* push function */ - lua_pushvalue(L, a-1); /* -1 to compensate function */ - lua_pushvalue(L, b-2); /* -2 to compensate function and 'a' */ - lua_call(L, 2, 1); /* call function */ - res = lua_toboolean(L, -1); /* get result */ - lua_pop(L, 1); /* pop result */ - return res; - } -} - - -/* -** Does the partition: Pivot P is at the top of the stack. -** precondition: a[lo] <= P == a[up-1] <= a[up], -** so it only needs to do the partition from lo + 1 to up - 2. -** Pos-condition: a[lo .. i - 1] <= a[i] == P <= a[i + 1 .. up] -** returns 'i'. -*/ -static IdxT partition (lua_State *L, IdxT lo, IdxT up) { - IdxT i = lo; /* will be incremented before first use */ - IdxT j = up - 1; /* will be decremented before first use */ - /* loop invariant: a[lo .. i] <= P <= a[j .. up] */ - for (;;) { - /* next loop: repeat ++i while a[i] < P */ - while ((void)lua_geti(L, 1, ++i), sort_comp(L, -1, -2)) { - if (l_unlikely(i == up - 1)) /* a[i] < P but a[up - 1] == P ?? */ - luaL_error(L, "invalid order function for sorting"); - lua_pop(L, 1); /* remove a[i] */ - } - /* after the loop, a[i] >= P and a[lo .. i - 1] < P */ - /* next loop: repeat --j while P < a[j] */ - while ((void)lua_geti(L, 1, --j), sort_comp(L, -3, -1)) { - if (l_unlikely(j < i)) /* j < i but a[j] > P ?? */ - luaL_error(L, "invalid order function for sorting"); - lua_pop(L, 1); /* remove a[j] */ - } - /* after the loop, a[j] <= P and a[j + 1 .. up] >= P */ - if (j < i) { /* no elements out of place? */ - /* a[lo .. i - 1] <= P <= a[j + 1 .. i .. up] */ - lua_pop(L, 1); /* pop a[j] */ - /* swap pivot (a[up - 1]) with a[i] to satisfy pos-condition */ - set2(L, up - 1, i); - return i; - } - /* otherwise, swap a[i] - a[j] to restore invariant and repeat */ - set2(L, i, j); - } -} - - -/* -** Choose an element in the middle (2nd-3th quarters) of [lo,up] -** "randomized" by 'rnd' -*/ -static IdxT choosePivot (IdxT lo, IdxT up, unsigned int rnd) { - IdxT r4 = (up - lo) / 4; /* range/4 */ - IdxT p = (rnd ^ lo ^ up) % (r4 * 2) + (lo + r4); - lua_assert(lo + r4 <= p && p <= up - r4); - return p; -} - - -/* -** Quicksort algorithm (recursive function) -*/ -static void auxsort (lua_State *L, IdxT lo, IdxT up, unsigned rnd) { - while (lo < up) { /* loop for tail recursion */ - IdxT p; /* Pivot index */ - IdxT n; /* to be used later */ - /* sort elements 'lo', 'p', and 'up' */ - lua_geti(L, 1, lo); - lua_geti(L, 1, up); - if (sort_comp(L, -1, -2)) /* a[up] < a[lo]? */ - set2(L, lo, up); /* swap a[lo] - a[up] */ - else - lua_pop(L, 2); /* remove both values */ - if (up - lo == 1) /* only 2 elements? */ - return; /* already sorted */ - if (up - lo < RANLIMIT || rnd == 0) /* small interval or no randomize? */ - p = (lo + up)/2; /* middle element is a good pivot */ - else /* for larger intervals, it is worth a random pivot */ - p = choosePivot(lo, up, rnd); - lua_geti(L, 1, p); - lua_geti(L, 1, lo); - if (sort_comp(L, -2, -1)) /* a[p] < a[lo]? */ - set2(L, p, lo); /* swap a[p] - a[lo] */ - else { - lua_pop(L, 1); /* remove a[lo] */ - lua_geti(L, 1, up); - if (sort_comp(L, -1, -2)) /* a[up] < a[p]? */ - set2(L, p, up); /* swap a[up] - a[p] */ - else - lua_pop(L, 2); - } - if (up - lo == 2) /* only 3 elements? */ - return; /* already sorted */ - lua_geti(L, 1, p); /* get middle element (Pivot) */ - lua_pushvalue(L, -1); /* push Pivot */ - lua_geti(L, 1, up - 1); /* push a[up - 1] */ - set2(L, p, up - 1); /* swap Pivot (a[p]) with a[up - 1] */ - p = partition(L, lo, up); - /* a[lo .. p - 1] <= a[p] == P <= a[p + 1 .. up] */ - if (p - lo < up - p) { /* lower interval is smaller? */ - auxsort(L, lo, p - 1, rnd); /* call recursively for lower interval */ - n = p - lo; /* size of smaller interval */ - lo = p + 1; /* tail call for [p + 1 .. up] (upper interval) */ - } - else { - auxsort(L, p + 1, up, rnd); /* call recursively for upper interval */ - n = up - p; /* size of smaller interval */ - up = p - 1; /* tail call for [lo .. p - 1] (lower interval) */ - } - if ((up - lo) / 128 > n) /* partition too imbalanced? */ - rnd = l_randomizePivot(L); /* try a new randomization */ - } /* tail call auxsort(L, lo, up, rnd) */ -} - - -static int sort (lua_State *L) { - lua_Integer n = aux_getn(L, 1, TAB_RW); - if (n > 1) { /* non-trivial interval? */ - luaL_argcheck(L, n < INT_MAX, 1, "array too big"); - if (!lua_isnoneornil(L, 2)) /* is there a 2nd argument? */ - luaL_checktype(L, 2, LUA_TFUNCTION); /* must be a function */ - lua_settop(L, 2); /* make sure there are two arguments */ - auxsort(L, 1, (IdxT)n, 0); - } - return 0; -} - -/* }====================================================== */ - - -static const luaL_Reg tab_funcs[] = { - {"concat", tconcat}, - {"create", tcreate}, - {"insert", tinsert}, - {"pack", tpack}, - {"unpack", tunpack}, - {"remove", tremove}, - {"move", tmove}, - {"sort", sort}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_table (lua_State *L) { - luaL_newlib(L, tab_funcs); - return 1; -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/ltests.c b/build/c/dependencies/luaCEmbed/dependencies/lua/ltests.c deleted file mode 100644 index 4780673..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/ltests.c +++ /dev/null @@ -1,2067 +0,0 @@ -/* -** $Id: ltests.c $ -** Internal Module for Debugging of the Lua Implementation -** See Copyright Notice in lua.h -*/ - -#define ltests_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "lauxlib.h" -#include "lcode.h" -#include "lctype.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lmem.h" -#include "lopcodes.h" -#include "lopnames.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "lualib.h" - - - -/* -** The whole module only makes sense with LUA_DEBUG on -*/ -#if defined(LUA_DEBUG) - - -void *l_Trick = 0; - - -#define obj_at(L,k) s2v(L->ci->func.p + (k)) - - -static int runC (lua_State *L, lua_State *L1, const char *pc); - - -static void setnameval (lua_State *L, const char *name, int val) { - lua_pushinteger(L, val); - lua_setfield(L, -2, name); -} - - -static void pushobject (lua_State *L, const TValue *o) { - setobj2s(L, L->top.p, o); - api_incr_top(L); -} - - -static void badexit (const char *fmt, const char *s1, const char *s2) { - fprintf(stderr, fmt, s1); - if (s2) - fprintf(stderr, "extra info: %s\n", s2); - /* avoid assertion failures when exiting */ - l_memcontrol.numblocks = l_memcontrol.total = 0; - exit(EXIT_FAILURE); -} - - -static int tpanic (lua_State *L) { - const char *msg = (lua_type(L, -1) == LUA_TSTRING) - ? lua_tostring(L, -1) - : "error object is not a string"; - return (badexit("PANIC: unprotected error in call to Lua API (%s)\n", - msg, NULL), - 0); /* do not return to Lua */ -} - - -/* -** Warning function for tests. First, it concatenates all parts of -** a warning in buffer 'buff'. Then, it has three modes: -** - 0.normal: messages starting with '#' are shown on standard output; -** - other messages abort the tests (they represent real warning -** conditions; the standard tests should not generate these conditions -** unexpectedly); -** - 1.allow: all messages are shown; -** - 2.store: all warnings go to the global '_WARN'; -*/ -static void warnf (void *ud, const char *msg, int tocont) { - lua_State *L = cast(lua_State *, ud); - static char buff[200] = ""; /* should be enough for tests... */ - static int onoff = 0; - static int mode = 0; /* start in normal mode */ - static int lasttocont = 0; - if (!lasttocont && !tocont && *msg == '@') { /* control message? */ - if (buff[0] != '\0') - badexit("Control warning during warning: %s\naborting...\n", msg, buff); - if (strcmp(msg, "@off") == 0) - onoff = 0; - else if (strcmp(msg, "@on") == 0) - onoff = 1; - else if (strcmp(msg, "@normal") == 0) - mode = 0; - else if (strcmp(msg, "@allow") == 0) - mode = 1; - else if (strcmp(msg, "@store") == 0) - mode = 2; - else - badexit("Invalid control warning in test mode: %s\naborting...\n", - msg, NULL); - return; - } - lasttocont = tocont; - if (strlen(msg) >= sizeof(buff) - strlen(buff)) - badexit("warnf-buffer overflow (%s)\n", msg, buff); - strcat(buff, msg); /* add new message to current warning */ - if (!tocont) { /* message finished? */ - lua_unlock(L); - luaL_checkstack(L, 1, "warn stack space"); - lua_getglobal(L, "_WARN"); - if (!lua_toboolean(L, -1)) - lua_pop(L, 1); /* ok, no previous unexpected warning */ - else { - badexit("Unhandled warning in store mode: %s\naborting...\n", - lua_tostring(L, -1), buff); - } - lua_lock(L); - switch (mode) { - case 0: { /* normal */ - if (buff[0] != '#' && onoff) /* unexpected warning? */ - badexit("Unexpected warning in test mode: %s\naborting...\n", - buff, NULL); - } /* FALLTHROUGH */ - case 1: { /* allow */ - if (onoff) - fprintf(stderr, "Lua warning: %s\n", buff); /* print warning */ - break; - } - case 2: { /* store */ - lua_unlock(L); - luaL_checkstack(L, 1, "warn stack space"); - lua_pushstring(L, buff); - lua_setglobal(L, "_WARN"); /* assign message to global '_WARN' */ - lua_lock(L); - break; - } - } - buff[0] = '\0'; /* prepare buffer for next warning */ - } -} - - -/* -** {====================================================================== -** Controlled version for realloc. -** ======================================================================= -*/ - -#define MARK 0x55 /* 01010101 (a nice pattern) */ - -typedef union Header { - LUAI_MAXALIGN; - struct { - size_t size; - int type; - } d; -} Header; - - -#if !defined(EXTERNMEMCHECK) - -/* full memory check */ -#define MARKSIZE 16 /* size of marks after each block */ -#define fillmem(mem,size) memset(mem, -MARK, size) - -#else - -/* external memory check: don't do it twice */ -#define MARKSIZE 0 -#define fillmem(mem,size) /* empty */ - -#endif - - -Memcontrol l_memcontrol = - {0, 0UL, 0UL, 0UL, 0UL, (~0UL), - {0UL, 0UL, 0UL, 0UL, 0UL, 0UL, 0UL, 0UL, 0UL}}; - - -static void freeblock (Memcontrol *mc, Header *block) { - if (block) { - size_t size = block->d.size; - int i; - for (i = 0; i < MARKSIZE; i++) /* check marks after block */ - lua_assert(*(cast_charp(block + 1) + size + i) == MARK); - mc->objcount[block->d.type]--; - fillmem(block, sizeof(Header) + size + MARKSIZE); /* erase block */ - free(block); /* actually free block */ - mc->numblocks--; /* update counts */ - mc->total -= size; - } -} - - -void *debug_realloc (void *ud, void *b, size_t oldsize, size_t size) { - Memcontrol *mc = cast(Memcontrol *, ud); - Header *block = cast(Header *, b); - int type; - if (mc->memlimit == 0) { /* first time? */ - char *limit = getenv("MEMLIMIT"); /* initialize memory limit */ - mc->memlimit = limit ? strtoul(limit, NULL, 10) : ULONG_MAX; - } - if (block == NULL) { - type = (oldsize < LUA_NUMTYPES) ? oldsize : 0; - oldsize = 0; - } - else { - block--; /* go to real header */ - type = block->d.type; - lua_assert(oldsize == block->d.size); - } - if (size == 0) { - freeblock(mc, block); - return NULL; - } - if (mc->failnext) { - mc->failnext = 0; - return NULL; /* fake a single memory allocation error */ - } - if (mc->countlimit != ~0UL && size != oldsize) { /* count limit in use? */ - if (mc->countlimit == 0) - return NULL; /* fake a memory allocation error */ - mc->countlimit--; - } - if (size > oldsize && mc->total+size-oldsize > mc->memlimit) - return NULL; /* fake a memory allocation error */ - else { - Header *newblock; - int i; - size_t commonsize = (oldsize < size) ? oldsize : size; - size_t realsize = sizeof(Header) + size + MARKSIZE; - if (realsize < size) return NULL; /* arithmetic overflow! */ - newblock = cast(Header *, malloc(realsize)); /* alloc a new block */ - if (newblock == NULL) - return NULL; /* really out of memory? */ - if (block) { - memcpy(newblock + 1, block + 1, commonsize); /* copy old contents */ - freeblock(mc, block); /* erase (and check) old copy */ - } - /* initialize new part of the block with something weird */ - fillmem(cast_charp(newblock + 1) + commonsize, size - commonsize); - /* initialize marks after block */ - for (i = 0; i < MARKSIZE; i++) - *(cast_charp(newblock + 1) + size + i) = MARK; - newblock->d.size = size; - newblock->d.type = type; - mc->total += size; - if (mc->total > mc->maxmem) - mc->maxmem = mc->total; - mc->numblocks++; - mc->objcount[type]++; - return newblock + 1; - } -} - - -/* }====================================================================== */ - - - -/* -** {===================================================================== -** Functions to check memory consistency. -** Most of these checks are done through asserts, so this code does -** not make sense with asserts off. For this reason, it uses 'assert' -** directly, instead of 'lua_assert'. -** ====================================================================== -*/ - -#include - -/* -** Check GC invariants. For incremental mode, a black object cannot -** point to a white one. For generational mode, really old objects -** cannot point to young objects. Both old1 and touched2 objects -** cannot point to new objects (but can point to survivals). -** (Threads and open upvalues, despite being marked "really old", -** continue to be visited in all collections, and therefore can point to -** new objects. They, and only they, are old but gray.) -*/ -static int testobjref1 (global_State *g, GCObject *f, GCObject *t) { - if (isdead(g,t)) return 0; - if (issweepphase(g)) - return 1; /* no invariants */ - else if (g->gckind != KGC_GENMINOR) - return !(isblack(f) && iswhite(t)); /* basic incremental invariant */ - else { /* generational mode */ - if ((getage(f) == G_OLD && isblack(f)) && !isold(t)) - return 0; - if ((getage(f) == G_OLD1 || getage(f) == G_TOUCHED2) && - getage(t) == G_NEW) - return 0; - return 1; - } -} - - -static void printobj (global_State *g, GCObject *o) { - printf("||%s(%p)-%c%c(%02X)||", - ttypename(novariant(o->tt)), (void *)o, - isdead(g,o) ? 'd' : isblack(o) ? 'b' : iswhite(o) ? 'w' : 'g', - "ns01oTt"[getage(o)], o->marked); - if (o->tt == LUA_VSHRSTR || o->tt == LUA_VLNGSTR) - printf(" '%s'", getstr(gco2ts(o))); -} - - -void lua_printobj (lua_State *L, struct GCObject *o) { - printobj(G(L), o); -} - -static int testobjref (global_State *g, GCObject *f, GCObject *t) { - int r1 = testobjref1(g, f, t); - if (!r1) { - printf("%d(%02X) - ", g->gcstate, g->currentwhite); - printobj(g, f); - printf(" -> "); - printobj(g, t); - printf("\n"); - } - return r1; -} - - -static void checkobjref (global_State *g, GCObject *f, GCObject *t) { - assert(testobjref(g, f, t)); -} - - -/* -** Version where 't' can be NULL. In that case, it should not apply the -** macro 'obj2gco' over the object. ('t' may have several types, so this -** definition must be a macro.) Most checks need this version, because -** the check may run while an object is still being created. -*/ -#define checkobjrefN(g,f,t) { if (t) checkobjref(g,f,obj2gco(t)); } - - -static void checkvalref (global_State *g, GCObject *f, const TValue *t) { - assert(!iscollectable(t) || (righttt(t) && testobjref(g, f, gcvalue(t)))); -} - - -static void checktable (global_State *g, Table *h) { - unsigned int i; - unsigned int asize = luaH_realasize(h); - Node *n, *limit = gnode(h, sizenode(h)); - GCObject *hgc = obj2gco(h); - checkobjrefN(g, hgc, h->metatable); - for (i = 0; i < asize; i++) { - TValue aux; - arr2obj(h, i + 1, &aux); - checkvalref(g, hgc, &aux); - } - for (n = gnode(h, 0); n < limit; n++) { - if (!isempty(gval(n))) { - TValue k; - getnodekey(g->mainthread, &k, n); - assert(!keyisnil(n)); - checkvalref(g, hgc, &k); - checkvalref(g, hgc, gval(n)); - } - } -} - - -static void checkudata (global_State *g, Udata *u) { - int i; - GCObject *hgc = obj2gco(u); - checkobjrefN(g, hgc, u->metatable); - for (i = 0; i < u->nuvalue; i++) - checkvalref(g, hgc, &u->uv[i].uv); -} - - -static void checkproto (global_State *g, Proto *f) { - int i; - GCObject *fgc = obj2gco(f); - checkobjrefN(g, fgc, f->source); - for (i=0; isizek; i++) { - if (iscollectable(f->k + i)) - checkobjref(g, fgc, gcvalue(f->k + i)); - } - for (i=0; isizeupvalues; i++) - checkobjrefN(g, fgc, f->upvalues[i].name); - for (i=0; isizep; i++) - checkobjrefN(g, fgc, f->p[i]); - for (i=0; isizelocvars; i++) - checkobjrefN(g, fgc, f->locvars[i].varname); -} - - -static void checkCclosure (global_State *g, CClosure *cl) { - GCObject *clgc = obj2gco(cl); - int i; - for (i = 0; i < cl->nupvalues; i++) - checkvalref(g, clgc, &cl->upvalue[i]); -} - - -static void checkLclosure (global_State *g, LClosure *cl) { - GCObject *clgc = obj2gco(cl); - int i; - checkobjrefN(g, clgc, cl->p); - for (i=0; inupvalues; i++) { - UpVal *uv = cl->upvals[i]; - if (uv) { - checkobjrefN(g, clgc, uv); - if (!upisopen(uv)) - checkvalref(g, obj2gco(uv), uv->v.p); - } - } -} - - -static int lua_checkpc (CallInfo *ci) { - if (!isLua(ci)) return 1; - else { - StkId f = ci->func.p; - Proto *p = clLvalue(s2v(f))->p; - return p->code <= ci->u.l.savedpc && - ci->u.l.savedpc <= p->code + p->sizecode; - } -} - - -static void checkstack (global_State *g, lua_State *L1) { - StkId o; - CallInfo *ci; - UpVal *uv; - assert(!isdead(g, L1)); - if (L1->stack.p == NULL) { /* incomplete thread? */ - assert(L1->openupval == NULL && L1->ci == NULL); - return; - } - for (uv = L1->openupval; uv != NULL; uv = uv->u.open.next) - assert(upisopen(uv)); /* must be open */ - assert(L1->top.p <= L1->stack_last.p); - assert(L1->tbclist.p <= L1->top.p); - for (ci = L1->ci; ci != NULL; ci = ci->previous) { - assert(ci->top.p <= L1->stack_last.p); - assert(lua_checkpc(ci)); - } - for (o = L1->stack.p; o < L1->stack_last.p; o++) - checkliveness(L1, s2v(o)); /* entire stack must have valid values */ -} - - -static void checkrefs (global_State *g, GCObject *o) { - switch (o->tt) { - case LUA_VUSERDATA: { - checkudata(g, gco2u(o)); - break; - } - case LUA_VUPVAL: { - checkvalref(g, o, gco2upv(o)->v.p); - break; - } - case LUA_VTABLE: { - checktable(g, gco2t(o)); - break; - } - case LUA_VTHREAD: { - checkstack(g, gco2th(o)); - break; - } - case LUA_VLCL: { - checkLclosure(g, gco2lcl(o)); - break; - } - case LUA_VCCL: { - checkCclosure(g, gco2ccl(o)); - break; - } - case LUA_VPROTO: { - checkproto(g, gco2p(o)); - break; - } - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - assert(!isgray(o)); /* strings are never gray */ - break; - } - default: assert(0); - } -} - - -/* -** Check consistency of an object: -** - Dead objects can only happen in the 'allgc' list during a sweep -** phase (controlled by the caller through 'maybedead'). -** - During pause, all objects must be white. -** - In generational mode: -** * objects must be old enough for their lists ('listage'). -** * old objects cannot be white. -** * old objects must be black, except for 'touched1', 'old0', -** threads, and open upvalues. -** * 'touched1' objects must be gray. -*/ -static void checkobject (global_State *g, GCObject *o, int maybedead, - int listage) { - if (isdead(g, o)) - assert(maybedead); - else { - assert(g->gcstate != GCSpause || iswhite(o)); - if (g->gckind == KGC_GENMINOR) { /* generational mode? */ - assert(getage(o) >= listage); - if (isold(o)) { - assert(!iswhite(o)); - assert(isblack(o) || - getage(o) == G_TOUCHED1 || - getage(o) == G_OLD0 || - o->tt == LUA_VTHREAD || - (o->tt == LUA_VUPVAL && upisopen(gco2upv(o)))); - } - assert(getage(o) != G_TOUCHED1 || isgray(o)); - } - checkrefs(g, o); - } -} - - -static l_obj checkgraylist (global_State *g, GCObject *o) { - int total = 0; /* count number of elements in the list */ - cast_void(g); /* better to keep it if we need to print an object */ - while (o) { - assert(!!isgray(o) ^ (getage(o) == G_TOUCHED2)); - assert(!testbit(o->marked, TESTBIT)); - if (keepinvariant(g)) - l_setbit(o->marked, TESTBIT); /* mark that object is in a gray list */ - total++; - switch (o->tt) { - case LUA_VTABLE: o = gco2t(o)->gclist; break; - case LUA_VLCL: o = gco2lcl(o)->gclist; break; - case LUA_VCCL: o = gco2ccl(o)->gclist; break; - case LUA_VTHREAD: o = gco2th(o)->gclist; break; - case LUA_VPROTO: o = gco2p(o)->gclist; break; - case LUA_VUSERDATA: - assert(gco2u(o)->nuvalue > 0); - o = gco2u(o)->gclist; - break; - default: assert(0); /* other objects cannot be in a gray list */ - } - } - return total; -} - - -/* -** Check objects in gray lists. -*/ -static l_obj checkgrays (global_State *g) { - int total = 0; /* count number of elements in all lists */ - if (!keepinvariant(g)) return total; - total += checkgraylist(g, g->gray); - total += checkgraylist(g, g->grayagain); - total += checkgraylist(g, g->weak); - total += checkgraylist(g, g->allweak); - total += checkgraylist(g, g->ephemeron); - return total; -} - - -/* -** Check whether 'o' should be in a gray list. If so, increment -** 'count' and check its TESTBIT. (It must have been previously set by -** 'checkgraylist'.) -*/ -static void incifingray (global_State *g, GCObject *o, l_obj *count) { - if (!keepinvariant(g)) - return; /* gray lists not being kept in these phases */ - if (o->tt == LUA_VUPVAL) { - /* only open upvalues can be gray */ - assert(!isgray(o) || upisopen(gco2upv(o))); - return; /* upvalues are never in gray lists */ - } - /* these are the ones that must be in gray lists */ - if (isgray(o) || getage(o) == G_TOUCHED2) { - (*count)++; - assert(testbit(o->marked, TESTBIT)); - resetbit(o->marked, TESTBIT); /* prepare for next cycle */ - } -} - - -static l_obj checklist (global_State *g, int maybedead, int tof, - GCObject *newl, GCObject *survival, GCObject *old, GCObject *reallyold) { - GCObject *o; - l_obj total = 0; /* number of object that should be in gray lists */ - for (o = newl; o != survival; o = o->next) { - checkobject(g, o, maybedead, G_NEW); - incifingray(g, o, &total); - assert(!tof == !tofinalize(o)); - } - for (o = survival; o != old; o = o->next) { - checkobject(g, o, 0, G_SURVIVAL); - incifingray(g, o, &total); - assert(!tof == !tofinalize(o)); - } - for (o = old; o != reallyold; o = o->next) { - checkobject(g, o, 0, G_OLD1); - incifingray(g, o, &total); - assert(!tof == !tofinalize(o)); - } - for (o = reallyold; o != NULL; o = o->next) { - checkobject(g, o, 0, G_OLD); - incifingray(g, o, &total); - assert(!tof == !tofinalize(o)); - } - return total; -} - - -int lua_checkmemory (lua_State *L) { - global_State *g = G(L); - GCObject *o; - int maybedead; - l_obj totalin; /* total of objects that are in gray lists */ - l_obj totalshould; /* total of objects that should be in gray lists */ - if (keepinvariant(g)) { - assert(!iswhite(g->mainthread)); - assert(!iswhite(gcvalue(&g->l_registry))); - } - assert(!isdead(g, gcvalue(&g->l_registry))); - assert(g->sweepgc == NULL || issweepphase(g)); - totalin = checkgrays(g); - - /* check 'fixedgc' list */ - for (o = g->fixedgc; o != NULL; o = o->next) { - assert(o->tt == LUA_VSHRSTR && isgray(o) && getage(o) == G_OLD); - } - - /* check 'allgc' list */ - maybedead = (GCSatomic < g->gcstate && g->gcstate <= GCSswpallgc); - totalshould = checklist(g, maybedead, 0, g->allgc, - g->survival, g->old1, g->reallyold); - - /* check 'finobj' list */ - totalshould += checklist(g, 0, 1, g->finobj, - g->finobjsur, g->finobjold1, g->finobjrold); - - /* check 'tobefnz' list */ - for (o = g->tobefnz; o != NULL; o = o->next) { - checkobject(g, o, 0, G_NEW); - incifingray(g, o, &totalshould); - assert(tofinalize(o)); - assert(o->tt == LUA_VUSERDATA || o->tt == LUA_VTABLE); - } - if (keepinvariant(g)) - assert(totalin == totalshould); - return 0; -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Disassembler -** ======================================================= -*/ - - -static char *buildop (Proto *p, int pc, char *buff) { - char *obuff = buff; - Instruction i = p->code[pc]; - OpCode o = GET_OPCODE(i); - const char *name = opnames[o]; - int line = luaG_getfuncline(p, pc); - int lineinfo = (p->lineinfo != NULL) ? p->lineinfo[pc] : 0; - if (lineinfo == ABSLINEINFO) - buff += sprintf(buff, "(__"); - else - buff += sprintf(buff, "(%2d", lineinfo); - buff += sprintf(buff, " - %4d) %4d - ", line, pc); - switch (getOpMode(o)) { - case iABC: - sprintf(buff, "%-12s%4d %4d %4d%s", name, - GETARG_A(i), GETARG_B(i), GETARG_C(i), - GETARG_k(i) ? " (k)" : ""); - break; - case iABx: - sprintf(buff, "%-12s%4d %4d", name, GETARG_A(i), GETARG_Bx(i)); - break; - case iAsBx: - sprintf(buff, "%-12s%4d %4d", name, GETARG_A(i), GETARG_sBx(i)); - break; - case iAx: - sprintf(buff, "%-12s%4d", name, GETARG_Ax(i)); - break; - case isJ: - sprintf(buff, "%-12s%4d", name, GETARG_sJ(i)); - break; - } - return obuff; -} - - -#if 0 -void luaI_printcode (Proto *pt, int size) { - int pc; - for (pc=0; pcmaxstacksize); - setnameval(L, "numparams", p->numparams); - for (pc=0; pcsizecode; pc++) { - char buff[100]; - lua_pushinteger(L, pc+1); - lua_pushstring(L, buildop(p, pc, buff)); - lua_settable(L, -3); - } - return 1; -} - - -static int printcode (lua_State *L) { - int pc; - Proto *p; - luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - p = getproto(obj_at(L, 1)); - printf("maxstack: %d\n", p->maxstacksize); - printf("numparams: %d\n", p->numparams); - for (pc=0; pcsizecode; pc++) { - char buff[100]; - printf("%s\n", buildop(p, pc, buff)); - } - return 0; -} - - -static int listk (lua_State *L) { - Proto *p; - int i; - luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - p = getproto(obj_at(L, 1)); - lua_createtable(L, p->sizek, 0); - for (i=0; isizek; i++) { - pushobject(L, p->k+i); - lua_rawseti(L, -2, i+1); - } - return 1; -} - - -static int listabslineinfo (lua_State *L) { - Proto *p; - int i; - luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - p = getproto(obj_at(L, 1)); - luaL_argcheck(L, p->abslineinfo != NULL, 1, "function has no debug info"); - lua_createtable(L, 2 * p->sizeabslineinfo, 0); - for (i=0; i < p->sizeabslineinfo; i++) { - lua_pushinteger(L, p->abslineinfo[i].pc); - lua_rawseti(L, -2, 2 * i + 1); - lua_pushinteger(L, p->abslineinfo[i].line); - lua_rawseti(L, -2, 2 * i + 2); - } - return 1; -} - - -static int listlocals (lua_State *L) { - Proto *p; - int pc = cast_int(luaL_checkinteger(L, 2)) - 1; - int i = 0; - const char *name; - luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - p = getproto(obj_at(L, 1)); - while ((name = luaF_getlocalname(p, ++i, pc)) != NULL) - lua_pushstring(L, name); - return i-1; -} - -/* }====================================================== */ - - - -static void printstack (lua_State *L) { - int i; - int n = lua_gettop(L); - printf("stack: >>\n"); - for (i = 1; i <= n; i++) { - printf("%3d: %s\n", i, luaL_tolstring(L, i, NULL)); - lua_pop(L, 1); - } - printf("<<\n"); -} - - -static int get_limits (lua_State *L) { - lua_createtable(L, 0, 6); - setnameval(L, "IS32INT", LUAI_IS32INT); - setnameval(L, "MAXARG_Ax", MAXARG_Ax); - setnameval(L, "MAXARG_Bx", MAXARG_Bx); - setnameval(L, "OFFSET_sBx", OFFSET_sBx); - setnameval(L, "LFPF", LFIELDS_PER_FLUSH); - setnameval(L, "NUM_OPCODES", NUM_OPCODES); - return 1; -} - - -static int mem_query (lua_State *L) { - if (lua_isnone(L, 1)) { - lua_pushinteger(L, l_memcontrol.total); - lua_pushinteger(L, l_memcontrol.numblocks); - lua_pushinteger(L, l_memcontrol.maxmem); - return 3; - } - else if (lua_isnumber(L, 1)) { - unsigned long limit = cast(unsigned long, luaL_checkinteger(L, 1)); - if (limit == 0) limit = ULONG_MAX; - l_memcontrol.memlimit = limit; - return 0; - } - else { - const char *t = luaL_checkstring(L, 1); - int i; - for (i = LUA_NUMTYPES - 1; i >= 0; i--) { - if (strcmp(t, ttypename(i)) == 0) { - lua_pushinteger(L, l_memcontrol.objcount[i]); - return 1; - } - } - return luaL_error(L, "unknown type '%s'", t); - } -} - - -static int alloc_count (lua_State *L) { - if (lua_isnone(L, 1)) - l_memcontrol.countlimit = ~0L; - else - l_memcontrol.countlimit = luaL_checkinteger(L, 1); - return 0; -} - - -static int alloc_failnext (lua_State *L) { - UNUSED(L); - l_memcontrol.failnext = 1; - return 0; -} - - -static int settrick (lua_State *L) { - if (ttisnil(obj_at(L, 1))) - l_Trick = NULL; - else - l_Trick = gcvalue(obj_at(L, 1)); - return 0; -} - - -static int gc_color (lua_State *L) { - TValue *o; - luaL_checkany(L, 1); - o = obj_at(L, 1); - if (!iscollectable(o)) - lua_pushstring(L, "no collectable"); - else { - GCObject *obj = gcvalue(o); - lua_pushstring(L, isdead(G(L), obj) ? "dead" : - iswhite(obj) ? "white" : - isblack(obj) ? "black" : "gray"); - } - return 1; -} - - -static int gc_age (lua_State *L) { - TValue *o; - luaL_checkany(L, 1); - o = obj_at(L, 1); - if (!iscollectable(o)) - lua_pushstring(L, "no collectable"); - else { - static const char *gennames[] = {"new", "survival", "old0", "old1", - "old", "touched1", "touched2"}; - GCObject *obj = gcvalue(o); - lua_pushstring(L, gennames[getage(obj)]); - } - return 1; -} - - -static int gc_printobj (lua_State *L) { - TValue *o; - luaL_checkany(L, 1); - o = obj_at(L, 1); - if (!iscollectable(o)) - printf("no collectable\n"); - else { - GCObject *obj = gcvalue(o); - printobj(G(L), obj); - printf("\n"); - } - return 0; -} - - -static int gc_state (lua_State *L) { - static const char *statenames[] = { - "propagate", "atomic", "sweepallgc", "sweepfinobj", - "sweeptobefnz", "sweepend", "callfin", "pause", ""}; - static const int states[] = { - GCSpropagate, GCSenteratomic, GCSswpallgc, GCSswpfinobj, - GCSswptobefnz, GCSswpend, GCScallfin, GCSpause, -1}; - int option = states[luaL_checkoption(L, 1, "", statenames)]; - if (option == -1) { - lua_pushstring(L, statenames[G(L)->gcstate]); - return 1; - } - else { - global_State *g = G(L); - if (G(L)->gckind != KGC_INC) - luaL_error(L, "cannot change states in generational mode"); - lua_lock(L); - if (option < g->gcstate) { /* must cross 'pause'? */ - luaC_runtilstate(L, GCSpause, 1); /* run until pause */ - } - luaC_runtilstate(L, option, 0); /* do not skip propagation state */ - lua_assert(G(L)->gcstate == option); - lua_unlock(L); - return 0; - } -} - - -static int hash_query (lua_State *L) { - if (lua_isnone(L, 2)) { - luaL_argcheck(L, lua_type(L, 1) == LUA_TSTRING, 1, "string expected"); - lua_pushinteger(L, tsvalue(obj_at(L, 1))->hash); - } - else { - TValue *o = obj_at(L, 1); - Table *t; - luaL_checktype(L, 2, LUA_TTABLE); - t = hvalue(obj_at(L, 2)); - lua_pushinteger(L, luaH_mainposition(t, o) - t->node); - } - return 1; -} - - -static int stacklevel (lua_State *L) { - unsigned long a = 0; - lua_pushinteger(L, (L->top.p - L->stack.p)); - lua_pushinteger(L, stacksize(L)); - lua_pushinteger(L, L->nCcalls); - lua_pushinteger(L, L->nci); - lua_pushinteger(L, (unsigned long)&a); - return 5; -} - - -static int table_query (lua_State *L) { - const Table *t; - int i = cast_int(luaL_optinteger(L, 2, -1)); - unsigned int asize; - luaL_checktype(L, 1, LUA_TTABLE); - t = hvalue(obj_at(L, 1)); - asize = luaH_realasize(t); - if (i == -1) { - lua_pushinteger(L, asize); - lua_pushinteger(L, allocsizenode(t)); - lua_pushinteger(L, t->alimit); - return 3; - } - else if (cast_uint(i) < asize) { - lua_pushinteger(L, i); - arr2obj(t, i + 1, s2v(L->top.p)); - api_incr_top(L); - lua_pushnil(L); - } - else if ((i -= asize) < sizenode(t)) { - TValue k; - getnodekey(L, &k, gnode(t, i)); - if (!isempty(gval(gnode(t, i))) || - ttisnil(&k) || - ttisnumber(&k)) { - pushobject(L, &k); - } - else - lua_pushliteral(L, ""); - pushobject(L, gval(gnode(t, i))); - if (gnext(&t->node[i]) != 0) - lua_pushinteger(L, gnext(&t->node[i])); - else - lua_pushnil(L); - } - return 3; -} - - -static int query_GCparams (lua_State *L) { - global_State *g = G(L); - lua_pushinteger(L, gettotalobjs(g)); - lua_pushinteger(L, g->GCdebt); - lua_pushinteger(L, applygcparam(g, MINORMUL, 100)); - lua_pushinteger(L, applygcparam(g, MAJORMINOR, 100)); - lua_pushinteger(L, applygcparam(g, MINORMAJOR, 100)); - lua_pushinteger(L, applygcparam(g, PAUSE, 100)); - lua_pushinteger(L, applygcparam(g, STEPMUL, 100)); - lua_pushinteger(L, applygcparam(g, STEPSIZE, 100)); - return 8; -} - - -static int test_codeparam (lua_State *L) { - lua_Integer p = luaL_checkinteger(L, 1); - lua_pushinteger(L, luaO_codeparam(p)); - return 1; -} - - -static int test_applyparam (lua_State *L) { - lua_Integer p = luaL_checkinteger(L, 1); - lua_Integer x = luaL_checkinteger(L, 2); - lua_pushinteger(L, luaO_applyparam(p, x)); - return 1; -} - - -static int string_query (lua_State *L) { - stringtable *tb = &G(L)->strt; - int s = cast_int(luaL_optinteger(L, 1, 0)) - 1; - if (s == -1) { - lua_pushinteger(L ,tb->size); - lua_pushinteger(L ,tb->nuse); - return 2; - } - else if (s < tb->size) { - TString *ts; - int n = 0; - for (ts = tb->hash[s]; ts != NULL; ts = ts->u.hnext) { - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - n++; - } - return n; - } - else return 0; -} - - -static int getreftable (lua_State *L) { - if (lua_istable(L, 2)) /* is there a table as second argument? */ - return 2; /* use it as the table */ - else - return LUA_REGISTRYINDEX; /* default is to use the register */ -} - - -static int tref (lua_State *L) { - int t = getreftable(L); - int level = lua_gettop(L); - luaL_checkany(L, 1); - lua_pushvalue(L, 1); - lua_pushinteger(L, luaL_ref(L, t)); - cast_void(level); /* to avoid warnings */ - lua_assert(lua_gettop(L) == level+1); /* +1 for result */ - return 1; -} - - -static int getref (lua_State *L) { - int t = getreftable(L); - int level = lua_gettop(L); - lua_rawgeti(L, t, luaL_checkinteger(L, 1)); - cast_void(level); /* to avoid warnings */ - lua_assert(lua_gettop(L) == level+1); - return 1; -} - -static int unref (lua_State *L) { - int t = getreftable(L); - int level = lua_gettop(L); - luaL_unref(L, t, cast_int(luaL_checkinteger(L, 1))); - cast_void(level); /* to avoid warnings */ - lua_assert(lua_gettop(L) == level); - return 0; -} - - -static int upvalue (lua_State *L) { - int n = cast_int(luaL_checkinteger(L, 2)); - luaL_checktype(L, 1, LUA_TFUNCTION); - if (lua_isnone(L, 3)) { - const char *name = lua_getupvalue(L, 1, n); - if (name == NULL) return 0; - lua_pushstring(L, name); - return 2; - } - else { - const char *name = lua_setupvalue(L, 1, n); - lua_pushstring(L, name); - return 1; - } -} - - -static int newuserdata (lua_State *L) { - size_t size = cast_sizet(luaL_optinteger(L, 1, 0)); - int nuv = luaL_optinteger(L, 2, 0); - char *p = cast_charp(lua_newuserdatauv(L, size, nuv)); - while (size--) *p++ = '\0'; - return 1; -} - - -static int pushuserdata (lua_State *L) { - lua_Integer u = luaL_checkinteger(L, 1); - lua_pushlightuserdata(L, cast_voidp(cast_sizet(u))); - return 1; -} - - -static int udataval (lua_State *L) { - lua_pushinteger(L, cast(long, lua_touserdata(L, 1))); - return 1; -} - - -static int doonnewstack (lua_State *L) { - lua_State *L1 = lua_newthread(L); - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - int status = luaL_loadbuffer(L1, s, l, s); - if (status == LUA_OK) - status = lua_pcall(L1, 0, 0, 0); - lua_pushinteger(L, status); - return 1; -} - - -static int s2d (lua_State *L) { - lua_pushnumber(L, cast_num(*cast(const double *, luaL_checkstring(L, 1)))); - return 1; -} - - -static int d2s (lua_State *L) { - double d = cast(double, luaL_checknumber(L, 1)); - lua_pushlstring(L, cast_charp(&d), sizeof(d)); - return 1; -} - - -static int num2int (lua_State *L) { - lua_pushinteger(L, lua_tointeger(L, 1)); - return 1; -} - - -static int makeseed (lua_State *L) { - lua_pushinteger(L, luaL_makeseed(L)); - return 1; -} - - -static int newstate (lua_State *L) { - void *ud; - lua_Alloc f = lua_getallocf(L, &ud); - lua_State *L1 = lua_newstate(f, ud, 0); - if (L1) { - lua_atpanic(L1, tpanic); - lua_pushlightuserdata(L, L1); - } - else - lua_pushnil(L); - return 1; -} - - -static lua_State *getstate (lua_State *L) { - lua_State *L1 = cast(lua_State *, lua_touserdata(L, 1)); - luaL_argcheck(L, L1 != NULL, 1, "state expected"); - return L1; -} - - -static int loadlib (lua_State *L) { - lua_State *L1 = getstate(L); - int load = luaL_checkinteger(L, 2); - int preload = luaL_checkinteger(L, 3); - luaL_openselectedlibs(L1, load, preload); - luaL_requiref(L1, "T", luaB_opentests, 0); - lua_assert(lua_type(L1, -1) == LUA_TTABLE); - /* 'requiref' should not reload module already loaded... */ - luaL_requiref(L1, "T", NULL, 1); /* seg. fault if it reloads */ - /* ...but should return the same module */ - lua_assert(lua_compare(L1, -1, -2, LUA_OPEQ)); - return 0; -} - -static int closestate (lua_State *L) { - lua_State *L1 = getstate(L); - lua_close(L1); - return 0; -} - -static int doremote (lua_State *L) { - lua_State *L1 = getstate(L); - size_t lcode; - const char *code = luaL_checklstring(L, 2, &lcode); - int status; - lua_settop(L1, 0); - status = luaL_loadbuffer(L1, code, lcode, code); - if (status == LUA_OK) - status = lua_pcall(L1, 0, LUA_MULTRET, 0); - if (status != LUA_OK) { - lua_pushnil(L); - lua_pushstring(L, lua_tostring(L1, -1)); - lua_pushinteger(L, status); - return 3; - } - else { - int i = 0; - while (!lua_isnone(L1, ++i)) - lua_pushstring(L, lua_tostring(L1, i)); - lua_pop(L1, i-1); - return i-1; - } -} - - -static int log2_aux (lua_State *L) { - unsigned int x = (unsigned int)luaL_checkinteger(L, 1); - lua_pushinteger(L, luaO_ceillog2(x)); - return 1; -} - - -struct Aux { jmp_buf jb; const char *paniccode; lua_State *L; }; - -/* -** does a long-jump back to "main program". -*/ -static int panicback (lua_State *L) { - struct Aux *b; - lua_checkstack(L, 1); /* open space for 'Aux' struct */ - lua_getfield(L, LUA_REGISTRYINDEX, "_jmpbuf"); /* get 'Aux' struct */ - b = (struct Aux *)lua_touserdata(L, -1); - lua_pop(L, 1); /* remove 'Aux' struct */ - runC(b->L, L, b->paniccode); /* run optional panic code */ - longjmp(b->jb, 1); - return 1; /* to avoid warnings */ -} - -static int checkpanic (lua_State *L) { - struct Aux b; - void *ud; - lua_State *L1; - const char *code = luaL_checkstring(L, 1); - lua_Alloc f = lua_getallocf(L, &ud); - b.paniccode = luaL_optstring(L, 2, ""); - b.L = L; - L1 = lua_newstate(f, ud, 0); /* create new state */ - if (L1 == NULL) { /* error? */ - lua_pushnil(L); - return 1; - } - lua_atpanic(L1, panicback); /* set its panic function */ - lua_pushlightuserdata(L1, &b); - lua_setfield(L1, LUA_REGISTRYINDEX, "_jmpbuf"); /* store 'Aux' struct */ - if (setjmp(b.jb) == 0) { /* set jump buffer */ - runC(L, L1, code); /* run code unprotected */ - lua_pushliteral(L, "no errors"); - } - else { /* error handling */ - /* move error message to original state */ - lua_pushstring(L, lua_tostring(L1, -1)); - } - lua_close(L1); - return 1; -} - - -static int externKstr (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_pushextlstring(L, s, len, NULL, NULL); - return 1; -} - - -/* -** Create a buffer with the content of a given string and then -** create an external string using that buffer. Use the allocation -** function from Lua to create and free the buffer. -*/ -static int externstr (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); /* get allocation function */ - /* create the buffer */ - char *buff = cast_charp((*allocf)(ud, NULL, 0, len + 1)); - if (buff == NULL) { /* memory error? */ - lua_pushliteral(L, "not enough memory"); - lua_error(L); /* raise a memory error */ - } - /* copy string content to buffer, including ending 0 */ - memcpy(buff, s, (len + 1) * sizeof(char)); - /* create external string */ - lua_pushextlstring(L, buff, len, allocf, ud); - return 1; -} - - -/* -** {==================================================================== -** function to test the API with C. It interprets a kind of assembler -** language with calls to the API, so the test can be driven by Lua code -** ===================================================================== -*/ - - -static void sethookaux (lua_State *L, int mask, int count, const char *code); - -static const char *const delimits = " \t\n,;"; - -static void skip (const char **pc) { - for (;;) { - if (**pc != '\0' && strchr(delimits, **pc)) (*pc)++; - else if (**pc == '#') { /* comment? */ - while (**pc != '\n' && **pc != '\0') (*pc)++; /* until end-of-line */ - } - else break; - } -} - -static int getnum_aux (lua_State *L, lua_State *L1, const char **pc) { - int res = 0; - int sig = 1; - skip(pc); - if (**pc == '.') { - res = cast_int(lua_tointeger(L1, -1)); - lua_pop(L1, 1); - (*pc)++; - return res; - } - else if (**pc == '*') { - res = lua_gettop(L1); - (*pc)++; - return res; - } - else if (**pc == '!') { - (*pc)++; - if (**pc == 'G') - res = LUA_RIDX_GLOBALS; - else if (**pc == 'M') - res = LUA_RIDX_MAINTHREAD; - else lua_assert(0); - (*pc)++; - return res; - } - else if (**pc == '-') { - sig = -1; - (*pc)++; - } - if (!lisdigit(cast_uchar(**pc))) - luaL_error(L, "number expected (%s)", *pc); - while (lisdigit(cast_uchar(**pc))) res = res*10 + (*(*pc)++) - '0'; - return sig*res; -} - -static const char *getstring_aux (lua_State *L, char *buff, const char **pc) { - int i = 0; - skip(pc); - if (**pc == '"' || **pc == '\'') { /* quoted string? */ - int quote = *(*pc)++; - while (**pc != quote) { - if (**pc == '\0') luaL_error(L, "unfinished string in C script"); - buff[i++] = *(*pc)++; - } - (*pc)++; - } - else { - while (**pc != '\0' && !strchr(delimits, **pc)) - buff[i++] = *(*pc)++; - } - buff[i] = '\0'; - return buff; -} - - -static int getindex_aux (lua_State *L, lua_State *L1, const char **pc) { - skip(pc); - switch (*(*pc)++) { - case 'R': return LUA_REGISTRYINDEX; - case 'G': return luaL_error(L, "deprecated index 'G'"); - case 'U': return lua_upvalueindex(getnum_aux(L, L1, pc)); - default: (*pc)--; return getnum_aux(L, L1, pc); - } -} - - -static const char *const statcodes[] = {"OK", "YIELD", "ERRRUN", - "ERRSYNTAX", MEMERRMSG, "ERRGCMM", "ERRERR"}; - -/* -** Avoid these stat codes from being collected, to avoid possible -** memory error when pushing them. -*/ -static void regcodes (lua_State *L) { - unsigned int i; - for (i = 0; i < sizeof(statcodes) / sizeof(statcodes[0]); i++) { - lua_pushboolean(L, 1); - lua_setfield(L, LUA_REGISTRYINDEX, statcodes[i]); - } -} - - -#define EQ(s1) (strcmp(s1, inst) == 0) - -#define getnum (getnum_aux(L, L1, &pc)) -#define getstring (getstring_aux(L, buff, &pc)) -#define getindex (getindex_aux(L, L1, &pc)) - - -static int testC (lua_State *L); -static int Cfunck (lua_State *L, int status, lua_KContext ctx); - -/* -** arithmetic operation encoding for 'arith' instruction -** LUA_OPIDIV -> \ -** LUA_OPSHL -> < -** LUA_OPSHR -> > -** LUA_OPUNM -> _ -** LUA_OPBNOT -> ! -*/ -static const char ops[] = "+-*%^/\\&|~<>_!"; - -static int runC (lua_State *L, lua_State *L1, const char *pc) { - char buff[300]; - int status = 0; - if (pc == NULL) return luaL_error(L, "attempt to runC null script"); - for (;;) { - const char *inst = getstring; - if EQ("") return 0; - else if EQ("absindex") { - lua_pushnumber(L1, lua_absindex(L1, getindex)); - } - else if EQ("append") { - int t = getindex; - int i = lua_rawlen(L1, t); - lua_rawseti(L1, t, i + 1); - } - else if EQ("arith") { - int op; - skip(&pc); - op = strchr(ops, *pc++) - ops; - lua_arith(L1, op); - } - else if EQ("call") { - int narg = getnum; - int nres = getnum; - lua_call(L1, narg, nres); - } - else if EQ("callk") { - int narg = getnum; - int nres = getnum; - int i = getindex; - lua_callk(L1, narg, nres, i, Cfunck); - } - else if EQ("checkstack") { - int sz = getnum; - const char *msg = getstring; - if (*msg == '\0') - msg = NULL; /* to test 'luaL_checkstack' with no message */ - luaL_checkstack(L1, sz, msg); - } - else if EQ("rawcheckstack") { - int sz = getnum; - lua_pushboolean(L1, lua_checkstack(L1, sz)); - } - else if EQ("compare") { - const char *opt = getstring; /* EQ, LT, or LE */ - int op = (opt[0] == 'E') ? LUA_OPEQ - : (opt[1] == 'T') ? LUA_OPLT : LUA_OPLE; - int a = getindex; - int b = getindex; - lua_pushboolean(L1, lua_compare(L1, a, b, op)); - } - else if EQ("concat") { - lua_concat(L1, getnum); - } - else if EQ("copy") { - int f = getindex; - lua_copy(L1, f, getindex); - } - else if EQ("func2num") { - lua_CFunction func = lua_tocfunction(L1, getindex); - lua_pushnumber(L1, cast_sizet(func)); - } - else if EQ("getfield") { - int t = getindex; - int tp = lua_getfield(L1, t, getstring); - lua_assert(tp == lua_type(L1, -1)); - } - else if EQ("getglobal") { - lua_getglobal(L1, getstring); - } - else if EQ("getmetatable") { - if (lua_getmetatable(L1, getindex) == 0) - lua_pushnil(L1); - } - else if EQ("gettable") { - int tp = lua_gettable(L1, getindex); - lua_assert(tp == lua_type(L1, -1)); - } - else if EQ("gettop") { - lua_pushinteger(L1, lua_gettop(L1)); - } - else if EQ("gsub") { - int a = getnum; int b = getnum; int c = getnum; - luaL_gsub(L1, lua_tostring(L1, a), - lua_tostring(L1, b), - lua_tostring(L1, c)); - } - else if EQ("insert") { - lua_insert(L1, getnum); - } - else if EQ("iscfunction") { - lua_pushboolean(L1, lua_iscfunction(L1, getindex)); - } - else if EQ("isfunction") { - lua_pushboolean(L1, lua_isfunction(L1, getindex)); - } - else if EQ("isnil") { - lua_pushboolean(L1, lua_isnil(L1, getindex)); - } - else if EQ("isnull") { - lua_pushboolean(L1, lua_isnone(L1, getindex)); - } - else if EQ("isnumber") { - lua_pushboolean(L1, lua_isnumber(L1, getindex)); - } - else if EQ("isstring") { - lua_pushboolean(L1, lua_isstring(L1, getindex)); - } - else if EQ("istable") { - lua_pushboolean(L1, lua_istable(L1, getindex)); - } - else if EQ("isudataval") { - lua_pushboolean(L1, lua_islightuserdata(L1, getindex)); - } - else if EQ("isuserdata") { - lua_pushboolean(L1, lua_isuserdata(L1, getindex)); - } - else if EQ("len") { - lua_len(L1, getindex); - } - else if EQ("Llen") { - lua_pushinteger(L1, luaL_len(L1, getindex)); - } - else if EQ("loadfile") { - luaL_loadfile(L1, luaL_checkstring(L1, getnum)); - } - else if EQ("loadstring") { - size_t slen; - const char *s = luaL_checklstring(L1, getnum, &slen); - const char *name = getstring; - const char *mode = getstring; - luaL_loadbufferx(L1, s, slen, name, mode); - } - else if EQ("newmetatable") { - lua_pushboolean(L1, luaL_newmetatable(L1, getstring)); - } - else if EQ("newtable") { - lua_newtable(L1); - } - else if EQ("newthread") { - lua_newthread(L1); - } - else if EQ("resetthread") { - lua_pushinteger(L1, lua_resetthread(L1)); /* deprecated */ - } - else if EQ("newuserdata") { - lua_newuserdata(L1, getnum); - } - else if EQ("next") { - lua_next(L1, -2); - } - else if EQ("objsize") { - lua_pushinteger(L1, lua_rawlen(L1, getindex)); - } - else if EQ("pcall") { - int narg = getnum; - int nres = getnum; - status = lua_pcall(L1, narg, nres, getnum); - } - else if EQ("pcallk") { - int narg = getnum; - int nres = getnum; - int i = getindex; - status = lua_pcallk(L1, narg, nres, 0, i, Cfunck); - } - else if EQ("pop") { - lua_pop(L1, getnum); - } - else if EQ("printstack") { - int n = getnum; - if (n != 0) { - printf("%s\n", luaL_tolstring(L1, n, NULL)); - lua_pop(L1, 1); - } - else printstack(L1); - } - else if EQ("print") { - const char *msg = getstring; - printf("%s\n", msg); - } - else if EQ("warningC") { - const char *msg = getstring; - lua_warning(L1, msg, 1); - } - else if EQ("warning") { - const char *msg = getstring; - lua_warning(L1, msg, 0); - } - else if EQ("pushbool") { - lua_pushboolean(L1, getnum); - } - else if EQ("pushcclosure") { - lua_pushcclosure(L1, testC, getnum); - } - else if EQ("pushint") { - lua_pushinteger(L1, getnum); - } - else if EQ("pushnil") { - lua_pushnil(L1); - } - else if EQ("pushnum") { - lua_pushnumber(L1, (lua_Number)getnum); - } - else if EQ("pushstatus") { - lua_pushstring(L1, statcodes[status]); - } - else if EQ("pushstring") { - lua_pushstring(L1, getstring); - } - else if EQ("pushupvalueindex") { - lua_pushinteger(L1, lua_upvalueindex(getnum)); - } - else if EQ("pushvalue") { - lua_pushvalue(L1, getindex); - } - else if EQ("pushfstringI") { - lua_pushfstring(L1, lua_tostring(L, -2), (int)lua_tointeger(L, -1)); - } - else if EQ("pushfstringS") { - lua_pushfstring(L1, lua_tostring(L, -2), lua_tostring(L, -1)); - } - else if EQ("pushfstringP") { - lua_pushfstring(L1, lua_tostring(L, -2), lua_topointer(L, -1)); - } - else if EQ("rawget") { - int t = getindex; - lua_rawget(L1, t); - } - else if EQ("rawgeti") { - int t = getindex; - lua_rawgeti(L1, t, getnum); - } - else if EQ("rawgetp") { - int t = getindex; - lua_rawgetp(L1, t, cast_voidp(cast_sizet(getnum))); - } - else if EQ("rawset") { - int t = getindex; - lua_rawset(L1, t); - } - else if EQ("rawseti") { - int t = getindex; - lua_rawseti(L1, t, getnum); - } - else if EQ("rawsetp") { - int t = getindex; - lua_rawsetp(L1, t, cast_voidp(cast_sizet(getnum))); - } - else if EQ("remove") { - lua_remove(L1, getnum); - } - else if EQ("replace") { - lua_replace(L1, getindex); - } - else if EQ("resume") { - int i = getindex; - int nres; - status = lua_resume(lua_tothread(L1, i), L, getnum, &nres); - } - else if EQ("return") { - int n = getnum; - if (L1 != L) { - int i; - for (i = 0; i < n; i++) { - int idx = -(n - i); - switch (lua_type(L1, idx)) { - case LUA_TBOOLEAN: - lua_pushboolean(L, lua_toboolean(L1, idx)); - break; - default: - lua_pushstring(L, lua_tostring(L1, idx)); - break; - } - } - } - return n; - } - else if EQ("rotate") { - int i = getindex; - lua_rotate(L1, i, getnum); - } - else if EQ("setfield") { - int t = getindex; - const char *s = getstring; - lua_setfield(L1, t, s); - } - else if EQ("seti") { - int t = getindex; - lua_seti(L1, t, getnum); - } - else if EQ("setglobal") { - const char *s = getstring; - lua_setglobal(L1, s); - } - else if EQ("sethook") { - int mask = getnum; - int count = getnum; - const char *s = getstring; - sethookaux(L1, mask, count, s); - } - else if EQ("setmetatable") { - int idx = getindex; - lua_setmetatable(L1, idx); - } - else if EQ("settable") { - lua_settable(L1, getindex); - } - else if EQ("settop") { - lua_settop(L1, getnum); - } - else if EQ("testudata") { - int i = getindex; - lua_pushboolean(L1, luaL_testudata(L1, i, getstring) != NULL); - } - else if EQ("error") { - lua_error(L1); - } - else if EQ("abort") { - abort(); - } - else if EQ("throw") { -#if defined(__cplusplus) -static struct X { int x; } x; - throw x; -#else - luaL_error(L1, "C++"); -#endif - break; - } - else if EQ("tobool") { - lua_pushboolean(L1, lua_toboolean(L1, getindex)); - } - else if EQ("tocfunction") { - lua_pushcfunction(L1, lua_tocfunction(L1, getindex)); - } - else if EQ("tointeger") { - lua_pushinteger(L1, lua_tointeger(L1, getindex)); - } - else if EQ("tonumber") { - lua_pushnumber(L1, lua_tonumber(L1, getindex)); - } - else if EQ("topointer") { - lua_pushlightuserdata(L1, cast_voidp(lua_topointer(L1, getindex))); - } - else if EQ("touserdata") { - lua_pushlightuserdata(L1, lua_touserdata(L1, getindex)); - } - else if EQ("tostring") { - const char *s = lua_tostring(L1, getindex); - const char *s1 = lua_pushstring(L1, s); - cast_void(s1); /* to avoid warnings */ - lua_longassert((s == NULL && s1 == NULL) || strcmp(s, s1) == 0); - } - else if EQ("Ltolstring") { - luaL_tolstring(L1, getindex, NULL); - } - else if EQ("type") { - lua_pushstring(L1, luaL_typename(L1, getnum)); - } - else if EQ("xmove") { - int f = getindex; - int t = getindex; - lua_State *fs = (f == 0) ? L1 : lua_tothread(L1, f); - lua_State *ts = (t == 0) ? L1 : lua_tothread(L1, t); - int n = getnum; - if (n == 0) n = lua_gettop(fs); - lua_xmove(fs, ts, n); - } - else if EQ("isyieldable") { - lua_pushboolean(L1, lua_isyieldable(lua_tothread(L1, getindex))); - } - else if EQ("yield") { - return lua_yield(L1, getnum); - } - else if EQ("yieldk") { - int nres = getnum; - int i = getindex; - return lua_yieldk(L1, nres, i, Cfunck); - } - else if EQ("toclose") { - lua_toclose(L1, getnum); - } - else if EQ("closeslot") { - lua_closeslot(L1, getnum); - } - else luaL_error(L, "unknown instruction %s", buff); - } - return 0; -} - - -static int testC (lua_State *L) { - lua_State *L1; - const char *pc; - if (lua_isuserdata(L, 1)) { - L1 = getstate(L); - pc = luaL_checkstring(L, 2); - } - else if (lua_isthread(L, 1)) { - L1 = lua_tothread(L, 1); - pc = luaL_checkstring(L, 2); - } - else { - L1 = L; - pc = luaL_checkstring(L, 1); - } - return runC(L, L1, pc); -} - - -static int Cfunc (lua_State *L) { - return runC(L, L, lua_tostring(L, lua_upvalueindex(1))); -} - - -static int Cfunck (lua_State *L, int status, lua_KContext ctx) { - lua_pushstring(L, statcodes[status]); - lua_setglobal(L, "status"); - lua_pushinteger(L, ctx); - lua_setglobal(L, "ctx"); - return runC(L, L, lua_tostring(L, ctx)); -} - - -static int makeCfunc (lua_State *L) { - luaL_checkstring(L, 1); - lua_pushcclosure(L, Cfunc, lua_gettop(L)); - return 1; -} - - -/* }====================================================== */ - - -/* -** {====================================================== -** tests for C hooks -** ======================================================= -*/ - -/* -** C hook that runs the C script stored in registry.C_HOOK[L] -*/ -static void Chook (lua_State *L, lua_Debug *ar) { - const char *scpt; - const char *const events [] = {"call", "ret", "line", "count", "tailcall"}; - lua_getfield(L, LUA_REGISTRYINDEX, "C_HOOK"); - lua_pushlightuserdata(L, L); - lua_gettable(L, -2); /* get C_HOOK[L] (script saved by sethookaux) */ - scpt = lua_tostring(L, -1); /* not very religious (string will be popped) */ - lua_pop(L, 2); /* remove C_HOOK and script */ - lua_pushstring(L, events[ar->event]); /* may be used by script */ - lua_pushinteger(L, ar->currentline); /* may be used by script */ - runC(L, L, scpt); /* run script from C_HOOK[L] */ -} - - -/* -** sets 'registry.C_HOOK[L] = scpt' and sets 'Chook' as a hook -*/ -static void sethookaux (lua_State *L, int mask, int count, const char *scpt) { - if (*scpt == '\0') { /* no script? */ - lua_sethook(L, NULL, 0, 0); /* turn off hooks */ - return; - } - lua_getfield(L, LUA_REGISTRYINDEX, "C_HOOK"); /* get C_HOOK table */ - if (!lua_istable(L, -1)) { /* no hook table? */ - lua_pop(L, 1); /* remove previous value */ - lua_newtable(L); /* create new C_HOOK table */ - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, "C_HOOK"); /* register it */ - } - lua_pushlightuserdata(L, L); - lua_pushstring(L, scpt); - lua_settable(L, -3); /* C_HOOK[L] = script */ - lua_sethook(L, Chook, mask, count); -} - - -static int sethook (lua_State *L) { - if (lua_isnoneornil(L, 1)) - lua_sethook(L, NULL, 0, 0); /* turn off hooks */ - else { - const char *scpt = luaL_checkstring(L, 1); - const char *smask = luaL_checkstring(L, 2); - int count = cast_int(luaL_optinteger(L, 3, 0)); - int mask = 0; - if (strchr(smask, 'c')) mask |= LUA_MASKCALL; - if (strchr(smask, 'r')) mask |= LUA_MASKRET; - if (strchr(smask, 'l')) mask |= LUA_MASKLINE; - if (count > 0) mask |= LUA_MASKCOUNT; - sethookaux(L, mask, count, scpt); - } - return 0; -} - - -static int coresume (lua_State *L) { - int status, nres; - lua_State *co = lua_tothread(L, 1); - luaL_argcheck(L, co, 1, "coroutine expected"); - status = lua_resume(co, L, 0, &nres); - if (status != LUA_OK && status != LUA_YIELD) { - lua_pushboolean(L, 0); - lua_insert(L, -2); - return 2; /* return false + error message */ - } - else { - lua_pushboolean(L, 1); - return 1; - } -} - -/* }====================================================== */ - - - -static const struct luaL_Reg tests_funcs[] = { - {"checkmemory", lua_checkmemory}, - {"closestate", closestate}, - {"d2s", d2s}, - {"doonnewstack", doonnewstack}, - {"doremote", doremote}, - {"gccolor", gc_color}, - {"gcage", gc_age}, - {"gcstate", gc_state}, - {"pobj", gc_printobj}, - {"getref", getref}, - {"hash", hash_query}, - {"log2", log2_aux}, - {"limits", get_limits}, - {"listcode", listcode}, - {"printcode", printcode}, - {"listk", listk}, - {"listabslineinfo", listabslineinfo}, - {"listlocals", listlocals}, - {"loadlib", loadlib}, - {"checkpanic", checkpanic}, - {"newstate", newstate}, - {"newuserdata", newuserdata}, - {"num2int", num2int}, - {"makeseed", makeseed}, - {"pushuserdata", pushuserdata}, - {"querystr", string_query}, - {"querytab", table_query}, - {"queryGCparams", query_GCparams}, - {"codeparam", test_codeparam}, - {"applyparam", test_applyparam}, - {"ref", tref}, - {"resume", coresume}, - {"s2d", s2d}, - {"sethook", sethook}, - {"stacklevel", stacklevel}, - {"testC", testC}, - {"makeCfunc", makeCfunc}, - {"totalmem", mem_query}, - {"alloccount", alloc_count}, - {"allocfailnext", alloc_failnext}, - {"trick", settrick}, - {"udataval", udataval}, - {"unref", unref}, - {"upvalue", upvalue}, - {"externKstr", externKstr}, - {"externstr", externstr}, - {NULL, NULL} -}; - - -static void checkfinalmem (void) { - lua_assert(l_memcontrol.numblocks == 0); - lua_assert(l_memcontrol.total == 0); -} - - -int luaB_opentests (lua_State *L) { - void *ud; - lua_Alloc f = lua_getallocf(L, &ud); - lua_atpanic(L, &tpanic); - lua_setwarnf(L, &warnf, L); - lua_pushboolean(L, 0); - lua_setglobal(L, "_WARN"); /* _WARN = false */ - regcodes(L); - atexit(checkfinalmem); - lua_assert(f == debug_realloc && ud == cast_voidp(&l_memcontrol)); - lua_setallocf(L, f, ud); /* exercise this function */ - luaL_newlib(L, tests_funcs); - return 1; -} - -#endif - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/ltests.h b/build/c/dependencies/luaCEmbed/dependencies/lua/ltests.h deleted file mode 100644 index da773d6..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/ltests.h +++ /dev/null @@ -1,152 +0,0 @@ -/* -** $Id: ltests.h $ -** Internal Header for Debugging of the Lua Implementation -** See Copyright Notice in lua.h -*/ - -#ifndef ltests_h -#define ltests_h - - -#include -#include - -/* test Lua with compatibility code */ -#define LUA_COMPAT_MATHLIB -#define LUA_COMPAT_LT_LE - - -#define LUA_DEBUG - - -/* turn on assertions */ -#define LUAI_ASSERT - - -/* to avoid warnings, and to make sure value is really unused */ -#define UNUSED(x) (x=0, (void)(x)) - - -/* test for sizes in 'l_sprintf' (make sure whole buffer is available) */ -#undef l_sprintf -#if !defined(LUA_USE_C89) -#define l_sprintf(s,sz,f,i) (memset(s,0xAB,sz), snprintf(s,sz,f,i)) -#else -#define l_sprintf(s,sz,f,i) (memset(s,0xAB,sz), sprintf(s,f,i)) -#endif - - -/* get a chance to test code without jump tables */ -#define LUA_USE_JUMPTABLE 0 - - -/* use 32-bit integers in random generator */ -#define LUA_RAND32 - - -/* memory-allocator control variables */ -typedef struct Memcontrol { - int failnext; - unsigned long numblocks; - unsigned long total; - unsigned long maxmem; - unsigned long memlimit; - unsigned long countlimit; - unsigned long objcount[LUA_NUMTYPES]; -} Memcontrol; - -LUA_API Memcontrol l_memcontrol; - - -/* -** generic variable for debug tricks -*/ -extern void *l_Trick; - - - -/* -** Function to traverse and check all memory used by Lua -*/ -LUAI_FUNC int lua_checkmemory (lua_State *L); - -/* -** Function to print an object GC-friendly -*/ -struct GCObject; -LUAI_FUNC void lua_printobj (lua_State *L, struct GCObject *o); - - -/* test for lock/unlock */ - -struct L_EXTRA { int lock; int *plock; }; -#undef LUA_EXTRASPACE -#define LUA_EXTRASPACE sizeof(struct L_EXTRA) -#define getlock(l) cast(struct L_EXTRA*, lua_getextraspace(l)) -#define luai_userstateopen(l) \ - (getlock(l)->lock = 0, getlock(l)->plock = &(getlock(l)->lock)) -#define luai_userstateclose(l) \ - lua_assert(getlock(l)->lock == 1 && getlock(l)->plock == &(getlock(l)->lock)) -#define luai_userstatethread(l,l1) \ - lua_assert(getlock(l1)->plock == getlock(l)->plock) -#define luai_userstatefree(l,l1) \ - lua_assert(getlock(l)->plock == getlock(l1)->plock) -#define lua_lock(l) lua_assert((*getlock(l)->plock)++ == 0) -#define lua_unlock(l) lua_assert(--(*getlock(l)->plock) == 0) - - - -LUA_API int luaB_opentests (lua_State *L); - -LUA_API void *debug_realloc (void *ud, void *block, - size_t osize, size_t nsize); - -#if defined(lua_c) -#define luaL_newstate() \ - lua_newstate(debug_realloc, &l_memcontrol, luaL_makeseed(NULL)) -#define luai_openlibs(L) \ - { luaL_openlibs(L); \ - luaL_requiref(L, "T", luaB_opentests, 1); \ - lua_pop(L, 1); } -#endif - - - -/* change some sizes to give some bugs a chance */ - -#undef LUAL_BUFFERSIZE -#define LUAL_BUFFERSIZE 23 -#define MINSTRTABSIZE 2 -#define MAXIWTHABS 3 - -#define STRCACHE_N 23 -#define STRCACHE_M 5 - -#undef LUAI_USER_ALIGNMENT_T -#define LUAI_USER_ALIGNMENT_T union { char b[sizeof(void*) * 8]; } - - -/* -** This one is not compatible with tests for opcode optimizations, -** as it blocks some optimizations -#define MAXINDEXRK 0 -*/ - - -/* make stack-overflow tests run faster */ -#undef LUAI_MAXSTACK -#define LUAI_MAXSTACK 50000 - - -/* test mode uses more stack space */ -#undef LUAI_MAXCCALLS -#define LUAI_MAXCCALLS 180 - - -/* force Lua to use its own implementations */ -#undef lua_strx2number -#undef lua_number2strx - - -#endif - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/ltm.c b/build/c/dependencies/luaCEmbed/dependencies/lua/ltm.c deleted file mode 100644 index 236f3bb..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/ltm.c +++ /dev/null @@ -1,276 +0,0 @@ -/* -** $Id: ltm.c $ -** Tag methods -** See Copyright Notice in lua.h -*/ - -#define ltm_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lvm.h" - - -static const char udatatypename[] = "userdata"; - -LUAI_DDEF const char *const luaT_typenames_[LUA_TOTALTYPES] = { - "no value", - "nil", "boolean", udatatypename, "number", - "string", "table", "function", udatatypename, "thread", - "upvalue", "proto" /* these last cases are used for tests only */ -}; - - -void luaT_init (lua_State *L) { - static const char *const luaT_eventname[] = { /* ORDER TM */ - "__index", "__newindex", - "__gc", "__mode", "__len", "__eq", - "__add", "__sub", "__mul", "__mod", "__pow", - "__div", "__idiv", - "__band", "__bor", "__bxor", "__shl", "__shr", - "__unm", "__bnot", "__lt", "__le", - "__concat", "__call", "__close" - }; - int i; - for (i=0; itmname[i] = luaS_new(L, luaT_eventname[i]); - luaC_fix(L, obj2gco(G(L)->tmname[i])); /* never collect these names */ - } -} - - -/* -** function to be used with macro "fasttm": optimized for absence of -** tag methods -*/ -const TValue *luaT_gettm (Table *events, TMS event, TString *ename) { - const TValue *tm = luaH_Hgetshortstr(events, ename); - lua_assert(event <= TM_EQ); - if (notm(tm)) { /* no tag method? */ - events->flags |= cast_byte(1u<metatable; - break; - case LUA_TUSERDATA: - mt = uvalue(o)->metatable; - break; - default: - mt = G(L)->mt[ttype(o)]; - } - return (mt ? luaH_Hgetshortstr(mt, G(L)->tmname[event]) : &G(L)->nilvalue); -} - - -/* -** Return the name of the type of an object. For tables and userdata -** with metatable, use their '__name' metafield, if present. -*/ -const char *luaT_objtypename (lua_State *L, const TValue *o) { - Table *mt; - if ((ttistable(o) && (mt = hvalue(o)->metatable) != NULL) || - (ttisfulluserdata(o) && (mt = uvalue(o)->metatable) != NULL)) { - const TValue *name = luaH_Hgetshortstr(mt, luaS_new(L, "__name")); - if (ttisstring(name)) /* is '__name' a string? */ - return getstr(tsvalue(name)); /* use it as type name */ - } - return ttypename(ttype(o)); /* else use standard type name */ -} - - -void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, const TValue *p3) { - StkId func = L->top.p; - setobj2s(L, func, f); /* push function (assume EXTRA_STACK) */ - setobj2s(L, func + 1, p1); /* 1st argument */ - setobj2s(L, func + 2, p2); /* 2nd argument */ - setobj2s(L, func + 3, p3); /* 3rd argument */ - L->top.p = func + 4; - /* metamethod may yield only when called from Lua code */ - if (isLuacode(L->ci)) - luaD_call(L, func, 0); - else - luaD_callnoyield(L, func, 0); -} - - -int luaT_callTMres (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, StkId res) { - ptrdiff_t result = savestack(L, res); - StkId func = L->top.p; - setobj2s(L, func, f); /* push function (assume EXTRA_STACK) */ - setobj2s(L, func + 1, p1); /* 1st argument */ - setobj2s(L, func + 2, p2); /* 2nd argument */ - L->top.p += 3; - /* metamethod may yield only when called from Lua code */ - if (isLuacode(L->ci)) - luaD_call(L, func, 1); - else - luaD_callnoyield(L, func, 1); - res = restorestack(L, result); - setobjs2s(L, res, --L->top.p); /* move result to its place */ - return ttypetag(s2v(res)); /* return tag of the result */ -} - - -static int callbinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event) { - const TValue *tm = luaT_gettmbyobj(L, p1, event); /* try first operand */ - if (notm(tm)) - tm = luaT_gettmbyobj(L, p2, event); /* try second operand */ - if (notm(tm)) - return -1; /* tag method not found */ - else /* call tag method and return the tag of the result */ - return luaT_callTMres(L, tm, p1, p2, res); -} - - -void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event) { - if (l_unlikely(callbinTM(L, p1, p2, res, event) < 0)) { - switch (event) { - case TM_BAND: case TM_BOR: case TM_BXOR: - case TM_SHL: case TM_SHR: case TM_BNOT: { - if (ttisnumber(p1) && ttisnumber(p2)) - luaG_tointerror(L, p1, p2); - else - luaG_opinterror(L, p1, p2, "perform bitwise operation on"); - } - /* calls never return, but to avoid warnings: *//* FALLTHROUGH */ - default: - luaG_opinterror(L, p1, p2, "perform arithmetic on"); - } - } -} - - -/* -** The use of 'p1' after 'callbinTM' is safe because, when a tag -** method is not found, 'callbinTM' cannot change the stack. -*/ -void luaT_tryconcatTM (lua_State *L) { - StkId p1 = L->top.p - 2; /* first argument */ - if (l_unlikely(callbinTM(L, s2v(p1), s2v(p1 + 1), p1, TM_CONCAT) < 0)) - luaG_concaterror(L, s2v(p1), s2v(p1 + 1)); -} - - -void luaT_trybinassocTM (lua_State *L, const TValue *p1, const TValue *p2, - int flip, StkId res, TMS event) { - if (flip) - luaT_trybinTM(L, p2, p1, res, event); - else - luaT_trybinTM(L, p1, p2, res, event); -} - - -void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, - int flip, StkId res, TMS event) { - TValue aux; - setivalue(&aux, i2); - luaT_trybinassocTM(L, p1, &aux, flip, res, event); -} - - -/* -** Calls an order tag method. -** For lessequal, LUA_COMPAT_LT_LE keeps compatibility with old -** behavior: if there is no '__le', try '__lt', based on l <= r iff -** !(r < l) (assuming a total order). If the metamethod yields during -** this substitution, the continuation has to know about it (to negate -** the result of rtop.p, event); /* try original event */ - if (tag >= 0) /* found tag method? */ - return !tagisfalse(tag); -#if defined(LUA_COMPAT_LT_LE) - else if (event == TM_LE) { - /* try '!(p2 < p1)' for '(p1 <= p2)' */ - L->ci->callstatus |= CIST_LEQ; /* mark it is doing 'lt' for 'le' */ - tag = callbinTM(L, p2, p1, L->top.p, TM_LT); - L->ci->callstatus ^= CIST_LEQ; /* clear mark */ - if (tag >= 0) /* found tag method? */ - return tagisfalse(tag); - } -#endif - luaG_ordererror(L, p1, p2); /* no metamethod found */ - return 0; /* to avoid warnings */ -} - - -int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, - int flip, int isfloat, TMS event) { - TValue aux; const TValue *p2; - if (isfloat) { - setfltvalue(&aux, cast_num(v2)); - } - else - setivalue(&aux, v2); - if (flip) { /* arguments were exchanged? */ - p2 = p1; p1 = &aux; /* correct them */ - } - else - p2 = &aux; - return luaT_callorderTM(L, p1, p2, event); -} - - -void luaT_adjustvarargs (lua_State *L, int nfixparams, CallInfo *ci, - const Proto *p) { - int i; - int actual = cast_int(L->top.p - ci->func.p) - 1; /* number of arguments */ - int nextra = actual - nfixparams; /* number of extra arguments */ - ci->u.l.nextraargs = nextra; - luaD_checkstack(L, p->maxstacksize + 1); - /* copy function to the top of the stack */ - setobjs2s(L, L->top.p++, ci->func.p); - /* move fixed parameters to the top of the stack */ - for (i = 1; i <= nfixparams; i++) { - setobjs2s(L, L->top.p++, ci->func.p + i); - setnilvalue(s2v(ci->func.p + i)); /* erase original parameter (for GC) */ - } - ci->func.p += actual + 1; - ci->top.p += actual + 1; - lua_assert(L->top.p <= ci->top.p && ci->top.p <= L->stack_last.p); -} - - -void luaT_getvarargs (lua_State *L, CallInfo *ci, StkId where, int wanted) { - int i; - int nextra = ci->u.l.nextraargs; - if (wanted < 0) { - wanted = nextra; /* get all extra arguments available */ - checkstackp(L, nextra, where); /* ensure stack space */ - L->top.p = where + nextra; /* next instruction will need top */ - } - for (i = 0; i < wanted && i < nextra; i++) - setobjs2s(L, where + i, ci->func.p - nextra + i); - for (; i < wanted; i++) /* complete required results with nil */ - setnilvalue(s2v(where + i)); -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/ltm.h b/build/c/dependencies/luaCEmbed/dependencies/lua/ltm.h deleted file mode 100644 index df05b74..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/ltm.h +++ /dev/null @@ -1,104 +0,0 @@ -/* -** $Id: ltm.h $ -** Tag methods -** See Copyright Notice in lua.h -*/ - -#ifndef ltm_h -#define ltm_h - - -#include "lobject.h" - - -/* -* WARNING: if you change the order of this enumeration, -* grep "ORDER TM" and "ORDER OP" -*/ -typedef enum { - TM_INDEX, - TM_NEWINDEX, - TM_GC, - TM_MODE, - TM_LEN, - TM_EQ, /* last tag method with fast access */ - TM_ADD, - TM_SUB, - TM_MUL, - TM_MOD, - TM_POW, - TM_DIV, - TM_IDIV, - TM_BAND, - TM_BOR, - TM_BXOR, - TM_SHL, - TM_SHR, - TM_UNM, - TM_BNOT, - TM_LT, - TM_LE, - TM_CONCAT, - TM_CALL, - TM_CLOSE, - TM_N /* number of elements in the enum */ -} TMS; - - -/* -** Mask with 1 in all fast-access methods. A 1 in any of these bits -** in the flag of a (meta)table means the metatable does not have the -** corresponding metamethod field. (Bit 6 of the flag indicates that -** the table is using the dummy node; bit 7 is used for 'isrealasize'.) -*/ -#define maskflags (~(~0u << (TM_EQ + 1))) - - -/* -** Test whether there is no tagmethod. -** (Because tagmethods use raw accesses, the result may be an "empty" nil.) -*/ -#define notm(tm) ttisnil(tm) - -#define checknoTM(mt,e) ((mt) == NULL || (mt)->flags & (1u<<(e))) - -#define gfasttm(g,mt,e) \ - (checknoTM(mt, e) ? NULL : luaT_gettm(mt, e, (g)->tmname[e])) - -#define fasttm(l,mt,e) gfasttm(G(l), mt, e) - -#define ttypename(x) luaT_typenames_[(x) + 1] - -LUAI_DDEC(const char *const luaT_typenames_[LUA_TOTALTYPES];) - - -LUAI_FUNC const char *luaT_objtypename (lua_State *L, const TValue *o); - -LUAI_FUNC const TValue *luaT_gettm (Table *events, TMS event, TString *ename); -LUAI_FUNC const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, - TMS event); -LUAI_FUNC void luaT_init (lua_State *L); - -LUAI_FUNC void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, const TValue *p3); -LUAI_FUNC int luaT_callTMres (lua_State *L, const TValue *f, - const TValue *p1, const TValue *p2, StkId p3); -LUAI_FUNC void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event); -LUAI_FUNC void luaT_tryconcatTM (lua_State *L); -LUAI_FUNC void luaT_trybinassocTM (lua_State *L, const TValue *p1, - const TValue *p2, int inv, StkId res, TMS event); -LUAI_FUNC void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, - int inv, StkId res, TMS event); -LUAI_FUNC int luaT_callorderTM (lua_State *L, const TValue *p1, - const TValue *p2, TMS event); -LUAI_FUNC int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, - int inv, int isfloat, TMS event); - -LUAI_FUNC void luaT_adjustvarargs (lua_State *L, int nfixparams, - struct CallInfo *ci, const Proto *p); -LUAI_FUNC void luaT_getvarargs (lua_State *L, struct CallInfo *ci, - StkId where, int wanted); - - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lua.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lua.c deleted file mode 100644 index 65cf1d4..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lua.c +++ /dev/null @@ -1,673 +0,0 @@ -/* -** $Id: lua.c $ -** Lua stand-alone interpreter -** See Copyright Notice in lua.h -*/ - -#define lua_c - -#include "lprefix.h" - - -#include -#include -#include - -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -#if !defined(LUA_PROGNAME) -#define LUA_PROGNAME "lua" -#endif - -#if !defined(LUA_INIT_VAR) -#define LUA_INIT_VAR "LUA_INIT" -#endif - -#define LUA_INITVARVERSION LUA_INIT_VAR LUA_VERSUFFIX - - -static lua_State *globalL = NULL; - -static const char *progname = LUA_PROGNAME; - - -#if defined(LUA_USE_POSIX) /* { */ - -/* -** Use 'sigaction' when available. -*/ -static void setsignal (int sig, void (*handler)(int)) { - struct sigaction sa; - sa.sa_handler = handler; - sa.sa_flags = 0; - sigemptyset(&sa.sa_mask); /* do not mask any signal */ - sigaction(sig, &sa, NULL); -} - -#else /* }{ */ - -#define setsignal signal - -#endif /* } */ - - -/* -** Hook set by signal function to stop the interpreter. -*/ -static void lstop (lua_State *L, lua_Debug *ar) { - (void)ar; /* unused arg. */ - lua_sethook(L, NULL, 0, 0); /* reset hook */ - luaL_error(L, "interrupted!"); -} - - -/* -** Function to be called at a C signal. Because a C signal cannot -** just change a Lua state (as there is no proper synchronization), -** this function only sets a hook that, when called, will stop the -** interpreter. -*/ -static void laction (int i) { - int flag = LUA_MASKCALL | LUA_MASKRET | LUA_MASKLINE | LUA_MASKCOUNT; - setsignal(i, SIG_DFL); /* if another SIGINT happens, terminate process */ - lua_sethook(globalL, lstop, flag, 1); -} - - -static void print_usage (const char *badoption) { - lua_writestringerror("%s: ", progname); - if (badoption[1] == 'e' || badoption[1] == 'l') - lua_writestringerror("'%s' needs argument\n", badoption); - else - lua_writestringerror("unrecognized option '%s'\n", badoption); - lua_writestringerror( - "usage: %s [options] [script [args]]\n" - "Available options are:\n" - " -e stat execute string 'stat'\n" - " -i enter interactive mode after executing 'script'\n" - " -l mod require library 'mod' into global 'mod'\n" - " -l g=mod require library 'mod' into global 'g'\n" - " -v show version information\n" - " -E ignore environment variables\n" - " -W turn warnings on\n" - " -- stop handling options\n" - " - stop handling options and execute stdin\n" - , - progname); -} - - -/* -** Prints an error message, adding the program name in front of it -** (if present) -*/ -static void l_message (const char *pname, const char *msg) { - if (pname) lua_writestringerror("%s: ", pname); - lua_writestringerror("%s\n", msg); -} - - -/* -** Check whether 'status' is not OK and, if so, prints the error -** message on the top of the stack. It assumes that the error object -** is a string, as it was either generated by Lua or by 'msghandler'. -*/ -static int report (lua_State *L, int status) { - if (status != LUA_OK) { - const char *msg = lua_tostring(L, -1); - l_message(progname, msg); - lua_pop(L, 1); /* remove message */ - } - return status; -} - - -/* -** Message handler used to run all chunks -*/ -static int msghandler (lua_State *L) { - const char *msg = lua_tostring(L, 1); - if (msg == NULL) { /* is error object not a string? */ - if (luaL_callmeta(L, 1, "__tostring") && /* does it have a metamethod */ - lua_type(L, -1) == LUA_TSTRING) /* that produces a string? */ - return 1; /* that is the message */ - else - msg = lua_pushfstring(L, "(error object is a %s value)", - luaL_typename(L, 1)); - } - luaL_traceback(L, L, msg, 1); /* append a standard traceback */ - return 1; /* return the traceback */ -} - - -/* -** Interface to 'lua_pcall', which sets appropriate message function -** and C-signal handler. Used to run all chunks. -*/ -static int docall (lua_State *L, int narg, int nres) { - int status; - int base = lua_gettop(L) - narg; /* function index */ - lua_pushcfunction(L, msghandler); /* push message handler */ - lua_insert(L, base); /* put it under function and args */ - globalL = L; /* to be available to 'laction' */ - setsignal(SIGINT, laction); /* set C-signal handler */ - status = lua_pcall(L, narg, nres, base); - setsignal(SIGINT, SIG_DFL); /* reset C-signal handler */ - lua_remove(L, base); /* remove message handler from the stack */ - return status; -} - - -static void print_version (void) { - lua_writestring(LUA_COPYRIGHT, strlen(LUA_COPYRIGHT)); - lua_writeline(); -} - - -/* -** Create the 'arg' table, which stores all arguments from the -** command line ('argv'). It should be aligned so that, at index 0, -** it has 'argv[script]', which is the script name. The arguments -** to the script (everything after 'script') go to positive indices; -** other arguments (before the script name) go to negative indices. -** If there is no script name, assume interpreter's name as base. -** (If there is no interpreter's name either, 'script' is -1, so -** table sizes are zero.) -*/ -static void createargtable (lua_State *L, char **argv, int argc, int script) { - int i, narg; - narg = argc - (script + 1); /* number of positive indices */ - lua_createtable(L, narg, script + 1); - for (i = 0; i < argc; i++) { - lua_pushstring(L, argv[i]); - lua_rawseti(L, -2, i - script); - } - lua_setglobal(L, "arg"); -} - - -static int dochunk (lua_State *L, int status) { - if (status == LUA_OK) status = docall(L, 0, 0); - return report(L, status); -} - - -static int dofile (lua_State *L, const char *name) { - return dochunk(L, luaL_loadfile(L, name)); -} - - -static int dostring (lua_State *L, const char *s, const char *name) { - return dochunk(L, luaL_loadbuffer(L, s, strlen(s), name)); -} - - -/* -** Receives 'globname[=modname]' and runs 'globname = require(modname)'. -** If there is no explicit modname and globname contains a '-', cut -** the sufix after '-' (the "version") to make the global name. -*/ -static int dolibrary (lua_State *L, char *globname) { - int status; - char *suffix = NULL; - char *modname = strchr(globname, '='); - if (modname == NULL) { /* no explicit name? */ - modname = globname; /* module name is equal to global name */ - suffix = strchr(modname, *LUA_IGMARK); /* look for a suffix mark */ - } - else { - *modname = '\0'; /* global name ends here */ - modname++; /* module name starts after the '=' */ - } - lua_getglobal(L, "require"); - lua_pushstring(L, modname); - status = docall(L, 1, 1); /* call 'require(modname)' */ - if (status == LUA_OK) { - if (suffix != NULL) /* is there a suffix mark? */ - *suffix = '\0'; /* remove sufix from global name */ - lua_setglobal(L, globname); /* globname = require(modname) */ - } - return report(L, status); -} - - -/* -** Push on the stack the contents of table 'arg' from 1 to #arg -*/ -static int pushargs (lua_State *L) { - int i, n; - if (lua_getglobal(L, "arg") != LUA_TTABLE) - luaL_error(L, "'arg' is not a table"); - n = (int)luaL_len(L, -1); - luaL_checkstack(L, n + 3, "too many arguments to script"); - for (i = 1; i <= n; i++) - lua_rawgeti(L, -i, i); - lua_remove(L, -i); /* remove table from the stack */ - return n; -} - - -static int handle_script (lua_State *L, char **argv) { - int status; - const char *fname = argv[0]; - if (strcmp(fname, "-") == 0 && strcmp(argv[-1], "--") != 0) - fname = NULL; /* stdin */ - status = luaL_loadfile(L, fname); - if (status == LUA_OK) { - int n = pushargs(L); /* push arguments to script */ - status = docall(L, n, LUA_MULTRET); - } - return report(L, status); -} - - -/* bits of various argument indicators in 'args' */ -#define has_error 1 /* bad option */ -#define has_i 2 /* -i */ -#define has_v 4 /* -v */ -#define has_e 8 /* -e */ -#define has_E 16 /* -E */ - - -/* -** Traverses all arguments from 'argv', returning a mask with those -** needed before running any Lua code or an error code if it finds any -** invalid argument. In case of error, 'first' is the index of the bad -** argument. Otherwise, 'first' is -1 if there is no program name, -** 0 if there is no script name, or the index of the script name. -*/ -static int collectargs (char **argv, int *first) { - int args = 0; - int i; - if (argv[0] != NULL) { /* is there a program name? */ - if (argv[0][0]) /* not empty? */ - progname = argv[0]; /* save it */ - } - else { /* no program name */ - *first = -1; - return 0; - } - for (i = 1; argv[i] != NULL; i++) { /* handle arguments */ - *first = i; - if (argv[i][0] != '-') /* not an option? */ - return args; /* stop handling options */ - switch (argv[i][1]) { /* else check option */ - case '-': /* '--' */ - if (argv[i][2] != '\0') /* extra characters after '--'? */ - return has_error; /* invalid option */ - *first = i + 1; - return args; - case '\0': /* '-' */ - return args; /* script "name" is '-' */ - case 'E': - if (argv[i][2] != '\0') /* extra characters? */ - return has_error; /* invalid option */ - args |= has_E; - break; - case 'W': - if (argv[i][2] != '\0') /* extra characters? */ - return has_error; /* invalid option */ - break; - case 'i': - args |= has_i; /* (-i implies -v) *//* FALLTHROUGH */ - case 'v': - if (argv[i][2] != '\0') /* extra characters? */ - return has_error; /* invalid option */ - args |= has_v; - break; - case 'e': - args |= has_e; /* FALLTHROUGH */ - case 'l': /* both options need an argument */ - if (argv[i][2] == '\0') { /* no concatenated argument? */ - i++; /* try next 'argv' */ - if (argv[i] == NULL || argv[i][0] == '-') - return has_error; /* no next argument or it is another option */ - } - break; - default: /* invalid option */ - return has_error; - } - } - *first = 0; /* no script name */ - return args; -} - - -/* -** Processes options 'e' and 'l', which involve running Lua code, and -** 'W', which also affects the state. -** Returns 0 if some code raises an error. -*/ -static int runargs (lua_State *L, char **argv, int n) { - int i; - for (i = 1; i < n; i++) { - int option = argv[i][1]; - lua_assert(argv[i][0] == '-'); /* already checked */ - switch (option) { - case 'e': case 'l': { - int status; - char *extra = argv[i] + 2; /* both options need an argument */ - if (*extra == '\0') extra = argv[++i]; - lua_assert(extra != NULL); - status = (option == 'e') - ? dostring(L, extra, "=(command line)") - : dolibrary(L, extra); - if (status != LUA_OK) return 0; - break; - } - case 'W': - lua_warning(L, "@on", 0); /* warnings on */ - break; - } - } - return 1; -} - - -static int handle_luainit (lua_State *L) { - const char *name = "=" LUA_INITVARVERSION; - const char *init = getenv(name + 1); - if (init == NULL) { - name = "=" LUA_INIT_VAR; - init = getenv(name + 1); /* try alternative name */ - } - if (init == NULL) return LUA_OK; - else if (init[0] == '@') - return dofile(L, init+1); - else - return dostring(L, init, name); -} - - -/* -** {================================================================== -** Read-Eval-Print Loop (REPL) -** =================================================================== -*/ - -#if !defined(LUA_PROMPT) -#define LUA_PROMPT "> " -#define LUA_PROMPT2 ">> " -#endif - -#if !defined(LUA_MAXINPUT) -#define LUA_MAXINPUT 512 -#endif - - -/* -** lua_stdin_is_tty detects whether the standard input is a 'tty' (that -** is, whether we're running lua interactively). -*/ -#if !defined(lua_stdin_is_tty) /* { */ - -#if defined(LUA_USE_POSIX) /* { */ - -#include -#define lua_stdin_is_tty() isatty(0) - -#elif defined(LUA_USE_WINDOWS) /* }{ */ - -#include -#include - -#define lua_stdin_is_tty() _isatty(_fileno(stdin)) - -#else /* }{ */ - -/* ISO C definition */ -#define lua_stdin_is_tty() 1 /* assume stdin is a tty */ - -#endif /* } */ - -#endif /* } */ - - -/* -** lua_readline defines how to show a prompt and then read a line from -** the standard input. -** lua_saveline defines how to "save" a read line in a "history". -** lua_freeline defines how to free a line read by lua_readline. -*/ -#if !defined(lua_readline) /* { */ - -#if defined(LUA_USE_READLINE) /* { */ - -#include -#include -#define lua_initreadline(L) ((void)L, rl_readline_name="lua") -#define lua_readline(L,b,p) ((void)L, ((b)=readline(p)) != NULL) -#define lua_saveline(L,line) ((void)L, add_history(line)) -#define lua_freeline(L,b) ((void)L, free(b)) - -#else /* }{ */ - -#define lua_initreadline(L) ((void)L) -#define lua_readline(L,b,p) \ - ((void)L, fputs(p, stdout), fflush(stdout), /* show prompt */ \ - fgets(b, LUA_MAXINPUT, stdin) != NULL) /* get line */ -#define lua_saveline(L,line) { (void)L; (void)line; } -#define lua_freeline(L,b) { (void)L; (void)b; } - -#endif /* } */ - -#endif /* } */ - - -/* -** Return the string to be used as a prompt by the interpreter. Leave -** the string (or nil, if using the default value) on the stack, to keep -** it anchored. -*/ -static const char *get_prompt (lua_State *L, int firstline) { - if (lua_getglobal(L, firstline ? "_PROMPT" : "_PROMPT2") == LUA_TNIL) - return (firstline ? LUA_PROMPT : LUA_PROMPT2); /* use the default */ - else { /* apply 'tostring' over the value */ - const char *p = luaL_tolstring(L, -1, NULL); - lua_remove(L, -2); /* remove original value */ - return p; - } -} - -/* mark in error messages for incomplete statements */ -#define EOFMARK "" -#define marklen (sizeof(EOFMARK)/sizeof(char) - 1) - - -/* -** Check whether 'status' signals a syntax error and the error -** message at the top of the stack ends with the above mark for -** incomplete statements. -*/ -static int incomplete (lua_State *L, int status) { - if (status == LUA_ERRSYNTAX) { - size_t lmsg; - const char *msg = lua_tolstring(L, -1, &lmsg); - if (lmsg >= marklen && strcmp(msg + lmsg - marklen, EOFMARK) == 0) { - lua_pop(L, 1); - return 1; - } - } - return 0; /* else... */ -} - - -/* -** Prompt the user, read a line, and push it into the Lua stack. -*/ -static int pushline (lua_State *L, int firstline) { - char buffer[LUA_MAXINPUT]; - char *b = buffer; - size_t l; - const char *prmt = get_prompt(L, firstline); - int readstatus = lua_readline(L, b, prmt); - if (readstatus == 0) - return 0; /* no input (prompt will be popped by caller) */ - lua_pop(L, 1); /* remove prompt */ - l = strlen(b); - if (l > 0 && b[l-1] == '\n') /* line ends with newline? */ - b[--l] = '\0'; /* remove it */ - if (firstline && b[0] == '=') /* for compatibility with 5.2, ... */ - lua_pushfstring(L, "return %s", b + 1); /* change '=' to 'return' */ - else - lua_pushlstring(L, b, l); - lua_freeline(L, b); - return 1; -} - - -/* -** Try to compile line on the stack as 'return ;'; on return, stack -** has either compiled chunk or original line (if compilation failed). -*/ -static int addreturn (lua_State *L) { - const char *line = lua_tostring(L, -1); /* original line */ - const char *retline = lua_pushfstring(L, "return %s;", line); - int status = luaL_loadbuffer(L, retline, strlen(retline), "=stdin"); - if (status == LUA_OK) { - lua_remove(L, -2); /* remove modified line */ - if (line[0] != '\0') /* non empty? */ - lua_saveline(L, line); /* keep history */ - } - else - lua_pop(L, 2); /* pop result from 'luaL_loadbuffer' and modified line */ - return status; -} - - -/* -** Read multiple lines until a complete Lua statement -*/ -static int multiline (lua_State *L) { - for (;;) { /* repeat until gets a complete statement */ - size_t len; - const char *line = lua_tolstring(L, 1, &len); /* get what it has */ - int status = luaL_loadbuffer(L, line, len, "=stdin"); /* try it */ - if (!incomplete(L, status) || !pushline(L, 0)) { - lua_saveline(L, line); /* keep history */ - return status; /* cannot or should not try to add continuation line */ - } - lua_pushliteral(L, "\n"); /* add newline... */ - lua_insert(L, -2); /* ...between the two lines */ - lua_concat(L, 3); /* join them */ - } -} - - -/* -** Read a line and try to load (compile) it first as an expression (by -** adding "return " in front of it) and second as a statement. Return -** the final status of load/call with the resulting function (if any) -** in the top of the stack. -*/ -static int loadline (lua_State *L) { - int status; - lua_settop(L, 0); - if (!pushline(L, 1)) - return -1; /* no input */ - if ((status = addreturn(L)) != LUA_OK) /* 'return ...' did not work? */ - status = multiline(L); /* try as command, maybe with continuation lines */ - lua_remove(L, 1); /* remove line from the stack */ - lua_assert(lua_gettop(L) == 1); - return status; -} - - -/* -** Prints (calling the Lua 'print' function) any values on the stack -*/ -static void l_print (lua_State *L) { - int n = lua_gettop(L); - if (n > 0) { /* any result to be printed? */ - luaL_checkstack(L, LUA_MINSTACK, "too many results to print"); - lua_getglobal(L, "print"); - lua_insert(L, 1); - if (lua_pcall(L, n, 0, 0) != LUA_OK) - l_message(progname, lua_pushfstring(L, "error calling 'print' (%s)", - lua_tostring(L, -1))); - } -} - - -/* -** Do the REPL: repeatedly read (load) a line, evaluate (call) it, and -** print any results. -*/ -static void doREPL (lua_State *L) { - int status; - const char *oldprogname = progname; - progname = NULL; /* no 'progname' on errors in interactive mode */ - lua_initreadline(L); - while ((status = loadline(L)) != -1) { - if (status == LUA_OK) - status = docall(L, 0, LUA_MULTRET); - if (status == LUA_OK) l_print(L); - else report(L, status); - } - lua_settop(L, 0); /* clear stack */ - lua_writeline(); - progname = oldprogname; -} - -/* }================================================================== */ - -#if !defined(luai_openlibs) -#define luai_openlibs(L) luaL_openselectedlibs(L, ~0, 0) -#endif - - -/* -** Main body of stand-alone interpreter (to be called in protected mode). -** Reads the options and handles them all. -*/ -static int pmain (lua_State *L) { - int argc = (int)lua_tointeger(L, 1); - char **argv = (char **)lua_touserdata(L, 2); - int script; - int args = collectargs(argv, &script); - int optlim = (script > 0) ? script : argc; /* first argv not an option */ - luaL_checkversion(L); /* check that interpreter has correct version */ - if (args == has_error) { /* bad arg? */ - print_usage(argv[script]); /* 'script' has index of bad arg. */ - return 0; - } - if (args & has_v) /* option '-v'? */ - print_version(); - if (args & has_E) { /* option '-E'? */ - lua_pushboolean(L, 1); /* signal for libraries to ignore env. vars. */ - lua_setfield(L, LUA_REGISTRYINDEX, "LUA_NOENV"); - } - luai_openlibs(L); /* open standard libraries */ - createargtable(L, argv, argc, script); /* create table 'arg' */ - lua_gc(L, LUA_GCRESTART); /* start GC... */ - lua_gc(L, LUA_GCGEN); /* ...in generational mode */ - if (!(args & has_E)) { /* no option '-E'? */ - if (handle_luainit(L) != LUA_OK) /* run LUA_INIT */ - return 0; /* error running LUA_INIT */ - } - if (!runargs(L, argv, optlim)) /* execute arguments -e and -l */ - return 0; /* something failed */ - if (script > 0) { /* execute main script (if there is one) */ - if (handle_script(L, argv + script) != LUA_OK) - return 0; /* interrupt in case of error */ - } - if (args & has_i) /* -i option? */ - doREPL(L); /* do read-eval-print loop */ - else if (script < 1 && !(args & (has_e | has_v))) { /* no active option? */ - if (lua_stdin_is_tty()) { /* running in interactive mode? */ - print_version(); - doREPL(L); /* do read-eval-print loop */ - } - else dofile(L, NULL); /* executes stdin as a file */ - } - lua_pushboolean(L, 1); /* signal no errors */ - return 1; -} - - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lua.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lua.h deleted file mode 100644 index b6934e6..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lua.h +++ /dev/null @@ -1,551 +0,0 @@ -/* -** $Id: lua.h $ -** Lua - A Scripting Language -** Lua.org, PUC-Rio, Brazil (www.lua.org) -** See Copyright Notice at the end of this file -*/ - - -#ifndef lua_h -#define lua_h - -#include -#include - - -#define LUA_COPYRIGHT LUA_RELEASE " Copyright (C) 1994-2023 Lua.org, PUC-Rio" -#define LUA_AUTHORS "R. Ierusalimschy, L. H. de Figueiredo, W. Celes" - - -#define LUA_VERSION_MAJOR_N 5 -#define LUA_VERSION_MINOR_N 5 -#define LUA_VERSION_RELEASE_N 0 - -#define LUA_VERSION_NUM (LUA_VERSION_MAJOR_N * 100 + LUA_VERSION_MINOR_N) -#define LUA_VERSION_RELEASE_NUM (LUA_VERSION_NUM * 100 + LUA_VERSION_RELEASE_N) - - -#include "luaconf.h" - - -/* mark for precompiled code ('Lua') */ -#define LUA_SIGNATURE "\x1bLua" - -/* option for multiple returns in 'lua_pcall' and 'lua_call' */ -#define LUA_MULTRET (-1) - - -/* -** Pseudo-indices -** (-LUAI_MAXSTACK is the minimum valid index; we keep some free empty -** space after that to help overflow detection) -*/ -#define LUA_REGISTRYINDEX (-LUAI_MAXSTACK - 1000) -#define lua_upvalueindex(i) (LUA_REGISTRYINDEX - (i)) - - -/* thread status */ -#define LUA_OK 0 -#define LUA_YIELD 1 -#define LUA_ERRRUN 2 -#define LUA_ERRSYNTAX 3 -#define LUA_ERRMEM 4 -#define LUA_ERRERR 5 - - -typedef struct lua_State lua_State; - - -/* -** basic types -*/ -#define LUA_TNONE (-1) - -#define LUA_TNIL 0 -#define LUA_TBOOLEAN 1 -#define LUA_TLIGHTUSERDATA 2 -#define LUA_TNUMBER 3 -#define LUA_TSTRING 4 -#define LUA_TTABLE 5 -#define LUA_TFUNCTION 6 -#define LUA_TUSERDATA 7 -#define LUA_TTHREAD 8 - -#define LUA_NUMTYPES 9 - - - -/* minimum Lua stack available to a C function */ -#define LUA_MINSTACK 20 - - -/* predefined values in the registry */ -/* index 1 is reserved for the reference mechanism */ -#define LUA_RIDX_GLOBALS 2 -#define LUA_RIDX_MAINTHREAD 3 -#define LUA_RIDX_LAST 3 - - -/* type of numbers in Lua */ -typedef LUA_NUMBER lua_Number; - - -/* type for integer functions */ -typedef LUA_INTEGER lua_Integer; - -/* unsigned integer type */ -typedef LUA_UNSIGNED lua_Unsigned; - -/* type for continuation-function contexts */ -typedef LUA_KCONTEXT lua_KContext; - - -/* -** Type for C functions registered with Lua -*/ -typedef int (*lua_CFunction) (lua_State *L); - -/* -** Type for continuation functions -*/ -typedef int (*lua_KFunction) (lua_State *L, int status, lua_KContext ctx); - - -/* -** Type for functions that read/write blocks when loading/dumping Lua chunks -*/ -typedef const char * (*lua_Reader) (lua_State *L, void *ud, size_t *sz); - -typedef int (*lua_Writer) (lua_State *L, const void *p, size_t sz, void *ud); - - -/* -** Type for memory-allocation functions -*/ -typedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize); - - -/* -** Type for warning functions -*/ -typedef void (*lua_WarnFunction) (void *ud, const char *msg, int tocont); - - -/* -** Type used by the debug API to collect debug information -*/ -typedef struct lua_Debug lua_Debug; - - -/* -** Functions to be called by the debugger in specific events -*/ -typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar); - - -/* -** generic extra include file -*/ -#if defined(LUA_USER_H) -#include LUA_USER_H -#endif - - -/* -** RCS ident string -*/ -extern const char lua_ident[]; - - -/* -** state manipulation -*/ -LUA_API lua_State *(lua_newstate) (lua_Alloc f, void *ud, unsigned seed); -LUA_API void (lua_close) (lua_State *L); -LUA_API lua_State *(lua_newthread) (lua_State *L); -LUA_API int (lua_closethread) (lua_State *L, lua_State *from); - -LUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf); - - -LUA_API lua_Number (lua_version) (lua_State *L); - - -/* -** basic stack manipulation -*/ -LUA_API int (lua_absindex) (lua_State *L, int idx); -LUA_API int (lua_gettop) (lua_State *L); -LUA_API void (lua_settop) (lua_State *L, int idx); -LUA_API void (lua_pushvalue) (lua_State *L, int idx); -LUA_API void (lua_rotate) (lua_State *L, int idx, int n); -LUA_API void (lua_copy) (lua_State *L, int fromidx, int toidx); -LUA_API int (lua_checkstack) (lua_State *L, int n); - -LUA_API void (lua_xmove) (lua_State *from, lua_State *to, int n); - - -/* -** access functions (stack -> C) -*/ - -LUA_API int (lua_isnumber) (lua_State *L, int idx); -LUA_API int (lua_isstring) (lua_State *L, int idx); -LUA_API int (lua_iscfunction) (lua_State *L, int idx); -LUA_API int (lua_isinteger) (lua_State *L, int idx); -LUA_API int (lua_isuserdata) (lua_State *L, int idx); -LUA_API int (lua_type) (lua_State *L, int idx); -LUA_API const char *(lua_typename) (lua_State *L, int tp); - -LUA_API lua_Number (lua_tonumberx) (lua_State *L, int idx, int *isnum); -LUA_API lua_Integer (lua_tointegerx) (lua_State *L, int idx, int *isnum); -LUA_API int (lua_toboolean) (lua_State *L, int idx); -LUA_API const char *(lua_tolstring) (lua_State *L, int idx, size_t *len); -LUA_API lua_Unsigned (lua_rawlen) (lua_State *L, int idx); -LUA_API lua_CFunction (lua_tocfunction) (lua_State *L, int idx); -LUA_API void *(lua_touserdata) (lua_State *L, int idx); -LUA_API lua_State *(lua_tothread) (lua_State *L, int idx); -LUA_API const void *(lua_topointer) (lua_State *L, int idx); - - -/* -** Comparison and arithmetic functions -*/ - -#define LUA_OPADD 0 /* ORDER TM, ORDER OP */ -#define LUA_OPSUB 1 -#define LUA_OPMUL 2 -#define LUA_OPMOD 3 -#define LUA_OPPOW 4 -#define LUA_OPDIV 5 -#define LUA_OPIDIV 6 -#define LUA_OPBAND 7 -#define LUA_OPBOR 8 -#define LUA_OPBXOR 9 -#define LUA_OPSHL 10 -#define LUA_OPSHR 11 -#define LUA_OPUNM 12 -#define LUA_OPBNOT 13 - -LUA_API void (lua_arith) (lua_State *L, int op); - -#define LUA_OPEQ 0 -#define LUA_OPLT 1 -#define LUA_OPLE 2 - -LUA_API int (lua_rawequal) (lua_State *L, int idx1, int idx2); -LUA_API int (lua_compare) (lua_State *L, int idx1, int idx2, int op); - - -/* -** push functions (C -> stack) -*/ -LUA_API void (lua_pushnil) (lua_State *L); -LUA_API void (lua_pushnumber) (lua_State *L, lua_Number n); -LUA_API void (lua_pushinteger) (lua_State *L, lua_Integer n); -LUA_API const char *(lua_pushlstring) (lua_State *L, const char *s, size_t len); -LUA_API const char *(lua_pushextlstring) (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud); -LUA_API const char *(lua_pushstring) (lua_State *L, const char *s); -LUA_API const char *(lua_pushvfstring) (lua_State *L, const char *fmt, - va_list argp); -LUA_API const char *(lua_pushfstring) (lua_State *L, const char *fmt, ...); -LUA_API void (lua_pushcclosure) (lua_State *L, lua_CFunction fn, int n); -LUA_API void (lua_pushboolean) (lua_State *L, int b); -LUA_API void (lua_pushlightuserdata) (lua_State *L, void *p); -LUA_API int (lua_pushthread) (lua_State *L); - - -/* -** get functions (Lua -> stack) -*/ -LUA_API int (lua_getglobal) (lua_State *L, const char *name); -LUA_API int (lua_gettable) (lua_State *L, int idx); -LUA_API int (lua_getfield) (lua_State *L, int idx, const char *k); -LUA_API int (lua_geti) (lua_State *L, int idx, lua_Integer n); -LUA_API int (lua_rawget) (lua_State *L, int idx); -LUA_API int (lua_rawgeti) (lua_State *L, int idx, lua_Integer n); -LUA_API int (lua_rawgetp) (lua_State *L, int idx, const void *p); - -LUA_API void (lua_createtable) (lua_State *L, unsigned narr, unsigned nrec); -LUA_API void *(lua_newuserdatauv) (lua_State *L, size_t sz, int nuvalue); -LUA_API int (lua_getmetatable) (lua_State *L, int objindex); -LUA_API int (lua_getiuservalue) (lua_State *L, int idx, int n); - - -/* -** set functions (stack -> Lua) -*/ -LUA_API void (lua_setglobal) (lua_State *L, const char *name); -LUA_API void (lua_settable) (lua_State *L, int idx); -LUA_API void (lua_setfield) (lua_State *L, int idx, const char *k); -LUA_API void (lua_seti) (lua_State *L, int idx, lua_Integer n); -LUA_API void (lua_rawset) (lua_State *L, int idx); -LUA_API void (lua_rawseti) (lua_State *L, int idx, lua_Integer n); -LUA_API void (lua_rawsetp) (lua_State *L, int idx, const void *p); -LUA_API int (lua_setmetatable) (lua_State *L, int objindex); -LUA_API int (lua_setiuservalue) (lua_State *L, int idx, int n); - - -/* -** 'load' and 'call' functions (load and run Lua code) -*/ -LUA_API void (lua_callk) (lua_State *L, int nargs, int nresults, - lua_KContext ctx, lua_KFunction k); -#define lua_call(L,n,r) lua_callk(L, (n), (r), 0, NULL) - -LUA_API int (lua_pcallk) (lua_State *L, int nargs, int nresults, int errfunc, - lua_KContext ctx, lua_KFunction k); -#define lua_pcall(L,n,r,f) lua_pcallk(L, (n), (r), (f), 0, NULL) - -LUA_API int (lua_load) (lua_State *L, lua_Reader reader, void *dt, - const char *chunkname, const char *mode); - -LUA_API int (lua_dump) (lua_State *L, lua_Writer writer, void *data, int strip); - - -/* -** coroutine functions -*/ -LUA_API int (lua_yieldk) (lua_State *L, int nresults, lua_KContext ctx, - lua_KFunction k); -LUA_API int (lua_resume) (lua_State *L, lua_State *from, int narg, - int *nres); -LUA_API int (lua_status) (lua_State *L); -LUA_API int (lua_isyieldable) (lua_State *L); - -#define lua_yield(L,n) lua_yieldk(L, (n), 0, NULL) - - -/* -** Warning-related functions -*/ -LUA_API void (lua_setwarnf) (lua_State *L, lua_WarnFunction f, void *ud); -LUA_API void (lua_warning) (lua_State *L, const char *msg, int tocont); - - -/* -** garbage-collection options -*/ - -#define LUA_GCSTOP 0 -#define LUA_GCRESTART 1 -#define LUA_GCCOLLECT 2 -#define LUA_GCCOUNT 3 -#define LUA_GCCOUNTB 4 -#define LUA_GCSTEP 5 -#define LUA_GCISRUNNING 6 -#define LUA_GCGEN 7 -#define LUA_GCINC 8 -#define LUA_GCPARAM 9 - - -/* -** garbage-collection parameters -*/ -/* parameters for generational mode */ -#define LUA_GCPMINORMUL 0 /* control minor collections */ -#define LUA_GCPMAJORMINOR 1 /* control shift major->minor */ -#define LUA_GCPMINORMAJOR 2 /* control shift minor->major */ - -/* parameters for incremental mode */ -#define LUA_GCPPAUSE 3 /* size of pause between successive GCs */ -#define LUA_GCPSTEPMUL 4 /* GC "speed" */ -#define LUA_GCPSTEPSIZE 5 /* GC granularity */ - -/* number of parameters */ -#define LUA_GCPN 6 - - -LUA_API int (lua_gc) (lua_State *L, int what, ...); - - -/* -** miscellaneous functions -*/ - -LUA_API int (lua_error) (lua_State *L); - -LUA_API int (lua_next) (lua_State *L, int idx); - -LUA_API void (lua_concat) (lua_State *L, int n); -LUA_API void (lua_len) (lua_State *L, int idx); - -LUA_API size_t (lua_stringtonumber) (lua_State *L, const char *s); - -LUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud); -LUA_API void (lua_setallocf) (lua_State *L, lua_Alloc f, void *ud); - -LUA_API void (lua_toclose) (lua_State *L, int idx); -LUA_API void (lua_closeslot) (lua_State *L, int idx); - - -/* -** {============================================================== -** some useful macros -** =============================================================== -*/ - -#define lua_getextraspace(L) ((void *)((char *)(L) - LUA_EXTRASPACE)) - -#define lua_tonumber(L,i) lua_tonumberx(L,(i),NULL) -#define lua_tointeger(L,i) lua_tointegerx(L,(i),NULL) - -#define lua_pop(L,n) lua_settop(L, -(n)-1) - -#define lua_newtable(L) lua_createtable(L, 0, 0) - -#define lua_register(L,n,f) (lua_pushcfunction(L, (f)), lua_setglobal(L, (n))) - -#define lua_pushcfunction(L,f) lua_pushcclosure(L, (f), 0) - -#define lua_isfunction(L,n) (lua_type(L, (n)) == LUA_TFUNCTION) -#define lua_istable(L,n) (lua_type(L, (n)) == LUA_TTABLE) -#define lua_islightuserdata(L,n) (lua_type(L, (n)) == LUA_TLIGHTUSERDATA) -#define lua_isnil(L,n) (lua_type(L, (n)) == LUA_TNIL) -#define lua_isboolean(L,n) (lua_type(L, (n)) == LUA_TBOOLEAN) -#define lua_isthread(L,n) (lua_type(L, (n)) == LUA_TTHREAD) -#define lua_isnone(L,n) (lua_type(L, (n)) == LUA_TNONE) -#define lua_isnoneornil(L, n) (lua_type(L, (n)) <= 0) - -#define lua_pushliteral(L, s) lua_pushstring(L, "" s) - -#define lua_pushglobaltable(L) \ - ((void)lua_rawgeti(L, LUA_REGISTRYINDEX, LUA_RIDX_GLOBALS)) - -#define lua_tostring(L,i) lua_tolstring(L, (i), NULL) - - -#define lua_insert(L,idx) lua_rotate(L, (idx), 1) - -#define lua_remove(L,idx) (lua_rotate(L, (idx), -1), lua_pop(L, 1)) - -#define lua_replace(L,idx) (lua_copy(L, -1, (idx)), lua_pop(L, 1)) - -/* }============================================================== */ - - -/* -** {============================================================== -** compatibility macros -** =============================================================== -*/ -#if defined(LUA_COMPAT_APIINTCASTS) - -#define lua_pushunsigned(L,n) lua_pushinteger(L, (lua_Integer)(n)) -#define lua_tounsignedx(L,i,is) ((lua_Unsigned)lua_tointegerx(L,i,is)) -#define lua_tounsigned(L,i) lua_tounsignedx(L,(i),NULL) - -#endif - -#define lua_newuserdata(L,s) lua_newuserdatauv(L,s,1) -#define lua_getuservalue(L,idx) lua_getiuservalue(L,idx,1) -#define lua_setuservalue(L,idx) lua_setiuservalue(L,idx,1) - -#define lua_resetthread(L) lua_closethread(L,NULL) - -/* }============================================================== */ - -/* -** {====================================================================== -** Debug API -** ======================================================================= -*/ - - -/* -** Event codes -*/ -#define LUA_HOOKCALL 0 -#define LUA_HOOKRET 1 -#define LUA_HOOKLINE 2 -#define LUA_HOOKCOUNT 3 -#define LUA_HOOKTAILCALL 4 - - -/* -** Event masks -*/ -#define LUA_MASKCALL (1 << LUA_HOOKCALL) -#define LUA_MASKRET (1 << LUA_HOOKRET) -#define LUA_MASKLINE (1 << LUA_HOOKLINE) -#define LUA_MASKCOUNT (1 << LUA_HOOKCOUNT) - - -LUA_API int (lua_getstack) (lua_State *L, int level, lua_Debug *ar); -LUA_API int (lua_getinfo) (lua_State *L, const char *what, lua_Debug *ar); -LUA_API const char *(lua_getlocal) (lua_State *L, const lua_Debug *ar, int n); -LUA_API const char *(lua_setlocal) (lua_State *L, const lua_Debug *ar, int n); -LUA_API const char *(lua_getupvalue) (lua_State *L, int funcindex, int n); -LUA_API const char *(lua_setupvalue) (lua_State *L, int funcindex, int n); - -LUA_API void *(lua_upvalueid) (lua_State *L, int fidx, int n); -LUA_API void (lua_upvaluejoin) (lua_State *L, int fidx1, int n1, - int fidx2, int n2); - -LUA_API void (lua_sethook) (lua_State *L, lua_Hook func, int mask, int count); -LUA_API lua_Hook (lua_gethook) (lua_State *L); -LUA_API int (lua_gethookmask) (lua_State *L); -LUA_API int (lua_gethookcount) (lua_State *L); - - -struct lua_Debug { - int event; - const char *name; /* (n) */ - const char *namewhat; /* (n) 'global', 'local', 'field', 'method' */ - const char *what; /* (S) 'Lua', 'C', 'main', 'tail' */ - const char *source; /* (S) */ - size_t srclen; /* (S) */ - int currentline; /* (l) */ - int linedefined; /* (S) */ - int lastlinedefined; /* (S) */ - unsigned char nups; /* (u) number of upvalues */ - unsigned char nparams;/* (u) number of parameters */ - char isvararg; /* (u) */ - char istailcall; /* (t) */ - unsigned short ftransfer; /* (r) index of first value transferred */ - unsigned short ntransfer; /* (r) number of transferred values */ - char short_src[LUA_IDSIZE]; /* (S) */ - /* private part */ - struct CallInfo *i_ci; /* active function */ -}; - -/* }====================================================================== */ - - -#define LUAI_TOSTRAUX(x) #x -#define LUAI_TOSTR(x) LUAI_TOSTRAUX(x) - -#define LUA_VERSION_MAJOR LUAI_TOSTR(LUA_VERSION_MAJOR_N) -#define LUA_VERSION_MINOR LUAI_TOSTR(LUA_VERSION_MINOR_N) -#define LUA_VERSION_RELEASE LUAI_TOSTR(LUA_VERSION_RELEASE_N) - -#define LUA_VERSION "Lua " LUA_VERSION_MAJOR "." LUA_VERSION_MINOR -#define LUA_RELEASE LUA_VERSION "." LUA_VERSION_RELEASE - - -/****************************************************************************** -* Copyright (C) 1994-2023 Lua.org, PUC-Rio. -* -* Permission is hereby granted, free of charge, to any person obtaining -* a copy of this software and associated documentation files (the -* "Software"), to deal in the Software without restriction, including -* without limitation the rights to use, copy, modify, merge, publish, -* distribute, sublicense, and/or sell copies of the Software, and to -* permit persons to whom the Software is furnished to do so, subject to -* the following conditions: -* -* The above copyright notice and this permission notice shall be -* included in all copies or substantial portions of the Software. -* -* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. -* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY -* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, -* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE -* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. -******************************************************************************/ - - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/luaconf.h b/build/c/dependencies/luaCEmbed/dependencies/lua/luaconf.h deleted file mode 100644 index aea48de..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/luaconf.h +++ /dev/null @@ -1,802 +0,0 @@ -/* -** $Id: luaconf.h $ -** Configuration file for Lua -** See Copyright Notice in lua.h -*/ - - -#ifndef luaconf_h -#define luaconf_h - -#include -#include - - -/* -** =================================================================== -** General Configuration File for Lua -** -** Some definitions here can be changed externally, through the compiler -** (e.g., with '-D' options): They are commented out or protected -** by '#if !defined' guards. However, several other definitions -** should be changed directly here, either because they affect the -** Lua ABI (by making the changes here, you ensure that all software -** connected to Lua, such as C libraries, will be compiled with the same -** configuration); or because they are seldom changed. -** -** Search for "@@" to find all configurable definitions. -** =================================================================== -*/ - - -/* -** {==================================================================== -** System Configuration: macros to adapt (if needed) Lua to some -** particular platform, for instance restricting it to C89. -** ===================================================================== -*/ - -/* -@@ LUA_USE_C89 controls the use of non-ISO-C89 features. -** Define it if you want Lua to avoid the use of a few C99 features -** or Windows-specific features on Windows. -*/ -/* #define LUA_USE_C89 */ - - -/* -** By default, Lua on Windows use (some) specific Windows features -*/ -#if !defined(LUA_USE_C89) && defined(_WIN32) && !defined(_WIN32_WCE) -#define LUA_USE_WINDOWS /* enable goodies for regular Windows */ -#endif - - -#if defined(LUA_USE_WINDOWS) -#define LUA_DL_DLL /* enable support for DLL */ -#define LUA_USE_C89 /* broadly, Windows is C89 */ -#endif - - -#if defined(LUA_USE_LINUX) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN /* needs an extra library: -ldl */ -#endif - - -#if defined(LUA_USE_MACOSX) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN /* MacOS does not need -ldl */ -#endif - - -#if defined(LUA_USE_IOS) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN -#endif - - -/* -@@ LUAI_IS32INT is true iff 'int' has (at least) 32 bits. -*/ -#define LUAI_IS32INT ((UINT_MAX >> 30) >= 3) - -/* }================================================================== */ - - - -/* -** {================================================================== -** Configuration for Number types. These options should not be -** set externally, because any other code connected to Lua must -** use the same configuration. -** =================================================================== -*/ - -/* -@@ LUA_INT_TYPE defines the type for Lua integers. -@@ LUA_FLOAT_TYPE defines the type for Lua floats. -** Lua should work fine with any mix of these options supported -** by your C compiler. The usual configurations are 64-bit integers -** and 'double' (the default), 32-bit integers and 'float' (for -** restricted platforms), and 'long'/'double' (for C compilers not -** compliant with C99, which may not have support for 'long long'). -*/ - -/* predefined options for LUA_INT_TYPE */ -#define LUA_INT_INT 1 -#define LUA_INT_LONG 2 -#define LUA_INT_LONGLONG 3 - -/* predefined options for LUA_FLOAT_TYPE */ -#define LUA_FLOAT_FLOAT 1 -#define LUA_FLOAT_DOUBLE 2 -#define LUA_FLOAT_LONGDOUBLE 3 - - -/* Default configuration ('long long' and 'double', for 64-bit Lua) */ -#define LUA_INT_DEFAULT LUA_INT_LONGLONG -#define LUA_FLOAT_DEFAULT LUA_FLOAT_DOUBLE - - -/* -@@ LUA_32BITS enables Lua with 32-bit integers and 32-bit floats. -*/ -#define LUA_32BITS 0 - - -/* -@@ LUA_C89_NUMBERS ensures that Lua uses the largest types available for -** C89 ('long' and 'double'); Windows always has '__int64', so it does -** not need to use this case. -*/ -#if defined(LUA_USE_C89) && !defined(LUA_USE_WINDOWS) -#define LUA_C89_NUMBERS 1 -#else -#define LUA_C89_NUMBERS 0 -#endif - - -#if LUA_32BITS /* { */ -/* -** 32-bit integers and 'float' -*/ -#if LUAI_IS32INT /* use 'int' if big enough */ -#define LUA_INT_TYPE LUA_INT_INT -#else /* otherwise use 'long' */ -#define LUA_INT_TYPE LUA_INT_LONG -#endif -#define LUA_FLOAT_TYPE LUA_FLOAT_FLOAT - -#elif LUA_C89_NUMBERS /* }{ */ -/* -** largest types available for C89 ('long' and 'double') -*/ -#define LUA_INT_TYPE LUA_INT_LONG -#define LUA_FLOAT_TYPE LUA_FLOAT_DOUBLE - -#else /* }{ */ -/* use defaults */ - -#define LUA_INT_TYPE LUA_INT_DEFAULT -#define LUA_FLOAT_TYPE LUA_FLOAT_DEFAULT - -#endif /* } */ - - -/* }================================================================== */ - - - -/* -** {================================================================== -** Configuration for Paths. -** =================================================================== -*/ - -/* -** LUA_PATH_SEP is the character that separates templates in a path. -** LUA_PATH_MARK is the string that marks the substitution points in a -** template. -** LUA_EXEC_DIR in a Windows path is replaced by the executable's -** directory. -*/ -#define LUA_PATH_SEP ";" -#define LUA_PATH_MARK "?" -#define LUA_EXEC_DIR "!" - - -/* -@@ LUA_PATH_DEFAULT is the default path that Lua uses to look for -** Lua libraries. -@@ LUA_CPATH_DEFAULT is the default path that Lua uses to look for -** C libraries. -** CHANGE them if your machine has a non-conventional directory -** hierarchy or if you want to install your libraries in -** non-conventional directories. -*/ - -#define LUA_VDIR LUA_VERSION_MAJOR "." LUA_VERSION_MINOR -#if defined(_WIN32) /* { */ -/* -** In Windows, any exclamation mark ('!') in the path is replaced by the -** path of the directory of the executable file of the current process. -*/ -#define LUA_LDIR "!\\lua\\" -#define LUA_CDIR "!\\" -#define LUA_SHRDIR "!\\..\\share\\lua\\" LUA_VDIR "\\" - -#if !defined(LUA_PATH_DEFAULT) -#define LUA_PATH_DEFAULT \ - LUA_LDIR"?.lua;" LUA_LDIR"?\\init.lua;" \ - LUA_CDIR"?.lua;" LUA_CDIR"?\\init.lua;" \ - LUA_SHRDIR"?.lua;" LUA_SHRDIR"?\\init.lua;" \ - ".\\?.lua;" ".\\?\\init.lua" -#endif - -#if !defined(LUA_CPATH_DEFAULT) -#define LUA_CPATH_DEFAULT \ - LUA_CDIR"?.dll;" \ - LUA_CDIR"..\\lib\\lua\\" LUA_VDIR "\\?.dll;" \ - LUA_CDIR"loadall.dll;" ".\\?.dll" -#endif - -#else /* }{ */ - -#define LUA_ROOT "/usr/local/" -#define LUA_LDIR LUA_ROOT "share/lua/" LUA_VDIR "/" -#define LUA_CDIR LUA_ROOT "lib/lua/" LUA_VDIR "/" - -#if !defined(LUA_PATH_DEFAULT) -#define LUA_PATH_DEFAULT \ - LUA_LDIR"?.lua;" LUA_LDIR"?/init.lua;" \ - LUA_CDIR"?.lua;" LUA_CDIR"?/init.lua;" \ - "./?.lua;" "./?/init.lua" -#endif - -#if !defined(LUA_CPATH_DEFAULT) -#define LUA_CPATH_DEFAULT \ - LUA_CDIR"?.so;" LUA_CDIR"loadall.so;" "./?.so" -#endif - -#endif /* } */ - - -/* -@@ LUA_DIRSEP is the directory separator (for submodules). -** CHANGE it if your machine does not use "/" as the directory separator -** and is not Windows. (On Windows Lua automatically uses "\".) -*/ -#if !defined(LUA_DIRSEP) - -#if defined(_WIN32) -#define LUA_DIRSEP "\\" -#else -#define LUA_DIRSEP "/" -#endif - -#endif - - -/* -** LUA_IGMARK is a mark to ignore all after it when building the -** module name (e.g., used to build the luaopen_ function name). -** Typically, the sufix after the mark is the module version, -** as in "mod-v1.2.so". -*/ -#define LUA_IGMARK "-" - -/* }================================================================== */ - - -/* -** {================================================================== -** Marks for exported symbols in the C code -** =================================================================== -*/ - -/* -@@ LUA_API is a mark for all core API functions. -@@ LUALIB_API is a mark for all auxiliary library functions. -@@ LUAMOD_API is a mark for all standard library opening functions. -** CHANGE them if you need to define those functions in some special way. -** For instance, if you want to create one Windows DLL with the core and -** the libraries, you may want to use the following definition (define -** LUA_BUILD_AS_DLL to get it). -*/ -#if defined(LUA_BUILD_AS_DLL) /* { */ - -#if defined(LUA_CORE) || defined(LUA_LIB) /* { */ -#define LUA_API __declspec(dllexport) -#else /* }{ */ -#define LUA_API __declspec(dllimport) -#endif /* } */ - -#else /* }{ */ - -#define LUA_API extern - -#endif /* } */ - - -/* -** More often than not the libs go together with the core. -*/ -#define LUALIB_API LUA_API -#define LUAMOD_API LUA_API - - -/* -@@ LUAI_FUNC is a mark for all extern functions that are not to be -** exported to outside modules. -@@ LUAI_DDEF and LUAI_DDEC are marks for all extern (const) variables, -** none of which to be exported to outside modules (LUAI_DDEF for -** definitions and LUAI_DDEC for declarations). -** CHANGE them if you need to mark them in some special way. Elf/gcc -** (versions 3.2 and later) mark them as "hidden" to optimize access -** when Lua is compiled as a shared library. Not all elf targets support -** this attribute. Unfortunately, gcc does not offer a way to check -** whether the target offers that support, and those without support -** give a warning about it. To avoid these warnings, change to the -** default definition. -*/ -#if defined(__GNUC__) && ((__GNUC__*100 + __GNUC_MINOR__) >= 302) && \ - defined(__ELF__) /* { */ -#define LUAI_FUNC __attribute__((visibility("internal"))) extern -#else /* }{ */ -#define LUAI_FUNC extern -#endif /* } */ - -#define LUAI_DDEC(dec) LUAI_FUNC dec -#define LUAI_DDEF /* empty */ - -/* }================================================================== */ - - -/* -** {================================================================== -** Compatibility with previous versions -** =================================================================== -*/ - -/* -@@ LUA_COMPAT_5_3 controls other macros for compatibility with Lua 5.3. -** You can define it to get all options, or change specific options -** to fit your specific needs. -*/ -#if defined(LUA_COMPAT_5_3) /* { */ - -/* -@@ LUA_COMPAT_MATHLIB controls the presence of several deprecated -** functions in the mathematical library. -** (These functions were already officially removed in 5.3; -** nevertheless they are still available here.) -*/ -#define LUA_COMPAT_MATHLIB - -/* -@@ LUA_COMPAT_APIINTCASTS controls the presence of macros for -** manipulating other integer types (lua_pushunsigned, lua_tounsigned, -** luaL_checkint, luaL_checklong, etc.) -** (These macros were also officially removed in 5.3, but they are still -** available here.) -*/ -#define LUA_COMPAT_APIINTCASTS - - -/* -@@ LUA_COMPAT_LT_LE controls the emulation of the '__le' metamethod -** using '__lt'. -*/ -#define LUA_COMPAT_LT_LE - - -/* -@@ The following macros supply trivial compatibility for some -** changes in the API. The macros themselves document how to -** change your code to avoid using them. -** (Once more, these macros were officially removed in 5.3, but they are -** still available here.) -*/ -#define lua_strlen(L,i) lua_rawlen(L, (i)) - -#define lua_objlen(L,i) lua_rawlen(L, (i)) - -#define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ) -#define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT) - -#endif /* } */ - -/* }================================================================== */ - - - -/* -** {================================================================== -** Configuration for Numbers (low-level part). -** Change these definitions if no predefined LUA_FLOAT_* / LUA_INT_* -** satisfy your needs. -** =================================================================== -*/ - -/* -@@ LUAI_UACNUMBER is the result of a 'default argument promotion' -@@ over a floating number. -@@ l_floatatt(x) corrects float attribute 'x' to the proper float type -** by prefixing it with one of FLT/DBL/LDBL. -@@ LUA_NUMBER_FRMLEN is the length modifier for writing floats. -@@ LUA_NUMBER_FMT is the format for writing floats. -@@ lua_number2str converts a float to a string. -@@ l_mathop allows the addition of an 'l' or 'f' to all math operations. -@@ l_floor takes the floor of a float. -@@ lua_str2number converts a decimal numeral to a number. -*/ - - -/* The following definitions are good for most cases here */ - -#define l_floor(x) (l_mathop(private_lua_embed_floor)(x)) - -#define lua_number2str(s,sz,n) \ - l_sprintf((s), sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)(n)) - -/* -@@ lua_numbertointeger converts a float number with an integral value -** to an integer, or returns 0 if float is not within the range of -** a lua_Integer. (The range comparisons are tricky because of -** rounding. The tests here assume a two-complement representation, -** where MININTEGER always has an exact representation as a float; -** MAXINTEGER may not have one, and therefore its conversion to float -** may have an ill-defined value.) -*/ -#define lua_numbertointeger(n,p) \ - ((n) >= (LUA_NUMBER)(LUA_MININTEGER) && \ - (n) < -(LUA_NUMBER)(LUA_MININTEGER) && \ - (*(p) = (LUA_INTEGER)(n), 1)) - - -/* now the variable definitions */ - -#if LUA_FLOAT_TYPE == LUA_FLOAT_FLOAT /* { single float */ - -#define LUA_NUMBER float - -#define l_floatatt(n) (FLT_##n) - -#define LUAI_UACNUMBER double - -#define LUA_NUMBER_FRMLEN "" -#define LUA_NUMBER_FMT "%.7g" - -#define l_mathop(op) op##f - -#define lua_str2number(s,p) strtof((s), (p)) - - -#elif LUA_FLOAT_TYPE == LUA_FLOAT_LONGDOUBLE /* }{ long double */ - -#define LUA_NUMBER long double - -#define l_floatatt(n) (LDBL_##n) - -#define LUAI_UACNUMBER long double - -#define LUA_NUMBER_FRMLEN "L" -#define LUA_NUMBER_FMT "%.19Lg" - -#define l_mathop(op) op##l - -#define lua_str2number(s,p) strtold((s), (p)) - -#elif LUA_FLOAT_TYPE == LUA_FLOAT_DOUBLE /* }{ double */ - -#define LUA_NUMBER double - -#define l_floatatt(n) (DBL_##n) - -#define LUAI_UACNUMBER double - -#define LUA_NUMBER_FRMLEN "" -#define LUA_NUMBER_FMT "%.14g" - -#define l_mathop(op) op - -#define lua_str2number(s,p) strtod((s), (p)) - -#else /* }{ */ - -#error "numeric float type not defined" - -#endif /* } */ - - - -/* -@@ LUA_UNSIGNED is the unsigned version of LUA_INTEGER. -@@ LUAI_UACINT is the result of a 'default argument promotion' -@@ over a LUA_INTEGER. -@@ LUA_INTEGER_FRMLEN is the length modifier for reading/writing integers. -@@ LUA_INTEGER_FMT is the format for writing integers. -@@ LUA_MAXINTEGER is the maximum value for a LUA_INTEGER. -@@ LUA_MININTEGER is the minimum value for a LUA_INTEGER. -@@ LUA_MAXUNSIGNED is the maximum value for a LUA_UNSIGNED. -@@ lua_integer2str converts an integer to a string. -*/ - - -/* The following definitions are good for most cases here */ - -#define LUA_INTEGER_FMT "%" LUA_INTEGER_FRMLEN "d" - -#define LUAI_UACINT LUA_INTEGER - -#define lua_integer2str(s,sz,n) \ - l_sprintf((s), sz, LUA_INTEGER_FMT, (LUAI_UACINT)(n)) - -/* -** use LUAI_UACINT here to avoid problems with promotions (which -** can turn a comparison between unsigneds into a signed comparison) -*/ -#define LUA_UNSIGNED unsigned LUAI_UACINT - - -/* now the variable definitions */ - -#if LUA_INT_TYPE == LUA_INT_INT /* { int */ - -#define LUA_INTEGER int -#define LUA_INTEGER_FRMLEN "" - -#define LUA_MAXINTEGER INT_MAX -#define LUA_MININTEGER INT_MIN - -#define LUA_MAXUNSIGNED UINT_MAX - -#elif LUA_INT_TYPE == LUA_INT_LONG /* }{ long */ - -#define LUA_INTEGER long -#define LUA_INTEGER_FRMLEN "l" - -#define LUA_MAXINTEGER LONG_MAX -#define LUA_MININTEGER LONG_MIN - -#define LUA_MAXUNSIGNED ULONG_MAX - -#elif LUA_INT_TYPE == LUA_INT_LONGLONG /* }{ long long */ - -/* use presence of macro LLONG_MAX as proxy for C99 compliance */ -#if defined(LLONG_MAX) /* { */ -/* use ISO C99 stuff */ - -#define LUA_INTEGER long long -#define LUA_INTEGER_FRMLEN "ll" - -#define LUA_MAXINTEGER LLONG_MAX -#define LUA_MININTEGER LLONG_MIN - -#define LUA_MAXUNSIGNED ULLONG_MAX - -#elif defined(LUA_USE_WINDOWS) /* }{ */ -/* in Windows, can use specific Windows types */ - -#define LUA_INTEGER __int64 -#define LUA_INTEGER_FRMLEN "I64" - -#define LUA_MAXINTEGER _I64_MAX -#define LUA_MININTEGER _I64_MIN - -#define LUA_MAXUNSIGNED _UI64_MAX - -#else /* }{ */ - -#error "Compiler does not support 'long long'. Use option '-DLUA_32BITS' \ - or '-DLUA_C89_NUMBERS' (see file 'luaconf.h' for details)" - -#endif /* } */ - -#else /* }{ */ - -#error "numeric integer type not defined" - -#endif /* } */ - -/* }================================================================== */ - - -/* -** {================================================================== -** Dependencies with C99 and other C details -** =================================================================== -*/ - -/* -@@ l_sprintf is equivalent to 'snprintf' or 'sprintf' in C89. -** (All uses in Lua have only one format item.) -*/ -#if !defined(LUA_USE_C89) -#define l_sprintf(s,sz,f,i) snprintf(s,sz,f,i) -#else -#define l_sprintf(s,sz,f,i) ((void)(sz), sprintf(s,f,i)) -#endif - - -/* -@@ lua_strx2number converts a hexadecimal numeral to a number. -** In C99, 'strtod' does that conversion. Otherwise, you can -** leave 'lua_strx2number' undefined and Lua will provide its own -** implementation. -*/ -#if !defined(LUA_USE_C89) -#define lua_strx2number(s,p) lua_str2number(s,p) -#endif - - -/* -@@ lua_pointer2str converts a pointer to a readable string in a -** non-specified way. -*/ -#define lua_pointer2str(buff,sz,p) l_sprintf(buff,sz,"%p",p) - - -/* -@@ lua_number2strx converts a float to a hexadecimal numeral. -** In C99, 'sprintf' (with format specifiers '%a'/'%A') does that. -** Otherwise, you can leave 'lua_number2strx' undefined and Lua will -** provide its own implementation. -*/ -#if !defined(LUA_USE_C89) -#define lua_number2strx(L,b,sz,f,n) \ - ((void)L, l_sprintf(b,sz,f,(LUAI_UACNUMBER)(n))) -#endif - - -/* -** 'strtof' and 'opf' variants for math functions are not valid in -** C89. Otherwise, the macro 'HUGE_VALF' is a good proxy for testing the -** availability of these variants. ('math.h' is already included in -** all files that use these macros.) -*/ -#if defined(LUA_USE_C89) || (defined(HUGE_VAL) && !defined(HUGE_VALF)) -#undef l_mathop /* variants not available */ -#undef lua_str2number -#define l_mathop(op) (lua_Number)op /* no variant */ -#define lua_str2number(s,p) ((lua_Number)strtod((s), (p))) -#endif - - -/* -@@ LUA_KCONTEXT is the type of the context ('ctx') for continuation -** functions. It must be a numerical type; Lua will use 'intptr_t' if -** available, otherwise it will use 'ptrdiff_t' (the nearest thing to -** 'intptr_t' in C89) -*/ -#define LUA_KCONTEXT ptrdiff_t - -#if !defined(LUA_USE_C89) && defined(__STDC_VERSION__) && \ - __STDC_VERSION__ >= 199901L -#include -#if defined(INTPTR_MAX) /* even in C99 this type is optional */ -#undef LUA_KCONTEXT -#define LUA_KCONTEXT intptr_t -#endif -#endif - - -/* -@@ lua_getlocaledecpoint gets the locale "radix character" (decimal point). -** Change that if you do not want to use C locales. (Code using this -** macro must include the header 'locale.h'.) -*/ -#if !defined(lua_getlocaledecpoint) -#define lua_getlocaledecpoint() (localeconv()->decimal_point[0]) -#endif - - -/* -** macros to improve jump prediction, used mostly for error handling -** and debug facilities. (Some macros in the Lua API use these macros. -** Define LUA_NOBUILTIN if you do not want '__builtin_expect' in your -** code.) -*/ -#if !defined(luai_likely) - -#if defined(__GNUC__) && !defined(LUA_NOBUILTIN) -#define luai_likely(x) (__builtin_expect(((x) != 0), 1)) -#define luai_unlikely(x) (__builtin_expect(((x) != 0), 0)) -#else -#define luai_likely(x) (x) -#define luai_unlikely(x) (x) -#endif - -#endif - - -#if defined(LUA_CORE) || defined(LUA_LIB) -/* shorter names for Lua's own use */ -#define l_likely(x) luai_likely(x) -#define l_unlikely(x) luai_unlikely(x) -#endif - - - -/* }================================================================== */ - - -/* -** {================================================================== -** Language Variations -** ===================================================================== -*/ - -/* -@@ LUA_NOCVTN2S/LUA_NOCVTS2N control how Lua performs some -** coercions. Define LUA_NOCVTN2S to turn off automatic coercion from -** numbers to strings. Define LUA_NOCVTS2N to turn off automatic -** coercion from strings to numbers. -*/ -/* #define LUA_NOCVTN2S */ -/* #define LUA_NOCVTS2N */ - - -/* -@@ LUA_USE_APICHECK turns on several consistency checks on the C API. -** Define it as a help when debugging C code. -*/ -#if defined(LUA_USE_APICHECK) -#include -#define luai_apicheck(l,e) assert(e) -#endif - -/* }================================================================== */ - - -/* -** {================================================================== -** Macros that affect the API and must be stable (that is, must be the -** same when you compile Lua and when you compile code that links to -** Lua). -** ===================================================================== -*/ - -/* -@@ LUAI_MAXSTACK limits the size of the Lua stack. -** CHANGE it if you need a different limit. This limit is arbitrary; -** its only purpose is to stop Lua from consuming unlimited stack -** space (and to reserve some numbers for pseudo-indices). -** (It must fit into max(size_t)/32 and max(int)/2.) -*/ -#if LUAI_IS32INT -#define LUAI_MAXSTACK 1000000 -#else -#define LUAI_MAXSTACK 15000 -#endif - - -/* -@@ LUA_EXTRASPACE defines the size of a raw memory area associated with -** a Lua state with very fast access. -** CHANGE it if you need a different size. -*/ -#define LUA_EXTRASPACE (sizeof(void *)) - - -/* -@@ LUA_IDSIZE gives the maximum size for the description of the source -** of a function in debug information. -** CHANGE it if you want a different size. -*/ -#define LUA_IDSIZE 60 - - -/* -@@ LUAL_BUFFERSIZE is the initial buffer size used by the lauxlib -** buffer system. -*/ -#define LUAL_BUFFERSIZE ((int)(16 * sizeof(void*) * sizeof(lua_Number))) - - -/* -@@ LUAI_MAXALIGN defines fields that, when used in a union, ensure -** maximum alignment for the other items in that union. -*/ -#define LUAI_MAXALIGN lua_Number n; double u; void *s; lua_Integer i; long l - -/* }================================================================== */ - - - - - -/* =================================================================== */ - -/* -** Local configuration. You can use this space to add your redefinitions -** without modifying the main part of the file. -*/ - - - - - -#endif - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lualib.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lualib.h deleted file mode 100644 index 068f60a..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lualib.h +++ /dev/null @@ -1,65 +0,0 @@ -/* -** $Id: lualib.h $ -** Lua standard libraries -** See Copyright Notice in lua.h -*/ - - -#ifndef lualib_h -#define lualib_h - -#include "lua.h" - - -/* version suffix for environment variable names */ -#define LUA_VERSUFFIX "_" LUA_VERSION_MAJOR "_" LUA_VERSION_MINOR - -#define LUA_GLIBK 1 -LUAMOD_API int (luaopen_base) (lua_State *L); - -#define LUA_LOADLIBNAME "package" -#define LUA_LOADLIBK (LUA_GLIBK << 1) -LUAMOD_API int (luaopen_package) (lua_State *L); - - -#define LUA_COLIBNAME "coroutine" -#define LUA_COLIBK (LUA_LOADLIBK << 1) -LUAMOD_API int (luaopen_coroutine) (lua_State *L); - -#define LUA_DBLIBNAME "debug" -#define LUA_DBLIBK (LUA_COLIBK << 1) -LUAMOD_API int (luaopen_debug) (lua_State *L); - -#define LUA_IOLIBNAME "io" -#define LUA_IOLIBK (LUA_DBLIBK << 1) -LUAMOD_API int (luaopen_io) (lua_State *L); - -#define LUA_MATHLIBNAME "math" -#define LUA_MATHLIBK (LUA_IOLIBK << 1) -LUAMOD_API int (luaopen_math) (lua_State *L); - -#define LUA_OSLIBNAME "os" -#define LUA_OSLIBK (LUA_MATHLIBK << 1) -LUAMOD_API int (luaopen_os) (lua_State *L); - -#define LUA_STRLIBNAME "string" -#define LUA_STRLIBK (LUA_OSLIBK << 1) -LUAMOD_API int (luaopen_string) (lua_State *L); - -#define LUA_TABLIBNAME "table" -#define LUA_TABLIBK (LUA_STRLIBK << 1) -LUAMOD_API int (luaopen_table) (lua_State *L); - -#define LUA_UTF8LIBNAME "utf8" -#define LUA_UTF8LIBK (LUA_TABLIBK << 1) -LUAMOD_API int (luaopen_utf8) (lua_State *L); - - -/* open selected libraries */ -LUALIB_API void (luaL_openselectedlibs) (lua_State *L, int load, int preload); - -/* open all libraries */ -#define luaL_openlibs(L) luaL_openselectedlibs(L, ~0, 0) - - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lundump.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lundump.c deleted file mode 100644 index ed03ab8..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lundump.c +++ /dev/null @@ -1,405 +0,0 @@ -/* -** $Id: lundump.c $ -** load precompiled Lua chunks -** See Copyright Notice in lua.h -*/ - -#define lundump_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstring.h" -#include "ltable.h" -#include "lundump.h" -#include "lzio.h" - - -#if !defined(luai_verifycode) -#define luai_verifycode(L,f) /* empty */ -#endif - - -typedef struct { - lua_State *L; - ZIO *Z; - const char *name; - Table *h; /* list for string reuse */ - lu_mem offset; /* current position relative to beginning of dump */ - lua_Integer nstr; /* number of strings in the list */ - lu_byte fixed; /* dump is fixed in memory */ -} LoadState; - - -static l_noret private_lua_error (LoadState *S, const char *why) { - luaO_pushfstring(S->L, "%s: bad binary format (%s)", S->name, why); - luaD_throw(S->L, LUA_ERRSYNTAX); -} - - -/* -** All high-level loads go through loadVector; you can change it to -** adapt to the endianness of the input -*/ -#define loadVector(S,b,n) loadBlock(S,b,(n)*sizeof((b)[0])) - -static void loadBlock (LoadState *S, void *b, size_t size) { - if (luaZ_read(S->Z, b, size) != 0) - private_lua_error(S, "truncated chunk"); - S->offset += size; -} - - -static void loadAlign (LoadState *S, int align) { - int padding = align - (S->offset % align); - if (padding < align) { /* apd == align means no padding */ - lua_Integer paddingContent; - loadBlock(S, &paddingContent, padding); - lua_assert(S->offset % align == 0); - } -} - - -#define getaddr(S,n,t) cast(t *, getaddr_(S,(n) * sizeof(t))) - -static const void *getaddr_ (LoadState *S, size_t size) { - const void *block = luaZ_getaddr(S->Z, size); - S->offset += size; - if (block == NULL) - private_lua_error(S, "truncated fixed buffer"); - return block; -} - - -#define loadVar(S,x) loadVector(S,&x,1) - - -static lu_byte loadByte (LoadState *S) { - int b = zgetc(S->Z); - if (b == EOZ) - private_lua_error(S, "truncated chunk"); - S->offset++; - return cast_byte(b); -} - - -static size_t loadVarint (LoadState *S, size_t limit) { - size_t x = 0; - int b; - limit >>= 7; - do { - b = loadByte(S); - if (x > limit) - private_lua_error(S, "integer overflow"); - x = (x << 7) | (b & 0x7f); - } while ((b & 0x80) != 0); - return x; -} - - -static size_t loadSize (LoadState *S) { - return loadVarint(S, MAX_SIZET); -} - - -static int loadInt (LoadState *S) { - return cast_int(loadVarint(S, cast_sizet(INT_MAX))); -} - - -static lua_Number loadNumber (LoadState *S) { - lua_Number x; - loadVar(S, x); - return x; -} - - -static lua_Integer loadInteger (LoadState *S) { - lua_Integer x; - loadVar(S, x); - return x; -} - - -/* -** Load a nullable string into slot 'sl' from prototype 'p'. The -** assignment to the slot and the barrier must be performed before any -** possible GC activity, to anchor the string. (Both 'loadVector' and -** 'luaH_setint' can call the GC.) -*/ -static void loadString (LoadState *S, Proto *p, TString **sl) { - lua_State *L = S->L; - TString *ts; - TValue sv; - size_t size = loadSize(S); - if (size == 0) { /* no string? */ - lua_assert(*sl == NULL); /* must be prefilled */ - return; - } - else if (size == 1) { /* previously saved string? */ - lua_Integer idx = cast(lua_Integer, loadSize(S)); /* get its index */ - TValue stv; - luaH_getint(S->h, idx, &stv); /* get its value */ - *sl = ts = tsvalue(&stv); - luaC_objbarrier(L, p, ts); - return; /* do not save it again */ - } - else if ((size -= 2) <= LUAI_MAXSHORTLEN) { /* short string? */ - char buff[LUAI_MAXSHORTLEN + 1]; /* extra space for '\0' */ - loadVector(S, buff, size + 1); /* load string into buffer */ - *sl = ts = luaS_newlstr(L, buff, size); /* create string */ - luaC_objbarrier(L, p, ts); - } - else if (S->fixed) { /* for a fixed buffer, use a fixed string */ - const char *s = getaddr(S, size + 1, char); /* get content address */ - *sl = ts = luaS_newextlstr(L, s, size, NULL, NULL); - luaC_objbarrier(L, p, ts); - } - else { /* create internal copy */ - *sl = ts = luaS_createlngstrobj(L, size); /* create string */ - luaC_objbarrier(L, p, ts); - loadVector(S, getlngstr(ts), size + 1); /* load directly in final place */ - } - /* add string to list of saved strings */ - S->nstr++; - setsvalue(L, &sv, ts); - luaH_setint(L, S->h, S->nstr, &sv); - luaC_objbarrierback(L, obj2gco(S->h), ts); -} - - -static void loadCode (LoadState *S, Proto *f) { - int n = loadInt(S); - loadAlign(S, sizeof(f->code[0])); - if (S->fixed) { - f->code = getaddr(S, n, Instruction); - f->sizecode = n; - } - else { - f->code = luaM_newvectorchecked(S->L, n, Instruction); - f->sizecode = n; - loadVector(S, f->code, n); - } -} - - -static void loadFunction(LoadState *S, Proto *f); - - -static void loadConstants (LoadState *S, Proto *f) { - int i; - int n = loadInt(S); - f->k = luaM_newvectorchecked(S->L, n, TValue); - f->sizek = n; - for (i = 0; i < n; i++) - setnilvalue(&f->k[i]); - for (i = 0; i < n; i++) { - TValue *o = &f->k[i]; - int t = loadByte(S); - switch (t) { - case LUA_VNIL: - setnilvalue(o); - break; - case LUA_VFALSE: - setbfvalue(o); - break; - case LUA_VTRUE: - setbtvalue(o); - break; - case LUA_VNUMFLT: - setfltvalue(o, loadNumber(S)); - break; - case LUA_VNUMINT: - setivalue(o, loadInteger(S)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - lua_assert(f->source == NULL); - loadString(S, f, &f->source); /* use 'source' to anchor string */ - if (f->source == NULL) - private_lua_error(S, "bad format for constant string"); - setsvalue2n(S->L, o, f->source); /* save it in the right place */ - f->source = NULL; - break; - } - default: lua_assert(0); - } - } -} - - -static void loadProtos (LoadState *S, Proto *f) { - int i; - int n = loadInt(S); - f->p = luaM_newvectorchecked(S->L, n, Proto *); - f->sizep = n; - for (i = 0; i < n; i++) - f->p[i] = NULL; - for (i = 0; i < n; i++) { - f->p[i] = luaF_newproto(S->L); - luaC_objbarrier(S->L, f, f->p[i]); - loadFunction(S, f->p[i]); - } -} - - -/* -** Load the upvalues for a function. The names must be filled first, -** because the filling of the other fields can raise read errors and -** the creation of the error message can call an emergency collection; -** in that case all prototypes must be consistent for the GC. -*/ -static void loadUpvalues (LoadState *S, Proto *f) { - int i, n; - n = loadInt(S); - f->upvalues = luaM_newvectorchecked(S->L, n, Upvaldesc); - f->sizeupvalues = n; - for (i = 0; i < n; i++) /* make array valid for GC */ - f->upvalues[i].name = NULL; - for (i = 0; i < n; i++) { /* following calls can raise errors */ - f->upvalues[i].instack = loadByte(S); - f->upvalues[i].idx = loadByte(S); - f->upvalues[i].kind = loadByte(S); - } -} - - -static void loadDebug (LoadState *S, Proto *f) { - int i, n; - n = loadInt(S); - if (S->fixed) { - f->lineinfo = getaddr(S, n, ls_byte); - f->sizelineinfo = n; - } - else { - f->lineinfo = luaM_newvectorchecked(S->L, n, ls_byte); - f->sizelineinfo = n; - loadVector(S, f->lineinfo, n); - } - n = loadInt(S); - if (n > 0) { - loadAlign(S, sizeof(int)); - if (S->fixed) { - f->abslineinfo = getaddr(S, n, AbsLineInfo); - f->sizeabslineinfo = n; - } - else { - f->abslineinfo = luaM_newvectorchecked(S->L, n, AbsLineInfo); - f->sizeabslineinfo = n; - loadVector(S, f->abslineinfo, n); - } - } - n = loadInt(S); - f->locvars = luaM_newvectorchecked(S->L, n, LocVar); - f->sizelocvars = n; - for (i = 0; i < n; i++) - f->locvars[i].varname = NULL; - for (i = 0; i < n; i++) { - loadString(S, f, &f->locvars[i].varname); - f->locvars[i].startpc = loadInt(S); - f->locvars[i].endpc = loadInt(S); - } - n = loadInt(S); - if (n != 0) /* does it have debug information? */ - n = f->sizeupvalues; /* must be this many */ - for (i = 0; i < n; i++) - loadString(S, f, &f->upvalues[i].name); -} - - -static void loadFunction (LoadState *S, Proto *f) { - f->linedefined = loadInt(S); - f->lastlinedefined = loadInt(S); - f->numparams = loadByte(S); - f->flag = loadByte(S) & PF_ISVARARG; /* get only the meaningful flags */ - if (S->fixed) - f->flag |= PF_FIXED; /* signal that code is fixed */ - f->maxstacksize = loadByte(S); - loadCode(S, f); - loadConstants(S, f); - loadUpvalues(S, f); - loadProtos(S, f); - loadString(S, f, &f->source); - loadDebug(S, f); -} - - -static void checkliteral (LoadState *S, const char *s, const char *msg) { - char buff[sizeof(LUA_SIGNATURE) + sizeof(LUAC_DATA)]; /* larger than both */ - size_t len = strlen(s); - loadVector(S, buff, len); - if (memcmp(s, buff, len) != 0) - private_lua_error(S, msg); -} - - -static void fchecksize (LoadState *S, size_t size, const char *tname) { - if (loadByte(S) != size) - private_lua_error(S, luaO_pushfstring(S->L, "%s size mismatch", tname)); -} - - -#define checksize(S,t) fchecksize(S,sizeof(t),#t) - -static void checkHeader (LoadState *S) { - /* skip 1st char (already read and checked) */ - checkliteral(S, &LUA_SIGNATURE[1], "not a binary chunk"); - if (loadByte(S) != LUAC_VERSION) - private_lua_error(S, "version mismatch"); - if (loadByte(S) != LUAC_FORMAT) - private_lua_error(S, "format mismatch"); - checkliteral(S, LUAC_DATA, "corrupted chunk"); - checksize(S, Instruction); - checksize(S, lua_Integer); - checksize(S, lua_Number); - if (loadInteger(S) != LUAC_INT) - private_lua_error(S, "integer format mismatch"); - if (loadNumber(S) != LUAC_NUM) - private_lua_error(S, "float format mismatch"); -} - - -/* -** Load precompiled chunk. -*/ -LClosure *luaU_undump (lua_State *L, ZIO *Z, const char *name, int fixed) { - LoadState S; - LClosure *cl; - if (*name == '@' || *name == '=') - S.name = name + 1; - else if (*name == LUA_SIGNATURE[0]) - S.name = "binary string"; - else - S.name = name; - S.L = L; - S.Z = Z; - S.fixed = fixed; - S.offset = 1; /* fist byte was already read */ - checkHeader(&S); - cl = luaF_newLclosure(L, loadByte(&S)); - setclLvalue2s(L, L->top.p, cl); - luaD_inctop(L); - S.h = luaH_new(L); /* create list of saved strings */ - S.nstr = 0; - sethvalue2s(L, L->top.p, S.h); /* anchor it */ - luaD_inctop(L); - cl->p = luaF_newproto(L); - luaC_objbarrier(L, cl, cl->p); - loadFunction(&S, cl->p); - lua_assert(cl->nupvalues == cl->p->sizeupvalues); - luai_verifycode(L, cl->p); - L->top.p--; /* pop table */ - return cl; -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lundump.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lundump.h deleted file mode 100644 index 1d6e50e..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lundump.h +++ /dev/null @@ -1,39 +0,0 @@ -/* -** $Id: lundump.h $ -** load precompiled Lua chunks -** See Copyright Notice in lua.h -*/ - -#ifndef lundump_h -#define lundump_h - -#include - -#include "llimits.h" -#include "lobject.h" -#include "lzio.h" - - -/* data to catch conversion errors */ -#define LUAC_DATA "\x19\x93\r\n\x1a\n" - -#define LUAC_INT 0x5678 -#define LUAC_NUM cast_num(370.5) - -/* -** Encode major-minor version in one byte, one nibble for each -*/ -#define LUAC_VERSION (LUA_VERSION_MAJOR_N*16+LUA_VERSION_MINOR_N) - -#define LUAC_FORMAT 0 /* this is the official format */ - - -/* load one chunk; from lundump.c */ -LUAI_FUNC LClosure* luaU_undump (lua_State* L, ZIO* Z, const char* name, - int fixed); - -/* dump one chunk; from ldump.c */ -LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, - void* data, int strip); - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lutf8lib.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lutf8lib.c deleted file mode 100644 index 3a5b9bc..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lutf8lib.c +++ /dev/null @@ -1,291 +0,0 @@ -/* -** $Id: lutf8lib.c $ -** Standard library for UTF-8 manipulation -** See Copyright Notice in lua.h -*/ - -#define lutf8lib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -#define MAXUNICODE 0x10FFFFu - -#define MAXUTF 0x7FFFFFFFu - - -#define MSGInvalid "invalid UTF-8 code" - -/* -** Integer type for decoded UTF-8 values; MAXUTF needs 31 bits. -*/ -#if (UINT_MAX >> 30) >= 1 -typedef unsigned int utfint; -#else -typedef unsigned long utfint; -#endif - - -#define iscont(c) (((c) & 0xC0) == 0x80) -#define iscontp(p) iscont(*(p)) - - -/* from strlib */ -/* translate a relative string position: negative means back from end */ -static lua_Integer u_posrelat (lua_Integer pos, size_t len) { - if (pos >= 0) return pos; - else if (0u - (size_t)pos > len) return 0; - else return (lua_Integer)len + pos + 1; -} - - -/* -** Decode one UTF-8 sequence, returning NULL if byte sequence is -** invalid. The array 'limits' stores the minimum value for each -** sequence length, to check for overlong representations. Its first -** entry forces an error for non-ascii bytes with no continuation -** bytes (count == 0). -*/ -static const char *utf8_decode (const char *s, utfint *val, int strict) { - static const utfint limits[] = - {~(utfint)0, 0x80, 0x800, 0x10000u, 0x200000u, 0x4000000u}; - unsigned int c = (unsigned char)s[0]; - utfint res = 0; /* final result */ - if (c < 0x80) /* ascii? */ - res = c; - else { - int count = 0; /* to count number of continuation bytes */ - for (; c & 0x40; c <<= 1) { /* while it needs continuation bytes... */ - unsigned int cc = (unsigned char)s[++count]; /* read next byte */ - if (!iscont(cc)) /* not a continuation byte? */ - return NULL; /* invalid byte sequence */ - res = (res << 6) | (cc & 0x3F); /* add lower 6 bits from cont. byte */ - } - res |= ((utfint)(c & 0x7F) << (count * 5)); /* add first byte */ - if (count > 5 || res > MAXUTF || res < limits[count]) - return NULL; /* invalid byte sequence */ - s += count; /* skip continuation bytes read */ - } - if (strict) { - /* check for invalid code points; too large or surrogates */ - if (res > MAXUNICODE || (0xD800u <= res && res <= 0xDFFFu)) - return NULL; - } - if (val) *val = res; - return s + 1; /* +1 to include first byte */ -} - - -/* -** utf8len(s [, i [, j [, lax]]]) --> number of characters that -** start in the range [i,j], or nil + current position if 's' is not -** well formed in that interval -*/ -static int utflen (lua_State *L) { - lua_Integer n = 0; /* counter for the number of characters */ - size_t len; /* string length in bytes */ - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer posi = u_posrelat(luaL_optinteger(L, 2, 1), len); - lua_Integer posj = u_posrelat(luaL_optinteger(L, 3, -1), len); - int lax = lua_toboolean(L, 4); - luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 2, - "initial position out of bounds"); - luaL_argcheck(L, --posj < (lua_Integer)len, 3, - "final position out of bounds"); - while (posi <= posj) { - const char *s1 = utf8_decode(s + posi, NULL, !lax); - if (s1 == NULL) { /* conversion error? */ - luaL_pushfail(L); /* return fail ... */ - lua_pushinteger(L, posi + 1); /* ... and current position */ - return 2; - } - posi = s1 - s; - n++; - } - lua_pushinteger(L, n); - return 1; -} - - -/* -** codepoint(s, [i, [j [, lax]]]) -> returns codepoints for all -** characters that start in the range [i,j] -*/ -static int codepoint (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer posi = u_posrelat(luaL_optinteger(L, 2, 1), len); - lua_Integer pose = u_posrelat(luaL_optinteger(L, 3, posi), len); - int lax = lua_toboolean(L, 4); - int n; - const char *se; - luaL_argcheck(L, posi >= 1, 2, "out of bounds"); - luaL_argcheck(L, pose <= (lua_Integer)len, 3, "out of bounds"); - if (posi > pose) return 0; /* empty interval; return no values */ - if (pose - posi >= INT_MAX) /* (lua_Integer -> int) overflow? */ - return luaL_error(L, "string slice too long"); - n = (int)(pose - posi) + 1; /* upper bound for number of returns */ - luaL_checkstack(L, n, "string slice too long"); - n = 0; /* count the number of returns */ - se = s + pose; /* string end */ - for (s += posi - 1; s < se;) { - utfint code; - s = utf8_decode(s, &code, !lax); - if (s == NULL) - return luaL_error(L, MSGInvalid); - lua_pushinteger(L, code); - n++; - } - return n; -} - - -static void pushutfchar (lua_State *L, int arg) { - lua_Unsigned code = (lua_Unsigned)luaL_checkinteger(L, arg); - luaL_argcheck(L, code <= MAXUTF, arg, "value out of range"); - lua_pushfstring(L, "%U", (long)code); -} - - -/* -** utfchar(n1, n2, ...) -> char(n1)..char(n2)... -*/ -static int utfchar (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - if (n == 1) /* optimize common case of single char */ - pushutfchar(L, 1); - else { - int i; - luaL_Buffer b; - luaL_buffinit(L, &b); - for (i = 1; i <= n; i++) { - pushutfchar(L, i); - luaL_addvalue(&b); - } - luaL_pushresult(&b); - } - return 1; -} - - -/* -** offset(s, n, [i]) -> index where n-th character counting from -** position 'i' starts; 0 means character at 'i'. -*/ -static int byteoffset (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer n = luaL_checkinteger(L, 2); - lua_Integer posi = (n >= 0) ? 1 : len + 1; - posi = u_posrelat(luaL_optinteger(L, 3, posi), len); - luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 3, - "position out of bounds"); - if (n == 0) { - /* find beginning of current byte sequence */ - while (posi > 0 && iscontp(s + posi)) posi--; - } - else { - if (iscontp(s + posi)) - return luaL_error(L, "initial position is a continuation byte"); - if (n < 0) { - while (n < 0 && posi > 0) { /* move back */ - do { /* find beginning of previous character */ - posi--; - } while (posi > 0 && iscontp(s + posi)); - n++; - } - } - else { - n--; /* do not move for 1st character */ - while (n > 0 && posi < (lua_Integer)len) { - do { /* find beginning of next character */ - posi++; - } while (iscontp(s + posi)); /* (cannot pass final '\0') */ - n--; - } - } - } - if (n == 0) /* did it find given character? */ - lua_pushinteger(L, posi + 1); - else /* no such character */ - luaL_pushfail(L); - return 1; -} - - -static int iter_aux (lua_State *L, int strict) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Unsigned n = (lua_Unsigned)lua_tointeger(L, 2); - if (n < len) { - while (iscontp(s + n)) n++; /* go to next character */ - } - if (n >= len) /* (also handles original 'n' being negative) */ - return 0; /* no more codepoints */ - else { - utfint code; - const char *next = utf8_decode(s + n, &code, strict); - if (next == NULL || iscontp(next)) - return luaL_error(L, MSGInvalid); - lua_pushinteger(L, n + 1); - lua_pushinteger(L, code); - return 2; - } -} - - -static int iter_auxstrict (lua_State *L) { - return iter_aux(L, 1); -} - -static int iter_auxlax (lua_State *L) { - return iter_aux(L, 0); -} - - -static int iter_codes (lua_State *L) { - int lax = lua_toboolean(L, 2); - const char *s = luaL_checkstring(L, 1); - luaL_argcheck(L, !iscontp(s), 1, MSGInvalid); - lua_pushcfunction(L, lax ? iter_auxlax : iter_auxstrict); - lua_pushvalue(L, 1); - lua_pushinteger(L, 0); - return 3; -} - - -/* pattern to match a single UTF-8 character */ -#define UTF8PATT "[\0-\x7F\xC2-\xFD][\x80-\xBF]*" - - -static const luaL_Reg funcs[] = { - {"offset", byteoffset}, - {"codepoint", codepoint}, - {"char", utfchar}, - {"len", utflen}, - {"codes", iter_codes}, - /* placeholders */ - {"charpattern", NULL}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_utf8 (lua_State *L) { - luaL_newlib(L, funcs); - lua_pushlstring(L, UTF8PATT, sizeof(UTF8PATT)/sizeof(char) - 1); - lua_setfield(L, -2, "charpattern"); - return 1; -} - diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lvm.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lvm.c deleted file mode 100644 index 37023af..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lvm.c +++ /dev/null @@ -1,1896 +0,0 @@ -/* -** $Id: lvm.c $ -** Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#define lvm_c -#define LUA_CORE - -#include "lprefix.h" - -#include -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lvm.h" - - -/* -** By default, use jump tables in the main interpreter loop on gcc -** and compatible compilers. -*/ -#if !defined(LUA_USE_JUMPTABLE) -#if defined(__GNUC__) -#define LUA_USE_JUMPTABLE 1 -#else -#define LUA_USE_JUMPTABLE 0 -#endif -#endif - - - -/* limit for table tag-method chains (to avoid infinite loops) */ -#define MAXTAGLOOP 2000 - - -/* -** 'l_intfitsf' checks whether a given integer is in the range that -** can be converted to a float without rounding. Used in comparisons. -*/ - -/* number of bits in the mantissa of a float */ -#define NBM (l_floatatt(MANT_DIG)) - -/* -** Check whether some integers may not fit in a float, testing whether -** (maxinteger >> NBM) > 0. (That implies (1 << NBM) <= maxinteger.) -** (The shifts are done in parts, to avoid shifting by more than the size -** of an integer. In a worst case, NBM == 113 for long double and -** sizeof(long) == 32.) -*/ -#if ((((LUA_MAXINTEGER >> (NBM / 4)) >> (NBM / 4)) >> (NBM / 4)) \ - >> (NBM - (3 * (NBM / 4)))) > 0 - -/* limit for integers that fit in a float */ -#define MAXINTFITSF ((lua_Unsigned)1 << NBM) - -/* check whether 'i' is in the interval [-MAXINTFITSF, MAXINTFITSF] */ -#define l_intfitsf(i) ((MAXINTFITSF + l_castS2U(i)) <= (2 * MAXINTFITSF)) - -#else /* all integers fit in a float precisely */ - -#define l_intfitsf(i) 1 - -#endif - - -/* -** Try to convert a value from string to a number value. -** If the value is not a string or is a string not representing -** a valid numeral (or if coercions from strings to numbers -** are disabled via macro 'cvt2num'), do not modify 'result' -** and return 0. -*/ -static int l_strton (const TValue *obj, TValue *result) { - lua_assert(obj != result); - if (!cvt2num(obj)) /* is object not a string? */ - return 0; - else { - TString *st = tsvalue(obj); - size_t stlen; - const char *s = getlstr(st, stlen); - return (luaO_str2num(s, result) == stlen + 1); - } -} - - -/* -** Try to convert a value to a float. The float case is already handled -** by the macro 'tonumber'. -*/ -int luaV_tonumber_ (const TValue *obj, lua_Number *n) { - TValue v; - if (ttisinteger(obj)) { - *n = cast_num(ivalue(obj)); - return 1; - } - else if (l_strton(obj, &v)) { /* string coercible to number? */ - *n = nvalue(&v); /* convert result of 'luaO_str2num' to a float */ - return 1; - } - else - return 0; /* conversion failed */ -} - - -/* -** try to convert a float to an integer, rounding according to 'mode'. -*/ -int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode) { - lua_Number f = l_floor(n); - if (n != f) { /* not an integral value? */ - if (mode == F2Ieq) return 0; /* fails if mode demands integral value */ - else if (mode == F2Iceil) /* needs ceil? */ - f += 1; /* convert floor to ceil (remember: n != f) */ - } - return lua_numbertointeger(f, p); -} - - -/* -** try to convert a value to an integer, rounding according to 'mode', -** without string coercion. -** ("Fast track" handled by macro 'tointegerns'.) -*/ -int luaV_tointegerns (const TValue *obj, lua_Integer *p, F2Imod mode) { - if (ttisfloat(obj)) - return luaV_flttointeger(fltvalue(obj), p, mode); - else if (ttisinteger(obj)) { - *p = ivalue(obj); - return 1; - } - else - return 0; -} - - -/* -** try to convert a value to an integer. -*/ -int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode) { - TValue v; - if (l_strton(obj, &v)) /* does 'obj' point to a numerical string? */ - obj = &v; /* change it to point to its corresponding number */ - return luaV_tointegerns(obj, p, mode); -} - - -/* -** Try to convert a 'for' limit to an integer, preserving the semantics -** of the loop. Return true if the loop must not run; otherwise, '*p' -** gets the integer limit. -** (The following explanation assumes a positive step; it is valid for -** negative steps mutatis mutandis.) -** If the limit is an integer or can be converted to an integer, -** rounding down, that is the limit. -** Otherwise, check whether the limit can be converted to a float. If -** the float is too large, clip it to LUA_MAXINTEGER. If the float -** is too negative, the loop should not run, because any initial -** integer value is greater than such limit; so, the function returns -** true to signal that. (For this latter case, no integer limit would be -** correct; even a limit of LUA_MININTEGER would run the loop once for -** an initial value equal to LUA_MININTEGER.) -*/ -static int forlimit (lua_State *L, lua_Integer init, const TValue *lim, - lua_Integer *p, lua_Integer step) { - if (!luaV_tointeger(lim, p, (step < 0 ? F2Iceil : F2Ifloor))) { - /* not coercible to in integer */ - lua_Number flim; /* try to convert to float */ - if (!tonumber(lim, &flim)) /* cannot convert to float? */ - luaG_forerror(L, lim, "limit"); - /* else 'flim' is a float out of integer bounds */ - if (luai_numlt(0, flim)) { /* if it is positive, it is too large */ - if (step < 0) return 1; /* initial value must be less than it */ - *p = LUA_MAXINTEGER; /* truncate */ - } - else { /* it is less than min integer */ - if (step > 0) return 1; /* initial value must be greater than it */ - *p = LUA_MININTEGER; /* truncate */ - } - } - return (step > 0 ? init > *p : init < *p); /* not to run? */ -} - - -/* -** Prepare a numerical for loop (opcode OP_FORPREP). -** Before execution, stack is as follows: -** ra : initial value -** ra + 1 : limit -** ra + 2 : step -** Return true to skip the loop. Otherwise, -** after preparation, stack will be as follows: -** ra : loop counter (integer loops) or limit (float loops) -** ra + 1 : step -** ra + 2 : control variable -*/ -static int forprep (lua_State *L, StkId ra) { - TValue *pinit = s2v(ra); - TValue *plimit = s2v(ra + 1); - TValue *pstep = s2v(ra + 2); - if (ttisinteger(pinit) && ttisinteger(pstep)) { /* integer loop? */ - lua_Integer init = ivalue(pinit); - lua_Integer step = ivalue(pstep); - lua_Integer limit; - if (step == 0) - luaG_runerror(L, "'for' step is zero"); - if (forlimit(L, init, plimit, &limit, step)) - return 1; /* skip the loop */ - else { /* prepare loop counter */ - lua_Unsigned count; - if (step > 0) { /* ascending loop? */ - count = l_castS2U(limit) - l_castS2U(init); - if (step != 1) /* avoid division in the too common case */ - count /= l_castS2U(step); - } - else { /* step < 0; descending loop */ - count = l_castS2U(init) - l_castS2U(limit); - /* 'step+1' avoids negating 'mininteger' */ - count /= l_castS2U(-(step + 1)) + 1u; - } - /* use 'chgivalue' for places that for sure had integers */ - chgivalue(s2v(ra), l_castU2S(count)); /* change init to count */ - setivalue(s2v(ra + 1), step); /* change limit to step */ - chgivalue(s2v(ra + 2), init); /* change step to init */ - } - } - else { /* try making all values floats */ - lua_Number init; lua_Number limit; lua_Number step; - if (l_unlikely(!tonumber(plimit, &limit))) - luaG_forerror(L, plimit, "limit"); - if (l_unlikely(!tonumber(pstep, &step))) - luaG_forerror(L, pstep, "step"); - if (l_unlikely(!tonumber(pinit, &init))) - luaG_forerror(L, pinit, "initial value"); - if (step == 0) - luaG_runerror(L, "'for' step is zero"); - if (luai_numlt(0, step) ? luai_numlt(limit, init) - : luai_numlt(init, limit)) - return 1; /* skip the loop */ - else { - /* make sure all values are floats */ - setfltvalue(s2v(ra), limit); - setfltvalue(s2v(ra + 1), step); - setfltvalue(s2v(ra + 2), init); /* control variable */ - } - } - return 0; -} - - -/* -** Execute a step of a float numerical for loop, returning -** true iff the loop must continue. (The integer case is -** written online with opcode OP_FORLOOP, for performance.) -*/ -static int floatforloop (StkId ra) { - lua_Number step = fltvalue(s2v(ra + 1)); - lua_Number limit = fltvalue(s2v(ra)); - lua_Number idx = fltvalue(s2v(ra + 2)); /* control variable */ - idx = luai_numadd(L, idx, step); /* increment index */ - if (luai_numlt(0, step) ? luai_numle(idx, limit) - : luai_numle(limit, idx)) { - chgfltvalue(s2v(ra + 2), idx); /* update control variable */ - return 1; /* jump back */ - } - else - return 0; /* finish the loop */ -} - - -/* -** Finish the table access 'val = t[key]' and return the tag of the result. -*/ -int luaV_finishget (lua_State *L, const TValue *t, TValue *key, StkId val, - int tag) { - int loop; /* counter to avoid infinite loops */ - const TValue *tm; /* metamethod */ - for (loop = 0; loop < MAXTAGLOOP; loop++) { - if (tag == LUA_VNOTABLE) { /* 't' is not a table? */ - lua_assert(!ttistable(t)); - tm = luaT_gettmbyobj(L, t, TM_INDEX); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, t, "index"); /* no metamethod */ - /* else will try the metamethod */ - } - else { /* 't' is a table */ - tm = fasttm(L, hvalue(t)->metatable, TM_INDEX); /* table's metamethod */ - if (tm == NULL) { /* no metamethod? */ - setnilvalue(s2v(val)); /* result is nil */ - return LUA_VNIL; - } - /* else will try the metamethod */ - } - if (ttisfunction(tm)) { /* is metamethod a function? */ - tag = luaT_callTMres(L, tm, t, key, val); /* call it */ - return tag; /* return tag of the result */ - } - t = tm; /* else try to access 'tm[key]' */ - luaV_fastget(t, key, s2v(val), luaH_get, tag); - if (!tagisempty(tag)) - return tag; /* done */ - /* else repeat (tail call 'luaV_finishget') */ - } - luaG_runerror(L, "'__index' chain too long; possible loop"); - return 0; /* to avoid warnings */ -} - - -/* -** Finish a table assignment 't[key] = val'. -*/ -void luaV_finishset (lua_State *L, const TValue *t, TValue *key, - TValue *val, int hres) { - int loop; /* counter to avoid infinite loops */ - for (loop = 0; loop < MAXTAGLOOP; loop++) { - const TValue *tm; /* '__newindex' metamethod */ - if (hres != HNOTATABLE) { /* is 't' a table? */ - Table *h = hvalue(t); /* save 't' table */ - tm = fasttm(L, h->metatable, TM_NEWINDEX); /* get metamethod */ - if (tm == NULL) { /* no metamethod? */ - luaH_finishset(L, h, key, val, hres); /* set new value */ - invalidateTMcache(h); - luaC_barrierback(L, obj2gco(h), val); - return; - } - /* else will try the metamethod */ - } - else { /* not a table; check metamethod */ - tm = luaT_gettmbyobj(L, t, TM_NEWINDEX); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, t, "index"); - } - /* try the metamethod */ - if (ttisfunction(tm)) { - luaT_callTM(L, tm, t, key, val); - return; - } - t = tm; /* else repeat assignment over 'tm' */ - luaV_fastset(t, key, val, hres, luaH_pset); - if (hres == HOK) - return; /* done */ - /* else 'return luaV_finishset(L, t, key, val, slot)' (loop) */ - } - luaG_runerror(L, "'__newindex' chain too long; possible loop"); -} - - -/* -** Compare two strings 'ts1' x 'ts2', returning an integer less-equal- -** -greater than zero if 'ts1' is less-equal-greater than 'ts2'. -** The code is a little tricky because it allows '\0' in the strings -** and it uses 'strcoll' (to respect locales) for each segment -** of the strings. Note that segments can compare equal but still -** have different lengths. -*/ -static int l_strcmp (const TString *ts1, const TString *ts2) { - size_t rl1; /* real length */ - const char *s1 = getlstr(ts1, rl1); - size_t rl2; - const char *s2 = getlstr(ts2, rl2); - for (;;) { /* for each segment */ - int temp = strcoll(s1, s2); - if (temp != 0) /* not equal? */ - return temp; /* done */ - else { /* strings are equal up to a '\0' */ - size_t zl1 = strlen(s1); /* index of first '\0' in 's1' */ - size_t zl2 = strlen(s2); /* index of first '\0' in 's2' */ - if (zl2 == rl2) /* 's2' is finished? */ - return (zl1 == rl1) ? 0 : 1; /* check 's1' */ - else if (zl1 == rl1) /* 's1' is finished? */ - return -1; /* 's1' is less than 's2' ('s2' is not finished) */ - /* both strings longer than 'zl'; go on comparing after the '\0' */ - zl1++; zl2++; - s1 += zl1; rl1 -= zl1; s2 += zl2; rl2 -= zl2; - } - } -} - - -/* -** Check whether integer 'i' is less than float 'f'. If 'i' has an -** exact representation as a float ('l_intfitsf'), compare numbers as -** floats. Otherwise, use the equivalence 'i < f <=> i < ceil(f)'. -** If 'ceil(f)' is out of integer range, either 'f' is greater than -** all integers or less than all integers. -** (The test with 'l_intfitsf' is only for performance; the else -** case is correct for all values, but it is slow due to the conversion -** from float to int.) -** When 'f' is NaN, comparisons must result in false. -*/ -l_sinline int LTintfloat (lua_Integer i, lua_Number f) { - if (l_intfitsf(i)) - return luai_numlt(cast_num(i), f); /* compare them as floats */ - else { /* i < f <=> i < ceil(f) */ - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Iceil)) /* fi = ceil(f) */ - return i < fi; /* compare them as integers */ - else /* 'f' is either greater or less than all integers */ - return f > 0; /* greater? */ - } -} - - -/* -** Check whether integer 'i' is less than or equal to float 'f'. -** See comments on previous function. -*/ -l_sinline int LEintfloat (lua_Integer i, lua_Number f) { - if (l_intfitsf(i)) - return luai_numle(cast_num(i), f); /* compare them as floats */ - else { /* i <= f <=> i <= floor(f) */ - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ifloor)) /* fi = floor(f) */ - return i <= fi; /* compare them as integers */ - else /* 'f' is either greater or less than all integers */ - return f > 0; /* greater? */ - } -} - - -/* -** Check whether float 'f' is less than integer 'i'. -** See comments on previous function. -*/ -l_sinline int LTfloatint (lua_Number f, lua_Integer i) { - if (l_intfitsf(i)) - return luai_numlt(f, cast_num(i)); /* compare them as floats */ - else { /* f < i <=> floor(f) < i */ - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ifloor)) /* fi = floor(f) */ - return fi < i; /* compare them as integers */ - else /* 'f' is either greater or less than all integers */ - return f < 0; /* less? */ - } -} - - -/* -** Check whether float 'f' is less than or equal to integer 'i'. -** See comments on previous function. -*/ -l_sinline int LEfloatint (lua_Number f, lua_Integer i) { - if (l_intfitsf(i)) - return luai_numle(f, cast_num(i)); /* compare them as floats */ - else { /* f <= i <=> ceil(f) <= i */ - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Iceil)) /* fi = ceil(f) */ - return fi <= i; /* compare them as integers */ - else /* 'f' is either greater or less than all integers */ - return f < 0; /* less? */ - } -} - - -/* -** Return 'l < r', for numbers. -*/ -l_sinline int LTnum (const TValue *l, const TValue *r) { - lua_assert(ttisnumber(l) && ttisnumber(r)); - if (ttisinteger(l)) { - lua_Integer li = ivalue(l); - if (ttisinteger(r)) - return li < ivalue(r); /* both are integers */ - else /* 'l' is int and 'r' is float */ - return LTintfloat(li, fltvalue(r)); /* l < r ? */ - } - else { - lua_Number lf = fltvalue(l); /* 'l' must be float */ - if (ttisfloat(r)) - return luai_numlt(lf, fltvalue(r)); /* both are float */ - else /* 'l' is float and 'r' is int */ - return LTfloatint(lf, ivalue(r)); - } -} - - -/* -** Return 'l <= r', for numbers. -*/ -l_sinline int LEnum (const TValue *l, const TValue *r) { - lua_assert(ttisnumber(l) && ttisnumber(r)); - if (ttisinteger(l)) { - lua_Integer li = ivalue(l); - if (ttisinteger(r)) - return li <= ivalue(r); /* both are integers */ - else /* 'l' is int and 'r' is float */ - return LEintfloat(li, fltvalue(r)); /* l <= r ? */ - } - else { - lua_Number lf = fltvalue(l); /* 'l' must be float */ - if (ttisfloat(r)) - return luai_numle(lf, fltvalue(r)); /* both are float */ - else /* 'l' is float and 'r' is int */ - return LEfloatint(lf, ivalue(r)); - } -} - - -/* -** return 'l < r' for non-numbers. -*/ -static int lessthanothers (lua_State *L, const TValue *l, const TValue *r) { - lua_assert(!ttisnumber(l) || !ttisnumber(r)); - if (ttisstring(l) && ttisstring(r)) /* both are strings? */ - return l_strcmp(tsvalue(l), tsvalue(r)) < 0; - else - return luaT_callorderTM(L, l, r, TM_LT); -} - - -/* -** Main operation less than; return 'l < r'. -*/ -int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) { - if (ttisnumber(l) && ttisnumber(r)) /* both operands are numbers? */ - return LTnum(l, r); - else return lessthanothers(L, l, r); -} - - -/* -** return 'l <= r' for non-numbers. -*/ -static int lessequalothers (lua_State *L, const TValue *l, const TValue *r) { - lua_assert(!ttisnumber(l) || !ttisnumber(r)); - if (ttisstring(l) && ttisstring(r)) /* both are strings? */ - return l_strcmp(tsvalue(l), tsvalue(r)) <= 0; - else - return luaT_callorderTM(L, l, r, TM_LE); -} - - -/* -** Main operation less than or equal to; return 'l <= r'. -*/ -int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r) { - if (ttisnumber(l) && ttisnumber(r)) /* both operands are numbers? */ - return LEnum(l, r); - else return lessequalothers(L, l, r); -} - - -/* -** Main operation for equality of Lua values; return 't1 == t2'. -** L == NULL means raw equality (no metamethods) -*/ -int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2) { - const TValue *tm; - if (ttypetag(t1) != ttypetag(t2)) { /* not the same variant? */ - if (ttype(t1) != ttype(t2) || ttype(t1) != LUA_TNUMBER) - return 0; /* only numbers can be equal with different variants */ - else { /* two numbers with different variants */ - /* One of them is an integer. If the other does not have an - integer value, they cannot be equal; otherwise, compare their - integer values. */ - lua_Integer i1, i2; - return (luaV_tointegerns(t1, &i1, F2Ieq) && - luaV_tointegerns(t2, &i2, F2Ieq) && - i1 == i2); - } - } - /* values have same type and same variant */ - switch (ttypetag(t1)) { - case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: return 1; - case LUA_VNUMINT: return (ivalue(t1) == ivalue(t2)); - case LUA_VNUMFLT: return luai_numeq(fltvalue(t1), fltvalue(t2)); - case LUA_VLIGHTUSERDATA: return pvalue(t1) == pvalue(t2); - case LUA_VLCF: return fvalue(t1) == fvalue(t2); - case LUA_VSHRSTR: return eqshrstr(tsvalue(t1), tsvalue(t2)); - case LUA_VLNGSTR: return luaS_eqlngstr(tsvalue(t1), tsvalue(t2)); - case LUA_VUSERDATA: { - if (uvalue(t1) == uvalue(t2)) return 1; - else if (L == NULL) return 0; - tm = fasttm(L, uvalue(t1)->metatable, TM_EQ); - if (tm == NULL) - tm = fasttm(L, uvalue(t2)->metatable, TM_EQ); - break; /* will try TM */ - } - case LUA_VTABLE: { - if (hvalue(t1) == hvalue(t2)) return 1; - else if (L == NULL) return 0; - tm = fasttm(L, hvalue(t1)->metatable, TM_EQ); - if (tm == NULL) - tm = fasttm(L, hvalue(t2)->metatable, TM_EQ); - break; /* will try TM */ - } - default: - return gcvalue(t1) == gcvalue(t2); - } - if (tm == NULL) /* no TM? */ - return 0; /* objects are different */ - else { - int tag = luaT_callTMres(L, tm, t1, t2, L->top.p); /* call TM */ - return !tagisfalse(tag); - } -} - - -/* macro used by 'luaV_concat' to ensure that element at 'o' is a string */ -#define tostring(L,o) \ - (ttisstring(o) || (cvt2str(o) && (luaO_tostring(L, o), 1))) - -#define isemptystr(o) (ttisshrstring(o) && tsvalue(o)->shrlen == 0) - -/* copy strings in stack from top - n up to top - 1 to buffer */ -static void copy2buff (StkId top, int n, char *buff) { - size_t tl = 0; /* size already copied */ - do { - TString *st = tsvalue(s2v(top - n)); - size_t l; /* length of string being copied */ - const char *s = getlstr(st, l); - memcpy(buff + tl, s, l * sizeof(char)); - tl += l; - } while (--n > 0); -} - - -/* -** Main operation for concatenation: concat 'total' values in the stack, -** from 'L->top.p - total' up to 'L->top.p - 1'. -*/ -void luaV_concat (lua_State *L, int total) { - if (total == 1) - return; /* "all" values already concatenated */ - do { - StkId top = L->top.p; - int n = 2; /* number of elements handled in this pass (at least 2) */ - if (!(ttisstring(s2v(top - 2)) || cvt2str(s2v(top - 2))) || - !tostring(L, s2v(top - 1))) - luaT_tryconcatTM(L); /* may invalidate 'top' */ - else if (isemptystr(s2v(top - 1))) /* second operand is empty? */ - cast_void(tostring(L, s2v(top - 2))); /* result is first operand */ - else if (isemptystr(s2v(top - 2))) { /* first operand is empty string? */ - setobjs2s(L, top - 2, top - 1); /* result is second op. */ - } - else { - /* at least two non-empty string values; get as many as possible */ - size_t tl = tsslen(tsvalue(s2v(top - 1))); - TString *ts; - /* collect total length and number of strings */ - for (n = 1; n < total && tostring(L, s2v(top - n - 1)); n++) { - size_t l = tsslen(tsvalue(s2v(top - n - 1))); - if (l_unlikely(l >= MAX_SIZE - sizeof(TString) - tl)) { - L->top.p = top - total; /* pop strings to avoid wasting stack */ - luaG_runerror(L, "string length overflow"); - } - tl += l; - } - if (tl <= LUAI_MAXSHORTLEN) { /* is result a short string? */ - char buff[LUAI_MAXSHORTLEN]; - copy2buff(top, n, buff); /* copy strings to buffer */ - ts = luaS_newlstr(L, buff, tl); - } - else { /* long string; copy strings directly to final result */ - ts = luaS_createlngstrobj(L, tl); - copy2buff(top, n, getlngstr(ts)); - } - setsvalue2s(L, top - n, ts); /* create result */ - } - total -= n - 1; /* got 'n' strings to create one new */ - L->top.p -= n - 1; /* popped 'n' strings and pushed one */ - } while (total > 1); /* repeat until only 1 result left */ -} - - -/* -** Main operation 'ra = #rb'. -*/ -void luaV_objlen (lua_State *L, StkId ra, const TValue *rb) { - const TValue *tm; - switch (ttypetag(rb)) { - case LUA_VTABLE: { - Table *h = hvalue(rb); - tm = fasttm(L, h->metatable, TM_LEN); - if (tm) break; /* metamethod? break switch to call it */ - setivalue(s2v(ra), luaH_getn(h)); /* else primitive len */ - return; - } - case LUA_VSHRSTR: { - setivalue(s2v(ra), tsvalue(rb)->shrlen); - return; - } - case LUA_VLNGSTR: { - setivalue(s2v(ra), tsvalue(rb)->u.lnglen); - return; - } - default: { /* try metamethod */ - tm = luaT_gettmbyobj(L, rb, TM_LEN); - if (l_unlikely(notm(tm))) /* no metamethod? */ - luaG_typeerror(L, rb, "get length of"); - break; - } - } - luaT_callTMres(L, tm, rb, rb, ra); -} - - -/* -** Integer division; return 'm // n', that is, floor(m/n). -** C division truncates its result (rounds towards zero). -** 'floor(q) == trunc(q)' when 'q >= 0' or when 'q' is integer, -** otherwise 'floor(q) == trunc(q) - 1'. -*/ -lua_Integer luaV_idiv (lua_State *L, lua_Integer m, lua_Integer n) { - if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { /* special cases: -1 or 0 */ - if (n == 0) - luaG_runerror(L, "attempt to divide by zero"); - return intop(-, 0, m); /* n==-1; avoid overflow with 0x80000...//-1 */ - } - else { - lua_Integer q = m / n; /* perform C division */ - if ((m ^ n) < 0 && m % n != 0) /* 'm/n' would be negative non-integer? */ - q -= 1; /* correct result for different rounding */ - return q; - } -} - - -/* -** Integer modulus; return 'm % n'. (Assume that C '%' with -** negative operands follows C99 behavior. See previous comment -** about luaV_idiv.) -*/ -lua_Integer luaV_mod (lua_State *L, lua_Integer m, lua_Integer n) { - if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { /* special cases: -1 or 0 */ - if (n == 0) - luaG_runerror(L, "attempt to perform 'n%%0'"); - return 0; /* m % -1 == 0; avoid overflow with 0x80000...%-1 */ - } - else { - lua_Integer r = m % n; - if (r != 0 && (r ^ n) < 0) /* 'm/n' would be non-integer negative? */ - r += n; /* correct result for different rounding */ - return r; - } -} - - -/* -** Float modulus -*/ -lua_Number luaV_modf (lua_State *L, lua_Number m, lua_Number n) { - lua_Number r; - luai_nummod(L, m, n, r); - return r; -} - - -/* number of bits in an integer */ -#define NBITS cast_int(sizeof(lua_Integer) * CHAR_BIT) - - -/* -** Shift left operation. (Shift right just negates 'y'.) -*/ -lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y) { - if (y < 0) { /* shift right? */ - if (y <= -NBITS) return 0; - else return intop(>>, x, -y); - } - else { /* shift left */ - if (y >= NBITS) return 0; - else return intop(<<, x, y); - } -} - - -/* -** create a new Lua closure, push it in the stack, and initialize -** its upvalues. -*/ -static void pushclosure (lua_State *L, Proto *p, UpVal **encup, StkId base, - StkId ra) { - int nup = p->sizeupvalues; - Upvaldesc *uv = p->upvalues; - int i; - LClosure *ncl = luaF_newLclosure(L, nup); - ncl->p = p; - setclLvalue2s(L, ra, ncl); /* anchor new closure in stack */ - for (i = 0; i < nup; i++) { /* fill in its upvalues */ - if (uv[i].instack) /* upvalue refers to local variable? */ - ncl->upvals[i] = luaF_findupval(L, base + uv[i].idx); - else /* get upvalue from enclosing function */ - ncl->upvals[i] = encup[uv[i].idx]; - luaC_objbarrier(L, ncl, ncl->upvals[i]); - } -} - - -/* -** finish execution of an opcode interrupted by a yield -*/ -void luaV_finishOp (lua_State *L) { - CallInfo *ci = L->ci; - StkId base = ci->func.p + 1; - Instruction inst = *(ci->u.l.savedpc - 1); /* interrupted instruction */ - OpCode op = GET_OPCODE(inst); - switch (op) { /* finish its execution */ - case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { - setobjs2s(L, base + GETARG_A(*(ci->u.l.savedpc - 2)), --L->top.p); - break; - } - case OP_UNM: case OP_BNOT: case OP_LEN: - case OP_GETTABUP: case OP_GETTABLE: case OP_GETI: - case OP_GETFIELD: case OP_SELF: { - setobjs2s(L, base + GETARG_A(inst), --L->top.p); - break; - } - case OP_LT: case OP_LE: - case OP_LTI: case OP_LEI: - case OP_GTI: case OP_GEI: - case OP_EQ: { /* note that 'OP_EQI'/'OP_EQK' cannot yield */ - int res = !l_isfalse(s2v(L->top.p - 1)); - L->top.p--; -#if defined(LUA_COMPAT_LT_LE) - if (ci->callstatus & CIST_LEQ) { /* "<=" using "<" instead? */ - ci->callstatus ^= CIST_LEQ; /* clear mark */ - res = !res; /* negate result */ - } -#endif - lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_JMP); - if (res != GETARG_k(inst)) /* condition failed? */ - ci->u.l.savedpc++; /* skip jump instruction */ - break; - } - case OP_CONCAT: { - StkId top = L->top.p - 1; /* top when 'luaT_tryconcatTM' was called */ - int a = GETARG_A(inst); /* first element to concatenate */ - int total = cast_int(top - 1 - (base + a)); /* yet to concatenate */ - setobjs2s(L, top - 2, top); /* put TM result in proper position */ - L->top.p = top - 1; /* top is one after last element (at top-2) */ - luaV_concat(L, total); /* concat them (may yield again) */ - break; - } - case OP_CLOSE: { /* yielded closing variables */ - ci->u.l.savedpc--; /* repeat instruction to close other vars. */ - break; - } - case OP_RETURN: { /* yielded closing variables */ - StkId ra = base + GETARG_A(inst); - /* adjust top to signal correct number of returns, in case the - return is "up to top" ('isIT') */ - L->top.p = ra + ci->u2.nres; - /* repeat instruction to close other vars. and complete the return */ - ci->u.l.savedpc--; - break; - } - default: { - /* only these other opcodes can yield */ - lua_assert(op == OP_TFORCALL || op == OP_CALL || - op == OP_TAILCALL || op == OP_SETTABUP || op == OP_SETTABLE || - op == OP_SETI || op == OP_SETFIELD); - break; - } - } -} - - - - -/* -** {================================================================== -** Macros for arithmetic/bitwise/comparison opcodes in 'luaV_execute' -** =================================================================== -*/ - -#define l_addi(L,a,b) intop(+, a, b) -#define l_subi(L,a,b) intop(-, a, b) -#define l_muli(L,a,b) intop(*, a, b) -#define l_band(a,b) intop(&, a, b) -#define l_bor(a,b) intop(|, a, b) -#define l_bxor(a,b) intop(^, a, b) - -#define l_lti(a,b) (a < b) -#define l_lei(a,b) (a <= b) -#define l_gti(a,b) (a > b) -#define l_gei(a,b) (a >= b) - - -/* -** Arithmetic operations with immediate operands. 'iop' is the integer -** operation, 'fop' is the float operation. -*/ -#define op_arithI(L,iop,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - int imm = GETARG_sC(i); \ - if (ttisinteger(v1)) { \ - lua_Integer iv1 = ivalue(v1); \ - pc++; setivalue(s2v(ra), iop(L, iv1, imm)); \ - } \ - else if (ttisfloat(v1)) { \ - lua_Number nb = fltvalue(v1); \ - lua_Number fimm = cast_num(imm); \ - pc++; setfltvalue(s2v(ra), fop(L, nb, fimm)); \ - }} - - -/* -** Auxiliary function for arithmetic operations over floats and others -** with two operands. -*/ -#define op_arithf_aux(L,v1,v2,fop) { \ - lua_Number n1; lua_Number n2; \ - if (tonumberns(v1, n1) && tonumberns(v2, n2)) { \ - pc++; setfltvalue(s2v(ra), fop(L, n1, n2)); \ - }} - - -/* -** Arithmetic operations over floats and others with register operands. -*/ -#define op_arithf(L,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - op_arithf_aux(L, v1, v2, fop); } - - -/* -** Arithmetic operations with K operands for floats. -*/ -#define op_arithfK(L,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ - op_arithf_aux(L, v1, v2, fop); } - - -/* -** Arithmetic operations over integers and floats. -*/ -#define op_arith_aux(L,v1,v2,iop,fop) { \ - StkId ra = RA(i); \ - if (ttisinteger(v1) && ttisinteger(v2)) { \ - lua_Integer i1 = ivalue(v1); lua_Integer i2 = ivalue(v2); \ - pc++; setivalue(s2v(ra), iop(L, i1, i2)); \ - } \ - else op_arithf_aux(L, v1, v2, fop); } - - -/* -** Arithmetic operations with register operands. -*/ -#define op_arith(L,iop,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - op_arith_aux(L, v1, v2, iop, fop); } - - -/* -** Arithmetic operations with K operands. -*/ -#define op_arithK(L,iop,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ - op_arith_aux(L, v1, v2, iop, fop); } - - -/* -** Bitwise operations with constant operand. -*/ -#define op_bitwiseK(L,op) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); \ - lua_Integer i1; \ - lua_Integer i2 = ivalue(v2); \ - if (tointegerns(v1, &i1)) { \ - pc++; setivalue(s2v(ra), op(i1, i2)); \ - }} - - -/* -** Bitwise operations with register operands. -*/ -#define op_bitwise(L,op) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - lua_Integer i1; lua_Integer i2; \ - if (tointegerns(v1, &i1) && tointegerns(v2, &i2)) { \ - pc++; setivalue(s2v(ra), op(i1, i2)); \ - }} - - -/* -** Order operations with register operands. 'opn' actually works -** for all numbers, but the fast track improves performance for -** integers. -*/ -#define op_order(L,opi,opn,other) { \ - StkId ra = RA(i); \ - int cond; \ - TValue *rb = vRB(i); \ - if (ttisinteger(s2v(ra)) && ttisinteger(rb)) { \ - lua_Integer ia = ivalue(s2v(ra)); \ - lua_Integer ib = ivalue(rb); \ - cond = opi(ia, ib); \ - } \ - else if (ttisnumber(s2v(ra)) && ttisnumber(rb)) \ - cond = opn(s2v(ra), rb); \ - else \ - Protect(cond = other(L, s2v(ra), rb)); \ - docondjump(); } - - -/* -** Order operations with immediate operand. (Immediate operand is -** always small enough to have an exact representation as a float.) -*/ -#define op_orderI(L,opi,opf,inv,tm) { \ - StkId ra = RA(i); \ - int cond; \ - int im = GETARG_sB(i); \ - if (ttisinteger(s2v(ra))) \ - cond = opi(ivalue(s2v(ra)), im); \ - else if (ttisfloat(s2v(ra))) { \ - lua_Number fa = fltvalue(s2v(ra)); \ - lua_Number fim = cast_num(im); \ - cond = opf(fa, fim); \ - } \ - else { \ - int isf = GETARG_C(i); \ - Protect(cond = luaT_callorderiTM(L, s2v(ra), im, inv, isf, tm)); \ - } \ - docondjump(); } - -/* }================================================================== */ - - -/* -** {================================================================== -** Function 'luaV_execute': main interpreter loop -** =================================================================== -*/ - -/* -** some macros for common tasks in 'luaV_execute' -*/ - - -#define RA(i) (base+GETARG_A(i)) -#define RB(i) (base+GETARG_B(i)) -#define vRB(i) s2v(RB(i)) -#define KB(i) (k+GETARG_B(i)) -#define RC(i) (base+GETARG_C(i)) -#define vRC(i) s2v(RC(i)) -#define KC(i) (k+GETARG_C(i)) -#define RKC(i) ((TESTARG_k(i)) ? k + GETARG_C(i) : s2v(base + GETARG_C(i))) - - - -#define updatetrap(ci) (trap = ci->u.l.trap) - -#define updatebase(ci) (base = ci->func.p + 1) - - -#define updatestack(ci) \ - { if (l_unlikely(trap)) { updatebase(ci); ra = RA(i); } } - - -/* -** Execute a jump instruction. The 'updatetrap' allows signals to stop -** tight loops. (Without it, the local copy of 'trap' could never change.) -*/ -#define dojump(ci,i,e) { pc += GETARG_sJ(i) + e; updatetrap(ci); } - - -/* for test instructions, execute the jump instruction that follows it */ -#define donextjump(ci) { Instruction ni = *pc; dojump(ci, ni, 1); } - -/* -** do a conditional jump: skip next instruction if 'cond' is not what -** was expected (parameter 'k'), else do next instruction, which must -** be a jump. -*/ -#define docondjump() if (cond != GETARG_k(i)) pc++; else donextjump(ci); - - -/* -** Correct global 'pc'. -*/ -#define savepc(L) (ci->u.l.savedpc = pc) - - -/* -** Whenever code can raise errors, the global 'pc' and the global -** 'top' must be correct to report occasional errors. -*/ -#define savestate(L,ci) (savepc(L), L->top.p = ci->top.p) - - -/* -** Protect code that, in general, can raise errors, reallocate the -** stack, and change the hooks. -*/ -#define Protect(exp) (savestate(L,ci), (exp), updatetrap(ci)) - -/* special version that does not change the top */ -#define ProtectNT(exp) (savepc(L), (exp), updatetrap(ci)) - -/* -** Protect code that can only raise errors. (That is, it cannot change -** the stack or hooks.) -*/ -#define halfProtect(exp) (savestate(L,ci), (exp)) - -/* 'c' is the limit of live values in the stack */ -#define checkGC(L,c) \ - { luaC_condGC(L, (savepc(L), L->top.p = (c)), \ - updatetrap(ci)); \ - luai_threadyield(L); } - - -/* fetch an instruction and prepare its execution */ -#define vmfetch() { \ - if (l_unlikely(trap)) { /* stack reallocation or hooks? */ \ - trap = luaG_traceexec(L, pc); /* handle hooks */ \ - updatebase(ci); /* correct stack */ \ - } \ - i = *(pc++); \ -} - -#define vmdispatch(o) switch(o) -#define vmcase(l) case l: -#define vmbreak break - - -void luaV_execute (lua_State *L, CallInfo *ci) { - LClosure *cl; - TValue *k; - StkId base; - const Instruction *pc; - int trap; -#if LUA_USE_JUMPTABLE -#include "ljumptab.h" -#endif - startfunc: - trap = L->hookmask; - returning: /* trap already set */ - cl = ci_func(ci); - k = cl->p->k; - pc = ci->u.l.savedpc; - if (l_unlikely(trap)) - trap = luaG_tracecall(L); - base = ci->func.p + 1; - /* main loop of interpreter */ - for (;;) { - Instruction i; /* instruction being executed */ - vmfetch(); - #if 0 - /* low-level line tracing for debugging Lua */ - printf("line: %d\n", luaG_getfuncline(cl->p, pcRel(pc, cl->p))); - #endif - lua_assert(base == ci->func.p + 1); - lua_assert(base <= L->top.p && L->top.p <= L->stack_last.p); - /* invalidate top for instructions not expecting it */ - lua_assert(isIT(i) || (cast_void(L->top.p = base), 1)); - vmdispatch (GET_OPCODE(i)) { - vmcase(OP_MOVE) { - StkId ra = RA(i); - setobjs2s(L, ra, RB(i)); - vmbreak; - } - vmcase(OP_LOADI) { - StkId ra = RA(i); - lua_Integer b = GETARG_sBx(i); - setivalue(s2v(ra), b); - vmbreak; - } - vmcase(OP_LOADF) { - StkId ra = RA(i); - int b = GETARG_sBx(i); - setfltvalue(s2v(ra), cast_num(b)); - vmbreak; - } - vmcase(OP_LOADK) { - StkId ra = RA(i); - TValue *rb = k + GETARG_Bx(i); - setobj2s(L, ra, rb); - vmbreak; - } - vmcase(OP_LOADKX) { - StkId ra = RA(i); - TValue *rb; - rb = k + GETARG_Ax(*pc); pc++; - setobj2s(L, ra, rb); - vmbreak; - } - vmcase(OP_LOADFALSE) { - StkId ra = RA(i); - setbfvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LFALSESKIP) { - StkId ra = RA(i); - setbfvalue(s2v(ra)); - pc++; /* skip next instruction */ - vmbreak; - } - vmcase(OP_LOADTRUE) { - StkId ra = RA(i); - setbtvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LOADNIL) { - StkId ra = RA(i); - int b = GETARG_B(i); - do { - setnilvalue(s2v(ra++)); - } while (b--); - vmbreak; - } - vmcase(OP_GETUPVAL) { - StkId ra = RA(i); - int b = GETARG_B(i); - setobj2s(L, ra, cl->upvals[b]->v.p); - vmbreak; - } - vmcase(OP_SETUPVAL) { - StkId ra = RA(i); - UpVal *uv = cl->upvals[GETARG_B(i)]; - setobj(L, uv->v.p, s2v(ra)); - luaC_barrier(L, uv, s2v(ra)); - vmbreak; - } - vmcase(OP_GETTABUP) { - StkId ra = RA(i); - TValue *upval = cl->upvals[GETARG_B(i)]->v.p; - TValue *rc = KC(i); - TString *key = tsvalue(rc); /* key must be a short string */ - int tag; - luaV_fastget(upval, key, s2v(ra), luaH_getshortstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, upval, rc, ra, tag)); - vmbreak; - } - vmcase(OP_GETTABLE) { - StkId ra = RA(i); - TValue *rb = vRB(i); - TValue *rc = vRC(i); - int tag; - if (ttisinteger(rc)) { /* fast track for integers? */ - luaV_fastgeti(rb, ivalue(rc), s2v(ra), tag); - } - else - luaV_fastget(rb, rc, s2v(ra), luaH_get, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_GETI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int c = GETARG_C(i); - int tag; - luaV_fastgeti(rb, c, s2v(ra), tag); - if (tagisempty(tag)) { - TValue key; - setivalue(&key, c); - Protect(luaV_finishget(L, rb, &key, ra, tag)); - } - vmbreak; - } - vmcase(OP_GETFIELD) { - StkId ra = RA(i); - TValue *rb = vRB(i); - TValue *rc = KC(i); - TString *key = tsvalue(rc); /* key must be a short string */ - int tag; - luaV_fastget(rb, key, s2v(ra), luaH_getshortstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_SETTABUP) { - int hres; - TValue *upval = cl->upvals[GETARG_A(i)]->v.p; - TValue *rb = KB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rb); /* key must be a short string */ - luaV_fastset(upval, key, rc, hres, luaH_psetshortstr); - if (hres == HOK) - luaV_finishfastset(L, upval, rc); - else - Protect(luaV_finishset(L, upval, rb, rc, hres)); - vmbreak; - } - vmcase(OP_SETTABLE) { - StkId ra = RA(i); - int hres; - TValue *rb = vRB(i); /* key (table is in 'ra') */ - TValue *rc = RKC(i); /* value */ - if (ttisinteger(rb)) { /* fast track for integers? */ - luaV_fastseti(s2v(ra), ivalue(rb), rc, hres); - } - else { - luaV_fastset(s2v(ra), rb, rc, hres, luaH_pset); - } - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else - Protect(luaV_finishset(L, s2v(ra), rb, rc, hres)); - vmbreak; - } - vmcase(OP_SETI) { - StkId ra = RA(i); - int hres; - int b = GETARG_B(i); - TValue *rc = RKC(i); - luaV_fastseti(s2v(ra), b, rc, hres); - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else { - TValue key; - setivalue(&key, b); - Protect(luaV_finishset(L, s2v(ra), &key, rc, hres)); - } - vmbreak; - } - vmcase(OP_SETFIELD) { - StkId ra = RA(i); - int hres; - TValue *rb = KB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rb); /* key must be a short string */ - luaV_fastset(s2v(ra), key, rc, hres, luaH_psetshortstr); - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else - Protect(luaV_finishset(L, s2v(ra), rb, rc, hres)); - vmbreak; - } - vmcase(OP_NEWTABLE) { - StkId ra = RA(i); - int b = GETARG_B(i); /* log2(hash size) + 1 */ - int c = GETARG_C(i); /* array size */ - Table *t; - if (b > 0) - b = 1 << (b - 1); /* size is 2^(b - 1) */ - lua_assert((!TESTARG_k(i)) == (GETARG_Ax(*pc) == 0)); - if (TESTARG_k(i)) /* non-zero extra argument? */ - c += GETARG_Ax(*pc) * (MAXARG_C + 1); /* add it to size */ - pc++; /* skip extra argument */ - L->top.p = ra + 1; /* correct top in case of emergency GC */ - t = luaH_new(L); /* memory allocation */ - sethvalue2s(L, ra, t); - if (b != 0 || c != 0) - luaH_resize(L, t, c, b); /* idem */ - checkGC(L, ra + 1); - vmbreak; - } - vmcase(OP_SELF) { - StkId ra = RA(i); - int tag; - TValue *rb = vRB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rc); /* key must be a string */ - setobj2s(L, ra + 1, rb); - luaV_fastget(rb, key, s2v(ra), luaH_getstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_ADDI) { - op_arithI(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_ADDK) { - op_arithK(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_SUBK) { - op_arithK(L, l_subi, luai_numsub); - vmbreak; - } - vmcase(OP_MULK) { - op_arithK(L, l_muli, luai_nummul); - vmbreak; - } - vmcase(OP_MODK) { - savestate(L, ci); /* in case of division by 0 */ - op_arithK(L, luaV_mod, luaV_modf); - vmbreak; - } - vmcase(OP_POWK) { - op_arithfK(L, luai_numpow); - vmbreak; - } - vmcase(OP_DIVK) { - op_arithfK(L, luai_numdiv); - vmbreak; - } - vmcase(OP_IDIVK) { - savestate(L, ci); /* in case of division by 0 */ - op_arithK(L, luaV_idiv, luai_numidiv); - vmbreak; - } - vmcase(OP_BANDK) { - op_bitwiseK(L, l_band); - vmbreak; - } - vmcase(OP_BORK) { - op_bitwiseK(L, l_bor); - vmbreak; - } - vmcase(OP_BXORK) { - op_bitwiseK(L, l_bxor); - vmbreak; - } - vmcase(OP_SHRI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int ic = GETARG_sC(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - pc++; setivalue(s2v(ra), luaV_shiftl(ib, -ic)); - } - vmbreak; - } - vmcase(OP_SHLI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int ic = GETARG_sC(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - pc++; setivalue(s2v(ra), luaV_shiftl(ic, ib)); - } - vmbreak; - } - vmcase(OP_ADD) { - op_arith(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_SUB) { - op_arith(L, l_subi, luai_numsub); - vmbreak; - } - vmcase(OP_MUL) { - op_arith(L, l_muli, luai_nummul); - vmbreak; - } - vmcase(OP_MOD) { - savestate(L, ci); /* in case of division by 0 */ - op_arith(L, luaV_mod, luaV_modf); - vmbreak; - } - vmcase(OP_POW) { - op_arithf(L, luai_numpow); - vmbreak; - } - vmcase(OP_DIV) { /* float division (always with floats) */ - op_arithf(L, luai_numdiv); - vmbreak; - } - vmcase(OP_IDIV) { /* floor division */ - savestate(L, ci); /* in case of division by 0 */ - op_arith(L, luaV_idiv, luai_numidiv); - vmbreak; - } - vmcase(OP_BAND) { - op_bitwise(L, l_band); - vmbreak; - } - vmcase(OP_BOR) { - op_bitwise(L, l_bor); - vmbreak; - } - vmcase(OP_BXOR) { - op_bitwise(L, l_bxor); - vmbreak; - } - vmcase(OP_SHR) { - op_bitwise(L, luaV_shiftr); - vmbreak; - } - vmcase(OP_SHL) { - op_bitwise(L, luaV_shiftl); - vmbreak; - } - vmcase(OP_MMBIN) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); /* original arith. expression */ - TValue *rb = vRB(i); - TMS tm = (TMS)GETARG_C(i); - StkId result = RA(pi); - lua_assert(OP_ADD <= GET_OPCODE(pi) && GET_OPCODE(pi) <= OP_SHR); - Protect(luaT_trybinTM(L, s2v(ra), rb, result, tm)); - vmbreak; - } - vmcase(OP_MMBINI) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); /* original arith. expression */ - int imm = GETARG_sB(i); - TMS tm = (TMS)GETARG_C(i); - int flip = GETARG_k(i); - StkId result = RA(pi); - Protect(luaT_trybiniTM(L, s2v(ra), imm, flip, result, tm)); - vmbreak; - } - vmcase(OP_MMBINK) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); /* original arith. expression */ - TValue *imm = KB(i); - TMS tm = (TMS)GETARG_C(i); - int flip = GETARG_k(i); - StkId result = RA(pi); - Protect(luaT_trybinassocTM(L, s2v(ra), imm, flip, result, tm)); - vmbreak; - } - vmcase(OP_UNM) { - StkId ra = RA(i); - TValue *rb = vRB(i); - lua_Number nb; - if (ttisinteger(rb)) { - lua_Integer ib = ivalue(rb); - setivalue(s2v(ra), intop(-, 0, ib)); - } - else if (tonumberns(rb, nb)) { - setfltvalue(s2v(ra), luai_numunm(L, nb)); - } - else - Protect(luaT_trybinTM(L, rb, rb, ra, TM_UNM)); - vmbreak; - } - vmcase(OP_BNOT) { - StkId ra = RA(i); - TValue *rb = vRB(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - setivalue(s2v(ra), intop(^, ~l_castS2U(0), ib)); - } - else - Protect(luaT_trybinTM(L, rb, rb, ra, TM_BNOT)); - vmbreak; - } - vmcase(OP_NOT) { - StkId ra = RA(i); - TValue *rb = vRB(i); - if (l_isfalse(rb)) - setbtvalue(s2v(ra)); - else - setbfvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LEN) { - StkId ra = RA(i); - Protect(luaV_objlen(L, ra, vRB(i))); - vmbreak; - } - vmcase(OP_CONCAT) { - StkId ra = RA(i); - int n = GETARG_B(i); /* number of elements to concatenate */ - L->top.p = ra + n; /* mark the end of concat operands */ - ProtectNT(luaV_concat(L, n)); - checkGC(L, L->top.p); /* 'luaV_concat' ensures correct top */ - vmbreak; - } - vmcase(OP_CLOSE) { - StkId ra = RA(i); - Protect(luaF_close(L, ra, LUA_OK, 1)); - vmbreak; - } - vmcase(OP_TBC) { - StkId ra = RA(i); - /* create new to-be-closed upvalue */ - halfProtect(luaF_newtbcupval(L, ra)); - vmbreak; - } - vmcase(OP_JMP) { - dojump(ci, i, 0); - vmbreak; - } - vmcase(OP_EQ) { - StkId ra = RA(i); - int cond; - TValue *rb = vRB(i); - Protect(cond = luaV_equalobj(L, s2v(ra), rb)); - docondjump(); - vmbreak; - } - vmcase(OP_LT) { - op_order(L, l_lti, LTnum, lessthanothers); - vmbreak; - } - vmcase(OP_LE) { - op_order(L, l_lei, LEnum, lessequalothers); - vmbreak; - } - vmcase(OP_EQK) { - StkId ra = RA(i); - TValue *rb = KB(i); - /* basic types do not use '__eq'; we can use raw equality */ - int cond = luaV_rawequalobj(s2v(ra), rb); - docondjump(); - vmbreak; - } - vmcase(OP_EQI) { - StkId ra = RA(i); - int cond; - int im = GETARG_sB(i); - if (ttisinteger(s2v(ra))) - cond = (ivalue(s2v(ra)) == im); - else if (ttisfloat(s2v(ra))) - cond = luai_numeq(fltvalue(s2v(ra)), cast_num(im)); - else - cond = 0; /* other types cannot be equal to a number */ - docondjump(); - vmbreak; - } - vmcase(OP_LTI) { - op_orderI(L, l_lti, luai_numlt, 0, TM_LT); - vmbreak; - } - vmcase(OP_LEI) { - op_orderI(L, l_lei, luai_numle, 0, TM_LE); - vmbreak; - } - vmcase(OP_GTI) { - op_orderI(L, l_gti, luai_numgt, 1, TM_LT); - vmbreak; - } - vmcase(OP_GEI) { - op_orderI(L, l_gei, luai_numge, 1, TM_LE); - vmbreak; - } - vmcase(OP_TEST) { - StkId ra = RA(i); - int cond = !l_isfalse(s2v(ra)); - docondjump(); - vmbreak; - } - vmcase(OP_TESTSET) { - StkId ra = RA(i); - TValue *rb = vRB(i); - if (l_isfalse(rb) == GETARG_k(i)) - pc++; - else { - setobj2s(L, ra, rb); - donextjump(ci); - } - vmbreak; - } - vmcase(OP_CALL) { - StkId ra = RA(i); - CallInfo *newci; - int b = GETARG_B(i); - int nresults = GETARG_C(i) - 1; - if (b != 0) /* fixed number of arguments? */ - L->top.p = ra + b; /* top signals number of arguments */ - /* else previous instruction set top */ - savepc(L); /* in case of errors */ - if ((newci = luaD_precall(L, ra, nresults)) == NULL) - updatetrap(ci); /* C call; nothing else to be done */ - else { /* Lua call: run function in this same C frame */ - ci = newci; - goto startfunc; - } - vmbreak; - } - vmcase(OP_TAILCALL) { - StkId ra = RA(i); - int b = GETARG_B(i); /* number of arguments + 1 (function) */ - int n; /* number of results when calling a C function */ - int nparams1 = GETARG_C(i); - /* delta is virtual 'func' - real 'func' (vararg functions) */ - int delta = (nparams1) ? ci->u.l.nextraargs + nparams1 : 0; - if (b != 0) - L->top.p = ra + b; - else /* previous instruction set top */ - b = cast_int(L->top.p - ra); - savepc(ci); /* several calls here can raise errors */ - if (TESTARG_k(i)) { - luaF_closeupval(L, base); /* close upvalues from current call */ - lua_assert(L->tbclist.p < base); /* no pending tbc variables */ - lua_assert(base == ci->func.p + 1); - } - if ((n = luaD_pretailcall(L, ci, ra, b, delta)) < 0) /* Lua function? */ - goto startfunc; /* execute the callee */ - else { /* C function? */ - ci->func.p -= delta; /* restore 'func' (if vararg) */ - luaD_poscall(L, ci, n); /* finish caller */ - updatetrap(ci); /* 'luaD_poscall' can change hooks */ - goto ret; /* caller returns after the tail call */ - } - } - vmcase(OP_RETURN) { - StkId ra = RA(i); - int n = GETARG_B(i) - 1; /* number of results */ - int nparams1 = GETARG_C(i); - if (n < 0) /* not fixed? */ - n = cast_int(L->top.p - ra); /* get what is available */ - savepc(ci); - if (TESTARG_k(i)) { /* may there be open upvalues? */ - ci->u2.nres = n; /* save number of returns */ - if (L->top.p < ci->top.p) - L->top.p = ci->top.p; - luaF_close(L, base, CLOSEKTOP, 1); - updatetrap(ci); - updatestack(ci); - } - if (nparams1) /* vararg function? */ - ci->func.p -= ci->u.l.nextraargs + nparams1; - L->top.p = ra + n; /* set call for 'luaD_poscall' */ - luaD_poscall(L, ci, n); - updatetrap(ci); /* 'luaD_poscall' can change hooks */ - goto ret; - } - vmcase(OP_RETURN0) { - if (l_unlikely(L->hookmask)) { - StkId ra = RA(i); - L->top.p = ra; - savepc(ci); - luaD_poscall(L, ci, 0); /* no hurry... */ - trap = 1; - } - else { /* do the 'poscall' here */ - int nres; - L->ci = ci->previous; /* back to caller */ - L->top.p = base - 1; - for (nres = ci->nresults; l_unlikely(nres > 0); nres--) - setnilvalue(s2v(L->top.p++)); /* all results are nil */ - } - goto ret; - } - vmcase(OP_RETURN1) { - if (l_unlikely(L->hookmask)) { - StkId ra = RA(i); - L->top.p = ra + 1; - savepc(ci); - luaD_poscall(L, ci, 1); /* no hurry... */ - trap = 1; - } - else { /* do the 'poscall' here */ - int nres = ci->nresults; - L->ci = ci->previous; /* back to caller */ - if (nres == 0) - L->top.p = base - 1; /* asked for no results */ - else { - StkId ra = RA(i); - setobjs2s(L, base - 1, ra); /* at least this result */ - L->top.p = base; - for (; l_unlikely(nres > 1); nres--) - setnilvalue(s2v(L->top.p++)); /* complete missing results */ - } - } - ret: /* return from a Lua function */ - if (ci->callstatus & CIST_FRESH) - return; /* end this frame */ - else { - ci = ci->previous; - goto returning; /* continue running caller in this frame */ - } - } - vmcase(OP_FORLOOP) { - StkId ra = RA(i); - if (ttisinteger(s2v(ra + 1))) { /* integer loop? */ - lua_Unsigned count = l_castS2U(ivalue(s2v(ra))); - if (count > 0) { /* still more iterations? */ - lua_Integer step = ivalue(s2v(ra + 1)); - lua_Integer idx = ivalue(s2v(ra + 2)); /* control variable */ - chgivalue(s2v(ra), count - 1); /* update counter */ - idx = intop(+, idx, step); /* add step to index */ - chgivalue(s2v(ra + 2), idx); /* update control variable */ - pc -= GETARG_Bx(i); /* jump back */ - } - } - else if (floatforloop(ra)) /* float loop */ - pc -= GETARG_Bx(i); /* jump back */ - updatetrap(ci); /* allows a signal to break the loop */ - vmbreak; - } - vmcase(OP_FORPREP) { - StkId ra = RA(i); - savestate(L, ci); /* in case of errors */ - if (forprep(L, ra)) - pc += GETARG_Bx(i) + 1; /* skip the loop */ - vmbreak; - } - vmcase(OP_TFORPREP) { - /* before: 'ra' has the iterator function, 'ra + 1' has the state, - 'ra + 2' has the initial value for the control variable, and - 'ra + 3' has the closing variable. This opcode then swaps the - control and the closing variables and marks the closing variable - as to-be-closed. - */ - StkId ra = RA(i); - TValue temp; /* to swap control and closing variables */ - setobj(L, &temp, s2v(ra + 3)); - setobjs2s(L, ra + 3, ra + 2); - setobj2s(L, ra + 2, &temp); - /* create to-be-closed upvalue (if closing var. is not nil) */ - halfProtect(luaF_newtbcupval(L, ra + 2)); - pc += GETARG_Bx(i); /* go to end of the loop */ - i = *(pc++); /* fetch next instruction */ - lua_assert(GET_OPCODE(i) == OP_TFORCALL && ra == RA(i)); - goto l_tforcall; - } - vmcase(OP_TFORCALL) { - l_tforcall: { - /* 'ra' has the iterator function, 'ra + 1' has the state, - 'ra + 2' has the closing variable, and 'ra + 3' has the control - variable. The call will use the stack starting at 'ra + 3', - so that it preserves the first three values, and the first - return will be the new value for the control variable. - */ - StkId ra = RA(i); - setobjs2s(L, ra + 5, ra + 3); /* copy the control variable */ - setobjs2s(L, ra + 4, ra + 1); /* copy state */ - setobjs2s(L, ra + 3, ra); /* copy function */ - L->top.p = ra + 3 + 3; - ProtectNT(luaD_call(L, ra + 3, GETARG_C(i))); /* do the call */ - updatestack(ci); /* stack may have changed */ - i = *(pc++); /* go to next instruction */ - lua_assert(GET_OPCODE(i) == OP_TFORLOOP && ra == RA(i)); - goto l_tforloop; - }} - vmcase(OP_TFORLOOP) { - l_tforloop: { - StkId ra = RA(i); - if (!ttisnil(s2v(ra + 3))) /* continue loop? */ - pc -= GETARG_Bx(i); /* jump back */ - vmbreak; - }} - vmcase(OP_SETLIST) { - StkId ra = RA(i); - int n = GETARG_B(i); - unsigned int last = GETARG_C(i); - Table *h = hvalue(s2v(ra)); - if (n == 0) - n = cast_int(L->top.p - ra) - 1; /* get up to the top */ - else - L->top.p = ci->top.p; /* correct top in case of emergency GC */ - last += n; - if (TESTARG_k(i)) { - last += GETARG_Ax(*pc) * (MAXARG_C + 1); - pc++; - } - if (last > luaH_realasize(h)) /* needs more space? */ - luaH_resizearray(L, h, last); /* preallocate it at once */ - for (; n > 0; n--) { - TValue *val = s2v(ra + n); - obj2arr(h, last, val); - last--; - luaC_barrierback(L, obj2gco(h), val); - } - vmbreak; - } - vmcase(OP_CLOSURE) { - StkId ra = RA(i); - Proto *p = cl->p->p[GETARG_Bx(i)]; - halfProtect(pushclosure(L, p, cl->upvals, base, ra)); - checkGC(L, ra + 1); - vmbreak; - } - vmcase(OP_VARARG) { - StkId ra = RA(i); - int n = GETARG_C(i) - 1; /* required results */ - Protect(luaT_getvarargs(L, ci, ra, n)); - vmbreak; - } - vmcase(OP_VARARGPREP) { - ProtectNT(luaT_adjustvarargs(L, GETARG_A(i), ci, cl->p)); - if (l_unlikely(trap)) { /* previous "Protect" updated trap */ - luaD_hookcall(L, ci); - L->oldpc = 1; /* next opcode will be seen as a "new" line */ - } - updatebase(ci); /* function has new base after adjustment */ - vmbreak; - } - vmcase(OP_EXTRAARG) { - lua_assert(0); - vmbreak; - } - } - } -} - -/* }================================================================== */ diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lvm.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lvm.h deleted file mode 100644 index a11db83..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lvm.h +++ /dev/null @@ -1,136 +0,0 @@ -/* -** $Id: lvm.h $ -** Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#ifndef lvm_h -#define lvm_h - - -#include "ldo.h" -#include "lobject.h" -#include "ltm.h" - - -#if !defined(LUA_NOCVTN2S) -#define cvt2str(o) ttisnumber(o) -#else -#define cvt2str(o) 0 /* no conversion from numbers to strings */ -#endif - - -#if !defined(LUA_NOCVTS2N) -#define cvt2num(o) ttisstring(o) -#else -#define cvt2num(o) 0 /* no conversion from strings to numbers */ -#endif - - -/* -** You can define LUA_FLOORN2I if you want to convert floats to integers -** by flooring them (instead of raising an error if they are not -** integral values) -*/ -#if !defined(LUA_FLOORN2I) -#define LUA_FLOORN2I F2Ieq -#endif - - -/* -** Rounding modes for float->integer coercion - */ -typedef enum { - F2Ieq, /* no rounding; accepts only integral values */ - F2Ifloor, /* takes the floor of the number */ - F2Iceil /* takes the ceil of the number */ -} F2Imod; - - -/* convert an object to a float (including string coercion) */ -#define tonumber(o,n) \ - (ttisfloat(o) ? (*(n) = fltvalue(o), 1) : luaV_tonumber_(o,n)) - - -/* convert an object to a float (without string coercion) */ -#define tonumberns(o,n) \ - (ttisfloat(o) ? ((n) = fltvalue(o), 1) : \ - (ttisinteger(o) ? ((n) = cast_num(ivalue(o)), 1) : 0)) - - -/* convert an object to an integer (including string coercion) */ -#define tointeger(o,i) \ - (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ - : luaV_tointeger(o,i,LUA_FLOORN2I)) - - -/* convert an object to an integer (without string coercion) */ -#define tointegerns(o,i) \ - (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ - : luaV_tointegerns(o,i,LUA_FLOORN2I)) - - -#define intop(op,v1,v2) l_castU2S(l_castS2U(v1) op l_castS2U(v2)) - -#define luaV_rawequalobj(t1,t2) luaV_equalobj(NULL,t1,t2) - - -/* -** fast track for 'gettable' -*/ -#define luaV_fastget(t,k,res,f, tag) \ - (tag = (!ttistable(t) ? LUA_VNOTABLE : f(hvalue(t), k, res))) - - -/* -** Special case of 'luaV_fastget' for integers, inlining the fast case -** of 'luaH_getint'. -*/ -#define luaV_fastgeti(t,k,res,tag) \ - if (!ttistable(t)) tag = LUA_VNOTABLE; \ - else { luaH_fastgeti(hvalue(t), k, res, tag); } - - -#define luaV_fastset(t,k,val,hres,f) \ - (hres = (!ttistable(t) ? HNOTATABLE : f(hvalue(t), k, val))) - -#define luaV_fastseti(t,k,val,hres) \ - if (!ttistable(t)) hres = HNOTATABLE; \ - else { luaH_fastseti(hvalue(t), k, val, hres); } - - -/* -** Finish a fast set operation (when fast set succeeds). -*/ -#define luaV_finishfastset(L,t,v) luaC_barrierback(L, gcvalue(t), v) - - -/* -** Shift right is the same as shift left with a negative 'y' -*/ -#define luaV_shiftr(x,y) luaV_shiftl(x,intop(-, 0, y)) - - - -LUAI_FUNC int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2); -LUAI_FUNC int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r); -LUAI_FUNC int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r); -LUAI_FUNC int luaV_tonumber_ (const TValue *obj, lua_Number *n); -LUAI_FUNC int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode); -LUAI_FUNC int luaV_tointegerns (const TValue *obj, lua_Integer *p, - F2Imod mode); -LUAI_FUNC int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode); -LUAI_FUNC int luaV_finishget (lua_State *L, const TValue *t, TValue *key, - StkId val, int tag); -LUAI_FUNC void luaV_finishset (lua_State *L, const TValue *t, TValue *key, - TValue *val, int aux); -LUAI_FUNC void luaV_finishOp (lua_State *L); -LUAI_FUNC void luaV_execute (lua_State *L, CallInfo *ci); -LUAI_FUNC void luaV_concat (lua_State *L, int total); -LUAI_FUNC lua_Integer luaV_idiv (lua_State *L, lua_Integer x, lua_Integer y); -LUAI_FUNC lua_Integer luaV_mod (lua_State *L, lua_Integer x, lua_Integer y); -LUAI_FUNC lua_Number luaV_modf (lua_State *L, lua_Number x, lua_Number y); -LUAI_FUNC lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y); -LUAI_FUNC void luaV_objlen (lua_State *L, StkId ra, const TValue *rb); - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lzio.c b/build/c/dependencies/luaCEmbed/dependencies/lua/lzio.c deleted file mode 100644 index 78f7ac8..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lzio.c +++ /dev/null @@ -1,88 +0,0 @@ -/* -** $Id: lzio.c $ -** Buffered streams -** See Copyright Notice in lua.h -*/ - -#define lzio_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "llimits.h" -#include "lmem.h" -#include "lstate.h" -#include "lzio.h" - - -int luaZ_fill (ZIO *z) { - size_t size; - lua_State *L = z->L; - const char *buff; - lua_unlock(L); - buff = z->reader(L, z->data, &size); - lua_lock(L); - if (buff == NULL || size == 0) - return EOZ; - z->n = size - 1; /* discount char being returned */ - z->p = buff; - return cast_uchar(*(z->p++)); -} - - -void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, void *data) { - z->L = L; - z->reader = reader; - z->data = data; - z->n = 0; - z->p = NULL; -} - - -/* --------------------------------------------------------------- read --- */ - -static int checkbuffer (ZIO *z) { - if (z->n == 0) { /* no bytes in buffer? */ - if (luaZ_fill(z) == EOZ) /* try to read more */ - return 0; /* no more input */ - else { - z->n++; /* luaZ_fill consumed first byte; put it back */ - z->p--; - } - } - return 1; /* now buffer has something */ -} - - -size_t luaZ_read (ZIO *z, void *b, size_t n) { - while (n) { - size_t m; - if (!checkbuffer(z)) - return n; /* no more input; return number of missing bytes */ - m = (n <= z->n) ? n : z->n; /* min. between n and z->n */ - memcpy(b, z->p, m); - z->n -= m; - z->p += m; - b = (char *)b + m; - n -= m; - } - return 0; -} - - -const void *luaZ_getaddr (ZIO* z, size_t n) { - const void *res; - if (!checkbuffer(z)) - return NULL; /* no more input */ - if (z->n < n) /* not enough bytes? */ - return NULL; /* block not whole; cannot give an address */ - res = z->p; /* get block address */ - z->n -= n; /* consume these bytes */ - z->p += n; - return res; -} diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/lzio.h b/build/c/dependencies/luaCEmbed/dependencies/lua/lzio.h deleted file mode 100644 index 55cc74a..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/lzio.h +++ /dev/null @@ -1,67 +0,0 @@ -/* -** $Id: lzio.h $ -** Buffered streams -** See Copyright Notice in lua.h -*/ - - -#ifndef lzio_h -#define lzio_h - -#include "lua.h" - -#include "lmem.h" - - -#define EOZ (-1) /* end of stream */ - -typedef struct Zio ZIO; - -#define zgetc(z) (((z)->n--)>0 ? cast_uchar(*(z)->p++) : luaZ_fill(z)) - - -typedef struct Mbuffer { - char *buffer; - size_t n; - size_t buffsize; -} Mbuffer; - -#define luaZ_initbuffer(L, buff) ((buff)->buffer = NULL, (buff)->buffsize = 0) - -#define luaZ_buffer(buff) ((buff)->buffer) -#define luaZ_sizebuffer(buff) ((buff)->buffsize) -#define luaZ_bufflen(buff) ((buff)->n) - -#define luaZ_buffremove(buff,i) ((buff)->n -= (i)) -#define luaZ_resetbuffer(buff) ((buff)->n = 0) - - -#define luaZ_resizebuffer(L, buff, size) \ - ((buff)->buffer = luaM_reallocvchar(L, (buff)->buffer, \ - (buff)->buffsize, size), \ - (buff)->buffsize = size) - -#define luaZ_freebuffer(L, buff) luaZ_resizebuffer(L, buff, 0) - - -LUAI_FUNC void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, - void *data); -LUAI_FUNC size_t luaZ_read (ZIO* z, void *b, size_t n); /* read next n bytes */ - -LUAI_FUNC const void *luaZ_getaddr (ZIO* z, size_t n); - - -/* --------- Private Part ------------------ */ - -struct Zio { - size_t n; /* bytes still unread */ - const char *p; /* current position in buffer */ - lua_Reader reader; /* reader function */ - void *data; /* additional data */ - lua_State *L; /* Lua state (for reader) */ -}; - - -LUAI_FUNC int luaZ_fill (ZIO *z); - -#endif diff --git a/build/c/dependencies/luaCEmbed/dependencies/lua/onelua.c b/build/c/dependencies/luaCEmbed/dependencies/lua/onelua.c deleted file mode 100644 index 320dfc0..0000000 --- a/build/c/dependencies/luaCEmbed/dependencies/lua/onelua.c +++ /dev/null @@ -1,100 +0,0 @@ -/* -** Lua core, libraries, and interpreter in a single file. -** Compiling just this file generates a complete Lua stand-alone -** program: -** -** $ gcc -O2 -std=c99 -o lua onelua.c -lm -** -** or -** -** $ gcc -O2 -std=c89 -DLUA_USE_C89 -o lua onelua.c -lm -** -*/ - -/* default is to build the full interpreter */ -#ifndef MAKE_LIB -#ifndef MAKE_LUAC -#ifndef MAKE_LUA -#define MAKE_LUA -#endif -#endif -#endif - - -/* -** Choose suitable platform-specific features. Default is no -** platform-specific features. Some of these options may need extra -** libraries such as -ldl -lreadline -lncurses -*/ -#if 0 -#define LUA_USE_LINUX -#define LUA_USE_MACOSX -#define LUA_USE_POSIX -#define LUA_ANSI -#endif - - -/* no need to change anything below this line ----------------------------- */ - -#include "lprefix.h" - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -#include "custom_math/custom_math.h" - -/* setup for luaconf.h */ -#define LUA_CORE -#define LUA_LIB -#define ltable_c -#define lvm_c -#include "luaconf.h" - -/* do not export internal symbols */ -#undef LUAI_FUNC -#undef LUAI_DDEC -#undef LUAI_DDEF -#define LUAI_FUNC static -#define LUAI_DDEC(def) /* empty */ -#define LUAI_DDEF static - -/* core -- used by all */ -#include "custom_math/custom_math.c" -#include "lzio.c" -#include "lctype.c" -#include "lopcodes.c" -#include "lmem.c" -#include "lundump.c" -#include "ldump.c" -#include "lstate.c" -#include "lgc.c" -#include "llex.c" -#include "lcode.c" -#include "lparser.c" -#include "ldebug.c" -#include "lfunc.c" -#include "lobject.c" -#include "ltm.c" -#include "lstring.c" -#include "ltable.c" -#include "ldo.c" -#include "lvm.c" -#include "lapi.c" - -/* auxiliary library -- used by all */ -#include "lauxlib.c" - - diff --git a/build/c/dependencies/luaCEmbed/extra/extra.c b/build/c/dependencies/luaCEmbed/extra/extra.c deleted file mode 100644 index fc501a9..0000000 --- a/build/c/dependencies/luaCEmbed/extra/extra.c +++ /dev/null @@ -1,47 +0,0 @@ - - -const char * LuaCembed_convert_arg_code(int arg_code){ - if(arg_code == LUA_CEMBED_NOT_FOUND){ - return PRIVATE_LUA_CEMBED_NOT_FOUND_STRING; - } - - if(arg_code == LUA_CEMBED_STRING){ - return PRIVATE_LUA_CEMBED_STRING_STRING; - - } - if(arg_code == LUA_CEMBED_NUMBER){ - return PRIVATE_LUA_CEMBED_NUMBER_STRING; - } - if(arg_code == LUA_CEMBED_BOOL){ - return PRIVATE_LUA_CEMBED_BOOL_STRING; - } - if(arg_code == LUA_CEMBED_NIL){ - return PRIVATE_LUA_CEMBED_NIL_STRING; - } - if(arg_code == LUA_CEMBED_TABLE){ - return PRIVATE_LUA_CEMBED_TABLE_STRING; - } - if(arg_code == LUA_CEMBED_FUNCTION){ - return PRIVATE_LUA_CEMBED_FUNCTION_STRING; - } - - return PRIVATE_LUA_CEMBED_UNKNOW_STRING; -} - -char * private_LuaCembed_format_vaarg(const char *expresion, va_list args){ - - va_list args_copy; - va_copy(args_copy, args); - long required_size = vsnprintf(NULL, 0,expresion,args_copy); - va_end(args_copy); - char *buffer = (char*)malloc(sizeof(char) * required_size + 2); - vsnprintf(buffer,sizeof (char) * required_size+1,expresion,args); - return buffer; -} -char * private_LuaCembed_format(const char *expresion, ...){ - va_list args; - va_start(args,expresion); - char *result = private_LuaCembed_format_vaarg(expresion,args); - va_end(args); - return result; -} \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/extra/extra.h b/build/c/dependencies/luaCEmbed/extra/extra.h deleted file mode 100644 index 2796612..0000000 --- a/build/c/dependencies/luaCEmbed/extra/extra.h +++ /dev/null @@ -1,10 +0,0 @@ - - -const char * LuaCembed_convert_arg_code(int arg_code); - - -char * private_LuaCembed_format_vaarg(const char *expresion, va_list args); - -char * private_LuaCembed_format(const char *expresion, ...); - - diff --git a/build/c/dependencies/luaCEmbed/namespace/LuaCEmbedNamespace/LuaCEmbedNamespace.c b/build/c/dependencies/luaCEmbed/namespace/LuaCEmbedNamespace/LuaCEmbedNamespace.c deleted file mode 100644 index 5d049f9..0000000 --- a/build/c/dependencies/luaCEmbed/namespace/LuaCEmbedNamespace/LuaCEmbedNamespace.c +++ /dev/null @@ -1,46 +0,0 @@ - - -#include "../../LuaCEmbed/basic/basic.h" - -LuaCEmbedNamespace newLuaCEmbedNamespace(){ - LuaCEmbedNamespace self = {0}; - self.newLuaLib = newLuaCEmbedLib; - self.load_lib_from_c = LuaCEmbed_load_lib_from_c; - self.newLuaEvaluation = newLuaCEmbedEvaluation; - self.set_delete_function = LuaCembed_set_delete_function; - self.perform = LuaCembed_perform; - self.set_memory_limit = LuaCEmbed_set_memory_limit; - self.clear_errors = LuaCEmbed_clear_errors; - self.convert_arg_code = LuaCembed_convert_arg_code; - self.tables = newLuaCembedTableModule(); - self.args = newLuaCembedArgsModule(); - self.types = newLuaCEmbedTypeModule(); - self.globals = newLuaCEmbedGlobalModule(); - self.response = newLuaCEmbedResponseModule(); - self.get_error_message = LuaCEmbed_get_error_message; - self.has_errors = LuaCEmbed_has_errors; - self.set_timeout = LuaCEmbed_set_timeout; - self.evaluate = LuaCEmbed_evaluate; - self.get_string_evaluation = LuaCEmbed_get_evaluation_string; - self.get_evaluation_type = LuaCEmbed_get_evaluation_type; - self.get_evaluation_size = LuaCEmbed_get_evaluation_table_size; - self.get_evaluation_long = LuaCEmbed_get_evaluation_long; - self.get_evaluation_double = LuaCEmbed_get_evaluation_double; - self.get_evaluation_bool = LuaCEmbed_get_evaluation_bool; - self.evaluete_file = LuaCEmbed_evaluete_file; - self.add_callback = LuaCEmbed_add_callback; - self.add_global_callback = LuaCEmbed_add_global_callback; - self.set_bool_lib_prop = LuaCEmbed_set_bool_lib_prop; - self.set_long_lib_prop = LuaCEmbed_set_long_lib_prop; - self.set_double_lib_prop = LuaCEmbed_set_double_lib_prop; - self.set_string_lib_prop = LuaCEmbed_set_string_lib_prop; - self.set_table_lib_prop = LuaCEmbed_set_table_lib_prop; - self.get_long_lib_prop = LuaCEmbed_get_long_lib_prop; - self.get_double_lib_prop = LuaCEmbed_get_double_lib_prop; - self.get_bool_lib_prop = LuaCEmbed_get_bool_lib_prop; - self.get_string_lib_prop = LuaCEmbed_get_string_lib_prop; - self.get_table_lib_prop = LuaCEmbed_get_table_lib_prop; - - self.free = LuaCEmbed_free; - return self; -} diff --git a/build/c/dependencies/luaCEmbed/namespace/LuaCEmbedNamespace/LuaCEmbedNamespace.h b/build/c/dependencies/luaCEmbed/namespace/LuaCEmbedNamespace/LuaCEmbedNamespace.h deleted file mode 100644 index 0b84877..0000000 --- a/build/c/dependencies/luaCEmbed/namespace/LuaCEmbedNamespace/LuaCEmbedNamespace.h +++ /dev/null @@ -1,51 +0,0 @@ - - -typedef struct{ - LuaCEmbedTypeModule types; - LuaCEmbedResponseModule response; - LuaCembedArgsModule args; - LuaCEmbedGlobalModule globals; - LuaCembedTableModule tables; - void (*clear_errors)(LuaCEmbed *self); - LuaCEmbed * (*newLuaLib)(lua_State *state); - void (*set_delete_function)(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)); - LuaCEmbed * (*newLuaEvaluation)(); - void (*load_lib_from_c)(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name); - int (*perform)(LuaCEmbed *self); - const char * (*convert_arg_code)(int arg_code); - void (*set_memory_limit)(LuaCEmbed *self, double limit); - - char * (*get_error_message)(LuaCEmbed *self); - bool (*has_errors)(LuaCEmbed *self); - void (*set_timeout)(int seconds); - int (*evaluate)(LuaCEmbed *self, const char *code, ...); - char * (*get_string_evaluation)(LuaCEmbed *self,const char *code, ...); - int (*get_evaluation_type)(LuaCEmbed *self,const char *code,...); - long (*get_evaluation_size)(LuaCEmbed *self,const char *code,...); - long long (*get_evaluation_long)(LuaCEmbed *self,const char *code,...); - double (*get_evaluation_double)(LuaCEmbed *self,const char *code,...); - bool (*get_evaluation_bool)(LuaCEmbed *self, const char *code,...); - - void (*set_long_lib_prop)(LuaCEmbed *self,const char *name,long long value); - - void (*set_double_lib_prop)(LuaCEmbed *self,const char *name,double value); - void (*set_bool_lib_prop)(LuaCEmbed *self,const char *name,bool value); - void (*set_string_lib_prop)(LuaCEmbed *self,const char *name,const char * value); - void (*set_table_lib_prop)(LuaCEmbed *self,const char *name,LuaCEmbedTable *value); - - long long (*get_long_lib_prop)(LuaCEmbed *self,const char *name); - double (*get_double_lib_prop)(LuaCEmbed *self,const char *name); - bool (*get_bool_lib_prop)(LuaCEmbed *self,const char *name); - char * (*get_string_lib_prop)(LuaCEmbed *self,const char *name); - LuaCEmbedTable *(*get_table_lib_prop)(LuaCEmbed *self,const char *name); - - int (*evaluete_file)(LuaCEmbed *self, const char *file); - void (*add_callback)(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - void (*add_global_callback)(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - - void (*free)(LuaCEmbed *self); - -} LuaCEmbedNamespace; - -LuaCEmbedNamespace newLuaCEmbedNamespace(); - diff --git a/build/c/dependencies/luaCEmbed/namespace/args/args.c b/build/c/dependencies/luaCEmbed/namespace/args/args.c deleted file mode 100644 index eff0f29..0000000 --- a/build/c/dependencies/luaCEmbed/namespace/args/args.c +++ /dev/null @@ -1,21 +0,0 @@ - - -LuaCembedArgsModule newLuaCembedArgsModule(){ - LuaCembedArgsModule self = {0}; - self.get_bool = LuaCEmbed_get_bool_arg; - self.get_long = LuaCEmbed_get_long_arg; - self.get_double = LuaCEmbed_get_double_arg; - self.get_str = LuaCEmbed_get_str_arg; - self.get_raw_str = LuaCEmbed_get_raw_str_arg; - self.get_type = LuaCEmbed_get_arg_type; - self.get_table = LuaCEmbed_get_arg_table; - self.size = LuaCEmbed_get_total_args; - self.get_type_clojure_evalation = LuaCEmbed_get_type_clojure_evalation; - self.generate_arg_clojure_evalation = LuaCEmbed_generate_arg_clojure_evalation; - self.get_bool_arg_clojure_evalation = LuaCEmbed_get_bool_arg_clojure_evalation; - self.get_long_arg_clojure_evalation = LuaCEmbed_get_long_arg_clojure_evalation; - self.get_double_arg_clojure_evalation = LuaCEmbed_get_double_arg_clojure_evalation; - self.get_string_arg_clojure_evalation = LuaCEmbed_get_string_arg_clojure_evalation; - self.run_lambda = LuaCEmbed_run_args_lambda; - return self; -} \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/namespace/args/args.h b/build/c/dependencies/luaCEmbed/namespace/args/args.h deleted file mode 100644 index 060d971..0000000 --- a/build/c/dependencies/luaCEmbed/namespace/args/args.h +++ /dev/null @@ -1,26 +0,0 @@ - -typedef struct { - - - int (*size)(LuaCEmbed *self); - int (*get_type)(LuaCEmbed *self,int index); - long long (*get_long)(LuaCEmbed *self, int index); - double (*get_double)(LuaCEmbed *self, int index); - bool (*get_bool)(LuaCEmbed *self, int index); - char * (*get_raw_str)(LuaCEmbed *self, long *size, int index); - char * (*get_str)(LuaCEmbed *self, int index); - LuaCEmbedTable * (*get_table)(LuaCEmbed *self,int index); - int (*generate_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - int (*get_type_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - long long (*get_long_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - double (*get_double_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - bool (*get_bool_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - char* (*get_string_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - LuaCEmbedTable* (*run_lambda)(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call,int total_returns); - - - - -} LuaCembedArgsModule; - -LuaCembedArgsModule newLuaCembedArgsModule(); \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/namespace/declaration.h b/build/c/dependencies/luaCEmbed/namespace/declaration.h deleted file mode 100644 index 672f719..0000000 --- a/build/c/dependencies/luaCEmbed/namespace/declaration.h +++ /dev/null @@ -1,7 +0,0 @@ - -#include "types/types.h" -#include "response/response.h" -#include "globals/globals.h" -#include "args/args.h" -#include "table/table.h" -#include "LuaCEmbedNamespace/LuaCEmbedNamespace.h" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/namespace/definition.h b/build/c/dependencies/luaCEmbed/namespace/definition.h deleted file mode 100644 index e488a6d..0000000 --- a/build/c/dependencies/luaCEmbed/namespace/definition.h +++ /dev/null @@ -1,7 +0,0 @@ - -#include "types/types.c" -#include "response/response.c" -#include "globals/globals.c" -#include "args/args.c" -#include "table/table.c" -#include "LuaCEmbedNamespace/LuaCEmbedNamespace.c" \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/namespace/globals/globals.c b/build/c/dependencies/luaCEmbed/namespace/globals/globals.c deleted file mode 100644 index 970e64e..0000000 --- a/build/c/dependencies/luaCEmbed/namespace/globals/globals.c +++ /dev/null @@ -1,23 +0,0 @@ - - -LuaCEmbedGlobalModule newLuaCEmbedGlobalModule(){ - LuaCEmbedGlobalModule self = {0}; - self.ensure_type = LuaCEmbed_ensure_global_type; - self.get_double = LuaCEmbed_get_global_double; - self.get_string = LuaCEmbed_get_global_string; - self.get_long = LuaCEmbed_get_global_long; - self.get_raw_string = LuaCEmbed_get_global_raw_string; - self.set_raw_string = LuaCEmbed_set_global_raw_string; - self.get_bool = LuaCEmbed_get_global_bool; - self.get_type = LuaCEmbed_get_global_type; - self.run_global_lambda = LuaCEmbed_run_global_lambda; - self.set_table = LuaCEmbed_set_global_table; - self.set_string = LuaCEmbed_set_global_string; - self.set_bool = LuaCEmbed_set_global_bool; - self.set_double = LuaCEmbed_set_global_double; - self.set_long = LuaCEmbed_set_global_long; - self.new_table = LuaCembed_new_global_table; - self.get_table = LuaCembed_get_global_table; - - return self; -} \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/namespace/globals/globals.h b/build/c/dependencies/luaCEmbed/namespace/globals/globals.h deleted file mode 100644 index d1e6e78..0000000 --- a/build/c/dependencies/luaCEmbed/namespace/globals/globals.h +++ /dev/null @@ -1,28 +0,0 @@ - - -typedef struct { - - int (*ensure_type)(LuaCEmbed *self, const char *name,int expected_type); - int (*get_type)(LuaCEmbed *self,const char *name); - long long (*get_long)(LuaCEmbed *self,const char *name); - double (*get_double)(LuaCEmbed *self,const char *name); - bool (*get_bool)(LuaCEmbed *self,const char *name); - char * (*get_string)(LuaCEmbed *self,const char *name); - LuaCEmbedTable* (*run_global_lambda)(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns); - void (*set_table)(LuaCEmbed *self, const char *name, LuaCEmbedTable *table); - void (*set_raw_string)(LuaCEmbed *self, const char *name, const char *value, long size); - char * (*get_raw_string)(LuaCEmbed *self, const char *name, long *size); - - - void (*set_string)(LuaCEmbed *self,const char *name,const char *value); - void (*set_long)(LuaCEmbed *self,const char *name,long long value); - void (*set_double)(LuaCEmbed *self,const char *name,double value); - void (*set_bool)(LuaCEmbed *self,const char *name,bool value); - - LuaCEmbedTable * (*get_table)(LuaCEmbed *self, const char *name); - LuaCEmbedTable * (*new_table)(LuaCEmbed *self, const char *name); - - -}LuaCEmbedGlobalModule; - -LuaCEmbedGlobalModule newLuaCEmbedGlobalModule(); \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/namespace/response/response.c b/build/c/dependencies/luaCEmbed/namespace/response/response.c deleted file mode 100644 index 0e58669..0000000 --- a/build/c/dependencies/luaCEmbed/namespace/response/response.c +++ /dev/null @@ -1,17 +0,0 @@ - - -LuaCEmbedResponseModule newLuaCEmbedResponseModule(){ - LuaCEmbedResponseModule self = {0}; - self.send_multi_return = LuaCEmbed_send_multi_return; - self.send_str = LuaCEmbed_send_str; - self.send_str_reference = LuaCEmbed_send_str_reference; - self.send_raw_string = LuaCEmbed_send_raw_string; - self.send_raw_string_reference = LuaCEmbed_send_raw_string_reference; - self.send_bool = LuaCEmbed_send_bool; - self.send_double = LuaCEmbed_send_double; - self.send_evaluation_function = LuaCEmbed_send_evaluation; - self.send_long = LuaCEmbed_send_long; - self.send_table = LuaCEmbed_send_table; - self.send_error = LuaCEmbed_send_error; - return self; -} diff --git a/build/c/dependencies/luaCEmbed/namespace/response/response.h b/build/c/dependencies/luaCEmbed/namespace/response/response.h deleted file mode 100644 index 52edc41..0000000 --- a/build/c/dependencies/luaCEmbed/namespace/response/response.h +++ /dev/null @@ -1,18 +0,0 @@ - - -typedef struct { - LuaCEmbedResponse * (*send_multi_return)(LuaCEmbedTable *table); - LuaCEmbedResponse * (*send_str)(const char *text); - LuaCEmbedResponse * (*send_raw_string)(const char *text,long size); - LuaCEmbedResponse * (*send_str_reference)( const char *text); - LuaCEmbedResponse * (*send_raw_string_reference)(const char *text,long size); - LuaCEmbedResponse * (*send_table)(LuaCEmbedTable *table); - LuaCEmbedResponse * (*send_evaluation_function)(const char *function); - LuaCEmbedResponse * (*send_double)(double value); - LuaCEmbedResponse * (*send_bool)(bool value); - LuaCEmbedResponse * (*send_long)(long value); - LuaCEmbedResponse * (*send_error)(const char *format,...); - -}LuaCEmbedResponseModule; - -LuaCEmbedResponseModule newLuaCEmbedResponseModule(); \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/namespace/table/table.c b/build/c/dependencies/luaCEmbed/namespace/table/table.c deleted file mode 100644 index f06b17d..0000000 --- a/build/c/dependencies/luaCEmbed/namespace/table/table.c +++ /dev/null @@ -1,58 +0,0 @@ - - -LuaCembedTableModule newLuaCembedTableModule(){ - LuaCembedTableModule self ={0}; - - self.append_string = LuaCEmbedTable_append_string; - self.append_bool = LuaCEmbedTable_append_bool; - self.append_double = LuaCEmbedTable_append_double; - self.append_long = LuaCEmbedTable_append_long; - self.append_table = LuaCEmbedTable_append_table; - self.append_evaluation = LuaCEmbedTable_append_evaluation; - - self.insert_string_at_index = LuaCEmbedTable_insert_string_at_index; - self.insert_double_at_index = LuaCEmbedTable_insert_double_at_index; - self.insert_long_at_index = LuaCEmbedTable_insert_long_at_index; - self.insert_table_at_index = LuaCEmbedTable_insert_table_at_index; - - self.set_evaluation_prop = LuaCEmbedTable_set_evaluation_prop; - self.set_method = LuaCEmbedTable_set_method; - self.set_method = LuaCEmbedTable_set_method; - self.set_bool_prop = LuaCEmbedTable_set_bool_prop; - self.set_double_prop = LuaCEmbedTable_set_double_prop; - self.set_long_prop = LuaCEmbedTable_set_long_prop; - self.set_string_prop = LuaCEmbedTable_set_string_prop; - - self.get_sub_table_prop = LuaCEmbedTable_get_sub_table_by_key; - self.new_sub_table_prop = LuaCEmbedTable_new_sub_table_by_key; - self.set_sub_table_prop = LuaCEmbedTable_set_sub_table_prop; - self.new_anonymous_table = LuaCembed_new_anonymous_table; - - self.set_sub_table_by_index = LuaCEmbedTable_set_sub_table_by_index; - self.get_bool_prop = LuaCembedTable_get_bool_prop; - self.get_double_prop = LuaCembedTable_get_double_prop; - self.get_long_prop = LuaCembedTable_get_long_prop; - self.get_string_prop = LuaCembedTable_get_string_prop; - self.get_type_prop = LuaCEmbedTable_get_type_prop; - self.destroy_prop = LuaCembedTable_destroy_prop; - - self.set_long_by_index = LuaCEmbedTable_set_long_by_index; - self.set_bool_by_index= LuaCEmbedTable_set_bool_by_index; - self.set_double_by_index =LuaCEmbedTable_set_double_by_index; - self.set_string_by_index = LuaCEmbedTable_set_string_by_index; - self.set_evaluation_by_index = LuaCEmbedTable_set_evaluation_by_index; - - self.get_listable_size = LuaCEmbedTable_get_listable_size; - - self.new_sub_table_appending = LuaCEmbedTable_new_sub_table_appending; - self.has_key = LuaCembedTable_has_key_at_index; - self.get_key_by_index = LuaCembedTable_get_key_by_index; - self.get_size = LuaCEmbedTable_get_full_size; - self.get_type_by_index = LuaCEmbedTable_get_type_by_index; - self.get_long_by_index = LuaCEmbedTable_get_long_by_index; - self.get_double_by_index = LuaCEmbedTable_get_double_by_index; - self.get_bool_by_index = LuaCEmbedTable_get_bool_by_index; - self.get_string_by_index= LuaCEmbedTable_get_string_by_index; - self.get_sub_table_by_index = LuaCEmbedTable_get_sub_table_by_index; - return self; -} diff --git a/build/c/dependencies/luaCEmbed/namespace/table/table.h b/build/c/dependencies/luaCEmbed/namespace/table/table.h deleted file mode 100644 index 5fbbf9f..0000000 --- a/build/c/dependencies/luaCEmbed/namespace/table/table.h +++ /dev/null @@ -1,59 +0,0 @@ - -typedef struct { - - void (*append_string)(LuaCEmbedTable *self, const char *value); - void (*append_long)(LuaCEmbedTable *self, long long value); - void (*append_double)(LuaCEmbedTable *self, double value); - void (*append_bool)(LuaCEmbedTable *self, bool value); - void (*append_table)(LuaCEmbedTable *self, LuaCEmbedTable *table); - void (*set_evaluation_prop)(LuaCEmbedTable *self, const char *name, const char *code, ...); - void (*append_evaluation)(LuaCEmbedTable *self, const char *code, ...); - - void (*insert_string_at_index)(LuaCEmbedTable *self, long index, const char *value); - void (*insert_bool_at_index)(LuaCEmbedTable *self, long index,bool value); - void (*insert_long_at_index)(LuaCEmbedTable *self, long long index,long value); - void (*insert_double_at_index)(LuaCEmbedTable *self, long index,double value); - void (*insert_table_at_index)(LuaCEmbedTable *self, long index,LuaCEmbedTable *table); - - - - void (*set_sub_table_by_index)(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table); - void (*set_string_by_index)(LuaCEmbedTable *self, long index, const char *value); - void (*set_long_by_index)(LuaCEmbedTable *self, long long index, long value); - void (*set_double_by_index)(LuaCEmbedTable *self, long index, double value); - void (*set_bool_by_index)(LuaCEmbedTable *self, long index, bool value); - void (*set_evaluation_by_index)(LuaCEmbedTable *self, long index, const char *code, ...); - long (*get_listable_size)(LuaCEmbedTable *self); - LuaCEmbedTable *(*get_sub_table_by_index)(LuaCEmbedTable *self, long index); - - LuaCEmbedTable *(*new_sub_table_appending)(LuaCEmbedTable *self); - - void (*set_method)(LuaCEmbedTable *self , const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)); - void (*set_string_prop)(LuaCEmbedTable *self , const char *name, const char *value); - void (*set_long_prop)(LuaCEmbedTable *self , const char *name, long long value); - void (*set_double_prop)(LuaCEmbedTable *self , const char *name, double value); - void (*set_bool_prop)(LuaCEmbedTable *self , const char *name, bool value); - int (*get_type_prop)(LuaCEmbedTable *self, const char *name); - char* (*get_string_prop)(LuaCEmbedTable *self , const char *name); - long long (*get_long_prop)(LuaCEmbedTable *self , const char *name); - double (*get_double_prop)(LuaCEmbedTable *self , const char *name); - bool (*get_bool_prop)(LuaCEmbedTable *self , const char *name); - LuaCEmbedTable * (*new_anonymous_table)(LuaCEmbed *self); - void (*destroy_prop)(LuaCEmbedTable *self, const char *name); - - LuaCEmbedTable *(*get_sub_table_prop)(LuaCEmbedTable *self, const char *name); - LuaCEmbedTable *(*new_sub_table_prop)(LuaCEmbedTable *self, const char *name); - void (*set_sub_table_prop)(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table); - char *(*get_key_by_index)(LuaCEmbedTable *self, long index); - bool (*has_key)(LuaCEmbedTable *self,long index); - - long (*get_size)(LuaCEmbedTable *self); - int (*get_type_by_index)(LuaCEmbedTable *self, int index); - long long (*get_long_by_index)(LuaCEmbedTable *self, int index); - double (*get_double_by_index)(LuaCEmbedTable *self, int index); - char * (*get_string_by_index)(LuaCEmbedTable *self, int index); - bool (*get_bool_by_index)(LuaCEmbedTable *self, int index); - -}LuaCembedTableModule; - -LuaCembedTableModule newLuaCembedTableModule(); diff --git a/build/c/dependencies/luaCEmbed/namespace/types/types.c b/build/c/dependencies/luaCEmbed/namespace/types/types.c deleted file mode 100644 index 34cd409..0000000 --- a/build/c/dependencies/luaCEmbed/namespace/types/types.c +++ /dev/null @@ -1,12 +0,0 @@ - -LuaCEmbedTypeModule newLuaCEmbedTypeModule(){ - LuaCEmbedTypeModule self = {0}; - self.NOT_FOUND = LUA_CEMBED_NOT_FOUND; - self.STRING = LUA_CEMBED_STRING; - self.NUMBER = LUA_CEMBED_NUMBER; - self.BOOL = LUA_CEMBED_BOOL; - self.NILL = LUA_CEMBED_NIL; - self.TABLE = LUA_CEMBED_TABLE; - self.FUNCTION = LUA_CEMBED_FUNCTION; - return self; -} \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/namespace/types/types.h b/build/c/dependencies/luaCEmbed/namespace/types/types.h deleted file mode 100644 index fe1475b..0000000 --- a/build/c/dependencies/luaCEmbed/namespace/types/types.h +++ /dev/null @@ -1,15 +0,0 @@ - - -typedef struct { - int NOT_FOUND; - int STRING; - int NUMBER; - int BOOL; - int NILL; - int TABLE; - int FUNCTION; - - -}LuaCEmbedTypeModule; - -LuaCEmbedTypeModule newLuaCEmbedTypeModule(); \ No newline at end of file diff --git a/build/c/dependencies/luaCEmbed/one.c b/build/c/dependencies/luaCEmbed/one.c deleted file mode 100644 index 1c342f7..0000000 --- a/build/c/dependencies/luaCEmbed/one.c +++ /dev/null @@ -1,9 +0,0 @@ - - -#ifndef LUACEMBED_H - -#include "declaration.h" -#include "definition.h" - -#define LUACEMBED_H -#endif \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/b64/b64.c b/build/c/dependencies/luaDoTheWorld/b64/b64.c deleted file mode 100644 index 58d394a..0000000 --- a/build/c/dependencies/luaDoTheWorld/b64/b64.c +++ /dev/null @@ -1,50 +0,0 @@ - -LuaCEmbedResponse * base64_encode_file(LuaCEmbed *args){ - char *source = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - char * b64_string = dtw_convert_binary_file_to_base64(source); - if(!b64_string){ - char *formated = private_LuaCembed_format(FILE_NOT_FOUND, source); - LuaCEmbedResponse *response = LuaCEmbed_send_error(formated); - free(formated); - return response; - } - - LuaCEmbedResponse *response = LuaCEmbed_send_str(b64_string); - free(b64_string); - return response; -} - - -LuaCEmbedResponse * base64_decode(LuaCEmbed *args){ - - char *source = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - long size; - unsigned char *content = dtw_base64_decode(source,&size); - content[size] = '\0'; - LuaCEmbedResponse* response = LuaCEmbed_send_raw_string((char*)content,size); - free(content); - return response; - -} - -LuaCEmbedResponse * base64_encode(LuaCEmbed *args){ - Writeble write_obj = create_writeble(args,0); - if(write_obj.error){ - return write_obj.error; - } - - char *created = dtw_base64_encode(write_obj.content,write_obj.size); - Writeble_free(&write_obj); - LuaCEmbedResponse *response = LuaCEmbed_send_str(created); - free(created); - return response; -} - diff --git a/build/c/dependencies/luaDoTheWorld/b64/b64.h b/build/c/dependencies/luaDoTheWorld/b64/b64.h deleted file mode 100644 index a4e0be8..0000000 --- a/build/c/dependencies/luaDoTheWorld/b64/b64.h +++ /dev/null @@ -1,7 +0,0 @@ - -LuaCEmbedResponse * base64_encode_file(LuaCEmbed *args); - -LuaCEmbedResponse * base64_decode(LuaCEmbed *args); - -LuaCEmbedResponse * base64_encode(LuaCEmbed *args); - diff --git a/build/c/dependencies/luaDoTheWorld/constants/all.h b/build/c/dependencies/luaDoTheWorld/constants/all.h deleted file mode 100644 index da478e2..0000000 --- a/build/c/dependencies/luaDoTheWorld/constants/all.h +++ /dev/null @@ -1,13 +0,0 @@ -#include "props.h" -#include "commun_methods.h" -#include "type_codes.h" -#include "errors.h" -#include "func_names.h" -#include "schema_methods.h" -#include "resource_methods.h" -#include "hasher_methods.h" -#include "transactions_methods.h" -#include "path_methods.h" -#include "tree_methods.h" -#include "tree_props.h" -#include "tree_part_methods.h" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/constants/commun_methods.h b/build/c/dependencies/luaDoTheWorld/constants/commun_methods.h deleted file mode 100644 index dbf96aa..0000000 --- a/build/c/dependencies/luaDoTheWorld/constants/commun_methods.h +++ /dev/null @@ -1,33 +0,0 @@ -#define DELETE_METHOD "__gc" -#define TO_STRING_METHOD "__tostring" -#define TO_NUMBER_METHOD "__tonumber" -#define TO_BOOLEAN_METHOD "__tobolean" -#define INDEX_METHOD "__index" -#define SET_VALUE_METHOD "set_value" -#define GET_VALUE_METHOD "get_value" -#define COMMIT_METHOD "commit" -#define DESTROY_METHOD "destroy" - -#define SIZE_METHOD "size" -#define GET_PATH_METHOD "get_path" - -#define GET_DIR_METHOD "get_dir" -#define GET_NAME_METHOD "get_name" -#define GET_NAME_WITHOUT_EXTENSION "get_name_without_extension" -#define GET_EXTENSION_METHOD "get_extension" -#define GET_ONLY_NAME_METHOD "get_only_name" - -#define WRITE_METHOD "write" -#define REMOVE_ANY_METHOD "remove_any" -#define MOVE_ANY_METHOD "move_any" -#define COPY_ANY_METHOD "copy_any" -#define DUMP_TO_JSON_FILE_METHOD "dump_to_json_file" -#define DUMP_TO_JSON_STRING "dump_to_json_string" -#define EACH_METHOD "each" -#define MAP_METHOD "map" -#define COUNT_METHOD "count" -#define FIND_METHOD "find" -#define LIST_METHOD "list" -#define GET_SIZE_METHOD "get_size" -#define SET_EXTENSION_METHOD "set_extension" - diff --git a/build/c/dependencies/luaDoTheWorld/constants/errors.h b/build/c/dependencies/luaDoTheWorld/constants/errors.h deleted file mode 100644 index 397715e..0000000 --- a/build/c/dependencies/luaDoTheWorld/constants/errors.h +++ /dev/null @@ -1,11 +0,0 @@ -#define NOT_EXPECTED_TYPE "table its not a %s type" -#define FILE_NOT_FOUND "file %s not found" -#define FOLDER_NOT_FOUND "folder %s not found" - -#define ARGUMENT_NOT_PROVIDED "argument not provided" - -#define NOT_WRITEBLE_ELEMENT "element of type %s its not in (string,bool,bytes,number)" -#define INVALID_INDEX "invalid index" -#define INVALID_JSON_FILE "file %s its not a valid json" -#define INVALID_JSON_STRING "content its not a valid json" -#define ARGUMENT_NOT_IN_STRING_OR_STRING_ARRAY "arg type in string, string[]" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/constants/func_names.h b/build/c/dependencies/luaDoTheWorld/constants/func_names.h deleted file mode 100644 index 5d020bb..0000000 --- a/build/c/dependencies/luaDoTheWorld/constants/func_names.h +++ /dev/null @@ -1,42 +0,0 @@ -#define LOAD_FILE "load_file" -#define WRITE_FILE "write_file" - -#define COPY_ANY_OVERWRITING "copy_any_overwriting" -#define COPY_ANY_MERGING "copy_any_merging" -#define MOVE_ANY_OVERWRITING "move_any_overwriting" -#define MOVE_ANY_MERGING "move_any_merging" -#define REMOVE_ANY "remove_any" - -#define LIST_FILES "list_files" -#define LIST_FILES_RECURSIVELY "list_files_recursively" -#define LIST_DIRS "list_dirs" -#define LIST_DIRS_RECURSIVELY "list_dirs_recursively" -#define LIST_ALL "list_all" -#define LIST_ALL_RECURSIVELY "list_all_recursively" - -#define BBASE_64_ENCODE_FILE "base64_encode_file" -#define BBASE_64_ENCODE "base64_encode" -#define BBASE_64_DECODE "base64_decode" - -#define GENERATE_SHA "generate_sha" -#define GENERATE_SHA_FROM_FILE "generate_sha_from_file" -#define NEW_HASHER "newHasher" -#define NEW_RESOURCE "newResource" -#define IS_BLOB_FUNC "is_blob" - -#define IS_DIR_FUNC "isdir" -#define IS_FILE_FUNC "isfile" -#define IS_FILE_BLOB "isfile_blob" - -#define GENERATE_SHA_FROM_FOLDER_BY_CONTENT "generate_sha_from_folder_by_content" -#define GENERATE_SHA_FROM_FOLDER_BY_LAST_MODIFICATION "generate_sha_from_folder_by_last_modification" -#define CONCAT_PATH "concat_path" -#define NEW_TRANSACTION_FROM_JSON_STRING "new_transaction_from_json_string" -#define NEW_TRANSACTION_FROM_JSON_FILE "new_transaction_from_file" -#define NEW_TRANSACTION "newTransaction" -#define NEW_SCHEMA "newSchema" -#define NEW_PATH "newPath" -#define NEW_TREE "newTree" -#define NEW_TREE_FROM_HARWARE "newTree_from_hardware" -#define STARTS_WITH "starts_with" -#define ENDS_WITH "ends_with" diff --git a/build/c/dependencies/luaDoTheWorld/constants/hasher_methods.h b/build/c/dependencies/luaDoTheWorld/constants/hasher_methods.h deleted file mode 100644 index ecb7115..0000000 --- a/build/c/dependencies/luaDoTheWorld/constants/hasher_methods.h +++ /dev/null @@ -1,4 +0,0 @@ -#define DIGESST_METHOD "digest" -#define DIGESST_FOLDER_BY_CONTENT_METHOD "digest_folder_by_content" -#define DIGESST_FOLDER_BY_LAST_MODIFICATION_METHOD "digest_folder_by_last_modification" -#define DIGESST_FILE_METHOD "digest_file" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/constants/path_methods.h b/build/c/dependencies/luaDoTheWorld/constants/path_methods.h deleted file mode 100644 index 84f1e83..0000000 --- a/build/c/dependencies/luaDoTheWorld/constants/path_methods.h +++ /dev/null @@ -1,21 +0,0 @@ - -#define PATH_CHANGED_METHOD "path_changed" -#define PATH_ADD_END_DIR_METHOD "path_add_end_dir" -#define PATH_CHANGED_METHOD "path_changed" -#define PATH_ADD_START_DIR_METHOD "add_start_dir" -#define PATH_GET_FULL_PATH_METHOD "get_full_path" -#define PATH_TO_STRING_METHOD "to_string" -#define PATH_REPLACE_DIRS_METHOD "replace_dirs" -#define PATH_GET_TOTAL_DIRS_METHOD "get_total_dirs" -#define PATH_GET_SUB_DIRS_FROM_INDEX_METHOD "get_sub_dirs_from_index" -#define PATH_INSERT_DIR_AT_INDEX_METHOD "insert_dir_at_index" -#define PATH_REMOVE_SUB_DIR_AT_INDEX_METHOD "remove_sub_dir_at_index" -#define PATH_INSERT_DIR_AFTER_METHOD "insert_dir_after" -#define PATH_INSERT_DIR_BEFORE_METHOD "insert_dir_before" -#define PATH_REMOVE_SUB_DIRS_AT_METHOD "remove_dir_at" - -#define PATH_SET_NAME_METHOD "set_name" -#define PATH_SET_DIR_METHOD "set_dir" -#define PATH_SET_PATH_METHOD "set_path" -#define PATH_SET_ONLY_NAME_METHOD "set_only_name" -#define PATH_UNPACK "unpack" diff --git a/build/c/dependencies/luaDoTheWorld/constants/props.h b/build/c/dependencies/luaDoTheWorld/constants/props.h deleted file mode 100644 index a5e1dcd..0000000 --- a/build/c/dependencies/luaDoTheWorld/constants/props.h +++ /dev/null @@ -1,14 +0,0 @@ -#define DTW_TYPE "dtw_type" -#define SIZE "size" -#define CONTENT_POINTER "dtw_content_pointer" -#define HASH_POINTER "dtw_hash_pointer" -#define RESOURCE_POINTER "dtw_resource_pointer" -#define ACTION_TRANSACTION_POINTER "dtw_action_transaction_pointer" -#define IS_A_REF "dtw_is_a_ref" -#define TRANSACTION_POINTER "dtw_transaction" -#define SCHEMA_POINTER "dtw_schema" -#define TREE_PART_POINTER "dtw_tree_part" -#define PATH_POINTER "dtw_path_pointer" -#define TREE_POINTER "dtw_tree" -#define TREE_PART_POINTER "dtw_tree_part" -#define PATH_PROPS "path" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/constants/resource_methods.h b/build/c/dependencies/luaDoTheWorld/constants/resource_methods.h deleted file mode 100644 index bf63434..0000000 --- a/build/c/dependencies/luaDoTheWorld/constants/resource_methods.h +++ /dev/null @@ -1,27 +0,0 @@ -#define ADD_PRIMARY_KEYS "add_primary_keys" -#define DANGEROUS_REMOVE_PROP_METHOD "dangerous_remove_prop" -#define DANGEROUS_RENAME_PROP_METHOD "dangerous_rename_prop" -#define GET_RESOURCE_MATCHING_PRIMARY_KEY_METHOD "get_resource_matching_primary_key" -#define GET_RESOURCE_BY_NAME_ID "get_resource_by_name_id" -#define SCHEMA_NEW_INSERTION "schema_new_insertion" -#define SET_VALUE_IN_SUB_RESOURCE_METHOD "set_value_in_sub_resource" -#define GET_VALUE_FROM_SUB_RESOURCE_METHOD "get_value_from_sub_resource" -#define GET_PATH_STRING_METHOD "get_path_string" -#define RESOURCE_RENAME_METHOD "rename" -#define SCHEMA_COUNT_RESOURCE_METHOD "schema_count" -#define SCHEMA_LIST_RESOURCE_METHOD "schema_list" -#define SCHEMA_FIND_RESOURCE_METHOD "schema_find" -#define SCHEMA_MAP_RESOURCE_METHOD "schema_map" -#define SCHEMA_EACH_METHOD "schema_each" -#define SUB_RESOURCE_NEXT_METHOD "sub_resource_next" -#define SUB_RESOURCE_NOW_METHOD "sub_resource_now" -#define SUB_RESOURCE_NOW_IN_UNIX "sub_resource_now_in_unix" -#define SUB_RESOURCE_METHOD "sub_resource" -#define RESOURCE_GET_STRING "get_string" -#define RESOURCE_GET_NUMBER "get_number" -#define RESOURCE_GET_BOOL "get_bool" - -#define UNLOAD_METHOD "unload" -#define UNLOCK_METHOD "unlock" -#define LOCK_METHOD "lock" -#define RESOURCE_NEW_SCHEMA "newSchema" diff --git a/build/c/dependencies/luaDoTheWorld/constants/schema_methods.h b/build/c/dependencies/luaDoTheWorld/constants/schema_methods.h deleted file mode 100644 index 7b3ea98..0000000 --- a/build/c/dependencies/luaDoTheWorld/constants/schema_methods.h +++ /dev/null @@ -1,2 +0,0 @@ -#define ADD_SUB_SCHEMA_METHOD "sub_schema" -#define SUB_SCHEMA_METHOD "sub_schema" diff --git a/build/c/dependencies/luaDoTheWorld/constants/transactions_methods.h b/build/c/dependencies/luaDoTheWorld/constants/transactions_methods.h deleted file mode 100644 index 141367c..0000000 --- a/build/c/dependencies/luaDoTheWorld/constants/transactions_methods.h +++ /dev/null @@ -1,10 +0,0 @@ - -#define LUA_DO_THE_WORLD_GET_DEST "get_dest" -#define LUA_DO_THE_WORLD_SET_DEST "set_dest" -#define LUA_DO_THE_WORLD_GET_SOURCE "get_source" -#define LUA_DO_THE_WORLD_SET_SOURCE "set_source" -#define LUA_DO_THE_WORLD_GET_CONTENT "get_content" -#define LUA_DO_THE_WORLD_SET_CONTENT "set_content" -#define LUA_DO_THE_WORLD_GET_TRANSACTION_TYPE_CODE "get_transaction_code" -#define LUA_DO_THE_WORLD_GET_TRANSACTION_TYPE_TEXT "get_transaction" -#define LUA_DO_THE_WORLD_GET_ACTION "get_action" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/constants/tree_methods.h b/build/c/dependencies/luaDoTheWorld/constants/tree_methods.h deleted file mode 100644 index d98f796..0000000 --- a/build/c/dependencies/luaDoTheWorld/constants/tree_methods.h +++ /dev/null @@ -1,8 +0,0 @@ -#define ADD_TREE_PART_METHOD "add_tree_part" -#define GET_TREE_PART_BY_INDEX_METHOD "get_tree_part_by_index" -#define INSECURE_HARDWARE_REMOVE_TREE "insecure_hardware_remove" -#define INSECURE_HARDWARE_WRITE_TREE "insecure_hardware_write_tree" -#define GET_TREE_PART_BY_NAME "get_tree_part_by_name" -#define GET_TREE_PART_BY_PATH "get_tree_part_by_path" - - diff --git a/build/c/dependencies/luaDoTheWorld/constants/tree_part_methods.h b/build/c/dependencies/luaDoTheWorld/constants/tree_part_methods.h deleted file mode 100644 index 7b743c6..0000000 --- a/build/c/dependencies/luaDoTheWorld/constants/tree_part_methods.h +++ /dev/null @@ -1,6 +0,0 @@ - -#define HARDWARE_REMOVE_METHOD "hardware_remove" -#define HARWARE_WRITE_METHOD "hardware_write" -#define HARDWARE_MODIFY_METHOD "hardware_modify" -#define GET_SHA_METHOD "get_sha" -#define LOAD_METHOD "load" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/constants/tree_props.h b/build/c/dependencies/luaDoTheWorld/constants/tree_props.h deleted file mode 100644 index 03714f9..0000000 --- a/build/c/dependencies/luaDoTheWorld/constants/tree_props.h +++ /dev/null @@ -1,9 +0,0 @@ -#define TREE_PROPS_CONTENT "content" -#define TREE_PROPS_CONTENT_DATA "content_data" -#define TREE_PROPS_HARDWARE_DATA "hardware_data" -#define TREE_PROPS_IGNORED_ELEMENTS "ignored_elemenets" -#define TREE_PROPS_MIMIFICATION "mimification" -#define TREE_PROPS_PATH_ATTRIBUTES "path_attributes" -#define TREE_NEW_TREE_PART_EMPTY "newTreePart_empty" -#define TREE_NEW_TREE_PART_LOADING "newTreePart_loading" -#define TREE_NEW_TREE_PART "newTreePart" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/constants/type_codes.h b/build/c/dependencies/luaDoTheWorld/constants/type_codes.h deleted file mode 100644 index c2462ec..0000000 --- a/build/c/dependencies/luaDoTheWorld/constants/type_codes.h +++ /dev/null @@ -1,3 +0,0 @@ -#define DTW_RESOURCE_TYPE 1 -#define DTW_ACTION_TRANSACTION_TYPE 3 -#define DTW_TREE_PART_TYPE 4 \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/declaration.h b/build/c/dependencies/luaDoTheWorld/declaration.h deleted file mode 100644 index aa5138a..0000000 --- a/build/c/dependencies/luaDoTheWorld/declaration.h +++ /dev/null @@ -1,13 +0,0 @@ -#include "constants/all.h" -#include "writeble/writble.h" -#include "io/io.h" -#include "types/types.h" -#include "listage/listage.h" -#include "b64/b64.h" -#include "sha/sha.h" -#include "hasher/hasher.h" -#include "resource/declaration.h" -#include "transaction/declaration.h" -#include "tree/declaration.h" -#include "path/path.h" -#include "extra/extra.h" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/definition.h b/build/c/dependencies/luaDoTheWorld/definition.h deleted file mode 100644 index 00c250a..0000000 --- a/build/c/dependencies/luaDoTheWorld/definition.h +++ /dev/null @@ -1,12 +0,0 @@ -#include "io/io.c" -#include "writeble/writble.c" -#include "types/types.c" -#include "listage/listage.c" -#include "b64/b64.c" -#include "sha/sha.c" -#include "hasher/hasher.c" -#include "resource/definition.h" -#include "transaction/definition.h" -#include "tree/definition.h" -#include "path/path.c" -#include "extra/extra.c" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/dependecies.h b/build/c/dependencies/luaDoTheWorld/dependecies.h deleted file mode 100644 index d9c9ba1..0000000 --- a/build/c/dependencies/luaDoTheWorld/dependecies.h +++ /dev/null @@ -1,4 +0,0 @@ - -#include "dependencies/LuaCEmbed.h" -#include "dependencies/doTheWorld.h" -#include "dependencies/UniversalGarbage.h" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/dependencies/LuaCEmbed.h b/build/c/dependencies/luaDoTheWorld/dependencies/LuaCEmbed.h deleted file mode 100644 index 901c05e..0000000 --- a/build/c/dependencies/luaDoTheWorld/dependencies/LuaCEmbed.h +++ /dev/null @@ -1,26983 +0,0 @@ - - - -#ifndef LUACEMBED_H - - -#ifdef _WIN32 -#include -#else -#include -#include -#endif - -#include -#include -#include -#include - - - - - -#ifndef UNIVERSAL_GARBAGE_H - - -#include -#include -#include -#include - - - - - -#define UniversalGarbage_create_empty_struct(name,element_type) \ -(element_type*)malloc(sizeof(element_type)); \ -*name = (element_type){0}; - - -#define UniversalGarbage_cast(value) ((void**)&value) - - -#define UniversalGarbage_add(garbage,deallocator_callback,value) \ - rawUniversalGarbage_add(garbage,(void*)deallocator_callback,UniversalGarbage_cast(value)) - -#define UniversalGarbage_add_simple(garbage,value) \ - UniversalGarbage_add(garbage,free,value) - - -#define UniversalGarbage_add_return(garbage,deallocator_callback,value) \ - UniversalGarbage_add(garbage->return_values,deallocator_callback,value) - - -#define UniversalGarbage_add_simple_return(garbage,value) \ - UniversalGarbage_add_simple(garbage->return_values,value) - - - -#define UniversalGarbage_remove(garbage,value) \ - rawUniversalGarbage_remove(garbage,UniversalGarbage_cast(value)); - - -#define UniversalGarbage_disconnect(garbage,value) \ - rawUniversalGarbage_disconnect(garbage,UniversalGarbage_cast(value)); - - - - -#define UniversalGarbage_reallocate(garbage,value) \ - rawUniversalGarbage_reallocate(garbage,UniversalGarbage_cast(value)) - - -#define UniversalGarbage_resset(garbage,value) \ - rawUniversalGarbage_resset(garbage,UniversalGarbage_cast(value)) - - - - - - -typedef struct privateUniversalGarbageElement{ - void **pointer; - void (*deallocator_callback)(void *element); - void *pointed_value; -}privateUniversalGarbageElement; - -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self); - - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self); - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer); - - - -typedef struct UniversalGarbage{ - - struct UniversalGarbage *return_values; - privateUniversalGarbageElement **elements; - int elements_size; - bool is_the_root; - -}UniversalGarbage; - -UniversalGarbage * newUniversalGarbage(); - -UniversalGarbage * private_new_MainUniversalGarbage(); - - - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer); - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self); - -void UniversalGarbage_free_including_return(UniversalGarbage *self); - -void UniversalGarbage_free(UniversalGarbage *self); - - - - - - - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer){ - - privateUniversalGarbageElement * self = UniversalGarbage_create_empty_struct( - self, - privateUniversalGarbageElement - ); - self->pointer = pointer; - self->deallocator_callback = dealocator_callback; - self->pointed_value = *pointer; - return self; -} -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self){ - if(self->pointed_value){ - self->deallocator_callback(self->pointed_value); - self->pointed_value = NULL; - } -} - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self){ - private_UniversalGarbageSimpleElement_free_pointed_value(self); - free(self); -} - - -UniversalGarbage * private_new_MainUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->is_the_root = false; - return self; -} - -UniversalGarbage * newUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->is_the_root = true; - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->return_values =private_new_MainUniversalGarbage(); - - return self; -} - - - - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - - if(rawUniversalGarbage_reallocate(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - - privateUniversalGarbageElement *current = self->elements[i]; - bool reallocate = current->pointer == pointer; - - if(reallocate){ - current->pointed_value = *pointer; - return true; - } - } - return false; -} - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - if(rawUniversalGarbage_resset(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - bool resset = current->pointer == pointer; - if(resset){ - private_UniversalGarbageSimpleElement_free_pointed_value(current); - current->pointed_value = *pointer; - return true; - } - } - return false; - -} -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_remove(self->return_values,pointer)){ - *pointer = NULL; - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - private_UniversalGarbageSimpleElement_free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - - } - *pointer = NULL; - return true; - } - } - return false; -} -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_disconnect(self->return_values,pointer)){ - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - } - return true; - } - } - return false; - - - -} -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer){ - - if(!pointer){ - return false; - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - return false; - } - } - - self->elements = (privateUniversalGarbageElement**)realloc( - self->elements, - (self->elements_size + 1) * sizeof(privateUniversalGarbageElement*) - ); - void (*dealocator_callback)(void *element); -#ifdef __cplusplus - dealocator_callback =reinterpret_cast(release_callback); -#else - dealocator_callback = (void*)(void*)release_callback; - -#endif - - - - self->elements[self->elements_size] = private_newUniversalGarbageSimpleElement(dealocator_callback, pointer); - self->elements_size+=1; - return true; -} - - - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self){ - for(int i = 0; i < self->elements_size; i++){ - private_UniversalGarbageSimpleElement_free(self->elements[i]); - } - free(self->elements); -} - -void UniversalGarbage_free_including_return(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - if(self->is_the_root){ - UniversalGarbage_free(self->return_values); - } - free(self); -} - -void UniversalGarbage_free(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - - if(self->is_the_root){ - - UniversalGarbage *return_garbage = self->return_values; - for(int i = 0; i < return_garbage->elements_size; i++){ - free(return_garbage->elements[i]); - } - - free(return_garbage->elements); - free(return_garbage); - } - - - free(self); -} - - - - -#define UNIVERSAL_GARBAGE_H -#endif - -/* -** Lua core, libraries, and interpreter in a single file. -** Compiling just this file generates a complete Lua stand-alone -** program: -** -** $ gcc -O2 -std=c99 -o lua onelua.c -lm -** -** or -** -** $ gcc -O2 -std=c89 -DLUA_USE_C89 -o lua onelua.c -lm -** -*/ - -/* default is to build the full interpreter */ -#ifndef MAKE_LIB -#ifndef MAKE_LUAC -#ifndef MAKE_LUA -#define MAKE_LUA -#endif -#endif -#endif - - -/* -** Choose suitable platform-specific features. Default is no -** platform-specific features. Some of these options may need extra -** libraries such as -ldl -lreadline -lncurses -*/ -#if 0 -#define LUA_USE_LINUX -#define LUA_USE_MACOSX -#define LUA_USE_POSIX -#define LUA_ANSI -#endif - - -/* no need to change anything below this line ----------------------------- */ - - -/* -** $Id: lprefix.h $ -** Definitions for Lua code that must come before any other header file -** See Copyright Notice in lua.h -*/ - -#ifndef lprefix_h -#define lprefix_h - - -/* -** Allows POSIX/XSI stuff -*/ -#if !defined(LUA_USE_C89) /* { */ - -#if !defined(_XOPEN_SOURCE) -#define _XOPEN_SOURCE 600 -#elif _XOPEN_SOURCE == 0 -#undef _XOPEN_SOURCE /* use -D_XOPEN_SOURCE=0 to undefine it */ -#endif - -/* -** Allows manipulation of large files in gcc and some other compilers -*/ -#if !defined(LUA_32BITS) && !defined(_FILE_OFFSET_BITS) -#define _LARGEFILE_SOURCE 1 -#define _FILE_OFFSET_BITS 64 -#endif - -#endif /* } */ - - -/* -** Windows stuff -*/ -#if defined(_WIN32) /* { */ - -#if !defined(_CRT_SECURE_NO_WARNINGS) -#define _CRT_SECURE_NO_WARNINGS /* avoid warnings about ISO C functions */ -#endif - -#endif /* } */ - -#endif - - - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - - - -double private_lua_embed_fmod(double x, double y); - -// Implementação simples da função pow -double private_lua_embed_pow(double b, double e); - -// Implementação simples da função floor -double private_lua_embed_floor(double x); - -/* setup for luaconf.h */ -#define LUA_CORE -#define LUA_LIB -#define ltable_c -#define lvm_c - -/* -** $Id: luaconf.h $ -** Configuration file for Lua -** See Copyright Notice in lua.h -*/ - - -#ifndef luaconf_h -#define luaconf_h - -#include -#include - - -/* -** =================================================================== -** General Configuration File for Lua -** -** Some definitions here can be changed externally, through the compiler -** (e.g., with '-D' options): They are commented out or protected -** by '#if !defined' guards. However, several other definitions -** should be changed directly here, either because they affect the -** Lua ABI (by making the changes here, you ensure that all software -** connected to Lua, such as C libraries, will be compiled with the same -** configuration); or because they are seldom changed. -** -** Search for "@@" to find all configurable definitions. -** =================================================================== -*/ - - -/* -** {==================================================================== -** System Configuration: macros to adapt (if needed) Lua to some -** particular platform, for instance restricting it to C89. -** ===================================================================== -*/ - -/* -@@ LUA_USE_C89 controls the use of non-ISO-C89 features. -** Define it if you want Lua to avoid the use of a few C99 features -** or Windows-specific features on Windows. -*/ -/* #define LUA_USE_C89 */ - - -/* -** By default, Lua on Windows use (some) specific Windows features -*/ -#if !defined(LUA_USE_C89) && defined(_WIN32) && !defined(_WIN32_WCE) -#define LUA_USE_WINDOWS /* enable goodies for regular Windows */ -#endif - - -#if defined(LUA_USE_WINDOWS) -#define LUA_DL_DLL /* enable support for DLL */ -#define LUA_USE_C89 /* broadly, Windows is C89 */ -#endif - - -#if defined(LUA_USE_LINUX) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN /* needs an extra library: -ldl */ -#endif - - -#if defined(LUA_USE_MACOSX) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN /* MacOS does not need -ldl */ -#endif - - -#if defined(LUA_USE_IOS) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN -#endif - - -/* -@@ LUAI_IS32INT is true iff 'int' has (at least) 32 bits. -*/ -#define LUAI_IS32INT ((UINT_MAX >> 30) >= 3) - -/* }================================================================== */ - - - -/* -** {================================================================== -** Configuration for Number types. These options should not be -** set externally, because any other code connected to Lua must -** use the same configuration. -** =================================================================== -*/ - -/* -@@ LUA_INT_TYPE defines the type for Lua integers. -@@ LUA_FLOAT_TYPE defines the type for Lua floats. -** Lua should work fine with any mix of these options supported -** by your C compiler. The usual configurations are 64-bit integers -** and 'double' (the default), 32-bit integers and 'float' (for -** restricted platforms), and 'long'/'double' (for C compilers not -** compliant with C99, which may not have support for 'long long'). -*/ - -/* predefined options for LUA_INT_TYPE */ -#define LUA_INT_INT 1 -#define LUA_INT_LONG 2 -#define LUA_INT_LONGLONG 3 - -/* predefined options for LUA_FLOAT_TYPE */ -#define LUA_FLOAT_FLOAT 1 -#define LUA_FLOAT_DOUBLE 2 -#define LUA_FLOAT_LONGDOUBLE 3 - - -/* Default configuration ('long long' and 'double', for 64-bit Lua) */ -#define LUA_INT_DEFAULT LUA_INT_LONGLONG -#define LUA_FLOAT_DEFAULT LUA_FLOAT_DOUBLE - - -/* -@@ LUA_32BITS enables Lua with 32-bit integers and 32-bit floats. -*/ -#define LUA_32BITS 0 - - -/* -@@ LUA_C89_NUMBERS ensures that Lua uses the largest types available for -** C89 ('long' and 'double'); Windows always has '__int64', so it does -** not need to use this case. -*/ -#if defined(LUA_USE_C89) && !defined(LUA_USE_WINDOWS) -#define LUA_C89_NUMBERS 1 -#else -#define LUA_C89_NUMBERS 0 -#endif - - -#if LUA_32BITS /* { */ -/* -** 32-bit integers and 'float' -*/ -#if LUAI_IS32INT /* use 'int' if big enough */ -#define LUA_INT_TYPE LUA_INT_INT -#else /* otherwise use 'long' */ -#define LUA_INT_TYPE LUA_INT_LONG -#endif -#define LUA_FLOAT_TYPE LUA_FLOAT_FLOAT - -#elif LUA_C89_NUMBERS /* }{ */ -/* -** largest types available for C89 ('long' and 'double') -*/ -#define LUA_INT_TYPE LUA_INT_LONG -#define LUA_FLOAT_TYPE LUA_FLOAT_DOUBLE - -#else /* }{ */ -/* use defaults */ - -#define LUA_INT_TYPE LUA_INT_DEFAULT -#define LUA_FLOAT_TYPE LUA_FLOAT_DEFAULT - -#endif /* } */ - - -/* }================================================================== */ - - - -/* -** {================================================================== -** Configuration for Paths. -** =================================================================== -*/ - -/* -** LUA_PATH_SEP is the character that separates templates in a path. -** LUA_PATH_MARK is the string that marks the substitution points in a -** template. -** LUA_EXEC_DIR in a Windows path is replaced by the executable's -** directory. -*/ -#define LUA_PATH_SEP ";" -#define LUA_PATH_MARK "?" -#define LUA_EXEC_DIR "!" - - -/* -@@ LUA_PATH_DEFAULT is the default path that Lua uses to look for -** Lua libraries. -@@ LUA_CPATH_DEFAULT is the default path that Lua uses to look for -** C libraries. -** CHANGE them if your machine has a non-conventional directory -** hierarchy or if you want to install your libraries in -** non-conventional directories. -*/ - -#define LUA_VDIR LUA_VERSION_MAJOR "." LUA_VERSION_MINOR -#if defined(_WIN32) /* { */ -/* -** In Windows, any exclamation mark ('!') in the path is replaced by the -** path of the directory of the executable file of the current process. -*/ -#define LUA_LDIR "!\\lua\\" -#define LUA_CDIR "!\\" -#define LUA_SHRDIR "!\\..\\share\\lua\\" LUA_VDIR "\\" - -#if !defined(LUA_PATH_DEFAULT) -#define LUA_PATH_DEFAULT \ - LUA_LDIR"?.lua;" LUA_LDIR"?\\init.lua;" \ - LUA_CDIR"?.lua;" LUA_CDIR"?\\init.lua;" \ - LUA_SHRDIR"?.lua;" LUA_SHRDIR"?\\init.lua;" \ - ".\\?.lua;" ".\\?\\init.lua" -#endif - -#if !defined(LUA_CPATH_DEFAULT) -#define LUA_CPATH_DEFAULT \ - LUA_CDIR"?.dll;" \ - LUA_CDIR"..\\lib\\lua\\" LUA_VDIR "\\?.dll;" \ - LUA_CDIR"loadall.dll;" ".\\?.dll" -#endif - -#else /* }{ */ - -#define LUA_ROOT "/usr/local/" -#define LUA_LDIR LUA_ROOT "share/lua/" LUA_VDIR "/" -#define LUA_CDIR LUA_ROOT "lib/lua/" LUA_VDIR "/" - -#if !defined(LUA_PATH_DEFAULT) -#define LUA_PATH_DEFAULT \ - LUA_LDIR"?.lua;" LUA_LDIR"?/init.lua;" \ - LUA_CDIR"?.lua;" LUA_CDIR"?/init.lua;" \ - "./?.lua;" "./?/init.lua" -#endif - -#if !defined(LUA_CPATH_DEFAULT) -#define LUA_CPATH_DEFAULT \ - LUA_CDIR"?.so;" LUA_CDIR"loadall.so;" "./?.so" -#endif - -#endif /* } */ - - -/* -@@ LUA_DIRSEP is the directory separator (for submodules). -** CHANGE it if your machine does not use "/" as the directory separator -** and is not Windows. (On Windows Lua automatically uses "\".) -*/ -#if !defined(LUA_DIRSEP) - -#if defined(_WIN32) -#define LUA_DIRSEP "\\" -#else -#define LUA_DIRSEP "/" -#endif - -#endif - - -/* -** LUA_IGMARK is a mark to ignore all after it when building the -** module name (e.g., used to build the luaopen_ function name). -** Typically, the sufix after the mark is the module version, -** as in "mod-v1.2.so". -*/ -#define LUA_IGMARK "-" - -/* }================================================================== */ - - -/* -** {================================================================== -** Marks for exported symbols in the C code -** =================================================================== -*/ - -/* -@@ LUA_API is a mark for all core API functions. -@@ LUALIB_API is a mark for all auxiliary library functions. -@@ LUAMOD_API is a mark for all standard library opening functions. -** CHANGE them if you need to define those functions in some special way. -** For instance, if you want to create one Windows DLL with the core and -** the libraries, you may want to use the following definition (define -** LUA_BUILD_AS_DLL to get it). -*/ -#if defined(LUA_BUILD_AS_DLL) /* { */ - -#if defined(LUA_CORE) || defined(LUA_LIB) /* { */ -#define LUA_API __declspec(dllexport) -#else /* }{ */ -#define LUA_API __declspec(dllimport) -#endif /* } */ - -#else /* }{ */ - -#define LUA_API extern - -#endif /* } */ - - -/* -** More often than not the libs go together with the core. -*/ -#define LUALIB_API LUA_API -#define LUAMOD_API LUA_API - - -/* -@@ LUAI_FUNC is a mark for all extern functions that are not to be -** exported to outside modules. -@@ LUAI_DDEF and LUAI_DDEC are marks for all extern (const) variables, -** none of which to be exported to outside modules (LUAI_DDEF for -** definitions and LUAI_DDEC for declarations). -** CHANGE them if you need to mark them in some special way. Elf/gcc -** (versions 3.2 and later) mark them as "hidden" to optimize access -** when Lua is compiled as a shared library. Not all elf targets support -** this attribute. Unfortunately, gcc does not offer a way to check -** whether the target offers that support, and those without support -** give a warning about it. To avoid these warnings, change to the -** default definition. -*/ -#if defined(__GNUC__) && ((__GNUC__*100 + __GNUC_MINOR__) >= 302) && \ - defined(__ELF__) /* { */ -#define LUAI_FUNC __attribute__((visibility("internal"))) extern -#else /* }{ */ -#define LUAI_FUNC extern -#endif /* } */ - -#define LUAI_DDEC(dec) LUAI_FUNC dec -#define LUAI_DDEF /* empty */ - -/* }================================================================== */ - - -/* -** {================================================================== -** Compatibility with previous versions -** =================================================================== -*/ - -/* -@@ LUA_COMPAT_5_3 controls other macros for compatibility with Lua 5.3. -** You can define it to get all options, or change specific options -** to fit your specific needs. -*/ -#if defined(LUA_COMPAT_5_3) /* { */ - -/* -@@ LUA_COMPAT_MATHLIB controls the presence of several deprecated -** functions in the mathematical library. -** (These functions were already officially removed in 5.3; -** nevertheless they are still available here.) -*/ -#define LUA_COMPAT_MATHLIB - -/* -@@ LUA_COMPAT_APIINTCASTS controls the presence of macros for -** manipulating other integer types (lua_pushunsigned, lua_tounsigned, -** luaL_checkint, luaL_checklong, etc.) -** (These macros were also officially removed in 5.3, but they are still -** available here.) -*/ -#define LUA_COMPAT_APIINTCASTS - - -/* -@@ LUA_COMPAT_LT_LE controls the emulation of the '__le' metamethod -** using '__lt'. -*/ -#define LUA_COMPAT_LT_LE - - -/* -@@ The following macros supply trivial compatibility for some -** changes in the API. The macros themselves document how to -** change your code to avoid using them. -** (Once more, these macros were officially removed in 5.3, but they are -** still available here.) -*/ -#define lua_strlen(L,i) lua_rawlen(L, (i)) - -#define lua_objlen(L,i) lua_rawlen(L, (i)) - -#define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ) -#define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT) - -#endif /* } */ - -/* }================================================================== */ - - - -/* -** {================================================================== -** Configuration for Numbers (low-level part). -** Change these definitions if no predefined LUA_FLOAT_* / LUA_INT_* -** satisfy your needs. -** =================================================================== -*/ - -/* -@@ LUAI_UACNUMBER is the result of a 'default argument promotion' -@@ over a floating number. -@@ l_floatatt(x) corrects float attribute 'x' to the proper float type -** by prefixing it with one of FLT/DBL/LDBL. -@@ LUA_NUMBER_FRMLEN is the length modifier for writing floats. -@@ LUA_NUMBER_FMT is the format for writing floats. -@@ lua_number2str converts a float to a string. -@@ l_mathop allows the addition of an 'l' or 'f' to all math operations. -@@ l_floor takes the floor of a float. -@@ lua_str2number converts a decimal numeral to a number. -*/ - - -/* The following definitions are good for most cases here */ - -#define l_floor(x) (l_mathop(private_lua_embed_floor)(x)) - -#define lua_number2str(s,sz,n) \ - l_sprintf((s), sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)(n)) - -/* -@@ lua_numbertointeger converts a float number with an integral value -** to an integer, or returns 0 if float is not within the range of -** a lua_Integer. (The range comparisons are tricky because of -** rounding. The tests here assume a two-complement representation, -** where MININTEGER always has an exact representation as a float; -** MAXINTEGER may not have one, and therefore its conversion to float -** may have an ill-defined value.) -*/ -#define lua_numbertointeger(n,p) \ - ((n) >= (LUA_NUMBER)(LUA_MININTEGER) && \ - (n) < -(LUA_NUMBER)(LUA_MININTEGER) && \ - (*(p) = (LUA_INTEGER)(n), 1)) - - -/* now the variable definitions */ - -#if LUA_FLOAT_TYPE == LUA_FLOAT_FLOAT /* { single float */ - -#define LUA_NUMBER float - -#define l_floatatt(n) (FLT_##n) - -#define LUAI_UACNUMBER double - -#define LUA_NUMBER_FRMLEN "" -#define LUA_NUMBER_FMT "%.7g" - -#define l_mathop(op) op##f - -#define lua_str2number(s,p) strtof((s), (p)) - - -#elif LUA_FLOAT_TYPE == LUA_FLOAT_LONGDOUBLE /* }{ long double */ - -#define LUA_NUMBER long double - -#define l_floatatt(n) (LDBL_##n) - -#define LUAI_UACNUMBER long double - -#define LUA_NUMBER_FRMLEN "L" -#define LUA_NUMBER_FMT "%.19Lg" - -#define l_mathop(op) op##l - -#define lua_str2number(s,p) strtold((s), (p)) - -#elif LUA_FLOAT_TYPE == LUA_FLOAT_DOUBLE /* }{ double */ - -#define LUA_NUMBER double - -#define l_floatatt(n) (DBL_##n) - -#define LUAI_UACNUMBER double - -#define LUA_NUMBER_FRMLEN "" -#define LUA_NUMBER_FMT "%.14g" - -#define l_mathop(op) op - -#define lua_str2number(s,p) strtod((s), (p)) - -#else /* }{ */ - -#error "numeric float type not defined" - -#endif /* } */ - - - -/* -@@ LUA_UNSIGNED is the unsigned version of LUA_INTEGER. -@@ LUAI_UACINT is the result of a 'default argument promotion' -@@ over a LUA_INTEGER. -@@ LUA_INTEGER_FRMLEN is the length modifier for reading/writing integers. -@@ LUA_INTEGER_FMT is the format for writing integers. -@@ LUA_MAXINTEGER is the maximum value for a LUA_INTEGER. -@@ LUA_MININTEGER is the minimum value for a LUA_INTEGER. -@@ LUA_MAXUNSIGNED is the maximum value for a LUA_UNSIGNED. -@@ lua_integer2str converts an integer to a string. -*/ - - -/* The following definitions are good for most cases here */ - -#define LUA_INTEGER_FMT "%" LUA_INTEGER_FRMLEN "d" - -#define LUAI_UACINT LUA_INTEGER - -#define lua_integer2str(s,sz,n) \ - l_sprintf((s), sz, LUA_INTEGER_FMT, (LUAI_UACINT)(n)) - -/* -** use LUAI_UACINT here to avoid problems with promotions (which -** can turn a comparison between unsigneds into a signed comparison) -*/ -#define LUA_UNSIGNED unsigned LUAI_UACINT - - -/* now the variable definitions */ - -#if LUA_INT_TYPE == LUA_INT_INT /* { int */ - -#define LUA_INTEGER int -#define LUA_INTEGER_FRMLEN "" - -#define LUA_MAXINTEGER INT_MAX -#define LUA_MININTEGER INT_MIN - -#define LUA_MAXUNSIGNED UINT_MAX - -#elif LUA_INT_TYPE == LUA_INT_LONG /* }{ long */ - -#define LUA_INTEGER long -#define LUA_INTEGER_FRMLEN "l" - -#define LUA_MAXINTEGER LONG_MAX -#define LUA_MININTEGER LONG_MIN - -#define LUA_MAXUNSIGNED ULONG_MAX - -#elif LUA_INT_TYPE == LUA_INT_LONGLONG /* }{ long long */ - -/* use presence of macro LLONG_MAX as proxy for C99 compliance */ -#if defined(LLONG_MAX) /* { */ -/* use ISO C99 stuff */ - -#define LUA_INTEGER long long -#define LUA_INTEGER_FRMLEN "ll" - -#define LUA_MAXINTEGER LLONG_MAX -#define LUA_MININTEGER LLONG_MIN - -#define LUA_MAXUNSIGNED ULLONG_MAX - -#elif defined(LUA_USE_WINDOWS) /* }{ */ -/* in Windows, can use specific Windows types */ - -#define LUA_INTEGER __int64 -#define LUA_INTEGER_FRMLEN "I64" - -#define LUA_MAXINTEGER _I64_MAX -#define LUA_MININTEGER _I64_MIN - -#define LUA_MAXUNSIGNED _UI64_MAX - -#else /* }{ */ - -#error "Compiler does not support 'long long'. Use option '-DLUA_32BITS' \ - or '-DLUA_C89_NUMBERS' (see file 'luaconf.h' for details)" - -#endif /* } */ - -#else /* }{ */ - -#error "numeric integer type not defined" - -#endif /* } */ - -/* }================================================================== */ - - -/* -** {================================================================== -** Dependencies with C99 and other C details -** =================================================================== -*/ - -/* -@@ l_sprintf is equivalent to 'snprintf' or 'sprintf' in C89. -** (All uses in Lua have only one format item.) -*/ -#if !defined(LUA_USE_C89) -#define l_sprintf(s,sz,f,i) snprintf(s,sz,f,i) -#else -#define l_sprintf(s,sz,f,i) ((void)(sz), sprintf(s,f,i)) -#endif - - -/* -@@ lua_strx2number converts a hexadecimal numeral to a number. -** In C99, 'strtod' does that conversion. Otherwise, you can -** leave 'lua_strx2number' undefined and Lua will provide its own -** implementation. -*/ -#if !defined(LUA_USE_C89) -#define lua_strx2number(s,p) lua_str2number(s,p) -#endif - - -/* -@@ lua_pointer2str converts a pointer to a readable string in a -** non-specified way. -*/ -#define lua_pointer2str(buff,sz,p) l_sprintf(buff,sz,"%p",p) - - -/* -@@ lua_number2strx converts a float to a hexadecimal numeral. -** In C99, 'sprintf' (with format specifiers '%a'/'%A') does that. -** Otherwise, you can leave 'lua_number2strx' undefined and Lua will -** provide its own implementation. -*/ -#if !defined(LUA_USE_C89) -#define lua_number2strx(L,b,sz,f,n) \ - ((void)L, l_sprintf(b,sz,f,(LUAI_UACNUMBER)(n))) -#endif - - -/* -** 'strtof' and 'opf' variants for math functions are not valid in -** C89. Otherwise, the macro 'HUGE_VALF' is a good proxy for testing the -** availability of these variants. ('math.h' is already included in -** all files that use these macros.) -*/ -#if defined(LUA_USE_C89) || (defined(HUGE_VAL) && !defined(HUGE_VALF)) -#undef l_mathop /* variants not available */ -#undef lua_str2number -#define l_mathop(op) (lua_Number)op /* no variant */ -#define lua_str2number(s,p) ((lua_Number)strtod((s), (p))) -#endif - - -/* -@@ LUA_KCONTEXT is the type of the context ('ctx') for continuation -** functions. It must be a numerical type; Lua will use 'intptr_t' if -** available, otherwise it will use 'ptrdiff_t' (the nearest thing to -** 'intptr_t' in C89) -*/ -#define LUA_KCONTEXT ptrdiff_t - -#if !defined(LUA_USE_C89) && defined(__STDC_VERSION__) && \ - __STDC_VERSION__ >= 199901L -#include -#if defined(INTPTR_MAX) /* even in C99 this type is optional */ -#undef LUA_KCONTEXT -#define LUA_KCONTEXT intptr_t -#endif -#endif - - -/* -@@ lua_getlocaledecpoint gets the locale "radix character" (decimal point). -** Change that if you do not want to use C locales. (Code using this -** macro must include the header 'locale.h'.) -*/ -#if !defined(lua_getlocaledecpoint) -#define lua_getlocaledecpoint() (localeconv()->decimal_point[0]) -#endif - - -/* -** macros to improve jump prediction, used mostly for error handling -** and debug facilities. (Some macros in the Lua API use these macros. -** Define LUA_NOBUILTIN if you do not want '__builtin_expect' in your -** code.) -*/ -#if !defined(luai_likely) - -#if defined(__GNUC__) && !defined(LUA_NOBUILTIN) -#define luai_likely(x) (__builtin_expect(((x) != 0), 1)) -#define luai_unlikely(x) (__builtin_expect(((x) != 0), 0)) -#else -#define luai_likely(x) (x) -#define luai_unlikely(x) (x) -#endif - -#endif - - -#if defined(LUA_CORE) || defined(LUA_LIB) -/* shorter names for Lua's own use */ -#define l_likely(x) luai_likely(x) -#define l_unlikely(x) luai_unlikely(x) -#endif - - - -/* }================================================================== */ - - -/* -** {================================================================== -** Language Variations -** ===================================================================== -*/ - -/* -@@ LUA_NOCVTN2S/LUA_NOCVTS2N control how Lua performs some -** coercions. Define LUA_NOCVTN2S to turn off automatic coercion from -** numbers to strings. Define LUA_NOCVTS2N to turn off automatic -** coercion from strings to numbers. -*/ -/* #define LUA_NOCVTN2S */ -/* #define LUA_NOCVTS2N */ - - -/* -@@ LUA_USE_APICHECK turns on several consistency checks on the C API. -** Define it as a help when debugging C code. -*/ -#if defined(LUA_USE_APICHECK) -#include -#define luai_apicheck(l,e) assert(e) -#endif - -/* }================================================================== */ - - -/* -** {================================================================== -** Macros that affect the API and must be stable (that is, must be the -** same when you compile Lua and when you compile code that links to -** Lua). -** ===================================================================== -*/ - -/* -@@ LUAI_MAXSTACK limits the size of the Lua stack. -** CHANGE it if you need a different limit. This limit is arbitrary; -** its only purpose is to stop Lua from consuming unlimited stack -** space (and to reserve some numbers for pseudo-indices). -** (It must fit into max(size_t)/32 and max(int)/2.) -*/ -#if LUAI_IS32INT -#define LUAI_MAXSTACK 1000000 -#else -#define LUAI_MAXSTACK 15000 -#endif - - -/* -@@ LUA_EXTRASPACE defines the size of a raw memory area associated with -** a Lua state with very fast access. -** CHANGE it if you need a different size. -*/ -#define LUA_EXTRASPACE (sizeof(void *)) - - -/* -@@ LUA_IDSIZE gives the maximum size for the description of the source -** of a function in debug information. -** CHANGE it if you want a different size. -*/ -#define LUA_IDSIZE 60 - - -/* -@@ LUAL_BUFFERSIZE is the initial buffer size used by the lauxlib -** buffer system. -*/ -#define LUAL_BUFFERSIZE ((int)(16 * sizeof(void*) * sizeof(lua_Number))) - - -/* -@@ LUAI_MAXALIGN defines fields that, when used in a union, ensure -** maximum alignment for the other items in that union. -*/ -#define LUAI_MAXALIGN lua_Number n; double u; void *s; lua_Integer i; long l - -/* }================================================================== */ - - - - - -/* =================================================================== */ - -/* -** Local configuration. You can use this space to add your redefinitions -** without modifying the main part of the file. -*/ - - - - - -#endif - - - -/* do not export internal symbols */ -#undef LUAI_FUNC -#undef LUAI_DDEC -#undef LUAI_DDEF -#define LUAI_FUNC static -#define LUAI_DDEC(def) /* empty */ -#define LUAI_DDEF static - -/* core -- used by all */ - -double private_lua_embed_fmod(double x, double y) { - while (y != 0.0) { - while (x >= y) { - x -= y; - } - if (x < y) { - return x; - } - } - return 0.0 / 0.0; -} - -double private_lua_embed_pow(double b, double e) { - double resultado = 1.0; - int i; - - if (e == 0.0) { - return 1.0; - } - if (e < 0.0) { - b = 1.0 / b; - e = -e; - } - - for (i = 0; i < e; i++) { - resultado *= b; - } - - return resultado; -} - -double private_lua_embed_floor(double x) { - int i = (int)x; - - if (x == (double)i) { - return x; - } - - if (x < 0.0) { - return (double)(i - 1); - } - - return (double)i; -} - -/* -** $Id: lzio.c $ -** Buffered streams -** See Copyright Notice in lua.h -*/ - -#define lzio_c -#define LUA_CORE - - - -#include - - -/* -** $Id: lua.h $ -** Lua - A Scripting Language -** Lua.org, PUC-Rio, Brazil (www.lua.org) -** See Copyright Notice at the end of this file -*/ - - -#ifndef lua_h -#define lua_h - -#include -#include - - -#define LUA_COPYRIGHT LUA_RELEASE " Copyright (C) 1994-2023 Lua.org, PUC-Rio" -#define LUA_AUTHORS "R. Ierusalimschy, L. H. de Figueiredo, W. Celes" - - -#define LUA_VERSION_MAJOR_N 5 -#define LUA_VERSION_MINOR_N 5 -#define LUA_VERSION_RELEASE_N 0 - -#define LUA_VERSION_NUM (LUA_VERSION_MAJOR_N * 100 + LUA_VERSION_MINOR_N) -#define LUA_VERSION_RELEASE_NUM (LUA_VERSION_NUM * 100 + LUA_VERSION_RELEASE_N) - - - - -/* mark for precompiled code ('Lua') */ -#define LUA_SIGNATURE "\x1bLua" - -/* option for multiple returns in 'lua_pcall' and 'lua_call' */ -#define LUA_MULTRET (-1) - - -/* -** Pseudo-indices -** (-LUAI_MAXSTACK is the minimum valid index; we keep some free empty -** space after that to help overflow detection) -*/ -#define LUA_REGISTRYINDEX (-LUAI_MAXSTACK - 1000) -#define lua_upvalueindex(i) (LUA_REGISTRYINDEX - (i)) - - -/* thread status */ -#define LUA_OK 0 -#define LUA_YIELD 1 -#define LUA_ERRRUN 2 -#define LUA_ERRSYNTAX 3 -#define LUA_ERRMEM 4 -#define LUA_ERRERR 5 - - -typedef struct lua_State lua_State; - - -/* -** basic types -*/ -#define LUA_TNONE (-1) - -#define LUA_TNIL 0 -#define LUA_TBOOLEAN 1 -#define LUA_TLIGHTUSERDATA 2 -#define LUA_TNUMBER 3 -#define LUA_TSTRING 4 -#define LUA_TTABLE 5 -#define LUA_TFUNCTION 6 -#define LUA_TUSERDATA 7 -#define LUA_TTHREAD 8 - -#define LUA_NUMTYPES 9 - - - -/* minimum Lua stack available to a C function */ -#define LUA_MINSTACK 20 - - -/* predefined values in the registry */ -/* index 1 is reserved for the reference mechanism */ -#define LUA_RIDX_GLOBALS 2 -#define LUA_RIDX_MAINTHREAD 3 -#define LUA_RIDX_LAST 3 - - -/* type of numbers in Lua */ -typedef LUA_NUMBER lua_Number; - - -/* type for integer functions */ -typedef LUA_INTEGER lua_Integer; - -/* unsigned integer type */ -typedef LUA_UNSIGNED lua_Unsigned; - -/* type for continuation-function contexts */ -typedef LUA_KCONTEXT lua_KContext; - - -/* -** Type for C functions registered with Lua -*/ -typedef int (*lua_CFunction) (lua_State *L); - -/* -** Type for continuation functions -*/ -typedef int (*lua_KFunction) (lua_State *L, int status, lua_KContext ctx); - - -/* -** Type for functions that read/write blocks when loading/dumping Lua chunks -*/ -typedef const char * (*lua_Reader) (lua_State *L, void *ud, size_t *sz); - -typedef int (*lua_Writer) (lua_State *L, const void *p, size_t sz, void *ud); - - -/* -** Type for memory-allocation functions -*/ -typedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize); - - -/* -** Type for warning functions -*/ -typedef void (*lua_WarnFunction) (void *ud, const char *msg, int tocont); - - -/* -** Type used by the debug API to collect debug information -*/ -typedef struct lua_Debug lua_Debug; - - -/* -** Functions to be called by the debugger in specific events -*/ -typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar); - - -/* -** generic extra include file -*/ -#if defined(LUA_USER_H) -#include LUA_USER_H -#endif - - -/* -** RCS ident string -*/ -extern const char lua_ident[]; - - -/* -** state manipulation -*/ -LUA_API lua_State *(lua_newstate) (lua_Alloc f, void *ud, unsigned seed); -LUA_API void (lua_close) (lua_State *L); -LUA_API lua_State *(lua_newthread) (lua_State *L); -LUA_API int (lua_closethread) (lua_State *L, lua_State *from); - -LUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf); - - -LUA_API lua_Number (lua_version) (lua_State *L); - - -/* -** basic stack manipulation -*/ -LUA_API int (lua_absindex) (lua_State *L, int idx); -LUA_API int (lua_gettop) (lua_State *L); -LUA_API void (lua_settop) (lua_State *L, int idx); -LUA_API void (lua_pushvalue) (lua_State *L, int idx); -LUA_API void (lua_rotate) (lua_State *L, int idx, int n); -LUA_API void (lua_copy) (lua_State *L, int fromidx, int toidx); -LUA_API int (lua_checkstack) (lua_State *L, int n); - -LUA_API void (lua_xmove) (lua_State *from, lua_State *to, int n); - - -/* -** access functions (stack -> C) -*/ - -LUA_API int (lua_isnumber) (lua_State *L, int idx); -LUA_API int (lua_isstring) (lua_State *L, int idx); -LUA_API int (lua_iscfunction) (lua_State *L, int idx); -LUA_API int (lua_isinteger) (lua_State *L, int idx); -LUA_API int (lua_isuserdata) (lua_State *L, int idx); -LUA_API int (lua_type) (lua_State *L, int idx); -LUA_API const char *(lua_typename) (lua_State *L, int tp); - -LUA_API lua_Number (lua_tonumberx) (lua_State *L, int idx, int *isnum); -LUA_API lua_Integer (lua_tointegerx) (lua_State *L, int idx, int *isnum); -LUA_API int (lua_toboolean) (lua_State *L, int idx); -LUA_API const char *(lua_tolstring) (lua_State *L, int idx, size_t *len); -LUA_API lua_Unsigned (lua_rawlen) (lua_State *L, int idx); -LUA_API lua_CFunction (lua_tocfunction) (lua_State *L, int idx); -LUA_API void *(lua_touserdata) (lua_State *L, int idx); -LUA_API lua_State *(lua_tothread) (lua_State *L, int idx); -LUA_API const void *(lua_topointer) (lua_State *L, int idx); - - -/* -** Comparison and arithmetic functions -*/ - -#define LUA_OPADD 0 /* ORDER TM, ORDER OP */ -#define LUA_OPSUB 1 -#define LUA_OPMUL 2 -#define LUA_OPMOD 3 -#define LUA_OPPOW 4 -#define LUA_OPDIV 5 -#define LUA_OPIDIV 6 -#define LUA_OPBAND 7 -#define LUA_OPBOR 8 -#define LUA_OPBXOR 9 -#define LUA_OPSHL 10 -#define LUA_OPSHR 11 -#define LUA_OPUNM 12 -#define LUA_OPBNOT 13 - -LUA_API void (lua_arith) (lua_State *L, int op); - -#define LUA_OPEQ 0 -#define LUA_OPLT 1 -#define LUA_OPLE 2 - -LUA_API int (lua_rawequal) (lua_State *L, int idx1, int idx2); -LUA_API int (lua_compare) (lua_State *L, int idx1, int idx2, int op); - - -/* -** push functions (C -> stack) -*/ -LUA_API void (lua_pushnil) (lua_State *L); -LUA_API void (lua_pushnumber) (lua_State *L, lua_Number n); -LUA_API void (lua_pushinteger) (lua_State *L, lua_Integer n); -LUA_API const char *(lua_pushlstring) (lua_State *L, const char *s, size_t len); -LUA_API const char *(lua_pushextlstring) (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud); -LUA_API const char *(lua_pushstring) (lua_State *L, const char *s); -LUA_API const char *(lua_pushvfstring) (lua_State *L, const char *fmt, - va_list argp); -LUA_API const char *(lua_pushfstring) (lua_State *L, const char *fmt, ...); -LUA_API void (lua_pushcclosure) (lua_State *L, lua_CFunction fn, int n); -LUA_API void (lua_pushboolean) (lua_State *L, int b); -LUA_API void (lua_pushlightuserdata) (lua_State *L, void *p); -LUA_API int (lua_pushthread) (lua_State *L); - - -/* -** get functions (Lua -> stack) -*/ -LUA_API int (lua_getglobal) (lua_State *L, const char *name); -LUA_API int (lua_gettable) (lua_State *L, int idx); -LUA_API int (lua_getfield) (lua_State *L, int idx, const char *k); -LUA_API int (lua_geti) (lua_State *L, int idx, lua_Integer n); -LUA_API int (lua_rawget) (lua_State *L, int idx); -LUA_API int (lua_rawgeti) (lua_State *L, int idx, lua_Integer n); -LUA_API int (lua_rawgetp) (lua_State *L, int idx, const void *p); - -LUA_API void (lua_createtable) (lua_State *L, unsigned narr, unsigned nrec); -LUA_API void *(lua_newuserdatauv) (lua_State *L, size_t sz, int nuvalue); -LUA_API int (lua_getmetatable) (lua_State *L, int objindex); -LUA_API int (lua_getiuservalue) (lua_State *L, int idx, int n); - - -/* -** set functions (stack -> Lua) -*/ -LUA_API void (lua_setglobal) (lua_State *L, const char *name); -LUA_API void (lua_settable) (lua_State *L, int idx); -LUA_API void (lua_setfield) (lua_State *L, int idx, const char *k); -LUA_API void (lua_seti) (lua_State *L, int idx, lua_Integer n); -LUA_API void (lua_rawset) (lua_State *L, int idx); -LUA_API void (lua_rawseti) (lua_State *L, int idx, lua_Integer n); -LUA_API void (lua_rawsetp) (lua_State *L, int idx, const void *p); -LUA_API int (lua_setmetatable) (lua_State *L, int objindex); -LUA_API int (lua_setiuservalue) (lua_State *L, int idx, int n); - - -/* -** 'load' and 'call' functions (load and run Lua code) -*/ -LUA_API void (lua_callk) (lua_State *L, int nargs, int nresults, - lua_KContext ctx, lua_KFunction k); -#define lua_call(L,n,r) lua_callk(L, (n), (r), 0, NULL) - -LUA_API int (lua_pcallk) (lua_State *L, int nargs, int nresults, int errfunc, - lua_KContext ctx, lua_KFunction k); -#define lua_pcall(L,n,r,f) lua_pcallk(L, (n), (r), (f), 0, NULL) - -LUA_API int (lua_load) (lua_State *L, lua_Reader reader, void *dt, - const char *chunkname, const char *mode); - -LUA_API int (lua_dump) (lua_State *L, lua_Writer writer, void *data, int strip); - - -/* -** coroutine functions -*/ -LUA_API int (lua_yieldk) (lua_State *L, int nresults, lua_KContext ctx, - lua_KFunction k); -LUA_API int (lua_resume) (lua_State *L, lua_State *from, int narg, - int *nres); -LUA_API int (lua_status) (lua_State *L); -LUA_API int (lua_isyieldable) (lua_State *L); - -#define lua_yield(L,n) lua_yieldk(L, (n), 0, NULL) - - -/* -** Warning-related functions -*/ -LUA_API void (lua_setwarnf) (lua_State *L, lua_WarnFunction f, void *ud); -LUA_API void (lua_warning) (lua_State *L, const char *msg, int tocont); - - -/* -** garbage-collection options -*/ - -#define LUA_GCSTOP 0 -#define LUA_GCRESTART 1 -#define LUA_GCCOLLECT 2 -#define LUA_GCCOUNT 3 -#define LUA_GCCOUNTB 4 -#define LUA_GCSTEP 5 -#define LUA_GCISRUNNING 6 -#define LUA_GCGEN 7 -#define LUA_GCINC 8 -#define LUA_GCPARAM 9 - - -/* -** garbage-collection parameters -*/ -/* parameters for generational mode */ -#define LUA_GCPMINORMUL 0 /* control minor collections */ -#define LUA_GCPMAJORMINOR 1 /* control shift major->minor */ -#define LUA_GCPMINORMAJOR 2 /* control shift minor->major */ - -/* parameters for incremental mode */ -#define LUA_GCPPAUSE 3 /* size of pause between successive GCs */ -#define LUA_GCPSTEPMUL 4 /* GC "speed" */ -#define LUA_GCPSTEPSIZE 5 /* GC granularity */ - -/* number of parameters */ -#define LUA_GCPN 6 - - -LUA_API int (lua_gc) (lua_State *L, int what, ...); - - -/* -** miscellaneous functions -*/ - -LUA_API int (lua_error) (lua_State *L); - -LUA_API int (lua_next) (lua_State *L, int idx); - -LUA_API void (lua_concat) (lua_State *L, int n); -LUA_API void (lua_len) (lua_State *L, int idx); - -LUA_API size_t (lua_stringtonumber) (lua_State *L, const char *s); - -LUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud); -LUA_API void (lua_setallocf) (lua_State *L, lua_Alloc f, void *ud); - -LUA_API void (lua_toclose) (lua_State *L, int idx); -LUA_API void (lua_closeslot) (lua_State *L, int idx); - - -/* -** {============================================================== -** some useful macros -** =============================================================== -*/ - -#define lua_getextraspace(L) ((void *)((char *)(L) - LUA_EXTRASPACE)) - -#define lua_tonumber(L,i) lua_tonumberx(L,(i),NULL) -#define lua_tointeger(L,i) lua_tointegerx(L,(i),NULL) - -#define lua_pop(L,n) lua_settop(L, -(n)-1) - -#define lua_newtable(L) lua_createtable(L, 0, 0) - -#define lua_register(L,n,f) (lua_pushcfunction(L, (f)), lua_setglobal(L, (n))) - -#define lua_pushcfunction(L,f) lua_pushcclosure(L, (f), 0) - -#define lua_isfunction(L,n) (lua_type(L, (n)) == LUA_TFUNCTION) -#define lua_istable(L,n) (lua_type(L, (n)) == LUA_TTABLE) -#define lua_islightuserdata(L,n) (lua_type(L, (n)) == LUA_TLIGHTUSERDATA) -#define lua_isnil(L,n) (lua_type(L, (n)) == LUA_TNIL) -#define lua_isboolean(L,n) (lua_type(L, (n)) == LUA_TBOOLEAN) -#define lua_isthread(L,n) (lua_type(L, (n)) == LUA_TTHREAD) -#define lua_isnone(L,n) (lua_type(L, (n)) == LUA_TNONE) -#define lua_isnoneornil(L, n) (lua_type(L, (n)) <= 0) - -#define lua_pushliteral(L, s) lua_pushstring(L, "" s) - -#define lua_pushglobaltable(L) \ - ((void)lua_rawgeti(L, LUA_REGISTRYINDEX, LUA_RIDX_GLOBALS)) - -#define lua_tostring(L,i) lua_tolstring(L, (i), NULL) - - -#define lua_insert(L,idx) lua_rotate(L, (idx), 1) - -#define lua_remove(L,idx) (lua_rotate(L, (idx), -1), lua_pop(L, 1)) - -#define lua_replace(L,idx) (lua_copy(L, -1, (idx)), lua_pop(L, 1)) - -/* }============================================================== */ - - -/* -** {============================================================== -** compatibility macros -** =============================================================== -*/ -#if defined(LUA_COMPAT_APIINTCASTS) - -#define lua_pushunsigned(L,n) lua_pushinteger(L, (lua_Integer)(n)) -#define lua_tounsignedx(L,i,is) ((lua_Unsigned)lua_tointegerx(L,i,is)) -#define lua_tounsigned(L,i) lua_tounsignedx(L,(i),NULL) - -#endif - -#define lua_newuserdata(L,s) lua_newuserdatauv(L,s,1) -#define lua_getuservalue(L,idx) lua_getiuservalue(L,idx,1) -#define lua_setuservalue(L,idx) lua_setiuservalue(L,idx,1) - -#define lua_resetthread(L) lua_closethread(L,NULL) - -/* }============================================================== */ - -/* -** {====================================================================== -** Debug API -** ======================================================================= -*/ - - -/* -** Event codes -*/ -#define LUA_HOOKCALL 0 -#define LUA_HOOKRET 1 -#define LUA_HOOKLINE 2 -#define LUA_HOOKCOUNT 3 -#define LUA_HOOKTAILCALL 4 - - -/* -** Event masks -*/ -#define LUA_MASKCALL (1 << LUA_HOOKCALL) -#define LUA_MASKRET (1 << LUA_HOOKRET) -#define LUA_MASKLINE (1 << LUA_HOOKLINE) -#define LUA_MASKCOUNT (1 << LUA_HOOKCOUNT) - - -LUA_API int (lua_getstack) (lua_State *L, int level, lua_Debug *ar); -LUA_API int (lua_getinfo) (lua_State *L, const char *what, lua_Debug *ar); -LUA_API const char *(lua_getlocal) (lua_State *L, const lua_Debug *ar, int n); -LUA_API const char *(lua_setlocal) (lua_State *L, const lua_Debug *ar, int n); -LUA_API const char *(lua_getupvalue) (lua_State *L, int funcindex, int n); -LUA_API const char *(lua_setupvalue) (lua_State *L, int funcindex, int n); - -LUA_API void *(lua_upvalueid) (lua_State *L, int fidx, int n); -LUA_API void (lua_upvaluejoin) (lua_State *L, int fidx1, int n1, - int fidx2, int n2); - -LUA_API void (lua_sethook) (lua_State *L, lua_Hook func, int mask, int count); -LUA_API lua_Hook (lua_gethook) (lua_State *L); -LUA_API int (lua_gethookmask) (lua_State *L); -LUA_API int (lua_gethookcount) (lua_State *L); - - -struct lua_Debug { - int event; - const char *name; /* (n) */ - const char *namewhat; /* (n) 'global', 'local', 'field', 'method' */ - const char *what; /* (S) 'Lua', 'C', 'main', 'tail' */ - const char *source; /* (S) */ - size_t srclen; /* (S) */ - int currentline; /* (l) */ - int linedefined; /* (S) */ - int lastlinedefined; /* (S) */ - unsigned char nups; /* (u) number of upvalues */ - unsigned char nparams;/* (u) number of parameters */ - char isvararg; /* (u) */ - char istailcall; /* (t) */ - unsigned short ftransfer; /* (r) index of first value transferred */ - unsigned short ntransfer; /* (r) number of transferred values */ - char short_src[LUA_IDSIZE]; /* (S) */ - /* private part */ - struct CallInfo *i_ci; /* active function */ -}; - -/* }====================================================================== */ - - -#define LUAI_TOSTRAUX(x) #x -#define LUAI_TOSTR(x) LUAI_TOSTRAUX(x) - -#define LUA_VERSION_MAJOR LUAI_TOSTR(LUA_VERSION_MAJOR_N) -#define LUA_VERSION_MINOR LUAI_TOSTR(LUA_VERSION_MINOR_N) -#define LUA_VERSION_RELEASE LUAI_TOSTR(LUA_VERSION_RELEASE_N) - -#define LUA_VERSION "Lua " LUA_VERSION_MAJOR "." LUA_VERSION_MINOR -#define LUA_RELEASE LUA_VERSION "." LUA_VERSION_RELEASE - - -/****************************************************************************** -* Copyright (C) 1994-2023 Lua.org, PUC-Rio. -* -* Permission is hereby granted, free of charge, to any person obtaining -* a copy of this software and associated documentation files (the -* "Software"), to deal in the Software without restriction, including -* without limitation the rights to use, copy, modify, merge, publish, -* distribute, sublicense, and/or sell copies of the Software, and to -* permit persons to whom the Software is furnished to do so, subject to -* the following conditions: -* -* The above copyright notice and this permission notice shall be -* included in all copies or substantial portions of the Software. -* -* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. -* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY -* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, -* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE -* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. -******************************************************************************/ - - -#endif - - - -/* -** $Id: llimits.h $ -** Limits, basic types, and some other 'installation-dependent' definitions -** See Copyright Notice in lua.h -*/ - -#ifndef llimits_h -#define llimits_h - - -#include -#include - - - - -/* -** 'lu_mem' is an unsigned integer big enough to count the total memory -** used by Lua (in bytes). 'l_obj' is a signed integer big enough to -** count the total number of objects used by Lua. (It is signed due -** to the use of debt in several computations.) Usually, 'size_t' and -** 'ptrdiff_t' should work, but we use 'long' for 16-bit machines. -*/ -#if defined(LUAI_MEM) /* { external definitions? */ -typedef LUAI_UMEM lu_mem; -typedef LUAI_MEM l_obj; -#elif LUAI_IS32INT /* }{ */ -typedef size_t lu_mem; -typedef ptrdiff_t l_obj; -#else /* 16-bit ints */ /* }{ */ -typedef unsigned long lu_mem; -typedef long l_obj; -#endif /* } */ - -#define MAX_LOBJ \ - cast(l_obj, (cast(lu_mem, 1) << (sizeof(l_obj) * CHAR_BIT - 1)) - 1) - - -/* chars used as small naturals (so that 'char' is reserved for characters) */ -typedef unsigned char lu_byte; -typedef signed char ls_byte; - - -/* maximum value for size_t */ -#define MAX_SIZET ((size_t)(~(size_t)0)) - -/* -** Maximum size for strings and userdata visible for Lua (should be -** representable in a lua_Integer) -*/ -#define MAX_SIZE (sizeof(size_t) < sizeof(lua_Integer) ? MAX_SIZET \ - : (size_t)(LUA_MAXINTEGER)) - - -#define MAX_INT INT_MAX /* maximum value of an int */ - - -/* -** floor of the log2 of the maximum signed value for integral type 't'. -** (That is, maximum 'n' such that '2^n' fits in the given signed type.) -*/ -#define log2maxs(t) cast_int(sizeof(t) * 8 - 2) - - -/* -** test whether an unsigned value is a power of 2 (or zero) -*/ -#define ispow2(x) (((x) & ((x) - 1)) == 0) - - -/* number of chars of a literal string without the ending \0 */ -#define LL(x) (sizeof(x)/sizeof(char) - 1) - - -/* -** conversion of pointer to unsigned integer: this is for hashing only; -** there is no problem if the integer cannot hold the whole pointer -** value. (In strict ISO C this may cause undefined behavior, but no -** actual machine seems to bother.) -*/ -#if !defined(LUA_USE_C89) && defined(__STDC_VERSION__) && \ - __STDC_VERSION__ >= 199901L -#include -#if defined(UINTPTR_MAX) /* even in C99 this type is optional */ -#define L_P2I uintptr_t -#else /* no 'intptr'? */ -#define L_P2I uintmax_t /* use the largest available integer */ -#endif -#else /* C89 option */ -#define L_P2I size_t -#endif - -#define point2uint(p) cast_uint((L_P2I)(p) & UINT_MAX) - - - -/* types of 'usual argument conversions' for lua_Number and lua_Integer */ -typedef LUAI_UACNUMBER l_uacNumber; -typedef LUAI_UACINT l_uacInt; - - -/* -** Internal assertions for in-house debugging -*/ -#if defined LUAI_ASSERT -#undef NDEBUG -#include -#define lua_assert(c) assert(c) -#endif - -#if defined(lua_assert) -#define check_exp(c,e) (lua_assert(c), (e)) -/* to avoid problems with conditions too long */ -#define lua_longassert(c) ((c) ? (void)0 : lua_assert(0)) -#else -#define lua_assert(c) ((void)0) -#define check_exp(c,e) (e) -#define lua_longassert(c) ((void)0) -#endif - -/* -** assertion for checking API calls -*/ -#if !defined(luai_apicheck) -#define luai_apicheck(l,e) ((void)l, lua_assert(e)) -#endif - -#define api_check(l,e,msg) luai_apicheck(l,(e) && msg) - - -/* macro to avoid warnings about unused variables */ -#if !defined(UNUSED) -#define UNUSED(x) ((void)(x)) -#endif - - -/* type casts (a macro highlights casts in the code) */ -#define cast(t, exp) ((t)(exp)) - -#define cast_void(i) cast(void, (i)) -#define cast_voidp(i) cast(void *, (i)) -#define cast_num(i) cast(lua_Number, (i)) -#define cast_int(i) cast(int, (i)) -#define cast_uint(i) cast(unsigned int, (i)) -#define cast_byte(i) cast(lu_byte, (i)) -#define cast_uchar(i) cast(unsigned char, (i)) -#define cast_char(i) cast(char, (i)) -#define cast_charp(i) cast(char *, (i)) -#define cast_sizet(i) cast(size_t, (i)) - - -/* cast a signed lua_Integer to lua_Unsigned */ -#if !defined(l_castS2U) -#define l_castS2U(i) ((lua_Unsigned)(i)) -#endif - -/* -** cast a lua_Unsigned to a signed lua_Integer; this cast is -** not strict ISO C, but two-complement architectures should -** work fine. -*/ -#if !defined(l_castU2S) -#define l_castU2S(i) ((lua_Integer)(i)) -#endif - - -/* -** non-return type -*/ -#if !defined(l_noret) - -#if defined(__GNUC__) -#define l_noret void __attribute__((noreturn)) -#elif defined(_MSC_VER) && _MSC_VER >= 1200 -#define l_noret void __declspec(noreturn) -#else -#define l_noret void -#endif - -#endif - - -/* -** Inline functions -*/ -#if !defined(LUA_USE_C89) -#define l_inline inline -#elif defined(__GNUC__) -#define l_inline __inline__ -#else -#define l_inline /* empty */ -#endif - -#define l_sinline static l_inline - - -/* -** type for virtual-machine instructions; -** must be an unsigned with (at least) 4 bytes (see details in lopcodes.h) -*/ -#if LUAI_IS32INT -typedef unsigned int l_uint32; -#else -typedef unsigned long l_uint32; -#endif - -typedef l_uint32 Instruction; - - - -/* -** Maximum length for short strings, that is, strings that are -** internalized. (Cannot be smaller than reserved words or tags for -** metamethods, as these strings must be internalized; -** #("function") = 8, #("__newindex") = 10.) -*/ -#if !defined(LUAI_MAXSHORTLEN) -#define LUAI_MAXSHORTLEN 40 -#endif - - -/* -** Initial size for the string table (must be power of 2). -** The Lua core alone registers ~50 strings (reserved words + -** metaevent keys + a few others). Libraries would typically add -** a few dozens more. -*/ -#if !defined(MINSTRTABSIZE) -#define MINSTRTABSIZE 128 -#endif - - -/* -** Size of cache for strings in the API. 'N' is the number of -** sets (better be a prime) and "M" is the size of each set (M == 1 -** makes a direct cache.) -*/ -#if !defined(STRCACHE_N) -#define STRCACHE_N 53 -#define STRCACHE_M 2 -#endif - - -/* minimum size for string buffer */ -#if !defined(LUA_MINBUFFER) -#define LUA_MINBUFFER 32 -#endif - - -/* -** Maximum depth for nested C calls, syntactical nested non-terminals, -** and other features implemented through recursion in C. (Value must -** fit in a 16-bit unsigned integer. It must also be compatible with -** the size of the C stack.) -*/ -#if !defined(LUAI_MAXCCALLS) -#define LUAI_MAXCCALLS 200 -#endif - - -/* -** macros that are executed whenever program enters the Lua core -** ('lua_lock') and leaves the core ('lua_unlock') -*/ -#if !defined(lua_lock) -#define lua_lock(L) ((void) 0) -#define lua_unlock(L) ((void) 0) -#endif - -/* -** macro executed during Lua functions at points where the -** function can yield. -*/ -#if !defined(luai_threadyield) -#define luai_threadyield(L) {lua_unlock(L); lua_lock(L);} -#endif - - -/* -** these macros allow user-specific actions when a thread is -** created/deleted/resumed/yielded. -*/ -#if !defined(luai_userstateopen) -#define luai_userstateopen(L) ((void)L) -#endif - -#if !defined(luai_userstateclose) -#define luai_userstateclose(L) ((void)L) -#endif - -#if !defined(luai_userstatethread) -#define luai_userstatethread(L,L1) ((void)L) -#endif - -#if !defined(luai_userstatefree) -#define luai_userstatefree(L,L1) ((void)L) -#endif - -#if !defined(luai_userstateresume) -#define luai_userstateresume(L,n) ((void)L) -#endif - -#if !defined(luai_userstateyield) -#define luai_userstateyield(L,n) ((void)L) -#endif - - - -/* -** The luai_num* macros define the primitive operations over numbers. -*/ - -/* floor division (defined as 'floor(a/b)') */ -#if !defined(luai_numidiv) -#define luai_numidiv(L,a,b) ((void)L, l_floor(luai_numdiv(L,a,b))) -#endif - -/* float division */ -#if !defined(luai_numdiv) -#define luai_numdiv(L,a,b) ((a)/(b)) -#endif - -/* -** modulo: defined as 'a - floor(a/b)*b'; the direct computation -** using this definition has several problems with rounding errors, -** so it is better to use 'fmod'. 'fmod' gives the result of -** 'a - trunc(a/b)*b', and therefore must be corrected when -** 'trunc(a/b) ~= floor(a/b)'. That happens when the division has a -** non-integer negative result: non-integer result is equivalent to -** a non-zero remainder 'm'; negative result is equivalent to 'a' and -** 'b' with different signs, or 'm' and 'b' with different signs -** (as the result 'm' of 'fmod' has the same sign of 'a'). -*/ -#if !defined(luai_nummod) -#define luai_nummod(L,a,b,m) \ - { (void)L; (m) = l_mathop(private_lua_embed_fmod)(a,b); \ - if (((m) > 0) ? (b) < 0 : ((m) < 0 && (b) > 0)) (m) += (b); } -#endif - -/* exponentiation */ -#if !defined(luai_numpow) -#define luai_numpow(L,a,b) \ - ((void)L, (b == 2) ? (a)*(a) : l_mathop(private_lua_embed_pow)(a,b)) -#endif - -/* the others are quite standard operations */ -#if !defined(luai_numadd) -#define luai_numadd(L,a,b) ((a)+(b)) -#define luai_numsub(L,a,b) ((a)-(b)) -#define luai_nummul(L,a,b) ((a)*(b)) -#define luai_numunm(L,a) (-(a)) -#define luai_numeq(a,b) ((a)==(b)) -#define luai_numlt(a,b) ((a)<(b)) -#define luai_numle(a,b) ((a)<=(b)) -#define luai_numgt(a,b) ((a)>(b)) -#define luai_numge(a,b) ((a)>=(b)) -#define luai_numisnan(a) (!luai_numeq((a), (a))) -#endif - - - - - -/* -** macro to control inclusion of some hard tests on stack reallocation -*/ -#if !defined(HARDSTACKTESTS) -#define condmovestack(L,pre,pos) ((void)0) -#else -/* realloc stack keeping its size */ -#define condmovestack(L,pre,pos) \ - { int sz_ = stacksize(L); pre; luaD_reallocstack((L), sz_, 0); pos; } -#endif - -#if !defined(HARDMEMTESTS) -#define condchangemem(L,pre,pos) ((void)0) -#else -#define condchangemem(L,pre,pos) \ - { if (gcrunning(G(L))) { pre; luaC_fullgc(L, 0); pos; } } -#endif - -#endif - - -/* -** $Id: lmem.h $ -** Interface to Memory Manager -** See Copyright Notice in lua.h -*/ - -#ifndef lmem_h -#define lmem_h - - -#include - - - -#define luaM_error(L) luaD_throw(L, LUA_ERRMEM) - - -/* -** This macro tests whether it is safe to multiply 'n' by the size of -** type 't' without overflows. Because 'e' is always constant, it avoids -** the runtime division MAX_SIZET/(e). -** (The macro is somewhat complex to avoid warnings: The 'sizeof' -** comparison avoids a runtime comparison when overflow cannot occur. -** The compiler should be able to optimize the real test by itself, but -** when it does it, it may give a warning about "comparison is always -** false due to limited range of data type"; the +1 tricks the compiler, -** avoiding this warning but also this optimization.) -*/ -#define luaM_testsize(n,e) \ - (sizeof(n) >= sizeof(size_t) && cast_sizet((n)) + 1 > MAX_SIZET/(e)) - -#define luaM_checksize(L,n,e) \ - (luaM_testsize(n,e) ? luaM_toobig(L) : cast_void(0)) - - -/* -** Computes the minimum between 'n' and 'MAX_SIZET/sizeof(t)', so that -** the result is not larger than 'n' and cannot overflow a 'size_t' -** when multiplied by the size of type 't'. (Assumes that 'n' is an -** 'int' or 'unsigned int' and that 'int' is not larger than 'size_t'.) -*/ -#define luaM_limitN(n,t) \ - ((cast_sizet(n) <= MAX_SIZET/sizeof(t)) ? (n) : \ - cast_uint((MAX_SIZET/sizeof(t)))) - - -/* -** Arrays of chars do not need any test -*/ -#define luaM_reallocvchar(L,b,on,n) \ - cast_charp(luaM_saferealloc_(L, (b), (on)*sizeof(char), (n)*sizeof(char))) - -#define luaM_freemem(L, b, s) luaM_free_(L, (b), (s)) -#define luaM_free(L, b) luaM_free_(L, (b), sizeof(*(b))) -#define luaM_freearray(L, b, n) luaM_free_(L, (b), (n)*sizeof(*(b))) - -#define luaM_new(L,t) cast(t*, luaM_malloc_(L, sizeof(t), 0)) -#define luaM_newvector(L,n,t) cast(t*, luaM_malloc_(L, (n)*sizeof(t), 0)) -#define luaM_newvectorchecked(L,n,t) \ - (luaM_checksize(L,n,sizeof(t)), luaM_newvector(L,n,t)) - -#define luaM_newobject(L,tag,s) luaM_malloc_(L, (s), tag) - -#define luaM_newblock(L, size) luaM_newvector(L, size, char) - -#define luaM_growvector(L,v,nelems,size,t,limit,e) \ - ((v)=cast(t *, luaM_growaux_(L,v,nelems,&(size),sizeof(t), \ - luaM_limitN(limit,t),e))) - -#define luaM_reallocvector(L, v,oldn,n,t) \ - (cast(t *, luaM_realloc_(L, v, cast_sizet(oldn) * sizeof(t), \ - cast_sizet(n) * sizeof(t)))) - -#define luaM_shrinkvector(L,v,size,fs,t) \ - ((v)=cast(t *, luaM_shrinkvector_(L, v, &(size), fs, sizeof(t)))) - -LUAI_FUNC l_noret luaM_toobig (lua_State *L); - -/* not to be called directly */ -LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize, - size_t size); -LUAI_FUNC void *luaM_saferealloc_ (lua_State *L, void *block, size_t oldsize, - size_t size); -LUAI_FUNC void luaM_free_ (lua_State *L, void *block, size_t osize); -LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int nelems, - int *size, int size_elem, int limit, - const char *what); -LUAI_FUNC void *luaM_shrinkvector_ (lua_State *L, void *block, int *nelem, - int final_n, int size_elem); -LUAI_FUNC void *luaM_malloc_ (lua_State *L, size_t size, int tag); - -#endif - - - -/* -** $Id: lstate.h $ -** Global State -** See Copyright Notice in lua.h -*/ - -#ifndef lstate_h -#define lstate_h - - - -/* Some header files included here need this definition */ -typedef struct CallInfo CallInfo; - - - -/* -** $Id: lobject.h $ -** Type definitions for Lua objects -** See Copyright Notice in lua.h -*/ - - -#ifndef lobject_h -#define lobject_h - - -#include - - - - -/* -** Extra types for collectable non-values -*/ -#define LUA_TUPVAL LUA_NUMTYPES /* upvalues */ -#define LUA_TPROTO (LUA_NUMTYPES+1) /* function prototypes */ -#define LUA_TDEADKEY (LUA_NUMTYPES+2) /* removed keys in tables */ - - - -/* -** number of all possible types (including LUA_TNONE but excluding DEADKEY) -*/ -#define LUA_TOTALTYPES (LUA_TPROTO + 2) - - -/* -** tags for Tagged Values have the following use of bits: -** bits 0-3: actual tag (a LUA_T* constant) -** bits 4-5: variant bits -** bit 6: whether value is collectable -*/ - -/* add variant bits to a type */ -#define makevariant(t,v) ((t) | ((v) << 4)) - - - -/* -** Union of all Lua values -*/ -typedef union Value { - struct GCObject *gc; /* collectable objects */ - void *p; /* light userdata */ - lua_CFunction f; /* light C functions */ - lua_Integer i; /* integer numbers */ - lua_Number n; /* float numbers */ - /* not used, but may avoid warnings for uninitialized value */ - lu_byte ub; -} Value; - - -/* -** Tagged Values. This is the basic representation of values in Lua: -** an actual value plus a tag with its type. -*/ - -#define TValuefields Value value_; lu_byte tt_ - -typedef struct TValue { - TValuefields; -} TValue; - - -#define val_(o) ((o)->value_) -#define valraw(o) (val_(o)) - - -/* raw type tag of a TValue */ -#define rawtt(o) ((o)->tt_) - -/* tag with no variants (bits 0-3) */ -#define novariant(t) ((t) & 0x0F) - -/* type tag of a TValue (bits 0-3 for tags + variant bits 4-5) */ -#define withvariant(t) ((t) & 0x3F) -#define ttypetag(o) withvariant(rawtt(o)) - -/* type of a TValue */ -#define ttype(o) (novariant(rawtt(o))) - - -/* Macros to test type */ -#define checktag(o,t) (rawtt(o) == (t)) -#define checktype(o,t) (ttype(o) == (t)) - - -/* Macros for internal tests */ - -/* collectable object has the same tag as the original value */ -#define righttt(obj) (ttypetag(obj) == gcvalue(obj)->tt) - -/* -** Any value being manipulated by the program either is non -** collectable, or the collectable object has the right tag -** and it is not dead. The option 'L == NULL' allows other -** macros using this one to be used where L is not available. -*/ -#define checkliveness(L,obj) \ - ((void)L, lua_longassert(!iscollectable(obj) || \ - (righttt(obj) && (L == NULL || !isdead(G(L),gcvalue(obj)))))) - - -/* Macros to set values */ - -/* set a value's tag */ -#define settt_(o,t) ((o)->tt_=(t)) - - -/* main macro to copy values (from 'obj2' to 'obj1') */ -#define setobj(L,obj1,obj2) \ - { TValue *io1=(obj1); const TValue *io2=(obj2); \ - io1->value_ = io2->value_; settt_(io1, io2->tt_); \ - checkliveness(L,io1); lua_assert(!isnonstrictnil(io1)); } - -/* -** Different types of assignments, according to source and destination. -** (They are mostly equal now, but may be different in the future.) -*/ - -/* from stack to stack */ -#define setobjs2s(L,o1,o2) setobj(L,s2v(o1),s2v(o2)) -/* to stack (not from same stack) */ -#define setobj2s(L,o1,o2) setobj(L,s2v(o1),o2) -/* from table to same table */ -#define setobjt2t setobj -/* to new object */ -#define setobj2n setobj -/* to table */ -#define setobj2t setobj - - -/* -** Entries in a Lua stack. Field 'tbclist' forms a list of all -** to-be-closed variables active in this stack. Dummy entries are -** used when the distance between two tbc variables does not fit -** in an unsigned short. They are represented by delta==0, and -** their real delta is always the maximum value that fits in -** that field. -*/ -typedef union StackValue { - TValue val; - struct { - TValuefields; - unsigned short delta; - } tbclist; -} StackValue; - - -/* index to stack elements */ -typedef StackValue *StkId; - - -/* -** When reallocating the stack, change all pointers to the stack into -** proper offsets. -*/ -typedef union { - StkId p; /* actual pointer */ - ptrdiff_t offset; /* used while the stack is being reallocated */ -} StkIdRel; - - -/* convert a 'StackValue' to a 'TValue' */ -#define s2v(o) (&(o)->val) - - - -/* -** {================================================================== -** Nil -** =================================================================== -*/ - -/* Standard nil */ -#define LUA_VNIL makevariant(LUA_TNIL, 0) - -/* Empty slot (which might be different from a slot containing nil) */ -#define LUA_VEMPTY makevariant(LUA_TNIL, 1) - -/* Value returned for a key not found in a table (absent key) */ -#define LUA_VABSTKEY makevariant(LUA_TNIL, 2) - -/* Special variant to signal that a fast get is accessing a non-table */ -#define LUA_VNOTABLE makevariant(LUA_TNIL, 3) - - -/* macro to test for (any kind of) nil */ -#define ttisnil(v) checktype((v), LUA_TNIL) - -/* -** Macro to test the result of a table access. Formally, it should -** distinguish between LUA_VEMPTY/LUA_VABSTKEY/LUA_VNOTABLE and -** other tags. As currently nil is equivalent to LUA_VEMPTY, it is -** simpler to just test whether the value is nil. -*/ -#define tagisempty(tag) (novariant(tag) == LUA_TNIL) - - -/* macro to test for a standard nil */ -#define ttisstrictnil(o) checktag((o), LUA_VNIL) - - -#define setnilvalue(obj) settt_(obj, LUA_VNIL) - - -#define isabstkey(v) checktag((v), LUA_VABSTKEY) - - -/* -** macro to detect non-standard nils (used only in assertions) -*/ -#define isnonstrictnil(v) (ttisnil(v) && !ttisstrictnil(v)) - - -/* -** By default, entries with any kind of nil are considered empty. -** (In any definition, values associated with absent keys must also -** be accepted as empty.) -*/ -#define isempty(v) ttisnil(v) - - -/* macro defining a value corresponding to an absent key */ -#define ABSTKEYCONSTANT {NULL}, LUA_VABSTKEY - - -/* mark an entry as empty */ -#define setempty(v) settt_(v, LUA_VEMPTY) - - - -/* }================================================================== */ - - -/* -** {================================================================== -** Booleans -** =================================================================== -*/ - - -#define LUA_VFALSE makevariant(LUA_TBOOLEAN, 0) -#define LUA_VTRUE makevariant(LUA_TBOOLEAN, 1) - -#define ttisboolean(o) checktype((o), LUA_TBOOLEAN) -#define ttisfalse(o) checktag((o), LUA_VFALSE) -#define ttistrue(o) checktag((o), LUA_VTRUE) - - -#define l_isfalse(o) (ttisfalse(o) || ttisnil(o)) -#define tagisfalse(t) ((t) == LUA_VFALSE || novariant(t) == LUA_TNIL) - - - -#define setbfvalue(obj) settt_(obj, LUA_VFALSE) -#define setbtvalue(obj) settt_(obj, LUA_VTRUE) - -/* }================================================================== */ - - -/* -** {================================================================== -** Threads -** =================================================================== -*/ - -#define LUA_VTHREAD makevariant(LUA_TTHREAD, 0) - -#define ttisthread(o) checktag((o), ctb(LUA_VTHREAD)) - -#define thvalue(o) check_exp(ttisthread(o), gco2th(val_(o).gc)) - -#define setthvalue(L,obj,x) \ - { TValue *io = (obj); lua_State *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTHREAD)); \ - checkliveness(L,io); } - -#define setthvalue2s(L,o,t) setthvalue(L,s2v(o),t) - -/* }================================================================== */ - - -/* -** {================================================================== -** Collectable Objects -** =================================================================== -*/ - -/* -** Common Header for all collectable objects (in macro form, to be -** included in other objects) -*/ -#define CommonHeader struct GCObject *next; lu_byte tt; lu_byte marked - - -/* Common type for all collectable objects */ -typedef struct GCObject { - CommonHeader; -} GCObject; - - -/* Bit mark for collectable types */ -#define BIT_ISCOLLECTABLE (1 << 6) - -#define iscollectable(o) (rawtt(o) & BIT_ISCOLLECTABLE) - -/* mark a tag as collectable */ -#define ctb(t) ((t) | BIT_ISCOLLECTABLE) - -#define gcvalue(o) check_exp(iscollectable(o), val_(o).gc) - -#define gcvalueraw(v) ((v).gc) - -#define setgcovalue(L,obj,x) \ - { TValue *io = (obj); GCObject *i_g=(x); \ - val_(io).gc = i_g; settt_(io, ctb(i_g->tt)); } - -/* }================================================================== */ - - -/* -** {================================================================== -** Numbers -** =================================================================== -*/ - -/* Variant tags for numbers */ -#define LUA_VNUMINT makevariant(LUA_TNUMBER, 0) /* integer numbers */ -#define LUA_VNUMFLT makevariant(LUA_TNUMBER, 1) /* float numbers */ - -#define ttisnumber(o) checktype((o), LUA_TNUMBER) -#define ttisfloat(o) checktag((o), LUA_VNUMFLT) -#define ttisinteger(o) checktag((o), LUA_VNUMINT) - -#define nvalue(o) check_exp(ttisnumber(o), \ - (ttisinteger(o) ? cast_num(ivalue(o)) : fltvalue(o))) -#define fltvalue(o) check_exp(ttisfloat(o), val_(o).n) -#define ivalue(o) check_exp(ttisinteger(o), val_(o).i) - -#define fltvalueraw(v) ((v).n) -#define ivalueraw(v) ((v).i) - -#define setfltvalue(obj,x) \ - { TValue *io=(obj); val_(io).n=(x); settt_(io, LUA_VNUMFLT); } - -#define chgfltvalue(obj,x) \ - { TValue *io=(obj); lua_assert(ttisfloat(io)); val_(io).n=(x); } - -#define setivalue(obj,x) \ - { TValue *io=(obj); val_(io).i=(x); settt_(io, LUA_VNUMINT); } - -#define chgivalue(obj,x) \ - { TValue *io=(obj); lua_assert(ttisinteger(io)); val_(io).i=(x); } - -/* }================================================================== */ - - -/* -** {================================================================== -** Strings -** =================================================================== -*/ - -/* Variant tags for strings */ -#define LUA_VSHRSTR makevariant(LUA_TSTRING, 0) /* short strings */ -#define LUA_VLNGSTR makevariant(LUA_TSTRING, 1) /* long strings */ - -#define ttisstring(o) checktype((o), LUA_TSTRING) -#define ttisshrstring(o) checktag((o), ctb(LUA_VSHRSTR)) -#define ttislngstring(o) checktag((o), ctb(LUA_VLNGSTR)) - -#define tsvalueraw(v) (gco2ts((v).gc)) - -#define tsvalue(o) check_exp(ttisstring(o), gco2ts(val_(o).gc)) - -#define setsvalue(L,obj,x) \ - { TValue *io = (obj); TString *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(x_->tt)); \ - checkliveness(L,io); } - -/* set a string to the stack */ -#define setsvalue2s(L,o,s) setsvalue(L,s2v(o),s) - -/* set a string to a new object */ -#define setsvalue2n setsvalue - - -/* Kinds of long strings (stored in 'shrlen') */ -#define LSTRREG -1 /* regular long string */ -#define LSTRFIX -2 /* fixed external long string */ -#define LSTRMEM -3 /* external long string with deallocation */ - - -/* -** Header for a string value. -*/ -typedef struct TString { - CommonHeader; - lu_byte extra; /* reserved words for short strings; "has hash" for longs */ - ls_byte shrlen; /* length for short strings, negative for long strings */ - unsigned int hash; - union { - size_t lnglen; /* length for long strings */ - struct TString *hnext; /* linked list for hash table */ - } u; - char *contents; /* pointer to content in long strings */ - lua_Alloc falloc; /* deallocation function for external strings */ - void *ud; /* user data for external strings */ -} TString; - - -#define strisshr(ts) ((ts)->shrlen >= 0) - - -/* -** Get the actual string (array of bytes) from a 'TString'. (Generic -** version and specialized versions for long and short strings.) -*/ -#define rawgetshrstr(ts) (cast_charp(&(ts)->contents)) -#define getshrstr(ts) check_exp(strisshr(ts), rawgetshrstr(ts)) -#define getlngstr(ts) check_exp(!strisshr(ts), (ts)->contents) -#define getstr(ts) (strisshr(ts) ? rawgetshrstr(ts) : (ts)->contents) - - -/* get string length from 'TString *ts' */ -#define tsslen(ts) \ - (strisshr(ts) ? cast_uint((ts)->shrlen) : (ts)->u.lnglen) - -/* -** Get string and length */ -#define getlstr(ts, len) \ - (strisshr(ts) \ - ? (cast_void((len) = (ts)->shrlen), rawgetshrstr(ts)) \ - : (cast_void((len) = (ts)->u.lnglen), (ts)->contents)) - -/* }================================================================== */ - - -/* -** {================================================================== -** Userdata -** =================================================================== -*/ - - -/* -** Light userdata should be a variant of userdata, but for compatibility -** reasons they are also different types. -*/ -#define LUA_VLIGHTUSERDATA makevariant(LUA_TLIGHTUSERDATA, 0) - -#define LUA_VUSERDATA makevariant(LUA_TUSERDATA, 0) - -#define ttislightuserdata(o) checktag((o), LUA_VLIGHTUSERDATA) -#define ttisfulluserdata(o) checktag((o), ctb(LUA_VUSERDATA)) - -#define pvalue(o) check_exp(ttislightuserdata(o), val_(o).p) -#define uvalue(o) check_exp(ttisfulluserdata(o), gco2u(val_(o).gc)) - -#define pvalueraw(v) ((v).p) - -#define setpvalue(obj,x) \ - { TValue *io=(obj); val_(io).p=(x); settt_(io, LUA_VLIGHTUSERDATA); } - -#define setuvalue(L,obj,x) \ - { TValue *io = (obj); Udata *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VUSERDATA)); \ - checkliveness(L,io); } - - -/* Ensures that addresses after this type are always fully aligned. */ -typedef union UValue { - TValue uv; - LUAI_MAXALIGN; /* ensures maximum alignment for udata bytes */ -} UValue; - - -/* -** Header for userdata with user values; -** memory area follows the end of this structure. -*/ -typedef struct Udata { - CommonHeader; - unsigned short nuvalue; /* number of user values */ - size_t len; /* number of bytes */ - struct Table *metatable; - GCObject *gclist; - UValue uv[1]; /* user values */ -} Udata; - - -/* -** Header for userdata with no user values. These userdata do not need -** to be gray during GC, and therefore do not need a 'gclist' field. -** To simplify, the code always use 'Udata' for both kinds of userdata, -** making sure it never accesses 'gclist' on userdata with no user values. -** This structure here is used only to compute the correct size for -** this representation. (The 'bindata' field in its end ensures correct -** alignment for binary data following this header.) -*/ -typedef struct Udata0 { - CommonHeader; - unsigned short nuvalue; /* number of user values */ - size_t len; /* number of bytes */ - struct Table *metatable; - union {LUAI_MAXALIGN;} bindata; -} Udata0; - - -/* compute the offset of the memory area of a userdata */ -#define udatamemoffset(nuv) \ - ((nuv) == 0 ? offsetof(Udata0, bindata) \ - : offsetof(Udata, uv) + (sizeof(UValue) * (nuv))) - -/* get the address of the memory block inside 'Udata' */ -#define getudatamem(u) (cast_charp(u) + udatamemoffset((u)->nuvalue)) - -/* compute the size of a userdata */ -#define sizeudata(nuv,nb) (udatamemoffset(nuv) + (nb)) - -/* }================================================================== */ - - -/* -** {================================================================== -** Prototypes -** =================================================================== -*/ - -#define LUA_VPROTO makevariant(LUA_TPROTO, 0) - - -/* -** Description of an upvalue for function prototypes -*/ -typedef struct Upvaldesc { - TString *name; /* upvalue name (for debug information) */ - lu_byte instack; /* whether it is in stack (register) */ - lu_byte idx; /* index of upvalue (in stack or in outer function's list) */ - lu_byte kind; /* kind of corresponding variable */ -} Upvaldesc; - - -/* -** Description of a local variable for function prototypes -** (used for debug information) -*/ -typedef struct LocVar { - TString *varname; - int startpc; /* first point where variable is active */ - int endpc; /* first point where variable is dead */ -} LocVar; - - -/* -** Associates the absolute line source for a given instruction ('pc'). -** The array 'lineinfo' gives, for each instruction, the difference in -** lines from the previous instruction. When that difference does not -** fit into a byte, Lua saves the absolute line for that instruction. -** (Lua also saves the absolute line periodically, to speed up the -** computation of a line number: we can use binary search in the -** absolute-line array, but we must traverse the 'lineinfo' array -** linearly to compute a line.) -*/ -typedef struct AbsLineInfo { - int pc; - int line; -} AbsLineInfo; - - -/* -** Flags in Prototypes -*/ -#define PF_ISVARARG 1 -#define PF_FIXED 2 /* prototype has parts in fixed memory */ - - -/* -** Function Prototypes -*/ -typedef struct Proto { - CommonHeader; - lu_byte numparams; /* number of fixed (named) parameters */ - lu_byte flag; - lu_byte maxstacksize; /* number of registers needed by this function */ - int sizeupvalues; /* size of 'upvalues' */ - int sizek; /* size of 'k' */ - int sizecode; - int sizelineinfo; - int sizep; /* size of 'p' */ - int sizelocvars; - int sizeabslineinfo; /* size of 'abslineinfo' */ - int linedefined; /* debug information */ - int lastlinedefined; /* debug information */ - TValue *k; /* constants used by the function */ - Instruction *code; /* opcodes */ - struct Proto **p; /* functions defined inside the function */ - Upvaldesc *upvalues; /* upvalue information */ - ls_byte *lineinfo; /* information about source lines (debug information) */ - AbsLineInfo *abslineinfo; /* idem */ - LocVar *locvars; /* information about local variables (debug information) */ - TString *source; /* used for debug information */ - GCObject *gclist; -} Proto; - -/* }================================================================== */ - - -/* -** {================================================================== -** Functions -** =================================================================== -*/ - -#define LUA_VUPVAL makevariant(LUA_TUPVAL, 0) - - -/* Variant tags for functions */ -#define LUA_VLCL makevariant(LUA_TFUNCTION, 0) /* Lua closure */ -#define LUA_VLCF makevariant(LUA_TFUNCTION, 1) /* light C function */ -#define LUA_VCCL makevariant(LUA_TFUNCTION, 2) /* C closure */ - -#define ttisfunction(o) checktype(o, LUA_TFUNCTION) -#define ttisLclosure(o) checktag((o), ctb(LUA_VLCL)) -#define ttislcf(o) checktag((o), LUA_VLCF) -#define ttisCclosure(o) checktag((o), ctb(LUA_VCCL)) -#define ttisclosure(o) (ttisLclosure(o) || ttisCclosure(o)) - - -#define isLfunction(o) ttisLclosure(o) - -#define clvalue(o) check_exp(ttisclosure(o), gco2cl(val_(o).gc)) -#define clLvalue(o) check_exp(ttisLclosure(o), gco2lcl(val_(o).gc)) -#define fvalue(o) check_exp(ttislcf(o), val_(o).f) -#define clCvalue(o) check_exp(ttisCclosure(o), gco2ccl(val_(o).gc)) - -#define fvalueraw(v) ((v).f) - -#define setclLvalue(L,obj,x) \ - { TValue *io = (obj); LClosure *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VLCL)); \ - checkliveness(L,io); } - -#define setclLvalue2s(L,o,cl) setclLvalue(L,s2v(o),cl) - -#define setfvalue(obj,x) \ - { TValue *io=(obj); val_(io).f=(x); settt_(io, LUA_VLCF); } - -#define setclCvalue(L,obj,x) \ - { TValue *io = (obj); CClosure *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VCCL)); \ - checkliveness(L,io); } - - -/* -** Upvalues for Lua closures -*/ -typedef struct UpVal { - CommonHeader; - union { - TValue *p; /* points to stack or to its own value */ - ptrdiff_t offset; /* used while the stack is being reallocated */ - } v; - union { - struct { /* (when open) */ - struct UpVal *next; /* linked list */ - struct UpVal **previous; - } open; - TValue value; /* the value (when closed) */ - } u; -} UpVal; - - - -#define ClosureHeader \ - CommonHeader; lu_byte nupvalues; GCObject *gclist - -typedef struct CClosure { - ClosureHeader; - lua_CFunction f; - TValue upvalue[1]; /* list of upvalues */ -} CClosure; - - -typedef struct LClosure { - ClosureHeader; - struct Proto *p; - UpVal *upvals[1]; /* list of upvalues */ -} LClosure; - - -typedef union Closure { - CClosure c; - LClosure l; -} Closure; - - -#define getproto(o) (clLvalue(o)->p) - -/* }================================================================== */ - - -/* -** {================================================================== -** Tables -** =================================================================== -*/ - -#define LUA_VTABLE makevariant(LUA_TTABLE, 0) - -#define ttistable(o) checktag((o), ctb(LUA_VTABLE)) - -#define hvalue(o) check_exp(ttistable(o), gco2t(val_(o).gc)) - -#define sethvalue(L,obj,x) \ - { TValue *io = (obj); Table *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTABLE)); \ - checkliveness(L,io); } - -#define sethvalue2s(L,o,h) sethvalue(L,s2v(o),h) - - -/* -** Nodes for Hash tables: A pack of two TValue's (key-value pairs) -** plus a 'next' field to link colliding entries. The distribution -** of the key's fields ('key_tt' and 'key_val') not forming a proper -** 'TValue' allows for a smaller size for 'Node' both in 4-byte -** and 8-byte alignments. -*/ -typedef union Node { - struct NodeKey { - TValuefields; /* fields for value */ - lu_byte key_tt; /* key type */ - int next; /* for chaining */ - Value key_val; /* key value */ - } u; - TValue i_val; /* direct access to node's value as a proper 'TValue' */ -} Node; - - -/* copy a value into a key */ -#define setnodekey(L,node,obj) \ - { Node *n_=(node); const TValue *io_=(obj); \ - n_->u.key_val = io_->value_; n_->u.key_tt = io_->tt_; \ - checkliveness(L,io_); } - - -/* copy a value from a key */ -#define getnodekey(L,obj,node) \ - { TValue *io_=(obj); const Node *n_=(node); \ - io_->value_ = n_->u.key_val; io_->tt_ = n_->u.key_tt; \ - checkliveness(L,io_); } - - -/* -** About 'alimit': if 'isrealasize(t)' is true, then 'alimit' is the -** real size of 'array'. Otherwise, the real size of 'array' is the -** smallest power of two not smaller than 'alimit' (or zero iff 'alimit' -** is zero); 'alimit' is then used as a hint for #t. -*/ - -#define BITRAS (1 << 7) -#define isrealasize(t) (!((t)->flags & BITRAS)) -#define setrealasize(t) ((t)->flags &= cast_byte(~BITRAS)) -#define setnorealasize(t) ((t)->flags |= BITRAS) - - -typedef struct ArrayCell ArrayCell; - - -typedef struct Table { - CommonHeader; - lu_byte flags; /* 1<

u.key_tt) -#define keyval(node) ((node)->u.key_val) - -#define keyisnil(node) (keytt(node) == LUA_TNIL) -#define keyisinteger(node) (keytt(node) == LUA_VNUMINT) -#define keyival(node) (keyval(node).i) -#define keyisshrstr(node) (keytt(node) == ctb(LUA_VSHRSTR)) -#define keystrval(node) (gco2ts(keyval(node).gc)) - -#define setnilkey(node) (keytt(node) = LUA_TNIL) - -#define keyiscollectable(n) (keytt(n) & BIT_ISCOLLECTABLE) - -#define gckey(n) (keyval(n).gc) -#define gckeyN(n) (keyiscollectable(n) ? gckey(n) : NULL) - - -/* -** Dead keys in tables have the tag DEADKEY but keep their original -** gcvalue. This distinguishes them from regular keys but allows them to -** be found when searched in a special way. ('next' needs that to find -** keys removed from a table during a traversal.) -*/ -#define setdeadkey(node) (keytt(node) = LUA_TDEADKEY) -#define keyisdead(node) (keytt(node) == LUA_TDEADKEY) - -/* }================================================================== */ - - - -/* -** 'module' operation for hashing (size is always a power of 2) -*/ -#define lmod(s,size) \ - (check_exp((size&(size-1))==0, (cast_int((s) & ((size)-1))))) - - -#define twoto(x) (1<<(x)) -#define sizenode(t) (twoto((t)->lsizenode)) - - -/* size of buffer for 'luaO_utf8esc' function */ -#define UTF8BUFFSZ 8 - -LUAI_FUNC int luaO_utf8esc (char *buff, unsigned long x); -LUAI_FUNC int luaO_ceillog2 (unsigned int x); -LUAI_FUNC unsigned int luaO_codeparam (unsigned int p); -LUAI_FUNC l_obj luaO_applyparam (unsigned int p, l_obj x); - -LUAI_FUNC int luaO_rawarith (lua_State *L, int op, const TValue *p1, - const TValue *p2, TValue *res); -LUAI_FUNC void luaO_arith (lua_State *L, int op, const TValue *p1, - const TValue *p2, StkId res); -LUAI_FUNC size_t luaO_str2num (const char *s, TValue *o); -LUAI_FUNC int luaO_hexavalue (int c); -LUAI_FUNC void luaO_tostring (lua_State *L, TValue *obj); -LUAI_FUNC const char *luaO_pushvfstring (lua_State *L, const char *fmt, - va_list argp); -LUAI_FUNC const char *luaO_pushfstring (lua_State *L, const char *fmt, ...); -LUAI_FUNC void luaO_chunkid (char *out, const char *source, size_t srclen); - - -#endif - - - -/* -** $Id: ltm.h $ -** Tag methods -** See Copyright Notice in lua.h -*/ - -#ifndef ltm_h -#define ltm_h - - - - -/* -* WARNING: if you change the order of this enumeration, -* grep "ORDER TM" and "ORDER OP" -*/ -typedef enum { - TM_INDEX, - TM_NEWINDEX, - TM_GC, - TM_MODE, - TM_LEN, - TM_EQ, /* last tag method with fast access */ - TM_ADD, - TM_SUB, - TM_MUL, - TM_MOD, - TM_POW, - TM_DIV, - TM_IDIV, - TM_BAND, - TM_BOR, - TM_BXOR, - TM_SHL, - TM_SHR, - TM_UNM, - TM_BNOT, - TM_LT, - TM_LE, - TM_CONCAT, - TM_CALL, - TM_CLOSE, - TM_N /* number of elements in the enum */ -} TMS; - - -/* -** Mask with 1 in all fast-access methods. A 1 in any of these bits -** in the flag of a (meta)table means the metatable does not have the -** corresponding metamethod field. (Bit 6 of the flag indicates that -** the table is using the dummy node; bit 7 is used for 'isrealasize'.) -*/ -#define maskflags (~(~0u << (TM_EQ + 1))) - - -/* -** Test whether there is no tagmethod. -** (Because tagmethods use raw accesses, the result may be an "empty" nil.) -*/ -#define notm(tm) ttisnil(tm) - -#define checknoTM(mt,e) ((mt) == NULL || (mt)->flags & (1u<<(e))) - -#define gfasttm(g,mt,e) \ - (checknoTM(mt, e) ? NULL : luaT_gettm(mt, e, (g)->tmname[e])) - -#define fasttm(l,mt,e) gfasttm(G(l), mt, e) - -#define ttypename(x) luaT_typenames_[(x) + 1] - -LUAI_DDEC(const char *const luaT_typenames_[LUA_TOTALTYPES];) - - -LUAI_FUNC const char *luaT_objtypename (lua_State *L, const TValue *o); - -LUAI_FUNC const TValue *luaT_gettm (Table *events, TMS event, TString *ename); -LUAI_FUNC const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, - TMS event); -LUAI_FUNC void luaT_init (lua_State *L); - -LUAI_FUNC void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, const TValue *p3); -LUAI_FUNC int luaT_callTMres (lua_State *L, const TValue *f, - const TValue *p1, const TValue *p2, StkId p3); -LUAI_FUNC void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event); -LUAI_FUNC void luaT_tryconcatTM (lua_State *L); -LUAI_FUNC void luaT_trybinassocTM (lua_State *L, const TValue *p1, - const TValue *p2, int inv, StkId res, TMS event); -LUAI_FUNC void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, - int inv, StkId res, TMS event); -LUAI_FUNC int luaT_callorderTM (lua_State *L, const TValue *p1, - const TValue *p2, TMS event); -LUAI_FUNC int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, - int inv, int isfloat, TMS event); - -LUAI_FUNC void luaT_adjustvarargs (lua_State *L, int nfixparams, - struct CallInfo *ci, const Proto *p); -LUAI_FUNC void luaT_getvarargs (lua_State *L, struct CallInfo *ci, - StkId where, int wanted); - - -#endif - - -/* -** $Id: lzio.h $ -** Buffered streams -** See Copyright Notice in lua.h -*/ - - -#ifndef lzio_h -#define lzio_h - - - - -#define EOZ (-1) /* end of stream */ - -typedef struct Zio ZIO; - -#define zgetc(z) (((z)->n--)>0 ? cast_uchar(*(z)->p++) : luaZ_fill(z)) - - -typedef struct Mbuffer { - char *buffer; - size_t n; - size_t buffsize; -} Mbuffer; - -#define luaZ_initbuffer(L, buff) ((buff)->buffer = NULL, (buff)->buffsize = 0) - -#define luaZ_buffer(buff) ((buff)->buffer) -#define luaZ_sizebuffer(buff) ((buff)->buffsize) -#define luaZ_bufflen(buff) ((buff)->n) - -#define luaZ_buffremove(buff,i) ((buff)->n -= (i)) -#define luaZ_resetbuffer(buff) ((buff)->n = 0) - - -#define luaZ_resizebuffer(L, buff, size) \ - ((buff)->buffer = luaM_reallocvchar(L, (buff)->buffer, \ - (buff)->buffsize, size), \ - (buff)->buffsize = size) - -#define luaZ_freebuffer(L, buff) luaZ_resizebuffer(L, buff, 0) - - -LUAI_FUNC void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, - void *data); -LUAI_FUNC size_t luaZ_read (ZIO* z, void *b, size_t n); /* read next n bytes */ - -LUAI_FUNC const void *luaZ_getaddr (ZIO* z, size_t n); - - -/* --------- Private Part ------------------ */ - -struct Zio { - size_t n; /* bytes still unread */ - const char *p; /* current position in buffer */ - lua_Reader reader; /* reader function */ - void *data; /* additional data */ - lua_State *L; /* Lua state (for reader) */ -}; - - -LUAI_FUNC int luaZ_fill (ZIO *z); - -#endif - - - -/* -** Some notes about garbage-collected objects: All objects in Lua must -** be kept somehow accessible until being freed, so all objects always -** belong to one (and only one) of these lists, using field 'next' of -** the 'CommonHeader' for the link: -** -** 'allgc': all objects not marked for finalization; -** 'finobj': all objects marked for finalization; -** 'tobefnz': all objects ready to be finalized; -** 'fixedgc': all objects that are not to be collected (currently -** only small strings, such as reserved words). -** -** For the generational collector, some of these lists have marks for -** generations. Each mark points to the first element in the list for -** that particular generation; that generation goes until the next mark. -** -** 'allgc' -> 'survival': new objects; -** 'survival' -> 'old': objects that survived one collection; -** 'old1' -> 'reallyold': objects that became old in last collection; -** 'reallyold' -> NULL: objects old for more than one cycle. -** -** 'finobj' -> 'finobjsur': new objects marked for finalization; -** 'finobjsur' -> 'finobjold1': survived """"; -** 'finobjold1' -> 'finobjrold': just old """"; -** 'finobjrold' -> NULL: really old """". -** -** All lists can contain elements older than their main ages, due -** to 'luaC_checkfinalizer' and 'udata2finalize', which move -** objects between the normal lists and the "marked for finalization" -** lists. Moreover, barriers can age young objects in young lists as -** OLD0, which then become OLD1. However, a list never contains -** elements younger than their main ages. -** -** The generational collector also uses a pointer 'firstold1', which -** points to the first OLD1 object in the list. It is used to optimize -** 'markold'. (Potentially OLD1 objects can be anywhere between 'allgc' -** and 'reallyold', but often the list has no OLD1 objects or they are -** after 'old1'.) Note the difference between it and 'old1': -** 'firstold1': no OLD1 objects before this point; there can be all -** ages after it. -** 'old1': no objects younger than OLD1 after this point. -*/ - -/* -** Moreover, there is another set of lists that control gray objects. -** These lists are linked by fields 'gclist'. (All objects that -** can become gray have such a field. The field is not the same -** in all objects, but it always has this name.) Any gray object -** must belong to one of these lists, and all objects in these lists -** must be gray (with two exceptions explained below): -** -** 'gray': regular gray objects, still waiting to be visited. -** 'grayagain': objects that must be revisited at the atomic phase. -** That includes -** - black objects got in a write barrier; -** - all kinds of weak tables during propagation phase; -** - all threads. -** 'weak': tables with weak values to be cleared; -** 'ephemeron': ephemeron tables with white->white entries; -** 'allweak': tables with weak keys and/or weak values to be cleared. -** -** The exceptions to that "gray rule" are: -** - TOUCHED2 objects in generational mode stay in a gray list (because -** they must be visited again at the end of the cycle), but they are -** marked black because assignments to them must activate barriers (to -** move them back to TOUCHED1). -** - Open upvales are kept gray to avoid barriers, but they stay out -** of gray lists. (They don't even have a 'gclist' field.) -*/ - - - -/* -** About 'nCcalls': This count has two parts: the lower 16 bits counts -** the number of recursive invocations in the C stack; the higher -** 16 bits counts the number of non-yieldable calls in the stack. -** (They are together so that we can change and save both with one -** instruction.) -*/ - - -/* true if this thread does not have non-yieldable calls in the stack */ -#define yieldable(L) (((L)->nCcalls & 0xffff0000) == 0) - -/* real number of C calls */ -#define getCcalls(L) ((L)->nCcalls & 0xffff) - - -/* Increment the number of non-yieldable calls */ -#define incnny(L) ((L)->nCcalls += 0x10000) - -/* Decrement the number of non-yieldable calls */ -#define decnny(L) ((L)->nCcalls -= 0x10000) - -/* Non-yieldable call increment */ -#define nyci (0x10000 | 1) - - - - -struct lua_longjmp; /* defined in ldo.c */ - - -/* -** Atomic type (relative to signals) to better ensure that 'lua_sethook' -** is thread safe -*/ -#if !defined(l_signalT) -#include -#define l_signalT sig_atomic_t -#endif - - -/* -** Extra stack space to handle TM calls and some other extras. This -** space is not included in 'stack_last'. It is used only to avoid stack -** checks, either because the element will be promptly popped or because -** there will be a stack check soon after the push. Function frames -** never use this extra space, so it does not need to be kept clean. -*/ -#define EXTRA_STACK 5 - - -#define BASIC_STACK_SIZE (2*LUA_MINSTACK) - -#define stacksize(th) cast_int((th)->stack_last.p - (th)->stack.p) - - -/* kinds of Garbage Collection */ -#define KGC_INC 0 /* incremental gc */ -#define KGC_GENMINOR 1 /* generational gc in minor (regular) mode */ -#define KGC_GENMAJOR 2 /* generational in major mode */ - - -typedef struct stringtable { - TString **hash; /* array of buckets (linked lists of strings) */ - int nuse; /* number of elements */ - int size; /* number of buckets */ -} stringtable; - - -/* -** Information about a call. -** About union 'u': -** - field 'l' is used only for Lua functions; -** - field 'c' is used only for C functions. -** About union 'u2': -** - field 'funcidx' is used only by C functions while doing a -** protected call; -** - field 'nyield' is used only while a function is "doing" an -** yield (from the yield until the next resume); -** - field 'nres' is used only while closing tbc variables when -** returning from a function; -** - field 'transferinfo' is used only during call/returnhooks, -** before the function starts or after it ends. -*/ -struct CallInfo { - StkIdRel func; /* function index in the stack */ - StkIdRel top; /* top for this function */ - struct CallInfo *previous, *next; /* dynamic call link */ - union { - struct { /* only for Lua functions */ - const Instruction *savedpc; - volatile l_signalT trap; /* function is tracing lines/counts */ - int nextraargs; /* # of extra arguments in vararg functions */ - } l; - struct { /* only for C functions */ - lua_KFunction k; /* continuation in case of yields */ - ptrdiff_t old_errfunc; - lua_KContext ctx; /* context info. in case of yields */ - } c; - } u; - union { - int funcidx; /* called-function index */ - int nyield; /* number of values yielded */ - int nres; /* number of values returned */ - struct { /* info about transferred values (for call/return hooks) */ - unsigned short ftransfer; /* offset of first value transferred */ - unsigned short ntransfer; /* number of values transferred */ - } transferinfo; - } u2; - short nresults; /* expected number of results from this function */ - unsigned short callstatus; -}; - - -/* -** Bits in CallInfo status -*/ -#define CIST_OAH (1<<0) /* original value of 'allowhook' */ -#define CIST_C (1<<1) /* call is running a C function */ -#define CIST_FRESH (1<<2) /* call is on a fresh "luaV_execute" frame */ -#define CIST_HOOKED (1<<3) /* call is running a debug hook */ -#define CIST_YPCALL (1<<4) /* doing a yieldable protected call */ -#define CIST_TAIL (1<<5) /* call was tail called */ -#define CIST_HOOKYIELD (1<<6) /* last hook called yielded */ -#define CIST_FIN (1<<7) /* function "called" a finalizer */ -#define CIST_TRAN (1<<8) /* 'ci' has transfer information */ -#define CIST_CLSRET (1<<9) /* function is closing tbc variables */ -/* Bits 10-12 are used for CIST_RECST (see below) */ -#define CIST_RECST 10 -#if defined(LUA_COMPAT_LT_LE) -#define CIST_LEQ (1<<13) /* using __lt for __le */ -#endif - - -/* -** Field CIST_RECST stores the "recover status", used to keep the error -** status while closing to-be-closed variables in coroutines, so that -** Lua can correctly resume after an yield from a __close method called -** because of an error. (Three bits are enough for error status.) -*/ -#define getcistrecst(ci) (((ci)->callstatus >> CIST_RECST) & 7) -#define setcistrecst(ci,st) \ - check_exp(((st) & 7) == (st), /* status must fit in three bits */ \ - ((ci)->callstatus = ((ci)->callstatus & ~(7 << CIST_RECST)) \ - | ((st) << CIST_RECST))) - - -/* active function is a Lua function */ -#define isLua(ci) (!((ci)->callstatus & CIST_C)) - -/* call is running Lua code (not a hook) */ -#define isLuacode(ci) (!((ci)->callstatus & (CIST_C | CIST_HOOKED))) - -/* assume that CIST_OAH has offset 0 and that 'v' is strictly 0/1 */ -#define setoah(st,v) ((st) = ((st) & ~CIST_OAH) | (v)) -#define getoah(st) ((st) & CIST_OAH) - - -/* -** 'global state', shared by all threads of this state -*/ -typedef struct global_State { - lua_Alloc frealloc; /* function to reallocate memory */ - void *ud; /* auxiliary data to 'frealloc' */ - lu_mem totalbytes; /* number of bytes currently allocated */ - l_obj totalobjs; /* total number of objects allocated + GCdebt */ - l_obj GCdebt; /* objects counted but not yet allocated */ - l_obj marked; /* number of objects marked in a GC cycle */ - l_obj GCmajorminor; /* auxiliar counter to control major-minor shifts */ - stringtable strt; /* hash table for strings */ - TValue l_registry; - TValue nilvalue; /* a nil value */ - unsigned int seed; /* randomized seed for hashes */ - lu_byte gcparams[LUA_GCPN]; - lu_byte currentwhite; - lu_byte gcstate; /* state of garbage collector */ - lu_byte gckind; /* kind of GC running */ - lu_byte gcstopem; /* stops emergency collections */ - lu_byte gcstp; /* control whether GC is running */ - lu_byte gcemergency; /* true if this is an emergency collection */ - GCObject *allgc; /* list of all collectable objects */ - GCObject **sweepgc; /* current position of sweep in list */ - GCObject *finobj; /* list of collectable objects with finalizers */ - GCObject *gray; /* list of gray objects */ - GCObject *grayagain; /* list of objects to be traversed atomically */ - GCObject *weak; /* list of tables with weak values */ - GCObject *ephemeron; /* list of ephemeron tables (weak keys) */ - GCObject *allweak; /* list of all-weak tables */ - GCObject *tobefnz; /* list of userdata to be GC */ - GCObject *fixedgc; /* list of objects not to be collected */ - /* fields for generational collector */ - GCObject *survival; /* start of objects that survived one GC cycle */ - GCObject *old1; /* start of old1 objects */ - GCObject *reallyold; /* objects more than one cycle old ("really old") */ - GCObject *firstold1; /* first OLD1 object in the list (if any) */ - GCObject *finobjsur; /* list of survival objects with finalizers */ - GCObject *finobjold1; /* list of old1 objects with finalizers */ - GCObject *finobjrold; /* list of really old objects with finalizers */ - struct lua_State *twups; /* list of threads with open upvalues */ - lua_CFunction panic; /* to be called in unprotected errors */ - struct lua_State *mainthread; - TString *memerrmsg; /* message for memory-allocation errors */ - TString *tmname[TM_N]; /* array with tag-method names */ - struct Table *mt[LUA_NUMTYPES]; /* metatables for basic types */ - TString *strcache[STRCACHE_N][STRCACHE_M]; /* cache for strings in API */ - lua_WarnFunction warnf; /* warning function */ - void *ud_warn; /* auxiliary data to 'warnf' */ -} global_State; - - -/* -** 'per thread' state -*/ -struct lua_State { - CommonHeader; - lu_byte status; - lu_byte allowhook; - unsigned short nci; /* number of items in 'ci' list */ - StkIdRel top; /* first free slot in the stack */ - global_State *l_G; - CallInfo *ci; /* call info for current function */ - StkIdRel stack_last; /* end of stack (last element + 1) */ - StkIdRel stack; /* stack base */ - UpVal *openupval; /* list of open upvalues in this stack */ - StkIdRel tbclist; /* list of to-be-closed variables */ - GCObject *gclist; - struct lua_State *twups; /* list of threads with open upvalues */ - struct lua_longjmp *errorJmp; /* current error recover point */ - CallInfo base_ci; /* CallInfo for first level (C calling Lua) */ - volatile lua_Hook hook; - ptrdiff_t errfunc; /* current error handling function (stack index) */ - l_uint32 nCcalls; /* number of nested (non-yieldable | C) calls */ - int oldpc; /* last pc traced */ - int basehookcount; - int hookcount; - volatile l_signalT hookmask; -}; - - -#define G(L) (L->l_G) - -/* -** 'g->nilvalue' being a nil value flags that the state was completely -** build. -*/ -#define completestate(g) ttisnil(&g->nilvalue) - - -/* -** Union of all collectable objects (only for conversions) -** ISO C99, 6.5.2.3 p.5: -** "if a union contains several structures that share a common initial -** sequence [...], and if the union object currently contains one -** of these structures, it is permitted to inspect the common initial -** part of any of them anywhere that a declaration of the complete type -** of the union is visible." -*/ -union GCUnion { - GCObject gc; /* common header */ - struct TString ts; - struct Udata u; - union Closure cl; - struct Table h; - struct Proto p; - struct lua_State th; /* thread */ - struct UpVal upv; -}; - - -/* -** ISO C99, 6.7.2.1 p.14: -** "A pointer to a union object, suitably converted, points to each of -** its members [...], and vice versa." -*/ -#define cast_u(o) cast(union GCUnion *, (o)) - -/* macros to convert a GCObject into a specific value */ -#define gco2ts(o) \ - check_exp(novariant((o)->tt) == LUA_TSTRING, &((cast_u(o))->ts)) -#define gco2u(o) check_exp((o)->tt == LUA_VUSERDATA, &((cast_u(o))->u)) -#define gco2lcl(o) check_exp((o)->tt == LUA_VLCL, &((cast_u(o))->cl.l)) -#define gco2ccl(o) check_exp((o)->tt == LUA_VCCL, &((cast_u(o))->cl.c)) -#define gco2cl(o) \ - check_exp(novariant((o)->tt) == LUA_TFUNCTION, &((cast_u(o))->cl)) -#define gco2t(o) check_exp((o)->tt == LUA_VTABLE, &((cast_u(o))->h)) -#define gco2p(o) check_exp((o)->tt == LUA_VPROTO, &((cast_u(o))->p)) -#define gco2th(o) check_exp((o)->tt == LUA_VTHREAD, &((cast_u(o))->th)) -#define gco2upv(o) check_exp((o)->tt == LUA_VUPVAL, &((cast_u(o))->upv)) - - -/* -** macro to convert a Lua object into a GCObject -** (The access to 'tt' tries to ensure that 'v' is actually a Lua object.) -*/ -#define obj2gco(v) check_exp((v)->tt >= LUA_TSTRING, &(cast_u(v)->gc)) - - -/* actual number of total objects allocated */ -#define gettotalobjs(g) ((g)->totalobjs - (g)->GCdebt) - - -LUAI_FUNC void luaE_setdebt (global_State *g, l_obj debt); -LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1); -LUAI_FUNC CallInfo *luaE_extendCI (lua_State *L); -LUAI_FUNC void luaE_shrinkCI (lua_State *L); -LUAI_FUNC void luaE_checkcstack (lua_State *L); -LUAI_FUNC void luaE_incCstack (lua_State *L); -LUAI_FUNC void luaE_warning (lua_State *L, const char *msg, int tocont); -LUAI_FUNC void luaE_warnerror (lua_State *L, const char *where); -LUAI_FUNC int luaE_resetthread (lua_State *L, int status); - - -#endif - - - - -int luaZ_fill (ZIO *z) { - size_t size; - lua_State *L = z->L; - const char *buff; - lua_unlock(L); - buff = z->reader(L, z->data, &size); - lua_lock(L); - if (buff == NULL || size == 0) - return EOZ; - z->n = size - 1; /* discount char being returned */ - z->p = buff; - return cast_uchar(*(z->p++)); -} - - -void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, void *data) { - z->L = L; - z->reader = reader; - z->data = data; - z->n = 0; - z->p = NULL; -} - - -/* --------------------------------------------------------------- read --- */ - -static int checkbuffer (ZIO *z) { - if (z->n == 0) { /* no bytes in buffer? */ - if (luaZ_fill(z) == EOZ) /* try to read more */ - return 0; /* no more input */ - else { - z->n++; /* luaZ_fill consumed first byte; put it back */ - z->p--; - } - } - return 1; /* now buffer has something */ -} - - -size_t luaZ_read (ZIO *z, void *b, size_t n) { - while (n) { - size_t m; - if (!checkbuffer(z)) - return n; /* no more input; return number of missing bytes */ - m = (n <= z->n) ? n : z->n; /* min. between n and z->n */ - memcpy(b, z->p, m); - z->n -= m; - z->p += m; - b = (char *)b + m; - n -= m; - } - return 0; -} - - -const void *luaZ_getaddr (ZIO* z, size_t n) { - const void *res; - if (!checkbuffer(z)) - return NULL; /* no more input */ - if (z->n < n) /* not enough bytes? */ - return NULL; /* block not whole; cannot give an address */ - res = z->p; /* get block address */ - z->n -= n; /* consume these bytes */ - z->p += n; - return res; -} - - -/* -** $Id: lctype.c $ -** 'ctype' functions for Lua -** See Copyright Notice in lua.h -*/ - -#define lctype_c -#define LUA_CORE - - - - -/* -** $Id: lctype.h $ -** 'ctype' functions for Lua -** See Copyright Notice in lua.h -*/ - -#ifndef lctype_h -#define lctype_h - - - -/* -** WARNING: the functions defined here do not necessarily correspond -** to the similar functions in the standard C ctype.h. They are -** optimized for the specific needs of Lua. -*/ - -#if !defined(LUA_USE_CTYPE) - -#if 'A' == 65 && '0' == 48 -/* ASCII case: can use its own tables; faster and fixed */ -#define LUA_USE_CTYPE 0 -#else -/* must use standard C ctype */ -#define LUA_USE_CTYPE 1 -#endif - -#endif - - -#if !LUA_USE_CTYPE /* { */ - -#include - - - -#define ALPHABIT 0 -#define DIGITBIT 1 -#define PRINTBIT 2 -#define SPACEBIT 3 -#define XDIGITBIT 4 - - -#define MASK(B) (1 << (B)) - - -/* -** add 1 to char to allow index -1 (EOZ) -*/ -#define testprop(c,p) (luai_ctype_[(c)+1] & (p)) - -/* -** 'lalpha' (Lua alphabetic) and 'lalnum' (Lua alphanumeric) both include '_' -*/ -#define lislalpha(c) testprop(c, MASK(ALPHABIT)) -#define lislalnum(c) testprop(c, (MASK(ALPHABIT) | MASK(DIGITBIT))) -#define lisdigit(c) testprop(c, MASK(DIGITBIT)) -#define lisspace(c) testprop(c, MASK(SPACEBIT)) -#define lisprint(c) testprop(c, MASK(PRINTBIT)) -#define lisxdigit(c) testprop(c, MASK(XDIGITBIT)) - - -/* -** In ASCII, this 'ltolower' is correct for alphabetic characters and -** for '.'. That is enough for Lua needs. ('check_exp' ensures that -** the character either is an upper-case letter or is unchanged by -** the transformation, which holds for lower-case letters and '.'.) -*/ -#define ltolower(c) \ - check_exp(('A' <= (c) && (c) <= 'Z') || (c) == ((c) | ('A' ^ 'a')), \ - (c) | ('A' ^ 'a')) - - -/* one entry for each character and for -1 (EOZ) */ -LUAI_DDEC(const lu_byte luai_ctype_[UCHAR_MAX + 2];) - - -#else /* }{ */ - -/* -** use standard C ctypes -*/ - -#include - - -#define lislalpha(c) (isalpha(c) || (c) == '_') -#define lislalnum(c) (isalnum(c) || (c) == '_') -#define lisdigit(c) (isdigit(c)) -#define lisspace(c) (isspace(c)) -#define lisprint(c) (isprint(c)) -#define lisxdigit(c) (isxdigit(c)) - -#define ltolower(c) (tolower(c)) - -#endif /* } */ - -#endif - - - -#if !LUA_USE_CTYPE /* { */ - -#include - - -#if defined (LUA_UCID) /* accept UniCode IDentifiers? */ -/* consider all non-ascii codepoints to be alphabetic */ -#define NONA 0x01 -#else -#define NONA 0x00 /* default */ -#endif - - -LUAI_DDEF const lu_byte luai_ctype_[UCHAR_MAX + 2] = { - 0x00, /* EOZ */ - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0. */ - 0x00, 0x08, 0x08, 0x08, 0x08, 0x08, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 1. */ - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x0c, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, /* 2. */ - 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, /* 3. */ - 0x16, 0x16, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x04, 0x15, 0x15, 0x15, 0x15, 0x15, 0x15, 0x05, /* 4. */ - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, /* 5. */ - 0x05, 0x05, 0x05, 0x04, 0x04, 0x04, 0x04, 0x05, - 0x04, 0x15, 0x15, 0x15, 0x15, 0x15, 0x15, 0x05, /* 6. */ - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, /* 7. */ - 0x05, 0x05, 0x05, 0x04, 0x04, 0x04, 0x04, 0x00, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* 8. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* 9. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* a. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* b. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - 0x00, 0x00, NONA, NONA, NONA, NONA, NONA, NONA, /* c. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* d. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* e. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, 0x00, 0x00, 0x00, /* f. */ - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 -}; - -#endif /* } */ - - -/* -** $Id: lopcodes.c $ -** Opcodes for Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#define lopcodes_c -#define LUA_CORE - - - - -/* -** $Id: lopcodes.h $ -** Opcodes for Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#ifndef lopcodes_h -#define lopcodes_h - - - -/*=========================================================================== - We assume that instructions are unsigned 32-bit integers. - All instructions have an opcode in the first 7 bits. - Instructions can have the following formats: - - 3 3 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 - 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 -iABC C(8) | B(8) |k| A(8) | Op(7) | -iABx Bx(17) | A(8) | Op(7) | -iAsBx sBx (signed)(17) | A(8) | Op(7) | -iAx Ax(25) | Op(7) | -isJ sJ (signed)(25) | Op(7) | - - A signed argument is represented in excess K: the represented value is - the written unsigned value minus K, where K is half the maximum for the - corresponding unsigned argument. -===========================================================================*/ - - -enum OpMode {iABC, iABx, iAsBx, iAx, isJ}; /* basic instruction formats */ - - -/* -** size and position of opcode arguments. -*/ -#define SIZE_C 8 -#define SIZE_B 8 -#define SIZE_Bx (SIZE_C + SIZE_B + 1) -#define SIZE_A 8 -#define SIZE_Ax (SIZE_Bx + SIZE_A) -#define SIZE_sJ (SIZE_Bx + SIZE_A) - -#define SIZE_OP 7 - -#define POS_OP 0 - -#define POS_A (POS_OP + SIZE_OP) -#define POS_k (POS_A + SIZE_A) -#define POS_B (POS_k + 1) -#define POS_C (POS_B + SIZE_B) - -#define POS_Bx POS_k - -#define POS_Ax POS_A - -#define POS_sJ POS_A - - -/* -** limits for opcode arguments. -** we use (signed) 'int' to manipulate most arguments, -** so they must fit in ints. -*/ - -/* Check whether type 'int' has at least 'b' bits ('b' < 32) */ -#define L_INTHASBITS(b) ((UINT_MAX >> ((b) - 1)) >= 1) - - -#if L_INTHASBITS(SIZE_Bx) -#define MAXARG_Bx ((1<>1) /* 'sBx' is signed */ - - -#if L_INTHASBITS(SIZE_Ax) -#define MAXARG_Ax ((1<> 1) - - -#define MAXARG_A ((1<> 1) - -#define int2sC(i) ((i) + OFFSET_sC) -#define sC2int(i) ((i) - OFFSET_sC) - - -/* creates a mask with 'n' 1 bits at position 'p' */ -#define MASK1(n,p) ((~((~(Instruction)0)<<(n)))<<(p)) - -/* creates a mask with 'n' 0 bits at position 'p' */ -#define MASK0(n,p) (~MASK1(n,p)) - -/* -** the following macros help to manipulate instructions -*/ - -#define GET_OPCODE(i) (cast(OpCode, ((i)>>POS_OP) & MASK1(SIZE_OP,0))) -#define SET_OPCODE(i,o) ((i) = (((i)&MASK0(SIZE_OP,POS_OP)) | \ - ((cast(Instruction, o)<>(pos)) & MASK1(size,0))) -#define setarg(i,v,pos,size) ((i) = (((i)&MASK0(size,pos)) | \ - ((cast(Instruction, v)<> sC */ -OP_SHLI,/* A B sC R[A] := sC << R[B] */ - -OP_ADD,/* A B C R[A] := R[B] + R[C] */ -OP_SUB,/* A B C R[A] := R[B] - R[C] */ -OP_MUL,/* A B C R[A] := R[B] * R[C] */ -OP_MOD,/* A B C R[A] := R[B] % R[C] */ -OP_POW,/* A B C R[A] := R[B] ^ R[C] */ -OP_DIV,/* A B C R[A] := R[B] / R[C] */ -OP_IDIV,/* A B C R[A] := R[B] // R[C] */ - -OP_BAND,/* A B C R[A] := R[B] & R[C] */ -OP_BOR,/* A B C R[A] := R[B] | R[C] */ -OP_BXOR,/* A B C R[A] := R[B] ~ R[C] */ -OP_SHL,/* A B C R[A] := R[B] << R[C] */ -OP_SHR,/* A B C R[A] := R[B] >> R[C] */ - -OP_MMBIN,/* A B C call C metamethod over R[A] and R[B] (*) */ -OP_MMBINI,/* A sB C k call C metamethod over R[A] and sB */ -OP_MMBINK,/* A B C k call C metamethod over R[A] and K[B] */ - -OP_UNM,/* A B R[A] := -R[B] */ -OP_BNOT,/* A B R[A] := ~R[B] */ -OP_NOT,/* A B R[A] := not R[B] */ -OP_LEN,/* A B R[A] := #R[B] (length operator) */ - -OP_CONCAT,/* A B R[A] := R[A].. ... ..R[A + B - 1] */ - -OP_CLOSE,/* A close all upvalues >= R[A] */ -OP_TBC,/* A mark variable A "to be closed" */ -OP_JMP,/* sJ pc += sJ */ -OP_EQ,/* A B k if ((R[A] == R[B]) ~= k) then pc++ */ -OP_LT,/* A B k if ((R[A] < R[B]) ~= k) then pc++ */ -OP_LE,/* A B k if ((R[A] <= R[B]) ~= k) then pc++ */ - -OP_EQK,/* A B k if ((R[A] == K[B]) ~= k) then pc++ */ -OP_EQI,/* A sB k if ((R[A] == sB) ~= k) then pc++ */ -OP_LTI,/* A sB k if ((R[A] < sB) ~= k) then pc++ */ -OP_LEI,/* A sB k if ((R[A] <= sB) ~= k) then pc++ */ -OP_GTI,/* A sB k if ((R[A] > sB) ~= k) then pc++ */ -OP_GEI,/* A sB k if ((R[A] >= sB) ~= k) then pc++ */ - -OP_TEST,/* A k if (not R[A] == k) then pc++ */ -OP_TESTSET,/* A B k if (not R[B] == k) then pc++ else R[A] := R[B] (*) */ - -OP_CALL,/* A B C R[A], ... ,R[A+C-2] := R[A](R[A+1], ... ,R[A+B-1]) */ -OP_TAILCALL,/* A B C k return R[A](R[A+1], ... ,R[A+B-1]) */ - -OP_RETURN,/* A B C k return R[A], ... ,R[A+B-2] (see note) */ -OP_RETURN0,/* return */ -OP_RETURN1,/* A return R[A] */ - -OP_FORLOOP,/* A Bx update counters; if loop continues then pc-=Bx; */ -OP_FORPREP,/* A Bx ; - if not to run then pc+=Bx+1; */ - -OP_TFORPREP,/* A Bx create upvalue for R[A + 3]; pc+=Bx */ -OP_TFORCALL,/* A C R[A+4], ... ,R[A+3+C] := R[A](R[A+1], R[A+2]); */ -OP_TFORLOOP,/* A Bx if R[A+2] ~= nil then { R[A]=R[A+2]; pc -= Bx } */ - -OP_SETLIST,/* A B C k R[A][C+i] := R[A+i], 1 <= i <= B */ - -OP_CLOSURE,/* A Bx R[A] := closure(KPROTO[Bx]) */ - -OP_VARARG,/* A C R[A], R[A+1], ..., R[A+C-2] = vararg */ - -OP_VARARGPREP,/*A (adjust vararg parameters) */ - -OP_EXTRAARG/* Ax extra (larger) argument for previous opcode */ -} OpCode; - - -#define NUM_OPCODES ((int)(OP_EXTRAARG) + 1) - - - -/*=========================================================================== - Notes: - - (*) Opcode OP_LFALSESKIP is used to convert a condition to a boolean - value, in a code equivalent to (not cond ? false : true). (It - produces false and skips the next instruction producing true.) - - (*) Opcodes OP_MMBIN and variants follow each arithmetic and - bitwise opcode. If the operation succeeds, it skips this next - opcode. Otherwise, this opcode calls the corresponding metamethod. - - (*) Opcode OP_TESTSET is used in short-circuit expressions that need - both to jump and to produce a value, such as (a = b or c). - - (*) In OP_CALL, if (B == 0) then B = top - A. If (C == 0), then - 'top' is set to last_result+1, so next open instruction (OP_CALL, - OP_RETURN*, OP_SETLIST) may use 'top'. - - (*) In OP_VARARG, if (C == 0) then use actual number of varargs and - set top (like in OP_CALL with C == 0). - - (*) In OP_RETURN, if (B == 0) then return up to 'top'. - - (*) In OP_LOADKX and OP_NEWTABLE, the next instruction is always - OP_EXTRAARG. - - (*) In OP_SETLIST, if (B == 0) then real B = 'top'; if k, then - real C = EXTRAARG _ C (the bits of EXTRAARG concatenated with the - bits of C). - - (*) In OP_NEWTABLE, B is log2 of the hash size (which is always a - power of 2) plus 1, or zero for size zero. If not k, the array size - is C. Otherwise, the array size is EXTRAARG _ C. - - (*) For comparisons, k specifies what condition the test should accept - (true or false). - - (*) In OP_MMBINI/OP_MMBINK, k means the arguments were flipped - (the constant is the first operand). - - (*) All 'skips' (pc++) assume that next instruction is a jump. - - (*) In instructions OP_RETURN/OP_TAILCALL, 'k' specifies that the - function builds upvalues, which may need to be closed. C > 0 means - the function is vararg, so that its 'func' must be corrected before - returning; in this case, (C - 1) is its number of fixed parameters. - - (*) In comparisons with an immediate operand, C signals whether the - original operand was a float. (It must be corrected in case of - metamethods.) - -===========================================================================*/ - - -/* -** masks for instruction properties. The format is: -** bits 0-2: op mode -** bit 3: instruction set register A -** bit 4: operator is a test (next instruction must be a jump) -** bit 5: instruction uses 'L->top' set by previous instruction (when B == 0) -** bit 6: instruction sets 'L->top' for next instruction (when C == 0) -** bit 7: instruction is an MM instruction (call a metamethod) -*/ - -LUAI_DDEC(const lu_byte luaP_opmodes[NUM_OPCODES];) - -#define getOpMode(m) (cast(enum OpMode, luaP_opmodes[m] & 7)) -#define testAMode(m) (luaP_opmodes[m] & (1 << 3)) -#define testTMode(m) (luaP_opmodes[m] & (1 << 4)) -#define testITMode(m) (luaP_opmodes[m] & (1 << 5)) -#define testOTMode(m) (luaP_opmodes[m] & (1 << 6)) -#define testMMMode(m) (luaP_opmodes[m] & (1 << 7)) - -/* "out top" (set top for next instruction) */ -#define isOT(i) \ - ((testOTMode(GET_OPCODE(i)) && GETARG_C(i) == 0) || \ - GET_OPCODE(i) == OP_TAILCALL) - -/* "in top" (uses top from previous instruction) */ -#define isIT(i) (testITMode(GET_OPCODE(i)) && GETARG_B(i) == 0) - -#define opmode(mm,ot,it,t,a,m) \ - (((mm) << 7) | ((ot) << 6) | ((it) << 5) | ((t) << 4) | ((a) << 3) | (m)) - - -/* number of list items to accumulate before a SETLIST instruction */ -#define LFIELDS_PER_FLUSH 50 - -#endif - - - -/* ORDER OP */ - -LUAI_DDEF const lu_byte luaP_opmodes[NUM_OPCODES] = { -/* MM OT IT T A mode opcode */ - opmode(0, 0, 0, 0, 1, iABC) /* OP_MOVE */ - ,opmode(0, 0, 0, 0, 1, iAsBx) /* OP_LOADI */ - ,opmode(0, 0, 0, 0, 1, iAsBx) /* OP_LOADF */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_LOADK */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_LOADKX */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LOADFALSE */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LFALSESKIP */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LOADTRUE */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LOADNIL */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETUPVAL */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETUPVAL */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETTABUP */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETTABLE */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETI */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETFIELD */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETTABUP */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETTABLE */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETI */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETFIELD */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_NEWTABLE */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SELF */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_ADDI */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_ADDK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SUBK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MULK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MODK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_POWK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_DIVK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_IDIVK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BANDK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BORK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BXORK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHRI */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHLI */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_ADD */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SUB */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MUL */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MOD */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_POW */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_DIV */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_IDIV */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BAND */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BOR */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BXOR */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHL */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHR */ - ,opmode(1, 0, 0, 0, 0, iABC) /* OP_MMBIN */ - ,opmode(1, 0, 0, 0, 0, iABC) /* OP_MMBINI*/ - ,opmode(1, 0, 0, 0, 0, iABC) /* OP_MMBINK*/ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_UNM */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BNOT */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_NOT */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LEN */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_CONCAT */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_CLOSE */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_TBC */ - ,opmode(0, 0, 0, 0, 0, isJ) /* OP_JMP */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_EQ */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LT */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LE */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_EQK */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_EQI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LTI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LEI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_GTI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_GEI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_TEST */ - ,opmode(0, 0, 0, 1, 1, iABC) /* OP_TESTSET */ - ,opmode(0, 1, 1, 0, 1, iABC) /* OP_CALL */ - ,opmode(0, 1, 1, 0, 1, iABC) /* OP_TAILCALL */ - ,opmode(0, 0, 1, 0, 0, iABC) /* OP_RETURN */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_RETURN0 */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_RETURN1 */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_FORLOOP */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_FORPREP */ - ,opmode(0, 0, 0, 0, 0, iABx) /* OP_TFORPREP */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_TFORCALL */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_TFORLOOP */ - ,opmode(0, 0, 1, 0, 0, iABC) /* OP_SETLIST */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_CLOSURE */ - ,opmode(0, 1, 0, 0, 1, iABC) /* OP_VARARG */ - ,opmode(0, 0, 1, 0, 1, iABC) /* OP_VARARGPREP */ - ,opmode(0, 0, 0, 0, 0, iAx) /* OP_EXTRAARG */ -}; - - - -/* -** $Id: lmem.c $ -** Interface to Memory Manager -** See Copyright Notice in lua.h -*/ - -#define lmem_c -#define LUA_CORE - - - -#include - - - -/* -** $Id: ldebug.h $ -** Auxiliary functions from Debug Interface module -** See Copyright Notice in lua.h -*/ - -#ifndef ldebug_h -#define ldebug_h - - - - -#define pcRel(pc, p) (cast_int((pc) - (p)->code) - 1) - - -/* Active Lua function (given call info) */ -#define ci_func(ci) (clLvalue(s2v((ci)->func.p))) - - -#define resethookcount(L) (L->hookcount = L->basehookcount) - -/* -** mark for entries in 'lineinfo' array that has absolute information in -** 'abslineinfo' array -*/ -#define ABSLINEINFO (-0x80) - - -/* -** MAXimum number of successive Instructions WiTHout ABSolute line -** information. (A power of two allows fast divisions.) -*/ -#if !defined(MAXIWTHABS) -#define MAXIWTHABS 128 -#endif - - -LUAI_FUNC int luaG_getfuncline (const Proto *f, int pc); -LUAI_FUNC const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, - StkId *pos); -LUAI_FUNC l_noret luaG_typeerror (lua_State *L, const TValue *o, - const char *opname); -LUAI_FUNC l_noret luaG_callerror (lua_State *L, const TValue *o); -LUAI_FUNC l_noret luaG_forerror (lua_State *L, const TValue *o, - const char *what); -LUAI_FUNC l_noret luaG_concaterror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_opinterror (lua_State *L, const TValue *p1, - const TValue *p2, - const char *msg); -LUAI_FUNC l_noret luaG_tointerror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_ordererror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_runerror (lua_State *L, const char *fmt, ...); -LUAI_FUNC const char *luaG_addinfo (lua_State *L, const char *msg, - TString *src, int line); -LUAI_FUNC l_noret luaG_errormsg (lua_State *L); -LUAI_FUNC int luaG_traceexec (lua_State *L, const Instruction *pc); -LUAI_FUNC int luaG_tracecall (lua_State *L); - - -#endif - - -/* -** $Id: ldo.h $ -** Stack and Call structure of Lua -** See Copyright Notice in lua.h -*/ - -#ifndef ldo_h -#define ldo_h - - - - -/* -** Macro to check stack size and grow stack if needed. Parameters -** 'pre'/'pos' allow the macro to preserve a pointer into the -** stack across reallocations, doing the work only when needed. -** It also allows the running of one GC step when the stack is -** reallocated. -** 'condmovestack' is used in heavy tests to force a stack reallocation -** at every check. -*/ -#define luaD_checkstackaux(L,n,pre,pos) \ - if (l_unlikely(L->stack_last.p - L->top.p <= (n))) \ - { pre; luaD_growstack(L, n, 1); pos; } \ - else { condmovestack(L,pre,pos); } - -/* In general, 'pre'/'pos' are empty (nothing to save) */ -#define luaD_checkstack(L,n) luaD_checkstackaux(L,n,(void)0,(void)0) - - - -#define savestack(L,pt) (cast_charp(pt) - cast_charp(L->stack.p)) -#define restorestack(L,n) cast(StkId, cast_charp(L->stack.p) + (n)) - - -/* macro to check stack size, preserving 'p' */ -#define checkstackp(L,n,p) \ - luaD_checkstackaux(L, n, \ - ptrdiff_t t__ = savestack(L, p), /* save 'p' */ \ - p = restorestack(L, t__)) /* 'pos' part: restore 'p' */ - - - -/* type of protected functions, to be ran by 'runprotected' */ -typedef void (*Pfunc) (lua_State *L, void *ud); - -LUAI_FUNC void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop); -LUAI_FUNC int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, - const char *mode); -LUAI_FUNC void luaD_hook (lua_State *L, int event, int line, - int fTransfer, int nTransfer); -LUAI_FUNC void luaD_hookcall (lua_State *L, CallInfo *ci); -LUAI_FUNC int luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, - int narg1, int delta); -LUAI_FUNC CallInfo *luaD_precall (lua_State *L, StkId func, int nResults); -LUAI_FUNC void luaD_call (lua_State *L, StkId func, int nResults); -LUAI_FUNC void luaD_callnoyield (lua_State *L, StkId func, int nResults); -LUAI_FUNC int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status); -LUAI_FUNC int luaD_pcall (lua_State *L, Pfunc func, void *u, - ptrdiff_t oldtop, ptrdiff_t ef); -LUAI_FUNC void luaD_poscall (lua_State *L, CallInfo *ci, int nres); -LUAI_FUNC int luaD_reallocstack (lua_State *L, int newsize, int raiseerror); -LUAI_FUNC int luaD_growstack (lua_State *L, int n, int raiseerror); -LUAI_FUNC void luaD_shrinkstack (lua_State *L); -LUAI_FUNC void luaD_inctop (lua_State *L); - -LUAI_FUNC l_noret luaD_throw (lua_State *L, int errcode); -LUAI_FUNC int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud); - -#endif - - - -/* -** $Id: lgc.h $ -** Garbage Collector -** See Copyright Notice in lua.h -*/ - -#ifndef lgc_h -#define lgc_h - - -#include - - - -/* -** Collectable objects may have one of three colors: white, which means -** the object is not marked; gray, which means the object is marked, but -** its references may be not marked; and black, which means that the -** object and all its references are marked. The main invariant of the -** garbage collector, while marking objects, is that a black object can -** never point to a white one. Moreover, any gray object must be in a -** "gray list" (gray, grayagain, weak, allweak, ephemeron) so that it -** can be visited again before finishing the collection cycle. (Open -** upvalues are an exception to this rule.) These lists have no meaning -** when the invariant is not being enforced (e.g., sweep phase). -*/ - - -/* -** Possible states of the Garbage Collector -*/ -#define GCSpropagate 0 -#define GCSenteratomic 1 -#define GCSatomic 2 -#define GCSswpallgc 3 -#define GCSswpfinobj 4 -#define GCSswptobefnz 5 -#define GCSswpend 6 -#define GCScallfin 7 -#define GCSpause 8 - - -#define issweepphase(g) \ - (GCSswpallgc <= (g)->gcstate && (g)->gcstate <= GCSswpend) - - -/* -** macro to tell when main invariant (white objects cannot point to black -** ones) must be kept. During a collection, the sweep -** phase may break the invariant, as objects turned white may point to -** still-black objects. The invariant is restored when sweep ends and -** all objects are white again. -*/ - -#define keepinvariant(g) ((g)->gcstate <= GCSatomic) - - -/* -** some useful bit tricks -*/ -#define resetbits(x,m) ((x) &= cast_byte(~(m))) -#define setbits(x,m) ((x) |= (m)) -#define testbits(x,m) ((x) & (m)) -#define bitmask(b) (1<<(b)) -#define bit2mask(b1,b2) (bitmask(b1) | bitmask(b2)) -#define l_setbit(x,b) setbits(x, bitmask(b)) -#define resetbit(x,b) resetbits(x, bitmask(b)) -#define testbit(x,b) testbits(x, bitmask(b)) - - -/* -** Layout for bit use in 'marked' field. First three bits are -** used for object "age" in generational mode. Last bit is used -** by tests. -*/ -#define WHITE0BIT 3 /* object is white (type 0) */ -#define WHITE1BIT 4 /* object is white (type 1) */ -#define BLACKBIT 5 /* object is black */ -#define FINALIZEDBIT 6 /* object has been marked for finalization */ - -#define TESTBIT 7 - - - -#define WHITEBITS bit2mask(WHITE0BIT, WHITE1BIT) - - -#define iswhite(x) testbits((x)->marked, WHITEBITS) -#define isblack(x) testbit((x)->marked, BLACKBIT) -#define isgray(x) /* neither white nor black */ \ - (!testbits((x)->marked, WHITEBITS | bitmask(BLACKBIT))) - -#define tofinalize(x) testbit((x)->marked, FINALIZEDBIT) - -#define otherwhite(g) ((g)->currentwhite ^ WHITEBITS) -#define isdeadm(ow,m) ((m) & (ow)) -#define isdead(g,v) isdeadm(otherwhite(g), (v)->marked) - -#define changewhite(x) ((x)->marked ^= WHITEBITS) -#define nw2black(x) \ - check_exp(!iswhite(x), l_setbit((x)->marked, BLACKBIT)) - -#define luaC_white(g) cast_byte((g)->currentwhite & WHITEBITS) - - -/* object age in generational mode */ -#define G_NEW 0 /* created in current cycle */ -#define G_SURVIVAL 1 /* created in previous cycle */ -#define G_OLD0 2 /* marked old by frw. barrier in this cycle */ -#define G_OLD1 3 /* first full cycle as old */ -#define G_OLD 4 /* really old object (not to be visited) */ -#define G_TOUCHED1 5 /* old object touched this cycle */ -#define G_TOUCHED2 6 /* old object touched in previous cycle */ - -#define AGEBITS 7 /* all age bits (111) */ - -#define getage(o) ((o)->marked & AGEBITS) -#define setage(o,a) ((o)->marked = cast_byte(((o)->marked & (~AGEBITS)) | a)) -#define isold(o) (getage(o) > G_SURVIVAL) - - -/* -** In generational mode, objects are created 'new'. After surviving one -** cycle, they become 'survival'. Both 'new' and 'survival' can point -** to any other object, as they are traversed at the end of the cycle. -** We call them both 'young' objects. -** If a survival object survives another cycle, it becomes 'old1'. -** 'old1' objects can still point to survival objects (but not to -** new objects), so they still must be traversed. After another cycle -** (that, being old, 'old1' objects will "survive" no matter what) -** finally the 'old1' object becomes really 'old', and then they -** are no more traversed. -** -** To keep its invariants, the generational mode uses the same barriers -** also used by the incremental mode. If a young object is caught in a -** foward barrier, it cannot become old immediately, because it can -** still point to other young objects. Instead, it becomes 'old0', -** which in the next cycle becomes 'old1'. So, 'old0' objects is -** old but can point to new and survival objects; 'old1' is old -** but cannot point to new objects; and 'old' cannot point to any -** young object. -** -** If any old object ('old0', 'old1', 'old') is caught in a back -** barrier, it becomes 'touched1' and goes into a gray list, to be -** visited at the end of the cycle. There it evolves to 'touched2', -** which can point to survivals but not to new objects. In yet another -** cycle then it becomes 'old' again. -** -** The generational mode must also control the colors of objects, -** because of the barriers. While the mutator is running, young objects -** are kept white. 'old', 'old1', and 'touched2' objects are kept black, -** as they cannot point to new objects; exceptions are threads and open -** upvalues, which age to 'old1' and 'old' but are kept gray. 'old0' -** objects may be gray or black, as in the incremental mode. 'touched1' -** objects are kept gray, as they must be visited again at the end of -** the cycle. -*/ - - -/* Default Values for GC parameters */ - -/* -** Minor collections will shift to major ones after LUAI_MINORMAJOR% -** objects become old. -*/ -#define LUAI_MINORMAJOR 100 - -/* -** Major collections will shift to minor ones after a collection -** collects at least LUAI_MAJORMINOR% of the new objects. -*/ -#define LUAI_MAJORMINOR 50 - -/* -** A young (minor) collection will run after creating LUAI_GENMINORMUL% -** new objects. -*/ -#define LUAI_GENMINORMUL 25 - - -/* incremental */ - -/* Number of objects must be LUAI_GCPAUSE% before starting new cycle */ -#define LUAI_GCPAUSE 200 - -/* Step multiplier. (Roughly, the collector handles LUAI_GCMUL% objects - for each new allocated object.) */ -#define LUAI_GCMUL 200 - -/* How many objects to allocate before next GC step */ -#define LUAI_GCSTEPSIZE 250 - - -#define setgcparam(g,p,v) (g->gcparams[LUA_GCP##p] = luaO_codeparam(v)) -#define applygcparam(g,p,x) luaO_applyparam(g->gcparams[LUA_GCP##p], x) - -/* -** Control when GC is running: -*/ -#define GCSTPUSR 1 /* bit true when GC stopped by user */ -#define GCSTPGC 2 /* bit true when GC stopped by itself */ -#define GCSTPCLS 4 /* bit true when closing Lua state */ -#define gcrunning(g) ((g)->gcstp == 0) - - -/* -** Does one step of collection when debt becomes zero. 'pre'/'pos' -** allows some adjustments to be done only when needed. macro -** 'condchangemem' is used only for heavy tests (forcing a full -** GC cycle on every opportunity) -*/ -#define luaC_condGC(L,pre,pos) \ - { if (G(L)->GCdebt <= 0) { pre; luaC_step(L); pos;}; \ - condchangemem(L,pre,pos); } - -/* more often than not, 'pre'/'pos' are empty */ -#define luaC_checkGC(L) luaC_condGC(L,(void)0,(void)0) - - -#define luaC_objbarrier(L,p,o) ( \ - (isblack(p) && iswhite(o)) ? \ - luaC_barrier_(L,obj2gco(p),obj2gco(o)) : cast_void(0)) - -#define luaC_barrier(L,p,v) ( \ - iscollectable(v) ? luaC_objbarrier(L,p,gcvalue(v)) : cast_void(0)) - -#define luaC_objbarrierback(L,p,o) ( \ - (isblack(p) && iswhite(o)) ? luaC_barrierback_(L,p) : cast_void(0)) - -#define luaC_barrierback(L,p,v) ( \ - iscollectable(v) ? luaC_objbarrierback(L, p, gcvalue(v)) : cast_void(0)) - -LUAI_FUNC void luaC_fix (lua_State *L, GCObject *o); -LUAI_FUNC void luaC_freeallobjects (lua_State *L); -LUAI_FUNC void luaC_step (lua_State *L); -LUAI_FUNC void luaC_runtilstate (lua_State *L, int state, int fast); -LUAI_FUNC void luaC_fullgc (lua_State *L, int isemergency); -LUAI_FUNC GCObject *luaC_newobj (lua_State *L, int tt, size_t sz); -LUAI_FUNC GCObject *luaC_newobjdt (lua_State *L, int tt, size_t sz, - size_t offset); -LUAI_FUNC void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v); -LUAI_FUNC void luaC_barrierback_ (lua_State *L, GCObject *o); -LUAI_FUNC void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt); -LUAI_FUNC void luaC_changemode (lua_State *L, int newmode); - - -#endif - - - - -/* -** About the realloc function: -** void *frealloc (void *ud, void *ptr, size_t osize, size_t nsize); -** ('osize' is the old size, 'nsize' is the new size) -** -** - frealloc(ud, p, x, 0) frees the block 'p' and returns NULL. -** Particularly, frealloc(ud, NULL, 0, 0) does nothing, -** which is equivalent to free(NULL) in ISO C. -** -** - frealloc(ud, NULL, x, s) creates a new block of size 's' -** (no matter 'x'). Returns NULL if it cannot create the new block. -** -** - otherwise, frealloc(ud, b, x, y) reallocates the block 'b' from -** size 'x' to size 'y'. Returns NULL if it cannot reallocate the -** block to the new size. -*/ - - -/* -** Macro to call the allocation function. -*/ -#define callfrealloc(g,block,os,ns) ((*g->frealloc)(g->ud, block, os, ns)) - - -/* -** When an allocation fails, it will try again after an emergency -** collection, except when it cannot run a collection. The GC should -** not be called while the state is not fully built, as the collector -** is not yet fully initialized. Also, it should not be called when -** 'gcstopem' is true, because then the interpreter is in the middle of -** a collection step. -*/ -#define cantryagain(g) (completestate(g) && !g->gcstopem) - - - - -#if defined(EMERGENCYGCTESTS) -/* -** First allocation will fail except when freeing a block (frees never -** fail) and when it cannot try again; this fail will trigger 'tryagain' -** and a full GC cycle at every allocation. -*/ -static void *firsttry (global_State *g, void *block, size_t os, size_t ns) { - if (ns > 0 && cantryagain(g)) - return NULL; /* fail */ - else /* normal allocation */ - return callfrealloc(g, block, os, ns); -} -#else -#define firsttry(g,block,os,ns) callfrealloc(g, block, os, ns) -#endif - - - - - -/* -** {================================================================== -** Functions to allocate/deallocate arrays for the Parser -** =================================================================== -*/ - -/* -** Minimum size for arrays during parsing, to avoid overhead of -** reallocating to size 1, then 2, and then 4. All these arrays -** will be reallocated to exact sizes or erased when parsing ends. -*/ -#define MINSIZEARRAY 4 - - -void *luaM_growaux_ (lua_State *L, void *block, int nelems, int *psize, - int size_elems, int limit, const char *what) { - void *newblock; - int size = *psize; - if (nelems + 1 <= size) /* does one extra element still fit? */ - return block; /* nothing to be done */ - if (size >= limit / 2) { /* cannot double it? */ - if (l_unlikely(size >= limit)) /* cannot grow even a little? */ - luaG_runerror(L, "too many %s (limit is %d)", what, limit); - size = limit; /* still have at least one free place */ - } - else { - size *= 2; - if (size < MINSIZEARRAY) - size = MINSIZEARRAY; /* minimum size */ - } - lua_assert(nelems + 1 <= size && size <= limit); - /* 'limit' ensures that multiplication will not overflow */ - newblock = luaM_saferealloc_(L, block, cast_sizet(*psize) * size_elems, - cast_sizet(size) * size_elems); - *psize = size; /* update only when everything else is OK */ - return newblock; -} - - -/* -** In prototypes, the size of the array is also its number of -** elements (to save memory). So, if it cannot shrink an array -** to its number of elements, the only option is to raise an -** error. -*/ -void *luaM_shrinkvector_ (lua_State *L, void *block, int *size, - int final_n, int size_elem) { - void *newblock; - size_t oldsize = cast_sizet((*size) * size_elem); - size_t newsize = cast_sizet(final_n * size_elem); - lua_assert(newsize <= oldsize); - newblock = luaM_saferealloc_(L, block, oldsize, newsize); - *size = final_n; - return newblock; -} - -/* }================================================================== */ - - -l_noret luaM_toobig (lua_State *L) { - luaG_runerror(L, "memory allocation private_lua_error: block too big"); -} - - -/* -** Free memory -*/ -void luaM_free_ (lua_State *L, void *block, size_t osize) { - global_State *g = G(L); - lua_assert((osize == 0) == (block == NULL)); - callfrealloc(g, block, osize, 0); - g->totalbytes -= osize; -} - - -/* -** In case of allocation fail, this function will do an emergency -** collection to free some memory and then try the allocation again. -*/ -static void *tryagain (lua_State *L, void *block, - size_t osize, size_t nsize) { - global_State *g = G(L); - if (cantryagain(g)) { - luaC_fullgc(L, 1); /* try to free some memory... */ - return callfrealloc(g, block, osize, nsize); /* try again */ - } - else return NULL; /* cannot run an emergency collection */ -} - - -/* -** Generic allocation routine. -*/ -void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) { - void *newblock; - global_State *g = G(L); - lua_assert((osize == 0) == (block == NULL)); - newblock = firsttry(g, block, osize, nsize); - if (l_unlikely(newblock == NULL && nsize > 0)) { - newblock = tryagain(L, block, osize, nsize); - if (newblock == NULL) /* still no memory? */ - return NULL; /* do not update 'totalbytes' */ - } - lua_assert((nsize == 0) == (newblock == NULL)); - g->totalbytes += nsize - osize; - return newblock; -} - - -void *luaM_saferealloc_ (lua_State *L, void *block, size_t osize, - size_t nsize) { - void *newblock = luaM_realloc_(L, block, osize, nsize); - if (l_unlikely(newblock == NULL && nsize > 0)) /* allocation failed? */ - luaM_error(L); - return newblock; -} - - -void *luaM_malloc_ (lua_State *L, size_t size, int tag) { - if (size == 0) - return NULL; /* that's all */ - else { - global_State *g = G(L); - void *newblock = firsttry(g, NULL, tag, size); - if (l_unlikely(newblock == NULL)) { - newblock = tryagain(L, NULL, tag, size); - if (newblock == NULL) - luaM_error(L); - } - g->totalbytes += size; - return newblock; - } -} - - -/* -** $Id: lundump.c $ -** load precompiled Lua chunks -** See Copyright Notice in lua.h -*/ - -#define lundump_c -#define LUA_CORE - - - -#include -#include - - - -/* -** $Id: lfunc.h $ -** Auxiliary functions to manipulate prototypes and closures -** See Copyright Notice in lua.h -*/ - -#ifndef lfunc_h -#define lfunc_h - - - - -#define sizeCclosure(n) (cast_int(offsetof(CClosure, upvalue)) + \ - cast_int(sizeof(TValue)) * (n)) - -#define sizeLclosure(n) (cast_int(offsetof(LClosure, upvals)) + \ - cast_int(sizeof(TValue *)) * (n)) - - -/* test whether thread is in 'twups' list */ -#define isintwups(L) (L->twups != L) - - -/* -** maximum number of upvalues in a closure (both C and Lua). (Value -** must fit in a VM register.) -*/ -#define MAXUPVAL 255 - - -#define upisopen(up) ((up)->v.p != &(up)->u.value) - - -#define uplevel(up) check_exp(upisopen(up), cast(StkId, (up)->v.p)) - - -/* -** maximum number of misses before giving up the cache of closures -** in prototypes -*/ -#define MAXMISS 10 - - - -/* special status to close upvalues preserving the top of the stack */ -#define CLOSEKTOP (-1) - - -LUAI_FUNC Proto *luaF_newproto (lua_State *L); -LUAI_FUNC CClosure *luaF_newCclosure (lua_State *L, int nupvals); -LUAI_FUNC LClosure *luaF_newLclosure (lua_State *L, int nupvals); -LUAI_FUNC void luaF_initupvals (lua_State *L, LClosure *cl); -LUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_newtbcupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_closeupval (lua_State *L, StkId level); -LUAI_FUNC StkId luaF_close (lua_State *L, StkId level, int status, int yy); -LUAI_FUNC void luaF_unlinkupval (UpVal *uv); -LUAI_FUNC void luaF_freeproto (lua_State *L, Proto *f); -LUAI_FUNC const char *luaF_getlocalname (const Proto *func, int local_number, - int pc); - - -#endif - - -/* -** $Id: lstring.h $ -** String table (keep all strings handled by Lua) -** See Copyright Notice in lua.h -*/ - -#ifndef lstring_h -#define lstring_h - - - -/* -** Memory-allocation error message must be preallocated (it cannot -** be created after memory is exhausted) -*/ -#define MEMERRMSG "not enough memory" - - -/* -** Size of a short TString: Size of the header plus space for the string -** itself (including final '\0'). -*/ -#define sizestrshr(l) \ - (offsetof(TString, contents) + ((l) + 1) * sizeof(char)) - - -#define luaS_newliteral(L, s) (luaS_newlstr(L, "" s, \ - (sizeof(s)/sizeof(char))-1)) - - -/* -** test whether a string is a reserved word -*/ -#define isreserved(s) ((s)->tt == LUA_VSHRSTR && (s)->extra > 0) - - -/* -** equality for short strings, which are always internalized -*/ -#define eqshrstr(a,b) check_exp((a)->tt == LUA_VSHRSTR, (a) == (b)) - - -LUAI_FUNC unsigned luaS_hash (const char *str, size_t l, unsigned seed); -LUAI_FUNC unsigned luaS_hashlongstr (TString *ts); -LUAI_FUNC int luaS_eqlngstr (TString *a, TString *b); -LUAI_FUNC void luaS_resize (lua_State *L, int newsize); -LUAI_FUNC void luaS_clearcache (global_State *g); -LUAI_FUNC void luaS_init (lua_State *L); -LUAI_FUNC void luaS_remove (lua_State *L, TString *ts); -LUAI_FUNC Udata *luaS_newudata (lua_State *L, size_t s, int nuvalue); -LUAI_FUNC TString *luaS_newlstr (lua_State *L, const char *str, size_t l); -LUAI_FUNC TString *luaS_new (lua_State *L, const char *str); -LUAI_FUNC TString *luaS_createlngstrobj (lua_State *L, size_t l); -LUAI_FUNC TString *luaS_newextlstr (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud); -LUAI_FUNC size_t luaS_sizelngstr (size_t len, int kind); - -#endif - - -/* -** $Id: ltable.h $ -** Lua tables (hash) -** See Copyright Notice in lua.h -*/ - -#ifndef ltable_h -#define ltable_h - - - -#define gnode(t,i) (&(t)->node[i]) -#define gval(n) (&(n)->i_val) -#define gnext(n) ((n)->u.next) - - -/* -** Clear all bits of fast-access metamethods, which means that the table -** may have any of these metamethods. (First access that fails after the -** clearing will set the bit again.) -*/ -#define invalidateTMcache(t) ((t)->flags &= ~maskflags) - - -/* -** Bit BITDUMMY set in 'flags' means the table is using the dummy node -** for its hash part. -*/ - -#define BITDUMMY (1 << 6) -#define NOTBITDUMMY cast_byte(~BITDUMMY) -#define isdummy(t) ((t)->flags & BITDUMMY) - -#define setnodummy(t) ((t)->flags &= NOTBITDUMMY) -#define setdummy(t) ((t)->flags |= BITDUMMY) - - - -/* allocated size for hash nodes */ -#define allocsizenode(t) (isdummy(t) ? 0 : sizenode(t)) - - -/* returns the Node, given the value of a table entry */ -#define nodefromval(v) cast(Node *, (v)) - - - -#define luaH_fastgeti(t,k,res,tag) \ - { Table *h = t; lua_Unsigned u = l_castS2U(k); \ - if ((u - 1u < h->alimit)) { \ - tag = *getArrTag(h,(u)-1u); \ - if (!tagisempty(tag)) { farr2val(h, u, tag, res); }} \ - else { tag = luaH_getint(h, u, res); }} - - -#define luaH_fastseti(t,k,val,hres) \ - { Table *h = t; lua_Unsigned u = l_castS2U(k); \ - if ((u - 1u < h->alimit)) { \ - lu_byte *tag = getArrTag(h,(u)-1u); \ - if (tagisempty(*tag)) hres = ~cast_int(u); \ - else { fval2arr(h, u, tag, val); hres = HOK; }} \ - else { hres = luaH_psetint(h, u, val); }} - - -/* results from pset */ -#define HOK 0 -#define HNOTFOUND 1 -#define HNOTATABLE 2 -#define HFIRSTNODE 3 - -/* -** 'luaH_get*' operations set 'res', unless the value is absent, and -** return the tag of the result, -** The 'luaH_pset*' (pre-set) operations set the given value and return -** HOK, unless the original value is absent. In that case, if the key -** is really absent, they return HNOTFOUND. Otherwise, if there is a -** slot with that key but with no value, 'luaH_pset*' return an encoding -** of where the key is (usually called 'hres'). (pset cannot set that -** value because there might be a metamethod.) If the slot is in the -** hash part, the encoding is (HFIRSTNODE + hash index); if the slot is -** in the array part, the encoding is (~array index), a negative value. -** The value HNOTATABLE is used by the fast macros to signal that the -** value being indexed is not a table. -*/ - - -/* -** The array part of a table is represented by an array of cells. -** Each cell is composed of NM tags followed by NM values, so that -** no space is wasted in padding. The last cell may be incomplete, -** that is, it may have fewer than NM values. -*/ -#define NM cast_uint(sizeof(Value)) - -struct ArrayCell { - lu_byte tag[NM]; - Value value[NM]; -}; - - -/* Computes the address of the tag for the abstract index 'k' */ -#define getArrTag(t,k) (&(t)->array[(k)/NM].tag[(k)%NM]) - -/* Computes the address of the value for the abstract index 'k' */ -#define getArrVal(t,k) (&(t)->array[(k)/NM].value[(k)%NM]) - - -/* -** Move TValues to/from arrays, using Lua indices -*/ -#define arr2obj(h,k,val) \ - ((val)->tt_ = *getArrTag(h,(k)-1u), (val)->value_ = *getArrVal(h,(k)-1u)) - -#define obj2arr(h,k,val) \ - (*getArrTag(h,(k)-1u) = (val)->tt_, *getArrVal(h,(k)-1u) = (val)->value_) - - -/* -** Often, we need to check the tag of a value before moving it. These -** macros also move TValues to/from arrays, but receive the precomputed -** tag value or address as an extra argument. -*/ -#define farr2val(h,k,tag,res) \ - ((res)->tt_ = tag, (res)->value_ = *getArrVal(h,(k)-1u)) - -#define fval2arr(h,k,tag,val) \ - (*tag = (val)->tt_, *getArrVal(h,(k)-1u) = (val)->value_) - - -LUAI_FUNC int luaH_get (Table *t, const TValue *key, TValue *res); -LUAI_FUNC int luaH_getshortstr (Table *t, TString *key, TValue *res); -LUAI_FUNC int luaH_getstr (Table *t, TString *key, TValue *res); -LUAI_FUNC int luaH_getint (Table *t, lua_Integer key, TValue *res); - -/* Special get for metamethods */ -LUAI_FUNC const TValue *luaH_Hgetshortstr (Table *t, TString *key); - -LUAI_FUNC TString *luaH_getstrkey (Table *t, TString *key); - -LUAI_FUNC int luaH_psetint (Table *t, lua_Integer key, TValue *val); -LUAI_FUNC int luaH_psetshortstr (Table *t, TString *key, TValue *val); -LUAI_FUNC int luaH_psetstr (Table *t, TString *key, TValue *val); -LUAI_FUNC int luaH_pset (Table *t, const TValue *key, TValue *val); - -LUAI_FUNC void luaH_setint (lua_State *L, Table *t, lua_Integer key, - TValue *value); -LUAI_FUNC void luaH_set (lua_State *L, Table *t, const TValue *key, - TValue *value); - -LUAI_FUNC void luaH_finishset (lua_State *L, Table *t, const TValue *key, - TValue *value, int hres); -LUAI_FUNC Table *luaH_new (lua_State *L); -LUAI_FUNC void luaH_resize (lua_State *L, Table *t, unsigned nasize, - unsigned nhsize); -LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, unsigned nasize); -LUAI_FUNC void luaH_free (lua_State *L, Table *t); -LUAI_FUNC int luaH_next (lua_State *L, Table *t, StkId key); -LUAI_FUNC lua_Unsigned luaH_getn (Table *t); -LUAI_FUNC unsigned luaH_realasize (const Table *t); - - -#if defined(LUA_DEBUG) -LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key); -#endif - - -#endif - - -/* -** $Id: lundump.h $ -** load precompiled Lua chunks -** See Copyright Notice in lua.h -*/ - -#ifndef lundump_h -#define lundump_h - -#include - - - -/* data to catch conversion errors */ -#define LUAC_DATA "\x19\x93\r\n\x1a\n" - -#define LUAC_INT 0x5678 -#define LUAC_NUM cast_num(370.5) - -/* -** Encode major-minor version in one byte, one nibble for each -*/ -#define LUAC_VERSION (LUA_VERSION_MAJOR_N*16+LUA_VERSION_MINOR_N) - -#define LUAC_FORMAT 0 /* this is the official format */ - - -/* load one chunk; from lundump.c */ -LUAI_FUNC LClosure* luaU_undump (lua_State* L, ZIO* Z, const char* name, - int fixed); - -/* dump one chunk; from ldump.c */ -LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, - void* data, int strip); - -#endif - - - -#if !defined(luai_verifycode) -#define luai_verifycode(L,f) /* empty */ -#endif - - -typedef struct { - lua_State *L; - ZIO *Z; - const char *name; - Table *h; /* list for string reuse */ - lu_mem offset; /* current position relative to beginning of dump */ - lua_Integer nstr; /* number of strings in the list */ - lu_byte fixed; /* dump is fixed in memory */ -} LoadState; - - -static l_noret private_lua_error (LoadState *S, const char *why) { - luaO_pushfstring(S->L, "%s: bad binary format (%s)", S->name, why); - luaD_throw(S->L, LUA_ERRSYNTAX); -} - - -/* -** All high-level loads go through loadVector; you can change it to -** adapt to the endianness of the input -*/ -#define loadVector(S,b,n) loadBlock(S,b,(n)*sizeof((b)[0])) - -static void loadBlock (LoadState *S, void *b, size_t size) { - if (luaZ_read(S->Z, b, size) != 0) - private_lua_error(S, "truncated chunk"); - S->offset += size; -} - - -static void loadAlign (LoadState *S, int align) { - int padding = align - (S->offset % align); - if (padding < align) { /* apd == align means no padding */ - lua_Integer paddingContent; - loadBlock(S, &paddingContent, padding); - lua_assert(S->offset % align == 0); - } -} - - -#define getaddr(S,n,t) cast(t *, getaddr_(S,(n) * sizeof(t))) - -static const void *getaddr_ (LoadState *S, size_t size) { - const void *block = luaZ_getaddr(S->Z, size); - S->offset += size; - if (block == NULL) - private_lua_error(S, "truncated fixed buffer"); - return block; -} - - -#define loadVar(S,x) loadVector(S,&x,1) - - -static lu_byte loadByte (LoadState *S) { - int b = zgetc(S->Z); - if (b == EOZ) - private_lua_error(S, "truncated chunk"); - S->offset++; - return cast_byte(b); -} - - -static size_t loadVarint (LoadState *S, size_t limit) { - size_t x = 0; - int b; - limit >>= 7; - do { - b = loadByte(S); - if (x > limit) - private_lua_error(S, "integer overflow"); - x = (x << 7) | (b & 0x7f); - } while ((b & 0x80) != 0); - return x; -} - - -static size_t loadSize (LoadState *S) { - return loadVarint(S, MAX_SIZET); -} - - -static int loadInt (LoadState *S) { - return cast_int(loadVarint(S, cast_sizet(INT_MAX))); -} - - -static lua_Number loadNumber (LoadState *S) { - lua_Number x; - loadVar(S, x); - return x; -} - - -static lua_Integer loadInteger (LoadState *S) { - lua_Integer x; - loadVar(S, x); - return x; -} - - -/* -** Load a nullable string into slot 'sl' from prototype 'p'. The -** assignment to the slot and the barrier must be performed before any -** possible GC activity, to anchor the string. (Both 'loadVector' and -** 'luaH_setint' can call the GC.) -*/ -static void loadString (LoadState *S, Proto *p, TString **sl) { - lua_State *L = S->L; - TString *ts; - TValue sv; - size_t size = loadSize(S); - if (size == 0) { /* no string? */ - lua_assert(*sl == NULL); /* must be prefilled */ - return; - } - else if (size == 1) { /* previously saved string? */ - lua_Integer idx = cast(lua_Integer, loadSize(S)); /* get its index */ - TValue stv; - luaH_getint(S->h, idx, &stv); /* get its value */ - *sl = ts = tsvalue(&stv); - luaC_objbarrier(L, p, ts); - return; /* do not save it again */ - } - else if ((size -= 2) <= LUAI_MAXSHORTLEN) { /* short string? */ - char buff[LUAI_MAXSHORTLEN + 1]; /* extra space for '\0' */ - loadVector(S, buff, size + 1); /* load string into buffer */ - *sl = ts = luaS_newlstr(L, buff, size); /* create string */ - luaC_objbarrier(L, p, ts); - } - else if (S->fixed) { /* for a fixed buffer, use a fixed string */ - const char *s = getaddr(S, size + 1, char); /* get content address */ - *sl = ts = luaS_newextlstr(L, s, size, NULL, NULL); - luaC_objbarrier(L, p, ts); - } - else { /* create internal copy */ - *sl = ts = luaS_createlngstrobj(L, size); /* create string */ - luaC_objbarrier(L, p, ts); - loadVector(S, getlngstr(ts), size + 1); /* load directly in final place */ - } - /* add string to list of saved strings */ - S->nstr++; - setsvalue(L, &sv, ts); - luaH_setint(L, S->h, S->nstr, &sv); - luaC_objbarrierback(L, obj2gco(S->h), ts); -} - - -static void loadCode (LoadState *S, Proto *f) { - int n = loadInt(S); - loadAlign(S, sizeof(f->code[0])); - if (S->fixed) { - f->code = getaddr(S, n, Instruction); - f->sizecode = n; - } - else { - f->code = luaM_newvectorchecked(S->L, n, Instruction); - f->sizecode = n; - loadVector(S, f->code, n); - } -} - - -static void loadFunction(LoadState *S, Proto *f); - - -static void loadConstants (LoadState *S, Proto *f) { - int i; - int n = loadInt(S); - f->k = luaM_newvectorchecked(S->L, n, TValue); - f->sizek = n; - for (i = 0; i < n; i++) - setnilvalue(&f->k[i]); - for (i = 0; i < n; i++) { - TValue *o = &f->k[i]; - int t = loadByte(S); - switch (t) { - case LUA_VNIL: - setnilvalue(o); - break; - case LUA_VFALSE: - setbfvalue(o); - break; - case LUA_VTRUE: - setbtvalue(o); - break; - case LUA_VNUMFLT: - setfltvalue(o, loadNumber(S)); - break; - case LUA_VNUMINT: - setivalue(o, loadInteger(S)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - lua_assert(f->source == NULL); - loadString(S, f, &f->source); /* use 'source' to anchor string */ - if (f->source == NULL) - private_lua_error(S, "bad format for constant string"); - setsvalue2n(S->L, o, f->source); /* save it in the right place */ - f->source = NULL; - break; - } - default: lua_assert(0); - } - } -} - - -static void loadProtos (LoadState *S, Proto *f) { - int i; - int n = loadInt(S); - f->p = luaM_newvectorchecked(S->L, n, Proto *); - f->sizep = n; - for (i = 0; i < n; i++) - f->p[i] = NULL; - for (i = 0; i < n; i++) { - f->p[i] = luaF_newproto(S->L); - luaC_objbarrier(S->L, f, f->p[i]); - loadFunction(S, f->p[i]); - } -} - - -/* -** Load the upvalues for a function. The names must be filled first, -** because the filling of the other fields can raise read errors and -** the creation of the error message can call an emergency collection; -** in that case all prototypes must be consistent for the GC. -*/ -static void loadUpvalues (LoadState *S, Proto *f) { - int i, n; - n = loadInt(S); - f->upvalues = luaM_newvectorchecked(S->L, n, Upvaldesc); - f->sizeupvalues = n; - for (i = 0; i < n; i++) /* make array valid for GC */ - f->upvalues[i].name = NULL; - for (i = 0; i < n; i++) { /* following calls can raise errors */ - f->upvalues[i].instack = loadByte(S); - f->upvalues[i].idx = loadByte(S); - f->upvalues[i].kind = loadByte(S); - } -} - - -static void loadDebug (LoadState *S, Proto *f) { - int i, n; - n = loadInt(S); - if (S->fixed) { - f->lineinfo = getaddr(S, n, ls_byte); - f->sizelineinfo = n; - } - else { - f->lineinfo = luaM_newvectorchecked(S->L, n, ls_byte); - f->sizelineinfo = n; - loadVector(S, f->lineinfo, n); - } - n = loadInt(S); - if (n > 0) { - loadAlign(S, sizeof(int)); - if (S->fixed) { - f->abslineinfo = getaddr(S, n, AbsLineInfo); - f->sizeabslineinfo = n; - } - else { - f->abslineinfo = luaM_newvectorchecked(S->L, n, AbsLineInfo); - f->sizeabslineinfo = n; - loadVector(S, f->abslineinfo, n); - } - } - n = loadInt(S); - f->locvars = luaM_newvectorchecked(S->L, n, LocVar); - f->sizelocvars = n; - for (i = 0; i < n; i++) - f->locvars[i].varname = NULL; - for (i = 0; i < n; i++) { - loadString(S, f, &f->locvars[i].varname); - f->locvars[i].startpc = loadInt(S); - f->locvars[i].endpc = loadInt(S); - } - n = loadInt(S); - if (n != 0) /* does it have debug information? */ - n = f->sizeupvalues; /* must be this many */ - for (i = 0; i < n; i++) - loadString(S, f, &f->upvalues[i].name); -} - - -static void loadFunction (LoadState *S, Proto *f) { - f->linedefined = loadInt(S); - f->lastlinedefined = loadInt(S); - f->numparams = loadByte(S); - f->flag = loadByte(S) & PF_ISVARARG; /* get only the meaningful flags */ - if (S->fixed) - f->flag |= PF_FIXED; /* signal that code is fixed */ - f->maxstacksize = loadByte(S); - loadCode(S, f); - loadConstants(S, f); - loadUpvalues(S, f); - loadProtos(S, f); - loadString(S, f, &f->source); - loadDebug(S, f); -} - - -static void checkliteral (LoadState *S, const char *s, const char *msg) { - char buff[sizeof(LUA_SIGNATURE) + sizeof(LUAC_DATA)]; /* larger than both */ - size_t len = strlen(s); - loadVector(S, buff, len); - if (memcmp(s, buff, len) != 0) - private_lua_error(S, msg); -} - - -static void fchecksize (LoadState *S, size_t size, const char *tname) { - if (loadByte(S) != size) - private_lua_error(S, luaO_pushfstring(S->L, "%s size mismatch", tname)); -} - - -#define checksize(S,t) fchecksize(S,sizeof(t),#t) - -static void checkHeader (LoadState *S) { - /* skip 1st char (already read and checked) */ - checkliteral(S, &LUA_SIGNATURE[1], "not a binary chunk"); - if (loadByte(S) != LUAC_VERSION) - private_lua_error(S, "version mismatch"); - if (loadByte(S) != LUAC_FORMAT) - private_lua_error(S, "format mismatch"); - checkliteral(S, LUAC_DATA, "corrupted chunk"); - checksize(S, Instruction); - checksize(S, lua_Integer); - checksize(S, lua_Number); - if (loadInteger(S) != LUAC_INT) - private_lua_error(S, "integer format mismatch"); - if (loadNumber(S) != LUAC_NUM) - private_lua_error(S, "float format mismatch"); -} - - -/* -** Load precompiled chunk. -*/ -LClosure *luaU_undump (lua_State *L, ZIO *Z, const char *name, int fixed) { - LoadState S; - LClosure *cl; - if (*name == '@' || *name == '=') - S.name = name + 1; - else if (*name == LUA_SIGNATURE[0]) - S.name = "binary string"; - else - S.name = name; - S.L = L; - S.Z = Z; - S.fixed = fixed; - S.offset = 1; /* fist byte was already read */ - checkHeader(&S); - cl = luaF_newLclosure(L, loadByte(&S)); - setclLvalue2s(L, L->top.p, cl); - luaD_inctop(L); - S.h = luaH_new(L); /* create list of saved strings */ - S.nstr = 0; - sethvalue2s(L, L->top.p, S.h); /* anchor it */ - luaD_inctop(L); - cl->p = luaF_newproto(L); - luaC_objbarrier(L, cl, cl->p); - loadFunction(&S, cl->p); - lua_assert(cl->nupvalues == cl->p->sizeupvalues); - luai_verifycode(L, cl->p); - L->top.p--; /* pop table */ - return cl; -} - - - -/* -** $Id: ldump.c $ -** save precompiled Lua chunks -** See Copyright Notice in lua.h -*/ - -#define ldump_c -#define LUA_CORE - - - -#include -#include - - - - -typedef struct { - lua_State *L; - lua_Writer writer; - void *data; - lu_mem offset; /* current position relative to beginning of dump */ - int strip; - int status; - Table *h; /* table to track saved strings */ - lua_Integer nstr; /* counter for counting saved strings */ -} DumpState; - - -/* -** All high-level dumps go through dumpVector; you can change it to -** change the endianness of the result -*/ -#define dumpVector(D,v,n) dumpBlock(D,v,(n)*sizeof((v)[0])) - -#define dumpLiteral(D, s) dumpBlock(D,s,sizeof(s) - sizeof(char)) - - -/* -** Dump the block of memory pointed by 'b' with given 'size'. -** 'b' should not be NULL, except for the last call signaling the end -** of the dump. -*/ -static void dumpBlock (DumpState *D, const void *b, size_t size) { - if (D->status == 0) { /* do not write anything after an error */ - lua_unlock(D->L); - D->status = (*D->writer)(D->L, b, size, D->data); - lua_lock(D->L); - D->offset += size; - } -} - - -/* -** Dump enough zeros to ensure that current position is a multiple of -** 'align'. -*/ -static void dumpAlign (DumpState *D, int align) { - int padding = align - (D->offset % align); - if (padding < align) { /* padding == align means no padding */ - static lua_Integer paddingContent = 0; - lua_assert(cast_uint(align) <= sizeof(lua_Integer)); - dumpBlock(D, &paddingContent, padding); - } - lua_assert(D->offset % align == 0); -} - - -#define dumpVar(D,x) dumpVector(D,&x,1) - - -static void dumpByte (DumpState *D, int y) { - lu_byte x = (lu_byte)y; - dumpVar(D, x); -} - - -/* -** size for 'dumpVarint' buffer: each byte can store up to 7 bits. -** (The "+6" rounds up the division.) -*/ -#define DIBS ((sizeof(size_t) * CHAR_BIT + 6) / 7) - -/* -** Dumps an unsigned integer using the MSB Varint encoding -*/ -static void dumpVarint (DumpState *D, size_t x) { - lu_byte buff[DIBS]; - int n = 1; - buff[DIBS - 1] = x & 0x7f; /* fill least-significant byte */ - while ((x >>= 7) != 0) /* fill other bytes in reverse order */ - buff[DIBS - (++n)] = (x & 0x7f) | 0x80; - dumpVector(D, buff + DIBS - n, n); -} - - -static void dumpSize (DumpState *D, size_t sz) { - dumpVarint(D, sz); -} - -static void dumpInt (DumpState *D, int x) { - lua_assert(x >= 0); - dumpVarint(D, cast(size_t, x)); -} - - -static void dumpNumber (DumpState *D, lua_Number x) { - dumpVar(D, x); -} - - -static void dumpInteger (DumpState *D, lua_Integer x) { - dumpVar(D, x); -} - - -/* -** Dump a String. First dump its "size": size==0 means NULL; -** size==1 is followed by an index and means "reuse saved string with -** that index"; size>=2 is followed by the string contents with real -** size==size-2 and means that string, which will be saved with -** the next available index. -*/ -static void dumpString (DumpState *D, TString *ts) { - if (ts == NULL) - dumpSize(D, 0); - else { - TValue idx; - int tag = luaH_getstr(D->h, ts, &idx); - if (!tagisempty(tag)) { /* string already saved? */ - dumpSize(D, 1); /* reuse a saved string */ - dumpSize(D, cast_sizet(ivalue(&idx))); /* index of saved string */ - } - else { /* must write and save the string */ - TValue key, value; /* to save the string in the hash */ - size_t size; - const char *s = getlstr(ts, size); - dumpSize(D, size + 2); - dumpVector(D, s, size + 1); /* include ending '\0' */ - D->nstr++; /* one more saved string */ - setsvalue(D->L, &key, ts); /* the string is the key */ - setivalue(&value, D->nstr); /* its index is the value */ - luaH_set(D->L, D->h, &key, &value); /* h[ts] = nstr */ - /* integer value does not need barrier */ - } - } -} - - -static void dumpCode (DumpState *D, const Proto *f) { - dumpInt(D, f->sizecode); - dumpAlign(D, sizeof(f->code[0])); - lua_assert(f->code != NULL); - dumpVector(D, f->code, f->sizecode); -} - - -static void dumpFunction (DumpState *D, const Proto *f); - -static void dumpConstants (DumpState *D, const Proto *f) { - int i; - int n = f->sizek; - dumpInt(D, n); - for (i = 0; i < n; i++) { - const TValue *o = &f->k[i]; - int tt = ttypetag(o); - dumpByte(D, tt); - switch (tt) { - case LUA_VNUMFLT: - dumpNumber(D, fltvalue(o)); - break; - case LUA_VNUMINT: - dumpInteger(D, ivalue(o)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - dumpString(D, tsvalue(o)); - break; - default: - lua_assert(tt == LUA_VNIL || tt == LUA_VFALSE || tt == LUA_VTRUE); - } - } -} - - -static void dumpProtos (DumpState *D, const Proto *f) { - int i; - int n = f->sizep; - dumpInt(D, n); - for (i = 0; i < n; i++) - dumpFunction(D, f->p[i]); -} - - -static void dumpUpvalues (DumpState *D, const Proto *f) { - int i, n = f->sizeupvalues; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpByte(D, f->upvalues[i].instack); - dumpByte(D, f->upvalues[i].idx); - dumpByte(D, f->upvalues[i].kind); - } -} - - -static void dumpDebug (DumpState *D, const Proto *f) { - int i, n; - n = (D->strip) ? 0 : f->sizelineinfo; - dumpInt(D, n); - if (f->lineinfo != NULL) - dumpVector(D, f->lineinfo, n); - n = (D->strip) ? 0 : f->sizeabslineinfo; - dumpInt(D, n); - if (n > 0) { - /* 'abslineinfo' is an array of structures of int's */ - dumpAlign(D, sizeof(int)); - dumpVector(D, f->abslineinfo, n); - } - n = (D->strip) ? 0 : f->sizelocvars; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpString(D, f->locvars[i].varname); - dumpInt(D, f->locvars[i].startpc); - dumpInt(D, f->locvars[i].endpc); - } - n = (D->strip) ? 0 : f->sizeupvalues; - dumpInt(D, n); - for (i = 0; i < n; i++) - dumpString(D, f->upvalues[i].name); -} - - -static void dumpFunction (DumpState *D, const Proto *f) { - dumpInt(D, f->linedefined); - dumpInt(D, f->lastlinedefined); - dumpByte(D, f->numparams); - dumpByte(D, f->flag); - dumpByte(D, f->maxstacksize); - dumpCode(D, f); - dumpConstants(D, f); - dumpUpvalues(D, f); - dumpProtos(D, f); - dumpString(D, D->strip ? NULL : f->source); - dumpDebug(D, f); -} - - -static void dumpHeader (DumpState *D) { - dumpLiteral(D, LUA_SIGNATURE); - dumpByte(D, LUAC_VERSION); - dumpByte(D, LUAC_FORMAT); - dumpLiteral(D, LUAC_DATA); - dumpByte(D, sizeof(Instruction)); - dumpByte(D, sizeof(lua_Integer)); - dumpByte(D, sizeof(lua_Number)); - dumpInteger(D, LUAC_INT); - dumpNumber(D, LUAC_NUM); -} - - -/* -** dump Lua function as precompiled chunk -*/ -int luaU_dump (lua_State *L, const Proto *f, lua_Writer w, void *data, - int strip) { - DumpState D; - D.h = luaH_new(L); /* aux. table to keep strings already dumped */ - sethvalue2s(L, L->top.p, D.h); /* anchor it */ - L->top.p++; - D.L = L; - D.writer = w; - D.offset = 0; - D.data = data; - D.strip = strip; - D.status = 0; - D.nstr = 0; - dumpHeader(&D); - dumpByte(&D, f->sizeupvalues); - dumpFunction(&D, f); - dumpBlock(&D, NULL, 0); /* signal end of dump */ - return D.status; -} - - - -/* -** $Id: lstate.c $ -** Global State -** See Copyright Notice in lua.h -*/ - -#define lstate_c -#define LUA_CORE - - - -#include -#include - - - -/* -** $Id: lapi.h $ -** Auxiliary functions from Lua API -** See Copyright Notice in lua.h -*/ - -#ifndef lapi_h -#define lapi_h - - - - -/* Increments 'L->top.p', checking for stack overflows */ -#define api_incr_top(L) \ - (L->top.p++, api_check(L, L->top.p <= L->ci->top.p, "stack overflow")) - - -/* -** If a call returns too many multiple returns, the callee may not have -** stack space to accommodate all results. In this case, this macro -** increases its stack space ('L->ci->top.p'). -*/ -#define adjustresults(L,nres) \ - { if ((nres) <= LUA_MULTRET && L->ci->top.p < L->top.p) \ - L->ci->top.p = L->top.p; } - - -/* Ensure the stack has at least 'n' elements */ -#define api_checknelems(L,n) \ - api_check(L, (n) < (L->top.p - L->ci->func.p), \ - "not enough elements in the stack") - - -/* Ensure the stack has at least 'n' elements to be popped. (Some -** functions only update a slot after checking it for popping, but that -** is only an optimization for a pop followed by a push.) -*/ -#define api_checkpop(L,n) \ - api_check(L, (n) < L->top.p - L->ci->func.p && \ - L->tbclist.p < L->top.p - (n), \ - "not enough free elements in the stack") - - -/* -** To reduce the overhead of returning from C functions, the presence of -** to-be-closed variables in these functions is coded in the CallInfo's -** field 'nresults', in a way that functions with no to-be-closed variables -** with zero, one, or "all" wanted results have no overhead. Functions -** with other number of wanted results, as well as functions with -** variables to be closed, have an extra check. -*/ - -#define hastocloseCfunc(n) ((n) < LUA_MULTRET) - -/* Map [-1, inf) (range of 'nresults') into (-inf, -2] */ -#define codeNresults(n) (-(n) - 3) -#define decodeNresults(n) (-(n) - 3) - -#endif - - -/* -** $Id: llex.h $ -** Lexical Analyzer -** See Copyright Notice in lua.h -*/ - -#ifndef llex_h -#define llex_h - -#include - - - -/* -** Single-char tokens (terminal symbols) are represented by their own -** numeric code. Other tokens start at the following value. -*/ -#define FIRST_RESERVED (UCHAR_MAX + 1) - - -#if !defined(LUA_ENV) -#define LUA_ENV "_ENV" -#endif - - -/* -* WARNING: if you change the order of this enumeration, -* grep "ORDER RESERVED" -*/ -enum RESERVED { - /* terminal symbols denoted by reserved words */ - TK_AND = FIRST_RESERVED, TK_BREAK, - TK_DO, TK_ELSE, TK_ELSEIF, TK_END, TK_FALSE, TK_FOR, TK_FUNCTION, - TK_GOTO, TK_IF, TK_IN, TK_LOCAL, TK_NIL, TK_NOT, TK_OR, TK_REPEAT, - TK_RETURN, TK_THEN, TK_TRUE, TK_UNTIL, TK_WHILE, - /* other terminal symbols */ - TK_IDIV, TK_CONCAT, TK_DOTS, TK_EQ, TK_GE, TK_LE, TK_NE, - TK_SHL, TK_SHR, - TK_DBCOLON, TK_EOS, - TK_FLT, TK_INT, TK_NAME, TK_STRING -}; - -/* number of reserved words */ -#define NUM_RESERVED (cast_int(TK_WHILE-FIRST_RESERVED + 1)) - - -typedef union { - lua_Number r; - lua_Integer i; - TString *ts; -} SemInfo; /* semantics information */ - - -typedef struct Token { - int token; - SemInfo seminfo; -} Token; - - -/* state of the lexer plus state of the parser when shared by all - functions */ -typedef struct LexState { - int current; /* current character (charint) */ - int linenumber; /* input line counter */ - int lastline; /* line of last token 'consumed' */ - Token t; /* current token */ - Token lookahead; /* look ahead token */ - struct FuncState *fs; /* current function (parser) */ - struct lua_State *L; - ZIO *z; /* input stream */ - Mbuffer *buff; /* buffer for tokens */ - Table *h; /* to avoid collection/reuse strings */ - struct Dyndata *dyd; /* dynamic structures used by the parser */ - TString *source; /* current source name */ - TString *envn; /* environment variable name */ -} LexState; - - -LUAI_FUNC void luaX_init (lua_State *L); -LUAI_FUNC void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, - TString *source, int firstchar); -LUAI_FUNC TString *luaX_newstring (LexState *ls, const char *str, size_t l); -LUAI_FUNC void luaX_next (LexState *ls); -LUAI_FUNC int luaX_lookahead (LexState *ls); -LUAI_FUNC l_noret luaX_syntaxerror (LexState *ls, const char *s); -LUAI_FUNC const char *luaX_token2str (LexState *ls, int token); - - -#endif - - - - -/* -** thread state + extra space -*/ -typedef struct LX { - lu_byte extra_[LUA_EXTRASPACE]; - lua_State l; -} LX; - - -/* -** Main thread combines a thread state and the global state -*/ -typedef struct LG { - LX l; - global_State g; -} LG; - - - -#define fromstate(L) (cast(LX *, cast(lu_byte *, (L)) - offsetof(LX, l))) - - -/* -** set GCdebt to a new value keeping the real number of allocated -** objects (totalobjs - GCdebt) invariant and avoiding overflows in -** 'totalobjs'. -*/ -void luaE_setdebt (global_State *g, l_obj debt) { - l_obj tb = gettotalobjs(g); - lua_assert(tb > 0); - if (debt > MAX_LOBJ - tb) - debt = MAX_LOBJ - tb; /* will make 'totalobjs == MAX_LMEM' */ - g->totalobjs = tb + debt; - g->GCdebt = debt; -} - - -CallInfo *luaE_extendCI (lua_State *L) { - CallInfo *ci; - lua_assert(L->ci->next == NULL); - ci = luaM_new(L, CallInfo); - lua_assert(L->ci->next == NULL); - L->ci->next = ci; - ci->previous = L->ci; - ci->next = NULL; - ci->u.l.trap = 0; - L->nci++; - return ci; -} - - -/* -** free all CallInfo structures not in use by a thread -*/ -static void freeCI (lua_State *L) { - CallInfo *ci = L->ci; - CallInfo *next = ci->next; - ci->next = NULL; - while ((ci = next) != NULL) { - next = ci->next; - luaM_free(L, ci); - L->nci--; - } -} - - -/* -** free half of the CallInfo structures not in use by a thread, -** keeping the first one. -*/ -void luaE_shrinkCI (lua_State *L) { - CallInfo *ci = L->ci->next; /* first free CallInfo */ - CallInfo *next; - if (ci == NULL) - return; /* no extra elements */ - while ((next = ci->next) != NULL) { /* two extra elements? */ - CallInfo *next2 = next->next; /* next's next */ - ci->next = next2; /* remove next from the list */ - L->nci--; - luaM_free(L, next); /* free next */ - if (next2 == NULL) - break; /* no more elements */ - else { - next2->previous = ci; - ci = next2; /* continue */ - } - } -} - - -/* -** Called when 'getCcalls(L)' larger or equal to LUAI_MAXCCALLS. -** If equal, raises an overflow error. If value is larger than -** LUAI_MAXCCALLS (which means it is handling an overflow) but -** not much larger, does not report an error (to allow overflow -** handling to work). -*/ -void luaE_checkcstack (lua_State *L) { - if (getCcalls(L) == LUAI_MAXCCALLS) - luaG_runerror(L, "C stack overflow"); - else if (getCcalls(L) >= (LUAI_MAXCCALLS / 10 * 11)) - luaD_throw(L, LUA_ERRERR); /* error while handling stack error */ -} - - -LUAI_FUNC void luaE_incCstack (lua_State *L) { - L->nCcalls++; - if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) - luaE_checkcstack(L); -} - - -static void stack_init (lua_State *L1, lua_State *L) { - int i; CallInfo *ci; - /* initialize stack array */ - L1->stack.p = luaM_newvector(L, BASIC_STACK_SIZE + EXTRA_STACK, StackValue); - L1->tbclist.p = L1->stack.p; - for (i = 0; i < BASIC_STACK_SIZE + EXTRA_STACK; i++) - setnilvalue(s2v(L1->stack.p + i)); /* erase new stack */ - L1->top.p = L1->stack.p; - L1->stack_last.p = L1->stack.p + BASIC_STACK_SIZE; - /* initialize first ci */ - ci = &L1->base_ci; - ci->next = ci->previous = NULL; - ci->callstatus = CIST_C; - ci->func.p = L1->top.p; - ci->u.c.k = NULL; - ci->nresults = 0; - setnilvalue(s2v(L1->top.p)); /* 'function' entry for this 'ci' */ - L1->top.p++; - ci->top.p = L1->top.p + LUA_MINSTACK; - L1->ci = ci; -} - - -static void freestack (lua_State *L) { - if (L->stack.p == NULL) - return; /* stack not completely built yet */ - L->ci = &L->base_ci; /* free the entire 'ci' list */ - freeCI(L); - lua_assert(L->nci == 0); - luaM_freearray(L, L->stack.p, stacksize(L) + EXTRA_STACK); /* free stack */ -} - - -/* -** Create registry table and its predefined values -*/ -static void init_registry (lua_State *L, global_State *g) { - /* create registry */ - TValue aux; - Table *registry = luaH_new(L); - sethvalue(L, &g->l_registry, registry); - luaH_resize(L, registry, LUA_RIDX_LAST, 0); - /* registry[1] = false */ - setbfvalue(&aux); - luaH_setint(L, registry, 1, &aux); - /* registry[LUA_RIDX_MAINTHREAD] = L */ - setthvalue(L, &aux, L); - luaH_setint(L, registry, LUA_RIDX_MAINTHREAD, &aux); - /* registry[LUA_RIDX_GLOBALS] = new table (table of globals) */ - sethvalue(L, &aux, luaH_new(L)); - luaH_setint(L, registry, LUA_RIDX_GLOBALS, &aux); -} - - -/* -** open parts of the state that may cause memory-allocation errors. -*/ -static void f_luaopen (lua_State *L, void *ud) { - global_State *g = G(L); - UNUSED(ud); - stack_init(L, L); /* init stack */ - init_registry(L, g); - luaS_init(L); - luaT_init(L); - luaX_init(L); - g->gcstp = 0; /* allow gc */ - setnilvalue(&g->nilvalue); /* now state is complete */ - luai_userstateopen(L); -} - - -/* -** preinitialize a thread with consistent values without allocating -** any memory (to avoid errors) -*/ -static void preinit_thread (lua_State *L, global_State *g) { - G(L) = g; - L->stack.p = NULL; - L->ci = NULL; - L->nci = 0; - L->twups = L; /* thread has no upvalues */ - L->nCcalls = 0; - L->errorJmp = NULL; - L->hook = NULL; - L->hookmask = 0; - L->basehookcount = 0; - L->allowhook = 1; - resethookcount(L); - L->openupval = NULL; - L->status = LUA_OK; - L->errfunc = 0; - L->oldpc = 0; -} - - -static void close_state (lua_State *L) { - global_State *g = G(L); - if (!completestate(g)) /* closing a partially built state? */ - luaC_freeallobjects(L); /* just collect its objects */ - else { /* closing a fully built state */ - L->ci = &L->base_ci; /* unwind CallInfo list */ - luaD_closeprotected(L, 1, LUA_OK); /* close all upvalues */ - luaC_freeallobjects(L); /* collect all objects */ - luai_userstateclose(L); - } - luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size); - freestack(L); - lua_assert(g->totalbytes == sizeof(LG)); - lua_assert(gettotalobjs(g) == 1); - (*g->frealloc)(g->ud, fromstate(L), sizeof(LG), 0); /* free main block */ -} - - -LUA_API lua_State *lua_newthread (lua_State *L) { - global_State *g = G(L); - GCObject *o; - lua_State *L1; - lua_lock(L); - luaC_checkGC(L); - /* create new thread */ - o = luaC_newobjdt(L, LUA_TTHREAD, sizeof(LX), offsetof(LX, l)); - L1 = gco2th(o); - /* anchor it on L stack */ - setthvalue2s(L, L->top.p, L1); - api_incr_top(L); - preinit_thread(L1, g); - L1->hookmask = L->hookmask; - L1->basehookcount = L->basehookcount; - L1->hook = L->hook; - resethookcount(L1); - /* initialize L1 extra space */ - memcpy(lua_getextraspace(L1), lua_getextraspace(g->mainthread), - LUA_EXTRASPACE); - luai_userstatethread(L, L1); - stack_init(L1, L); /* init stack */ - lua_unlock(L); - return L1; -} - - -void luaE_freethread (lua_State *L, lua_State *L1) { - LX *l = fromstate(L1); - luaF_closeupval(L1, L1->stack.p); /* close all upvalues */ - lua_assert(L1->openupval == NULL); - luai_userstatefree(L, L1); - freestack(L1); - luaM_free(L, l); -} - - -int luaE_resetthread (lua_State *L, int status) { - CallInfo *ci = L->ci = &L->base_ci; /* unwind CallInfo list */ - setnilvalue(s2v(L->stack.p)); /* 'function' entry for basic 'ci' */ - ci->func.p = L->stack.p; - ci->callstatus = CIST_C; - if (status == LUA_YIELD) - status = LUA_OK; - L->status = LUA_OK; /* so it can run __close metamethods */ - status = luaD_closeprotected(L, 1, status); - if (status != LUA_OK) /* errors? */ - luaD_seterrorobj(L, status, L->stack.p + 1); - else - L->top.p = L->stack.p + 1; - ci->top.p = L->top.p + LUA_MINSTACK; - luaD_reallocstack(L, cast_int(ci->top.p - L->stack.p), 0); - return status; -} - - -LUA_API int lua_closethread (lua_State *L, lua_State *from) { - int status; - lua_lock(L); - L->nCcalls = (from) ? getCcalls(from) : 0; - status = luaE_resetthread(L, L->status); - lua_unlock(L); - return status; -} - - -LUA_API lua_State *lua_newstate (lua_Alloc f, void *ud, unsigned seed) { - int i; - lua_State *L; - global_State *g; - LG *l = cast(LG *, (*f)(ud, NULL, LUA_TTHREAD, sizeof(LG))); - if (l == NULL) return NULL; - L = &l->l.l; - g = &l->g; - L->tt = LUA_VTHREAD; - g->currentwhite = bitmask(WHITE0BIT); - L->marked = luaC_white(g); - preinit_thread(L, g); - g->allgc = obj2gco(L); /* by now, only object is the main thread */ - L->next = NULL; - incnny(L); /* main thread is always non yieldable */ - g->frealloc = f; - g->ud = ud; - g->warnf = NULL; - g->ud_warn = NULL; - g->mainthread = L; - g->seed = seed; - g->gcstp = GCSTPGC; /* no GC while building state */ - g->strt.size = g->strt.nuse = 0; - g->strt.hash = NULL; - setnilvalue(&g->l_registry); - g->panic = NULL; - g->gcstate = GCSpause; - g->gckind = KGC_INC; - g->gcstopem = 0; - g->gcemergency = 0; - g->finobj = g->tobefnz = g->fixedgc = NULL; - g->firstold1 = g->survival = g->old1 = g->reallyold = NULL; - g->finobjsur = g->finobjold1 = g->finobjrold = NULL; - g->sweepgc = NULL; - g->gray = g->grayagain = NULL; - g->weak = g->ephemeron = g->allweak = NULL; - g->twups = NULL; - g->totalbytes = sizeof(LG); - g->totalobjs = 1; - g->marked = 0; - g->GCdebt = 0; - setivalue(&g->nilvalue, 0); /* to signal that state is not yet built */ - setgcparam(g, PAUSE, LUAI_GCPAUSE); - setgcparam(g, STEPMUL, LUAI_GCMUL); - setgcparam(g, STEPSIZE, LUAI_GCSTEPSIZE); - setgcparam(g, MINORMUL, LUAI_GENMINORMUL); - setgcparam(g, MINORMAJOR, LUAI_MINORMAJOR); - setgcparam(g, MAJORMINOR, LUAI_MAJORMINOR); - for (i=0; i < LUA_NUMTYPES; i++) g->mt[i] = NULL; - if (luaD_rawrunprotected(L, f_luaopen, NULL) != LUA_OK) { - /* memory allocation error: free partial state */ - close_state(L); - L = NULL; - } - return L; -} - - -LUA_API void lua_close (lua_State *L) { - lua_lock(L); - L = G(L)->mainthread; /* only the main thread can be closed */ - close_state(L); -} - - -void luaE_warning (lua_State *L, const char *msg, int tocont) { - lua_WarnFunction wf = G(L)->warnf; - if (wf != NULL) - wf(G(L)->ud_warn, msg, tocont); -} - - -/* -** Generate a warning from an error message -*/ -void luaE_warnerror (lua_State *L, const char *where) { - TValue *errobj = s2v(L->top.p - 1); /* error object */ - const char *msg = (ttisstring(errobj)) - ? getstr(tsvalue(errobj)) - : "private_lua_error object is not a string"; - /* produce warning "error in %s (%s)" (where, msg) */ - luaE_warning(L, "private_lua_error in ", 1); - luaE_warning(L, where, 1); - luaE_warning(L, " (", 1); - luaE_warning(L, msg, 1); - luaE_warning(L, ")", 0); -} - - - -/* -** $Id: lgc.c $ -** Garbage Collector -** See Copyright Notice in lua.h -*/ - -#define lgc_c -#define LUA_CORE - - -#include - - - - - -/* -** Number of fixed (luaC_fix) objects in a Lua state: metafield names, -** plus reserved words, plus "_ENV", plus the memory-error message. -*/ -#define NFIXED (TM_N + NUM_RESERVED + 2) - - -/* -** Maximum number of elements to sweep in each single step. -** (Large enough to dissipate fixed overheads but small enough -** to allow small steps for the collector.) -*/ -#define GCSWEEPMAX 20 - - -/* mask with all color bits */ -#define maskcolors (bitmask(BLACKBIT) | WHITEBITS) - -/* mask with all GC bits */ -#define maskgcbits (maskcolors | AGEBITS) - - -/* macro to erase all color bits then set only the current white bit */ -#define makewhite(g,x) \ - (x->marked = cast_byte((x->marked & ~maskcolors) | luaC_white(g))) - -/* make an object gray (neither white nor black) */ -#define set2gray(x) resetbits(x->marked, maskcolors) - - -/* make an object black (coming from any color) */ -#define set2black(x) \ - (x->marked = cast_byte((x->marked & ~WHITEBITS) | bitmask(BLACKBIT))) - - -#define valiswhite(x) (iscollectable(x) && iswhite(gcvalue(x))) - -#define keyiswhite(n) (keyiscollectable(n) && iswhite(gckey(n))) - - -/* -** Protected access to objects in values -*/ -#define gcvalueN(o) (iscollectable(o) ? gcvalue(o) : NULL) - - -/* -** Access to collectable objects in array part of tables -*/ -#define gcvalarr(t,i) \ - ((*getArrTag(t,i) & BIT_ISCOLLECTABLE) ? getArrVal(t,i)->gc : NULL) - - -#define markvalue(g,o) { checkliveness(g->mainthread,o); \ - if (valiswhite(o)) reallymarkobject(g,gcvalue(o)); } - -#define markkey(g, n) { if keyiswhite(n) reallymarkobject(g,gckey(n)); } - -#define markobject(g,t) { if (iswhite(t)) reallymarkobject(g, obj2gco(t)); } - -/* -** mark an object that can be NULL (either because it is really optional, -** or it was stripped as debug info, or inside an uncompleted structure) -*/ -#define markobjectN(g,t) { if (t) markobject(g,t); } - - -static void reallymarkobject (global_State *g, GCObject *o); -static l_obj atomic (lua_State *L); -static void entersweep (lua_State *L); - - -/* -** {====================================================== -** Generic functions -** ======================================================= -*/ - - -/* -** one after last element in a hash array -*/ -#define gnodelast(h) gnode(h, cast_sizet(sizenode(h))) - - -static GCObject **getgclist (GCObject *o) { - switch (o->tt) { - case LUA_VTABLE: return &gco2t(o)->gclist; - case LUA_VLCL: return &gco2lcl(o)->gclist; - case LUA_VCCL: return &gco2ccl(o)->gclist; - case LUA_VTHREAD: return &gco2th(o)->gclist; - case LUA_VPROTO: return &gco2p(o)->gclist; - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - lua_assert(u->nuvalue > 0); - return &u->gclist; - } - default: lua_assert(0); return 0; - } -} - - -/* -** Link a collectable object 'o' with a known type into the list 'p'. -** (Must be a macro to access the 'gclist' field in different types.) -*/ -#define linkgclist(o,p) linkgclist_(obj2gco(o), &(o)->gclist, &(p)) - -static void linkgclist_ (GCObject *o, GCObject **pnext, GCObject **list) { - lua_assert(!isgray(o)); /* cannot be in a gray list */ - *pnext = *list; - *list = o; - set2gray(o); /* now it is */ -} - - -/* -** Link a generic collectable object 'o' into the list 'p'. -*/ -#define linkobjgclist(o,p) linkgclist_(obj2gco(o), getgclist(o), &(p)) - - - -/* -** Clear keys for empty entries in tables. If entry is empty, mark its -** entry as dead. This allows the collection of the key, but keeps its -** entry in the table: its removal could break a chain and could break -** a table traversal. Other places never manipulate dead keys, because -** its associated empty value is enough to signal that the entry is -** logically empty. -*/ -static void clearkey (Node *n) { - lua_assert(isempty(gval(n))); - if (keyiscollectable(n)) - setdeadkey(n); /* unused key; remove it */ -} - - -/* -** tells whether a key or value can be cleared from a weak -** table. Non-collectable objects are never removed from weak -** tables. Strings behave as 'values', so are never removed too. for -** other objects: if really collected, cannot keep them; for objects -** being finalized, keep them in keys, but not in values -*/ -static int iscleared (global_State *g, const GCObject *o) { - if (o == NULL) return 0; /* non-collectable value */ - else if (novariant(o->tt) == LUA_TSTRING) { - markobject(g, o); /* strings are 'values', so are never weak */ - return 0; - } - else return iswhite(o); -} - - -/* -** Barrier that moves collector forward, that is, marks the white object -** 'v' being pointed by the black object 'o'. In the generational -** mode, 'v' must also become old, if 'o' is old; however, it cannot -** be changed directly to OLD, because it may still point to non-old -** objects. So, it is marked as OLD0. In the next cycle it will become -** OLD1, and in the next it will finally become OLD (regular old). By -** then, any object it points to will also be old. If called in the -** incremental sweep phase, it clears the black object to white (sweep -** it) to avoid other barrier calls for this same object. (That cannot -** be done is generational mode, as its sweep does not distinguish -** whites from deads.) -*/ -void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v) { - global_State *g = G(L); - lua_assert(isblack(o) && iswhite(v) && !isdead(g, v) && !isdead(g, o)); - if (keepinvariant(g)) { /* must keep invariant? */ - reallymarkobject(g, v); /* restore invariant */ - if (isold(o)) { - lua_assert(!isold(v)); /* white object could not be old */ - setage(v, G_OLD0); /* restore generational invariant */ - } - } - else { /* sweep phase */ - lua_assert(issweepphase(g)); - if (g->gckind != KGC_GENMINOR) /* incremental mode? */ - makewhite(g, o); /* mark 'o' as white to avoid other barriers */ - } -} - - -/* -** barrier that moves collector backward, that is, mark the black object -** pointing to a white object as gray again. -*/ -void luaC_barrierback_ (lua_State *L, GCObject *o) { - global_State *g = G(L); - lua_assert(isblack(o) && !isdead(g, o)); - lua_assert((g->gckind != KGC_GENMINOR) - || (isold(o) && getage(o) != G_TOUCHED1)); - if (getage(o) == G_TOUCHED2) /* already in gray list? */ - set2gray(o); /* make it gray to become touched1 */ - else /* link it in 'grayagain' and paint it gray */ - linkobjgclist(o, g->grayagain); - if (isold(o)) /* generational mode? */ - setage(o, G_TOUCHED1); /* touched in current cycle */ -} - - -void luaC_fix (lua_State *L, GCObject *o) { - global_State *g = G(L); - lua_assert(g->allgc == o); /* object must be 1st in 'allgc' list! */ - set2gray(o); /* they will be gray forever */ - setage(o, G_OLD); /* and old forever */ - g->allgc = o->next; /* remove object from 'allgc' list */ - o->next = g->fixedgc; /* link it to 'fixedgc' list */ - g->fixedgc = o; -} - - -/* -** create a new collectable object (with given type, size, and offset) -** and link it to 'allgc' list. -*/ -GCObject *luaC_newobjdt (lua_State *L, int tt, size_t sz, size_t offset) { - global_State *g = G(L); - char *p = cast_charp(luaM_newobject(L, novariant(tt), sz)); - GCObject *o = cast(GCObject *, p + offset); - g->GCdebt--; - o->marked = luaC_white(g); - o->tt = tt; - o->next = g->allgc; - g->allgc = o; - return o; -} - - -/* -** create a new collectable object with no offset. -*/ -GCObject *luaC_newobj (lua_State *L, int tt, size_t sz) { - return luaC_newobjdt(L, tt, sz, 0); -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Mark functions -** ======================================================= -*/ - - -/* -** Mark an object. Userdata with no user values, strings, and closed -** upvalues are visited and turned black here. Open upvalues are -** already indirectly linked through their respective threads in the -** 'twups' list, so they don't go to the gray list; nevertheless, they -** are kept gray to avoid barriers, as their values will be revisited -** by the thread or by 'remarkupvals'. Other objects are added to the -** gray list to be visited (and turned black) later. Both userdata and -** upvalues can call this function recursively, but this recursion goes -** for at most two levels: An upvalue cannot refer to another upvalue -** (only closures can), and a userdata's metatable must be a table. -*/ -static void reallymarkobject (global_State *g, GCObject *o) { - g->marked++; - switch (o->tt) { - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - set2black(o); /* nothing to visit */ - break; - } - case LUA_VUPVAL: { - UpVal *uv = gco2upv(o); - if (upisopen(uv)) - set2gray(uv); /* open upvalues are kept gray */ - else - set2black(uv); /* closed upvalues are visited here */ - markvalue(g, uv->v.p); /* mark its content */ - break; - } - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - if (u->nuvalue == 0) { /* no user values? */ - markobjectN(g, u->metatable); /* mark its metatable */ - set2black(u); /* nothing else to mark */ - break; - } - /* else... */ - } /* FALLTHROUGH */ - case LUA_VLCL: case LUA_VCCL: case LUA_VTABLE: - case LUA_VTHREAD: case LUA_VPROTO: { - linkobjgclist(o, g->gray); /* to be visited later */ - break; - } - default: lua_assert(0); break; - } -} - - -/* -** mark metamethods for basic types -*/ -static void markmt (global_State *g) { - int i; - for (i=0; i < LUA_NUMTYPES; i++) - markobjectN(g, g->mt[i]); -} - - -/* -** mark all objects in list of being-finalized -*/ -static l_obj markbeingfnz (global_State *g) { - GCObject *o; - l_obj count = 0; - for (o = g->tobefnz; o != NULL; o = o->next) { - count++; - markobject(g, o); - } - return count; -} - - -/* -** For each non-marked thread, simulates a barrier between each open -** upvalue and its value. (If the thread is collected, the value will be -** assigned to the upvalue, but then it can be too late for the barrier -** to act. The "barrier" does not need to check colors: A non-marked -** thread must be young; upvalues cannot be older than their threads; so -** any visited upvalue must be young too.) Also removes the thread from -** the list, as it was already visited. Removes also threads with no -** upvalues, as they have nothing to be checked. (If the thread gets an -** upvalue later, it will be linked in the list again.) -*/ -static l_obj remarkupvals (global_State *g) { - l_obj work = 0; - lua_State *thread; - lua_State **p = &g->twups; - while ((thread = *p) != NULL) { - if (!iswhite(thread) && thread->openupval != NULL) - p = &thread->twups; /* keep marked thread with upvalues in the list */ - else { /* thread is not marked or without upvalues */ - UpVal *uv; - lua_assert(!isold(thread) || thread->openupval == NULL); - *p = thread->twups; /* remove thread from the list */ - thread->twups = thread; /* mark that it is out of list */ - for (uv = thread->openupval; uv != NULL; uv = uv->u.open.next) { - lua_assert(getage(uv) <= getage(thread)); - if (!iswhite(uv)) { /* upvalue already visited? */ - lua_assert(upisopen(uv) && isgray(uv)); - markvalue(g, uv->v.p); /* mark its value */ - } - } - } - work++; - } - return work; -} - - -static void cleargraylists (global_State *g) { - g->gray = g->grayagain = NULL; - g->weak = g->allweak = g->ephemeron = NULL; -} - - -/* -** mark root set and reset all gray lists, to start a new collection. -** 'marked' is initialized with the number of fixed objects in the state, -** to count the total number of live objects during a cycle. (That is -** the metafield names, plus the reserved words, plus "_ENV" plus the -** memory-error message.) -*/ -static void restartcollection (global_State *g) { - cleargraylists(g); - g->marked = NFIXED; - markobject(g, g->mainthread); - markvalue(g, &g->l_registry); - markmt(g); - markbeingfnz(g); /* mark any finalizing object left from previous cycle */ -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Traverse functions -** ======================================================= -*/ - - -/* -** Check whether object 'o' should be kept in the 'grayagain' list for -** post-processing by 'correctgraylist'. (It could put all old objects -** in the list and leave all the work to 'correctgraylist', but it is -** more efficient to avoid adding elements that will be removed.) Only -** TOUCHED1 objects need to be in the list. TOUCHED2 doesn't need to go -** back to a gray list, but then it must become OLD. (That is what -** 'correctgraylist' does when it finds a TOUCHED2 object.) -*/ -static void genlink (global_State *g, GCObject *o) { - lua_assert(isblack(o)); - if (getage(o) == G_TOUCHED1) { /* touched in this cycle? */ - linkobjgclist(o, g->grayagain); /* link it back in 'grayagain' */ - } /* everything else do not need to be linked back */ - else if (getage(o) == G_TOUCHED2) - setage(o, G_OLD); /* advance age */ -} - - -/* -** Traverse a table with weak values and link it to proper list. During -** propagate phase, keep it in 'grayagain' list, to be revisited in the -** atomic phase. In the atomic phase, if table has any white value, -** put it in 'weak' list, to be cleared. -*/ -static void traverseweakvalue (global_State *g, Table *h) { - Node *n, *limit = gnodelast(h); - /* if there is array part, assume it may have white values (it is not - worth traversing it now just to check) */ - int hasclears = (h->alimit > 0); - for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ - if (isempty(gval(n))) /* entry is empty? */ - clearkey(n); /* clear its key */ - else { - lua_assert(!keyisnil(n)); - markkey(g, n); - if (!hasclears && iscleared(g, gcvalueN(gval(n)))) /* a white value? */ - hasclears = 1; /* table will have to be cleared */ - } - } - if (g->gcstate == GCSatomic && hasclears) - linkgclist(h, g->weak); /* has to be cleared later */ - else - linkgclist(h, g->grayagain); /* must retraverse it in atomic phase */ -} - - -/* -** Traverse the array part of a table. -*/ -static int traversearray (global_State *g, Table *h) { - unsigned asize = luaH_realasize(h); - int marked = 0; /* true if some object is marked in this traversal */ - unsigned i; - for (i = 0; i < asize; i++) { - GCObject *o = gcvalarr(h, i); - if (o != NULL && iswhite(o)) { - marked = 1; - reallymarkobject(g, o); - } - } - return marked; -} - - -/* -** Traverse an ephemeron table and link it to proper list. Returns true -** iff any object was marked during this traversal (which implies that -** convergence has to continue). During propagation phase, keep table -** in 'grayagain' list, to be visited again in the atomic phase. In -** the atomic phase, if table has any white->white entry, it has to -** be revisited during ephemeron convergence (as that key may turn -** black). Otherwise, if it has any white key, table has to be cleared -** (in the atomic phase). In generational mode, some tables -** must be kept in some gray list for post-processing; this is done -** by 'genlink'. -*/ -static int traverseephemeron (global_State *g, Table *h, int inv) { - int hasclears = 0; /* true if table has white keys */ - int hasww = 0; /* true if table has entry "white-key -> white-value" */ - unsigned int i; - unsigned int nsize = sizenode(h); - int marked = traversearray(g, h); /* traverse array part */ - /* traverse hash part; if 'inv', traverse descending - (see 'convergeephemerons') */ - for (i = 0; i < nsize; i++) { - Node *n = inv ? gnode(h, nsize - 1 - i) : gnode(h, i); - if (isempty(gval(n))) /* entry is empty? */ - clearkey(n); /* clear its key */ - else if (iscleared(g, gckeyN(n))) { /* key is not marked (yet)? */ - hasclears = 1; /* table must be cleared */ - if (valiswhite(gval(n))) /* value not marked yet? */ - hasww = 1; /* white-white entry */ - } - else if (valiswhite(gval(n))) { /* value not marked yet? */ - marked = 1; - reallymarkobject(g, gcvalue(gval(n))); /* mark it now */ - } - } - /* link table into proper list */ - if (g->gcstate == GCSpropagate) - linkgclist(h, g->grayagain); /* must retraverse it in atomic phase */ - else if (hasww) /* table has white->white entries? */ - linkgclist(h, g->ephemeron); /* have to propagate again */ - else if (hasclears) /* table has white keys? */ - linkgclist(h, g->allweak); /* may have to clean white keys */ - else - genlink(g, obj2gco(h)); /* check whether collector still needs to see it */ - return marked; -} - - -static void traversestrongtable (global_State *g, Table *h) { - Node *n, *limit = gnodelast(h); - traversearray(g, h); - for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ - if (isempty(gval(n))) /* entry is empty? */ - clearkey(n); /* clear its key */ - else { - lua_assert(!keyisnil(n)); - markkey(g, n); - markvalue(g, gval(n)); - } - } - genlink(g, obj2gco(h)); -} - - -static void traversetable (global_State *g, Table *h) { - const char *weakkey, *weakvalue; - const TValue *mode = gfasttm(g, h->metatable, TM_MODE); - TString *smode; - markobjectN(g, h->metatable); - if (mode && ttisshrstring(mode) && /* is there a weak mode? */ - (cast_void(smode = tsvalue(mode)), - cast_void(weakkey = strchr(getshrstr(smode), 'k')), - cast_void(weakvalue = strchr(getshrstr(smode), 'v')), - (weakkey || weakvalue))) { /* is really weak? */ - if (!weakkey) /* strong keys? */ - traverseweakvalue(g, h); - else if (!weakvalue) /* strong values? */ - traverseephemeron(g, h, 0); - else /* all weak */ - linkgclist(h, g->allweak); /* nothing to traverse now */ - } - else /* not weak */ - traversestrongtable(g, h); -} - - -static void traverseudata (global_State *g, Udata *u) { - int i; - markobjectN(g, u->metatable); /* mark its metatable */ - for (i = 0; i < u->nuvalue; i++) - markvalue(g, &u->uv[i].uv); - genlink(g, obj2gco(u)); -} - - -/* -** Traverse a prototype. (While a prototype is being build, its -** arrays can be larger than needed; the extra slots are filled with -** NULL, so the use of 'markobjectN') -*/ -static void traverseproto (global_State *g, Proto *f) { - int i; - markobjectN(g, f->source); - for (i = 0; i < f->sizek; i++) /* mark literals */ - markvalue(g, &f->k[i]); - for (i = 0; i < f->sizeupvalues; i++) /* mark upvalue names */ - markobjectN(g, f->upvalues[i].name); - for (i = 0; i < f->sizep; i++) /* mark nested protos */ - markobjectN(g, f->p[i]); - for (i = 0; i < f->sizelocvars; i++) /* mark local-variable names */ - markobjectN(g, f->locvars[i].varname); -} - - -static void traverseCclosure (global_State *g, CClosure *cl) { - int i; - for (i = 0; i < cl->nupvalues; i++) /* mark its upvalues */ - markvalue(g, &cl->upvalue[i]); -} - -/* -** Traverse a Lua closure, marking its prototype and its upvalues. -** (Both can be NULL while closure is being created.) -*/ -static void traverseLclosure (global_State *g, LClosure *cl) { - int i; - markobjectN(g, cl->p); /* mark its prototype */ - for (i = 0; i < cl->nupvalues; i++) { /* visit its upvalues */ - UpVal *uv = cl->upvals[i]; - markobjectN(g, uv); /* mark upvalue */ - } -} - - -/* -** Traverse a thread, marking the elements in the stack up to its top -** and cleaning the rest of the stack in the final traversal. That -** ensures that the entire stack have valid (non-dead) objects. -** Threads have no barriers. In gen. mode, old threads must be visited -** at every cycle, because they might point to young objects. In inc. -** mode, the thread can still be modified before the end of the cycle, -** and therefore it must be visited again in the atomic phase. To ensure -** these visits, threads must return to a gray list if they are not new -** (which can only happen in generational mode) or if the traverse is in -** the propagate phase (which can only happen in incremental mode). -*/ -static void traversethread (global_State *g, lua_State *th) { - UpVal *uv; - StkId o = th->stack.p; - if (isold(th) || g->gcstate == GCSpropagate) - linkgclist(th, g->grayagain); /* insert into 'grayagain' list */ - if (o == NULL) - return; /* stack not completely built yet */ - lua_assert(g->gcstate == GCSatomic || - th->openupval == NULL || isintwups(th)); - for (; o < th->top.p; o++) /* mark live elements in the stack */ - markvalue(g, s2v(o)); - for (uv = th->openupval; uv != NULL; uv = uv->u.open.next) - markobject(g, uv); /* open upvalues cannot be collected */ - if (g->gcstate == GCSatomic) { /* final traversal? */ - if (!g->gcemergency) - luaD_shrinkstack(th); /* do not change stack in emergency cycle */ - for (o = th->top.p; o < th->stack_last.p + EXTRA_STACK; o++) - setnilvalue(s2v(o)); /* clear dead stack slice */ - /* 'remarkupvals' may have removed thread from 'twups' list */ - if (!isintwups(th) && th->openupval != NULL) { - th->twups = g->twups; /* link it back to the list */ - g->twups = th; - } - } -} - - -/* -** traverse one gray object, turning it to black. -*/ -static void propagatemark (global_State *g) { - GCObject *o = g->gray; - nw2black(o); - g->gray = *getgclist(o); /* remove from 'gray' list */ - switch (o->tt) { - case LUA_VTABLE: traversetable(g, gco2t(o)); break; - case LUA_VUSERDATA: traverseudata(g, gco2u(o)); break; - case LUA_VLCL: traverseLclosure(g, gco2lcl(o)); break; - case LUA_VCCL: traverseCclosure(g, gco2ccl(o)); break; - case LUA_VPROTO: traverseproto(g, gco2p(o)); break; - case LUA_VTHREAD: traversethread(g, gco2th(o)); break; - default: lua_assert(0); - } -} - - -static l_obj propagateall (global_State *g) { - l_obj work = 0; - while (g->gray) { - propagatemark(g); - work++; - } - return work; -} - - -/* -** Traverse all ephemeron tables propagating marks from keys to values. -** Repeat until it converges, that is, nothing new is marked. 'dir' -** inverts the direction of the traversals, trying to speed up -** convergence on chains in the same table. -*/ -static l_obj convergeephemerons (global_State *g) { - int changed; - l_obj work = 0; - int dir = 0; - do { - GCObject *w; - GCObject *next = g->ephemeron; /* get ephemeron list */ - g->ephemeron = NULL; /* tables may return to this list when traversed */ - changed = 0; - while ((w = next) != NULL) { /* for each ephemeron table */ - Table *h = gco2t(w); - next = h->gclist; /* list is rebuilt during loop */ - nw2black(h); /* out of the list (for now) */ - if (traverseephemeron(g, h, dir)) { /* marked some value? */ - propagateall(g); /* propagate changes */ - changed = 1; /* will have to revisit all ephemeron tables */ - } - work++; - } - dir = !dir; /* invert direction next time */ - } while (changed); /* repeat until no more changes */ - return work; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Sweep Functions -** ======================================================= -*/ - - -/* -** clear entries with unmarked keys from all weaktables in list 'l' -*/ -static l_obj clearbykeys (global_State *g, GCObject *l) { - l_obj work = 0; - for (; l; l = gco2t(l)->gclist) { - Table *h = gco2t(l); - Node *limit = gnodelast(h); - Node *n; - for (n = gnode(h, 0); n < limit; n++) { - if (iscleared(g, gckeyN(n))) /* unmarked key? */ - setempty(gval(n)); /* remove entry */ - if (isempty(gval(n))) /* is entry empty? */ - clearkey(n); /* clear its key */ - } - work++; - } - return work; -} - - -/* -** clear entries with unmarked values from all weaktables in list 'l' up -** to element 'f' -*/ -static l_obj clearbyvalues (global_State *g, GCObject *l, GCObject *f) { - l_obj work = 0; - for (; l != f; l = gco2t(l)->gclist) { - Table *h = gco2t(l); - Node *n, *limit = gnodelast(h); - unsigned int i; - unsigned int asize = luaH_realasize(h); - for (i = 0; i < asize; i++) { - GCObject *o = gcvalarr(h, i); - if (iscleared(g, o)) /* value was collected? */ - *getArrTag(h, i) = LUA_VEMPTY; /* remove entry */ - } - for (n = gnode(h, 0); n < limit; n++) { - if (iscleared(g, gcvalueN(gval(n)))) /* unmarked value? */ - setempty(gval(n)); /* remove entry */ - if (isempty(gval(n))) /* is entry empty? */ - clearkey(n); /* clear its key */ - } - work++; - } - return work; -} - - -static void freeupval (lua_State *L, UpVal *uv) { - if (upisopen(uv)) - luaF_unlinkupval(uv); - luaM_free(L, uv); -} - - -static void freeobj (lua_State *L, GCObject *o) { - G(L)->totalobjs--; - switch (o->tt) { - case LUA_VPROTO: - luaF_freeproto(L, gco2p(o)); - break; - case LUA_VUPVAL: - freeupval(L, gco2upv(o)); - break; - case LUA_VLCL: { - LClosure *cl = gco2lcl(o); - luaM_freemem(L, cl, sizeLclosure(cl->nupvalues)); - break; - } - case LUA_VCCL: { - CClosure *cl = gco2ccl(o); - luaM_freemem(L, cl, sizeCclosure(cl->nupvalues)); - break; - } - case LUA_VTABLE: - luaH_free(L, gco2t(o)); - break; - case LUA_VTHREAD: - luaE_freethread(L, gco2th(o)); - break; - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - luaM_freemem(L, o, sizeudata(u->nuvalue, u->len)); - break; - } - case LUA_VSHRSTR: { - TString *ts = gco2ts(o); - luaS_remove(L, ts); /* remove it from hash table */ - luaM_freemem(L, ts, sizestrshr(ts->shrlen)); - break; - } - case LUA_VLNGSTR: { - TString *ts = gco2ts(o); - if (ts->shrlen == LSTRMEM) /* must free external string? */ - (*ts->falloc)(ts->ud, ts->contents, ts->u.lnglen + 1, 0); - luaM_freemem(L, ts, luaS_sizelngstr(ts->u.lnglen, ts->shrlen)); - break; - } - default: lua_assert(0); - } -} - - -/* -** sweep at most 'countin' elements from a list of GCObjects erasing dead -** objects, where a dead object is one marked with the old (non current) -** white; change all non-dead objects back to white (and new), preparing -** for next collection cycle. Return where to continue the traversal or -** NULL if list is finished. -*/ -static GCObject **sweeplist (lua_State *L, GCObject **p, l_obj countin) { - global_State *g = G(L); - int ow = otherwhite(g); - l_obj i; - int white = luaC_white(g); /* current white */ - for (i = 0; *p != NULL && i < countin; i++) { - GCObject *curr = *p; - int marked = curr->marked; - if (isdeadm(ow, marked)) { /* is 'curr' dead? */ - *p = curr->next; /* remove 'curr' from list */ - freeobj(L, curr); /* erase 'curr' */ - } - else { /* change mark to 'white' and age to 'new' */ - curr->marked = cast_byte((marked & ~maskgcbits) | white | G_NEW); - p = &curr->next; /* go to next element */ - } - } - return (*p == NULL) ? NULL : p; -} - - -/* -** sweep a list until a live object (or end of list) -*/ -static GCObject **sweeptolive (lua_State *L, GCObject **p) { - GCObject **old = p; - do { - p = sweeplist(L, p, 1); - } while (p == old); - return p; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Finalization -** ======================================================= -*/ - -/* -** If possible, shrink string table. -*/ -static void checkSizes (lua_State *L, global_State *g) { - if (!g->gcemergency) { - if (g->strt.nuse < g->strt.size / 4) /* string table too big? */ - luaS_resize(L, g->strt.size / 2); - } -} - - -/* -** Get the next udata to be finalized from the 'tobefnz' list, and -** link it back into the 'allgc' list. -*/ -static GCObject *udata2finalize (global_State *g) { - GCObject *o = g->tobefnz; /* get first element */ - lua_assert(tofinalize(o)); - g->tobefnz = o->next; /* remove it from 'tobefnz' list */ - o->next = g->allgc; /* return it to 'allgc' list */ - g->allgc = o; - resetbit(o->marked, FINALIZEDBIT); /* object is "normal" again */ - if (issweepphase(g)) - makewhite(g, o); /* "sweep" object */ - else if (getage(o) == G_OLD1) - g->firstold1 = o; /* it is the first OLD1 object in the list */ - return o; -} - - -static void dothecall (lua_State *L, void *ud) { - UNUSED(ud); - luaD_callnoyield(L, L->top.p - 2, 0); -} - - -static void GCTM (lua_State *L) { - global_State *g = G(L); - const TValue *tm; - TValue v; - lua_assert(!g->gcemergency); - setgcovalue(L, &v, udata2finalize(g)); - tm = luaT_gettmbyobj(L, &v, TM_GC); - if (!notm(tm)) { /* is there a finalizer? */ - int status; - lu_byte oldah = L->allowhook; - int oldgcstp = g->gcstp; - g->gcstp |= GCSTPGC; /* avoid GC steps */ - L->allowhook = 0; /* stop debug hooks during GC metamethod */ - setobj2s(L, L->top.p++, tm); /* push finalizer... */ - setobj2s(L, L->top.p++, &v); /* ... and its argument */ - L->ci->callstatus |= CIST_FIN; /* will run a finalizer */ - status = luaD_pcall(L, dothecall, NULL, savestack(L, L->top.p - 2), 0); - L->ci->callstatus &= ~CIST_FIN; /* not running a finalizer anymore */ - L->allowhook = oldah; /* restore hooks */ - g->gcstp = oldgcstp; /* restore state */ - if (l_unlikely(status != LUA_OK)) { /* error while running __gc? */ - luaE_warnerror(L, "__gc"); - L->top.p--; /* pops error object */ - } - } -} - - -/* -** call all pending finalizers -*/ -static void callallpendingfinalizers (lua_State *L) { - global_State *g = G(L); - while (g->tobefnz) - GCTM(L); -} - - -/* -** find last 'next' field in list 'p' list (to add elements in its end) -*/ -static GCObject **findlast (GCObject **p) { - while (*p != NULL) - p = &(*p)->next; - return p; -} - - -/* -** Move all unreachable objects (or 'all' objects) that need -** finalization from list 'finobj' to list 'tobefnz' (to be finalized). -** (Note that objects after 'finobjold1' cannot be white, so they -** don't need to be traversed. In incremental mode, 'finobjold1' is NULL, -** so the whole list is traversed.) -*/ -static void separatetobefnz (global_State *g, int all) { - GCObject *curr; - GCObject **p = &g->finobj; - GCObject **lastnext = findlast(&g->tobefnz); - while ((curr = *p) != g->finobjold1) { /* traverse all finalizable objects */ - lua_assert(tofinalize(curr)); - if (!(iswhite(curr) || all)) /* not being collected? */ - p = &curr->next; /* don't bother with it */ - else { - if (curr == g->finobjsur) /* removing 'finobjsur'? */ - g->finobjsur = curr->next; /* correct it */ - *p = curr->next; /* remove 'curr' from 'finobj' list */ - curr->next = *lastnext; /* link at the end of 'tobefnz' list */ - *lastnext = curr; - lastnext = &curr->next; - } - } -} - - -/* -** If pointer 'p' points to 'o', move it to the next element. -*/ -static void checkpointer (GCObject **p, GCObject *o) { - if (o == *p) - *p = o->next; -} - - -/* -** Correct pointers to objects inside 'allgc' list when -** object 'o' is being removed from the list. -*/ -static void correctpointers (global_State *g, GCObject *o) { - checkpointer(&g->survival, o); - checkpointer(&g->old1, o); - checkpointer(&g->reallyold, o); - checkpointer(&g->firstold1, o); -} - - -/* -** if object 'o' has a finalizer, remove it from 'allgc' list (must -** search the list to find it) and link it in 'finobj' list. -*/ -void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt) { - global_State *g = G(L); - if (tofinalize(o) || /* obj. is already marked... */ - gfasttm(g, mt, TM_GC) == NULL || /* or has no finalizer... */ - (g->gcstp & GCSTPCLS)) /* or closing state? */ - return; /* nothing to be done */ - else { /* move 'o' to 'finobj' list */ - GCObject **p; - if (issweepphase(g)) { - makewhite(g, o); /* "sweep" object 'o' */ - if (g->sweepgc == &o->next) /* should not remove 'sweepgc' object */ - g->sweepgc = sweeptolive(L, g->sweepgc); /* change 'sweepgc' */ - } - else - correctpointers(g, o); - /* search for pointer pointing to 'o' */ - for (p = &g->allgc; *p != o; p = &(*p)->next) { /* empty */ } - *p = o->next; /* remove 'o' from 'allgc' list */ - o->next = g->finobj; /* link it in 'finobj' list */ - g->finobj = o; - l_setbit(o->marked, FINALIZEDBIT); /* mark it as such */ - } -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Generational Collector -** ======================================================= -*/ - - -/* -** Set the "time" to wait before starting a new incremental cycle; -** cycle will start when number of objects in use hits the threshold of -** approximately (marked * pause / 100). -*/ -static void setpause (global_State *g) { - l_obj threshold = applygcparam(g, PAUSE, g->marked); - l_obj debt = threshold - gettotalobjs(g); - if (debt < 0) debt = 0; - luaE_setdebt(g, debt); -} - - -/* -** Sweep a list of objects to enter generational mode. Deletes dead -** objects and turns the non dead to old. All non-dead threads---which -** are now old---must be in a gray list. Everything else is not in a -** gray list. Open upvalues are also kept gray. -*/ -static void sweep2old (lua_State *L, GCObject **p) { - GCObject *curr; - global_State *g = G(L); - while ((curr = *p) != NULL) { - if (iswhite(curr)) { /* is 'curr' dead? */ - lua_assert(isdead(g, curr)); - *p = curr->next; /* remove 'curr' from list */ - freeobj(L, curr); /* erase 'curr' */ - } - else { /* all surviving objects become old */ - setage(curr, G_OLD); - if (curr->tt == LUA_VTHREAD) { /* threads must be watched */ - lua_State *th = gco2th(curr); - linkgclist(th, g->grayagain); /* insert into 'grayagain' list */ - } - else if (curr->tt == LUA_VUPVAL && upisopen(gco2upv(curr))) - set2gray(curr); /* open upvalues are always gray */ - else /* everything else is black */ - nw2black(curr); - p = &curr->next; /* go to next element */ - } - } -} - - -/* -** Sweep for generational mode. Delete dead objects. (Because the -** collection is not incremental, there are no "new white" objects -** during the sweep. So, any white object must be dead.) For -** non-dead objects, advance their ages and clear the color of -** new objects. (Old objects keep their colors.) -** The ages of G_TOUCHED1 and G_TOUCHED2 objects cannot be advanced -** here, because these old-generation objects are usually not swept -** here. They will all be advanced in 'correctgraylist'. That function -** will also remove objects turned white here from any gray list. -*/ -static GCObject **sweepgen (lua_State *L, global_State *g, GCObject **p, - GCObject *limit, GCObject **pfirstold1, - l_obj *paddedold) { - static const lu_byte nextage[] = { - G_SURVIVAL, /* from G_NEW */ - G_OLD1, /* from G_SURVIVAL */ - G_OLD1, /* from G_OLD0 */ - G_OLD, /* from G_OLD1 */ - G_OLD, /* from G_OLD (do not change) */ - G_TOUCHED1, /* from G_TOUCHED1 (do not change) */ - G_TOUCHED2 /* from G_TOUCHED2 (do not change) */ - }; - l_obj addedold = 0; - int white = luaC_white(g); - GCObject *curr; - while ((curr = *p) != limit) { - if (iswhite(curr)) { /* is 'curr' dead? */ - lua_assert(!isold(curr) && isdead(g, curr)); - *p = curr->next; /* remove 'curr' from list */ - freeobj(L, curr); /* erase 'curr' */ - } - else { /* correct mark and age */ - int age = getage(curr); - if (age == G_NEW) { /* new objects go back to white */ - int marked = curr->marked & ~maskgcbits; /* erase GC bits */ - curr->marked = cast_byte(marked | G_SURVIVAL | white); - } - else { /* all other objects will be old, and so keep their color */ - lua_assert(age != G_OLD1); /* advanced in 'markold' */ - setage(curr, nextage[age]); - if (getage(curr) == G_OLD1) { - addedold++; /* one more object becoming old */ - if (*pfirstold1 == NULL) - *pfirstold1 = curr; /* first OLD1 object in the list */ - } - } - p = &curr->next; /* go to next element */ - } - } - *paddedold += addedold; - return p; -} - - -/* -** Correct a list of gray objects. Return a pointer to the last element -** left on the list, so that we can link another list to the end of -** this one. -** Because this correction is done after sweeping, young objects might -** be turned white and still be in the list. They are only removed. -** 'TOUCHED1' objects are advanced to 'TOUCHED2' and remain on the list; -** Non-white threads also remain on the list. 'TOUCHED2' objects and -** anything else become regular old, are marked black, and are removed -** from the list. -*/ -static GCObject **correctgraylist (GCObject **p) { - GCObject *curr; - while ((curr = *p) != NULL) { - GCObject **next = getgclist(curr); - if (iswhite(curr)) - goto remove; /* remove all white objects */ - else if (getage(curr) == G_TOUCHED1) { /* touched in this cycle? */ - lua_assert(isgray(curr)); - nw2black(curr); /* make it black, for next barrier */ - setage(curr, G_TOUCHED2); - goto remain; /* keep it in the list and go to next element */ - } - else if (curr->tt == LUA_VTHREAD) { - lua_assert(isgray(curr)); - goto remain; /* keep non-white threads on the list */ - } - else { /* everything else is removed */ - lua_assert(isold(curr)); /* young objects should be white here */ - if (getage(curr) == G_TOUCHED2) /* advance from TOUCHED2... */ - setage(curr, G_OLD); /* ... to OLD */ - nw2black(curr); /* make object black (to be removed) */ - goto remove; - } - remove: *p = *next; continue; - remain: p = next; continue; - } - return p; -} - - -/* -** Correct all gray lists, coalescing them into 'grayagain'. -*/ -static void correctgraylists (global_State *g) { - GCObject **list = correctgraylist(&g->grayagain); - *list = g->weak; g->weak = NULL; - list = correctgraylist(list); - *list = g->allweak; g->allweak = NULL; - list = correctgraylist(list); - *list = g->ephemeron; g->ephemeron = NULL; - correctgraylist(list); -} - - -/* -** Mark black 'OLD1' objects when starting a new young collection. -** Gray objects are already in some gray list, and so will be visited in -** the atomic step. -*/ -static void markold (global_State *g, GCObject *from, GCObject *to) { - GCObject *p; - for (p = from; p != to; p = p->next) { - if (getage(p) == G_OLD1) { - lua_assert(!iswhite(p)); - setage(p, G_OLD); /* now they are old */ - if (isblack(p)) - reallymarkobject(g, p); - } - } -} - - -/* -** Finish a young-generation collection. -*/ -static void finishgencycle (lua_State *L, global_State *g) { - correctgraylists(g); - checkSizes(L, g); - g->gcstate = GCSpropagate; /* skip restart */ - if (!g->gcemergency) - callallpendingfinalizers(L); -} - - -/* -** Shifts from a minor collection to major collections. It starts in -** the "sweep all" state to clear all objects, which are mostly black -** in generational mode. -*/ -static void minor2inc (lua_State *L, global_State *g, int kind) { - g->GCmajorminor = g->marked; /* number of live objects */ - g->gckind = kind; - g->reallyold = g->old1 = g->survival = NULL; - g->finobjrold = g->finobjold1 = g->finobjsur = NULL; - entersweep(L); /* continue as an incremental cycle */ - /* set a debt equal to the step size */ - luaE_setdebt(g, applygcparam(g, STEPSIZE, 100)); -} - - -/* -** Decide whether to shift to major mode. It tests two conditions: -** 1) Whether the number of added old objects in this collection is more -** than half the number of new objects. ('step' is the number of objects -** created between minor collections. Except for forward barriers, it -** is the maximum number of objects that can become old in each minor -** collection.) -** 2) Whether the accumulated number of added old objects is larger -** than 'minormajor'% of the number of lived objects after the last -** major collection. (That percentage is computed in 'limit'.) -*/ -static int checkminormajor (global_State *g, l_obj addedold1) { - l_obj step = applygcparam(g, MINORMUL, g->GCmajorminor); - l_obj limit = applygcparam(g, MINORMAJOR, g->GCmajorminor); - return (addedold1 >= (step >> 1) || g->marked >= limit); -} - -/* -** Does a young collection. First, mark 'OLD1' objects. Then does the -** atomic step. Then, check whether to continue in minor mode. If so, -** sweep all lists and advance pointers. Finally, finish the collection. -*/ -static void youngcollection (lua_State *L, global_State *g) { - l_obj addedold1 = 0; - l_obj marked = g->marked; /* preserve 'g->marked' */ - GCObject **psurvival; /* to point to first non-dead survival object */ - GCObject *dummy; /* dummy out parameter to 'sweepgen' */ - lua_assert(g->gcstate == GCSpropagate); - if (g->firstold1) { /* are there regular OLD1 objects? */ - markold(g, g->firstold1, g->reallyold); /* mark them */ - g->firstold1 = NULL; /* no more OLD1 objects (for now) */ - } - markold(g, g->finobj, g->finobjrold); - markold(g, g->tobefnz, NULL); - - atomic(L); /* will lose 'g->marked' */ - - /* sweep nursery and get a pointer to its last live element */ - g->gcstate = GCSswpallgc; - psurvival = sweepgen(L, g, &g->allgc, g->survival, &g->firstold1, &addedold1); - /* sweep 'survival' */ - sweepgen(L, g, psurvival, g->old1, &g->firstold1, &addedold1); - g->reallyold = g->old1; - g->old1 = *psurvival; /* 'survival' survivals are old now */ - g->survival = g->allgc; /* all news are survivals */ - - /* repeat for 'finobj' lists */ - dummy = NULL; /* no 'firstold1' optimization for 'finobj' lists */ - psurvival = sweepgen(L, g, &g->finobj, g->finobjsur, &dummy, &addedold1); - /* sweep 'survival' */ - sweepgen(L, g, psurvival, g->finobjold1, &dummy, &addedold1); - g->finobjrold = g->finobjold1; - g->finobjold1 = *psurvival; /* 'survival' survivals are old now */ - g->finobjsur = g->finobj; /* all news are survivals */ - - sweepgen(L, g, &g->tobefnz, NULL, &dummy, &addedold1); - - /* keep total number of added old1 objects */ - g->marked = marked + addedold1; - - /* decide whether to shift to major mode */ - if (checkminormajor(g, addedold1)) { - minor2inc(L, g, KGC_GENMAJOR); /* go to major mode */ - g->marked = 0; /* avoid pause in first major cycle */ - } - else - finishgencycle(L, g); /* still in minor mode; finish it */ -} - - -/* -** Clears all gray lists, sweeps objects, and prepare sublists to enter -** generational mode. The sweeps remove dead objects and turn all -** surviving objects to old. Threads go back to 'grayagain'; everything -** else is turned black (not in any gray list). -*/ -static void atomic2gen (lua_State *L, global_State *g) { - cleargraylists(g); - /* sweep all elements making them old */ - g->gcstate = GCSswpallgc; - sweep2old(L, &g->allgc); - /* everything alive now is old */ - g->reallyold = g->old1 = g->survival = g->allgc; - g->firstold1 = NULL; /* there are no OLD1 objects anywhere */ - - /* repeat for 'finobj' lists */ - sweep2old(L, &g->finobj); - g->finobjrold = g->finobjold1 = g->finobjsur = g->finobj; - - sweep2old(L, &g->tobefnz); - - g->gckind = KGC_GENMINOR; - g->GCmajorminor = g->marked; /* "base" for number of objects */ - g->marked = 0; /* to count the number of added old1 objects */ - finishgencycle(L, g); -} - - -/* -** Set debt for the next minor collection, which will happen when -** total number of objects grows 'genminormul'%. -*/ -static void setminordebt (global_State *g) { - luaE_setdebt(g, applygcparam(g, MINORMUL, g->GCmajorminor)); -} - - -/* -** Enter generational mode. Must go until the end of an atomic cycle -** to ensure that all objects are correctly marked and weak tables -** are cleared. Then, turn all objects into old and finishes the -** collection. -*/ -static void entergen (lua_State *L, global_State *g) { - luaC_runtilstate(L, GCSpause, 1); /* prepare to start a new cycle */ - luaC_runtilstate(L, GCSpropagate, 1); /* start new cycle */ - atomic(L); /* propagates all and then do the atomic stuff */ - atomic2gen(L, g); - setminordebt(g); /* set debt assuming next cycle will be minor */ -} - - -/* -** Change collector mode to 'newmode'. -*/ -void luaC_changemode (lua_State *L, int newmode) { - global_State *g = G(L); - if (g->gckind == KGC_GENMAJOR) /* doing major collections? */ - g->gckind = KGC_INC; /* already incremental but in name */ - if (newmode != g->gckind) { /* does it need to change? */ - if (newmode == KGC_INC) /* entering incremental mode? */ - minor2inc(L, g, KGC_INC); /* entering incremental mode */ - else { - lua_assert(newmode == KGC_GENMINOR); - entergen(L, g); - } - } -} - - -/* -** Does a full collection in generational mode. -*/ -static void fullgen (lua_State *L, global_State *g) { - minor2inc(L, g, KGC_INC); - entergen(L, g); -} - - -/* -** After an atomic incremental step from a major collection, -** check whether collector could return to minor collections. -** It checks whether the number of objects 'tobecollected' -** is greater than 'majorminor'% of the number of objects added -** since the last collection ('addedobjs'). -*/ -static int checkmajorminor (lua_State *L, global_State *g) { - if (g->gckind == KGC_GENMAJOR) { /* generational mode? */ - l_obj numobjs = gettotalobjs(g); - l_obj addedobjs = numobjs - g->GCmajorminor; - l_obj limit = applygcparam(g, MAJORMINOR, addedobjs); - l_obj tobecollected = numobjs - g->marked; - if (tobecollected > limit) { - atomic2gen(L, g); /* return to generational mode */ - setminordebt(g); - return 0; /* exit incremental collection */ - } - } - g->GCmajorminor = g->marked; /* prepare for next collection */ - return 1; /* stay doing incremental collections */ -} - -/* }====================================================== */ - - -/* -** {====================================================== -** GC control -** ======================================================= -*/ - - -/* -** Enter first sweep phase. -** The call to 'sweeptolive' makes the pointer point to an object -** inside the list (instead of to the header), so that the real sweep do -** not need to skip objects created between "now" and the start of the -** real sweep. -*/ -static void entersweep (lua_State *L) { - global_State *g = G(L); - g->gcstate = GCSswpallgc; - lua_assert(g->sweepgc == NULL); - g->sweepgc = sweeptolive(L, &g->allgc); -} - - -/* -** Delete all objects in list 'p' until (but not including) object -** 'limit'. -*/ -static void deletelist (lua_State *L, GCObject *p, GCObject *limit) { - while (p != limit) { - GCObject *next = p->next; - freeobj(L, p); - p = next; - } -} - - -/* -** Call all finalizers of the objects in the given Lua state, and -** then free all objects, except for the main thread. -*/ -void luaC_freeallobjects (lua_State *L) { - global_State *g = G(L); - g->gcstp = GCSTPCLS; /* no extra finalizers after here */ - luaC_changemode(L, KGC_INC); - separatetobefnz(g, 1); /* separate all objects with finalizers */ - lua_assert(g->finobj == NULL); - callallpendingfinalizers(L); - deletelist(L, g->allgc, obj2gco(g->mainthread)); - lua_assert(g->finobj == NULL); /* no new finalizers */ - deletelist(L, g->fixedgc, NULL); /* collect fixed objects */ - lua_assert(g->strt.nuse == 0); -} - - -static l_obj atomic (lua_State *L) { - l_obj work = 0; - global_State *g = G(L); - GCObject *origweak, *origall; - GCObject *grayagain = g->grayagain; /* save original list */ - g->grayagain = NULL; - lua_assert(g->ephemeron == NULL && g->weak == NULL); - lua_assert(!iswhite(g->mainthread)); - g->gcstate = GCSatomic; - markobject(g, L); /* mark running thread */ - /* registry and global metatables may be changed by API */ - markvalue(g, &g->l_registry); - markmt(g); /* mark global metatables */ - work += propagateall(g); /* empties 'gray' list */ - /* remark occasional upvalues of (maybe) dead threads */ - work += remarkupvals(g); - work += propagateall(g); /* propagate changes */ - g->gray = grayagain; - work += propagateall(g); /* traverse 'grayagain' list */ - work += convergeephemerons(g); - /* at this point, all strongly accessible objects are marked. */ - /* Clear values from weak tables, before checking finalizers */ - work += clearbyvalues(g, g->weak, NULL); - work += clearbyvalues(g, g->allweak, NULL); - origweak = g->weak; origall = g->allweak; - separatetobefnz(g, 0); /* separate objects to be finalized */ - work += markbeingfnz(g); /* mark objects that will be finalized */ - work += propagateall(g); /* remark, to propagate 'resurrection' */ - work += convergeephemerons(g); - /* at this point, all resurrected objects are marked. */ - /* remove dead objects from weak tables */ - work += clearbykeys(g, g->ephemeron); /* clear keys from all ephemeron */ - work += clearbykeys(g, g->allweak); /* clear keys from all 'allweak' */ - /* clear values from resurrected weak tables */ - work += clearbyvalues(g, g->weak, origweak); - work += clearbyvalues(g, g->allweak, origall); - luaS_clearcache(g); - g->currentwhite = cast_byte(otherwhite(g)); /* flip current white */ - lua_assert(g->gray == NULL); - return work; -} - - -/* -** Do a sweep step. The normal case (not fast) sweeps at most GCSWEEPMAX -** elements. The fast case sweeps the whole list. -*/ -static void sweepstep (lua_State *L, global_State *g, - int nextstate, GCObject **nextlist, int fast) { - if (g->sweepgc) - g->sweepgc = sweeplist(L, g->sweepgc, fast ? MAX_LOBJ : GCSWEEPMAX); - else { /* enter next state */ - g->gcstate = nextstate; - g->sweepgc = nextlist; - } -} - - -/* -** Performs one incremental "step" in an incremental garbage collection. -** For indivisible work, a step goes to the next state. When marking -** (propagating), a step traverses one object. When sweeping, a step -** sweeps GCSWEEPMAX objects, to avoid a big overhead for sweeping -** objects one by one. (Sweeping is inexpensive, no matter the -** object.) When 'fast' is true, 'singlestep' tries to finish a state -** "as fast as possible". In particular, it skips the propagation -** phase and leaves all objects to be traversed by the atomic phase: -** That avoids traversing twice some objects, such as theads and -** weak tables. -*/ -static l_obj singlestep (lua_State *L, int fast) { - global_State *g = G(L); - l_obj work; - lua_assert(!g->gcstopem); /* collector is not reentrant */ - g->gcstopem = 1; /* no emergency collections while collecting */ - switch (g->gcstate) { - case GCSpause: { - restartcollection(g); - g->gcstate = GCSpropagate; - work = 1; - break; - } - case GCSpropagate: { - if (fast || g->gray == NULL) { - g->gcstate = GCSenteratomic; /* finish propagate phase */ - work = 0; - } - else { - propagatemark(g); /* traverse one gray object */ - work = 1; - } - break; - } - case GCSenteratomic: { - work = atomic(L); - if (checkmajorminor(L, g)) - entersweep(L); - break; - } - case GCSswpallgc: { /* sweep "regular" objects */ - sweepstep(L, g, GCSswpfinobj, &g->finobj, fast); - work = GCSWEEPMAX; - break; - } - case GCSswpfinobj: { /* sweep objects with finalizers */ - sweepstep(L, g, GCSswptobefnz, &g->tobefnz, fast); - work = GCSWEEPMAX; - break; - } - case GCSswptobefnz: { /* sweep objects to be finalized */ - sweepstep(L, g, GCSswpend, NULL, fast); - work = GCSWEEPMAX; - break; - } - case GCSswpend: { /* finish sweeps */ - checkSizes(L, g); - g->gcstate = GCScallfin; - work = 0; - break; - } - case GCScallfin: { /* call finalizers */ - if (g->tobefnz && !g->gcemergency) { - g->gcstopem = 0; /* ok collections during finalizers */ - GCTM(L); /* call one finalizer */ - work = 1; - } - else { /* emergency mode or no more finalizers */ - g->gcstate = GCSpause; /* finish collection */ - work = 0; - } - break; - } - default: lua_assert(0); return 0; - } - g->gcstopem = 0; - return work; -} - - -/* -** Advances the garbage collector until it reaches the given state. -** (The option 'fast' is only for testing; in normal code, 'fast' -** here is always true.) -*/ -void luaC_runtilstate (lua_State *L, int state, int fast) { - global_State *g = G(L); - lua_assert(g->gckind == KGC_INC); - while (state != g->gcstate) - singlestep(L, fast); -} - - - -/* -** Performs a basic incremental step. The debt and step size are -** converted from bytes to "units of work"; then the function loops -** running single steps until adding that many units of work or -** finishing a cycle (pause state). Finally, it sets the debt that -** controls when next step will be performed. -*/ -static void incstep (lua_State *L, global_State *g) { - l_obj stepsize = applygcparam(g, STEPSIZE, 100); - l_obj work2do = applygcparam(g, STEPMUL, stepsize); - int fast = 0; - if (work2do == 0) { /* special case: do a full collection */ - work2do = MAX_LOBJ; /* do unlimited work */ - fast = 1; - } - do { /* repeat until pause or enough work */ - l_obj work = singlestep(L, fast); /* perform one single step */ - if (g->gckind == KGC_GENMINOR) /* returned to minor collections? */ - return; /* nothing else to be done here */ - work2do -= work; - } while (work2do > 0 && g->gcstate != GCSpause); - if (g->gcstate == GCSpause) - setpause(g); /* pause until next cycle */ - else - luaE_setdebt(g, stepsize); -} - -/* -** Performs a basic GC step if collector is running. (If collector is -** not running, set a reasonable debt to avoid it being called at -** every single check.) -*/ -void luaC_step (lua_State *L) { - global_State *g = G(L); - lua_assert(!g->gcemergency); - if (!gcrunning(g)) /* not running? */ - luaE_setdebt(g, 2000); - else { - switch (g->gckind) { - case KGC_INC: case KGC_GENMAJOR: - incstep(L, g); - break; - case KGC_GENMINOR: - youngcollection(L, g); - setminordebt(g); - break; - } - } -} - - -/* -** Perform a full collection in incremental mode. -** Before running the collection, check 'keepinvariant'; if it is true, -** there may be some objects marked as black, so the collector has -** to sweep all objects to turn them back to white (as white has not -** changed, nothing will be collected). -*/ -static void fullinc (lua_State *L, global_State *g) { - if (keepinvariant(g)) /* black objects? */ - entersweep(L); /* sweep everything to turn them back to white */ - /* finish any pending sweep phase to start a new cycle */ - luaC_runtilstate(L, GCSpause, 1); - luaC_runtilstate(L, GCScallfin, 1); /* run up to finalizers */ - /* 'marked' must be correct after a full GC cycle */ - lua_assert(g->marked == gettotalobjs(g)); - luaC_runtilstate(L, GCSpause, 1); /* finish collection */ - setpause(g); -} - - -/* -** Performs a full GC cycle; if 'isemergency', set a flag to avoid -** some operations which could change the interpreter state in some -** unexpected ways (running finalizers and shrinking some structures). -*/ -void luaC_fullgc (lua_State *L, int isemergency) { - global_State *g = G(L); - lua_assert(!g->gcemergency); - g->gcemergency = isemergency; /* set flag */ - switch (g->gckind) { - case KGC_GENMINOR: fullgen(L, g); break; - case KGC_INC: fullinc(L, g); break; - case KGC_GENMAJOR: - g->gckind = KGC_INC; - fullinc(L, g); - g->gckind = KGC_GENMAJOR; - break; - } - g->gcemergency = 0; -} - -/* }====================================================== */ - - - - -/* -** $Id: llex.c $ -** Lexical Analyzer -** See Copyright Notice in lua.h -*/ - -#define llex_c -#define LUA_CORE - - - -#include -#include - - - -/* -** $Id: lparser.h $ -** Lua Parser -** See Copyright Notice in lua.h -*/ - -#ifndef lparser_h -#define lparser_h - - - -/* -** Expression and variable descriptor. -** Code generation for variables and expressions can be delayed to allow -** optimizations; An 'expdesc' structure describes a potentially-delayed -** variable/expression. It has a description of its "main" value plus a -** list of conditional jumps that can also produce its value (generated -** by short-circuit operators 'and'/'or'). -*/ - -/* kinds of variables/expressions */ -typedef enum { - VVOID, /* when 'expdesc' describes the last expression of a list, - this kind means an empty list (so, no expression) */ - VNIL, /* constant nil */ - VTRUE, /* constant true */ - VFALSE, /* constant false */ - VK, /* constant in 'k'; info = index of constant in 'k' */ - VKFLT, /* floating constant; nval = numerical float value */ - VKINT, /* integer constant; ival = numerical integer value */ - VKSTR, /* string constant; strval = TString address; - (string is fixed by the lexer) */ - VNONRELOC, /* expression has its value in a fixed register; - info = result register */ - VLOCAL, /* local variable; var.ridx = register index; - var.vidx = relative index in 'actvar.arr' */ - VUPVAL, /* upvalue variable; info = index of upvalue in 'upvalues' */ - VCONST, /* compile-time variable; - info = absolute index in 'actvar.arr' */ - VINDEXED, /* indexed variable; - ind.t = table register; - ind.idx = key's R index */ - VINDEXUP, /* indexed upvalue; - ind.t = table upvalue; - ind.idx = key's K index */ - VINDEXI, /* indexed variable with constant integer; - ind.t = table register; - ind.idx = key's value */ - VINDEXSTR, /* indexed variable with literal string; - ind.t = table register; - ind.idx = key's K index */ - VJMP, /* expression is a test/comparison; - info = pc of corresponding jump instruction */ - VRELOC, /* expression can put result in any register; - info = instruction pc */ - VCALL, /* expression is a function call; info = instruction pc */ - VVARARG /* vararg expression; info = instruction pc */ -} expkind; - - -#define vkisvar(k) (VLOCAL <= (k) && (k) <= VINDEXSTR) -#define vkisindexed(k) (VINDEXED <= (k) && (k) <= VINDEXSTR) - - -typedef struct expdesc { - expkind k; - union { - lua_Integer ival; /* for VKINT */ - lua_Number nval; /* for VKFLT */ - TString *strval; /* for VKSTR */ - int info; /* for generic use */ - struct { /* for indexed variables */ - short idx; /* index (R or "long" K) */ - lu_byte t; /* table (register or upvalue) */ - } ind; - struct { /* for local variables */ - lu_byte ridx; /* register holding the variable */ - unsigned short vidx; /* compiler index (in 'actvar.arr') */ - } var; - } u; - int t; /* patch list of 'exit when true' */ - int f; /* patch list of 'exit when false' */ -} expdesc; - - -/* kinds of variables */ -#define VDKREG 0 /* regular */ -#define RDKCONST 1 /* constant */ -#define RDKTOCLOSE 2 /* to-be-closed */ -#define RDKCTC 3 /* compile-time constant */ - -/* description of an active local variable */ -typedef union Vardesc { - struct { - TValuefields; /* constant value (if it is a compile-time constant) */ - lu_byte kind; - lu_byte ridx; /* register holding the variable */ - short pidx; /* index of the variable in the Proto's 'locvars' array */ - TString *name; /* variable name */ - } vd; - TValue k; /* constant value (if any) */ -} Vardesc; - - - -/* description of pending goto statements and label statements */ -typedef struct Labeldesc { - TString *name; /* label identifier */ - int pc; /* position in code */ - int line; /* line where it appeared */ - lu_byte nactvar; /* number of active variables in that position */ - lu_byte close; /* goto that escapes upvalues */ -} Labeldesc; - - -/* list of labels or gotos */ -typedef struct Labellist { - Labeldesc *arr; /* array */ - int n; /* number of entries in use */ - int size; /* array size */ -} Labellist; - - -/* dynamic structures used by the parser */ -typedef struct Dyndata { - struct { /* list of all active local variables */ - Vardesc *arr; - int n; - int size; - } actvar; - Labellist gt; /* list of pending gotos */ - Labellist label; /* list of active labels */ -} Dyndata; - - -/* control of blocks */ -struct BlockCnt; /* defined in lparser.c */ - - -/* state needed to generate code for a given function */ -typedef struct FuncState { - Proto *f; /* current function header */ - struct FuncState *prev; /* enclosing function */ - struct LexState *ls; /* lexical state */ - struct BlockCnt *bl; /* chain of current blocks */ - int pc; /* next position to code (equivalent to 'ncode') */ - int lasttarget; /* 'label' of last 'jump label' */ - int previousline; /* last line that was saved in 'lineinfo' */ - int nk; /* number of elements in 'k' */ - int np; /* number of elements in 'p' */ - int nabslineinfo; /* number of elements in 'abslineinfo' */ - int firstlocal; /* index of first local var (in Dyndata array) */ - int firstlabel; /* index of first label (in 'dyd->label->arr') */ - short ndebugvars; /* number of elements in 'f->locvars' */ - lu_byte nactvar; /* number of active local variables */ - lu_byte nups; /* number of upvalues */ - lu_byte freereg; /* first free register */ - lu_byte iwthabs; /* instructions issued since last absolute line info */ - lu_byte needclose; /* function needs to close upvalues when returning */ -} FuncState; - - -LUAI_FUNC int luaY_nvarstack (FuncState *fs); -LUAI_FUNC LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, - Dyndata *dyd, const char *name, int firstchar); - - -#endif - - - - -#define next(ls) (ls->current = zgetc(ls->z)) - - - -#define currIsNewline(ls) (ls->current == '\n' || ls->current == '\r') - - -/* ORDER RESERVED */ -static const char *const luaX_tokens [] = { - "and", "break", "do", "else", "elseif", - "end", "false", "for", "function", "goto", "if", - "in", "local", "nil", "not", "or", "repeat", - "return", "then", "true", "until", "while", - "//", "..", "...", "==", ">=", "<=", "~=", - "<<", ">>", "::", "", - "", "", "", "" -}; - - -#define save_and_next(ls) (save(ls, ls->current), next(ls)) - - -static l_noret lexerror (LexState *ls, const char *msg, int token); - - -static void save (LexState *ls, int c) { - Mbuffer *b = ls->buff; - if (luaZ_bufflen(b) + 1 > luaZ_sizebuffer(b)) { - size_t newsize; - if (luaZ_sizebuffer(b) >= MAX_SIZE/2) - lexerror(ls, "lexical element too long", 0); - newsize = luaZ_sizebuffer(b) * 2; - luaZ_resizebuffer(ls->L, b, newsize); - } - b->buffer[luaZ_bufflen(b)++] = cast_char(c); -} - - -void luaX_init (lua_State *L) { - int i; - TString *e = luaS_newliteral(L, LUA_ENV); /* create env name */ - luaC_fix(L, obj2gco(e)); /* never collect this name */ - for (i=0; iextra = cast_byte(i+1); /* reserved word */ - } -} - - -const char *luaX_token2str (LexState *ls, int token) { - if (token < FIRST_RESERVED) { /* single-byte symbols? */ - if (lisprint(token)) - return luaO_pushfstring(ls->L, "'%c'", token); - else /* control character */ - return luaO_pushfstring(ls->L, "'<\\%d>'", token); - } - else { - const char *s = luaX_tokens[token - FIRST_RESERVED]; - if (token < TK_EOS) /* fixed format (symbols and reserved words)? */ - return luaO_pushfstring(ls->L, "'%s'", s); - else /* names, strings, and numerals */ - return s; - } -} - - -static const char *txtToken (LexState *ls, int token) { - switch (token) { - case TK_NAME: case TK_STRING: - case TK_FLT: case TK_INT: - save(ls, '\0'); - return luaO_pushfstring(ls->L, "'%s'", luaZ_buffer(ls->buff)); - default: - return luaX_token2str(ls, token); - } -} - - -static l_noret lexerror (LexState *ls, const char *msg, int token) { - msg = luaG_addinfo(ls->L, msg, ls->source, ls->linenumber); - if (token) - luaO_pushfstring(ls->L, "%s near %s", msg, txtToken(ls, token)); - luaD_throw(ls->L, LUA_ERRSYNTAX); -} - - -l_noret luaX_syntaxerror (LexState *ls, const char *msg) { - lexerror(ls, msg, ls->t.token); -} - - -/* -** Creates a new string and anchors it in scanner's table so that it -** will not be collected until the end of the compilation; by that time -** it should be anchored somewhere. It also internalizes long strings, -** ensuring there is only one copy of each unique string. The table -** here is used as a set: the string enters as the key, while its value -** is irrelevant. We use the string itself as the value only because it -** is a TValue readily available. Later, the code generation can change -** this value. -*/ -TString *luaX_newstring (LexState *ls, const char *str, size_t l) { - lua_State *L = ls->L; - TString *ts = luaS_newlstr(L, str, l); /* create new string */ - TString *oldts = luaH_getstrkey(ls->h, ts); - if (oldts != NULL) /* string already present? */ - return oldts; /* use it */ - else { /* create a new entry */ - TValue *stv = s2v(L->top.p++); /* reserve stack space for string */ - setsvalue(L, stv, ts); /* temporarily anchor the string */ - luaH_set(L, ls->h, stv, stv); /* t[string] = string */ - /* table is not a metatable, so it does not need to invalidate cache */ - luaC_checkGC(L); - L->top.p--; /* remove string from stack */ - } - return ts; -} - - -/* -** increment line number and skips newline sequence (any of -** \n, \r, \n\r, or \r\n) -*/ -static void inclinenumber (LexState *ls) { - int old = ls->current; - lua_assert(currIsNewline(ls)); - next(ls); /* skip '\n' or '\r' */ - if (currIsNewline(ls) && ls->current != old) - next(ls); /* skip '\n\r' or '\r\n' */ - if (++ls->linenumber >= MAX_INT) - lexerror(ls, "chunk has too many lines", 0); -} - - -void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source, - int firstchar) { - ls->t.token = 0; - ls->L = L; - ls->current = firstchar; - ls->lookahead.token = TK_EOS; /* no look-ahead token */ - ls->z = z; - ls->fs = NULL; - ls->linenumber = 1; - ls->lastline = 1; - ls->source = source; - ls->envn = luaS_newliteral(L, LUA_ENV); /* get env name */ - luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER); /* initialize buffer */ -} - - - -/* -** ======================================================= -** LEXICAL ANALYZER -** ======================================================= -*/ - - -static int check_next1 (LexState *ls, int c) { - if (ls->current == c) { - next(ls); - return 1; - } - else return 0; -} - - -/* -** Check whether current char is in set 'set' (with two chars) and -** saves it -*/ -static int check_next2 (LexState *ls, const char *set) { - lua_assert(set[2] == '\0'); - if (ls->current == set[0] || ls->current == set[1]) { - save_and_next(ls); - return 1; - } - else return 0; -} - - -/* LUA_NUMBER */ -/* -** This function is quite liberal in what it accepts, as 'luaO_str2num' -** will reject ill-formed numerals. Roughly, it accepts the following -** pattern: -** -** %d(%x|%.|([Ee][+-]?))* | 0[Xx](%x|%.|([Pp][+-]?))* -** -** The only tricky part is to accept [+-] only after a valid exponent -** mark, to avoid reading '3-4' or '0xe+1' as a single number. -** -** The caller might have already read an initial dot. -*/ -static int read_numeral (LexState *ls, SemInfo *seminfo) { - TValue obj; - const char *expo = "Ee"; - int first = ls->current; - lua_assert(lisdigit(ls->current)); - save_and_next(ls); - if (first == '0' && check_next2(ls, "xX")) /* hexadecimal? */ - expo = "Pp"; - for (;;) { - if (check_next2(ls, expo)) /* exponent mark? */ - check_next2(ls, "-+"); /* optional exponent sign */ - else if (lisxdigit(ls->current) || ls->current == '.') /* '%x|%.' */ - save_and_next(ls); - else break; - } - if (lislalpha(ls->current)) /* is numeral touching a letter? */ - save_and_next(ls); /* force an error */ - save(ls, '\0'); - if (luaO_str2num(luaZ_buffer(ls->buff), &obj) == 0) /* format error? */ - lexerror(ls, "malformed number", TK_FLT); - if (ttisinteger(&obj)) { - seminfo->i = ivalue(&obj); - return TK_INT; - } - else { - lua_assert(ttisfloat(&obj)); - seminfo->r = fltvalue(&obj); - return TK_FLT; - } -} - - -/* -** read a sequence '[=*[' or ']=*]', leaving the last bracket. If -** sequence is well formed, return its number of '='s + 2; otherwise, -** return 1 if it is a single bracket (no '='s and no 2nd bracket); -** otherwise (an unfinished '[==...') return 0. -*/ -static size_t skip_sep (LexState *ls) { - size_t count = 0; - int s = ls->current; - lua_assert(s == '[' || s == ']'); - save_and_next(ls); - while (ls->current == '=') { - save_and_next(ls); - count++; - } - return (ls->current == s) ? count + 2 - : (count == 0) ? 1 - : 0; -} - - -static void read_long_string (LexState *ls, SemInfo *seminfo, size_t sep) { - int line = ls->linenumber; /* initial line (for error message) */ - save_and_next(ls); /* skip 2nd '[' */ - if (currIsNewline(ls)) /* string starts with a newline? */ - inclinenumber(ls); /* skip it */ - for (;;) { - switch (ls->current) { - case EOZ: { /* error */ - const char *what = (seminfo ? "string" : "comment"); - const char *msg = luaO_pushfstring(ls->L, - "unfinished long %s (starting at line %d)", what, line); - lexerror(ls, msg, TK_EOS); - break; /* to avoid warnings */ - } - case ']': { - if (skip_sep(ls) == sep) { - save_and_next(ls); /* skip 2nd ']' */ - goto endloop; - } - break; - } - case '\n': case '\r': { - save(ls, '\n'); - inclinenumber(ls); - if (!seminfo) luaZ_resetbuffer(ls->buff); /* avoid wasting space */ - break; - } - default: { - if (seminfo) save_and_next(ls); - else next(ls); - } - } - } endloop: - if (seminfo) - seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + sep, - luaZ_bufflen(ls->buff) - 2 * sep); -} - - -static void esccheck (LexState *ls, int c, const char *msg) { - if (!c) { - if (ls->current != EOZ) - save_and_next(ls); /* add current to buffer for error message */ - lexerror(ls, msg, TK_STRING); - } -} - - -static int gethexa (LexState *ls) { - save_and_next(ls); - esccheck (ls, lisxdigit(ls->current), "hexadecimal digit expected"); - return luaO_hexavalue(ls->current); -} - - -static int readhexaesc (LexState *ls) { - int r = gethexa(ls); - r = (r << 4) + gethexa(ls); - luaZ_buffremove(ls->buff, 2); /* remove saved chars from buffer */ - return r; -} - - -static unsigned long readutf8esc (LexState *ls) { - unsigned long r; - int i = 4; /* chars to be removed: '\', 'u', '{', and first digit */ - save_and_next(ls); /* skip 'u' */ - esccheck(ls, ls->current == '{', "missing '{'"); - r = gethexa(ls); /* must have at least one digit */ - while (cast_void(save_and_next(ls)), lisxdigit(ls->current)) { - i++; - esccheck(ls, r <= (0x7FFFFFFFu >> 4), "UTF-8 value too large"); - r = (r << 4) + luaO_hexavalue(ls->current); - } - esccheck(ls, ls->current == '}', "missing '}'"); - next(ls); /* skip '}' */ - luaZ_buffremove(ls->buff, i); /* remove saved chars from buffer */ - return r; -} - - -static void utf8esc (LexState *ls) { - char buff[UTF8BUFFSZ]; - int n = luaO_utf8esc(buff, readutf8esc(ls)); - for (; n > 0; n--) /* add 'buff' to string */ - save(ls, buff[UTF8BUFFSZ - n]); -} - - -static int readdecesc (LexState *ls) { - int i; - int r = 0; /* result accumulator */ - for (i = 0; i < 3 && lisdigit(ls->current); i++) { /* read up to 3 digits */ - r = 10*r + ls->current - '0'; - save_and_next(ls); - } - esccheck(ls, r <= UCHAR_MAX, "decimal escape too large"); - luaZ_buffremove(ls->buff, i); /* remove read digits from buffer */ - return r; -} - - -static void read_string (LexState *ls, int del, SemInfo *seminfo) { - save_and_next(ls); /* keep delimiter (for error messages) */ - while (ls->current != del) { - switch (ls->current) { - case EOZ: - lexerror(ls, "unfinished string", TK_EOS); - break; /* to avoid warnings */ - case '\n': - case '\r': - lexerror(ls, "unfinished string", TK_STRING); - break; /* to avoid warnings */ - case '\\': { /* escape sequences */ - int c; /* final character to be saved */ - save_and_next(ls); /* keep '\\' for error messages */ - switch (ls->current) { - case 'a': c = '\a'; goto read_save; - case 'b': c = '\b'; goto read_save; - case 'f': c = '\f'; goto read_save; - case 'n': c = '\n'; goto read_save; - case 'r': c = '\r'; goto read_save; - case 't': c = '\t'; goto read_save; - case 'v': c = '\v'; goto read_save; - case 'x': c = readhexaesc(ls); goto read_save; - case 'u': utf8esc(ls); goto no_save; - case '\n': case '\r': - inclinenumber(ls); c = '\n'; goto only_save; - case '\\': case '\"': case '\'': - c = ls->current; goto read_save; - case EOZ: goto no_save; /* will raise an error next loop */ - case 'z': { /* zap following span of spaces */ - luaZ_buffremove(ls->buff, 1); /* remove '\\' */ - next(ls); /* skip the 'z' */ - while (lisspace(ls->current)) { - if (currIsNewline(ls)) inclinenumber(ls); - else next(ls); - } - goto no_save; - } - default: { - esccheck(ls, lisdigit(ls->current), "invalid escape sequence"); - c = readdecesc(ls); /* digital escape '\ddd' */ - goto only_save; - } - } - read_save: - next(ls); - /* go through */ - only_save: - luaZ_buffremove(ls->buff, 1); /* remove '\\' */ - save(ls, c); - /* go through */ - no_save: break; - } - default: - save_and_next(ls); - } - } - save_and_next(ls); /* skip delimiter */ - seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1, - luaZ_bufflen(ls->buff) - 2); -} - - -static int llex (LexState *ls, SemInfo *seminfo) { - luaZ_resetbuffer(ls->buff); - for (;;) { - switch (ls->current) { - case '\n': case '\r': { /* line breaks */ - inclinenumber(ls); - break; - } - case ' ': case '\f': case '\t': case '\v': { /* spaces */ - next(ls); - break; - } - case '-': { /* '-' or '--' (comment) */ - next(ls); - if (ls->current != '-') return '-'; - /* else is a comment */ - next(ls); - if (ls->current == '[') { /* long comment? */ - size_t sep = skip_sep(ls); - luaZ_resetbuffer(ls->buff); /* 'skip_sep' may dirty the buffer */ - if (sep >= 2) { - read_long_string(ls, NULL, sep); /* skip long comment */ - luaZ_resetbuffer(ls->buff); /* previous call may dirty the buff. */ - break; - } - } - /* else short comment */ - while (!currIsNewline(ls) && ls->current != EOZ) - next(ls); /* skip until end of line (or end of file) */ - break; - } - case '[': { /* long string or simply '[' */ - size_t sep = skip_sep(ls); - if (sep >= 2) { - read_long_string(ls, seminfo, sep); - return TK_STRING; - } - else if (sep == 0) /* '[=...' missing second bracket? */ - lexerror(ls, "invalid long string delimiter", TK_STRING); - return '['; - } - case '=': { - next(ls); - if (check_next1(ls, '=')) return TK_EQ; /* '==' */ - else return '='; - } - case '<': { - next(ls); - if (check_next1(ls, '=')) return TK_LE; /* '<=' */ - else if (check_next1(ls, '<')) return TK_SHL; /* '<<' */ - else return '<'; - } - case '>': { - next(ls); - if (check_next1(ls, '=')) return TK_GE; /* '>=' */ - else if (check_next1(ls, '>')) return TK_SHR; /* '>>' */ - else return '>'; - } - case '/': { - next(ls); - if (check_next1(ls, '/')) return TK_IDIV; /* '//' */ - else return '/'; - } - case '~': { - next(ls); - if (check_next1(ls, '=')) return TK_NE; /* '~=' */ - else return '~'; - } - case ':': { - next(ls); - if (check_next1(ls, ':')) return TK_DBCOLON; /* '::' */ - else return ':'; - } - case '"': case '\'': { /* short literal strings */ - read_string(ls, ls->current, seminfo); - return TK_STRING; - } - case '.': { /* '.', '..', '...', or number */ - save_and_next(ls); - if (check_next1(ls, '.')) { - if (check_next1(ls, '.')) - return TK_DOTS; /* '...' */ - else return TK_CONCAT; /* '..' */ - } - else if (!lisdigit(ls->current)) return '.'; - else return read_numeral(ls, seminfo); - } - case '0': case '1': case '2': case '3': case '4': - case '5': case '6': case '7': case '8': case '9': { - return read_numeral(ls, seminfo); - } - case EOZ: { - return TK_EOS; - } - default: { - if (lislalpha(ls->current)) { /* identifier or reserved word? */ - TString *ts; - do { - save_and_next(ls); - } while (lislalnum(ls->current)); - ts = luaX_newstring(ls, luaZ_buffer(ls->buff), - luaZ_bufflen(ls->buff)); - seminfo->ts = ts; - if (isreserved(ts)) /* reserved word? */ - return ts->extra - 1 + FIRST_RESERVED; - else { - return TK_NAME; - } - } - else { /* single-char tokens ('+', '*', '%', '{', '}', ...) */ - int c = ls->current; - next(ls); - return c; - } - } - } - } -} - - -void luaX_next (LexState *ls) { - ls->lastline = ls->linenumber; - if (ls->lookahead.token != TK_EOS) { /* is there a look-ahead token? */ - ls->t = ls->lookahead; /* use this one */ - ls->lookahead.token = TK_EOS; /* and discharge it */ - } - else - ls->t.token = llex(ls, &ls->t.seminfo); /* read next token */ -} - - -int luaX_lookahead (LexState *ls) { - lua_assert(ls->lookahead.token == TK_EOS); - ls->lookahead.token = llex(ls, &ls->lookahead.seminfo); - return ls->lookahead.token; -} - - - -/* -** $Id: lcode.c $ -** Code generator for Lua -** See Copyright Notice in lua.h -*/ - -#define lcode_c -#define LUA_CORE - - - -#include -#include -#include -#include - - - -/* -** $Id: lcode.h $ -** Code generator for Lua -** See Copyright Notice in lua.h -*/ - -#ifndef lcode_h -#define lcode_h - - - -/* -** Marks the end of a patch list. It is an invalid value both as an absolute -** address, and as a list link (would link an element to itself). -*/ -#define NO_JUMP (-1) - - -/* -** grep "ORDER OPR" if you change these enums (ORDER OP) -*/ -typedef enum BinOpr { - /* arithmetic operators */ - OPR_ADD, OPR_SUB, OPR_MUL, OPR_MOD, OPR_POW, - OPR_DIV, OPR_IDIV, - /* bitwise operators */ - OPR_BAND, OPR_BOR, OPR_BXOR, - OPR_SHL, OPR_SHR, - /* string operator */ - OPR_CONCAT, - /* comparison operators */ - OPR_EQ, OPR_LT, OPR_LE, - OPR_NE, OPR_GT, OPR_GE, - /* logical operators */ - OPR_AND, OPR_OR, - OPR_NOBINOPR -} BinOpr; - - -/* true if operation is foldable (that is, it is arithmetic or bitwise) */ -#define foldbinop(op) ((op) <= OPR_SHR) - - -#define luaK_codeABC(fs,o,a,b,c) luaK_codeABCk(fs,o,a,b,c,0) - - -typedef enum UnOpr { OPR_MINUS, OPR_BNOT, OPR_NOT, OPR_LEN, OPR_NOUNOPR } UnOpr; - - -/* get (pointer to) instruction of given 'expdesc' */ -#define getinstruction(fs,e) ((fs)->f->code[(e)->u.info]) - - -#define luaK_setmultret(fs,e) luaK_setreturns(fs, e, LUA_MULTRET) - -#define luaK_jumpto(fs,t) luaK_patchlist(fs, luaK_jump(fs), t) - -LUAI_FUNC int luaK_code (FuncState *fs, Instruction i); -LUAI_FUNC int luaK_codeABx (FuncState *fs, OpCode o, int A, unsigned Bx); -LUAI_FUNC int luaK_codeABCk (FuncState *fs, OpCode o, int A, - int B, int C, int k); -LUAI_FUNC int luaK_exp2const (FuncState *fs, const expdesc *e, TValue *v); -LUAI_FUNC void luaK_fixline (FuncState *fs, int line); -LUAI_FUNC void luaK_nil (FuncState *fs, int from, int n); -LUAI_FUNC void luaK_reserveregs (FuncState *fs, int n); -LUAI_FUNC void luaK_checkstack (FuncState *fs, int n); -LUAI_FUNC void luaK_int (FuncState *fs, int reg, lua_Integer n); -LUAI_FUNC void luaK_dischargevars (FuncState *fs, expdesc *e); -LUAI_FUNC int luaK_exp2anyreg (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2anyregup (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2nextreg (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2val (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_self (FuncState *fs, expdesc *e, expdesc *key); -LUAI_FUNC void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k); -LUAI_FUNC void luaK_goiftrue (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_goiffalse (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_storevar (FuncState *fs, expdesc *var, expdesc *e); -LUAI_FUNC void luaK_setreturns (FuncState *fs, expdesc *e, int nresults); -LUAI_FUNC void luaK_setoneret (FuncState *fs, expdesc *e); -LUAI_FUNC int luaK_jump (FuncState *fs); -LUAI_FUNC void luaK_ret (FuncState *fs, int first, int nret); -LUAI_FUNC void luaK_patchlist (FuncState *fs, int list, int target); -LUAI_FUNC void luaK_patchtohere (FuncState *fs, int list); -LUAI_FUNC void luaK_concat (FuncState *fs, int *l1, int l2); -LUAI_FUNC int luaK_getlabel (FuncState *fs); -LUAI_FUNC void luaK_prefix (FuncState *fs, UnOpr op, expdesc *v, int line); -LUAI_FUNC void luaK_infix (FuncState *fs, BinOpr op, expdesc *v); -LUAI_FUNC void luaK_posfix (FuncState *fs, BinOpr op, expdesc *v1, - expdesc *v2, int line); -LUAI_FUNC void luaK_settablesize (FuncState *fs, int pc, - int ra, int asize, int hsize); -LUAI_FUNC void luaK_setlist (FuncState *fs, int base, int nelems, int tostore); -LUAI_FUNC void luaK_finish (FuncState *fs); -LUAI_FUNC l_noret luaK_semerror (LexState *ls, const char *msg); - - -#endif - - -/* -** $Id: lvm.h $ -** Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#ifndef lvm_h -#define lvm_h - - - - -#if !defined(LUA_NOCVTN2S) -#define cvt2str(o) ttisnumber(o) -#else -#define cvt2str(o) 0 /* no conversion from numbers to strings */ -#endif - - -#if !defined(LUA_NOCVTS2N) -#define cvt2num(o) ttisstring(o) -#else -#define cvt2num(o) 0 /* no conversion from strings to numbers */ -#endif - - -/* -** You can define LUA_FLOORN2I if you want to convert floats to integers -** by flooring them (instead of raising an error if they are not -** integral values) -*/ -#if !defined(LUA_FLOORN2I) -#define LUA_FLOORN2I F2Ieq -#endif - - -/* -** Rounding modes for float->integer coercion - */ -typedef enum { - F2Ieq, /* no rounding; accepts only integral values */ - F2Ifloor, /* takes the floor of the number */ - F2Iceil /* takes the ceil of the number */ -} F2Imod; - - -/* convert an object to a float (including string coercion) */ -#define tonumber(o,n) \ - (ttisfloat(o) ? (*(n) = fltvalue(o), 1) : luaV_tonumber_(o,n)) - - -/* convert an object to a float (without string coercion) */ -#define tonumberns(o,n) \ - (ttisfloat(o) ? ((n) = fltvalue(o), 1) : \ - (ttisinteger(o) ? ((n) = cast_num(ivalue(o)), 1) : 0)) - - -/* convert an object to an integer (including string coercion) */ -#define tointeger(o,i) \ - (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ - : luaV_tointeger(o,i,LUA_FLOORN2I)) - - -/* convert an object to an integer (without string coercion) */ -#define tointegerns(o,i) \ - (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ - : luaV_tointegerns(o,i,LUA_FLOORN2I)) - - -#define intop(op,v1,v2) l_castU2S(l_castS2U(v1) op l_castS2U(v2)) - -#define luaV_rawequalobj(t1,t2) luaV_equalobj(NULL,t1,t2) - - -/* -** fast track for 'gettable' -*/ -#define luaV_fastget(t,k,res,f, tag) \ - (tag = (!ttistable(t) ? LUA_VNOTABLE : f(hvalue(t), k, res))) - - -/* -** Special case of 'luaV_fastget' for integers, inlining the fast case -** of 'luaH_getint'. -*/ -#define luaV_fastgeti(t,k,res,tag) \ - if (!ttistable(t)) tag = LUA_VNOTABLE; \ - else { luaH_fastgeti(hvalue(t), k, res, tag); } - - -#define luaV_fastset(t,k,val,hres,f) \ - (hres = (!ttistable(t) ? HNOTATABLE : f(hvalue(t), k, val))) - -#define luaV_fastseti(t,k,val,hres) \ - if (!ttistable(t)) hres = HNOTATABLE; \ - else { luaH_fastseti(hvalue(t), k, val, hres); } - - -/* -** Finish a fast set operation (when fast set succeeds). -*/ -#define luaV_finishfastset(L,t,v) luaC_barrierback(L, gcvalue(t), v) - - -/* -** Shift right is the same as shift left with a negative 'y' -*/ -#define luaV_shiftr(x,y) luaV_shiftl(x,intop(-, 0, y)) - - - -LUAI_FUNC int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2); -LUAI_FUNC int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r); -LUAI_FUNC int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r); -LUAI_FUNC int luaV_tonumber_ (const TValue *obj, lua_Number *n); -LUAI_FUNC int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode); -LUAI_FUNC int luaV_tointegerns (const TValue *obj, lua_Integer *p, - F2Imod mode); -LUAI_FUNC int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode); -LUAI_FUNC int luaV_finishget (lua_State *L, const TValue *t, TValue *key, - StkId val, int tag); -LUAI_FUNC void luaV_finishset (lua_State *L, const TValue *t, TValue *key, - TValue *val, int aux); -LUAI_FUNC void luaV_finishOp (lua_State *L); -LUAI_FUNC void luaV_execute (lua_State *L, CallInfo *ci); -LUAI_FUNC void luaV_concat (lua_State *L, int total); -LUAI_FUNC lua_Integer luaV_idiv (lua_State *L, lua_Integer x, lua_Integer y); -LUAI_FUNC lua_Integer luaV_mod (lua_State *L, lua_Integer x, lua_Integer y); -LUAI_FUNC lua_Number luaV_modf (lua_State *L, lua_Number x, lua_Number y); -LUAI_FUNC lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y); -LUAI_FUNC void luaV_objlen (lua_State *L, StkId ra, const TValue *rb); - -#endif - - - -/* Maximum number of registers in a Lua function (must fit in 8 bits) */ -#define MAXREGS 255 - - -#define hasjumps(e) ((e)->t != (e)->f) - - -static int codesJ (FuncState *fs, OpCode o, int sj, int k); - - - -/* semantic error */ -l_noret luaK_semerror (LexState *ls, const char *msg) { - ls->t.token = 0; /* remove "near " from final message */ - luaX_syntaxerror(ls, msg); -} - - -/* -** If expression is a numeric constant, fills 'v' with its value -** and returns 1. Otherwise, returns 0. -*/ -static int tonumeral (const expdesc *e, TValue *v) { - if (hasjumps(e)) - return 0; /* not a numeral */ - switch (e->k) { - case VKINT: - if (v) setivalue(v, e->u.ival); - return 1; - case VKFLT: - if (v) setfltvalue(v, e->u.nval); - return 1; - default: return 0; - } -} - - -/* -** Get the constant value from a constant expression -*/ -static TValue *const2val (FuncState *fs, const expdesc *e) { - lua_assert(e->k == VCONST); - return &fs->ls->dyd->actvar.arr[e->u.info].k; -} - - -/* -** If expression is a constant, fills 'v' with its value -** and returns 1. Otherwise, returns 0. -*/ -int luaK_exp2const (FuncState *fs, const expdesc *e, TValue *v) { - if (hasjumps(e)) - return 0; /* not a constant */ - switch (e->k) { - case VFALSE: - setbfvalue(v); - return 1; - case VTRUE: - setbtvalue(v); - return 1; - case VNIL: - setnilvalue(v); - return 1; - case VKSTR: { - setsvalue(fs->ls->L, v, e->u.strval); - return 1; - } - case VCONST: { - setobj(fs->ls->L, v, const2val(fs, e)); - return 1; - } - default: return tonumeral(e, v); - } -} - - -/* -** Return the previous instruction of the current code. If there -** may be a jump target between the current instruction and the -** previous one, return an invalid instruction (to avoid wrong -** optimizations). -*/ -static Instruction *previousinstruction (FuncState *fs) { - static const Instruction invalidinstruction = ~(Instruction)0; - if (fs->pc > fs->lasttarget) - return &fs->f->code[fs->pc - 1]; /* previous instruction */ - else - return cast(Instruction*, &invalidinstruction); -} - - -/* -** Create a OP_LOADNIL instruction, but try to optimize: if the previous -** instruction is also OP_LOADNIL and ranges are compatible, adjust -** range of previous instruction instead of emitting a new one. (For -** instance, 'local a; local b' will generate a single opcode.) -*/ -void luaK_nil (FuncState *fs, int from, int n) { - int l = from + n - 1; /* last register to set nil */ - Instruction *previous = previousinstruction(fs); - if (GET_OPCODE(*previous) == OP_LOADNIL) { /* previous is LOADNIL? */ - int pfrom = GETARG_A(*previous); /* get previous range */ - int pl = pfrom + GETARG_B(*previous); - if ((pfrom <= from && from <= pl + 1) || - (from <= pfrom && pfrom <= l + 1)) { /* can connect both? */ - if (pfrom < from) from = pfrom; /* from = min(from, pfrom) */ - if (pl > l) l = pl; /* l = max(l, pl) */ - SETARG_A(*previous, from); - SETARG_B(*previous, l - from); - return; - } /* else go through */ - } - luaK_codeABC(fs, OP_LOADNIL, from, n - 1, 0); /* else no optimization */ -} - - -/* -** Gets the destination address of a jump instruction. Used to traverse -** a list of jumps. -*/ -static int getjump (FuncState *fs, int pc) { - int offset = GETARG_sJ(fs->f->code[pc]); - if (offset == NO_JUMP) /* point to itself represents end of list */ - return NO_JUMP; /* end of list */ - else - return (pc+1)+offset; /* turn offset into absolute position */ -} - - -/* -** Fix jump instruction at position 'pc' to jump to 'dest'. -** (Jump addresses are relative in Lua) -*/ -static void fixjump (FuncState *fs, int pc, int dest) { - Instruction *jmp = &fs->f->code[pc]; - int offset = dest - (pc + 1); - lua_assert(dest != NO_JUMP); - if (!(-OFFSET_sJ <= offset && offset <= MAXARG_sJ - OFFSET_sJ)) - luaX_syntaxerror(fs->ls, "control structure too long"); - lua_assert(GET_OPCODE(*jmp) == OP_JMP); - SETARG_sJ(*jmp, offset); -} - - -/* -** Concatenate jump-list 'l2' into jump-list 'l1' -*/ -void luaK_concat (FuncState *fs, int *l1, int l2) { - if (l2 == NO_JUMP) return; /* nothing to concatenate? */ - else if (*l1 == NO_JUMP) /* no original list? */ - *l1 = l2; /* 'l1' points to 'l2' */ - else { - int list = *l1; - int next; - while ((next = getjump(fs, list)) != NO_JUMP) /* find last element */ - list = next; - fixjump(fs, list, l2); /* last element links to 'l2' */ - } -} - - -/* -** Create a jump instruction and return its position, so its destination -** can be fixed later (with 'fixjump'). -*/ -int luaK_jump (FuncState *fs) { - return codesJ(fs, OP_JMP, NO_JUMP, 0); -} - - -/* -** Code a 'return' instruction -*/ -void luaK_ret (FuncState *fs, int first, int nret) { - OpCode op; - switch (nret) { - case 0: op = OP_RETURN0; break; - case 1: op = OP_RETURN1; break; - default: op = OP_RETURN; break; - } - luaK_codeABC(fs, op, first, nret + 1, 0); -} - - -/* -** Code a "conditional jump", that is, a test or comparison opcode -** followed by a jump. Return jump position. -*/ -static int condjump (FuncState *fs, OpCode op, int A, int B, int C, int k) { - luaK_codeABCk(fs, op, A, B, C, k); - return luaK_jump(fs); -} - - -/* -** returns current 'pc' and marks it as a jump target (to avoid wrong -** optimizations with consecutive instructions not in the same basic block). -*/ -int luaK_getlabel (FuncState *fs) { - fs->lasttarget = fs->pc; - return fs->pc; -} - - -/* -** Returns the position of the instruction "controlling" a given -** jump (that is, its condition), or the jump itself if it is -** unconditional. -*/ -static Instruction *getjumpcontrol (FuncState *fs, int pc) { - Instruction *pi = &fs->f->code[pc]; - if (pc >= 1 && testTMode(GET_OPCODE(*(pi-1)))) - return pi-1; - else - return pi; -} - - -/* -** Patch destination register for a TESTSET instruction. -** If instruction in position 'node' is not a TESTSET, return 0 ("fails"). -** Otherwise, if 'reg' is not 'NO_REG', set it as the destination -** register. Otherwise, change instruction to a simple 'TEST' (produces -** no register value) -*/ -static int patchtestreg (FuncState *fs, int node, int reg) { - Instruction *i = getjumpcontrol(fs, node); - if (GET_OPCODE(*i) != OP_TESTSET) - return 0; /* cannot patch other instructions */ - if (reg != NO_REG && reg != GETARG_B(*i)) - SETARG_A(*i, reg); - else { - /* no register to put value or register already has the value; - change instruction to simple test */ - *i = CREATE_ABCk(OP_TEST, GETARG_B(*i), 0, 0, GETARG_k(*i)); - } - return 1; -} - - -/* -** Traverse a list of tests ensuring no one produces a value -*/ -static void removevalues (FuncState *fs, int list) { - for (; list != NO_JUMP; list = getjump(fs, list)) - patchtestreg(fs, list, NO_REG); -} - - -/* -** Traverse a list of tests, patching their destination address and -** registers: tests producing values jump to 'vtarget' (and put their -** values in 'reg'), other tests jump to 'dtarget'. -*/ -static void patchlistaux (FuncState *fs, int list, int vtarget, int reg, - int dtarget) { - while (list != NO_JUMP) { - int next = getjump(fs, list); - if (patchtestreg(fs, list, reg)) - fixjump(fs, list, vtarget); - else - fixjump(fs, list, dtarget); /* jump to default target */ - list = next; - } -} - - -/* -** Path all jumps in 'list' to jump to 'target'. -** (The assert means that we cannot fix a jump to a forward address -** because we only know addresses once code is generated.) -*/ -void luaK_patchlist (FuncState *fs, int list, int target) { - lua_assert(target <= fs->pc); - patchlistaux(fs, list, target, NO_REG, target); -} - - -void luaK_patchtohere (FuncState *fs, int list) { - int hr = luaK_getlabel(fs); /* mark "here" as a jump target */ - luaK_patchlist(fs, list, hr); -} - - -/* limit for difference between lines in relative line info. */ -#define LIMLINEDIFF 0x80 - - -/* -** Save line info for a new instruction. If difference from last line -** does not fit in a byte, of after that many instructions, save a new -** absolute line info; (in that case, the special value 'ABSLINEINFO' -** in 'lineinfo' signals the existence of this absolute information.) -** Otherwise, store the difference from last line in 'lineinfo'. -*/ -static void savelineinfo (FuncState *fs, Proto *f, int line) { - int linedif = line - fs->previousline; - int pc = fs->pc - 1; /* last instruction coded */ - if (abs(linedif) >= LIMLINEDIFF || fs->iwthabs++ >= MAXIWTHABS) { - luaM_growvector(fs->ls->L, f->abslineinfo, fs->nabslineinfo, - f->sizeabslineinfo, AbsLineInfo, MAX_INT, "lines"); - f->abslineinfo[fs->nabslineinfo].pc = pc; - f->abslineinfo[fs->nabslineinfo++].line = line; - linedif = ABSLINEINFO; /* signal that there is absolute information */ - fs->iwthabs = 1; /* restart counter */ - } - luaM_growvector(fs->ls->L, f->lineinfo, pc, f->sizelineinfo, ls_byte, - MAX_INT, "opcodes"); - f->lineinfo[pc] = linedif; - fs->previousline = line; /* last line saved */ -} - - -/* -** Remove line information from the last instruction. -** If line information for that instruction is absolute, set 'iwthabs' -** above its max to force the new (replacing) instruction to have -** absolute line info, too. -*/ -static void removelastlineinfo (FuncState *fs) { - Proto *f = fs->f; - int pc = fs->pc - 1; /* last instruction coded */ - if (f->lineinfo[pc] != ABSLINEINFO) { /* relative line info? */ - fs->previousline -= f->lineinfo[pc]; /* correct last line saved */ - fs->iwthabs--; /* undo previous increment */ - } - else { /* absolute line information */ - lua_assert(f->abslineinfo[fs->nabslineinfo - 1].pc == pc); - fs->nabslineinfo--; /* remove it */ - fs->iwthabs = MAXIWTHABS + 1; /* force next line info to be absolute */ - } -} - - -/* -** Remove the last instruction created, correcting line information -** accordingly. -*/ -static void removelastinstruction (FuncState *fs) { - removelastlineinfo(fs); - fs->pc--; -} - - -/* -** Emit instruction 'i', checking for array sizes and saving also its -** line information. Return 'i' position. -*/ -int luaK_code (FuncState *fs, Instruction i) { - Proto *f = fs->f; - /* put new instruction in code array */ - luaM_growvector(fs->ls->L, f->code, fs->pc, f->sizecode, Instruction, - MAX_INT, "opcodes"); - f->code[fs->pc++] = i; - savelineinfo(fs, f, fs->ls->lastline); - return fs->pc - 1; /* index of new instruction */ -} - - -/* -** Format and emit an 'iABC' instruction. (Assertions check consistency -** of parameters versus opcode.) -*/ -int luaK_codeABCk (FuncState *fs, OpCode o, int a, int b, int c, int k) { - lua_assert(getOpMode(o) == iABC); - lua_assert(a <= MAXARG_A && b <= MAXARG_B && - c <= MAXARG_C && (k & ~1) == 0); - return luaK_code(fs, CREATE_ABCk(o, a, b, c, k)); -} - - -/* -** Format and emit an 'iABx' instruction. -*/ -int luaK_codeABx (FuncState *fs, OpCode o, int a, unsigned int bc) { - lua_assert(getOpMode(o) == iABx); - lua_assert(a <= MAXARG_A && bc <= MAXARG_Bx); - return luaK_code(fs, CREATE_ABx(o, a, bc)); -} - - -/* -** Format and emit an 'iAsBx' instruction. -*/ -static int codeAsBx (FuncState *fs, OpCode o, int a, int bc) { - unsigned int b = bc + OFFSET_sBx; - lua_assert(getOpMode(o) == iAsBx); - lua_assert(a <= MAXARG_A && b <= MAXARG_Bx); - return luaK_code(fs, CREATE_ABx(o, a, b)); -} - - -/* -** Format and emit an 'isJ' instruction. -*/ -static int codesJ (FuncState *fs, OpCode o, int sj, int k) { - unsigned int j = sj + OFFSET_sJ; - lua_assert(getOpMode(o) == isJ); - lua_assert(j <= MAXARG_sJ && (k & ~1) == 0); - return luaK_code(fs, CREATE_sJ(o, j, k)); -} - - -/* -** Emit an "extra argument" instruction (format 'iAx') -*/ -static int codeextraarg (FuncState *fs, int a) { - lua_assert(a <= MAXARG_Ax); - return luaK_code(fs, CREATE_Ax(OP_EXTRAARG, a)); -} - - -/* -** Emit a "load constant" instruction, using either 'OP_LOADK' -** (if constant index 'k' fits in 18 bits) or an 'OP_LOADKX' -** instruction with "extra argument". -*/ -static int luaK_codek (FuncState *fs, int reg, int k) { - if (k <= MAXARG_Bx) - return luaK_codeABx(fs, OP_LOADK, reg, k); - else { - int p = luaK_codeABx(fs, OP_LOADKX, reg, 0); - codeextraarg(fs, k); - return p; - } -} - - -/* -** Check register-stack level, keeping track of its maximum size -** in field 'maxstacksize' -*/ -void luaK_checkstack (FuncState *fs, int n) { - int newstack = fs->freereg + n; - if (newstack > fs->f->maxstacksize) { - if (newstack >= MAXREGS) - luaX_syntaxerror(fs->ls, - "function or expression needs too many registers"); - fs->f->maxstacksize = cast_byte(newstack); - } -} - - -/* -** Reserve 'n' registers in register stack -*/ -void luaK_reserveregs (FuncState *fs, int n) { - luaK_checkstack(fs, n); - fs->freereg += n; -} - - -/* -** Free register 'reg', if it is neither a constant index nor -** a local variable. -) -*/ -static void freereg (FuncState *fs, int reg) { - if (reg >= luaY_nvarstack(fs)) { - fs->freereg--; - lua_assert(reg == fs->freereg); - } -} - - -/* -** Free two registers in proper order -*/ -static void freeregs (FuncState *fs, int r1, int r2) { - if (r1 > r2) { - freereg(fs, r1); - freereg(fs, r2); - } - else { - freereg(fs, r2); - freereg(fs, r1); - } -} - - -/* -** Free register used by expression 'e' (if any) -*/ -static void freeexp (FuncState *fs, expdesc *e) { - if (e->k == VNONRELOC) - freereg(fs, e->u.info); -} - - -/* -** Free registers used by expressions 'e1' and 'e2' (if any) in proper -** order. -*/ -static void freeexps (FuncState *fs, expdesc *e1, expdesc *e2) { - int r1 = (e1->k == VNONRELOC) ? e1->u.info : -1; - int r2 = (e2->k == VNONRELOC) ? e2->u.info : -1; - freeregs(fs, r1, r2); -} - - -/* -** Add constant 'v' to prototype's list of constants (field 'k'). -** Use scanner's table to cache position of constants in constant list -** and try to reuse constants. Because some values should not be used -** as keys (nil cannot be a key, integer keys can collapse with float -** keys), the caller must provide a useful 'key' for indexing the cache. -** Note that all functions share the same table, so entering or exiting -** a function can make some indices wrong. -*/ -static int addk (FuncState *fs, TValue *key, TValue *v) { - TValue val; - lua_State *L = fs->ls->L; - Proto *f = fs->f; - int tag = luaH_get(fs->ls->h, key, &val); /* query scanner table */ - int k, oldsize; - if (tag == LUA_VNUMINT) { /* is there an index there? */ - k = cast_int(ivalue(&val)); - /* correct value? (warning: must distinguish floats from integers!) */ - if (k < fs->nk && ttypetag(&f->k[k]) == ttypetag(v) && - luaV_rawequalobj(&f->k[k], v)) - return k; /* reuse index */ - } - /* constant not found; create a new entry */ - oldsize = f->sizek; - k = fs->nk; - /* numerical value does not need GC barrier; - table has no metatable, so it does not need to invalidate cache */ - setivalue(&val, k); - luaH_set(L, fs->ls->h, key, &val); - luaM_growvector(L, f->k, k, f->sizek, TValue, MAXARG_Ax, "constants"); - while (oldsize < f->sizek) setnilvalue(&f->k[oldsize++]); - setobj(L, &f->k[k], v); - fs->nk++; - luaC_barrier(L, f, v); - return k; -} - - -/* -** Add a string to list of constants and return its index. -*/ -static int stringK (FuncState *fs, TString *s) { - TValue o; - setsvalue(fs->ls->L, &o, s); - return addk(fs, &o, &o); /* use string itself as key */ -} - - -/* -** Add an integer to list of constants and return its index. -*/ -static int luaK_intK (FuncState *fs, lua_Integer n) { - TValue o; - setivalue(&o, n); - return addk(fs, &o, &o); /* use integer itself as key */ -} - -/* -** Add a float to list of constants and return its index. Floats -** with integral values need a different key, to avoid collision -** with actual integers. To that, we add to the number its smaller -** power-of-two fraction that is still significant in its scale. -** For doubles, that would be 1/2^52. -** (This method is not bulletproof: there may be another float -** with that value, and for floats larger than 2^53 the result is -** still an integer. At worst, this only wastes an entry with -** a duplicate.) -*/ -static int luaK_numberK (FuncState *fs, lua_Number r) { - TValue o; - lua_Integer ik; - setfltvalue(&o, r); - if (!luaV_flttointeger(r, &ik, F2Ieq)) /* not an integral value? */ - return addk(fs, &o, &o); /* use number itself as key */ - else { /* must build an alternative key */ - const int nbm = l_floatatt(MANT_DIG); - const lua_Number q = l_mathop(ldexp)(l_mathop(1.0), -nbm + 1); - const lua_Number k = (ik == 0) ? q : r + r*q; /* new key */ - TValue kv; - setfltvalue(&kv, k); - /* result is not an integral value, unless value is too large */ - lua_assert(!luaV_flttointeger(k, &ik, F2Ieq) || - l_mathop(fabs)(r) >= l_mathop(1e6)); - return addk(fs, &kv, &o); - } -} - - -/* -** Add a false to list of constants and return its index. -*/ -static int boolF (FuncState *fs) { - TValue o; - setbfvalue(&o); - return addk(fs, &o, &o); /* use boolean itself as key */ -} - - -/* -** Add a true to list of constants and return its index. -*/ -static int boolT (FuncState *fs) { - TValue o; - setbtvalue(&o); - return addk(fs, &o, &o); /* use boolean itself as key */ -} - - -/* -** Add nil to list of constants and return its index. -*/ -static int nilK (FuncState *fs) { - TValue k, v; - setnilvalue(&v); - /* cannot use nil as key; instead use table itself to represent nil */ - sethvalue(fs->ls->L, &k, fs->ls->h); - return addk(fs, &k, &v); -} - - -/* -** Check whether 'i' can be stored in an 'sC' operand. Equivalent to -** (0 <= int2sC(i) && int2sC(i) <= MAXARG_C) but without risk of -** overflows in the hidden addition inside 'int2sC'. -*/ -static int fitsC (lua_Integer i) { - return (l_castS2U(i) + OFFSET_sC <= cast_uint(MAXARG_C)); -} - - -/* -** Check whether 'i' can be stored in an 'sBx' operand. -*/ -static int fitsBx (lua_Integer i) { - return (-OFFSET_sBx <= i && i <= MAXARG_Bx - OFFSET_sBx); -} - - -void luaK_int (FuncState *fs, int reg, lua_Integer i) { - if (fitsBx(i)) - codeAsBx(fs, OP_LOADI, reg, cast_int(i)); - else - luaK_codek(fs, reg, luaK_intK(fs, i)); -} - - -static void luaK_float (FuncState *fs, int reg, lua_Number f) { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ieq) && fitsBx(fi)) - codeAsBx(fs, OP_LOADF, reg, cast_int(fi)); - else - luaK_codek(fs, reg, luaK_numberK(fs, f)); -} - - -/* -** Convert a constant in 'v' into an expression description 'e' -*/ -static void const2exp (TValue *v, expdesc *e) { - switch (ttypetag(v)) { - case LUA_VNUMINT: - e->k = VKINT; e->u.ival = ivalue(v); - break; - case LUA_VNUMFLT: - e->k = VKFLT; e->u.nval = fltvalue(v); - break; - case LUA_VFALSE: - e->k = VFALSE; - break; - case LUA_VTRUE: - e->k = VTRUE; - break; - case LUA_VNIL: - e->k = VNIL; - break; - case LUA_VSHRSTR: case LUA_VLNGSTR: - e->k = VKSTR; e->u.strval = tsvalue(v); - break; - default: lua_assert(0); - } -} - - -/* -** Fix an expression to return the number of results 'nresults'. -** 'e' must be a multi-ret expression (function call or vararg). -*/ -void luaK_setreturns (FuncState *fs, expdesc *e, int nresults) { - Instruction *pc = &getinstruction(fs, e); - if (e->k == VCALL) /* expression is an open function call? */ - SETARG_C(*pc, nresults + 1); - else { - lua_assert(e->k == VVARARG); - SETARG_C(*pc, nresults + 1); - SETARG_A(*pc, fs->freereg); - luaK_reserveregs(fs, 1); - } -} - - -/* -** Convert a VKSTR to a VK -*/ -static void str2K (FuncState *fs, expdesc *e) { - lua_assert(e->k == VKSTR); - e->u.info = stringK(fs, e->u.strval); - e->k = VK; -} - - -/* -** Fix an expression to return one result. -** If expression is not a multi-ret expression (function call or -** vararg), it already returns one result, so nothing needs to be done. -** Function calls become VNONRELOC expressions (as its result comes -** fixed in the base register of the call), while vararg expressions -** become VRELOC (as OP_VARARG puts its results where it wants). -** (Calls are created returning one result, so that does not need -** to be fixed.) -*/ -void luaK_setoneret (FuncState *fs, expdesc *e) { - if (e->k == VCALL) { /* expression is an open function call? */ - /* already returns 1 value */ - lua_assert(GETARG_C(getinstruction(fs, e)) == 2); - e->k = VNONRELOC; /* result has fixed position */ - e->u.info = GETARG_A(getinstruction(fs, e)); - } - else if (e->k == VVARARG) { - SETARG_C(getinstruction(fs, e), 2); - e->k = VRELOC; /* can relocate its simple result */ - } -} - - -/* -** Ensure that expression 'e' is not a variable (nor a ). -** (Expression still may have jump lists.) -*/ -void luaK_dischargevars (FuncState *fs, expdesc *e) { - switch (e->k) { - case VCONST: { - const2exp(const2val(fs, e), e); - break; - } - case VLOCAL: { /* already in a register */ - e->u.info = e->u.var.ridx; - e->k = VNONRELOC; /* becomes a non-relocatable value */ - break; - } - case VUPVAL: { /* move value to some (pending) register */ - e->u.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.info, 0); - e->k = VRELOC; - break; - } - case VINDEXUP: { - e->u.info = luaK_codeABC(fs, OP_GETTABUP, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXI: { - freereg(fs, e->u.ind.t); - e->u.info = luaK_codeABC(fs, OP_GETI, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXSTR: { - freereg(fs, e->u.ind.t); - e->u.info = luaK_codeABC(fs, OP_GETFIELD, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXED: { - freeregs(fs, e->u.ind.t, e->u.ind.idx); - e->u.info = luaK_codeABC(fs, OP_GETTABLE, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VVARARG: case VCALL: { - luaK_setoneret(fs, e); - break; - } - default: break; /* there is one value available (somewhere) */ - } -} - - -/* -** Ensure expression value is in register 'reg', making 'e' a -** non-relocatable expression. -** (Expression still may have jump lists.) -*/ -static void discharge2reg (FuncState *fs, expdesc *e, int reg) { - luaK_dischargevars(fs, e); - switch (e->k) { - case VNIL: { - luaK_nil(fs, reg, 1); - break; - } - case VFALSE: { - luaK_codeABC(fs, OP_LOADFALSE, reg, 0, 0); - break; - } - case VTRUE: { - luaK_codeABC(fs, OP_LOADTRUE, reg, 0, 0); - break; - } - case VKSTR: { - str2K(fs, e); - } /* FALLTHROUGH */ - case VK: { - luaK_codek(fs, reg, e->u.info); - break; - } - case VKFLT: { - luaK_float(fs, reg, e->u.nval); - break; - } - case VKINT: { - luaK_int(fs, reg, e->u.ival); - break; - } - case VRELOC: { - Instruction *pc = &getinstruction(fs, e); - SETARG_A(*pc, reg); /* instruction will put result in 'reg' */ - break; - } - case VNONRELOC: { - if (reg != e->u.info) - luaK_codeABC(fs, OP_MOVE, reg, e->u.info, 0); - break; - } - default: { - lua_assert(e->k == VJMP); - return; /* nothing to do... */ - } - } - e->u.info = reg; - e->k = VNONRELOC; -} - - -/* -** Ensure expression value is in a register, making 'e' a -** non-relocatable expression. -** (Expression still may have jump lists.) -*/ -static void discharge2anyreg (FuncState *fs, expdesc *e) { - if (e->k != VNONRELOC) { /* no fixed register yet? */ - luaK_reserveregs(fs, 1); /* get a register */ - discharge2reg(fs, e, fs->freereg-1); /* put value there */ - } -} - - -static int code_loadbool (FuncState *fs, int A, OpCode op) { - luaK_getlabel(fs); /* those instructions may be jump targets */ - return luaK_codeABC(fs, op, A, 0, 0); -} - - -/* -** check whether list has any jump that do not produce a value -** or produce an inverted value -*/ -static int need_value (FuncState *fs, int list) { - for (; list != NO_JUMP; list = getjump(fs, list)) { - Instruction i = *getjumpcontrol(fs, list); - if (GET_OPCODE(i) != OP_TESTSET) return 1; - } - return 0; /* not found */ -} - - -/* -** Ensures final expression result (which includes results from its -** jump lists) is in register 'reg'. -** If expression has jumps, need to patch these jumps either to -** its final position or to "load" instructions (for those tests -** that do not produce values). -*/ -static void exp2reg (FuncState *fs, expdesc *e, int reg) { - discharge2reg(fs, e, reg); - if (e->k == VJMP) /* expression itself is a test? */ - luaK_concat(fs, &e->t, e->u.info); /* put this jump in 't' list */ - if (hasjumps(e)) { - int final; /* position after whole expression */ - int p_f = NO_JUMP; /* position of an eventual LOAD false */ - int p_t = NO_JUMP; /* position of an eventual LOAD true */ - if (need_value(fs, e->t) || need_value(fs, e->f)) { - int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs); - p_f = code_loadbool(fs, reg, OP_LFALSESKIP); /* skip next inst. */ - p_t = code_loadbool(fs, reg, OP_LOADTRUE); - /* jump around these booleans if 'e' is not a test */ - luaK_patchtohere(fs, fj); - } - final = luaK_getlabel(fs); - patchlistaux(fs, e->f, final, reg, p_f); - patchlistaux(fs, e->t, final, reg, p_t); - } - e->f = e->t = NO_JUMP; - e->u.info = reg; - e->k = VNONRELOC; -} - - -/* -** Ensures final expression result is in next available register. -*/ -void luaK_exp2nextreg (FuncState *fs, expdesc *e) { - luaK_dischargevars(fs, e); - freeexp(fs, e); - luaK_reserveregs(fs, 1); - exp2reg(fs, e, fs->freereg - 1); -} - - -/* -** Ensures final expression result is in some (any) register -** and return that register. -*/ -int luaK_exp2anyreg (FuncState *fs, expdesc *e) { - luaK_dischargevars(fs, e); - if (e->k == VNONRELOC) { /* expression already has a register? */ - if (!hasjumps(e)) /* no jumps? */ - return e->u.info; /* result is already in a register */ - if (e->u.info >= luaY_nvarstack(fs)) { /* reg. is not a local? */ - exp2reg(fs, e, e->u.info); /* put final result in it */ - return e->u.info; - } - /* else expression has jumps and cannot change its register - to hold the jump values, because it is a local variable. - Go through to the default case. */ - } - luaK_exp2nextreg(fs, e); /* default: use next available register */ - return e->u.info; -} - - -/* -** Ensures final expression result is either in a register -** or in an upvalue. -*/ -void luaK_exp2anyregup (FuncState *fs, expdesc *e) { - if (e->k != VUPVAL || hasjumps(e)) - luaK_exp2anyreg(fs, e); -} - - -/* -** Ensures final expression result is either in a register -** or it is a constant. -*/ -void luaK_exp2val (FuncState *fs, expdesc *e) { - if (hasjumps(e)) - luaK_exp2anyreg(fs, e); - else - luaK_dischargevars(fs, e); -} - - -/* -** Try to make 'e' a K expression with an index in the range of R/K -** indices. Return true iff succeeded. -*/ -static int luaK_exp2K (FuncState *fs, expdesc *e) { - if (!hasjumps(e)) { - int info; - switch (e->k) { /* move constants to 'k' */ - case VTRUE: info = boolT(fs); break; - case VFALSE: info = boolF(fs); break; - case VNIL: info = nilK(fs); break; - case VKINT: info = luaK_intK(fs, e->u.ival); break; - case VKFLT: info = luaK_numberK(fs, e->u.nval); break; - case VKSTR: info = stringK(fs, e->u.strval); break; - case VK: info = e->u.info; break; - default: return 0; /* not a constant */ - } - if (info <= MAXINDEXRK) { /* does constant fit in 'argC'? */ - e->k = VK; /* make expression a 'K' expression */ - e->u.info = info; - return 1; - } - } - /* else, expression doesn't fit; leave it unchanged */ - return 0; -} - - -/* -** Ensures final expression result is in a valid R/K index -** (that is, it is either in a register or in 'k' with an index -** in the range of R/K indices). -** Returns 1 iff expression is K. -*/ -static int exp2RK (FuncState *fs, expdesc *e) { - if (luaK_exp2K(fs, e)) - return 1; - else { /* not a constant in the right range: put it in a register */ - luaK_exp2anyreg(fs, e); - return 0; - } -} - - -static void codeABRK (FuncState *fs, OpCode o, int a, int b, - expdesc *ec) { - int k = exp2RK(fs, ec); - luaK_codeABCk(fs, o, a, b, ec->u.info, k); -} - - -/* -** Generate code to store result of expression 'ex' into variable 'var'. -*/ -void luaK_storevar (FuncState *fs, expdesc *var, expdesc *ex) { - switch (var->k) { - case VLOCAL: { - freeexp(fs, ex); - exp2reg(fs, ex, var->u.var.ridx); /* compute 'ex' into proper place */ - return; - } - case VUPVAL: { - int e = luaK_exp2anyreg(fs, ex); - luaK_codeABC(fs, OP_SETUPVAL, e, var->u.info, 0); - break; - } - case VINDEXUP: { - codeABRK(fs, OP_SETTABUP, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXI: { - codeABRK(fs, OP_SETI, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXSTR: { - codeABRK(fs, OP_SETFIELD, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXED: { - codeABRK(fs, OP_SETTABLE, var->u.ind.t, var->u.ind.idx, ex); - break; - } - default: lua_assert(0); /* invalid var kind to store */ - } - freeexp(fs, ex); -} - - -/* -** Emit SELF instruction (convert expression 'e' into 'e:key(e,'). -*/ -void luaK_self (FuncState *fs, expdesc *e, expdesc *key) { - int ereg; - luaK_exp2anyreg(fs, e); - ereg = e->u.info; /* register where 'e' was placed */ - freeexp(fs, e); - e->u.info = fs->freereg; /* base register for op_self */ - e->k = VNONRELOC; /* self expression has a fixed register */ - luaK_reserveregs(fs, 2); /* function and 'self' produced by op_self */ - codeABRK(fs, OP_SELF, e->u.info, ereg, key); - freeexp(fs, key); -} - - -/* -** Negate condition 'e' (where 'e' is a comparison). -*/ -static void negatecondition (FuncState *fs, expdesc *e) { - Instruction *pc = getjumpcontrol(fs, e->u.info); - lua_assert(testTMode(GET_OPCODE(*pc)) && GET_OPCODE(*pc) != OP_TESTSET && - GET_OPCODE(*pc) != OP_TEST); - SETARG_k(*pc, (GETARG_k(*pc) ^ 1)); -} - - -/* -** Emit instruction to jump if 'e' is 'cond' (that is, if 'cond' -** is true, code will jump if 'e' is true.) Return jump position. -** Optimize when 'e' is 'not' something, inverting the condition -** and removing the 'not'. -*/ -static int jumponcond (FuncState *fs, expdesc *e, int cond) { - if (e->k == VRELOC) { - Instruction ie = getinstruction(fs, e); - if (GET_OPCODE(ie) == OP_NOT) { - removelastinstruction(fs); /* remove previous OP_NOT */ - return condjump(fs, OP_TEST, GETARG_B(ie), 0, 0, !cond); - } - /* else go through */ - } - discharge2anyreg(fs, e); - freeexp(fs, e); - return condjump(fs, OP_TESTSET, NO_REG, e->u.info, 0, cond); -} - - -/* -** Emit code to go through if 'e' is true, jump otherwise. -*/ -void luaK_goiftrue (FuncState *fs, expdesc *e) { - int pc; /* pc of new jump */ - luaK_dischargevars(fs, e); - switch (e->k) { - case VJMP: { /* condition? */ - negatecondition(fs, e); /* jump when it is false */ - pc = e->u.info; /* save jump position */ - break; - } - case VK: case VKFLT: case VKINT: case VKSTR: case VTRUE: { - pc = NO_JUMP; /* always true; do nothing */ - break; - } - default: { - pc = jumponcond(fs, e, 0); /* jump when false */ - break; - } - } - luaK_concat(fs, &e->f, pc); /* insert new jump in false list */ - luaK_patchtohere(fs, e->t); /* true list jumps to here (to go through) */ - e->t = NO_JUMP; -} - - -/* -** Emit code to go through if 'e' is false, jump otherwise. -*/ -void luaK_goiffalse (FuncState *fs, expdesc *e) { - int pc; /* pc of new jump */ - luaK_dischargevars(fs, e); - switch (e->k) { - case VJMP: { - pc = e->u.info; /* already jump if true */ - break; - } - case VNIL: case VFALSE: { - pc = NO_JUMP; /* always false; do nothing */ - break; - } - default: { - pc = jumponcond(fs, e, 1); /* jump if true */ - break; - } - } - luaK_concat(fs, &e->t, pc); /* insert new jump in 't' list */ - luaK_patchtohere(fs, e->f); /* false list jumps to here (to go through) */ - e->f = NO_JUMP; -} - - -/* -** Code 'not e', doing constant folding. -*/ -static void codenot (FuncState *fs, expdesc *e) { - switch (e->k) { - case VNIL: case VFALSE: { - e->k = VTRUE; /* true == not nil == not false */ - break; - } - case VK: case VKFLT: case VKINT: case VKSTR: case VTRUE: { - e->k = VFALSE; /* false == not "x" == not 0.5 == not 1 == not true */ - break; - } - case VJMP: { - negatecondition(fs, e); - break; - } - case VRELOC: - case VNONRELOC: { - discharge2anyreg(fs, e); - freeexp(fs, e); - e->u.info = luaK_codeABC(fs, OP_NOT, 0, e->u.info, 0); - e->k = VRELOC; - break; - } - default: lua_assert(0); /* cannot happen */ - } - /* interchange true and false lists */ - { int temp = e->f; e->f = e->t; e->t = temp; } - removevalues(fs, e->f); /* values are useless when negated */ - removevalues(fs, e->t); -} - - -/* -** Check whether expression 'e' is a short literal string -*/ -static int isKstr (FuncState *fs, expdesc *e) { - return (e->k == VK && !hasjumps(e) && e->u.info <= MAXARG_B && - ttisshrstring(&fs->f->k[e->u.info])); -} - -/* -** Check whether expression 'e' is a literal integer. -*/ -static int isKint (expdesc *e) { - return (e->k == VKINT && !hasjumps(e)); -} - - -/* -** Check whether expression 'e' is a literal integer in -** proper range to fit in register C -*/ -static int isCint (expdesc *e) { - return isKint(e) && (l_castS2U(e->u.ival) <= l_castS2U(MAXARG_C)); -} - - -/* -** Check whether expression 'e' is a literal integer in -** proper range to fit in register sC -*/ -static int isSCint (expdesc *e) { - return isKint(e) && fitsC(e->u.ival); -} - - -/* -** Check whether expression 'e' is a literal integer or float in -** proper range to fit in a register (sB or sC). -*/ -static int isSCnumber (expdesc *e, int *pi, int *isfloat) { - lua_Integer i; - if (e->k == VKINT) - i = e->u.ival; - else if (e->k == VKFLT && luaV_flttointeger(e->u.nval, &i, F2Ieq)) - *isfloat = 1; - else - return 0; /* not a number */ - if (!hasjumps(e) && fitsC(i)) { - *pi = int2sC(cast_int(i)); - return 1; - } - else - return 0; -} - - -/* -** Create expression 't[k]'. 't' must have its final result already in a -** register or upvalue. Upvalues can only be indexed by literal strings. -** Keys can be literal strings in the constant table or arbitrary -** values in registers. -*/ -void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) { - if (k->k == VKSTR) - str2K(fs, k); - lua_assert(!hasjumps(t) && - (t->k == VLOCAL || t->k == VNONRELOC || t->k == VUPVAL)); - if (t->k == VUPVAL && !isKstr(fs, k)) /* upvalue indexed by non 'Kstr'? */ - luaK_exp2anyreg(fs, t); /* put it in a register */ - if (t->k == VUPVAL) { - lua_assert(isKstr(fs, k)); - t->u.ind.t = t->u.info; /* upvalue index */ - t->u.ind.idx = k->u.info; /* literal short string */ - t->k = VINDEXUP; - } - else { - /* register index of the table */ - t->u.ind.t = (t->k == VLOCAL) ? t->u.var.ridx: t->u.info; - if (isKstr(fs, k)) { - t->u.ind.idx = k->u.info; /* literal short string */ - t->k = VINDEXSTR; - } - else if (isCint(k)) { - t->u.ind.idx = cast_int(k->u.ival); /* int. constant in proper range */ - t->k = VINDEXI; - } - else { - t->u.ind.idx = luaK_exp2anyreg(fs, k); /* register */ - t->k = VINDEXED; - } - } -} - - -/* -** Return false if folding can raise an error. -** Bitwise operations need operands convertible to integers; division -** operations cannot have 0 as divisor. -*/ -static int validop (int op, TValue *v1, TValue *v2) { - switch (op) { - case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: - case LUA_OPSHL: case LUA_OPSHR: case LUA_OPBNOT: { /* conversion errors */ - lua_Integer i; - return (luaV_tointegerns(v1, &i, LUA_FLOORN2I) && - luaV_tointegerns(v2, &i, LUA_FLOORN2I)); - } - case LUA_OPDIV: case LUA_OPIDIV: case LUA_OPMOD: /* division by 0 */ - return (nvalue(v2) != 0); - default: return 1; /* everything else is valid */ - } -} - - -/* -** Try to "constant-fold" an operation; return 1 iff successful. -** (In this case, 'e1' has the final result.) -*/ -static int constfolding (FuncState *fs, int op, expdesc *e1, - const expdesc *e2) { - TValue v1, v2, res; - if (!tonumeral(e1, &v1) || !tonumeral(e2, &v2) || !validop(op, &v1, &v2)) - return 0; /* non-numeric operands or not safe to fold */ - luaO_rawarith(fs->ls->L, op, &v1, &v2, &res); /* does operation */ - if (ttisinteger(&res)) { - e1->k = VKINT; - e1->u.ival = ivalue(&res); - } - else { /* folds neither NaN nor 0.0 (to avoid problems with -0.0) */ - lua_Number n = fltvalue(&res); - if (luai_numisnan(n) || n == 0) - return 0; - e1->k = VKFLT; - e1->u.nval = n; - } - return 1; -} - - -/* -** Convert a BinOpr to an OpCode (ORDER OPR - ORDER OP) -*/ -l_sinline OpCode binopr2op (BinOpr opr, BinOpr baser, OpCode base) { - lua_assert(baser <= opr && - ((baser == OPR_ADD && opr <= OPR_SHR) || - (baser == OPR_LT && opr <= OPR_LE))); - return cast(OpCode, (cast_int(opr) - cast_int(baser)) + cast_int(base)); -} - - -/* -** Convert a UnOpr to an OpCode (ORDER OPR - ORDER OP) -*/ -l_sinline OpCode unopr2op (UnOpr opr) { - return cast(OpCode, (cast_int(opr) - cast_int(OPR_MINUS)) + - cast_int(OP_UNM)); -} - - -/* -** Convert a BinOpr to a tag method (ORDER OPR - ORDER TM) -*/ -l_sinline TMS binopr2TM (BinOpr opr) { - lua_assert(OPR_ADD <= opr && opr <= OPR_SHR); - return cast(TMS, (cast_int(opr) - cast_int(OPR_ADD)) + cast_int(TM_ADD)); -} - - -/* -** Emit code for unary expressions that "produce values" -** (everything but 'not'). -** Expression to produce final result will be encoded in 'e'. -*/ -static void codeunexpval (FuncState *fs, OpCode op, expdesc *e, int line) { - int r = luaK_exp2anyreg(fs, e); /* opcodes operate only on registers */ - freeexp(fs, e); - e->u.info = luaK_codeABC(fs, op, 0, r, 0); /* generate opcode */ - e->k = VRELOC; /* all those operations are relocatable */ - luaK_fixline(fs, line); -} - - -/* -** Emit code for binary expressions that "produce values" -** (everything but logical operators 'and'/'or' and comparison -** operators). -** Expression to produce final result will be encoded in 'e1'. -*/ -static void finishbinexpval (FuncState *fs, expdesc *e1, expdesc *e2, - OpCode op, int v2, int flip, int line, - OpCode mmop, TMS event) { - int v1 = luaK_exp2anyreg(fs, e1); - int pc = luaK_codeABCk(fs, op, 0, v1, v2, 0); - freeexps(fs, e1, e2); - e1->u.info = pc; - e1->k = VRELOC; /* all those operations are relocatable */ - luaK_fixline(fs, line); - luaK_codeABCk(fs, mmop, v1, v2, event, flip); /* to call metamethod */ - luaK_fixline(fs, line); -} - - -/* -** Emit code for binary expressions that "produce values" over -** two registers. -*/ -static void codebinexpval (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - OpCode op = binopr2op(opr, OPR_ADD, OP_ADD); - int v2 = luaK_exp2anyreg(fs, e2); /* make sure 'e2' is in a register */ - /* 'e1' must be already in a register or it is a constant */ - lua_assert((VNIL <= e1->k && e1->k <= VKSTR) || - e1->k == VNONRELOC || e1->k == VRELOC); - lua_assert(OP_ADD <= op && op <= OP_SHR); - finishbinexpval(fs, e1, e2, op, v2, 0, line, OP_MMBIN, binopr2TM(opr)); -} - - -/* -** Code binary operators with immediate operands. -*/ -static void codebini (FuncState *fs, OpCode op, - expdesc *e1, expdesc *e2, int flip, int line, - TMS event) { - int v2 = int2sC(cast_int(e2->u.ival)); /* immediate operand */ - lua_assert(e2->k == VKINT); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINI, event); -} - - -/* -** Code binary operators with K operand. -*/ -static void codebinK (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - TMS event = binopr2TM(opr); - int v2 = e2->u.info; /* K index */ - OpCode op = binopr2op(opr, OPR_ADD, OP_ADDK); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINK, event); -} - - -/* Try to code a binary operator negating its second operand. -** For the metamethod, 2nd operand must keep its original value. -*/ -static int finishbinexpneg (FuncState *fs, expdesc *e1, expdesc *e2, - OpCode op, int line, TMS event) { - if (!isKint(e2)) - return 0; /* not an integer constant */ - else { - lua_Integer i2 = e2->u.ival; - if (!(fitsC(i2) && fitsC(-i2))) - return 0; /* not in the proper range */ - else { /* operating a small integer constant */ - int v2 = cast_int(i2); - finishbinexpval(fs, e1, e2, op, int2sC(-v2), 0, line, OP_MMBINI, event); - /* correct metamethod argument */ - SETARG_B(fs->f->code[fs->pc - 1], int2sC(v2)); - return 1; /* successfully coded */ - } - } -} - - -static void swapexps (expdesc *e1, expdesc *e2) { - expdesc temp = *e1; *e1 = *e2; *e2 = temp; /* swap 'e1' and 'e2' */ -} - - -/* -** Code binary operators with no constant operand. -*/ -static void codebinNoK (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - if (flip) - swapexps(e1, e2); /* back to original order */ - codebinexpval(fs, opr, e1, e2, line); /* use standard operators */ -} - - -/* -** Code arithmetic operators ('+', '-', ...). If second operand is a -** constant in the proper range, use variant opcodes with K operands. -*/ -static void codearith (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - if (tonumeral(e2, NULL) && luaK_exp2K(fs, e2)) /* K operand? */ - codebinK(fs, opr, e1, e2, flip, line); - else /* 'e2' is neither an immediate nor a K operand */ - codebinNoK(fs, opr, e1, e2, flip, line); -} - - -/* -** Code commutative operators ('+', '*'). If first operand is a -** numeric constant, change order of operands to try to use an -** immediate or K operator. -*/ -static void codecommutative (FuncState *fs, BinOpr op, - expdesc *e1, expdesc *e2, int line) { - int flip = 0; - if (tonumeral(e1, NULL)) { /* is first operand a numeric constant? */ - swapexps(e1, e2); /* change order */ - flip = 1; - } - if (op == OPR_ADD && isSCint(e2)) /* immediate operand? */ - codebini(fs, OP_ADDI, e1, e2, flip, line, TM_ADD); - else - codearith(fs, op, e1, e2, flip, line); -} - - -/* -** Code bitwise operations; they are all commutative, so the function -** tries to put an integer constant as the 2nd operand (a K operand). -*/ -static void codebitwise (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - int flip = 0; - if (e1->k == VKINT) { - swapexps(e1, e2); /* 'e2' will be the constant operand */ - flip = 1; - } - if (e2->k == VKINT && luaK_exp2K(fs, e2)) /* K operand? */ - codebinK(fs, opr, e1, e2, flip, line); - else /* no constants */ - codebinNoK(fs, opr, e1, e2, flip, line); -} - - -/* -** Emit code for order comparisons. When using an immediate operand, -** 'isfloat' tells whether the original value was a float. -*/ -static void codeorder (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { - int r1, r2; - int im; - int isfloat = 0; - OpCode op; - if (isSCnumber(e2, &im, &isfloat)) { - /* use immediate operand */ - r1 = luaK_exp2anyreg(fs, e1); - r2 = im; - op = binopr2op(opr, OPR_LT, OP_LTI); - } - else if (isSCnumber(e1, &im, &isfloat)) { - /* transform (A < B) to (B > A) and (A <= B) to (B >= A) */ - r1 = luaK_exp2anyreg(fs, e2); - r2 = im; - op = binopr2op(opr, OPR_LT, OP_GTI); - } - else { /* regular case, compare two registers */ - r1 = luaK_exp2anyreg(fs, e1); - r2 = luaK_exp2anyreg(fs, e2); - op = binopr2op(opr, OPR_LT, OP_LT); - } - freeexps(fs, e1, e2); - e1->u.info = condjump(fs, op, r1, r2, isfloat, 1); - e1->k = VJMP; -} - - -/* -** Emit code for equality comparisons ('==', '~='). -** 'e1' was already put as RK by 'luaK_infix'. -*/ -static void codeeq (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { - int r1, r2; - int im; - int isfloat = 0; /* not needed here, but kept for symmetry */ - OpCode op; - if (e1->k != VNONRELOC) { - lua_assert(e1->k == VK || e1->k == VKINT || e1->k == VKFLT); - swapexps(e1, e2); - } - r1 = luaK_exp2anyreg(fs, e1); /* 1st expression must be in register */ - if (isSCnumber(e2, &im, &isfloat)) { - op = OP_EQI; - r2 = im; /* immediate operand */ - } - else if (exp2RK(fs, e2)) { /* 2nd expression is constant? */ - op = OP_EQK; - r2 = e2->u.info; /* constant index */ - } - else { - op = OP_EQ; /* will compare two registers */ - r2 = luaK_exp2anyreg(fs, e2); - } - freeexps(fs, e1, e2); - e1->u.info = condjump(fs, op, r1, r2, isfloat, (opr == OPR_EQ)); - e1->k = VJMP; -} - - -/* -** Apply prefix operation 'op' to expression 'e'. -*/ -void luaK_prefix (FuncState *fs, UnOpr opr, expdesc *e, int line) { - static const expdesc ef = {VKINT, {0}, NO_JUMP, NO_JUMP}; - luaK_dischargevars(fs, e); - switch (opr) { - case OPR_MINUS: case OPR_BNOT: /* use 'ef' as fake 2nd operand */ - if (constfolding(fs, opr + LUA_OPUNM, e, &ef)) - break; - /* else */ /* FALLTHROUGH */ - case OPR_LEN: - codeunexpval(fs, unopr2op(opr), e, line); - break; - case OPR_NOT: codenot(fs, e); break; - default: lua_assert(0); - } -} - - -/* -** Process 1st operand 'v' of binary operation 'op' before reading -** 2nd operand. -*/ -void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) { - luaK_dischargevars(fs, v); - switch (op) { - case OPR_AND: { - luaK_goiftrue(fs, v); /* go ahead only if 'v' is true */ - break; - } - case OPR_OR: { - luaK_goiffalse(fs, v); /* go ahead only if 'v' is false */ - break; - } - case OPR_CONCAT: { - luaK_exp2nextreg(fs, v); /* operand must be on the stack */ - break; - } - case OPR_ADD: case OPR_SUB: - case OPR_MUL: case OPR_DIV: case OPR_IDIV: - case OPR_MOD: case OPR_POW: - case OPR_BAND: case OPR_BOR: case OPR_BXOR: - case OPR_SHL: case OPR_SHR: { - if (!tonumeral(v, NULL)) - luaK_exp2anyreg(fs, v); - /* else keep numeral, which may be folded or used as an immediate - operand */ - break; - } - case OPR_EQ: case OPR_NE: { - if (!tonumeral(v, NULL)) - exp2RK(fs, v); - /* else keep numeral, which may be an immediate operand */ - break; - } - case OPR_LT: case OPR_LE: - case OPR_GT: case OPR_GE: { - int dummy, dummy2; - if (!isSCnumber(v, &dummy, &dummy2)) - luaK_exp2anyreg(fs, v); - /* else keep numeral, which may be an immediate operand */ - break; - } - default: lua_assert(0); - } -} - -/* -** Create code for '(e1 .. e2)'. -** For '(e1 .. e2.1 .. e2.2)' (which is '(e1 .. (e2.1 .. e2.2))', -** because concatenation is right associative), merge both CONCATs. -*/ -static void codeconcat (FuncState *fs, expdesc *e1, expdesc *e2, int line) { - Instruction *ie2 = previousinstruction(fs); - if (GET_OPCODE(*ie2) == OP_CONCAT) { /* is 'e2' a concatenation? */ - int n = GETARG_B(*ie2); /* # of elements concatenated in 'e2' */ - lua_assert(e1->u.info + 1 == GETARG_A(*ie2)); - freeexp(fs, e2); - SETARG_A(*ie2, e1->u.info); /* correct first element ('e1') */ - SETARG_B(*ie2, n + 1); /* will concatenate one more element */ - } - else { /* 'e2' is not a concatenation */ - luaK_codeABC(fs, OP_CONCAT, e1->u.info, 2, 0); /* new concat opcode */ - freeexp(fs, e2); - luaK_fixline(fs, line); - } -} - - -/* -** Finalize code for binary operation, after reading 2nd operand. -*/ -void luaK_posfix (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - luaK_dischargevars(fs, e2); - if (foldbinop(opr) && constfolding(fs, opr + LUA_OPADD, e1, e2)) - return; /* done by folding */ - switch (opr) { - case OPR_AND: { - lua_assert(e1->t == NO_JUMP); /* list closed by 'luaK_infix' */ - luaK_concat(fs, &e2->f, e1->f); - *e1 = *e2; - break; - } - case OPR_OR: { - lua_assert(e1->f == NO_JUMP); /* list closed by 'luaK_infix' */ - luaK_concat(fs, &e2->t, e1->t); - *e1 = *e2; - break; - } - case OPR_CONCAT: { /* e1 .. e2 */ - luaK_exp2nextreg(fs, e2); - codeconcat(fs, e1, e2, line); - break; - } - case OPR_ADD: case OPR_MUL: { - codecommutative(fs, opr, e1, e2, line); - break; - } - case OPR_SUB: { - if (finishbinexpneg(fs, e1, e2, OP_ADDI, line, TM_SUB)) - break; /* coded as (r1 + -I) */ - /* ELSE */ - } /* FALLTHROUGH */ - case OPR_DIV: case OPR_IDIV: case OPR_MOD: case OPR_POW: { - codearith(fs, opr, e1, e2, 0, line); - break; - } - case OPR_BAND: case OPR_BOR: case OPR_BXOR: { - codebitwise(fs, opr, e1, e2, line); - break; - } - case OPR_SHL: { - if (isSCint(e1)) { - swapexps(e1, e2); - codebini(fs, OP_SHLI, e1, e2, 1, line, TM_SHL); /* I << r2 */ - } - else if (finishbinexpneg(fs, e1, e2, OP_SHRI, line, TM_SHL)) { - /* coded as (r1 >> -I) */; - } - else /* regular case (two registers) */ - codebinexpval(fs, opr, e1, e2, line); - break; - } - case OPR_SHR: { - if (isSCint(e2)) - codebini(fs, OP_SHRI, e1, e2, 0, line, TM_SHR); /* r1 >> I */ - else /* regular case (two registers) */ - codebinexpval(fs, opr, e1, e2, line); - break; - } - case OPR_EQ: case OPR_NE: { - codeeq(fs, opr, e1, e2); - break; - } - case OPR_GT: case OPR_GE: { - /* '(a > b)' <=> '(b < a)'; '(a >= b)' <=> '(b <= a)' */ - swapexps(e1, e2); - opr = cast(BinOpr, (opr - OPR_GT) + OPR_LT); - } /* FALLTHROUGH */ - case OPR_LT: case OPR_LE: { - codeorder(fs, opr, e1, e2); - break; - } - default: lua_assert(0); - } -} - - -/* -** Change line information associated with current position, by removing -** previous info and adding it again with new line. -*/ -void luaK_fixline (FuncState *fs, int line) { - removelastlineinfo(fs); - savelineinfo(fs, fs->f, line); -} - - -void luaK_settablesize (FuncState *fs, int pc, int ra, int asize, int hsize) { - Instruction *inst = &fs->f->code[pc]; - int rb = (hsize != 0) ? luaO_ceillog2(hsize) + 1 : 0; /* hash size */ - int extra = asize / (MAXARG_C + 1); /* higher bits of array size */ - int rc = asize % (MAXARG_C + 1); /* lower bits of array size */ - int k = (extra > 0); /* true iff needs extra argument */ - *inst = CREATE_ABCk(OP_NEWTABLE, ra, rb, rc, k); - *(inst + 1) = CREATE_Ax(OP_EXTRAARG, extra); -} - - -/* -** Emit a SETLIST instruction. -** 'base' is register that keeps table; -** 'nelems' is #table plus those to be stored now; -** 'tostore' is number of values (in registers 'base + 1',...) to add to -** table (or LUA_MULTRET to add up to stack top). -*/ -void luaK_setlist (FuncState *fs, int base, int nelems, int tostore) { - lua_assert(tostore != 0 && tostore <= LFIELDS_PER_FLUSH); - if (tostore == LUA_MULTRET) - tostore = 0; - if (nelems <= MAXARG_C) - luaK_codeABC(fs, OP_SETLIST, base, tostore, nelems); - else { - int extra = nelems / (MAXARG_C + 1); - nelems %= (MAXARG_C + 1); - luaK_codeABCk(fs, OP_SETLIST, base, tostore, nelems, 1); - codeextraarg(fs, extra); - } - fs->freereg = base + 1; /* free registers with list values */ -} - - -/* -** return the final target of a jump (skipping jumps to jumps) -*/ -static int finaltarget (Instruction *code, int i) { - int count; - for (count = 0; count < 100; count++) { /* avoid infinite loops */ - Instruction pc = code[i]; - if (GET_OPCODE(pc) != OP_JMP) - break; - else - i += GETARG_sJ(pc) + 1; - } - return i; -} - - -/* -** Do a final pass over the code of a function, doing small peephole -** optimizations and adjustments. -*/ -void luaK_finish (FuncState *fs) { - int i; - Proto *p = fs->f; - for (i = 0; i < fs->pc; i++) { - Instruction *pc = &p->code[i]; - lua_assert(i == 0 || isOT(*(pc - 1)) == isIT(*pc)); - switch (GET_OPCODE(*pc)) { - case OP_RETURN0: case OP_RETURN1: { - if (!(fs->needclose || (p->flag & PF_ISVARARG))) - break; /* no extra work */ - /* else use OP_RETURN to do the extra work */ - SET_OPCODE(*pc, OP_RETURN); - } /* FALLTHROUGH */ - case OP_RETURN: case OP_TAILCALL: { - if (fs->needclose) - SETARG_k(*pc, 1); /* signal that it needs to close */ - if (p->flag & PF_ISVARARG) - SETARG_C(*pc, p->numparams + 1); /* signal that it is vararg */ - break; - } - case OP_JMP: { - int target = finaltarget(p->code, i); - fixjump(fs, i, target); - break; - } - default: break; - } - } -} - - -/* -** $Id: lparser.c $ -** Lua Parser -** See Copyright Notice in lua.h -*/ - -#define lparser_c -#define LUA_CORE - - - -#include -#include - - - - - -/* maximum number of local variables per function (must be smaller - than 250, due to the bytecode format) */ -#define MAXVARS 200 - - -#define hasmultret(k) ((k) == VCALL || (k) == VVARARG) - - -/* because all strings are unified by the scanner, the parser - can use pointer equality for string equality */ -#define eqstr(a,b) ((a) == (b)) - - -/* -** nodes for block list (list of active blocks) -*/ -typedef struct BlockCnt { - struct BlockCnt *previous; /* chain */ - int firstlabel; /* index of first label in this block */ - int firstgoto; /* index of first pending goto in this block */ - lu_byte nactvar; /* # active locals outside the block */ - lu_byte upval; /* true if some variable in the block is an upvalue */ - lu_byte isloop; /* true if 'block' is a loop */ - lu_byte insidetbc; /* true if inside the scope of a to-be-closed var. */ -} BlockCnt; - - - -/* -** prototypes for recursive non-terminal functions -*/ -static void statement (LexState *ls); -static void expr (LexState *ls, expdesc *v); - - -static l_noret error_expected (LexState *ls, int token) { - luaX_syntaxerror(ls, - luaO_pushfstring(ls->L, "%s expected", luaX_token2str(ls, token))); -} - - -static l_noret errorlimit (FuncState *fs, int limit, const char *what) { - lua_State *L = fs->ls->L; - const char *msg; - int line = fs->f->linedefined; - const char *where = (line == 0) - ? "main function" - : luaO_pushfstring(L, "function at line %d", line); - msg = luaO_pushfstring(L, "too many %s (limit is %d) in %s", - what, limit, where); - luaX_syntaxerror(fs->ls, msg); -} - - -static void checklimit (FuncState *fs, int v, int l, const char *what) { - if (v > l) errorlimit(fs, l, what); -} - - -/* -** Test whether next token is 'c'; if so, skip it. -*/ -static int testnext (LexState *ls, int c) { - if (ls->t.token == c) { - luaX_next(ls); - return 1; - } - else return 0; -} - - -/* -** Check that next token is 'c'. -*/ -static void check (LexState *ls, int c) { - if (ls->t.token != c) - error_expected(ls, c); -} - - -/* -** Check that next token is 'c' and skip it. -*/ -static void checknext (LexState *ls, int c) { - check(ls, c); - luaX_next(ls); -} - - -#define check_condition(ls,c,msg) { if (!(c)) luaX_syntaxerror(ls, msg); } - - -/* -** Check that next token is 'what' and skip it. In case of error, -** raise an error that the expected 'what' should match a 'who' -** in line 'where' (if that is not the current line). -*/ -static void check_match (LexState *ls, int what, int who, int where) { - if (l_unlikely(!testnext(ls, what))) { - if (where == ls->linenumber) /* all in the same line? */ - error_expected(ls, what); /* do not need a complex message */ - else { - luaX_syntaxerror(ls, luaO_pushfstring(ls->L, - "%s expected (to close %s at line %d)", - luaX_token2str(ls, what), luaX_token2str(ls, who), where)); - } - } -} - - -static TString *str_checkname (LexState *ls) { - TString *ts; - check(ls, TK_NAME); - ts = ls->t.seminfo.ts; - luaX_next(ls); - return ts; -} - - -static void init_exp (expdesc *e, expkind k, int i) { - e->f = e->t = NO_JUMP; - e->k = k; - e->u.info = i; -} - - -static void codestring (expdesc *e, TString *s) { - e->f = e->t = NO_JUMP; - e->k = VKSTR; - e->u.strval = s; -} - - -static void codename (LexState *ls, expdesc *e) { - codestring(e, str_checkname(ls)); -} - - -/* -** Register a new local variable in the active 'Proto' (for debug -** information). -*/ -static int registerlocalvar (LexState *ls, FuncState *fs, TString *varname) { - Proto *f = fs->f; - int oldsize = f->sizelocvars; - luaM_growvector(ls->L, f->locvars, fs->ndebugvars, f->sizelocvars, - LocVar, SHRT_MAX, "local variables"); - while (oldsize < f->sizelocvars) - f->locvars[oldsize++].varname = NULL; - f->locvars[fs->ndebugvars].varname = varname; - f->locvars[fs->ndebugvars].startpc = fs->pc; - luaC_objbarrier(ls->L, f, varname); - return fs->ndebugvars++; -} - - -/* -** Create a new local variable with the given 'name' and given 'kind'. -** Return its index in the function. -*/ -static int new_localvarkind (LexState *ls, TString *name, int kind) { - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Dyndata *dyd = ls->dyd; - Vardesc *var; - checklimit(fs, dyd->actvar.n + 1 - fs->firstlocal, - MAXVARS, "local variables"); - luaM_growvector(L, dyd->actvar.arr, dyd->actvar.n + 1, - dyd->actvar.size, Vardesc, USHRT_MAX, "local variables"); - var = &dyd->actvar.arr[dyd->actvar.n++]; - var->vd.kind = kind; /* default */ - var->vd.name = name; - return dyd->actvar.n - 1 - fs->firstlocal; -} - - -/* -** Create a new local variable with the given 'name' and regular kind. -*/ -static int new_localvar (LexState *ls, TString *name) { - return new_localvarkind(ls, name, VDKREG); -} - -#define new_localvarliteral(ls,v) \ - new_localvar(ls, \ - luaX_newstring(ls, "" v, (sizeof(v)/sizeof(char)) - 1)); - - - -/* -** Return the "variable description" (Vardesc) of a given variable. -** (Unless noted otherwise, all variables are referred to by their -** compiler indices.) -*/ -static Vardesc *getlocalvardesc (FuncState *fs, int vidx) { - return &fs->ls->dyd->actvar.arr[fs->firstlocal + vidx]; -} - - -/* -** Convert 'nvar', a compiler index level, to its corresponding -** register. For that, search for the highest variable below that level -** that is in a register and uses its register index ('ridx') plus one. -*/ -static int reglevel (FuncState *fs, int nvar) { - while (nvar-- > 0) { - Vardesc *vd = getlocalvardesc(fs, nvar); /* get previous variable */ - if (vd->vd.kind != RDKCTC) /* is in a register? */ - return vd->vd.ridx + 1; - } - return 0; /* no variables in registers */ -} - - -/* -** Return the number of variables in the register stack for the given -** function. -*/ -int luaY_nvarstack (FuncState *fs) { - return reglevel(fs, fs->nactvar); -} - - -/* -** Get the debug-information entry for current variable 'vidx'. -*/ -static LocVar *localdebuginfo (FuncState *fs, int vidx) { - Vardesc *vd = getlocalvardesc(fs, vidx); - if (vd->vd.kind == RDKCTC) - return NULL; /* no debug info. for constants */ - else { - int idx = vd->vd.pidx; - lua_assert(idx < fs->ndebugvars); - return &fs->f->locvars[idx]; - } -} - - -/* -** Create an expression representing variable 'vidx' -*/ -static void init_var (FuncState *fs, expdesc *e, int vidx) { - e->f = e->t = NO_JUMP; - e->k = VLOCAL; - e->u.var.vidx = vidx; - e->u.var.ridx = getlocalvardesc(fs, vidx)->vd.ridx; -} - - -/* -** Raises an error if variable described by 'e' is read only -*/ -static void check_readonly (LexState *ls, expdesc *e) { - FuncState *fs = ls->fs; - TString *varname = NULL; /* to be set if variable is const */ - switch (e->k) { - case VCONST: { - varname = ls->dyd->actvar.arr[e->u.info].vd.name; - break; - } - case VLOCAL: { - Vardesc *vardesc = getlocalvardesc(fs, e->u.var.vidx); - if (vardesc->vd.kind != VDKREG) /* not a regular variable? */ - varname = vardesc->vd.name; - break; - } - case VUPVAL: { - Upvaldesc *up = &fs->f->upvalues[e->u.info]; - if (up->kind != VDKREG) - varname = up->name; - break; - } - default: - return; /* other cases cannot be read-only */ - } - if (varname) { - const char *msg = luaO_pushfstring(ls->L, - "attempt to assign to const variable '%s'", getstr(varname)); - luaK_semerror(ls, msg); /* error */ - } -} - - -/* -** Start the scope for the last 'nvars' created variables. -*/ -static void adjustlocalvars (LexState *ls, int nvars) { - FuncState *fs = ls->fs; - int reglevel = luaY_nvarstack(fs); - int i; - for (i = 0; i < nvars; i++) { - int vidx = fs->nactvar++; - Vardesc *var = getlocalvardesc(fs, vidx); - var->vd.ridx = reglevel++; - var->vd.pidx = registerlocalvar(ls, fs, var->vd.name); - } -} - - -/* -** Close the scope for all variables up to level 'tolevel'. -** (debug info.) -*/ -static void removevars (FuncState *fs, int tolevel) { - fs->ls->dyd->actvar.n -= (fs->nactvar - tolevel); - while (fs->nactvar > tolevel) { - LocVar *var = localdebuginfo(fs, --fs->nactvar); - if (var) /* does it have debug information? */ - var->endpc = fs->pc; - } -} - - -/* -** Search the upvalues of the function 'fs' for one -** with the given 'name'. -*/ -static int searchupvalue (FuncState *fs, TString *name) { - int i; - Upvaldesc *up = fs->f->upvalues; - for (i = 0; i < fs->nups; i++) { - if (eqstr(up[i].name, name)) return i; - } - return -1; /* not found */ -} - - -static Upvaldesc *allocupvalue (FuncState *fs) { - Proto *f = fs->f; - int oldsize = f->sizeupvalues; - checklimit(fs, fs->nups + 1, MAXUPVAL, "upvalues"); - luaM_growvector(fs->ls->L, f->upvalues, fs->nups, f->sizeupvalues, - Upvaldesc, MAXUPVAL, "upvalues"); - while (oldsize < f->sizeupvalues) - f->upvalues[oldsize++].name = NULL; - return &f->upvalues[fs->nups++]; -} - - -static int newupvalue (FuncState *fs, TString *name, expdesc *v) { - Upvaldesc *up = allocupvalue(fs); - FuncState *prev = fs->prev; - if (v->k == VLOCAL) { - up->instack = 1; - up->idx = v->u.var.ridx; - up->kind = getlocalvardesc(prev, v->u.var.vidx)->vd.kind; - lua_assert(eqstr(name, getlocalvardesc(prev, v->u.var.vidx)->vd.name)); - } - else { - up->instack = 0; - up->idx = cast_byte(v->u.info); - up->kind = prev->f->upvalues[v->u.info].kind; - lua_assert(eqstr(name, prev->f->upvalues[v->u.info].name)); - } - up->name = name; - luaC_objbarrier(fs->ls->L, fs->f, name); - return fs->nups - 1; -} - - -/* -** Look for an active local variable with the name 'n' in the -** function 'fs'. If found, initialize 'var' with it and return -** its expression kind; otherwise return -1. -*/ -static int searchvar (FuncState *fs, TString *n, expdesc *var) { - int i; - for (i = cast_int(fs->nactvar) - 1; i >= 0; i--) { - Vardesc *vd = getlocalvardesc(fs, i); - if (eqstr(n, vd->vd.name)) { /* found? */ - if (vd->vd.kind == RDKCTC) /* compile-time constant? */ - init_exp(var, VCONST, fs->firstlocal + i); - else /* real variable */ - init_var(fs, var, i); - return var->k; - } - } - return -1; /* not found */ -} - - -/* -** Mark block where variable at given level was defined -** (to emit close instructions later). -*/ -static void markupval (FuncState *fs, int level) { - BlockCnt *bl = fs->bl; - while (bl->nactvar > level) - bl = bl->previous; - bl->upval = 1; - fs->needclose = 1; -} - - -/* -** Mark that current block has a to-be-closed variable. -*/ -static void marktobeclosed (FuncState *fs) { - BlockCnt *bl = fs->bl; - bl->upval = 1; - bl->insidetbc = 1; - fs->needclose = 1; -} - - -/* -** Find a variable with the given name 'n'. If it is an upvalue, add -** this upvalue into all intermediate functions. If it is a global, set -** 'var' as 'void' as a flag. -*/ -static void singlevaraux (FuncState *fs, TString *n, expdesc *var, int base) { - if (fs == NULL) /* no more levels? */ - init_exp(var, VVOID, 0); /* default is global */ - else { - int v = searchvar(fs, n, var); /* look up locals at current level */ - if (v >= 0) { /* found? */ - if (v == VLOCAL && !base) - markupval(fs, var->u.var.vidx); /* local will be used as an upval */ - } - else { /* not found as local at current level; try upvalues */ - int idx = searchupvalue(fs, n); /* try existing upvalues */ - if (idx < 0) { /* not found? */ - singlevaraux(fs->prev, n, var, 0); /* try upper levels */ - if (var->k == VLOCAL || var->k == VUPVAL) /* local or upvalue? */ - idx = newupvalue(fs, n, var); /* will be a new upvalue */ - else /* it is a global or a constant */ - return; /* don't need to do anything at this level */ - } - init_exp(var, VUPVAL, idx); /* new or old upvalue */ - } - } -} - - -/* -** Find a variable with the given name 'n', handling global variables -** too. -*/ -static void singlevar (LexState *ls, expdesc *var) { - TString *varname = str_checkname(ls); - FuncState *fs = ls->fs; - singlevaraux(fs, varname, var, 1); - if (var->k == VVOID) { /* global name? */ - expdesc key; - singlevaraux(fs, ls->envn, var, 1); /* get environment variable */ - lua_assert(var->k != VVOID); /* this one must exist */ - luaK_exp2anyregup(fs, var); /* but could be a constant */ - codestring(&key, varname); /* key is variable name */ - luaK_indexed(fs, var, &key); /* env[varname] */ - } -} - - -/* -** Adjust the number of results from an expression list 'e' with 'nexps' -** expressions to 'nvars' values. -*/ -static void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) { - FuncState *fs = ls->fs; - int needed = nvars - nexps; /* extra values needed */ - if (hasmultret(e->k)) { /* last expression has multiple returns? */ - int extra = needed + 1; /* discount last expression itself */ - if (extra < 0) - extra = 0; - luaK_setreturns(fs, e, extra); /* last exp. provides the difference */ - } - else { - if (e->k != VVOID) /* at least one expression? */ - luaK_exp2nextreg(fs, e); /* close last expression */ - if (needed > 0) /* missing values? */ - luaK_nil(fs, fs->freereg, needed); /* complete with nils */ - } - if (needed > 0) - luaK_reserveregs(fs, needed); /* registers for extra values */ - else /* adding 'needed' is actually a subtraction */ - fs->freereg += needed; /* remove extra values */ -} - - -#define enterlevel(ls) luaE_incCstack(ls->L) - - -#define leavelevel(ls) ((ls)->L->nCcalls--) - - -/* -** Generates an error that a goto jumps into the scope of some -** local variable. -*/ -static l_noret jumpscopeerror (LexState *ls, Labeldesc *gt) { - TString *tsname = getlocalvardesc(ls->fs, gt->nactvar)->vd.name; - const char *varname = getstr(tsname); - const char *msg = " at line %d jumps into the scope of local '%s'"; - msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line, varname); - luaK_semerror(ls, msg); /* raise the error */ -} - - -/* -** Solves the goto at index 'g' to given 'label' and removes it -** from the list of pending gotos. -** If it jumps into the scope of some variable, raises an error. -*/ -static void solvegoto (LexState *ls, int g, Labeldesc *label) { - int i; - Labellist *gl = &ls->dyd->gt; /* list of gotos */ - Labeldesc *gt = &gl->arr[g]; /* goto to be resolved */ - lua_assert(eqstr(gt->name, label->name)); - if (l_unlikely(gt->nactvar < label->nactvar)) /* enter some scope? */ - jumpscopeerror(ls, gt); - luaK_patchlist(ls->fs, gt->pc, label->pc); - for (i = g; i < gl->n - 1; i++) /* remove goto from pending list */ - gl->arr[i] = gl->arr[i + 1]; - gl->n--; -} - - -/* -** Search for an active label with the given name. -*/ -static Labeldesc *findlabel (LexState *ls, TString *name) { - int i; - Dyndata *dyd = ls->dyd; - /* check labels in current function for a match */ - for (i = ls->fs->firstlabel; i < dyd->label.n; i++) { - Labeldesc *lb = &dyd->label.arr[i]; - if (eqstr(lb->name, name)) /* correct label? */ - return lb; - } - return NULL; /* label not found */ -} - - -/* -** Adds a new label/goto in the corresponding list. -*/ -static int newlabelentry (LexState *ls, Labellist *l, TString *name, - int line, int pc) { - int n = l->n; - luaM_growvector(ls->L, l->arr, n, l->size, - Labeldesc, SHRT_MAX, "labels/gotos"); - l->arr[n].name = name; - l->arr[n].line = line; - l->arr[n].nactvar = ls->fs->nactvar; - l->arr[n].close = 0; - l->arr[n].pc = pc; - l->n = n + 1; - return n; -} - - -static int newgotoentry (LexState *ls, TString *name, int line, int pc) { - return newlabelentry(ls, &ls->dyd->gt, name, line, pc); -} - - -/* -** Solves forward jumps. Check whether new label 'lb' matches any -** pending gotos in current block and solves them. Return true -** if any of the gotos need to close upvalues. -*/ -static int solvegotos (LexState *ls, Labeldesc *lb) { - Labellist *gl = &ls->dyd->gt; - int i = ls->fs->bl->firstgoto; - int needsclose = 0; - while (i < gl->n) { - if (eqstr(gl->arr[i].name, lb->name)) { - needsclose |= gl->arr[i].close; - solvegoto(ls, i, lb); /* will remove 'i' from the list */ - } - else - i++; - } - return needsclose; -} - - -/* -** Create a new label with the given 'name' at the given 'line'. -** 'last' tells whether label is the last non-op statement in its -** block. Solves all pending gotos to this new label and adds -** a close instruction if necessary. -** Returns true iff it added a close instruction. -*/ -static int createlabel (LexState *ls, TString *name, int line, - int last) { - FuncState *fs = ls->fs; - Labellist *ll = &ls->dyd->label; - int l = newlabelentry(ls, ll, name, line, luaK_getlabel(fs)); - if (last) { /* label is last no-op statement in the block? */ - /* assume that locals are already out of scope */ - ll->arr[l].nactvar = fs->bl->nactvar; - } - if (solvegotos(ls, &ll->arr[l])) { /* need close? */ - luaK_codeABC(fs, OP_CLOSE, luaY_nvarstack(fs), 0, 0); - return 1; - } - return 0; -} - - -/* -** Adjust pending gotos to outer level of a block. -*/ -static void movegotosout (FuncState *fs, BlockCnt *bl) { - int i; - Labellist *gl = &fs->ls->dyd->gt; - /* correct pending gotos to current block */ - for (i = bl->firstgoto; i < gl->n; i++) { /* for each pending goto */ - Labeldesc *gt = &gl->arr[i]; - /* leaving a variable scope? */ - if (reglevel(fs, gt->nactvar) > reglevel(fs, bl->nactvar)) - gt->close |= bl->upval; /* jump may need a close */ - gt->nactvar = bl->nactvar; /* update goto level */ - } -} - - -static void enterblock (FuncState *fs, BlockCnt *bl, lu_byte isloop) { - bl->isloop = isloop; - bl->nactvar = fs->nactvar; - bl->firstlabel = fs->ls->dyd->label.n; - bl->firstgoto = fs->ls->dyd->gt.n; - bl->upval = 0; - bl->insidetbc = (fs->bl != NULL && fs->bl->insidetbc); - bl->previous = fs->bl; - fs->bl = bl; - lua_assert(fs->freereg == luaY_nvarstack(fs)); -} - - -/* -** generates an error for an undefined 'goto'. -*/ -static l_noret undefgoto (LexState *ls, Labeldesc *gt) { - const char *msg; - if (eqstr(gt->name, luaS_newliteral(ls->L, "break"))) { - msg = "break outside loop at line %d"; - msg = luaO_pushfstring(ls->L, msg, gt->line); - } - else { - msg = "no visible label '%s' for at line %d"; - msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line); - } - luaK_semerror(ls, msg); -} - - -static void leaveblock (FuncState *fs) { - BlockCnt *bl = fs->bl; - LexState *ls = fs->ls; - int hasclose = 0; - int stklevel = reglevel(fs, bl->nactvar); /* level outside the block */ - removevars(fs, bl->nactvar); /* remove block locals */ - lua_assert(bl->nactvar == fs->nactvar); /* back to level on entry */ - if (bl->isloop) /* has to fix pending breaks? */ - hasclose = createlabel(ls, luaS_newliteral(ls->L, "break"), 0, 0); - if (!hasclose && bl->previous && bl->upval) /* still need a 'close'? */ - luaK_codeABC(fs, OP_CLOSE, stklevel, 0, 0); - fs->freereg = stklevel; /* free registers */ - ls->dyd->label.n = bl->firstlabel; /* remove local labels */ - fs->bl = bl->previous; /* current block now is previous one */ - if (bl->previous) /* was it a nested block? */ - movegotosout(fs, bl); /* update pending gotos to enclosing block */ - else { - if (bl->firstgoto < ls->dyd->gt.n) /* still pending gotos? */ - undefgoto(ls, &ls->dyd->gt.arr[bl->firstgoto]); /* error */ - } -} - - -/* -** adds a new prototype into list of prototypes -*/ -static Proto *addprototype (LexState *ls) { - Proto *clp; - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Proto *f = fs->f; /* prototype of current function */ - if (fs->np >= f->sizep) { - int oldsize = f->sizep; - luaM_growvector(L, f->p, fs->np, f->sizep, Proto *, MAXARG_Bx, "functions"); - while (oldsize < f->sizep) - f->p[oldsize++] = NULL; - } - f->p[fs->np++] = clp = luaF_newproto(L); - luaC_objbarrier(L, f, clp); - return clp; -} - - -/* -** codes instruction to create new closure in parent function. -** The OP_CLOSURE instruction uses the last available register, -** so that, if it invokes the GC, the GC knows which registers -** are in use at that time. - -*/ -static void codeclosure (LexState *ls, expdesc *v) { - FuncState *fs = ls->fs->prev; - init_exp(v, VRELOC, luaK_codeABx(fs, OP_CLOSURE, 0, fs->np - 1)); - luaK_exp2nextreg(fs, v); /* fix it at the last register */ -} - - -static void open_func (LexState *ls, FuncState *fs, BlockCnt *bl) { - Proto *f = fs->f; - fs->prev = ls->fs; /* linked list of funcstates */ - fs->ls = ls; - ls->fs = fs; - fs->pc = 0; - fs->previousline = f->linedefined; - fs->iwthabs = 0; - fs->lasttarget = 0; - fs->freereg = 0; - fs->nk = 0; - fs->nabslineinfo = 0; - fs->np = 0; - fs->nups = 0; - fs->ndebugvars = 0; - fs->nactvar = 0; - fs->needclose = 0; - fs->firstlocal = ls->dyd->actvar.n; - fs->firstlabel = ls->dyd->label.n; - fs->bl = NULL; - f->source = ls->source; - luaC_objbarrier(ls->L, f, f->source); - f->maxstacksize = 2; /* registers 0/1 are always valid */ - enterblock(fs, bl, 0); -} - - -static void close_func (LexState *ls) { - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Proto *f = fs->f; - luaK_ret(fs, luaY_nvarstack(fs), 0); /* final return */ - leaveblock(fs); - lua_assert(fs->bl == NULL); - luaK_finish(fs); - luaM_shrinkvector(L, f->code, f->sizecode, fs->pc, Instruction); - luaM_shrinkvector(L, f->lineinfo, f->sizelineinfo, fs->pc, ls_byte); - luaM_shrinkvector(L, f->abslineinfo, f->sizeabslineinfo, - fs->nabslineinfo, AbsLineInfo); - luaM_shrinkvector(L, f->k, f->sizek, fs->nk, TValue); - luaM_shrinkvector(L, f->p, f->sizep, fs->np, Proto *); - luaM_shrinkvector(L, f->locvars, f->sizelocvars, fs->ndebugvars, LocVar); - luaM_shrinkvector(L, f->upvalues, f->sizeupvalues, fs->nups, Upvaldesc); - ls->fs = fs->prev; - luaC_checkGC(L); -} - - - -/*============================================================*/ -/* GRAMMAR RULES */ -/*============================================================*/ - - -/* -** check whether current token is in the follow set of a block. -** 'until' closes syntactical blocks, but do not close scope, -** so it is handled in separate. -*/ -static int block_follow (LexState *ls, int withuntil) { - switch (ls->t.token) { - case TK_ELSE: case TK_ELSEIF: - case TK_END: case TK_EOS: - return 1; - case TK_UNTIL: return withuntil; - default: return 0; - } -} - - -static void statlist (LexState *ls) { - /* statlist -> { stat [';'] } */ - while (!block_follow(ls, 1)) { - if (ls->t.token == TK_RETURN) { - statement(ls); - return; /* 'return' must be last statement */ - } - statement(ls); - } -} - - -static void fieldsel (LexState *ls, expdesc *v) { - /* fieldsel -> ['.' | ':'] NAME */ - FuncState *fs = ls->fs; - expdesc key; - luaK_exp2anyregup(fs, v); - luaX_next(ls); /* skip the dot or colon */ - codename(ls, &key); - luaK_indexed(fs, v, &key); -} - - -static void yindex (LexState *ls, expdesc *v) { - /* index -> '[' expr ']' */ - luaX_next(ls); /* skip the '[' */ - expr(ls, v); - luaK_exp2val(ls->fs, v); - checknext(ls, ']'); -} - - -/* -** {====================================================================== -** Rules for Constructors -** ======================================================================= -*/ - - -typedef struct ConsControl { - expdesc v; /* last list item read */ - expdesc *t; /* table descriptor */ - int nh; /* total number of 'record' elements */ - int na; /* number of array elements already stored */ - int tostore; /* number of array elements pending to be stored */ -} ConsControl; - - -static void recfield (LexState *ls, ConsControl *cc) { - /* recfield -> (NAME | '['exp']') = exp */ - FuncState *fs = ls->fs; - int reg = ls->fs->freereg; - expdesc tab, key, val; - if (ls->t.token == TK_NAME) { - checklimit(fs, cc->nh, MAX_INT, "items in a constructor"); - codename(ls, &key); - } - else /* ls->t.token == '[' */ - yindex(ls, &key); - cc->nh++; - checknext(ls, '='); - tab = *cc->t; - luaK_indexed(fs, &tab, &key); - expr(ls, &val); - luaK_storevar(fs, &tab, &val); - fs->freereg = reg; /* free registers */ -} - - -static void closelistfield (FuncState *fs, ConsControl *cc) { - if (cc->v.k == VVOID) return; /* there is no list item */ - luaK_exp2nextreg(fs, &cc->v); - cc->v.k = VVOID; - if (cc->tostore == LFIELDS_PER_FLUSH) { - luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); /* flush */ - cc->na += cc->tostore; - cc->tostore = 0; /* no more items pending */ - } -} - - -static void lastlistfield (FuncState *fs, ConsControl *cc) { - if (cc->tostore == 0) return; - if (hasmultret(cc->v.k)) { - luaK_setmultret(fs, &cc->v); - luaK_setlist(fs, cc->t->u.info, cc->na, LUA_MULTRET); - cc->na--; /* do not count last expression (unknown number of elements) */ - } - else { - if (cc->v.k != VVOID) - luaK_exp2nextreg(fs, &cc->v); - luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); - } - cc->na += cc->tostore; -} - - -static void listfield (LexState *ls, ConsControl *cc) { - /* listfield -> exp */ - expr(ls, &cc->v); - cc->tostore++; -} - - -static void field (LexState *ls, ConsControl *cc) { - /* field -> listfield | recfield */ - switch(ls->t.token) { - case TK_NAME: { /* may be 'listfield' or 'recfield' */ - if (luaX_lookahead(ls) != '=') /* expression? */ - listfield(ls, cc); - else - recfield(ls, cc); - break; - } - case '[': { - recfield(ls, cc); - break; - } - default: { - listfield(ls, cc); - break; - } - } -} - - -static void constructor (LexState *ls, expdesc *t) { - /* constructor -> '{' [ field { sep field } [sep] ] '}' - sep -> ',' | ';' */ - FuncState *fs = ls->fs; - int line = ls->linenumber; - int pc = luaK_codeABC(fs, OP_NEWTABLE, 0, 0, 0); - ConsControl cc; - luaK_code(fs, 0); /* space for extra arg. */ - cc.na = cc.nh = cc.tostore = 0; - cc.t = t; - init_exp(t, VNONRELOC, fs->freereg); /* table will be at stack top */ - luaK_reserveregs(fs, 1); - init_exp(&cc.v, VVOID, 0); /* no value (yet) */ - checknext(ls, '{'); - do { - lua_assert(cc.v.k == VVOID || cc.tostore > 0); - if (ls->t.token == '}') break; - closelistfield(fs, &cc); - field(ls, &cc); - } while (testnext(ls, ',') || testnext(ls, ';')); - check_match(ls, '}', '{', line); - lastlistfield(fs, &cc); - luaK_settablesize(fs, pc, t->u.info, cc.na, cc.nh); -} - -/* }====================================================================== */ - - -static void setvararg (FuncState *fs, int nparams) { - fs->f->flag |= PF_ISVARARG; - luaK_codeABC(fs, OP_VARARGPREP, nparams, 0, 0); -} - - -static void parlist (LexState *ls) { - /* parlist -> [ {NAME ','} (NAME | '...') ] */ - FuncState *fs = ls->fs; - Proto *f = fs->f; - int nparams = 0; - int isvararg = 0; - if (ls->t.token != ')') { /* is 'parlist' not empty? */ - do { - switch (ls->t.token) { - case TK_NAME: { - new_localvar(ls, str_checkname(ls)); - nparams++; - break; - } - case TK_DOTS: { - luaX_next(ls); - isvararg = 1; - break; - } - default: luaX_syntaxerror(ls, " or '...' expected"); - } - } while (!isvararg && testnext(ls, ',')); - } - adjustlocalvars(ls, nparams); - f->numparams = cast_byte(fs->nactvar); - if (isvararg) - setvararg(fs, f->numparams); /* declared vararg */ - luaK_reserveregs(fs, fs->nactvar); /* reserve registers for parameters */ -} - - -static void body (LexState *ls, expdesc *e, int ismethod, int line) { - /* body -> '(' parlist ')' block END */ - FuncState new_fs; - BlockCnt bl; - new_fs.f = addprototype(ls); - new_fs.f->linedefined = line; - open_func(ls, &new_fs, &bl); - checknext(ls, '('); - if (ismethod) { - new_localvarliteral(ls, "self"); /* create 'self' parameter */ - adjustlocalvars(ls, 1); - } - parlist(ls); - checknext(ls, ')'); - statlist(ls); - new_fs.f->lastlinedefined = ls->linenumber; - check_match(ls, TK_END, TK_FUNCTION, line); - codeclosure(ls, e); - close_func(ls); -} - - -static int explist (LexState *ls, expdesc *v) { - /* explist -> expr { ',' expr } */ - int n = 1; /* at least one expression */ - expr(ls, v); - while (testnext(ls, ',')) { - luaK_exp2nextreg(ls->fs, v); - expr(ls, v); - n++; - } - return n; -} - - -static void funcargs (LexState *ls, expdesc *f) { - FuncState *fs = ls->fs; - expdesc args; - int base, nparams; - int line = ls->linenumber; - switch (ls->t.token) { - case '(': { /* funcargs -> '(' [ explist ] ')' */ - luaX_next(ls); - if (ls->t.token == ')') /* arg list is empty? */ - args.k = VVOID; - else { - explist(ls, &args); - if (hasmultret(args.k)) - luaK_setmultret(fs, &args); - } - check_match(ls, ')', '(', line); - break; - } - case '{': { /* funcargs -> constructor */ - constructor(ls, &args); - break; - } - case TK_STRING: { /* funcargs -> STRING */ - codestring(&args, ls->t.seminfo.ts); - luaX_next(ls); /* must use 'seminfo' before 'next' */ - break; - } - default: { - luaX_syntaxerror(ls, "function arguments expected"); - } - } - lua_assert(f->k == VNONRELOC); - base = f->u.info; /* base register for call */ - if (hasmultret(args.k)) - nparams = LUA_MULTRET; /* open call */ - else { - if (args.k != VVOID) - luaK_exp2nextreg(fs, &args); /* close last argument */ - nparams = fs->freereg - (base+1); - } - init_exp(f, VCALL, luaK_codeABC(fs, OP_CALL, base, nparams+1, 2)); - luaK_fixline(fs, line); - fs->freereg = base+1; /* call removes function and arguments and leaves - one result (unless changed later) */ -} - - - - -/* -** {====================================================================== -** Expression parsing -** ======================================================================= -*/ - - -static void primaryexp (LexState *ls, expdesc *v) { - /* primaryexp -> NAME | '(' expr ')' */ - switch (ls->t.token) { - case '(': { - int line = ls->linenumber; - luaX_next(ls); - expr(ls, v); - check_match(ls, ')', '(', line); - luaK_dischargevars(ls->fs, v); - return; - } - case TK_NAME: { - singlevar(ls, v); - return; - } - default: { - luaX_syntaxerror(ls, "unexpected symbol"); - } - } -} - - -static void suffixedexp (LexState *ls, expdesc *v) { - /* suffixedexp -> - primaryexp { '.' NAME | '[' exp ']' | ':' NAME funcargs | funcargs } */ - FuncState *fs = ls->fs; - primaryexp(ls, v); - for (;;) { - switch (ls->t.token) { - case '.': { /* fieldsel */ - fieldsel(ls, v); - break; - } - case '[': { /* '[' exp ']' */ - expdesc key; - luaK_exp2anyregup(fs, v); - yindex(ls, &key); - luaK_indexed(fs, v, &key); - break; - } - case ':': { /* ':' NAME funcargs */ - expdesc key; - luaX_next(ls); - codename(ls, &key); - luaK_self(fs, v, &key); - funcargs(ls, v); - break; - } - case '(': case TK_STRING: case '{': { /* funcargs */ - luaK_exp2nextreg(fs, v); - funcargs(ls, v); - break; - } - default: return; - } - } -} - - -static void simpleexp (LexState *ls, expdesc *v) { - /* simpleexp -> FLT | INT | STRING | NIL | TRUE | FALSE | ... | - constructor | FUNCTION body | suffixedexp */ - switch (ls->t.token) { - case TK_FLT: { - init_exp(v, VKFLT, 0); - v->u.nval = ls->t.seminfo.r; - break; - } - case TK_INT: { - init_exp(v, VKINT, 0); - v->u.ival = ls->t.seminfo.i; - break; - } - case TK_STRING: { - codestring(v, ls->t.seminfo.ts); - break; - } - case TK_NIL: { - init_exp(v, VNIL, 0); - break; - } - case TK_TRUE: { - init_exp(v, VTRUE, 0); - break; - } - case TK_FALSE: { - init_exp(v, VFALSE, 0); - break; - } - case TK_DOTS: { /* vararg */ - FuncState *fs = ls->fs; - check_condition(ls, fs->f->flag & PF_ISVARARG, - "cannot use '...' outside a vararg function"); - init_exp(v, VVARARG, luaK_codeABC(fs, OP_VARARG, 0, 0, 1)); - break; - } - case '{': { /* constructor */ - constructor(ls, v); - return; - } - case TK_FUNCTION: { - luaX_next(ls); - body(ls, v, 0, ls->linenumber); - return; - } - default: { - suffixedexp(ls, v); - return; - } - } - luaX_next(ls); -} - - -static UnOpr getunopr (int op) { - switch (op) { - case TK_NOT: return OPR_NOT; - case '-': return OPR_MINUS; - case '~': return OPR_BNOT; - case '#': return OPR_LEN; - default: return OPR_NOUNOPR; - } -} - - -static BinOpr getbinopr (int op) { - switch (op) { - case '+': return OPR_ADD; - case '-': return OPR_SUB; - case '*': return OPR_MUL; - case '%': return OPR_MOD; - case '^': return OPR_POW; - case '/': return OPR_DIV; - case TK_IDIV: return OPR_IDIV; - case '&': return OPR_BAND; - case '|': return OPR_BOR; - case '~': return OPR_BXOR; - case TK_SHL: return OPR_SHL; - case TK_SHR: return OPR_SHR; - case TK_CONCAT: return OPR_CONCAT; - case TK_NE: return OPR_NE; - case TK_EQ: return OPR_EQ; - case '<': return OPR_LT; - case TK_LE: return OPR_LE; - case '>': return OPR_GT; - case TK_GE: return OPR_GE; - case TK_AND: return OPR_AND; - case TK_OR: return OPR_OR; - default: return OPR_NOBINOPR; - } -} - - -/* -** Priority table for binary operators. -*/ -static const struct { - lu_byte left; /* left priority for each binary operator */ - lu_byte right; /* right priority */ -} priority[] = { /* ORDER OPR */ - {10, 10}, {10, 10}, /* '+' '-' */ - {11, 11}, {11, 11}, /* '*' '%' */ - {14, 13}, /* '^' (right associative) */ - {11, 11}, {11, 11}, /* '/' '//' */ - {6, 6}, {4, 4}, {5, 5}, /* '&' '|' '~' */ - {7, 7}, {7, 7}, /* '<<' '>>' */ - {9, 8}, /* '..' (right associative) */ - {3, 3}, {3, 3}, {3, 3}, /* ==, <, <= */ - {3, 3}, {3, 3}, {3, 3}, /* ~=, >, >= */ - {2, 2}, {1, 1} /* and, or */ -}; - -#define UNARY_PRIORITY 12 /* priority for unary operators */ - - -/* -** subexpr -> (simpleexp | unop subexpr) { binop subexpr } -** where 'binop' is any binary operator with a priority higher than 'limit' -*/ -static BinOpr subexpr (LexState *ls, expdesc *v, int limit) { - BinOpr op; - UnOpr uop; - enterlevel(ls); - uop = getunopr(ls->t.token); - if (uop != OPR_NOUNOPR) { /* prefix (unary) operator? */ - int line = ls->linenumber; - luaX_next(ls); /* skip operator */ - subexpr(ls, v, UNARY_PRIORITY); - luaK_prefix(ls->fs, uop, v, line); - } - else simpleexp(ls, v); - /* expand while operators have priorities higher than 'limit' */ - op = getbinopr(ls->t.token); - while (op != OPR_NOBINOPR && priority[op].left > limit) { - expdesc v2; - BinOpr nextop; - int line = ls->linenumber; - luaX_next(ls); /* skip operator */ - luaK_infix(ls->fs, op, v); - /* read sub-expression with higher priority */ - nextop = subexpr(ls, &v2, priority[op].right); - luaK_posfix(ls->fs, op, v, &v2, line); - op = nextop; - } - leavelevel(ls); - return op; /* return first untreated operator */ -} - - -static void expr (LexState *ls, expdesc *v) { - subexpr(ls, v, 0); -} - -/* }==================================================================== */ - - - -/* -** {====================================================================== -** Rules for Statements -** ======================================================================= -*/ - - -static void block (LexState *ls) { - /* block -> statlist */ - FuncState *fs = ls->fs; - BlockCnt bl; - enterblock(fs, &bl, 0); - statlist(ls); - leaveblock(fs); -} - - -/* -** structure to chain all variables in the left-hand side of an -** assignment -*/ -struct LHS_assign { - struct LHS_assign *prev; - expdesc v; /* variable (global, local, upvalue, or indexed) */ -}; - - -/* -** check whether, in an assignment to an upvalue/local variable, the -** upvalue/local variable is begin used in a previous assignment to a -** table. If so, save original upvalue/local value in a safe place and -** use this safe copy in the previous assignment. -*/ -static void check_conflict (LexState *ls, struct LHS_assign *lh, expdesc *v) { - FuncState *fs = ls->fs; - int extra = fs->freereg; /* eventual position to save local variable */ - int conflict = 0; - for (; lh; lh = lh->prev) { /* check all previous assignments */ - if (vkisindexed(lh->v.k)) { /* assignment to table field? */ - if (lh->v.k == VINDEXUP) { /* is table an upvalue? */ - if (v->k == VUPVAL && lh->v.u.ind.t == v->u.info) { - conflict = 1; /* table is the upvalue being assigned now */ - lh->v.k = VINDEXSTR; - lh->v.u.ind.t = extra; /* assignment will use safe copy */ - } - } - else { /* table is a register */ - if (v->k == VLOCAL && lh->v.u.ind.t == v->u.var.ridx) { - conflict = 1; /* table is the local being assigned now */ - lh->v.u.ind.t = extra; /* assignment will use safe copy */ - } - /* is index the local being assigned? */ - if (lh->v.k == VINDEXED && v->k == VLOCAL && - lh->v.u.ind.idx == v->u.var.ridx) { - conflict = 1; - lh->v.u.ind.idx = extra; /* previous assignment will use safe copy */ - } - } - } - } - if (conflict) { - /* copy upvalue/local value to a temporary (in position 'extra') */ - if (v->k == VLOCAL) - luaK_codeABC(fs, OP_MOVE, extra, v->u.var.ridx, 0); - else - luaK_codeABC(fs, OP_GETUPVAL, extra, v->u.info, 0); - luaK_reserveregs(fs, 1); - } -} - -/* -** Parse and compile a multiple assignment. The first "variable" -** (a 'suffixedexp') was already read by the caller. -** -** assignment -> suffixedexp restassign -** restassign -> ',' suffixedexp restassign | '=' explist -*/ -static void restassign (LexState *ls, struct LHS_assign *lh, int nvars) { - expdesc e; - check_condition(ls, vkisvar(lh->v.k), "syntax private_lua_error"); - check_readonly(ls, &lh->v); - if (testnext(ls, ',')) { /* restassign -> ',' suffixedexp restassign */ - struct LHS_assign nv; - nv.prev = lh; - suffixedexp(ls, &nv.v); - if (!vkisindexed(nv.v.k)) - check_conflict(ls, lh, &nv.v); - enterlevel(ls); /* control recursion depth */ - restassign(ls, &nv, nvars+1); - leavelevel(ls); - } - else { /* restassign -> '=' explist */ - int nexps; - checknext(ls, '='); - nexps = explist(ls, &e); - if (nexps != nvars) - adjust_assign(ls, nvars, nexps, &e); - else { - luaK_setoneret(ls->fs, &e); /* close last expression */ - luaK_storevar(ls->fs, &lh->v, &e); - return; /* avoid default */ - } - } - init_exp(&e, VNONRELOC, ls->fs->freereg-1); /* default assignment */ - luaK_storevar(ls->fs, &lh->v, &e); -} - - -static int cond (LexState *ls) { - /* cond -> exp */ - expdesc v; - expr(ls, &v); /* read condition */ - if (v.k == VNIL) v.k = VFALSE; /* 'falses' are all equal here */ - luaK_goiftrue(ls->fs, &v); - return v.f; -} - - -static void gotostat (LexState *ls) { - FuncState *fs = ls->fs; - int line = ls->linenumber; - TString *name = str_checkname(ls); /* label's name */ - Labeldesc *lb = findlabel(ls, name); - if (lb == NULL) /* no label? */ - /* forward jump; will be resolved when the label is declared */ - newgotoentry(ls, name, line, luaK_jump(fs)); - else { /* found a label */ - /* backward jump; will be resolved here */ - int lblevel = reglevel(fs, lb->nactvar); /* label level */ - if (luaY_nvarstack(fs) > lblevel) /* leaving the scope of a variable? */ - luaK_codeABC(fs, OP_CLOSE, lblevel, 0, 0); - /* create jump and link it to the label */ - luaK_patchlist(fs, luaK_jump(fs), lb->pc); - } -} - - -/* -** Break statement. Semantically equivalent to "goto break". -*/ -static void breakstat (LexState *ls) { - int line = ls->linenumber; - luaX_next(ls); /* skip break */ - newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, luaK_jump(ls->fs)); -} - - -/* -** Check whether there is already a label with the given 'name'. -*/ -static void checkrepeated (LexState *ls, TString *name) { - Labeldesc *lb = findlabel(ls, name); - if (l_unlikely(lb != NULL)) { /* already defined? */ - const char *msg = "label '%s' already defined on line %d"; - msg = luaO_pushfstring(ls->L, msg, getstr(name), lb->line); - luaK_semerror(ls, msg); /* error */ - } -} - - -static void labelstat (LexState *ls, TString *name, int line) { - /* label -> '::' NAME '::' */ - checknext(ls, TK_DBCOLON); /* skip double colon */ - while (ls->t.token == ';' || ls->t.token == TK_DBCOLON) - statement(ls); /* skip other no-op statements */ - checkrepeated(ls, name); /* check for repeated labels */ - createlabel(ls, name, line, block_follow(ls, 0)); -} - - -static void whilestat (LexState *ls, int line) { - /* whilestat -> WHILE cond DO block END */ - FuncState *fs = ls->fs; - int whileinit; - int condexit; - BlockCnt bl; - luaX_next(ls); /* skip WHILE */ - whileinit = luaK_getlabel(fs); - condexit = cond(ls); - enterblock(fs, &bl, 1); - checknext(ls, TK_DO); - block(ls); - luaK_jumpto(fs, whileinit); - check_match(ls, TK_END, TK_WHILE, line); - leaveblock(fs); - luaK_patchtohere(fs, condexit); /* false conditions finish the loop */ -} - - -static void repeatstat (LexState *ls, int line) { - /* repeatstat -> REPEAT block UNTIL cond */ - int condexit; - FuncState *fs = ls->fs; - int repeat_init = luaK_getlabel(fs); - BlockCnt bl1, bl2; - enterblock(fs, &bl1, 1); /* loop block */ - enterblock(fs, &bl2, 0); /* scope block */ - luaX_next(ls); /* skip REPEAT */ - statlist(ls); - check_match(ls, TK_UNTIL, TK_REPEAT, line); - condexit = cond(ls); /* read condition (inside scope block) */ - leaveblock(fs); /* finish scope */ - if (bl2.upval) { /* upvalues? */ - int exit = luaK_jump(fs); /* normal exit must jump over fix */ - luaK_patchtohere(fs, condexit); /* repetition must close upvalues */ - luaK_codeABC(fs, OP_CLOSE, reglevel(fs, bl2.nactvar), 0, 0); - condexit = luaK_jump(fs); /* repeat after closing upvalues */ - luaK_patchtohere(fs, exit); /* normal exit comes to here */ - } - luaK_patchlist(fs, condexit, repeat_init); /* close the loop */ - leaveblock(fs); /* finish loop */ -} - - -/* -** Read an expression and generate code to put its results in next -** stack slot. -** -*/ -static void exp1 (LexState *ls) { - expdesc e; - expr(ls, &e); - luaK_exp2nextreg(ls->fs, &e); - lua_assert(e.k == VNONRELOC); -} - - -/* -** Fix for instruction at position 'pc' to jump to 'dest'. -** (Jump addresses are relative in Lua). 'back' true means -** a back jump. -*/ -static void fixforjump (FuncState *fs, int pc, int dest, int back) { - Instruction *jmp = &fs->f->code[pc]; - int offset = dest - (pc + 1); - if (back) - offset = -offset; - if (l_unlikely(offset > MAXARG_Bx)) - luaX_syntaxerror(fs->ls, "control structure too long"); - SETARG_Bx(*jmp, offset); -} - - -/* -** Generate code for a 'for' loop. -*/ -static void forbody (LexState *ls, int base, int line, int nvars, int isgen) { - /* forbody -> DO block */ - static const OpCode forprep[2] = {OP_FORPREP, OP_TFORPREP}; - static const OpCode forloop[2] = {OP_FORLOOP, OP_TFORLOOP}; - BlockCnt bl; - FuncState *fs = ls->fs; - int prep, endfor; - checknext(ls, TK_DO); - prep = luaK_codeABx(fs, forprep[isgen], base, 0); - fs->freereg--; /* both 'forprep' remove one register from the stack */ - enterblock(fs, &bl, 0); /* scope for declared variables */ - adjustlocalvars(ls, nvars); - luaK_reserveregs(fs, nvars); - block(ls); - leaveblock(fs); /* end of scope for declared variables */ - fixforjump(fs, prep, luaK_getlabel(fs), 0); - if (isgen) { /* generic for? */ - luaK_codeABC(fs, OP_TFORCALL, base, 0, nvars); - luaK_fixline(fs, line); - } - endfor = luaK_codeABx(fs, forloop[isgen], base, 0); - fixforjump(fs, endfor, prep + 1, 1); - luaK_fixline(fs, line); -} - - -static void fornum (LexState *ls, TString *varname, int line) { - /* fornum -> NAME = exp,exp[,exp] forbody */ - FuncState *fs = ls->fs; - int base = fs->freereg; - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvarkind(ls, varname, RDKCONST); /* control variable */ - checknext(ls, '='); - exp1(ls); /* initial value */ - checknext(ls, ','); - exp1(ls); /* limit */ - if (testnext(ls, ',')) - exp1(ls); /* optional step */ - else { /* default step = 1 */ - luaK_int(fs, fs->freereg, 1); - luaK_reserveregs(fs, 1); - } - adjustlocalvars(ls, 2); /* start scope for internal variables */ - forbody(ls, base, line, 1, 0); -} - - -static void forlist (LexState *ls, TString *indexname) { - /* forlist -> NAME {,NAME} IN explist forbody */ - FuncState *fs = ls->fs; - expdesc e; - int nvars = 4; /* function, state, closing, control */ - int line; - int base = fs->freereg; - /* create internal variables */ - new_localvarliteral(ls, "(for state)"); /* iterator function */ - new_localvarliteral(ls, "(for state)"); /* state */ - new_localvarliteral(ls, "(for state)"); /* closing var. (after swap) */ - new_localvarkind(ls, indexname, RDKCONST); /* control variable */ - /* other declared variables */ - while (testnext(ls, ',')) { - new_localvar(ls, str_checkname(ls)); - nvars++; - } - checknext(ls, TK_IN); - line = ls->linenumber; - adjust_assign(ls, 4, explist(ls, &e), &e); - adjustlocalvars(ls, 3); /* start scope for internal variables */ - marktobeclosed(fs); /* last internal var. must be closed */ - luaK_checkstack(fs, 2); /* extra space to call iterator */ - forbody(ls, base, line, nvars - 3, 1); -} - - -static void forstat (LexState *ls, int line) { - /* forstat -> FOR (fornum | forlist) END */ - FuncState *fs = ls->fs; - TString *varname; - BlockCnt bl; - enterblock(fs, &bl, 1); /* scope for loop and control variables */ - luaX_next(ls); /* skip 'for' */ - varname = str_checkname(ls); /* first variable name */ - switch (ls->t.token) { - case '=': fornum(ls, varname, line); break; - case ',': case TK_IN: forlist(ls, varname); break; - default: luaX_syntaxerror(ls, "'=' or 'in' expected"); - } - check_match(ls, TK_END, TK_FOR, line); - leaveblock(fs); /* loop scope ('break' jumps to this point) */ -} - - -static void test_then_block (LexState *ls, int *escapelist) { - /* test_then_block -> [IF | ELSEIF] cond THEN block */ - BlockCnt bl; - FuncState *fs = ls->fs; - expdesc v; - int jf; /* instruction to skip 'then' code (if condition is false) */ - luaX_next(ls); /* skip IF or ELSEIF */ - expr(ls, &v); /* read condition */ - checknext(ls, TK_THEN); - if (ls->t.token == TK_BREAK) { /* 'if x then break' ? */ - int line = ls->linenumber; - luaK_goiffalse(ls->fs, &v); /* will jump if condition is true */ - luaX_next(ls); /* skip 'break' */ - enterblock(fs, &bl, 0); /* must enter block before 'goto' */ - newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, v.t); - while (testnext(ls, ';')) {} /* skip semicolons */ - if (block_follow(ls, 0)) { /* jump is the entire block? */ - leaveblock(fs); - return; /* and that is it */ - } - else /* must skip over 'then' part if condition is false */ - jf = luaK_jump(fs); - } - else { /* regular case (not a break) */ - luaK_goiftrue(ls->fs, &v); /* skip over block if condition is false */ - enterblock(fs, &bl, 0); - jf = v.f; - } - statlist(ls); /* 'then' part */ - leaveblock(fs); - if (ls->t.token == TK_ELSE || - ls->t.token == TK_ELSEIF) /* followed by 'else'/'elseif'? */ - luaK_concat(fs, escapelist, luaK_jump(fs)); /* must jump over it */ - luaK_patchtohere(fs, jf); -} - - -static void ifstat (LexState *ls, int line) { - /* ifstat -> IF cond THEN block {ELSEIF cond THEN block} [ELSE block] END */ - FuncState *fs = ls->fs; - int escapelist = NO_JUMP; /* exit list for finished parts */ - test_then_block(ls, &escapelist); /* IF cond THEN block */ - while (ls->t.token == TK_ELSEIF) - test_then_block(ls, &escapelist); /* ELSEIF cond THEN block */ - if (testnext(ls, TK_ELSE)) - block(ls); /* 'else' part */ - check_match(ls, TK_END, TK_IF, line); - luaK_patchtohere(fs, escapelist); /* patch escape list to 'if' end */ -} - - -static void localfunc (LexState *ls) { - expdesc b; - FuncState *fs = ls->fs; - int fvar = fs->nactvar; /* function's variable index */ - new_localvar(ls, str_checkname(ls)); /* new local variable */ - adjustlocalvars(ls, 1); /* enter its scope */ - body(ls, &b, 0, ls->linenumber); /* function created in next register */ - /* debug information will only see the variable after this point! */ - localdebuginfo(fs, fvar)->startpc = fs->pc; -} - - -static int getlocalattribute (LexState *ls) { - /* ATTRIB -> ['<' Name '>'] */ - if (testnext(ls, '<')) { - TString *ts = str_checkname(ls); - const char *attr = getstr(ts); - checknext(ls, '>'); - if (strcmp(attr, "const") == 0) - return RDKCONST; /* read-only variable */ - else if (strcmp(attr, "close") == 0) - return RDKTOCLOSE; /* to-be-closed variable */ - else - luaK_semerror(ls, - luaO_pushfstring(ls->L, "unknown attribute '%s'", attr)); - } - return VDKREG; /* regular variable */ -} - - -static void checktoclose (FuncState *fs, int level) { - if (level != -1) { /* is there a to-be-closed variable? */ - marktobeclosed(fs); - luaK_codeABC(fs, OP_TBC, reglevel(fs, level), 0, 0); - } -} - - -static void localstat (LexState *ls) { - /* stat -> LOCAL NAME ATTRIB { ',' NAME ATTRIB } ['=' explist] */ - FuncState *fs = ls->fs; - int toclose = -1; /* index of to-be-closed variable (if any) */ - Vardesc *var; /* last variable */ - int vidx; /* index of last variable */ - int nvars = 0; - int nexps; - expdesc e; - do { - TString *vname = str_checkname(ls); - int kind = getlocalattribute(ls); - vidx = new_localvarkind(ls, vname, kind); - if (kind == RDKTOCLOSE) { /* to-be-closed? */ - if (toclose != -1) /* one already present? */ - luaK_semerror(ls, "multiple to-be-closed variables in local list"); - toclose = fs->nactvar + nvars; - } - nvars++; - } while (testnext(ls, ',')); - if (testnext(ls, '=')) - nexps = explist(ls, &e); - else { - e.k = VVOID; - nexps = 0; - } - var = getlocalvardesc(fs, vidx); /* get last variable */ - if (nvars == nexps && /* no adjustments? */ - var->vd.kind == RDKCONST && /* last variable is const? */ - luaK_exp2const(fs, &e, &var->k)) { /* compile-time constant? */ - var->vd.kind = RDKCTC; /* variable is a compile-time constant */ - adjustlocalvars(ls, nvars - 1); /* exclude last variable */ - fs->nactvar++; /* but count it */ - } - else { - adjust_assign(ls, nvars, nexps, &e); - adjustlocalvars(ls, nvars); - } - checktoclose(fs, toclose); -} - - -static int funcname (LexState *ls, expdesc *v) { - /* funcname -> NAME {fieldsel} [':' NAME] */ - int ismethod = 0; - singlevar(ls, v); - while (ls->t.token == '.') - fieldsel(ls, v); - if (ls->t.token == ':') { - ismethod = 1; - fieldsel(ls, v); - } - return ismethod; -} - - -static void funcstat (LexState *ls, int line) { - /* funcstat -> FUNCTION funcname body */ - int ismethod; - expdesc v, b; - luaX_next(ls); /* skip FUNCTION */ - ismethod = funcname(ls, &v); - body(ls, &b, ismethod, line); - check_readonly(ls, &v); - luaK_storevar(ls->fs, &v, &b); - luaK_fixline(ls->fs, line); /* definition "happens" in the first line */ -} - - -static void exprstat (LexState *ls) { - /* stat -> func | assignment */ - FuncState *fs = ls->fs; - struct LHS_assign v; - suffixedexp(ls, &v.v); - if (ls->t.token == '=' || ls->t.token == ',') { /* stat -> assignment ? */ - v.prev = NULL; - restassign(ls, &v, 1); - } - else { /* stat -> func */ - Instruction *inst; - check_condition(ls, v.v.k == VCALL, "syntax private_lua_error"); - inst = &getinstruction(fs, &v.v); - SETARG_C(*inst, 1); /* call statement uses no results */ - } -} - - -static void retstat (LexState *ls) { - /* stat -> RETURN [explist] [';'] */ - FuncState *fs = ls->fs; - expdesc e; - int nret; /* number of values being returned */ - int first = luaY_nvarstack(fs); /* first slot to be returned */ - if (block_follow(ls, 1) || ls->t.token == ';') - nret = 0; /* return no values */ - else { - nret = explist(ls, &e); /* optional return values */ - if (hasmultret(e.k)) { - luaK_setmultret(fs, &e); - if (e.k == VCALL && nret == 1 && !fs->bl->insidetbc) { /* tail call? */ - SET_OPCODE(getinstruction(fs,&e), OP_TAILCALL); - lua_assert(GETARG_A(getinstruction(fs,&e)) == luaY_nvarstack(fs)); - } - nret = LUA_MULTRET; /* return all values */ - } - else { - if (nret == 1) /* only one single value? */ - first = luaK_exp2anyreg(fs, &e); /* can use original slot */ - else { /* values must go to the top of the stack */ - luaK_exp2nextreg(fs, &e); - lua_assert(nret == fs->freereg - first); - } - } - } - luaK_ret(fs, first, nret); - testnext(ls, ';'); /* skip optional semicolon */ -} - - -static void statement (LexState *ls) { - int line = ls->linenumber; /* may be needed for error messages */ - enterlevel(ls); - switch (ls->t.token) { - case ';': { /* stat -> ';' (empty statement) */ - luaX_next(ls); /* skip ';' */ - break; - } - case TK_IF: { /* stat -> ifstat */ - ifstat(ls, line); - break; - } - case TK_WHILE: { /* stat -> whilestat */ - whilestat(ls, line); - break; - } - case TK_DO: { /* stat -> DO block END */ - luaX_next(ls); /* skip DO */ - block(ls); - check_match(ls, TK_END, TK_DO, line); - break; - } - case TK_FOR: { /* stat -> forstat */ - forstat(ls, line); - break; - } - case TK_REPEAT: { /* stat -> repeatstat */ - repeatstat(ls, line); - break; - } - case TK_FUNCTION: { /* stat -> funcstat */ - funcstat(ls, line); - break; - } - case TK_LOCAL: { /* stat -> localstat */ - luaX_next(ls); /* skip LOCAL */ - if (testnext(ls, TK_FUNCTION)) /* local function? */ - localfunc(ls); - else - localstat(ls); - break; - } - case TK_DBCOLON: { /* stat -> label */ - luaX_next(ls); /* skip double colon */ - labelstat(ls, str_checkname(ls), line); - break; - } - case TK_RETURN: { /* stat -> retstat */ - luaX_next(ls); /* skip RETURN */ - retstat(ls); - break; - } - case TK_BREAK: { /* stat -> breakstat */ - breakstat(ls); - break; - } - case TK_GOTO: { /* stat -> 'goto' NAME */ - luaX_next(ls); /* skip 'goto' */ - gotostat(ls); - break; - } - default: { /* stat -> func | assignment */ - exprstat(ls); - break; - } - } - lua_assert(ls->fs->f->maxstacksize >= ls->fs->freereg && - ls->fs->freereg >= luaY_nvarstack(ls->fs)); - ls->fs->freereg = luaY_nvarstack(ls->fs); /* free registers */ - leavelevel(ls); -} - -/* }====================================================================== */ - - -/* -** compiles the main function, which is a regular vararg function with an -** upvalue named LUA_ENV -*/ -static void mainfunc (LexState *ls, FuncState *fs) { - BlockCnt bl; - Upvaldesc *env; - open_func(ls, fs, &bl); - setvararg(fs, 0); /* main function is always declared vararg */ - env = allocupvalue(fs); /* ...set environment upvalue */ - env->instack = 1; - env->idx = 0; - env->kind = VDKREG; - env->name = ls->envn; - luaC_objbarrier(ls->L, fs->f, env->name); - luaX_next(ls); /* read first token */ - statlist(ls); /* parse main body */ - check(ls, TK_EOS); - close_func(ls); -} - - -LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, - Dyndata *dyd, const char *name, int firstchar) { - LexState lexstate; - FuncState funcstate; - LClosure *cl = luaF_newLclosure(L, 1); /* create main closure */ - setclLvalue2s(L, L->top.p, cl); /* anchor it (to avoid being collected) */ - luaD_inctop(L); - lexstate.h = luaH_new(L); /* create table for scanner */ - sethvalue2s(L, L->top.p, lexstate.h); /* anchor it */ - luaD_inctop(L); - funcstate.f = cl->p = luaF_newproto(L); - luaC_objbarrier(L, cl, cl->p); - funcstate.f->source = luaS_new(L, name); /* create and anchor TString */ - luaC_objbarrier(L, funcstate.f, funcstate.f->source); - lexstate.buff = buff; - lexstate.dyd = dyd; - dyd->actvar.n = dyd->gt.n = dyd->label.n = 0; - luaX_setinput(L, &lexstate, z, funcstate.f->source, firstchar); - mainfunc(&lexstate, &funcstate); - lua_assert(!funcstate.prev && funcstate.nups == 1 && !lexstate.fs); - /* all scopes should be correctly finished */ - lua_assert(dyd->actvar.n == 0 && dyd->gt.n == 0 && dyd->label.n == 0); - L->top.p--; /* remove scanner's table */ - return cl; /* closure is on the stack, too */ -} - - - -/* -** $Id: ldebug.c $ -** Debug Interface -** See Copyright Notice in lua.h -*/ - -#define ldebug_c -#define LUA_CORE - - - -#include -#include -#include - - - - - -#define noLuaClosure(f) ((f) == NULL || (f)->c.tt == LUA_VCCL) - - -static const char *funcnamefromcall (lua_State *L, CallInfo *ci, - const char **name); - - -static int currentpc (CallInfo *ci) { - lua_assert(isLua(ci)); - return pcRel(ci->u.l.savedpc, ci_func(ci)->p); -} - - -/* -** Get a "base line" to find the line corresponding to an instruction. -** Base lines are regularly placed at MAXIWTHABS intervals, so usually -** an integer division gets the right place. When the source file has -** large sequences of empty/comment lines, it may need extra entries, -** so the original estimate needs a correction. -** If the original estimate is -1, the initial 'if' ensures that the -** 'while' will run at least once. -** The assertion that the estimate is a lower bound for the correct base -** is valid as long as the debug info has been generated with the same -** value for MAXIWTHABS or smaller. (Previous releases use a little -** smaller value.) -*/ -static int getbaseline (const Proto *f, int pc, int *basepc) { - if (f->sizeabslineinfo == 0 || pc < f->abslineinfo[0].pc) { - *basepc = -1; /* start from the beginning */ - return f->linedefined; - } - else { - int i = cast_uint(pc) / MAXIWTHABS - 1; /* get an estimate */ - /* estimate must be a lower bound of the correct base */ - lua_assert(i < 0 || - (i < f->sizeabslineinfo && f->abslineinfo[i].pc <= pc)); - while (i + 1 < f->sizeabslineinfo && pc >= f->abslineinfo[i + 1].pc) - i++; /* low estimate; adjust it */ - *basepc = f->abslineinfo[i].pc; - return f->abslineinfo[i].line; - } -} - - -/* -** Get the line corresponding to instruction 'pc' in function 'f'; -** first gets a base line and from there does the increments until -** the desired instruction. -*/ -int luaG_getfuncline (const Proto *f, int pc) { - if (f->lineinfo == NULL) /* no debug information? */ - return -1; - else { - int basepc; - int baseline = getbaseline(f, pc, &basepc); - while (basepc++ < pc) { /* walk until given instruction */ - lua_assert(f->lineinfo[basepc] != ABSLINEINFO); - baseline += f->lineinfo[basepc]; /* correct line */ - } - return baseline; - } -} - - -static int getcurrentline (CallInfo *ci) { - return luaG_getfuncline(ci_func(ci)->p, currentpc(ci)); -} - - -/* -** Set 'trap' for all active Lua frames. -** This function can be called during a signal, under "reasonable" -** assumptions. A new 'ci' is completely linked in the list before it -** becomes part of the "active" list, and we assume that pointers are -** atomic; see comment in next function. -** (A compiler doing interprocedural optimizations could, theoretically, -** reorder memory writes in such a way that the list could be -** temporarily broken while inserting a new element. We simply assume it -** has no good reasons to do that.) -*/ -static void settraps (CallInfo *ci) { - for (; ci != NULL; ci = ci->previous) - if (isLua(ci)) - ci->u.l.trap = 1; -} - - -/* -** This function can be called during a signal, under "reasonable" -** assumptions. -** Fields 'basehookcount' and 'hookcount' (set by 'resethookcount') -** are for debug only, and it is no problem if they get arbitrary -** values (causes at most one wrong hook call). 'hookmask' is an atomic -** value. We assume that pointers are atomic too (e.g., gcc ensures that -** for all platforms where it runs). Moreover, 'hook' is always checked -** before being called (see 'luaD_hook'). -*/ -LUA_API void lua_sethook (lua_State *L, lua_Hook func, int mask, int count) { - if (func == NULL || mask == 0) { /* turn off hooks? */ - mask = 0; - func = NULL; - } - L->hook = func; - L->basehookcount = count; - resethookcount(L); - L->hookmask = cast_byte(mask); - if (mask) - settraps(L->ci); /* to trace inside 'luaV_execute' */ -} - - -LUA_API lua_Hook lua_gethook (lua_State *L) { - return L->hook; -} - - -LUA_API int lua_gethookmask (lua_State *L) { - return L->hookmask; -} - - -LUA_API int lua_gethookcount (lua_State *L) { - return L->basehookcount; -} - - -LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar) { - int status; - CallInfo *ci; - if (level < 0) return 0; /* invalid (negative) level */ - lua_lock(L); - for (ci = L->ci; level > 0 && ci != &L->base_ci; ci = ci->previous) - level--; - if (level == 0 && ci != &L->base_ci) { /* level found? */ - status = 1; - ar->i_ci = ci; - } - else status = 0; /* no such level */ - lua_unlock(L); - return status; -} - - -static const char *upvalname (const Proto *p, int uv) { - TString *s = check_exp(uv < p->sizeupvalues, p->upvalues[uv].name); - if (s == NULL) return "?"; - else return getstr(s); -} - - -static const char *findvararg (CallInfo *ci, int n, StkId *pos) { - if (clLvalue(s2v(ci->func.p))->p->flag & PF_ISVARARG) { - int nextra = ci->u.l.nextraargs; - if (n >= -nextra) { /* 'n' is negative */ - *pos = ci->func.p - nextra - (n + 1); - return "(vararg)"; /* generic name for any vararg */ - } - } - return NULL; /* no such vararg */ -} - - -const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, StkId *pos) { - StkId base = ci->func.p + 1; - const char *name = NULL; - if (isLua(ci)) { - if (n < 0) /* access to vararg values? */ - return findvararg(ci, n, pos); - else - name = luaF_getlocalname(ci_func(ci)->p, n, currentpc(ci)); - } - if (name == NULL) { /* no 'standard' name? */ - StkId limit = (ci == L->ci) ? L->top.p : ci->next->func.p; - if (limit - base >= n && n > 0) { /* is 'n' inside 'ci' stack? */ - /* generic name for any valid slot */ - name = isLua(ci) ? "(temporary)" : "(C temporary)"; - } - else - return NULL; /* no name */ - } - if (pos) - *pos = base + (n - 1); - return name; -} - - -LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) { - const char *name; - lua_lock(L); - if (ar == NULL) { /* information about non-active function? */ - if (!isLfunction(s2v(L->top.p - 1))) /* not a Lua function? */ - name = NULL; - else /* consider live variables at function start (parameters) */ - name = luaF_getlocalname(clLvalue(s2v(L->top.p - 1))->p, n, 0); - } - else { /* active function; get information through 'ar' */ - StkId pos = NULL; /* to avoid warnings */ - name = luaG_findlocal(L, ar->i_ci, n, &pos); - if (name) { - setobjs2s(L, L->top.p, pos); - api_incr_top(L); - } - } - lua_unlock(L); - return name; -} - - -LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) { - StkId pos = NULL; /* to avoid warnings */ - const char *name; - lua_lock(L); - name = luaG_findlocal(L, ar->i_ci, n, &pos); - if (name) { - api_checkpop(L, 1); - setobjs2s(L, pos, L->top.p - 1); - L->top.p--; /* pop value */ - } - lua_unlock(L); - return name; -} - - -static void funcinfo (lua_Debug *ar, Closure *cl) { - if (noLuaClosure(cl)) { - ar->source = "=[C]"; - ar->srclen = LL("=[C]"); - ar->linedefined = -1; - ar->lastlinedefined = -1; - ar->what = "C"; - } - else { - const Proto *p = cl->l.p; - if (p->source) { - ar->source = getlstr(p->source, ar->srclen); - } - else { - ar->source = "=?"; - ar->srclen = LL("=?"); - } - ar->linedefined = p->linedefined; - ar->lastlinedefined = p->lastlinedefined; - ar->what = (ar->linedefined == 0) ? "main" : "Lua"; - } - luaO_chunkid(ar->short_src, ar->source, ar->srclen); -} - - -static int nextline (const Proto *p, int currentline, int pc) { - if (p->lineinfo[pc] != ABSLINEINFO) - return currentline + p->lineinfo[pc]; - else - return luaG_getfuncline(p, pc); -} - - -static void collectvalidlines (lua_State *L, Closure *f) { - if (noLuaClosure(f)) { - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - } - else { - int i; - TValue v; - const Proto *p = f->l.p; - int currentline = p->linedefined; - Table *t = luaH_new(L); /* new table to store active lines */ - sethvalue2s(L, L->top.p, t); /* push it on stack */ - api_incr_top(L); - setbtvalue(&v); /* boolean 'true' to be the value of all indices */ - if (!(p->flag & PF_ISVARARG)) /* regular function? */ - i = 0; /* consider all instructions */ - else { /* vararg function */ - lua_assert(GET_OPCODE(p->code[0]) == OP_VARARGPREP); - currentline = nextline(p, currentline, 0); - i = 1; /* skip first instruction (OP_VARARGPREP) */ - } - for (; i < p->sizelineinfo; i++) { /* for each instruction */ - currentline = nextline(p, currentline, i); /* get its line */ - luaH_setint(L, t, currentline, &v); /* table[line] = true */ - } - } -} - - -static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name) { - /* calling function is a known function? */ - if (ci != NULL && !(ci->callstatus & CIST_TAIL)) - return funcnamefromcall(L, ci->previous, name); - else return NULL; /* no way to find a name */ -} - - -static int auxgetinfo (lua_State *L, const char *what, lua_Debug *ar, - Closure *f, CallInfo *ci) { - int status = 1; - for (; *what; what++) { - switch (*what) { - case 'S': { - funcinfo(ar, f); - break; - } - case 'l': { - ar->currentline = (ci && isLua(ci)) ? getcurrentline(ci) : -1; - break; - } - case 'u': { - ar->nups = (f == NULL) ? 0 : f->c.nupvalues; - if (noLuaClosure(f)) { - ar->isvararg = 1; - ar->nparams = 0; - } - else { - ar->isvararg = f->l.p->flag & PF_ISVARARG; - ar->nparams = f->l.p->numparams; - } - break; - } - case 't': { - ar->istailcall = (ci) ? ci->callstatus & CIST_TAIL : 0; - break; - } - case 'n': { - ar->namewhat = getfuncname(L, ci, &ar->name); - if (ar->namewhat == NULL) { - ar->namewhat = ""; /* not found */ - ar->name = NULL; - } - break; - } - case 'r': { - if (ci == NULL || !(ci->callstatus & CIST_TRAN)) - ar->ftransfer = ar->ntransfer = 0; - else { - ar->ftransfer = ci->u2.transferinfo.ftransfer; - ar->ntransfer = ci->u2.transferinfo.ntransfer; - } - break; - } - case 'L': - case 'f': /* handled by lua_getinfo */ - break; - default: status = 0; /* invalid option */ - } - } - return status; -} - - -LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) { - int status; - Closure *cl; - CallInfo *ci; - TValue *func; - lua_lock(L); - if (*what == '>') { - ci = NULL; - func = s2v(L->top.p - 1); - api_check(L, ttisfunction(func), "function expected"); - what++; /* skip the '>' */ - L->top.p--; /* pop function */ - } - else { - ci = ar->i_ci; - func = s2v(ci->func.p); - lua_assert(ttisfunction(func)); - } - cl = ttisclosure(func) ? clvalue(func) : NULL; - status = auxgetinfo(L, what, ar, cl, ci); - if (strchr(what, 'f')) { - setobj2s(L, L->top.p, func); - api_incr_top(L); - } - if (strchr(what, 'L')) - collectvalidlines(L, cl); - lua_unlock(L); - return status; -} - - -/* -** {====================================================== -** Symbolic Execution -** ======================================================= -*/ - - -static int filterpc (int pc, int jmptarget) { - if (pc < jmptarget) /* is code conditional (inside a jump)? */ - return -1; /* cannot know who sets that register */ - else return pc; /* current position sets that register */ -} - - -/* -** Try to find last instruction before 'lastpc' that modified register 'reg'. -*/ -static int findsetreg (const Proto *p, int lastpc, int reg) { - int pc; - int setreg = -1; /* keep last instruction that changed 'reg' */ - int jmptarget = 0; /* any code before this address is conditional */ - if (testMMMode(GET_OPCODE(p->code[lastpc]))) - lastpc--; /* previous instruction was not actually executed */ - for (pc = 0; pc < lastpc; pc++) { - Instruction i = p->code[pc]; - OpCode op = GET_OPCODE(i); - int a = GETARG_A(i); - int change; /* true if current instruction changed 'reg' */ - switch (op) { - case OP_LOADNIL: { /* set registers from 'a' to 'a+b' */ - int b = GETARG_B(i); - change = (a <= reg && reg <= a + b); - break; - } - case OP_TFORCALL: { /* affect all regs above its base */ - change = (reg >= a + 2); - break; - } - case OP_CALL: - case OP_TAILCALL: { /* affect all registers above base */ - change = (reg >= a); - break; - } - case OP_JMP: { /* doesn't change registers, but changes 'jmptarget' */ - int b = GETARG_sJ(i); - int dest = pc + 1 + b; - /* jump does not skip 'lastpc' and is larger than current one? */ - if (dest <= lastpc && dest > jmptarget) - jmptarget = dest; /* update 'jmptarget' */ - change = 0; - break; - } - default: /* any instruction that sets A */ - change = (testAMode(op) && reg == a); - break; - } - if (change) - setreg = filterpc(pc, jmptarget); - } - return setreg; -} - - -/* -** Find a "name" for the constant 'c'. -*/ -static const char *kname (const Proto *p, int index, const char **name) { - TValue *kvalue = &p->k[index]; - if (ttisstring(kvalue)) { - *name = getstr(tsvalue(kvalue)); - return "constant"; - } - else { - *name = "?"; - return NULL; - } -} - - -static const char *basicgetobjname (const Proto *p, int *ppc, int reg, - const char **name) { - int pc = *ppc; - *name = luaF_getlocalname(p, reg + 1, pc); - if (*name) /* is a local? */ - return "local"; - /* else try symbolic execution */ - *ppc = pc = findsetreg(p, pc, reg); - if (pc != -1) { /* could find instruction? */ - Instruction i = p->code[pc]; - OpCode op = GET_OPCODE(i); - switch (op) { - case OP_MOVE: { - int b = GETARG_B(i); /* move from 'b' to 'a' */ - if (b < GETARG_A(i)) - return basicgetobjname(p, ppc, b, name); /* get name for 'b' */ - break; - } - case OP_GETUPVAL: { - *name = upvalname(p, GETARG_B(i)); - return "upvalue"; - } - case OP_LOADK: return kname(p, GETARG_Bx(i), name); - case OP_LOADKX: return kname(p, GETARG_Ax(p->code[pc + 1]), name); - default: break; - } - } - return NULL; /* could not find reasonable name */ -} - - -/* -** Find a "name" for the register 'c'. -*/ -static void rname (const Proto *p, int pc, int c, const char **name) { - const char *what = basicgetobjname(p, &pc, c, name); /* search for 'c' */ - if (!(what && *what == 'c')) /* did not find a constant name? */ - *name = "?"; -} - - -/* -** Find a "name" for a 'C' value in an RK instruction. -*/ -static void rkname (const Proto *p, int pc, Instruction i, const char **name) { - int c = GETARG_C(i); /* key index */ - if (GETARG_k(i)) /* is 'c' a constant? */ - kname(p, c, name); - else /* 'c' is a register */ - rname(p, pc, c, name); -} - - -/* -** Check whether table being indexed by instruction 'i' is the -** environment '_ENV' -*/ -static const char *isEnv (const Proto *p, int pc, Instruction i, int isup) { - int t = GETARG_B(i); /* table index */ - const char *name; /* name of indexed variable */ - if (isup) /* is 't' an upvalue? */ - name = upvalname(p, t); - else /* 't' is a register */ - basicgetobjname(p, &pc, t, &name); - return (name && strcmp(name, LUA_ENV) == 0) ? "global" : "field"; -} - - -/* -** Extend 'basicgetobjname' to handle table accesses -*/ -static const char *getobjname (const Proto *p, int lastpc, int reg, - const char **name) { - const char *kind = basicgetobjname(p, &lastpc, reg, name); - if (kind != NULL) - return kind; - else if (lastpc != -1) { /* could find instruction? */ - Instruction i = p->code[lastpc]; - OpCode op = GET_OPCODE(i); - switch (op) { - case OP_GETTABUP: { - int k = GETARG_C(i); /* key index */ - kname(p, k, name); - return isEnv(p, lastpc, i, 1); - } - case OP_GETTABLE: { - int k = GETARG_C(i); /* key index */ - rname(p, lastpc, k, name); - return isEnv(p, lastpc, i, 0); - } - case OP_GETI: { - *name = "integer index"; - return "field"; - } - case OP_GETFIELD: { - int k = GETARG_C(i); /* key index */ - kname(p, k, name); - return isEnv(p, lastpc, i, 0); - } - case OP_SELF: { - rkname(p, lastpc, i, name); - return "method"; - } - default: break; /* go through to return NULL */ - } - } - return NULL; /* could not find reasonable name */ -} - - -/* -** Try to find a name for a function based on the code that called it. -** (Only works when function was called by a Lua function.) -** Returns what the name is (e.g., "for iterator", "method", -** "metamethod") and sets '*name' to point to the name. -*/ -static const char *funcnamefromcode (lua_State *L, const Proto *p, - int pc, const char **name) { - TMS tm = (TMS)0; /* (initial value avoids warnings) */ - Instruction i = p->code[pc]; /* calling instruction */ - switch (GET_OPCODE(i)) { - case OP_CALL: - case OP_TAILCALL: - return getobjname(p, pc, GETARG_A(i), name); /* get function name */ - case OP_TFORCALL: { /* for iterator */ - *name = "for iterator"; - return "for iterator"; - } - /* other instructions can do calls through metamethods */ - case OP_SELF: case OP_GETTABUP: case OP_GETTABLE: - case OP_GETI: case OP_GETFIELD: - tm = TM_INDEX; - break; - case OP_SETTABUP: case OP_SETTABLE: case OP_SETI: case OP_SETFIELD: - tm = TM_NEWINDEX; - break; - case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { - tm = cast(TMS, GETARG_C(i)); - break; - } - case OP_UNM: tm = TM_UNM; break; - case OP_BNOT: tm = TM_BNOT; break; - case OP_LEN: tm = TM_LEN; break; - case OP_CONCAT: tm = TM_CONCAT; break; - case OP_EQ: tm = TM_EQ; break; - /* no cases for OP_EQI and OP_EQK, as they don't call metamethods */ - case OP_LT: case OP_LTI: case OP_GTI: tm = TM_LT; break; - case OP_LE: case OP_LEI: case OP_GEI: tm = TM_LE; break; - case OP_CLOSE: case OP_RETURN: tm = TM_CLOSE; break; - default: - return NULL; /* cannot find a reasonable name */ - } - *name = getshrstr(G(L)->tmname[tm]) + 2; - return "metamethod"; -} - - -/* -** Try to find a name for a function based on how it was called. -*/ -static const char *funcnamefromcall (lua_State *L, CallInfo *ci, - const char **name) { - if (ci->callstatus & CIST_HOOKED) { /* was it called inside a hook? */ - *name = "?"; - return "hook"; - } - else if (ci->callstatus & CIST_FIN) { /* was it called as a finalizer? */ - *name = "__gc"; - return "metamethod"; /* report it as such */ - } - else if (isLua(ci)) - return funcnamefromcode(L, ci_func(ci)->p, currentpc(ci), name); - else - return NULL; -} - -/* }====================================================== */ - - - -/* -** Check whether pointer 'o' points to some value in the stack frame of -** the current function and, if so, returns its index. Because 'o' may -** not point to a value in this stack, we cannot compare it with the -** region boundaries (undefined behavior in ISO C). -*/ -static int instack (CallInfo *ci, const TValue *o) { - int pos; - StkId base = ci->func.p + 1; - for (pos = 0; base + pos < ci->top.p; pos++) { - if (o == s2v(base + pos)) - return pos; - } - return -1; /* not found */ -} - - -/* -** Checks whether value 'o' came from an upvalue. (That can only happen -** with instructions OP_GETTABUP/OP_SETTABUP, which operate directly on -** upvalues.) -*/ -static const char *getupvalname (CallInfo *ci, const TValue *o, - const char **name) { - LClosure *c = ci_func(ci); - int i; - for (i = 0; i < c->nupvalues; i++) { - if (c->upvals[i]->v.p == o) { - *name = upvalname(c->p, i); - return "upvalue"; - } - } - return NULL; -} - - -static const char *formatvarinfo (lua_State *L, const char *kind, - const char *name) { - if (kind == NULL) - return ""; /* no information */ - else - return luaO_pushfstring(L, " (%s '%s')", kind, name); -} - -/* -** Build a string with a "description" for the value 'o', such as -** "variable 'x'" or "upvalue 'y'". -*/ -static const char *varinfo (lua_State *L, const TValue *o) { - CallInfo *ci = L->ci; - const char *name = NULL; /* to avoid warnings */ - const char *kind = NULL; - if (isLua(ci)) { - kind = getupvalname(ci, o, &name); /* check whether 'o' is an upvalue */ - if (!kind) { /* not an upvalue? */ - int reg = instack(ci, o); /* try a register */ - if (reg >= 0) /* is 'o' a register? */ - kind = getobjname(ci_func(ci)->p, currentpc(ci), reg, &name); - } - } - return formatvarinfo(L, kind, name); -} - - -/* -** Raise a type error -*/ -static l_noret typeerror (lua_State *L, const TValue *o, const char *op, - const char *extra) { - const char *t = luaT_objtypename(L, o); - luaG_runerror(L, "attempt to %s a %s value%s", op, t, extra); -} - - -/* -** Raise a type error with "standard" information about the faulty -** object 'o' (using 'varinfo'). -*/ -l_noret luaG_typeerror (lua_State *L, const TValue *o, const char *op) { - typeerror(L, o, op, varinfo(L, o)); -} - - -/* -** Raise an error for calling a non-callable object. Try to find a name -** for the object based on how it was called ('funcnamefromcall'); if it -** cannot get a name there, try 'varinfo'. -*/ -l_noret luaG_callerror (lua_State *L, const TValue *o) { - CallInfo *ci = L->ci; - const char *name = NULL; /* to avoid warnings */ - const char *kind = funcnamefromcall(L, ci, &name); - const char *extra = kind ? formatvarinfo(L, kind, name) : varinfo(L, o); - typeerror(L, o, "call", extra); -} - - -l_noret luaG_forerror (lua_State *L, const TValue *o, const char *what) { - luaG_runerror(L, "bad 'for' %s (number expected, got %s)", - what, luaT_objtypename(L, o)); -} - - -l_noret luaG_concaterror (lua_State *L, const TValue *p1, const TValue *p2) { - if (ttisstring(p1) || cvt2str(p1)) p1 = p2; - luaG_typeerror(L, p1, "concatenate"); -} - - -l_noret luaG_opinterror (lua_State *L, const TValue *p1, - const TValue *p2, const char *msg) { - if (!ttisnumber(p1)) /* first operand is wrong? */ - p2 = p1; /* now second is wrong */ - luaG_typeerror(L, p2, msg); -} - - -/* -** Error when both values are convertible to numbers, but not to integers -*/ -l_noret luaG_tointerror (lua_State *L, const TValue *p1, const TValue *p2) { - lua_Integer temp; - if (!luaV_tointegerns(p1, &temp, LUA_FLOORN2I)) - p2 = p1; - luaG_runerror(L, "number%s has no integer representation", varinfo(L, p2)); -} - - -l_noret luaG_ordererror (lua_State *L, const TValue *p1, const TValue *p2) { - const char *t1 = luaT_objtypename(L, p1); - const char *t2 = luaT_objtypename(L, p2); - if (strcmp(t1, t2) == 0) - luaG_runerror(L, "attempt to compare two %s values", t1); - else - luaG_runerror(L, "attempt to compare %s with %s", t1, t2); -} - - -/* add src:line information to 'msg' */ -const char *luaG_addinfo (lua_State *L, const char *msg, TString *src, - int line) { - char buff[LUA_IDSIZE]; - if (src) { - size_t idlen; - const char *id = getlstr(src, idlen); - luaO_chunkid(buff, id, idlen); - } - else { /* no source available; use "?" instead */ - buff[0] = '?'; buff[1] = '\0'; - } - return luaO_pushfstring(L, "%s:%d: %s", buff, line, msg); -} - - -l_noret luaG_errormsg (lua_State *L) { - if (L->errfunc != 0) { /* is there an error handling function? */ - StkId errfunc = restorestack(L, L->errfunc); - lua_assert(ttisfunction(s2v(errfunc))); - setobjs2s(L, L->top.p, L->top.p - 1); /* move argument */ - setobjs2s(L, L->top.p - 1, errfunc); /* push function */ - L->top.p++; /* assume EXTRA_STACK */ - luaD_callnoyield(L, L->top.p - 2, 1); /* call it */ - } - luaD_throw(L, LUA_ERRRUN); -} - - -l_noret luaG_runerror (lua_State *L, const char *fmt, ...) { - CallInfo *ci = L->ci; - const char *msg; - va_list argp; - luaC_checkGC(L); /* error message uses memory */ - va_start(argp, fmt); - msg = luaO_pushvfstring(L, fmt, argp); /* format message */ - va_end(argp); - if (isLua(ci)) { /* if Lua function, add source:line information */ - luaG_addinfo(L, msg, ci_func(ci)->p->source, getcurrentline(ci)); - setobjs2s(L, L->top.p - 2, L->top.p - 1); /* remove 'msg' */ - L->top.p--; - } - luaG_errormsg(L); -} - - -/* -** Check whether new instruction 'newpc' is in a different line from -** previous instruction 'oldpc'. More often than not, 'newpc' is only -** one or a few instructions after 'oldpc' (it must be after, see -** caller), so try to avoid calling 'luaG_getfuncline'. If they are -** too far apart, there is a good chance of a ABSLINEINFO in the way, -** so it goes directly to 'luaG_getfuncline'. -*/ -static int changedline (const Proto *p, int oldpc, int newpc) { - if (p->lineinfo == NULL) /* no debug information? */ - return 0; - if (newpc - oldpc < MAXIWTHABS / 2) { /* not too far apart? */ - int delta = 0; /* line difference */ - int pc = oldpc; - for (;;) { - int lineinfo = p->lineinfo[++pc]; - if (lineinfo == ABSLINEINFO) - break; /* cannot compute delta; fall through */ - delta += lineinfo; - if (pc == newpc) - return (delta != 0); /* delta computed successfully */ - } - } - /* either instructions are too far apart or there is an absolute line - info in the way; compute line difference explicitly */ - return (luaG_getfuncline(p, oldpc) != luaG_getfuncline(p, newpc)); -} - - -/* -** Traces Lua calls. If code is running the first instruction of a function, -** and function is not vararg, and it is not coming from an yield, -** calls 'luaD_hookcall'. (Vararg functions will call 'luaD_hookcall' -** after adjusting its variable arguments; otherwise, they could call -** a line/count hook before the call hook. Functions coming from -** an yield already called 'luaD_hookcall' before yielding.) -*/ -int luaG_tracecall (lua_State *L) { - CallInfo *ci = L->ci; - Proto *p = ci_func(ci)->p; - ci->u.l.trap = 1; /* ensure hooks will be checked */ - if (ci->u.l.savedpc == p->code) { /* first instruction (not resuming)? */ - if (p->flag & PF_ISVARARG) - return 0; /* hooks will start at VARARGPREP instruction */ - else if (!(ci->callstatus & CIST_HOOKYIELD)) /* not yieded? */ - luaD_hookcall(L, ci); /* check 'call' hook */ - } - return 1; /* keep 'trap' on */ -} - - -/* -** Traces the execution of a Lua function. Called before the execution -** of each opcode, when debug is on. 'L->oldpc' stores the last -** instruction traced, to detect line changes. When entering a new -** function, 'npci' will be zero and will test as a new line whatever -** the value of 'oldpc'. Some exceptional conditions may return to -** a function without setting 'oldpc'. In that case, 'oldpc' may be -** invalid; if so, use zero as a valid value. (A wrong but valid 'oldpc' -** at most causes an extra call to a line hook.) -** This function is not "Protected" when called, so it should correct -** 'L->top.p' before calling anything that can run the GC. -*/ -int luaG_traceexec (lua_State *L, const Instruction *pc) { - CallInfo *ci = L->ci; - lu_byte mask = L->hookmask; - const Proto *p = ci_func(ci)->p; - int counthook; - if (!(mask & (LUA_MASKLINE | LUA_MASKCOUNT))) { /* no hooks? */ - ci->u.l.trap = 0; /* don't need to stop again */ - return 0; /* turn off 'trap' */ - } - pc++; /* reference is always next instruction */ - ci->u.l.savedpc = pc; /* save 'pc' */ - counthook = (mask & LUA_MASKCOUNT) && (--L->hookcount == 0); - if (counthook) - resethookcount(L); /* reset count */ - else if (!(mask & LUA_MASKLINE)) - return 1; /* no line hook and count != 0; nothing to be done now */ - if (ci->callstatus & CIST_HOOKYIELD) { /* hook yielded last time? */ - ci->callstatus &= ~CIST_HOOKYIELD; /* erase mark */ - return 1; /* do not call hook again (VM yielded, so it did not move) */ - } - if (!isIT(*(ci->u.l.savedpc - 1))) /* top not being used? */ - L->top.p = ci->top.p; /* correct top */ - if (counthook) - luaD_hook(L, LUA_HOOKCOUNT, -1, 0, 0); /* call count hook */ - if (mask & LUA_MASKLINE) { - /* 'L->oldpc' may be invalid; use zero in this case */ - int oldpc = (L->oldpc < p->sizecode) ? L->oldpc : 0; - int npci = pcRel(pc, p); - if (npci <= oldpc || /* call hook when jump back (loop), */ - changedline(p, oldpc, npci)) { /* or when enter new line */ - int newline = luaG_getfuncline(p, npci); - luaD_hook(L, LUA_HOOKLINE, newline, 0, 0); /* call line hook */ - } - L->oldpc = npci; /* 'pc' of last call to line hook */ - } - if (L->status == LUA_YIELD) { /* did hook yield? */ - if (counthook) - L->hookcount = 1; /* undo decrement to zero */ - ci->callstatus |= CIST_HOOKYIELD; /* mark that it yielded */ - luaD_throw(L, LUA_YIELD); - } - return 1; /* keep 'trap' on */ -} - - - -/* -** $Id: lfunc.c $ -** Auxiliary functions to manipulate prototypes and closures -** See Copyright Notice in lua.h -*/ - -#define lfunc_c -#define LUA_CORE - - - -#include - - - - - -CClosure *luaF_newCclosure (lua_State *L, int nupvals) { - GCObject *o = luaC_newobj(L, LUA_VCCL, sizeCclosure(nupvals)); - CClosure *c = gco2ccl(o); - c->nupvalues = cast_byte(nupvals); - return c; -} - - -LClosure *luaF_newLclosure (lua_State *L, int nupvals) { - GCObject *o = luaC_newobj(L, LUA_VLCL, sizeLclosure(nupvals)); - LClosure *c = gco2lcl(o); - c->p = NULL; - c->nupvalues = cast_byte(nupvals); - while (nupvals--) c->upvals[nupvals] = NULL; - return c; -} - - -/* -** fill a closure with new closed upvalues -*/ -void luaF_initupvals (lua_State *L, LClosure *cl) { - int i; - for (i = 0; i < cl->nupvalues; i++) { - GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); - UpVal *uv = gco2upv(o); - uv->v.p = &uv->u.value; /* make it closed */ - setnilvalue(uv->v.p); - cl->upvals[i] = uv; - luaC_objbarrier(L, cl, uv); - } -} - - -/* -** Create a new upvalue at the given level, and link it to the list of -** open upvalues of 'L' after entry 'prev'. -**/ -static UpVal *newupval (lua_State *L, StkId level, UpVal **prev) { - GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); - UpVal *uv = gco2upv(o); - UpVal *next = *prev; - uv->v.p = s2v(level); /* current value lives in the stack */ - uv->u.open.next = next; /* link it to list of open upvalues */ - uv->u.open.previous = prev; - if (next) - next->u.open.previous = &uv->u.open.next; - *prev = uv; - if (!isintwups(L)) { /* thread not in list of threads with upvalues? */ - L->twups = G(L)->twups; /* link it to the list */ - G(L)->twups = L; - } - return uv; -} - - -/* -** Find and reuse, or create if it does not exist, an upvalue -** at the given level. -*/ -UpVal *luaF_findupval (lua_State *L, StkId level) { - UpVal **pp = &L->openupval; - UpVal *p; - lua_assert(isintwups(L) || L->openupval == NULL); - while ((p = *pp) != NULL && uplevel(p) >= level) { /* search for it */ - lua_assert(!isdead(G(L), p)); - if (uplevel(p) == level) /* corresponding upvalue? */ - return p; /* return it */ - pp = &p->u.open.next; - } - /* not found: create a new upvalue after 'pp' */ - return newupval(L, level, pp); -} - - -/* -** Call closing method for object 'obj' with error message 'err'. The -** boolean 'yy' controls whether the call is yieldable. -** (This function assumes EXTRA_STACK.) -*/ -static void callclosemethod (lua_State *L, TValue *obj, TValue *err, int yy) { - StkId top = L->top.p; - const TValue *tm = luaT_gettmbyobj(L, obj, TM_CLOSE); - setobj2s(L, top, tm); /* will call metamethod... */ - setobj2s(L, top + 1, obj); /* with 'self' as the 1st argument */ - setobj2s(L, top + 2, err); /* and error msg. as 2nd argument */ - L->top.p = top + 3; /* add function and arguments */ - if (yy) - luaD_call(L, top, 0); - else - luaD_callnoyield(L, top, 0); -} - - -/* -** Check whether object at given level has a close metamethod and raise -** an error if not. -*/ -static void checkclosemth (lua_State *L, StkId level) { - const TValue *tm = luaT_gettmbyobj(L, s2v(level), TM_CLOSE); - if (ttisnil(tm)) { /* no metamethod? */ - int idx = cast_int(level - L->ci->func.p); /* variable index */ - const char *vname = luaG_findlocal(L, L->ci, idx, NULL); - if (vname == NULL) vname = "?"; - luaG_runerror(L, "variable '%s' got a non-closable value", vname); - } -} - - -/* -** Prepare and call a closing method. -** If status is CLOSEKTOP, the call to the closing method will be pushed -** at the top of the stack. Otherwise, values can be pushed right after -** the 'level' of the upvalue being closed, as everything after that -** won't be used again. -*/ -static void prepcallclosemth (lua_State *L, StkId level, int status, int yy) { - TValue *uv = s2v(level); /* value being closed */ - TValue *errobj; - if (status == CLOSEKTOP) - errobj = &G(L)->nilvalue; /* error object is nil */ - else { /* 'luaD_seterrorobj' will set top to level + 2 */ - errobj = s2v(level + 1); /* error object goes after 'uv' */ - luaD_seterrorobj(L, status, level + 1); /* set error object */ - } - callclosemethod(L, uv, errobj, yy); -} - - -/* -** Maximum value for deltas in 'tbclist', dependent on the type -** of delta. (This macro assumes that an 'L' is in scope where it -** is used.) -*/ -#define MAXDELTA \ - ((256ul << ((sizeof(L->stack.p->tbclist.delta) - 1) * 8)) - 1) - - -/* -** Insert a variable in the list of to-be-closed variables. -*/ -void luaF_newtbcupval (lua_State *L, StkId level) { - lua_assert(level > L->tbclist.p); - if (l_isfalse(s2v(level))) - return; /* false doesn't need to be closed */ - checkclosemth(L, level); /* value must have a close method */ - while (cast_uint(level - L->tbclist.p) > MAXDELTA) { - L->tbclist.p += MAXDELTA; /* create a dummy node at maximum delta */ - L->tbclist.p->tbclist.delta = 0; - } - level->tbclist.delta = cast(unsigned short, level - L->tbclist.p); - L->tbclist.p = level; -} - - -void luaF_unlinkupval (UpVal *uv) { - lua_assert(upisopen(uv)); - *uv->u.open.previous = uv->u.open.next; - if (uv->u.open.next) - uv->u.open.next->u.open.previous = uv->u.open.previous; -} - - -/* -** Close all upvalues up to the given stack level. -*/ -void luaF_closeupval (lua_State *L, StkId level) { - UpVal *uv; - StkId upl; /* stack index pointed by 'uv' */ - while ((uv = L->openupval) != NULL && (upl = uplevel(uv)) >= level) { - TValue *slot = &uv->u.value; /* new position for value */ - lua_assert(uplevel(uv) < L->top.p); - luaF_unlinkupval(uv); /* remove upvalue from 'openupval' list */ - setobj(L, slot, uv->v.p); /* move value to upvalue slot */ - uv->v.p = slot; /* now current value lives here */ - if (!iswhite(uv)) { /* neither white nor dead? */ - nw2black(uv); /* closed upvalues cannot be gray */ - luaC_barrier(L, uv, slot); - } - } -} - - -/* -** Remove first element from the tbclist plus its dummy nodes. -*/ -static void poptbclist (lua_State *L) { - StkId tbc = L->tbclist.p; - lua_assert(tbc->tbclist.delta > 0); /* first element cannot be dummy */ - tbc -= tbc->tbclist.delta; - while (tbc > L->stack.p && tbc->tbclist.delta == 0) - tbc -= MAXDELTA; /* remove dummy nodes */ - L->tbclist.p = tbc; -} - - -/* -** Close all upvalues and to-be-closed variables up to the given stack -** level. Return restored 'level'. -*/ -StkId luaF_close (lua_State *L, StkId level, int status, int yy) { - ptrdiff_t levelrel = savestack(L, level); - luaF_closeupval(L, level); /* first, close the upvalues */ - while (L->tbclist.p >= level) { /* traverse tbc's down to that level */ - StkId tbc = L->tbclist.p; /* get variable index */ - poptbclist(L); /* remove it from list */ - prepcallclosemth(L, tbc, status, yy); /* close variable */ - level = restorestack(L, levelrel); - } - return level; -} - - -Proto *luaF_newproto (lua_State *L) { - GCObject *o = luaC_newobj(L, LUA_VPROTO, sizeof(Proto)); - Proto *f = gco2p(o); - f->k = NULL; - f->sizek = 0; - f->p = NULL; - f->sizep = 0; - f->code = NULL; - f->sizecode = 0; - f->lineinfo = NULL; - f->sizelineinfo = 0; - f->abslineinfo = NULL; - f->sizeabslineinfo = 0; - f->upvalues = NULL; - f->sizeupvalues = 0; - f->numparams = 0; - f->flag = 0; - f->maxstacksize = 0; - f->locvars = NULL; - f->sizelocvars = 0; - f->linedefined = 0; - f->lastlinedefined = 0; - f->source = NULL; - return f; -} - - -void luaF_freeproto (lua_State *L, Proto *f) { - if (!(f->flag & PF_FIXED)) { - luaM_freearray(L, f->code, f->sizecode); - luaM_freearray(L, f->lineinfo, f->sizelineinfo); - luaM_freearray(L, f->abslineinfo, f->sizeabslineinfo); - } - luaM_freearray(L, f->p, f->sizep); - luaM_freearray(L, f->k, f->sizek); - luaM_freearray(L, f->locvars, f->sizelocvars); - luaM_freearray(L, f->upvalues, f->sizeupvalues); - luaM_free(L, f); -} - - -/* -** Look for n-th local variable at line 'line' in function 'func'. -** Returns NULL if not found. -*/ -const char *luaF_getlocalname (const Proto *f, int local_number, int pc) { - int i; - for (i = 0; isizelocvars && f->locvars[i].startpc <= pc; i++) { - if (pc < f->locvars[i].endpc) { /* is variable active? */ - local_number--; - if (local_number == 0) - return getstr(f->locvars[i].varname); - } - } - return NULL; /* not found */ -} - - - -/* -** $Id: lobject.c $ -** Some generic functions over Lua objects -** See Copyright Notice in lua.h -*/ - -#define lobject_c -#define LUA_CORE - - - -#include -#include -#include -#include -#include -#include - - - - -/* -** Computes ceil(log2(x)) -*/ -int luaO_ceillog2 (unsigned int x) { - static const lu_byte log_2[256] = { /* log_2[i - 1] = ceil(log2(i)) */ - 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, - 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, - 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, - 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8 - }; - int l = 0; - x--; - while (x >= 256) { l += 8; x >>= 8; } - return l + log_2[x]; -} - -/* -** Encodes 'p'% as a floating-point byte, represented as (eeeexxxx). -** The exponent is represented using excess-7. Mimicking IEEE 754, the -** representation normalizes the number when possible, assuming an extra -** 1 before the mantissa (xxxx) and adding one to the exponent (eeee) -** to signal that. So, the real value is (1xxxx) * 2^(eeee - 7 - 1) if -** eeee != 0, and (xxxx) * 2^-7 otherwise (subnormal numbers). -*/ -unsigned int luaO_codeparam (unsigned int p) { - if (p >= (cast(lu_mem, 0x1F) << (0xF - 7 - 1)) * 100u) /* overflow? */ - return 0xFF; /* return maximum value */ - else { - p = (cast(l_uint32, p) * 128 + 99) / 100; /* round up the division */ - if (p < 0x10) /* subnormal number? */ - return p; /* exponent bits are already zero; nothing else to do */ - else { - int log = luaO_ceillog2(p + 1) - 5; /* preserve 5 bits */ - return ((p >> log) - 0x10) | ((log + 1) << 4); - } - } -} - - -/* -** Computes 'p' times 'x', where 'p' is a floating-point byte. Roughly, -** we have to multiply 'x' by the mantissa and then shift accordingly to -** the exponent. If the exponent is positive, both the multiplication -** and the shift increase 'x', so we have to care only about overflows. -** For negative exponents, however, multiplying before the shift keeps -** more significant bits, as long as the multiplication does not -** overflow, so we check which order is best. -*/ -l_obj luaO_applyparam (unsigned int p, l_obj x) { - unsigned int m = p & 0xF; /* mantissa */ - int e = (p >> 4); /* exponent */ - if (e > 0) { /* normalized? */ - e--; /* correct exponent */ - m += 0x10; /* correct mantissa; maximum value is 0x1F */ - } - e -= 7; /* correct excess-7 */ - if (e >= 0) { - if (x < (MAX_LOBJ / 0x1F) >> e) /* no overflow? */ - return (x * m) << e; /* order doesn't matter here */ - else /* real overflow */ - return MAX_LOBJ; - } - else { /* negative exponent */ - e = -e; - if (x < MAX_LOBJ / 0x1F) /* multiplication cannot overflow? */ - return (x * m) >> e; /* multiplying first gives more precision */ - else if ((x >> e) < MAX_LOBJ / 0x1F) /* cannot overflow after shift? */ - return (x >> e) * m; - else /* real overflow */ - return MAX_LOBJ; - } -} - - -static lua_Integer intarith (lua_State *L, int op, lua_Integer v1, - lua_Integer v2) { - switch (op) { - case LUA_OPADD: return intop(+, v1, v2); - case LUA_OPSUB:return intop(-, v1, v2); - case LUA_OPMUL:return intop(*, v1, v2); - case LUA_OPMOD: return luaV_mod(L, v1, v2); - case LUA_OPIDIV: return luaV_idiv(L, v1, v2); - case LUA_OPBAND: return intop(&, v1, v2); - case LUA_OPBOR: return intop(|, v1, v2); - case LUA_OPBXOR: return intop(^, v1, v2); - case LUA_OPSHL: return luaV_shiftl(v1, v2); - case LUA_OPSHR: return luaV_shiftr(v1, v2); - case LUA_OPUNM: return intop(-, 0, v1); - case LUA_OPBNOT: return intop(^, ~l_castS2U(0), v1); - default: lua_assert(0); return 0; - } -} - - -static lua_Number numarith (lua_State *L, int op, lua_Number v1, - lua_Number v2) { - switch (op) { - case LUA_OPADD: return luai_numadd(L, v1, v2); - case LUA_OPSUB: return luai_numsub(L, v1, v2); - case LUA_OPMUL: return luai_nummul(L, v1, v2); - case LUA_OPDIV: return luai_numdiv(L, v1, v2); - case LUA_OPPOW: return luai_numpow(L, v1, v2); - case LUA_OPIDIV: return luai_numidiv(L, v1, v2); - case LUA_OPUNM: return luai_numunm(L, v1); - case LUA_OPMOD: return luaV_modf(L, v1, v2); - default: lua_assert(0); return 0; - } -} - - -int luaO_rawarith (lua_State *L, int op, const TValue *p1, const TValue *p2, - TValue *res) { - switch (op) { - case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: - case LUA_OPSHL: case LUA_OPSHR: - case LUA_OPBNOT: { /* operate only on integers */ - lua_Integer i1; lua_Integer i2; - if (tointegerns(p1, &i1) && tointegerns(p2, &i2)) { - setivalue(res, intarith(L, op, i1, i2)); - return 1; - } - else return 0; /* fail */ - } - case LUA_OPDIV: case LUA_OPPOW: { /* operate only on floats */ - lua_Number n1; lua_Number n2; - if (tonumberns(p1, n1) && tonumberns(p2, n2)) { - setfltvalue(res, numarith(L, op, n1, n2)); - return 1; - } - else return 0; /* fail */ - } - default: { /* other operations */ - lua_Number n1; lua_Number n2; - if (ttisinteger(p1) && ttisinteger(p2)) { - setivalue(res, intarith(L, op, ivalue(p1), ivalue(p2))); - return 1; - } - else if (tonumberns(p1, n1) && tonumberns(p2, n2)) { - setfltvalue(res, numarith(L, op, n1, n2)); - return 1; - } - else return 0; /* fail */ - } - } -} - - -void luaO_arith (lua_State *L, int op, const TValue *p1, const TValue *p2, - StkId res) { - if (!luaO_rawarith(L, op, p1, p2, s2v(res))) { - /* could not perform raw operation; try metamethod */ - luaT_trybinTM(L, p1, p2, res, cast(TMS, (op - LUA_OPADD) + TM_ADD)); - } -} - - -int luaO_hexavalue (int c) { - if (lisdigit(c)) return c - '0'; - else return (ltolower(c) - 'a') + 10; -} - - -static int isneg (const char **s) { - if (**s == '-') { (*s)++; return 1; } - else if (**s == '+') (*s)++; - return 0; -} - - - -/* -** {================================================================== -** Lua's implementation for 'lua_strx2number' -** =================================================================== -*/ - -#if !defined(lua_strx2number) - -/* maximum number of significant digits to read (to avoid overflows - even with single floats) */ -#define MAXSIGDIG 30 - -/* -** convert a hexadecimal numeric string to a number, following -** C99 specification for 'strtod' -*/ -static lua_Number lua_strx2number (const char *s, char **endptr) { - int dot = lua_getlocaledecpoint(); - lua_Number r = l_mathop(0.0); /* result (accumulator) */ - int sigdig = 0; /* number of significant digits */ - int nosigdig = 0; /* number of non-significant digits */ - int e = 0; /* exponent correction */ - int neg; /* 1 if number is negative */ - int hasdot = 0; /* true after seen a dot */ - *endptr = cast_charp(s); /* nothing is valid yet */ - while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */ - neg = isneg(&s); /* check sign */ - if (!(*s == '0' && (*(s + 1) == 'x' || *(s + 1) == 'X'))) /* check '0x' */ - return l_mathop(0.0); /* invalid format (no '0x') */ - for (s += 2; ; s++) { /* skip '0x' and read numeral */ - if (*s == dot) { - if (hasdot) break; /* second dot? stop loop */ - else hasdot = 1; - } - else if (lisxdigit(cast_uchar(*s))) { - if (sigdig == 0 && *s == '0') /* non-significant digit (zero)? */ - nosigdig++; - else if (++sigdig <= MAXSIGDIG) /* can read it without overflow? */ - r = (r * l_mathop(16.0)) + luaO_hexavalue(*s); - else e++; /* too many digits; ignore, but still count for exponent */ - if (hasdot) e--; /* decimal digit? correct exponent */ - } - else break; /* neither a dot nor a digit */ - } - if (nosigdig + sigdig == 0) /* no digits? */ - return l_mathop(0.0); /* invalid format */ - *endptr = cast_charp(s); /* valid up to here */ - e *= 4; /* each digit multiplies/divides value by 2^4 */ - if (*s == 'p' || *s == 'P') { /* exponent part? */ - int exp1 = 0; /* exponent value */ - int neg1; /* exponent sign */ - s++; /* skip 'p' */ - neg1 = isneg(&s); /* sign */ - if (!lisdigit(cast_uchar(*s))) - return l_mathop(0.0); /* invalid; must have at least one digit */ - while (lisdigit(cast_uchar(*s))) /* read exponent */ - exp1 = exp1 * 10 + *(s++) - '0'; - if (neg1) exp1 = -exp1; - e += exp1; - *endptr = cast_charp(s); /* valid up to here */ - } - if (neg) r = -r; - return l_mathop(ldexp)(r, e); -} - -#endif -/* }====================================================== */ - - -/* maximum length of a numeral to be converted to a number */ -#if !defined (L_MAXLENNUM) -#define L_MAXLENNUM 200 -#endif - -/* -** Convert string 's' to a Lua number (put in 'result'). Return NULL on -** fail or the address of the ending '\0' on success. ('mode' == 'x') -** means a hexadecimal numeral. -*/ -static const char *l_str2dloc (const char *s, lua_Number *result, int mode) { - char *endptr; - *result = (mode == 'x') ? lua_strx2number(s, &endptr) /* try to convert */ - : lua_str2number(s, &endptr); - if (endptr == s) return NULL; /* nothing recognized? */ - while (lisspace(cast_uchar(*endptr))) endptr++; /* skip trailing spaces */ - return (*endptr == '\0') ? endptr : NULL; /* OK iff no trailing chars */ -} - - -/* -** Convert string 's' to a Lua number (put in 'result') handling the -** current locale. -** This function accepts both the current locale or a dot as the radix -** mark. If the conversion fails, it may mean number has a dot but -** locale accepts something else. In that case, the code copies 's' -** to a buffer (because 's' is read-only), changes the dot to the -** current locale radix mark, and tries to convert again. -** The variable 'mode' checks for special characters in the string: -** - 'n' means 'inf' or 'nan' (which should be rejected) -** - 'x' means a hexadecimal numeral -** - '.' just optimizes the search for the common case (no special chars) -*/ -static const char *l_str2d (const char *s, lua_Number *result) { - const char *endptr; - const char *pmode = strpbrk(s, ".xXnN"); /* look for special chars */ - int mode = pmode ? ltolower(cast_uchar(*pmode)) : 0; - if (mode == 'n') /* reject 'inf' and 'nan' */ - return NULL; - endptr = l_str2dloc(s, result, mode); /* try to convert */ - if (endptr == NULL) { /* failed? may be a different locale */ - char buff[L_MAXLENNUM + 1]; - const char *pdot = strchr(s, '.'); - if (pdot == NULL || strlen(s) > L_MAXLENNUM) - return NULL; /* string too long or no dot; fail */ - strcpy(buff, s); /* copy string to buffer */ - buff[pdot - s] = lua_getlocaledecpoint(); /* correct decimal point */ - endptr = l_str2dloc(buff, result, mode); /* try again */ - if (endptr != NULL) - endptr = s + (endptr - buff); /* make relative to 's' */ - } - return endptr; -} - - -#define MAXBY10 cast(lua_Unsigned, LUA_MAXINTEGER / 10) -#define MAXLASTD cast_int(LUA_MAXINTEGER % 10) - -static const char *l_str2int (const char *s, lua_Integer *result) { - lua_Unsigned a = 0; - int empty = 1; - int neg; - while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */ - neg = isneg(&s); - if (s[0] == '0' && - (s[1] == 'x' || s[1] == 'X')) { /* hex? */ - s += 2; /* skip '0x' */ - for (; lisxdigit(cast_uchar(*s)); s++) { - a = a * 16 + luaO_hexavalue(*s); - empty = 0; - } - } - else { /* decimal */ - for (; lisdigit(cast_uchar(*s)); s++) { - int d = *s - '0'; - if (a >= MAXBY10 && (a > MAXBY10 || d > MAXLASTD + neg)) /* overflow? */ - return NULL; /* do not accept it (as integer) */ - a = a * 10 + d; - empty = 0; - } - } - while (lisspace(cast_uchar(*s))) s++; /* skip trailing spaces */ - if (empty || *s != '\0') return NULL; /* something wrong in the numeral */ - else { - *result = l_castU2S((neg) ? 0u - a : a); - return s; - } -} - - -size_t luaO_str2num (const char *s, TValue *o) { - lua_Integer i; lua_Number n; - const char *e; - if ((e = l_str2int(s, &i)) != NULL) { /* try as an integer */ - setivalue(o, i); - } - else if ((e = l_str2d(s, &n)) != NULL) { /* else try as a float */ - setfltvalue(o, n); - } - else - return 0; /* conversion failed */ - return (e - s) + 1; /* success; return string size */ -} - - -int luaO_utf8esc (char *buff, unsigned long x) { - int n = 1; /* number of bytes put in buffer (backwards) */ - lua_assert(x <= 0x7FFFFFFFu); - if (x < 0x80) /* ascii? */ - buff[UTF8BUFFSZ - 1] = cast_char(x); - else { /* need continuation bytes */ - unsigned int mfb = 0x3f; /* maximum that fits in first byte */ - do { /* add continuation bytes */ - buff[UTF8BUFFSZ - (n++)] = cast_char(0x80 | (x & 0x3f)); - x >>= 6; /* remove added bits */ - mfb >>= 1; /* now there is one less bit available in first byte */ - } while (x > mfb); /* still needs continuation byte? */ - buff[UTF8BUFFSZ - n] = cast_char((~mfb << 1) | x); /* add first byte */ - } - return n; -} - - -/* -** Maximum length of the conversion of a number to a string. Must be -** enough to accommodate both LUA_INTEGER_FMT and LUA_NUMBER_FMT. -** (For a long long int, this is 19 digits plus a sign and a final '\0', -** adding to 21. For a long double, it can go to a sign, 33 digits, -** the dot, an exponent letter, an exponent sign, 5 exponent digits, -** and a final '\0', adding to 43.) -*/ -#define MAXNUMBER2STR 44 - - -/* -** Convert a number object to a string, adding it to a buffer -*/ -static int tostringbuff (TValue *obj, char *buff) { - int len; - lua_assert(ttisnumber(obj)); - if (ttisinteger(obj)) - len = lua_integer2str(buff, MAXNUMBER2STR, ivalue(obj)); - else { - len = lua_number2str(buff, MAXNUMBER2STR, fltvalue(obj)); - if (buff[strspn(buff, "-0123456789")] == '\0') { /* looks like an int? */ - buff[len++] = lua_getlocaledecpoint(); - buff[len++] = '0'; /* adds '.0' to result */ - } - } - return len; -} - - -/* -** Convert a number object to a Lua string, replacing the value at 'obj' -*/ -void luaO_tostring (lua_State *L, TValue *obj) { - char buff[MAXNUMBER2STR]; - int len = tostringbuff(obj, buff); - setsvalue(L, obj, luaS_newlstr(L, buff, len)); -} - - - - -/* -** {================================================================== -** 'luaO_pushvfstring' -** =================================================================== -*/ - -/* -** Size for buffer space used by 'luaO_pushvfstring'. It should be -** (LUA_IDSIZE + MAXNUMBER2STR) + a minimal space for basic messages, -** so that 'luaG_addinfo' can work directly on the buffer. -*/ -#define BUFVFS (LUA_IDSIZE + MAXNUMBER2STR + 95) - -/* buffer used by 'luaO_pushvfstring' */ -typedef struct BuffFS { - lua_State *L; - int pushed; /* true if there is a part of the result on the stack */ - int blen; /* length of partial string in 'space' */ - char space[BUFVFS]; /* holds last part of the result */ -} BuffFS; - - -/* -** Push given string to the stack, as part of the result, and -** join it to previous partial result if there is one. -** It may call 'luaV_concat' while using one slot from EXTRA_STACK. -** This call cannot invoke metamethods, as both operands must be -** strings. It can, however, raise an error if the result is too -** long. In that case, 'luaV_concat' frees the extra slot before -** raising the error. -*/ -static void pushstr (BuffFS *buff, const char *str, size_t lstr) { - lua_State *L = buff->L; - setsvalue2s(L, L->top.p, luaS_newlstr(L, str, lstr)); - L->top.p++; /* may use one slot from EXTRA_STACK */ - if (!buff->pushed) /* no previous string on the stack? */ - buff->pushed = 1; /* now there is one */ - else /* join previous string with new one */ - luaV_concat(L, 2); -} - - -/* -** empty the buffer space into the stack -*/ -static void clearbuff (BuffFS *buff) { - pushstr(buff, buff->space, buff->blen); /* push buffer contents */ - buff->blen = 0; /* space now is empty */ -} - - -/* -** Get a space of size 'sz' in the buffer. If buffer has not enough -** space, empty it. 'sz' must fit in an empty buffer. -*/ -static char *getbuff (BuffFS *buff, int sz) { - lua_assert(buff->blen <= BUFVFS); lua_assert(sz <= BUFVFS); - if (sz > BUFVFS - buff->blen) /* not enough space? */ - clearbuff(buff); - return buff->space + buff->blen; -} - - -#define addsize(b,sz) ((b)->blen += (sz)) - - -/* -** Add 'str' to the buffer. If string is larger than the buffer space, -** push the string directly to the stack. -*/ -static void addstr2buff (BuffFS *buff, const char *str, size_t slen) { - if (slen <= BUFVFS) { /* does string fit into buffer? */ - char *bf = getbuff(buff, cast_int(slen)); - memcpy(bf, str, slen); /* add string to buffer */ - addsize(buff, cast_int(slen)); - } - else { /* string larger than buffer */ - clearbuff(buff); /* string comes after buffer's content */ - pushstr(buff, str, slen); /* push string */ - } -} - - -/* -** Add a numeral to the buffer. -*/ -static void addnum2buff (BuffFS *buff, TValue *num) { - char *numbuff = getbuff(buff, MAXNUMBER2STR); - int len = tostringbuff(num, numbuff); /* format number into 'numbuff' */ - addsize(buff, len); -} - - -/* -** this function handles only '%d', '%c', '%f', '%p', '%s', and '%%' - conventional formats, plus Lua-specific '%I' and '%U' -*/ -const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) { - BuffFS buff; /* holds last part of the result */ - const char *e; /* points to next '%' */ - buff.pushed = buff.blen = 0; - buff.L = L; - while ((e = strchr(fmt, '%')) != NULL) { - addstr2buff(&buff, fmt, e - fmt); /* add 'fmt' up to '%' */ - switch (*(e + 1)) { /* conversion specifier */ - case 's': { /* zero-terminated string */ - const char *s = va_arg(argp, char *); - if (s == NULL) s = "(null)"; - addstr2buff(&buff, s, strlen(s)); - break; - } - case 'c': { /* an 'int' as a character */ - char c = cast_uchar(va_arg(argp, int)); - addstr2buff(&buff, &c, sizeof(char)); - break; - } - case 'd': { /* an 'int' */ - TValue num; - setivalue(&num, va_arg(argp, int)); - addnum2buff(&buff, &num); - break; - } - case 'I': { /* a 'lua_Integer' */ - TValue num; - setivalue(&num, cast(lua_Integer, va_arg(argp, l_uacInt))); - addnum2buff(&buff, &num); - break; - } - case 'f': { /* a 'lua_Number' */ - TValue num; - setfltvalue(&num, cast_num(va_arg(argp, l_uacNumber))); - addnum2buff(&buff, &num); - break; - } - case 'p': { /* a pointer */ - const int sz = 3 * sizeof(void*) + 8; /* enough space for '%p' */ - char *bf = getbuff(&buff, sz); - void *p = va_arg(argp, void *); - int len = lua_pointer2str(bf, sz, p); - addsize(&buff, len); - break; - } - case 'U': { /* a 'long' as a UTF-8 sequence */ - char bf[UTF8BUFFSZ]; - int len = luaO_utf8esc(bf, va_arg(argp, long)); - addstr2buff(&buff, bf + UTF8BUFFSZ - len, len); - break; - } - case '%': { - addstr2buff(&buff, "%", 1); - break; - } - default: { - luaG_runerror(L, "invalid option '%%%c' to 'lua_pushfstring'", - *(e + 1)); - } - } - fmt = e + 2; /* skip '%' and the specifier */ - } - addstr2buff(&buff, fmt, strlen(fmt)); /* rest of 'fmt' */ - clearbuff(&buff); /* empty buffer into the stack */ - lua_assert(buff.pushed == 1); - return getstr(tsvalue(s2v(L->top.p - 1))); -} - - -const char *luaO_pushfstring (lua_State *L, const char *fmt, ...) { - const char *msg; - va_list argp; - va_start(argp, fmt); - msg = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - return msg; -} - -/* }================================================================== */ - - -#define RETS "..." -#define PRE "[string \"" -#define POS "\"]" - -#define addstr(a,b,l) ( memcpy(a,b,(l) * sizeof(char)), a += (l) ) - -void luaO_chunkid (char *out, const char *source, size_t srclen) { - size_t bufflen = LUA_IDSIZE; /* free space in buffer */ - if (*source == '=') { /* 'literal' source */ - if (srclen <= bufflen) /* small enough? */ - memcpy(out, source + 1, srclen * sizeof(char)); - else { /* truncate it */ - addstr(out, source + 1, bufflen - 1); - *out = '\0'; - } - } - else if (*source == '@') { /* file name */ - if (srclen <= bufflen) /* small enough? */ - memcpy(out, source + 1, srclen * sizeof(char)); - else { /* add '...' before rest of name */ - addstr(out, RETS, LL(RETS)); - bufflen -= LL(RETS); - memcpy(out, source + 1 + srclen - bufflen, bufflen * sizeof(char)); - } - } - else { /* string; format as [string "source"] */ - const char *nl = strchr(source, '\n'); /* find first new line (if any) */ - addstr(out, PRE, LL(PRE)); /* add prefix */ - bufflen -= LL(PRE RETS POS) + 1; /* save space for prefix+suffix+'\0' */ - if (srclen < bufflen && nl == NULL) { /* small one-line source? */ - addstr(out, source, srclen); /* keep it */ - } - else { - if (nl != NULL) srclen = nl - source; /* stop at first newline */ - if (srclen > bufflen) srclen = bufflen; - addstr(out, source, srclen); - addstr(out, RETS, LL(RETS)); - } - memcpy(out, POS, (LL(POS) + 1) * sizeof(char)); - } -} - - - -/* -** $Id: ltm.c $ -** Tag methods -** See Copyright Notice in lua.h -*/ - -#define ltm_c -#define LUA_CORE - - - -#include - - - - -static const char udatatypename[] = "userdata"; - -LUAI_DDEF const char *const luaT_typenames_[LUA_TOTALTYPES] = { - "no value", - "nil", "boolean", udatatypename, "number", - "string", "table", "function", udatatypename, "thread", - "upvalue", "proto" /* these last cases are used for tests only */ -}; - - -void luaT_init (lua_State *L) { - static const char *const luaT_eventname[] = { /* ORDER TM */ - "__index", "__newindex", - "__gc", "__mode", "__len", "__eq", - "__add", "__sub", "__mul", "__mod", "__pow", - "__div", "__idiv", - "__band", "__bor", "__bxor", "__shl", "__shr", - "__unm", "__bnot", "__lt", "__le", - "__concat", "__call", "__close" - }; - int i; - for (i=0; itmname[i] = luaS_new(L, luaT_eventname[i]); - luaC_fix(L, obj2gco(G(L)->tmname[i])); /* never collect these names */ - } -} - - -/* -** function to be used with macro "fasttm": optimized for absence of -** tag methods -*/ -const TValue *luaT_gettm (Table *events, TMS event, TString *ename) { - const TValue *tm = luaH_Hgetshortstr(events, ename); - lua_assert(event <= TM_EQ); - if (notm(tm)) { /* no tag method? */ - events->flags |= cast_byte(1u<metatable; - break; - case LUA_TUSERDATA: - mt = uvalue(o)->metatable; - break; - default: - mt = G(L)->mt[ttype(o)]; - } - return (mt ? luaH_Hgetshortstr(mt, G(L)->tmname[event]) : &G(L)->nilvalue); -} - - -/* -** Return the name of the type of an object. For tables and userdata -** with metatable, use their '__name' metafield, if present. -*/ -const char *luaT_objtypename (lua_State *L, const TValue *o) { - Table *mt; - if ((ttistable(o) && (mt = hvalue(o)->metatable) != NULL) || - (ttisfulluserdata(o) && (mt = uvalue(o)->metatable) != NULL)) { - const TValue *name = luaH_Hgetshortstr(mt, luaS_new(L, "__name")); - if (ttisstring(name)) /* is '__name' a string? */ - return getstr(tsvalue(name)); /* use it as type name */ - } - return ttypename(ttype(o)); /* else use standard type name */ -} - - -void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, const TValue *p3) { - StkId func = L->top.p; - setobj2s(L, func, f); /* push function (assume EXTRA_STACK) */ - setobj2s(L, func + 1, p1); /* 1st argument */ - setobj2s(L, func + 2, p2); /* 2nd argument */ - setobj2s(L, func + 3, p3); /* 3rd argument */ - L->top.p = func + 4; - /* metamethod may yield only when called from Lua code */ - if (isLuacode(L->ci)) - luaD_call(L, func, 0); - else - luaD_callnoyield(L, func, 0); -} - - -int luaT_callTMres (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, StkId res) { - ptrdiff_t result = savestack(L, res); - StkId func = L->top.p; - setobj2s(L, func, f); /* push function (assume EXTRA_STACK) */ - setobj2s(L, func + 1, p1); /* 1st argument */ - setobj2s(L, func + 2, p2); /* 2nd argument */ - L->top.p += 3; - /* metamethod may yield only when called from Lua code */ - if (isLuacode(L->ci)) - luaD_call(L, func, 1); - else - luaD_callnoyield(L, func, 1); - res = restorestack(L, result); - setobjs2s(L, res, --L->top.p); /* move result to its place */ - return ttypetag(s2v(res)); /* return tag of the result */ -} - - -static int callbinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event) { - const TValue *tm = luaT_gettmbyobj(L, p1, event); /* try first operand */ - if (notm(tm)) - tm = luaT_gettmbyobj(L, p2, event); /* try second operand */ - if (notm(tm)) - return -1; /* tag method not found */ - else /* call tag method and return the tag of the result */ - return luaT_callTMres(L, tm, p1, p2, res); -} - - -void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event) { - if (l_unlikely(callbinTM(L, p1, p2, res, event) < 0)) { - switch (event) { - case TM_BAND: case TM_BOR: case TM_BXOR: - case TM_SHL: case TM_SHR: case TM_BNOT: { - if (ttisnumber(p1) && ttisnumber(p2)) - luaG_tointerror(L, p1, p2); - else - luaG_opinterror(L, p1, p2, "perform bitwise operation on"); - } - /* calls never return, but to avoid warnings: *//* FALLTHROUGH */ - default: - luaG_opinterror(L, p1, p2, "perform arithmetic on"); - } - } -} - - -/* -** The use of 'p1' after 'callbinTM' is safe because, when a tag -** method is not found, 'callbinTM' cannot change the stack. -*/ -void luaT_tryconcatTM (lua_State *L) { - StkId p1 = L->top.p - 2; /* first argument */ - if (l_unlikely(callbinTM(L, s2v(p1), s2v(p1 + 1), p1, TM_CONCAT) < 0)) - luaG_concaterror(L, s2v(p1), s2v(p1 + 1)); -} - - -void luaT_trybinassocTM (lua_State *L, const TValue *p1, const TValue *p2, - int flip, StkId res, TMS event) { - if (flip) - luaT_trybinTM(L, p2, p1, res, event); - else - luaT_trybinTM(L, p1, p2, res, event); -} - - -void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, - int flip, StkId res, TMS event) { - TValue aux; - setivalue(&aux, i2); - luaT_trybinassocTM(L, p1, &aux, flip, res, event); -} - - -/* -** Calls an order tag method. -** For lessequal, LUA_COMPAT_LT_LE keeps compatibility with old -** behavior: if there is no '__le', try '__lt', based on l <= r iff -** !(r < l) (assuming a total order). If the metamethod yields during -** this substitution, the continuation has to know about it (to negate -** the result of rtop.p, event); /* try original event */ - if (tag >= 0) /* found tag method? */ - return !tagisfalse(tag); -#if defined(LUA_COMPAT_LT_LE) - else if (event == TM_LE) { - /* try '!(p2 < p1)' for '(p1 <= p2)' */ - L->ci->callstatus |= CIST_LEQ; /* mark it is doing 'lt' for 'le' */ - tag = callbinTM(L, p2, p1, L->top.p, TM_LT); - L->ci->callstatus ^= CIST_LEQ; /* clear mark */ - if (tag >= 0) /* found tag method? */ - return tagisfalse(tag); - } -#endif - luaG_ordererror(L, p1, p2); /* no metamethod found */ - return 0; /* to avoid warnings */ -} - - -int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, - int flip, int isfloat, TMS event) { - TValue aux; const TValue *p2; - if (isfloat) { - setfltvalue(&aux, cast_num(v2)); - } - else - setivalue(&aux, v2); - if (flip) { /* arguments were exchanged? */ - p2 = p1; p1 = &aux; /* correct them */ - } - else - p2 = &aux; - return luaT_callorderTM(L, p1, p2, event); -} - - -void luaT_adjustvarargs (lua_State *L, int nfixparams, CallInfo *ci, - const Proto *p) { - int i; - int actual = cast_int(L->top.p - ci->func.p) - 1; /* number of arguments */ - int nextra = actual - nfixparams; /* number of extra arguments */ - ci->u.l.nextraargs = nextra; - luaD_checkstack(L, p->maxstacksize + 1); - /* copy function to the top of the stack */ - setobjs2s(L, L->top.p++, ci->func.p); - /* move fixed parameters to the top of the stack */ - for (i = 1; i <= nfixparams; i++) { - setobjs2s(L, L->top.p++, ci->func.p + i); - setnilvalue(s2v(ci->func.p + i)); /* erase original parameter (for GC) */ - } - ci->func.p += actual + 1; - ci->top.p += actual + 1; - lua_assert(L->top.p <= ci->top.p && ci->top.p <= L->stack_last.p); -} - - -void luaT_getvarargs (lua_State *L, CallInfo *ci, StkId where, int wanted) { - int i; - int nextra = ci->u.l.nextraargs; - if (wanted < 0) { - wanted = nextra; /* get all extra arguments available */ - checkstackp(L, nextra, where); /* ensure stack space */ - L->top.p = where + nextra; /* next instruction will need top */ - } - for (i = 0; i < wanted && i < nextra; i++) - setobjs2s(L, where + i, ci->func.p - nextra + i); - for (; i < wanted; i++) /* complete required results with nil */ - setnilvalue(s2v(where + i)); -} - - - -/* -** $Id: lstring.c $ -** String table (keeps all strings handled by Lua) -** See Copyright Notice in lua.h -*/ - -#define lstring_c -#define LUA_CORE - - - -#include - - - - -/* -** Maximum size for string table. -*/ -#define MAXSTRTB cast_int(luaM_limitN(MAX_INT, TString*)) - - -/* -** equality for long strings -*/ -int luaS_eqlngstr (TString *a, TString *b) { - size_t len = a->u.lnglen; - lua_assert(a->tt == LUA_VLNGSTR && b->tt == LUA_VLNGSTR); - return (a == b) || /* same instance or... */ - ((len == b->u.lnglen) && /* equal length and ... */ - (memcmp(getlngstr(a), getlngstr(b), len) == 0)); /* equal contents */ -} - - -unsigned luaS_hash (const char *str, size_t l, unsigned seed) { - unsigned int h = seed ^ cast_uint(l); - for (; l > 0; l--) - h ^= ((h<<5) + (h>>2) + cast_byte(str[l - 1])); - return h; -} - - -unsigned luaS_hashlongstr (TString *ts) { - lua_assert(ts->tt == LUA_VLNGSTR); - if (ts->extra == 0) { /* no hash? */ - size_t len = ts->u.lnglen; - ts->hash = luaS_hash(getlngstr(ts), len, ts->hash); - ts->extra = 1; /* now it has its hash */ - } - return ts->hash; -} - - -static void tablerehash (TString **vect, int osize, int nsize) { - int i; - for (i = osize; i < nsize; i++) /* clear new elements */ - vect[i] = NULL; - for (i = 0; i < osize; i++) { /* rehash old part of the array */ - TString *p = vect[i]; - vect[i] = NULL; - while (p) { /* for each string in the list */ - TString *hnext = p->u.hnext; /* save next */ - unsigned int h = lmod(p->hash, nsize); /* new position */ - p->u.hnext = vect[h]; /* chain it into array */ - vect[h] = p; - p = hnext; - } - } -} - - -/* -** Resize the string table. If allocation fails, keep the current size. -** (This can degrade performance, but any non-zero size should work -** correctly.) -*/ -void luaS_resize (lua_State *L, int nsize) { - stringtable *tb = &G(L)->strt; - int osize = tb->size; - TString **newvect; - if (nsize < osize) /* shrinking table? */ - tablerehash(tb->hash, osize, nsize); /* depopulate shrinking part */ - newvect = luaM_reallocvector(L, tb->hash, osize, nsize, TString*); - if (l_unlikely(newvect == NULL)) { /* reallocation failed? */ - if (nsize < osize) /* was it shrinking table? */ - tablerehash(tb->hash, nsize, osize); /* restore to original size */ - /* leave table as it was */ - } - else { /* allocation succeeded */ - tb->hash = newvect; - tb->size = nsize; - if (nsize > osize) - tablerehash(newvect, osize, nsize); /* rehash for new size */ - } -} - - -/* -** Clear API string cache. (Entries cannot be empty, so fill them with -** a non-collectable string.) -*/ -void luaS_clearcache (global_State *g) { - int i, j; - for (i = 0; i < STRCACHE_N; i++) - for (j = 0; j < STRCACHE_M; j++) { - if (iswhite(g->strcache[i][j])) /* will entry be collected? */ - g->strcache[i][j] = g->memerrmsg; /* replace it with something fixed */ - } -} - - -/* -** Initialize the string table and the string cache -*/ -void luaS_init (lua_State *L) { - global_State *g = G(L); - int i, j; - stringtable *tb = &G(L)->strt; - tb->hash = luaM_newvector(L, MINSTRTABSIZE, TString*); - tablerehash(tb->hash, 0, MINSTRTABSIZE); /* clear array */ - tb->size = MINSTRTABSIZE; - /* pre-create memory-error message */ - g->memerrmsg = luaS_newliteral(L, MEMERRMSG); - luaC_fix(L, obj2gco(g->memerrmsg)); /* it should never be collected */ - for (i = 0; i < STRCACHE_N; i++) /* fill cache with valid strings */ - for (j = 0; j < STRCACHE_M; j++) - g->strcache[i][j] = g->memerrmsg; -} - - -size_t luaS_sizelngstr (size_t len, int kind) { - switch (kind) { - case LSTRREG: /* regular long string */ - /* don't need 'falloc'/'ud', but need space for content */ - return offsetof(TString, falloc) + (len + 1) * sizeof(char); - case LSTRFIX: /* fixed external long string */ - /* don't need 'falloc'/'ud' */ - return offsetof(TString, falloc); - default: /* external long string with deallocation */ - lua_assert(kind == LSTRMEM); - return sizeof(TString); - } -} - - -/* -** creates a new string object -*/ -static TString *createstrobj (lua_State *L, size_t totalsize, int tag, - unsigned h) { - TString *ts; - GCObject *o; - o = luaC_newobj(L, tag, totalsize); - ts = gco2ts(o); - ts->hash = h; - ts->extra = 0; - return ts; -} - - -TString *luaS_createlngstrobj (lua_State *L, size_t l) { - size_t totalsize = luaS_sizelngstr(l, LSTRREG); - TString *ts = createstrobj(L, totalsize, LUA_VLNGSTR, G(L)->seed); - ts->u.lnglen = l; - ts->shrlen = LSTRREG; /* signals that it is a regular long string */ - ts->contents = cast_charp(ts) + offsetof(TString, falloc); - ts->contents[l] = '\0'; /* ending 0 */ - return ts; -} - - -void luaS_remove (lua_State *L, TString *ts) { - stringtable *tb = &G(L)->strt; - TString **p = &tb->hash[lmod(ts->hash, tb->size)]; - while (*p != ts) /* find previous element */ - p = &(*p)->u.hnext; - *p = (*p)->u.hnext; /* remove element from its list */ - tb->nuse--; -} - - -static void growstrtab (lua_State *L, stringtable *tb) { - if (l_unlikely(tb->nuse == MAX_INT)) { /* too many strings? */ - luaC_fullgc(L, 1); /* try to free some... */ - if (tb->nuse == MAX_INT) /* still too many? */ - luaM_error(L); /* cannot even create a message... */ - } - if (tb->size <= MAXSTRTB / 2) /* can grow string table? */ - luaS_resize(L, tb->size * 2); -} - - -/* -** Checks whether short string exists and reuses it or creates a new one. -*/ -static TString *internshrstr (lua_State *L, const char *str, size_t l) { - TString *ts; - global_State *g = G(L); - stringtable *tb = &g->strt; - unsigned int h = luaS_hash(str, l, g->seed); - TString **list = &tb->hash[lmod(h, tb->size)]; - lua_assert(str != NULL); /* otherwise 'memcmp'/'memcpy' are undefined */ - for (ts = *list; ts != NULL; ts = ts->u.hnext) { - if (l == cast_uint(ts->shrlen) && - (memcmp(str, getshrstr(ts), l * sizeof(char)) == 0)) { - /* found! */ - if (isdead(g, ts)) /* dead (but not collected yet)? */ - changewhite(ts); /* resurrect it */ - return ts; - } - } - /* else must create a new string */ - if (tb->nuse >= tb->size) { /* need to grow string table? */ - growstrtab(L, tb); - list = &tb->hash[lmod(h, tb->size)]; /* rehash with new size */ - } - ts = createstrobj(L, sizestrshr(l), LUA_VSHRSTR, h); - ts->shrlen = cast_byte(l); - getshrstr(ts)[l] = '\0'; /* ending 0 */ - memcpy(getshrstr(ts), str, l * sizeof(char)); - ts->u.hnext = *list; - *list = ts; - tb->nuse++; - return ts; -} - - -/* -** new string (with explicit length) -*/ -TString *luaS_newlstr (lua_State *L, const char *str, size_t l) { - if (l <= LUAI_MAXSHORTLEN) /* short string? */ - return internshrstr(L, str, l); - else { - TString *ts; - if (l_unlikely(l * sizeof(char) >= (MAX_SIZE - sizeof(TString)))) - luaM_toobig(L); - ts = luaS_createlngstrobj(L, l); - memcpy(getlngstr(ts), str, l * sizeof(char)); - return ts; - } -} - - -/* -** Create or reuse a zero-terminated string, first checking in the -** cache (using the string address as a key). The cache can contain -** only zero-terminated strings, so it is safe to use 'strcmp' to -** check hits. -*/ -TString *luaS_new (lua_State *L, const char *str) { - unsigned int i = point2uint(str) % STRCACHE_N; /* hash */ - int j; - TString **p = G(L)->strcache[i]; - for (j = 0; j < STRCACHE_M; j++) { - if (strcmp(str, getstr(p[j])) == 0) /* hit? */ - return p[j]; /* that is it */ - } - /* normal route */ - for (j = STRCACHE_M - 1; j > 0; j--) - p[j] = p[j - 1]; /* move out last element */ - /* new element is first in the list */ - p[0] = luaS_newlstr(L, str, strlen(str)); - return p[0]; -} - - -Udata *luaS_newudata (lua_State *L, size_t s, int nuvalue) { - Udata *u; - int i; - GCObject *o; - if (l_unlikely(s > MAX_SIZE - udatamemoffset(nuvalue))) - luaM_toobig(L); - o = luaC_newobj(L, LUA_VUSERDATA, sizeudata(nuvalue, s)); - u = gco2u(o); - u->len = s; - u->nuvalue = nuvalue; - u->metatable = NULL; - for (i = 0; i < nuvalue; i++) - setnilvalue(&u->uv[i].uv); - return u; -} - - -struct NewExt { - int kind; - const char *s; - size_t len; - TString *ts; /* output */ -}; - - -static void f_newext (lua_State *L, void *ud) { - struct NewExt *ne = cast(struct NewExt *, ud); - size_t size = luaS_sizelngstr(0, ne->kind); - ne->ts = createstrobj(L, size, LUA_VLNGSTR, G(L)->seed); -} - - -static void f_pintern (lua_State *L, void *ud) { - struct NewExt *ne = cast(struct NewExt *, ud); - ne->ts = internshrstr(L, ne->s, ne->len); -} - - -TString *luaS_newextlstr (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud) { - struct NewExt ne; - if (len <= LUAI_MAXSHORTLEN) { /* short string? */ - ne.s = s; ne.len = len; - if (!falloc) - f_pintern(L, &ne); /* just internalize string */ - else { - int status = luaD_rawrunprotected(L, f_pintern, &ne); - (*falloc)(ud, cast_voidp(s), len + 1, 0); /* free external string */ - if (status != LUA_OK) /* memory error? */ - luaM_error(L); /* re-raise memory error */ - } - return ne.ts; - } - /* "normal" case: long strings */ - if (!falloc) { - ne.kind = LSTRFIX; - f_newext(L, &ne); /* just create header */ - } - else { - ne.kind = LSTRMEM; - if (luaD_rawrunprotected(L, f_newext, &ne) != LUA_OK) { /* mem. error? */ - (*falloc)(ud, cast_voidp(s), len + 1, 0); /* free external string */ - luaM_error(L); /* re-raise memory error */ - } - ne.ts->falloc = falloc; - ne.ts->ud = ud; - } - ne.ts->shrlen = ne.kind; - ne.ts->u.lnglen = len; - ne.ts->contents = cast_charp(s); - return ne.ts; -} - - - - -/* -** $Id: ltable.c $ -** Lua tables (hash) -** See Copyright Notice in lua.h -*/ - -#define ltable_c -#define LUA_CORE - - - -/* -** Implementation of tables (aka arrays, objects, or hash tables). -** Tables keep its elements in two parts: an array part and a hash part. -** Non-negative integer keys are all candidates to be kept in the array -** part. The actual size of the array is the largest 'n' such that -** more than half the slots between 1 and n are in use. -** Hash uses a mix of chained scatter table with Brent's variation. -** A main invariant of these tables is that, if an element is not -** in its main position (i.e. the 'original' position that its hash gives -** to it), then the colliding element is in its own main position. -** Hence even when the load factor reaches 100%, performance remains good. -*/ - -#include -#include - - - - -/* -** Only tables with hash parts larger than 2^LIMFORLAST has a 'lastfree' -** field that optimizes finding a free slot. That field is stored just -** before the array of nodes, in the same block. Smaller tables do a -** complete search when looking for a free slot. -*/ -#define LIMFORLAST 2 /* log2 of real limit */ - -/* -** The union 'Limbox' stores 'lastfree' and ensures that what follows it -** is properly aligned to store a Node. -*/ -typedef struct { Node *dummy; Node follows_pNode; } Limbox_aux; - -typedef union { - Node *lastfree; - char padding[offsetof(Limbox_aux, follows_pNode)]; -} Limbox; - -#define haslastfree(t) ((t)->lsizenode > LIMFORLAST) -#define getlastfree(t) ((cast(Limbox *, (t)->node) - 1)->lastfree) - - -/* -** MAXABITS is the largest integer such that 2^MAXABITS fits in an -** unsigned int. -*/ -#define MAXABITS cast_int(sizeof(int) * CHAR_BIT - 1) - - -/* -** MAXASIZEB is the maximum number of elements in the array part such -** that the size of the array fits in 'size_t'. -*/ -#define MAXASIZEB ((MAX_SIZET/sizeof(ArrayCell)) * NM) - - -/* -** MAXASIZE is the maximum size of the array part. It is the minimum -** between 2^MAXABITS and MAXASIZEB. -*/ -#define MAXASIZE \ - (((1u << MAXABITS) < MAXASIZEB) ? (1u << MAXABITS) : cast_uint(MAXASIZEB)) - -/* -** MAXHBITS is the largest integer such that 2^MAXHBITS fits in a -** signed int. -*/ -#define MAXHBITS (MAXABITS - 1) - - -/* -** MAXHSIZE is the maximum size of the hash part. It is the minimum -** between 2^MAXHBITS and the maximum size such that, measured in bytes, -** it fits in a 'size_t'. -*/ -#define MAXHSIZE luaM_limitN(1u << MAXHBITS, Node) - - -/* -** When the original hash value is good, hashing by a power of 2 -** avoids the cost of '%'. -*/ -#define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t)))) - -/* -** for other types, it is better to avoid modulo by power of 2, as -** they can have many 2 factors. -*/ -#define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1)))) - - -#define hashstr(t,str) hashpow2(t, (str)->hash) -#define hashboolean(t,p) hashpow2(t, p) - - -#define hashpointer(t,p) hashmod(t, point2uint(p)) - - -#define dummynode (&dummynode_) - -static const Node dummynode_ = { - {{NULL}, LUA_VEMPTY, /* value's value and type */ - LUA_VNIL, 0, {NULL}} /* key type, next, and key value */ -}; - - -static const TValue absentkey = {ABSTKEYCONSTANT}; - - -/* -** Hash for integers. To allow a good hash, use the remainder operator -** ('%'). If integer fits as a non-negative int, compute an int -** remainder, which is faster. Otherwise, use an unsigned-integer -** remainder, which uses all bits and ensures a non-negative result. -*/ -static Node *hashint (const Table *t, lua_Integer i) { - lua_Unsigned ui = l_castS2U(i); - if (ui <= cast_uint(INT_MAX)) - return hashmod(t, cast_int(ui)); - else - return hashmod(t, ui); -} - - -/* -** Hash for floating-point numbers. -** The main computation should be just -** n = frexp(n, &i); return (n * INT_MAX) + i -** but there are some numerical subtleties. -** In a two-complement representation, INT_MAX does not has an exact -** representation as a float, but INT_MIN does; because the absolute -** value of 'frexp' is smaller than 1 (unless 'n' is inf/NaN), the -** absolute value of the product 'frexp * -INT_MIN' is smaller or equal -** to INT_MAX. Next, the use of 'unsigned int' avoids overflows when -** adding 'i'; the use of '~u' (instead of '-u') avoids problems with -** INT_MIN. -*/ -#if !defined(l_hashfloat) -static int l_hashfloat (lua_Number n) { - int i; - lua_Integer ni; - n = l_mathop(frexp)(n, &i) * -cast_num(INT_MIN); - if (!lua_numbertointeger(n, &ni)) { /* is 'n' inf/-inf/NaN? */ - lua_assert(luai_numisnan(n) || l_mathop(fabs)(n) == cast_num(HUGE_VAL)); - return 0; - } - else { /* normal case */ - unsigned int u = cast_uint(i) + cast_uint(ni); - return cast_int(u <= cast_uint(INT_MAX) ? u : ~u); - } -} -#endif - - -/* -** returns the 'main' position of an element in a table (that is, -** the index of its hash value). -*/ -static Node *mainpositionTV (const Table *t, const TValue *key) { - switch (ttypetag(key)) { - case LUA_VNUMINT: { - lua_Integer i = ivalue(key); - return hashint(t, i); - } - case LUA_VNUMFLT: { - lua_Number n = fltvalue(key); - return hashmod(t, l_hashfloat(n)); - } - case LUA_VSHRSTR: { - TString *ts = tsvalue(key); - return hashstr(t, ts); - } - case LUA_VLNGSTR: { - TString *ts = tsvalue(key); - return hashpow2(t, luaS_hashlongstr(ts)); - } - case LUA_VFALSE: - return hashboolean(t, 0); - case LUA_VTRUE: - return hashboolean(t, 1); - case LUA_VLIGHTUSERDATA: { - void *p = pvalue(key); - return hashpointer(t, p); - } - case LUA_VLCF: { - lua_CFunction f = fvalue(key); - return hashpointer(t, f); - } - default: { - GCObject *o = gcvalue(key); - return hashpointer(t, o); - } - } -} - - -l_sinline Node *mainpositionfromnode (const Table *t, Node *nd) { - TValue key; - getnodekey(cast(lua_State *, NULL), &key, nd); - return mainpositionTV(t, &key); -} - - -/* -** Check whether key 'k1' is equal to the key in node 'n2'. This -** equality is raw, so there are no metamethods. Floats with integer -** values have been normalized, so integers cannot be equal to -** floats. It is assumed that 'eqshrstr' is simply pointer equality, so -** that short strings are handled in the default case. -** A true 'deadok' means to accept dead keys as equal to their original -** values. All dead keys are compared in the default case, by pointer -** identity. (Only collectable objects can produce dead keys.) Note that -** dead long strings are also compared by identity. -** Once a key is dead, its corresponding value may be collected, and -** then another value can be created with the same address. If this -** other value is given to 'next', 'equalkey' will signal a false -** positive. In a regular traversal, this situation should never happen, -** as all keys given to 'next' came from the table itself, and therefore -** could not have been collected. Outside a regular traversal, we -** have garbage in, garbage out. What is relevant is that this false -** positive does not break anything. (In particular, 'next' will return -** some other valid item on the table or nil.) -*/ -static int equalkey (const TValue *k1, const Node *n2, int deadok) { - if ((rawtt(k1) != keytt(n2)) && /* not the same variants? */ - !(deadok && keyisdead(n2) && iscollectable(k1))) - return 0; /* cannot be same key */ - switch (keytt(n2)) { - case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: - return 1; - case LUA_VNUMINT: - return (ivalue(k1) == keyival(n2)); - case LUA_VNUMFLT: - return luai_numeq(fltvalue(k1), fltvalueraw(keyval(n2))); - case LUA_VLIGHTUSERDATA: - return pvalue(k1) == pvalueraw(keyval(n2)); - case LUA_VLCF: - return fvalue(k1) == fvalueraw(keyval(n2)); - case ctb(LUA_VLNGSTR): - return luaS_eqlngstr(tsvalue(k1), keystrval(n2)); - default: - return gcvalue(k1) == gcvalueraw(keyval(n2)); - } -} - - -/* -** True if value of 'alimit' is equal to the real size of the array -** part of table 't'. (Otherwise, the array part must be larger than -** 'alimit'.) -*/ -#define limitequalsasize(t) (isrealasize(t) || ispow2((t)->alimit)) - - -/* -** Returns the real size of the 'array' array -*/ -LUAI_FUNC unsigned int luaH_realasize (const Table *t) { - if (limitequalsasize(t)) - return t->alimit; /* this is the size */ - else { - unsigned int size = t->alimit; - /* compute the smallest power of 2 not smaller than 'size' */ - size |= (size >> 1); - size |= (size >> 2); - size |= (size >> 4); - size |= (size >> 8); -#if (UINT_MAX >> 14) > 3 /* unsigned int has more than 16 bits */ - size |= (size >> 16); -#if (UINT_MAX >> 30) > 3 - size |= (size >> 32); /* unsigned int has more than 32 bits */ -#endif -#endif - size++; - lua_assert(ispow2(size) && size/2 < t->alimit && t->alimit < size); - return size; - } -} - - -/* -** Check whether real size of the array is a power of 2. -** (If it is not, 'alimit' cannot be changed to any other value -** without changing the real size.) -*/ -static int ispow2realasize (const Table *t) { - return (!isrealasize(t) || ispow2(t->alimit)); -} - - -static unsigned int setlimittosize (Table *t) { - t->alimit = luaH_realasize(t); - setrealasize(t); - return t->alimit; -} - - -#define limitasasize(t) check_exp(isrealasize(t), t->alimit) - - - -/* -** "Generic" get version. (Not that generic: not valid for integers, -** which may be in array part, nor for floats with integral values.) -** See explanation about 'deadok' in function 'equalkey'. -*/ -static const TValue *getgeneric (Table *t, const TValue *key, int deadok) { - Node *n = mainpositionTV(t, key); - for (;;) { /* check whether 'key' is somewhere in the chain */ - if (equalkey(key, n, deadok)) - return gval(n); /* that's it */ - else { - int nx = gnext(n); - if (nx == 0) - return &absentkey; /* not found */ - n += nx; - } - } -} - - -/* -** returns the index for 'k' if 'k' is an appropriate key to live in -** the array part of a table, 0 otherwise. -*/ -static unsigned int arrayindex (lua_Integer k) { - if (l_castS2U(k) - 1u < MAXASIZE) /* 'k' in [1, MAXASIZE]? */ - return cast_uint(k); /* 'key' is an appropriate array index */ - else - return 0; -} - - -/* -** returns the index of a 'key' for table traversals. First goes all -** elements in the array part, then elements in the hash part. The -** beginning of a traversal is signaled by 0. -*/ -static unsigned findindex (lua_State *L, Table *t, TValue *key, - unsigned asize) { - unsigned int i; - if (ttisnil(key)) return 0; /* first iteration */ - i = ttisinteger(key) ? arrayindex(ivalue(key)) : 0; - if (i - 1u < asize) /* is 'key' inside array part? */ - return i; /* yes; that's the index */ - else { - const TValue *n = getgeneric(t, key, 1); - if (l_unlikely(isabstkey(n))) - luaG_runerror(L, "invalid key to 'next'"); /* key not found */ - i = cast_int(nodefromval(n) - gnode(t, 0)); /* key index in hash table */ - /* hash elements are numbered after array ones */ - return (i + 1) + asize; - } -} - - -int luaH_next (lua_State *L, Table *t, StkId key) { - unsigned int asize = luaH_realasize(t); - unsigned int i = findindex(L, t, s2v(key), asize); /* find original key */ - for (; i < asize; i++) { /* try first array part */ - int tag = *getArrTag(t, i); - if (!tagisempty(tag)) { /* a non-empty entry? */ - setivalue(s2v(key), i + 1); - farr2val(t, i + 1, tag, s2v(key + 1)); - return 1; - } - } - for (i -= asize; cast_int(i) < sizenode(t); i++) { /* hash part */ - if (!isempty(gval(gnode(t, i)))) { /* a non-empty entry? */ - Node *n = gnode(t, i); - getnodekey(L, s2v(key), n); - setobj2s(L, key + 1, gval(n)); - return 1; - } - } - return 0; /* no more elements */ -} - - -static void freehash (lua_State *L, Table *t) { - if (!isdummy(t)) { - size_t bsize = sizenode(t) * sizeof(Node); /* 'node' size in bytes */ - char *arr = cast_charp(t->node); - if (haslastfree(t)) { - bsize += sizeof(Limbox); - arr -= sizeof(Limbox); - } - luaM_freearray(L, arr, bsize); - } -} - - -/* -** Check whether an integer key is in the array part. If 'alimit' is -** not the real size of the array, the key still can be in the array -** part. In this case, do the "Xmilia trick" to check whether 'key-1' -** is smaller than the real size. -** The trick works as follow: let 'p' be the integer such that -** '2^(p+1) >= alimit > 2^p', or '2^(p+1) > alimit-1 >= 2^p'. That is, -** 'p' is the highest 1-bit in 'alimit-1', and 2^(p+1) is the real size -** of the array. What we have to check becomes 'key-1 < 2^(p+1)'. We -** compute '(key-1) & ~(alimit-1)', which we call 'res'; it will have -** the 'p' bit cleared. (It may also clear other bits smaller than 'p', -** but no bit higher than 'p'.) If the key is outside the array, that -** is, 'key-1 >= 2^(p+1)', then 'res' will have some 1-bit higher than -** 'p', therefore it will be larger or equal to 'alimit', and the check -** will fail. If 'key-1 < 2^(p+1)', then 'res' has no 1-bit higher than -** 'p', and as the bit 'p' itself was cleared, 'res' will be smaller -** than 2^p, therefore smaller than 'alimit', and the check succeeds. -** As special cases, when 'alimit' is 0 the condition is trivially false, -** and when 'alimit' is 1 the condition simplifies to 'key-1 < alimit'. -** If key is 0 or negative, 'res' will have its higher bit on, so that -** it cannot be smaller than 'alimit'. -*/ -static int keyinarray (Table *t, lua_Integer key) { - lua_Unsigned alimit = t->alimit; - if (l_castS2U(key) - 1u < alimit) /* 'key' in [1, t->alimit]? */ - return 1; - else if (!isrealasize(t) && /* key still may be in the array part? */ - (((l_castS2U(key) - 1u) & ~(alimit - 1u)) < alimit)) { - t->alimit = cast_uint(key); /* probably '#t' is here now */ - return 1; - } - else - return 0; -} - - -/* -** {============================================================= -** Rehash -** ============================================================== -*/ - -/* -** Compute the optimal size for the array part of table 't'. 'nums' is a -** "count array" where 'nums[i]' is the number of integers in the table -** between 2^(i - 1) + 1 and 2^i. 'pna' enters with the total number of -** integer keys in the table and leaves with the number of keys that -** will go to the array part; return the optimal size. (The condition -** 'twotoi > 0' in the for loop stops the loop if 'twotoi' overflows.) -*/ -static unsigned computesizes (unsigned nums[], unsigned *pna) { - int i; - unsigned int twotoi; /* 2^i (candidate for optimal size) */ - unsigned int a = 0; /* number of elements smaller than 2^i */ - unsigned int na = 0; /* number of elements to go to array part */ - unsigned int optimal = 0; /* optimal size for array part */ - /* loop while keys can fill more than half of total size */ - for (i = 0, twotoi = 1; - twotoi > 0 && *pna > twotoi / 2; - i++, twotoi *= 2) { - a += nums[i]; - if (a > twotoi/2) { /* more than half elements present? */ - optimal = twotoi; /* optimal size (till now) */ - na = a; /* all elements up to 'optimal' will go to array part */ - } - } - lua_assert((optimal == 0 || optimal / 2 < na) && na <= optimal); - *pna = na; - return optimal; -} - - -static int countint (lua_Integer key, unsigned int *nums) { - unsigned int k = arrayindex(key); - if (k != 0) { /* is 'key' an appropriate array index? */ - nums[luaO_ceillog2(k)]++; /* count as such */ - return 1; - } - else - return 0; -} - - -l_sinline int arraykeyisempty (const Table *t, lua_Integer key) { - int tag = *getArrTag(t, key - 1); - return tagisempty(tag); -} - - -/* -** Count keys in array part of table 't': Fill 'nums[i]' with -** number of keys that will go into corresponding slice and return -** total number of non-nil keys. -*/ -static unsigned numusearray (const Table *t, unsigned *nums) { - int lg; - unsigned int ttlg; /* 2^lg */ - unsigned int ause = 0; /* summation of 'nums' */ - unsigned int i = 1; /* count to traverse all array keys */ - unsigned int asize = limitasasize(t); /* real array size */ - /* traverse each slice */ - for (lg = 0, ttlg = 1; lg <= MAXABITS; lg++, ttlg *= 2) { - unsigned int lc = 0; /* counter */ - unsigned int lim = ttlg; - if (lim > asize) { - lim = asize; /* adjust upper limit */ - if (i > lim) - break; /* no more elements to count */ - } - /* count elements in range (2^(lg - 1), 2^lg] */ - for (; i <= lim; i++) { - if (!arraykeyisempty(t, i)) - lc++; - } - nums[lg] += lc; - ause += lc; - } - return ause; -} - - -static int numusehash (const Table *t, unsigned *nums, unsigned *pna) { - int totaluse = 0; /* total number of elements */ - int ause = 0; /* elements added to 'nums' (can go to array part) */ - int i = sizenode(t); - while (i--) { - Node *n = &t->node[i]; - if (!isempty(gval(n))) { - if (keyisinteger(n)) - ause += countint(keyival(n), nums); - totaluse++; - } - } - *pna += ause; - return totaluse; -} - - -/* -** Convert an "abstract size" (number of slots in an array) to -** "concrete size" (number of bytes in the array). -** If the abstract size is not a multiple of NM, the last cell is -** incomplete, so we don't need to allocate memory for the whole cell. -** 'extra' computes how many values are not needed in that last cell. -** It will be zero when 'size' is a multiple of NM, and from there it -** increases as 'size' decreases, up to (NM - 1). -*/ -static size_t concretesize (unsigned int size) { - unsigned int numcells = (size + NM - 1) / NM; /* (size / NM) rounded up */ - unsigned int extra = NM - 1 - ((size + NM - 1) % NM); - return numcells * sizeof(ArrayCell) - extra * sizeof(Value); -} - - -static ArrayCell *resizearray (lua_State *L , Table *t, - unsigned oldasize, - unsigned newasize) { - size_t oldasizeb = concretesize(oldasize); - size_t newasizeb = concretesize(newasize); - void *a = luaM_reallocvector(L, t->array, oldasizeb, newasizeb, lu_byte); - return cast(ArrayCell*, a); -} - - -/* -** Creates an array for the hash part of a table with the given -** size, or reuses the dummy node if size is zero. -** The computation for size overflow is in two steps: the first -** comparison ensures that the shift in the second one does not -** overflow. -*/ -static void setnodevector (lua_State *L, Table *t, unsigned size) { - if (size == 0) { /* no elements to hash part? */ - t->node = cast(Node *, dummynode); /* use common 'dummynode' */ - t->lsizenode = 0; - setdummy(t); /* signal that it is using dummy node */ - } - else { - int i; - int lsize = luaO_ceillog2(size); - if (lsize > MAXHBITS || (1u << lsize) > MAXHSIZE) - luaG_runerror(L, "table overflow"); - size = twoto(lsize); - if (lsize <= LIMFORLAST) /* no 'lastfree' field? */ - t->node = luaM_newvector(L, size, Node); - else { - size_t bsize = size * sizeof(Node) + sizeof(Limbox); - char *node = luaM_newblock(L, bsize); - t->node = cast(Node *, node + sizeof(Limbox)); - getlastfree(t) = gnode(t, size); /* all positions are free */ - } - t->lsizenode = cast_byte(lsize); - setnodummy(t); - for (i = 0; i < cast_int(size); i++) { - Node *n = gnode(t, i); - gnext(n) = 0; - setnilkey(n); - setempty(gval(n)); - } - } -} - - -/* -** (Re)insert all elements from the hash part of 'ot' into table 't'. -*/ -static void reinsert (lua_State *L, Table *ot, Table *t) { - int j; - int size = sizenode(ot); - for (j = 0; j < size; j++) { - Node *old = gnode(ot, j); - if (!isempty(gval(old))) { - /* doesn't need barrier/invalidate cache, as entry was - already present in the table */ - TValue k; - getnodekey(L, &k, old); - luaH_set(L, t, &k, gval(old)); - } - } -} - - -/* -** Exchange the hash part of 't1' and 't2'. (In 'flags', only the -** dummy bit must be exchanged: The 'isrealasize' is not related -** to the hash part, and the metamethod bits do not change during -** a resize, so the "real" table can keep their values.) -*/ -static void exchangehashpart (Table *t1, Table *t2) { - lu_byte lsizenode = t1->lsizenode; - Node *node = t1->node; - int bitdummy1 = t1->flags & BITDUMMY; - t1->lsizenode = t2->lsizenode; - t1->node = t2->node; - t1->flags = (t1->flags & NOTBITDUMMY) | (t2->flags & BITDUMMY); - t2->lsizenode = lsizenode; - t2->node = node; - t2->flags = (t2->flags & NOTBITDUMMY) | bitdummy1; -} - - -/* -** Re-insert into the new hash part of a table the elements from the -** vanishing slice of the array part. -*/ -static void reinsertOldSlice (lua_State *L, Table *t, unsigned oldasize, - unsigned newasize) { - unsigned i; - t->alimit = newasize; /* pretend array has new size... */ - for (i = newasize; i < oldasize; i++) { /* traverse vanishing slice */ - int tag = *getArrTag(t, i); - if (!tagisempty(tag)) { /* a non-empty entry? */ - TValue aux; - farr2val(t, i + 1, tag, &aux); /* copy entry into 'aux' */ - luaH_setint(L, t, i + 1, &aux); /* re-insert it into the table */ - } - } - t->alimit = oldasize; /* restore current size... */ -} - - -/* -** Clear new slice of the array. -*/ -static void clearNewSlice (Table *t, unsigned oldasize, unsigned newasize) { - for (; oldasize < newasize; oldasize++) - *getArrTag(t, oldasize) = LUA_VEMPTY; -} - - -/* -** Resize table 't' for the new given sizes. Both allocations (for -** the hash part and for the array part) can fail, which creates some -** subtleties. If the first allocation, for the hash part, fails, an -** error is raised and that is it. Otherwise, it copies the elements from -** the shrinking part of the array (if it is shrinking) into the new -** hash. Then it reallocates the array part. If that fails, the table -** is in its original state; the function frees the new hash part and then -** raises the allocation error. Otherwise, it sets the new hash part -** into the table, initializes the new part of the array (if any) with -** nils and reinserts the elements of the old hash back into the new -** parts of the table. -*/ -void luaH_resize (lua_State *L, Table *t, unsigned newasize, - unsigned nhsize) { - Table newt; /* to keep the new hash part */ - unsigned int oldasize = setlimittosize(t); - ArrayCell *newarray; - if (newasize > MAXASIZE) - luaG_runerror(L, "table overflow"); - /* create new hash part with appropriate size into 'newt' */ - newt.flags = 0; - setnodevector(L, &newt, nhsize); - if (newasize < oldasize) { /* will array shrink? */ - /* re-insert into the new hash the elements from vanishing slice */ - exchangehashpart(t, &newt); /* pretend table has new hash */ - reinsertOldSlice(L, t, oldasize, newasize); - exchangehashpart(t, &newt); /* restore old hash (in case of errors) */ - } - /* allocate new array */ - newarray = resizearray(L, t, oldasize, newasize); - if (l_unlikely(newarray == NULL && newasize > 0)) { /* allocation failed? */ - freehash(L, &newt); /* release new hash part */ - luaM_error(L); /* raise error (with array unchanged) */ - } - /* allocation ok; initialize new part of the array */ - exchangehashpart(t, &newt); /* 't' has the new hash ('newt' has the old) */ - t->array = newarray; /* set new array part */ - t->alimit = newasize; - clearNewSlice(t, oldasize, newasize); - /* re-insert elements from old hash part into new parts */ - reinsert(L, &newt, t); /* 'newt' now has the old hash */ - freehash(L, &newt); /* free old hash part */ -} - - -void luaH_resizearray (lua_State *L, Table *t, unsigned int nasize) { - int nsize = allocsizenode(t); - luaH_resize(L, t, nasize, nsize); -} - -/* -** nums[i] = number of keys 'k' where 2^(i - 1) < k <= 2^i -*/ -static void rehash (lua_State *L, Table *t, const TValue *ek) { - unsigned int asize; /* optimal size for array part */ - unsigned int na; /* number of keys in the array part */ - unsigned int nums[MAXABITS + 1]; - int i; - int totaluse; - for (i = 0; i <= MAXABITS; i++) nums[i] = 0; /* reset counts */ - setlimittosize(t); - na = numusearray(t, nums); /* count keys in array part */ - totaluse = na; /* all those keys are integer keys */ - totaluse += numusehash(t, nums, &na); /* count keys in hash part */ - /* count extra key */ - if (ttisinteger(ek)) - na += countint(ivalue(ek), nums); - totaluse++; - /* compute new size for array part */ - asize = computesizes(nums, &na); - /* resize the table to new computed sizes */ - luaH_resize(L, t, asize, totaluse - na); -} - - - -/* -** }============================================================= -*/ - - -Table *luaH_new (lua_State *L) { - GCObject *o = luaC_newobj(L, LUA_VTABLE, sizeof(Table)); - Table *t = gco2t(o); - t->metatable = NULL; - t->flags = cast_byte(maskflags); /* table has no metamethod fields */ - t->array = NULL; - t->alimit = 0; - setnodevector(L, t, 0); - return t; -} - - -/* -** Frees a table. The assert ensures the correctness of 'concretesize', -** checking its result against the address of the last element in the -** array part of the table, computed abstractly. -*/ -void luaH_free (lua_State *L, Table *t) { - unsigned int realsize = luaH_realasize(t); - size_t sizeb = concretesize(realsize); - lua_assert((sizeb == 0 && realsize == 0) || - cast_charp(t->array) + sizeb - sizeof(Value) == - cast_charp(getArrVal(t, realsize - 1))); - freehash(L, t); - luaM_freemem(L, t->array, sizeb); - luaM_free(L, t); -} - - -static Node *getfreepos (Table *t) { - if (haslastfree(t)) { /* does it have 'lastfree' information? */ - /* look for a spot before 'lastfree', updating 'lastfree' */ - while (getlastfree(t) > t->node) { - Node *free = --getlastfree(t); - if (keyisnil(free)) - return free; - } - } - else { /* no 'lastfree' information */ - if (!isdummy(t)) { - int i = sizenode(t); - while (i--) { /* do a linear search */ - Node *free = gnode(t, i); - if (keyisnil(free)) - return free; - } - } - } - return NULL; /* could not find a free place */ -} - - - -/* -** Inserts a new key into a hash table; first, check whether key's main -** position is free. If not, check whether colliding node is in its main -** position or not: if it is not, move colliding node to an empty place -** and put new key in its main position; otherwise (colliding node is in -** its main position), new key goes to an empty position. -*/ -static void luaH_newkey (lua_State *L, Table *t, const TValue *key, - TValue *value) { - Node *mp; - TValue aux; - if (l_unlikely(ttisnil(key))) - luaG_runerror(L, "table index is nil"); - else if (ttisfloat(key)) { - lua_Number f = fltvalue(key); - lua_Integer k; - if (luaV_flttointeger(f, &k, F2Ieq)) { /* does key fit in an integer? */ - setivalue(&aux, k); - key = &aux; /* insert it as an integer */ - } - else if (l_unlikely(luai_numisnan(f))) - luaG_runerror(L, "table index is NaN"); - } - if (ttisnil(value)) - return; /* do not insert nil values */ - mp = mainpositionTV(t, key); - if (!isempty(gval(mp)) || isdummy(t)) { /* main position is taken? */ - Node *othern; - Node *f = getfreepos(t); /* get a free place */ - if (f == NULL) { /* cannot find a free place? */ - rehash(L, t, key); /* grow table */ - /* whatever called 'newkey' takes care of TM cache */ - luaH_set(L, t, key, value); /* insert key into grown table */ - return; - } - lua_assert(!isdummy(t)); - othern = mainpositionfromnode(t, mp); - if (othern != mp) { /* is colliding node out of its main position? */ - /* yes; move colliding node into free position */ - while (othern + gnext(othern) != mp) /* find previous */ - othern += gnext(othern); - gnext(othern) = cast_int(f - othern); /* rechain to point to 'f' */ - *f = *mp; /* copy colliding node into free pos. (mp->next also goes) */ - if (gnext(mp) != 0) { - gnext(f) += cast_int(mp - f); /* correct 'next' */ - gnext(mp) = 0; /* now 'mp' is free */ - } - setempty(gval(mp)); - } - else { /* colliding node is in its own main position */ - /* new node will go into free position */ - if (gnext(mp) != 0) - gnext(f) = cast_int((mp + gnext(mp)) - f); /* chain new position */ - else lua_assert(gnext(f) == 0); - gnext(mp) = cast_int(f - mp); - mp = f; - } - } - setnodekey(L, mp, key); - luaC_barrierback(L, obj2gco(t), key); - lua_assert(isempty(gval(mp))); - setobj2t(L, gval(mp), value); -} - - -static const TValue *getintfromhash (Table *t, lua_Integer key) { - Node *n = hashint(t, key); - lua_assert(l_castS2U(key) - 1u >= luaH_realasize(t)); - for (;;) { /* check whether 'key' is somewhere in the chain */ - if (keyisinteger(n) && keyival(n) == key) - return gval(n); /* that's it */ - else { - int nx = gnext(n); - if (nx == 0) break; - n += nx; - } - } - return &absentkey; -} - - -static int hashkeyisempty (Table *t, lua_Integer key) { - const TValue *val = getintfromhash(t, key); - return isempty(val); -} - - -static int finishnodeget (const TValue *val, TValue *res) { - if (!ttisnil(val)) { - setobj(((lua_State*)NULL), res, val); - } - return ttypetag(val); -} - - -int luaH_getint (Table *t, lua_Integer key, TValue *res) { - if (keyinarray(t, key)) { - int tag = *getArrTag(t, key - 1); - if (!tagisempty(tag)) - farr2val(t, key, tag, res); - return tag; - } - else - return finishnodeget(getintfromhash(t, key), res); -} - - -/* -** search function for short strings -*/ -const TValue *luaH_Hgetshortstr (Table *t, TString *key) { - Node *n = hashstr(t, key); - lua_assert(key->tt == LUA_VSHRSTR); - for (;;) { /* check whether 'key' is somewhere in the chain */ - if (keyisshrstr(n) && eqshrstr(keystrval(n), key)) - return gval(n); /* that's it */ - else { - int nx = gnext(n); - if (nx == 0) - return &absentkey; /* not found */ - n += nx; - } - } -} - - -int luaH_getshortstr (Table *t, TString *key, TValue *res) { - return finishnodeget(luaH_Hgetshortstr(t, key), res); -} - - -static const TValue *Hgetstr (Table *t, TString *key) { - if (key->tt == LUA_VSHRSTR) - return luaH_Hgetshortstr(t, key); - else { /* for long strings, use generic case */ - TValue ko; - setsvalue(cast(lua_State *, NULL), &ko, key); - return getgeneric(t, &ko, 0); - } -} - - -int luaH_getstr (Table *t, TString *key, TValue *res) { - return finishnodeget(Hgetstr(t, key), res); -} - - -TString *luaH_getstrkey (Table *t, TString *key) { - const TValue *o = Hgetstr(t, key); - if (!isabstkey(o)) /* string already present? */ - return keystrval(nodefromval(o)); /* get saved copy */ - else - return NULL; -} - - -/* -** main search function -*/ -int luaH_get (Table *t, const TValue *key, TValue *res) { - const TValue *slot; - switch (ttypetag(key)) { - case LUA_VSHRSTR: - slot = luaH_Hgetshortstr(t, tsvalue(key)); - break; - case LUA_VNUMINT: - return luaH_getint(t, ivalue(key), res); - case LUA_VNIL: - slot = &absentkey; - break; - case LUA_VNUMFLT: { - lua_Integer k; - if (luaV_flttointeger(fltvalue(key), &k, F2Ieq)) /* integral index? */ - return luaH_getint(t, k, res); /* use specialized version */ - /* else... */ - } /* FALLTHROUGH */ - default: - slot = getgeneric(t, key, 0); - break; - } - return finishnodeget(slot, res); -} - - -static int finishnodeset (Table *t, const TValue *slot, TValue *val) { - if (!ttisnil(slot)) { - setobj(((lua_State*)NULL), cast(TValue*, slot), val); - return HOK; /* success */ - } - else if (isabstkey(slot)) - return HNOTFOUND; /* no slot with that key */ - else /* return node encoded */ - return cast_int((cast(Node*, slot) - t->node)) + HFIRSTNODE; -} - - -static int rawfinishnodeset (const TValue *slot, TValue *val) { - if (isabstkey(slot)) - return 0; /* no slot with that key */ - else { - setobj(((lua_State*)NULL), cast(TValue*, slot), val); - return 1; /* success */ - } -} - - -int luaH_psetint (Table *t, lua_Integer key, TValue *val) { - if (keyinarray(t, key)) { - lu_byte *tag = getArrTag(t, key - 1); - if (!tagisempty(*tag) || checknoTM(t->metatable, TM_NEWINDEX)) { - fval2arr(t, key, tag, val); - return HOK; /* success */ - } - else - return ~cast_int(key); /* empty slot in the array part */ - } - else - return finishnodeset(t, getintfromhash(t, key), val); -} - - -int luaH_psetshortstr (Table *t, TString *key, TValue *val) { - return finishnodeset(t, luaH_Hgetshortstr(t, key), val); -} - - -int luaH_psetstr (Table *t, TString *key, TValue *val) { - return finishnodeset(t, Hgetstr(t, key), val); -} - - -int luaH_pset (Table *t, const TValue *key, TValue *val) { - switch (ttypetag(key)) { - case LUA_VSHRSTR: return luaH_psetshortstr(t, tsvalue(key), val); - case LUA_VNUMINT: return luaH_psetint(t, ivalue(key), val); - case LUA_VNIL: return HNOTFOUND; - case LUA_VNUMFLT: { - lua_Integer k; - if (luaV_flttointeger(fltvalue(key), &k, F2Ieq)) /* integral index? */ - return luaH_psetint(t, k, val); /* use specialized version */ - /* else... */ - } /* FALLTHROUGH */ - default: - return finishnodeset(t, getgeneric(t, key, 0), val); - } -} - -/* -** Finish a raw "set table" operation, where 'slot' is where the value -** should have been (the result of a previous "get table"). -** Beware: when using this function you probably need to check a GC -** barrier and invalidate the TM cache. -*/ - - -void luaH_finishset (lua_State *L, Table *t, const TValue *key, - TValue *value, int hres) { - lua_assert(hres != HOK); - if (hres == HNOTFOUND) { - luaH_newkey(L, t, key, value); - } - else if (hres > 0) { /* regular Node? */ - setobj2t(L, gval(gnode(t, hres - HFIRSTNODE)), value); - } - else { /* array entry */ - hres = ~hres; /* real index */ - obj2arr(t, hres, value); - } -} - - -/* -** beware: when using this function you probably need to check a GC -** barrier and invalidate the TM cache. -*/ -void luaH_set (lua_State *L, Table *t, const TValue *key, TValue *value) { - int hres = luaH_pset(t, key, value); - if (hres != HOK) - luaH_finishset(L, t, key, value, hres); -} - - -/* -** Ditto for a GC barrier. (No need to invalidate the TM cache, as -** integers cannot be keys to metamethods.) -*/ -void luaH_setint (lua_State *L, Table *t, lua_Integer key, TValue *value) { - if (keyinarray(t, key)) - obj2arr(t, key, value); - else { - int ok = rawfinishnodeset(getintfromhash(t, key), value); - if (!ok) { - TValue k; - setivalue(&k, key); - luaH_newkey(L, t, &k, value); - } - } -} - - -/* -** Try to find a boundary in the hash part of table 't'. From the -** caller, we know that 'j' is zero or present and that 'j + 1' is -** present. We want to find a larger key that is absent from the -** table, so that we can do a binary search between the two keys to -** find a boundary. We keep doubling 'j' until we get an absent index. -** If the doubling would overflow, we try LUA_MAXINTEGER. If it is -** absent, we are ready for the binary search. ('j', being max integer, -** is larger or equal to 'i', but it cannot be equal because it is -** absent while 'i' is present; so 'j > i'.) Otherwise, 'j' is a -** boundary. ('j + 1' cannot be a present integer key because it is -** not a valid integer in Lua.) -*/ -static lua_Unsigned hash_search (Table *t, lua_Unsigned j) { - lua_Unsigned i; - if (j == 0) j++; /* the caller ensures 'j + 1' is present */ - do { - i = j; /* 'i' is a present index */ - if (j <= l_castS2U(LUA_MAXINTEGER) / 2) - j *= 2; - else { - j = LUA_MAXINTEGER; - if (hashkeyisempty(t, j)) /* t[j] not present? */ - break; /* 'j' now is an absent index */ - else /* weird case */ - return j; /* well, max integer is a boundary... */ - } - } while (!hashkeyisempty(t, j)); /* repeat until an absent t[j] */ - /* i < j && t[i] present && t[j] absent */ - while (j - i > 1u) { /* do a binary search between them */ - lua_Unsigned m = (i + j) / 2; - if (hashkeyisempty(t, m)) j = m; - else i = m; - } - return i; -} - - -static unsigned int binsearch (Table *array, unsigned int i, unsigned int j) { - while (j - i > 1u) { /* binary search */ - unsigned int m = (i + j) / 2; - if (arraykeyisempty(array, m)) j = m; - else i = m; - } - return i; -} - - -/* -** Try to find a boundary in table 't'. (A 'boundary' is an integer index -** such that t[i] is present and t[i+1] is absent, or 0 if t[1] is absent -** and 'maxinteger' if t[maxinteger] is present.) -** (In the next explanation, we use Lua indices, that is, with base 1. -** The code itself uses base 0 when indexing the array part of the table.) -** The code starts with 'limit = t->alimit', a position in the array -** part that may be a boundary. -** -** (1) If 't[limit]' is empty, there must be a boundary before it. -** As a common case (e.g., after 't[#t]=nil'), check whether 'limit-1' -** is present. If so, it is a boundary. Otherwise, do a binary search -** between 0 and limit to find a boundary. In both cases, try to -** use this boundary as the new 'alimit', as a hint for the next call. -** -** (2) If 't[limit]' is not empty and the array has more elements -** after 'limit', try to find a boundary there. Again, try first -** the special case (which should be quite frequent) where 'limit+1' -** is empty, so that 'limit' is a boundary. Otherwise, check the -** last element of the array part. If it is empty, there must be a -** boundary between the old limit (present) and the last element -** (absent), which is found with a binary search. (This boundary always -** can be a new limit.) -** -** (3) The last case is when there are no elements in the array part -** (limit == 0) or its last element (the new limit) is present. -** In this case, must check the hash part. If there is no hash part -** or 'limit+1' is absent, 'limit' is a boundary. Otherwise, call -** 'hash_search' to find a boundary in the hash part of the table. -** (In those cases, the boundary is not inside the array part, and -** therefore cannot be used as a new limit.) -*/ -lua_Unsigned luaH_getn (Table *t) { - unsigned int limit = t->alimit; - if (limit > 0 && arraykeyisempty(t, limit)) { /* (1)? */ - /* there must be a boundary before 'limit' */ - if (limit >= 2 && !arraykeyisempty(t, limit - 1)) { - /* 'limit - 1' is a boundary; can it be a new limit? */ - if (ispow2realasize(t) && !ispow2(limit - 1)) { - t->alimit = limit - 1; - setnorealasize(t); /* now 'alimit' is not the real size */ - } - return limit - 1; - } - else { /* must search for a boundary in [0, limit] */ - unsigned int boundary = binsearch(t, 0, limit); - /* can this boundary represent the real size of the array? */ - if (ispow2realasize(t) && boundary > luaH_realasize(t) / 2) { - t->alimit = boundary; /* use it as the new limit */ - setnorealasize(t); - } - return boundary; - } - } - /* 'limit' is zero or present in table */ - if (!limitequalsasize(t)) { /* (2)? */ - /* 'limit' > 0 and array has more elements after 'limit' */ - if (arraykeyisempty(t, limit + 1)) /* 'limit + 1' is empty? */ - return limit; /* this is the boundary */ - /* else, try last element in the array */ - limit = luaH_realasize(t); - if (arraykeyisempty(t, limit)) { /* empty? */ - /* there must be a boundary in the array after old limit, - and it must be a valid new limit */ - unsigned int boundary = binsearch(t, t->alimit, limit); - t->alimit = boundary; - return boundary; - } - /* else, new limit is present in the table; check the hash part */ - } - /* (3) 'limit' is the last element and either is zero or present in table */ - lua_assert(limit == luaH_realasize(t) && - (limit == 0 || !arraykeyisempty(t, limit))); - if (isdummy(t) || hashkeyisempty(t, cast(lua_Integer, limit + 1))) - return limit; /* 'limit + 1' is absent */ - else /* 'limit + 1' is also present */ - return hash_search(t, limit); -} - - - -#if defined(LUA_DEBUG) - -/* export these functions for the test library */ - -Node *luaH_mainposition (const Table *t, const TValue *key) { - return mainpositionTV(t, key); -} - -#endif - - -/* -** $Id: ldo.c $ -** Stack and Call structure of Lua -** See Copyright Notice in lua.h -*/ - -#define ldo_c -#define LUA_CORE - - - -#include -#include -#include - - - - - -#define errorstatus(s) ((s) > LUA_YIELD) - - -/* -** {====================================================== -** Error-recovery functions -** ======================================================= -*/ - -/* -** LUAI_THROW/LUAI_TRY define how Lua does exception handling. By -** default, Lua handles errors with exceptions when compiling as -** C++ code, with _longjmp/_setjmp when asked to use them, and with -** longjmp/setjmp otherwise. -*/ -#if !defined(LUAI_THROW) /* { */ - -#if defined(__cplusplus) && !defined(LUA_USE_LONGJMP) /* { */ - -/* C++ exceptions */ -#define LUAI_THROW(L,c) throw(c) -#define LUAI_TRY(L,c,a) \ - try { a } catch(...) { if ((c)->status == 0) (c)->status = -1; } -#define luai_jmpbuf int /* dummy variable */ - -#elif defined(LUA_USE_POSIX) /* }{ */ - -/* in POSIX, try _longjmp/_setjmp (more efficient) */ -#define LUAI_THROW(L,c) _longjmp((c)->b, 1) -#define LUAI_TRY(L,c,a) if (_setjmp((c)->b) == 0) { a } -#define luai_jmpbuf jmp_buf - -#else /* }{ */ - -/* ISO C handling with long jumps */ -#define LUAI_THROW(L,c) longjmp((c)->b, 1) -#define LUAI_TRY(L,c,a) if (setjmp((c)->b) == 0) { a } -#define luai_jmpbuf jmp_buf - -#endif /* } */ - -#endif /* } */ - - - -/* chain list of long jump buffers */ -struct lua_longjmp { - struct lua_longjmp *previous; - luai_jmpbuf b; - volatile int status; /* error code */ -}; - - -void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop) { - switch (errcode) { - case LUA_ERRMEM: { /* memory error? */ - setsvalue2s(L, oldtop, G(L)->memerrmsg); /* reuse preregistered msg. */ - break; - } - case LUA_ERRERR: { - setsvalue2s(L, oldtop, luaS_newliteral(L, "error in private_lua_error handling")); - break; - } - case LUA_OK: { /* special case only for closing upvalues */ - setnilvalue(s2v(oldtop)); /* no error message */ - break; - } - default: { - lua_assert(errorstatus(errcode)); /* real error */ - setobjs2s(L, oldtop, L->top.p - 1); /* error message on current top */ - break; - } - } - L->top.p = oldtop + 1; -} - - -l_noret luaD_throw (lua_State *L, int errcode) { - if (L->errorJmp) { /* thread has an error handler? */ - L->errorJmp->status = errcode; /* set status */ - LUAI_THROW(L, L->errorJmp); /* jump to it */ - } - else { /* thread has no error handler */ - global_State *g = G(L); - errcode = luaE_resetthread(L, errcode); /* close all upvalues */ - if (g->mainthread->errorJmp) { /* main thread has a handler? */ - setobjs2s(L, g->mainthread->top.p++, L->top.p - 1); /* copy error obj. */ - luaD_throw(g->mainthread, errcode); /* re-throw in main thread */ - } - else { /* no handler at all; abort */ - if (g->panic) { /* panic function? */ - lua_unlock(L); - g->panic(L); /* call panic function (last chance to jump out) */ - } - abort(); - } - } -} - - -int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) { - l_uint32 oldnCcalls = L->nCcalls; - struct lua_longjmp lj; - lj.status = LUA_OK; - lj.previous = L->errorJmp; /* chain new error handler */ - L->errorJmp = &lj; - LUAI_TRY(L, &lj, - (*f)(L, ud); - ); - L->errorJmp = lj.previous; /* restore old error handler */ - L->nCcalls = oldnCcalls; - return lj.status; -} - -/* }====================================================== */ - - -/* -** {================================================================== -** Stack reallocation -** =================================================================== -*/ - - -/* -** Change all pointers to the stack into offsets. -*/ -static void relstack (lua_State *L) { - CallInfo *ci; - UpVal *up; - L->top.offset = savestack(L, L->top.p); - L->tbclist.offset = savestack(L, L->tbclist.p); - for (up = L->openupval; up != NULL; up = up->u.open.next) - up->v.offset = savestack(L, uplevel(up)); - for (ci = L->ci; ci != NULL; ci = ci->previous) { - ci->top.offset = savestack(L, ci->top.p); - ci->func.offset = savestack(L, ci->func.p); - } -} - - -/* -** Change back all offsets into pointers. -*/ -static void correctstack (lua_State *L) { - CallInfo *ci; - UpVal *up; - L->top.p = restorestack(L, L->top.offset); - L->tbclist.p = restorestack(L, L->tbclist.offset); - for (up = L->openupval; up != NULL; up = up->u.open.next) - up->v.p = s2v(restorestack(L, up->v.offset)); - for (ci = L->ci; ci != NULL; ci = ci->previous) { - ci->top.p = restorestack(L, ci->top.offset); - ci->func.p = restorestack(L, ci->func.offset); - if (isLua(ci)) - ci->u.l.trap = 1; /* signal to update 'trap' in 'luaV_execute' */ - } -} - - -/* some space for error handling */ -#define ERRORSTACKSIZE (LUAI_MAXSTACK + 200) - -/* -** Reallocate the stack to a new size, correcting all pointers into it. -** In ISO C, any pointer use after the pointer has been deallocated is -** undefined behavior. So, before the reallocation, all pointers are -** changed to offsets, and after the reallocation they are changed back -** to pointers. As during the reallocation the pointers are invalid, the -** reallocation cannot run emergency collections. -** -** In case of allocation error, raise an error or return false according -** to 'raiseerror'. -*/ -int luaD_reallocstack (lua_State *L, int newsize, int raiseerror) { - int oldsize = stacksize(L); - int i; - StkId newstack; - int oldgcstop = G(L)->gcstopem; - lua_assert(newsize <= LUAI_MAXSTACK || newsize == ERRORSTACKSIZE); - relstack(L); /* change pointers to offsets */ - G(L)->gcstopem = 1; /* stop emergency collection */ - newstack = luaM_reallocvector(L, L->stack.p, oldsize + EXTRA_STACK, - newsize + EXTRA_STACK, StackValue); - G(L)->gcstopem = oldgcstop; /* restore emergency collection */ - if (l_unlikely(newstack == NULL)) { /* reallocation failed? */ - correctstack(L); /* change offsets back to pointers */ - if (raiseerror) - luaM_error(L); - else return 0; /* do not raise an error */ - } - L->stack.p = newstack; - correctstack(L); /* change offsets back to pointers */ - L->stack_last.p = L->stack.p + newsize; - for (i = oldsize + EXTRA_STACK; i < newsize + EXTRA_STACK; i++) - setnilvalue(s2v(newstack + i)); /* erase new segment */ - return 1; -} - - -/* -** Try to grow the stack by at least 'n' elements. When 'raiseerror' -** is true, raises any error; otherwise, return 0 in case of errors. -*/ -int luaD_growstack (lua_State *L, int n, int raiseerror) { - int size = stacksize(L); - if (l_unlikely(size > LUAI_MAXSTACK)) { - /* if stack is larger than maximum, thread is already using the - extra space reserved for errors, that is, thread is handling - a stack error; cannot grow further than that. */ - lua_assert(stacksize(L) == ERRORSTACKSIZE); - if (raiseerror) - luaD_throw(L, LUA_ERRERR); /* error inside message handler */ - return 0; /* if not 'raiseerror', just signal it */ - } - else if (n < LUAI_MAXSTACK) { /* avoids arithmetic overflows */ - int newsize = 2 * size; /* tentative new size */ - int needed = cast_int(L->top.p - L->stack.p) + n; - if (newsize > LUAI_MAXSTACK) /* cannot cross the limit */ - newsize = LUAI_MAXSTACK; - if (newsize < needed) /* but must respect what was asked for */ - newsize = needed; - if (l_likely(newsize <= LUAI_MAXSTACK)) - return luaD_reallocstack(L, newsize, raiseerror); - } - /* else stack overflow */ - /* add extra size to be able to handle the error message */ - luaD_reallocstack(L, ERRORSTACKSIZE, raiseerror); - if (raiseerror) - luaG_runerror(L, "stack overflow"); - return 0; -} - - -/* -** Compute how much of the stack is being used, by computing the -** maximum top of all call frames in the stack and the current top. -*/ -static int stackinuse (lua_State *L) { - CallInfo *ci; - int res; - StkId lim = L->top.p; - for (ci = L->ci; ci != NULL; ci = ci->previous) { - if (lim < ci->top.p) lim = ci->top.p; - } - lua_assert(lim <= L->stack_last.p + EXTRA_STACK); - res = cast_int(lim - L->stack.p) + 1; /* part of stack in use */ - if (res < LUA_MINSTACK) - res = LUA_MINSTACK; /* ensure a minimum size */ - return res; -} - - -/* -** If stack size is more than 3 times the current use, reduce that size -** to twice the current use. (So, the final stack size is at most 2/3 the -** previous size, and half of its entries are empty.) -** As a particular case, if stack was handling a stack overflow and now -** it is not, 'max' (limited by LUAI_MAXSTACK) will be smaller than -** stacksize (equal to ERRORSTACKSIZE in this case), and so the stack -** will be reduced to a "regular" size. -*/ -void luaD_shrinkstack (lua_State *L) { - int inuse = stackinuse(L); - int max = (inuse > LUAI_MAXSTACK / 3) ? LUAI_MAXSTACK : inuse * 3; - /* if thread is currently not handling a stack overflow and its - size is larger than maximum "reasonable" size, shrink it */ - if (inuse <= LUAI_MAXSTACK && stacksize(L) > max) { - int nsize = (inuse > LUAI_MAXSTACK / 2) ? LUAI_MAXSTACK : inuse * 2; - luaD_reallocstack(L, nsize, 0); /* ok if that fails */ - } - else /* don't change stack */ - condmovestack(L,{},{}); /* (change only for debugging) */ - luaE_shrinkCI(L); /* shrink CI list */ -} - - -void luaD_inctop (lua_State *L) { - luaD_checkstack(L, 1); - L->top.p++; -} - -/* }================================================================== */ - - -/* -** Call a hook for the given event. Make sure there is a hook to be -** called. (Both 'L->hook' and 'L->hookmask', which trigger this -** function, can be changed asynchronously by signals.) -*/ -void luaD_hook (lua_State *L, int event, int line, - int ftransfer, int ntransfer) { - lua_Hook hook = L->hook; - if (hook && L->allowhook) { /* make sure there is a hook */ - int mask = CIST_HOOKED; - CallInfo *ci = L->ci; - ptrdiff_t top = savestack(L, L->top.p); /* preserve original 'top' */ - ptrdiff_t ci_top = savestack(L, ci->top.p); /* idem for 'ci->top' */ - lua_Debug ar; - ar.event = event; - ar.currentline = line; - ar.i_ci = ci; - if (ntransfer != 0) { - mask |= CIST_TRAN; /* 'ci' has transfer information */ - ci->u2.transferinfo.ftransfer = ftransfer; - ci->u2.transferinfo.ntransfer = ntransfer; - } - if (isLua(ci) && L->top.p < ci->top.p) - L->top.p = ci->top.p; /* protect entire activation register */ - luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */ - if (ci->top.p < L->top.p + LUA_MINSTACK) - ci->top.p = L->top.p + LUA_MINSTACK; - L->allowhook = 0; /* cannot call hooks inside a hook */ - ci->callstatus |= mask; - lua_unlock(L); - (*hook)(L, &ar); - lua_lock(L); - lua_assert(!L->allowhook); - L->allowhook = 1; - ci->top.p = restorestack(L, ci_top); - L->top.p = restorestack(L, top); - ci->callstatus &= ~mask; - } -} - - -/* -** Executes a call hook for Lua functions. This function is called -** whenever 'hookmask' is not zero, so it checks whether call hooks are -** active. -*/ -void luaD_hookcall (lua_State *L, CallInfo *ci) { - L->oldpc = 0; /* set 'oldpc' for new function */ - if (L->hookmask & LUA_MASKCALL) { /* is call hook on? */ - int event = (ci->callstatus & CIST_TAIL) ? LUA_HOOKTAILCALL - : LUA_HOOKCALL; - Proto *p = ci_func(ci)->p; - ci->u.l.savedpc++; /* hooks assume 'pc' is already incremented */ - luaD_hook(L, event, -1, 1, p->numparams); - ci->u.l.savedpc--; /* correct 'pc' */ - } -} - - -/* -** Executes a return hook for Lua and C functions and sets/corrects -** 'oldpc'. (Note that this correction is needed by the line hook, so it -** is done even when return hooks are off.) -*/ -static void rethook (lua_State *L, CallInfo *ci, int nres) { - if (L->hookmask & LUA_MASKRET) { /* is return hook on? */ - StkId firstres = L->top.p - nres; /* index of first result */ - int delta = 0; /* correction for vararg functions */ - int ftransfer; - if (isLua(ci)) { - Proto *p = ci_func(ci)->p; - if (p->flag & PF_ISVARARG) - delta = ci->u.l.nextraargs + p->numparams + 1; - } - ci->func.p += delta; /* if vararg, back to virtual 'func' */ - ftransfer = cast(unsigned short, firstres - ci->func.p); - luaD_hook(L, LUA_HOOKRET, -1, ftransfer, nres); /* call it */ - ci->func.p -= delta; - } - if (isLua(ci = ci->previous)) - L->oldpc = pcRel(ci->u.l.savedpc, ci_func(ci)->p); /* set 'oldpc' */ -} - - -/* -** Check whether 'func' has a '__call' metafield. If so, put it in the -** stack, below original 'func', so that 'luaD_precall' can call it. Raise -** an error if there is no '__call' metafield. -*/ -static StkId tryfuncTM (lua_State *L, StkId func) { - const TValue *tm; - StkId p; - checkstackp(L, 1, func); /* space for metamethod */ - tm = luaT_gettmbyobj(L, s2v(func), TM_CALL); /* (after previous GC) */ - if (l_unlikely(ttisnil(tm))) - luaG_callerror(L, s2v(func)); /* nothing to call */ - for (p = L->top.p; p > func; p--) /* open space for metamethod */ - setobjs2s(L, p, p-1); - L->top.p++; /* stack space pre-allocated by the caller */ - setobj2s(L, func, tm); /* metamethod is the new function to be called */ - return func; -} - - -/* -** Given 'nres' results at 'firstResult', move 'wanted' of them to 'res'. -** Handle most typical cases (zero results for commands, one result for -** expressions, multiple results for tail calls/single parameters) -** separated. -*/ -l_sinline void moveresults (lua_State *L, StkId res, int nres, int wanted) { - StkId firstresult; - int i; - switch (wanted) { /* handle typical cases separately */ - case 0: /* no values needed */ - L->top.p = res; - return; - case 1: /* one value needed */ - if (nres == 0) /* no results? */ - setnilvalue(s2v(res)); /* adjust with nil */ - else /* at least one result */ - setobjs2s(L, res, L->top.p - nres); /* move it to proper place */ - L->top.p = res + 1; - return; - case LUA_MULTRET: - wanted = nres; /* we want all results */ - break; - default: /* two/more results and/or to-be-closed variables */ - if (hastocloseCfunc(wanted)) { /* to-be-closed variables? */ - L->ci->callstatus |= CIST_CLSRET; /* in case of yields */ - L->ci->u2.nres = nres; - res = luaF_close(L, res, CLOSEKTOP, 1); - L->ci->callstatus &= ~CIST_CLSRET; - if (L->hookmask) { /* if needed, call hook after '__close's */ - ptrdiff_t savedres = savestack(L, res); - rethook(L, L->ci, nres); - res = restorestack(L, savedres); /* hook can move stack */ - } - wanted = decodeNresults(wanted); - if (wanted == LUA_MULTRET) - wanted = nres; /* we want all results */ - } - break; - } - /* generic case */ - firstresult = L->top.p - nres; /* index of first result */ - if (nres > wanted) /* extra results? */ - nres = wanted; /* don't need them */ - for (i = 0; i < nres; i++) /* move all results to correct place */ - setobjs2s(L, res + i, firstresult + i); - for (; i < wanted; i++) /* complete wanted number of results */ - setnilvalue(s2v(res + i)); - L->top.p = res + wanted; /* top points after the last result */ -} - - -/* -** Finishes a function call: calls hook if necessary, moves current -** number of results to proper place, and returns to previous call -** info. If function has to close variables, hook must be called after -** that. -*/ -void luaD_poscall (lua_State *L, CallInfo *ci, int nres) { - int wanted = ci->nresults; - if (l_unlikely(L->hookmask && !hastocloseCfunc(wanted))) - rethook(L, ci, nres); - /* move results to proper place */ - moveresults(L, ci->func.p, nres, wanted); - /* function cannot be in any of these cases when returning */ - lua_assert(!(ci->callstatus & - (CIST_HOOKED | CIST_YPCALL | CIST_FIN | CIST_TRAN | CIST_CLSRET))); - L->ci = ci->previous; /* back to caller (after closing variables) */ -} - - - -#define next_ci(L) (L->ci->next ? L->ci->next : luaE_extendCI(L)) - - -l_sinline CallInfo *prepCallInfo (lua_State *L, StkId func, int nret, - int mask, StkId top) { - CallInfo *ci = L->ci = next_ci(L); /* new frame */ - ci->func.p = func; - ci->nresults = nret; - ci->callstatus = mask; - ci->top.p = top; - return ci; -} - - -/* -** precall for C functions -*/ -l_sinline int precallC (lua_State *L, StkId func, int nresults, - lua_CFunction f) { - int n; /* number of returns */ - CallInfo *ci; - checkstackp(L, LUA_MINSTACK, func); /* ensure minimum stack size */ - L->ci = ci = prepCallInfo(L, func, nresults, CIST_C, - L->top.p + LUA_MINSTACK); - lua_assert(ci->top.p <= L->stack_last.p); - if (l_unlikely(L->hookmask & LUA_MASKCALL)) { - int narg = cast_int(L->top.p - func) - 1; - luaD_hook(L, LUA_HOOKCALL, -1, 1, narg); - } - lua_unlock(L); - n = (*f)(L); /* do the actual call */ - lua_lock(L); - api_checknelems(L, n); - luaD_poscall(L, ci, n); - return n; -} - - -/* -** Prepare a function for a tail call, building its call info on top -** of the current call info. 'narg1' is the number of arguments plus 1 -** (so that it includes the function itself). Return the number of -** results, if it was a C function, or -1 for a Lua function. -*/ -int luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, - int narg1, int delta) { - retry: - switch (ttypetag(s2v(func))) { - case LUA_VCCL: /* C closure */ - return precallC(L, func, LUA_MULTRET, clCvalue(s2v(func))->f); - case LUA_VLCF: /* light C function */ - return precallC(L, func, LUA_MULTRET, fvalue(s2v(func))); - case LUA_VLCL: { /* Lua function */ - Proto *p = clLvalue(s2v(func))->p; - int fsize = p->maxstacksize; /* frame size */ - int nfixparams = p->numparams; - int i; - checkstackp(L, fsize - delta, func); - ci->func.p -= delta; /* restore 'func' (if vararg) */ - for (i = 0; i < narg1; i++) /* move down function and arguments */ - setobjs2s(L, ci->func.p + i, func + i); - func = ci->func.p; /* moved-down function */ - for (; narg1 <= nfixparams; narg1++) - setnilvalue(s2v(func + narg1)); /* complete missing arguments */ - ci->top.p = func + 1 + fsize; /* top for new function */ - lua_assert(ci->top.p <= L->stack_last.p); - ci->u.l.savedpc = p->code; /* starting point */ - ci->callstatus |= CIST_TAIL; - L->top.p = func + narg1; /* set top */ - return -1; - } - default: { /* not a function */ - func = tryfuncTM(L, func); /* try to get '__call' metamethod */ - /* return luaD_pretailcall(L, ci, func, narg1 + 1, delta); */ - narg1++; - goto retry; /* try again */ - } - } -} - - -/* -** Prepares the call to a function (C or Lua). For C functions, also do -** the call. The function to be called is at '*func'. The arguments -** are on the stack, right after the function. Returns the CallInfo -** to be executed, if it was a Lua function. Otherwise (a C function) -** returns NULL, with all the results on the stack, starting at the -** original function position. -*/ -CallInfo *luaD_precall (lua_State *L, StkId func, int nresults) { - retry: - switch (ttypetag(s2v(func))) { - case LUA_VCCL: /* C closure */ - precallC(L, func, nresults, clCvalue(s2v(func))->f); - return NULL; - case LUA_VLCF: /* light C function */ - precallC(L, func, nresults, fvalue(s2v(func))); - return NULL; - case LUA_VLCL: { /* Lua function */ - CallInfo *ci; - Proto *p = clLvalue(s2v(func))->p; - int narg = cast_int(L->top.p - func) - 1; /* number of real arguments */ - int nfixparams = p->numparams; - int fsize = p->maxstacksize; /* frame size */ - checkstackp(L, fsize, func); - L->ci = ci = prepCallInfo(L, func, nresults, 0, func + 1 + fsize); - ci->u.l.savedpc = p->code; /* starting point */ - for (; narg < nfixparams; narg++) - setnilvalue(s2v(L->top.p++)); /* complete missing arguments */ - lua_assert(ci->top.p <= L->stack_last.p); - return ci; - } - default: { /* not a function */ - func = tryfuncTM(L, func); /* try to get '__call' metamethod */ - /* return luaD_precall(L, func, nresults); */ - goto retry; /* try again with metamethod */ - } - } -} - - -/* -** Call a function (C or Lua) through C. 'inc' can be 1 (increment -** number of recursive invocations in the C stack) or nyci (the same -** plus increment number of non-yieldable calls). -** This function can be called with some use of EXTRA_STACK, so it should -** check the stack before doing anything else. 'luaD_precall' already -** does that. -*/ -l_sinline void ccall (lua_State *L, StkId func, int nResults, l_uint32 inc) { - CallInfo *ci; - L->nCcalls += inc; - if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) { - checkstackp(L, 0, func); /* free any use of EXTRA_STACK */ - luaE_checkcstack(L); - } - if ((ci = luaD_precall(L, func, nResults)) != NULL) { /* Lua function? */ - ci->callstatus = CIST_FRESH; /* mark that it is a "fresh" execute */ - luaV_execute(L, ci); /* call it */ - } - L->nCcalls -= inc; -} - - -/* -** External interface for 'ccall' -*/ -void luaD_call (lua_State *L, StkId func, int nResults) { - ccall(L, func, nResults, 1); -} - - -/* -** Similar to 'luaD_call', but does not allow yields during the call. -*/ -void luaD_callnoyield (lua_State *L, StkId func, int nResults) { - ccall(L, func, nResults, nyci); -} - - -/* -** Finish the job of 'lua_pcallk' after it was interrupted by an yield. -** (The caller, 'finishCcall', does the final call to 'adjustresults'.) -** The main job is to complete the 'luaD_pcall' called by 'lua_pcallk'. -** If a '__close' method yields here, eventually control will be back -** to 'finishCcall' (when that '__close' method finally returns) and -** 'finishpcallk' will run again and close any still pending '__close' -** methods. Similarly, if a '__close' method errs, 'precover' calls -** 'unroll' which calls ''finishCcall' and we are back here again, to -** close any pending '__close' methods. -** Note that, up to the call to 'luaF_close', the corresponding -** 'CallInfo' is not modified, so that this repeated run works like the -** first one (except that it has at least one less '__close' to do). In -** particular, field CIST_RECST preserves the error status across these -** multiple runs, changing only if there is a new error. -*/ -static int finishpcallk (lua_State *L, CallInfo *ci) { - int status = getcistrecst(ci); /* get original status */ - if (l_likely(status == LUA_OK)) /* no error? */ - status = LUA_YIELD; /* was interrupted by an yield */ - else { /* error */ - StkId func = restorestack(L, ci->u2.funcidx); - L->allowhook = getoah(ci->callstatus); /* restore 'allowhook' */ - func = luaF_close(L, func, status, 1); /* can yield or raise an error */ - luaD_seterrorobj(L, status, func); - luaD_shrinkstack(L); /* restore stack size in case of overflow */ - setcistrecst(ci, LUA_OK); /* clear original status */ - } - ci->callstatus &= ~CIST_YPCALL; - L->errfunc = ci->u.c.old_errfunc; - /* if it is here, there were errors or yields; unlike 'lua_pcallk', - do not change status */ - return status; -} - - -/* -** Completes the execution of a C function interrupted by an yield. -** The interruption must have happened while the function was either -** closing its tbc variables in 'moveresults' or executing -** 'lua_callk'/'lua_pcallk'. In the first case, it just redoes -** 'luaD_poscall'. In the second case, the call to 'finishpcallk' -** finishes the interrupted execution of 'lua_pcallk'. After that, it -** calls the continuation of the interrupted function and finally it -** completes the job of the 'luaD_call' that called the function. In -** the call to 'adjustresults', we do not know the number of results -** of the function called by 'lua_callk'/'lua_pcallk', so we are -** conservative and use LUA_MULTRET (always adjust). -*/ -static void finishCcall (lua_State *L, CallInfo *ci) { - int n; /* actual number of results from C function */ - if (ci->callstatus & CIST_CLSRET) { /* was returning? */ - lua_assert(hastocloseCfunc(ci->nresults)); - n = ci->u2.nres; /* just redo 'luaD_poscall' */ - /* don't need to reset CIST_CLSRET, as it will be set again anyway */ - } - else { - int status = LUA_YIELD; /* default if there were no errors */ - /* must have a continuation and must be able to call it */ - lua_assert(ci->u.c.k != NULL && yieldable(L)); - if (ci->callstatus & CIST_YPCALL) /* was inside a 'lua_pcallk'? */ - status = finishpcallk(L, ci); /* finish it */ - adjustresults(L, LUA_MULTRET); /* finish 'lua_callk' */ - lua_unlock(L); - n = (*ci->u.c.k)(L, status, ci->u.c.ctx); /* call continuation */ - lua_lock(L); - api_checknelems(L, n); - } - luaD_poscall(L, ci, n); /* finish 'luaD_call' */ -} - - -/* -** Executes "full continuation" (everything in the stack) of a -** previously interrupted coroutine until the stack is empty (or another -** interruption long-jumps out of the loop). -*/ -static void unroll (lua_State *L, void *ud) { - CallInfo *ci; - UNUSED(ud); - while ((ci = L->ci) != &L->base_ci) { /* something in the stack */ - if (!isLua(ci)) /* C function? */ - finishCcall(L, ci); /* complete its execution */ - else { /* Lua function */ - luaV_finishOp(L); /* finish interrupted instruction */ - luaV_execute(L, ci); /* execute down to higher C 'boundary' */ - } - } -} - - -/* -** Try to find a suspended protected call (a "recover point") for the -** given thread. -*/ -static CallInfo *findpcall (lua_State *L) { - CallInfo *ci; - for (ci = L->ci; ci != NULL; ci = ci->previous) { /* search for a pcall */ - if (ci->callstatus & CIST_YPCALL) - return ci; - } - return NULL; /* no pending pcall */ -} - - -/* -** Signal an error in the call to 'lua_resume', not in the execution -** of the coroutine itself. (Such errors should not be handled by any -** coroutine error handler and should not kill the coroutine.) -*/ -static int resume_error (lua_State *L, const char *msg, int narg) { - api_checkpop(L, narg); - L->top.p -= narg; /* remove args from the stack */ - setsvalue2s(L, L->top.p, luaS_new(L, msg)); /* push error message */ - api_incr_top(L); - lua_unlock(L); - return LUA_ERRRUN; -} - - -/* -** Do the work for 'lua_resume' in protected mode. Most of the work -** depends on the status of the coroutine: initial state, suspended -** inside a hook, or regularly suspended (optionally with a continuation -** function), plus erroneous cases: non-suspended coroutine or dead -** coroutine. -*/ -static void resume (lua_State *L, void *ud) { - int n = *(cast(int*, ud)); /* number of arguments */ - StkId firstArg = L->top.p - n; /* first argument */ - CallInfo *ci = L->ci; - if (L->status == LUA_OK) /* starting a coroutine? */ - ccall(L, firstArg - 1, LUA_MULTRET, 0); /* just call its body */ - else { /* resuming from previous yield */ - lua_assert(L->status == LUA_YIELD); - L->status = LUA_OK; /* mark that it is running (again) */ - if (isLua(ci)) { /* yielded inside a hook? */ - /* undo increment made by 'luaG_traceexec': instruction was not - executed yet */ - lua_assert(ci->callstatus & CIST_HOOKYIELD); - ci->u.l.savedpc--; - L->top.p = firstArg; /* discard arguments */ - luaV_execute(L, ci); /* just continue running Lua code */ - } - else { /* 'common' yield */ - if (ci->u.c.k != NULL) { /* does it have a continuation function? */ - lua_unlock(L); - n = (*ci->u.c.k)(L, LUA_YIELD, ci->u.c.ctx); /* call continuation */ - lua_lock(L); - api_checknelems(L, n); - } - luaD_poscall(L, ci, n); /* finish 'luaD_call' */ - } - unroll(L, NULL); /* run continuation */ - } -} - - -/* -** Unrolls a coroutine in protected mode while there are recoverable -** errors, that is, errors inside a protected call. (Any error -** interrupts 'unroll', and this loop protects it again so it can -** continue.) Stops with a normal end (status == LUA_OK), an yield -** (status == LUA_YIELD), or an unprotected error ('findpcall' doesn't -** find a recover point). -*/ -static int precover (lua_State *L, int status) { - CallInfo *ci; - while (errorstatus(status) && (ci = findpcall(L)) != NULL) { - L->ci = ci; /* go down to recovery functions */ - setcistrecst(ci, status); /* status to finish 'pcall' */ - status = luaD_rawrunprotected(L, unroll, NULL); - } - return status; -} - - -LUA_API int lua_resume (lua_State *L, lua_State *from, int nargs, - int *nresults) { - int status; - lua_lock(L); - if (L->status == LUA_OK) { /* may be starting a coroutine */ - if (L->ci != &L->base_ci) /* not in base level? */ - return resume_error(L, "cannot resume non-suspended coroutine", nargs); - else if (L->top.p - (L->ci->func.p + 1) == nargs) /* no function? */ - return resume_error(L, "cannot resume dead coroutine", nargs); - } - else if (L->status != LUA_YIELD) /* ended with errors? */ - return resume_error(L, "cannot resume dead coroutine", nargs); - L->nCcalls = (from) ? getCcalls(from) : 0; - if (getCcalls(L) >= LUAI_MAXCCALLS) - return resume_error(L, "C stack overflow", nargs); - L->nCcalls++; - luai_userstateresume(L, nargs); - api_checkpop(L, (L->status == LUA_OK) ? nargs + 1 : nargs); - status = luaD_rawrunprotected(L, resume, &nargs); - /* continue running after recoverable errors */ - status = precover(L, status); - if (l_likely(!errorstatus(status))) - lua_assert(status == L->status); /* normal end or yield */ - else { /* unrecoverable error */ - L->status = cast_byte(status); /* mark thread as 'dead' */ - luaD_seterrorobj(L, status, L->top.p); /* push error message */ - L->ci->top.p = L->top.p; - } - *nresults = (status == LUA_YIELD) ? L->ci->u2.nyield - : cast_int(L->top.p - (L->ci->func.p + 1)); - lua_unlock(L); - return status; -} - - -LUA_API int lua_isyieldable (lua_State *L) { - return yieldable(L); -} - - -LUA_API int lua_yieldk (lua_State *L, int nresults, lua_KContext ctx, - lua_KFunction k) { - CallInfo *ci; - luai_userstateyield(L, nresults); - lua_lock(L); - ci = L->ci; - api_checkpop(L, nresults); - if (l_unlikely(!yieldable(L))) { - if (L != G(L)->mainthread) - luaG_runerror(L, "attempt to yield across a C-call boundary"); - else - luaG_runerror(L, "attempt to yield from outside a coroutine"); - } - L->status = LUA_YIELD; - ci->u2.nyield = nresults; /* save number of results */ - if (isLua(ci)) { /* inside a hook? */ - lua_assert(!isLuacode(ci)); - api_check(L, nresults == 0, "hooks cannot yield values"); - api_check(L, k == NULL, "hooks cannot continue after yielding"); - } - else { - if ((ci->u.c.k = k) != NULL) /* is there a continuation? */ - ci->u.c.ctx = ctx; /* save context */ - luaD_throw(L, LUA_YIELD); - } - lua_assert(ci->callstatus & CIST_HOOKED); /* must be inside a hook */ - lua_unlock(L); - return 0; /* return to 'luaD_hook' */ -} - - -/* -** Auxiliary structure to call 'luaF_close' in protected mode. -*/ -struct CloseP { - StkId level; - int status; -}; - - -/* -** Auxiliary function to call 'luaF_close' in protected mode. -*/ -static void closepaux (lua_State *L, void *ud) { - struct CloseP *pcl = cast(struct CloseP *, ud); - luaF_close(L, pcl->level, pcl->status, 0); -} - - -/* -** Calls 'luaF_close' in protected mode. Return the original status -** or, in case of errors, the new status. -*/ -int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status) { - CallInfo *old_ci = L->ci; - lu_byte old_allowhooks = L->allowhook; - for (;;) { /* keep closing upvalues until no more errors */ - struct CloseP pcl; - pcl.level = restorestack(L, level); pcl.status = status; - status = luaD_rawrunprotected(L, &closepaux, &pcl); - if (l_likely(status == LUA_OK)) /* no more errors? */ - return pcl.status; - else { /* an error occurred; restore saved state and repeat */ - L->ci = old_ci; - L->allowhook = old_allowhooks; - } - } -} - - -/* -** Call the C function 'func' in protected mode, restoring basic -** thread information ('allowhook', etc.) and in particular -** its stack level in case of errors. -*/ -int luaD_pcall (lua_State *L, Pfunc func, void *u, - ptrdiff_t old_top, ptrdiff_t ef) { - int status; - CallInfo *old_ci = L->ci; - lu_byte old_allowhooks = L->allowhook; - ptrdiff_t old_errfunc = L->errfunc; - L->errfunc = ef; - status = luaD_rawrunprotected(L, func, u); - if (l_unlikely(status != LUA_OK)) { /* an error occurred? */ - L->ci = old_ci; - L->allowhook = old_allowhooks; - status = luaD_closeprotected(L, old_top, status); - luaD_seterrorobj(L, status, restorestack(L, old_top)); - luaD_shrinkstack(L); /* restore stack size in case of overflow */ - } - L->errfunc = old_errfunc; - return status; -} - - - -/* -** Execute a protected parser. -*/ -struct SParser { /* data to 'f_parser' */ - ZIO *z; - Mbuffer buff; /* dynamic structure used by the scanner */ - Dyndata dyd; /* dynamic structures used by the parser */ - const char *mode; - const char *name; -}; - - -static void checkmode (lua_State *L, const char *mode, const char *x) { - if (strchr(mode, x[0]) == NULL) { - luaO_pushfstring(L, - "attempt to load a %s chunk (mode is '%s')", x, mode); - luaD_throw(L, LUA_ERRSYNTAX); - } -} - - -static void f_parser (lua_State *L, void *ud) { - LClosure *cl; - struct SParser *p = cast(struct SParser *, ud); - const char *mode = p->mode ? p->mode : "bt"; - int c = zgetc(p->z); /* read first character */ - if (c == LUA_SIGNATURE[0]) { - int fixed = 0; - if (strchr(mode, 'B') != NULL) - fixed = 1; - else - checkmode(L, mode, "binary"); - cl = luaU_undump(L, p->z, p->name, fixed); - } - else { - checkmode(L, mode, "text"); - cl = luaY_parser(L, p->z, &p->buff, &p->dyd, p->name, c); - } - lua_assert(cl->nupvalues == cl->p->sizeupvalues); - luaF_initupvals(L, cl); -} - - -int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, - const char *mode) { - struct SParser p; - int status; - incnny(L); /* cannot yield during parsing */ - p.z = z; p.name = name; p.mode = mode; - p.dyd.actvar.arr = NULL; p.dyd.actvar.size = 0; - p.dyd.gt.arr = NULL; p.dyd.gt.size = 0; - p.dyd.label.arr = NULL; p.dyd.label.size = 0; - luaZ_initbuffer(L, &p.buff); - status = luaD_pcall(L, f_parser, &p, savestack(L, L->top.p), L->errfunc); - luaZ_freebuffer(L, &p.buff); - luaM_freearray(L, p.dyd.actvar.arr, p.dyd.actvar.size); - luaM_freearray(L, p.dyd.gt.arr, p.dyd.gt.size); - luaM_freearray(L, p.dyd.label.arr, p.dyd.label.size); - decnny(L); - return status; -} - - - - -/* -** $Id: lvm.c $ -** Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#define lvm_c -#define LUA_CORE - - -#include -#include -#include -#include -#include -#include - - - - -/* -** By default, use jump tables in the main interpreter loop on gcc -** and compatible compilers. -*/ -#if !defined(LUA_USE_JUMPTABLE) -#if defined(__GNUC__) -#define LUA_USE_JUMPTABLE 1 -#else -#define LUA_USE_JUMPTABLE 0 -#endif -#endif - - - -/* limit for table tag-method chains (to avoid infinite loops) */ -#define MAXTAGLOOP 2000 - - -/* -** 'l_intfitsf' checks whether a given integer is in the range that -** can be converted to a float without rounding. Used in comparisons. -*/ - -/* number of bits in the mantissa of a float */ -#define NBM (l_floatatt(MANT_DIG)) - -/* -** Check whether some integers may not fit in a float, testing whether -** (maxinteger >> NBM) > 0. (That implies (1 << NBM) <= maxinteger.) -** (The shifts are done in parts, to avoid shifting by more than the size -** of an integer. In a worst case, NBM == 113 for long double and -** sizeof(long) == 32.) -*/ -#if ((((LUA_MAXINTEGER >> (NBM / 4)) >> (NBM / 4)) >> (NBM / 4)) \ - >> (NBM - (3 * (NBM / 4)))) > 0 - -/* limit for integers that fit in a float */ -#define MAXINTFITSF ((lua_Unsigned)1 << NBM) - -/* check whether 'i' is in the interval [-MAXINTFITSF, MAXINTFITSF] */ -#define l_intfitsf(i) ((MAXINTFITSF + l_castS2U(i)) <= (2 * MAXINTFITSF)) - -#else /* all integers fit in a float precisely */ - -#define l_intfitsf(i) 1 - -#endif - - -/* -** Try to convert a value from string to a number value. -** If the value is not a string or is a string not representing -** a valid numeral (or if coercions from strings to numbers -** are disabled via macro 'cvt2num'), do not modify 'result' -** and return 0. -*/ -static int l_strton (const TValue *obj, TValue *result) { - lua_assert(obj != result); - if (!cvt2num(obj)) /* is object not a string? */ - return 0; - else { - TString *st = tsvalue(obj); - size_t stlen; - const char *s = getlstr(st, stlen); - return (luaO_str2num(s, result) == stlen + 1); - } -} - - -/* -** Try to convert a value to a float. The float case is already handled -** by the macro 'tonumber'. -*/ -int luaV_tonumber_ (const TValue *obj, lua_Number *n) { - TValue v; - if (ttisinteger(obj)) { - *n = cast_num(ivalue(obj)); - return 1; - } - else if (l_strton(obj, &v)) { /* string coercible to number? */ - *n = nvalue(&v); /* convert result of 'luaO_str2num' to a float */ - return 1; - } - else - return 0; /* conversion failed */ -} - - -/* -** try to convert a float to an integer, rounding according to 'mode'. -*/ -int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode) { - lua_Number f = l_floor(n); - if (n != f) { /* not an integral value? */ - if (mode == F2Ieq) return 0; /* fails if mode demands integral value */ - else if (mode == F2Iceil) /* needs ceil? */ - f += 1; /* convert floor to ceil (remember: n != f) */ - } - return lua_numbertointeger(f, p); -} - - -/* -** try to convert a value to an integer, rounding according to 'mode', -** without string coercion. -** ("Fast track" handled by macro 'tointegerns'.) -*/ -int luaV_tointegerns (const TValue *obj, lua_Integer *p, F2Imod mode) { - if (ttisfloat(obj)) - return luaV_flttointeger(fltvalue(obj), p, mode); - else if (ttisinteger(obj)) { - *p = ivalue(obj); - return 1; - } - else - return 0; -} - - -/* -** try to convert a value to an integer. -*/ -int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode) { - TValue v; - if (l_strton(obj, &v)) /* does 'obj' point to a numerical string? */ - obj = &v; /* change it to point to its corresponding number */ - return luaV_tointegerns(obj, p, mode); -} - - -/* -** Try to convert a 'for' limit to an integer, preserving the semantics -** of the loop. Return true if the loop must not run; otherwise, '*p' -** gets the integer limit. -** (The following explanation assumes a positive step; it is valid for -** negative steps mutatis mutandis.) -** If the limit is an integer or can be converted to an integer, -** rounding down, that is the limit. -** Otherwise, check whether the limit can be converted to a float. If -** the float is too large, clip it to LUA_MAXINTEGER. If the float -** is too negative, the loop should not run, because any initial -** integer value is greater than such limit; so, the function returns -** true to signal that. (For this latter case, no integer limit would be -** correct; even a limit of LUA_MININTEGER would run the loop once for -** an initial value equal to LUA_MININTEGER.) -*/ -static int forlimit (lua_State *L, lua_Integer init, const TValue *lim, - lua_Integer *p, lua_Integer step) { - if (!luaV_tointeger(lim, p, (step < 0 ? F2Iceil : F2Ifloor))) { - /* not coercible to in integer */ - lua_Number flim; /* try to convert to float */ - if (!tonumber(lim, &flim)) /* cannot convert to float? */ - luaG_forerror(L, lim, "limit"); - /* else 'flim' is a float out of integer bounds */ - if (luai_numlt(0, flim)) { /* if it is positive, it is too large */ - if (step < 0) return 1; /* initial value must be less than it */ - *p = LUA_MAXINTEGER; /* truncate */ - } - else { /* it is less than min integer */ - if (step > 0) return 1; /* initial value must be greater than it */ - *p = LUA_MININTEGER; /* truncate */ - } - } - return (step > 0 ? init > *p : init < *p); /* not to run? */ -} - - -/* -** Prepare a numerical for loop (opcode OP_FORPREP). -** Before execution, stack is as follows: -** ra : initial value -** ra + 1 : limit -** ra + 2 : step -** Return true to skip the loop. Otherwise, -** after preparation, stack will be as follows: -** ra : loop counter (integer loops) or limit (float loops) -** ra + 1 : step -** ra + 2 : control variable -*/ -static int forprep (lua_State *L, StkId ra) { - TValue *pinit = s2v(ra); - TValue *plimit = s2v(ra + 1); - TValue *pstep = s2v(ra + 2); - if (ttisinteger(pinit) && ttisinteger(pstep)) { /* integer loop? */ - lua_Integer init = ivalue(pinit); - lua_Integer step = ivalue(pstep); - lua_Integer limit; - if (step == 0) - luaG_runerror(L, "'for' step is zero"); - if (forlimit(L, init, plimit, &limit, step)) - return 1; /* skip the loop */ - else { /* prepare loop counter */ - lua_Unsigned count; - if (step > 0) { /* ascending loop? */ - count = l_castS2U(limit) - l_castS2U(init); - if (step != 1) /* avoid division in the too common case */ - count /= l_castS2U(step); - } - else { /* step < 0; descending loop */ - count = l_castS2U(init) - l_castS2U(limit); - /* 'step+1' avoids negating 'mininteger' */ - count /= l_castS2U(-(step + 1)) + 1u; - } - /* use 'chgivalue' for places that for sure had integers */ - chgivalue(s2v(ra), l_castU2S(count)); /* change init to count */ - setivalue(s2v(ra + 1), step); /* change limit to step */ - chgivalue(s2v(ra + 2), init); /* change step to init */ - } - } - else { /* try making all values floats */ - lua_Number init; lua_Number limit; lua_Number step; - if (l_unlikely(!tonumber(plimit, &limit))) - luaG_forerror(L, plimit, "limit"); - if (l_unlikely(!tonumber(pstep, &step))) - luaG_forerror(L, pstep, "step"); - if (l_unlikely(!tonumber(pinit, &init))) - luaG_forerror(L, pinit, "initial value"); - if (step == 0) - luaG_runerror(L, "'for' step is zero"); - if (luai_numlt(0, step) ? luai_numlt(limit, init) - : luai_numlt(init, limit)) - return 1; /* skip the loop */ - else { - /* make sure all values are floats */ - setfltvalue(s2v(ra), limit); - setfltvalue(s2v(ra + 1), step); - setfltvalue(s2v(ra + 2), init); /* control variable */ - } - } - return 0; -} - - -/* -** Execute a step of a float numerical for loop, returning -** true iff the loop must continue. (The integer case is -** written online with opcode OP_FORLOOP, for performance.) -*/ -static int floatforloop (StkId ra) { - lua_Number step = fltvalue(s2v(ra + 1)); - lua_Number limit = fltvalue(s2v(ra)); - lua_Number idx = fltvalue(s2v(ra + 2)); /* control variable */ - idx = luai_numadd(L, idx, step); /* increment index */ - if (luai_numlt(0, step) ? luai_numle(idx, limit) - : luai_numle(limit, idx)) { - chgfltvalue(s2v(ra + 2), idx); /* update control variable */ - return 1; /* jump back */ - } - else - return 0; /* finish the loop */ -} - - -/* -** Finish the table access 'val = t[key]' and return the tag of the result. -*/ -int luaV_finishget (lua_State *L, const TValue *t, TValue *key, StkId val, - int tag) { - int loop; /* counter to avoid infinite loops */ - const TValue *tm; /* metamethod */ - for (loop = 0; loop < MAXTAGLOOP; loop++) { - if (tag == LUA_VNOTABLE) { /* 't' is not a table? */ - lua_assert(!ttistable(t)); - tm = luaT_gettmbyobj(L, t, TM_INDEX); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, t, "index"); /* no metamethod */ - /* else will try the metamethod */ - } - else { /* 't' is a table */ - tm = fasttm(L, hvalue(t)->metatable, TM_INDEX); /* table's metamethod */ - if (tm == NULL) { /* no metamethod? */ - setnilvalue(s2v(val)); /* result is nil */ - return LUA_VNIL; - } - /* else will try the metamethod */ - } - if (ttisfunction(tm)) { /* is metamethod a function? */ - tag = luaT_callTMres(L, tm, t, key, val); /* call it */ - return tag; /* return tag of the result */ - } - t = tm; /* else try to access 'tm[key]' */ - luaV_fastget(t, key, s2v(val), luaH_get, tag); - if (!tagisempty(tag)) - return tag; /* done */ - /* else repeat (tail call 'luaV_finishget') */ - } - luaG_runerror(L, "'__index' chain too long; possible loop"); - return 0; /* to avoid warnings */ -} - - -/* -** Finish a table assignment 't[key] = val'. -*/ -void luaV_finishset (lua_State *L, const TValue *t, TValue *key, - TValue *val, int hres) { - int loop; /* counter to avoid infinite loops */ - for (loop = 0; loop < MAXTAGLOOP; loop++) { - const TValue *tm; /* '__newindex' metamethod */ - if (hres != HNOTATABLE) { /* is 't' a table? */ - Table *h = hvalue(t); /* save 't' table */ - tm = fasttm(L, h->metatable, TM_NEWINDEX); /* get metamethod */ - if (tm == NULL) { /* no metamethod? */ - luaH_finishset(L, h, key, val, hres); /* set new value */ - invalidateTMcache(h); - luaC_barrierback(L, obj2gco(h), val); - return; - } - /* else will try the metamethod */ - } - else { /* not a table; check metamethod */ - tm = luaT_gettmbyobj(L, t, TM_NEWINDEX); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, t, "index"); - } - /* try the metamethod */ - if (ttisfunction(tm)) { - luaT_callTM(L, tm, t, key, val); - return; - } - t = tm; /* else repeat assignment over 'tm' */ - luaV_fastset(t, key, val, hres, luaH_pset); - if (hres == HOK) - return; /* done */ - /* else 'return luaV_finishset(L, t, key, val, slot)' (loop) */ - } - luaG_runerror(L, "'__newindex' chain too long; possible loop"); -} - - -/* -** Compare two strings 'ts1' x 'ts2', returning an integer less-equal- -** -greater than zero if 'ts1' is less-equal-greater than 'ts2'. -** The code is a little tricky because it allows '\0' in the strings -** and it uses 'strcoll' (to respect locales) for each segment -** of the strings. Note that segments can compare equal but still -** have different lengths. -*/ -static int l_strcmp (const TString *ts1, const TString *ts2) { - size_t rl1; /* real length */ - const char *s1 = getlstr(ts1, rl1); - size_t rl2; - const char *s2 = getlstr(ts2, rl2); - for (;;) { /* for each segment */ - int temp = strcoll(s1, s2); - if (temp != 0) /* not equal? */ - return temp; /* done */ - else { /* strings are equal up to a '\0' */ - size_t zl1 = strlen(s1); /* index of first '\0' in 's1' */ - size_t zl2 = strlen(s2); /* index of first '\0' in 's2' */ - if (zl2 == rl2) /* 's2' is finished? */ - return (zl1 == rl1) ? 0 : 1; /* check 's1' */ - else if (zl1 == rl1) /* 's1' is finished? */ - return -1; /* 's1' is less than 's2' ('s2' is not finished) */ - /* both strings longer than 'zl'; go on comparing after the '\0' */ - zl1++; zl2++; - s1 += zl1; rl1 -= zl1; s2 += zl2; rl2 -= zl2; - } - } -} - - -/* -** Check whether integer 'i' is less than float 'f'. If 'i' has an -** exact representation as a float ('l_intfitsf'), compare numbers as -** floats. Otherwise, use the equivalence 'i < f <=> i < ceil(f)'. -** If 'ceil(f)' is out of integer range, either 'f' is greater than -** all integers or less than all integers. -** (The test with 'l_intfitsf' is only for performance; the else -** case is correct for all values, but it is slow due to the conversion -** from float to int.) -** When 'f' is NaN, comparisons must result in false. -*/ -l_sinline int LTintfloat (lua_Integer i, lua_Number f) { - if (l_intfitsf(i)) - return luai_numlt(cast_num(i), f); /* compare them as floats */ - else { /* i < f <=> i < ceil(f) */ - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Iceil)) /* fi = ceil(f) */ - return i < fi; /* compare them as integers */ - else /* 'f' is either greater or less than all integers */ - return f > 0; /* greater? */ - } -} - - -/* -** Check whether integer 'i' is less than or equal to float 'f'. -** See comments on previous function. -*/ -l_sinline int LEintfloat (lua_Integer i, lua_Number f) { - if (l_intfitsf(i)) - return luai_numle(cast_num(i), f); /* compare them as floats */ - else { /* i <= f <=> i <= floor(f) */ - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ifloor)) /* fi = floor(f) */ - return i <= fi; /* compare them as integers */ - else /* 'f' is either greater or less than all integers */ - return f > 0; /* greater? */ - } -} - - -/* -** Check whether float 'f' is less than integer 'i'. -** See comments on previous function. -*/ -l_sinline int LTfloatint (lua_Number f, lua_Integer i) { - if (l_intfitsf(i)) - return luai_numlt(f, cast_num(i)); /* compare them as floats */ - else { /* f < i <=> floor(f) < i */ - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ifloor)) /* fi = floor(f) */ - return fi < i; /* compare them as integers */ - else /* 'f' is either greater or less than all integers */ - return f < 0; /* less? */ - } -} - - -/* -** Check whether float 'f' is less than or equal to integer 'i'. -** See comments on previous function. -*/ -l_sinline int LEfloatint (lua_Number f, lua_Integer i) { - if (l_intfitsf(i)) - return luai_numle(f, cast_num(i)); /* compare them as floats */ - else { /* f <= i <=> ceil(f) <= i */ - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Iceil)) /* fi = ceil(f) */ - return fi <= i; /* compare them as integers */ - else /* 'f' is either greater or less than all integers */ - return f < 0; /* less? */ - } -} - - -/* -** Return 'l < r', for numbers. -*/ -l_sinline int LTnum (const TValue *l, const TValue *r) { - lua_assert(ttisnumber(l) && ttisnumber(r)); - if (ttisinteger(l)) { - lua_Integer li = ivalue(l); - if (ttisinteger(r)) - return li < ivalue(r); /* both are integers */ - else /* 'l' is int and 'r' is float */ - return LTintfloat(li, fltvalue(r)); /* l < r ? */ - } - else { - lua_Number lf = fltvalue(l); /* 'l' must be float */ - if (ttisfloat(r)) - return luai_numlt(lf, fltvalue(r)); /* both are float */ - else /* 'l' is float and 'r' is int */ - return LTfloatint(lf, ivalue(r)); - } -} - - -/* -** Return 'l <= r', for numbers. -*/ -l_sinline int LEnum (const TValue *l, const TValue *r) { - lua_assert(ttisnumber(l) && ttisnumber(r)); - if (ttisinteger(l)) { - lua_Integer li = ivalue(l); - if (ttisinteger(r)) - return li <= ivalue(r); /* both are integers */ - else /* 'l' is int and 'r' is float */ - return LEintfloat(li, fltvalue(r)); /* l <= r ? */ - } - else { - lua_Number lf = fltvalue(l); /* 'l' must be float */ - if (ttisfloat(r)) - return luai_numle(lf, fltvalue(r)); /* both are float */ - else /* 'l' is float and 'r' is int */ - return LEfloatint(lf, ivalue(r)); - } -} - - -/* -** return 'l < r' for non-numbers. -*/ -static int lessthanothers (lua_State *L, const TValue *l, const TValue *r) { - lua_assert(!ttisnumber(l) || !ttisnumber(r)); - if (ttisstring(l) && ttisstring(r)) /* both are strings? */ - return l_strcmp(tsvalue(l), tsvalue(r)) < 0; - else - return luaT_callorderTM(L, l, r, TM_LT); -} - - -/* -** Main operation less than; return 'l < r'. -*/ -int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) { - if (ttisnumber(l) && ttisnumber(r)) /* both operands are numbers? */ - return LTnum(l, r); - else return lessthanothers(L, l, r); -} - - -/* -** return 'l <= r' for non-numbers. -*/ -static int lessequalothers (lua_State *L, const TValue *l, const TValue *r) { - lua_assert(!ttisnumber(l) || !ttisnumber(r)); - if (ttisstring(l) && ttisstring(r)) /* both are strings? */ - return l_strcmp(tsvalue(l), tsvalue(r)) <= 0; - else - return luaT_callorderTM(L, l, r, TM_LE); -} - - -/* -** Main operation less than or equal to; return 'l <= r'. -*/ -int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r) { - if (ttisnumber(l) && ttisnumber(r)) /* both operands are numbers? */ - return LEnum(l, r); - else return lessequalothers(L, l, r); -} - - -/* -** Main operation for equality of Lua values; return 't1 == t2'. -** L == NULL means raw equality (no metamethods) -*/ -int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2) { - const TValue *tm; - if (ttypetag(t1) != ttypetag(t2)) { /* not the same variant? */ - if (ttype(t1) != ttype(t2) || ttype(t1) != LUA_TNUMBER) - return 0; /* only numbers can be equal with different variants */ - else { /* two numbers with different variants */ - /* One of them is an integer. If the other does not have an - integer value, they cannot be equal; otherwise, compare their - integer values. */ - lua_Integer i1, i2; - return (luaV_tointegerns(t1, &i1, F2Ieq) && - luaV_tointegerns(t2, &i2, F2Ieq) && - i1 == i2); - } - } - /* values have same type and same variant */ - switch (ttypetag(t1)) { - case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: return 1; - case LUA_VNUMINT: return (ivalue(t1) == ivalue(t2)); - case LUA_VNUMFLT: return luai_numeq(fltvalue(t1), fltvalue(t2)); - case LUA_VLIGHTUSERDATA: return pvalue(t1) == pvalue(t2); - case LUA_VLCF: return fvalue(t1) == fvalue(t2); - case LUA_VSHRSTR: return eqshrstr(tsvalue(t1), tsvalue(t2)); - case LUA_VLNGSTR: return luaS_eqlngstr(tsvalue(t1), tsvalue(t2)); - case LUA_VUSERDATA: { - if (uvalue(t1) == uvalue(t2)) return 1; - else if (L == NULL) return 0; - tm = fasttm(L, uvalue(t1)->metatable, TM_EQ); - if (tm == NULL) - tm = fasttm(L, uvalue(t2)->metatable, TM_EQ); - break; /* will try TM */ - } - case LUA_VTABLE: { - if (hvalue(t1) == hvalue(t2)) return 1; - else if (L == NULL) return 0; - tm = fasttm(L, hvalue(t1)->metatable, TM_EQ); - if (tm == NULL) - tm = fasttm(L, hvalue(t2)->metatable, TM_EQ); - break; /* will try TM */ - } - default: - return gcvalue(t1) == gcvalue(t2); - } - if (tm == NULL) /* no TM? */ - return 0; /* objects are different */ - else { - int tag = luaT_callTMres(L, tm, t1, t2, L->top.p); /* call TM */ - return !tagisfalse(tag); - } -} - - -/* macro used by 'luaV_concat' to ensure that element at 'o' is a string */ -#define tostring(L,o) \ - (ttisstring(o) || (cvt2str(o) && (luaO_tostring(L, o), 1))) - -#define isemptystr(o) (ttisshrstring(o) && tsvalue(o)->shrlen == 0) - -/* copy strings in stack from top - n up to top - 1 to buffer */ -static void copy2buff (StkId top, int n, char *buff) { - size_t tl = 0; /* size already copied */ - do { - TString *st = tsvalue(s2v(top - n)); - size_t l; /* length of string being copied */ - const char *s = getlstr(st, l); - memcpy(buff + tl, s, l * sizeof(char)); - tl += l; - } while (--n > 0); -} - - -/* -** Main operation for concatenation: concat 'total' values in the stack, -** from 'L->top.p - total' up to 'L->top.p - 1'. -*/ -void luaV_concat (lua_State *L, int total) { - if (total == 1) - return; /* "all" values already concatenated */ - do { - StkId top = L->top.p; - int n = 2; /* number of elements handled in this pass (at least 2) */ - if (!(ttisstring(s2v(top - 2)) || cvt2str(s2v(top - 2))) || - !tostring(L, s2v(top - 1))) - luaT_tryconcatTM(L); /* may invalidate 'top' */ - else if (isemptystr(s2v(top - 1))) /* second operand is empty? */ - cast_void(tostring(L, s2v(top - 2))); /* result is first operand */ - else if (isemptystr(s2v(top - 2))) { /* first operand is empty string? */ - setobjs2s(L, top - 2, top - 1); /* result is second op. */ - } - else { - /* at least two non-empty string values; get as many as possible */ - size_t tl = tsslen(tsvalue(s2v(top - 1))); - TString *ts; - /* collect total length and number of strings */ - for (n = 1; n < total && tostring(L, s2v(top - n - 1)); n++) { - size_t l = tsslen(tsvalue(s2v(top - n - 1))); - if (l_unlikely(l >= MAX_SIZE - sizeof(TString) - tl)) { - L->top.p = top - total; /* pop strings to avoid wasting stack */ - luaG_runerror(L, "string length overflow"); - } - tl += l; - } - if (tl <= LUAI_MAXSHORTLEN) { /* is result a short string? */ - char buff[LUAI_MAXSHORTLEN]; - copy2buff(top, n, buff); /* copy strings to buffer */ - ts = luaS_newlstr(L, buff, tl); - } - else { /* long string; copy strings directly to final result */ - ts = luaS_createlngstrobj(L, tl); - copy2buff(top, n, getlngstr(ts)); - } - setsvalue2s(L, top - n, ts); /* create result */ - } - total -= n - 1; /* got 'n' strings to create one new */ - L->top.p -= n - 1; /* popped 'n' strings and pushed one */ - } while (total > 1); /* repeat until only 1 result left */ -} - - -/* -** Main operation 'ra = #rb'. -*/ -void luaV_objlen (lua_State *L, StkId ra, const TValue *rb) { - const TValue *tm; - switch (ttypetag(rb)) { - case LUA_VTABLE: { - Table *h = hvalue(rb); - tm = fasttm(L, h->metatable, TM_LEN); - if (tm) break; /* metamethod? break switch to call it */ - setivalue(s2v(ra), luaH_getn(h)); /* else primitive len */ - return; - } - case LUA_VSHRSTR: { - setivalue(s2v(ra), tsvalue(rb)->shrlen); - return; - } - case LUA_VLNGSTR: { - setivalue(s2v(ra), tsvalue(rb)->u.lnglen); - return; - } - default: { /* try metamethod */ - tm = luaT_gettmbyobj(L, rb, TM_LEN); - if (l_unlikely(notm(tm))) /* no metamethod? */ - luaG_typeerror(L, rb, "get length of"); - break; - } - } - luaT_callTMres(L, tm, rb, rb, ra); -} - - -/* -** Integer division; return 'm // n', that is, floor(m/n). -** C division truncates its result (rounds towards zero). -** 'floor(q) == trunc(q)' when 'q >= 0' or when 'q' is integer, -** otherwise 'floor(q) == trunc(q) - 1'. -*/ -lua_Integer luaV_idiv (lua_State *L, lua_Integer m, lua_Integer n) { - if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { /* special cases: -1 or 0 */ - if (n == 0) - luaG_runerror(L, "attempt to divide by zero"); - return intop(-, 0, m); /* n==-1; avoid overflow with 0x80000...//-1 */ - } - else { - lua_Integer q = m / n; /* perform C division */ - if ((m ^ n) < 0 && m % n != 0) /* 'm/n' would be negative non-integer? */ - q -= 1; /* correct result for different rounding */ - return q; - } -} - - -/* -** Integer modulus; return 'm % n'. (Assume that C '%' with -** negative operands follows C99 behavior. See previous comment -** about luaV_idiv.) -*/ -lua_Integer luaV_mod (lua_State *L, lua_Integer m, lua_Integer n) { - if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { /* special cases: -1 or 0 */ - if (n == 0) - luaG_runerror(L, "attempt to perform 'n%%0'"); - return 0; /* m % -1 == 0; avoid overflow with 0x80000...%-1 */ - } - else { - lua_Integer r = m % n; - if (r != 0 && (r ^ n) < 0) /* 'm/n' would be non-integer negative? */ - r += n; /* correct result for different rounding */ - return r; - } -} - - -/* -** Float modulus -*/ -lua_Number luaV_modf (lua_State *L, lua_Number m, lua_Number n) { - lua_Number r; - luai_nummod(L, m, n, r); - return r; -} - - -/* number of bits in an integer */ -#define NBITS cast_int(sizeof(lua_Integer) * CHAR_BIT) - - -/* -** Shift left operation. (Shift right just negates 'y'.) -*/ -lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y) { - if (y < 0) { /* shift right? */ - if (y <= -NBITS) return 0; - else return intop(>>, x, -y); - } - else { /* shift left */ - if (y >= NBITS) return 0; - else return intop(<<, x, y); - } -} - - -/* -** create a new Lua closure, push it in the stack, and initialize -** its upvalues. -*/ -static void pushclosure (lua_State *L, Proto *p, UpVal **encup, StkId base, - StkId ra) { - int nup = p->sizeupvalues; - Upvaldesc *uv = p->upvalues; - int i; - LClosure *ncl = luaF_newLclosure(L, nup); - ncl->p = p; - setclLvalue2s(L, ra, ncl); /* anchor new closure in stack */ - for (i = 0; i < nup; i++) { /* fill in its upvalues */ - if (uv[i].instack) /* upvalue refers to local variable? */ - ncl->upvals[i] = luaF_findupval(L, base + uv[i].idx); - else /* get upvalue from enclosing function */ - ncl->upvals[i] = encup[uv[i].idx]; - luaC_objbarrier(L, ncl, ncl->upvals[i]); - } -} - - -/* -** finish execution of an opcode interrupted by a yield -*/ -void luaV_finishOp (lua_State *L) { - CallInfo *ci = L->ci; - StkId base = ci->func.p + 1; - Instruction inst = *(ci->u.l.savedpc - 1); /* interrupted instruction */ - OpCode op = GET_OPCODE(inst); - switch (op) { /* finish its execution */ - case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { - setobjs2s(L, base + GETARG_A(*(ci->u.l.savedpc - 2)), --L->top.p); - break; - } - case OP_UNM: case OP_BNOT: case OP_LEN: - case OP_GETTABUP: case OP_GETTABLE: case OP_GETI: - case OP_GETFIELD: case OP_SELF: { - setobjs2s(L, base + GETARG_A(inst), --L->top.p); - break; - } - case OP_LT: case OP_LE: - case OP_LTI: case OP_LEI: - case OP_GTI: case OP_GEI: - case OP_EQ: { /* note that 'OP_EQI'/'OP_EQK' cannot yield */ - int res = !l_isfalse(s2v(L->top.p - 1)); - L->top.p--; -#if defined(LUA_COMPAT_LT_LE) - if (ci->callstatus & CIST_LEQ) { /* "<=" using "<" instead? */ - ci->callstatus ^= CIST_LEQ; /* clear mark */ - res = !res; /* negate result */ - } -#endif - lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_JMP); - if (res != GETARG_k(inst)) /* condition failed? */ - ci->u.l.savedpc++; /* skip jump instruction */ - break; - } - case OP_CONCAT: { - StkId top = L->top.p - 1; /* top when 'luaT_tryconcatTM' was called */ - int a = GETARG_A(inst); /* first element to concatenate */ - int total = cast_int(top - 1 - (base + a)); /* yet to concatenate */ - setobjs2s(L, top - 2, top); /* put TM result in proper position */ - L->top.p = top - 1; /* top is one after last element (at top-2) */ - luaV_concat(L, total); /* concat them (may yield again) */ - break; - } - case OP_CLOSE: { /* yielded closing variables */ - ci->u.l.savedpc--; /* repeat instruction to close other vars. */ - break; - } - case OP_RETURN: { /* yielded closing variables */ - StkId ra = base + GETARG_A(inst); - /* adjust top to signal correct number of returns, in case the - return is "up to top" ('isIT') */ - L->top.p = ra + ci->u2.nres; - /* repeat instruction to close other vars. and complete the return */ - ci->u.l.savedpc--; - break; - } - default: { - /* only these other opcodes can yield */ - lua_assert(op == OP_TFORCALL || op == OP_CALL || - op == OP_TAILCALL || op == OP_SETTABUP || op == OP_SETTABLE || - op == OP_SETI || op == OP_SETFIELD); - break; - } - } -} - - - - -/* -** {================================================================== -** Macros for arithmetic/bitwise/comparison opcodes in 'luaV_execute' -** =================================================================== -*/ - -#define l_addi(L,a,b) intop(+, a, b) -#define l_subi(L,a,b) intop(-, a, b) -#define l_muli(L,a,b) intop(*, a, b) -#define l_band(a,b) intop(&, a, b) -#define l_bor(a,b) intop(|, a, b) -#define l_bxor(a,b) intop(^, a, b) - -#define l_lti(a,b) (a < b) -#define l_lei(a,b) (a <= b) -#define l_gti(a,b) (a > b) -#define l_gei(a,b) (a >= b) - - -/* -** Arithmetic operations with immediate operands. 'iop' is the integer -** operation, 'fop' is the float operation. -*/ -#define op_arithI(L,iop,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - int imm = GETARG_sC(i); \ - if (ttisinteger(v1)) { \ - lua_Integer iv1 = ivalue(v1); \ - pc++; setivalue(s2v(ra), iop(L, iv1, imm)); \ - } \ - else if (ttisfloat(v1)) { \ - lua_Number nb = fltvalue(v1); \ - lua_Number fimm = cast_num(imm); \ - pc++; setfltvalue(s2v(ra), fop(L, nb, fimm)); \ - }} - - -/* -** Auxiliary function for arithmetic operations over floats and others -** with two operands. -*/ -#define op_arithf_aux(L,v1,v2,fop) { \ - lua_Number n1; lua_Number n2; \ - if (tonumberns(v1, n1) && tonumberns(v2, n2)) { \ - pc++; setfltvalue(s2v(ra), fop(L, n1, n2)); \ - }} - - -/* -** Arithmetic operations over floats and others with register operands. -*/ -#define op_arithf(L,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - op_arithf_aux(L, v1, v2, fop); } - - -/* -** Arithmetic operations with K operands for floats. -*/ -#define op_arithfK(L,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ - op_arithf_aux(L, v1, v2, fop); } - - -/* -** Arithmetic operations over integers and floats. -*/ -#define op_arith_aux(L,v1,v2,iop,fop) { \ - StkId ra = RA(i); \ - if (ttisinteger(v1) && ttisinteger(v2)) { \ - lua_Integer i1 = ivalue(v1); lua_Integer i2 = ivalue(v2); \ - pc++; setivalue(s2v(ra), iop(L, i1, i2)); \ - } \ - else op_arithf_aux(L, v1, v2, fop); } - - -/* -** Arithmetic operations with register operands. -*/ -#define op_arith(L,iop,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - op_arith_aux(L, v1, v2, iop, fop); } - - -/* -** Arithmetic operations with K operands. -*/ -#define op_arithK(L,iop,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ - op_arith_aux(L, v1, v2, iop, fop); } - - -/* -** Bitwise operations with constant operand. -*/ -#define op_bitwiseK(L,op) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); \ - lua_Integer i1; \ - lua_Integer i2 = ivalue(v2); \ - if (tointegerns(v1, &i1)) { \ - pc++; setivalue(s2v(ra), op(i1, i2)); \ - }} - - -/* -** Bitwise operations with register operands. -*/ -#define op_bitwise(L,op) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - lua_Integer i1; lua_Integer i2; \ - if (tointegerns(v1, &i1) && tointegerns(v2, &i2)) { \ - pc++; setivalue(s2v(ra), op(i1, i2)); \ - }} - - -/* -** Order operations with register operands. 'opn' actually works -** for all numbers, but the fast track improves performance for -** integers. -*/ -#define op_order(L,opi,opn,other) { \ - StkId ra = RA(i); \ - int cond; \ - TValue *rb = vRB(i); \ - if (ttisinteger(s2v(ra)) && ttisinteger(rb)) { \ - lua_Integer ia = ivalue(s2v(ra)); \ - lua_Integer ib = ivalue(rb); \ - cond = opi(ia, ib); \ - } \ - else if (ttisnumber(s2v(ra)) && ttisnumber(rb)) \ - cond = opn(s2v(ra), rb); \ - else \ - Protect(cond = other(L, s2v(ra), rb)); \ - docondjump(); } - - -/* -** Order operations with immediate operand. (Immediate operand is -** always small enough to have an exact representation as a float.) -*/ -#define op_orderI(L,opi,opf,inv,tm) { \ - StkId ra = RA(i); \ - int cond; \ - int im = GETARG_sB(i); \ - if (ttisinteger(s2v(ra))) \ - cond = opi(ivalue(s2v(ra)), im); \ - else if (ttisfloat(s2v(ra))) { \ - lua_Number fa = fltvalue(s2v(ra)); \ - lua_Number fim = cast_num(im); \ - cond = opf(fa, fim); \ - } \ - else { \ - int isf = GETARG_C(i); \ - Protect(cond = luaT_callorderiTM(L, s2v(ra), im, inv, isf, tm)); \ - } \ - docondjump(); } - -/* }================================================================== */ - - -/* -** {================================================================== -** Function 'luaV_execute': main interpreter loop -** =================================================================== -*/ - -/* -** some macros for common tasks in 'luaV_execute' -*/ - - -#define RA(i) (base+GETARG_A(i)) -#define RB(i) (base+GETARG_B(i)) -#define vRB(i) s2v(RB(i)) -#define KB(i) (k+GETARG_B(i)) -#define RC(i) (base+GETARG_C(i)) -#define vRC(i) s2v(RC(i)) -#define KC(i) (k+GETARG_C(i)) -#define RKC(i) ((TESTARG_k(i)) ? k + GETARG_C(i) : s2v(base + GETARG_C(i))) - - - -#define updatetrap(ci) (trap = ci->u.l.trap) - -#define updatebase(ci) (base = ci->func.p + 1) - - -#define updatestack(ci) \ - { if (l_unlikely(trap)) { updatebase(ci); ra = RA(i); } } - - -/* -** Execute a jump instruction. The 'updatetrap' allows signals to stop -** tight loops. (Without it, the local copy of 'trap' could never change.) -*/ -#define dojump(ci,i,e) { pc += GETARG_sJ(i) + e; updatetrap(ci); } - - -/* for test instructions, execute the jump instruction that follows it */ -#define donextjump(ci) { Instruction ni = *pc; dojump(ci, ni, 1); } - -/* -** do a conditional jump: skip next instruction if 'cond' is not what -** was expected (parameter 'k'), else do next instruction, which must -** be a jump. -*/ -#define docondjump() if (cond != GETARG_k(i)) pc++; else donextjump(ci); - - -/* -** Correct global 'pc'. -*/ -#define savepc(L) (ci->u.l.savedpc = pc) - - -/* -** Whenever code can raise errors, the global 'pc' and the global -** 'top' must be correct to report occasional errors. -*/ -#define savestate(L,ci) (savepc(L), L->top.p = ci->top.p) - - -/* -** Protect code that, in general, can raise errors, reallocate the -** stack, and change the hooks. -*/ -#define Protect(exp) (savestate(L,ci), (exp), updatetrap(ci)) - -/* special version that does not change the top */ -#define ProtectNT(exp) (savepc(L), (exp), updatetrap(ci)) - -/* -** Protect code that can only raise errors. (That is, it cannot change -** the stack or hooks.) -*/ -#define halfProtect(exp) (savestate(L,ci), (exp)) - -/* 'c' is the limit of live values in the stack */ -#define checkGC(L,c) \ - { luaC_condGC(L, (savepc(L), L->top.p = (c)), \ - updatetrap(ci)); \ - luai_threadyield(L); } - - -/* fetch an instruction and prepare its execution */ -#define vmfetch() { \ - if (l_unlikely(trap)) { /* stack reallocation or hooks? */ \ - trap = luaG_traceexec(L, pc); /* handle hooks */ \ - updatebase(ci); /* correct stack */ \ - } \ - i = *(pc++); \ -} - -#define vmdispatch(o) switch(o) -#define vmcase(l) case l: -#define vmbreak break - - -void luaV_execute (lua_State *L, CallInfo *ci) { - LClosure *cl; - TValue *k; - StkId base; - const Instruction *pc; - int trap; -#if LUA_USE_JUMPTABLE - -/* -** $Id: ljumptab.h $ -** Jump Table for the Lua interpreter -** See Copyright Notice in lua.h -*/ - - -#undef vmdispatch -#undef vmcase -#undef vmbreak - -#define vmdispatch(x) goto *disptab[x]; - -#define vmcase(l) L_##l: - -#define vmbreak vmfetch(); vmdispatch(GET_OPCODE(i)); - - -static const void *const disptab[NUM_OPCODES] = { - -#if 0 -** you can update the following list with this command: -** -** sed -n '/^OP_/\!d; s/OP_/\&\&L_OP_/ ; s/,.*/,/ ; s/\/.*// ; p' lopcodes.h -** -#endif - -&&L_OP_MOVE, -&&L_OP_LOADI, -&&L_OP_LOADF, -&&L_OP_LOADK, -&&L_OP_LOADKX, -&&L_OP_LOADFALSE, -&&L_OP_LFALSESKIP, -&&L_OP_LOADTRUE, -&&L_OP_LOADNIL, -&&L_OP_GETUPVAL, -&&L_OP_SETUPVAL, -&&L_OP_GETTABUP, -&&L_OP_GETTABLE, -&&L_OP_GETI, -&&L_OP_GETFIELD, -&&L_OP_SETTABUP, -&&L_OP_SETTABLE, -&&L_OP_SETI, -&&L_OP_SETFIELD, -&&L_OP_NEWTABLE, -&&L_OP_SELF, -&&L_OP_ADDI, -&&L_OP_ADDK, -&&L_OP_SUBK, -&&L_OP_MULK, -&&L_OP_MODK, -&&L_OP_POWK, -&&L_OP_DIVK, -&&L_OP_IDIVK, -&&L_OP_BANDK, -&&L_OP_BORK, -&&L_OP_BXORK, -&&L_OP_SHRI, -&&L_OP_SHLI, -&&L_OP_ADD, -&&L_OP_SUB, -&&L_OP_MUL, -&&L_OP_MOD, -&&L_OP_POW, -&&L_OP_DIV, -&&L_OP_IDIV, -&&L_OP_BAND, -&&L_OP_BOR, -&&L_OP_BXOR, -&&L_OP_SHL, -&&L_OP_SHR, -&&L_OP_MMBIN, -&&L_OP_MMBINI, -&&L_OP_MMBINK, -&&L_OP_UNM, -&&L_OP_BNOT, -&&L_OP_NOT, -&&L_OP_LEN, -&&L_OP_CONCAT, -&&L_OP_CLOSE, -&&L_OP_TBC, -&&L_OP_JMP, -&&L_OP_EQ, -&&L_OP_LT, -&&L_OP_LE, -&&L_OP_EQK, -&&L_OP_EQI, -&&L_OP_LTI, -&&L_OP_LEI, -&&L_OP_GTI, -&&L_OP_GEI, -&&L_OP_TEST, -&&L_OP_TESTSET, -&&L_OP_CALL, -&&L_OP_TAILCALL, -&&L_OP_RETURN, -&&L_OP_RETURN0, -&&L_OP_RETURN1, -&&L_OP_FORLOOP, -&&L_OP_FORPREP, -&&L_OP_TFORPREP, -&&L_OP_TFORCALL, -&&L_OP_TFORLOOP, -&&L_OP_SETLIST, -&&L_OP_CLOSURE, -&&L_OP_VARARG, -&&L_OP_VARARGPREP, -&&L_OP_EXTRAARG - -}; - -#endif - startfunc: - trap = L->hookmask; - returning: /* trap already set */ - cl = ci_func(ci); - k = cl->p->k; - pc = ci->u.l.savedpc; - if (l_unlikely(trap)) - trap = luaG_tracecall(L); - base = ci->func.p + 1; - /* main loop of interpreter */ - for (;;) { - Instruction i; /* instruction being executed */ - vmfetch(); - #if 0 - /* low-level line tracing for debugging Lua */ - printf("line: %d\n", luaG_getfuncline(cl->p, pcRel(pc, cl->p))); - #endif - lua_assert(base == ci->func.p + 1); - lua_assert(base <= L->top.p && L->top.p <= L->stack_last.p); - /* invalidate top for instructions not expecting it */ - lua_assert(isIT(i) || (cast_void(L->top.p = base), 1)); - vmdispatch (GET_OPCODE(i)) { - vmcase(OP_MOVE) { - StkId ra = RA(i); - setobjs2s(L, ra, RB(i)); - vmbreak; - } - vmcase(OP_LOADI) { - StkId ra = RA(i); - lua_Integer b = GETARG_sBx(i); - setivalue(s2v(ra), b); - vmbreak; - } - vmcase(OP_LOADF) { - StkId ra = RA(i); - int b = GETARG_sBx(i); - setfltvalue(s2v(ra), cast_num(b)); - vmbreak; - } - vmcase(OP_LOADK) { - StkId ra = RA(i); - TValue *rb = k + GETARG_Bx(i); - setobj2s(L, ra, rb); - vmbreak; - } - vmcase(OP_LOADKX) { - StkId ra = RA(i); - TValue *rb; - rb = k + GETARG_Ax(*pc); pc++; - setobj2s(L, ra, rb); - vmbreak; - } - vmcase(OP_LOADFALSE) { - StkId ra = RA(i); - setbfvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LFALSESKIP) { - StkId ra = RA(i); - setbfvalue(s2v(ra)); - pc++; /* skip next instruction */ - vmbreak; - } - vmcase(OP_LOADTRUE) { - StkId ra = RA(i); - setbtvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LOADNIL) { - StkId ra = RA(i); - int b = GETARG_B(i); - do { - setnilvalue(s2v(ra++)); - } while (b--); - vmbreak; - } - vmcase(OP_GETUPVAL) { - StkId ra = RA(i); - int b = GETARG_B(i); - setobj2s(L, ra, cl->upvals[b]->v.p); - vmbreak; - } - vmcase(OP_SETUPVAL) { - StkId ra = RA(i); - UpVal *uv = cl->upvals[GETARG_B(i)]; - setobj(L, uv->v.p, s2v(ra)); - luaC_barrier(L, uv, s2v(ra)); - vmbreak; - } - vmcase(OP_GETTABUP) { - StkId ra = RA(i); - TValue *upval = cl->upvals[GETARG_B(i)]->v.p; - TValue *rc = KC(i); - TString *key = tsvalue(rc); /* key must be a short string */ - int tag; - luaV_fastget(upval, key, s2v(ra), luaH_getshortstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, upval, rc, ra, tag)); - vmbreak; - } - vmcase(OP_GETTABLE) { - StkId ra = RA(i); - TValue *rb = vRB(i); - TValue *rc = vRC(i); - int tag; - if (ttisinteger(rc)) { /* fast track for integers? */ - luaV_fastgeti(rb, ivalue(rc), s2v(ra), tag); - } - else - luaV_fastget(rb, rc, s2v(ra), luaH_get, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_GETI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int c = GETARG_C(i); - int tag; - luaV_fastgeti(rb, c, s2v(ra), tag); - if (tagisempty(tag)) { - TValue key; - setivalue(&key, c); - Protect(luaV_finishget(L, rb, &key, ra, tag)); - } - vmbreak; - } - vmcase(OP_GETFIELD) { - StkId ra = RA(i); - TValue *rb = vRB(i); - TValue *rc = KC(i); - TString *key = tsvalue(rc); /* key must be a short string */ - int tag; - luaV_fastget(rb, key, s2v(ra), luaH_getshortstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_SETTABUP) { - int hres; - TValue *upval = cl->upvals[GETARG_A(i)]->v.p; - TValue *rb = KB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rb); /* key must be a short string */ - luaV_fastset(upval, key, rc, hres, luaH_psetshortstr); - if (hres == HOK) - luaV_finishfastset(L, upval, rc); - else - Protect(luaV_finishset(L, upval, rb, rc, hres)); - vmbreak; - } - vmcase(OP_SETTABLE) { - StkId ra = RA(i); - int hres; - TValue *rb = vRB(i); /* key (table is in 'ra') */ - TValue *rc = RKC(i); /* value */ - if (ttisinteger(rb)) { /* fast track for integers? */ - luaV_fastseti(s2v(ra), ivalue(rb), rc, hres); - } - else { - luaV_fastset(s2v(ra), rb, rc, hres, luaH_pset); - } - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else - Protect(luaV_finishset(L, s2v(ra), rb, rc, hres)); - vmbreak; - } - vmcase(OP_SETI) { - StkId ra = RA(i); - int hres; - int b = GETARG_B(i); - TValue *rc = RKC(i); - luaV_fastseti(s2v(ra), b, rc, hres); - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else { - TValue key; - setivalue(&key, b); - Protect(luaV_finishset(L, s2v(ra), &key, rc, hres)); - } - vmbreak; - } - vmcase(OP_SETFIELD) { - StkId ra = RA(i); - int hres; - TValue *rb = KB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rb); /* key must be a short string */ - luaV_fastset(s2v(ra), key, rc, hres, luaH_psetshortstr); - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else - Protect(luaV_finishset(L, s2v(ra), rb, rc, hres)); - vmbreak; - } - vmcase(OP_NEWTABLE) { - StkId ra = RA(i); - int b = GETARG_B(i); /* log2(hash size) + 1 */ - int c = GETARG_C(i); /* array size */ - Table *t; - if (b > 0) - b = 1 << (b - 1); /* size is 2^(b - 1) */ - lua_assert((!TESTARG_k(i)) == (GETARG_Ax(*pc) == 0)); - if (TESTARG_k(i)) /* non-zero extra argument? */ - c += GETARG_Ax(*pc) * (MAXARG_C + 1); /* add it to size */ - pc++; /* skip extra argument */ - L->top.p = ra + 1; /* correct top in case of emergency GC */ - t = luaH_new(L); /* memory allocation */ - sethvalue2s(L, ra, t); - if (b != 0 || c != 0) - luaH_resize(L, t, c, b); /* idem */ - checkGC(L, ra + 1); - vmbreak; - } - vmcase(OP_SELF) { - StkId ra = RA(i); - int tag; - TValue *rb = vRB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rc); /* key must be a string */ - setobj2s(L, ra + 1, rb); - luaV_fastget(rb, key, s2v(ra), luaH_getstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_ADDI) { - op_arithI(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_ADDK) { - op_arithK(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_SUBK) { - op_arithK(L, l_subi, luai_numsub); - vmbreak; - } - vmcase(OP_MULK) { - op_arithK(L, l_muli, luai_nummul); - vmbreak; - } - vmcase(OP_MODK) { - savestate(L, ci); /* in case of division by 0 */ - op_arithK(L, luaV_mod, luaV_modf); - vmbreak; - } - vmcase(OP_POWK) { - op_arithfK(L, luai_numpow); - vmbreak; - } - vmcase(OP_DIVK) { - op_arithfK(L, luai_numdiv); - vmbreak; - } - vmcase(OP_IDIVK) { - savestate(L, ci); /* in case of division by 0 */ - op_arithK(L, luaV_idiv, luai_numidiv); - vmbreak; - } - vmcase(OP_BANDK) { - op_bitwiseK(L, l_band); - vmbreak; - } - vmcase(OP_BORK) { - op_bitwiseK(L, l_bor); - vmbreak; - } - vmcase(OP_BXORK) { - op_bitwiseK(L, l_bxor); - vmbreak; - } - vmcase(OP_SHRI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int ic = GETARG_sC(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - pc++; setivalue(s2v(ra), luaV_shiftl(ib, -ic)); - } - vmbreak; - } - vmcase(OP_SHLI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int ic = GETARG_sC(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - pc++; setivalue(s2v(ra), luaV_shiftl(ic, ib)); - } - vmbreak; - } - vmcase(OP_ADD) { - op_arith(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_SUB) { - op_arith(L, l_subi, luai_numsub); - vmbreak; - } - vmcase(OP_MUL) { - op_arith(L, l_muli, luai_nummul); - vmbreak; - } - vmcase(OP_MOD) { - savestate(L, ci); /* in case of division by 0 */ - op_arith(L, luaV_mod, luaV_modf); - vmbreak; - } - vmcase(OP_POW) { - op_arithf(L, luai_numpow); - vmbreak; - } - vmcase(OP_DIV) { /* float division (always with floats) */ - op_arithf(L, luai_numdiv); - vmbreak; - } - vmcase(OP_IDIV) { /* floor division */ - savestate(L, ci); /* in case of division by 0 */ - op_arith(L, luaV_idiv, luai_numidiv); - vmbreak; - } - vmcase(OP_BAND) { - op_bitwise(L, l_band); - vmbreak; - } - vmcase(OP_BOR) { - op_bitwise(L, l_bor); - vmbreak; - } - vmcase(OP_BXOR) { - op_bitwise(L, l_bxor); - vmbreak; - } - vmcase(OP_SHR) { - op_bitwise(L, luaV_shiftr); - vmbreak; - } - vmcase(OP_SHL) { - op_bitwise(L, luaV_shiftl); - vmbreak; - } - vmcase(OP_MMBIN) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); /* original arith. expression */ - TValue *rb = vRB(i); - TMS tm = (TMS)GETARG_C(i); - StkId result = RA(pi); - lua_assert(OP_ADD <= GET_OPCODE(pi) && GET_OPCODE(pi) <= OP_SHR); - Protect(luaT_trybinTM(L, s2v(ra), rb, result, tm)); - vmbreak; - } - vmcase(OP_MMBINI) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); /* original arith. expression */ - int imm = GETARG_sB(i); - TMS tm = (TMS)GETARG_C(i); - int flip = GETARG_k(i); - StkId result = RA(pi); - Protect(luaT_trybiniTM(L, s2v(ra), imm, flip, result, tm)); - vmbreak; - } - vmcase(OP_MMBINK) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); /* original arith. expression */ - TValue *imm = KB(i); - TMS tm = (TMS)GETARG_C(i); - int flip = GETARG_k(i); - StkId result = RA(pi); - Protect(luaT_trybinassocTM(L, s2v(ra), imm, flip, result, tm)); - vmbreak; - } - vmcase(OP_UNM) { - StkId ra = RA(i); - TValue *rb = vRB(i); - lua_Number nb; - if (ttisinteger(rb)) { - lua_Integer ib = ivalue(rb); - setivalue(s2v(ra), intop(-, 0, ib)); - } - else if (tonumberns(rb, nb)) { - setfltvalue(s2v(ra), luai_numunm(L, nb)); - } - else - Protect(luaT_trybinTM(L, rb, rb, ra, TM_UNM)); - vmbreak; - } - vmcase(OP_BNOT) { - StkId ra = RA(i); - TValue *rb = vRB(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - setivalue(s2v(ra), intop(^, ~l_castS2U(0), ib)); - } - else - Protect(luaT_trybinTM(L, rb, rb, ra, TM_BNOT)); - vmbreak; - } - vmcase(OP_NOT) { - StkId ra = RA(i); - TValue *rb = vRB(i); - if (l_isfalse(rb)) - setbtvalue(s2v(ra)); - else - setbfvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LEN) { - StkId ra = RA(i); - Protect(luaV_objlen(L, ra, vRB(i))); - vmbreak; - } - vmcase(OP_CONCAT) { - StkId ra = RA(i); - int n = GETARG_B(i); /* number of elements to concatenate */ - L->top.p = ra + n; /* mark the end of concat operands */ - ProtectNT(luaV_concat(L, n)); - checkGC(L, L->top.p); /* 'luaV_concat' ensures correct top */ - vmbreak; - } - vmcase(OP_CLOSE) { - StkId ra = RA(i); - Protect(luaF_close(L, ra, LUA_OK, 1)); - vmbreak; - } - vmcase(OP_TBC) { - StkId ra = RA(i); - /* create new to-be-closed upvalue */ - halfProtect(luaF_newtbcupval(L, ra)); - vmbreak; - } - vmcase(OP_JMP) { - dojump(ci, i, 0); - vmbreak; - } - vmcase(OP_EQ) { - StkId ra = RA(i); - int cond; - TValue *rb = vRB(i); - Protect(cond = luaV_equalobj(L, s2v(ra), rb)); - docondjump(); - vmbreak; - } - vmcase(OP_LT) { - op_order(L, l_lti, LTnum, lessthanothers); - vmbreak; - } - vmcase(OP_LE) { - op_order(L, l_lei, LEnum, lessequalothers); - vmbreak; - } - vmcase(OP_EQK) { - StkId ra = RA(i); - TValue *rb = KB(i); - /* basic types do not use '__eq'; we can use raw equality */ - int cond = luaV_rawequalobj(s2v(ra), rb); - docondjump(); - vmbreak; - } - vmcase(OP_EQI) { - StkId ra = RA(i); - int cond; - int im = GETARG_sB(i); - if (ttisinteger(s2v(ra))) - cond = (ivalue(s2v(ra)) == im); - else if (ttisfloat(s2v(ra))) - cond = luai_numeq(fltvalue(s2v(ra)), cast_num(im)); - else - cond = 0; /* other types cannot be equal to a number */ - docondjump(); - vmbreak; - } - vmcase(OP_LTI) { - op_orderI(L, l_lti, luai_numlt, 0, TM_LT); - vmbreak; - } - vmcase(OP_LEI) { - op_orderI(L, l_lei, luai_numle, 0, TM_LE); - vmbreak; - } - vmcase(OP_GTI) { - op_orderI(L, l_gti, luai_numgt, 1, TM_LT); - vmbreak; - } - vmcase(OP_GEI) { - op_orderI(L, l_gei, luai_numge, 1, TM_LE); - vmbreak; - } - vmcase(OP_TEST) { - StkId ra = RA(i); - int cond = !l_isfalse(s2v(ra)); - docondjump(); - vmbreak; - } - vmcase(OP_TESTSET) { - StkId ra = RA(i); - TValue *rb = vRB(i); - if (l_isfalse(rb) == GETARG_k(i)) - pc++; - else { - setobj2s(L, ra, rb); - donextjump(ci); - } - vmbreak; - } - vmcase(OP_CALL) { - StkId ra = RA(i); - CallInfo *newci; - int b = GETARG_B(i); - int nresults = GETARG_C(i) - 1; - if (b != 0) /* fixed number of arguments? */ - L->top.p = ra + b; /* top signals number of arguments */ - /* else previous instruction set top */ - savepc(L); /* in case of errors */ - if ((newci = luaD_precall(L, ra, nresults)) == NULL) - updatetrap(ci); /* C call; nothing else to be done */ - else { /* Lua call: run function in this same C frame */ - ci = newci; - goto startfunc; - } - vmbreak; - } - vmcase(OP_TAILCALL) { - StkId ra = RA(i); - int b = GETARG_B(i); /* number of arguments + 1 (function) */ - int n; /* number of results when calling a C function */ - int nparams1 = GETARG_C(i); - /* delta is virtual 'func' - real 'func' (vararg functions) */ - int delta = (nparams1) ? ci->u.l.nextraargs + nparams1 : 0; - if (b != 0) - L->top.p = ra + b; - else /* previous instruction set top */ - b = cast_int(L->top.p - ra); - savepc(ci); /* several calls here can raise errors */ - if (TESTARG_k(i)) { - luaF_closeupval(L, base); /* close upvalues from current call */ - lua_assert(L->tbclist.p < base); /* no pending tbc variables */ - lua_assert(base == ci->func.p + 1); - } - if ((n = luaD_pretailcall(L, ci, ra, b, delta)) < 0) /* Lua function? */ - goto startfunc; /* execute the callee */ - else { /* C function? */ - ci->func.p -= delta; /* restore 'func' (if vararg) */ - luaD_poscall(L, ci, n); /* finish caller */ - updatetrap(ci); /* 'luaD_poscall' can change hooks */ - goto ret; /* caller returns after the tail call */ - } - } - vmcase(OP_RETURN) { - StkId ra = RA(i); - int n = GETARG_B(i) - 1; /* number of results */ - int nparams1 = GETARG_C(i); - if (n < 0) /* not fixed? */ - n = cast_int(L->top.p - ra); /* get what is available */ - savepc(ci); - if (TESTARG_k(i)) { /* may there be open upvalues? */ - ci->u2.nres = n; /* save number of returns */ - if (L->top.p < ci->top.p) - L->top.p = ci->top.p; - luaF_close(L, base, CLOSEKTOP, 1); - updatetrap(ci); - updatestack(ci); - } - if (nparams1) /* vararg function? */ - ci->func.p -= ci->u.l.nextraargs + nparams1; - L->top.p = ra + n; /* set call for 'luaD_poscall' */ - luaD_poscall(L, ci, n); - updatetrap(ci); /* 'luaD_poscall' can change hooks */ - goto ret; - } - vmcase(OP_RETURN0) { - if (l_unlikely(L->hookmask)) { - StkId ra = RA(i); - L->top.p = ra; - savepc(ci); - luaD_poscall(L, ci, 0); /* no hurry... */ - trap = 1; - } - else { /* do the 'poscall' here */ - int nres; - L->ci = ci->previous; /* back to caller */ - L->top.p = base - 1; - for (nres = ci->nresults; l_unlikely(nres > 0); nres--) - setnilvalue(s2v(L->top.p++)); /* all results are nil */ - } - goto ret; - } - vmcase(OP_RETURN1) { - if (l_unlikely(L->hookmask)) { - StkId ra = RA(i); - L->top.p = ra + 1; - savepc(ci); - luaD_poscall(L, ci, 1); /* no hurry... */ - trap = 1; - } - else { /* do the 'poscall' here */ - int nres = ci->nresults; - L->ci = ci->previous; /* back to caller */ - if (nres == 0) - L->top.p = base - 1; /* asked for no results */ - else { - StkId ra = RA(i); - setobjs2s(L, base - 1, ra); /* at least this result */ - L->top.p = base; - for (; l_unlikely(nres > 1); nres--) - setnilvalue(s2v(L->top.p++)); /* complete missing results */ - } - } - ret: /* return from a Lua function */ - if (ci->callstatus & CIST_FRESH) - return; /* end this frame */ - else { - ci = ci->previous; - goto returning; /* continue running caller in this frame */ - } - } - vmcase(OP_FORLOOP) { - StkId ra = RA(i); - if (ttisinteger(s2v(ra + 1))) { /* integer loop? */ - lua_Unsigned count = l_castS2U(ivalue(s2v(ra))); - if (count > 0) { /* still more iterations? */ - lua_Integer step = ivalue(s2v(ra + 1)); - lua_Integer idx = ivalue(s2v(ra + 2)); /* control variable */ - chgivalue(s2v(ra), count - 1); /* update counter */ - idx = intop(+, idx, step); /* add step to index */ - chgivalue(s2v(ra + 2), idx); /* update control variable */ - pc -= GETARG_Bx(i); /* jump back */ - } - } - else if (floatforloop(ra)) /* float loop */ - pc -= GETARG_Bx(i); /* jump back */ - updatetrap(ci); /* allows a signal to break the loop */ - vmbreak; - } - vmcase(OP_FORPREP) { - StkId ra = RA(i); - savestate(L, ci); /* in case of errors */ - if (forprep(L, ra)) - pc += GETARG_Bx(i) + 1; /* skip the loop */ - vmbreak; - } - vmcase(OP_TFORPREP) { - /* before: 'ra' has the iterator function, 'ra + 1' has the state, - 'ra + 2' has the initial value for the control variable, and - 'ra + 3' has the closing variable. This opcode then swaps the - control and the closing variables and marks the closing variable - as to-be-closed. - */ - StkId ra = RA(i); - TValue temp; /* to swap control and closing variables */ - setobj(L, &temp, s2v(ra + 3)); - setobjs2s(L, ra + 3, ra + 2); - setobj2s(L, ra + 2, &temp); - /* create to-be-closed upvalue (if closing var. is not nil) */ - halfProtect(luaF_newtbcupval(L, ra + 2)); - pc += GETARG_Bx(i); /* go to end of the loop */ - i = *(pc++); /* fetch next instruction */ - lua_assert(GET_OPCODE(i) == OP_TFORCALL && ra == RA(i)); - goto l_tforcall; - } - vmcase(OP_TFORCALL) { - l_tforcall: { - /* 'ra' has the iterator function, 'ra + 1' has the state, - 'ra + 2' has the closing variable, and 'ra + 3' has the control - variable. The call will use the stack starting at 'ra + 3', - so that it preserves the first three values, and the first - return will be the new value for the control variable. - */ - StkId ra = RA(i); - setobjs2s(L, ra + 5, ra + 3); /* copy the control variable */ - setobjs2s(L, ra + 4, ra + 1); /* copy state */ - setobjs2s(L, ra + 3, ra); /* copy function */ - L->top.p = ra + 3 + 3; - ProtectNT(luaD_call(L, ra + 3, GETARG_C(i))); /* do the call */ - updatestack(ci); /* stack may have changed */ - i = *(pc++); /* go to next instruction */ - lua_assert(GET_OPCODE(i) == OP_TFORLOOP && ra == RA(i)); - goto l_tforloop; - }} - vmcase(OP_TFORLOOP) { - l_tforloop: { - StkId ra = RA(i); - if (!ttisnil(s2v(ra + 3))) /* continue loop? */ - pc -= GETARG_Bx(i); /* jump back */ - vmbreak; - }} - vmcase(OP_SETLIST) { - StkId ra = RA(i); - int n = GETARG_B(i); - unsigned int last = GETARG_C(i); - Table *h = hvalue(s2v(ra)); - if (n == 0) - n = cast_int(L->top.p - ra) - 1; /* get up to the top */ - else - L->top.p = ci->top.p; /* correct top in case of emergency GC */ - last += n; - if (TESTARG_k(i)) { - last += GETARG_Ax(*pc) * (MAXARG_C + 1); - pc++; - } - if (last > luaH_realasize(h)) /* needs more space? */ - luaH_resizearray(L, h, last); /* preallocate it at once */ - for (; n > 0; n--) { - TValue *val = s2v(ra + n); - obj2arr(h, last, val); - last--; - luaC_barrierback(L, obj2gco(h), val); - } - vmbreak; - } - vmcase(OP_CLOSURE) { - StkId ra = RA(i); - Proto *p = cl->p->p[GETARG_Bx(i)]; - halfProtect(pushclosure(L, p, cl->upvals, base, ra)); - checkGC(L, ra + 1); - vmbreak; - } - vmcase(OP_VARARG) { - StkId ra = RA(i); - int n = GETARG_C(i) - 1; /* required results */ - Protect(luaT_getvarargs(L, ci, ra, n)); - vmbreak; - } - vmcase(OP_VARARGPREP) { - ProtectNT(luaT_adjustvarargs(L, GETARG_A(i), ci, cl->p)); - if (l_unlikely(trap)) { /* previous "Protect" updated trap */ - luaD_hookcall(L, ci); - L->oldpc = 1; /* next opcode will be seen as a "new" line */ - } - updatebase(ci); /* function has new base after adjustment */ - vmbreak; - } - vmcase(OP_EXTRAARG) { - lua_assert(0); - vmbreak; - } - } - } -} - -/* }================================================================== */ - - -/* -** $Id: lapi.c $ -** Lua API -** See Copyright Notice in lua.h -*/ - -#define lapi_c -#define LUA_CORE - - - -#include -#include -#include - - - - - -const char lua_ident[] = - "$LuaVersion: " LUA_COPYRIGHT " $" - "$LuaAuthors: " LUA_AUTHORS " $"; - - - -/* -** Test for a valid index (one that is not the 'nilvalue'). -** '!ttisnil(o)' implies 'o != &G(L)->nilvalue', so it is not needed. -** However, it covers the most common cases in a faster way. -*/ -#define isvalid(L, o) (!ttisnil(o) || o != &G(L)->nilvalue) - - -/* test for pseudo index */ -#define ispseudo(i) ((i) <= LUA_REGISTRYINDEX) - -/* test for upvalue */ -#define isupvalue(i) ((i) < LUA_REGISTRYINDEX) - - -/* Advance the garbage collector when creating large objects */ -static void advancegc (lua_State *L, size_t delta) { - delta >>= 5; /* one object for each 32 bytes (empirical) */ - if (delta > 0) { - global_State *g = G(L); - luaE_setdebt(g, g->GCdebt - delta); - } -} - - -/* -** Convert an acceptable index to a pointer to its respective value. -** Non-valid indices return the special nil value 'G(L)->nilvalue'. -*/ -static TValue *index2value (lua_State *L, int idx) { - CallInfo *ci = L->ci; - if (idx > 0) { - StkId o = ci->func.p + idx; - api_check(L, idx <= ci->top.p - (ci->func.p + 1), "unacceptable index"); - if (o >= L->top.p) return &G(L)->nilvalue; - else return s2v(o); - } - else if (!ispseudo(idx)) { /* negative index */ - api_check(L, idx != 0 && -idx <= L->top.p - (ci->func.p + 1), - "invalid index"); - return s2v(L->top.p + idx); - } - else if (idx == LUA_REGISTRYINDEX) - return &G(L)->l_registry; - else { /* upvalues */ - idx = LUA_REGISTRYINDEX - idx; - api_check(L, idx <= MAXUPVAL + 1, "upvalue index too large"); - if (ttisCclosure(s2v(ci->func.p))) { /* C closure? */ - CClosure *func = clCvalue(s2v(ci->func.p)); - return (idx <= func->nupvalues) ? &func->upvalue[idx-1] - : &G(L)->nilvalue; - } - else { /* light C function or Lua function (through a hook)?) */ - api_check(L, ttislcf(s2v(ci->func.p)), "caller not a C function"); - return &G(L)->nilvalue; /* no upvalues */ - } - } -} - - - -/* -** Convert a valid actual index (not a pseudo-index) to its address. -*/ -static StkId index2stack (lua_State *L, int idx) { - CallInfo *ci = L->ci; - if (idx > 0) { - StkId o = ci->func.p + idx; - api_check(L, o < L->top.p, "invalid index"); - return o; - } - else { /* non-positive index */ - api_check(L, idx != 0 && -idx <= L->top.p - (ci->func.p + 1), - "invalid index"); - api_check(L, !ispseudo(idx), "invalid index"); - return L->top.p + idx; - } -} - - -LUA_API int lua_checkstack (lua_State *L, int n) { - int res; - CallInfo *ci; - lua_lock(L); - ci = L->ci; - api_check(L, n >= 0, "negative 'n'"); - if (L->stack_last.p - L->top.p > n) /* stack large enough? */ - res = 1; /* yes; check is OK */ - else /* need to grow stack */ - res = luaD_growstack(L, n, 0); - if (res && ci->top.p < L->top.p + n) - ci->top.p = L->top.p + n; /* adjust frame top */ - lua_unlock(L); - return res; -} - - -LUA_API void lua_xmove (lua_State *from, lua_State *to, int n) { - int i; - if (from == to) return; - lua_lock(to); - api_checkpop(from, n); - api_check(from, G(from) == G(to), "moving among independent states"); - api_check(from, to->ci->top.p - to->top.p >= n, "stack overflow"); - from->top.p -= n; - for (i = 0; i < n; i++) { - setobjs2s(to, to->top.p, from->top.p + i); - to->top.p++; /* stack already checked by previous 'api_check' */ - } - lua_unlock(to); -} - - -LUA_API lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf) { - lua_CFunction old; - lua_lock(L); - old = G(L)->panic; - G(L)->panic = panicf; - lua_unlock(L); - return old; -} - - -LUA_API lua_Number lua_version (lua_State *L) { - UNUSED(L); - return LUA_VERSION_NUM; -} - - - -/* -** basic stack manipulation -*/ - - -/* -** convert an acceptable stack index into an absolute index -*/ -LUA_API int lua_absindex (lua_State *L, int idx) { - return (idx > 0 || ispseudo(idx)) - ? idx - : cast_int(L->top.p - L->ci->func.p) + idx; -} - - -LUA_API int lua_gettop (lua_State *L) { - return cast_int(L->top.p - (L->ci->func.p + 1)); -} - - -LUA_API void lua_settop (lua_State *L, int idx) { - CallInfo *ci; - StkId func, newtop; - ptrdiff_t diff; /* difference for new top */ - lua_lock(L); - ci = L->ci; - func = ci->func.p; - if (idx >= 0) { - api_check(L, idx <= ci->top.p - (func + 1), "new top too large"); - diff = ((func + 1) + idx) - L->top.p; - for (; diff > 0; diff--) - setnilvalue(s2v(L->top.p++)); /* clear new slots */ - } - else { - api_check(L, -(idx+1) <= (L->top.p - (func + 1)), "invalid new top"); - diff = idx + 1; /* will "subtract" index (as it is negative) */ - } - newtop = L->top.p + diff; - if (diff < 0 && L->tbclist.p >= newtop) { - lua_assert(hastocloseCfunc(ci->nresults)); - newtop = luaF_close(L, newtop, CLOSEKTOP, 0); - } - L->top.p = newtop; /* correct top only after closing any upvalue */ - lua_unlock(L); -} - - -LUA_API void lua_closeslot (lua_State *L, int idx) { - StkId level; - lua_lock(L); - level = index2stack(L, idx); - api_check(L, hastocloseCfunc(L->ci->nresults) && L->tbclist.p == level, - "no variable to close at given level"); - level = luaF_close(L, level, CLOSEKTOP, 0); - setnilvalue(s2v(level)); - lua_unlock(L); -} - - -/* -** Reverse the stack segment from 'from' to 'to' -** (auxiliary to 'lua_rotate') -** Note that we move(copy) only the value inside the stack. -** (We do not move additional fields that may exist.) -*/ -static void reverse (lua_State *L, StkId from, StkId to) { - for (; from < to; from++, to--) { - TValue temp; - setobj(L, &temp, s2v(from)); - setobjs2s(L, from, to); - setobj2s(L, to, &temp); - } -} - - -/* -** Let x = AB, where A is a prefix of length 'n'. Then, -** rotate x n == BA. But BA == (A^r . B^r)^r. -*/ -LUA_API void lua_rotate (lua_State *L, int idx, int n) { - StkId p, t, m; - lua_lock(L); - t = L->top.p - 1; /* end of stack segment being rotated */ - p = index2stack(L, idx); /* start of segment */ - api_check(L, L->tbclist.p < p, "moving a to-be-closed slot"); - api_check(L, (n >= 0 ? n : -n) <= (t - p + 1), "invalid 'n'"); - m = (n >= 0 ? t - n : p - n - 1); /* end of prefix */ - reverse(L, p, m); /* reverse the prefix with length 'n' */ - reverse(L, m + 1, t); /* reverse the suffix */ - reverse(L, p, t); /* reverse the entire segment */ - lua_unlock(L); -} - - -LUA_API void lua_copy (lua_State *L, int fromidx, int toidx) { - TValue *fr, *to; - lua_lock(L); - fr = index2value(L, fromidx); - to = index2value(L, toidx); - api_check(L, isvalid(L, to), "invalid index"); - setobj(L, to, fr); - if (isupvalue(toidx)) /* function upvalue? */ - luaC_barrier(L, clCvalue(s2v(L->ci->func.p)), fr); - /* LUA_REGISTRYINDEX does not need gc barrier - (collector revisits it before finishing collection) */ - lua_unlock(L); -} - - -LUA_API void lua_pushvalue (lua_State *L, int idx) { - lua_lock(L); - setobj2s(L, L->top.p, index2value(L, idx)); - api_incr_top(L); - lua_unlock(L); -} - - - -/* -** access functions (stack -> C) -*/ - - -LUA_API int lua_type (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (isvalid(L, o) ? ttype(o) : LUA_TNONE); -} - - -LUA_API const char *lua_typename (lua_State *L, int t) { - UNUSED(L); - api_check(L, LUA_TNONE <= t && t < LUA_NUMTYPES, "invalid type"); - return ttypename(t); -} - - -LUA_API int lua_iscfunction (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttislcf(o) || (ttisCclosure(o))); -} - - -LUA_API int lua_isinteger (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return ttisinteger(o); -} - - -LUA_API int lua_isnumber (lua_State *L, int idx) { - lua_Number n; - const TValue *o = index2value(L, idx); - return tonumber(o, &n); -} - - -LUA_API int lua_isstring (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttisstring(o) || cvt2str(o)); -} - - -LUA_API int lua_isuserdata (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttisfulluserdata(o) || ttislightuserdata(o)); -} - - -LUA_API int lua_rawequal (lua_State *L, int index1, int index2) { - const TValue *o1 = index2value(L, index1); - const TValue *o2 = index2value(L, index2); - return (isvalid(L, o1) && isvalid(L, o2)) ? luaV_rawequalobj(o1, o2) : 0; -} - - -LUA_API void lua_arith (lua_State *L, int op) { - lua_lock(L); - if (op != LUA_OPUNM && op != LUA_OPBNOT) - api_checkpop(L, 2); /* all other operations expect two operands */ - else { /* for unary operations, add fake 2nd operand */ - api_checkpop(L, 1); - setobjs2s(L, L->top.p, L->top.p - 1); - api_incr_top(L); - } - /* first operand at top - 2, second at top - 1; result go to top - 2 */ - luaO_arith(L, op, s2v(L->top.p - 2), s2v(L->top.p - 1), L->top.p - 2); - L->top.p--; /* pop second operand */ - lua_unlock(L); -} - - -LUA_API int lua_compare (lua_State *L, int index1, int index2, int op) { - const TValue *o1; - const TValue *o2; - int i = 0; - lua_lock(L); /* may call tag method */ - o1 = index2value(L, index1); - o2 = index2value(L, index2); - if (isvalid(L, o1) && isvalid(L, o2)) { - switch (op) { - case LUA_OPEQ: i = luaV_equalobj(L, o1, o2); break; - case LUA_OPLT: i = luaV_lessthan(L, o1, o2); break; - case LUA_OPLE: i = luaV_lessequal(L, o1, o2); break; - default: api_check(L, 0, "invalid option"); - } - } - lua_unlock(L); - return i; -} - - -LUA_API size_t lua_stringtonumber (lua_State *L, const char *s) { - size_t sz = luaO_str2num(s, s2v(L->top.p)); - if (sz != 0) - api_incr_top(L); - return sz; -} - - -LUA_API lua_Number lua_tonumberx (lua_State *L, int idx, int *pisnum) { - lua_Number n = 0; - const TValue *o = index2value(L, idx); - int isnum = tonumber(o, &n); - if (pisnum) - *pisnum = isnum; - return n; -} - - -LUA_API lua_Integer lua_tointegerx (lua_State *L, int idx, int *pisnum) { - lua_Integer res = 0; - const TValue *o = index2value(L, idx); - int isnum = tointeger(o, &res); - if (pisnum) - *pisnum = isnum; - return res; -} - - -LUA_API int lua_toboolean (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return !l_isfalse(o); -} - - -LUA_API const char *lua_tolstring (lua_State *L, int idx, size_t *len) { - TValue *o; - lua_lock(L); - o = index2value(L, idx); - if (!ttisstring(o)) { - if (!cvt2str(o)) { /* not convertible? */ - if (len != NULL) *len = 0; - lua_unlock(L); - return NULL; - } - luaO_tostring(L, o); - luaC_checkGC(L); - o = index2value(L, idx); /* previous call may reallocate the stack */ - } - lua_unlock(L); - if (len != NULL) - return getlstr(tsvalue(o), *len); - else - return getstr(tsvalue(o)); -} - - -LUA_API lua_Unsigned lua_rawlen (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - switch (ttypetag(o)) { - case LUA_VSHRSTR: return tsvalue(o)->shrlen; - case LUA_VLNGSTR: return tsvalue(o)->u.lnglen; - case LUA_VUSERDATA: return uvalue(o)->len; - case LUA_VTABLE: return luaH_getn(hvalue(o)); - default: return 0; - } -} - - -LUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - if (ttislcf(o)) return fvalue(o); - else if (ttisCclosure(o)) - return clCvalue(o)->f; - else return NULL; /* not a C function */ -} - - -l_sinline void *touserdata (const TValue *o) { - switch (ttype(o)) { - case LUA_TUSERDATA: return getudatamem(uvalue(o)); - case LUA_TLIGHTUSERDATA: return pvalue(o); - default: return NULL; - } -} - - -LUA_API void *lua_touserdata (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return touserdata(o); -} - - -LUA_API lua_State *lua_tothread (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (!ttisthread(o)) ? NULL : thvalue(o); -} - - -/* -** Returns a pointer to the internal representation of an object. -** Note that ANSI C does not allow the conversion of a pointer to -** function to a 'void*', so the conversion here goes through -** a 'size_t'. (As the returned pointer is only informative, this -** conversion should not be a problem.) -*/ -LUA_API const void *lua_topointer (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - switch (ttypetag(o)) { - case LUA_VLCF: return cast_voidp(cast_sizet(fvalue(o))); - case LUA_VUSERDATA: case LUA_VLIGHTUSERDATA: - return touserdata(o); - default: { - if (iscollectable(o)) - return gcvalue(o); - else - return NULL; - } - } -} - - - -/* -** push functions (C -> stack) -*/ - - -LUA_API void lua_pushnil (lua_State *L) { - lua_lock(L); - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushnumber (lua_State *L, lua_Number n) { - lua_lock(L); - setfltvalue(s2v(L->top.p), n); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushinteger (lua_State *L, lua_Integer n) { - lua_lock(L); - setivalue(s2v(L->top.p), n); - api_incr_top(L); - lua_unlock(L); -} - - -/* -** Pushes on the stack a string with given length. Avoid using 's' when -** 'len' == 0 (as 's' can be NULL in that case), due to later use of -** 'memcmp' and 'memcpy'. -*/ -LUA_API const char *lua_pushlstring (lua_State *L, const char *s, size_t len) { - TString *ts; - lua_lock(L); - ts = (len == 0) ? luaS_new(L, "") : luaS_newlstr(L, s, len); - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - advancegc(L, len); - luaC_checkGC(L); - lua_unlock(L); - return getstr(ts); -} - - -LUA_API const char *lua_pushextlstring (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud) { - TString *ts; - lua_lock(L); - api_check(L, s[len] == '\0', "string not ending with zero"); - ts = luaS_newextlstr (L, s, len, falloc, ud); - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - if (falloc != NULL) /* non-static string? */ - advancegc(L, len); /* count its memory */ - luaC_checkGC(L); - lua_unlock(L); - return getstr(ts); -} - - -LUA_API const char *lua_pushstring (lua_State *L, const char *s) { - lua_lock(L); - if (s == NULL) - setnilvalue(s2v(L->top.p)); - else { - TString *ts; - ts = luaS_new(L, s); - setsvalue2s(L, L->top.p, ts); - s = getstr(ts); /* internal copy's address */ - } - api_incr_top(L); - luaC_checkGC(L); - lua_unlock(L); - return s; -} - - -LUA_API const char *lua_pushvfstring (lua_State *L, const char *fmt, - va_list argp) { - const char *ret; - lua_lock(L); - ret = luaO_pushvfstring(L, fmt, argp); - luaC_checkGC(L); - lua_unlock(L); - return ret; -} - - -LUA_API const char *lua_pushfstring (lua_State *L, const char *fmt, ...) { - const char *ret; - va_list argp; - lua_lock(L); - va_start(argp, fmt); - ret = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - luaC_checkGC(L); - lua_unlock(L); - return ret; -} - - -LUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) { - lua_lock(L); - if (n == 0) { - setfvalue(s2v(L->top.p), fn); - api_incr_top(L); - } - else { - int i; - CClosure *cl; - api_checkpop(L, n); - api_check(L, n <= MAXUPVAL, "upvalue index too large"); - cl = luaF_newCclosure(L, n); - cl->f = fn; - for (i = 0; i < n; i++) { - setobj2n(L, &cl->upvalue[i], s2v(L->top.p - n + i)); - /* does not need barrier because closure is white */ - lua_assert(iswhite(cl)); - } - L->top.p -= n; - setclCvalue(L, s2v(L->top.p), cl); - api_incr_top(L); - luaC_checkGC(L); - } - lua_unlock(L); -} - - -LUA_API void lua_pushboolean (lua_State *L, int b) { - lua_lock(L); - if (b) - setbtvalue(s2v(L->top.p)); - else - setbfvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushlightuserdata (lua_State *L, void *p) { - lua_lock(L); - setpvalue(s2v(L->top.p), p); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API int lua_pushthread (lua_State *L) { - lua_lock(L); - setthvalue(L, s2v(L->top.p), L); - api_incr_top(L); - lua_unlock(L); - return (G(L)->mainthread == L); -} - - - -/* -** get functions (Lua -> stack) -*/ - - -static int auxgetstr (lua_State *L, const TValue *t, const char *k) { - int tag; - TString *str = luaS_new(L, k); - luaV_fastget(t, str, s2v(L->top.p), luaH_getstr, tag); - if (!tagisempty(tag)) { - api_incr_top(L); - } - else { - setsvalue2s(L, L->top.p, str); - api_incr_top(L); - tag = luaV_finishget(L, t, s2v(L->top.p - 1), L->top.p - 1, tag); - } - lua_unlock(L); - return novariant(tag); -} - - -static void getGlobalTable (lua_State *L, TValue *gt) { - Table *registry = hvalue(&G(L)->l_registry); - int tag = luaH_getint(registry, LUA_RIDX_GLOBALS, gt); - (void)tag; /* avoid not-used warnings when checks are off */ - api_check(L, novariant(tag) == LUA_TTABLE, "global table must exist"); -} - - -LUA_API int lua_getglobal (lua_State *L, const char *name) { - TValue gt; - lua_lock(L); - getGlobalTable(L, >); - return auxgetstr(L, >, name); -} - - -LUA_API int lua_gettable (lua_State *L, int idx) { - int tag; - TValue *t; - lua_lock(L); - api_checkpop(L, 1); - t = index2value(L, idx); - luaV_fastget(t, s2v(L->top.p - 1), s2v(L->top.p - 1), luaH_get, tag); - if (tagisempty(tag)) - tag = luaV_finishget(L, t, s2v(L->top.p - 1), L->top.p - 1, tag); - lua_unlock(L); - return novariant(tag); -} - - -LUA_API int lua_getfield (lua_State *L, int idx, const char *k) { - lua_lock(L); - return auxgetstr(L, index2value(L, idx), k); -} - - -LUA_API int lua_geti (lua_State *L, int idx, lua_Integer n) { - TValue *t; - int tag; - lua_lock(L); - t = index2value(L, idx); - luaV_fastgeti(t, n, s2v(L->top.p), tag); - if (tagisempty(tag)) { - TValue key; - setivalue(&key, n); - tag = luaV_finishget(L, t, &key, L->top.p, tag); - } - api_incr_top(L); - lua_unlock(L); - return novariant(tag); -} - - -static int finishrawget (lua_State *L, int tag) { - if (tagisempty(tag)) /* avoid copying empty items to the stack */ - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); - return novariant(tag); -} - - -l_sinline Table *gettable (lua_State *L, int idx) { - TValue *t = index2value(L, idx); - api_check(L, ttistable(t), "table expected"); - return hvalue(t); -} - - -LUA_API int lua_rawget (lua_State *L, int idx) { - Table *t; - int tag; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - tag = luaH_get(t, s2v(L->top.p - 1), s2v(L->top.p - 1)); - L->top.p--; /* pop key */ - return finishrawget(L, tag); -} - - -LUA_API int lua_rawgeti (lua_State *L, int idx, lua_Integer n) { - Table *t; - int tag; - lua_lock(L); - t = gettable(L, idx); - luaH_fastgeti(t, n, s2v(L->top.p), tag); - return finishrawget(L, tag); -} - - -LUA_API int lua_rawgetp (lua_State *L, int idx, const void *p) { - Table *t; - TValue k; - lua_lock(L); - t = gettable(L, idx); - setpvalue(&k, cast_voidp(p)); - return finishrawget(L, luaH_get(t, &k, s2v(L->top.p))); -} - - -LUA_API void lua_createtable (lua_State *L, unsigned narray, unsigned nrec) { - Table *t; - lua_lock(L); - t = luaH_new(L); - sethvalue2s(L, L->top.p, t); - api_incr_top(L); - if (narray > 0 || nrec > 0) - luaH_resize(L, t, narray, nrec); - luaC_checkGC(L); - lua_unlock(L); -} - - -LUA_API int lua_getmetatable (lua_State *L, int objindex) { - const TValue *obj; - Table *mt; - int res = 0; - lua_lock(L); - obj = index2value(L, objindex); - switch (ttype(obj)) { - case LUA_TTABLE: - mt = hvalue(obj)->metatable; - break; - case LUA_TUSERDATA: - mt = uvalue(obj)->metatable; - break; - default: - mt = G(L)->mt[ttype(obj)]; - break; - } - if (mt != NULL) { - sethvalue2s(L, L->top.p, mt); - api_incr_top(L); - res = 1; - } - lua_unlock(L); - return res; -} - - -LUA_API int lua_getiuservalue (lua_State *L, int idx, int n) { - TValue *o; - int t; - lua_lock(L); - o = index2value(L, idx); - api_check(L, ttisfulluserdata(o), "full userdata expected"); - if (n <= 0 || n > uvalue(o)->nuvalue) { - setnilvalue(s2v(L->top.p)); - t = LUA_TNONE; - } - else { - setobj2s(L, L->top.p, &uvalue(o)->uv[n - 1].uv); - t = ttype(s2v(L->top.p)); - } - api_incr_top(L); - lua_unlock(L); - return t; -} - - -/* -** set functions (stack -> Lua) -*/ - -/* -** t[k] = value at the top of the stack (where 'k' is a string) -*/ -static void auxsetstr (lua_State *L, const TValue *t, const char *k) { - int hres; - TString *str = luaS_new(L, k); - api_checkpop(L, 1); - luaV_fastset(t, str, s2v(L->top.p - 1), hres, luaH_psetstr); - if (hres == HOK) { - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - L->top.p--; /* pop value */ - } - else { - setsvalue2s(L, L->top.p, str); /* push 'str' (to make it a TValue) */ - api_incr_top(L); - luaV_finishset(L, t, s2v(L->top.p - 1), s2v(L->top.p - 2), hres); - L->top.p -= 2; /* pop value and key */ - } - lua_unlock(L); /* lock done by caller */ -} - - -LUA_API void lua_setglobal (lua_State *L, const char *name) { - TValue gt; - lua_lock(L); /* unlock done in 'auxsetstr' */ - getGlobalTable(L, >); - auxsetstr(L, >, name); -} - - -LUA_API void lua_settable (lua_State *L, int idx) { - TValue *t; - int hres; - lua_lock(L); - api_checkpop(L, 2); - t = index2value(L, idx); - luaV_fastset(t, s2v(L->top.p - 2), s2v(L->top.p - 1), hres, luaH_pset); - if (hres == HOK) { - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - } - else - luaV_finishset(L, t, s2v(L->top.p - 2), s2v(L->top.p - 1), hres); - L->top.p -= 2; /* pop index and value */ - lua_unlock(L); -} - - -LUA_API void lua_setfield (lua_State *L, int idx, const char *k) { - lua_lock(L); /* unlock done in 'auxsetstr' */ - auxsetstr(L, index2value(L, idx), k); -} - - -LUA_API void lua_seti (lua_State *L, int idx, lua_Integer n) { - TValue *t; - int hres; - lua_lock(L); - api_checkpop(L, 1); - t = index2value(L, idx); - luaV_fastseti(t, n, s2v(L->top.p - 1), hres); - if (hres == HOK) - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - else { - TValue temp; - setivalue(&temp, n); - luaV_finishset(L, t, &temp, s2v(L->top.p - 1), hres); - } - L->top.p--; /* pop value */ - lua_unlock(L); -} - - -static void aux_rawset (lua_State *L, int idx, TValue *key, int n) { - Table *t; - lua_lock(L); - api_checkpop(L, n); - t = gettable(L, idx); - luaH_set(L, t, key, s2v(L->top.p - 1)); - invalidateTMcache(t); - luaC_barrierback(L, obj2gco(t), s2v(L->top.p - 1)); - L->top.p -= n; - lua_unlock(L); -} - - -LUA_API void lua_rawset (lua_State *L, int idx) { - aux_rawset(L, idx, s2v(L->top.p - 2), 2); -} - - -LUA_API void lua_rawsetp (lua_State *L, int idx, const void *p) { - TValue k; - setpvalue(&k, cast_voidp(p)); - aux_rawset(L, idx, &k, 1); -} - - -LUA_API void lua_rawseti (lua_State *L, int idx, lua_Integer n) { - Table *t; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - luaH_setint(L, t, n, s2v(L->top.p - 1)); - luaC_barrierback(L, obj2gco(t), s2v(L->top.p - 1)); - L->top.p--; - lua_unlock(L); -} - - -LUA_API int lua_setmetatable (lua_State *L, int objindex) { - TValue *obj; - Table *mt; - lua_lock(L); - api_checkpop(L, 1); - obj = index2value(L, objindex); - if (ttisnil(s2v(L->top.p - 1))) - mt = NULL; - else { - api_check(L, ttistable(s2v(L->top.p - 1)), "table expected"); - mt = hvalue(s2v(L->top.p - 1)); - } - switch (ttype(obj)) { - case LUA_TTABLE: { - hvalue(obj)->metatable = mt; - if (mt) { - luaC_objbarrier(L, gcvalue(obj), mt); - luaC_checkfinalizer(L, gcvalue(obj), mt); - } - break; - } - case LUA_TUSERDATA: { - uvalue(obj)->metatable = mt; - if (mt) { - luaC_objbarrier(L, uvalue(obj), mt); - luaC_checkfinalizer(L, gcvalue(obj), mt); - } - break; - } - default: { - G(L)->mt[ttype(obj)] = mt; - break; - } - } - L->top.p--; - lua_unlock(L); - return 1; -} - - -LUA_API int lua_setiuservalue (lua_State *L, int idx, int n) { - TValue *o; - int res; - lua_lock(L); - api_checkpop(L, 1); - o = index2value(L, idx); - api_check(L, ttisfulluserdata(o), "full userdata expected"); - if (!(cast_uint(n) - 1u < cast_uint(uvalue(o)->nuvalue))) - res = 0; /* 'n' not in [1, uvalue(o)->nuvalue] */ - else { - setobj(L, &uvalue(o)->uv[n - 1].uv, s2v(L->top.p - 1)); - luaC_barrierback(L, gcvalue(o), s2v(L->top.p - 1)); - res = 1; - } - L->top.p--; - lua_unlock(L); - return res; -} - - -/* -** 'load' and 'call' functions (run Lua code) -*/ - - -#define checkresults(L,na,nr) \ - api_check(L, (nr) == LUA_MULTRET \ - || (L->ci->top.p - L->top.p >= (nr) - (na)), \ - "results from function overflow current stack size") - - -LUA_API void lua_callk (lua_State *L, int nargs, int nresults, - lua_KContext ctx, lua_KFunction k) { - StkId func; - lua_lock(L); - api_check(L, k == NULL || !isLua(L->ci), - "cannot use continuations inside hooks"); - api_checkpop(L, nargs + 1); - api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); - checkresults(L, nargs, nresults); - func = L->top.p - (nargs+1); - if (k != NULL && yieldable(L)) { /* need to prepare continuation? */ - L->ci->u.c.k = k; /* save continuation */ - L->ci->u.c.ctx = ctx; /* save context */ - luaD_call(L, func, nresults); /* do the call */ - } - else /* no continuation or no yieldable */ - luaD_callnoyield(L, func, nresults); /* just do the call */ - adjustresults(L, nresults); - lua_unlock(L); -} - - - -/* -** Execute a protected call. -*/ -struct CallS { /* data to 'f_call' */ - StkId func; - int nresults; -}; - - -static void f_call (lua_State *L, void *ud) { - struct CallS *c = cast(struct CallS *, ud); - luaD_callnoyield(L, c->func, c->nresults); -} - - - -LUA_API int lua_pcallk (lua_State *L, int nargs, int nresults, int errfunc, - lua_KContext ctx, lua_KFunction k) { - struct CallS c; - int status; - ptrdiff_t func; - lua_lock(L); - api_check(L, k == NULL || !isLua(L->ci), - "cannot use continuations inside hooks"); - api_checkpop(L, nargs + 1); - api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); - checkresults(L, nargs, nresults); - if (errfunc == 0) - func = 0; - else { - StkId o = index2stack(L, errfunc); - api_check(L, ttisfunction(s2v(o)), "private_lua_error handler must be a function"); - func = savestack(L, o); - } - c.func = L->top.p - (nargs+1); /* function to be called */ - if (k == NULL || !yieldable(L)) { /* no continuation or no yieldable? */ - c.nresults = nresults; /* do a 'conventional' protected call */ - status = luaD_pcall(L, f_call, &c, savestack(L, c.func), func); - } - else { /* prepare continuation (call is already protected by 'resume') */ - CallInfo *ci = L->ci; - ci->u.c.k = k; /* save continuation */ - ci->u.c.ctx = ctx; /* save context */ - /* save information for error recovery */ - ci->u2.funcidx = cast_int(savestack(L, c.func)); - ci->u.c.old_errfunc = L->errfunc; - L->errfunc = func; - setoah(ci->callstatus, L->allowhook); /* save value of 'allowhook' */ - ci->callstatus |= CIST_YPCALL; /* function can do error recovery */ - luaD_call(L, c.func, nresults); /* do the call */ - ci->callstatus &= ~CIST_YPCALL; - L->errfunc = ci->u.c.old_errfunc; - status = LUA_OK; /* if it is here, there were no errors */ - } - adjustresults(L, nresults); - lua_unlock(L); - return status; -} - - -LUA_API int lua_load (lua_State *L, lua_Reader reader, void *data, - const char *chunkname, const char *mode) { - ZIO z; - int status; - lua_lock(L); - if (!chunkname) chunkname = "?"; - luaZ_init(L, &z, reader, data); - status = luaD_protectedparser(L, &z, chunkname, mode); - if (status == LUA_OK) { /* no errors? */ - LClosure *f = clLvalue(s2v(L->top.p - 1)); /* get new function */ - if (f->nupvalues >= 1) { /* does it have an upvalue? */ - /* get global table from registry */ - TValue gt; - getGlobalTable(L, >); - /* set global table as 1st upvalue of 'f' (may be LUA_ENV) */ - setobj(L, f->upvals[0]->v.p, >); - luaC_barrier(L, f->upvals[0], >); - } - } - lua_unlock(L); - return status; -} - - -/* -** Dump a Lua function, calling 'writer' to write its parts. Ensure -** the stack returns with its original size. -*/ -LUA_API int lua_dump (lua_State *L, lua_Writer writer, void *data, int strip) { - int status; - ptrdiff_t otop = savestack(L, L->top.p); /* original top */ - TValue *f = s2v(L->top.p - 1); /* function to be dumped */ - lua_lock(L); - api_checkpop(L, 1); - api_check(L, isLfunction(f), "Lua function expected"); - status = luaU_dump(L, clLvalue(f)->p, writer, data, strip); - L->top.p = restorestack(L, otop); /* restore top */ - lua_unlock(L); - return status; -} - - -LUA_API int lua_status (lua_State *L) { - return L->status; -} - - -/* -** Garbage-collection function -*/ -LUA_API int lua_gc (lua_State *L, int what, ...) { - va_list argp; - int res = 0; - global_State *g = G(L); - if (g->gcstp & (GCSTPGC | GCSTPCLS)) /* internal stop? */ - return -1; /* all options are invalid when stopped */ - lua_lock(L); - va_start(argp, what); - switch (what) { - case LUA_GCSTOP: { - g->gcstp = GCSTPUSR; /* stopped by the user */ - break; - } - case LUA_GCRESTART: { - luaE_setdebt(g, 0); - g->gcstp = 0; /* (other bits must be zero here) */ - break; - } - case LUA_GCCOLLECT: { - luaC_fullgc(L, 0); - break; - } - case LUA_GCCOUNT: { - /* GC values are expressed in Kbytes: #bytes/2^10 */ - res = cast_int(g->totalbytes >> 10); - break; - } - case LUA_GCCOUNTB: { - res = cast_int(g->totalbytes & 0x3ff); - break; - } - case LUA_GCSTEP: { - lu_byte oldstp = g->gcstp; - l_obj n = va_arg(argp, int); - int work = 0; /* true if GC did some work */ - g->gcstp = 0; /* allow GC to run (other bits must be zero here) */ - if (n <= 0) - n = g->GCdebt; /* force to run one basic step */ - luaE_setdebt(g, g->GCdebt - n); - luaC_condGC(L, (void)0, work = 1); - if (work && g->gcstate == GCSpause) /* end of cycle? */ - res = 1; /* signal it */ - g->gcstp = oldstp; /* restore previous state */ - break; - } - case LUA_GCISRUNNING: { - res = gcrunning(g); - break; - } - case LUA_GCGEN: { - res = (g->gckind == KGC_INC) ? LUA_GCINC : LUA_GCGEN; - luaC_changemode(L, KGC_GENMINOR); - break; - } - case LUA_GCINC: { - res = (g->gckind == KGC_INC) ? LUA_GCINC : LUA_GCGEN; - luaC_changemode(L, KGC_INC); - break; - } - case LUA_GCPARAM: { - int param = va_arg(argp, int); - int value = va_arg(argp, int); - api_check(L, 0 <= param && param < LUA_GCPN, "invalid parameter"); - res = cast_int(luaO_applyparam(g->gcparams[param], 100)); - if (value >= 0) - g->gcparams[param] = luaO_codeparam(value); - break; - } - default: res = -1; /* invalid option */ - } - va_end(argp); - lua_unlock(L); - return res; -} - - - -/* -** miscellaneous functions -*/ - - -LUA_API int lua_error (lua_State *L) { - TValue *errobj; - lua_lock(L); - errobj = s2v(L->top.p - 1); - api_checkpop(L, 1); - /* error object is the memory error message? */ - if (ttisshrstring(errobj) && eqshrstr(tsvalue(errobj), G(L)->memerrmsg)) - luaM_error(L); /* raise a memory error */ - else - luaG_errormsg(L); /* raise a regular error */ - /* code unreachable; will unlock when control actually leaves the kernel */ - return 0; /* to avoid warnings */ -} - - -LUA_API int lua_next (lua_State *L, int idx) { - Table *t; - int more; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - more = luaH_next(L, t, L->top.p - 1); - if (more) - api_incr_top(L); - else /* no more elements */ - L->top.p--; /* pop key */ - lua_unlock(L); - return more; -} - - -LUA_API void lua_toclose (lua_State *L, int idx) { - int nresults; - StkId o; - lua_lock(L); - o = index2stack(L, idx); - nresults = L->ci->nresults; - api_check(L, L->tbclist.p < o, "given index below or equal a marked one"); - luaF_newtbcupval(L, o); /* create new to-be-closed upvalue */ - if (!hastocloseCfunc(nresults)) /* function not marked yet? */ - L->ci->nresults = codeNresults(nresults); /* mark it */ - lua_assert(hastocloseCfunc(L->ci->nresults)); - lua_unlock(L); -} - - -LUA_API void lua_concat (lua_State *L, int n) { - lua_lock(L); - api_checknelems(L, n); - if (n > 0) { - luaV_concat(L, n); - luaC_checkGC(L); - } - else { /* nothing to concatenate */ - setsvalue2s(L, L->top.p, luaS_newlstr(L, "", 0)); /* push empty string */ - api_incr_top(L); - } - lua_unlock(L); -} - - -LUA_API void lua_len (lua_State *L, int idx) { - TValue *t; - lua_lock(L); - t = index2value(L, idx); - luaV_objlen(L, L->top.p, t); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API lua_Alloc lua_getallocf (lua_State *L, void **ud) { - lua_Alloc f; - lua_lock(L); - if (ud) *ud = G(L)->ud; - f = G(L)->frealloc; - lua_unlock(L); - return f; -} - - -LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud) { - lua_lock(L); - G(L)->ud = ud; - G(L)->frealloc = f; - lua_unlock(L); -} - - -void lua_setwarnf (lua_State *L, lua_WarnFunction f, void *ud) { - lua_lock(L); - G(L)->ud_warn = ud; - G(L)->warnf = f; - lua_unlock(L); -} - - -void lua_warning (lua_State *L, const char *msg, int tocont) { - lua_lock(L); - luaE_warning(L, msg, tocont); - lua_unlock(L); -} - - - -LUA_API void *lua_newuserdatauv (lua_State *L, size_t size, int nuvalue) { - Udata *u; - lua_lock(L); - api_check(L, 0 <= nuvalue && nuvalue < USHRT_MAX, "invalid value"); - u = luaS_newudata(L, size, nuvalue); - setuvalue(L, s2v(L->top.p), u); - api_incr_top(L); - advancegc(L, size); - luaC_checkGC(L); - lua_unlock(L); - return getudatamem(u); -} - - - -static const char *aux_upvalue (TValue *fi, int n, TValue **val, - GCObject **owner) { - switch (ttypetag(fi)) { - case LUA_VCCL: { /* C closure */ - CClosure *f = clCvalue(fi); - if (!(cast_uint(n) - 1u < cast_uint(f->nupvalues))) - return NULL; /* 'n' not in [1, f->nupvalues] */ - *val = &f->upvalue[n-1]; - if (owner) *owner = obj2gco(f); - return ""; - } - case LUA_VLCL: { /* Lua closure */ - LClosure *f = clLvalue(fi); - TString *name; - Proto *p = f->p; - if (!(cast_uint(n) - 1u < cast_uint(p->sizeupvalues))) - return NULL; /* 'n' not in [1, p->sizeupvalues] */ - *val = f->upvals[n-1]->v.p; - if (owner) *owner = obj2gco(f->upvals[n - 1]); - name = p->upvalues[n-1].name; - return (name == NULL) ? "(no name)" : getstr(name); - } - default: return NULL; /* not a closure */ - } -} - - -LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n) { - const char *name; - TValue *val = NULL; /* to avoid warnings */ - lua_lock(L); - name = aux_upvalue(index2value(L, funcindex), n, &val, NULL); - if (name) { - setobj2s(L, L->top.p, val); - api_incr_top(L); - } - lua_unlock(L); - return name; -} - - -LUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n) { - const char *name; - TValue *val = NULL; /* to avoid warnings */ - GCObject *owner = NULL; /* to avoid warnings */ - TValue *fi; - lua_lock(L); - fi = index2value(L, funcindex); - api_checknelems(L, 1); - name = aux_upvalue(fi, n, &val, &owner); - if (name) { - L->top.p--; - setobj(L, val, s2v(L->top.p)); - luaC_barrier(L, owner, val); - } - lua_unlock(L); - return name; -} - - -static UpVal **getupvalref (lua_State *L, int fidx, int n, LClosure **pf) { - static const UpVal *const nullup = NULL; - LClosure *f; - TValue *fi = index2value(L, fidx); - api_check(L, ttisLclosure(fi), "Lua function expected"); - f = clLvalue(fi); - if (pf) *pf = f; - if (1 <= n && n <= f->p->sizeupvalues) - return &f->upvals[n - 1]; /* get its upvalue pointer */ - else - return (UpVal**)&nullup; -} - - -LUA_API void *lua_upvalueid (lua_State *L, int fidx, int n) { - TValue *fi = index2value(L, fidx); - switch (ttypetag(fi)) { - case LUA_VLCL: { /* lua closure */ - return *getupvalref(L, fidx, n, NULL); - } - case LUA_VCCL: { /* C closure */ - CClosure *f = clCvalue(fi); - if (1 <= n && n <= f->nupvalues) - return &f->upvalue[n - 1]; - /* else */ - } /* FALLTHROUGH */ - case LUA_VLCF: - return NULL; /* light C functions have no upvalues */ - default: { - api_check(L, 0, "function expected"); - return NULL; - } - } -} - - -LUA_API void lua_upvaluejoin (lua_State *L, int fidx1, int n1, - int fidx2, int n2) { - LClosure *f1; - UpVal **up1 = getupvalref(L, fidx1, n1, &f1); - UpVal **up2 = getupvalref(L, fidx2, n2, NULL); - api_check(L, *up1 != NULL && *up2 != NULL, "invalid upvalue index"); - *up1 = *up2; - luaC_objbarrier(L, f1, *up1); -} - - - - -/* auxiliary library -- used by all */ - -/* -** $Id: lauxlib.c $ -** Auxiliary functions for building Lua libraries -** See Copyright Notice in lua.h -*/ - -#define lauxlib_c -#define LUA_LIB - - - -#include -#include -#include -#include -#include - - -/* -** This file uses only the official API of Lua. -** Any function declared here could be written as an application function. -*/ - - - -/* -** $Id: lauxlib.h $ -** Auxiliary functions for building Lua libraries -** See Copyright Notice in lua.h -*/ - - -#ifndef lauxlib_h -#define lauxlib_h - - -#include -#include - - - -/* global table */ -#define LUA_GNAME "_G" - - -typedef struct luaL_Buffer luaL_Buffer; - - -/* extra error code for 'luaL_loadfilex' */ -#define LUA_ERRFILE (LUA_ERRERR+1) - - -/* key, in the registry, for table of loaded modules */ -#define LUA_LOADED_TABLE "_LOADED" - - -/* key, in the registry, for table of preloaded loaders */ -#define LUA_PRELOAD_TABLE "_PRELOAD" - - -typedef struct luaL_Reg { - const char *name; - lua_CFunction func; -} luaL_Reg; - - -#define LUAL_NUMSIZES (sizeof(lua_Integer)*16 + sizeof(lua_Number)) - -LUALIB_API void (luaL_checkversion_) (lua_State *L, lua_Number ver, size_t sz); -#define luaL_checkversion(L) \ - luaL_checkversion_(L, LUA_VERSION_NUM, LUAL_NUMSIZES) - -LUALIB_API int (luaL_getmetafield) (lua_State *L, int obj, const char *e); -LUALIB_API int (luaL_callmeta) (lua_State *L, int obj, const char *e); -LUALIB_API const char *(luaL_tolstring) (lua_State *L, int idx, size_t *len); -LUALIB_API int (luaL_argerror) (lua_State *L, int arg, const char *extramsg); -LUALIB_API int (luaL_typeerror) (lua_State *L, int arg, const char *tname); -LUALIB_API const char *(luaL_checklstring) (lua_State *L, int arg, - size_t *l); -LUALIB_API const char *(luaL_optlstring) (lua_State *L, int arg, - const char *def, size_t *l); -LUALIB_API lua_Number (luaL_checknumber) (lua_State *L, int arg); -LUALIB_API lua_Number (luaL_optnumber) (lua_State *L, int arg, lua_Number def); - -LUALIB_API lua_Integer (luaL_checkinteger) (lua_State *L, int arg); -LUALIB_API lua_Integer (luaL_optinteger) (lua_State *L, int arg, - lua_Integer def); - -LUALIB_API void (luaL_checkstack) (lua_State *L, int sz, const char *msg); -LUALIB_API void (luaL_checktype) (lua_State *L, int arg, int t); -LUALIB_API void (luaL_checkany) (lua_State *L, int arg); - -LUALIB_API int (luaL_newmetatable) (lua_State *L, const char *tname); -LUALIB_API void (luaL_setmetatable) (lua_State *L, const char *tname); -LUALIB_API void *(luaL_testudata) (lua_State *L, int ud, const char *tname); -LUALIB_API void *(luaL_checkudata) (lua_State *L, int ud, const char *tname); - -LUALIB_API void (luaL_where) (lua_State *L, int lvl); -LUALIB_API int (luaL_error) (lua_State *L, const char *fmt, ...); - -LUALIB_API int (luaL_checkoption) (lua_State *L, int arg, const char *def, - const char *const lst[]); - -LUALIB_API int (luaL_fileresult) (lua_State *L, int stat, const char *fname); -LUALIB_API int (luaL_execresult) (lua_State *L, int stat); - - -/* predefined references */ -#define LUA_NOREF (-2) -#define LUA_REFNIL (-1) - -LUALIB_API int (luaL_ref) (lua_State *L, int t); -LUALIB_API void (luaL_unref) (lua_State *L, int t, int ref); - -LUALIB_API int (luaL_loadfilex) (lua_State *L, const char *filename, - const char *mode); - -#define luaL_loadfile(L,f) luaL_loadfilex(L,f,NULL) - -LUALIB_API int (luaL_loadbufferx) (lua_State *L, const char *buff, size_t sz, - const char *name, const char *mode); -LUALIB_API int (luaL_loadstring) (lua_State *L, const char *s); - -LUALIB_API lua_State *(luaL_newstate) (void); - -LUALIB_API unsigned luaL_makeseed (lua_State *L); - -LUALIB_API lua_Integer (luaL_len) (lua_State *L, int idx); - -LUALIB_API void (luaL_addgsub) (luaL_Buffer *b, const char *s, - const char *p, const char *r); -LUALIB_API const char *(luaL_gsub) (lua_State *L, const char *s, - const char *p, const char *r); - -LUALIB_API void (luaL_setfuncs) (lua_State *L, const luaL_Reg *l, int nup); - -LUALIB_API int (luaL_getsubtable) (lua_State *L, int idx, const char *fname); - -LUALIB_API void (luaL_traceback) (lua_State *L, lua_State *L1, - const char *msg, int level); - -LUALIB_API void (luaL_requiref) (lua_State *L, const char *modname, - lua_CFunction openf, int glb); - -/* -** =============================================================== -** some useful macros -** =============================================================== -*/ - - -#define luaL_newlibtable(L,l) \ - lua_createtable(L, 0, sizeof(l)/sizeof((l)[0]) - 1) - -#define luaL_newlib(L,l) \ - (luaL_checkversion(L), luaL_newlibtable(L,l), luaL_setfuncs(L,l,0)) - -#define luaL_argcheck(L, cond,arg,extramsg) \ - ((void)(luai_likely(cond) || luaL_argerror(L, (arg), (extramsg)))) - -#define luaL_argexpected(L,cond,arg,tname) \ - ((void)(luai_likely(cond) || luaL_typeerror(L, (arg), (tname)))) - -#define luaL_checkstring(L,n) (luaL_checklstring(L, (n), NULL)) -#define luaL_optstring(L,n,d) (luaL_optlstring(L, (n), (d), NULL)) - -#define luaL_typename(L,i) lua_typename(L, lua_type(L,(i))) - -#define luaL_dofile(L, fn) \ - (luaL_loadfile(L, fn) || lua_pcall(L, 0, LUA_MULTRET, 0)) - -#define luaL_dostring(L, s) \ - (luaL_loadstring(L, s) || lua_pcall(L, 0, LUA_MULTRET, 0)) - -#define luaL_getmetatable(L,n) (lua_getfield(L, LUA_REGISTRYINDEX, (n))) - -#define luaL_opt(L,f,n,d) (lua_isnoneornil(L,(n)) ? (d) : f(L,(n))) - -#define luaL_loadbuffer(L,s,sz,n) luaL_loadbufferx(L,s,sz,n,NULL) - - -/* -** Perform arithmetic operations on lua_Integer values with wrap-around -** semantics, as the Lua core does. -*/ -#define luaL_intop(op,v1,v2) \ - ((lua_Integer)((lua_Unsigned)(v1) op (lua_Unsigned)(v2))) - - -/* push the value used to represent failure/error */ -#define luaL_pushfail(L) lua_pushnil(L) - - -/* -** Internal assertions for in-house debugging -*/ -#if !defined(lua_assert) - -#if defined LUAI_ASSERT - #include - #define lua_assert(c) assert(c) -#else - #define lua_assert(c) ((void)0) -#endif - -#endif - - - -/* -** {====================================================== -** Generic Buffer manipulation -** ======================================================= -*/ - -struct luaL_Buffer { - char *b; /* buffer address */ - size_t size; /* buffer size */ - size_t n; /* number of characters in buffer */ - lua_State *L; - union { - LUAI_MAXALIGN; /* ensure maximum alignment for buffer */ - char b[LUAL_BUFFERSIZE]; /* initial buffer */ - } init; -}; - - -#define luaL_bufflen(bf) ((bf)->n) -#define luaL_buffaddr(bf) ((bf)->b) - - -#define luaL_addchar(B,c) \ - ((void)((B)->n < (B)->size || luaL_prepbuffsize((B), 1)), \ - ((B)->b[(B)->n++] = (c))) - -#define luaL_addsize(B,s) ((B)->n += (s)) - -#define luaL_buffsub(B,s) ((B)->n -= (s)) - -LUALIB_API void (luaL_buffinit) (lua_State *L, luaL_Buffer *B); -LUALIB_API char *(luaL_prepbuffsize) (luaL_Buffer *B, size_t sz); -LUALIB_API void (luaL_addlstring) (luaL_Buffer *B, const char *s, size_t l); -LUALIB_API void (luaL_addstring) (luaL_Buffer *B, const char *s); -LUALIB_API void (luaL_addvalue) (luaL_Buffer *B); -LUALIB_API void (luaL_pushresult) (luaL_Buffer *B); -LUALIB_API void (luaL_pushresultsize) (luaL_Buffer *B, size_t sz); -LUALIB_API char *(luaL_buffinitsize) (lua_State *L, luaL_Buffer *B, size_t sz); - -#define luaL_prepbuffer(B) luaL_prepbuffsize(B, LUAL_BUFFERSIZE) - -/* }====================================================== */ - - - -/* -** {====================================================== -** File handles for IO library -** ======================================================= -*/ - -/* -** A file handle is a userdata with metatable 'LUA_FILEHANDLE' and -** initial structure 'luaL_Stream' (it may contain other fields -** after that initial structure). -*/ - -#define LUA_FILEHANDLE "FILE*" - - -typedef struct luaL_Stream { - FILE *f; /* stream (NULL for incompletely created streams) */ - lua_CFunction closef; /* to close stream (NULL for closed streams) */ -} luaL_Stream; - -/* }====================================================== */ - -/* -** {================================================================== -** "Abstraction Layer" for basic report of messages and errors -** =================================================================== -*/ - -/* print a string */ -#if !defined(lua_writestring) -#define lua_writestring(s,l) fwrite((s), sizeof(char), (l), stdout) -#endif - -/* print a newline and flush the output */ -#if !defined(lua_writeline) -#define lua_writeline() (lua_writestring("\n", 1), fflush(stdout)) -#endif - -/* print an error message */ -#if !defined(lua_writestringerror) -#define lua_writestringerror(s,p) \ - (fprintf(stderr, (s), (p)), fflush(stderr)) -#endif - -/* }================================================================== */ - - -/* -** {============================================================ -** Compatibility with deprecated conversions -** ============================================================= -*/ -#if defined(LUA_COMPAT_APIINTCASTS) - -#define luaL_checkunsigned(L,a) ((lua_Unsigned)luaL_checkinteger(L,a)) -#define luaL_optunsigned(L,a,d) \ - ((lua_Unsigned)luaL_optinteger(L,a,(lua_Integer)(d))) - -#define luaL_checkint(L,n) ((int)luaL_checkinteger(L, (n))) -#define luaL_optint(L,n,d) ((int)luaL_optinteger(L, (n), (d))) - -#define luaL_checklong(L,n) ((long)luaL_checkinteger(L, (n))) -#define luaL_optlong(L,n,d) ((long)luaL_optinteger(L, (n), (d))) - -#endif -/* }============================================================ */ - - - -#endif - - - - - -#if !defined(MAX_SIZET) -/* maximum value for size_t */ -#define MAX_SIZET ((size_t)(~(size_t)0)) -#endif - - -/* -** {====================================================== -** Traceback -** ======================================================= -*/ - - -#define LEVELS1 10 /* size of the first part of the stack */ -#define LEVELS2 11 /* size of the second part of the stack */ - - - -/* -** Search for 'objidx' in table at index -1. ('objidx' must be an -** absolute index.) Return 1 + string at top if it found a good name. -*/ -static int findfield (lua_State *L, int objidx, int level) { - if (level == 0 || !lua_istable(L, -1)) - return 0; /* not found */ - lua_pushnil(L); /* start 'next' loop */ - while (lua_next(L, -2)) { /* for each pair in table */ - if (lua_type(L, -2) == LUA_TSTRING) { /* ignore non-string keys */ - if (lua_rawequal(L, objidx, -1)) { /* found object? */ - lua_pop(L, 1); /* remove value (but keep name) */ - return 1; - } - else if (findfield(L, objidx, level - 1)) { /* try recursively */ - /* stack: lib_name, lib_table, field_name (top) */ - lua_pushliteral(L, "."); /* place '.' between the two names */ - lua_replace(L, -3); /* (in the slot occupied by table) */ - lua_concat(L, 3); /* lib_name.field_name */ - return 1; - } - } - lua_pop(L, 1); /* remove value */ - } - return 0; /* not found */ -} - - -/* -** Search for a name for a function in all loaded modules -*/ -static int pushglobalfuncname (lua_State *L, lua_Debug *ar) { - int top = lua_gettop(L); - lua_getinfo(L, "f", ar); /* push function */ - lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - if (findfield(L, top + 1, 2)) { - const char *name = lua_tostring(L, -1); - if (strncmp(name, LUA_GNAME ".", 3) == 0) { /* name start with '_G.'? */ - lua_pushstring(L, name + 3); /* push name without prefix */ - lua_remove(L, -2); /* remove original name */ - } - lua_copy(L, -1, top + 1); /* copy name to proper place */ - lua_settop(L, top + 1); /* remove table "loaded" and name copy */ - return 1; - } - else { - lua_settop(L, top); /* remove function and global table */ - return 0; - } -} - - -static void pushfuncname (lua_State *L, lua_Debug *ar) { - if (pushglobalfuncname(L, ar)) { /* try first a global name */ - lua_pushfstring(L, "function '%s'", lua_tostring(L, -1)); - lua_remove(L, -2); /* remove name */ - } - else if (*ar->namewhat != '\0') /* is there a name from code? */ - lua_pushfstring(L, "%s '%s'", ar->namewhat, ar->name); /* use it */ - else if (*ar->what == 'm') /* main? */ - lua_pushliteral(L, "main chunk"); - else if (*ar->what != 'C') /* for Lua functions, use */ - lua_pushfstring(L, "function <%s:%d>", ar->short_src, ar->linedefined); - else /* nothing left... */ - lua_pushliteral(L, "?"); -} - - -static int lastlevel (lua_State *L) { - lua_Debug ar; - int li = 1, le = 1; - /* find an upper bound */ - while (lua_getstack(L, le, &ar)) { li = le; le *= 2; } - /* do a binary search */ - while (li < le) { - int m = (li + le)/2; - if (lua_getstack(L, m, &ar)) li = m + 1; - else le = m; - } - return le - 1; -} - - -LUALIB_API void luaL_traceback (lua_State *L, lua_State *L1, - const char *msg, int level) { - luaL_Buffer b; - lua_Debug ar; - int last = lastlevel(L1); - int limit2show = (last - level > LEVELS1 + LEVELS2) ? LEVELS1 : -1; - luaL_buffinit(L, &b); - if (msg) { - luaL_addstring(&b, msg); - luaL_addchar(&b, '\n'); - } - luaL_addstring(&b, "stack traceback:"); - while (lua_getstack(L1, level++, &ar)) { - if (limit2show-- == 0) { /* too many levels? */ - int n = last - level - LEVELS2 + 1; /* number of levels to skip */ - lua_pushfstring(L, "\n\t...\t(skipping %d levels)", n); - luaL_addvalue(&b); /* add warning about skip */ - level += n; /* and skip to last levels */ - } - else { - lua_getinfo(L1, "Slnt", &ar); - if (ar.currentline <= 0) - lua_pushfstring(L, "\n\t%s: in ", ar.short_src); - else - lua_pushfstring(L, "\n\t%s:%d: in ", ar.short_src, ar.currentline); - luaL_addvalue(&b); - pushfuncname(L, &ar); - luaL_addvalue(&b); - if (ar.istailcall) - luaL_addstring(&b, "\n\t(...tail calls...)"); - } - } - luaL_pushresult(&b); -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Error-report functions -** ======================================================= -*/ - -LUALIB_API int luaL_argerror (lua_State *L, int arg, const char *extramsg) { - lua_Debug ar; - if (!lua_getstack(L, 0, &ar)) /* no stack frame? */ - return luaL_error(L, "bad argument #%d (%s)", arg, extramsg); - lua_getinfo(L, "n", &ar); - if (strcmp(ar.namewhat, "method") == 0) { - arg--; /* do not count 'self' */ - if (arg == 0) /* error is in the self argument itself? */ - return luaL_error(L, "calling '%s' on bad self (%s)", - ar.name, extramsg); - } - if (ar.name == NULL) - ar.name = (pushglobalfuncname(L, &ar)) ? lua_tostring(L, -1) : "?"; - return luaL_error(L, "bad argument #%d to '%s' (%s)", - arg, ar.name, extramsg); -} - - -LUALIB_API int luaL_typeerror (lua_State *L, int arg, const char *tname) { - const char *msg; - const char *typearg; /* name for the type of the actual argument */ - if (luaL_getmetafield(L, arg, "__name") == LUA_TSTRING) - typearg = lua_tostring(L, -1); /* use the given type name */ - else if (lua_type(L, arg) == LUA_TLIGHTUSERDATA) - typearg = "light userdata"; /* special name for messages */ - else - typearg = luaL_typename(L, arg); /* standard name */ - msg = lua_pushfstring(L, "%s expected, got %s", tname, typearg); - return luaL_argerror(L, arg, msg); -} - - -static void tag_error (lua_State *L, int arg, int tag) { - luaL_typeerror(L, arg, lua_typename(L, tag)); -} - - -/* -** The use of 'lua_pushfstring' ensures this function does not -** need reserved stack space when called. -*/ -LUALIB_API void luaL_where (lua_State *L, int level) { - lua_Debug ar; - if (lua_getstack(L, level, &ar)) { /* check function at level */ - lua_getinfo(L, "Sl", &ar); /* get info about it */ - if (ar.currentline > 0) { /* is there info? */ - lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline); - return; - } - } - lua_pushfstring(L, ""); /* else, no information available... */ -} - - -/* -** Again, the use of 'lua_pushvfstring' ensures this function does -** not need reserved stack space when called. (At worst, it generates -** an error with "stack overflow" instead of the given message.) -*/ -LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) { - va_list argp; - va_start(argp, fmt); - luaL_where(L, 1); - lua_pushvfstring(L, fmt, argp); - va_end(argp); - lua_concat(L, 2); - return lua_error(L); -} - - -LUALIB_API int luaL_fileresult (lua_State *L, int stat, const char *fname) { - int en = errno; /* calls to Lua API may change this value */ - if (stat) { - lua_pushboolean(L, 1); - return 1; - } - else { - luaL_pushfail(L); - if (fname) - lua_pushfstring(L, "%s: %s", fname, strerror(en)); - else - lua_pushstring(L, strerror(en)); - lua_pushinteger(L, en); - return 3; - } -} - - -#if !defined(l_inspectstat) /* { */ - -#if defined(LUA_USE_POSIX) - -#include - -/* -** use appropriate macros to interpret 'pclose' return status -*/ -#define l_inspectstat(stat,what) \ - if (WIFEXITED(stat)) { stat = WEXITSTATUS(stat); } \ - else if (WIFSIGNALED(stat)) { stat = WTERMSIG(stat); what = "signal"; } - -#else - -#define l_inspectstat(stat,what) /* no op */ - -#endif - -#endif /* } */ - - -LUALIB_API int luaL_execresult (lua_State *L, int stat) { - if (stat != 0 && errno != 0) /* error with an 'errno'? */ - return luaL_fileresult(L, 0, NULL); - else { - const char *what = "exit"; /* type of termination */ - l_inspectstat(stat, what); /* interpret result */ - if (*what == 'e' && stat == 0) /* successful termination? */ - lua_pushboolean(L, 1); - else - luaL_pushfail(L); - lua_pushstring(L, what); - lua_pushinteger(L, stat); - return 3; /* return true/fail,what,code */ - } -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Userdata's metatable manipulation -** ======================================================= -*/ - -LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) { - if (luaL_getmetatable(L, tname) != LUA_TNIL) /* name already in use? */ - return 0; /* leave previous value on top, but return 0 */ - lua_pop(L, 1); - lua_createtable(L, 0, 2); /* create metatable */ - lua_pushstring(L, tname); - lua_setfield(L, -2, "__name"); /* metatable.__name = tname */ - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, tname); /* registry.name = metatable */ - return 1; -} - - -LUALIB_API void luaL_setmetatable (lua_State *L, const char *tname) { - luaL_getmetatable(L, tname); - lua_setmetatable(L, -2); -} - - -LUALIB_API void *luaL_testudata (lua_State *L, int ud, const char *tname) { - void *p = lua_touserdata(L, ud); - if (p != NULL) { /* value is a userdata? */ - if (lua_getmetatable(L, ud)) { /* does it have a metatable? */ - luaL_getmetatable(L, tname); /* get correct metatable */ - if (!lua_rawequal(L, -1, -2)) /* not the same? */ - p = NULL; /* value is a userdata with wrong metatable */ - lua_pop(L, 2); /* remove both metatables */ - return p; - } - } - return NULL; /* value is not a userdata with a metatable */ -} - - -LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) { - void *p = luaL_testudata(L, ud, tname); - luaL_argexpected(L, p != NULL, ud, tname); - return p; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Argument check functions -** ======================================================= -*/ - -LUALIB_API int luaL_checkoption (lua_State *L, int arg, const char *def, - const char *const lst[]) { - const char *name = (def) ? luaL_optstring(L, arg, def) : - luaL_checkstring(L, arg); - int i; - for (i=0; lst[i]; i++) - if (strcmp(lst[i], name) == 0) - return i; - return luaL_argerror(L, arg, - lua_pushfstring(L, "invalid option '%s'", name)); -} - - -/* -** Ensures the stack has at least 'space' extra slots, raising an error -** if it cannot fulfill the request. (The error handling needs a few -** extra slots to format the error message. In case of an error without -** this extra space, Lua will generate the same 'stack overflow' error, -** but without 'msg'.) -*/ -LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *msg) { - if (l_unlikely(!lua_checkstack(L, space))) { - if (msg) - luaL_error(L, "stack overflow (%s)", msg); - else - luaL_error(L, "stack overflow"); - } -} - - -LUALIB_API void luaL_checktype (lua_State *L, int arg, int t) { - if (l_unlikely(lua_type(L, arg) != t)) - tag_error(L, arg, t); -} - - -LUALIB_API void luaL_checkany (lua_State *L, int arg) { - if (l_unlikely(lua_type(L, arg) == LUA_TNONE)) - luaL_argerror(L, arg, "value expected"); -} - - -LUALIB_API const char *luaL_checklstring (lua_State *L, int arg, size_t *len) { - const char *s = lua_tolstring(L, arg, len); - if (l_unlikely(!s)) tag_error(L, arg, LUA_TSTRING); - return s; -} - - -LUALIB_API const char *luaL_optlstring (lua_State *L, int arg, - const char *def, size_t *len) { - if (lua_isnoneornil(L, arg)) { - if (len) - *len = (def ? strlen(def) : 0); - return def; - } - else return luaL_checklstring(L, arg, len); -} - - -LUALIB_API lua_Number luaL_checknumber (lua_State *L, int arg) { - int isnum; - lua_Number d = lua_tonumberx(L, arg, &isnum); - if (l_unlikely(!isnum)) - tag_error(L, arg, LUA_TNUMBER); - return d; -} - - -LUALIB_API lua_Number luaL_optnumber (lua_State *L, int arg, lua_Number def) { - return luaL_opt(L, luaL_checknumber, arg, def); -} - - -static void interror (lua_State *L, int arg) { - if (lua_isnumber(L, arg)) - luaL_argerror(L, arg, "number has no integer representation"); - else - tag_error(L, arg, LUA_TNUMBER); -} - - -LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int arg) { - int isnum; - lua_Integer d = lua_tointegerx(L, arg, &isnum); - if (l_unlikely(!isnum)) { - interror(L, arg); - } - return d; -} - - -LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int arg, - lua_Integer def) { - return luaL_opt(L, luaL_checkinteger, arg, def); -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Generic Buffer manipulation -** ======================================================= -*/ - -/* userdata to box arbitrary data */ -typedef struct UBox { - void *box; - size_t bsize; -} UBox; - - -/* Resize the buffer used by a box. Optimize for the common case of -** resizing to the old size. (For instance, __gc will resize the box -** to 0 even after it was closed. 'pushresult' may also resize it to a -** final size that is equal to the one set when the buffer was created.) -*/ -static void *resizebox (lua_State *L, int idx, size_t newsize) { - UBox *box = (UBox *)lua_touserdata(L, idx); - if (box->bsize == newsize) /* not changing size? */ - return box->box; /* keep the buffer */ - else { - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); - void *temp = allocf(ud, box->box, box->bsize, newsize); - if (l_unlikely(temp == NULL && newsize > 0)) { /* allocation error? */ - lua_pushliteral(L, "not enough memory"); - lua_error(L); /* raise a memory error */ - } - box->box = temp; - box->bsize = newsize; - return temp; - } -} - - -static int boxgc (lua_State *L) { - resizebox(L, 1, 0); - return 0; -} - - -static const luaL_Reg boxmt[] = { /* box metamethods */ - {"__gc", boxgc}, - {"__close", boxgc}, - {NULL, NULL} -}; - - -static void newbox (lua_State *L) { - UBox *box = (UBox *)lua_newuserdatauv(L, sizeof(UBox), 0); - box->box = NULL; - box->bsize = 0; - if (luaL_newmetatable(L, "_UBOX*")) /* creating metatable? */ - luaL_setfuncs(L, boxmt, 0); /* set its metamethods */ - lua_setmetatable(L, -2); -} - - -/* -** check whether buffer is using a userdata on the stack as a temporary -** buffer -*/ -#define buffonstack(B) ((B)->b != (B)->init.b) - - -/* -** Whenever buffer is accessed, slot 'idx' must either be a box (which -** cannot be NULL) or it is a placeholder for the buffer. -*/ -#define checkbufferlevel(B,idx) \ - lua_assert(buffonstack(B) ? lua_touserdata(B->L, idx) != NULL \ - : lua_touserdata(B->L, idx) == (void*)B) - - -/* -** Compute new size for buffer 'B', enough to accommodate extra 'sz' -** bytes plus one for a terminating zero. (The test for "not big enough" -** also gets the case when the computation of 'newsize' overflows.) -*/ -static size_t newbuffsize (luaL_Buffer *B, size_t sz) { - size_t newsize = (B->size / 2) * 3; /* buffer size * 1.5 */ - if (l_unlikely(MAX_SIZET - sz - 1 < B->n)) /* overflow in (B->n + sz + 1)? */ - return luaL_error(B->L, "buffer too large"); - if (newsize < B->n + sz + 1) /* not big enough? */ - newsize = B->n + sz + 1; - return newsize; -} - - -/* -** Returns a pointer to a free area with at least 'sz' bytes in buffer -** 'B'. 'boxidx' is the relative position in the stack where is the -** buffer's box or its placeholder. -*/ -static char *prepbuffsize (luaL_Buffer *B, size_t sz, int boxidx) { - checkbufferlevel(B, boxidx); - if (B->size - B->n >= sz) /* enough space? */ - return B->b + B->n; - else { - lua_State *L = B->L; - char *newbuff; - size_t newsize = newbuffsize(B, sz); - /* create larger buffer */ - if (buffonstack(B)) /* buffer already has a box? */ - newbuff = (char *)resizebox(L, boxidx, newsize); /* resize it */ - else { /* no box yet */ - lua_remove(L, boxidx); /* remove placeholder */ - newbox(L); /* create a new box */ - lua_insert(L, boxidx); /* move box to its intended position */ - lua_toclose(L, boxidx); - newbuff = (char *)resizebox(L, boxidx, newsize); - memcpy(newbuff, B->b, B->n * sizeof(char)); /* copy original content */ - } - B->b = newbuff; - B->size = newsize; - return newbuff + B->n; - } -} - -/* -** returns a pointer to a free area with at least 'sz' bytes -*/ -LUALIB_API char *luaL_prepbuffsize (luaL_Buffer *B, size_t sz) { - return prepbuffsize(B, sz, -1); -} - - -LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) { - if (l > 0) { /* avoid 'memcpy' when 's' can be NULL */ - char *b = prepbuffsize(B, l, -1); - memcpy(b, s, l * sizeof(char)); - luaL_addsize(B, l); - } -} - - -LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) { - luaL_addlstring(B, s, strlen(s)); -} - - -LUALIB_API void luaL_pushresult (luaL_Buffer *B) { - lua_State *L = B->L; - checkbufferlevel(B, -1); - if (!buffonstack(B)) /* using static buffer? */ - lua_pushlstring(L, B->b, B->n); /* save result as regular string */ - else { /* reuse buffer already allocated */ - UBox *box = (UBox *)lua_touserdata(L, -1); - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); /* function to free buffer */ - size_t len = B->n; /* final string length */ - char *s; - resizebox(L, -1, len + 1); /* adjust box size to content size */ - s = (char*)box->box; /* final buffer address */ - s[len] = '\0'; /* add ending zero */ - /* clear box, as 'lua_pushextlstring' will take control over buffer */ - box->bsize = 0; box->box = NULL; - lua_pushextlstring(L, s, len, allocf, ud); - lua_closeslot(L, -2); /* close the box */ - } - lua_remove(L, -2); /* remove box or placeholder from the stack */ -} - - -LUALIB_API void luaL_pushresultsize (luaL_Buffer *B, size_t sz) { - luaL_addsize(B, sz); - luaL_pushresult(B); -} - - -/* -** 'luaL_addvalue' is the only function in the Buffer system where the -** box (if existent) is not on the top of the stack. So, instead of -** calling 'luaL_addlstring', it replicates the code using -2 as the -** last argument to 'prepbuffsize', signaling that the box is (or will -** be) below the string being added to the buffer. (Box creation can -** trigger an emergency GC, so we should not remove the string from the -** stack before we have the space guaranteed.) -*/ -LUALIB_API void luaL_addvalue (luaL_Buffer *B) { - lua_State *L = B->L; - size_t len; - const char *s = lua_tolstring(L, -1, &len); - char *b = prepbuffsize(B, len, -2); - memcpy(b, s, len * sizeof(char)); - luaL_addsize(B, len); - lua_pop(L, 1); /* pop string */ -} - - -LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) { - B->L = L; - B->b = B->init.b; - B->n = 0; - B->size = LUAL_BUFFERSIZE; - lua_pushlightuserdata(L, (void*)B); /* push placeholder */ -} - - -LUALIB_API char *luaL_buffinitsize (lua_State *L, luaL_Buffer *B, size_t sz) { - luaL_buffinit(L, B); - return prepbuffsize(B, sz, -1); -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Reference system -** ======================================================= -*/ - -/* -** The previously freed references form a linked list: t[1] is the index -** of a first free index, t[t[1]] is the index of the second element, -** etc. A zero signals the end of the list. -*/ -LUALIB_API int luaL_ref (lua_State *L, int t) { - int ref; - if (lua_isnil(L, -1)) { - lua_pop(L, 1); /* remove from stack */ - return LUA_REFNIL; /* 'nil' has a unique fixed reference */ - } - t = lua_absindex(L, t); - if (lua_rawgeti(L, t, 1) == LUA_TNUMBER) /* already initialized? */ - ref = (int)lua_tointeger(L, -1); /* ref = t[1] */ - else { /* first access */ - lua_assert(!lua_toboolean(L, -1)); /* must be nil or false */ - ref = 0; /* list is empty */ - lua_pushinteger(L, 0); /* initialize as an empty list */ - lua_rawseti(L, t, 1); /* ref = t[1] = 0 */ - } - lua_pop(L, 1); /* remove element from stack */ - if (ref != 0) { /* any free element? */ - lua_rawgeti(L, t, ref); /* remove it from list */ - lua_rawseti(L, t, 1); /* (t[1] = t[ref]) */ - } - else /* no free elements */ - ref = (int)lua_rawlen(L, t) + 1; /* get a new reference */ - lua_rawseti(L, t, ref); - return ref; -} - - -LUALIB_API void luaL_unref (lua_State *L, int t, int ref) { - if (ref >= 0) { - t = lua_absindex(L, t); - lua_rawgeti(L, t, 1); - lua_assert(lua_isinteger(L, -1)); - lua_rawseti(L, t, ref); /* t[ref] = t[1] */ - lua_pushinteger(L, ref); - lua_rawseti(L, t, 1); /* t[1] = ref */ - } -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Load functions -** ======================================================= -*/ - -typedef struct LoadF { - int n; /* number of pre-read characters */ - FILE *f; /* file being read */ - char buff[BUFSIZ]; /* area for reading file */ -} LoadF; - - -static const char *getF (lua_State *L, void *ud, size_t *size) { - LoadF *lf = (LoadF *)ud; - (void)L; /* not used */ - if (lf->n > 0) { /* are there pre-read characters to be read? */ - *size = lf->n; /* return them (chars already in buffer) */ - lf->n = 0; /* no more pre-read characters */ - } - else { /* read a block from file */ - /* 'fread' can return > 0 *and* set the EOF flag. If next call to - 'getF' called 'fread', it might still wait for user input. - The next check avoids this problem. */ - if (feof(lf->f)) return NULL; - *size = fread(lf->buff, 1, sizeof(lf->buff), lf->f); /* read block */ - } - return lf->buff; -} - - -static int errfile (lua_State *L, const char *what, int fnameindex) { - const char *serr = strerror(errno); - const char *filename = lua_tostring(L, fnameindex) + 1; - lua_pushfstring(L, "cannot %s %s: %s", what, filename, serr); - lua_remove(L, fnameindex); - return LUA_ERRFILE; -} - - -/* -** Skip an optional BOM at the start of a stream. If there is an -** incomplete BOM (the first character is correct but the rest is -** not), returns the first character anyway to force an error -** (as no chunk can start with 0xEF). -*/ -static int skipBOM (FILE *f) { - int c = getc(f); /* read first character */ - if (c == 0xEF && getc(f) == 0xBB && getc(f) == 0xBF) /* correct BOM? */ - return getc(f); /* ignore BOM and return next char */ - else /* no (valid) BOM */ - return c; /* return first character */ -} - - -/* -** reads the first character of file 'f' and skips an optional BOM mark -** in its beginning plus its first line if it starts with '#'. Returns -** true if it skipped the first line. In any case, '*cp' has the -** first "valid" character of the file (after the optional BOM and -** a first-line comment). -*/ -static int skipcomment (FILE *f, int *cp) { - int c = *cp = skipBOM(f); - if (c == '#') { /* first line is a comment (Unix exec. file)? */ - do { /* skip first line */ - c = getc(f); - } while (c != EOF && c != '\n'); - *cp = getc(f); /* next character after comment, if present */ - return 1; /* there was a comment */ - } - else return 0; /* no comment */ -} - - -LUALIB_API int luaL_loadfilex (lua_State *L, const char *filename, - const char *mode) { - LoadF lf; - int status, readstatus; - int c; - int fnameindex = lua_gettop(L) + 1; /* index of filename on the stack */ - if (filename == NULL) { - lua_pushliteral(L, "=stdin"); - lf.f = stdin; - } - else { - lua_pushfstring(L, "@%s", filename); - lf.f = fopen(filename, "r"); - if (lf.f == NULL) return errfile(L, "open", fnameindex); - } - lf.n = 0; - if (skipcomment(lf.f, &c)) /* read initial portion */ - lf.buff[lf.n++] = '\n'; /* add newline to correct line numbers */ - if (c == LUA_SIGNATURE[0]) { /* binary file? */ - lf.n = 0; /* remove possible newline */ - if (filename) { /* "real" file? */ - lf.f = freopen(filename, "rb", lf.f); /* reopen in binary mode */ - if (lf.f == NULL) return errfile(L, "reopen", fnameindex); - skipcomment(lf.f, &c); /* re-read initial portion */ - } - } - if (c != EOF) - lf.buff[lf.n++] = c; /* 'c' is the first character of the stream */ - status = lua_load(L, getF, &lf, lua_tostring(L, -1), mode); - readstatus = ferror(lf.f); - if (filename) fclose(lf.f); /* close file (even in case of errors) */ - if (readstatus) { - lua_settop(L, fnameindex); /* ignore results from 'lua_load' */ - return errfile(L, "read", fnameindex); - } - lua_remove(L, fnameindex); - return status; -} - - -typedef struct LoadS { - const char *s; - size_t size; -} LoadS; - - -static const char *getS (lua_State *L, void *ud, size_t *size) { - LoadS *ls = (LoadS *)ud; - (void)L; /* not used */ - if (ls->size == 0) return NULL; - *size = ls->size; - ls->size = 0; - return ls->s; -} - - -LUALIB_API int luaL_loadbufferx (lua_State *L, const char *buff, size_t size, - const char *name, const char *mode) { - LoadS ls; - ls.s = buff; - ls.size = size; - return lua_load(L, getS, &ls, name, mode); -} - - -LUALIB_API int luaL_loadstring (lua_State *L, const char *s) { - return luaL_loadbuffer(L, s, strlen(s), s); -} - -/* }====================================================== */ - - - -LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) { - if (!lua_getmetatable(L, obj)) /* no metatable? */ - return LUA_TNIL; - else { - int tt; - lua_pushstring(L, event); - tt = lua_rawget(L, -2); - if (tt == LUA_TNIL) /* is metafield nil? */ - lua_pop(L, 2); /* remove metatable and metafield */ - else - lua_remove(L, -2); /* remove only metatable */ - return tt; /* return metafield type */ - } -} - - -LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) { - obj = lua_absindex(L, obj); - if (luaL_getmetafield(L, obj, event) == LUA_TNIL) /* no metafield? */ - return 0; - lua_pushvalue(L, obj); - lua_call(L, 1, 1); - return 1; -} - - -LUALIB_API lua_Integer luaL_len (lua_State *L, int idx) { - lua_Integer l; - int isnum; - lua_len(L, idx); - l = lua_tointegerx(L, -1, &isnum); - if (l_unlikely(!isnum)) - luaL_error(L, "object length is not an integer"); - lua_pop(L, 1); /* remove object */ - return l; -} - - -LUALIB_API const char *luaL_tolstring (lua_State *L, int idx, size_t *len) { - idx = lua_absindex(L,idx); - if (luaL_callmeta(L, idx, "__tostring")) { /* metafield? */ - if (!lua_isstring(L, -1)) - luaL_error(L, "'__tostring' must return a string"); - } - else { - switch (lua_type(L, idx)) { - case LUA_TNUMBER: { - if (lua_isinteger(L, idx)) - lua_pushfstring(L, "%I", (LUAI_UACINT)lua_tointeger(L, idx)); - else - lua_pushfstring(L, "%f", (LUAI_UACNUMBER)lua_tonumber(L, idx)); - break; - } - case LUA_TSTRING: - lua_pushvalue(L, idx); - break; - case LUA_TBOOLEAN: - lua_pushstring(L, (lua_toboolean(L, idx) ? "true" : "false")); - break; - case LUA_TNIL: - lua_pushliteral(L, "nil"); - break; - default: { - int tt = luaL_getmetafield(L, idx, "__name"); /* try name */ - const char *kind = (tt == LUA_TSTRING) ? lua_tostring(L, -1) : - luaL_typename(L, idx); - lua_pushfstring(L, "%s: %p", kind, lua_topointer(L, idx)); - if (tt != LUA_TNIL) - lua_remove(L, -2); /* remove '__name' */ - break; - } - } - } - return lua_tolstring(L, -1, len); -} - - -/* -** set functions from list 'l' into table at top - 'nup'; each -** function gets the 'nup' elements at the top as upvalues. -** Returns with only the table at the stack. -*/ -LUALIB_API void luaL_setfuncs (lua_State *L, const luaL_Reg *l, int nup) { - luaL_checkstack(L, nup, "too many upvalues"); - for (; l->name != NULL; l++) { /* fill the table with given functions */ - if (l->func == NULL) /* place holder? */ - lua_pushboolean(L, 0); - else { - int i; - for (i = 0; i < nup; i++) /* copy upvalues to the top */ - lua_pushvalue(L, -nup); - lua_pushcclosure(L, l->func, nup); /* closure with those upvalues */ - } - lua_setfield(L, -(nup + 2), l->name); - } - lua_pop(L, nup); /* remove upvalues */ -} - - -/* -** ensure that stack[idx][fname] has a table and push that table -** into the stack -*/ -LUALIB_API int luaL_getsubtable (lua_State *L, int idx, const char *fname) { - if (lua_getfield(L, idx, fname) == LUA_TTABLE) - return 1; /* table already there */ - else { - lua_pop(L, 1); /* remove previous result */ - idx = lua_absindex(L, idx); - lua_newtable(L); - lua_pushvalue(L, -1); /* copy to be left at top */ - lua_setfield(L, idx, fname); /* assign new table to field */ - return 0; /* false, because did not find table there */ - } -} - - -/* -** Stripped-down 'require': After checking "loaded" table, calls 'openf' -** to open a module, registers the result in 'package.loaded' table and, -** if 'glb' is true, also registers the result in the global table. -** Leaves resulting module on the top. -*/ -LUALIB_API void luaL_requiref (lua_State *L, const char *modname, - lua_CFunction openf, int glb) { - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_getfield(L, -1, modname); /* LOADED[modname] */ - if (!lua_toboolean(L, -1)) { /* package not already loaded? */ - lua_pop(L, 1); /* remove field */ - lua_pushcfunction(L, openf); - lua_pushstring(L, modname); /* argument to open function */ - lua_call(L, 1, 1); /* call 'openf' to open module */ - lua_pushvalue(L, -1); /* make copy of module (call result) */ - lua_setfield(L, -3, modname); /* LOADED[modname] = module */ - } - lua_remove(L, -2); /* remove LOADED table */ - if (glb) { - lua_pushvalue(L, -1); /* copy of module */ - lua_setglobal(L, modname); /* _G[modname] = module */ - } -} - - -LUALIB_API void luaL_addgsub (luaL_Buffer *b, const char *s, - const char *p, const char *r) { - const char *wild; - size_t l = strlen(p); - while ((wild = strstr(s, p)) != NULL) { - luaL_addlstring(b, s, wild - s); /* push prefix */ - luaL_addstring(b, r); /* push replacement in place of pattern */ - s = wild + l; /* continue after 'p' */ - } - luaL_addstring(b, s); /* push last suffix */ -} - - -LUALIB_API const char *luaL_gsub (lua_State *L, const char *s, - const char *p, const char *r) { - luaL_Buffer b; - luaL_buffinit(L, &b); - luaL_addgsub(&b, s, p, r); - luaL_pushresult(&b); - return lua_tostring(L, -1); -} - - -static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) { - (void)ud; (void)osize; /* not used */ - if (nsize == 0) { - free(ptr); - return NULL; - } - else - return realloc(ptr, nsize); -} - - -/* -** Standard panic funcion just prints an error message. The test -** with 'lua_type' avoids possible memory errors in 'lua_tostring'. -*/ -static int panic (lua_State *L) { - const char *msg = (lua_type(L, -1) == LUA_TSTRING) - ? lua_tostring(L, -1) - : "private_lua_error object is not a string"; - lua_writestringerror("PANIC: unprotected private_lua_error in call to Lua API (%s)\n", - msg); - return 0; /* return to Lua to abort */ -} - - -/* -** Warning functions: -** warnfoff: warning system is off -** warnfon: ready to start a new message -** warnfcont: previous message is to be continued -*/ -static void warnfoff (void *ud, const char *message, int tocont); -static void warnfon (void *ud, const char *message, int tocont); -static void warnfcont (void *ud, const char *message, int tocont); - - -/* -** Check whether message is a control message. If so, execute the -** control or ignore it if unknown. -*/ -static int checkcontrol (lua_State *L, const char *message, int tocont) { - if (tocont || *(message++) != '@') /* not a control message? */ - return 0; - else { - if (strcmp(message, "off") == 0) - lua_setwarnf(L, warnfoff, L); /* turn warnings off */ - else if (strcmp(message, "on") == 0) - lua_setwarnf(L, warnfon, L); /* turn warnings on */ - return 1; /* it was a control message */ - } -} - - -static void warnfoff (void *ud, const char *message, int tocont) { - checkcontrol((lua_State *)ud, message, tocont); -} - - -/* -** Writes the message and handle 'tocont', finishing the message -** if needed and setting the next warn function. -*/ -static void warnfcont (void *ud, const char *message, int tocont) { - lua_State *L = (lua_State *)ud; - lua_writestringerror("%s", message); /* write message */ - if (tocont) /* not the last part? */ - lua_setwarnf(L, warnfcont, L); /* to be continued */ - else { /* last part */ - lua_writestringerror("%s", "\n"); /* finish message with end-of-line */ - lua_setwarnf(L, warnfon, L); /* next call is a new message */ - } -} - - -static void warnfon (void *ud, const char *message, int tocont) { - if (checkcontrol((lua_State *)ud, message, tocont)) /* control message? */ - return; /* nothing else to be done */ - lua_writestringerror("%s", "Lua warning: "); /* start a new warning */ - warnfcont(ud, message, tocont); /* finish processing */ -} - - - -/* -** A function to compute an unsigned int with some level of -** randomness. Rely on Address Space Layout Randomization (if present) -** and the current time. -*/ -#if !defined(luai_makeseed) - -#include - - -/* Size for the buffer, in bytes */ -#define BUFSEEDB (sizeof(void*) + sizeof(time_t)) - -/* Size for the buffer in int's, rounded up */ -#define BUFSEED ((BUFSEEDB + sizeof(int) - 1) / sizeof(int)) - -/* -** Copy the contents of variable 'v' into the buffer pointed by 'b'. -** (The '&b[0]' disguises 'b' to fix an absurd warning from clang.) -*/ -#define addbuff(b,v) (memcpy(&b[0], &(v), sizeof(v)), b += sizeof(v)) - - -static unsigned int luai_makeseed (void) { - unsigned int buff[BUFSEED]; - unsigned int res; - unsigned int i; - time_t t = time(NULL); - char *b = (char*)buff; - addbuff(b, b); /* local variable's address */ - addbuff(b, t); /* time */ - /* fill (rare but possible) remain of the buffer with zeros */ - memset(b, 0, sizeof(buff) - BUFSEEDB); - res = buff[0]; - for (i = 1; i < BUFSEED; i++) - res ^= (res >> 3) + (res << 7) + buff[i]; - return res; -} - -#endif - - -LUALIB_API unsigned int luaL_makeseed (lua_State *L) { - (void)L; /* unused */ - return luai_makeseed(); -} - - -LUALIB_API lua_State *luaL_newstate (void) { - lua_State *L = lua_newstate(l_alloc, NULL, luai_makeseed()); - if (l_likely(L)) { - lua_atpanic(L, &panic); - lua_setwarnf(L, warnfoff, L); /* default is warnings off */ - } - return L; -} - - -LUALIB_API void luaL_checkversion_ (lua_State *L, lua_Number ver, size_t sz) { - lua_Number v = lua_version(L); - if (sz != LUAL_NUMSIZES) /* check numeric types */ - luaL_error(L, "core and library have incompatible numeric types"); - else if (v != ver) - luaL_error(L, "version mismatch: app. needs %f, Lua core provides %f", - (LUAI_UACNUMBER)ver, (LUAI_UACNUMBER)v); -} - - - - - - - - - -#define PRIVATE_LUACEMBED_NO_RETURN 0 -#define PRIVATE_LUACEMBED_ONE_RETURN 1 - - - -#define LUA_CEMBED_NOT_FOUND LUA_TNONE -#define LUA_CEMBED_STRING LUA_TSTRING -#define LUA_CEMBED_NUMBER LUA_TNUMBER -#define LUA_CEMBED_BOOL LUA_TBOOLEAN -#define LUA_CEMBED_NIL LUA_TNIL -#define LUA_CEMBED_FUNCTION LUA_TFUNCTION -#define LUA_CEMBED_TABLE LUA_TTABLE - -#define PRIVATE_LUA_CEMBED_NOT_FOUND_STRING "not Found" -#define PRIVATE_LUA_CEMBED_STRING_STRING "string" -#define PRIVATE_LUA_CEMBED_NUMBER_STRING "number" -#define PRIVATE_LUA_CEMBED_BOOL_STRING "boolean" -#define PRIVATE_LUA_CEMBED_NIL_STRING "nil" -#define PRIVATE_LUA_CEMBED_TABLE_STRING "table" -#define PRIVATE_LUA_CEMBED_FUNCTION_STRING "function" - -#define PRIVATE_LUA_CEMBED_UNKNOW_STRING "unknow" - -#define PRIVATE_LUA_CEMBED_STRING_RESPONSE 1 -#define PRIVATE_LUA_CEMBED_LONG_RESPONSE 2 -#define PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE 3 -#define PRIVATE_LUA_CEMBED_BOOL_RESPONSE 4 -#define PRIVATE_LUA_CEMBED_TABLE_RESPONSE 5 - -#define PRIVATE_LUA_CEMBED_EVALUATION 6 -#define PRIVATE_LUA_CEMBED_ERROR_RESPONSE 7 -#define PRIVATE_LUA_CEMBED_MULTI_RESPONSE 8 - -#define LUA_CEMBED_OK 0 -#define LUA_CEMBED_GENERIC_ERROR (-1) - - -#define PRIVATE_LUA_CEMBED_TOTAL_LIBS "private_lua_c_embed_total_running_libs" -#define PRIVATE_LUA_CEMBED_STACK_LEVEL "private_lua_c_embed_stack_level" - -#define PRIVATE_LUA_CEMBED_EVALUATION_NAME "private_lua_c_embed_evaluation" -#define PRIVATE_LUA_CEMBED_DEL_PREFIX "__gc" -#define PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE "%s = %s\n" - - - - -#define PRIVATE_LUA_CEMBED_SELFNAME "private_lua_c_embed_self" -#define PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE "private_lua_c_embed_stage_area_table" -#define PRIVATE_LUA_CEMBED_TABLE_RETURN "private_lua_embed_table_return" - -#define PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__ "private_lua_c_embed_main_lib_table_%d" -#define PRIVATE_LUA_CEMBED_MAIN_LIB_SUB_TABLE "private_lua_c_embed_main_lib_table_%d_%s" - -#define PRIVATE_LUA_CEMBED_MAIN_META_TABLE__ "private_lua_c_embed_main_meta_table_%d" -#define PRIVATE_LUA_CEMBED_ANONYMOUS_TABLE_ "private_lua_c_embed_anononymous_table_%d_%d" -#define PRIVATE_LUA_CEMBED_ANONYMOUS_FUNC_TABLE_ "private_lua_c_embed_anononymous_func_table_%d_%d" -#define PRIVATE_LUA_CEMBED_ARGS_ "private_lua_c_embed_args_%d_%d" -#define PRIVATE_LUA_CEMBED_MULTIRETURN_ "private_lua_c_embed_multi_return_%d_%d" - - - -#define PRIVATE_LUA_CEMBED_TIMEOUT_ERROR "timeout error" -#define PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED "arg %ld at function:%s not provided" -#define PRIVATE_LUA_CEMBED_ARG_WRONG_TYPE "arg %d at function:%s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_GLOBAL_WRONG_TYPE "global variable:%s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_RESULT_EVALUATION_WRONG_TYPE "result evaluation its:%s instead of %s" -#define PRIVATE_LUA_CEMBED_RESULT_EVALUATION_ARG_WRONG_TYPE "result evaluation of function %s at index %d its:%s instead of %s" - -#define PRIVATE_LUA_CEMBED_CODE_ITS_NOT_A_FUNCTION "value %s its not a function" -#define PRIVATE_LUA_CEMBED_WRONG_TYPE_PROPETY "propety %s at object %s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX "index %d at object %s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_ELEMENT_DOES_NOT_HAVE_KEY "index %d at object %s not have a key" -#define PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR "timeout error" -#define PRIVATE_LUA_CEMBED_LIB_PROP_WRONG_TYPE "lib prop %s its %s insteadd of %s" - -#ifndef LUA_CEMBED_INDEX_DIF -#define LUA_CEMBED_INDEX_DIF 1 -#endif - -#define PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE 1 -#define PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE 2 -#define LUA_CEMBED_DEFAULT_TIMEOUT 10 -#define LUA_CEMBED_DEFAULT_MEMORY_LIMIT 100 - -#define PRIVATE_LUA_CEMBED_ONE_MB (1024 * 1024) - - - - -typedef struct { - - int type; - double num_val; - bool its_string_ref; - long string_size; - char *string_val; - -}LuaCEmbedResponse; - -LuaCEmbedResponse *private_LuaCEmbedReturn_raw(); - - -LuaCEmbedResponse * LuaCEmbed_send_str(const char *text); - -LuaCEmbedResponse * LuaCEmbed_send_raw_string(const char *text,long size); - -LuaCEmbedResponse * LuaCEmbed_send_str_reference( const char *text); - -LuaCEmbedResponse * LuaCEmbed_send_raw_string_reference(const char *text,long size); - -LuaCEmbedResponse * LuaCEmbed_send_error(const char *format,...); - - -LuaCEmbedResponse * LuaCEmbed_send_evaluation(const char *code); - - - - - -LuaCEmbedResponse * LuaCEmbed_send_double(double value); - -LuaCEmbedResponse * LuaCEmbed_send_bool(bool value); - - -LuaCEmbedResponse * LuaCEmbed_send_long(long value); - - -void private_LuaCEmbedResponse_free(LuaCEmbedResponse *self); - - -typedef long private_lua_cembed_incremented_arg ; - - - - -double private_lua_cembed_memory_limit; - - - -static void *private_LuaCembed_custom_allocator(void *ud, void *ptr, size_t osize, size_t nsize) ; - - - - -typedef struct LuaCEmbed{ - lua_State *state; - const char *current_function; - bool is_lib; - bool public_functions; - int total_args; - char *error_msg; - double memory_limit; - int used_memory; - int timeout; - void (*delete_function)(struct LuaCEmbed *self); - void *global_tables; - void *func_tables; - int lib_identifier; - int stack_leve; - char *main_lib_table; - bool field_protection; -}LuaCEmbed; - - -LuaCEmbed *global_current_lua_embed_object; - - - - -int private_LuaCemb_internal_free(lua_State *L); - -LuaCEmbed * newLuaCEmbedLib(lua_State *state,bool public_functions); - -int LuaCembed_perform(LuaCEmbed *self); - - - - - -LuaCEmbed * newLuaCEmbedEvaluation(); - -LuaCEmbed * newLuaCEmbedEvaluation_with_custom_allocator(); - -int private_LuaCemb_internal_free(lua_State *L); - - - - - - -void LuaCembed_set_delete_function(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)); - -char * LuaCEmbed_get_error_message(LuaCEmbed *self); - - -bool LuaCEmbed_has_errors(LuaCEmbed *self); - -void LuaCEmbed_clear_errors(LuaCEmbed *self); - -void privateLuaCEmbd_get_field_protected(LuaCEmbed *self,const char *name); - -void privateLuaCEmbed_raise_error_not_jumping(LuaCEmbed *self, const char *error, ...); - -void * privateLuaCEmbed_get_current_table_array(LuaCEmbed *self); - -void LuaCEmbed_set_timeout(LuaCEmbed *self,int seconds); - -void LuaCEmbed_set_memory_limit(LuaCEmbed *self, double limit); - - - -void privata_LuaCEmbed_increment_stack_(LuaCEmbed *self); - - -void privata_LuaCEmbed_decrement_stack(LuaCEmbed *self); - -void LuaCEmbed_free(LuaCEmbed *self); - - - - - - - - -typedef struct { - LuaCEmbed *main_object; - char *prop_name; - char *global_name; - void *sub_tables; - long index; - -}LuaCEmbedTable; - - - - -LuaCEmbedTable * private_newLuaCembedTable(LuaCEmbed *main_embed, const char *format, ...); - -int private_lua_cEmbed_unpack(LuaCEmbedTable *self,const char * previews_function); - -void privateLuaCEmbedTable_free(LuaCEmbedTable *self); - -void privateLuaCEmbedTable_free_setting_nill(LuaCEmbedTable *self); - - - - -char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, long index); - -bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, long index); - -long LuaCEmbedTable_get_full_size(LuaCEmbedTable *self); - -long LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self); - - -long privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cembed_incremented_arg index); - -int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, int index); - -long long LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, int index); - -double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, int index); - -char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, int index); - -bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, int index); - - - - - - - -char* LuaCembedTable_get_string_prop(LuaCEmbedTable *self, const char *name); - -long long LuaCembedTable_get_long_prop(LuaCEmbedTable *self, const char *name); - -double LuaCembedTable_get_double_prop(LuaCEmbedTable *self, const char *name); - -bool LuaCembedTable_get_bool_prop(LuaCEmbedTable *self, const char *name); - -int LuaCEmbedTable_get_type_prop(LuaCEmbedTable *self, const char *name); - - - - - -void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, long index, const char *value); - -void LuaCEmbedTable_set_long_by_index(LuaCEmbedTable *self, long long index, long value); - -void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, long index, double value); - -void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, long index, bool value); - - -void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, long index, const char *code, ...); - - - - - - - -void LuaCEmbedTable_set_method(LuaCEmbedTable *self, const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)); - -void LuaCEmbedTable_set_string_prop(LuaCEmbedTable *self, const char *name, const char *value); - -void LuaCEmbedTable_set_long_prop(LuaCEmbedTable *self, const char *name, long long value); - -void LuaCEmbedTable_set_double_prop(LuaCEmbedTable *self, const char *name, double value); - -void LuaCEmbedTable_set_bool_prop(LuaCEmbedTable *self, const char *name, bool value); - - -void LuaCEmbedTable_set_evaluation_prop(LuaCEmbedTable *self, const char *name, const char *code, ...); - - - - - -void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, long formatted_index); - -void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, long index, const char *value); - -void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, long index,bool value); - -void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, long long index,long value); - -void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, long index,double value); - -void LuaCEmbedTable_insert_table_at_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *table); - - - - - -int privateLuaCEmbedTable_ensure_type_with_key(LuaCEmbedTable *self, const char *name, int expected_type); - -int privateLuaCEmbedTable_ensure_type_with_index(LuaCEmbedTable *self, long index, int expected_type); - - - - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_by_key(LuaCEmbedTable *self, const char *name); - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_key(LuaCEmbedTable *self, const char *name); - -void LuaCEmbedTable_set_sub_table_prop(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table); - - - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_appending(LuaCEmbedTable *self); - - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, long index); - - -void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table); - - - - - - - - -void LuaCEmbedTable_append_table(LuaCEmbedTable *self, LuaCEmbedTable *table); - - -void LuaCEmbedTable_append_evaluation(LuaCEmbedTable *self, const char *code, ...); - -void LuaCEmbedTable_append_string(LuaCEmbedTable *self, const char *value); - -void LuaCEmbedTable_append_long(LuaCEmbedTable *self, long long value); - -void LuaCEmbedTable_append_double(LuaCEmbedTable *self, double value); - -void LuaCEmbedTable_append_bool(LuaCEmbedTable *self, bool value); - - - -void LuaCembedTable_destroy_prop(LuaCEmbedTable *self, const char *name); - -void LuaCEmbedTable_destroy_by_index(LuaCEmbedTable *self, long index); - - - - -typedef struct { - - LuaCEmbedTable **tables; - long size; - -}privateLuaCEmbedTableArray; - -privateLuaCEmbedTableArray *newprivateLuaCEmbedTableArray(); - -void privateLuaCEmbedTableArray_append(privateLuaCEmbedTableArray *self,LuaCEmbedTable *element); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_global_name(privateLuaCEmbedTableArray *self, const char *name); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_prop_name(privateLuaCEmbedTableArray *self, const char *name); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_internal_index(privateLuaCEmbedTableArray *self, long internal_index); - -void privateLuaCEmbedTableArray_free(privateLuaCEmbedTableArray *self); - - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID \ - if(!self){ \ - return; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM \ - if(!self){ \ - return LUA_CEMBED_GENERIC_ERROR; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL \ - if(!self){ \ - return false; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL \ - if(!self){ \ - return NULL; \ - } - - - - - - -int LuaCEmbed_ensure_arg_exist(LuaCEmbed *self, private_lua_cembed_incremented_arg index); - -int private_LuaCEmbed_ensure_top_stack_arg_type(LuaCEmbed *self, int index,int arg_type); - - - -int privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, int index); - -int LuaCEmbed_get_total_args(LuaCEmbed *self); - -int LuaCEmbed_get_arg_type(LuaCEmbed *self,int index); - - - -long long LuaCEmbed_get_long_arg(LuaCEmbed *self, int index); - -double LuaCEmbed_get_double_arg(LuaCEmbed *self, int index); - -bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, int index); - -char * LuaCEmbed_get_str_arg(LuaCEmbed *self, int index); - -char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,long *size, int index); - -LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,int index); - -LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call, int total_returns); - - - - - -int private_LuaCembed_run_code_with_args(LuaCEmbed *self,int index,const char *code,va_list args); - -int privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,int index,int expected_type); - -int LuaCEmbed_get_type_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -int LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -long long LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - - -double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - - - - - - - - -int LuaCEmbed_ensure_global_type(LuaCEmbed *self, const char *name,int expected_type); - - - - -int LuaCEmbed_get_global_type(LuaCEmbed *self,const char *name); - -long long LuaCEmbed_get_global_long(LuaCEmbed *self,const char *name); - -double LuaCEmbed_get_global_double(LuaCEmbed *self,const char *name); - -bool LuaCEmbed_get_global_bool(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_global_string(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_global_raw_string(LuaCEmbed *self,const char *name,long *size); - - -LuaCEmbedTable * LuaCembed_new_anonymous_table(LuaCEmbed *self); - -LuaCEmbedTable* LuaCEmbed_run_global_lambda(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns); - -LuaCEmbedTable * LuaCembed_get_global_table(LuaCEmbed *self, const char *name); - -LuaCEmbedTable * LuaCembed_new_global_table(LuaCEmbed *self, const char *name); - - - -void LuaCEmbed_set_global_string(LuaCEmbed *self, const char *name, const char *value); - -void LuaCEmbed_set_global_raw_string(LuaCEmbed *self, const char *name, const char *value,long size); - -void LuaCEmbed_set_global_long(LuaCEmbed *self, const char *name, long long value); - -void LuaCEmbed_set_global_double(LuaCEmbed *self, const char *name, double value); - -void LuaCEmbed_set_global_bool(LuaCEmbed *self, const char *name, bool value); - -void LuaCEmbed_set_global_table(LuaCEmbed *self, const char *name, LuaCEmbedTable *table); - - - - - -int privateLuaCEmbed_main_callback_handler(lua_State *L); - -void private_LuaCEmbed_add_lib_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - -void private_LuaCEmbed_add_evaluation_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - -void LuaCEmbed_add_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - - - - - - - -#ifdef _WIN32 -VOID CALLBACK TimerHandler(HWND hwnd, UINT uMsg, UINT_PTR idEvent, DWORD dwTime); -#else - -void private_LuaCembed_handle_timeout(int signum); - -#endif - -int privateLuaCEmbed_start_func_evaluation(lua_State *state); - -int LuaCEmbed_evaluate(LuaCEmbed *self, const char *code, ...); - -int LuaCEmbed_evaluete_file(LuaCEmbed *self, const char *file); - - -int private_LuaCEmbed_ensure_evaluation_type(LuaCEmbed *self,int type); - -int private_LuaCEmbed_evaluate_puting_on_top_of_stack(LuaCEmbed *self,const char *code, va_list args); - -char * LuaCEmbed_get_evaluation_string(LuaCEmbed *self,const char *code, ...); - - -int LuaCEmbed_get_evaluation_type(LuaCEmbed *self,const char *code, ...); - - -long LuaCEmbed_get_evaluation_table_size(LuaCEmbed *self,const char *code, ...); - -long long LuaCEmbed_get_evaluation_long(LuaCEmbed *self,const char *code, ...); - -double LuaCEmbed_get_evaluation_double(LuaCEmbed *self,const char *code, ...); - -bool LuaCEmbed_get_evaluation_bool(LuaCEmbed *self,const char *code, ...); - - - - -#define PRIVATE_LUA_CEMBED_PROTECT_VOID \ - if(!self){ \ - return; \ - } - - -#define PRIVATE_LUA_CEMBED_PROTECT_NUM \ - if(!self){ \ - return LUA_CEMBED_GENERIC_ERROR; \ - } - -#define PRIVATE_LUA_CEMBED_PROTECT_BOOL \ - if(!self){ \ - return false; \ - } - -#define PRIVATE_LUA_CEMBED_PROTECT_NULL \ - if(!self){ \ - return NULL; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK if(lua_gettop(self->main_object->state)){lua_settop(self->main_object->state,0);} - -#define PRIVATE_LUA_CEMBED_CLEAR_STACK if(lua_gettop(self->state)){lua_settop(self->state,0);} - - - - -void LuaCEmbed_set_long_lib_prop(LuaCEmbed *self,const char *name,long long value); - -void LuaCEmbed_set_double_lib_prop(LuaCEmbed *self,const char *name,double value); - -void LuaCEmbed_set_bool_lib_prop(LuaCEmbed *self,const char *name,bool value); - -void LuaCEmbed_set_string_lib_prop(LuaCEmbed *self,const char *name,const char * value); - -void LuaCEmbed_set_table_lib_prop(LuaCEmbed *self,const char *name,LuaCEmbedTable *value); - -int private_LuaCEmbed_ensure_lib_prop_type(LuaCEmbed *self,const char *name,int expected_type);; - - -long long LuaCEmbed_get_long_lib_prop(LuaCEmbed *self,const char *name); - -double LuaCEmbed_get_double_lib_prop(LuaCEmbed *self,const char *name); - -bool LuaCEmbed_get_bool_lib_prop(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_string_lib_prop(LuaCEmbed *self,const char *name); - -LuaCEmbedTable *LuaCEmbed_get_table_lib_prop(LuaCEmbed *self,const char *name); - - - - - - -LuaCEmbedResponse * LuaCEmbed_send_table(LuaCEmbedTable *table); - - -LuaCEmbedResponse * LuaCEmbed_send_multi_return(LuaCEmbedTable *table); - - - - - -const char * LuaCembed_convert_arg_code(int arg_code); - - -char * private_LuaCembed_format_vaarg(const char *expresion, va_list args); - -char * private_LuaCembed_format(const char *expresion, ...); - - - - - - - - -typedef struct { - int NOT_FOUND; - int STRING; - int NUMBER; - int BOOL; - int NILL; - int TABLE; - int FUNCTION; - - -}LuaCEmbedTypeModule; - -LuaCEmbedTypeModule newLuaCEmbedTypeModule(); - - - -typedef struct { - LuaCEmbedResponse * (*send_multi_return)(LuaCEmbedTable *table); - LuaCEmbedResponse * (*send_str)(const char *text); - LuaCEmbedResponse * (*send_raw_string)(const char *text,long size); - LuaCEmbedResponse * (*send_str_reference)( const char *text); - LuaCEmbedResponse * (*send_raw_string_reference)(const char *text,long size); - LuaCEmbedResponse * (*send_table)(LuaCEmbedTable *table); - LuaCEmbedResponse * (*send_evaluation_function)(const char *function); - LuaCEmbedResponse * (*send_double)(double value); - LuaCEmbedResponse * (*send_bool)(bool value); - LuaCEmbedResponse * (*send_long)(long value); - LuaCEmbedResponse * (*send_error)(const char *format,...); - -}LuaCEmbedResponseModule; - -LuaCEmbedResponseModule newLuaCEmbedResponseModule(); - - - -typedef struct { - - int (*ensure_type)(LuaCEmbed *self, const char *name,int expected_type); - int (*get_type)(LuaCEmbed *self,const char *name); - long long (*get_long)(LuaCEmbed *self,const char *name); - double (*get_double)(LuaCEmbed *self,const char *name); - bool (*get_bool)(LuaCEmbed *self,const char *name); - char * (*get_string)(LuaCEmbed *self,const char *name); - LuaCEmbedTable* (*run_global_lambda)(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns); - void (*set_table)(LuaCEmbed *self, const char *name, LuaCEmbedTable *table); - void (*set_raw_string)(LuaCEmbed *self, const char *name, const char *value, long size); - char * (*get_raw_string)(LuaCEmbed *self, const char *name, long *size); - - - void (*set_string)(LuaCEmbed *self,const char *name,const char *value); - void (*set_long)(LuaCEmbed *self,const char *name,long long value); - void (*set_double)(LuaCEmbed *self,const char *name,double value); - void (*set_bool)(LuaCEmbed *self,const char *name,bool value); - - LuaCEmbedTable * (*get_table)(LuaCEmbed *self, const char *name); - LuaCEmbedTable * (*new_table)(LuaCEmbed *self, const char *name); - - -}LuaCEmbedGlobalModule; - -LuaCEmbedGlobalModule newLuaCEmbedGlobalModule(); - - -typedef struct { - - - int (*size)(LuaCEmbed *self); - int (*get_type)(LuaCEmbed *self,int index); - long long (*get_long)(LuaCEmbed *self, int index); - double (*get_double)(LuaCEmbed *self, int index); - bool (*get_bool)(LuaCEmbed *self, int index); - char * (*get_raw_str)(LuaCEmbed *self, long *size, int index); - char * (*get_str)(LuaCEmbed *self, int index); - LuaCEmbedTable * (*get_table)(LuaCEmbed *self,int index); - int (*generate_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - int (*get_type_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - long long (*get_long_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - double (*get_double_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - bool (*get_bool_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - char* (*get_string_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - LuaCEmbedTable* (*run_lambda)(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call,int total_returns); - - - - -} LuaCembedArgsModule; - -LuaCembedArgsModule newLuaCembedArgsModule(); - - -typedef struct { - - void (*append_string)(LuaCEmbedTable *self, const char *value); - void (*append_long)(LuaCEmbedTable *self, long long value); - void (*append_double)(LuaCEmbedTable *self, double value); - void (*append_bool)(LuaCEmbedTable *self, bool value); - void (*append_table)(LuaCEmbedTable *self, LuaCEmbedTable *table); - void (*set_evaluation_prop)(LuaCEmbedTable *self, const char *name, const char *code, ...); - void (*append_evaluation)(LuaCEmbedTable *self, const char *code, ...); - - void (*insert_string_at_index)(LuaCEmbedTable *self, long index, const char *value); - void (*insert_bool_at_index)(LuaCEmbedTable *self, long index,bool value); - void (*insert_long_at_index)(LuaCEmbedTable *self, long long index,long value); - void (*insert_double_at_index)(LuaCEmbedTable *self, long index,double value); - void (*insert_table_at_index)(LuaCEmbedTable *self, long index,LuaCEmbedTable *table); - - - - void (*set_sub_table_by_index)(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table); - void (*set_string_by_index)(LuaCEmbedTable *self, long index, const char *value); - void (*set_long_by_index)(LuaCEmbedTable *self, long long index, long value); - void (*set_double_by_index)(LuaCEmbedTable *self, long index, double value); - void (*set_bool_by_index)(LuaCEmbedTable *self, long index, bool value); - void (*set_evaluation_by_index)(LuaCEmbedTable *self, long index, const char *code, ...); - long (*get_listable_size)(LuaCEmbedTable *self); - LuaCEmbedTable *(*get_sub_table_by_index)(LuaCEmbedTable *self, long index); - - LuaCEmbedTable *(*new_sub_table_appending)(LuaCEmbedTable *self); - - void (*set_method)(LuaCEmbedTable *self , const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)); - void (*set_string_prop)(LuaCEmbedTable *self , const char *name, const char *value); - void (*set_long_prop)(LuaCEmbedTable *self , const char *name, long long value); - void (*set_double_prop)(LuaCEmbedTable *self , const char *name, double value); - void (*set_bool_prop)(LuaCEmbedTable *self , const char *name, bool value); - int (*get_type_prop)(LuaCEmbedTable *self, const char *name); - char* (*get_string_prop)(LuaCEmbedTable *self , const char *name); - long long (*get_long_prop)(LuaCEmbedTable *self , const char *name); - double (*get_double_prop)(LuaCEmbedTable *self , const char *name); - bool (*get_bool_prop)(LuaCEmbedTable *self , const char *name); - LuaCEmbedTable * (*new_anonymous_table)(LuaCEmbed *self); - void (*destroy_prop)(LuaCEmbedTable *self, const char *name); - - LuaCEmbedTable *(*get_sub_table_prop)(LuaCEmbedTable *self, const char *name); - LuaCEmbedTable *(*new_sub_table_prop)(LuaCEmbedTable *self, const char *name); - void (*set_sub_table_prop)(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table); - char *(*get_key_by_index)(LuaCEmbedTable *self, long index); - bool (*has_key)(LuaCEmbedTable *self,long index); - - long (*get_size)(LuaCEmbedTable *self); - int (*get_type_by_index)(LuaCEmbedTable *self, int index); - long long (*get_long_by_index)(LuaCEmbedTable *self, int index); - double (*get_double_by_index)(LuaCEmbedTable *self, int index); - char * (*get_string_by_index)(LuaCEmbedTable *self, int index); - bool (*get_bool_by_index)(LuaCEmbedTable *self, int index); - -}LuaCembedTableModule; - -LuaCembedTableModule newLuaCembedTableModule(); - - - - -typedef struct{ - LuaCEmbedTypeModule types; - LuaCEmbedResponseModule response; - LuaCembedArgsModule args; - LuaCEmbedGlobalModule globals; - LuaCembedTableModule tables; - void (*clear_errors)(LuaCEmbed *self); - LuaCEmbed * (*newLuaLib)(lua_State *state, bool public_functions); - void (*set_delete_function)(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)); - LuaCEmbed * (*newLuaEvaluation)(); - LuaCEmbed * (*newLuaEvaluation_with_custom_allocator)(); - int (*perform)(LuaCEmbed *self); - const char * (*convert_arg_code)(int arg_code); - void (*set_memory_limit)(LuaCEmbed *self, double limit); - - char * (*get_error_message)(LuaCEmbed *self); - bool (*has_errors)(LuaCEmbed *self); - void (*set_timeout)(LuaCEmbed *self,int seconds); - int (*evaluate)(LuaCEmbed *self, const char *code, ...); - char * (*get_string_evaluation)(LuaCEmbed *self,const char *code, ...); - int (*get_evaluation_type)(LuaCEmbed *self,const char *code,...); - long (*get_evaluation_size)(LuaCEmbed *self,const char *code,...); - long long (*get_evaluation_long)(LuaCEmbed *self,const char *code,...); - double (*get_evaluation_double)(LuaCEmbed *self,const char *code,...); - bool (*get_evaluation_bool)(LuaCEmbed *self, const char *code,...); - - void (*set_long_lib_prop)(LuaCEmbed *self,const char *name,long long value); - - void (*set_double_lib_prop)(LuaCEmbed *self,const char *name,double value); - void (*set_bool_lib_prop)(LuaCEmbed *self,const char *name,bool value); - void (*set_string_lib_prop)(LuaCEmbed *self,const char *name,const char * value); - void (*set_table_lib_prop)(LuaCEmbed *self,const char *name,LuaCEmbedTable *value); - - long long (*get_long_lib_prop)(LuaCEmbed *self,const char *name); - double (*get_double_lib_prop)(LuaCEmbed *self,const char *name); - bool (*get_bool_lib_prop)(LuaCEmbed *self,const char *name); - char * (*get_string_lib_prop)(LuaCEmbed *self,const char *name); - LuaCEmbedTable *(*get_table_lib_prop)(LuaCEmbed *self,const char *name); - - int (*evaluete_file)(LuaCEmbed *self, const char *file); - void (*add_callback)(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - void (*free)(LuaCEmbed *self); - -} LuaCEmbedNamespace; - -LuaCEmbedNamespace newLuaCEmbedNamespace(); - - - - - - - - - -LuaCEmbedResponse *private_LuaCEmbedReturn_raw(){ - LuaCEmbedResponse *self = (LuaCEmbedResponse*)malloc(sizeof(LuaCEmbedResponse)); - *self = (LuaCEmbedResponse){0}; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_bool(bool value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_BOOL_RESPONSE; - self->num_val = (double)value; - return self; -} - - -LuaCEmbedResponse * LuaCEmbed_send_str(const char *text){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = (long)strlen(text); - self->string_val = (char*)malloc(sizeof(char) * self->string_size +1); - memcpy(self->string_val,text,self->string_size); - self->string_val[self->string_size] = '\0'; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_raw_string(const char *text,long size){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = size; - self->string_val = (char*)malloc(sizeof(char) * self->string_size +1); - memcpy(self->string_val,text,self->string_size); - self->string_val[self->string_size] = '\0'; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_str_reference(const char *text){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = (long)strlen(text); - self->string_val = (char*)text; - self->its_string_ref = true; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_raw_string_reference(const char *text,long size){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = size; - self->string_val = (char*)text; - self->its_string_ref = true; - return self; -} - - - -LuaCEmbedResponse * LuaCEmbed_send_error(const char *format,...){ - - va_list args; - va_start(args,format); - char *error = private_LuaCembed_format_vaarg(format,args); - va_end(args); - - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_ERROR_RESPONSE; - self->string_val = error; - return self; -} - - -LuaCEmbedResponse * LuaCEmbed_send_multi_return(LuaCEmbedTable *table){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_MULTI_RESPONSE; - lua_getglobal(table->main_object->state,table->global_name); - lua_setglobal(table->main_object->state,PRIVATE_LUA_CEMBED_TABLE_RETURN); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_table(LuaCEmbedTable *table){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_TABLE_RESPONSE; - lua_getglobal(table->main_object->state,table->global_name); - lua_setglobal(table->main_object->state,PRIVATE_LUA_CEMBED_TABLE_RETURN); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_evaluation(const char *code){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_EVALUATION; - self->string_val = strdup(code); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_double(double value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE; - self->num_val = value; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_long(long value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_LONG_RESPONSE; - self->num_val = (double)value; - return self; -} - - - -void private_LuaCEmbedResponse_free(LuaCEmbedResponse *self){ - - if(self->string_val && self->its_string_ref == false){ - free(self->string_val); - } - free(self); -} - - - - - - -static void *private_LuaCembed_custom_allocator(void *ud, void *ptr, size_t osize, size_t nsize) { - int *used = (int *)ud; - - if (ptr == NULL) { - osize = 0; - } - - if (nsize == 0) { - free(ptr); - *used -= osize; /* subtract old size from used memory */ - return NULL; - } else { - long custom_limit = (long)(private_lua_cembed_memory_limit * PRIVATE_LUA_CEMBED_ONE_MB); - if (*used + (nsize - osize) > custom_limit) /* too much memory in use */ - return NULL; - ptr = realloc(ptr, nsize); - if (ptr) /* reallocation successful? */ - *used += (nsize - osize); - return ptr; - } -} - - - - -int private_LuaCemb_internal_free(lua_State *L){ - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(L, lua_upvalueindex(1)); - if(self->delete_function){ - self->delete_function(self); - } - LuaCEmbed_free(self); - return 0; -} -LuaCEmbed * newLuaCEmbedLib(lua_State *state,bool public_functions){ - LuaCEmbed *self = (LuaCEmbed*) malloc(sizeof (LuaCEmbed)); - *self = (LuaCEmbed){0}; - - self->state = state; - - self->lib_identifier = 0; - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_TOTAL_LIBS); - if(lua_type(self->state,-1) == LUA_CEMBED_NIL){ - self->lib_identifier = lua_tointeger(self->state,-1); - } - - self->lib_identifier +=1; - - self->main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - lua_pushinteger(self->state,self->lib_identifier); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_TOTAL_LIBS); - - - self->is_lib = true; - self->public_functions = public_functions; - self->global_tables = (void*)newprivateLuaCEmbedTableArray(); - - - UniversalGarbage *garbage = newUniversalGarbage(); - char *lib_meta_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_META_TABLE__,self->lib_identifier); - UniversalGarbage_add_simple(garbage,lib_meta_table); - //creating the metatable - luaL_newmetatable(self->state, lib_meta_table); - //seting the clojure key - lua_pushstring(self->state,PRIVATE_LUA_CEMBED_DEL_PREFIX); - //set self as first clojure argument - lua_pushlightuserdata(self->state,(void*)self); - lua_pushcclosure(self->state,private_LuaCemb_internal_free,1); - lua_settable(self->state, -3); - - - char *lib_main_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - UniversalGarbage_add_simple(garbage,lib_main_table); - //creating the global table to store the elements - lua_newtable(self->state); - lua_setglobal(self->state,lib_main_table); - luaL_setmetatable(self->state, lib_meta_table); - - UniversalGarbage_free(garbage); - return self; -} - -int LuaCembed_perform(LuaCEmbed *self){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - char *lib_main_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - lua_getglobal(self->state,lib_main_table); - free(lib_main_table); - return 1; -} - - - - -LuaCEmbed * newLuaCEmbedEvaluation(){ - LuaCEmbed *self = (LuaCEmbed*) malloc(sizeof (LuaCEmbed)); - *self = (LuaCEmbed){0}; - self->state = luaL_newstate(); - self->global_tables = (void*)newprivateLuaCEmbedTableArray(); - self->memory_limit = LUA_CEMBED_DEFAULT_MEMORY_LIMIT; - self->timeout = LUA_CEMBED_DEFAULT_TIMEOUT; - return self; -} - -LuaCEmbed * newLuaCEmbedEvaluation_with_custom_allocator(){ - LuaCEmbed *self = (LuaCEmbed*) malloc(sizeof (LuaCEmbed)); - *self = (LuaCEmbed){0}; - self->state = luaL_newstate(); - lua_setallocf(self->state, private_LuaCembed_custom_allocator, &self->used_memory); - self->global_tables = (void*)newprivateLuaCEmbedTableArray(); - self->memory_limit = LUA_CEMBED_DEFAULT_MEMORY_LIMIT; - self->timeout = LUA_CEMBED_DEFAULT_TIMEOUT; - return self; -} - -void LuaCEmbed_set_memory_limit(LuaCEmbed *self, double limit){ - self->memory_limit = limit; -} - -void LuaCembed_set_delete_function(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)){ - self->delete_function = delelte_function; -} - - - - -void LuaCEmbed_set_timeout(LuaCEmbed *self,int seconds){ - self->timeout = seconds; -} - -char * LuaCEmbed_get_error_message(LuaCEmbed *self){ - if(!self){ - return NULL; - } - - return self->error_msg; -} -void LuaCEmbed_clear_errors(LuaCEmbed *self){ - if(!self){ - return; - } - - if(self->error_msg){ - free(self->error_msg); - self->error_msg = NULL; - } -} -void * privateLuaCEmbed_get_current_table_array(LuaCEmbed *self){ - if(self->current_function){ - return self->func_tables; - } - return self->global_tables; -} -void privateLuaCEmbed_raise_error_not_jumping(LuaCEmbed *self, const char *error_msg, ...){ - - if(LuaCEmbed_has_errors(self)){ - return; - } - - va_list args; - va_start(args,error_msg); - self->error_msg = private_LuaCembed_format_vaarg(error_msg, args); - va_end(args); - -} - - - -bool LuaCEmbed_has_errors(LuaCEmbed *self){ - if(!self){ - return true; - } - - if(self->error_msg){ - return true; - } - - return false; -} - - - - - - -void privata_LuaCEmbed_increment_stack_(LuaCEmbed *self){ - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - int value = 0; - if(lua_type(self->state,-1) == LUA_CEMBED_NUMBER){ - value = lua_tonumber(self->state,-1); - } - int new_value = value+1; - lua_pushinteger(self->state,new_value); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve =new_value; -} - - -void privata_LuaCEmbed_decrement_stack(LuaCEmbed *self){ - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - int value = 0; - if(lua_type(self->state,-1) == LUA_CEMBED_NUMBER){ - value = lua_tointeger(self->state,-1); - } - if(value> 0){ - int new_value = value -1; - lua_pushinteger(self->state,new_value); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve = new_value; - } - -} - -void privateLuaCEmbd_get_field_protected(LuaCEmbed *self,const char *name){ - bool old_field_proection = self->field_protection; - self->field_protection = true; - lua_getfield(self->state,-1,name); - self->field_protection = old_field_proection; -} - -void LuaCEmbed_free(LuaCEmbed *self){ - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->global_tables); - if(!self->is_lib){ //se for do próprio lua, o lua cuidará de limpar - lua_close(self->state); // Fecha o estado Lua - } - if(self->error_msg){ - free(self->error_msg); - } - if(self->main_lib_table){ - free(self->main_lib_table); - } - free(self); -} - - - - - -int LuaCEmbed_ensure_arg_exist(LuaCEmbed *self, private_lua_cembed_incremented_arg index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(index > self->total_args){ - - privateLuaCEmbed_raise_error_not_jumping(self, PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,index,self->current_function); - return LUA_CEMBED_GENERIC_ERROR; - } - return LUA_CEMBED_OK; - -} - -int private_LuaCEmbed_ensure_top_stack_arg_type(LuaCEmbed *self, int index,int arg_type) { - PRIVATE_LUA_CEMBED_PROTECT_NUM - int type = lua_type(self->state, -1); - if (type != arg_type) { - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_ARG_WRONG_TYPE, - index + LUA_CEMBED_INDEX_DIF, - self->current_function, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(arg_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - - return LUA_CEMBED_OK; - -} - - - - -int privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(formatted_index > self->total_args){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,formatted_index,self->current_function); - return LUA_CEMBED_GENERIC_ERROR; - } - - - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - lua_getglobal(self->state,formated_arg); - int type = lua_type(self->state,-1); - if(type == LUA_CEMBED_NOT_FOUND || type == LUA_CEMBED_NIL){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,formatted_index,self->current_function); - free(formated_arg); - return LUA_CEMBED_GENERIC_ERROR; - } - - free(formated_arg); - return LUA_OK; -} - -int LuaCEmbed_get_total_args(LuaCEmbed *self){ - return self->total_args; -} - - - -int LuaCEmbed_get_arg_type(LuaCEmbed *self,int index){ - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(formatted_index > self->total_args){ - return LUA_CEMBED_NIL; - } - - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - lua_getglobal(self->state,formated_arg); - int type = lua_type(self->state, -1); - free(formated_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return type; -} - - -long long LuaCEmbed_get_long_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_NUMBER)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - - long long result = (long long)lua_tonumber(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - - -double LuaCEmbed_get_double_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_NUMBER)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - double result = lua_tonumber(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - -bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_BOOL)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - bool result = lua_toboolean(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - - -char * LuaCEmbed_get_str_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - PRIVATE_LUA_CEMBED_CLEAR_STACK - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_STRING)){ - return NULL; - } - char *result = (char*)lua_tostring(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} -char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,long *size, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - PRIVATE_LUA_CEMBED_CLEAR_STACK - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_STRING)){ - return NULL; - } - char *result = (char*)lua_tolstring(self->state,-1,(unsigned long*)size); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - -LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_TABLE)){ - return NULL; - } - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - LuaCEmbedTable *created = LuaCembed_get_global_table(self,formated_arg); - free(formated_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return created; - -} - -LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call, int total_returns){ - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - char *formatted_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - free(formatted_arg); - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_FUNCTION)){ - free(formatted_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - int total_args = private_lua_cEmbed_unpack(args_to_call,formatted_arg); - if(lua_pcall(self->state,total_args,total_returns,0)){ - - privateLuaCEmbed_raise_error_not_jumping(self, lua_tostring(self->state,-1)); - free(formatted_arg); - - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - - for(int i = 0; i < total_returns; i++){ - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - int position = (i +1) * -1; - lua_pushvalue(self->state,position); - lua_setglobal(self->state,formatted); - free(formatted); - } - - - - LuaCEmbedTable *result = LuaCembed_new_anonymous_table(self); - for(int i = 0; i < total_returns; i++){ - lua_getglobal(self->state,result->global_name); - lua_pushinteger(self->state,i+1); - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - lua_getglobal(self->state,formatted); - lua_settable(self->state,-3); - free(formatted); - } - free(formatted_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; - -} - - - - - -int private_LuaCembed_run_code_with_args(LuaCEmbed *self,int index,const char *code,va_list args){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(LuaCEmbed_ensure_arg_exist(self,formatted_index)){ - return LUA_CEMBED_GENERIC_ERROR; - } - - char *formated_expresion = private_LuaCembed_format_vaarg(code,args); - - char *buffer = private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - formated_expresion - ); - - if(LuaCEmbed_evaluate(self, buffer)){ - free(formated_expresion); - free(buffer); - return LUA_CEMBED_GENERIC_ERROR; - } - free(buffer); - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - - int type = lua_type(self->state,-1); - - if(type != LUA_CEMBED_FUNCTION){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_CODE_ITS_NOT_A_FUNCTION,formated_expresion); - free(formated_expresion); - return LUA_CEMBED_GENERIC_ERROR; - } - - free(formated_expresion); - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - privateLuaCEmbed_put_arg_on_top(self,index); - - if(lua_pcall(self->state,1,1,0)){ - const char *generated_error = lua_tostring(self->state,-1); - privateLuaCEmbed_raise_error_not_jumping(self, generated_error); - } - return LUA_CEMBED_OK; -} - -int privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,int index,int expected_type){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - int actual_type = lua_type(self->state,-1); - if(actual_type== expected_type){ - return LUA_CEMBED_OK; - } - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_RESULT_EVALUATION_ARG_WRONG_TYPE, - self->current_function, - index, - LuaCembed_convert_arg_code(actual_type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} -int LuaCEmbed_get_type_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - return lua_type(self->state,-1); -} -int LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - return LUA_CEMBED_OK; -} -long long LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (long long) lua_tonumber(self->state,-1); - -} - - -double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (double ) lua_tonumber(self->state,-1); - -} - -bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return false; - } - return lua_toboolean(self->state,-1); - -} - -char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return NULL; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); - -} - - - - - - - - - - - -LuaCEmbedTable * private_newLuaCembedTable(LuaCEmbed *main_embed, const char *format, ...){ - - LuaCEmbedTable *self = (LuaCEmbedTable*)malloc(sizeof (LuaCEmbedTable)); - *self = (LuaCEmbedTable){0}; - self->main_object =main_embed; - - va_list args; - va_start(args,format); - self->global_name = private_LuaCembed_format_vaarg(format,args); - va_end(args); - - self->sub_tables = (void*)newprivateLuaCEmbedTableArray(); - - return self; -} - - int private_lua_cEmbed_unpack(LuaCEmbedTable *self,const char * previews_function){ - - long size = LuaCEmbedTable_get_listable_size(self); - lua_settop(self->main_object->state, 0); - - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - int total = 0; - - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - - lua_pushvalue(self->main_object->state,-1); - char *formated = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->main_object->stack_leve,total); - - lua_setglobal(self->main_object->state,formated); - free(formated); - lua_pop(self->main_object->state,1); - total+=1; - } - if(previews_function){ - lua_getglobal(self->main_object->state,previews_function); - } - for(int i = 0; i < size; i++){ - char *formated = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->main_object->stack_leve,i); - lua_getglobal(self->main_object->state,formated); - free(formated); - } - - return (int)size; -} -void privateLuaCEmbedTable_free(LuaCEmbedTable *self){ - - free(self->global_name); - - if(self->prop_name){ - free(self->prop_name); - } - - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->sub_tables); - free(self); -} - - - - - - -long LuaCEmbedTable_get_full_size(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - - - lua_getglobal(self->main_object->state,self->global_name); - int index = lua_gettop(self->main_object->state); - long total = 0; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,index)){ - total+=1; - lua_pop(self->main_object->state,1); - } - - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return total; -} - -long LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - lua_getglobal(self->main_object->state,self->global_name); - return (long)lua_rawlen(self->main_object->state,-1); -} - - -long privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cembed_incremented_arg index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - if(index >= 0){ - return index; - } - - return LuaCEmbedTable_get_full_size(self) + index; -} - -int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - int type = lua_type(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return type; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_NOT_FOUND; -} -char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - - if(total == converted_index){ - if(lua_type(self->main_object->state,-2) != LUA_CEMBED_STRING ){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - char* result = (char*)lua_tostring(self->main_object->state,-2); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - - lua_pop(self->main_object->state,1); - total+=1; - - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} -bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - lua_settop(self->main_object->state,0); - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - bool has_key =lua_type(self->main_object->state,-2) == LUA_CEMBED_STRING; - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return has_key; - } - - lua_pop(self->main_object->state,1); - total+=1; - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return false; -} - -long long LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - lua_settop(self->main_object->state,0); - - private_lua_cembed_memory_limit = self->main_object->memory_limit; - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_NUMBER)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - long result = (long)lua_tonumber(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_NUMBER) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} - -double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_NUMBER)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - double result = (double )lua_tonumber(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_NUMBER) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} - -char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_STRING)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - char * result = (char*)lua_tostring(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_STRING) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} - -bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_BOOL)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - bool result = lua_toboolean(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - converted_index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_BOOL) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} - - -int LuaCEmbedTable_get_type_prop(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - private_lua_cembed_memory_limit = self->main_object->memory_limit; - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - return lua_type(self->main_object->state,-1); - -} - -char* LuaCembedTable_get_string_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_STRING)){ - return NULL; - } - - char *value = (char*)lua_tostring(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - - -long long LuaCembedTable_get_long_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - private_lua_cembed_memory_limit = self->main_object->memory_limit; - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - long long value = (long long)lua_tonumber(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - -double LuaCembedTable_get_double_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - double value = (double )lua_tonumber(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - -bool LuaCembedTable_get_bool_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - bool value = lua_toboolean(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - - - - - - -void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, long index, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_string_prop(self,possible_key,value); - return; - } - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushstring(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_long_by_index(LuaCEmbedTable *self, long long index, long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_long_prop(self,possible_key,value); - return; - } - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushnumber(self->main_object->state,(double )value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, long index, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_double_prop(self,possible_key,value); - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushnumber(self->main_object->state,(double )value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, long index, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_bool_prop(self,possible_key,value); - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushboolean(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - - -void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, long index, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - va_list args; - va_start(args,code); - char * buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate(self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - - - - - - -void LuaCEmbedTable_set_method(LuaCEmbedTable *self , const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - - bool is_meta = false; - - if(strlen(name) > 3){ - if(name[0] == '_' && name[1] == '_' ){ - is_meta = true; - } - } - lua_getglobal(self->main_object->state,self->global_name); - - if(is_meta){ - - - int found =lua_getmetatable(self->main_object->state,-1); - if(!found){ - - //equivalent of meta ={} ;setmetatable(table,meta) - lua_getglobal(self->main_object->state,self->global_name); - lua_newtable(self->main_object->state); - lua_setmetatable(self->main_object->state,-2); - - lua_getglobal(self->main_object->state,self->global_name); - lua_getmetatable(self->main_object->state,-1); - } - } - - - lua_pushstring(self->main_object->state,name); - //creating the clojure - - lua_pushboolean(self->main_object->state,true);//is a method - - lua_pushlightuserdata(self->main_object->state,(void*)self->main_object); //self - lua_pushstring(self->main_object->state,name);//calback name - lua_getglobal(self->main_object->state,self->global_name);//table - lua_pushlightuserdata(self->main_object->state,(void*)callback); - - //add these clojure to be handled by the callbacks - lua_pushcclosure(self->main_object->state,privateLuaCEmbed_main_callback_handler,5); - lua_settable(self->main_object->state,-3); - - if(is_meta){ - //equivalent of meta ={} ;setmetatable(table,meta) - lua_getglobal(self->main_object->state,self->global_name); - lua_getmetatable(self->main_object->state,-1); - lua_setmetatable(self->main_object->state,-2); - } - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_string_prop(LuaCEmbedTable *self , const char *name, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushstring(self->main_object->state,value); - - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_long_prop(LuaCEmbedTable *self , const char *name, long long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnumber(self->main_object->state,(double)value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_double_prop(LuaCEmbedTable *self , const char *name, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnumber(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_bool_prop(LuaCEmbedTable *self , const char *name, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushboolean(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_evaluation_prop(LuaCEmbedTable *self, const char *name, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - - va_list args; - va_start(args,code); - char *buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate(self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - - -void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, long formatted_index){ - - - lua_newtable(self->main_object->state); - lua_setglobal(self->main_object->state,PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - - lua_getglobal(self->main_object->state, self->global_name); - int table_index = lua_gettop(self->main_object->state); - int total = 1; - lua_pushnil(self->main_object->state); // Empilhando o primeiro par chave-valor - while (lua_next(self->main_object->state, table_index)) { - - if (total >= formatted_index) { - lua_getglobal(self->main_object->state, PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - lua_pushinteger(self->main_object->state, total + 1); - lua_pushvalue(self->main_object->state, -3); - lua_settable(self->main_object->state, -3); - lua_pop(self->main_object->state, 1); - } - lua_pop(self->main_object->state, 1); // Removendo o valor atual - total+=1; - } - - lua_getglobal(self->main_object->state, PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - table_index = lua_gettop(self->main_object->state); - lua_pushnil(self->main_object->state); - - while (lua_next(self->main_object->state, table_index)) { - lua_getglobal(self->main_object->state,self->global_name); - lua_pushvalue(self->main_object->state,-3); //table[index] = stage_area[index] - lua_pushvalue(self->main_object->state,-3); //table[index] = stage_area[index] - lua_settable(self->main_object->state,-3); - lua_pop(self->main_object->state, 2); // Removendo o valor atual - } - - lua_getglobal(self->main_object->state, "stage_arrea"); - lua_pushnil(self->main_object->state); -} - -void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, long index, const char *value) { - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushstring(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - - -void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, long index,bool value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushboolean(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, long long index,long value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushinteger(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, long index,double value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushnumber(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_table_at_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *table){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_getglobal(self->main_object->state,table->global_name); - lua_settable(self->main_object->state, -3); - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - - - - - -int privateLuaCEmbedTable_ensure_type_with_key(LuaCEmbedTable *self, const char *name, int expected_type){ - if(!self){ - return LUA_CEMBED_GENERIC_ERROR; - } - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - int type = lua_type(self->main_object->state,-1); - if(type == expected_type){ - return LUA_CEMBED_OK; - } - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_PROPETY, - name, - self->global_name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} - -int privateLuaCEmbedTable_ensure_type_with_index(LuaCEmbedTable *self, long index, int expected_type){ - if(!self){ - return LUA_CEMBED_GENERIC_ERROR; - } - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - int type = lua_type(self->main_object->state,-1); - if(type == expected_type){ - return LUA_CEMBED_OK; - } - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} - - - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_by_key(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - - //equivalent of: table.sub_table = {} - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_newtable(self->main_object->state); - lua_settable(self->main_object->state,-3); - - - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state, name); - lua_gettable(self->main_object->state, -2); - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_prop_name( - (privateLuaCEmbedTableArray *) self->sub_tables, - name - ); - - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->prop_name = strdup(name); - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; -} - - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_key(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_TABLE)){ - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_prop_name( - (privateLuaCEmbedTableArray *) self->sub_tables, - name - ); - - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->prop_name = strdup(name); - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; - -} - - - -void LuaCEmbedTable_set_sub_table_prop(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - //equivalent of table.name = sub_table; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_getglobal(self->main_object->state,sub_table->global_name); - lua_settable(self->main_object->state,-3); - - - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK -} - - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_appending(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - - - //equivalent of: full_sub_table_name = {} - long index= LuaCEmbedTable_get_listable_size(self) +1; - char *full_sub_table_name = private_LuaCembed_format("%s_%d", self->global_name, index); - lua_newtable(self->main_object->state); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - //equivalent of: table[index] = full_sub_table_name - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,index); - lua_getglobal(self->main_object->state,full_sub_table_name); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_internal_index( - (privateLuaCEmbedTableArray *) self->sub_tables, - index - ); - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->index = index; - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; -} - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, long index){ - - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_TABLE)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - - //equivalent of full_sub_table_name = table[index] - char *full_sub_table_name = private_LuaCembed_format("%s_%d", self->global_name, index); - lua_setglobal(self->main_object->state,full_sub_table_name); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_internal_index( - (privateLuaCEmbedTableArray *) self->sub_tables, - index - ); - - if(possible){ - free(full_sub_table_name); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->index = index; - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_TABLE) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} - -void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_sub_table_prop(self,possible_key,sub_table); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,formatted_index); - lua_getglobal(self->main_object->state,sub_table->global_name); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK -} - - - -void LuaCEmbedTable_append_table(LuaCEmbedTable *self, LuaCEmbedTable *table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_getglobal(self->main_object->state,table->global_name); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_string(LuaCEmbedTable *self, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushstring(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_long(LuaCEmbedTable *self, long long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushnumber(self->main_object->state,(double)value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_double(LuaCEmbedTable *self, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushnumber(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_bool(LuaCEmbedTable *self, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushboolean(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_evaluation(LuaCEmbedTable *self, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - va_list args; - va_start(args,code); - char *buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate( - self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); -} - - - -void LuaCembedTable_destroy_prop(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnil(self->main_object->state); - lua_settable(self->main_object->state,-3); -} -void LuaCEmbedTable_destroy_by_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - private_lua_cembed_memory_limit = self->main_object->memory_limit; - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(LuaCembedTable_has_key_at_index(self,index)){ - char *key = LuaCembedTable_get_key_by_index(self,index); - LuaCembedTable_destroy_prop(self,key); - return; - } - - lua_getglobal(self->main_object->state,self->global_name); - - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int table_index = lua_gettop(self->main_object->state); - int total = 0; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total >= converted_index){ - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)(total)); - lua_pushvalue(self->main_object->state,-3); - lua_settable(self->main_object->state,-3); - lua_pop(self->main_object->state,1); - - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,total); - lua_pushnil(self->main_object->state); - lua_settable(self->main_object->state,-3); - - - -} - - - - -privateLuaCEmbedTableArray *newprivateLuaCEmbedTableArray(){ - privateLuaCEmbedTableArray *self = (privateLuaCEmbedTableArray*) malloc(sizeof (privateLuaCEmbedTableArray)); - *self = (privateLuaCEmbedTableArray){0}; - self->tables = (LuaCEmbedTable**)malloc(0); - return self; -} - -void privateLuaCEmbedTableArray_append(privateLuaCEmbedTableArray *self,LuaCEmbedTable *element){ - - self->tables = (LuaCEmbedTable **)realloc( - self->tables, - (self->size+1)* sizeof (LuaCEmbedTable**) - ); - self->tables[self->size] = element; - self->size+=1; -} - - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_prop_name(privateLuaCEmbedTableArray *self, const char *name){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(current_table->prop_name){ - if(strcmp(current_table->prop_name,name) ==0){ - return current_table; - } - } - } - return NULL; -} - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_global_name(privateLuaCEmbedTableArray *self, const char *name){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(strcmp(current_table->global_name,name) ==0){ - return current_table; - } - } - return NULL; -} - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_internal_index(privateLuaCEmbedTableArray *self, long internal_index){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(current_table->index == internal_index){ - return current_table; - } - } - return NULL; -} - -void privateLuaCEmbedTableArray_free(privateLuaCEmbedTableArray *self){ - - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - privateLuaCEmbedTable_free(current_table); - } - - free(self->tables); - free(self); -} - - - - - - - - -int LuaCEmbed_ensure_global_type(LuaCEmbed *self, const char *name,int expected_type){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - private_lua_cembed_memory_limit = self->memory_limit; - - lua_getglobal(self->state,name); - int type = lua_type(self->state,-1); - - if(type != expected_type){ - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_GLOBAL_WRONG_TYPE, - name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - - return LUA_CEMBED_OK; - -} - - - -int LuaCEmbed_get_global_type(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - private_lua_cembed_memory_limit = self->memory_limit; - - lua_getglobal(self->state, name); - return lua_type(self->state,-1); -} - -long long LuaCEmbed_get_global_long(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - private_lua_cembed_memory_limit = self->memory_limit; - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return (long )lua_tonumber(self->state,-1); -} - -double LuaCEmbed_get_global_double(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - private_lua_cembed_memory_limit = self->memory_limit; - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return (double )lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_global_bool(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - private_lua_cembed_memory_limit = self->memory_limit; - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return lua_toboolean(self->state,-1); -} - -char * LuaCEmbed_get_global_raw_string(LuaCEmbed *self,const char *name,long *size){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - private_lua_cembed_memory_limit = self->memory_limit; - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - lua_getglobal(self->state, name); - return (char*)lua_tolstring(self->state,-1,(unsigned long*)size); -} - -char * LuaCEmbed_get_global_string(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - private_lua_cembed_memory_limit = self->memory_limit; - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - lua_getglobal(self->state, name); - return (char*)lua_tostring(self->state,-1); -} - -LuaCEmbedTable * LuaCembed_new_anonymous_table(LuaCEmbed *self){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - private_lua_cembed_memory_limit = self->memory_limit; - - - const char *format_raw = PRIVATE_LUA_CEMBED_ANONYMOUS_TABLE_; - if(self->current_function){ - format_raw =PRIVATE_LUA_CEMBED_ANONYMOUS_FUNC_TABLE_; - } - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - char *buffer= private_LuaCembed_format(format_raw, self->stack_leve, target->size); - LuaCEmbedTable *created_table =LuaCembed_new_global_table(self,buffer); - - free(buffer); - return created_table; -} - - - -LuaCEmbedTable * LuaCembed_get_global_table(LuaCEmbed *self, const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - private_lua_cembed_memory_limit = self->memory_limit; - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_TABLE)){ - return NULL; - } - - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,name); - if(possible){ - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s", name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} - -LuaCEmbedTable * LuaCembed_new_global_table(LuaCEmbed *self, const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - private_lua_cembed_memory_limit = self->memory_limit; - - lua_newtable(self->state); - lua_setglobal(self->state,name); - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,name); - if(possible){ - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s", name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} - -LuaCEmbedTable* LuaCEmbed_run_global_lambda(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns){ - - PRIVATE_LUA_CEMBED_PROTECT_NULL - private_lua_cembed_memory_limit = self->memory_limit; - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_FUNCTION)){ - return NULL; - } - - int total_args = private_lua_cEmbed_unpack(args_to_call,name); - if(lua_pcall(self->state,total_args,total_returns,0)){ - privateLuaCEmbed_raise_error_not_jumping(self, lua_tostring(self->state,-1)); - return NULL; - } - - for(int i = 0; i < total_returns; i++){ - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_, self->stack_leve, i); - int position = (i +1) * -1; - lua_pushvalue(self->state,position); - lua_setglobal(self->state,formatted); - free(formatted); - } - - LuaCEmbedTable *result = LuaCembed_new_anonymous_table(self); - for(int i = 0; i < total_returns; i++){ - lua_getglobal(self->state,result->global_name); - lua_pushinteger(self->state,i+1); - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - lua_getglobal(self->state,formatted); - lua_settable(self->state,-3); - free(formatted); - } - - return result; -} - - - - - -void LuaCEmbed_set_global_string(LuaCEmbed *self, const char *name, const char *value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - private_lua_cembed_memory_limit = self->memory_limit; - - lua_pushstring(self->state,value); - lua_setglobal(self->state,name); -} -void LuaCEmbed_set_global_raw_string(LuaCEmbed *self, const char *name, const char *value,long size){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - private_lua_cembed_memory_limit = self->memory_limit; - - lua_pushlstring(self->state,value,size); - lua_setglobal(self->state,name); -} - - -void LuaCEmbed_set_global_long(LuaCEmbed *self, const char *name, long long value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - private_lua_cembed_memory_limit = self->memory_limit; - - lua_pushnumber(self->state,(double )value); - lua_setglobal(self->state,name); -} - -void LuaCEmbed_set_global_double(LuaCEmbed *self, const char *name, double value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - private_lua_cembed_memory_limit = self->memory_limit; - - lua_pushnumber(self->state,(double )value); - lua_setglobal(self->state,name); -} - -void LuaCEmbed_set_global_bool(LuaCEmbed *self, const char *name, bool value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - private_lua_cembed_memory_limit = self->memory_limit; - lua_pushboolean(self->state,value); - lua_setglobal(self->state,name); -} - - -void LuaCEmbed_set_global_table(LuaCEmbed *self, const char *name, LuaCEmbedTable *table){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - private_lua_cembed_memory_limit = self->memory_limit; - - lua_getglobal(self->state,table->global_name); - lua_setglobal(self->state,name); -} - - - - -int privateLuaCEmbed_main_callback_handler(lua_State *L){ - - bool is_a_method = lua_toboolean(L, lua_upvalueindex(1)); - bool is_a_function = !is_a_method; - LuaCEmbedResponse *possible_return = NULL; - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(L,lua_upvalueindex(2)); - int old_total_args = self->total_args; - self->total_args = lua_gettop(self->state); - privata_LuaCEmbed_increment_stack_(self); - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve = (int)lua_tonumber(self->state,-1); - - for(int i = 0; i < self->total_args; i++){ - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,i); - lua_pushvalue(L,i+1); - lua_setglobal(L,formated_arg); - free(formated_arg); - } - - const char *func_name = lua_tostring(L,lua_upvalueindex(3)); - self->current_function = func_name; - void *old_funct_tables = self->func_tables; - self->func_tables = (void*)newprivateLuaCEmbedTableArray(); - if(is_a_method){ - LuaCEmbedResponse *(*method_callback)(LuaCEmbedTable *tb, LuaCEmbed *self); - - //equivalent of PRIVATE_LUA_CEMBED_SELFNAME = index[4] - lua_pushvalue(L, lua_upvalueindex(4)); - lua_setglobal(L,PRIVATE_LUA_CEMBED_SELFNAME); - - LuaCEmbedTable *table = private_newLuaCembedTable(self, PRIVATE_LUA_CEMBED_SELFNAME); - method_callback = (LuaCEmbedResponse *(*)(LuaCEmbedTable *tb, LuaCEmbed *self))lua_touserdata(L, lua_upvalueindex(5)); - possible_return = method_callback(table,self); - privateLuaCEmbedTable_free(table); - } - - if(is_a_function){ - LuaCEmbedResponse *(*function_callback)(LuaCEmbed *self); - function_callback = (LuaCEmbedResponse *(*)(LuaCEmbed *self))lua_touserdata(L, lua_upvalueindex(4)); - possible_return = function_callback(self); - } - - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->func_tables); - self->func_tables = old_funct_tables; - self->total_args = old_total_args; - privata_LuaCEmbed_decrement_stack(self); - PRIVATE_LUA_CEMBED_CLEAR_STACK - self->current_function = NULL; - - if(possible_return==NULL){ - return PRIVATE_LUACEMBED_NO_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_ERROR_RESPONSE){ - - if(self->field_protection){ - private_LuaCEmbedResponse_free(possible_return); - if(self->error_msg){ - free(self->error_msg); - self->error_msg = NULL; - } - - return PRIVATE_LUACEMBED_NO_RETURN; - } - - lua_pushstring(L, possible_return->string_val); - privateLuaCEmbed_raise_error_not_jumping(self,possible_return->string_val); - private_LuaCEmbedResponse_free(possible_return); - lua_error(L); - return PRIVATE_LUACEMBED_NO_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_LONG_RESPONSE){ - lua_pushinteger(L, (int)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_BOOL_RESPONSE){ - lua_pushboolean(L, (bool)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE){ - lua_pushnumber(L, possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_STRING_RESPONSE){ - lua_pushlstring(self->state,possible_return->string_val,possible_return->string_size); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE){ - lua_pushboolean(L, (bool)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_TABLE_RESPONSE){ - lua_getglobal(self->state, PRIVATE_LUA_CEMBED_TABLE_RETURN); - lua_pushvalue(self->state,-1); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_MULTI_RESPONSE){ - LuaCEmbedTable *table = private_newLuaCembedTable(self, PRIVATE_LUA_CEMBED_TABLE_RETURN); - int size =private_lua_cEmbed_unpack(table,NULL); - private_LuaCEmbedResponse_free(possible_return); - privateLuaCEmbedTable_free(table); - - return size; - } - - - if(possible_return->type == PRIVATE_LUA_CEMBED_EVALUATION){ - char *formated_function =private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - possible_return->string_val - ); - - int error_code = LuaCEmbed_evaluate(self, formated_function); - free(formated_function); - - if(error_code){ - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - } - - lua_getglobal(self->state, PRIVATE_LUA_CEMBED_EVALUATION_NAME); - int v_type = lua_type(self->state,-1); - if(v_type == LUA_CEMBED_FUNCTION){ - const int TOTAL_ARGS =0; - const int TOTAL_RETURNS =1; - if(lua_pcall(self->state,TOTAL_ARGS,TOTAL_RETURNS,0)){ - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - } - } - - lua_pushvalue(self->state,-1); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - - } - - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - -} - - -void private_LuaCEmbed_add_lib_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ){ - - char *main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - //get the table - lua_getglobal(self->state,main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,callback_name); - - //creating the clojure - - //creating the clojure - lua_pushboolean(self->state,false);//is a method - lua_pushlightuserdata(self->state,(void*)self); //self - lua_pushstring(self->state,callback_name);//calback name - lua_pushlightuserdata(self->state,(void*)callback);//calback - - lua_pushcclosure(self->state,privateLuaCEmbed_main_callback_handler,4); - - - lua_settable(self->state,-3); - if(self->public_functions){ - //it points the function to a global function - //like: callback = private_lua_c_embed_main_lib_table.callback - lua_getglobal(self->state, main_lib_table); - lua_getfield(self->state,-1,callback_name); - lua_setglobal(self->state, callback_name); - } - - lua_settop(self->state, 0); - free(main_lib_table); - -} - -void private_LuaCEmbed_add_evaluation_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - private_lua_cembed_memory_limit = self->memory_limit; - - //creating the clojure - lua_pushboolean(self->state,false);//is a method - lua_pushlightuserdata(self->state,(void*)self); //self - lua_pushstring(self->state,callback_name);//calback name - lua_pushlightuserdata(self->state,(void*)callback);//calback - - lua_pushcclosure(self->state,privateLuaCEmbed_main_callback_handler,4); - lua_setglobal(self->state, callback_name); - lua_settop(self->state, 0); - -} - - -void LuaCEmbed_add_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - private_lua_cembed_memory_limit = self->memory_limit; - - if(self->is_lib){ - private_LuaCEmbed_add_lib_callback(self,callback_name,callback); - return; - } - private_LuaCEmbed_add_evaluation_callback(self,callback_name,callback); - -} - - - - -#ifdef _WIN32 -VOID CALLBACK TimerHandler(HWND hwnd, UINT uMsg, UINT_PTR idEvent, DWORD dwTime) { - - privateLuaCEmbed_raise_error_not_jumping(global_current_lua_embed_object, PRIVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_pushstring(global_current_lua_embed_object->state,PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_error(global_current_lua_embed_object->state); -} - -#else - -void private_LuaCembed_handle_timeout(int signum) { - - privateLuaCEmbed_raise_error_not_jumping(global_current_lua_embed_object, PRIVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_pushstring(global_current_lua_embed_object->state,PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_error(global_current_lua_embed_object->state); -} - -#endif - - - -int privateLuaCEmbed_start_func_evaluation(lua_State *state){ - - int evaluation_type = lua_tointeger(state, lua_upvalueindex(1)); - char *text_value = (char*)lua_touserdata(state,lua_upvalueindex(2)); - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(state,lua_upvalueindex(3)); - global_current_lua_embed_object = self; - #ifdef _WIN32 - if (self->timeout > 0) { - SetTimer(NULL, 0, self->timeout * 1000, TimerHandler); - } - #else - if (self->timeout > 0) { - signal(SIGALRM, private_LuaCembed_handle_timeout); - alarm(self->timeout); - } - #endif - - int error = 0; - if(evaluation_type == PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE){ - error =luaL_dofile(self->state,text_value); - } - if(evaluation_type == PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE){ - error = luaL_dostring(self->state,text_value); - } - if(error){ - privateLuaCEmbed_raise_error_not_jumping(self,lua_tostring(self->state,-1)); - } - lua_pushinteger(self->state,error); - - return 1; - -} -int LuaCEmbed_evaluate(LuaCEmbed *self, const char *code, ...){ - - PRIVATE_LUA_CEMBED_PROTECT_NUM - private_lua_cembed_memory_limit = self->memory_limit; - - va_list args; - va_start(args,code); - char * formated_expresion = private_LuaCembed_format_vaarg(code,args); - va_end(args); - lua_pushinteger(self->state,PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE); - lua_pushlightuserdata(self->state,(void*)formated_expresion); //code - lua_pushlightuserdata(self->state,(void*)self); //code - lua_pushcclosure(self->state,privateLuaCEmbed_start_func_evaluation,3); - lua_pcall(self->state,0,1,0); - int error = lua_tointeger(self->state,-1); - free(formated_expresion); - - return error; - -} - -int LuaCEmbed_evaluete_file(LuaCEmbed *self, const char *file){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - private_lua_cembed_memory_limit = self->memory_limit; - - lua_pushinteger(self->state,PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE); - lua_pushlightuserdata(self->state,(void*)file); //code - lua_pushlightuserdata(self->state,(void*)self); //code - lua_pushcclosure(self->state,privateLuaCEmbed_start_func_evaluation,3); - lua_pcall(self->state,0,1,0); - int error = lua_tointeger(self->state,-1); - return error; - -} - -int private_LuaCEmbed_evaluate_puting_on_top_of_stack(LuaCEmbed *self,const char *code, va_list args){ - - char * formated_expresion =private_LuaCembed_format_vaarg(code,args); - - char * buffer =private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - formated_expresion - ); - - if(LuaCEmbed_evaluate(self, buffer)){ - free(formated_expresion); - free(buffer); - return LUA_CEMBED_GENERIC_ERROR; - } - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - - int type = lua_type(self->state,-1); - - if(type == LUA_CEMBED_FUNCTION){ - if(lua_pcall(self->state,0,1,0)){ - const char *generated_error = lua_tostring(self->state,-1); - privateLuaCEmbed_raise_error_not_jumping(self, generated_error); - } - } - free(formated_expresion); - free(buffer); - return LUA_CEMBED_OK; - -} -int private_LuaCEmbed_ensure_evaluation_type(LuaCEmbed *self,int type){ - - int actual_type = lua_type(self->state,-1); - if(actual_type== type){ - return LUA_CEMBED_OK; - } - - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_RESULT_EVALUATION_WRONG_TYPE, - LuaCembed_convert_arg_code(actual_type), - LuaCembed_convert_arg_code(type) - ); - - return LUA_CEMBED_GENERIC_ERROR; -} - -char * LuaCEmbed_get_evaluation_string(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - private_lua_cembed_memory_limit = self->memory_limit; - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return NULL; - } - - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_STRING)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); - -} - - -int LuaCEmbed_get_evaluation_type(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - private_lua_cembed_memory_limit = self->memory_limit; - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - - return lua_type(self->state,-1); -} - - -long LuaCEmbed_get_evaluation_table_size(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - private_lua_cembed_memory_limit = self->memory_limit; - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_TABLE)){ - return LUA_CEMBED_GENERIC_ERROR; - } - /* - long size = 0; - lua_pushnil(self->state); // Coloca a chave nula na pilha - while (lua_next(self->state, -1) != 0) { // Enquanto houver elementos na tabela - size+=1; - lua_pop(self->state, 1); - } - */ - - return (long)lua_rawlen(self->state,-1); -} - - - -long long LuaCEmbed_get_evaluation_long(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - private_lua_cembed_memory_limit = self->memory_limit; - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (long)lua_tonumber(self->state,-1); - -} - -double LuaCEmbed_get_evaluation_double(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - private_lua_cembed_memory_limit = self->memory_limit; - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (double)lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_evaluation_bool(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - private_lua_cembed_memory_limit = self->memory_limit; - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (bool)lua_toboolean(self->state,-1); -} - - - - - -void LuaCEmbed_set_long_lib_prop(LuaCEmbed *self,const char *name,long long value){ - char *main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - lua_getglobal(self->state,main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushinteger(self->state,value); - lua_settable(self->state,-3); - free(main_lib_table); -} - -void LuaCEmbed_set_double_lib_prop(LuaCEmbed *self,const char *name,double value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushnumber(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_bool_lib_prop(LuaCEmbed *self,const char *name,bool value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushboolean(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_string_lib_prop(LuaCEmbed *self,const char *name,const char * value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushstring(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_table_lib_prop(LuaCEmbed *self,const char *name,LuaCEmbedTable *value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - lua_pushstring(self->state,name); - lua_getglobal(self->state,value->global_name); - lua_settable(self->state,-3); - -} - -int private_LuaCEmbed_ensure_lib_prop_type(LuaCEmbed *self,const char *name,int expected_type){ - int type = lua_type(self->state,-1); - if(type!= expected_type){ - privateLuaCEmbed_raise_error_not_jumping( - self, - PRIVATE_LUA_CEMBED_LIB_PROP_WRONG_TYPE, - name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - return LUA_CEMBED_OK; -} - -long long LuaCEmbed_get_long_lib_prop(LuaCEmbed *self,const char *name){ - lua_getglobal(self->state,self->main_lib_table); - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_tointeger(self->state,-1); - -} - -double LuaCEmbed_get_double_lib_prop(LuaCEmbed *self,const char *name){ - - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_bool_lib_prop(LuaCEmbed *self,const char *name){ - - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_toboolean(self->state,-1); -} - -char * LuaCEmbed_get_string_lib_prop(LuaCEmbed *self,const char *name){ - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); -} - -LuaCEmbedTable *LuaCEmbed_get_table_lib_prop(LuaCEmbed *self,const char *name){ -; - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_TABLE)){ - return NULL; - } - - char *global_sub_table_name = private_LuaCembed_format( - PRIVATE_LUA_CEMBED_MAIN_LIB_SUB_TABLE, - self->lib_identifier, - name - ); - lua_setglobal(self->state,global_sub_table_name); - - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,global_sub_table_name); - if(possible){ - free(global_sub_table_name); - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s",global_sub_table_name); - free(global_sub_table_name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} - - - - - -const char * LuaCembed_convert_arg_code(int arg_code){ - if(arg_code == LUA_CEMBED_NOT_FOUND){ - return PRIVATE_LUA_CEMBED_NOT_FOUND_STRING; - } - - if(arg_code == LUA_CEMBED_STRING){ - return PRIVATE_LUA_CEMBED_STRING_STRING; - - } - if(arg_code == LUA_CEMBED_NUMBER){ - return PRIVATE_LUA_CEMBED_NUMBER_STRING; - } - if(arg_code == LUA_CEMBED_BOOL){ - return PRIVATE_LUA_CEMBED_BOOL_STRING; - } - if(arg_code == LUA_CEMBED_NIL){ - return PRIVATE_LUA_CEMBED_NIL_STRING; - } - if(arg_code == LUA_CEMBED_TABLE){ - return PRIVATE_LUA_CEMBED_TABLE_STRING; - } - if(arg_code == LUA_CEMBED_FUNCTION){ - return PRIVATE_LUA_CEMBED_FUNCTION_STRING; - } - - return PRIVATE_LUA_CEMBED_UNKNOW_STRING; -} - -char * private_LuaCembed_format_vaarg(const char *expresion, va_list args){ - - va_list args_copy; - va_copy(args_copy, args); - long required_size = vsnprintf(NULL, 0,expresion,args_copy); - va_end(args_copy); - char *buffer = (char*)malloc(sizeof(char) * required_size + 2); - vsnprintf(buffer,sizeof (char) * required_size+1,expresion,args); - return buffer; -} -char * private_LuaCembed_format(const char *expresion, ...){ - va_list args; - va_start(args,expresion); - char *result = private_LuaCembed_format_vaarg(expresion,args); - va_end(args); - return result; -} - - - - -LuaCEmbedTypeModule newLuaCEmbedTypeModule(){ - LuaCEmbedTypeModule self = {0}; - self.NOT_FOUND = LUA_CEMBED_NOT_FOUND; - self.STRING = LUA_CEMBED_STRING; - self.NUMBER = LUA_CEMBED_NUMBER; - self.BOOL = LUA_CEMBED_BOOL; - self.NILL = LUA_CEMBED_NIL; - self.TABLE = LUA_CEMBED_TABLE; - self.FUNCTION = LUA_CEMBED_FUNCTION; - return self; -} - - - -LuaCEmbedResponseModule newLuaCEmbedResponseModule(){ - LuaCEmbedResponseModule self = {0}; - self.send_multi_return = LuaCEmbed_send_multi_return; - self.send_str = LuaCEmbed_send_str; - self.send_str_reference = LuaCEmbed_send_str_reference; - self.send_raw_string = LuaCEmbed_send_raw_string; - self.send_raw_string_reference = LuaCEmbed_send_raw_string_reference; - self.send_bool = LuaCEmbed_send_bool; - self.send_double = LuaCEmbed_send_double; - self.send_evaluation_function = LuaCEmbed_send_evaluation; - self.send_long = LuaCEmbed_send_long; - self.send_table = LuaCEmbed_send_table; - self.send_error = LuaCEmbed_send_error; - return self; -} - - - - -LuaCEmbedGlobalModule newLuaCEmbedGlobalModule(){ - LuaCEmbedGlobalModule self = {0}; - self.ensure_type = LuaCEmbed_ensure_global_type; - self.get_double = LuaCEmbed_get_global_double; - self.get_string = LuaCEmbed_get_global_string; - self.get_long = LuaCEmbed_get_global_long; - self.get_raw_string = LuaCEmbed_get_global_raw_string; - self.set_raw_string = LuaCEmbed_set_global_raw_string; - self.get_bool = LuaCEmbed_get_global_bool; - self.get_type = LuaCEmbed_get_global_type; - self.run_global_lambda = LuaCEmbed_run_global_lambda; - self.set_table = LuaCEmbed_set_global_table; - self.set_string = LuaCEmbed_set_global_string; - self.set_bool = LuaCEmbed_set_global_bool; - self.set_double = LuaCEmbed_set_global_double; - self.set_long = LuaCEmbed_set_global_long; - self.new_table = LuaCembed_new_global_table; - self.get_table = LuaCembed_get_global_table; - - return self; -} - - - -LuaCembedArgsModule newLuaCembedArgsModule(){ - LuaCembedArgsModule self = {0}; - self.get_bool = LuaCEmbed_get_bool_arg; - self.get_long = LuaCEmbed_get_long_arg; - self.get_double = LuaCEmbed_get_double_arg; - self.get_str = LuaCEmbed_get_str_arg; - self.get_raw_str = LuaCEmbed_get_raw_str_arg; - self.get_type = LuaCEmbed_get_arg_type; - self.get_table = LuaCEmbed_get_arg_table; - self.size = LuaCEmbed_get_total_args; - self.get_type_clojure_evalation = LuaCEmbed_get_type_clojure_evalation; - self.generate_arg_clojure_evalation = LuaCEmbed_generate_arg_clojure_evalation; - self.get_bool_arg_clojure_evalation = LuaCEmbed_get_bool_arg_clojure_evalation; - self.get_long_arg_clojure_evalation = LuaCEmbed_get_long_arg_clojure_evalation; - self.get_double_arg_clojure_evalation = LuaCEmbed_get_double_arg_clojure_evalation; - self.get_string_arg_clojure_evalation = LuaCEmbed_get_string_arg_clojure_evalation; - self.run_lambda = LuaCEmbed_run_args_lambda; - return self; -} - - - -LuaCembedTableModule newLuaCembedTableModule(){ - LuaCembedTableModule self ={0}; - - self.append_string = LuaCEmbedTable_append_string; - self.append_bool = LuaCEmbedTable_append_bool; - self.append_double = LuaCEmbedTable_append_double; - self.append_long = LuaCEmbedTable_append_long; - self.append_table = LuaCEmbedTable_append_table; - self.append_evaluation = LuaCEmbedTable_append_evaluation; - - self.insert_string_at_index = LuaCEmbedTable_insert_string_at_index; - self.insert_double_at_index = LuaCEmbedTable_insert_double_at_index; - self.insert_long_at_index = LuaCEmbedTable_insert_long_at_index; - self.insert_table_at_index = LuaCEmbedTable_insert_table_at_index; - - self.set_evaluation_prop = LuaCEmbedTable_set_evaluation_prop; - self.set_method = LuaCEmbedTable_set_method; - self.set_method = LuaCEmbedTable_set_method; - self.set_bool_prop = LuaCEmbedTable_set_bool_prop; - self.set_double_prop = LuaCEmbedTable_set_double_prop; - self.set_long_prop = LuaCEmbedTable_set_long_prop; - self.set_string_prop = LuaCEmbedTable_set_string_prop; - - self.get_sub_table_prop = LuaCEmbedTable_get_sub_table_by_key; - self.new_sub_table_prop = LuaCEmbedTable_new_sub_table_by_key; - self.set_sub_table_prop = LuaCEmbedTable_set_sub_table_prop; - self.new_anonymous_table = LuaCembed_new_anonymous_table; - - self.set_sub_table_by_index = LuaCEmbedTable_set_sub_table_by_index; - self.get_bool_prop = LuaCembedTable_get_bool_prop; - self.get_double_prop = LuaCembedTable_get_double_prop; - self.get_long_prop = LuaCembedTable_get_long_prop; - self.get_string_prop = LuaCembedTable_get_string_prop; - self.get_type_prop = LuaCEmbedTable_get_type_prop; - self.destroy_prop = LuaCembedTable_destroy_prop; - - self.set_long_by_index = LuaCEmbedTable_set_long_by_index; - self.set_bool_by_index= LuaCEmbedTable_set_bool_by_index; - self.set_double_by_index =LuaCEmbedTable_set_double_by_index; - self.set_string_by_index = LuaCEmbedTable_set_string_by_index; - self.set_evaluation_by_index = LuaCEmbedTable_set_evaluation_by_index; - - self.get_listable_size = LuaCEmbedTable_get_listable_size; - - self.new_sub_table_appending = LuaCEmbedTable_new_sub_table_appending; - self.has_key = LuaCembedTable_has_key_at_index; - self.get_key_by_index = LuaCembedTable_get_key_by_index; - self.get_size = LuaCEmbedTable_get_full_size; - self.get_type_by_index = LuaCEmbedTable_get_type_by_index; - self.get_long_by_index = LuaCEmbedTable_get_long_by_index; - self.get_double_by_index = LuaCEmbedTable_get_double_by_index; - self.get_bool_by_index = LuaCEmbedTable_get_bool_by_index; - self.get_string_by_index= LuaCEmbedTable_get_string_by_index; - self.get_sub_table_by_index = LuaCEmbedTable_get_sub_table_by_index; - return self; -} - - - - -LuaCEmbedNamespace newLuaCEmbedNamespace(){ - LuaCEmbedNamespace self = {0}; - self.newLuaLib = newLuaCEmbedLib; - self.newLuaEvaluation = newLuaCEmbedEvaluation; - self.newLuaEvaluation_with_custom_allocator = newLuaCEmbedEvaluation_with_custom_allocator; - self.set_delete_function = LuaCembed_set_delete_function; - self.perform = LuaCembed_perform; - self.set_memory_limit = LuaCEmbed_set_memory_limit; - self.clear_errors = LuaCEmbed_clear_errors; - self.convert_arg_code = LuaCembed_convert_arg_code; - self.tables = newLuaCembedTableModule(); - self.args = newLuaCembedArgsModule(); - self.types = newLuaCEmbedTypeModule(); - self.globals = newLuaCEmbedGlobalModule(); - self.response = newLuaCEmbedResponseModule(); - self.get_error_message = LuaCEmbed_get_error_message; - self.has_errors = LuaCEmbed_has_errors; - self.set_timeout = LuaCEmbed_set_timeout; - self.evaluate = LuaCEmbed_evaluate; - self.get_string_evaluation = LuaCEmbed_get_evaluation_string; - self.get_evaluation_type = LuaCEmbed_get_evaluation_type; - self.get_evaluation_size = LuaCEmbed_get_evaluation_table_size; - self.get_evaluation_long = LuaCEmbed_get_evaluation_long; - self.get_evaluation_double = LuaCEmbed_get_evaluation_double; - self.get_evaluation_bool = LuaCEmbed_get_evaluation_bool; - self.evaluete_file = LuaCEmbed_evaluete_file; - self.add_callback = LuaCEmbed_add_callback; - - self.set_bool_lib_prop = LuaCEmbed_set_bool_lib_prop; - self.set_long_lib_prop = LuaCEmbed_set_long_lib_prop; - self.set_double_lib_prop = LuaCEmbed_set_double_lib_prop; - self.set_string_lib_prop = LuaCEmbed_set_string_lib_prop; - self.set_table_lib_prop = LuaCEmbed_set_table_lib_prop; - self.get_long_lib_prop = LuaCEmbed_get_long_lib_prop; - self.get_double_lib_prop = LuaCEmbed_get_double_lib_prop; - self.get_bool_lib_prop = LuaCEmbed_get_bool_lib_prop; - self.get_string_lib_prop = LuaCEmbed_get_string_lib_prop; - self.get_table_lib_prop = LuaCEmbed_get_table_lib_prop; - - self.free = LuaCEmbed_free; - return self; -} - - - -#define LUACEMBED_H -#endif diff --git a/build/c/dependencies/luaDoTheWorld/dependencies/UniversalGarbage.h b/build/c/dependencies/luaDoTheWorld/dependencies/UniversalGarbage.h deleted file mode 100644 index fab89a8..0000000 --- a/build/c/dependencies/luaDoTheWorld/dependencies/UniversalGarbage.h +++ /dev/null @@ -1,320 +0,0 @@ - - -#ifndef UNIVERSAL_GARBAGE_H - - -#include -#include -#include -#include - - - - - -#define UniversalGarbage_create_empty_struct(name,element_type) \ -(element_type*)malloc(sizeof(element_type)); \ -*name = (element_type){0}; - - -#define UniversalGarbage_cast(value) ((void**)&value) - - -#define UniversalGarbage_add(garbage,deallocator_callback,value) \ - rawUniversalGarbage_add(garbage,(void*)deallocator_callback,UniversalGarbage_cast(value)) - -#define UniversalGarbage_add_simple(garbage,value) \ - UniversalGarbage_add(garbage,free,value) - - -#define UniversalGarbage_add_return(garbage,deallocator_callback,value) \ - UniversalGarbage_add(garbage->return_values,deallocator_callback,value) - - -#define UniversalGarbage_add_simple_return(garbage,value) \ - UniversalGarbage_add_simple(garbage->return_values,value) - - - -#define UniversalGarbage_remove(garbage,value) \ - rawUniversalGarbage_remove(garbage,UniversalGarbage_cast(value)); - - -#define UniversalGarbage_disconnect(garbage,value) \ - rawUniversalGarbage_disconnect(garbage,UniversalGarbage_cast(value)); - - - - -#define UniversalGarbage_reallocate(garbage,value) \ - rawUniversalGarbage_reallocate(garbage,UniversalGarbage_cast(value)) - - -#define UniversalGarbage_resset(garbage,value) \ - rawUniversalGarbage_resset(garbage,UniversalGarbage_cast(value)) - - - - - - -typedef struct privateUniversalGarbageElement{ - void **pointer; - void (*deallocator_callback)(void *element); - void *pointed_value; -}privateUniversalGarbageElement; - -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self); - - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self); - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer); - - - -typedef struct UniversalGarbage{ - - struct UniversalGarbage *return_values; - privateUniversalGarbageElement **elements; - int elements_size; - bool is_the_root; - -}UniversalGarbage; - -UniversalGarbage * newUniversalGarbage(); - -UniversalGarbage * private_new_MainUniversalGarbage(); - - - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer); - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self); - -void UniversalGarbage_free_including_return(UniversalGarbage *self); - -void UniversalGarbage_free(UniversalGarbage *self); - - - - - - - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer){ - - privateUniversalGarbageElement * self = UniversalGarbage_create_empty_struct( - self, - privateUniversalGarbageElement - ); - self->pointer = pointer; - self->deallocator_callback = dealocator_callback; - self->pointed_value = *pointer; - return self; -} -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self){ - if(self->pointed_value){ - self->deallocator_callback(self->pointed_value); - self->pointed_value = NULL; - } -} - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self){ - private_UniversalGarbageSimpleElement_free_pointed_value(self); - free(self); -} - - -UniversalGarbage * private_new_MainUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->is_the_root = false; - return self; -} - -UniversalGarbage * newUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->is_the_root = true; - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->return_values =private_new_MainUniversalGarbage(); - - return self; -} - - - - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - - if(rawUniversalGarbage_reallocate(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - - privateUniversalGarbageElement *current = self->elements[i]; - bool reallocate = current->pointer == pointer; - - if(reallocate){ - current->pointed_value = *pointer; - return true; - } - } - return false; -} - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - if(rawUniversalGarbage_resset(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - bool resset = current->pointer == pointer; - if(resset){ - private_UniversalGarbageSimpleElement_free_pointed_value(current); - current->pointed_value = *pointer; - return true; - } - } - return false; - -} -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_remove(self->return_values,pointer)){ - *pointer = NULL; - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - private_UniversalGarbageSimpleElement_free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - - } - *pointer = NULL; - return true; - } - } - return false; -} -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_disconnect(self->return_values,pointer)){ - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - } - return true; - } - } - return false; - - - -} -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer){ - - if(!pointer){ - return false; - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - return false; - } - } - - self->elements = (privateUniversalGarbageElement**)realloc( - self->elements, - (self->elements_size + 1) * sizeof(privateUniversalGarbageElement*) - ); - void (*dealocator_callback)(void *element); -#ifdef __cplusplus - dealocator_callback =reinterpret_cast(release_callback); -#else - dealocator_callback = (void*)(void*)release_callback; - -#endif - - - - self->elements[self->elements_size] = private_newUniversalGarbageSimpleElement(dealocator_callback, pointer); - self->elements_size+=1; - return true; -} - - - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self){ - for(int i = 0; i < self->elements_size; i++){ - private_UniversalGarbageSimpleElement_free(self->elements[i]); - } - free(self->elements); -} - -void UniversalGarbage_free_including_return(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - if(self->is_the_root){ - UniversalGarbage_free(self->return_values); - } - free(self); -} - -void UniversalGarbage_free(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - - if(self->is_the_root){ - - UniversalGarbage *return_garbage = self->return_values; - for(int i = 0; i < return_garbage->elements_size; i++){ - free(return_garbage->elements[i]); - } - - free(return_garbage->elements); - free(return_garbage); - } - - - free(self); -} - - - - -#define UNIVERSAL_GARBAGE_H -#endif \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/extra/extra.c b/build/c/dependencies/luaDoTheWorld/extra/extra.c deleted file mode 100644 index 10c6e1b..0000000 --- a/build/c/dependencies/luaDoTheWorld/extra/extra.c +++ /dev/null @@ -1,48 +0,0 @@ - -bool get_table_props_or_default_bool(LuaCEmbedTable *table,const char *prop,bool default_value){ - if(table == NULL){ - return default_value; - } - if(LuaCEmbedTable_get_type_prop(table,prop) != LUA_CEMBED_NIL){ - return LuaCembedTable_get_bool_prop(table,prop); - } - return default_value; -} - -LuaCEmbedResponse * concat_path(LuaCEmbed *args){ - char *path1 = LuaCEmbed_get_str_arg(args,0); - char *path2 = LuaCEmbed_get_str_arg(args,1); - - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - char *value = dtw_concat_path(path1,path2); - LuaCEmbedResponse *response = LuaCEmbed_send_str(value); - free(value); - return response; -} -LuaCEmbedResponse * starts_with(LuaCEmbed *args){ - char *content = LuaCEmbed_get_str_arg(args,0); - char *comparation = LuaCEmbed_get_str_arg(args,1); - - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - bool result = dtw_starts_with(content,comparation); - return LuaCEmbed_send_bool(result); -} - -LuaCEmbedResponse * ends_with(LuaCEmbed *args){ - char *content = LuaCEmbed_get_str_arg(args,0); - char *comparation = LuaCEmbed_get_str_arg(args,1); - - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - bool result = dtw_ends_with(content,comparation); - return LuaCEmbed_send_bool(result); -} - diff --git a/build/c/dependencies/luaDoTheWorld/extra/extra.h b/build/c/dependencies/luaDoTheWorld/extra/extra.h deleted file mode 100644 index 2a0b8dd..0000000 --- a/build/c/dependencies/luaDoTheWorld/extra/extra.h +++ /dev/null @@ -1,9 +0,0 @@ - -bool get_table_props_or_default_bool(LuaCEmbedTable *table,const char *prop,bool default_value); - - -LuaCEmbedResponse * concat_path(LuaCEmbed *args); - -LuaCEmbedResponse * starts_with(LuaCEmbed *args); - -LuaCEmbedResponse * ends_with(LuaCEmbed *args); diff --git a/build/c/dependencies/luaDoTheWorld/hasher/hasher.c b/build/c/dependencies/luaDoTheWorld/hasher/hasher.c deleted file mode 100644 index d4d1b1a..0000000 --- a/build/c/dependencies/luaDoTheWorld/hasher/hasher.c +++ /dev/null @@ -1,91 +0,0 @@ - -LuaCEmbedResponse * hasher_digest_file(LuaCEmbedTable *self,LuaCEmbed *args){ - char *filename = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - DtwHash *hash = (DtwHash*)LuaCembedTable_get_long_prop(self,HASH_POINTER); - if(!DtwHash_digest_file(hash,filename)){ - char *file_not_found = private_LuaCembed_format(FILE_NOT_FOUND,filename); - LuaCEmbedResponse *response = LuaCEmbed_send_error(file_not_found); - free(file_not_found); - return response; - } - return NULL; -} - -LuaCEmbedResponse * hasher_digest_folder_by_content(LuaCEmbedTable *self, LuaCEmbed *args){ - char *folder = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - DtwHash *hash = (DtwHash*)LuaCembedTable_get_long_prop(self,HASH_POINTER); - if(!DtwHash_digest_folder_by_content(hash,folder)){ - char *folder_not_found = private_LuaCembed_format(FOLDER_NOT_FOUND,folder); - LuaCEmbedResponse *response = LuaCEmbed_send_error(folder_not_found); - free(folder_not_found); - return response; - } - return NULL; -} - -LuaCEmbedResponse * hasher_digest_folder_by_last_modification(LuaCEmbedTable *self, LuaCEmbed *args){ - char *folder = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - - DtwHash *hash = (DtwHash*)LuaCembedTable_get_long_prop(self,HASH_POINTER); - if(!DtwHash_digest_folder_by_last_modification(hash,folder)){ - char *folder_not_found = private_LuaCembed_format(FOLDER_NOT_FOUND,folder); - LuaCEmbedResponse *response = LuaCEmbed_send_error(folder_not_found); - free(folder_not_found); - return response; - } - return NULL; -} - - - -LuaCEmbedResponse * delete_hasher(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwHash *hash = (DtwHash*)LuaCembedTable_get_long_prop(self,HASH_POINTER); - DtwHash_free(hash); - return NULL; -} - -LuaCEmbedResponse * hasher_digest(LuaCEmbedTable *self,LuaCEmbed *args){ - Writeble write_obj = create_writeble(args,0); - if(write_obj.error){ - return write_obj.error; - } - DtwHash *hash = (DtwHash*)LuaCembedTable_get_long_prop(self,HASH_POINTER); - DtwHash_digest_any(hash,write_obj.content,write_obj.size); - Writeble_free(&write_obj); - return NULL; -} - -LuaCEmbedResponse * hasher_get_value(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwHash *hash = (DtwHash*)LuaCembedTable_get_long_prop(self,HASH_POINTER); - return LuaCEmbed_send_str(hash->hash); -} - - -LuaCEmbedResponse * create_hasher(LuaCEmbed *args){ - LuaCEmbedTable * self = LuaCembed_new_anonymous_table(args); - DtwHash *hash = newDtwHash(); - LuaCEmbedTable_set_long_prop(self,HASH_POINTER,(long long)hash); - LuaCEmbedTable_set_method(self, DIGESST_METHOD, hasher_digest); - LuaCEmbedTable_set_method(self, TO_STRING_METHOD, hasher_get_value); - LuaCEmbedTable_set_method(self, GET_VALUE_METHOD, hasher_get_value); - LuaCEmbedTable_set_method(self, DIGESST_FILE_METHOD, hasher_digest_file); - LuaCEmbedTable_set_method(self, DIGESST_FOLDER_BY_CONTENT_METHOD, hasher_digest_folder_by_content); - LuaCEmbedTable_set_method(self, DIGESST_FOLDER_BY_LAST_MODIFICATION_METHOD, hasher_digest_folder_by_last_modification); - LuaCEmbedTable_set_method(self, DELETE_METHOD, delete_hasher); - return LuaCEmbed_send_table(self); -} diff --git a/build/c/dependencies/luaDoTheWorld/hasher/hasher.h b/build/c/dependencies/luaDoTheWorld/hasher/hasher.h deleted file mode 100644 index 1d93396..0000000 --- a/build/c/dependencies/luaDoTheWorld/hasher/hasher.h +++ /dev/null @@ -1,15 +0,0 @@ - - -LuaCEmbedResponse * hasher_digest_file(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * hasher_digest_folder_by_content(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse * hasher_digest_folder_by_last_modification(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse * hasher_get_value(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * hasher_digest(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * delete_hasher(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * create_hasher(LuaCEmbed *args); diff --git a/build/c/dependencies/luaDoTheWorld/io/io.c b/build/c/dependencies/luaDoTheWorld/io/io.c deleted file mode 100644 index 8427df6..0000000 --- a/build/c/dependencies/luaDoTheWorld/io/io.c +++ /dev/null @@ -1,166 +0,0 @@ - - -LuaCEmbedResponse * load_file(LuaCEmbed *args){ - char *filename = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - long size; - bool is_binary; - unsigned char *content = dtw_load_any_content(filename,&size,&is_binary); - if(!content){ - if(dtw_entity_type(filename) == DTW_FILE_TYPE){ - return LuaCEmbed_send_str(""); - } - return NULL; - } - if(!is_binary){ - - LuaCEmbedResponse * response = LuaCEmbed_send_str((const char*)content); - free(content); - return response; - } - - LuaCEmbedResponse *response = LuaCEmbed_send_raw_string((char*)content,size); - free(content); - return response; -} - -LuaCEmbedResponse * write_file(LuaCEmbed *args){ - char *filename = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - bool writed = false; - long total_args = LuaCEmbed_get_total_args(args); - if(total_args == 0){ - writed = dtw_write_string_file_content(filename,""); - return LuaCEmbed_send_bool(writed); - } - - Writeble write_obj = create_writeble(args,1); - if(write_obj.error){ - return write_obj.error; - } - writed = dtw_write_any_content(filename,write_obj.content,write_obj.size); - Writeble_free(&write_obj); - return LuaCEmbed_send_bool(writed); - - -} -LuaCEmbedResponse * is_dir(LuaCEmbed *args){ - char *source = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - int type = dtw_entity_type(source); - return LuaCEmbed_send_bool(type == DTW_FOLDER_TYPE); -} - -LuaCEmbedResponse * exist(LuaCEmbed *args){ - char *source = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - int type = dtw_entity_type(source); - return LuaCEmbed_send_bool(type != DTW_NOT_FOUND); -} - -LuaCEmbedResponse * is_blob(LuaCEmbed *args){ - - Writeble write_obj = create_writeble(args,1); - if(write_obj.error){ - return write_obj.error; - } - bool is_binary = write_obj.is_binary; - Writeble_free(&write_obj); - return LuaCEmbed_send_bool(is_binary); - -} - -LuaCEmbedResponse * is_file(LuaCEmbed *args){ - char *source = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - int type = dtw_entity_type(source); - return LuaCEmbed_send_bool(type == DTW_FILE_TYPE); -} - -LuaCEmbedResponse * is_blob_file(LuaCEmbed *args){ - char *source = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - int type = dtw_complex_entity_type(source); - return LuaCEmbed_send_bool(type == DTW_COMPLEX_BINARY); -} - - - - -LuaCEmbedResponse * copy_any_overwriting(LuaCEmbed *args){ - char *source = LuaCEmbed_get_str_arg(args,0); - char *dest = LuaCEmbed_get_str_arg(args,1); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - bool writed = dtw_copy_any(source,dest,DTW_NOT_MERGE); - return LuaCEmbed_send_bool(writed); -} - - -LuaCEmbedResponse * copy_any_merging(LuaCEmbed *args){ - char *source = LuaCEmbed_get_str_arg(args,0); - char *dest = LuaCEmbed_get_str_arg(args,1); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - bool writed = dtw_copy_any(source,dest,DTW_MERGE); - return LuaCEmbed_send_bool(writed); -} - -LuaCEmbedResponse * move_any_overwriting(LuaCEmbed *args){ - char *source = LuaCEmbed_get_str_arg(args,0); - char *dest = LuaCEmbed_get_str_arg(args,1); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - bool writed = dtw_move_any(source,dest,DTW_NOT_MERGE); - return LuaCEmbed_send_bool(writed); -} -LuaCEmbedResponse * move_any_merging(LuaCEmbed *args){ - char *source = LuaCEmbed_get_str_arg(args,0); - char *dest = LuaCEmbed_get_str_arg(args,1); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - bool writed = dtw_move_any(source,dest,DTW_MERGE); - return LuaCEmbed_send_bool(writed); -} - - -LuaCEmbedResponse * remove_any(LuaCEmbed *args){ - char *source = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - bool writed = dtw_remove_any(source); - return LuaCEmbed_send_bool(writed); -} - - diff --git a/build/c/dependencies/luaDoTheWorld/io/io.h b/build/c/dependencies/luaDoTheWorld/io/io.h deleted file mode 100644 index bf5c6ce..0000000 --- a/build/c/dependencies/luaDoTheWorld/io/io.h +++ /dev/null @@ -1,26 +0,0 @@ - - -LuaCEmbedResponse * load_file(LuaCEmbed *args); - -LuaCEmbedResponse * write_file(LuaCEmbed *args); - -LuaCEmbedResponse * copy_any_overwriting(LuaCEmbed *args); - -LuaCEmbedResponse * is_dir(LuaCEmbed *args); -LuaCEmbedResponse * is_blob(LuaCEmbed *args); - -LuaCEmbedResponse * is_blob_file(LuaCEmbed *args); - -LuaCEmbedResponse * exist(LuaCEmbed *args); - -LuaCEmbedResponse * is_file(LuaCEmbed *args); - - - -LuaCEmbedResponse * copy_any_merging(LuaCEmbed *args); - -LuaCEmbedResponse * move_any_overwriting(LuaCEmbed *args); - -LuaCEmbedResponse * move_any_merging(LuaCEmbed *args); - -LuaCEmbedResponse * remove_any(LuaCEmbed *args); diff --git a/build/c/dependencies/luaDoTheWorld/listage/listage.c b/build/c/dependencies/luaDoTheWorld/listage/listage.c deleted file mode 100644 index fd6af4a..0000000 --- a/build/c/dependencies/luaDoTheWorld/listage/listage.c +++ /dev/null @@ -1,50 +0,0 @@ - -LuaCEmbedResponse * aply_listage(LuaCEmbed *args,DtwStringArray* (*callback)(const char *folder,bool concat_path)){ - char *source = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - bool concat_path = false; - if(LuaCEmbed_get_total_args(args) >= 2){ - concat_path = LuaCEmbed_get_bool_arg(args,1); - } - DtwStringArray * listage = callback(source,concat_path); - DtwStringArray_sort(listage); - LuaCEmbedTable * table = LuaCembed_new_anonymous_table(args); - for(int i = 0; i < listage->size; i++){ - char * current_value = listage->strings[i]; - LuaCEmbedTable_append_string(table,current_value); - } - - LuaCEmbedTable *final = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_append_table(final,table); - LuaCEmbedTable_append_long(final,listage->size); - DtwStringArray_free(listage); - return LuaCEmbed_send_multi_return(final); -} - -LuaCEmbedResponse * list_files(LuaCEmbed *args){ - return aply_listage(args,dtw_list_files); -} - -LuaCEmbedResponse * list_dirs(LuaCEmbed *args){ - return aply_listage(args,dtw_list_dirs); - -} - -LuaCEmbedResponse * list_all(LuaCEmbed *args){ - return aply_listage(args,dtw_list_all); -} - -LuaCEmbedResponse * list_files_recursively(LuaCEmbed *args){ - return aply_listage(args,dtw_list_files_recursively); -} - -LuaCEmbedResponse * list_dirs_recursively(LuaCEmbed *args){ - return aply_listage(args,dtw_list_dirs_recursively); -} - -LuaCEmbedResponse * list_all_recursively(LuaCEmbed *args){ - return aply_listage(args,dtw_list_all_recursively); -} diff --git a/build/c/dependencies/luaDoTheWorld/listage/listage.h b/build/c/dependencies/luaDoTheWorld/listage/listage.h deleted file mode 100644 index 8153850..0000000 --- a/build/c/dependencies/luaDoTheWorld/listage/listage.h +++ /dev/null @@ -1,15 +0,0 @@ - -LuaCEmbedResponse * aply_listage(LuaCEmbed *args,DtwStringArray* (*callback)(const char *folder,bool concat_path)); - - -LuaCEmbedResponse * list_files(LuaCEmbed *args); - -LuaCEmbedResponse * list_dirs(LuaCEmbed *args); - -LuaCEmbedResponse * list_all(LuaCEmbed *args); - -LuaCEmbedResponse * list_files_recursively(LuaCEmbed *args); - -LuaCEmbedResponse * list_dirs_recursively(LuaCEmbed *args); - -LuaCEmbedResponse * list_all_recursively(LuaCEmbed *args); diff --git a/build/c/dependencies/luaDoTheWorld/one.c b/build/c/dependencies/luaDoTheWorld/one.c deleted file mode 100644 index d3e6c83..0000000 --- a/build/c/dependencies/luaDoTheWorld/one.c +++ /dev/null @@ -1,57 +0,0 @@ - -#include - -#include "dependecies.h" - -#include "declaration.h" -#include "definition.h" - - -void start_lua_props(LuaCEmbed *l){ - LuaCEmbed_add_callback(l,LOAD_FILE,load_file); - LuaCEmbed_add_callback(l,WRITE_FILE,write_file); - LuaCEmbed_add_callback(l,COPY_ANY_OVERWRITING,copy_any_overwriting); - LuaCEmbed_add_callback(l,COPY_ANY_MERGING,copy_any_merging); - LuaCEmbed_add_callback(l,MOVE_ANY_OVERWRITING,move_any_overwriting); - LuaCEmbed_add_callback(l,MOVE_ANY_MERGING,move_any_merging); - LuaCEmbed_add_callback(l,REMOVE_ANY,remove_any); - LuaCEmbed_add_callback(l,LIST_FILES,list_files); - LuaCEmbed_add_callback(l,LIST_FILES_RECURSIVELY,list_files_recursively); - LuaCEmbed_add_callback(l,LIST_DIRS,list_dirs); - LuaCEmbed_add_callback(l,LIST_DIRS_RECURSIVELY,list_dirs_recursively); - LuaCEmbed_add_callback(l,LIST_ALL,list_all); - LuaCEmbed_add_callback(l,LIST_ALL_RECURSIVELY,list_all_recursively); - LuaCEmbed_add_callback(l,BBASE_64_ENCODE_FILE,base64_encode_file); - LuaCEmbed_add_callback(l,BBASE_64_ENCODE,base64_encode); - LuaCEmbed_add_callback(l,BBASE_64_DECODE,base64_decode); - LuaCEmbed_add_callback(l,GENERATE_SHA,generate_sha); - LuaCEmbed_add_callback(l,GENERATE_SHA_FROM_FILE,generate_sha_from_file); - LuaCEmbed_add_callback(l, NEW_RESOURCE, create_resource); - LuaCEmbed_add_callback(l,IS_BLOB_FUNC,is_blob); - LuaCEmbed_add_callback(l,IS_DIR_FUNC,is_dir); - LuaCEmbed_add_callback(l,IS_FILE_FUNC,is_file); - LuaCEmbed_add_callback(l, IS_FILE_BLOB, is_blob_file); - LuaCEmbed_add_callback(l,NEW_HASHER,create_hasher); - LuaCEmbed_add_callback(l,GENERATE_SHA_FROM_FOLDER_BY_CONTENT,generate_sha_from_folder_by_content); - LuaCEmbed_add_callback(l,GENERATE_SHA_FROM_FOLDER_BY_LAST_MODIFICATION,generate_sha_from_folder_by_last_modification); - LuaCEmbed_add_callback(l, NEW_TRANSACTION, transaction_new_transaction); - LuaCEmbed_add_callback(l,NEW_TRANSACTION_FROM_JSON_STRING,create_empty_transaction_from_json_string); - LuaCEmbed_add_callback(l,NEW_TRANSACTION_FROM_JSON_FILE,create_empty_transaction_from_json_file); - LuaCEmbed_add_callback(l,NEW_PATH,create_path); - LuaCEmbed_add_callback(l,NEW_TREE,create_empty_tree); - LuaCEmbed_add_callback(l,CONCAT_PATH,concat_path); - LuaCEmbed_add_callback(l,NEW_TREE_FROM_HARWARE,create_tree_fro_hardware); - LuaCEmbed_add_callback(l,STARTS_WITH,starts_with); - LuaCEmbed_add_callback(l,ENDS_WITH,ends_with); -} - -int load_luaDoTheWorld(lua_State *state){ - - - - LuaCEmbed * l = newLuaCEmbedLib(state); - start_lua_props(l); - - return LuaCembed_perform(l); -} - diff --git a/build/c/dependencies/luaDoTheWorld/path/path.c b/build/c/dependencies/luaDoTheWorld/path/path.c deleted file mode 100644 index 06b1583..0000000 --- a/build/c/dependencies/luaDoTheWorld/path/path.c +++ /dev/null @@ -1,317 +0,0 @@ - -LuaCEmbedResponse *path_changed(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwPath *self_path = (DtwPath*)LuaCembedTable_get_long_prop(self,PATH_POINTER); - return LuaCEmbed_send_bool(DtwPath_changed(self_path)); -} -LuaCEmbedResponse *path_unpack(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwPath *self_path = (DtwPath*)LuaCembedTable_get_long_prop(self,PATH_POINTER); - int total_dirs = DtwPath_get_total_dirs(self_path); - int size= total_dirs; - LuaCEmbedTable *elements =LuaCembed_new_anonymous_table(args); - for(int i =0;i path); - } - long size; - bool is_binary; - unsigned char *content = DtwResource_get_any(resource,&size,&is_binary); - return LuaCEmbed_send_raw_string_reference((char*)content,size); - -} - - -LuaCEmbedResponse * resource_to_number(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - double value = DtwResource_get_double(resource); - if(DtwResource_error(resource)){ - char *error_message = DtwResource_get_error_message(resource); - LuaCEmbedResponse *response = LuaCEmbed_send_error(error_message); - DtwResource_clear_errors(resource); - return response; - } - return LuaCEmbed_send_double(value); -} - -LuaCEmbedResponse * resource_value(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - int type = DtwResource_type(resource); - - if(type == DTW_FOLDER_TYPE || type == DTW_NOT_FOUND){ - return NULL; - } - - if(type == DTW_COMPLEX_DOUBLE_TYPE || type == DTW_COMPLEX_LONG_TYPE){ - double value = DtwResource_get_double(resource); - return LuaCEmbed_send_double(value); - } - - if(type == DTW_COMPLEX_BOOL_TYPE){ - bool value= DtwResource_get_bool(resource); - return LuaCEmbed_send_bool(value); - } - - if(type == DTW_COMPLEX_BINARY || type == DTW_COMPLEX_STRING_TYPE){ - long size; - bool is_binary; - unsigned char *content = DtwResource_get_any(resource,&size,&is_binary); - return LuaCEmbed_send_raw_string_reference((char*)content,size); - } - - return NULL; -} -LuaCEmbedResponse * resource_value_string(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - int type = DtwResource_type(resource); - if(type != DTW_NOT_FOUND && type != DTW_FOLDER_TYPE){ - long size; - bool is_binary; - unsigned char *content = DtwResource_get_any(resource,&size,&is_binary); - return LuaCEmbed_send_raw_string_reference((char*)content,size); - } - return NULL; -} - -LuaCEmbedResponse * resource_value_number(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - int type = DtwResource_type(resource); - - if(type == DTW_COMPLEX_DOUBLE_TYPE || type == DTW_COMPLEX_LONG_TYPE){ - double value = DtwResource_get_double(resource); - return LuaCEmbed_send_double(value); - } - - return NULL; -} - -LuaCEmbedResponse * resource_value_bool(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - int type = DtwResource_type(resource); - - - if(type == DTW_COMPLEX_BOOL_TYPE){ - bool value= DtwResource_get_bool(resource); - return LuaCEmbed_send_bool(value); - } - - - return NULL; -} - -LuaCEmbedResponse * resource_value_from_sub_resource(LuaCEmbedTable *self,LuaCEmbed *args){ - char *src = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - DtwResource *master = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResource *sub = DtwResource_sub_resource(master,src); - - int type = DtwResource_type(sub); - - if(type == DTW_FOLDER_TYPE || type == DTW_NOT_FOUND){ - return NULL; - } - if(type == DTW_COMPLEX_DOUBLE_TYPE || type == DTW_COMPLEX_LONG_TYPE){ - double value = DtwResource_get_double(sub); - return LuaCEmbed_send_double(value); - } - if(type == DTW_COMPLEX_STRING_TYPE){ - char *value = DtwResource_get_string(sub); - return LuaCEmbed_send_str(value); - } - - if(type == DTW_COMPLEX_BOOL_TYPE){ - bool value= DtwResource_get_bool(sub); - return LuaCEmbed_send_bool(value); - } - - if(type == DTW_COMPLEX_BINARY){ - long size; - bool is_binary; - unsigned char *content = DtwResource_get_any(sub,&size,&is_binary); - return LuaCEmbed_send_raw_string((char*)content,size); - } - return NULL; -} - -LuaCEmbedResponse * resource_to_boolean(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - bool value = DtwResource_get_bool(resource); - if(DtwResource_error(resource)){ - char *error_message = DtwResource_get_error_message(resource); - LuaCEmbedResponse *response = LuaCEmbed_send_error(error_message); - DtwResource_clear_errors(resource); - return response; - } - return LuaCEmbed_send_bool(value); -} \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/resource/resource/getters/getters.h b/build/c/dependencies/luaDoTheWorld/resource/resource/getters/getters.h deleted file mode 100644 index 1a80a10..0000000 --- a/build/c/dependencies/luaDoTheWorld/resource/resource/getters/getters.h +++ /dev/null @@ -1,16 +0,0 @@ - -LuaCEmbedResponse * resource_to_string(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * resource_to_number(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * resource_value(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * resource_value_string(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * resource_value_number(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * resource_value_bool(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * resource_value_from_sub_resource(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * resource_to_boolean(LuaCEmbedTable *self,LuaCEmbed *args); \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/resource/resource/resource/resource.c b/build/c/dependencies/luaDoTheWorld/resource/resource/resource/resource.c deleted file mode 100644 index 96fd890..0000000 --- a/build/c/dependencies/luaDoTheWorld/resource/resource/resource/resource.c +++ /dev/null @@ -1,205 +0,0 @@ - -#include "../../../constants/resource_methods.h" - -LuaCEmbedResponse * free_resource(LuaCEmbedTable *self, LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - - DtwResource_free(resource); - - - return NULL; - -} - - -LuaCEmbedResponse * resource_get_path(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - return LuaCEmbed_send_str(resource->path); -} - -LuaCEmbedResponse * resource_rename(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - char *new_name = LuaCEmbed_get_str_arg(args,0); - DtwResource_rename(resource,new_name); - if(DtwResource_error(resource)){ - char *error_mensage = DtwResource_get_error_message(resource); - LuaCEmbedResponse *response = LuaCEmbed_send_error(error_mensage); - DtwResource_clear_errors(resource); - return response; - } - return LuaCEmbed_send_table(self); - -} - -LuaCEmbedResponse * resource_set_value(LuaCEmbedTable *self,LuaCEmbed *args){ - Writeble write_obj = create_writeble(args,0); - if(write_obj.error){ - return write_obj.error; - } - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResource_set_binary(resource,write_obj.content, write_obj.size); - if(DtwResource_error(resource)){ - char *error_mensage = DtwResource_get_error_message(resource); - LuaCEmbedResponse *response = LuaCEmbed_send_error(error_mensage); - DtwResource_clear_errors(resource); - return response; - } - - return LuaCEmbed_send_table(self); -} - - - -LuaCEmbedResponse * resource_commit(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResource_commit(resource); - return LuaCEmbed_send_table(self); - -} - -LuaCEmbedResponse * resource_destroy(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResource_destroy(resource); - if(DtwResource_error(resource)){ - char *error_mensage = DtwResource_get_error_message(resource); - LuaCEmbedResponse *response = LuaCEmbed_send_error(error_mensage); - DtwResource_clear_errors(resource); - return response; - } - return LuaCEmbed_send_table(self); -} -LuaCEmbedResponse * unload_resurce(LuaCEmbedTable *self, LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResource_unload(resource); - return LuaCEmbed_send_table(self); -} - -LuaCEmbedResponse * lock_resource(LuaCEmbedTable *self, LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResource_lock(resource); - return LuaCEmbed_send_table(self); -} - -LuaCEmbedResponse * unlock_resource(LuaCEmbedTable *self, LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResource_unlock(resource); - return LuaCEmbed_send_table(self); -} - -LuaCEmbedResponse * resource_new_schema(LuaCEmbedTable *self, LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwSchema *schema = DtwResource_newSchema(resource); - LuaCEmbedTable *created = raw_create_schema(args,schema); - return LuaCEmbed_send_table(created); - -} - -LuaCEmbedResponse * resource_set_value_in_sub_resource(LuaCEmbedTable *self,LuaCEmbed *args){ - - char *folder = LuaCEmbed_get_str_arg(args,0); - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - Writeble write_obj = create_writeble(args,1); - if(write_obj.error){ - return write_obj.error; - } - - DtwResource *values = DtwResource_sub_resource(resource,folder); - DtwResource_set_binary(values,write_obj.content,write_obj.size); - if(DtwResource_error(resource)){ - char *error_mensage = DtwResource_get_error_message(resource); - LuaCEmbedResponse *response = LuaCEmbed_send_error(error_mensage); - DtwResource_clear_errors(resource); - return response; - } - - return LuaCEmbed_send_table(self); - -} -LuaCEmbedResponse * resource_is_blob(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResource_load(resource); - return LuaCEmbed_send_bool(resource->is_binary); -} - - - -LuaCEmbedTable *raw_create_resource(LuaCEmbed *args,DtwResource *resource){ - - LuaCEmbedTable * self = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_set_long_prop(self,DTW_TYPE,DTW_RESOURCE_TYPE); - - - LuaCEmbedTable_set_long_prop(self,RESOURCE_POINTER,(long long )resource); - LuaCEmbedTable_set_method(self,TO_STRING_METHOD,resource_to_string); - LuaCEmbedTable_set_method(self,TO_NUMBER_METHOD,resource_to_number); - LuaCEmbedTable_set_method(self,TO_BOOLEAN_METHOD,resource_to_boolean); - LuaCEmbedTable_set_method(self,GET_VALUE_METHOD,resource_value); - LuaCEmbedTable_set_method(self, INDEX_METHOD, resource_sub_resource_index); - LuaCEmbedTable_set_method(self, SUB_RESOURCE_METHOD, resource_sub_resource_method); - LuaCEmbedTable_set_method(self,RESOURCE_RENAME_METHOD,resource_rename); - - LuaCEmbedTable_set_method(self,RESOURCE_GET_STRING,resource_value_string); - LuaCEmbedTable_set_method(self,RESOURCE_GET_NUMBER,resource_value_number); - LuaCEmbedTable_set_method(self,RESOURCE_GET_BOOL,resource_value_bool); - - LuaCEmbedTable_set_method(self, SUB_RESOURCE_NEXT_METHOD, resource_sub_resource_next); - LuaCEmbedTable_set_method(self, SUB_RESOURCE_NOW_METHOD, resource_sub_resource_now); - LuaCEmbedTable_set_method(self, SUB_RESOURCE_NOW_IN_UNIX, resource_sub_resource_now_in_unix); - LuaCEmbedTable_set_method(self,LOCK_METHOD,lock_resource); - LuaCEmbedTable_set_method(self,UNLOCK_METHOD,unlock_resource); - LuaCEmbedTable_set_method(self,UNLOAD_METHOD,unload_resurce); - LuaCEmbedTable_set_method(self,IS_BLOB_FUNC,resource_is_blob); - - LuaCEmbedTable_set_method(self,SET_VALUE_METHOD,resource_set_value); - LuaCEmbedTable_set_method(self,COMMIT_METHOD,resource_commit); - LuaCEmbedTable_set_method(self,DESTROY_METHOD,resource_destroy); - - LuaCEmbedTable_set_method(self, GET_PATH_STRING_METHOD, resource_get_path); - - LuaCEmbedTable_set_method(self, SET_VALUE_IN_SUB_RESOURCE_METHOD, resource_set_value_in_sub_resource); - LuaCEmbedTable_set_method(self,GET_VALUE_FROM_SUB_RESOURCE_METHOD,resource_value_from_sub_resource); - - LuaCEmbedTable_set_method(self, SUB_SCHEMA_METHOD, resource_new_schema); - LuaCEmbedTable_set_method(self,DANGEROUS_REMOVE_PROP_METHOD,dangerous_remove_schema_prop); - LuaCEmbedTable_set_method(self,DANGEROUS_RENAME_PROP_METHOD,dangerous_rename_schema_prop); - LuaCEmbedTable_set_method(self, GET_RESOURCE_MATCHING_PRIMARY_KEY_METHOD, get_resource_match_schema_by_primary_key); - LuaCEmbedTable_set_method(self,GET_RESOURCE_BY_NAME_ID,get_resource_by_name_id); - - LuaCEmbedTable_set_method(self,RESOURCE_NEW_SCHEMA,resource_new_schema); - LuaCEmbedTable_set_method(self,SCHEMA_LIST_RESOURCE_METHOD,schema_list_resources); - LuaCEmbedTable_set_method(self, SCHEMA_FIND_RESOURCE_METHOD, schema_find_resource); - LuaCEmbedTable_set_method(self,SCHEMA_MAP_RESOURCE_METHOD,schema_map_resource); - LuaCEmbedTable_set_method(self,SCHEMA_COUNT_RESOURCE_METHOD,schema_count_resource); - LuaCEmbedTable_set_method(self, SCHEMA_EACH_METHOD, resource_schema_each); - - - LuaCEmbedTable_set_method(self,LIST_METHOD,resource_list); - LuaCEmbedTable_set_method(self,EACH_METHOD,resource_foreach); - LuaCEmbedTable_set_method(self, SCHEMA_NEW_INSERTION, Resource_new_insertion); - - if(resource->mother ==NULL){ - LuaCEmbedTable_set_method(self, DELETE_METHOD, free_resource); - } - - return self; -} - - - -LuaCEmbedResponse * create_resource(LuaCEmbed *args){ - char *folder = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - DtwResource *resource = new_DtwResource(folder); - - LuaCEmbedTable *self = raw_create_resource(args,resource); - return LuaCEmbed_send_table(self); - -} \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/resource/resource/resource/resource.h b/build/c/dependencies/luaDoTheWorld/resource/resource/resource/resource.h deleted file mode 100644 index 04ac028..0000000 --- a/build/c/dependencies/luaDoTheWorld/resource/resource/resource/resource.h +++ /dev/null @@ -1,29 +0,0 @@ - - -LuaCEmbedResponse * resource_get_path(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * resource_rename(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * free_resource(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse * resource_is_blob(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * resource_set_value(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * resource_commit(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * resource_destroy(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * unload_resurce(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse * lock_resource(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse * unlock_resource(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse * resource_new_schema(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse * resource_set_value_in_sub_resource(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedTable *raw_create_resource(LuaCEmbed *args,DtwResource *resource); - -LuaCEmbedResponse * create_resource(LuaCEmbed *args); \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/resource/resource/resource_iterable/resource_iterable.c b/build/c/dependencies/luaDoTheWorld/resource/resource/resource_iterable/resource_iterable.c deleted file mode 100644 index f075065..0000000 --- a/build/c/dependencies/luaDoTheWorld/resource/resource/resource_iterable/resource_iterable.c +++ /dev/null @@ -1,31 +0,0 @@ - -LuaCEmbedResponse * resource_list(LuaCEmbedTable *self,LuaCEmbed *args) { - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResourceArray *elements = DtwResource_sub_resources(resource); - LuaCEmbedTable *response = LuaCembed_new_anonymous_table(args); - for(int i = 0; i < elements->size; i++) { - DtwResource*current = elements->resources[i]; - LuaCEmbedTable *sub = raw_create_resource(args,current); - LuaCEmbedTable_append_table(response,sub); - } - return LuaCEmbed_send_table(response); -} - - -LuaCEmbedResponse * resource_foreach(LuaCEmbedTable *self,LuaCEmbed *args) { - - - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResourceArray *elements = DtwResource_sub_resources(resource); - - for(int i =0; i < elements->size; i++) { - DtwResource *current = elements->resources[i]; - LuaCEmbedTable *sub = raw_create_resource(args,current); - LuaCEmbedTable *args_to_callback = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_append_table(args_to_callback,sub); - LuaCEmbed_run_args_lambda(args,0,args_to_callback,0); - - } - return LuaCEmbed_send_table(self); - -} \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/resource/resource/resource_iterable/resource_iterable.h b/build/c/dependencies/luaDoTheWorld/resource/resource/resource_iterable/resource_iterable.h deleted file mode 100644 index 45ce329..0000000 --- a/build/c/dependencies/luaDoTheWorld/resource/resource/resource_iterable/resource_iterable.h +++ /dev/null @@ -1,2 +0,0 @@ - -LuaCEmbedResponse * resource_list(LuaCEmbedTable *self,LuaCEmbed *args); \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/resource/resource/schema/schema.c b/build/c/dependencies/luaDoTheWorld/resource/resource/schema/schema.c deleted file mode 100644 index 184b775..0000000 --- a/build/c/dependencies/luaDoTheWorld/resource/resource/schema/schema.c +++ /dev/null @@ -1,109 +0,0 @@ -// -// Created by mateusmoutinho on 22/05/24. -// -LuaCEmbedResponse * Resource_new_insertion(LuaCEmbedTable *self, LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResource *created = DtwResource_new_schema_insertion(resource); - LuaCEmbedTable *sub = raw_create_resource(args,created); - if(DtwResource_error(resource)){ - char *message = DtwResource_get_error_message(resource); - return LuaCEmbed_send_error(message); - } - - return LuaCEmbed_send_table(sub); -} - - -LuaCEmbedResponse * get_resource_match_schema_by_primary_key(LuaCEmbedTable *self, LuaCEmbed *args){ - char *key = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - Writeble write_obj = create_writeble(args,1); - if(write_obj.error){ - return write_obj.error; - } - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - - DtwResource *founded = DtwResource_find_by_primary_key_with_binary(resource,key,write_obj.content,write_obj.size); - if(DtwResource_error(resource)){ - char *message = DtwResource_get_error_message(resource); - return LuaCEmbed_send_error(message); - } - if(!founded){ - return NULL; - } - LuaCEmbedTable *sub = raw_create_resource(args,founded); - return LuaCEmbed_send_table(sub); -} - - -LuaCEmbedResponse * get_resource_by_name_id(LuaCEmbedTable *self, LuaCEmbed *args){ - char *name_id = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResource *founded = DtwResource_find_by_name_id(resource,name_id); - if(DtwResource_error(resource)){ - char *message = DtwResource_get_error_message(resource); - return LuaCEmbed_send_error(message); - } - if(!founded){ - return NULL; - } - - LuaCEmbedTable *sub = raw_create_resource(args,founded); - - return LuaCEmbed_send_table(sub); -} - -LuaCEmbedResponse * dangerous_rename_schema_prop(LuaCEmbedTable *self,LuaCEmbed *args){ - char *key = LuaCEmbed_get_str_arg(args,0); - char *new_name = LuaCEmbed_get_str_arg(args,1); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResource_dangerous_rename_schema_prop(resource,key,new_name); - if(DtwResource_error(resource)){ - char *message = DtwResource_get_error_message(resource); - return LuaCEmbed_send_error(message); - } - return LuaCEmbed_send_table(self); -} - -LuaCEmbedResponse * dangerous_remove_schema_prop(LuaCEmbedTable *self,LuaCEmbed *args){ - char *key_to_remove = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResource_dangerous_remove_schema_prop(resource,key_to_remove); - if(DtwResource_error(resource)){ - char *message = DtwResource_get_error_message(resource); - return LuaCEmbed_send_error(message); - } - return LuaCEmbed_send_table(self); -} - -LuaCEmbedResponse * Resource_new_schema(LuaCEmbedTable *self, LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwSchema *schema = DtwResource_newSchema(resource); - LuaCEmbedTable *created_table = raw_create_schema(args,schema); - if(DtwResource_error(resource)){ - char *message = DtwResource_get_error_message(resource); - return LuaCEmbed_send_error(message); - } - return LuaCEmbed_send_table(created_table); -} - diff --git a/build/c/dependencies/luaDoTheWorld/resource/resource/schema/schema.h b/build/c/dependencies/luaDoTheWorld/resource/resource/schema/schema.h deleted file mode 100644 index 8ea2905..0000000 --- a/build/c/dependencies/luaDoTheWorld/resource/resource/schema/schema.h +++ /dev/null @@ -1,18 +0,0 @@ -// -// Created by mateusmoutinho on 22/05/24. -// -LuaCEmbedResponse * Resource_new_insertion(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse * Resource_new_schema(LuaCEmbedTable *self, LuaCEmbed *args); - - -LuaCEmbedResponse * get_resource_match_schema_by_primary_key(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse * get_resource_by_name_id(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse * dangerous_rename_schema_prop(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * dangerous_remove_schema_prop(LuaCEmbedTable *self,LuaCEmbed *args); - - - diff --git a/build/c/dependencies/luaDoTheWorld/resource/resource/schema_iterable/schema_iterable.c b/build/c/dependencies/luaDoTheWorld/resource/resource/schema_iterable/schema_iterable.c deleted file mode 100644 index e0d2b5e..0000000 --- a/build/c/dependencies/luaDoTheWorld/resource/resource/schema_iterable/schema_iterable.c +++ /dev/null @@ -1,117 +0,0 @@ - -LuaCEmbedResponse * schema_list_resources(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResourceArray *elements = DtwResource_sub_resources(resource->values_resource); - LuaCEmbedTable *response = LuaCembed_new_anonymous_table(args); - for(int i = 0; i < elements->size; i++) { - DtwResource*current = elements->resources[i]; - LuaCEmbedTable *sub = raw_create_resource(args,current); - LuaCEmbedTable_append_table(response,sub); - } - return LuaCEmbed_send_table(response); -} - -LuaCEmbedResponse * schema_find_resource(LuaCEmbedTable *self,LuaCEmbed *args){ - - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResourceArray *elements = DtwResource_sub_resources(resource->values_resource); - for(int i = 0; i < elements->size; i++) { - DtwResource*current = elements->resources[i]; - LuaCEmbedTable *sub = raw_create_resource(args,current); - - LuaCEmbedTable *args_to_callback = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_append_table(args_to_callback,sub); - LuaCEmbedTable *user_response = LuaCEmbed_run_args_lambda(args,0,args_to_callback,1); - - if(LuaCEmbed_has_errors(args)){ - char *error = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error); - } - - bool possible_return = LuaCEmbedTable_get_bool_by_index(user_response,0); - if(possible_return){ - return LuaCEmbed_send_table(sub); - } - } - - return NULL; -} - - - -LuaCEmbedResponse * schema_count_resource(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResourceArray *elements = DtwResource_sub_resources(resource->values_resource); - long size = 0; - for(int i = 0; i < elements->size; i++) { - DtwResource*current = elements->resources[i]; - LuaCEmbedTable *sub = raw_create_resource(args,current); - - LuaCEmbedTable *args_to_callback = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_append_table(args_to_callback,sub); - LuaCEmbedTable *user_response = LuaCEmbed_run_args_lambda(args,0,args_to_callback,1); - - if(LuaCEmbed_has_errors(args)){ - char *error = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error); - } - - bool possible_return = LuaCEmbedTable_get_bool_by_index(user_response,0); - if(possible_return){ - size+=1; - } - } - - return LuaCEmbed_send_long(size); -} - -LuaCEmbedResponse * schema_map_resource(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResourceArray *elements = DtwResource_sub_resources(resource->values_resource); - LuaCEmbedTable *response = LuaCembed_new_anonymous_table(args); - - for(int i = 0; i < elements->size; i++) { - DtwResource*current = elements->resources[i]; - LuaCEmbedTable *sub = raw_create_resource(args,current); - - LuaCEmbedTable *args_to_callback = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_append_table(args_to_callback,sub); - LuaCEmbedTable *user_response = LuaCEmbed_run_args_lambda(args,0,args_to_callback,1); - - if(LuaCEmbed_has_errors(args)){ - char *error = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error); - } - long size = LuaCEmbedTable_get_full_size(user_response); - if(size ==1){ - LuaCEmbedTable_append_evaluation(response,"%s[1]",user_response->global_name); - } - - - } - - return LuaCEmbed_send_table(response); -} - -LuaCEmbedResponse * resource_schema_each(LuaCEmbedTable *self, LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResourceArray *elements = DtwResource_get_schema_values(resource); - - if(DtwResource_error(resource)){ - char *message = DtwResource_get_error_message(resource); - return LuaCEmbed_send_error(message); - } - - for(int i = 0; i < elements->size; i++) { - DtwResource*current = elements->resources[i]; - LuaCEmbedTable *sub = raw_create_resource(args,current); - LuaCEmbedTable *args_to_callback = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_append_table(args_to_callback,sub); - LuaCEmbed_run_args_lambda(args,0,args_to_callback,0); - } - if(LuaCEmbed_has_errors(args)){ - printf("%s\n",LuaCEmbed_get_error_message(args)); - } - - return NULL; -} diff --git a/build/c/dependencies/luaDoTheWorld/resource/resource/schema_iterable/schema_iterable.h b/build/c/dependencies/luaDoTheWorld/resource/resource/schema_iterable/schema_iterable.h deleted file mode 100644 index ae3b81a..0000000 --- a/build/c/dependencies/luaDoTheWorld/resource/resource/schema_iterable/schema_iterable.h +++ /dev/null @@ -1,12 +0,0 @@ - -LuaCEmbedResponse * schema_list_resources(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * schema_find_resource(LuaCEmbedTable *self,LuaCEmbed *args); - - -LuaCEmbedResponse * schema_count_resource(LuaCEmbedTable *self,LuaCEmbed *args); - - -LuaCEmbedResponse * schema_map_resource(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * resource_schema_each(LuaCEmbedTable *self, LuaCEmbed *args); diff --git a/build/c/dependencies/luaDoTheWorld/resource/resource/sub_resource/sub_resource.c b/build/c/dependencies/luaDoTheWorld/resource/resource/sub_resource/sub_resource.c deleted file mode 100644 index 79c7306..0000000 --- a/build/c/dependencies/luaDoTheWorld/resource/resource/sub_resource/sub_resource.c +++ /dev/null @@ -1,95 +0,0 @@ - -LuaCEmbedResponse * private_resource_sub_resource_raw(LuaCEmbedTable *self, LuaCEmbed *args,const char *src){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResource *sub_resource = DtwResource_sub_resource(resource,"%s",src); - LuaCEmbedTable *sub = raw_create_resource(args,sub_resource); - return LuaCEmbed_send_table(sub); -} - -LuaCEmbedResponse * resource_sub_resource_index(LuaCEmbedTable *self, LuaCEmbed *args){ - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - - int type = LuaCEmbed_get_arg_type(args,1); - if(type == LUA_CEMBED_NUMBER){ - long raw_index = LuaCEmbed_get_long_arg(args,1); - long i = raw_index-1; - DtwResourceArray *elements = DtwResource_sub_resources(resource); - - if(i >=elements->size || i < 0){ - return NULL; - } - DtwResource *current = elements->resources[i]; - LuaCEmbedTable *sub = raw_create_resource(args,current); - LuaCEmbedTable *response = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_append_long(response,raw_index); - LuaCEmbedTable_append_table(response,sub); - return LuaCEmbed_send_multi_return(response); - } - - char *src = LuaCEmbed_get_str_arg(args,1); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - return private_resource_sub_resource_raw(self,args,src); -} - - - -LuaCEmbedResponse * resource_sub_resource_method(LuaCEmbedTable *self, LuaCEmbed *args){ - char *src = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - return private_resource_sub_resource_raw(self,args,src); -} - -LuaCEmbedResponse * resource_sub_resource_next(LuaCEmbedTable *self,LuaCEmbed *args){ - const char *src = ""; - if(LuaCEmbed_get_total_args(args) > 0){ - src = LuaCEmbed_get_str_arg(args,0); - } - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResource *sub_resource = DtwResource_sub_resource_next(resource,src); - LuaCEmbedTable *sub = raw_create_resource(args,sub_resource); - return LuaCEmbed_send_table(sub); -} - -LuaCEmbedResponse * resource_sub_resource_now(LuaCEmbedTable *self,LuaCEmbed *args){ - const char *src = ""; - if(LuaCEmbed_get_total_args(args) > 0){ - src = LuaCEmbed_get_str_arg(args,0); - } - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResource *sub_resource = DtwResource_sub_resource_now(resource,src); - LuaCEmbedTable *sub = raw_create_resource(args,sub_resource); - return LuaCEmbed_send_table(sub); -} - -LuaCEmbedResponse * resource_sub_resource_now_in_unix(LuaCEmbedTable *self,LuaCEmbed *args){ - const char *src = ""; - if(LuaCEmbed_get_total_args(args) > 0){ - src = LuaCEmbed_get_str_arg(args,0); - } - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - DtwResource *resource = (DtwResource*)LuaCembedTable_get_long_prop(self,RESOURCE_POINTER); - DtwResource *sub_resource = DtwResource_sub_resource_now_in_unix(resource,src); - LuaCEmbedTable *sub = raw_create_resource(args,sub_resource); - return LuaCEmbed_send_table(sub); -} - diff --git a/build/c/dependencies/luaDoTheWorld/resource/resource/sub_resource/sub_resource.h b/build/c/dependencies/luaDoTheWorld/resource/resource/sub_resource/sub_resource.h deleted file mode 100644 index 4a2965b..0000000 --- a/build/c/dependencies/luaDoTheWorld/resource/resource/sub_resource/sub_resource.h +++ /dev/null @@ -1,14 +0,0 @@ - -LuaCEmbedResponse * private_resource_sub_resource_raw(LuaCEmbedTable *self, LuaCEmbed *args,const char *src); - -LuaCEmbedResponse * resource_sub_resource_index(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse * resource_sub_resource_method(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse * resource_sub_resource_next(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * resource_sub_resource_now(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * resource_sub_resource_now_in_unix(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * resource_foreach(LuaCEmbedTable *self,LuaCEmbed *args); diff --git a/build/c/dependencies/luaDoTheWorld/resource/schemas/schemas.c b/build/c/dependencies/luaDoTheWorld/resource/schemas/schemas.c deleted file mode 100644 index aa1871e..0000000 --- a/build/c/dependencies/luaDoTheWorld/resource/schemas/schemas.c +++ /dev/null @@ -1,53 +0,0 @@ - - -LuaCEmbedResponse * add_schema_primary_keys(LuaCEmbedTable *self,LuaCEmbed *args){ - - DtwSchema *schema = (DtwSchema*)LuaCembedTable_get_long_prop(self,SCHEMA_POINTER); - int arg_type = LuaCEmbed_get_arg_type(args,0); - if(arg_type == LUA_CEMBED_STRING){ - char *value = LuaCEmbed_get_str_arg(args,0); - DtwSchema_add_primary_key(schema,value); - return LuaCEmbed_send_table(self); - } - - if(arg_type != LUA_CEMBED_TABLE){ - return LuaCEmbed_send_error(ARGUMENT_NOT_IN_STRING_OR_STRING_ARRAY); - } - - LuaCEmbedTable *string_array = LuaCEmbed_get_arg_table(args,0); - long size = LuaCEmbedTable_get_full_size(string_array); - for(int i = 0; i < size;i++){ - int current_type = LuaCEmbedTable_get_type_by_index(string_array,i); - if(current_type != LUA_CEMBED_STRING){ - return LuaCEmbed_send_error(ARGUMENT_NOT_IN_STRING_OR_STRING_ARRAY); - } - } - - for(int i = 0; i < size;i++){ - char *current_value = LuaCEmbedTable_get_string_by_index(string_array,i); - DtwSchema_add_primary_key(schema,current_value); - } - return LuaCEmbed_send_table(self); -} - -LuaCEmbedResponse * add_sub_schema(LuaCEmbedTable *self,LuaCEmbed *args){ - char *name = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(message); - } - - DtwSchema *schema = (DtwSchema*)LuaCembedTable_get_long_prop(self,SCHEMA_POINTER); - DtwSchema *sub_schmea = DtwSchema_new_subSchema(schema,name); - LuaCEmbedTable *created_table = raw_create_schema(args,sub_schmea); - return LuaCEmbed_send_table(created_table); -} - -LuaCEmbedTable * raw_create_schema(LuaCEmbed *args,DtwSchema *schema){ - LuaCEmbedTable *created= LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_set_long_prop(created,SCHEMA_POINTER,(long long )schema); - LuaCEmbedTable_set_method(created,ADD_PRIMARY_KEYS,add_schema_primary_keys); - LuaCEmbedTable_set_method(created,ADD_SUB_SCHEMA_METHOD,add_sub_schema); - return created; -} - diff --git a/build/c/dependencies/luaDoTheWorld/resource/schemas/schemas.h b/build/c/dependencies/luaDoTheWorld/resource/schemas/schemas.h deleted file mode 100644 index 6e40059..0000000 --- a/build/c/dependencies/luaDoTheWorld/resource/schemas/schemas.h +++ /dev/null @@ -1,8 +0,0 @@ - - -LuaCEmbedResponse * add_schema_primary_keys(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * add_sub_schema(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedTable * raw_create_schema(LuaCEmbed *args,DtwSchema *schema); - diff --git a/build/c/dependencies/luaDoTheWorld/sha/sha.c b/build/c/dependencies/luaDoTheWorld/sha/sha.c deleted file mode 100644 index 1626d24..0000000 --- a/build/c/dependencies/luaDoTheWorld/sha/sha.c +++ /dev/null @@ -1,74 +0,0 @@ - - -LuaCEmbedResponse * generate_sha_from_file(LuaCEmbed *args){ - char *source = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - char *sha = dtw_generate_sha_from_file(source); - if(!sha){ - char *formmated = private_LuaCembed_format(FILE_NOT_FOUND,source); - LuaCEmbedResponse *response = LuaCEmbed_send_error(formmated); - free(formmated); - return response; - } - LuaCEmbedResponse *response = LuaCEmbed_send_str(sha); - free(sha); - return response; -} -LuaCEmbedResponse * generate_sha_from_folder_by_content(LuaCEmbed *args){ - char *source = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - DtwHash *hash = newDtwHash(); - bool result = DtwHash_digest_folder_by_content(hash,source); - if(!result){ - char *content = private_LuaCembed_format(FILE_NOT_FOUND,source); - LuaCEmbedResponse*response = LuaCEmbed_send_error(content); - free(content); - DtwHash_free(hash); - return response; - } - LuaCEmbedResponse *response = LuaCEmbed_send_str(hash->hash); - DtwHash_free(hash); - return response; -} - -LuaCEmbedResponse * generate_sha_from_folder_by_last_modification(LuaCEmbed *args){ - char *source = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - DtwHash *hash = newDtwHash(); - bool result = DtwHash_digest_folder_by_last_modification(hash,source); - if(!result){ - char *content = private_LuaCembed_format(FILE_NOT_FOUND,source); - LuaCEmbedResponse*response = LuaCEmbed_send_error(content); - free(content); - DtwHash_free(hash); - return response; - } - LuaCEmbedResponse *response = LuaCEmbed_send_str(hash->hash); - DtwHash_free(hash); - return response; -} - -LuaCEmbedResponse * generate_sha(LuaCEmbed *args){ - Writeble write_obj = create_writeble(args,0); - if(write_obj.error){ - return write_obj.error; - } - char *sha = dtw_generate_sha_from_any(write_obj.content,write_obj.size); - Writeble_free(&write_obj); - LuaCEmbedResponse *response = LuaCEmbed_send_str(sha); - free(sha); - return response; -} - diff --git a/build/c/dependencies/luaDoTheWorld/sha/sha.h b/build/c/dependencies/luaDoTheWorld/sha/sha.h deleted file mode 100644 index 89e3678..0000000 --- a/build/c/dependencies/luaDoTheWorld/sha/sha.h +++ /dev/null @@ -1,10 +0,0 @@ - - -LuaCEmbedResponse * generate_sha_from_file(LuaCEmbed *args); - -LuaCEmbedResponse * generate_sha_from_folder_by_content(LuaCEmbed *args); - -LuaCEmbedResponse * generate_sha_from_folder_by_last_modification(LuaCEmbed *args); - -LuaCEmbedResponse * generate_sha(LuaCEmbed *args); - diff --git a/build/c/dependencies/luaDoTheWorld/transaction/action_transactions/action_transaction.c b/build/c/dependencies/luaDoTheWorld/transaction/action_transactions/action_transaction.c deleted file mode 100644 index e140758..0000000 --- a/build/c/dependencies/luaDoTheWorld/transaction/action_transactions/action_transaction.c +++ /dev/null @@ -1,111 +0,0 @@ - - -LuaCEmbedResponse *action_transaction_get_transaction_type_code(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwActionTransaction *transaction = (DtwActionTransaction *) LuaCembedTable_get_long_prop(self,ACTION_TRANSACTION_POINTER); - return LuaCEmbed_send_long(transaction->action_type); -} - -LuaCEmbedResponse *action_transaction_get_transaction_type(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwActionTransaction *transaction = (DtwActionTransaction *) LuaCembedTable_get_long_prop(self,ACTION_TRANSACTION_POINTER); - int type = transaction->action_type; - const char *converted = DtwActionTransaction_convert_action_to_string(type); - return LuaCEmbed_send_str_reference(converted); -} - - -LuaCEmbedResponse *action_transaction_get_content(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwActionTransaction *transaction = (DtwActionTransaction *) LuaCembedTable_get_long_prop(self,ACTION_TRANSACTION_POINTER); - if(transaction->content==NULL){ - return NULL; - } - return LuaCEmbed_send_raw_string_reference((char*)transaction->content, transaction->size); -} - - -LuaCEmbedResponse *action_transaction_set_content(LuaCEmbedTable *self,LuaCEmbed *args){ - Writeble write_obj = create_writeble(args,0); - if(write_obj.error){ - return write_obj.error; - } - DtwActionTransaction *transaction = (DtwActionTransaction *) LuaCembedTable_get_long_prop(self,ACTION_TRANSACTION_POINTER); - - if(transaction->content){ - free(transaction->content); - } - transaction->content = (unsigned char *)malloc((write_obj.size + 1)* sizeof(unsigned char)); - memcpy(transaction->content,write_obj.content,write_obj.size); - transaction->size = write_obj.size; - return NULL; -} - - -LuaCEmbedResponse *action_transaction_set_source(LuaCEmbedTable *self,LuaCEmbed *args){ - char *new_source = LuaCEmbed_get_str_arg(args, 0); - - if (LuaCEmbed_has_errors(args)) { - char *error = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error); - } - - DtwActionTransaction *transaction = (DtwActionTransaction *) LuaCembedTable_get_long_prop(self, - ACTION_TRANSACTION_POINTER); - - if (transaction->source != NULL) { - free(transaction->source); - } - transaction->source = strdup(new_source); - - return NULL; -} - -LuaCEmbedResponse *action_transaction_set_dest(LuaCEmbedTable *self,LuaCEmbed *args){ - - char *new_dest = LuaCEmbed_get_str_arg(args,0); - - if(LuaCEmbed_has_errors(args)) { - char * error = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error); - } - DtwActionTransaction *transaction = (DtwActionTransaction *) LuaCembedTable_get_long_prop(self,ACTION_TRANSACTION_POINTER); - - if (transaction->dest != NULL) { - free(transaction->dest); - } - transaction->dest = strdup(new_dest); - - return NULL; -} - -LuaCEmbedResponse *action_transaction_get_source(LuaCEmbedTable *self,LuaCEmbed *args){ - - DtwActionTransaction *transaction = (DtwActionTransaction *) LuaCembedTable_get_long_prop(self, - ACTION_TRANSACTION_POINTER); - if (transaction->source) { - return LuaCEmbed_send_str_reference(transaction->source); - } - return NULL; -} - -LuaCEmbedResponse *action_transaction_get_dest(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwActionTransaction *transaction = (DtwActionTransaction*)LuaCembedTable_get_long_prop(self,ACTION_TRANSACTION_POINTER); - if(transaction->dest){ - return LuaCEmbed_send_str_reference(transaction->dest); - } - return NULL; -} - -LuaCEmbedTable *raw_create_action_transaction(LuaCEmbed *args,DtwActionTransaction *transaction){ - LuaCEmbedTable * table = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_set_long_prop(table,DTW_TYPE,DTW_ACTION_TRANSACTION_TYPE); - LuaCEmbedTable_set_long_prop(table,ACTION_TRANSACTION_POINTER,(long long )transaction); - LuaCEmbedTable_set_method(table,LUA_DO_THE_WORLD_GET_DEST,action_transaction_get_dest); - LuaCEmbedTable_set_method(table,LUA_DO_THE_WORLD_SET_DEST,action_transaction_set_dest); - LuaCEmbedTable_set_method(table,LUA_DO_THE_WORLD_GET_SOURCE,action_transaction_get_source); - LuaCEmbedTable_set_method(table, LUA_DO_THE_WORLD_SET_SOURCE, action_transaction_set_source); - LuaCEmbedTable_set_method(table, LUA_DO_THE_WORLD_GET_TRANSACTION_TYPE_TEXT, action_transaction_get_transaction_type); - LuaCEmbedTable_set_method(table, LUA_DO_THE_WORLD_GET_TRANSACTION_TYPE_CODE,action_transaction_get_transaction_type_code); - LuaCEmbedTable_set_method(table, LUA_DO_THE_WORLD_GET_CONTENT, action_transaction_get_content); - LuaCEmbedTable_set_method(table, LUA_DO_THE_WORLD_SET_CONTENT, action_transaction_set_content); - - return table; -} \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/transaction/action_transactions/action_transaction.h b/build/c/dependencies/luaDoTheWorld/transaction/action_transactions/action_transaction.h deleted file mode 100644 index c1a2334..0000000 --- a/build/c/dependencies/luaDoTheWorld/transaction/action_transactions/action_transaction.h +++ /dev/null @@ -1,18 +0,0 @@ - -LuaCEmbedResponse *action_transaction_get_transaction_type_code(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse *action_transaction_get_transaction_type(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse *action_transaction_get_content(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse *action_transaction_set_content(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse *action_transaction_set_source(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse *action_transaction_set_dest(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse *action_transaction_get_source(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse *action_transaction_get_dest(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedTable *raw_create_action_transaction(LuaCEmbed *args,DtwActionTransaction *transaction); diff --git a/build/c/dependencies/luaDoTheWorld/transaction/declaration.h b/build/c/dependencies/luaDoTheWorld/transaction/declaration.h deleted file mode 100644 index f97f307..0000000 --- a/build/c/dependencies/luaDoTheWorld/transaction/declaration.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "action_transactions/action_transaction.h" -#include "transactions/declaration.h" diff --git a/build/c/dependencies/luaDoTheWorld/transaction/definition.h b/build/c/dependencies/luaDoTheWorld/transaction/definition.h deleted file mode 100644 index 2ed7fdf..0000000 --- a/build/c/dependencies/luaDoTheWorld/transaction/definition.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "action_transactions/action_transaction.c" -#include "transactions/definitions.h" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/transaction/transactions/actions/actions.c b/build/c/dependencies/luaDoTheWorld/transaction/transactions/actions/actions.c deleted file mode 100644 index aa86ccf..0000000 --- a/build/c/dependencies/luaDoTheWorld/transaction/transactions/actions/actions.c +++ /dev/null @@ -1,61 +0,0 @@ -LuaCEmbedResponse * transaction_write(LuaCEmbedTable *self,LuaCEmbed *args){ - - char *filename = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - - - Writeble write_obj = create_writeble(args,1); - if(write_obj.error){ - return write_obj.error; - } - bool is_binary = false; - for(int i = 0; i < write_obj.size; i++){ - if(write_obj.content[i] == '\0'){ - is_binary = true; - } - } - DtwTransaction *t = (DtwTransaction*)LuaCembedTable_get_long_prop(self,TRANSACTION_POINTER); - DtwTransaction_write_any(t,filename,write_obj.content,write_obj.size,is_binary); - return LuaCEmbed_send_table(self); -} - - -LuaCEmbedResponse * transaction_remove_any(LuaCEmbedTable *self,LuaCEmbed *args) { - char *source = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - DtwTransaction *t = (DtwTransaction*)LuaCembedTable_get_long_prop(self,TRANSACTION_POINTER); - DtwTransaction_delete_any(t,source); - return LuaCEmbed_send_table(self); -} - -LuaCEmbedResponse * transaction_copy_any(LuaCEmbedTable *self,LuaCEmbed *args) { - char *source = LuaCEmbed_get_str_arg(args,0); - char *dest = LuaCEmbed_get_str_arg(args,1); - - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - DtwTransaction *t = (DtwTransaction*)LuaCembedTable_get_long_prop(self,TRANSACTION_POINTER); - DtwTransaction_copy_any(t,source,dest); - return LuaCEmbed_send_table(self); -} - -LuaCEmbedResponse * transaction_move_any(LuaCEmbedTable *self,LuaCEmbed *args) { - char *source = LuaCEmbed_get_str_arg(args,0); - char *dest = LuaCEmbed_get_str_arg(args,1); - - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - DtwTransaction *t = (DtwTransaction*)LuaCembedTable_get_long_prop(self,TRANSACTION_POINTER); - DtwTransaction_move_any(t,source,dest); - return LuaCEmbed_send_table(self); -} diff --git a/build/c/dependencies/luaDoTheWorld/transaction/transactions/actions/actions.h b/build/c/dependencies/luaDoTheWorld/transaction/transactions/actions/actions.h deleted file mode 100644 index 71cf8b9..0000000 --- a/build/c/dependencies/luaDoTheWorld/transaction/transactions/actions/actions.h +++ /dev/null @@ -1,8 +0,0 @@ - -LuaCEmbedResponse * transaction_write(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * transaction_remove_any(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * transaction_copy_any(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * transaction_move_any(LuaCEmbedTable *self,LuaCEmbed *args); diff --git a/build/c/dependencies/luaDoTheWorld/transaction/transactions/basic/basic.c b/build/c/dependencies/luaDoTheWorld/transaction/transactions/basic/basic.c deleted file mode 100644 index eb8770b..0000000 --- a/build/c/dependencies/luaDoTheWorld/transaction/transactions/basic/basic.c +++ /dev/null @@ -1,65 +0,0 @@ - - - - - - -LuaCEmbedResponse * transaction_commit(LuaCEmbedTable *self,LuaCEmbed *args) { - - const char *path = NULL; - if(LuaCEmbed_get_total_args(args) > 0){ - path = LuaCEmbed_get_str_arg(args,0); - } - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - DtwTransaction *t = (DtwTransaction*)LuaCembedTable_get_long_prop(self,TRANSACTION_POINTER); - DtwTransaction_commit(t,path); - return LuaCEmbed_send_table(self); -} - - - -LuaCEmbedResponse * transaction_delete(LuaCEmbedTable *self,LuaCEmbed *args) { - DtwTransaction *t = (DtwTransaction*)LuaCembedTable_get_long_prop(self,TRANSACTION_POINTER); - bool ref = LuaCembedTable_get_bool_prop(self,IS_A_REF); - if(!ref){ - DtwTransaction_free(t); - } - return NULL; -} - - -void private_transaction_add_base_methods(LuaCEmbedTable *self,DtwTransaction *transaction){ - LuaCEmbedTable_set_long_prop(self,TRANSACTION_POINTER,(long long)transaction); - LuaCEmbedTable_set_method(self,WRITE_METHOD,transaction_write); - LuaCEmbedTable_set_method(self,COPY_ANY_METHOD,transaction_copy_any); - LuaCEmbedTable_set_method(self,REMOVE_ANY_METHOD,transaction_remove_any); - LuaCEmbedTable_set_method(self,MOVE_ANY_METHOD,transaction_move_any); - LuaCEmbedTable_set_method(self,COPY_ANY_METHOD,transaction_copy_any); - LuaCEmbedTable_set_method(self,COMMIT_METHOD,transaction_commit); - LuaCEmbedTable_set_method(self,DUMP_TO_JSON_FILE_METHOD,transaction_dumps_to_json_file); - LuaCEmbedTable_set_method(self,DUMP_TO_JSON_STRING,transaction_dumps_to_json_string); - LuaCEmbedTable_set_method(self,EACH_METHOD,transaction_foreach); - LuaCEmbedTable_set_method(self,MAP_METHOD,transaction_map); - LuaCEmbedTable_set_method(self,COUNT_METHOD,transaction_count); - LuaCEmbedTable_set_method(self,INDEX_METHOD,transaction_index); - LuaCEmbedTable_set_method(self,FIND_METHOD,transaction_find); - LuaCEmbedTable_set_method(self,DELETE_METHOD,transaction_delete); - -} - - -LuaCEmbedResponse * transaction_new_transaction(LuaCEmbed *args){ - LuaCEmbedTable * self = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_set_bool_prop(self,IS_A_REF,false); - DtwTransaction *transaction = newDtwTransaction(); - LuaCEmbedTable_set_long_prop(self,TRANSACTION_POINTER,(long long)transaction); - if(LuaCEmbed_has_errors(self->main_object)){ - printf("error %s\n", LuaCEmbed_get_error_message(self->main_object)); - } - - private_transaction_add_base_methods(self,transaction); - return LuaCEmbed_send_table(self); -} diff --git a/build/c/dependencies/luaDoTheWorld/transaction/transactions/basic/basic.h b/build/c/dependencies/luaDoTheWorld/transaction/transactions/basic/basic.h deleted file mode 100644 index dace7ff..0000000 --- a/build/c/dependencies/luaDoTheWorld/transaction/transactions/basic/basic.h +++ /dev/null @@ -1,9 +0,0 @@ -LuaCEmbedResponse * transaction_commit(LuaCEmbedTable *self,LuaCEmbed *args); - - -LuaCEmbedResponse * transaction_delete(LuaCEmbedTable *self,LuaCEmbed *args); - -void private_transaction_add_base_methods(LuaCEmbedTable *self,DtwTransaction *transaction); - - -LuaCEmbedResponse * transaction_new_transaction(LuaCEmbed *args); \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/transaction/transactions/declaration.h b/build/c/dependencies/luaDoTheWorld/transaction/transactions/declaration.h deleted file mode 100644 index 29d92f6..0000000 --- a/build/c/dependencies/luaDoTheWorld/transaction/transactions/declaration.h +++ /dev/null @@ -1,4 +0,0 @@ -#include "basic/basic.h" -#include "json_parsment/json_parsement.h" -#include "actions/actions.h" -#include "iterables/iterables.h" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/transaction/transactions/definitions.h b/build/c/dependencies/luaDoTheWorld/transaction/transactions/definitions.h deleted file mode 100644 index 71b70c9..0000000 --- a/build/c/dependencies/luaDoTheWorld/transaction/transactions/definitions.h +++ /dev/null @@ -1,5 +0,0 @@ - -#include "basic/basic.c" -#include "json_parsment/json_parsement.c" -#include "actions/actions.c" -#include "iterables/iterables.c" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/transaction/transactions/iterables/iterables.c b/build/c/dependencies/luaDoTheWorld/transaction/transactions/iterables/iterables.c deleted file mode 100644 index eda7f8b..0000000 --- a/build/c/dependencies/luaDoTheWorld/transaction/transactions/iterables/iterables.c +++ /dev/null @@ -1,115 +0,0 @@ - - - -LuaCEmbedResponse * transaction_index(LuaCEmbedTable *self,LuaCEmbed *args){ - - long index = LuaCEmbed_get_long_arg(args,1); - if(LuaCEmbed_has_errors(args)){ - printf("pegou aqui passando %s\n",LuaCEmbed_get_str_arg(args,1)); - char *error = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error); - } - long converted = index -1; - - DtwTransaction *transaction = (DtwTransaction*)LuaCembedTable_get_long_prop(self,TRANSACTION_POINTER); - if(converted >= transaction->size || converted < 0){ - return NULL; - } - LuaCEmbedTable *table = raw_create_action_transaction(args,transaction->actions[converted]); - return LuaCEmbed_send_table(table); -} - -LuaCEmbedResponse * transaction_foreach(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwTransaction *transaction = (DtwTransaction*)LuaCembedTable_get_long_prop(self,TRANSACTION_POINTER); - for(long i = 0 ; i < transaction->size; i++){ - DtwActionTransaction *action = transaction->actions[i]; - LuaCEmbedTable *table = raw_create_action_transaction(args,action); - LuaCEmbedTable * args_of_callbac = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_append_table(args_of_callbac,table); - LuaCEmbed_run_args_lambda(args,0,args_of_callbac,0); - if(LuaCEmbed_has_errors(args)){ - char *error = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error); - } - } - return NULL; -} - -LuaCEmbedResponse * transaction_map(LuaCEmbedTable *self,LuaCEmbed *args){ - - DtwTransaction *transaction = (DtwTransaction*)LuaCembedTable_get_long_prop(self,TRANSACTION_POINTER); - LuaCEmbedTable *final_map = LuaCembed_new_anonymous_table(args); - for(long i = 0 ; i < transaction->size; i++){ - DtwActionTransaction *action = transaction->actions[i]; - LuaCEmbedTable *table = raw_create_action_transaction(args,action); - LuaCEmbedTable * args_of_callbac = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_append_table(args_of_callbac,table); - LuaCEmbedTable * response_values = LuaCEmbed_run_args_lambda(args,0,args_of_callbac,0); - if(LuaCEmbed_has_errors(args)){ - - char *error = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error); - } - - int response_type =LuaCEmbedTable_get_type_by_index(response_values,0); - if(response_type!= LUA_CEMBED_NIL && response_type != LUA_CEMBED_NOT_FOUND){ - LuaCEmbedTable_append_evaluation(final_map,"%s[1]",response_values->global_name); - } - } - - return LuaCEmbed_send_table(final_map); -} - -LuaCEmbedResponse * transaction_find(LuaCEmbedTable *self,LuaCEmbed *args){ - - DtwTransaction *transaction = (DtwTransaction*)LuaCembedTable_get_long_prop(self,TRANSACTION_POINTER); - for(long i = 0 ; i < transaction->size; i++){ - DtwActionTransaction *action = transaction->actions[i]; - LuaCEmbedTable *table = raw_create_action_transaction(args,action); - LuaCEmbedTable * args_of_callbac = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_append_table(args_of_callbac,table); - LuaCEmbedTable * response_values = LuaCEmbed_run_args_lambda(args,0,args_of_callbac,1); - if(LuaCEmbed_has_errors(args)){ - char *error = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error); - } - int response_type =LuaCEmbedTable_get_type_by_index(response_values,0); - if(response_type == LUA_CEMBED_BOOL){ - return LuaCEmbed_send_bool( - LuaCEmbedTable_get_bool_by_index(response_values,0) - ); - } - } - - return NULL; -} - - -LuaCEmbedResponse * transaction_count(LuaCEmbedTable *self,LuaCEmbed *args){ - - DtwTransaction *transaction = (DtwTransaction*)LuaCembedTable_get_long_prop(self,TRANSACTION_POINTER); - long total = 0; - for(long i = 0 ; i < transaction->size; i++){ - DtwActionTransaction *action = transaction->actions[i]; - LuaCEmbedTable *table = raw_create_action_transaction(args,action); - LuaCEmbedTable * args_of_callbac = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_append_table(args_of_callbac,table); - LuaCEmbedTable * response_values = LuaCEmbed_run_args_lambda(args,0,args_of_callbac,1); - if(LuaCEmbed_has_errors(args)){ - char *error = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error); - } - int response_type =LuaCEmbedTable_get_type_by_index(response_values,0); - if(response_type != LUA_CEMBED_BOOL){ - continue; - } - bool value = LuaCEmbedTable_get_bool_by_index(response_values,0); - if(value){ - total+=1; - } - - } - - return LuaCEmbed_send_long(total); -} - diff --git a/build/c/dependencies/luaDoTheWorld/transaction/transactions/iterables/iterables.h b/build/c/dependencies/luaDoTheWorld/transaction/transactions/iterables/iterables.h deleted file mode 100644 index 845788c..0000000 --- a/build/c/dependencies/luaDoTheWorld/transaction/transactions/iterables/iterables.h +++ /dev/null @@ -1,11 +0,0 @@ - - -LuaCEmbedResponse * transaction_index(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * transaction_foreach(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * transaction_map(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * transaction_find(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * transaction_count(LuaCEmbedTable *self,LuaCEmbed *args); diff --git a/build/c/dependencies/luaDoTheWorld/transaction/transactions/json_parsment/json_parsement.c b/build/c/dependencies/luaDoTheWorld/transaction/transactions/json_parsment/json_parsement.c deleted file mode 100644 index 8dae106..0000000 --- a/build/c/dependencies/luaDoTheWorld/transaction/transactions/json_parsment/json_parsement.c +++ /dev/null @@ -1,111 +0,0 @@ - -LuaCEmbedResponse * transaction_dumps_to_json_file(LuaCEmbedTable *self,LuaCEmbed *args) { - - char *filename = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - DtwTransaction *t = (DtwTransaction*)LuaCembedTable_get_long_prop(self,TRANSACTION_POINTER); - DtwTransaction_dumps_to_json_file(t,filename); - - return LuaCEmbed_send_table(self); -} - -LuaCEmbedResponse * transaction_dumps_to_json_string(LuaCEmbedTable *self,LuaCEmbed *args) { - - DtwTransaction *t = (DtwTransaction*)LuaCembedTable_get_long_prop(self,TRANSACTION_POINTER); - cJSON *parsed = DtwTransaction_dumps_to_json(t); - char * content = cJSON_Print(parsed); - - LuaCEmbedResponse *response = LuaCEmbed_send_str(content); - cJSON_Delete(parsed); - free(content); - return response; -} - -LuaCEmbedResponse * create_empty_transaction_from_json_string(LuaCEmbed *args) { - - char *content = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - UniversalGarbage *garbage = newUniversalGarbage(); - - cJSON * parsed = cJSON_Parse(content); - UniversalGarbage_add(garbage,cJSON_Delete,parsed); - if(parsed == NULL) { - LuaCEmbedResponse *response = LuaCEmbed_send_error(INVALID_JSON_STRING); - UniversalGarbage_free(garbage); - return response; - } - - DtwTransaction * transaction_obj = newDtwTransaction_from_json(parsed); - if(transaction_obj == NULL) { - DtwJsonTransactionError * error = dtw_validate_json_transaction(parsed); - UniversalGarbage_add(garbage,DtwJsonTransactionError_free,error); - LuaCEmbedResponse *response = LuaCEmbed_send_error(error->mensage); - UniversalGarbage_free(garbage); - return response; - } - - LuaCEmbedTable * self = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_set_method(self,IS_A_REF,false); - private_transaction_add_base_methods(self,transaction_obj); - UniversalGarbage_free(garbage); - return LuaCEmbed_send_table(self); - - -} - - -LuaCEmbedResponse * create_empty_transaction_from_json_file(LuaCEmbed *args) { - - char *filename = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_message = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_message); - } - UniversalGarbage *garbage = newUniversalGarbage(); - - char *content = dtw_load_string_file_content(filename); - UniversalGarbage_add_simple(garbage,content); - - if(content == NULL) { - char *error = private_LuaCembed_format(FILE_NOT_FOUND,filename); - UniversalGarbage_add_simple(garbage,error); - LuaCEmbedResponse *response = LuaCEmbed_send_error(error); - UniversalGarbage_free(garbage); - return response; - } - cJSON * parsed = cJSON_Parse(content); - UniversalGarbage_add(garbage,cJSON_Delete,parsed); - - - if(parsed == NULL) { - char *error = private_LuaCembed_format(INVALID_JSON_FILE,filename); - UniversalGarbage_add_simple(garbage,error); - LuaCEmbedResponse *response = LuaCEmbed_send_error(error); - UniversalGarbage_free(garbage); - return response; - } - - - DtwTransaction * transaction_obj = newDtwTransaction_from_json(parsed); - if(transaction_obj == NULL) { - DtwJsonTransactionError * error = dtw_validate_json_transaction(parsed); - UniversalGarbage_add(garbage,DtwJsonTransactionError_free,error); - LuaCEmbedResponse *response = LuaCEmbed_send_error(error->mensage); - UniversalGarbage_free(garbage); - return response; - } - - LuaCEmbedTable * self = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_set_method(self,IS_A_REF,false); - private_transaction_add_base_methods(self,transaction_obj); - UniversalGarbage_free(garbage); - return LuaCEmbed_send_table(self); - - -} \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/transaction/transactions/json_parsment/json_parsement.h b/build/c/dependencies/luaDoTheWorld/transaction/transactions/json_parsment/json_parsement.h deleted file mode 100644 index ebaa057..0000000 --- a/build/c/dependencies/luaDoTheWorld/transaction/transactions/json_parsment/json_parsement.h +++ /dev/null @@ -1,10 +0,0 @@ - -LuaCEmbedResponse * transaction_dumps_to_json_file(LuaCEmbedTable *self,LuaCEmbed *args); - - - -LuaCEmbedResponse * transaction_dumps_to_json_string(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * create_empty_transaction_from_json_string(LuaCEmbed *args); - -LuaCEmbedResponse * create_empty_transaction_from_json_file(LuaCEmbed *args); diff --git a/build/c/dependencies/luaDoTheWorld/tree/declaration.h b/build/c/dependencies/luaDoTheWorld/tree/declaration.h deleted file mode 100644 index 3362172..0000000 --- a/build/c/dependencies/luaDoTheWorld/tree/declaration.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "tree_part/tree_part.h" -#include "tree/declaration.h" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/tree/definition.h b/build/c/dependencies/luaDoTheWorld/tree/definition.h deleted file mode 100644 index f9754f5..0000000 --- a/build/c/dependencies/luaDoTheWorld/tree/definition.h +++ /dev/null @@ -1,2 +0,0 @@ -#include "tree_part/tree_part.c" -#include "tree/definition.h" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/tree/tree/basic/basic.c b/build/c/dependencies/luaDoTheWorld/tree/tree/basic/basic.c deleted file mode 100644 index df8c7ce..0000000 --- a/build/c/dependencies/luaDoTheWorld/tree/tree/basic/basic.c +++ /dev/null @@ -1,98 +0,0 @@ - - -LuaCEmbedResponse *hardware_commit_tree(LuaCEmbedTable *self, LuaCEmbed *args){ - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - DtwTree_hardware_commit_tree(self_tree); - return LuaCEmbed_send_table(self); -} - - -LuaCEmbedResponse *tree_get_size(LuaCEmbedTable *self, LuaCEmbed *args){ - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - return LuaCEmbed_send_long(self_tree->size); -} - - - -LuaCEmbedResponse *insecure_hardware_write_tree(LuaCEmbedTable *self, LuaCEmbed *args){ - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - DtwTree_insecure_hardware_write_tree(self_tree); - return LuaCEmbed_send_table(self); -} - - -LuaCEmbedResponse *insecure_hardware_remove_tree(LuaCEmbedTable *self, LuaCEmbed *args){ - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - DtwTree_insecure_hardware_remove_tree(self_tree); - return LuaCEmbed_send_table(self); -} - -LuaCEmbedResponse * tree_delete(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - DtwTree_free(self_tree); - return NULL; -} - -LuaCEmbedTable * raw_create_tree(LuaCEmbed *args,DtwTree *tree){ - LuaCEmbedTable *self = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_set_long_prop(self,TREE_POINTER,(long long)tree); - LuaCEmbedTable_set_method(self,TREE_NEW_TREE_PART_EMPTY,new_tree_part_empty); - LuaCEmbedTable_set_method(self,TREE_NEW_TREE_PART_LOADING,new_tree_part_loading); - LuaCEmbedTable_set_method(self,GET_TREE_PART_BY_INDEX_METHOD,get_tree_part_by_index); - LuaCEmbedTable_set_method(self,INSECURE_HARDWARE_WRITE_TREE,insecure_hardware_write_tree); - LuaCEmbedTable_set_method(self,INSECURE_HARDWARE_REMOVE_TREE,insecure_hardware_remove_tree); - LuaCEmbedTable_set_method(self,COMMIT_METHOD,hardware_commit_tree); - LuaCEmbedTable_set_method(self,GET_SIZE_METHOD,tree_get_size); - LuaCEmbedTable_set_method(self,GET_TREE_PART_BY_NAME,tree_get_tree_part_by_name); - LuaCEmbedTable_set_method(self,GET_TREE_PART_BY_PATH,tree_get_tree_part_by_path); - LuaCEmbedTable_set_method(self,FIND_METHOD,tree_find); - LuaCEmbedTable_set_method(self,COUNT_METHOD,tree_count); - LuaCEmbedTable_set_method(self,MAP_METHOD,tree_map); - LuaCEmbedTable_set_method(self,EACH_METHOD,tree_foreach); - LuaCEmbedTable_set_method(self,DUMP_TO_JSON_STRING,tree_dump_to_json_string); - LuaCEmbedTable_set_method(self,DUMP_TO_JSON_FILE_METHOD,tree_dump_to_json_file); - LuaCEmbedTable_set_method(self,DELETE_METHOD,tree_delete); - return self; -} - -LuaCEmbedResponse * create_empty_tree(LuaCEmbed *args){ - DtwTree * tree = newDtwTree(); - LuaCEmbedTable *self = raw_create_tree(args,tree); - return LuaCEmbed_send_table(self); -} - -DtwTreeProps create_tree_props(LuaCEmbedTable *user_props){ - DtwTreeProps tree_props = {0}; - tree_props.content = get_table_props_or_default_bool(user_props,TREE_PROPS_CONTENT,DTW_INCLUDE) +1; - tree_props.content_data = get_table_props_or_default_bool(user_props,TREE_PROPS_CONTENT_DATA,DTW_INCLUDE)+1; - tree_props.hadware_data = get_table_props_or_default_bool(user_props,TREE_PROPS_HARDWARE_DATA,DTW_INCLUDE)+1; - tree_props.ignored_elements = get_table_props_or_default_bool(user_props,TREE_PROPS_IGNORED_ELEMENTS,DTW_INCLUDE)+1; - tree_props.minification = get_table_props_or_default_bool(user_props,TREE_PROPS_MIMIFICATION,DTW_NOT_MIMIFY)+1; - tree_props.path_atributes = get_table_props_or_default_bool(user_props,TREE_PROPS_PATH_ATTRIBUTES,DTW_INCLUDE)+1; - return tree_props; -} - -LuaCEmbedResponse * create_tree_fro_hardware(LuaCEmbed *args){ - - char *path = LuaCEmbed_get_str_arg(args,0); - LuaCEmbedTable *props_table = NULL; - if(LuaCEmbed_get_arg_type(args,1) != LUA_CEMBED_NIL){ - printf("value %s\n",LuaCEmbed_get_str_arg(args,0)); - printf("value1 %s\n",LuaCEmbed_get_str_arg(args,1)); - props_table = LuaCEmbed_get_arg_table(args,1); - } - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - - DtwTreeProps props = create_tree_props(props_table); - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - DtwTree * tree = newDtwTree(); - LuaCEmbedTable *self = raw_create_tree(args,tree); - DtwTree_add_tree_from_hardware(tree,path,props); - return LuaCEmbed_send_table(self); -} diff --git a/build/c/dependencies/luaDoTheWorld/tree/tree/basic/basic.h b/build/c/dependencies/luaDoTheWorld/tree/tree/basic/basic.h deleted file mode 100644 index 87ac909..0000000 --- a/build/c/dependencies/luaDoTheWorld/tree/tree/basic/basic.h +++ /dev/null @@ -1,24 +0,0 @@ - -LuaCEmbedResponse *hardware_commit_tree(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse *tree_get_size(LuaCEmbedTable *self, LuaCEmbed *args); - - - - -LuaCEmbedResponse *insecure_hardware_write_tree(LuaCEmbedTable *self, LuaCEmbed *args); - - -LuaCEmbedResponse *insecure_hardware_remove_tree(LuaCEmbedTable *self, LuaCEmbed *args); - - -LuaCEmbedTable * raw_create_tree(LuaCEmbed *args,DtwTree *tree); - - -LuaCEmbedResponse * create_empty_tree(LuaCEmbed *args); - -DtwTreeProps create_tree_props(LuaCEmbedTable *user_props); - -LuaCEmbedResponse * tree_delete(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * create_tree_fro_hardware(LuaCEmbed *args); diff --git a/build/c/dependencies/luaDoTheWorld/tree/tree/declaration.h b/build/c/dependencies/luaDoTheWorld/tree/tree/declaration.h deleted file mode 100644 index 78672a8..0000000 --- a/build/c/dependencies/luaDoTheWorld/tree/tree/declaration.h +++ /dev/null @@ -1,4 +0,0 @@ -#include "basic/basic.h" -#include "iterables/iterables.h" -#include "json_tree/json_tree.h" -#include "tree_parts/tree_parts.h" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/tree/tree/definition.h b/build/c/dependencies/luaDoTheWorld/tree/tree/definition.h deleted file mode 100644 index f689ab3..0000000 --- a/build/c/dependencies/luaDoTheWorld/tree/tree/definition.h +++ /dev/null @@ -1,4 +0,0 @@ -#include "basic/basic.c" -#include "iterables/iterables.c" -#include "json_tree/json_tree.c" -#include "tree_parts/tree_parts.c" \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/tree/tree/iterables/iterables.c b/build/c/dependencies/luaDoTheWorld/tree/tree/iterables/iterables.c deleted file mode 100644 index 18c2f28..0000000 --- a/build/c/dependencies/luaDoTheWorld/tree/tree/iterables/iterables.c +++ /dev/null @@ -1,104 +0,0 @@ - -LuaCEmbedResponse *tree_find(LuaCEmbedTable *self, LuaCEmbed *args){ - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - - for(int i =0; i < self_tree->size;i++){ - LuaCEmbedTable *tree_part = create_tree_part_reference(args,self_tree->tree_parts[i]); - LuaCEmbedTable *args_to_call = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_append_table(args_to_call,tree_part); - LuaCEmbedTable *response = LuaCEmbed_run_args_lambda(args,0,args_to_call,1); - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - int response_type =LuaCEmbedTable_get_type_by_index(response,0); - if(response_type != LUA_CEMBED_NIL){ - bool is_the_value = LuaCEmbedTable_get_bool_by_index(response,0); - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - - if(is_the_value){ - return LuaCEmbed_send_table(tree_part); - } - } - } - return NULL; -} - - -LuaCEmbedResponse *tree_count(LuaCEmbedTable *self, LuaCEmbed *args){ - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - long total = 0; - for(int i =0; i < self_tree->size;i++){ - LuaCEmbedTable *tree_part = create_tree_part_reference(args,self_tree->tree_parts[i]); - LuaCEmbedTable *args_to_call = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_append_table(args_to_call,tree_part); - LuaCEmbedTable *response = LuaCEmbed_run_args_lambda(args,0,args_to_call,1); - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - int response_type =LuaCEmbedTable_get_type_by_index(response,0); - if(response_type != LUA_CEMBED_NIL){ - bool is_the_value = LuaCEmbedTable_get_bool_by_index(response,0); - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - - if(is_the_value){ - total+=1; - } - } - - } - return LuaCEmbed_send_long(total); -} - - -LuaCEmbedResponse *tree_map(LuaCEmbedTable *self, LuaCEmbed *args){ - - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - LuaCEmbedTable *final_map = LuaCembed_new_anonymous_table(args); - - for(int i =0; i < self_tree->size;i++){ - LuaCEmbedTable *tree_part = create_tree_part_reference(args,self_tree->tree_parts[i]); - LuaCEmbedTable *args_to_call = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_append_table(args_to_call,tree_part); - LuaCEmbedTable *response = LuaCEmbed_run_args_lambda(args,0,args_to_call,1); - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - int response_type =LuaCEmbedTable_get_type_by_index(response,0); - if(response_type!= LUA_CEMBED_NIL && response_type != LUA_CEMBED_NOT_FOUND){ - LuaCEmbedTable_append_evaluation(final_map,"%s[1]",response->global_name); - } - - } - return LuaCEmbed_send_table(final_map); -} - - - - -LuaCEmbedResponse *tree_foreach(LuaCEmbedTable *self, LuaCEmbed *args){ - - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - - for(int i =0; i < self_tree->size;i++){ - LuaCEmbedTable *tree_part = create_tree_part_reference(args,self_tree->tree_parts[i]); - LuaCEmbedTable *args_to_call = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_append_table(args_to_call,tree_part); - LuaCEmbed_run_args_lambda(args,0,args_to_call,1); - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - printf("pegou aqui\n"); - return LuaCEmbed_send_error(error_msg); - } - - } - return NULL; -} diff --git a/build/c/dependencies/luaDoTheWorld/tree/tree/iterables/iterables.h b/build/c/dependencies/luaDoTheWorld/tree/tree/iterables/iterables.h deleted file mode 100644 index 6aeae7e..0000000 --- a/build/c/dependencies/luaDoTheWorld/tree/tree/iterables/iterables.h +++ /dev/null @@ -1,12 +0,0 @@ - -LuaCEmbedResponse *tree_find(LuaCEmbedTable *self, LuaCEmbed *args); - - - -LuaCEmbedResponse *tree_count(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse *tree_map(LuaCEmbedTable *self, LuaCEmbed *args); - - -LuaCEmbedResponse *tree_foreach(LuaCEmbedTable *self, LuaCEmbed *args); - diff --git a/build/c/dependencies/luaDoTheWorld/tree/tree/json_tree/json_tree.c b/build/c/dependencies/luaDoTheWorld/tree/tree/json_tree/json_tree.c deleted file mode 100644 index 4fd6da8..0000000 --- a/build/c/dependencies/luaDoTheWorld/tree/tree/json_tree/json_tree.c +++ /dev/null @@ -1,113 +0,0 @@ - -LuaCEmbedResponse * create_tree_from_json_tree_string(LuaCEmbed *args){ - char *content = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - UniversalGarbage *garbage = newUniversalGarbage(); - DtwTree *tree = newDtwTree(); - UniversalGarbage_add_return(garbage,DtwTree_free,tree); - - bool result = DtwTree_loads_json_tree(tree,content); - - if(result ==false){ - DtwTree_free(tree); - DtwJsonTreeError *error_tree = DtwJsonTreeError_validate_json_tree_by_content(content); - UniversalGarbage_add(garbage,DtwJsonTreeError_free,error_tree); - - LuaCEmbedResponse *response = LuaCEmbed_send_error( - "%s at index %d", - error_tree->menssage, - error_tree->position - ); - UniversalGarbage_free_including_return(garbage); - return response; - } - LuaCEmbedTable * self = raw_create_tree(args,tree); - UniversalGarbage_free(garbage); - return LuaCEmbed_send_table(self); -} - -LuaCEmbedResponse * create_tree_from_json_tree_file(LuaCEmbed *args){ - - char *path = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - UniversalGarbage *garbage = newUniversalGarbage(); - - char *content = dtw_load_string_file_content(path); - UniversalGarbage_add_simple(garbage,content); - if(content == NULL){ - UniversalGarbage_free(garbage); - return LuaCEmbed_send_error(FILE_NOT_FOUND,path); - } - - DtwTree *tree = newDtwTree(); - UniversalGarbage_add_return(garbage,DtwTree_free,tree); - - bool result = DtwTree_loads_json_tree(tree,content); - - if(result ==false){ - DtwTree_free(tree); - DtwJsonTreeError *error_tree = DtwJsonTreeError_validate_json_tree_by_content(content); - UniversalGarbage_add(garbage,DtwJsonTreeError_free,error_tree); - LuaCEmbedResponse *response = LuaCEmbed_send_error( - "%s at index %d", - error_tree->menssage, - error_tree->position - ); - - UniversalGarbage_free_including_return(garbage); - return response; - } - LuaCEmbedTable * self = raw_create_tree(args,tree); - UniversalGarbage_free(garbage); - return LuaCEmbed_send_table(self); -} - - -LuaCEmbedResponse *tree_dump_to_json_string(LuaCEmbedTable *self, LuaCEmbed *args){ - LuaCEmbedTable *props_table = NULL; - if(LuaCEmbed_get_arg_type(args,0) != LUA_CEMBED_NIL){ - props_table = LuaCEmbed_get_arg_table(args,0); - } - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - - DtwTreeProps props = create_tree_props(props_table); - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - char *result = DtwTree_dumps_tree_json(self_tree,props); - LuaCEmbedResponse *response = LuaCEmbed_send_str(result); - free(result); - return response; -} - -LuaCEmbedResponse *tree_dump_to_json_file(LuaCEmbedTable *self, LuaCEmbed *args){ - char *path = LuaCEmbed_get_str_arg(args,0); - LuaCEmbedTable *props_table = NULL; - if(LuaCEmbed_get_arg_type(args,1) != LUA_CEMBED_NIL){ - props_table = LuaCEmbed_get_arg_table(args,1); - } - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - - DtwTreeProps props = create_tree_props(props_table); - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - DtwTree_dumps_tree_json_to_file(self_tree,path,props); - return LuaCEmbed_send_table(self); -} \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/tree/tree/json_tree/json_tree.h b/build/c/dependencies/luaDoTheWorld/tree/tree/json_tree/json_tree.h deleted file mode 100644 index cf860a1..0000000 --- a/build/c/dependencies/luaDoTheWorld/tree/tree/json_tree/json_tree.h +++ /dev/null @@ -1,8 +0,0 @@ - -LuaCEmbedResponse * create_tree_from_json_tree_string(LuaCEmbed *args); - -LuaCEmbedResponse * create_tree_from_json_tree(LuaCEmbed *args); - -LuaCEmbedResponse *tree_dump_to_json_string(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse *tree_dump_to_json_file(LuaCEmbedTable *self, LuaCEmbed *args); diff --git a/build/c/dependencies/luaDoTheWorld/tree/tree/tree_parts/tree_parts.c b/build/c/dependencies/luaDoTheWorld/tree/tree/tree_parts/tree_parts.c deleted file mode 100644 index 5862b73..0000000 --- a/build/c/dependencies/luaDoTheWorld/tree/tree/tree_parts/tree_parts.c +++ /dev/null @@ -1,109 +0,0 @@ - -LuaCEmbedResponse *new_tree_part(LuaCEmbedTable *self, LuaCEmbed *args){ - char *path = LuaCEmbed_get_str_arg(args,0); - - LuaCEmbedTable *props_table = NULL; - if(LuaCEmbed_get_arg_type(args,1) != LUA_CEMBED_NIL){ - props_table = LuaCEmbed_get_arg_table(args,1); - } - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - - - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - DtwTreeProps props = create_tree_props(props_table); - DtwTreePart *tree_part = newDtwTreePart(path,props); - DtwTree_add_tree_part_getting_onwership(self_tree,tree_part); - LuaCEmbedTable *tree_part_table = create_tree_part_reference(args,tree_part); - return LuaCEmbed_send_table(tree_part_table); -} - -LuaCEmbedResponse *new_tree_part_loading(LuaCEmbedTable *self, LuaCEmbed *args){ - char *path = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - DtwTreePart *tree_part = newDtwTreePartLoading(path); - DtwTree_add_tree_part_getting_onwership(self_tree,tree_part); - LuaCEmbedTable *tree_part_table = create_tree_part_reference(args,tree_part); - return LuaCEmbed_send_table(tree_part_table); -} - -LuaCEmbedResponse *new_tree_part_empty(LuaCEmbedTable *self, LuaCEmbed *args){ - - char *path = LuaCEmbed_get_str_arg(args,0); - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - DtwTreePart *tree_part = newDtwTreePartEmpty(path); - DtwTree_add_tree_part_getting_onwership(self_tree,tree_part); - LuaCEmbedTable *tree_part_table = create_tree_part_reference(args,tree_part); - return LuaCEmbed_send_table(tree_part_table); -} - -LuaCEmbedResponse *get_tree_part_by_index(LuaCEmbedTable *self, LuaCEmbed *args){ - - long index = LuaCEmbed_get_long_arg(args,0)-1; - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - if(index>=self_tree->size){ - return NULL; - } - - LuaCEmbedTable *result = create_tree_part_reference(args,self_tree->tree_parts[index]); - return LuaCEmbed_send_table(result); -} - - - -LuaCEmbedResponse *tree_get_tree_part_by_name(LuaCEmbedTable *self, LuaCEmbed *args){ - char *name = LuaCEmbed_get_str_arg(args,0); - - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - DtwTreePart * possible = DtwTree_find_tree_part_by_name(self_tree,name); - if(possible == NULL){ - return NULL; - } - LuaCEmbedTable *created_table = create_tree_part_reference(args,possible); - return LuaCEmbed_send_table(created_table); -} - - - -LuaCEmbedResponse *tree_get_tree_part_by_path(LuaCEmbedTable *self, LuaCEmbed *args){ - char *path = LuaCEmbed_get_str_arg(args,0); - - if(LuaCEmbed_has_errors(args)){ - char *error_msg = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_msg); - } - - DtwTree *self_tree = (DtwTree*)LuaCembedTable_get_long_prop(self,TREE_POINTER); - DtwTreePart * possible = DtwTree_find_tree_part_by_path(self_tree,path); - if(possible == NULL){ - return NULL; - } - LuaCEmbedTable *created_table = create_tree_part_reference(args,possible); - return LuaCEmbed_send_table(created_table); -} - diff --git a/build/c/dependencies/luaDoTheWorld/tree/tree/tree_parts/tree_parts.h b/build/c/dependencies/luaDoTheWorld/tree/tree/tree_parts/tree_parts.h deleted file mode 100644 index 1fc8662..0000000 --- a/build/c/dependencies/luaDoTheWorld/tree/tree/tree_parts/tree_parts.h +++ /dev/null @@ -1,16 +0,0 @@ - - - -LuaCEmbedResponse *new_tree_part(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse *new_tree_part_loading(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse *new_tree_part_empty(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse *get_tree_part_by_index(LuaCEmbedTable *self, LuaCEmbed *args); - -LuaCEmbedResponse *tree_get_tree_part_by_name(LuaCEmbedTable *self, LuaCEmbed *args); - - -LuaCEmbedResponse *tree_get_tree_part_by_path(LuaCEmbedTable *self, LuaCEmbed *args); - diff --git a/build/c/dependencies/luaDoTheWorld/tree/tree_part/tree_part.c b/build/c/dependencies/luaDoTheWorld/tree/tree_part/tree_part.c deleted file mode 100644 index 1ac2320..0000000 --- a/build/c/dependencies/luaDoTheWorld/tree/tree_part/tree_part.c +++ /dev/null @@ -1,129 +0,0 @@ - - -LuaCEmbedResponse * tree_part_get_value(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwTreePart *self_part = (DtwTreePart*)LuaCembedTable_get_long_prop(self,TREE_PART_POINTER); - - if(self_part->content){ - return LuaCEmbed_send_raw_string((char*)self_part->content,self_part->content_size); - } - return NULL; -} - -LuaCEmbedResponse * tree_part_to_string(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwTreePart *self_part = (DtwTreePart*)LuaCembedTable_get_long_prop(self,TREE_PART_POINTER); - - if(self_part->content){ - return LuaCEmbed_send_raw_string((char*)self_part->content,self_part->content_size); - } - return LuaCEmbed_send_str(DtwPath_get_path(self_part->path)); -} - -LuaCEmbedResponse * tree_part_set_value(LuaCEmbedTable *self,LuaCEmbed *args){ - Writeble write_obj = create_writeble(args,0); - if(write_obj.error){ - return write_obj.error; - } - DtwTreePart *self_part = (DtwTreePart*)LuaCembedTable_get_long_prop(self,TREE_PART_POINTER); - DtwTreePart_set_any_content(self_part,write_obj.content,write_obj.size,write_obj.is_binary); - return LuaCEmbed_send_table(self); -} - - -LuaCEmbedResponse * tree_part_hardware_remove(LuaCEmbedTable *self,LuaCEmbed *args){ - bool set_as_action = true; - if(LuaCEmbed_get_arg_type(args,0) != LUA_CEMBED_NIL){ - set_as_action = LuaCEmbed_get_bool_arg(args,0); - } - - if(LuaCEmbed_has_errors(args)){ - const char *error_menssage = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_menssage); - } - - DtwTreePart *self_part = (DtwTreePart*)LuaCembedTable_get_long_prop(self,TREE_PART_POINTER); - DtwTreePart_hardware_remove(self_part,set_as_action); - return LuaCEmbed_send_table(self); -} - -LuaCEmbedResponse * tree_part_hardware_write(LuaCEmbedTable *self,LuaCEmbed *args){ - - bool set_as_action = true; - if(LuaCEmbed_get_arg_type(args,0) != LUA_CEMBED_NIL){ - set_as_action = LuaCEmbed_get_bool_arg(args,0); - } - - if(LuaCEmbed_has_errors(args)){ - const char *error_menssage = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_menssage); - } - - - DtwTreePart *self_part = (DtwTreePart*)LuaCembedTable_get_long_prop(self,TREE_PART_POINTER); - DtwTreePart_hardware_write(self_part,set_as_action); - return LuaCEmbed_send_table(self); -} - -LuaCEmbedResponse * tree_part_hardware_modify(LuaCEmbedTable *self,LuaCEmbed *args){ - - bool set_as_action = true; - if(LuaCEmbed_get_arg_type(args,0) != LUA_CEMBED_NIL){ - set_as_action = LuaCEmbed_get_bool_arg(args,0); - } - - if(LuaCEmbed_has_errors(args)){ - const char *error_menssage = LuaCEmbed_get_error_message(args); - return LuaCEmbed_send_error(error_menssage); - } - - DtwTreePart *self_part = (DtwTreePart*)LuaCembedTable_get_long_prop(self,TREE_PART_POINTER); - DtwTreePart_hardware_modify(self_part,set_as_action); - return LuaCEmbed_send_table(self); -} - -LuaCEmbedResponse * tree_part_get_content_sha(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwTreePart *self_part = (DtwTreePart*)LuaCembedTable_get_long_prop(self,TREE_PART_POINTER); - if(self_part->current_sha){ - return LuaCEmbed_send_str(self_part->current_sha); - } - return NULL; -} - - -LuaCEmbedResponse * tree_part_unload_content(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwTreePart *self_part = (DtwTreePart*)LuaCembedTable_get_long_prop(self,TREE_PART_POINTER); - DtwTreePart_free_content(self_part); - return LuaCEmbed_send_table(self); -} - -LuaCEmbedResponse * tree_part_load_content(LuaCEmbedTable *self,LuaCEmbed *args){ - DtwTreePart *self_part = (DtwTreePart*)LuaCembedTable_get_long_prop(self,TREE_PART_POINTER); - DtwTreePart_load_content_from_hardware(self_part); - return LuaCEmbed_send_table(self); -} - -LuaCEmbedResponse *tree_part_is_blob(LuaCEmbedTable *self, LuaCEmbed *args){ - DtwTreePart *self_part = (DtwTreePart*)LuaCembedTable_get_long_prop(self,TREE_PART_POINTER); - return LuaCEmbed_send_bool(self_part->is_binary); -} - -LuaCEmbedTable * create_tree_part_reference(LuaCEmbed *args,DtwTreePart *part){ - LuaCEmbedTable *self = LuaCembed_new_anonymous_table(args); - LuaCEmbedTable_set_long_prop(self,TREE_PART_POINTER,(long long)part); - LuaCEmbedTable_set_long_prop(self,DTW_TYPE,DTW_TREE_PART_TYPE); - LuaCEmbedTable *path = create_path_reference(args,part->path); - LuaCEmbedTable_set_sub_table_prop(self,PATH_PROPS,path); - LuaCEmbedTable_set_method(self,GET_VALUE_METHOD,tree_part_get_value); - LuaCEmbedTable_set_method(self,SET_VALUE_METHOD,tree_part_set_value); - LuaCEmbedTable_set_method(self,HARDWARE_REMOVE_METHOD,tree_part_hardware_remove); - LuaCEmbedTable_set_method(self,HARDWARE_MODIFY_METHOD,tree_part_hardware_modify); - LuaCEmbedTable_set_method(self,HARWARE_WRITE_METHOD,tree_part_hardware_write); - LuaCEmbedTable_set_method(self,GET_SHA_METHOD,tree_part_get_content_sha); - LuaCEmbedTable_set_method(self,UNLOAD_METHOD,tree_part_unload_content); - LuaCEmbedTable_set_method(self,TO_STRING_METHOD,tree_part_to_string); - LuaCEmbedTable_set_method(self,IS_BLOB_FUNC,tree_part_is_blob); - LuaCEmbedTable_set_method(self,LOAD_METHOD,tree_part_load_content); - return self; -} - - - diff --git a/build/c/dependencies/luaDoTheWorld/tree/tree_part/tree_part.h b/build/c/dependencies/luaDoTheWorld/tree/tree_part/tree_part.h deleted file mode 100644 index 2c246b1..0000000 --- a/build/c/dependencies/luaDoTheWorld/tree/tree_part/tree_part.h +++ /dev/null @@ -1,26 +0,0 @@ - - -LuaCEmbedResponse * tree_part_get_value(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * tree_part_to_string(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse *tree_part_is_blob(LuaCEmbedTable *self, LuaCEmbed *args); - - -LuaCEmbedResponse * tree_part_set_value(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * tree_part_hardware_remove(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * tree_part_hardware_write(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * tree_part_hardware_modify(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * tree_part_get_content_sha(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * tree_part_unload_content(LuaCEmbedTable *self,LuaCEmbed *args); - -LuaCEmbedResponse * tree_part_load_content(LuaCEmbedTable *self,LuaCEmbed *args); - - - -LuaCEmbedTable * create_tree_part_reference(LuaCEmbed *args,DtwTreePart *part); diff --git a/build/c/dependencies/luaDoTheWorld/types/types.c b/build/c/dependencies/luaDoTheWorld/types/types.c deleted file mode 100644 index 79a5eee..0000000 --- a/build/c/dependencies/luaDoTheWorld/types/types.c +++ /dev/null @@ -1,19 +0,0 @@ - - - - -LuaCEmbedResponse * ensure_table_type(LuaCEmbedTable *table,int expected_type,const char *expected_type_string){ - - if(LuaCEmbedTable_get_type_prop(table,DTW_TYPE) != LUA_CEMBED_NUMBER){ - char formated_error[100] = {0}; - sprintf(formated_error,NOT_EXPECTED_TYPE,expected_type_string); - return LuaCEmbed_send_error(formated_error); - } - long type = LuaCembedTable_get_long_prop(table,DTW_TYPE); - if(type != expected_type){ - char formated_error[100] = {0}; - sprintf(formated_error,NOT_EXPECTED_TYPE,expected_type_string); - return LuaCEmbed_send_error(formated_error); - } - return NULL; -} diff --git a/build/c/dependencies/luaDoTheWorld/types/types.h b/build/c/dependencies/luaDoTheWorld/types/types.h deleted file mode 100644 index 478f205..0000000 --- a/build/c/dependencies/luaDoTheWorld/types/types.h +++ /dev/null @@ -1,5 +0,0 @@ - - - - -LuaCEmbedResponse * ensure_table_type(LuaCEmbedTable *table,int expected_type,const char *expected_type_string); \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/writeble/writble.c b/build/c/dependencies/luaDoTheWorld/writeble/writble.c deleted file mode 100644 index 2267bb5..0000000 --- a/build/c/dependencies/luaDoTheWorld/writeble/writble.c +++ /dev/null @@ -1,114 +0,0 @@ - -bool handle_table_writble(Writeble *self,LuaCEmbed *args,int index){ - LuaCEmbedTable * element = LuaCEmbed_get_arg_table(args,index); - if(LuaCEmbedTable_get_type_prop(element,DTW_TYPE) != LUA_CEMBED_NUMBER){ - return false; - } - - int type = LuaCembedTable_get_long_prop(element,DTW_TYPE); - - - if(type == DTW_RESOURCE_TYPE) { - DtwResource *resource = (DtwResource *) LuaCembedTable_get_long_prop(element, RESOURCE_POINTER); - self->content = DtwResource_get_any(resource, &self->size, &self->is_binary); - if (DtwResource_error(resource)) { - char *message = DtwResource_get_error_message(resource); - self->error = LuaCEmbed_send_error(message); - DtwResource_clear_errors(resource); - return false; - } - return true; - } - - if(type == DTW_TREE_PART_TYPE){ - DtwTreePart *part = (DtwTreePart*)LuaCembedTable_get_long_prop(element,TREE_PART_POINTER); - DtwTreePart_load_content_from_hardware(part); - if(part->content==NULL){ - return false; - } - self->content = part->content; - self->size =part->content_size; - self->is_binary = part->content_size; - return true; - } - if(type == DTW_ACTION_TRANSACTION_TYPE){ - DtwActionTransaction *transaction= (DtwActionTransaction*)LuaCembedTable_get_long_prop(element,TRANSACTION_POINTER); - if(transaction->content == NULL){ - return false; - } - self->content = transaction->content; - self->size= transaction->size; - self->is_binary =transaction->is_binary; - return true; - } - - return false; - -} -Writeble create_writeble(LuaCEmbed *args,int index){ - Writeble self = {0}; - long total_args = LuaCEmbed_get_total_args(args); - if(total_args == 0){ - self.error = LuaCEmbed_send_error(ARGUMENT_NOT_PROVIDED); - return self; - } - - int type_to_write = LuaCEmbed_get_arg_type(args,index); - bool writeble = false; - if(type_to_write == LUA_CEMBED_STRING){ - self.content = (unsigned char*)LuaCEmbed_get_raw_str_arg(args,&self.size,index); - for(long i = 0; i < self.size;i++){ - if(self.content[i] == 0){ - self.is_binary = true; - break; - } - } - - writeble = true; - } - - if(type_to_write == LUA_CEMBED_NUMBER){ - self.clear_content = true; - double content = LuaCEmbed_get_double_arg(args,index); - double rest = content - (double)(long ) content; - if(rest == 0){ - char formatted[20] = {0}; - sprintf(formatted,"%ld",(long)content); - self.content = (unsigned char*)strdup(formatted); - self.size = (long)strlen(formatted); - } - else{ - char formatted[20] = {0}; - sprintf(formatted,"%lf",content); - self.content = (unsigned char*)strdup(formatted); - self.size = (long)strlen(formatted); - } - writeble = true; - } - if(type_to_write == LUA_CEMBED_BOOL){ - bool content = LuaCEmbed_get_bool_arg(args,index); - const char *converted = content ? "true":"false"; - self.content = (unsigned char*)converted; - self.size = (long)strlen(converted); - writeble = true; - } - - if(type_to_write == LUA_CEMBED_TABLE){ - writeble = handle_table_writble(&self,args,index); - } - - bool its_not_writible_and_no_other_errors = !writeble && self.error == NULL; - if(its_not_writible_and_no_other_errors){ - char *error = private_LuaCembed_format(NOT_WRITEBLE_ELEMENT,LuaCembed_convert_arg_code(type_to_write)); - self.error = LuaCEmbed_send_error(error); - free(error); - return self; - } - - return self; -} -void Writeble_free(Writeble *self){ - if(self->clear_content){ - free(self->content); - } -} \ No newline at end of file diff --git a/build/c/dependencies/luaDoTheWorld/writeble/writble.h b/build/c/dependencies/luaDoTheWorld/writeble/writble.h deleted file mode 100644 index 7d1b91a..0000000 --- a/build/c/dependencies/luaDoTheWorld/writeble/writble.h +++ /dev/null @@ -1,13 +0,0 @@ - - -typedef struct{ - unsigned char *content; - bool clear_content; - long size; - bool is_binary; - LuaCEmbedResponse *error; -}Writeble; - -Writeble create_writeble(LuaCEmbed *args,int index); - -void Writeble_free(Writeble *self); \ No newline at end of file diff --git a/build/c/lua_code.h b/build/c/lua_code.h deleted file mode 100644 index 71cbe84..0000000 --- a/build/c/lua_code.h +++ /dev/null @@ -1 +0,0 @@ -const char *lua_code= "\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x20\x41\x4d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x53\x74\x61\x74\x65\x4d\x61\x63\x68\x69\x6e\x65\xa\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x56\x65\x72\x69\x66\x79\x5f\x69\x66\x5f\x69\x73\x5f\x73\x74\x61\x72\x74\x5f\x73\x74\x72\x69\x6e\x67\x5f\x63\x68\x61\x72\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\x9\x69\x66\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x73\x74\x72\x69\x6e\x67\x20\x3d\x3d\x20\x74\x72\x75\x65\x20\x74\x68\x65\x6e\xa\x9\x9\x72\x65\x74\x75\x72\x6e\xa\x9\x65\x6e\x64\xa\x20\x20\x20\x20\x69\x66\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x6c\x61\x73\x74\x5f\x63\x68\x61\x72\x20\x3d\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x63\x68\x61\x72\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x2d\x31\x29\xa\x20\x20\x20\x20\x69\x66\x20\x6c\x61\x73\x74\x5f\x63\x68\x61\x72\x20\x3d\x3d\x20\x22\x27\x22\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x75\x72\x72\x65\x6e\x74\x5f\x63\x68\x61\x72\x20\x3d\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x63\x68\x61\x72\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x29\xa\x20\x20\x20\x20\x69\x66\x20\x63\x75\x72\x72\x65\x6e\x74\x5f\x63\x68\x61\x72\x20\x3d\x3d\x20\x27\x22\x27\x20\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x73\x74\x72\x69\x6e\x67\x20\x20\x3d\x20\x74\x72\x75\x65\xa\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x3d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x2b\x20\x31\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x65\x6e\x64\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x20\x41\x4d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x53\x74\x61\x74\x65\x4d\x61\x63\x68\x69\x6e\x65\xa\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x56\x65\x72\x69\x66\x79\x5f\x69\x66\x5f\x69\x73\x5f\x65\x6e\x64\x5f\x73\x74\x72\x69\x6e\x67\x5f\x63\x68\x61\x72\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\xa\x20\x20\x20\x20\x69\x66\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x73\x74\x72\x69\x6e\x67\x20\x3d\x3d\x20\x66\x61\x6c\x73\x65\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x69\x66\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x6c\x61\x73\x74\x5f\x6c\x61\x73\x74\x5f\x63\x68\x61\x72\x20\x3d\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x63\x68\x61\x72\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x2d\x32\x29\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x6c\x61\x73\x74\x5f\x63\x68\x61\x72\x20\x3d\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x63\x68\x61\x72\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x2d\x31\x29\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x75\x72\x72\x65\x6e\x74\x5f\x63\x68\x61\x72\x20\x3d\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x63\x68\x61\x72\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x29\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x73\x63\x61\x70\x65\x20\x3d\x20\x6c\x61\x73\x74\x5f\x63\x68\x61\x72\x20\x3d\x3d\x20\x27\x5c\x5c\x27\x20\x61\x6e\x64\x20\x6c\x61\x73\x74\x5f\x6c\x61\x73\x74\x5f\x63\x68\x61\x72\x20\x7e\x3d\x22\x5c\x5c\x22\xa\x20\x20\x20\x20\x69\x66\x20\x63\x75\x72\x72\x65\x6e\x74\x5f\x63\x68\x61\x72\x20\x3d\x3d\x20\x27\x22\x27\x20\x61\x6e\x64\x20\x73\x63\x61\x70\x65\x20\x3d\x3d\x20\x66\x61\x6c\x73\x65\x20\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x73\x74\x72\x69\x6e\x67\x20\x3d\x20\x66\x61\x6c\x73\x65\xa\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x73\x5f\x65\x6e\x64\x5f\x73\x74\x72\x69\x6e\x67\x20\x3d\x20\x74\x72\x75\x65\xa\x20\x20\x20\x20\x20\x20\x20\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x3d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x2b\x20\x31\xa\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x65\x6e\x64\xa\xa\xa\xa\x2d\x2d\x2d\x40\x63\x6c\x61\x73\x73\x20\x41\x4d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x53\x74\x61\x74\x65\x4d\x61\x63\x68\x69\x6e\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x63\x6f\x6e\x74\x65\x6e\x74\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x69\x7a\x65\x20\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x6e\x73\x69\x64\x65\x5f\x73\x74\x72\x69\x6e\x67\x20\x62\x6f\x6f\x6c\x65\x61\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x77\x61\x69\x74\x69\x6e\x67\x5f\x69\x6e\x63\x6c\x75\x64\x65\x20\x62\x6f\x6f\x6c\x65\x61\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x74\x72\x69\x6e\x67\x5f\x62\x75\x66\x66\x65\x72\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x6e\x64\x65\x78\x20\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x73\x5f\x65\x6e\x64\x5f\x73\x74\x72\x69\x6e\x67\x20\x62\x6f\x6f\x6c\x65\x61\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x62\x75\x66\x66\x65\x72\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x6e\x73\x69\x64\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x62\x6f\x6f\x6c\x65\x61\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x6e\x73\x69\x64\x65\x5f\x6d\x75\x6c\x74\x69\x6c\x69\x6e\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x62\x6f\x6f\x6c\x65\x61\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x6e\x73\x64\x65\x5f\x73\x69\x6e\x67\x6c\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x62\x6f\x6f\x6c\x65\x61\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x74\x61\x72\x74\x5f\x70\x61\x74\x68\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x61\x6c\x72\x65\x61\x64\x79\x5f\x69\x6e\x63\x6c\x75\x64\x65\x20\x53\x74\x72\x69\x6e\x67\x41\x72\x72\x61\x79\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x74\x61\x72\x74\x5f\x70\x6f\x69\x6e\x74\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x61\x6c\x72\x65\x61\x64\x79\x5f\x69\x6e\x63\x6c\x75\x64\x65\x64\x5f\x6c\x69\x73\x74\x20\x20\x53\x74\x72\x69\x6e\x67\x41\x72\x72\x61\x79\x20\x7c\x20\x6e\x69\x6c\xa\x2d\x2d\x2d\x40\x72\x65\x74\x75\x72\x6e\x20\x73\x74\x72\x69\x6e\x67\xa\x20\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x47\x65\x6e\x65\x72\x61\x74\x65\x5f\x61\x6d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x5f\x72\x65\x63\x75\x72\x73\x69\x76\x65\x28\x73\x74\x61\x72\x74\x5f\x70\x6f\x69\x6e\x74\x2c\x61\x6c\x72\x65\x61\x64\x79\x5f\x69\x6e\x63\x6c\x75\x64\x65\x64\x5f\x6c\x69\x73\x74\x29\xa\xa\x20\x20\x20\x20\x69\x66\x20\x61\x6c\x72\x65\x61\x64\x79\x5f\x69\x6e\x63\x6c\x75\x64\x65\x64\x5f\x6c\x69\x73\x74\x20\x3d\x3d\x20\x6e\x69\x6c\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x61\x6c\x72\x65\x61\x64\x79\x5f\x69\x6e\x63\x6c\x75\x64\x65\x64\x5f\x6c\x69\x73\x74\x20\x3d\x20\x43\x72\x65\x61\x74\x65\x64\x5f\x61\x6c\x72\x65\x61\x64\x79\x5f\x69\x6e\x63\x6c\x75\x64\x65\x64\x28\x29\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x69\x66\x20\x6e\x6f\x74\x20\x64\x74\x77\x2e\x69\x73\x66\x69\x6c\x65\x28\x73\x74\x61\x72\x74\x5f\x70\x6f\x69\x6e\x74\x29\x20\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x52\x45\x44\x2e\x2e\x22\x66\x69\x6c\x65\x20\x22\x2e\x2e\x73\x74\x61\x72\x74\x5f\x70\x6f\x69\x6e\x74\x2e\x2e\x22\x20\x6e\x6f\x74\x20\x66\x6f\x75\x6e\x64\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x9\x63\x6c\x69\x62\x2e\x65\x78\x69\x74\x28\x31\x29\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x73\x74\x61\x72\x74\x5f\x70\x6f\x69\x6e\x74\x5f\x73\x68\x61\x20\x3d\x20\x64\x74\x77\x2e\x67\x65\x6e\x65\x72\x61\x74\x65\x5f\x73\x68\x61\x5f\x66\x72\x6f\x6d\x5f\x66\x69\x6c\x65\x28\x73\x74\x61\x72\x74\x5f\x70\x6f\x69\x6e\x74\x29\xa\x20\x20\x20\x20\x69\x66\x20\x61\x6c\x72\x65\x61\x64\x79\x5f\x69\x6e\x63\x6c\x75\x64\x65\x64\x5f\x6c\x69\x73\x74\x2e\x69\x73\x5f\x69\x6e\x63\x6c\x75\x64\x65\x64\x28\x73\x74\x61\x72\x74\x5f\x70\x6f\x69\x6e\x74\x5f\x73\x68\x61\x29\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x59\x45\x4c\x4c\x4f\x57\x2e\x2e\x22\x66\x69\x6c\x65\x20\x22\x2e\x2e\x73\x74\x61\x72\x74\x5f\x70\x6f\x69\x6e\x74\x2e\x2e\x22\x20\x61\x6c\x72\x65\x61\x64\x79\x20\x69\x6e\x63\x6c\x75\x64\x65\x64\x5c\x6e\x20\x22\x29\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\x20\x22\x22\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x61\x6c\x72\x65\x61\x64\x79\x5f\x69\x6e\x63\x6c\x75\x64\x65\x64\x5f\x6c\x69\x73\x74\x2e\x61\x70\x70\x65\x6e\x64\x28\x73\x74\x61\x72\x74\x5f\x70\x6f\x69\x6e\x74\x5f\x73\x68\x61\x29\xa\x20\x20\x20\x20\x2d\x2d\x2d\x40\x74\x79\x70\x65\x20\x41\x4d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x53\x74\x61\x74\x65\x4d\x61\x63\x68\x69\x6e\x65\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x6f\x6e\x74\x65\x6e\x74\x20\x3d\x20\x64\x74\x77\x2e\x6c\x6f\x61\x64\x5f\x66\x69\x6c\x65\x28\x73\x74\x61\x72\x74\x5f\x70\x6f\x69\x6e\x74\x29\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x20\x3d\x7b\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6f\x6e\x74\x65\x6e\x74\x20\x3d\x20\x63\x6f\x6e\x74\x65\x6e\x74\x2c\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x73\x69\x7a\x65\x20\x3d\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x73\x74\x72\x5f\x73\x69\x7a\x65\x28\x63\x6f\x6e\x74\x65\x6e\x74\x29\x2c\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x69\x6e\x73\x69\x64\x65\x5f\x73\x74\x72\x69\x6e\x67\x20\x3d\x20\x66\x61\x6c\x73\x65\x2c\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x77\x61\x69\x74\x69\x6e\x67\x5f\x69\x6e\x63\x6c\x75\x64\x65\x20\x3d\x20\x66\x61\x6c\x73\x65\x2c\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x73\x74\x72\x69\x6e\x67\x5f\x62\x75\x66\x66\x65\x72\x20\x3d\x20\x22\x22\x2c\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\x20\x3d\x20\x22\x2f\x2f\x70\x61\x74\x68\x3a\x20\x22\x2e\x2e\x73\x74\x61\x72\x74\x5f\x70\x6f\x69\x6e\x74\x2e\x2e\x22\x5c\x6e\x22\x2c\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x69\x73\x5f\x73\x74\x61\x72\x74\x5f\x73\x74\x72\x69\x6e\x67\x3d\x66\x61\x6c\x73\x65\x2c\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x69\x6e\x64\x65\x78\x3d\x30\x2c\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x69\x73\x5f\x65\x6e\x64\x5f\x73\x74\x72\x69\x6e\x67\x20\x3d\x20\x66\x61\x6c\x73\x65\x2c\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x62\x75\x66\x66\x65\x72\x3d\x22\x22\x2c\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x69\x6e\x73\x69\x64\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x3d\x20\x66\x61\x6c\x73\x65\x2c\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x69\x6e\x73\x69\x64\x65\x5f\x6d\x75\x6c\x74\x69\x6c\x69\x6e\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x3d\x66\x61\x6c\x73\x65\x2c\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x69\x6e\x73\x64\x65\x5f\x73\x69\x6e\x67\x6c\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x3d\x66\x61\x6c\x73\x65\x2c\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x73\x74\x61\x72\x74\x5f\x70\x61\x74\x68\x20\x3d\x20\x73\x74\x61\x72\x74\x5f\x70\x6f\x69\x6e\x74\x2c\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x61\x6c\x72\x65\x61\x64\x79\x5f\x69\x6e\x63\x6c\x75\x64\x65\x20\x3d\x61\x6c\x72\x65\x61\x64\x79\x5f\x69\x6e\x63\x6c\x75\x64\x65\x64\x5f\x6c\x69\x73\x74\xa\x20\x20\x20\x20\x7d\xa\xa\x20\x20\x20\x20\x66\x6f\x72\x20\x69\x3d\x31\x2c\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x73\x69\x7a\x65\x20\x64\x6f\xa\x20\x20\x20\x20\x20\x20\x20\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x3d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x2b\x20\x31\xa\x20\x20\x20\x20\x20\x20\x20\x20\x56\x65\x72\x69\x66\x79\x5f\x69\x66\x5f\x69\x73\x5f\x73\x74\x61\x72\x74\x5f\x73\x74\x72\x69\x6e\x67\x5f\x63\x68\x61\x72\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x56\x65\x72\x69\x66\x79\x5f\x69\x66\x5f\x69\x73\x5f\x65\x6e\x64\x5f\x73\x74\x72\x69\x6e\x67\x5f\x63\x68\x61\x72\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x49\x6e\x63\x6c\x75\x64\x65\x5f\x63\x68\x61\x72\x5f\x74\x6f\x5f\x73\x74\x72\x69\x6e\x67\x5f\x62\x75\x66\x66\x65\x72\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x49\x6e\x63\x6c\x75\x64\x65\x5f\x62\x75\x66\x66\x65\x72\x5f\x74\x6f\x5f\x66\x69\x6e\x61\x6c\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x4d\x75\x6c\x74\x69\x6c\x69\x6e\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x5f\x73\x74\x61\x72\x74\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x4d\x75\x6c\x74\x69\x6c\x69\x6e\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x5f\x65\x6e\x64\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x53\x69\x6e\x67\x6c\x65\x5f\x6c\x69\x6e\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x5f\x73\x74\x61\x72\x74\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x53\x69\x6e\x67\x6c\x65\x5f\x6c\x69\x6e\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x5f\x65\x6e\x64\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x49\x73\x5f\x69\x6e\x63\x6c\x75\x64\x65\x5f\x70\x6f\x69\x6e\x74\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x41\x6e\x75\x6c\x61\x74\x65\x5f\x69\x6e\x63\x6c\x75\x73\x69\x6f\x6e\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x4d\x61\x6b\x65\x5f\x72\x65\x63\x75\x72\x73\x69\x76\x65\x5f\x63\x61\x6c\x6c\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x49\x6e\x63\x6c\x75\x64\x65\x5f\x63\x68\x61\x72\x5f\x74\x6f\x5f\x66\x69\x6e\x61\x6c\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x47\x52\x45\x45\x4e\x2e\x2e\x22\x61\x6d\x61\x6c\x67\x61\x6d\x61\x74\x65\x64\x3a\x20\x22\x2e\x2e\x73\x74\x61\x72\x74\x5f\x70\x6f\x69\x6e\x74\x2e\x2e\x22\x5c\x6e\x22\x29\xa\x20\x20\x20\x72\x65\x74\x75\x72\x6e\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\xa\x65\x6e\x64\xa\xa\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x20\x41\x4d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x53\x74\x61\x74\x65\x4d\x61\x63\x68\x69\x6e\x65\xa\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x4d\x75\x6c\x74\x69\x6c\x69\x6e\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x5f\x73\x74\x61\x72\x74\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\xa\x20\x20\x20\x20\x69\x66\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x73\x74\x72\x69\x6e\x67\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x69\x66\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\xa\x20\x20\x20\x20\x69\x66\x20\x50\x6f\x69\x6e\x74\x5f\x73\x74\x61\x72\x74\x73\x5f\x77\x69\x74\x68\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2c\x22\x2f\x2a\x22\x29\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x3d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x2b\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x73\x74\x72\x5f\x73\x69\x7a\x65\x28\x22\x2f\x2a\x22\x29\xa\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x3d\x20\x74\x72\x75\x65\xa\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x6d\x75\x6c\x74\x69\x6c\x69\x6e\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x3d\x20\x74\x72\x75\x65\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x65\x6e\x64\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x20\x41\x4d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x53\x74\x61\x74\x65\x4d\x61\x63\x68\x69\x6e\x65\xa\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x4d\x75\x6c\x74\x69\x6c\x69\x6e\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x5f\x65\x6e\x64\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\xa\xa\x20\x20\x20\x20\x69\x66\x20\x6e\x6f\x74\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x6d\x75\x6c\x74\x69\x6c\x69\x6e\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x69\x66\x20\x50\x6f\x69\x6e\x74\x5f\x73\x74\x61\x72\x74\x73\x5f\x77\x69\x74\x68\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2c\x22\x2a\x2f\x22\x29\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x3d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x2b\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x73\x74\x72\x5f\x73\x69\x7a\x65\x28\x22\x2f\x2a\x22\x29\xa\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x3d\x20\x66\x61\x6c\x73\x65\xa\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x6d\x75\x6c\x74\x69\x6c\x69\x6e\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x3d\x20\x66\x61\x6c\x73\x65\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x65\x6e\x64\xa\xa\xa\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x20\x41\x4d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x53\x74\x61\x74\x65\x4d\x61\x63\x68\x69\x6e\x65\xa\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x53\x69\x6e\x67\x6c\x65\x5f\x6c\x69\x6e\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x5f\x73\x74\x61\x72\x74\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\xa\x20\x20\x20\x20\x69\x66\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x73\x74\x72\x69\x6e\x67\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x69\x66\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\xa\xa\x20\x20\x20\x20\x69\x66\x20\x50\x6f\x69\x6e\x74\x5f\x73\x74\x61\x72\x74\x73\x5f\x77\x69\x74\x68\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2c\x22\x5c\x6e\x2f\x2f\x22\x29\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x3d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x2b\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x73\x74\x72\x5f\x73\x69\x7a\x65\x28\x22\x5c\x6e\x2f\x2f\x22\x29\xa\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x3d\x20\x74\x72\x75\x65\xa\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x64\x65\x5f\x73\x69\x6e\x67\x6c\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x3d\x20\x74\x72\x75\x65\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x65\x6e\x64\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x20\x41\x4d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x53\x74\x61\x74\x65\x4d\x61\x63\x68\x69\x6e\x65\xa\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x53\x69\x6e\x67\x6c\x65\x5f\x6c\x69\x6e\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x5f\x65\x6e\x64\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\xa\xa\x20\x20\x20\x20\x69\x66\x20\x6e\x6f\x74\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x64\x65\x5f\x73\x69\x6e\x67\x6c\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x69\x66\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x63\x68\x61\x72\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x29\x20\x3d\x3d\x20\x27\x5c\x6e\x27\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x3d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x2b\x31\xa\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x3d\x20\x66\x61\x6c\x73\x65\xa\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x64\x65\x5f\x73\x69\x6e\x67\x6c\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x3d\x20\x66\x61\x6c\x73\x65\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x65\x6e\x64\xa\xa\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x20\x41\x4d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x53\x74\x61\x74\x65\x4d\x61\x63\x68\x69\x6e\x65\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x74\x72\x20\x73\x74\x72\x69\x6e\x67\xa\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x50\x6f\x69\x6e\x74\x5f\x73\x74\x61\x72\x74\x73\x5f\x77\x69\x74\x68\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2c\x73\x74\x72\x29\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x65\x6c\x65\x6d\x65\x6e\x74\x5f\x73\x69\x7a\x65\x20\x3d\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x73\x74\x72\x5f\x73\x69\x7a\x65\x28\x73\x74\x72\x29\xa\x20\x20\x20\x20\x69\x66\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x2b\x20\x65\x6c\x65\x6d\x65\x6e\x74\x5f\x73\x69\x7a\x65\x20\x3e\x3d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x73\x69\x7a\x65\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\x20\x66\x61\x6c\x73\x65\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x62\x75\x66\x66\x65\x72\x20\x3d\x20\x22\x22\xa\x20\x20\x20\x20\x66\x6f\x72\x20\x69\x3d\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x2c\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x2b\x20\x65\x6c\x65\x6d\x65\x6e\x74\x5f\x73\x69\x7a\x65\x20\x2d\x31\x20\x64\x6f\xa\x20\x20\x20\x20\x20\x20\x20\x20\x62\x75\x66\x66\x65\x72\x20\x3d\x20\x62\x75\x66\x66\x65\x72\x2e\x2e\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x63\x68\x61\x72\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x69\x29\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x2d\x2d\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x62\x75\x66\x66\x65\x72\x2e\x2e\x22\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x69\x66\x20\x62\x75\x66\x66\x65\x72\x20\x3d\x3d\x20\x73\x74\x72\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\x20\x74\x72\x75\x65\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\x20\x66\x61\x6c\x73\x65\xa\x65\x6e\x64\xa\xa\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x20\x41\x4d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x53\x74\x61\x74\x65\x4d\x61\x63\x68\x69\x6e\x65\xa\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x49\x6e\x63\x6c\x75\x64\x65\x5f\x63\x68\x61\x72\x5f\x74\x6f\x5f\x66\x69\x6e\x61\x6c\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\xa\x20\x20\x20\x20\x69\x66\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x77\x61\x69\x74\x69\x6e\x67\x5f\x69\x6e\x63\x6c\x75\x64\x65\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x69\x66\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x73\x74\x72\x69\x6e\x67\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x69\x66\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x75\x72\x72\x65\x6e\x74\x5f\x63\x68\x61\x72\x20\x3d\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x63\x68\x61\x72\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x29\xa\x20\x20\x20\x20\x69\x66\x20\x6e\x6f\x74\x20\x63\x75\x72\x72\x65\x6e\x74\x5f\x63\x68\x61\x72\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\xa\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\x20\x3d\x20\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\x2e\x2e\x63\x75\x72\x72\x65\x6e\x74\x5f\x63\x68\x61\x72\xa\xa\xa\x65\x6e\x64\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x20\x41\x4d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x53\x74\x61\x74\x65\x4d\x61\x63\x68\x69\x6e\x65\xa\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x49\x6e\x63\x6c\x75\x64\x65\x5f\x62\x75\x66\x66\x65\x72\x5f\x74\x6f\x5f\x66\x69\x6e\x61\x6c\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\xa\x20\x20\x20\x20\x69\x66\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x77\x61\x69\x74\x69\x6e\x67\x5f\x69\x6e\x63\x6c\x75\x64\x65\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x69\x66\x20\x6e\x6f\x74\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x73\x5f\x65\x6e\x64\x5f\x73\x74\x72\x69\x6e\x67\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\x20\x3d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\x2e\x2e\x27\x22\x27\x2e\x2e\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x62\x75\x66\x66\x65\x72\x2e\x2e\x27\x22\x27\xa\x20\x20\x20\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x73\x5f\x65\x6e\x64\x5f\x73\x74\x72\x69\x6e\x67\x20\x3d\x20\x66\x61\x6c\x73\x65\xa\x20\x20\x20\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x62\x75\x66\x66\x65\x72\x20\x3d\x20\x22\x22\xa\xa\x65\x6e\x64\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x20\x41\x4d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x53\x74\x61\x74\x65\x4d\x61\x63\x68\x69\x6e\x65\xa\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x49\x73\x5f\x69\x6e\x63\x6c\x75\x64\x65\x5f\x70\x6f\x69\x6e\x74\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\xa\x20\x20\x20\x20\x69\x66\x20\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x73\x74\x72\x69\x6e\x67\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x69\x66\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x63\x6f\x6d\x65\x6e\x74\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x69\x66\x20\x50\x6f\x69\x6e\x74\x5f\x73\x74\x61\x72\x74\x73\x5f\x77\x69\x74\x68\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2c\x22\x23\x69\x6e\x63\x6c\x75\x64\x65\x22\x29\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x3d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x20\x2b\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x73\x74\x72\x5f\x73\x69\x7a\x65\x28\x22\x23\x69\x6e\x63\x6c\x75\x64\x65\x22\x29\xa\x20\x20\x20\x20\x20\x20\x20\x9\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x77\x61\x69\x74\x69\x6e\x67\x5f\x69\x6e\x63\x6c\x75\x64\x65\x20\x3d\x20\x74\x72\x75\x65\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x65\x6e\x64\xa\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x20\x41\x4d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x53\x74\x61\x74\x65\x4d\x61\x63\x68\x69\x6e\x65\xa\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x49\x6e\x63\x6c\x75\x64\x65\x5f\x63\x68\x61\x72\x5f\x74\x6f\x5f\x73\x74\x72\x69\x6e\x67\x5f\x62\x75\x66\x66\x65\x72\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\xa\x20\x20\x20\x20\x69\x66\x20\x6e\x6f\x74\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x73\x74\x72\x69\x6e\x67\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x62\x75\x66\x66\x65\x72\x20\x3d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x62\x75\x66\x66\x65\x72\x2e\x2e\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x63\x68\x61\x72\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x29\xa\xa\x65\x6e\x64\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x20\x41\x4d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x53\x74\x61\x74\x65\x4d\x61\x63\x68\x69\x6e\x65\xa\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x4d\x61\x6b\x65\x5f\x72\x65\x63\x75\x72\x73\x69\x76\x65\x5f\x63\x61\x6c\x6c\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\x9\x69\x66\x20\x6e\x6f\x74\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x77\x61\x69\x74\x69\x6e\x67\x5f\x69\x6e\x63\x6c\x75\x64\x65\x20\x74\x68\x65\x6e\xa\x9\x9\x72\x65\x74\x75\x72\x6e\xa\x9\x65\x6e\x64\xa\x9\x69\x66\x20\x6e\x6f\x74\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x73\x5f\x65\x6e\x64\x5f\x73\x74\x72\x69\x6e\x67\x20\x74\x68\x65\x6e\xa\x9\x9\x72\x65\x74\x75\x72\x6e\xa\x9\x65\x6e\x64\xa\xa\x9\x6c\x6f\x63\x61\x6c\x20\x64\x69\x72\x20\x3d\x20\x64\x74\x77\x2e\x6e\x65\x77\x50\x61\x74\x68\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x73\x74\x61\x72\x74\x5f\x70\x61\x74\x68\x29\x2e\x67\x65\x74\x5f\x64\x69\x72\x28\x29\xa\x9\x6c\x6f\x63\x61\x6c\x20\x66\x75\x6c\x6c\x5f\x70\x61\x74\x68\x20\x3d\x20\x64\x74\x77\x2e\x63\x6f\x6e\x63\x61\x74\x5f\x70\x61\x74\x68\x28\x64\x69\x72\x2c\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x62\x75\x66\x66\x65\x72\x29\xa\x9\x2d\x2d\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x22\x63\x61\x6c\x6c\x69\x6e\x67\x20\x22\x2e\x2e\x66\x75\x6c\x6c\x5f\x70\x61\x74\x68\x2e\x2e\x22\x20\x66\x72\x6f\x6d\x22\x2e\x2e\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x73\x74\x61\x72\x74\x5f\x70\x61\x74\x68\x2e\x2e\x22\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x61\x63\x75\x6d\x75\x6c\x61\x74\x65\x64\x20\x3d\x20\x47\x65\x6e\x65\x72\x61\x74\x65\x5f\x61\x6d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x5f\x72\x65\x63\x75\x72\x73\x69\x76\x65\x28\x66\x75\x6c\x6c\x5f\x70\x61\x74\x68\x2c\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x61\x6c\x72\x65\x61\x64\x79\x5f\x69\x6e\x63\x6c\x75\x64\x65\x29\xa\x20\x20\x20\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\x3d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\x2e\x2e\x20\x61\x63\x75\x6d\x75\x6c\x61\x74\x65\x64\x2e\x2e\x22\x5c\x6e\x22\xa\x20\x20\x20\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x62\x75\x66\x66\x65\x72\x20\x3d\x20\x22\x22\xa\x20\x20\x20\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x73\x5f\x65\x6e\x64\x5f\x73\x74\x72\x69\x6e\x67\x20\x3d\x20\x66\x61\x6c\x73\x65\xa\x20\x20\x20\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x77\x61\x69\x74\x69\x6e\x67\x5f\x69\x6e\x63\x6c\x75\x64\x65\x20\x3d\x20\x66\x61\x6c\x73\x65\xa\x65\x6e\x64\xa\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x20\x41\x4d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x53\x74\x61\x74\x65\x4d\x61\x63\x68\x69\x6e\x65\xa\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x41\x6e\x75\x6c\x61\x74\x65\x5f\x69\x6e\x63\x6c\x75\x73\x69\x6f\x6e\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x29\xa\x20\x20\x20\x20\x69\x66\x20\x6e\x6f\x74\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x77\x61\x69\x74\x69\x6e\x67\x5f\x69\x6e\x63\x6c\x75\x64\x65\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x69\x66\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x73\x69\x64\x65\x5f\x73\x74\x72\x69\x6e\x67\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x69\x66\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x63\x68\x61\x72\x28\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x69\x6e\x64\x65\x78\x29\x20\x3d\x3d\x20\x22\x3c\x22\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\x20\x3d\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\x2e\x2e\x22\x23\x69\x6e\x63\x6c\x75\x64\x65\x20\x22\xa\x20\x20\x20\x20\x20\x20\x20\x73\x74\x61\x74\x65\x5f\x6d\x61\x63\x68\x69\x6e\x65\x2e\x77\x61\x69\x74\x69\x6e\x67\x5f\x69\x6e\x63\x6c\x75\x64\x65\x20\x3d\x20\x66\x61\x6c\x73\x65\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x65\x6e\x64\xa\xa\xa\xa\x2d\x2d\x2d\x40\x63\x6c\x61\x73\x73\x20\x53\x74\x72\x69\x6e\x67\x41\x72\x72\x61\x79\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x69\x7a\x65\x20\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x65\x6c\x65\x6d\x65\x6e\x74\x73\x20\x73\x74\x72\x69\x6e\x67\x5b\x5d\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x61\x70\x70\x65\x6e\x64\x20\x66\x75\x6e\x28\x65\x6c\x65\x6d\x65\x6e\x74\x3a\x73\x74\x72\x69\x6e\x67\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x73\x5f\x69\x6e\x63\x6c\x75\x64\x65\x64\x20\x66\x75\x6e\x28\x65\x6c\x65\x6d\x65\x6e\x74\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\xa\xa\x2d\x2d\x2d\x40\x72\x65\x74\x75\x72\x6e\x20\x53\x74\x72\x69\x6e\x67\x41\x72\x72\x61\x79\xa\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x20\x43\x72\x65\x61\x74\x65\x64\x5f\x61\x6c\x72\x65\x61\x64\x79\x5f\x69\x6e\x63\x6c\x75\x64\x65\x64\x28\x29\xa\x9\x6c\x6f\x63\x61\x6c\x20\x73\x65\x6c\x66\x20\x20\x3d\x20\x7b\xa\x9\x20\x20\x20\x20\x73\x69\x7a\x65\x20\x3d\x20\x30\x2c\xa\x9\x20\x20\x20\x20\x65\x6c\x65\x6d\x65\x6e\x74\x73\x20\x3d\x20\x7b\x7d\xa\x9\x7d\xa\xa\x9\x73\x65\x6c\x66\x2e\x61\x70\x70\x65\x6e\x64\x20\x3d\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x28\x65\x6c\x65\x6d\x65\x6e\x74\x29\xa\x9\x20\x20\x20\x20\x73\x65\x6c\x66\x2e\x73\x69\x7a\x65\x20\x3d\x20\x73\x65\x6c\x66\x2e\x73\x69\x7a\x65\x20\x2b\x31\xa\x20\x20\x20\x20\x20\x20\x20\x20\x73\x65\x6c\x66\x2e\x65\x6c\x65\x6d\x65\x6e\x74\x73\x5b\x73\x65\x6c\x66\x2e\x73\x69\x7a\x65\x5d\x20\x3d\x20\x65\x6c\x65\x6d\x65\x6e\x74\xa\x9\x65\x6e\x64\xa\xa\x9\x73\x65\x6c\x66\x2e\x69\x73\x5f\x69\x6e\x63\x6c\x75\x64\x65\x64\x20\x3d\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x28\x65\x6c\x65\x6d\x65\x6e\x74\x29\xa\x9\x9\x66\x6f\x72\x20\x69\x3d\x31\x2c\x73\x65\x6c\x66\x2e\x73\x69\x7a\x65\x20\x64\x6f\xa\x9\x9\x9\x69\x66\x20\x73\x65\x6c\x66\x2e\x65\x6c\x65\x6d\x65\x6e\x74\x73\x5b\x69\x5d\x20\x3d\x3d\x20\x65\x6c\x65\x6d\x65\x6e\x74\x20\x74\x68\x65\x6e\xa\x9\x9\x9\x9\x72\x65\x74\x75\x72\x6e\x20\x74\x72\x75\x65\xa\x9\x9\x9\x65\x6e\x64\xa\x9\x9\x65\x6e\x64\xa\x9\x9\x72\x65\x74\x75\x72\x6e\x20\x66\x61\x6c\x73\x65\xa\x9\x65\x6e\x64\xa\x9\x72\x65\x74\x75\x72\x6e\x20\x73\x65\x6c\x66\xa\xa\x65\x6e\x64\xa\xa\xa\x2d\x2d\x2d\x40\x63\x6c\x61\x73\x73\x20\x43\x6c\x69\x62\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6c\x6f\x61\x64\x5f\x73\x74\x72\x69\x6e\x67\x20\x66\x75\x6e\x28\x70\x61\x74\x68\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x63\x68\x61\x72\x20\x66\x75\x6e\x28\x70\x61\x74\x68\x3a\x73\x74\x72\x69\x6e\x67\x2c\x69\x3a\x6e\x75\x6d\x62\x65\x72\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x70\x72\x69\x6e\x74\x20\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x7c\x20\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x75\x6d\x62\x65\x72\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x73\x74\x72\x5f\x73\x69\x7a\x65\x20\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x20\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x74\x69\x6d\x65\x20\x66\x75\x6e\x28\x29\x3a\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x65\x78\x69\x74\x20\x66\x75\x6e\x28\x73\x74\x61\x74\x75\x73\x3a\x6e\x75\x6d\x62\x65\x72\x29\x3a\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x79\x73\x74\x65\x6d\x5f\x77\x69\x74\x68\x5f\x73\x74\x61\x74\x75\x73\x20\x66\x75\x6e\x28\x63\x6f\x6d\x61\x6e\x64\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x79\x73\x74\x65\x6d\x5f\x77\x69\x74\x68\x5f\x73\x74\x72\x69\x6e\x67\x20\x66\x75\x6e\x28\x63\x6f\x6d\x61\x6e\x64\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x6e\x64\x65\x78\x6f\x66\x20\x66\x75\x6e\x28\x63\x6f\x6e\x74\x65\x6e\x74\x3a\x73\x74\x72\x69\x6e\x67\x2c\x63\x6f\x6d\x70\x61\x72\x61\x74\x69\x6f\x6e\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6f\x75\x74\x5f\x65\x78\x74\x65\x6e\x73\x69\x6f\x6e\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x72\x65\x70\x6c\x61\x63\x65\x20\x66\x75\x6e\x28\x63\x6f\x6e\x74\x65\x6e\x74\x3a\x73\x74\x72\x69\x6e\x67\x2c\x74\x61\x72\x67\x65\x74\x3a\x73\x74\x72\x69\x6e\x67\x2c\x76\x61\x6c\x75\x65\x5f\x74\x6f\x5f\x72\x65\x70\x6c\x61\x63\x65\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x74\x72\x69\x6d\x20\x66\x75\x6e\x28\x63\x6f\x6e\x74\x65\x6e\x74\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\xa\x2d\x2d\x2d\x40\x74\x79\x70\x65\x20\x43\x6c\x69\x62\xa\x63\x6c\x69\x62\x20\x3d\x20\x63\x6c\x69\x62\xa\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x5f\x6e\x61\x6d\x65\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x72\x65\x73\x6f\x75\x72\x63\x65\x5f\x70\x61\x74\x68\x20\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x63\x61\x6c\x6c\x62\x61\x63\x6b\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x72\x65\x74\x75\x72\x6e\x20\x43\x61\x63\x68\x65\x43\x61\x6c\x6c\x62\x61\x63\x6b\xa\x6c\x6f\x63\x61\x6c\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x6e\x65\x77\x5f\x63\x61\x63\x68\x65\x5f\x65\x6c\x65\x6d\x65\x6e\x74\x28\x66\x75\x6e\x63\x74\x69\x6f\x6e\x5f\x6e\x61\x6d\x65\x2c\x72\x65\x73\x6f\x75\x72\x63\x65\x5f\x70\x61\x74\x68\x2c\x63\x61\x6c\x6c\x62\x61\x63\x6b\x29\xa\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x73\x65\x6c\x66\x20\x3d\x20\x7b\xa\x20\x20\x20\x20\x20\x20\x20\x20\x72\x65\x73\x6f\x75\x72\x63\x65\x5f\x70\x61\x74\x68\x20\x20\x3d\x20\x72\x65\x73\x6f\x75\x72\x63\x65\x5f\x70\x61\x74\x68\x2c\xa\x20\x20\x20\x20\x20\x20\x20\x20\x63\x61\x6c\x6c\x62\x61\x63\x6b\x20\x3d\x20\x63\x61\x6c\x6c\x62\x61\x63\x6b\x2c\xa\x20\x20\x20\x20\x20\x20\x20\x20\x68\x61\x73\x68\x65\x72\x20\x3d\x20\x64\x74\x77\x2e\x6e\x65\x77\x48\x61\x73\x68\x65\x72\x28\x29\xa\x20\x20\x20\x20\x7d\xa\x20\x20\x20\x20\x73\x65\x6c\x66\x2e\x68\x61\x73\x68\x65\x72\x2e\x64\x69\x67\x65\x73\x74\x28\x66\x75\x6e\x63\x74\x69\x6f\x6e\x5f\x6e\x61\x6d\x65\x29\xa\xa\x20\x20\x20\x20\x73\x65\x6c\x66\x2e\x61\x64\x64\x5f\x64\x65\x70\x65\x6e\x64\x65\x6e\x63\x69\x65\x20\x3d\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x28\x65\x6c\x65\x6d\x65\x6e\x74\x29\xa\x20\x20\x20\x20\x9\x20\x20\x20\x73\x65\x6c\x66\x2e\x68\x61\x73\x68\x65\x72\x2e\x64\x69\x67\x65\x73\x74\x28\x65\x6c\x65\x6d\x65\x6e\x74\x29\xa\x20\x20\x20\x20\x9\x20\x20\x20\x72\x65\x74\x75\x72\x6e\x20\x73\x65\x6c\x66\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x73\x65\x6c\x66\x2e\x70\x65\x72\x66\x6f\x72\x6d\x20\x3d\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x73\x68\x61\x20\x3d\x20\x73\x65\x6c\x66\x2e\x68\x61\x73\x68\x65\x72\x2e\x67\x65\x74\x5f\x76\x61\x6c\x75\x65\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x73\x68\x61\x5f\x72\x65\x73\x6f\x75\x72\x63\x65\x20\x3d\x20\x72\x65\x73\x6f\x75\x72\x63\x65\x5f\x70\x61\x74\x68\x2e\x73\x75\x62\x5f\x72\x65\x73\x6f\x75\x72\x63\x65\x28\x73\x68\x61\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x70\x6f\x73\x73\x69\x62\x6c\x65\x5f\x65\x6c\x65\x6d\x65\x6e\x74\x20\x3d\x20\x73\x68\x61\x5f\x72\x65\x73\x6f\x75\x72\x63\x65\x2e\x67\x65\x74\x5f\x73\x74\x72\x69\x6e\x67\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x69\x66\x20\x70\x6f\x73\x73\x69\x62\x6c\x65\x5f\x65\x6c\x65\x6d\x65\x6e\x74\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\x20\x70\x6f\x73\x73\x69\x62\x6c\x65\x5f\x65\x6c\x65\x6d\x65\x6e\x74\xa\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x72\x65\x73\x75\x6c\x74\x20\x3d\x20\x73\x65\x6c\x66\x2e\x63\x61\x6c\x6c\x62\x61\x63\x6b\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x69\x66\x20\x72\x65\x73\x75\x6c\x74\x20\x3d\x3d\x20\x6e\x69\x6c\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x9\x72\x65\x73\x75\x6c\x74\x20\x3d\x20\x22\x22\xa\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x20\x20\x20\x20\x73\x68\x61\x5f\x72\x65\x73\x6f\x75\x72\x63\x65\x2e\x73\x65\x74\x5f\x76\x61\x6c\x75\x65\x28\x72\x65\x73\x75\x6c\x74\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x73\x68\x61\x5f\x72\x65\x73\x6f\x75\x72\x63\x65\x2e\x63\x6f\x6d\x6d\x69\x74\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\x20\x72\x65\x73\x75\x6c\x74\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\x20\x73\x65\x6c\x66\x3b\xa\xa\x65\x6e\x64\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x70\x61\x74\x68\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x72\x65\x74\x75\x72\x6e\x20\x43\x61\x63\x68\x65\xa\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x4e\x65\x77\x43\x61\x63\x68\x65\x28\x70\x61\x74\x68\x29\xa\xa\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x73\x65\x6c\x66\x20\x3d\x20\x7b\xa\x20\x20\x20\x20\x20\x20\x20\x20\x72\x65\x73\x6f\x75\x72\x63\x65\x5f\x70\x61\x74\x68\x20\x3d\x20\x64\x74\x77\x2e\x6e\x65\x77\x52\x65\x73\x6f\x75\x72\x63\x65\x28\x70\x61\x74\x68\x29\xa\x20\x20\x20\x20\x7d\xa\xa\x20\x20\x20\x20\x73\x65\x6c\x66\x2e\x6e\x65\x77\x5f\x65\x6c\x65\x6d\x65\x6e\x74\x20\x3d\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x28\x66\x75\x6e\x63\x74\x69\x6f\x6e\x5f\x6e\x61\x6d\x65\x2c\x63\x61\x6c\x6c\x62\x61\x63\x6b\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\x20\x6e\x65\x77\x5f\x63\x61\x63\x68\x65\x5f\x65\x6c\x65\x6d\x65\x6e\x74\x28\x66\x75\x6e\x63\x74\x69\x6f\x6e\x5f\x6e\x61\x6d\x65\x2c\x73\x65\x6c\x66\x2e\x72\x65\x73\x6f\x75\x72\x63\x65\x5f\x70\x61\x74\x68\x2c\x63\x61\x6c\x6c\x62\x61\x63\x6b\x29\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\x20\x73\x65\x6c\x66\x3b\xa\x65\x6e\x64\xa\xa\xa\xa\x2d\x2d\x2d\x40\x63\x6c\x61\x73\x73\x20\x43\x61\x63\x68\x65\x43\x61\x6c\x6c\x62\x61\x63\x6b\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x68\x61\x73\x68\x65\x72\x20\x44\x74\x77\x48\x61\x73\x68\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x63\x61\x6c\x6c\x62\x61\x63\x6b\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\x20\x6f\x72\x20\x6e\x69\x6c\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x61\x64\x64\x5f\x64\x65\x70\x65\x6e\x64\x65\x6e\x63\x69\x65\x20\x66\x75\x6e\x28\x64\x65\x70\x65\x6e\x64\x65\x6e\x63\x69\x65\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x43\x61\x63\x68\x65\x43\x61\x6c\x6c\x62\x61\x63\x6b\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x70\x65\x72\x66\x6f\x72\x6d\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\xa\xa\x2d\x2d\x2d\x40\x63\x6c\x61\x73\x73\x20\x43\x61\x63\x68\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6e\x65\x77\x5f\x65\x6c\x65\x6d\x65\x6e\x74\x20\x66\x75\x6e\x28\x66\x75\x6e\x63\x74\x69\x6f\x6e\x5f\x6e\x61\x6d\x65\x3a\x73\x74\x72\x69\x6e\x67\x2c\x63\x61\x6c\x6c\x62\x61\x63\x6b\x3a\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x69\x6c\x29\x3a\x43\x61\x63\x68\x65\x43\x61\x6c\x6c\x62\x61\x63\x6b\xa\x41\x4e\x53\x49\x5f\x52\x45\x44\x20\x3d\x20\x22\x5c\x78\x31\x62\x5b\x33\x31\x6d\x22\xa\x41\x4e\x53\x49\x5f\x47\x52\x45\x45\x4e\x20\x3d\x20\x22\x5c\x78\x31\x62\x5b\x33\x32\x6d\x22\xa\x41\x4e\x53\x49\x5f\x59\x45\x4c\x4c\x4f\x57\x20\x3d\x20\x22\x5c\x78\x31\x62\x5b\x33\x33\x6d\x22\xa\x41\x4e\x53\x49\x5f\x42\x4c\x55\x45\x20\x3d\x20\x22\x5c\x78\x31\x62\x5b\x33\x34\x6d\x22\xa\x41\x4e\x53\x49\x5f\x4d\x41\x47\x45\x4e\x54\x41\x3d\x20\x22\x5c\x78\x31\x62\x5b\x33\x35\x6d\x22\xa\x41\x4e\x53\x49\x5f\x43\x59\x41\x4e\x3d\x20\x22\x5c\x78\x31\x62\x5b\x33\x36\x6d\x22\xa\x41\x4e\x53\x49\x5f\x52\x45\x53\x45\x54\x20\x3d\x22\x5c\x78\x31\x62\x5b\x30\x6d\x22\xa\x53\x54\x41\x52\x54\x5f\x50\x4f\x49\x4e\x54\x20\x3d\x20\x22\x73\x72\x63\x2f\x6f\x6e\x65\x2e\x63\x22\xa\xa\x4c\x49\x4e\x55\x58\x5f\x43\x4f\x4d\x50\x49\x4c\x45\x52\x20\x3d\x20\x22\x67\x63\x63\x22\xa\x57\x49\x4e\x44\x4f\x57\x53\x5f\x43\x4f\x4d\x50\x49\x4c\x45\x52\x20\x3d\x20\x22\x78\x38\x36\x5f\x36\x34\x2d\x77\x36\x34\x2d\x6d\x69\x6e\x67\x77\x33\x32\x2d\x67\x63\x63\x22\xa\xa\x4f\x55\x54\x50\x55\x54\x5f\x53\x49\x4e\x47\x4c\x45\x5f\x46\x49\x4c\x45\x20\x3d\x20\x22\x4c\x75\x61\x43\x65\x6d\x62\x65\x64\x2e\x68\x22\xa\x45\x4e\x44\x5f\x54\x45\x53\x54\x5f\x50\x4f\x49\x4e\x54\x3d\x20\x22\x74\x65\x73\x74\x73\x2f\x4c\x75\x61\x43\x45\x6d\x62\x65\x64\x2e\x68\x22\xa\x53\x49\x44\x45\x5f\x45\x46\x46\x45\x43\x54\x20\x3d\x20\x22\x74\x65\x73\x74\x73\x2f\x74\x61\x72\x67\x65\x74\x22\xa\x54\x45\x53\x54\x5f\x50\x4f\x49\x4e\x54\x20\x3d\x20\x22\x74\x65\x73\x74\x73\x2f\x6d\x61\x69\x6e\x5f\x74\x65\x73\x74\x22\xa\x4c\x49\x42\x5f\x46\x4f\x4c\x44\x45\x52\x20\x3d\x20\x22\x73\x72\x63\x22\xa\x43\x41\x43\x48\x45\x5f\x50\x4f\x49\x4e\x54\x20\x20\x3d\x20\x22\x63\x61\x63\x68\x65\x32\x22\xa\x45\x58\x41\x4d\x50\x4c\x45\x53\x5f\x46\x4f\x4c\x44\x45\x52\x20\x3d\x20\x22\x65\x78\x65\x6d\x70\x6c\x65\x73\x22\xa\x54\x45\x53\x54\x5f\x46\x49\x4c\x45\x20\x3d\x20\x22\x65\x78\x65\x63\x2e\x63\x22\xa\x54\x45\x53\x54\x5f\x49\x4e\x50\x52\x45\x44\x49\x43\x54\x42\x49\x4c\x45\x5f\x53\x54\x41\x52\x54\x20\x3d\x20\x22\x53\x5f\x22\xa\x54\x45\x53\x54\x5f\x50\x52\x45\x44\x49\x43\x49\x42\x4c\x45\x5f\x53\x54\x41\x52\x54\x20\x3d\x20\x22\x54\x5f\x22\xa\x45\x58\x50\x45\x43\x54\x45\x44\x5f\x4e\x41\x4d\x45\x3d\x20\x22\x65\x78\x70\x65\x63\x74\x65\x64\x2e\x74\x78\x74\x22\xa\x43\x4f\x44\x45\x4f\x46\x5f\x54\x45\x58\x54\x20\x3d\x20\x22\x63\x6f\x64\x65\x6f\x66\x22\xa\x53\x49\x44\x45\x5f\x45\x46\x46\x45\x43\x54\x5f\x43\x4f\x4d\x50\x41\x52\x41\x54\x49\x4f\x4e\x20\x3d\x20\x22\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x22\xa\xa\xa\x52\x45\x43\x4f\x4e\x53\x54\x52\x55\x43\x54\x20\x3d\x20\x74\x72\x75\x65\xa\x53\x49\x44\x45\x5f\x45\x46\x46\x45\x43\x54\x5f\x43\x4f\x50\x59\x20\x3d\x20\x22\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x63\x6f\x70\x79\x22\xa\x4f\x55\x54\x50\x55\x54\x5f\x54\x45\x53\x54\x20\x3d\x22\x6f\x75\x74\x70\x75\x74\x5f\x74\x65\x73\x74\x22\xa\xa\xa\xa\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x43\x72\x65\x61\x74\x65\x5f\x65\x78\x61\x6d\x70\x6c\x65\x73\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x64\x74\x77\x2e\x72\x65\x6d\x6f\x76\x65\x5f\x61\x6e\x79\x28\x45\x58\x41\x4d\x50\x4c\x45\x53\x5f\x46\x4f\x4c\x44\x45\x52\x29\xa\x9\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x74\x65\x73\x74\x5f\x74\x72\x65\x65\x20\x3d\x20\x64\x74\x77\x2e\x6e\x65\x77\x54\x72\x65\x65\x5f\x66\x72\x6f\x6d\x5f\x68\x61\x72\x64\x77\x61\x72\x65\x28\x54\x45\x53\x54\x5f\x50\x4f\x49\x4e\x54\x29\xa\x9\x20\x20\x20\x74\x65\x73\x74\x5f\x74\x72\x65\x65\x2e\x65\x61\x63\x68\x28\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x28\x74\x72\x65\x65\x5f\x70\x61\x72\x74\x29\xa\x9\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x70\x61\x74\x68\x20\x3d\x20\x74\x72\x65\x65\x5f\x70\x61\x72\x74\x2e\x70\x61\x74\x68\xa\xa\x9\x20\x20\x20\x20\x20\x20\x20\x20\x69\x66\x20\x70\x61\x74\x68\x2e\x67\x65\x74\x5f\x6e\x61\x6d\x65\x28\x29\x20\x7e\x3d\x20\x22\x65\x78\x65\x63\x2e\x63\x22\x20\x74\x68\x65\x6e\xa\x9\x20\x20\x20\x20\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\xa\x9\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x6f\x6e\x74\x65\x6e\x74\x20\x3d\x20\x74\x72\x65\x65\x5f\x70\x61\x72\x74\x2e\x67\x65\x74\x5f\x76\x61\x6c\x75\x65\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x66\x6f\x72\x6d\x61\x74\x65\x64\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x20\x3d\x20\x63\x6c\x69\x62\x2e\x72\x65\x70\x6c\x61\x63\x65\x28\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x22\x2e\x2e\x2f\x22\x2c\x22\x22\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x66\x6f\x72\x6d\x61\x74\x65\x64\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x20\x3d\x20\x63\x6c\x69\x62\x2e\x72\x65\x70\x6c\x61\x63\x65\x28\x66\x6f\x72\x6d\x61\x74\x65\x64\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x22\x64\x6f\x54\x68\x65\x57\x6f\x72\x6c\x64\x5f\x74\x65\x73\x74\x2e\x68\x22\x2c\x4f\x55\x54\x50\x55\x54\x5f\x53\x49\x4e\x47\x4c\x45\x5f\x46\x49\x4c\x45\x29\x3b\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x74\x72\x65\x65\x5f\x70\x61\x72\x74\x2e\x73\x65\x74\x5f\x76\x61\x6c\x75\x65\x28\x66\x6f\x72\x6d\x61\x74\x65\x64\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x70\x61\x74\x68\x2e\x69\x6e\x73\x65\x72\x74\x5f\x64\x69\x72\x5f\x61\x74\x5f\x69\x6e\x64\x65\x78\x28\x30\x2c\x45\x58\x41\x4d\x50\x4c\x45\x53\x5f\x46\x4f\x4c\x44\x45\x52\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x70\x61\x74\x68\x2e\x72\x65\x6d\x6f\x76\x65\x5f\x64\x69\x72\x5f\x61\x74\x28\x54\x45\x53\x54\x5f\x50\x4f\x49\x4e\x54\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x66\x69\x6e\x61\x6c\x5f\x6e\x61\x6d\x65\x20\x3d\x20\x20\x70\x61\x74\x68\x2e\x67\x65\x74\x5f\x73\x75\x62\x5f\x64\x69\x72\x73\x5f\x66\x72\x6f\x6d\x5f\x69\x6e\x64\x65\x78\x28\x2d\x31\x2c\x2d\x31\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x66\x69\x6e\x61\x6c\x5f\x6e\x61\x6d\x65\x20\x3d\x20\x63\x6c\x69\x62\x2e\x72\x65\x70\x6c\x61\x63\x65\x28\x66\x69\x6e\x61\x6c\x5f\x6e\x61\x6d\x65\x2c\x22\x54\x5f\x22\x2c\x22\x22\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x66\x69\x6e\x61\x6c\x5f\x6e\x61\x6d\x65\x20\x3d\x20\x63\x6c\x69\x62\x2e\x72\x65\x70\x6c\x61\x63\x65\x28\x66\x69\x6e\x61\x6c\x5f\x6e\x61\x6d\x65\x2c\x22\x53\x5f\x22\x2c\x22\x22\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x66\x69\x6e\x61\x6c\x5f\x6e\x61\x6d\x65\x20\x3d\x20\x63\x6c\x69\x62\x2e\x72\x65\x70\x6c\x61\x63\x65\x28\x66\x69\x6e\x61\x6c\x5f\x6e\x61\x6d\x65\x2c\x22\x2f\x22\x2c\x22\x2e\x63\x22\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x70\x61\x74\x68\x2e\x72\x65\x6d\x6f\x76\x65\x5f\x73\x75\x62\x5f\x64\x69\x72\x5f\x61\x74\x5f\x69\x6e\x64\x65\x78\x28\x2d\x31\x2c\x2d\x31\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x70\x61\x74\x68\x2e\x73\x65\x74\x5f\x6e\x61\x6d\x65\x28\x66\x69\x6e\x61\x6c\x5f\x6e\x61\x6d\x65\x29\xa\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x74\x72\x65\x65\x5f\x70\x61\x72\x74\x2e\x68\x61\x72\x64\x77\x61\x72\x65\x5f\x77\x72\x69\x74\x65\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x47\x52\x45\x45\x4e\x2e\x2e\x22\x63\x72\x65\x61\x74\x65\x64\x20\x65\x78\x61\x6d\x70\x6c\x65\x22\x2e\x2e\x70\x61\x74\x68\x2e\x67\x65\x74\x5f\x66\x75\x6c\x6c\x5f\x70\x61\x74\x68\x28\x29\x2e\x2e\x22\x5c\x6e\x22\x29\xa\x9\x20\x20\x20\x65\x6e\x64\x29\xa\x9\x20\x20\x20\x74\x65\x73\x74\x5f\x74\x72\x65\x65\x2e\x63\x6f\x6d\x6d\x69\x74\x28\x29\xa\x65\x6e\x64\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x66\x6f\x6c\x64\x65\x72\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x72\x65\x74\x75\x72\x6e\x20\x73\x74\x72\x69\x6e\x67\xa\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x47\x65\x6e\x65\x72\x61\x74\x65\x5f\x73\x68\x61\x5f\x66\x72\x6f\x6d\x5f\x66\x6f\x6c\x64\x65\x72\x5f\x6e\x6f\x74\x5f\x63\x6f\x6e\x73\x69\x64\x65\x72\x69\x6e\x67\x5f\x65\x6d\x70\x74\x79\x5f\x66\x6f\x6c\x64\x65\x72\x73\x28\x66\x6f\x6c\x64\x65\x72\x29\xa\x9\x6c\x6f\x63\x61\x6c\x20\x68\x61\x73\x68\x65\x72\x20\x3d\x20\x64\x74\x77\x2e\x6e\x65\x77\x48\x61\x73\x68\x65\x72\x28\x29\xa\x9\x6c\x6f\x63\x61\x6c\x20\x66\x69\x6c\x65\x73\x2c\x66\x69\x6c\x65\x73\x5f\x73\x69\x7a\x65\x20\x3d\x20\x64\x74\x77\x2e\x6c\x69\x73\x74\x5f\x66\x69\x6c\x65\x73\x5f\x72\x65\x63\x75\x72\x73\x69\x76\x65\x6c\x79\x28\x66\x6f\x6c\x64\x65\x72\x29\xa\x9\x66\x6f\x72\x20\x69\x3d\x31\x2c\x66\x69\x6c\x65\x73\x5f\x73\x69\x7a\x65\x20\x64\x6f\xa\x9\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x75\x72\x72\x65\x6e\x74\x5f\x66\x69\x6c\x65\x20\x3d\x20\x66\x69\x6c\x65\x73\x5b\x69\x5d\xa\x9\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x66\x69\x6c\x65\x5f\x70\x61\x74\x68\x20\x3d\x20\x64\x74\x77\x2e\x63\x6f\x6e\x63\x61\x74\x5f\x70\x61\x74\x68\x28\x66\x6f\x6c\x64\x65\x72\x2c\x63\x75\x72\x72\x65\x6e\x74\x5f\x66\x69\x6c\x65\x29\xa\x9\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x6f\x6e\x74\x65\x6e\x74\x20\x3d\x20\x64\x74\x77\x2e\x6c\x6f\x61\x64\x5f\x66\x69\x6c\x65\x28\x66\x69\x6c\x65\x5f\x70\x61\x74\x68\x29\xa\x9\x9\x68\x61\x73\x68\x65\x72\x2e\x64\x69\x67\x65\x73\x74\x28\x63\x75\x72\x72\x65\x6e\x74\x5f\x66\x69\x6c\x65\x29\xa\x9\x9\x68\x61\x73\x68\x65\x72\x2e\x64\x69\x67\x65\x73\x74\x28\x63\x6f\x6e\x74\x65\x6e\x74\x29\xa\x9\x65\x6e\x64\xa\x9\x6c\x6f\x63\x61\x6c\x20\x64\x69\x72\x73\x2c\x64\x69\x72\x73\x5f\x73\x69\x7a\x65\x20\x3d\x20\x64\x74\x77\x2e\x6c\x69\x73\x74\x5f\x64\x69\x72\x73\x5f\x72\x65\x63\x75\x72\x73\x69\x76\x65\x6c\x79\x28\x66\x6f\x6c\x64\x65\x72\x29\xa\x9\x66\x6f\x72\x20\x69\x3d\x31\x2c\x64\x69\x72\x73\x5f\x73\x69\x7a\x65\x20\x64\x6f\xa\x9\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x75\x72\x72\x65\x6e\x74\x5f\x64\x69\x72\x20\x3d\x20\x64\x69\x72\x73\x5b\x69\x5d\xa\x9\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x64\x69\x72\x5f\x70\x61\x74\x68\x20\x3d\x20\x64\x74\x77\x2e\x63\x6f\x6e\x63\x61\x74\x5f\x70\x61\x74\x68\x28\x66\x6f\x6c\x64\x65\x72\x2c\x63\x75\x72\x72\x65\x6e\x74\x5f\x64\x69\x72\x29\xa\x9\x9\x6c\x6f\x63\x61\x6c\x20\x69\x67\x6e\x6f\x72\x65\x2c\x73\x69\x7a\x65\x3d\x20\x64\x74\x77\x2e\x6c\x69\x73\x74\x5f\x66\x69\x6c\x65\x73\x5f\x72\x65\x63\x75\x72\x73\x69\x76\x65\x6c\x79\x28\x64\x69\x72\x5f\x70\x61\x74\x68\x2c\x66\x61\x6c\x73\x65\x29\xa\x9\x9\x69\x66\x20\x73\x69\x7a\x65\x20\x3e\x20\x30\x20\x74\x68\x65\x6e\xa\x9\x9\x9\x68\x61\x73\x68\x65\x72\x2e\x64\x69\x67\x65\x73\x74\x28\x63\x75\x72\x72\x65\x6e\x74\x5f\x64\x69\x72\x29\xa\x9\x9\x65\x6e\x64\xa\x9\x65\x6e\x64\xa\x9\x72\x65\x74\x75\x72\x6e\x20\x68\x61\x73\x68\x65\x72\x2e\x67\x65\x74\x5f\x76\x61\x6c\x75\x65\x28\x29\xa\x65\x6e\x64\xa\xa\xa\xa\x2d\x2d\x2d\x40\x63\x6c\x61\x73\x73\x20\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x70\x61\x74\x68\x20\x44\x74\x77\x50\x61\x74\x68\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x76\x61\x6c\x75\x65\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x65\x74\x5f\x76\x61\x6c\x75\x65\x20\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x75\x6d\x62\x65\x72\x20\x7c\x20\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x7c\x20\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\x20\x7c\x20\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\x20\x7c\x20\x44\x74\x77\x41\x63\x74\x69\x6f\x6e\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x68\x61\x72\x64\x77\x61\x72\x65\x5f\x72\x65\x6d\x6f\x76\x65\x20\x66\x75\x6e\x28\x61\x73\x5f\x74\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x7c\x6e\x69\x6c\x29\x3a\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x68\x61\x72\x64\x77\x61\x72\x65\x5f\x77\x72\x69\x74\x65\x20\x66\x75\x6e\x28\x61\x73\x5f\x74\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x7c\x6e\x69\x6c\x29\x3a\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x68\x61\x72\x64\x77\x61\x72\x65\x5f\x6d\x6f\x64\x69\x66\x79\x20\x66\x75\x6e\x28\x61\x73\x5f\x74\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x7c\x6e\x69\x6c\x29\x3a\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x73\x68\x61\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x73\x5f\x62\x6c\x6f\x62\x20\x66\x75\x6e\x28\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x75\x6e\x6c\x6f\x61\x64\x20\x66\x75\x6e\x28\x29\x3a\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6c\x6f\x61\x64\x20\x66\x75\x6e\x28\x29\x3a\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\xa\xa\xa\x2d\x2d\x2d\x40\x63\x6c\x61\x73\x73\x20\x44\x74\x77\x54\x72\x65\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6e\x65\x77\x54\x72\x65\x65\x50\x61\x72\x74\x5f\x65\x6d\x70\x74\x79\x20\x66\x75\x6e\x20\x28\x29\x3a\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6e\x65\x77\x54\x72\x65\x65\x50\x61\x72\x74\x5f\x6c\x6f\x61\x64\x69\x6e\x67\x20\x66\x75\x6e\x20\x28\x29\x3a\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x74\x72\x65\x65\x5f\x70\x61\x72\x74\x5f\x62\x79\x5f\x69\x6e\x64\x65\x78\x20\x66\x75\x6e\x28\x69\x6e\x64\x65\x78\x3a\x6e\x75\x6d\x62\x65\x72\x29\x3a\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x6e\x73\x65\x63\x75\x72\x65\x5f\x68\x61\x72\x64\x77\x61\x72\x65\x5f\x77\x72\x69\x74\x65\x5f\x74\x72\x65\x65\x20\x66\x75\x6e\x28\x29\x3a\x44\x74\x77\x54\x72\x65\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x6e\x73\x65\x63\x75\x72\x65\x5f\x68\x61\x72\x64\x77\x61\x72\x65\x5f\x72\x65\x6d\x6f\x76\x65\x20\x66\x75\x6e\x28\x29\x3a\x44\x74\x77\x54\x72\x65\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x63\x6f\x6d\x6d\x69\x74\x20\x66\x75\x6e\x28\x29\x3a\x44\x74\x77\x54\x72\x65\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x73\x69\x7a\x65\x20\x66\x75\x6e\x28\x29\x3a\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x74\x72\x65\x65\x5f\x70\x61\x72\x74\x5f\x62\x79\x5f\x6e\x61\x6d\x65\x20\x66\x75\x6e\x28\x6e\x61\x6d\x65\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x74\x72\x65\x65\x5f\x70\x61\x72\x74\x5f\x62\x79\x5f\x70\x61\x74\x68\x20\x66\x75\x6e\x28\x6e\x61\x6d\x65\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x66\x69\x6e\x64\x20\x66\x75\x6e\x28\x63\x61\x6c\x6c\x62\x61\x63\x6b\x3a\x20\x66\x75\x6e\x28\x70\x61\x72\x74\x3a\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x29\x3a\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x63\x6f\x75\x6e\x74\x20\x66\x75\x6e\x28\x63\x61\x6c\x6c\x62\x61\x63\x6b\x3a\x20\x66\x75\x6e\x28\x70\x61\x72\x74\x3a\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x29\x3a\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6d\x61\x70\x20\x66\x75\x6e\x28\x63\x61\x6c\x6c\x62\x61\x63\x6b\x3a\x20\x66\x75\x6e\x28\x70\x61\x72\x74\x3a\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\x29\x3a\x61\x6e\x79\x29\x3a\x61\x6e\x79\x5b\x5d\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x65\x61\x63\x68\x20\x66\x75\x6e\x28\x63\x61\x6c\x6c\x62\x61\x63\x6b\x3a\x20\x66\x75\x6e\x28\x70\x61\x72\x74\x3a\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\x29\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x64\x75\x6d\x70\x5f\x74\x6f\x5f\x6a\x73\x6f\x6e\x5f\x73\x74\x72\x69\x6e\x67\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x64\x75\x6d\x70\x5f\x74\x6f\x5f\x6a\x73\x6f\x6e\x5f\x66\x69\x6c\x65\x20\x66\x75\x6e\x28\x29\x3a\x44\x74\x77\x54\x72\x65\x65\xa\xa\x2d\x2d\x2d\x40\x63\x6c\x61\x73\x73\x20\x44\x74\x77\x50\x61\x74\x68\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x70\x61\x74\x68\x5f\x63\x68\x61\x6e\x67\x65\x64\x20\x66\x75\x6e\x28\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x61\x64\x64\x5f\x73\x74\x61\x72\x74\x5f\x64\x69\x72\x20\x66\x75\x6e\x28\x73\x74\x61\x72\x74\x5f\x64\x69\x72\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x50\x61\x74\x68\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x61\x64\x64\x5f\x65\x6e\x64\x5f\x64\x69\x72\x5f\x6d\x65\x74\x68\x6f\x64\x20\x66\x75\x6e\x20\x28\x65\x6e\x64\x5f\x64\x69\x72\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x50\x61\x74\x68\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x63\x68\x61\x6e\x67\x65\x64\x20\x66\x75\x6e\x28\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x64\x69\x72\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x65\x78\x74\x65\x6e\x73\x69\x6f\x6e\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x6e\x61\x6d\x65\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x6f\x6e\x6c\x79\x5f\x6e\x61\x6d\x65\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x66\x75\x6c\x6c\x5f\x70\x61\x74\x68\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x65\x74\x5f\x6e\x61\x6d\x65\x20\x66\x75\x6e\x28\x6e\x65\x77\x5f\x6e\x61\x6d\x65\x3a\x73\x74\x72\x69\x6e\x67\x29\x20\x44\x74\x77\x50\x61\x74\x68\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x65\x74\x5f\x6f\x6e\x6c\x79\x5f\x6e\x61\x6d\x65\x20\x66\x75\x6e\x28\x6e\x65\x77\x5f\x6e\x61\x6d\x65\x3a\x73\x74\x72\x69\x6e\x67\x29\x20\x44\x74\x77\x50\x61\x74\x68\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x65\x74\x5f\x65\x78\x74\x65\x6e\x73\x69\x6f\x6e\x20\x66\x75\x6e\x28\x65\x78\x74\x65\x6e\x73\x69\x6f\x6e\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x50\x61\x74\x68\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x65\x74\x5f\x64\x69\x72\x20\x66\x75\x6e\x28\x64\x69\x72\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x50\x61\x74\x68\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x65\x74\x5f\x70\x61\x74\x68\x20\x66\x75\x6e\x28\x70\x61\x74\x68\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x50\x61\x74\x68\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x72\x65\x70\x6c\x61\x63\x65\x5f\x64\x69\x72\x73\x20\x66\x75\x6e\x28\x6f\x6c\x64\x5f\x64\x69\x72\x3a\x73\x74\x72\x69\x6e\x67\x2c\x6e\x65\x77\x5f\x64\x69\x72\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x50\x61\x74\x68\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x74\x6f\x74\x61\x6c\x5f\x64\x69\x72\x73\x20\x66\x75\x6e\x28\x29\x3a\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x73\x75\x62\x5f\x64\x69\x72\x73\x5f\x66\x72\x6f\x6d\x5f\x69\x6e\x64\x65\x78\x20\x66\x75\x6e\x28\x73\x74\x61\x72\x74\x3a\x6e\x75\x6d\x62\x65\x72\x2c\x65\x6e\x64\x3a\x6e\x75\x6d\x62\x65\x72\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x6e\x73\x65\x72\x74\x5f\x64\x69\x72\x5f\x61\x74\x5f\x69\x6e\x64\x65\x78\x20\x66\x75\x6e\x28\x69\x6e\x64\x65\x78\x3a\x6e\x75\x6d\x62\x65\x72\x2c\x64\x69\x72\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x50\x61\x74\x68\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x72\x65\x6d\x6f\x76\x65\x5f\x73\x75\x62\x5f\x64\x69\x72\x5f\x61\x74\x5f\x69\x6e\x64\x65\x78\x20\x66\x75\x6e\x28\x73\x74\x61\x72\x74\x3a\x6e\x75\x6d\x62\x65\x72\x2c\x65\x6e\x64\x3a\x6e\x75\x6d\x62\x65\x72\x29\x3a\x44\x74\x77\x50\x61\x74\x68\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x6e\x73\x65\x72\x74\x5f\x64\x69\x72\x5f\x61\x66\x74\x65\x72\x20\x66\x75\x6e\x28\x70\x6f\x69\x6e\x74\x3a\x73\x74\x72\x69\x6e\x67\x2c\x20\x64\x69\x72\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x50\x61\x74\x68\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x6e\x73\x65\x72\x74\x5f\x64\x69\x72\x5f\x62\x65\x66\x6f\x72\x65\x20\x66\x75\x6e\x28\x70\x6f\x69\x6e\x74\x3a\x73\x74\x72\x69\x6e\x67\x2c\x20\x64\x69\x72\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x50\x61\x74\x68\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x72\x65\x6d\x6f\x76\x65\x5f\x64\x69\x72\x5f\x61\x74\x20\x66\x75\x6e\x28\x70\x6f\x69\x6e\x74\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x50\x61\x74\x68\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x75\x6e\x70\x61\x63\x6b\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\x5b\x5d\x2c\x6e\x75\x6d\x62\x65\x72\xa\xa\xa\xa\x2d\x2d\x2d\x40\x63\x6c\x61\x73\x73\x20\x44\x74\x77\x48\x61\x73\x68\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x64\x69\x67\x65\x73\x74\x20\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x75\x6d\x62\x65\x72\x20\x7c\x20\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x7c\x20\x73\x74\x72\x69\x6e\x67\x20\x29\x3a\x44\x74\x77\x48\x61\x73\x68\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x64\x69\x67\x65\x73\x74\x5f\x66\x69\x6c\x65\x20\x66\x75\x6e\x28\x73\x6f\x75\x72\x63\x65\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x48\x61\x73\x68\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x64\x69\x67\x65\x73\x74\x5f\x66\x6f\x6c\x64\x65\x72\x5f\x62\x79\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x20\x66\x75\x6e\x28\x73\x6f\x75\x72\x63\x65\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x48\x61\x73\x68\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x64\x69\x67\x65\x73\x74\x5f\x66\x6f\x6c\x64\x65\x72\x5f\x62\x79\x5f\x6c\x61\x73\x74\x5f\x6d\x6f\x64\x69\x66\x69\x63\x61\x74\x69\x6f\x6e\x20\x66\x75\x6e\x28\x73\x6f\x75\x72\x63\x65\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x48\x61\x73\x68\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x76\x61\x6c\x75\x65\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\xa\x2d\x2d\x2d\x40\x63\x6c\x61\x73\x73\x20\x44\x74\x77\x41\x63\x74\x69\x6f\x6e\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x74\x79\x70\x65\x5f\x63\x6f\x64\x65\x20\x66\x75\x6e\x28\x29\x3a\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x74\x79\x70\x65\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x65\x74\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x20\x66\x75\x6e\x28\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x73\x6f\x75\x72\x63\x65\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x64\x65\x73\x74\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x65\x74\x5f\x64\x65\x73\x74\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\xa\xa\xa\xa\x2d\x2d\x2d\x40\x63\x6c\x61\x73\x73\x20\x44\x74\x77\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x77\x72\x69\x74\x65\x20\x66\x75\x6e\x28\x73\x72\x63\x20\x3a\x73\x74\x72\x69\x6e\x67\x20\x2c\x20\x76\x61\x6c\x75\x65\x3a\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x75\x6d\x62\x65\x72\x20\x7c\x20\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x7c\x20\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\x20\x29\x3a\x44\x74\x77\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x72\x65\x6d\x6f\x76\x65\x5f\x61\x6e\x79\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x63\x6f\x70\x79\x5f\x61\x6e\x79\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x2c\x64\x65\x73\x74\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6d\x6f\x76\x65\x5f\x61\x6e\x79\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x2c\x64\x65\x73\x74\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x64\x75\x6d\x70\x5f\x74\x6f\x5f\x6a\x73\x6f\x6e\x5f\x73\x74\x72\x69\x6e\x67\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x64\x75\x6d\x70\x5f\x74\x6f\x5f\x6a\x73\x6f\x6e\x5f\x66\x69\x6c\x65\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x65\x61\x63\x68\x20\x66\x75\x6e\x28\x63\x61\x6c\x6c\x62\x61\x63\x3a\x20\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x44\x74\x77\x41\x63\x74\x69\x6f\x6e\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\x29\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6d\x61\x70\x20\x66\x75\x6e\x28\x63\x61\x6c\x6c\x62\x61\x63\x3a\x20\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x44\x74\x77\x41\x63\x74\x69\x6f\x6e\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\x29\x3a\x61\x6e\x79\x29\x3a\x61\x6e\x79\x5b\x5d\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x66\x69\x6e\x64\x20\x66\x75\x6e\x28\x63\x61\x6c\x6c\x62\x61\x63\x3a\x20\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x44\x74\x77\x41\x63\x74\x69\x6f\x6e\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x29\x3a\x44\x74\x77\x41\x63\x74\x69\x6f\x6e\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x63\x6f\x75\x6e\x74\x20\x66\x75\x6e\x28\x63\x61\x6c\x6c\x62\x61\x63\x3a\x20\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x44\x74\x77\x41\x63\x74\x69\x6f\x6e\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x29\x3a\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x5f\x5f\x69\x6e\x64\x65\x78\x20\x66\x75\x6e\x28\x69\x6e\x64\x65\x78\x3a\x6e\x75\x6d\x62\x65\x72\x29\x3a\x44\x74\x77\x41\x63\x74\x69\x6f\x6e\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x61\x63\x74\x69\x6f\x6e\x20\x66\x75\x6e\x28\x69\x6e\x64\x65\x78\x3a\x6e\x75\x6d\x62\x65\x72\x29\x3a\x44\x74\x77\x41\x63\x74\x69\x6f\x6e\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x63\x6f\x6d\x6d\x69\x74\x20\x66\x75\x6e\x28\x29\x3a\x44\x74\x77\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\xa\xa\xa\x2d\x2d\x2d\x40\x63\x6c\x61\x73\x73\x20\x44\x74\x77\x53\x63\x68\x65\x6d\x61\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x61\x64\x64\x5f\x70\x72\x69\x6d\x61\x72\x79\x5f\x6b\x65\x79\x73\x20\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x73\x3a\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x73\x74\x72\x69\x6e\x67\x5b\x5d\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x75\x62\x5f\x73\x63\x68\x65\x6d\x61\x20\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x73\x3a\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x73\x74\x72\x69\x6e\x67\x5b\x5d\x29\xa\xa\x2d\x2d\x2d\x40\x63\x6c\x61\x73\x73\x20\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x63\x68\x65\x6d\x61\x5f\x6e\x65\x77\x5f\x69\x6e\x73\x65\x72\x74\x69\x6f\x6e\x20\x66\x75\x6e\x28\x29\x3a\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x64\x61\x6e\x67\x65\x72\x6f\x75\x73\x5f\x72\x65\x6d\x6f\x76\x65\x5f\x70\x72\x6f\x70\x20\x66\x75\x6e\x28\x70\x72\x69\x6d\x61\x72\x79\x5f\x6b\x65\x79\x3a\x73\x74\x72\x69\x6e\x67\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x64\x61\x6e\x67\x65\x72\x6f\x75\x73\x5f\x72\x65\x6e\x61\x6d\x65\x5f\x70\x72\x6f\x70\x20\x66\x75\x6e\x28\x70\x72\x69\x6d\x61\x72\x79\x5f\x6b\x65\x79\x3a\x73\x74\x72\x69\x6e\x67\x20\x2c\x6e\x65\x77\x5f\x6e\x61\x6d\x65\x3a\x73\x74\x72\x69\x6e\x67\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x72\x65\x73\x6f\x75\x72\x63\x65\x5f\x6d\x61\x74\x63\x68\x69\x6e\x67\x5f\x70\x72\x69\x6d\x61\x72\x79\x5f\x6b\x65\x79\x20\x66\x75\x6e\x28\x70\x72\x69\x6d\x61\x72\x79\x5f\x6b\x65\x79\x3a\x20\x73\x74\x72\x69\x6e\x67\x2c\x20\x20\x76\x61\x6c\x75\x65\x3a\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x75\x6d\x62\x65\x72\x20\x7c\x20\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x7c\x20\x44\x74\x77\x62\x6c\x6f\x62\x73\x20\x7c\x20\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\x20\x29\x3a\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x72\x65\x73\x6f\x75\x72\x63\x65\x5f\x62\x79\x5f\x6e\x61\x6d\x65\x5f\x69\x64\x20\x66\x75\x6e\x28\x69\x64\x5f\x6e\x61\x6d\x65\x3a\x73\x74\x72\x69\x6e\x67\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x63\x68\x65\x6d\x61\x5f\x6c\x69\x73\x74\x20\x66\x75\x6e\x28\x29\x3a\x20\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\x5b\x5d\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x63\x68\x65\x6d\x61\x5f\x65\x61\x63\x68\x20\x66\x75\x6e\x28\x63\x61\x6c\x6c\x62\x61\x63\x6b\x3a\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\x29\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x63\x68\x65\x6d\x61\x5f\x66\x69\x6e\x64\x20\x66\x75\x6e\x28\x63\x61\x6c\x6c\x62\x61\x63\x6b\x3a\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x29\x3a\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x63\x68\x65\x6d\x61\x5f\x6d\x61\x70\x20\x66\x75\x6e\x28\x63\x61\x6c\x6c\x62\x61\x63\x6b\x3a\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\x29\x3a\x61\x6e\x79\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x63\x68\x65\x6d\x61\x5f\x63\x6f\x75\x6e\x74\x20\x66\x75\x6e\x28\x63\x61\x6c\x6c\x62\x61\x63\x6b\x3a\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x29\x3a\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x75\x62\x5f\x72\x65\x73\x6f\x75\x72\x63\x65\x20\x66\x75\x6e\x28\x73\x74\x72\x3a\x73\x74\x72\x69\x6e\x67\x29\x20\x3a\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x75\x62\x5f\x72\x65\x73\x6f\x75\x72\x63\x65\x5f\x6e\x65\x78\x74\x20\x66\x75\x6e\x28\x73\x74\x72\x3a\x73\x74\x72\x69\x6e\x67\x29\x20\x3a\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x75\x62\x5f\x72\x65\x73\x6f\x75\x72\x63\x65\x5f\x6e\x6f\x77\x20\x66\x75\x6e\x28\x73\x74\x72\x3a\x73\x74\x72\x69\x6e\x67\x29\x20\x3a\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x75\x62\x5f\x72\x65\x73\x6f\x75\x72\x63\x65\x5f\x6e\x6f\x77\x5f\x69\x6e\x5f\x75\x6e\x69\x78\x20\x66\x75\x6e\x28\x73\x74\x72\x3a\x73\x74\x72\x69\x6e\x67\x29\x20\x3a\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x5f\x5f\x69\x6e\x64\x65\x78\x20\x66\x75\x6e\x28\x73\x74\x72\x3a\x73\x74\x72\x69\x6e\x67\x29\x20\x3a\x20\x6e\x75\x6d\x62\x65\x72\x20\x2c\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x76\x61\x6c\x75\x65\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x75\x6d\x62\x65\x72\x20\x7c\x20\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x7c\x20\x6e\x69\x6c\x20\x7c\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x73\x74\x72\x69\x6e\x67\x20\x66\x75\x6e\x28\x29\x3a\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x69\x6c\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x6e\x75\x6d\x62\x65\x72\x20\x66\x75\x6e\x28\x29\x3a\x20\x6e\x75\x6d\x62\x65\x72\x20\x7c\x20\x6e\x69\x6c\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x62\x6f\x6f\x6c\x20\x66\x75\x6e\x28\x29\x3a\x20\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x7c\x20\x6e\x69\x6c\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x65\x74\x5f\x76\x61\x6c\x75\x65\x20\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x75\x6d\x62\x65\x72\x20\x7c\x20\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x7c\x20\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\x20\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x63\x6f\x6d\x6d\x69\x74\x20\x66\x75\x6e\x28\x29\x20\x20\x61\x70\x70\x6c\x79\x20\x74\x68\x65\x20\x6d\x6f\x64\x69\x66\x69\x63\x61\x74\x69\x6f\x6e\x73\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6c\x6f\x63\x6b\x20\x66\x75\x6e\x28\x29\x20\x6c\x6f\x63\x6b\x20\x74\x68\x65\x20\x72\x65\x73\x6f\x75\x72\x63\x65\x20\x66\x72\x6f\x6d\x20\x6f\x74\x68\x65\x72\x20\x70\x72\x6f\x63\x65\x73\x73\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x75\x6e\x6c\x6f\x63\x6b\x20\x66\x75\x6e\x28\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x75\x6e\x6c\x6f\x61\x64\x20\x66\x75\x6e\x28\x29\x20\x75\x6e\x6c\x6f\x61\x64\x20\x74\x68\x65\x20\x63\x6f\x6e\x74\x65\x6e\x74\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x70\x61\x74\x68\x5f\x73\x74\x72\x69\x6e\x67\x20\x66\x75\x6e\x28\x29\x20\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x65\x61\x63\x68\x20\x66\x75\x6e\x28\x63\x61\x6c\x6c\x62\x61\x63\x6b\x20\x3a\x66\x75\x6e\x28\x65\x6c\x65\x6d\x65\x6e\x74\x3a\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\x29\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x65\x74\x5f\x65\x78\x74\x65\x6e\x73\x69\x6f\x6e\x20\x66\x75\x6e\x28\x65\x78\x74\x65\x6e\x73\x69\x6f\x6e\x3a\x73\x74\x72\x69\x6e\x67\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6c\x69\x73\x74\x20\x66\x75\x6e\x28\x29\x3a\x20\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\x5b\x5d\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x64\x65\x73\x74\x72\x6f\x79\x20\x66\x75\x6e\x28\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x65\x74\x5f\x76\x61\x6c\x75\x65\x5f\x69\x6e\x5f\x73\x75\x62\x5f\x72\x65\x73\x6f\x75\x72\x63\x65\x20\x66\x75\x6e\x28\x6b\x65\x79\x3a\x73\x74\x72\x69\x6e\x67\x20\x2c\x76\x61\x6c\x75\x65\x3a\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x75\x6d\x62\x65\x72\x20\x7c\x20\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x7c\x20\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\x20\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x74\x5f\x76\x61\x6c\x75\x65\x5f\x66\x72\x6f\x6d\x5f\x73\x75\x62\x5f\x72\x65\x73\x6f\x75\x72\x63\x65\x20\x66\x75\x6e\x28\x6b\x65\x79\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x75\x6d\x62\x65\x72\x20\x7c\x20\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x7c\x20\x6e\x69\x6c\x20\x7c\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6e\x65\x77\x53\x63\x68\x65\x6d\x61\x20\x66\x75\x6e\x28\x29\x3a\x44\x74\x77\x53\x63\x68\x65\x6d\x61\xa\xa\xa\x2d\x2d\x2d\x40\x63\x6c\x61\x73\x73\x20\x44\x74\x77\x4d\x6f\x64\x75\x6c\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x63\x6f\x70\x79\x5f\x61\x6e\x79\x5f\x6f\x76\x65\x72\x77\x72\x69\x74\x69\x6e\x67\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x2c\x64\x65\x73\x74\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x72\x65\x74\x75\x72\x6e\x73\x20\x74\x72\x75\x65\x20\x69\x66\x20\x74\x68\x65\x20\x6f\x70\x65\x72\x61\x74\x69\x6f\x6e\x20\x77\x65\x72\x65\x20\x6f\x6b\x20\x6f\x74\x68\x65\x72\x77\x69\x73\x65\x20\x66\x61\x6c\x73\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x63\x6f\x70\x79\x5f\x61\x6e\x79\x5f\x6d\x65\x72\x67\x69\x6e\x67\x20\x20\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x2c\x64\x65\x73\x74\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x72\x65\x74\x75\x72\x6e\x73\x20\x74\x72\x75\x65\x20\x69\x66\x20\x74\x68\x65\x20\x6f\x70\x65\x72\x61\x74\x69\x6f\x6e\x20\x77\x65\x72\x65\x20\x6f\x6b\x20\x6f\x74\x68\x65\x72\x77\x69\x73\x65\x20\x66\x61\x6c\x73\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6d\x6f\x76\x65\x5f\x61\x6e\x79\x5f\x6f\x76\x65\x72\x77\x72\x69\x74\x69\x6e\x67\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x2c\x64\x65\x73\x74\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x72\x65\x74\x75\x72\x6e\x73\x20\x74\x72\x75\x65\x20\x69\x66\x20\x74\x68\x65\x20\x6f\x70\x65\x72\x61\x74\x69\x6f\x6e\x20\x77\x65\x72\x65\x20\x6f\x6b\x20\x6f\x74\x68\x65\x72\x77\x69\x73\x65\x20\x66\x61\x6c\x73\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6d\x6f\x76\x65\x5f\x61\x6e\x79\x5f\x6d\x65\x72\x67\x69\x6e\x67\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x2c\x64\x65\x73\x74\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x72\x65\x74\x75\x72\x6e\x73\x20\x74\x72\x75\x65\x20\x69\x66\x20\x74\x68\x65\x20\x6f\x70\x65\x72\x61\x74\x69\x6f\x6e\x20\x77\x65\x72\x65\x20\x6f\x6b\x20\x6f\x74\x68\x65\x72\x77\x69\x73\x65\x20\x66\x61\x6c\x73\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x72\x65\x6d\x6f\x76\x65\x5f\x61\x6e\x79\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x72\x65\x74\x75\x72\x6e\x73\x20\x74\x72\x75\x65\x20\x69\x66\x20\x74\x68\x65\x20\x6f\x70\x65\x72\x61\x74\x69\x6f\x6e\x20\x77\x65\x72\x65\x20\x6f\x6b\x20\x6f\x74\x68\x65\x72\x77\x69\x73\x65\x20\x66\x61\x6c\x73\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x62\x61\x73\x65\x36\x34\x5f\x65\x6e\x63\x6f\x64\x65\x5f\x66\x69\x6c\x65\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x73\x74\x72\x69\x6e\x67\x20\x74\x72\x61\x6e\x73\x66\x6f\x72\x6d\x20\x66\x69\x6c\x65\x20\x69\x6e\x74\x6f\x20\x62\x61\x73\x65\x36\x34\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x62\x61\x73\x65\x36\x34\x5f\x65\x6e\x63\x6f\x64\x65\x20\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x75\x6d\x62\x65\x72\x20\x7c\x20\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x7c\x20\x73\x74\x72\x69\x6e\x67\x29\x3a\x73\x74\x72\x69\x6e\x67\x20\x74\x72\x61\x6e\x73\x66\x6f\x72\x6d\x20\x63\x6f\x6e\x74\x65\x6e\x74\x20\x69\x6e\x74\x6f\x20\x62\x61\x73\x65\x36\x34\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x62\x61\x73\x65\x36\x34\x5f\x64\x65\x63\x6f\x64\x65\x20\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x20\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x73\x74\x72\x69\x6e\x67\x20\x72\x65\x74\x72\x61\x6e\x73\x66\x6f\x72\x6d\x20\x62\x61\x73\x65\x36\x34\x20\x69\x6e\x74\x6f\x20\x6e\x6f\x72\x6d\x61\x6c\x20\x76\x61\x6c\x75\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6c\x69\x73\x74\x5f\x66\x69\x6c\x65\x73\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x2c\x63\x6f\x6e\x63\x61\x74\x5f\x70\x61\x74\x68\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x7c\x6e\x69\x6c\x29\x3a\x73\x74\x72\x69\x6e\x67\x5b\x5d\x2c\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6c\x69\x73\x74\x5f\x64\x69\x72\x73\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x2c\x63\x6f\x6e\x63\x61\x74\x5f\x70\x61\x74\x68\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x7c\x6e\x69\x6c\x29\x3a\x73\x74\x72\x69\x6e\x67\x5b\x5d\x2c\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6c\x69\x73\x74\x5f\x61\x6c\x6c\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x2c\x63\x6f\x6e\x63\x61\x74\x5f\x70\x61\x74\x68\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x7c\x6e\x69\x6c\x29\x3a\x73\x74\x72\x69\x6e\x67\x5b\x5d\x2c\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6c\x69\x73\x74\x5f\x66\x69\x6c\x65\x73\x5f\x72\x65\x63\x75\x72\x73\x69\x76\x65\x6c\x79\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x2c\x63\x6f\x6e\x63\x61\x74\x5f\x70\x61\x74\x68\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x7c\x6e\x69\x6c\x29\x3a\x73\x74\x72\x69\x6e\x67\x5b\x5d\x2c\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6c\x69\x73\x74\x5f\x64\x69\x72\x73\x5f\x72\x65\x63\x75\x72\x73\x69\x76\x65\x6c\x79\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x2c\x63\x6f\x6e\x63\x61\x74\x5f\x70\x61\x74\x68\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x7c\x6e\x69\x6c\x29\x3a\x73\x74\x72\x69\x6e\x67\x5b\x5d\x2c\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6c\x69\x73\x74\x5f\x61\x6c\x6c\x5f\x72\x65\x63\x75\x72\x73\x69\x76\x65\x6c\x79\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x2c\x63\x6f\x6e\x63\x61\x74\x5f\x70\x61\x74\x68\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x7c\x6e\x69\x6c\x29\x3a\x73\x74\x72\x69\x6e\x67\x5b\x5d\x2c\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6c\x6f\x61\x64\x5f\x66\x69\x6c\x65\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x77\x72\x69\x74\x65\x5f\x66\x69\x6c\x65\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x2c\x76\x61\x6c\x75\x65\x3a\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x75\x6d\x62\x65\x72\x20\x7c\x20\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x7c\x20\x44\x74\x77\x54\x72\x65\x65\x50\x61\x72\x74\x20\x7c\x20\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\x20\x7c\x20\x44\x74\x77\x41\x63\x74\x69\x6f\x6e\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\x29\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x73\x5f\x62\x6c\x6f\x62\x20\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x61\x6e\x79\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x72\x65\x74\x75\x72\x6e\x73\x20\x69\x66\x20\x61\x20\x76\x61\x6c\x75\x65\x20\x69\x73\x20\x61\x20\x62\x6c\x6f\x62\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6e\x65\x77\x52\x65\x73\x6f\x75\x72\x63\x65\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x52\x65\x73\x6f\x75\x72\x63\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x6e\x65\x72\x61\x74\x65\x5f\x73\x68\x61\x20\x66\x75\x6e\x28\x76\x61\x6c\x75\x65\x3a\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x75\x6d\x62\x65\x72\x20\x7c\x20\x62\x6f\x6f\x6c\x65\x61\x6e\x20\x7c\x20\x73\x74\x72\x69\x6e\x67\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x6e\x65\x72\x61\x74\x65\x5f\x73\x68\x61\x5f\x66\x72\x6f\x6d\x5f\x66\x69\x6c\x65\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x6e\x65\x72\x61\x74\x65\x5f\x73\x68\x61\x5f\x66\x72\x6f\x6d\x5f\x66\x6f\x6c\x64\x65\x72\x5f\x62\x79\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x67\x65\x6e\x65\x72\x61\x74\x65\x5f\x73\x68\x61\x5f\x66\x72\x6f\x6d\x5f\x66\x6f\x6c\x64\x65\x72\x5f\x62\x79\x5f\x6c\x61\x73\x74\x5f\x6d\x6f\x64\x69\x66\x69\x63\x61\x74\x69\x6f\x6e\x20\x66\x75\x6e\x28\x73\x72\x63\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6e\x65\x77\x48\x61\x73\x68\x65\x72\x20\x66\x75\x6e\x28\x29\x3a\x44\x74\x77\x48\x61\x73\x68\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x73\x64\x69\x72\x20\x66\x75\x6e\x28\x70\x61\x74\x68\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x73\x66\x69\x6c\x65\x20\x66\x75\x6e\x28\x70\x61\x74\x68\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x69\x73\x66\x69\x6c\x65\x5f\x62\x6c\x6f\x62\x20\x66\x75\x6e\x28\x70\x61\x74\x68\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6e\x65\x77\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\x20\x66\x75\x6e\x28\x29\x3a\x44\x74\x77\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6e\x65\x77\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\x5f\x66\x72\x6f\x6d\x5f\x66\x69\x6c\x65\x20\x66\x75\x6e\x28\x29\x3a\x44\x74\x77\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6e\x65\x77\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\x5f\x66\x72\x6f\x6d\x5f\x6a\x73\x6f\x6e\x5f\x73\x74\x72\x69\x6e\x67\x20\x66\x75\x6e\x28\x29\x3a\x44\x74\x77\x54\x72\x61\x6e\x73\x61\x63\x74\x69\x6f\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6e\x65\x77\x50\x61\x74\x68\x20\x66\x75\x6e\x28\x70\x61\x74\x68\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x50\x61\x74\x68\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6e\x65\x77\x54\x72\x65\x65\x20\x66\x75\x6e\x28\x29\x3a\x44\x74\x77\x54\x72\x65\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x6e\x65\x77\x54\x72\x65\x65\x5f\x66\x72\x6f\x6d\x5f\x68\x61\x72\x64\x77\x61\x72\x65\x20\x66\x75\x6e\x28\x70\x61\x74\x68\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x44\x74\x77\x54\x72\x65\x65\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x63\x6f\x6e\x63\x61\x74\x5f\x70\x61\x74\x68\x20\x66\x75\x6e\x28\x70\x61\x74\x68\x31\x3a\x73\x74\x72\x69\x6e\x67\x2c\x70\x61\x74\x68\x32\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x74\x61\x72\x74\x73\x5f\x77\x69\x74\x68\x20\x66\x75\x6e\x28\x63\x6f\x6d\x70\x61\x72\x61\x74\x69\x6f\x6e\x3a\x73\x74\x72\x69\x6e\x67\x2c\x70\x72\x65\x66\x69\x78\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x65\x6e\x64\x73\x5f\x77\x69\x74\x68\x20\x66\x75\x6e\x28\x63\x6f\x6d\x70\x61\x72\x61\x74\x69\x6f\x6e\x3a\x73\x74\x72\x69\x6e\x67\x2c\x73\x75\x6c\x66\x69\x78\x3a\x73\x74\x72\x69\x6e\x67\x29\x3a\x62\x6f\x6f\x6c\x65\x61\x6e\xa\xa\xa\xa\x2d\x2d\x2d\x40\x74\x79\x70\x65\x20\x44\x74\x77\x4d\x6f\x64\x75\x6c\x65\xa\x64\x74\x77\x20\x3d\x20\x64\x74\x77\xa\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x63\x6f\x6e\x74\x65\x6e\x74\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x69\x6e\x64\x65\x78\x20\x6e\x75\x6d\x62\x65\x72\xa\x6c\x6f\x63\x61\x6c\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x69\x73\x5f\x63\x6f\x64\x65\x6f\x66\x5f\x61\x74\x5f\x70\x6f\x69\x6e\x74\x28\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x69\x6e\x64\x65\x78\x29\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x6f\x64\x65\x6f\x66\x5f\x73\x69\x7a\x65\x20\x3d\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x73\x74\x72\x5f\x73\x69\x7a\x65\x28\x43\x4f\x44\x45\x4f\x46\x5f\x54\x45\x58\x54\x29\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x6f\x6e\x74\x65\x6e\x74\x5f\x73\x69\x7a\x65\x20\x3d\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x73\x74\x72\x5f\x73\x69\x7a\x65\x28\x63\x6f\x6e\x74\x65\x6e\x74\x29\xa\x20\x20\x20\x20\x69\x66\x20\x69\x6e\x64\x65\x78\x20\x2b\x20\x63\x6f\x64\x65\x6f\x66\x5f\x73\x69\x7a\x65\x20\x3e\x3d\x20\x63\x6f\x6e\x74\x65\x6e\x74\x5f\x73\x69\x7a\x65\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\x20\x66\x61\x6c\x73\x65\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x62\x75\x66\x66\x65\x72\x20\x3d\x20\x22\x22\xa\x20\x20\x20\x20\x66\x6f\x72\x20\x69\x3d\x69\x6e\x64\x65\x78\x2c\x69\x6e\x64\x65\x78\x20\x2b\x20\x63\x6f\x64\x65\x6f\x66\x5f\x73\x69\x7a\x65\x20\x2d\x31\x20\x64\x6f\xa\x20\x20\x20\x20\x9\x62\x75\x66\x66\x65\x72\x20\x3d\x20\x62\x75\x66\x66\x65\x72\x2e\x2e\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x63\x68\x61\x72\x28\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x69\x29\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\x20\x62\x75\x66\x66\x65\x72\x20\x3d\x3d\x20\x43\x4f\x44\x45\x4f\x46\x5f\x54\x45\x58\x54\xa\xa\x65\x6e\x64\xa\xa\xa\x2d\x2d\x2d\x40\x72\x65\x74\x75\x72\x6e\x20\x73\x74\x72\x69\x6e\x67\x20\x7c\x6e\x69\x6c\xa\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x43\x72\x65\x61\x74\x65\x5f\x72\x65\x61\x64\x6d\x65\x28\x29\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x6f\x6e\x74\x65\x6e\x74\x20\x3d\x20\x64\x74\x77\x2e\x6c\x6f\x61\x64\x5f\x66\x69\x6c\x65\x28\x22\x62\x75\x69\x6c\x64\x2f\x49\x4e\x54\x45\x52\x4e\x41\x4c\x2e\x6d\x64\x22\x29\xa\x20\x20\x20\x20\x69\x66\x20\x63\x6f\x6e\x74\x65\x6e\x74\x20\x3d\x3d\x20\x6e\x69\x6c\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x22\x69\x6e\x74\x65\x6e\x61\x6c\x20\x72\x65\x61\x64\x6d\x65\x20\x6e\x6f\x74\x20\x66\x6f\x75\x6e\x64\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x9\x63\x6c\x69\x62\x2e\x65\x78\x69\x74\x28\x31\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x69\x20\x3d\x20\x31\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x73\x69\x7a\x65\x20\x3d\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x73\x74\x72\x5f\x73\x69\x7a\x65\x28\x63\x6f\x6e\x74\x65\x6e\x74\x29\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x6f\x64\x65\x6f\x66\x5f\x73\x69\x7a\x65\x20\x3d\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x73\x74\x72\x5f\x73\x69\x7a\x65\x28\x43\x4f\x44\x45\x4f\x46\x5f\x54\x45\x58\x54\x29\xa\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x6f\x6c\x65\x63\x74\x69\x6e\x67\x20\x3d\x20\x66\x61\x6c\x73\x65\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\x20\x3d\x20\x22\x22\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x70\x61\x74\x68\x20\x3d\x20\x22\x22\xa\x20\x20\x20\x20\x77\x68\x69\x6c\x65\x20\x69\x20\x3c\x20\x73\x69\x7a\x65\x20\x64\x6f\xa\xa\x20\x20\x20\x20\x20\x20\x20\x20\x69\x66\x20\x69\x73\x5f\x63\x6f\x64\x65\x6f\x66\x5f\x61\x74\x5f\x70\x6f\x69\x6e\x74\x28\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x69\x29\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6f\x6c\x65\x63\x74\x69\x6e\x67\x20\x3d\x20\x74\x72\x75\x65\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x69\x20\x3d\x20\x69\x20\x2b\x20\x63\x6f\x64\x65\x6f\x66\x5f\x73\x69\x7a\x65\x2b\x31\xa\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x69\x73\x5f\x65\x6e\x64\x5f\x63\x68\x61\x72\x20\x3d\x20\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x63\x68\x61\x72\x28\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x69\x29\x20\x3d\x3d\x20\x22\x5c\x6e\x22\xa\xa\x20\x20\x20\x20\x20\x20\x20\x20\x69\x66\x20\x63\x6f\x6c\x65\x63\x74\x69\x6e\x67\x20\x61\x6e\x64\x20\x6e\x6f\x74\x20\x20\x69\x73\x5f\x65\x6e\x64\x5f\x63\x68\x61\x72\x20\x20\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x70\x61\x74\x68\x20\x3d\x20\x70\x61\x74\x68\x2e\x2e\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x63\x68\x61\x72\x28\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x69\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x20\x20\x20\x20\x69\x66\x20\x63\x6f\x6c\x65\x63\x74\x69\x6e\x67\x20\x3d\x3d\x66\x61\x6c\x73\x65\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x9\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\x20\x3d\x20\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\x2e\x2e\x63\x6c\x69\x62\x2e\x67\x65\x74\x5f\x63\x68\x61\x72\x28\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x69\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x20\x20\x20\x20\x69\x66\x20\x63\x6f\x6c\x65\x63\x74\x69\x6e\x67\x20\x61\x6e\x64\x20\x69\x73\x5f\x65\x6e\x64\x5f\x63\x68\x61\x72\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x70\x61\x74\x68\x20\x3d\x20\x63\x6c\x69\x62\x2e\x74\x72\x69\x6d\x28\x70\x61\x74\x68\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x9\x6c\x6f\x63\x61\x6c\x20\x66\x69\x6c\x65\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x20\x3d\x20\x64\x74\x77\x2e\x6c\x6f\x61\x64\x5f\x66\x69\x6c\x65\x28\x70\x61\x74\x68\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x9\x69\x66\x20\x66\x69\x6c\x65\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x20\x3d\x3d\x20\x6e\x69\x6c\x20\x74\x68\x65\x6e\xa\xa\x20\x20\x20\x20\x20\x20\x20\x20\x9\x9\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x52\x45\x44\x2e\x2e\x22\x66\x69\x6c\x65\x20\x28\x22\x2e\x2e\x70\x61\x74\x68\x2e\x2e\x22\x29\x20\x6e\x6f\x74\x20\x66\x6f\x75\x6e\x64\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x9\x9\x63\x6c\x69\x62\x2e\x65\x78\x69\x74\x28\x31\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x9\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x65\x78\x74\x65\x6e\x73\x69\x6f\x6e\x20\x3d\x20\x64\x74\x77\x2e\x6e\x65\x77\x50\x61\x74\x68\x28\x70\x61\x74\x68\x29\x2e\x67\x65\x74\x5f\x65\x78\x74\x65\x6e\x73\x69\x6f\x6e\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\x20\x3d\x20\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\x2e\x2e\x22\x5c\x6e\x7e\x7e\x7e\x22\x2e\x2e\x65\x78\x74\x65\x6e\x73\x69\x6f\x6e\x2e\x2e\x22\x5c\x6e\x22\x2e\x2e\x66\x69\x6c\x65\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x2e\x2e\x22\x5c\x6e\x7e\x7e\x7e\x5c\x6e\x22\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6f\x6c\x65\x63\x74\x69\x6e\x67\x20\x3d\x20\x66\x61\x6c\x73\x65\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x70\x61\x74\x68\x20\x3d\x22\x22\xa\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\xa\xa\xa\xa\x20\x20\x20\x20\x9\x69\x20\x3d\x20\x69\x20\x2b\x20\x31\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\x20\x66\x69\x6e\x61\x6c\x5f\x74\x65\x78\x74\xa\xa\x65\x6e\x64\xa\xa\x49\x4d\x50\x52\x45\x44\x49\x54\x49\x42\x4c\x45\x20\x3d\x20\x31\xa\x50\x52\x45\x44\x49\x43\x54\x49\x42\x4c\x45\x20\x3d\x20\x32\xa\xa\x2d\x2d\x2d\x40\x63\x6c\x61\x73\x73\x20\x54\x65\x73\x74\x41\x72\x74\x69\x66\x61\x63\x74\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x74\x65\x73\x74\x5f\x74\x79\x70\x65\x20\x6e\x75\x6d\x62\x65\x72\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x74\x65\x73\x74\x5f\x64\x69\x72\x20\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x69\x6c\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x65\x78\x70\x65\x63\x74\x65\x64\x5f\x66\x69\x6c\x65\x5f\x70\x61\x74\x68\x20\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x69\x6c\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x65\x78\x65\x63\x75\x74\x61\x62\x6c\x65\x5f\x70\x61\x74\x68\x20\x73\x74\x72\x69\x6e\x67\x20\x7c\x6e\x69\x6c\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x63\x5f\x70\x61\x74\x68\x20\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x69\x6c\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x66\x6f\x6c\x64\x65\x72\x5f\x70\x61\x74\x68\x20\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x69\x6c\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x63\x5f\x73\x68\x61\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x65\x78\x65\x63\x75\x74\x61\x62\x6c\x65\x5f\x73\x68\x61\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x66\x69\x65\x6c\x64\x20\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x20\x73\x74\x72\x69\x6e\x67\x20\x7c\x20\x6e\x69\x6c\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x63\x6f\x6e\x74\x65\x6e\x74\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x72\x65\x74\x75\x72\x6e\x20\x54\x65\x73\x74\x41\x72\x74\x69\x66\x61\x63\x74\x20\x7c\x20\x6e\x69\x6c\xa\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x47\x65\x74\x5f\x74\x65\x73\x74\x5f\x73\x70\x65\x63\x28\x63\x6f\x6e\x74\x65\x6e\x74\x29\xa\xa\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x70\x61\x74\x68\x20\x3d\x20\x64\x74\x77\x2e\x6e\x65\x77\x50\x61\x74\x68\x28\x63\x6f\x6e\x74\x65\x6e\x74\x29\xa\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x66\x69\x6c\x65\x6e\x61\x6d\x65\x20\x3d\x20\x70\x61\x74\x68\x2e\x67\x65\x74\x5f\x6e\x61\x6d\x65\x28\x29\xa\x20\x20\x20\x20\x20\x69\x66\x20\x66\x69\x6c\x65\x6e\x61\x6d\x65\x20\x7e\x3d\x20\x54\x45\x53\x54\x5f\x46\x49\x4c\x45\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\x20\x6e\x69\x6c\xa\x20\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x74\x65\x73\x74\x20\x3d\x20\x7b\x7d\xa\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x64\x69\x72\x73\x2c\x73\x69\x7a\x65\x20\x3d\x20\x70\x61\x74\x68\x2e\x75\x6e\x70\x61\x63\x6b\x28\x29\xa\x20\x20\x20\x20\x20\x66\x6f\x72\x20\x69\x3d\x31\x2c\x73\x69\x7a\x65\x20\x64\x6f\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x75\x72\x72\x65\x6e\x74\x5f\x64\x69\x72\x20\x3d\x20\x64\x69\x72\x73\x5b\x69\x5d\xa\x20\x20\x20\x20\x20\x20\x20\x20\x69\x66\x20\x64\x74\x77\x2e\x73\x74\x61\x72\x74\x73\x5f\x77\x69\x74\x68\x28\x63\x75\x72\x72\x65\x6e\x74\x5f\x64\x69\x72\x2c\x54\x45\x53\x54\x5f\x49\x4e\x50\x52\x45\x44\x49\x43\x54\x42\x49\x4c\x45\x5f\x53\x54\x41\x52\x54\x29\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x9\x74\x65\x73\x74\x2e\x74\x65\x73\x74\x5f\x74\x79\x70\x65\x20\x3d\x20\x49\x4d\x50\x52\x45\x44\x49\x54\x49\x42\x4c\x45\xa\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x20\x20\x20\x20\x69\x66\x20\x64\x74\x77\x2e\x73\x74\x61\x72\x74\x73\x5f\x77\x69\x74\x68\x28\x63\x75\x72\x72\x65\x6e\x74\x5f\x64\x69\x72\x2c\x54\x45\x53\x54\x5f\x50\x52\x45\x44\x49\x43\x49\x42\x4c\x45\x5f\x53\x54\x41\x52\x54\x29\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x9\x74\x65\x73\x74\x2e\x74\x65\x73\x74\x5f\x74\x79\x70\x65\x20\x3d\x20\x50\x52\x45\x44\x49\x43\x54\x49\x42\x4c\x45\xa\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x20\x69\x66\x20\x74\x65\x73\x74\x2e\x74\x65\x73\x74\x5f\x74\x79\x70\x65\x20\x3d\x3d\x20\x6e\x69\x6c\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x9\x72\x65\x74\x75\x72\x6e\x20\x6e\x69\x6c\xa\x20\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x20\x74\x65\x73\x74\x2e\x74\x65\x73\x74\x5f\x64\x69\x72\x20\x3d\x20\x70\x61\x74\x68\x2e\x67\x65\x74\x5f\x64\x69\x72\x28\x29\xa\x20\x20\x20\x20\x20\x74\x65\x73\x74\x2e\x65\x78\x70\x65\x63\x74\x65\x64\x5f\x66\x69\x6c\x65\x5f\x70\x61\x74\x68\x20\x3d\x20\x64\x74\x77\x2e\x63\x6f\x6e\x63\x61\x74\x5f\x70\x61\x74\x68\x28\x74\x65\x73\x74\x2e\x74\x65\x73\x74\x5f\x64\x69\x72\x2c\x45\x58\x50\x45\x43\x54\x45\x44\x5f\x4e\x41\x4d\x45\x29\xa\x20\x20\x20\x20\x20\x74\x65\x73\x74\x2e\x65\x78\x65\x63\x75\x74\x61\x62\x6c\x65\x5f\x70\x61\x74\x68\x20\x3d\x20\x64\x74\x77\x2e\x63\x6f\x6e\x63\x61\x74\x5f\x70\x61\x74\x68\x28\x74\x65\x73\x74\x2e\x74\x65\x73\x74\x5f\x64\x69\x72\x2c\x22\x65\x78\x65\x63\x2e\x22\x2e\x2e\x63\x6c\x69\x62\x2e\x6f\x75\x74\x5f\x65\x78\x74\x65\x6e\x73\x69\x6f\x6e\x28\x29\x29\xa\x20\x20\x20\x20\x20\x74\x65\x73\x74\x2e\x63\x5f\x70\x61\x74\x68\x20\x3d\x20\x70\x61\x74\x68\x2e\x67\x65\x74\x5f\x66\x75\x6c\x6c\x5f\x70\x61\x74\x68\x28\x29\xa\x20\x20\x20\x20\x20\x74\x65\x73\x74\x2e\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x66\x6f\x6c\x64\x65\x72\x5f\x70\x61\x74\x68\x20\x3d\x20\x64\x74\x77\x2e\x63\x6f\x6e\x63\x61\x74\x5f\x70\x61\x74\x68\x28\x74\x65\x73\x74\x2e\x74\x65\x73\x74\x5f\x64\x69\x72\x2c\x53\x49\x44\x45\x5f\x45\x46\x46\x45\x43\x54\x5f\x43\x4f\x4d\x50\x41\x52\x41\x54\x49\x4f\x4e\x29\xa\x20\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\x20\x74\x65\x73\x74\xa\x65\x6e\x64\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x63\x61\x63\x68\x65\x20\x43\x61\x63\x68\x65\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x72\x63\x5f\x73\x68\x61\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x61\x72\x74\x69\x66\x61\x63\x74\x20\x54\x65\x73\x74\x41\x72\x74\x69\x66\x61\x63\x74\xa\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x45\x78\x65\x63\x75\x74\x65\x5f\x63\x6f\x6d\x70\x69\x6c\x61\x74\x69\x6f\x6e\x28\x63\x61\x63\x68\x65\x2c\x73\x72\x63\x5f\x73\x68\x61\x2c\x61\x72\x74\x69\x66\x61\x63\x74\x29\xa\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x6f\x6d\x70\x69\x6c\x65\x64\x20\x3d\x20\x66\x61\x6c\x73\x65\xa\x20\x20\x20\x20\x63\x61\x63\x68\x65\x2e\x6e\x65\x77\x5f\x65\x6c\x65\x6d\x65\x6e\x74\x28\x22\x63\x6f\x6d\x70\x69\x6c\x61\x74\x69\x6f\x6e\x22\x2c\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6f\x6d\x70\x69\x6c\x65\x64\x20\x3d\x20\x74\x72\x75\x65\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x6f\x6d\x61\x6e\x64\x20\x3d\x20\x22\x67\x63\x63\x20\x22\x2e\x2e\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x63\x5f\x70\x61\x74\x68\x2e\x2e\x22\x20\x2d\x44\x44\x54\x57\x5f\x44\x45\x42\x55\x47\x5f\x54\x49\x4d\x45\x20\x2d\x6f\x20\x22\x2e\x2e\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x65\x78\x65\x63\x75\x74\x61\x62\x6c\x65\x5f\x70\x61\x74\x68\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x72\x65\x73\x75\x6c\x74\x20\x3d\x20\x63\x6c\x69\x62\x2e\x73\x79\x73\x74\x65\x6d\x5f\x77\x69\x74\x68\x5f\x73\x74\x61\x74\x75\x73\x28\x63\x6f\x6d\x61\x6e\x64\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x69\x66\x20\x72\x65\x73\x75\x6c\x74\x20\x7e\x3d\x30\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x9\x63\x6c\x69\x62\x2e\x65\x78\x69\x74\x28\x31\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x47\x52\x45\x45\x4e\x2e\x2e\x22\x5c\x74\x63\x6f\x6d\x70\x69\x6c\x61\x74\x69\x6f\x6e\x3a\x70\x61\x73\x73\x65\x64\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x65\x6e\x64\x29\x2e\xa\x20\x20\x20\x20\x61\x64\x64\x5f\x64\x65\x70\x65\x6e\x64\x65\x6e\x63\x69\x65\x28\x73\x72\x63\x5f\x73\x68\x61\x29\x2e\xa\x20\x20\x20\x20\x61\x64\x64\x5f\x64\x65\x70\x65\x6e\x64\x65\x6e\x63\x69\x65\x28\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x63\x5f\x73\x68\x61\x29\x2e\xa\x20\x20\x20\x20\x70\x65\x72\x66\x6f\x72\x6d\x28\x29\xa\xa\x20\x20\x20\x20\x69\x66\x20\x63\x6f\x6d\x70\x69\x6c\x65\x64\x20\x3d\x3d\x20\x66\x61\x6c\x73\x65\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x59\x45\x4c\x4c\x4f\x57\x2e\x2e\x22\x5c\x74\x63\x6f\x6d\x70\x69\x6c\x61\x74\x69\x6f\x6e\x3a\x63\x61\x63\x68\x65\x64\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x65\x6e\x64\xa\xa\xa\xa\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x52\x65\x62\x61\x73\x65\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x28\x29\xa\x9\x20\x20\x20\x20\x20\x20\x20\x20\x64\x74\x77\x2e\x63\x6f\x70\x79\x5f\x61\x6e\x79\x5f\x6f\x76\x65\x72\x77\x72\x69\x74\x69\x6e\x67\x28\x53\x49\x44\x45\x5f\x45\x46\x46\x45\x43\x54\x5f\x43\x4f\x50\x59\x2c\x53\x49\x44\x45\x5f\x45\x46\x46\x45\x43\x54\x29\xa\xa\x65\x6e\x64\xa\xa\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x63\x61\x63\x68\x65\x20\x43\x61\x63\x68\x65\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x72\x63\x5f\x73\x68\x61\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x6f\x72\x69\x67\x69\x6e\x61\x6c\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x61\x72\x74\x69\x66\x61\x63\x74\x20\x54\x65\x73\x74\x41\x72\x74\x69\x66\x61\x63\x74\xa\x6c\x6f\x63\x61\x6c\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x65\x78\x65\x63\x75\x74\x65\x5f\x74\x65\x73\x74\x5f\x61\x72\x74\x69\x66\x61\x63\x74\x28\x63\x61\x63\x68\x65\x2c\x73\x72\x63\x5f\x73\x68\x61\x2c\x6f\x72\x69\x67\x69\x6e\x61\x6c\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x2c\x61\x72\x74\x69\x66\x61\x63\x74\x29\xa\xa\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x42\x4c\x55\x45\x2e\x2e\x22\x74\x65\x73\x74\x69\x6e\x67\x3a\x20\x22\x2e\x2e\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x63\x5f\x70\x61\x74\x68\x2e\x2e\x22\x5c\x6e\x22\x29\xa\xa\x20\x20\x20\x20\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x63\x5f\x73\x68\x61\x20\x3d\x20\x64\x74\x77\x2e\x67\x65\x6e\x65\x72\x61\x74\x65\x5f\x73\x68\x61\x5f\x66\x72\x6f\x6d\x5f\x66\x69\x6c\x65\x28\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x63\x5f\x70\x61\x74\x68\x29\xa\xa\x20\x20\x20\x20\x45\x78\x65\x63\x75\x74\x65\x5f\x63\x6f\x6d\x70\x69\x6c\x61\x74\x69\x6f\x6e\x28\x63\x61\x63\x68\x65\x2c\x73\x72\x63\x5f\x73\x68\x61\x2c\x61\x72\x74\x69\x66\x61\x63\x74\x29\xa\x20\x20\x20\x20\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x65\x78\x65\x63\x75\x74\x61\x62\x6c\x65\x5f\x73\x68\x61\x20\x3d\x20\x64\x74\x77\x2e\x67\x65\x6e\x65\x72\x61\x74\x65\x5f\x73\x68\x61\x5f\x66\x72\x6f\x6d\x5f\x66\x69\x6c\x65\x28\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x65\x78\x65\x63\x75\x74\x61\x62\x6c\x65\x5f\x70\x61\x74\x68\x29\xa\xa\xa\x20\x20\x20\x20\x45\x78\x65\x63\x5f\x76\x61\x6c\x67\x72\x69\x6e\x64\x5f\x74\x65\x73\x74\x28\x63\x61\x63\x68\x65\x2c\x6f\x72\x69\x67\x69\x6e\x61\x6c\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x2c\x61\x72\x74\x69\x66\x61\x63\x74\x29\xa\xa\x20\x20\x20\x20\x54\x65\x73\x74\x5f\x6f\x75\x74\x5f\x70\x75\x74\x28\x63\x61\x63\x68\x65\x2c\x6f\x72\x69\x67\x69\x6e\x61\x6c\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x2c\x61\x72\x74\x69\x66\x61\x63\x74\x29\xa\xa\xa\x65\x6e\x64\xa\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x63\x61\x63\x68\x65\x20\x43\x61\x63\x68\x65\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x73\x72\x63\x5f\x73\x68\x61\x20\x73\x74\x72\x69\x6e\x67\xa\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x45\x78\x65\x63\x75\x74\x65\x5f\x66\x75\x6c\x6c\x5f\x74\x65\x73\x74\x28\x63\x61\x63\x68\x65\x2c\x73\x72\x63\x5f\x73\x68\x61\x29\xa\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x6f\x72\x69\x67\x69\x6e\x61\x6c\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x20\x3d\x20\x20\x47\x65\x6e\x65\x72\x61\x74\x65\x5f\x73\x68\x61\x5f\x66\x72\x6f\x6d\x5f\x66\x6f\x6c\x64\x65\x72\x5f\x6e\x6f\x74\x5f\x63\x6f\x6e\x73\x69\x64\x65\x72\x69\x6e\x67\x5f\x65\x6d\x70\x74\x79\x5f\x66\x6f\x6c\x64\x65\x72\x73\x28\x53\x49\x44\x45\x5f\x45\x46\x46\x45\x43\x54\x29\xa\x20\x20\x20\x20\x64\x74\x77\x2e\x63\x6f\x70\x79\x5f\x61\x6e\x79\x5f\x6f\x76\x65\x72\x77\x72\x69\x74\x69\x6e\x67\x28\x53\x49\x44\x45\x5f\x45\x46\x46\x45\x43\x54\x2c\x53\x49\x44\x45\x5f\x45\x46\x46\x45\x43\x54\x5f\x43\x4f\x50\x59\x29\xa\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x6c\x69\x73\x74\x61\x67\x65\x2c\x73\x69\x7a\x65\x20\x3d\x64\x74\x77\x2e\x6c\x69\x73\x74\x5f\x66\x69\x6c\x65\x73\x5f\x72\x65\x63\x75\x72\x73\x69\x76\x65\x6c\x79\x28\x54\x45\x53\x54\x5f\x50\x4f\x49\x4e\x54\x2c\x74\x72\x75\x65\x29\xa\xa\x20\x20\x20\x20\x66\x6f\x72\x20\x69\x3d\x31\x2c\x73\x69\x7a\x65\x20\x64\x6f\xa\x20\x20\x20\x20\x9\x6c\x6f\x63\x61\x6c\x20\x70\x6f\x73\x73\x69\x62\x6c\x65\x5f\x74\x65\x73\x74\x20\x3d\x20\x6c\x69\x73\x74\x61\x67\x65\x5b\x69\x5d\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x74\x65\x73\x74\x20\x3d\x20\x47\x65\x74\x5f\x74\x65\x73\x74\x5f\x73\x70\x65\x63\x28\x70\x6f\x73\x73\x69\x62\x6c\x65\x5f\x74\x65\x73\x74\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x69\x66\x20\x74\x65\x73\x74\x20\x7e\x3d\x20\x6e\x69\x6c\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x65\x78\x65\x63\x75\x74\x65\x5f\x74\x65\x73\x74\x5f\x61\x72\x74\x69\x66\x61\x63\x74\x28\x63\x61\x63\x68\x65\x2c\x73\x72\x63\x5f\x73\x68\x61\x2c\x6f\x72\x69\x67\x69\x6e\x61\x6c\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x2c\x74\x65\x73\x74\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x65\x6e\x64\xa\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x65\x78\x70\x65\x63\x74\x65\x64\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x61\x72\x74\x69\x66\x61\x63\x74\x20\x54\x65\x73\x74\x41\x72\x74\x69\x66\x61\x63\x74\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x6f\x75\x74\x70\x75\x74\x5f\x74\x65\x73\x74\x20\x73\x74\x72\x69\x6e\x67\xa\x6c\x6f\x63\x61\x6c\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x68\x61\x6e\x64\x6c\x65\x5f\x65\x78\x70\x65\x63\x74\x65\x64\x5f\x66\x69\x6c\x65\x28\x65\x78\x70\x65\x63\x74\x65\x64\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x61\x72\x74\x69\x66\x61\x63\x74\x2c\x6f\x75\x74\x70\x75\x74\x5f\x74\x65\x73\x74\x29\xa\xa\xa\x20\x20\x20\x20\x20\x20\x69\x66\x20\x65\x78\x70\x65\x63\x74\x65\x64\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x20\x3d\x3d\x20\x6e\x69\x6c\x20\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x64\x74\x77\x2e\x77\x72\x69\x74\x65\x5f\x66\x69\x6c\x65\x28\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x65\x78\x70\x65\x63\x74\x65\x64\x5f\x66\x69\x6c\x65\x5f\x70\x61\x74\x68\x2c\x6f\x75\x74\x70\x75\x74\x5f\x74\x65\x73\x74\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x43\x59\x41\x4e\x2e\x2e\x22\x5c\x74\x65\x78\x70\x65\x63\x74\x65\x64\x20\x66\x69\x6c\x65\x3a\x63\x72\x65\x61\x74\x65\x64\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x20\x20\x69\x66\x20\x6f\x75\x74\x70\x75\x74\x5f\x74\x65\x73\x74\x20\x3d\x3d\x20\x65\x78\x70\x65\x63\x74\x65\x64\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x47\x52\x45\x45\x4e\x2e\x2e\x22\x5c\x74\x65\x78\x70\x65\x63\x74\x65\x64\x20\x66\x69\x6c\x65\x3a\x20\x70\x61\x73\x73\x65\x64\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x20\x20\x69\x66\x20\x52\x45\x43\x4f\x4e\x53\x54\x52\x55\x43\x54\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x64\x74\x77\x2e\x77\x72\x69\x74\x65\x5f\x66\x69\x6c\x65\x28\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x65\x78\x70\x65\x63\x74\x65\x64\x5f\x66\x69\x6c\x65\x5f\x70\x61\x74\x68\x2c\x6f\x75\x74\x70\x75\x74\x5f\x74\x65\x73\x74\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x4d\x41\x47\x45\x4e\x54\x41\x2e\x2e\x22\x5c\x74\x65\x78\x70\x65\x63\x74\x65\x64\x20\x66\x69\x6c\x65\x3a\x72\x65\x63\x6f\x6e\x73\x74\x72\x75\x63\x74\x65\x64\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x20\x20\x69\x66\x20\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x74\x65\x73\x74\x5f\x74\x79\x70\x65\x20\x3d\x3d\x20\x50\x52\x45\x44\x49\x43\x54\x49\x42\x4c\x45\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x9\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x52\x45\x44\x2e\x2e\x22\x5c\x74\x65\x78\x70\x65\x63\x74\x65\x64\x20\x66\x69\x6c\x65\x3a\x20\x64\x69\x66\x66\x65\x72\x65\x6e\x74\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x52\x65\x62\x61\x73\x65\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x65\x78\x69\x74\x28\x31\x29\xa\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x20\x20\x69\x66\x20\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x74\x65\x73\x74\x5f\x74\x79\x70\x65\x3d\x3d\x20\x49\x4d\x50\x52\x45\x44\x49\x54\x49\x42\x4c\x45\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x9\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x59\x45\x4c\x4c\x4f\x57\x2e\x2e\x22\x5c\x74\x65\x78\x70\x65\x63\x74\x65\x64\x20\x66\x69\x6c\x65\x3a\x20\x69\x6d\x70\x72\x65\x64\x69\x63\x74\x69\x62\x6c\x65\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\xa\xa\xa\x65\x6e\x64\xa\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x6f\x72\x69\x67\x69\x6e\x61\x6c\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x61\x72\x74\x69\x66\x61\x63\x74\x20\x54\x65\x73\x74\x41\x72\x74\x69\x66\x61\x63\x74\xa\x6c\x6f\x63\x61\x6c\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x68\x61\x6e\x64\x6c\x65\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x66\x6f\x6c\x64\x65\x72\x28\x6f\x72\x69\x67\x69\x6e\x61\x6c\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x2c\x61\x72\x74\x69\x66\x61\x63\x74\x29\xa\xa\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x75\x72\x72\x65\x6e\x74\x5f\x73\x69\x64\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x20\x3d\x47\x65\x6e\x65\x72\x61\x74\x65\x5f\x73\x68\x61\x5f\x66\x72\x6f\x6d\x5f\x66\x6f\x6c\x64\x65\x72\x5f\x6e\x6f\x74\x5f\x63\x6f\x6e\x73\x69\x64\x65\x72\x69\x6e\x67\x5f\x65\x6d\x70\x74\x79\x5f\x66\x6f\x6c\x64\x65\x72\x73\x28\x53\x49\x44\x45\x5f\x45\x46\x46\x45\x43\x54\x29\xa\xa\x20\x20\x20\x20\x20\x20\x69\x66\x20\x63\x75\x72\x72\x65\x6e\x74\x5f\x73\x69\x64\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x20\x3d\x3d\x20\x6f\x72\x69\x67\x69\x6e\x61\x6c\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x59\x45\x4c\x4c\x4f\x57\x2e\x2e\x22\x5c\x74\x73\x69\x64\x65\x20\x65\x66\x66\x65\x63\x74\x20\x66\x6f\x6c\x64\x65\x72\x3a\x20\x6e\x6f\x20\x63\x68\x61\x6e\x67\x65\x73\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\xa\xa\xa\x20\x20\x20\x20\x20\x20\x69\x66\x20\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x20\x3d\x3d\x20\x6e\x69\x6c\x20\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x64\x74\x77\x2e\x6d\x6f\x76\x65\x5f\x61\x6e\x79\x5f\x6f\x76\x65\x72\x77\x72\x69\x74\x69\x6e\x67\x28\x53\x49\x44\x45\x5f\x45\x46\x46\x45\x43\x54\x2c\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x66\x6f\x6c\x64\x65\x72\x5f\x70\x61\x74\x68\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x43\x59\x41\x4e\x2e\x2e\x22\x5c\x74\x73\x69\x64\x65\x20\x65\x66\x66\x65\x63\x74\x20\x66\x6f\x6c\x64\x65\x72\x3a\x20\x63\x72\x65\x61\x74\x65\x64\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x20\x20\x69\x66\x20\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x74\x65\x73\x74\x5f\x74\x79\x70\x65\x20\x3d\x3d\x20\x49\x4d\x50\x52\x45\x44\x49\x54\x49\x42\x4c\x45\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x9\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x59\x45\x4c\x4c\x4f\x57\x2e\x2e\x22\x5c\x74\x73\x69\x64\x65\x20\x65\x66\x66\x65\x63\x74\x20\x66\x6f\x6c\x64\x65\x72\x3a\x20\x69\x6d\x70\x72\x65\x64\x69\x63\x74\x69\x62\x6c\x65\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x20\x20\x69\x66\x20\x52\x45\x43\x4f\x4e\x53\x54\x52\x55\x43\x54\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x64\x74\x77\x2e\x6d\x6f\x76\x65\x5f\x61\x6e\x79\x5f\x6f\x76\x65\x72\x77\x72\x69\x74\x69\x6e\x67\x28\x53\x49\x44\x45\x5f\x45\x46\x46\x45\x43\x54\x2c\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x66\x6f\x6c\x64\x65\x72\x5f\x70\x61\x74\x68\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x4d\x41\x47\x45\x4e\x54\x41\x2e\x2e\x22\x5c\x74\x73\x69\x64\x65\x20\x65\x66\x66\x65\x63\x74\x20\x66\x6f\x6c\x64\x65\x72\x3a\x20\x72\x65\x63\x72\x65\x61\x74\x65\x64\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x20\x20\x69\x66\x20\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x20\x7e\x3d\x63\x75\x72\x72\x65\x6e\x74\x5f\x73\x69\x64\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x52\x45\x44\x2e\x2e\x22\x5c\x74\x73\x69\x64\x65\x20\x65\x66\x66\x65\x63\x74\x20\x66\x6f\x6c\x64\x65\x72\x3a\x20\x64\x69\x66\x66\x65\x65\x6e\x74\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x52\x65\x62\x61\x73\x65\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x65\x78\x69\x74\x28\x31\x29\xa\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x47\x52\x45\x45\x4e\x2e\x2e\x22\x5c\x74\x73\x69\x64\x65\x20\x65\x66\x66\x65\x63\x74\x20\x66\x6f\x6c\x64\x65\x72\x3a\x20\x70\x61\x73\x73\x65\x64\x5c\x6e\x22\x29\xa\x65\x6e\x64\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x63\x61\x63\x68\x65\x20\x43\x61\x63\x68\x65\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x6f\x72\x69\x67\x69\x6e\x61\x6c\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x61\x72\x74\x69\x66\x61\x63\x74\x20\x54\x65\x73\x74\x41\x72\x74\x69\x66\x61\x63\x74\xa\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x54\x65\x73\x74\x5f\x6f\x75\x74\x5f\x70\x75\x74\x28\x63\x61\x63\x68\x65\x2c\x6f\x72\x69\x67\x69\x6e\x61\x6c\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x2c\x61\x72\x74\x69\x66\x61\x63\x74\x29\xa\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x6f\x75\x74\x70\x75\x74\x5f\x74\x65\x73\x74\x65\x64\x20\x3d\x20\x66\x61\x6c\x73\x65\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x65\x78\x70\x65\x63\x74\x65\x64\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x20\x3d\x20\x64\x74\x77\x2e\x6c\x6f\x61\x64\x5f\x66\x69\x6c\x65\x28\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x65\x78\x70\x65\x63\x74\x65\x64\x5f\x66\x69\x6c\x65\x5f\x70\x61\x74\x68\x29\xa\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x6f\x75\x74\x5f\x63\x61\x63\x68\x65\x20\x3d\x20\x63\x61\x63\x68\x65\x2e\x6e\x65\x77\x5f\x65\x6c\x65\x6d\x65\x6e\x74\x28\x22\x6f\x75\x74\x70\x75\x74\x22\x2c\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x28\x29\xa\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x6f\x75\x74\x70\x75\x74\x5f\x74\x65\x73\x74\x65\x64\x20\x3d\x20\x74\x72\x75\x65\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x6f\x75\x74\x70\x75\x74\x5f\x74\x65\x73\x74\x20\x3d\x20\x63\x6c\x69\x62\x2e\x73\x79\x73\x74\x65\x6d\x5f\x77\x69\x74\x68\x5f\x73\x74\x72\x69\x6e\x67\x28\x22\x2e\x2f\x22\x2e\x2e\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x65\x78\x65\x63\x75\x74\x61\x62\x6c\x65\x5f\x70\x61\x74\x68\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x68\x61\x6e\x64\x6c\x65\x5f\x65\x78\x70\x65\x63\x74\x65\x64\x5f\x66\x69\x6c\x65\x28\x65\x78\x70\x65\x63\x74\x65\x64\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x2c\x61\x72\x74\x69\x66\x61\x63\x74\x2c\x6f\x75\x74\x70\x75\x74\x5f\x74\x65\x73\x74\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x68\x61\x6e\x64\x6c\x65\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x66\x6f\x6c\x64\x65\x72\x28\x6f\x72\x69\x67\x69\x6e\x61\x6c\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x2c\x61\x72\x74\x69\x66\x61\x63\x74\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x52\x65\x62\x61\x73\x65\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x28\x29\xa\xa\x20\x20\x20\x20\x65\x6e\x64\x29\x2e\xa\x20\x20\x20\x20\x61\x64\x64\x5f\x64\x65\x70\x65\x6e\x64\x65\x6e\x63\x69\x65\x28\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x65\x78\x65\x63\x75\x74\x61\x62\x6c\x65\x5f\x73\x68\x61\x29\x2e\xa\x20\x20\x20\x20\x61\x64\x64\x5f\x64\x65\x70\x65\x6e\x64\x65\x6e\x63\x69\x65\x28\x6f\x72\x69\x67\x69\x6e\x61\x6c\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x29\xa\xa\xa\x20\x20\x20\x20\x69\x66\x20\x64\x74\x77\x2e\x69\x73\x64\x69\x72\x28\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x66\x6f\x6c\x64\x65\x72\x5f\x70\x61\x74\x68\x29\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x20\x3d\x20\x47\x65\x6e\x65\x72\x61\x74\x65\x5f\x73\x68\x61\x5f\x66\x72\x6f\x6d\x5f\x66\x6f\x6c\x64\x65\x72\x5f\x6e\x6f\x74\x5f\x63\x6f\x6e\x73\x69\x64\x65\x72\x69\x6e\x67\x5f\x65\x6d\x70\x74\x79\x5f\x66\x6f\x6c\x64\x65\x72\x73\x28\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x66\x6f\x6c\x64\x65\x72\x5f\x70\x61\x74\x68\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6f\x75\x74\x5f\x63\x61\x63\x68\x65\x2e\x61\x64\x64\x5f\x64\x65\x70\x65\x6e\x64\x65\x6e\x63\x69\x65\x28\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x29\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x69\x66\x20\x65\x78\x70\x65\x63\x74\x65\x64\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x20\x7e\x3d\x6e\x69\x6c\x20\x61\x6e\x64\x20\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x74\x65\x73\x74\x5f\x74\x79\x70\x65\x20\x3d\x3d\x20\x50\x52\x45\x44\x49\x43\x54\x49\x42\x4c\x45\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x6f\x75\x74\x5f\x63\x61\x63\x68\x65\x2e\x61\x64\x64\x5f\x64\x65\x70\x65\x6e\x64\x65\x6e\x63\x69\x65\x28\x65\x78\x70\x65\x63\x74\x65\x64\x5f\x63\x6f\x6e\x74\x65\x6e\x74\x29\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\xa\x20\x20\x20\x20\x6f\x75\x74\x5f\x63\x61\x63\x68\x65\x2e\x70\x65\x72\x66\x6f\x72\x6d\x28\x29\xa\xa\xa\x20\x20\x20\x20\x69\x66\x20\x6f\x75\x74\x70\x75\x74\x5f\x74\x65\x73\x74\x65\x64\x20\x3d\x3d\x20\x66\x61\x6c\x73\x65\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x9\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x59\x45\x4c\x4c\x4f\x57\x2e\x2e\x22\x5c\x74\x6f\x75\x74\x70\x75\x74\x20\x74\x65\x73\x74\x3a\x20\x63\x61\x63\x68\x65\x64\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x65\x6e\x64\xa\xa\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x63\x61\x63\x68\x65\x20\x43\x61\x63\x68\x65\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x6f\x72\x69\x67\x69\x6e\x61\x6c\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x20\x73\x74\x72\x69\x6e\x67\xa\x2d\x2d\x2d\x40\x70\x61\x72\x61\x6d\x20\x61\x72\x74\x69\x66\x61\x63\x74\x20\x54\x65\x73\x74\x41\x72\x74\x69\x66\x61\x63\x74\xa\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x45\x78\x65\x63\x5f\x76\x61\x6c\x67\x72\x69\x6e\x64\x5f\x74\x65\x73\x74\x28\x63\x61\x63\x68\x65\x2c\x6f\x72\x69\x67\x69\x6e\x61\x6c\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x2c\x61\x72\x74\x69\x66\x61\x63\x74\x29\xa\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x6d\x65\x6d\x6f\x72\x79\x5f\x74\x65\x73\x74\x65\x64\x20\x3d\x20\x66\x61\x6c\x73\x65\xa\x20\x20\x20\x20\x63\x61\x63\x68\x65\x2e\x6e\x65\x77\x5f\x65\x6c\x65\x6d\x65\x6e\x74\x28\x22\x76\x61\x6c\x67\x72\x69\x6e\x64\x22\x2c\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6d\x65\x6d\x6f\x72\x79\x5f\x74\x65\x73\x74\x65\x64\x20\x3d\x74\x72\x75\x65\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x6f\x6d\x61\x6e\x64\x20\x3d\x20\x22\x76\x61\x6c\x67\x72\x69\x6e\x64\x20\x2d\x2d\x6c\x6f\x67\x2d\x66\x69\x6c\x65\x3d\x27\x22\x2e\x2e\x4f\x55\x54\x50\x55\x54\x5f\x54\x45\x53\x54\x2e\x2e\x22\x27\x20\x2e\x2f\x22\x2e\x2e\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x65\x78\x65\x63\x75\x74\x61\x62\x6c\x65\x5f\x70\x61\x74\x68\xa\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x73\x79\x73\x74\x65\x6d\x5f\x77\x69\x74\x68\x5f\x73\x74\x72\x69\x6e\x67\x28\x63\x6f\x6d\x61\x6e\x64\x29\x3b\xa\x20\x20\x20\x20\x20\x20\x20\x20\x52\x65\x62\x61\x73\x65\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x28\x29\xa\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x72\x65\x73\x75\x6c\x74\x20\x3d\x20\x64\x74\x77\x2e\x6c\x6f\x61\x64\x5f\x66\x69\x6c\x65\x28\x4f\x55\x54\x50\x55\x54\x5f\x54\x45\x53\x54\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x69\x66\x20\x72\x65\x73\x75\x6c\x74\x20\x3d\x3d\x20\x6e\x69\x6c\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x65\x78\x69\x74\x28\x31\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x48\x45\x41\x50\x5f\x43\x48\x45\x43\x4b\x20\x20\x3d\x20\x22\x41\x6c\x6c\x20\x68\x65\x61\x70\x20\x62\x6c\x6f\x63\x6b\x73\x20\x77\x65\x72\x65\x20\x66\x72\x65\x65\x64\x20\x2d\x2d\x20\x6e\x6f\x20\x6c\x65\x61\x6b\x73\x20\x61\x72\x65\x20\x70\x6f\x73\x73\x69\x62\x6c\x65\x22\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x65\x72\x72\x6f\x72\x20\x3d\x66\x61\x6c\x73\x65\xa\x20\x20\x20\x20\x20\x20\x20\x20\x69\x66\x20\x63\x6c\x69\x62\x2e\x69\x6e\x64\x65\x78\x6f\x66\x28\x72\x65\x73\x75\x6c\x74\x2c\x48\x45\x41\x50\x5f\x43\x48\x45\x43\x4b\x29\x20\x3d\x3d\x20\x2d\x31\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x9\x65\x72\x72\x6f\x72\x20\x3d\x20\x74\x72\x75\x65\xa\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x45\x52\x52\x4f\x52\x5f\x43\x48\x45\x43\x4b\x20\x3d\x20\x22\x45\x52\x52\x4f\x52\x20\x53\x55\x4d\x4d\x41\x52\x59\x3a\x20\x30\x20\x65\x72\x72\x6f\x72\x73\x20\x66\x72\x6f\x6d\x20\x30\x20\x63\x6f\x6e\x74\x65\x78\x74\x73\x20\x28\x73\x75\x70\x70\x72\x65\x73\x73\x65\x64\x3a\x20\x30\x20\x66\x72\x6f\x6d\x20\x30\x29\x22\xa\x20\x20\x20\x20\x20\x20\x20\x20\x69\x66\x20\x63\x6c\x69\x62\x2e\x69\x6e\x64\x65\x78\x6f\x66\x28\x72\x65\x73\x75\x6c\x74\x2c\x45\x52\x52\x4f\x52\x5f\x43\x48\x45\x43\x4b\x29\x20\x3d\x3d\x20\x2d\x31\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x65\x72\x72\x6f\x72\x20\x3d\x20\x74\x72\x75\x65\xa\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\xa\x20\x20\x20\x20\x20\x20\x20\x20\x69\x66\x20\x65\x72\x72\x6f\x72\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x52\x45\x44\x2e\x2e\x72\x65\x73\x75\x6c\x74\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x9\x63\x6c\x69\x62\x2e\x65\x78\x69\x74\x28\x31\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x47\x52\x45\x45\x4e\x2e\x2e\x22\x5c\x74\x6d\x65\x6d\x6f\x72\x79\x20\x74\x65\x73\x74\x3a\x70\x61\x73\x73\x65\x64\x5c\x6e\x22\x29\xa\x65\x6e\x64\x29\x2e\xa\x20\x20\x20\x20\x61\x64\x64\x5f\x64\x65\x70\x65\x6e\x64\x65\x6e\x63\x69\x65\x28\x61\x72\x74\x69\x66\x61\x63\x74\x2e\x65\x78\x65\x63\x75\x74\x61\x62\x6c\x65\x5f\x73\x68\x61\x29\x2e\xa\x20\x20\x20\x20\x61\x64\x64\x5f\x64\x65\x70\x65\x6e\x64\x65\x6e\x63\x69\x65\x28\x6f\x72\x69\x67\x69\x6e\x61\x6c\x5f\x73\x69\x64\x65\x5f\x65\x66\x66\x65\x63\x74\x5f\x73\x68\x61\x29\x2e\xa\x20\x20\x20\x20\x70\x65\x72\x66\x6f\x72\x6d\x28\x29\xa\xa\x20\x20\x20\x20\x69\x66\x20\x6d\x65\x6d\x6f\x72\x79\x5f\x74\x65\x73\x74\x65\x64\x20\x3d\x3d\x20\x66\x61\x6c\x73\x65\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x59\x45\x4c\x4c\x4f\x57\x2e\x2e\x22\x5c\x74\x6d\x65\x6d\x6f\x72\x79\x20\x74\x65\x73\x74\x3a\x63\x61\x63\x68\x65\x64\x5c\x6e\x22\x29\xa\x20\x20\x20\x20\x65\x6e\x64\xa\x65\x6e\x64\xa\xa\xa\xa\xa\xa\x6c\x6f\x63\x61\x6c\x20\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x6d\x61\x69\x6e\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x73\x72\x63\x5f\x73\x68\x61\x20\x3d\x20\x47\x65\x6e\x65\x72\x61\x74\x65\x5f\x73\x68\x61\x5f\x66\x72\x6f\x6d\x5f\x66\x6f\x6c\x64\x65\x72\x5f\x6e\x6f\x74\x5f\x63\x6f\x6e\x73\x69\x64\x65\x72\x69\x6e\x67\x5f\x65\x6d\x70\x74\x79\x5f\x66\x6f\x6c\x64\x65\x72\x73\x28\x4c\x49\x42\x5f\x46\x4f\x4c\x44\x45\x52\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x63\x61\x63\x68\x65\x20\x3d\x20\x4e\x65\x77\x43\x61\x63\x68\x65\x28\x43\x41\x43\x48\x45\x5f\x50\x4f\x49\x4e\x54\x29\xa\xa\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x61\x6d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x5f\x63\x61\x63\x68\x65\x20\x3d\x20\x63\x61\x63\x68\x65\x2e\x6e\x65\x77\x5f\x65\x6c\x65\x6d\x65\x6e\x74\x28\x22\x61\x6d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x22\x2c\x66\x75\x6e\x63\x74\x69\x6f\x6e\x20\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x72\x65\x74\x75\x72\x6e\x20\x47\x65\x6e\x65\x72\x61\x74\x65\x5f\x61\x6d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x5f\x72\x65\x63\x75\x72\x73\x69\x76\x65\x28\x53\x54\x41\x52\x54\x5f\x50\x4f\x49\x4e\x54\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\x29\x2e\x61\x64\x64\x5f\x64\x65\x70\x65\x6e\x64\x65\x6e\x63\x69\x65\x28\x73\x72\x63\x5f\x73\x68\x61\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x61\x6d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x5f\x72\x65\x73\x75\x6c\x74\x20\x3d\x20\x47\x65\x6e\x65\x72\x61\x74\x65\x5f\x61\x6d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x5f\x72\x65\x63\x75\x72\x73\x69\x76\x65\x28\x53\x54\x41\x52\x54\x5f\x50\x4f\x49\x4e\x54\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x64\x74\x77\x2e\x77\x72\x69\x74\x65\x5f\x66\x69\x6c\x65\x28\x45\x4e\x44\x5f\x54\x45\x53\x54\x5f\x50\x4f\x49\x4e\x54\x2c\x61\x6d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x5f\x72\x65\x73\x75\x6c\x74\x29\xa\xa\x20\x20\x20\x20\x20\x20\x20\x20\x45\x78\x65\x63\x75\x74\x65\x5f\x66\x75\x6c\x6c\x5f\x74\x65\x73\x74\x28\x63\x61\x63\x68\x65\x2c\x73\x72\x63\x5f\x73\x68\x61\x29\xa\xa\x20\x20\x20\x20\x20\x20\x20\x20\x43\x72\x65\x61\x74\x65\x5f\x65\x78\x61\x6d\x70\x6c\x65\x73\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x63\x6c\x69\x62\x2e\x70\x72\x69\x6e\x74\x28\x41\x4e\x53\x49\x5f\x52\x45\x53\x45\x54\x29\xa\xa\x20\x20\x20\x20\x20\x20\x20\x20\x6c\x6f\x63\x61\x6c\x20\x72\x65\x61\x64\x6d\x65\x20\x3d\x20\x43\x72\x65\x61\x74\x65\x5f\x72\x65\x61\x64\x6d\x65\x28\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x69\x66\x20\x72\x65\x61\x64\x6d\x65\x20\x7e\x3d\x20\x6e\x69\x6c\x20\x74\x68\x65\x6e\xa\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x64\x74\x77\x2e\x77\x72\x69\x74\x65\x5f\x66\x69\x6c\x65\x28\x22\x52\x45\x41\x44\x4d\x45\x2e\x6d\x64\x22\x2c\x72\x65\x61\x64\x6d\x65\x29\xa\x20\x20\x20\x20\x20\x20\x20\x20\x65\x6e\x64\xa\x20\x20\x20\x20\x20\x20\x20\x20\x64\x74\x77\x2e\x77\x72\x69\x74\x65\x5f\x66\x69\x6c\x65\x28\x4f\x55\x54\x50\x55\x54\x5f\x53\x49\x4e\x47\x4c\x45\x5f\x46\x49\x4c\x45\x2c\x61\x6d\x61\x6c\x67\x61\x6d\x61\x74\x69\x6f\x6e\x5f\x72\x65\x73\x75\x6c\x74\x29\xa\xa\xa\xa\x65\x6e\x64\xa\xa\x6d\x61\x69\x6e\x28\x29\xa"; \ No newline at end of file diff --git a/build/fileJgdOGr b/build/fileJgdOGr deleted file mode 100644 index e69de29..0000000 diff --git a/build/install_dependencies.lua b/build/install_dependencies.lua new file mode 100644 index 0000000..8520df0 --- /dev/null +++ b/build/install_dependencies.lua @@ -0,0 +1,23 @@ +function install_dependencies() + local hasher = darwin.dtw.newHasher() + hasher.digest_folder_by_content("dependencies") + local EXPECTED_SHA = '070e3e3c69cd7b3012346567c7fd164aa42435c72f29d7e43c97da0ffbf2017e' + if hasher.get_value() == EXPECTED_SHA then + return + end + + darwin.dtw.remove_any("dependencies") + + os.execute("mkdir -p dependencies") + + os.execute("curl -L https://github.com/OUIsolutions/Universal-Garbage-Colector/releases/download/3.0.0/UniversalGarbage.c -o dependencies/UniversalGarbage.c") + os.execute("curl -L https://github.com/OUIsolutions/Universal-Garbage-Colector/releases/download/3.0.0/UniversalGarbage.h -o dependencies/UniversalGarbage.h") + + os.execute("curl -L https://github.com/OUIsolutions/LuaSingleUnity/releases/download/5.4.7/lua_single_unity_classic_onelua.c -o dependencies/lua_single_unity_classic_onelua.c") + os.execute("curl -L https://github.com/OUIsolutions/LuaSingleUnity/releases/download/5.4.7/lua_single_unity.h -o dependencies/lua_single_unity.h ") + + + local new_hasher = darwin.dtw.newHasher() + new_hasher.digest_folder_by_content("dependencies") + print("new hasher is: " .. new_hasher.get_value()) +end diff --git a/build/lua/amalgamation/actions.lua b/build/lua/amalgamation/actions.lua deleted file mode 100644 index 6e211ee..0000000 --- a/build/lua/amalgamation/actions.lua +++ /dev/null @@ -1,44 +0,0 @@ - - ----@param state_machine AMalgamationStateMachine - function Verify_if_is_start_string_char(state_machine) - if state_machine.inside_string == true then - return - end - if state_machine.inside_coment then - return - end - local last_char = clib.get_char(state_machine.content,state_machine.index-1) - if last_char == "'" then - return - end - - local current_char = clib.get_char(state_machine.content,state_machine.index) - if current_char == '"' then - state_machine.inside_string = true - state_machine.index = state_machine.index + 1 - end - -end - ----@param state_machine AMalgamationStateMachine - function Verify_if_is_end_string_char(state_machine) - - if state_machine.inside_string == false then - return - end - if state_machine.inside_coment then - return - end - local last_last_char = clib.get_char(state_machine.content,state_machine.index-2) - local last_char = clib.get_char(state_machine.content,state_machine.index-1) - local current_char = clib.get_char(state_machine.content,state_machine.index) - local scape = last_char == '\\' and last_last_char ~="\\" - if current_char == '"' and scape == false then - state_machine.inside_string = false - state_machine.is_end_string = true - state_machine.index = state_machine.index + 1 - - end -end - diff --git a/build/lua/amalgamation/amalgamation.lua b/build/lua/amalgamation/amalgamation.lua deleted file mode 100644 index ce3f8ce..0000000 --- a/build/lua/amalgamation/amalgamation.lua +++ /dev/null @@ -1,78 +0,0 @@ - ----@class AMalgamationStateMachine ----@field content string ----@field size number ----@field inside_string boolean ----@field waiting_include boolean ----@field string_buffer string ----@field final_text string ----@field index number ----@field is_end_string boolean ----@field buffer string ----@field inside_coment boolean ----@field inside_multiline_coment boolean ----@field insde_single_coment boolean ----@field start_path string ----@field already_include StringArray - ----@param start_point string ----@param already_included_list StringArray | nil ----@return string - function Generate_amalgamation_recursive(start_point,already_included_list) - - if already_included_list == nil then - already_included_list = Created_already_included() - end - - if not dtw.isfile(start_point) then - clib.print(ANSI_RED.."file "..start_point.." not found\n") - clib.exit(1) - end - - local start_point_sha = dtw.generate_sha_from_file(start_point) - if already_included_list.is_included(start_point_sha) then - clib.print(ANSI_YELLOW.."file "..start_point.." already included\n ") - return "" - end - - already_included_list.append(start_point_sha) - ---@type AMalgamationStateMachine - local content = dtw.load_file(start_point) - local state_machine ={ - content = content, - size = clib.get_str_size(content), - inside_string = false, - waiting_include = false, - string_buffer = "", - final_text = "//path: "..start_point.."\n", - is_start_string=false, - index=0, - is_end_string = false, - buffer="", - inside_coment = false, - inside_multiline_coment=false, - insde_single_coment=false, - start_path = start_point, - already_include =already_included_list - } - - for i=1,state_machine.size do - state_machine.index = state_machine.index + 1 - Verify_if_is_start_string_char(state_machine) - Verify_if_is_end_string_char(state_machine) - Include_char_to_string_buffer(state_machine) - Include_buffer_to_final(state_machine) - Multiline_coment_start(state_machine) - Multiline_coment_end(state_machine) - Single_line_coment_start(state_machine) - Single_line_coment_end(state_machine) - Is_include_point(state_machine) - Anulate_inclusion(state_machine) - Make_recursive_call(state_machine) - Include_char_to_final(state_machine) - - end - - clib.print(ANSI_GREEN.."amalgamated: "..start_point.."\n") - return state_machine.final_text -end diff --git a/build/lua/amalgamation/coments/multiline_coments.lua b/build/lua/amalgamation/coments/multiline_coments.lua deleted file mode 100644 index 4918f37..0000000 --- a/build/lua/amalgamation/coments/multiline_coments.lua +++ /dev/null @@ -1,36 +0,0 @@ - - ----@param state_machine AMalgamationStateMachine - function Multiline_coment_start(state_machine) - - if state_machine.inside_string then - return - end - if state_machine.inside_coment then - return - end - - - if Point_starts_with(state_machine,"/*") then - state_machine.index = state_machine.index + clib.get_str_size("/*") - state_machine.inside_coment = true - state_machine.inside_multiline_coment = true - end - -end ----@param state_machine AMalgamationStateMachine - function Multiline_coment_end(state_machine) - - - if not state_machine.inside_multiline_coment then - return - end - - if Point_starts_with(state_machine,"*/") then - state_machine.index = state_machine.index + clib.get_str_size("/*") - state_machine.inside_coment = false - state_machine.inside_multiline_coment = false - end - -end - diff --git a/build/lua/amalgamation/coments/single_line_coments.lua b/build/lua/amalgamation/coments/single_line_coments.lua deleted file mode 100644 index 364a07c..0000000 --- a/build/lua/amalgamation/coments/single_line_coments.lua +++ /dev/null @@ -1,37 +0,0 @@ - - ----@param state_machine AMalgamationStateMachine - function Single_line_coment_start(state_machine) - - if state_machine.inside_string then - return - end - if state_machine.inside_coment then - return - end - - - - if Point_starts_with(state_machine,"\n//") then - state_machine.index = state_machine.index + clib.get_str_size("\n//") - state_machine.inside_coment = true - state_machine.insde_single_coment = true - end - -end ----@param state_machine AMalgamationStateMachine - function Single_line_coment_end(state_machine) - - - if not state_machine.insde_single_coment then - return - end - - if clib.get_char(state_machine.content,state_machine.index) == '\n' then - state_machine.index = state_machine.index +1 - state_machine.inside_coment = false - state_machine.insde_single_coment = false - end - -end - diff --git a/build/lua/amalgamation/run_if_starts_with.lua b/build/lua/amalgamation/run_if_starts_with.lua deleted file mode 100644 index ad5b96d..0000000 --- a/build/lua/amalgamation/run_if_starts_with.lua +++ /dev/null @@ -1,18 +0,0 @@ - ----@param state_machine AMalgamationStateMachine ----@param str string -function Point_starts_with(state_machine,str) - local element_size = clib.get_str_size(str) - if state_machine.index + element_size >= state_machine.size then - return false - end - local buffer = "" - for i=state_machine.index,state_machine.index + element_size -1 do - buffer = buffer..clib.get_char(state_machine.content,i) - end - -- clib.print(buffer.."\n") - if buffer == str then - return true - end - return false -end diff --git a/build/lua/amalgamation/states.lua b/build/lua/amalgamation/states.lua deleted file mode 100644 index 19f7ecc..0000000 --- a/build/lua/amalgamation/states.lua +++ /dev/null @@ -1,106 +0,0 @@ - - ----@param state_machine AMalgamationStateMachine - function Include_char_to_final(state_machine) - - if state_machine.waiting_include then - return - end - if state_machine.inside_string then - return - end - if state_machine.inside_coment then - return - end - - local current_char = clib.get_char(state_machine.content,state_machine.index) - if not current_char then - return - end - - - state_machine.final_text = state_machine.final_text..current_char - - -end - ----@param state_machine AMalgamationStateMachine - function Include_buffer_to_final(state_machine) - - if state_machine.waiting_include then - return - end - - if not state_machine.is_end_string then - return - end - - state_machine.final_text = state_machine.final_text..'"'..state_machine.buffer..'"' - state_machine.is_end_string = false - state_machine.buffer = "" - -end - ----@param state_machine AMalgamationStateMachine - function Is_include_point(state_machine) - - if state_machine.inside_string then - return - end - - if state_machine.inside_coment then - return - end - if Point_starts_with(state_machine,"#include") then - state_machine.index = state_machine.index + clib.get_str_size("#include") - state_machine.waiting_include = true - end -end - - ----@param state_machine AMalgamationStateMachine - function Include_char_to_string_buffer(state_machine) - - if not state_machine.inside_string then - return - end - state_machine.buffer = state_machine.buffer..clib.get_char(state_machine.content,state_machine.index) - -end - ----@param state_machine AMalgamationStateMachine - function Make_recursive_call(state_machine) - if not state_machine.waiting_include then - return - end - if not state_machine.is_end_string then - return - end - - local dir = dtw.newPath(state_machine.start_path).get_dir() - local full_path = dtw.concat_path(dir,state_machine.buffer) - --clib.print("calling "..full_path.." from"..state_machine.start_path.."\n") - local acumulated = Generate_amalgamation_recursive(full_path,state_machine.already_include) - state_machine.final_text= state_machine.final_text.. acumulated.."\n" - state_machine.buffer = "" - state_machine.is_end_string = false - state_machine.waiting_include = false -end - - ----@param state_machine AMalgamationStateMachine - function Anulate_inclusion(state_machine) - if not state_machine.waiting_include then - return - end - if state_machine.inside_string then - return - end - - if clib.get_char(state_machine.content,state_machine.index) == "<" then - state_machine.final_text = state_machine.final_text.."#include " - state_machine.waiting_include = false - end - -end - diff --git a/build/lua/amalgamation/string_array.lua b/build/lua/amalgamation/string_array.lua deleted file mode 100644 index 165e126..0000000 --- a/build/lua/amalgamation/string_array.lua +++ /dev/null @@ -1,30 +0,0 @@ - ----@class StringArray ----@field size number ----@field elements string[] ----@field append fun(element:string) ----@field is_included fun(element:string):boolean - ----@return StringArray -function Created_already_included() - local self = { - size = 0, - elements = {} - } - - self.append = function (element) - self.size = self.size +1 - self.elements[self.size] = element - end - - self.is_included = function (element) - for i=1,self.size do - if self.elements[i] == element then - return true - end - end - return false - end - return self - -end \ No newline at end of file diff --git a/build/lua/c_types.lua b/build/lua/c_types.lua deleted file mode 100644 index 1ef4cc2..0000000 --- a/build/lua/c_types.lua +++ /dev/null @@ -1,18 +0,0 @@ - - ----@class Clib ----@field load_string fun(path:string):string ----@field get_char fun(path:string,i:number):string ----@field print fun(value:boolean | string | number) ----@field get_str_size fun(value:string): number ----@field get_time fun():number ----@field exit fun(status:number):number ----@field system_with_status fun(comand:string):number ----@field system_with_string fun(comand:string):string ----@field indexof fun(content:string,comparation:string):number ----@field out_extension fun():string ----@field replace fun(content:string,target:string,value_to_replace:string):string ----@field trim fun(content:string):string - ----@type Clib -clib = clib diff --git a/build/lua/cache/cache.lua b/build/lua/cache/cache.lua deleted file mode 100644 index 9ae740f..0000000 --- a/build/lua/cache/cache.lua +++ /dev/null @@ -1,52 +0,0 @@ - ----@param function_name string ----@param resource_path DtwResource ----@param callback fun():string ----@return CacheCallback -local function new_cache_element(function_name,resource_path,callback) - - local self = { - resource_path = resource_path, - callback = callback, - hasher = dtw.newHasher() - } - self.hasher.digest(function_name) - - self.add_dependencie = function (element) - self.hasher.digest(element) - return self - end - - self.perform = function () - local sha = self.hasher.get_value() - local sha_resource = resource_path.sub_resource(sha) - local possible_element = sha_resource.get_string() - if possible_element then - return possible_element - end - local result = self.callback() - if result == nil then - result = "" - end - sha_resource.set_value(result) - sha_resource.commit() - return result - end - return self; - -end - ----@param path string ----@return Cache -function NewCache(path) - - - local self = { - resource_path = dtw.newResource(path) - } - - self.new_element =function (function_name,callback) - return new_cache_element(function_name,self.resource_path,callback) - end - return self; -end diff --git a/build/lua/cache/cache_type.lua b/build/lua/cache/cache_type.lua deleted file mode 100644 index c5029ef..0000000 --- a/build/lua/cache/cache_type.lua +++ /dev/null @@ -1,11 +0,0 @@ - - ----@class CacheCallback ----@field hasher DtwHasher ----@field callback fun():string or nil ----@field add_dependencie fun(dependencie:string):CacheCallback ----@field perform fun():string - - ----@class Cache ----@field new_element fun(function_name:string,callback:fun():string | nil):CacheCallback \ No newline at end of file diff --git a/build/lua/colors.lua b/build/lua/colors.lua deleted file mode 100644 index 05aaa5b..0000000 --- a/build/lua/colors.lua +++ /dev/null @@ -1,7 +0,0 @@ -ANSI_RED = "\x1b[31m" -ANSI_GREEN = "\x1b[32m" -ANSI_YELLOW = "\x1b[33m" -ANSI_BLUE = "\x1b[34m" -ANSI_MAGENTA= "\x1b[35m" -ANSI_CYAN= "\x1b[36m" -ANSI_RESET ="\x1b[0m" \ No newline at end of file diff --git a/build/lua/config.lua b/build/lua/config.lua deleted file mode 100644 index 9a3e797..0000000 --- a/build/lua/config.lua +++ /dev/null @@ -1,21 +0,0 @@ -START_POINT = "src/one.c" - -LINUX_COMPILER = "gcc" -WINDOWS_COMPILER = "x86_64-w64-mingw32-gcc" - -OUTPUT_SINGLE_FILE = "LuaCembed.h" -END_TEST_POINT= "tests/LuaCEmbed.h" -SIDE_EFFECT = "tests/target" -TEST_POINT = "tests/main_test" -LIB_FOLDER = "src" -CACHE_POINT = "cache2" -EXAMPLES_FOLDER = "exemples" -TEST_FILE = "exec.c" -TEST_INPREDICTBILE_START = "S_" -TEST_PREDICIBLE_START = "T_" -EXPECTED_NAME= "expected.txt" -CODEOF_TEXT = "codeof" -SIDE_EFFECT_COMPARATION = "side_effect" - - -RECONSTRUCT = true \ No newline at end of file diff --git a/build/lua/constants.lua b/build/lua/constants.lua deleted file mode 100644 index 30d9980..0000000 --- a/build/lua/constants.lua +++ /dev/null @@ -1,2 +0,0 @@ -SIDE_EFFECT_COPY = "side_effect_copy" -OUTPUT_TEST ="output_test" diff --git a/build/lua/example_creation.lua b/build/lua/example_creation.lua deleted file mode 100644 index 59a9955..0000000 --- a/build/lua/example_creation.lua +++ /dev/null @@ -1,29 +0,0 @@ - - -function Create_examples() - dtw.remove_any(EXAMPLES_FOLDER) - local test_tree = dtw.newTree_from_hardware(TEST_POINT) - test_tree.each(function (tree_part) - local path = tree_part.path - - if path.get_name() ~= "exec.c" then - return - end - local content = tree_part.get_value() - local formated_content = clib.replace(content,"../","") - formated_content = clib.replace(formated_content,"doTheWorld_test.h",OUTPUT_SINGLE_FILE); - tree_part.set_value(formated_content) - path.insert_dir_at_index(0,EXAMPLES_FOLDER) - path.remove_dir_at(TEST_POINT) - local final_name = path.get_sub_dirs_from_index(-1,-1) - final_name = clib.replace(final_name,"T_","") - final_name = clib.replace(final_name,"S_","") - final_name = clib.replace(final_name,"/",".c") - path.remove_sub_dir_at_index(-1,-1) - path.set_name(final_name) - - tree_part.hardware_write() - clib.print(ANSI_GREEN.."created example"..path.get_full_path().."\n") - end) - test_tree.commit() -end \ No newline at end of file diff --git a/build/lua/hasher.lua b/build/lua/hasher.lua deleted file mode 100644 index 7746162..0000000 --- a/build/lua/hasher.lua +++ /dev/null @@ -1,24 +0,0 @@ - ----@param folder string ----@return string -function Generate_sha_from_folder_not_considering_empty_folders(folder) - local hasher = dtw.newHasher() - local files,files_size = dtw.list_files_recursively(folder) - for i=1,files_size do - local current_file = files[i] - local file_path = dtw.concat_path(folder,current_file) - local content = dtw.load_file(file_path) - hasher.digest(current_file) - hasher.digest(content) - end - local dirs,dirs_size = dtw.list_dirs_recursively(folder) - for i=1,dirs_size do - local current_dir = dirs[i] - local dir_path = dtw.concat_path(folder,current_dir) - local ignore,size= dtw.list_files_recursively(dir_path,false) - if size > 0 then - hasher.digest(current_dir) - end - end - return hasher.get_value() -end diff --git a/build/lua/lua_do_the_world_type.lua b/build/lua/lua_do_the_world_type.lua deleted file mode 100644 index 8bd64bd..0000000 --- a/build/lua/lua_do_the_world_type.lua +++ /dev/null @@ -1,174 +0,0 @@ - - ----@class DtwTreePart ----@field path DtwPath ----@field get_value fun():string ----@field set_value fun(value:string | number | boolean | DtwTreePart | DtwResource | DtwActionTransaction) ----@field hardware_remove fun(as_transaction:boolean|nil):DtwTreePart ----@field hardware_write fun(as_transaction:boolean|nil):DtwTreePart ----@field hardware_modify fun(as_transaction:boolean|nil):DtwTreePart ----@field get_sha fun():string ----@field is_blob fun():boolean ----@field unload fun():DtwTreePart ----@field load fun():DtwTreePart - - ----@class DtwTree ----@field newTreePart_empty fun ():DtwTreePart ----@field newTreePart_loading fun ():DtwTreePart ----@field get_tree_part_by_index fun(index:number):DtwTreePart ----@field insecure_hardware_write_tree fun():DtwTree ----@field insecure_hardware_remove fun():DtwTree ----@field commit fun():DtwTree ----@field get_size fun():number ----@field get_tree_part_by_name fun(name:string):DtwTreePart ----@field get_tree_part_by_path fun(name:string):DtwTreePart ----@field find fun(callback: fun(part:DtwTreePart):boolean):DtwTreePart ----@field count fun(callback: fun(part:DtwTreePart):boolean):number ----@field map fun(callback: fun(part:DtwTreePart):any):any[] ----@field each fun(callback: fun(part:DtwTreePart)) ----@field dump_to_json_string fun():string ----@field dump_to_json_file fun():DtwTree - ----@class DtwPath ----@field path_changed fun():boolean ----@field add_start_dir fun(start_dir:string):DtwPath ----@field add_end_dir_method fun (end_dir:string):DtwPath ----@field changed fun():boolean ----@field get_dir fun():string ----@field get_extension fun():string ----@field get_name fun():string ----@field get_only_name fun():string ----@field get_full_path fun():string ----@field set_name fun(new_name:string) DtwPath ----@field set_only_name fun(new_name:string) DtwPath ----@field set_extension fun(extension:string):DtwPath ----@field set_dir fun(dir:string):DtwPath ----@field set_path fun(path:string):DtwPath ----@field replace_dirs fun(old_dir:string,new_dir:string):DtwPath ----@field get_total_dirs fun():number ----@field get_sub_dirs_from_index fun(start:number,end:number):string ----@field insert_dir_at_index fun(index:number,dir:string):DtwPath ----@field remove_sub_dir_at_index fun(start:number,end:number):DtwPath ----@field insert_dir_after fun(point:string, dir:string):DtwPath ----@field insert_dir_before fun(point:string, dir:string):DtwPath ----@field remove_dir_at fun(point:string):DtwPath ----@field unpack fun():string[],number - - - ----@class DtwHasher ----@field digest fun(value:string | number | boolean | string ):DtwHasher ----@field digest_file fun(source:string):DtwHasher ----@field digest_folder_by_content fun(source:string):DtwHasher ----@field digest_folder_by_last_modification fun(source:string):DtwHasher ----@field get_value fun():string - ----@class DtwActionTransaction ----@field get_type_code fun():number ----@field get_type fun():string ----@field get_content fun():string ----@field set_content fun() ----@field get_source fun():string ----@field get_dest fun():string ----@field set_dest fun():string - - - - ----@class DtwTransaction ----@field write fun(src :string , value:string | number | boolean | string | DtwResource ):DtwTransaction ----@field remove_any fun(src:string):DtwTransaction ----@field copy_any fun(src:string,dest:string):DtwTransaction ----@field move_any fun(src:string,dest:string):DtwTransaction ----@field dump_to_json_string fun():string ----@field dump_to_json_file fun(src:string):DtwTransaction ----@field each fun(callbac: fun(value:DtwActionTransaction)) ----@field map fun(callbac: fun(value:DtwActionTransaction):any):any[] ----@field find fun(callbac: fun(value:DtwActionTransaction):boolean):DtwActionTransaction ----@field count fun(callbac: fun(value:DtwActionTransaction):boolean):number ----@field __index fun(index:number):DtwActionTransaction ----@field get_action fun(index:number):DtwActionTransaction ----@field commit fun():DtwTransaction - - ----@class DtwSchema ----@field add_primary_keys fun(values:string | string[]) ----@field sub_schema fun(values:string | string[]) - ----@class DtwResource ----@field schema_new_insertion fun():DtwResource ----@field dangerous_remove_prop fun(primary_key:string) ----@field dangerous_rename_prop fun(primary_key:string ,new_name:string) ----@field get_resource_matching_primary_key fun(primary_key: string, value:string | number | boolean | Dtwblobs | DtwResource ):DtwResource ----@field get_resource_by_name_id fun(id_name:string) ----@field schema_list fun(): DtwResource[] ----@field schema_each fun(callback:fun(value:DtwResource)) ----@field schema_find fun(callback:fun(value:DtwResource):boolean):DtwResource ----@field schema_map fun(callback:fun(value:DtwResource):any) ----@field schema_count fun(callback:fun(value:DtwResource):boolean):number ----@field sub_resource fun(str:string) :DtwResource ----@field sub_resource_next fun(str:string) :DtwResource ----@field sub_resource_now fun(str:string) :DtwResource ----@field sub_resource_now_in_unix fun(str:string) :DtwResource ----@field __index fun(str:string) : number ,DtwResource ----@field get_value fun():string | number | boolean | nil | string ----@field get_string fun():string | nil ----@field get_number fun(): number | nil ----@field get_bool fun(): boolean | nil ----@field set_value fun(value:string | number | boolean | string | DtwResource ) ----@field commit fun() apply the modifications ----@field lock fun() lock the resource from other process ----@field unlock fun() ----@field unload fun() unload the content ----@field get_path_string fun() :string ----@field each fun(callback :fun(element:DtwResource)) ----@field set_extension fun(extension:string) ----@field list fun(): DtwResource[] ----@field destroy fun() ----@field set_value_in_sub_resource fun(key:string ,value:string | number | boolean | string | DtwResource ) ----@field get_value_from_sub_resource fun(key:string):string | number | boolean | nil | string ----@field newSchema fun():DtwSchema - - ----@class DtwModule ----@field copy_any_overwriting fun(src:string,dest:string):boolean returns true if the operation were ok otherwise false ----@field copy_any_merging fun(src:string,dest:string):boolean returns true if the operation were ok otherwise false ----@field move_any_overwriting fun(src:string,dest:string):boolean returns true if the operation were ok otherwise false ----@field move_any_merging fun(src:string,dest:string):boolean returns true if the operation were ok otherwise false ----@field remove_any fun(src:string):boolean returns true if the operation were ok otherwise false ----@field base64_encode_file fun(src:string):string transform file into base64 ----@field base64_encode fun(value:string | number | boolean | string):string transform content into base64 ----@field base64_decode fun(value:string): string | string retransform base64 into normal value ----@field list_files fun(src:string,concat_path:boolean|nil):string[],number ----@field list_dirs fun(src:string,concat_path:boolean|nil):string[],number ----@field list_all fun(src:string,concat_path:boolean|nil):string[],number ----@field list_files_recursively fun(src:string,concat_path:boolean|nil):string[],number ----@field list_dirs_recursively fun(src:string,concat_path:boolean|nil):string[],number ----@field list_all_recursively fun(src:string,concat_path:boolean|nil):string[],number ----@field load_file fun(src:string):string | string ----@field write_file fun(src:string,value:string | number | boolean | DtwTreePart | DtwResource | DtwActionTransaction) ----@field is_blob fun(value:any):boolean returns if a value is a blob ----@field newResource fun(src:string):DtwResource ----@field generate_sha fun(value:string | number | boolean | string):string ----@field generate_sha_from_file fun(src:string):string ----@field generate_sha_from_folder_by_content fun(src:string):string ----@field generate_sha_from_folder_by_last_modification fun(src:string):string ----@field newHasher fun():DtwHasher ----@field isdir fun(path:string):boolean ----@field isfile fun(path:string):boolean ----@field isfile_blob fun(path:string):boolean ----@field newTransaction fun():DtwTransaction ----@field newTransaction_from_file fun():DtwTransaction ----@field newTransaction_from_json_string fun():DtwTransaction ----@field newPath fun(path:string):DtwPath ----@field newTree fun():DtwTree ----@field newTree_from_hardware fun(path:string):DtwTree ----@field concat_path fun(path1:string,path2:string):string ----@field starts_with fun(comparation:string,prefix:string):boolean ----@field ends_with fun(comparation:string,sulfix:string):boolean - - - ----@type DtwModule -dtw = dtw \ No newline at end of file diff --git a/build/lua/main.lua b/build/lua/main.lua deleted file mode 100644 index 1bdaf88..0000000 --- a/build/lua/main.lua +++ /dev/null @@ -1,31 +0,0 @@ - - - - -local function main() - local src_sha = Generate_sha_from_folder_not_considering_empty_folders(LIB_FOLDER) - local cache = NewCache(CACHE_POINT) - - - local amalgamation_cache = cache.new_element("amalgamation",function () - return Generate_amalgamation_recursive(START_POINT) - end).add_dependencie(src_sha) - local amalgamation_result = Generate_amalgamation_recursive(START_POINT) - dtw.write_file(END_TEST_POINT,amalgamation_result) - - Execute_full_test(cache,src_sha) - - Create_examples() - clib.print(ANSI_RESET) - - local readme = Create_readme() - if readme ~= nil then - dtw.write_file("README.md",readme) - end - dtw.write_file(OUTPUT_SINGLE_FILE,amalgamation_result) - - - -end - -main() \ No newline at end of file diff --git a/build/lua/readme_creation.lua b/build/lua/readme_creation.lua deleted file mode 100644 index d02b7f1..0000000 --- a/build/lua/readme_creation.lua +++ /dev/null @@ -1,76 +0,0 @@ - - ----@param content string ----@param index number -local function is_codeof_at_point(content,index) - local codeof_size = clib.get_str_size(CODEOF_TEXT) - local content_size = clib.get_str_size(content) - if index + codeof_size >= content_size then - return false - end - - local buffer = "" - for i=index,index + codeof_size -1 do - buffer = buffer..clib.get_char(content,i) - end - - return buffer == CODEOF_TEXT - -end - - ----@return string |nil -function Create_readme() - local content = dtw.load_file("build/INTERNAL.md") - if content == nil then - clib.print("intenal readme not found\n") - clib.exit(1) - return - end - - local i = 1 - local size = clib.get_str_size(content) - local codeof_size = clib.get_str_size(CODEOF_TEXT) - - local colecting = false - local final_text = "" - local path = "" - while i < size do - - if is_codeof_at_point(content,i) then - colecting = true - i = i + codeof_size+1 - end - local is_end_char = clib.get_char(content,i) == "\n" - - if colecting and not is_end_char then - path = path..clib.get_char(content,i) - end - - if colecting ==false then - final_text = final_text..clib.get_char(content,i) - end - - if colecting and is_end_char then - path = clib.trim(path) - local file_content = dtw.load_file(path) - if file_content == nil then - - clib.print(ANSI_RED.."file ("..path..") not found\n") - clib.exit(1) - end - - local extension = dtw.newPath(path).get_extension() - final_text = final_text.."\n~~~"..extension.."\n"..file_content.."\n~~~\n" - colecting = false - path ="" - end - - - - - i = i + 1 - end - return final_text - -end \ No newline at end of file diff --git a/build/lua/test/artifact.lua b/build/lua/test/artifact.lua deleted file mode 100644 index 2112965..0000000 --- a/build/lua/test/artifact.lua +++ /dev/null @@ -1,46 +0,0 @@ - -IMPREDITIBLE = 1 -PREDICTIBLE = 2 - ----@class TestArtifact ----@field test_type number ----@field test_dir string | nil ----@field expected_file_path string | nil ----@field executable_path string |nil ----@field c_path string | nil ----@field side_effect_folder_path string | nil ----@field c_sha string ----@field executable_sha string ----@field side_effect_sha string | nil ----@param content string ----@return TestArtifact | nil - function Get_test_spec(content) - - local path = dtw.newPath(content) - local filename = path.get_name() - if filename ~= TEST_FILE then - return nil - end - local test = {} - local dirs,size = path.unpack() - for i=1,size do - local current_dir = dirs[i] - if dtw.starts_with(current_dir,TEST_INPREDICTBILE_START) then - test.test_type = IMPREDITIBLE - end - if dtw.starts_with(current_dir,TEST_PREDICIBLE_START) then - test.test_type = PREDICTIBLE - end - end - - if test.test_type == nil then - return nil - end - - test.test_dir = path.get_dir() - test.expected_file_path = dtw.concat_path(test.test_dir,EXPECTED_NAME) - test.executable_path = dtw.concat_path(test.test_dir,"exec."..clib.out_extension()) - test.c_path = path.get_full_path() - test.side_effect_folder_path = dtw.concat_path(test.test_dir,SIDE_EFFECT_COMPARATION) - return test -end \ No newline at end of file diff --git a/build/lua/test/compilation.lua b/build/lua/test/compilation.lua deleted file mode 100644 index 6123900..0000000 --- a/build/lua/test/compilation.lua +++ /dev/null @@ -1,25 +0,0 @@ - ----@param cache Cache ----@param src_sha string ----@param artifact TestArtifact -function Execute_compilation(cache,src_sha,artifact) - - local compiled = false - cache.new_element("compilation",function () - compiled = true - local comand = "gcc "..artifact.c_path.." -DDTW_DEBUG_TIME -o "..artifact.executable_path - local result = clib.system_with_status(comand) - if result ~=0 then - clib.exit(1) - end - clib.print(ANSI_GREEN.."\tcompilation:passed\n") - end). - add_dependencie(src_sha). - add_dependencie(artifact.c_sha). - perform() - - if compiled == false then - clib.print(ANSI_YELLOW.."\tcompilation:cached\n") - end -end - diff --git a/build/lua/test/extra..lua b/build/lua/test/extra..lua deleted file mode 100644 index bb076f4..0000000 --- a/build/lua/test/extra..lua +++ /dev/null @@ -1,5 +0,0 @@ - - function Rebase_side_effect() - dtw.copy_any_overwriting(SIDE_EFFECT_COPY,SIDE_EFFECT) - -end diff --git a/build/lua/test/main_test.lua b/build/lua/test/main_test.lua deleted file mode 100644 index e518198..0000000 --- a/build/lua/test/main_test.lua +++ /dev/null @@ -1,42 +0,0 @@ - - ----@param cache Cache ----@param src_sha string ----@param original_side_effect_sha string ----@param artifact TestArtifact -local function execute_test_artifact(cache,src_sha,original_side_effect_sha,artifact) - - clib.print(ANSI_BLUE.."testing: "..artifact.c_path.."\n") - - artifact.c_sha = dtw.generate_sha_from_file(artifact.c_path) - - Execute_compilation(cache,src_sha,artifact) - artifact.executable_sha = dtw.generate_sha_from_file(artifact.executable_path) - - - Exec_valgrind_test(cache,original_side_effect_sha,artifact) - - Test_out_put(cache,original_side_effect_sha,artifact) - - -end - - ----@param cache Cache ----@param src_sha string -function Execute_full_test(cache,src_sha) - - local original_side_effect_sha = Generate_sha_from_folder_not_considering_empty_folders(SIDE_EFFECT) - dtw.copy_any_overwriting(SIDE_EFFECT,SIDE_EFFECT_COPY) - - local listage,size =dtw.list_files_recursively(TEST_POINT,true) - - for i=1,size do - local possible_test = listage[i] - local test = Get_test_spec(possible_test) - if test ~= nil then - execute_test_artifact(cache,src_sha,original_side_effect_sha,test) - end - - end -end \ No newline at end of file diff --git a/build/lua/test/output_test.lua b/build/lua/test/output_test.lua deleted file mode 100644 index a46f08f..0000000 --- a/build/lua/test/output_test.lua +++ /dev/null @@ -1,115 +0,0 @@ - - ----@param expected_content string ----@param artifact TestArtifact ----@param output_test string -local function handle_expected_file(expected_content,artifact,output_test) - - - if expected_content == nil then - dtw.write_file(artifact.expected_file_path,output_test) - clib.print(ANSI_CYAN.."\texpected file:created\n") - return - end - if output_test == expected_content then - clib.print(ANSI_GREEN.."\texpected file: passed\n") - return - end - - if RECONSTRUCT then - dtw.write_file(artifact.expected_file_path,output_test) - clib.print(ANSI_MAGENTA.."\texpected file:reconstructed\n") - return - end - if artifact.test_type == PREDICTIBLE then - clib.print(ANSI_RED.."\texpected file: different\n") - Rebase_side_effect() - clib.exit(1) - end - if artifact.test_type== IMPREDITIBLE then - clib.print(ANSI_YELLOW.."\texpected file: impredictible\n") - end - - - -end - - ----@param original_side_effect_sha string ----@param artifact TestArtifact -local function handle_side_effect_folder(original_side_effect_sha,artifact) - - local current_sidde_effect =Generate_sha_from_folder_not_considering_empty_folders(SIDE_EFFECT) - - if current_sidde_effect == original_side_effect_sha then - clib.print(ANSI_YELLOW.."\tside effect folder: no changes\n") - return - end - - - - if artifact.side_effect_sha == nil then - dtw.move_any_overwriting(SIDE_EFFECT,artifact.side_effect_folder_path) - clib.print(ANSI_CYAN.."\tside effect folder: created\n") - return - end - - if artifact.test_type == IMPREDITIBLE then - clib.print(ANSI_YELLOW.."\tside effect folder: impredictible\n") - return - end - - if RECONSTRUCT then - dtw.move_any_overwriting(SIDE_EFFECT,artifact.side_effect_folder_path) - clib.print(ANSI_MAGENTA.."\tside effect folder: recreated\n") - return - end - - if artifact.side_effect_sha ~=current_sidde_effect then - clib.print(ANSI_RED.."\tside effect folder: diffeent\n") - Rebase_side_effect() - clib.exit(1) - end - - clib.print(ANSI_GREEN.."\tside effect folder: passed\n") -end - ----@param cache Cache ----@param original_side_effect_sha string ----@param artifact TestArtifact -function Test_out_put(cache,original_side_effect_sha,artifact) - - local output_tested = false - local expected_content = dtw.load_file(artifact.expected_file_path) - - local out_cache = cache.new_element("output",function () - - output_tested = true - local output_test = clib.system_with_string("./"..artifact.executable_path) - handle_expected_file(expected_content,artifact,output_test) - handle_side_effect_folder(original_side_effect_sha,artifact) - Rebase_side_effect() - - end). - add_dependencie(artifact.executable_sha). - add_dependencie(original_side_effect_sha) - - - if dtw.isdir(artifact.side_effect_folder_path) then - artifact.side_effect_sha = Generate_sha_from_folder_not_considering_empty_folders(artifact.side_effect_folder_path) - out_cache.add_dependencie(artifact.side_effect_sha) - end - - if expected_content ~=nil and artifact.test_type == PREDICTIBLE then - out_cache.add_dependencie(expected_content) - end - - - out_cache.perform() - - - if output_tested == false then - clib.print(ANSI_YELLOW.."\toutput test: cached\n") - end - -end \ No newline at end of file diff --git a/build/lua/test/valgrind_test.lua b/build/lua/test/valgrind_test.lua deleted file mode 100644 index 39b772c..0000000 --- a/build/lua/test/valgrind_test.lua +++ /dev/null @@ -1,43 +0,0 @@ - - ----@param cache Cache ----@param original_side_effect_sha string ----@param artifact TestArtifact - function Exec_valgrind_test(cache,original_side_effect_sha,artifact) - local memory_tested = false - cache.new_element("valgrind",function () - memory_tested =true - local comand = "valgrind --log-file='"..OUTPUT_TEST.."' ./"..artifact.executable_path - clib.system_with_string(comand); - Rebase_side_effect() - - local result = dtw.load_file(OUTPUT_TEST) - if result == nil then - clib.exit(1) - return - end - - local HEAP_CHECK = "All heap blocks were freed -- no leaks are possible" - local error =false - if clib.indexof(result,HEAP_CHECK) == -1 then - error = true - end - local ERROR_CHECK = "ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 0 from 0)" - if clib.indexof(result,ERROR_CHECK) == -1 then - error = true - end - - if error then - clib.print(ANSI_RED..result) - clib.exit(1) - end - clib.print(ANSI_GREEN.."\tmemory test:passed\n") -end). - add_dependencie(artifact.executable_sha). - add_dependencie(original_side_effect_sha). - perform() - - if memory_tested == false then - clib.print(ANSI_YELLOW.."\tmemory test:cached\n") - end -end diff --git a/build/main.lua b/build/main.lua new file mode 100644 index 0000000..770ded0 --- /dev/null +++ b/build/main.lua @@ -0,0 +1,71 @@ +function main() + install_dependencies() + darwin.silverchain.generate({ + src = "src", + tags = { "dep_declare", "macros", "types","consts", "fdeclare","globals", "dep_define","fdefine" }, + project_short_cut = "LuaCEmbed", + implement_main = false + }) + + if darwin.argv.one_of_args_exist("only_silverchain") then + return + end + + local MAX_CONNTENT = darwin.camalgamator.ONE_MB * 20 + local MAX_RECURSION = 100 + + local lincense = "/* " .. darwin.dtw.load_file("LICENSE") .. " */ \n" + + local onefile = darwin.camalgamator.generate_amalgamation("src/one.c", MAX_CONNTENT, MAX_RECURSION) + onefile = lincense .. onefile + + darwin.dtw.write_file("release/LuaCEmbedOne.c", onefile) + + local only_declare = darwin.camalgamator.generate_amalgamation("src/imports/imports.fdeclare.h", MAX_CONNTENT, + MAX_RECURSION) + only_declare = lincense .. only_declare + darwin.dtw.write_file("release/LuaCEmbed.h", only_declare) + + + local only_definition = darwin.camalgamator.generate_amalgamation_with_callback("src/imports/imports.fdefine.h", + function(import, path) + + + if darwin.dtw.ends_with(import,"cJSON.h") then + return "dont-include" + end + + if darwin.dtw.ends_with(import,"CTextEngine.h") then + return "dont-include" + end + + if darwin.dtw.ends_with(import,"UniversalGarbage.h") then + return "dont-include" + end + + if darwin.dtw.ends_with(import,"UniversalSocket.h") then + return "dont-include" + end + + if darwin.dtw.ends_with(path,"imports.fdeclare.h") then + return "dont-include" + end + + + + return "include-once" + end, + + MAX_CONNTENT, + MAX_RECURSION + ) + + only_definition = '#include "LuaCEmbed.h"\n' .. only_definition + + only_definition = lincense .. only_definition + + darwin.dtw.write_file("release/LuaCEmbed.c", only_definition) + + os.execute("zip -r release/LuaCEmbed.zip dependencies src build") + +end diff --git a/docs/build_and_install.md b/docs/build_and_install.md new file mode 100644 index 0000000..e0514d6 --- /dev/null +++ b/docs/build_and_install.md @@ -0,0 +1,80 @@ + + +## Install + +To install the lib just copy the [Amalgamation](https://github.com/OUIsolutions/LuaCEmbed/releases/download/0.8.2/LuaCEmbedOne.c) into your project and include it in your code: +```c +#include "LuaCEmbedOne.c" +``` + + +If you are on Linux, you can download the lib with: +```bash +curl -L https://github.com/OUIsolutions/LuaCEmbed/releases/download/0.8.2/LuaCEmbedOne.c -o LuaCEmbedOne.c +``` + +## Compile on Linux + +To compile the lib in **Linux** you can use the following command: +```bash +gcc main.c -o your_output.out +``` + +## Compile on Windows + +To compile the lib in **Windows** you can use the following commands + +With Microsoft Visual C: +```cmd +cl.exe examples\example_simple.c /Fe:bin\example_simple.exe +``` + +With mingw64: +```bash +i686-w64-mingw32-gcc examples\example_simple.c -o bin\example_simple.exe -lws2_32 +``` + +## Build from scratch + +For buiding from scratch you need to have [darwin](https://github.com/OUIsolutions/Darwin/) installed on your machine. To install darwin: +```bash +curl -L https://github.com/OUIsolutions/Darwin/releases/download/0.2.0/darwin.out -o darwin.out && chmod +x darwin.out && sudo mv darwin.out /usr/bin/darwin +``` + +Then you can build the project with in the root dir of the project: +```bash +darwin run_blueprint build/ --mode folder +``` + +It will generate all the **releases** in the **/release** dir. + + + +### Mocking dependencies or dependencies implementations + +The following defines toggle dependencies or just the definitions. +It is useful for working with dynamic compilation or mocking dependencies. +check [dep_declare.dependecies.h](/src/src_dependencies/dep_declare.dependecies.h) and +[dep_define.dependencies.c](/src/src_dependencies/dep_define.dependencies.c) for more information. +```c + +//unallow lua +#define LUA_CEMBED_MOCK_LUA + +//unallow Universal Garbage +#define LUA_CEMBED_MOCK_UNIVERSAL_GARBAGE + +//unallow lua definition +#define LUA_CEMBED_MOCK_LUA_DEFINE + +//unallow universal garbage definition +#define LUA_CEMBED_MOCK_UNIVERSAL_GARBAGE_DEFINE + +//unallow custom math.h (-lm on compilation ill be required) +#define LUA_CEMBED_NOT_IMPLEMENT_MATH + + +#include "LuaCEmbedOne.c" + + +``` \ No newline at end of file diff --git a/docs/callbacks.md b/docs/callbacks.md new file mode 100644 index 0000000..19cc76d --- /dev/null +++ b/docs/callbacks.md @@ -0,0 +1,165 @@ +# Callbacks + +Callbacks allow C functions to be accessible in Lua code: + +```c +#include "LuaCEmbedOne.c" +LuaCEmbedNamespace lua_n; + +LuaCEmbedResponse *hello(LuaCEmbed *args) { + printf("my first callback\n"); + return NULL; +} + +int main(int argc, char *argv[]) { + lua_n = newLuaCEmbedNamespace(); + LuaCEmbed *l = lua_n.newLuaEvaluation(); + lua_n.add_callback(l, "hello", hello); + + lua_n.evaluate(l, "hello()"); + + if (lua_n.has_errors(l)) { + printf("error: %s\n", lua_n.get_error_message(l)); + } + lua_n.free(l); + + return 0; +} +``` + +**Output:** +```bash +my first callback +``` + +### Callback Args + +You can accept and check callback arguments: + +```c +#include "LuaCEmbed.h" +LuaCEmbedNamespace lua_n; + + +LuaCEmbedResponse * test_func(LuaCEmbed *args){ + long size = lua_n.args.size(args); + if(size == 0){ + printf("no argument providided\n"); + return NULL; + } + int index = 0; + int arg_type = lua_n.args.get_type(args,index); + + if(arg_type == lua_n.types.NUMBER){ + printf("number: %lf\n",lua_n.args.get_double(args,index)); + } + + else if(arg_type == lua_n.types.STRING){ + printf("str: %s\n",lua_n.args.get_str(args,index)); + } + + else if(arg_type == lua_n.types.BOOL){ + printf("bool: %d\n", lua_n.args.get_bool(args,index)); + } + else{ + const char *converted_to_str = lua_n.convert_arg_code(arg_type); + printf("type: %s\n",converted_to_str); + } + + return NULL; +} + +int main(int argc, char *argv[]){ + + lua_n = newLuaCEmbedNamespace(); + LuaCEmbed * l = lua_n.newLuaEvaluation(); + lua_n.add_callback(l,"test",test_func); + + lua_n.evaluate(l,"test()"); + lua_n.evaluate(l,"test(10)"); + lua_n.evaluate(l,"test('hello')"); + lua_n.evaluate(l,"test(true)"); + lua_n.evaluate(l,"test({a=30})"); + + + if(lua_n.has_errors(l)){ + printf("error: %s\n",lua_n.get_error_message(l)); + } + lua_n.free(l); + + return 0; +} + +``` + +**Output:** +```bash +no argument provided +number: 10.000000 +str: hello +bool: 1 +type: table +``` + +### Index Type + +Lua starts indexing at 1, but LuaCEmbed uses C-style indexing (starting at 0): + +```c + +#define LUA_CEMBED_INDEX_DIF 0 +#include "LuaCEmbed.h" + +LuaCEmbedNamespace lua_n; + + +LuaCEmbedResponse * test_func(LuaCEmbed *args){ + long size = lua_n.args.size(args); + if(size == 0){ + printf("no argument providided\n"); + return NULL; + } + int index = 1; + int arg_type = lua_n.args.get_type(args,index); + + if(arg_type == lua_n.types.NUMBER){ + printf("number: %lf\n",lua_n.args.get_double(args,index)); + } + + else if(arg_type == lua_n.types.STRING){ + printf("str: %s\n",lua_n.args.get_str(args,index)); + } + + else if(arg_type == lua_n.types.BOOL){ + printf("bool: %d\n", lua_n.args.get_bool(args,index)); + } + else{ + const char *converted_to_str = lua_n.convert_arg_code(arg_type); + printf("type: %s\n",converted_to_str); + } + + return NULL; +} + +int main(int argc, char *argv[]){ + + lua_n = newLuaCEmbedNamespace(); + LuaCEmbed * l = lua_n.newLuaEvaluation(); + lua_n.add_callback(l,"test",test_func); + + lua_n.evaluate(l,"test()"); + lua_n.evaluate(l,"test(10)"); + lua_n.evaluate(l,"test('hello')"); + lua_n.evaluate(l,"test(true)"); + lua_n.evaluate(l,"test({a=30})"); + + + if(lua_n.has_errors(l)){ + printf("error: %s\n",lua_n.get_error_message(l)); + } + lua_n.free(l); + + return 0; +} + +``` \ No newline at end of file diff --git a/docs/dependencies.md b/docs/dependencies.md new file mode 100644 index 0000000..fe1659c --- /dev/null +++ b/docs/dependencies.md @@ -0,0 +1,87 @@ +### Licenses and Attributions + + +## [Lua](https://www.lua.org/) and [lua Github](https://github.com/lua/lua) + +Lua is free software distributed under the terms of the MIT license reproduced here. Lua may be used for any purpose, including commercial purposes, at absolutely no cost. No paperwork, no royalties, no GNU-like "copyleft" restrictions, either. Just download it and use it. + +Lua is certified Open Source software. [Open Source Initiative Approved License]Its license is simple and liberal and is compatible with GPL. Lua is not in the public domain and PUC-Rio keeps its copyright. + +The spirit of the Lua license is that you are free to use Lua for any purpose at no cost without having to ask us. The only requirement is that if you do use Lua, then you should give us credit by including the copyright notice somewhere in your product or its documentation. A nice, but optional, way to give us further credit is to include a Lua logo and a link to our site in a web page for your product. + +The Lua language is entirely designed, implemented, and maintained by a team at PUC-Rio in Brazil. The implementation is not derived from licensed software. + + +## [LuaSingleUnity](https://github.com/OUIsolutions/LuaSingleUnity) + +This is free and unencumbered software released into the public domain. + +Anyone is free to copy, modify, publish, use, compile, sell, or +distribute this software, either in source code form or as a compiled +binary, for any purpose, commercial or non-commercial, and by any +means. + +In jurisdictions that recognize copyright laws, the author or authors +of this software dedicate any and all copyright interest in the +software to the public domain. We make this dedication for the benefit +of the public at large and to the detriment of our heirs and +successors. We intend this dedication to be an overt act of +relinquishment in perpetuity of all present and future rights to this +software under copyright law. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, +EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. +IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR +OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, +ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR +OTHER DEALINGS IN THE SOFTWARE. + +For more information, please refer to + +## [UniversalGarbage](https://github.com/OUIsolutions/Universal-Garbage-Colector) + +MIT License + +Copyright (c) 2023 OUI + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in all +copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE +SOFTWARE. + +## [Darwin](https://github.com/OUIsolutions/Darwin/) +MIT License + +Copyright (c) 2024 OUI + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in all +copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE +SOFTWARE. \ No newline at end of file diff --git a/docs/evaluations.md b/docs/evaluations.md new file mode 100644 index 0000000..1cb6afc --- /dev/null +++ b/docs/evaluations.md @@ -0,0 +1,219 @@ + + +### Evaluation +To evaluate Lua Code from C, you can use all the evaluation methods, provided by the lib + + +#### Evaluating string + +```c +#include "LuaCEmbedOne.c" +LuaCEmbedNamespace lua_n; + + + +int main(int argc, char *argv[]){ + + lua_n = newLuaCEmbedNamespace(); + LuaCEmbed * l = lua_n.newLuaEvaluation(); + lua_n.evaluate(l,"r = 'hello world'"); + + char * result = lua_n.get_string_evaluation(l,"r"); + printf("result: %s\n",result); + if(lua_n.has_errors(l)){ + printf("error: %s\n",lua_n.get_error_message(l)); + } + lua_n.free(l); + + return 0; +} +``` + + +It will produce: + +```bash +result: hello world + +``` + + +#### Evaluating a file +It's also possible to evaluate a file by using the **evaluete_file** method + +```c +#include "LuaCEmbedOne.c" +LuaCEmbedNamespace lua_n; + + +LuaCEmbedResponse * hello(LuaCEmbed *args){ + printf("hello world"); + return NULL; +} + +int main(int argc, char *argv[]){ + + lua_n = newLuaCEmbedNamespace(); + LuaCEmbed * l = lua_n.newLuaEvaluation(); + lua_n.add_callback(l,"hello",hello); + + lua_n.evaluete_file(l,"tests/target/hello.lua"); + + if(lua_n.has_errors(l)){ + printf("error: %s\n",lua_n.get_error_message(l)); + } + lua_n.free(l); + + return 0; +} +``` + + +It will produce: + +```bash +hello world +``` + + + + +#### Type Evaluation +You can determine the type of the evaluation by using the **get_evaluation_type** method +#### Evaluating Long + +```c +#include "LuaCEmbedOne.c" +LuaCEmbedNamespace lua_n; + + + +int main(int argc, char *argv[]){ + + lua_n = newLuaCEmbedNamespace(); + LuaCEmbed * l = lua_n.newLuaEvaluation(); + lua_n.evaluate(l,"r = 'hello world'"); + + int r_type = lua_n.get_evaluation_type(l,"r"); + const char*converted = lua_n.convert_arg_code(r_type); + printf("result: %s\n",converted); + if(lua_n.has_errors(l)){ + printf("error: %s\n",lua_n.get_error_message(l)); + } + lua_n.free(l); + + return 0; +} +``` + + + +It will produce: + +```bash +result: string + +``` + + +#### Evaluating Long + +```c +#include "LuaCEmbedOne.c" +LuaCEmbedNamespace lua_n; + + + +int main(int argc, char *argv[]){ + + lua_n = newLuaCEmbedNamespace(); + LuaCEmbed * l = lua_n.newLuaEvaluation(); + lua_n.evaluate(l,"r = 20 + 30"); + + long result = lua_n.get_evaluation_long(l,"r"); + printf("result: %ld\n",result); + if(lua_n.has_errors(l)){ + printf("error: %s\n",lua_n.get_error_message(l)); + } + lua_n.free(l); + + return 0; +} +``` + + +It will produce: + +```bash +result: 50 + +``` + + +#### Evaluating Double + +```c +#include "LuaCEmbedOne.c" +LuaCEmbedNamespace lua_n; + + + +int main(int argc, char *argv[]){ + + lua_n = newLuaCEmbedNamespace(); + LuaCEmbed * l = lua_n.newLuaEvaluation(); + lua_n.evaluate(l,"r = 20 + 30"); + + double result = lua_n.get_evaluation_double(l,"r"); + printf("result: %lf\n",result); + if(lua_n.has_errors(l)){ + printf("error: %s\n",lua_n.get_error_message(l)); + } + lua_n.free(l); + + return 0; +} +``` + + + +It will produce: + +```bash +result: 50.000000 + +``` + + +#### Evaluating Bool + +```c +#include "LuaCEmbedOne.c" +LuaCEmbedNamespace lua_n; + + + +int main(int argc, char *argv[]){ + + lua_n = newLuaCEmbedNamespace(); + LuaCEmbed * l = lua_n.newLuaEvaluation(); + lua_n.evaluate(l,"r = true"); + + bool result = lua_n.get_evaluation_bool(l,"r"); + printf("result: %d\n",result); + if(lua_n.has_errors(l)){ + printf("error: %s\n",lua_n.get_error_message(l)); + } + lua_n.free(l); + + return 0; +} +``` + + +It will produce: + +```bash +result: 1 + +``` \ No newline at end of file diff --git a/docs/making_a_library.md b/docs/making_a_library.md new file mode 100644 index 0000000..53a7ee7 --- /dev/null +++ b/docs/making_a_library.md @@ -0,0 +1,108 @@ +### Making a library +in the same way we can execute lua from C, we also can generate dll/so to be acessible by lua as a library + +~~~c + +#include "LuaCEmbedOne.c" + +LuaCEmbedNamespace lua_n; + + + LuaCEmbedResponse *add_cfunc(LuaCEmbed *args){ + double first_num = lua_n.args.get_double(args,0); + double second_num = lua_n.args.get_double(args,1); + + if(lua_n.has_errors(args)){ + char *message = lua_n.get_error_message(args); + return lua_n.response.send_error(message); + } + double result = first_num + second_num; + return lua_n.response.send_double(result); +} +LuaCEmbedResponse *sub_cfunc(LuaCEmbed *args){ + double first_num = lua_n.args.get_double(args,0); + double second_num = lua_n.args.get_double(args,1); + + if(lua_n.has_errors(args)){ + char *message = lua_n.get_error_message(args); + return lua_n.response.send_error(message); + } + double result = first_num - second_num; + return lua_n.response.send_double(result); +} +int luaopen_my_lib(lua_State *state){ + lua_n = newLuaCEmbedNamespace(); + //functions will be only assescible by the required reciver + LuaCEmbed * l = lua_n.newLuaLib(state); + lua_n.add_callback(l,"add",add_cfunc); + lua_n.add_callback(l,"sub",sub_cfunc); + +return lua_n.perform(l); + +} +~~~ +Compile the code with: +~~~shell +gcc -shared -fpic -o my_lib.so main.c +~~~ + +than you can call into your lua code + +~~~lua + +local lib = require("my_lib") + +x = lib.add(10,20) +y = lib.sub(20,5) +print("x",x) +print("y",y) + +~~~ + + + + + +### Lib Props +you can determine library props into your lib: +~~~c + + +#include "LuaCEmbedOne.c" + +LuaCEmbedNamespace lua_n; + + + +int luaopen_my_lib(lua_State *state){ + lua_n = newLuaCEmbedNamespace(); + //functions will be only assescible by the required reciver + bool set_functions_as_public = false; + LuaCEmbed * l = lua_n.newLuaLib(state,set_functions_as_public); + lua_n.set_long_lib_prop(l,"long_prop", 30); + lua_n.set_double_lib_prop(l,"double_prop",50.5); + lua_n.set_bool_lib_prop(l,"bool_prop",true); + lua_n.set_string_lib_prop(l,"string_prop","test"); + LuaCEmbedTable * t = lua_n.tables.new_anonymous_table(l); + lua_n.tables.set_string_prop(t,"test","test_message"); + lua_n.set_table_lib_prop(l,"table_prop",t); + + return lua_n.perform(l); + +} +~~~ + +testing with lua: + +~~~lua + +lib = require("my_lib") +print("long_prop",lib.long_prop) +print("double_prop",lib.double_prop) +print("bool_prop",lib.bool_prop) +print("string_prop",lib.string_prop) +print("table_prop",lib.table_prop) +print("table_prop internal",lib.table_prop.test) + + +~~~ diff --git a/tests/main_test/evaluation/T_memory_usage/exec.c b/docs/memory_usage.md similarity index 51% rename from tests/main_test/evaluation/T_memory_usage/exec.c rename to docs/memory_usage.md index c0798b6..6bcf77a 100644 --- a/tests/main_test/evaluation/T_memory_usage/exec.c +++ b/docs/memory_usage.md @@ -1,4 +1,15 @@ -#include "../../../LuaCEmbed.h" + +### Memory usage +by using the method **set_memory_limit** you can control the max ram usage of lua, the default its 100mb +

NOTE THAT EXTRA MEMORY ALOCATED OUTSIDE CALLBACKS OR EVALUATIONS ARE CONSIDER UNPROTECTED GEHAVIOR +AND IT WILL KILL THE APPLICATION + +
+ + + +```c +#include "LuaCEmbedOne.c" LuaCEmbedNamespace lua_n; @@ -19,4 +30,14 @@ int main(int argc, char *argv[]){ lua_n.free(l); return 0; -} \ No newline at end of file +} +``` + + +It will produce: + +```bash +error: not enough memory + +``` + diff --git a/tests/main_test/evaluation/T_basic_evaluation_with_loaded_libs/exec.c b/docs/native_functions.md similarity index 57% rename from tests/main_test/evaluation/T_basic_evaluation_with_loaded_libs/exec.c rename to docs/native_functions.md index f4073ff..2075ff5 100644 --- a/tests/main_test/evaluation/T_basic_evaluation_with_loaded_libs/exec.c +++ b/docs/native_functions.md @@ -1,4 +1,12 @@ -#include "../../../LuaCEmbed.h" + +### Runting Native functions +

+NEVER CALL THE FUNCTION 'load_native_libs' IF YOU DON TRUST IN THE USER +

+You can load native lua functions by the usage of **load_native_libs** function + +```c +#include "LuaCEmbedOne.c" LuaCEmbedNamespace lua_n; int main(int argc, char *argv[]){ @@ -15,4 +23,12 @@ int main(int argc, char *argv[]){ lua_n.free(l); return 0; -} \ No newline at end of file +} +``` + + +It will produce: +```bash +hello from lua + +``` diff --git a/docs/table_handling.md b/docs/table_handling.md new file mode 100644 index 0000000..778e671 --- /dev/null +++ b/docs/table_handling.md @@ -0,0 +1,144 @@ +### Retrieving Table Properties + +```c +#include "LuaCEmbedOne.c" +LuaCEmbedNamespace lua_n; + +LuaCEmbedResponse *show_table(LuaCEmbed *args) { + LuaCEmbedTable *t1 = lua_n.args.get_table(args, 0); + if (lua_n.has_errors(args)) { + char *message = lua_n.get_error_message(args); + return lua_n.response.send_error(message); + } + + char *name = lua_n.tables.get_string_prop(t1, "name"); + long age = lua_n.tables.get_long_prop(t1, "age"); + + if (lua_n.has_errors(args)) { + char *message = lua_n.get_error_message(args); + return lua_n.response.send_error(message); + } + + printf("name : %s\n", name); + printf("age: %ld\n", age); + + return NULL; +} +``` + +**Output:** +```bash +name : mateus +age: 27 +``` + +### Retrieving Sub Tables + +```c +#include "LuaCEmbedOne.c" +LuaCEmbedNamespace lua_n; + +LuaCEmbedResponse *show_table(LuaCEmbed *args) { + LuaCEmbedTable *t1 = lua_n.args.get_table(args, 0); + if (lua_n.has_errors(args)) { + char *message = lua_n.get_error_message(args); + return lua_n.response.send_error(message); + } + + long size = lua_n.tables.get_size(t1); + for (int i = 0; i < size; i++) { + LuaCEmbedTable *current = lua_n.tables.get_sub_table_by_index(t1, i); + char *name = lua_n.tables.get_string_prop(current, "name"); + long age = lua_n.tables.get_long_prop(current, "age"); + + if (lua_n.has_errors(args)) { + char *message = lua_n.get_error_message(args); + return lua_n.response.send_error(message); + } + + printf("name : %s\n", name); + printf("age: %ld\n", age); + printf("------------------------------------------\n"); + } + + return NULL; +} +``` + +**Output:** +```bash +name : mateus +age: 27 +------------------------------------------ +name : john +age: 30 +------------------------------------------ +``` + +### Iterating Over Table + +```c +#include "LuaCEmbedOne.c" +LuaCEmbedNamespace lua_n; + +LuaCEmbedResponse *show_table(LuaCEmbed *args) { + LuaCEmbedTable *t1 = lua_n.args.get_table(args, 0); + if (lua_n.has_errors(args)) { + char *message = lua_n.get_error_message(args); + return lua_n.response.send_error(message); + } + long size = lua_n.tables.get_size(t1); + for (int i = 0; i < size; i++) { + printf("index: %d\n", i); + const char *key = "Not provided"; + if (lua_n.tables.has_key(t1, i)) { + key = lua_n.tables.get_key_by_index(t1, i); + } + printf("key: %s\n", key); + + int type = lua_n.tables.get_type_by_index(t1, i); + printf("type %s\n", lua_n.convert_arg_code(type)); + + if (type == lua_n.types.NUMBER) { + double value = lua_n.tables.get_double_by_index(t1, i); + printf("value: %lf\n", value); + } + + if (type == lua_n.types.STRING) { + char *value = lua_n.tables.get_string_by_index(t1, i); + printf("value: %s\n", value); + } + + if (type == lua_n.types.BOOL) { + bool value = lua_n.tables.get_bool_by_index(t1, i); + printf("value: %d\n", value); + } + printf("------------------------------------------\n"); + } + return NULL; +} +``` + +**Output:** +```bash +index: 0 +key: Not provided +type string +value: indexable random string +------------------------------------------ +index: 1 +key: single +type boolean +value: 1 +------------------------------------------ +index: 2 +key: name +type string +value: Mateus +------------------------------------------ +index: 3 +key: age +type number +value: 27.000000 +------------------------------------------ +``` \ No newline at end of file diff --git a/docs/table_setting.md b/docs/table_setting.md new file mode 100644 index 0000000..1187250 --- /dev/null +++ b/docs/table_setting.md @@ -0,0 +1,100 @@ +### Setting Basic Properties + +```c +#include "LuaCEmbedOne.c" +LuaCEmbedNamespace lua_n; + +LuaCEmbedResponse *create_table(LuaCEmbed *args) { + LuaCEmbedTable *custom_table = lua_n.tables.new_anonymous_table(args); + lua_n.tables.set_string_prop(custom_table, "name", "Mateus"); + lua_n.tables.set_long_prop(custom_table, "age", 27); + lua_n.tables.set_double_prop(custom_table, "height", 1.82); + lua_n.tables.set_bool_prop(custom_table, "married", false); + return lua_n.response.send_table(custom_table); +} +``` + +**Output:** +```bash +name: Mateus +age: 27 +height: 1.820000 +married 0 +``` + +### Setting Methods + +```c +#include "LuaCEmbedOne.c" +LuaCEmbedNamespace lua_n; + +LuaCEmbedResponse *describe(LuaCEmbedTable *self, LuaCEmbed *args) { + char *name = lua_n.tables.get_string_prop(self, "name"); + long age = lua_n.tables.get_long_prop(self, "age"); + double height = lua_n.tables.get_double_prop(self, "height"); + bool married = lua_n.tables.get_bool_prop(self, "married"); + printf("person description:\n"); + printf("name: %s\n", name); + printf("age: %ld\n", age); + printf("height: %lf\n", height); + printf("married %d\n", married); + return NULL; +} + +LuaCEmbedResponse *create_table(LuaCEmbed *args) { + LuaCEmbedTable *custom_table = lua_n.tables.new_anonymous_table(args); + lua_n.tables.set_string_prop(custom_table, "name", "Mateus"); + lua_n.tables.set_long_prop(custom_table, "age", 27); + lua_n.tables.set_double_prop(custom_table, "height", 1.82); + lua_n.tables.set_bool_prop(custom_table, "married", false); + lua_n.tables.set_method(custom_table, "describe", describe); + return lua_n.response.send_table(custom_table); +} +``` + +**Output:** +```bash +person description: +name: Mateus +age: 27 +height: 1.820000 +married 0 +``` + +### Setting Meta Methods + +```c +#include "LuaCEmbedOne.c" +LuaCEmbedNamespace lua_n; + +LuaCEmbedResponse *index_callback(LuaCEmbedTable *self, LuaCEmbed *args) { + int value_type = lua_n.args.get_type(args, 1); + + if (value_type == lua_n.types.NUMBER) { + printf("index-value: %lf\n", lua_n.args.get_double(args, 1)); + } else if (value_type == lua_n.types.STRING) { + printf("index-value: %s\n", lua_n.args.get_str(args, 1)); + } + + return NULL; +} + +LuaCEmbedResponse *deletion_callback(LuaCEmbedTable *self, LuaCEmbed *args) { + printf("called the delete function\n"); + return NULL; +} + +LuaCEmbedResponse *create_table(LuaCEmbed *args) { + LuaCEmbedTable *custom_table = lua_n.tables.new_anonymous_table(args); + lua_n.tables.set_method(custom_table, "__gc", deletion_callback); + lua_n.tables.set_method(custom_table, "__index", index_callback); + return lua_n.response.send_table(custom_table); +} +``` + +**Output:** +```bash +index-value: 10.000000 +index-value: sss +called the delete function +``` \ No newline at end of file diff --git a/docs/table_size.md b/docs/table_size.md new file mode 100644 index 0000000..4efbca4 --- /dev/null +++ b/docs/table_size.md @@ -0,0 +1,30 @@ +### Table Size + +It's also possible to determine the size of a table by using the **get_evaluation_size** method + +```c +#include "LuaCEmbedOne.c" +LuaCEmbedNamespace lua_n; + +int main(int argc, char *argv[]) { + + lua_n = newLuaCEmbedNamespace(); + LuaCEmbed *l = lua_n.newLuaEvaluation(); + lua_n.evaluate(l, "r = {1,2,3}"); + + long result = lua_n.get_evaluation_size(l, "r"); + printf("size: %ld\n", result); + if (lua_n.has_errors(l)) { + printf("error: %s\n", lua_n.get_error_message(l)); + } + lua_n.free(l); + + return 0; +} +``` + +**Output:** + +```bash +size: 3 +``` \ No newline at end of file diff --git a/tests/main_test/evaluation/T_timeout/exec.c b/docs/timeout.md similarity index 78% rename from tests/main_test/evaluation/T_timeout/exec.c rename to docs/timeout.md index 66ec45c..88aa23b 100644 --- a/tests/main_test/evaluation/T_timeout/exec.c +++ b/docs/timeout.md @@ -1,4 +1,12 @@ -#include "../../../LuaCEmbed.h" + + + +### Timeout +You can set timeout to your functions, by using the timeout method: + + +```c +#include "LuaCEmbedOne.c" LuaCEmbedNamespace lua_n; @@ -33,4 +41,14 @@ int main(int argc, char *argv[]){ lua_n.free(l); return 0; -} \ No newline at end of file +} +``` + + +It will produce: + +```bash +error: timeout error + executed after timeout error + +``` diff --git a/extra/INTERNAL.md b/extra/INTERNAL.md new file mode 100644 index 0000000..b99fe60 --- /dev/null +++ b/extra/INTERNAL.md @@ -0,0 +1,676 @@ + +LuaCEmbed it's a lua wrapper to allow easy interoperability beetwen C and Lua +providing any methods to control Lua Code from C + +

+DESPITE BEING 100% COVERED BY TESTS, THIS LIBRARY IS NOT CONSIDERED PRODUCTION READY YET, USE RESPONSIBLY +

+ + +{HASHTAG}{HASHTAG}{HASHTAG} Usefull Links + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Lua Project +[Lua Project](https://www.lua.org/) + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Oui WebSite +[Link to Web Site](oui.tec.br) + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Download Link +[Click Here to Download](https://github.com/OUIsolutions/LuaCEmbed/releases/download/v0.75/LuaCEmbed.h) + + +{HASHTAG}{HASHTAG}{HASHTAG} Instalation +Like all Oui librarys, the LuaCEmbed addopt the ideia of single file lib, so you just need to copy the **LuaCEmbed.h** file +into your project, and compile with gcc/clang +{create_c_example("exemples/evaluation/hello_world.c")} + + +{HASHTAG} Bulding the Project +if you want to build the project from scracth, you will need to have [Darwin](https://github.com/OUIsolutions/Darwin) +on version **0.018** dowloaded,then you can call: + +~~~shel +darwin run_blueprint build/ --mode folder --amalgamate --zip --silverchain_organize +~~~ + +These will create all the outputs into the release folder. +If you want to make all the tests and recreate the examples and readme , call: + +~~~shell +darwin run_blueprint build/ --mode folder a --amalgamate --zip --silverchain_organize --test --create_examples --create_readme + +~~~ + + + +It will produce: + +{create_c_example("tests/main_test/evaluation/T_hello_world/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG} Runting Native functions +

+NEVER CALL THE FUNCTION 'load_native_libs' IF YOU DON TRUST IN THE USER +

+You can load native lua functions by the usage of **load_native_libs** function + +{create_c_example("exemples/evaluation/basic_evaluation_with_loaded_libs.c")} + + +It will produce: +{create_c_example("tests/main_test/evaluation/T_basic_evaluation_with_loaded_libs/expected.txt")} + + + +{HASHTAG}{HASHTAG}{HASHTAG} Making a library +in the same way we can execute lua from C, we also can generate dll/so to be acessible by lua as a library + +~~~c + +{HASHTAG}include "LuaCEmbed.h" + +LuaCEmbedNamespace lua_n; + + + LuaCEmbedResponse *add_cfunc(LuaCEmbed *args)#{ + double first_num = lua_n.args.get_double(args,0); + double second_num = lua_n.args.get_double(args,1); + + if(lua_n.has_errors(args))#{ + char *message = lua_n.get_error_message(args); + return lua_n.response.send_error(message); + }#/ + double result = first_num + second_num; + return lua_n.response.send_double(result); +}#/ +LuaCEmbedResponse *sub_cfunc(LuaCEmbed *args)#{ + double first_num = lua_n.args.get_double(args,0); + double second_num = lua_n.args.get_double(args,1); + + if(lua_n.has_errors(args))#{ + char *message = lua_n.get_error_message(args); + return lua_n.response.send_error(message); + }#/ + double result = first_num - second_num; + return lua_n.response.send_double(result); +}#/ +int luaopen_my_lib(lua_State *state)#{ + lua_n = newLuaCEmbedNamespace(); + //functions will be only assescible by the required reciver + LuaCEmbed * l = lua_n.newLuaLib(state); + lua_n.add_callback(l,"add",add_cfunc); + lua_n.add_callback(l,"sub",sub_cfunc); + +return lua_n.perform(l); + +}#/ +~~~ +Compile the code with: +~~~shell +gcc -Wall -shared -fpic -o my_lib.so main.c +~~~ + + +than you can call into your lua code + +~~~lua + +local lib = require("my_lib") + +x = lib.add(10,20) +y = lib.sub(20,5) +print("x",x) +print("y",y) + +~~~ +{HASHTAG}{HASHTAG}{HASHTAG} Lib Props +you can determine library props into your lib: +~~~c + + +{HASHTAG}include "LuaCEmbed.h" + +LuaCEmbedNamespace lua_n; + + + +int luaopen_my_lib(lua_State *state)#{ + lua_n = newLuaCEmbedNamespace(); + //functions will be only assescible by the required reciver + bool set_functions_as_public = false; + LuaCEmbed * l = lua_n.newLuaLib(state,set_functions_as_public); + lua_n.set_long_lib_prop(l,"long_prop", 30); + lua_n.set_double_lib_prop(l,"double_prop",50.5); + lua_n.set_bool_lib_prop(l,"bool_prop",true); + lua_n.set_string_lib_prop(l,"string_prop","test"); + LuaCEmbedTable * t = lua_n.tables.new_anonymous_table(l); + lua_n.tables.set_string_prop(t,"test","test_message"); + lua_n.set_table_lib_prop(l,"table_prop",t); + + return lua_n.perform(l); + +}#/ +~~~ + +testing with lua: + +~~~lua + +lib = require("my_lib") +print("long_prop",lib.long_prop) +print("double_prop",lib.double_prop) +print("bool_prop",lib.bool_prop) +print("string_prop",lib.string_prop) +print("table_prop",lib.table_prop) +print("table_prop internal",lib.table_prop.test) + + +~~~ + + +{HASHTAG}{HASHTAG}{HASHTAG} Evaluation +To evaluate Lua Code from C, you can use all the evaluation methods, provided by the lib + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Evaluating string + +{create_c_example("exemples/evaluation/string_evalation.c")} + + +It will produce: + +{create_c_example("tests/main_test/evaluation/T_string_evalation/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Evaluating a file +It's also possible to evaluate a file by using the **evaluete_file** method + +{create_c_example("exemples/evaluation/file_evaluation.c")} + + +It will produce: + +{create_c_example("tests/main_test/evaluation/T_file_evaluation/expected.txt")} + + + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Type Evaluation +You can determine the type of the evaluation by using the **get_evaluation_type** method +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Evaluating Long + +{create_c_example("exemples/evaluation/type_evaluation.c")} + + + +It will produce: + +{create_c_example("tests/main_test/evaluation/T_type_evaluation/expected.txt")} + + + + +{HASHTAG}{HASHTAG}{HASHTAG} Table Size +Its also possible to determine the size of a table by using the **get_evaluation_size** method + +{create_c_example("exemples/evaluation/table_size.c")} + + + +It will produce: + +{create_c_example("tests/main_test/evaluation/T_table_size/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Evaluating Long + +{create_c_example("exemples/evaluation/long_return.c")} + + +It will produce: + +{create_c_example("tests/main_test/evaluation/T_long_return/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Evaluating Double + +{create_c_example("exemples/evaluation/double_evaluation.c")} + + + +It will produce: + +{create_c_example("tests/main_test/evaluation/T_double_evaluation/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Evaluating Bool + +{create_c_example("exemples/evaluation/bool_evaluation.c")} + + +It will produce: + +{create_c_example("tests/main_test/evaluation/T_bool_evaluation/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG} Timeout +You can set timeout to your functions, by using the timeout method: + + +{create_c_example("exemples/evaluation/timeout.c")} + + +It will produce: + +{create_c_example("tests/main_test/evaluation/T_timeout/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG} Memory usage +by using the method **set_memory_limit** you can control the max ram usage of lua, the default its 100mb +
NOTE THAT EXTRA MEMORY ALOCATED OUTSIDE CALLBACKS OR EVALUATIONS ARE CONSIDER UNPROTECTED GEHAVIOR +AND IT WILL KILL THE APPLICATION + +
+ + + +{create_c_example("exemples/evaluation/memory_usage.c")} + + +It will produce: + +{create_c_example("tests/main_test/evaluation/T_memory_usage/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG} Callbacks +Callbacks i'ts a way to make c functions assesible in lua code, this it's the most basic callback: + +{create_c_example("exemples/calbacks/basic_callback.c")} + + +It will produce: + +{create_c_example("tests/main_test/calbacks/T_basic_callback/expected.txt")} + + + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} CallBack args +you can accept callback arguments into your function,check their types, and make operations with them. + +{create_c_example("exemples/calbacks/args_retriving.c")} + + +It will produce: + +{create_c_example("tests/main_test/calbacks/T_args_retriving/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Index type +The lua native language index first elements in position 1, authogth LuaCEmbed use the C style for indexation, starting at +0, but these can be easly reverted with the int macro **LUA_CEMBED_INDEX_DIF** + +{create_c_example("exemples/calbacks/args_retriving_balanced.c")} + + + +It will produce: + +{create_c_example("tests/main_test/calbacks/T_args_retriving_balanced/expected.txt")} + + + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Creating a basic print function + +in these example, we are creating an 'print' function ,to allow print values + +{create_c_example("exemples/calbacks/print_func.c")} + + +It will produce: + +{create_c_example("tests/main_test/calbacks/T_print_func/expected.txt")} + + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Evaluating arguments + +it's also possible to modify callbacks by lua code , by using the evaluation args mechanism. + +{create_c_example("exemples/calbacks/evaluating_args.c")} + + +It will produce: + +{create_c_example("tests/main_test/calbacks/T_evaluating_args/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Calling args callback + +if you recive a lambda as argument , you can run the function with rguments and retriving its result + +{create_c_example("exemples/calbacks/args_lambda.c")} + + +It will produce: + +{create_c_example("tests/main_test/calbacks/T_args_lambda/expected.txt")} + + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Table Arguments +you can control table arguments easly with the **get_table** method, where you can retrive a +**LuaCEmbedTable** object + + +{create_c_example("exemples/calbacks/getting_table_args.c")} + + +It will produce: + +{create_c_example("tests/main_test/calbacks/T_getting_table_args/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG} Callbacks Response + +You also can return values or errors, with the **response** methods + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Returning a Long + + +{create_c_example("exemples/calbacks/return_long.c")} + + +It will produce: + +{create_c_example("tests/main_test/calbacks/T_return_long/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Returning a Double + + +{create_c_example("exemples/calbacks/return_double.c")} + + +It will produce: + +{create_c_example("tests/main_test/calbacks/T_return_double/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Returning a String + + +{create_c_example("exemples/calbacks/return_string.c")} + + +It will produce: + +{create_c_example("tests/main_test/calbacks/T_return_string/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Returning a Bool + + +{create_c_example("exemples/calbacks/return_bool.c")} + + +It will produce: + +{create_c_example("tests/main_test/calbacks/T_return_bool/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Returning a Table + + +{create_c_example("exemples/calbacks/return_table.c")} + + +It will produce: + +{create_c_example("tests/main_test/calbacks/T_return_table/expected.txt")} + + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Returning multi return + +You also can return multi values at once with the **return_multi_return** method + +{create_c_example("exemples/calbacks/return_multi_return.c")} + + + +It will produce: + +{create_c_example("tests/main_test/calbacks/T_return_multi_return/expected.txt")} + + +you can return multiple values using the multi return method + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Returning a a Error +you can "raise" a error by returning a error in the function + +{create_c_example("exemples/calbacks/return_error.c")} + + +It will produce: + +{create_c_example("tests/main_test/calbacks/T_return_error/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG} Table Handling +you can easly handle tables, with the getters and setters methods + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Retriving table props + +{create_c_example("exemples/table_handle/retriving_props.c")} + + +It will produce: + +{create_c_example("tests/main_test/table_handle/T_retriving_props/expected.txt")} + + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Retriving Sub Tables + + +{create_c_example("exemples/table_handle/retriving_sub_table.c")} + + +It will produce: + +{create_c_example("tests/main_test/table_handle/S_retriving_sub_table/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Iterating over table + +{create_c_example("exemples/table_handle/iterating_over_table.c")} + + +It will produce: + +{create_c_example("tests/main_test/table_handle/S_iterating_over_table/expected.txt")} + + + +{HASHTAG}{HASHTAG}{HASHTAG} Table setting +its possible to set values of table in a lot of different ways + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Seting basic Props +{create_c_example("exemples/table_handle/setting_props.c")} + + +It will produce: + +{create_c_example("tests/main_test/table_handle/T_setting_props/expected.txt")} + + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Setting Methods +you also can set a method to a table, passing a callback function for it + +{create_c_example("exemples/table_handle/setting_method.c")} + + +It will produce: + +{create_c_example("tests/main_test/table_handle/T_setting_method/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Setting Meta Methods +Meta methods like **__gc** or **__index** works fine tool + +{create_c_example("exemples/table_handle/meta_method.c")} + + +It will produce: + +{create_c_example("tests/main_test/table_handle/T_meta_method/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG} Full Object construction + +in these example we are creating a **full class ** of a person + +{create_c_example("exemples/table_handle/full_person.c")} + + +It will produce: + +{create_c_example("tests/main_test/table_handle/T_full_person/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG} Appending Props +you also can work with arrays , by using the **append** methods + +{create_c_example("exemples/table_handle/appending_props.c")} + + +It will produce: + +{create_c_example("tests/main_test/table_handle/T_appending_props/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG} Setting sub tables +sub tables can be constructed, setted and autocreated + +{create_c_example("exemples/table_handle/setting_sub_table.c")} + + +It will produce: + +{create_c_example("tests/main_test/table_handle/T_setting_sub_table/expected.txt")} + + + +{HASHTAG}{HASHTAG}{HASHTAG} Globals +Glbals can be fully handled by the LuaCEmbed Api + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Retriving Globals + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Getting a global string + +{create_c_example("exemples/globals/get_string_global.c")} + + +It will produce: + +{create_c_example("tests/main_test/globals/T_get_string_global/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Getting a global bool + +{create_c_example("exemples/globals/get_bool_global.c")} + + +It will produce: + + +{create_c_example("tests/main_test/globals/T_get_bool_global/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Getting a double global + +{create_c_example("exemples/globals/get_double_global.c")} + + +It will produce: + +{create_c_example("tests/main_test/globals/T_get_double_global/expected.txt")} + + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Getting a long global + +{create_c_example("exemples/globals/get_long_global.c")} + + +It will produce: + +{create_c_example("tests/main_test/globals/T_get_long_global/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Getting a type global +{create_c_example("exemples/globals/get_type.c")} + + +It will produce: + +{create_c_example("tests/main_test/globals/T_get_type/expected.txt")} + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Getting a table +Tables are by default auto created, so yoou can just use the **get_table_auto_creating** method +{create_c_example("exemples/globals/get_table_global.c")} + +It will produce: + +{create_c_example("tests/main_test/globals/T_get_table_global/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG} Setting Globals + +Its also possible to set global variables + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Set Long +{create_c_example("exemples/globals/set_long.c")} + +It will produce + +{create_c_example("tests/main_test/globals/T_set_long/expected.txt")} + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Set Double +{create_c_example("exemples/globals/set_double.c")} + +It will produce + +{create_c_example("tests/main_test/globals/T_set_double/expected.txt")} + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Set string +{create_c_example("exemples/globals/set_string.c")} + + +It will produce + +{create_c_example("tests/main_test/globals/T_set_string/expected.txt")} + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Set Bool +{create_c_example("exemples/globals/set_bool.c")} + +It will produce + +{create_c_example("tests/main_test/globals/T_set_bool/expected.txt")} + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} New Table +its possible to create a new global table, the vallues will be automaticaly setted + + +{HASHTAG}{HASHTAG}{HASHTAG}{HASHTAG} Set Bool +{create_c_example("exemples/globals/set_table.c")} + +It will produce + +{create_c_example("tests/main_test/globals/T_set_table/expected.txt")} diff --git a/output_test b/output_test deleted file mode 100644 index 47e190f..0000000 --- a/output_test +++ /dev/null @@ -1,15 +0,0 @@ -==9003== Memcheck, a memory error detector -==9003== Copyright (C) 2002-2024, and GNU GPL'd, by Julian Seward et al. -==9003== Using Valgrind-3.23.0 and LibVEX; rerun with -h for copyright info -==9003== Command: ./tests/main_test/table_handle/T_setting_sub_table/exec.out -==9003== Parent PID: 6703 -==9003== -==9003== -==9003== HEAP SUMMARY: -==9003== in use at exit: 0 bytes in 0 blocks -==9003== total heap usage: 143 allocs, 143 frees, 12,949 bytes allocated -==9003== -==9003== All heap blocks were freed -- no leaks are possible -==9003== -==9003== For lists of detected and suppressed errors, rerun with: -s -==9003== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 0 from 0) diff --git a/pre_build.sh b/pre_build.sh deleted file mode 100644 index b3d1ee4..0000000 --- a/pre_build.sh +++ /dev/null @@ -1,6 +0,0 @@ -cd build -gcc build/main.c -o build.o -./build.o -mv final.out ../build.out -mv final.exe ../build.exe -cd .. diff --git a/silverchain.exe b/silverchain.exe deleted file mode 100755 index 7134daf..0000000 Binary files a/silverchain.exe and /dev/null differ diff --git a/silverchain.out b/silverchain.out deleted file mode 100755 index e5680c4..0000000 Binary files a/silverchain.out and /dev/null differ diff --git a/src/LuaCEmbed/args/args_error/fdeclare.args_error.h b/src/LuaCEmbed/args/args_error/fdeclare.args_error.h index bdf2b7e..7f37428 100644 --- a/src/LuaCEmbed/args/args_error/fdeclare.args_error.h +++ b/src/LuaCEmbed/args/args_error/fdeclare.args_error.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../imports/imports.typesD.h" -//silver_chain_scope_end int LuaCEmbed_ensure_arg_exist(LuaCEmbed *self, private_lua_cembed_incremented_arg index); diff --git a/src/LuaCEmbed/args/args_error/fdefine.args_error.c b/src/LuaCEmbed/args/args_error/fdefine.args_error.c index cf652d9..54659c6 100644 --- a/src/LuaCEmbed/args/args_error/fdefine.args_error.c +++ b/src/LuaCEmbed/args/args_error/fdefine.args_error.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../imports/imports.fdeclare.h" -//silver_chain_scope_end int LuaCEmbed_ensure_arg_exist(LuaCEmbed *self, private_lua_cembed_incremented_arg index){ diff --git a/src/LuaCEmbed/args/basic/fdeclare.basic.h b/src/LuaCEmbed/args/basic/fdeclare.basic.h index 9fb8476..741ebdc 100644 --- a/src/LuaCEmbed/args/basic/fdeclare.basic.h +++ b/src/LuaCEmbed/args/basic/fdeclare.basic.h @@ -1,28 +1,23 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../imports/imports.typesD.h" -//silver_chain_scope_end -int privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, int index); +lua_Integer privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, lua_Integer index); -int LuaCEmbed_get_total_args(LuaCEmbed *self); +lua_Integer LuaCEmbed_get_total_args(LuaCEmbed *self); -int LuaCEmbed_get_arg_type(LuaCEmbed *self,int index); +lua_Integer LuaCEmbed_get_arg_type(LuaCEmbed *self,lua_Integer index); -long long LuaCEmbed_get_long_arg(LuaCEmbed *self, int index); +lua_Integer LuaCEmbed_get_long_arg(LuaCEmbed *self, lua_Integer index); -double LuaCEmbed_get_double_arg(LuaCEmbed *self, int index); +double LuaCEmbed_get_double_arg(LuaCEmbed *self, lua_Integer index); -bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, int index); +bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, lua_Integer index); -char * LuaCEmbed_get_str_arg(LuaCEmbed *self, int index); +char * LuaCEmbed_get_str_arg(LuaCEmbed *self, lua_Integer index); -char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,long *size, int index); +char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,lua_Integer *size, lua_Integer index); -LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,int index); - -LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call, int total_returns); +LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,lua_Integer index); +LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, lua_Integer index, LuaCEmbedTable *args_to_call, lua_Integer total_returns); diff --git a/src/LuaCEmbed/args/basic/fdefine.basic.c b/src/LuaCEmbed/args/basic/fdefine.basic.c index 00213fb..d2c63b8 100644 --- a/src/LuaCEmbed/args/basic/fdefine.basic.c +++ b/src/LuaCEmbed/args/basic/fdefine.basic.c @@ -1,12 +1,8 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../imports/imports.fdeclare.h" -//silver_chain_scope_end -int privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, int index){ +lua_Integer privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, lua_Integer index){ PRIVATE_LUA_CEMBED_PROTECT_NUM - long formatted_index = index + LUA_CEMBED_INDEX_DIF; + int formatted_index = index + LUA_CEMBED_INDEX_DIF; if(formatted_index > self->total_args){ privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,formatted_index,self->current_function); @@ -26,15 +22,15 @@ int privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, int index){ return LUA_OK; } -int LuaCEmbed_get_total_args(LuaCEmbed *self){ +lua_Integer LuaCEmbed_get_total_args(LuaCEmbed *self){ return self->total_args; } -int LuaCEmbed_get_arg_type(LuaCEmbed *self,int index){ +lua_Integer LuaCEmbed_get_arg_type(LuaCEmbed *self,lua_Integer index){ - long formatted_index = index + LUA_CEMBED_INDEX_DIF; + int formatted_index = index + LUA_CEMBED_INDEX_DIF; if(formatted_index > self->total_args){ return LUA_CEMBED_NIL; @@ -49,52 +45,52 @@ int LuaCEmbed_get_arg_type(LuaCEmbed *self,int index){ } -long long LuaCEmbed_get_long_arg(LuaCEmbed *self, int index){ +lua_Integer LuaCEmbed_get_long_arg(LuaCEmbed *self, lua_Integer index){ PRIVATE_LUA_CEMBED_PROTECT_NUM if(privateLuaCEmbed_put_arg_on_top(self,index)){ PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; + return (lua_Integer )LUA_CEMBED_NOT_FOUND; } if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_NUMBER)){ PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; + return (lua_Integer )LUA_CEMBED_NOT_FOUND; } - long long result = (long long)lua_tonumber(self->state,-1); + lua_Integer result = lua_tointeger(self->state,-1); PRIVATE_LUA_CEMBED_CLEAR_STACK return result; } -double LuaCEmbed_get_double_arg(LuaCEmbed *self, int index){ +double LuaCEmbed_get_double_arg(LuaCEmbed *self, lua_Integer index){ PRIVATE_LUA_CEMBED_PROTECT_NUM if(privateLuaCEmbed_put_arg_on_top(self,index)){ PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; + return LUA_CEMBED_NOT_FOUND; } if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_NUMBER)){ PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; + return LUA_CEMBED_NOT_FOUND; } double result = lua_tonumber(self->state,-1); PRIVATE_LUA_CEMBED_CLEAR_STACK return result; } -bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, int index){ +bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, lua_Integer index){ PRIVATE_LUA_CEMBED_PROTECT_BOOL if(privateLuaCEmbed_put_arg_on_top(self,index)){ PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; + return LUA_CEMBED_NOT_FOUND; } if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_BOOL)){ PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; + return LUA_CEMBED_NOT_FOUND; } bool result = lua_toboolean(self->state,-1); PRIVATE_LUA_CEMBED_CLEAR_STACK @@ -102,7 +98,7 @@ bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, int index){ } -char * LuaCEmbed_get_str_arg(LuaCEmbed *self, int index){ +char * LuaCEmbed_get_str_arg(LuaCEmbed *self, lua_Integer index){ PRIVATE_LUA_CEMBED_PROTECT_NULL PRIVATE_LUA_CEMBED_CLEAR_STACK @@ -118,7 +114,7 @@ char * LuaCEmbed_get_str_arg(LuaCEmbed *self, int index){ PRIVATE_LUA_CEMBED_CLEAR_STACK return result; } -char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,long *size, int index){ +char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,lua_Integer *size, lua_Integer index){ PRIVATE_LUA_CEMBED_PROTECT_NULL PRIVATE_LUA_CEMBED_CLEAR_STACK @@ -135,7 +131,7 @@ char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,long *size, int index){ return result; } -LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,int index){ +LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,lua_Integer index){ PRIVATE_LUA_CEMBED_PROTECT_NULL if(privateLuaCEmbed_put_arg_on_top(self,index)){ @@ -156,9 +152,9 @@ LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,int index){ } -LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call, int total_returns){ +LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, lua_Integer index, LuaCEmbedTable *args_to_call, lua_Integer total_returns){ - long formatted_index = index + LUA_CEMBED_INDEX_DIF; + int formatted_index = index + LUA_CEMBED_INDEX_DIF; char *formatted_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); if(privateLuaCEmbed_put_arg_on_top(self,index)){ @@ -208,4 +204,3 @@ LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, int index, LuaCEmbedT return result; } - diff --git a/src/LuaCEmbed/args/evaluation/fdeclare.evaluation.h b/src/LuaCEmbed/args/evaluation/fdeclare.evaluation.h index 862f2f6..fcf4f0b 100644 --- a/src/LuaCEmbed/args/evaluation/fdeclare.evaluation.h +++ b/src/LuaCEmbed/args/evaluation/fdeclare.evaluation.h @@ -1,24 +1,19 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../imports/imports.typesD.h" -//silver_chain_scope_end -int private_LuaCembed_run_code_with_args(LuaCEmbed *self,int index,const char *code,va_list args); +lua_Integer private_LuaCembed_run_code_with_args(LuaCEmbed *self,lua_Integer index,const char *code,va_list args); -int privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,int index,int expected_type); +lua_Integer privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,lua_Integer index,lua_Integer expected_type); -int LuaCEmbed_get_type_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); +lua_Integer LuaCEmbed_get_type_clojure_evalation(LuaCEmbed *self,lua_Integer index,const char *code,...); -int LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); +lua_Integer LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,lua_Integer index,const char *code,...); -long long LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); +lua_Integer LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,lua_Integer index,const char *code,...); -double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); +double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,lua_Integer index,const char *code,...); -bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); +bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,lua_Integer index,const char *code,...); +char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,lua_Integer index,const char *code,...); diff --git a/src/LuaCEmbed/args/evaluation/fdefine.evaluation.c b/src/LuaCEmbed/args/evaluation/fdefine.evaluation.c index 2c92335..49d59f6 100644 --- a/src/LuaCEmbed/args/evaluation/fdefine.evaluation.c +++ b/src/LuaCEmbed/args/evaluation/fdefine.evaluation.c @@ -1,11 +1,7 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../imports/imports.fdeclare.h" -//silver_chain_scope_end -int private_LuaCembed_run_code_with_args(LuaCEmbed *self,int index,const char *code,va_list args){ +lua_Integer private_LuaCembed_run_code_with_args(LuaCEmbed *self,lua_Integer index,const char *code,va_list args){ PRIVATE_LUA_CEMBED_PROTECT_NUM int formatted_index = index + LUA_CEMBED_INDEX_DIF; @@ -50,7 +46,7 @@ int private_LuaCembed_run_code_with_args(LuaCEmbed *self,int index,const char *c return LUA_CEMBED_OK; } -int privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,int index,int expected_type){ +lua_Integer privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,lua_Integer index,lua_Integer expected_type){ PRIVATE_LUA_CEMBED_PROTECT_NUM int actual_type = lua_type(self->state,-1); @@ -67,19 +63,19 @@ int privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,int index,int ex ); return LUA_CEMBED_GENERIC_ERROR; } -int LuaCEmbed_get_type_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ +lua_Integer LuaCEmbed_get_type_clojure_evalation(LuaCEmbed *self,lua_Integer index,const char *code,...){ PRIVATE_LUA_CEMBED_PROTECT_NUM va_list args; va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); + lua_Integer possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); va_end(args); if(possible_error){ return possible_error; } return lua_type(self->state,-1); } -int LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ +lua_Integer LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,lua_Integer index,const char *code,...){ PRIVATE_LUA_CEMBED_PROTECT_NUM va_list args; @@ -91,7 +87,7 @@ int LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,int index,const cha } return LUA_CEMBED_OK; } -long long LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ +lua_Integer LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,lua_Integer index,const char *code,...){ PRIVATE_LUA_CEMBED_PROTECT_NUM va_list args; @@ -104,12 +100,12 @@ long long LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,int index,con if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ return LUA_CEMBED_GENERIC_ERROR; } - return (long long) lua_tonumber(self->state,-1); + return lua_tointeger(self->state,-1); } -double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ +double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,lua_Integer index,const char *code,...){ PRIVATE_LUA_CEMBED_PROTECT_NUM va_list args; @@ -126,7 +122,7 @@ double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,int index,cons } -bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ +bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,lua_Integer index,const char *code,...){ PRIVATE_LUA_CEMBED_PROTECT_BOOL va_list args; va_start(args,code); @@ -142,11 +138,11 @@ bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,int index,const c } -char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ +char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,lua_Integer index,const char *code,...){ PRIVATE_LUA_CEMBED_PROTECT_NULL va_list args; va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); + lua_Integer possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); va_end(args); if(possible_error){ return NULL; @@ -157,4 +153,3 @@ char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,int index,const return (char*)lua_tostring(self->state,-1); } - diff --git a/src/LuaCEmbed/basic/fdeclare.basic.h b/src/LuaCEmbed/basic/fdeclare.basic.h index 809af75..8a9b77a 100644 --- a/src/LuaCEmbed/basic/fdeclare.basic.h +++ b/src/LuaCEmbed/basic/fdeclare.basic.h @@ -1,15 +1,10 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesD.h" -//silver_chain_scope_end LuaCEmbed * newLuaCEmbedEvaluation(); -int private_LuaCemb_internal_free(lua_State *L); void LuaCEmbed_load_lib_from_c(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name); @@ -17,16 +12,9 @@ void LuaCEmbed_load_native_libs(LuaCEmbed *self); void LuaCembed_set_delete_function(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)); -char * LuaCEmbed_get_error_message(LuaCEmbed *self); - - -bool LuaCEmbed_has_errors(LuaCEmbed *self); - -void LuaCEmbed_clear_errors(LuaCEmbed *self); void privateLuaCEmbd_get_field_protected(LuaCEmbed *self,const char *name); -void privateLuaCEmbed_raise_error_not_jumping(LuaCEmbed *self, const char *error, ...); void * privateLuaCEmbed_get_current_table_array(LuaCEmbed *self); @@ -41,5 +29,3 @@ void privata_LuaCEmbed_increment_stack_(LuaCEmbed *self); void privata_LuaCEmbed_decrement_stack(LuaCEmbed *self); void LuaCEmbed_free(LuaCEmbed *self); - - diff --git a/src/LuaCEmbed/basic/fdefine.basic.c b/src/LuaCEmbed/basic/fdefine.basic.c index 61f6b87..f0325f8 100644 --- a/src/LuaCEmbed/basic/fdefine.basic.c +++ b/src/LuaCEmbed/basic/fdefine.basic.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.fdeclare.h" -//silver_chain_scope_end LuaCEmbed * newLuaCEmbedEvaluation(){ @@ -15,10 +11,19 @@ LuaCEmbed * newLuaCEmbedEvaluation(){ return self; } void LuaCEmbed_load_lib_from_c(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name){ - int result = callback(self->state); - if(result > 0){ - lua_setglobal(self->state,name); + if(LuaCEmbed_has_errors(self)){ + return; + } + + lua_pushcfunction(self->state, callback); + int result = lua_pcall(self->state,0,1,0); + if(result){ + privateLuaCEmbed_raise_error_not_jumping(self,lua_tostring(self->state,-1)); + lua_settop(self->state,0); + return; } + lua_setglobal(self->state,name); + lua_settop(self->state,0); } void LuaCEmbed_load_native_libs(LuaCEmbed *self) { luaL_openlibs(self->state); @@ -38,55 +43,14 @@ void LuaCEmbed_set_timeout(int seconds){ lua_cembed_timeout = seconds; } -char * LuaCEmbed_get_error_message(LuaCEmbed *self){ - if(!self){ - return NULL; - } - return self->error_msg; -} -void LuaCEmbed_clear_errors(LuaCEmbed *self){ - if(!self){ - return; - } - - if(self->error_msg){ - free(self->error_msg); - self->error_msg = NULL; - } -} void * privateLuaCEmbed_get_current_table_array(LuaCEmbed *self){ if(self->current_function){ return self->func_tables; } return self->global_tables; } -void privateLuaCEmbed_raise_error_not_jumping(LuaCEmbed *self, const char *error_msg, ...){ - if(LuaCEmbed_has_errors(self)){ - return; - } - - va_list args; - va_start(args,error_msg); - self->error_msg = private_LuaCembed_format_vaarg(error_msg, args); - va_end(args); - -} - - - -bool LuaCEmbed_has_errors(LuaCEmbed *self){ - if(!self){ - return true; - } - - if(self->error_msg){ - return true; - } - - return false; -} @@ -99,7 +63,7 @@ void privata_LuaCEmbed_increment_stack_(LuaCEmbed *self){ if(lua_type(self->state,-1) == LUA_CEMBED_NUMBER){ value = lua_tonumber(self->state,-1); } - int new_value = value+1; + lua_Integer new_value = value+1; lua_pushinteger(self->state,new_value); lua_setglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); self->stack_leve =new_value; diff --git a/src/LuaCEmbed/callback_handle/fdeclare.callback_handle.h b/src/LuaCEmbed/callback_handle/fdeclare.callback_handle.h index 3cb1812..78d3775 100644 --- a/src/LuaCEmbed/callback_handle/fdeclare.callback_handle.h +++ b/src/LuaCEmbed/callback_handle/fdeclare.callback_handle.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesD.h" -//silver_chain_scope_end int privateLuaCEmbed_main_callback_handler(lua_State *L); diff --git a/src/LuaCEmbed/callback_handle/fdefine.callback_handle.c b/src/LuaCEmbed/callback_handle/fdefine.callback_handle.c index e7f0ab1..28a9637 100644 --- a/src/LuaCEmbed/callback_handle/fdefine.callback_handle.c +++ b/src/LuaCEmbed/callback_handle/fdefine.callback_handle.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.fdeclare.h" -//silver_chain_scope_end int privateLuaCEmbed_main_callback_handler(lua_State *L){ @@ -79,19 +75,19 @@ int privateLuaCEmbed_main_callback_handler(lua_State *L){ } if(possible_return->type == PRIVATE_LUA_CEMBED_LONG_RESPONSE){ - lua_pushinteger(L, (int)possible_return->num_val); + lua_pushinteger(L, possible_return->int_val); private_LuaCEmbedResponse_free(possible_return); return PRIVATE_LUACEMBED_ONE_RETURN; } if(possible_return->type == PRIVATE_LUA_CEMBED_BOOL_RESPONSE){ - lua_pushboolean(L, (bool)possible_return->num_val); + lua_pushboolean(L, (bool)possible_return->int_val); private_LuaCEmbedResponse_free(possible_return); return PRIVATE_LUACEMBED_ONE_RETURN; } if(possible_return->type == PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE){ - lua_pushnumber(L, possible_return->num_val); + lua_pushnumber(L, possible_return->double_val); private_LuaCEmbedResponse_free(possible_return); return PRIVATE_LUACEMBED_ONE_RETURN; } @@ -102,11 +98,6 @@ int privateLuaCEmbed_main_callback_handler(lua_State *L){ return PRIVATE_LUACEMBED_ONE_RETURN; } - if(possible_return->type == PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE){ - lua_pushboolean(L, (bool)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } if(possible_return->type == PRIVATE_LUA_CEMBED_TABLE_RESPONSE){ lua_getglobal(self->state, PRIVATE_LUA_CEMBED_TABLE_RETURN); @@ -233,4 +224,4 @@ void LuaCEmbed_add_global_callback(LuaCEmbed *self, const char *callback_name, L return; } private_LuaCEmbed_add_evaluation_callback(self,callback_name,callback); -} \ No newline at end of file +} diff --git a/src/LuaCEmbed/errors/fdeclare.errors.h b/src/LuaCEmbed/errors/fdeclare.errors.h new file mode 100644 index 0000000..fcc9c88 --- /dev/null +++ b/src/LuaCEmbed/errors/fdeclare.errors.h @@ -0,0 +1,15 @@ + + + +char * LuaCEmbed_get_error_message(LuaCEmbed *self); + +bool LuaCEmbed_has_errors(LuaCEmbed *self); + +void LuaCEmbed_clear_errors(LuaCEmbed *self); + + +void privateLuaCEmbed_raise_error_not_jumping(LuaCEmbed *self, const char *error, ...); + +void LuaCEmbed_dangerous_raise_error_jumping(LuaCEmbed *self,const char *error_msg,...); + +void LuaCEmbed_dangerous_raise_self_error_jumping(LuaCEmbed *self); diff --git a/src/LuaCEmbed/errors/fdefine.errors.c b/src/LuaCEmbed/errors/fdefine.errors.c new file mode 100644 index 0000000..e03edb7 --- /dev/null +++ b/src/LuaCEmbed/errors/fdefine.errors.c @@ -0,0 +1,73 @@ + + + +char * LuaCEmbed_get_error_message(LuaCEmbed *self){ + if(!self){ + return NULL; + } + + return self->error_msg; +} +void LuaCEmbed_clear_errors(LuaCEmbed *self){ + if(!self){ + return; + } + + if(self->error_msg){ + free(self->error_msg); + self->error_msg = NULL; + } +} + +void privateLuaCEmbed_raise_error_not_jumping(LuaCEmbed *self, const char *error_msg, ...){ + + if(LuaCEmbed_has_errors(self)){ + return; + } + + va_list args; + va_start(args,error_msg); + self->error_msg = private_LuaCembed_format_vaarg(error_msg, args); + va_end(args); + +} + + + +bool LuaCEmbed_has_errors(LuaCEmbed *self){ + if(!self){ + return true; + } + + if(self->error_msg){ + return true; + } + + return false; +} + + + +void LuaCEmbed_dangerous_raise_error_jumping(LuaCEmbed *self,const char *error_msg,...){ + if(LuaCEmbed_has_errors(self)){ + return; + } + + va_list args; + va_start(args,error_msg); + char *error_formmated = private_LuaCembed_format_vaarg(error_msg, args); + va_end(args); + lua_pushstring(self->state, error_formmated); + free(error_formmated); + lua_error(self->state); +} + +void LuaCEmbed_dangerous_raise_self_error_jumping(LuaCEmbed *self){ + if(!LuaCEmbed_has_errors(self)){ + return; + } + char *msg = LuaCEmbed_get_error_message(self); + lua_pushstring(self->state,msg); + LuaCEmbed_clear_errors(self); + lua_error(self->state); +} diff --git a/src/LuaCEmbed/evaluation/fdeclare.evaluation.h b/src/LuaCEmbed/evaluation/fdeclare.evaluation.h index 2512e0c..287897d 100644 --- a/src/LuaCEmbed/evaluation/fdeclare.evaluation.h +++ b/src/LuaCEmbed/evaluation/fdeclare.evaluation.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesD.h" -//silver_chain_scope_end #ifdef _WIN32 diff --git a/src/LuaCEmbed/evaluation/fdefine.evaluation.c b/src/LuaCEmbed/evaluation/fdefine.evaluation.c index 2ea80f8..00a3f4d 100644 --- a/src/LuaCEmbed/evaluation/fdefine.evaluation.c +++ b/src/LuaCEmbed/evaluation/fdefine.evaluation.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.fdeclare.h" -//silver_chain_scope_end #ifdef _WIN32 diff --git a/src/LuaCEmbed/globals.LuaCEmbed.c b/src/LuaCEmbed/globals.LuaCEmbed.c new file mode 100644 index 0000000..fdce2eb --- /dev/null +++ b/src/LuaCEmbed/globals.LuaCEmbed.c @@ -0,0 +1,4 @@ + + +int lua_cembed_timeout = -1; +LuaCEmbed *global_current_lua_embed_object; diff --git a/src/LuaCEmbed/globals/errors/fdeclare.errors.h b/src/LuaCEmbed/globals/errors/fdeclare.errors.h index 6f058d8..b84889e 100644 --- a/src/LuaCEmbed/globals/errors/fdeclare.errors.h +++ b/src/LuaCEmbed/globals/errors/fdeclare.errors.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../imports/imports.typesD.h" -//silver_chain_scope_end diff --git a/src/LuaCEmbed/globals/errors/fdefine.errors.c b/src/LuaCEmbed/globals/errors/fdefine.errors.c index aced612..e70275c 100644 --- a/src/LuaCEmbed/globals/errors/fdefine.errors.c +++ b/src/LuaCEmbed/globals/errors/fdefine.errors.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../imports/imports.fdeclare.h" -//silver_chain_scope_end diff --git a/src/LuaCEmbed/globals/getters/fdeclare.getters.h b/src/LuaCEmbed/globals/getters/fdeclare.getters.h index 9e6c78c..70b0860 100644 --- a/src/LuaCEmbed/globals/getters/fdeclare.getters.h +++ b/src/LuaCEmbed/globals/getters/fdeclare.getters.h @@ -1,13 +1,9 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../imports/imports.typesD.h" -//silver_chain_scope_end int LuaCEmbed_get_global_type(LuaCEmbed *self,const char *name); -long long LuaCEmbed_get_global_long(LuaCEmbed *self,const char *name); +lua_Integer LuaCEmbed_get_global_long(LuaCEmbed *self,const char *name); double LuaCEmbed_get_global_double(LuaCEmbed *self,const char *name); diff --git a/src/LuaCEmbed/globals/getters/fdefine.getters.c b/src/LuaCEmbed/globals/getters/fdefine.getters.c index 0efb78c..72d6f61 100644 --- a/src/LuaCEmbed/globals/getters/fdefine.getters.c +++ b/src/LuaCEmbed/globals/getters/fdefine.getters.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../imports/imports.fdeclare.h" -//silver_chain_scope_end int LuaCEmbed_get_global_type(LuaCEmbed *self,const char *name){ @@ -12,14 +8,14 @@ int LuaCEmbed_get_global_type(LuaCEmbed *self,const char *name){ return lua_type(self->state,-1); } -long long LuaCEmbed_get_global_long(LuaCEmbed *self,const char *name){ +lua_Integer LuaCEmbed_get_global_long(LuaCEmbed *self,const char *name){ PRIVATE_LUA_CEMBED_PROTECT_NUM if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_NUMBER)){ return LUA_CEMBED_GENERIC_ERROR; } lua_getglobal(self->state, name); - return (long )lua_tonumber(self->state,-1); + return lua_tointeger(self->state,-1); } double LuaCEmbed_get_global_double(LuaCEmbed *self,const char *name){ @@ -158,4 +154,3 @@ LuaCEmbedTable* LuaCEmbed_run_global_lambda(LuaCEmbed *self, const char *name, L return result; } - diff --git a/src/LuaCEmbed/globals/setters/fdeclare.setters.h b/src/LuaCEmbed/globals/setters/fdeclare.setters.h index 7a56c5e..d4f0dbb 100644 --- a/src/LuaCEmbed/globals/setters/fdeclare.setters.h +++ b/src/LuaCEmbed/globals/setters/fdeclare.setters.h @@ -1,14 +1,10 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../imports/imports.typesD.h" -//silver_chain_scope_end void LuaCEmbed_set_global_string(LuaCEmbed *self, const char *name, const char *value); void LuaCEmbed_set_global_raw_string(LuaCEmbed *self, const char *name, const char *value,long size); -void LuaCEmbed_set_global_long(LuaCEmbed *self, const char *name, long long value); +void LuaCEmbed_set_global_long(LuaCEmbed *self, const char *name, lua_Integer value); void LuaCEmbed_set_global_double(LuaCEmbed *self, const char *name, double value); diff --git a/src/LuaCEmbed/globals/setters/fdefine.setters.c b/src/LuaCEmbed/globals/setters/fdefine.setters.c index 4a4a7e8..7694511 100644 --- a/src/LuaCEmbed/globals/setters/fdefine.setters.c +++ b/src/LuaCEmbed/globals/setters/fdefine.setters.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../imports/imports.fdeclare.h" -//silver_chain_scope_end void LuaCEmbed_set_global_string(LuaCEmbed *self, const char *name, const char *value){ @@ -19,10 +15,10 @@ void LuaCEmbed_set_global_raw_string(LuaCEmbed *self, const char *name, const c } -void LuaCEmbed_set_global_long(LuaCEmbed *self, const char *name, long long value){ +void LuaCEmbed_set_global_long(LuaCEmbed *self, const char *name, lua_Integer value){ PRIVATE_LUA_CEMBED_PROTECT_VOID - lua_pushnumber(self->state,(double )value); + lua_pushinteger(self->state,value); lua_setglobal(self->state,name); } @@ -45,4 +41,4 @@ void LuaCEmbed_set_global_table(LuaCEmbed *self, const char *name, LuaCEmbedTabl lua_getglobal(self->state,table->global_name); lua_setglobal(self->state,name); -} \ No newline at end of file +} diff --git a/src/LuaCEmbed/lib_props/fdeclare.lib_props.h b/src/LuaCEmbed/lib_props/fdeclare.lib_props.h index 4892990..ba93143 100644 --- a/src/LuaCEmbed/lib_props/fdeclare.lib_props.h +++ b/src/LuaCEmbed/lib_props/fdeclare.lib_props.h @@ -1,11 +1,7 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesD.h" -//silver_chain_scope_end -void LuaCEmbed_set_long_lib_prop(LuaCEmbed *self,const char *name,long long value); +void LuaCEmbed_set_long_lib_prop(LuaCEmbed *self,const char *name,lua_Integer value); void LuaCEmbed_set_double_lib_prop(LuaCEmbed *self,const char *name,double value); @@ -18,7 +14,7 @@ void LuaCEmbed_set_table_lib_prop(LuaCEmbed *self,const char *name,LuaCEmbedTabl int private_LuaCEmbed_ensure_lib_prop_type(LuaCEmbed *self,const char *name,int expected_type);; -long long LuaCEmbed_get_long_lib_prop(LuaCEmbed *self,const char *name); +lua_Integer LuaCEmbed_get_long_lib_prop(LuaCEmbed *self,const char *name); double LuaCEmbed_get_double_lib_prop(LuaCEmbed *self,const char *name); @@ -27,4 +23,3 @@ bool LuaCEmbed_get_bool_lib_prop(LuaCEmbed *self,const char *name); char * LuaCEmbed_get_string_lib_prop(LuaCEmbed *self,const char *name); LuaCEmbedTable *LuaCEmbed_get_table_lib_prop(LuaCEmbed *self,const char *name); - diff --git a/src/LuaCEmbed/lib_props/fdefine.lib_props.c b/src/LuaCEmbed/lib_props/fdefine.lib_props.c index e97719b..86ec7bb 100644 --- a/src/LuaCEmbed/lib_props/fdefine.lib_props.c +++ b/src/LuaCEmbed/lib_props/fdefine.lib_props.c @@ -1,11 +1,7 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.fdeclare.h" -//silver_chain_scope_end -void LuaCEmbed_set_long_lib_prop(LuaCEmbed *self,const char *name,long long value){ +void LuaCEmbed_set_long_lib_prop(LuaCEmbed *self,const char *name,lua_Integer value){ char *main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); lua_getglobal(self->state,main_lib_table); @@ -75,7 +71,7 @@ int private_LuaCEmbed_ensure_lib_prop_type(LuaCEmbed *self,const char *name,int return LUA_CEMBED_OK; } -long long LuaCEmbed_get_long_lib_prop(LuaCEmbed *self,const char *name){ +lua_Integer LuaCEmbed_get_long_lib_prop(LuaCEmbed *self,const char *name){ lua_getglobal(self->state,self->main_lib_table); lua_getfield(self->state, -1,name); if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_NUMBER)){ diff --git a/src/LuaCEmbed/lib_start/fdeclare.lib_start.h b/src/LuaCEmbed/lib_start/fdeclare.lib_start.h index 8eb21ac..1a931a2 100644 --- a/src/LuaCEmbed/lib_start/fdeclare.lib_start.h +++ b/src/LuaCEmbed/lib_start/fdeclare.lib_start.h @@ -1,11 +1,11 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesD.h" -//silver_chain_scope_end -int private_LuaCemb_internal_free(lua_State *L); +int private_LuaCemb_internal_free(lua_State *L); LuaCEmbed * newLuaCEmbedLib(lua_State *state); -int LuaCembed_perform(LuaCEmbed *self); +int LuaCembed_perform(LuaCEmbed *self); + +int LuaCembed_send_self_as_lib(LuaCEmbed *self); + +int LuaCembed_send_global_as_lib(LuaCEmbed *self,const char *global_name); diff --git a/src/LuaCEmbed/lib_start/fdefine.lib_start.c b/src/LuaCEmbed/lib_start/fdefine.lib_start.c index 24193f1..9c1eb17 100644 --- a/src/LuaCEmbed/lib_start/fdefine.lib_start.c +++ b/src/LuaCEmbed/lib_start/fdefine.lib_start.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.fdeclare.h" -//silver_chain_scope_end int private_LuaCemb_internal_free(lua_State *L){ LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(L, lua_upvalueindex(1)); @@ -21,7 +17,7 @@ LuaCEmbed * newLuaCEmbedLib(lua_State *state){ self->lib_identifier = 0; lua_getglobal(self->state,PRIVATE_LUA_CEMBED_TOTAL_LIBS); - if(lua_type(self->state,-1) == LUA_CEMBED_NIL){ + if(lua_type(self->state,-1) != LUA_CEMBED_NIL){ self->lib_identifier = lua_tointeger(self->state,-1); } @@ -69,3 +65,20 @@ int LuaCembed_perform(LuaCEmbed *self){ free(lib_main_table); return 1; } + +int LuaCembed_send_self_as_lib(LuaCEmbed *self){ + return LuaCembed_perform(self); +} + +int LuaCembed_send_global_as_lib(LuaCEmbed *self,const char *global_name){ + if(global_name == NULL){ + return 0; + } + + lua_getglobal(self->state,global_name); + int type = lua_type(self->state,-1); + if(type == LUA_CEMBED_NIL){ + return 0; + } + return 1; +} diff --git a/src/LuaCEmbed/macros.protection_macros.h b/src/LuaCEmbed/macros.protection_macros.h index a490794..2bcb1c4 100644 --- a/src/LuaCEmbed/macros.protection_macros.h +++ b/src/LuaCEmbed/macros.protection_macros.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../imports/imports.consts.h" -//silver_chain_scope_end #define PRIVATE_LUA_CEMBED_PROTECT_VOID \ if(!self){ \ return; \ diff --git a/src/LuaCEmbed/memory/fdeclare.memory.h b/src/LuaCEmbed/memory/fdeclare.memory.h index a1a532b..58f37ad 100644 --- a/src/LuaCEmbed/memory/fdeclare.memory.h +++ b/src/LuaCEmbed/memory/fdeclare.memory.h @@ -1,12 +1,7 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesD.h" -//silver_chain_scope_end -long lua_cembed_used_memory = 0; -long lua_cembed_memory_limit = -1; + void LuaCEmbed_set_memory_limit(LuaCEmbed *self, double limit); diff --git a/src/LuaCEmbed/memory/fdefine.memory.c b/src/LuaCEmbed/memory/fdefine.memory.c index 83e31b9..1c9d551 100644 --- a/src/LuaCEmbed/memory/fdefine.memory.c +++ b/src/LuaCEmbed/memory/fdefine.memory.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.fdeclare.h" -//silver_chain_scope_end void LuaCEmbed_set_memory_limit(LuaCEmbed *self, double limit){ diff --git a/src/LuaCEmbed/memory/globals.memory.c b/src/LuaCEmbed/memory/globals.memory.c new file mode 100644 index 0000000..8a464dc --- /dev/null +++ b/src/LuaCEmbed/memory/globals.memory.c @@ -0,0 +1,3 @@ + +long lua_cembed_used_memory = 0; +long lua_cembed_memory_limit = -1; \ No newline at end of file diff --git a/src/LuaCEmbed/table/macros.protection_macros.h b/src/LuaCEmbed/table/macros.protection_macros.h index e408ea3..3513a89 100644 --- a/src/LuaCEmbed/table/macros.protection_macros.h +++ b/src/LuaCEmbed/table/macros.protection_macros.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.consts.h" -//silver_chain_scope_end #define PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID \ if(!self){ \ return; \ diff --git a/src/LuaCEmbed/table/table/append/fdeclare.append.h b/src/LuaCEmbed/table/table/append/fdeclare.append.h index 1885d35..ca6e24a 100644 --- a/src/LuaCEmbed/table/table/append/fdeclare.append.h +++ b/src/LuaCEmbed/table/table/append/fdeclare.append.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../imports/imports.typesD.h" -//silver_chain_scope_end void LuaCEmbedTable_append_table(LuaCEmbedTable *self, LuaCEmbedTable *table); @@ -12,8 +8,8 @@ void LuaCEmbedTable_append_evaluation(LuaCEmbedTable *self, const char *code, . void LuaCEmbedTable_append_string(LuaCEmbedTable *self, const char *value); -void LuaCEmbedTable_append_long(LuaCEmbedTable *self, long long value); +void LuaCEmbedTable_append_long(LuaCEmbedTable *self, lua_Integer value); void LuaCEmbedTable_append_double(LuaCEmbedTable *self, double value); -void LuaCEmbedTable_append_bool(LuaCEmbedTable *self, bool value); \ No newline at end of file +void LuaCEmbedTable_append_bool(LuaCEmbedTable *self, bool value); diff --git a/src/LuaCEmbed/table/table/append/fdefine.append.c b/src/LuaCEmbed/table/table/append/fdefine.append.c index 00d9022..23c91ad 100644 --- a/src/LuaCEmbed/table/table/append/fdefine.append.c +++ b/src/LuaCEmbed/table/table/append/fdefine.append.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../imports/imports.fdeclare.h" -//silver_chain_scope_end void LuaCEmbedTable_append_table(LuaCEmbedTable *self, LuaCEmbedTable *table){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID @@ -27,13 +23,13 @@ void LuaCEmbedTable_append_string(LuaCEmbedTable *self, const char *value){ } -void LuaCEmbedTable_append_long(LuaCEmbedTable *self, long long value){ +void LuaCEmbedTable_append_long(LuaCEmbedTable *self, lua_Integer value){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID long size = LuaCEmbedTable_get_listable_size(self); lua_getglobal(self->main_object->state,self->global_name); lua_pushinteger(self->main_object->state,size+1); - lua_pushnumber(self->main_object->state,(double)value); + lua_pushinteger(self->main_object->state,value); lua_rawset(self->main_object->state,-3); lua_settop(self->main_object->state, 0); @@ -87,4 +83,4 @@ void LuaCEmbedTable_append_evaluation(LuaCEmbedTable *self, const char *code, . lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); lua_rawset(self->main_object->state,-3); lua_settop(self->main_object->state, 0); -} \ No newline at end of file +} diff --git a/src/LuaCEmbed/table/table/basic/fdeclare.basic.h b/src/LuaCEmbed/table/table/basic/fdeclare.basic.h index 6ea6250..3f2c3d3 100644 --- a/src/LuaCEmbed/table/table/basic/fdeclare.basic.h +++ b/src/LuaCEmbed/table/table/basic/fdeclare.basic.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../imports/imports.typesD.h" -//silver_chain_scope_end LuaCEmbedTable * private_newLuaCembedTable(LuaCEmbed *main_embed, const char *format, ...); diff --git a/src/LuaCEmbed/table/table/basic/fdefine.basic.c b/src/LuaCEmbed/table/table/basic/fdefine.basic.c index 81271e5..97ac50a 100644 --- a/src/LuaCEmbed/table/table/basic/fdefine.basic.c +++ b/src/LuaCEmbed/table/table/basic/fdefine.basic.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../imports/imports.fdeclare.h" -//silver_chain_scope_end diff --git a/src/LuaCEmbed/table/table/destroy/fdeclare.destroy.h b/src/LuaCEmbed/table/table/destroy/fdeclare.destroy.h index 37234fd..140ab00 100644 --- a/src/LuaCEmbed/table/table/destroy/fdeclare.destroy.h +++ b/src/LuaCEmbed/table/table/destroy/fdeclare.destroy.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../imports/imports.typesD.h" -//silver_chain_scope_end void LuaCembedTable_destroy_prop(LuaCEmbedTable *self, const char *name); diff --git a/src/LuaCEmbed/table/table/destroy/fdefine.destroy.c b/src/LuaCEmbed/table/table/destroy/fdefine.destroy.c index 6e7cfae..115624e 100644 --- a/src/LuaCEmbed/table/table/destroy/fdefine.destroy.c +++ b/src/LuaCEmbed/table/table/destroy/fdefine.destroy.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../imports/imports.fdeclare.h" -//silver_chain_scope_end void LuaCembedTable_destroy_prop(LuaCEmbedTable *self, const char *name){ diff --git a/src/LuaCEmbed/table/table/errors/fdeclare.errors.h b/src/LuaCEmbed/table/table/errors/fdeclare.errors.h index 74c4087..2e714ef 100644 --- a/src/LuaCEmbed/table/table/errors/fdeclare.errors.h +++ b/src/LuaCEmbed/table/table/errors/fdeclare.errors.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../imports/imports.typesD.h" -//silver_chain_scope_end int privateLuaCEmbedTable_ensure_type_with_key(LuaCEmbedTable *self, const char *name, int expected_type); diff --git a/src/LuaCEmbed/table/table/errors/fdefine.errors.c b/src/LuaCEmbed/table/table/errors/fdefine.errors.c index fc5bdbd..a97d16c 100644 --- a/src/LuaCEmbed/table/table/errors/fdefine.errors.c +++ b/src/LuaCEmbed/table/table/errors/fdefine.errors.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../imports/imports.fdeclare.h" -//silver_chain_scope_end diff --git a/src/LuaCEmbed/table/table/getters/index/fdeclare.index.h b/src/LuaCEmbed/table/table/getters/index/fdeclare.index.h index 45394bd..2b21d32 100644 --- a/src/LuaCEmbed/table/table/getters/index/fdeclare.index.h +++ b/src/LuaCEmbed/table/table/getters/index/fdeclare.index.h @@ -1,29 +1,25 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../../imports/imports.typesD.h" -//silver_chain_scope_end -char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, long index); +char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, lua_Integer index); -bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, long index); +bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, lua_Integer index); -long LuaCEmbedTable_get_full_size(LuaCEmbedTable *self); +lua_Integer LuaCEmbedTable_get_full_size(LuaCEmbedTable *self); -long LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self); +lua_Integer LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self); -long privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cembed_incremented_arg index); +lua_Integer privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cembed_incremented_arg index); -int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, int index); +int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, lua_Integer index); -long long LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, int index); +lua_Integer LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, lua_Integer index); -double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, int index); +double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, lua_Integer index); -char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, int index); - -bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, int index); +char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, lua_Integer index); +char * LuaCEmbedTable_get_raw_string_by_index(LuaCEmbedTable *self, lua_Integer index, lua_Integer *size); +bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, lua_Integer index); diff --git a/src/LuaCEmbed/table/table/getters/index/fdefine.index.c b/src/LuaCEmbed/table/table/getters/index/fdefine.index.c index d3da2bc..dfa2e5e 100644 --- a/src/LuaCEmbed/table/table/getters/index/fdefine.index.c +++ b/src/LuaCEmbed/table/table/getters/index/fdefine.index.c @@ -1,18 +1,14 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../../imports/imports.fdeclare.h" -//silver_chain_scope_end -long LuaCEmbedTable_get_full_size(LuaCEmbedTable *self){ +lua_Integer LuaCEmbedTable_get_full_size(LuaCEmbedTable *self){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM lua_getglobal(self->main_object->state,self->global_name); int index = lua_gettop(self->main_object->state); - long total = 0; + lua_Integer total = 0; lua_pushnil(self->main_object->state); while(lua_next(self->main_object->state,index)){ @@ -24,7 +20,7 @@ long LuaCEmbedTable_get_full_size(LuaCEmbedTable *self){ return total; } -long LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self){ +lua_Integer LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM lua_getglobal(self->main_object->state,self->global_name); @@ -32,7 +28,7 @@ long LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self){ } -long privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cembed_incremented_arg index){ +lua_Integer privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cembed_incremented_arg index){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM if(index >= 0){ @@ -42,7 +38,7 @@ long privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cemb return LuaCEmbedTable_get_full_size(self) + index; } -int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, int index){ +int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, lua_Integer index){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM long formatted_index = index + LUA_CEMBED_INDEX_DIF; @@ -66,7 +62,7 @@ int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, int index){ PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK return LUA_CEMBED_NOT_FOUND; } -char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, long index){ +char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, lua_Integer index){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL long formatted_index = index + LUA_CEMBED_INDEX_DIF; @@ -74,7 +70,7 @@ char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, long index){ lua_getglobal(self->main_object->state,self->global_name); int table_index = lua_gettop(self->main_object->state); long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; + lua_Integer total = 1; lua_pushnil(self->main_object->state); while(lua_next(self->main_object->state,table_index)){ @@ -97,7 +93,7 @@ char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, long index){ PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK return NULL; } -bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, long index){ +bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, lua_Integer index){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL lua_settop(self->main_object->state,0); @@ -123,7 +119,7 @@ bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, long index){ return false; } -long long LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, int index){ +lua_Integer LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, lua_Integer index){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM lua_settop(self->main_object->state,0); @@ -131,8 +127,8 @@ long long LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, int index){ lua_getglobal(self->main_object->state,self->global_name); int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; + lua_Integer converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); + lua_Integer total = 1; lua_pushnil(self->main_object->state); while(lua_next(self->main_object->state,table_index)){ @@ -165,7 +161,7 @@ long long LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, int index){ return LUA_CEMBED_GENERIC_ERROR; } -double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, int index){ +double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, lua_Integer index){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM int formatted_index = index + LUA_CEMBED_INDEX_DIF; @@ -173,7 +169,7 @@ double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, int index){ lua_getglobal(self->main_object->state,self->global_name); int table_index = lua_gettop(self->main_object->state); long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; + lua_Integer total = 1; lua_pushnil(self->main_object->state); while(lua_next(self->main_object->state,table_index)){ if(total == converted_index){ @@ -204,7 +200,7 @@ double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, int index){ return LUA_CEMBED_GENERIC_ERROR; } -char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, int index){ +char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, lua_Integer index){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL int formatted_index = index + LUA_CEMBED_INDEX_DIF; @@ -212,7 +208,7 @@ char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, int index){ lua_getglobal(self->main_object->state,self->global_name); int table_index = lua_gettop(self->main_object->state); long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; + lua_Integer total = 1; lua_pushnil(self->main_object->state); while(lua_next(self->main_object->state,table_index)){ if(total == converted_index){ @@ -243,7 +239,45 @@ char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, int index){ return NULL; } -bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, int index){ +char * LuaCEmbedTable_get_raw_string_by_index(LuaCEmbedTable *self, lua_Integer index, lua_Integer *size){ + PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL + + int formatted_index = index + LUA_CEMBED_INDEX_DIF; + + lua_getglobal(self->main_object->state,self->global_name); + int table_index = lua_gettop(self->main_object->state); + long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); + int total = 1; + lua_pushnil(self->main_object->state); + while(lua_next(self->main_object->state,table_index)){ + if(total == converted_index){ + if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_STRING)){ + lua_pop(self->main_object->state,1); + PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK + return NULL; + } + char * result = (char*)lua_tolstring(self->main_object->state,-1,(size_t*)size); + lua_pop(self->main_object->state,1); + PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK + return result; + } + lua_pop(self->main_object->state,1); + total+=1; + + } + + privateLuaCEmbed_raise_error_not_jumping( + self->main_object, + PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, + index, + self->global_name, + LuaCembed_convert_arg_code(LUA_CEMBED_NIL), + LuaCembed_convert_arg_code(LUA_CEMBED_STRING) + ); + PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK + return NULL; +} +bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, lua_Integer index){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL int formatted_index = index + LUA_CEMBED_INDEX_DIF; @@ -279,4 +313,4 @@ bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, int index){ ); PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK return LUA_CEMBED_GENERIC_ERROR; -} \ No newline at end of file +} diff --git a/src/LuaCEmbed/table/table/getters/keys/fdeclare.keys.h b/src/LuaCEmbed/table/table/getters/keys/fdeclare.keys.h index 67b9e8e..fa060c6 100644 --- a/src/LuaCEmbed/table/table/getters/keys/fdeclare.keys.h +++ b/src/LuaCEmbed/table/table/getters/keys/fdeclare.keys.h @@ -1,14 +1,12 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../../imports/imports.typesD.h" -//silver_chain_scope_end char* LuaCembedTable_get_string_prop(LuaCEmbedTable *self, const char *name); -long long LuaCembedTable_get_long_prop(LuaCEmbedTable *self, const char *name); +char* LuaCembedTable_get_raw_string_prop(LuaCEmbedTable *self, const char *name,lua_Integer *size); + +lua_Integer LuaCembedTable_get_long_prop(LuaCEmbedTable *self, const char *name); double LuaCembedTable_get_double_prop(LuaCEmbedTable *self, const char *name); diff --git a/src/LuaCEmbed/table/table/getters/keys/fdefine.keys.c b/src/LuaCEmbed/table/table/getters/keys/fdefine.keys.c index 2a6d321..3125068 100644 --- a/src/LuaCEmbed/table/table/getters/keys/fdefine.keys.c +++ b/src/LuaCEmbed/table/table/getters/keys/fdefine.keys.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../../imports/imports.fdeclare.h" -//silver_chain_scope_end int LuaCEmbedTable_get_type_prop(LuaCEmbedTable *self, const char *name){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM @@ -28,8 +24,21 @@ char* LuaCembedTable_get_string_prop(LuaCEmbedTable *self , const char *name){ return value; } +char* LuaCembedTable_get_raw_string_prop(LuaCEmbedTable *self, const char *name,lua_Integer *size){ + PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL + + lua_getglobal(self->main_object->state,self->global_name); + privateLuaCEmbd_get_field_protected(self->main_object,name); + if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_STRING)){ + return NULL; + } + + char *value = (char*)lua_tolstring(self->main_object->state,-1,(size_t*)size); + PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK + return value; +} -long long LuaCembedTable_get_long_prop(LuaCEmbedTable *self , const char *name){ +lua_Integer LuaCembedTable_get_long_prop(LuaCEmbedTable *self , const char *name){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM lua_getglobal(self->main_object->state,self->global_name); @@ -37,7 +46,7 @@ long long LuaCembedTable_get_long_prop(LuaCEmbedTable *self , const char *name if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_NUMBER)){ return LUA_CEMBED_GENERIC_ERROR; } - long long value = (long long)lua_tonumber(self->main_object->state,-1); + lua_Integer value = lua_tointeger(self->main_object->state,-1); PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK return value; } diff --git a/src/LuaCEmbed/table/table/setters/index/fdeclare.index.h b/src/LuaCEmbed/table/table/setters/index/fdeclare.index.h index 482a30d..66a654a 100644 --- a/src/LuaCEmbed/table/table/setters/index/fdeclare.index.h +++ b/src/LuaCEmbed/table/table/setters/index/fdeclare.index.h @@ -1,16 +1,14 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../../imports/imports.typesD.h" -//silver_chain_scope_end -void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, long index, const char *value); +void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, lua_Integer index, const char *value); -void LuaCEmbedTable_set_long_by_index(LuaCEmbedTable *self, long long index, long value); +void LuaCEmbedTable_set_raw_string_by_index(LuaCEmbedTable *self, lua_Integer index, const char *value,lua_Integer size); -void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, long index, double value); +void LuaCEmbedTable_set_long_by_index(LuaCEmbedTable *self, lua_Integer index, lua_Integer value); -void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, long index, bool value); +void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, lua_Integer index, double value); +void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, lua_Integer index, bool value); -void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, long index, const char *code, ...); + +void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, lua_Integer index, const char *code, ...); diff --git a/src/LuaCEmbed/table/table/setters/index/fdefine.index.c b/src/LuaCEmbed/table/table/setters/index/fdefine.index.c index 0330f90..a8add07 100644 --- a/src/LuaCEmbed/table/table/setters/index/fdefine.index.c +++ b/src/LuaCEmbed/table/table/setters/index/fdefine.index.c @@ -1,11 +1,7 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../../imports/imports.fdeclare.h" -//silver_chain_scope_end -void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, long index, const char *value){ +void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, lua_Integer index, const char *value){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID char *possible_key = LuaCembedTable_get_key_by_index(self,index); @@ -19,27 +15,45 @@ void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, long index, const lua_pushstring(self->main_object->state,value); lua_settable(self->main_object->state,-3); lua_settop(self->main_object->state, 0); - } -void LuaCEmbedTable_set_long_by_index(LuaCEmbedTable *self, long long index, long value){ + +void LuaCEmbedTable_set_raw_string_by_index(LuaCEmbedTable *self, lua_Integer index, const char *value,lua_Integer size){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID char *possible_key = LuaCembedTable_get_key_by_index(self,index); if(possible_key){ - LuaCEmbedTable_set_long_prop(self,possible_key,value); + LuaCEmbedTable_set_string_prop(self,possible_key,value); return; } long formatted_index = index + LUA_CEMBED_INDEX_DIF; lua_getglobal(self->main_object->state,self->global_name); lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushnumber(self->main_object->state,(double )value); + lua_pushlstring(self->main_object->state,value,size); + lua_settable(self->main_object->state,-3); + lua_settop(self->main_object->state, 0); +} + + + +void LuaCEmbedTable_set_long_by_index(LuaCEmbedTable *self, lua_Integer index, lua_Integer value){ + PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID + + char *possible_key = LuaCembedTable_get_key_by_index(self,index); + if(possible_key){ + LuaCEmbedTable_set_long_prop(self,possible_key,value); + return; + } + lua_Integer formatted_index = index + LUA_CEMBED_INDEX_DIF; + lua_getglobal(self->main_object->state,self->global_name); + lua_pushinteger(self->main_object->state,formatted_index); + lua_pushinteger(self->main_object->state,value); lua_settable(self->main_object->state,-3); lua_settop(self->main_object->state, 0); } -void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, long index, double value){ +void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, lua_Integer index, double value){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID char *possible_key = LuaCembedTable_get_key_by_index(self,index); @@ -50,14 +64,14 @@ void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, long index, doubl long formatted_index = index + LUA_CEMBED_INDEX_DIF; lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushnumber(self->main_object->state,(double )value); + lua_pushinteger(self->main_object->state,formatted_index); + lua_pushnumber(self->main_object->state,value); lua_settable(self->main_object->state,-3); lua_settop(self->main_object->state, 0); } -void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, long index, bool value){ +void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, lua_Integer index, bool value){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID char *possible_key = LuaCembedTable_get_key_by_index(self,index); @@ -68,7 +82,7 @@ void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, long index, bool va long formatted_index = index + LUA_CEMBED_INDEX_DIF; lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); + lua_pushinteger(self->main_object->state,formatted_index); lua_pushboolean(self->main_object->state,value); lua_settable(self->main_object->state,-3); lua_settop(self->main_object->state, 0); @@ -76,7 +90,7 @@ void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, long index, bool va } -void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, long index, const char *code, ...){ +void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, lua_Integer index, const char *code, ...){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID long formatted_index = index + LUA_CEMBED_INDEX_DIF; @@ -95,7 +109,7 @@ void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, long index, c return; } lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); + lua_pushinteger(self->main_object->state,formatted_index); lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); lua_settable(self->main_object->state,-3); lua_settop(self->main_object->state, 0); diff --git a/src/LuaCEmbed/table/table/setters/insert/fdeclare.insert.h b/src/LuaCEmbed/table/table/setters/insert/fdeclare.insert.h index 690f333..79e9fd3 100644 --- a/src/LuaCEmbed/table/table/setters/insert/fdeclare.insert.h +++ b/src/LuaCEmbed/table/table/setters/insert/fdeclare.insert.h @@ -1,19 +1,14 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../../imports/imports.typesD.h" -//silver_chain_scope_end -void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, long formatted_index); +void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, lua_Integer formatted_index); -void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, long index, const char *value); +void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, lua_Integer index, const char *value); -void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, long index,bool value); +void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, lua_Integer index,bool value); -void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, long long index,long value); +void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self,lua_Integer index,lua_Integer value); -void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, long index,double value); - -void LuaCEmbedTable_insert_table_at_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *table); +void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, lua_Integer index,double value); +void LuaCEmbedTable_insert_table_at_index(LuaCEmbedTable *self, lua_Integer index,LuaCEmbedTable *table); diff --git a/src/LuaCEmbed/table/table/setters/insert/fdefine.insert.c b/src/LuaCEmbed/table/table/setters/insert/fdefine.insert.c index 5294376..31a15a5 100644 --- a/src/LuaCEmbed/table/table/setters/insert/fdefine.insert.c +++ b/src/LuaCEmbed/table/table/setters/insert/fdefine.insert.c @@ -1,18 +1,14 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../../imports/imports.fdeclare.h" -//silver_chain_scope_end -void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, long formatted_index){ +void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, lua_Integer formatted_index){ lua_newtable(self->main_object->state); lua_setglobal(self->main_object->state,PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); lua_getglobal(self->main_object->state, self->global_name); - int table_index = lua_gettop(self->main_object->state); - int total = 1; + lua_Integer table_index = lua_gettop(self->main_object->state); + lua_Integer total = 1; lua_pushnil(self->main_object->state); // Empilhando o primeiro par chave-valor while (lua_next(self->main_object->state, table_index)) { @@ -43,14 +39,14 @@ void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, long formatted_inde lua_pushnil(self->main_object->state); } -void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, long index, const char *value) { +void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, lua_Integer index, const char *value) { // Movendo os elementos existentes para frente long formatted_index = index + LUA_CEMBED_INDEX_DIF; private_LuaCEmbedTable_add_space(self,formatted_index); // Inserindo o novo valor na posição especificada lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); + lua_pushinteger(self->main_object->state, formatted_index); lua_pushstring(self->main_object->state, value); lua_settable(self->main_object->state, -3); @@ -59,7 +55,7 @@ void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, long index, con } -void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, long index,bool value){ +void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, lua_Integer index,bool value){ // Movendo os elementos existentes para frente long formatted_index = index + LUA_CEMBED_INDEX_DIF; @@ -67,7 +63,7 @@ void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, long index,bool private_LuaCEmbedTable_add_space(self,formatted_index); // Inserindo o novo valor na posição especificada lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); + lua_pushinteger(self->main_object->state, formatted_index); lua_pushboolean(self->main_object->state, value); lua_settable(self->main_object->state, -3); @@ -75,7 +71,7 @@ void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, long index,bool lua_settop(self->main_object->state, 0); } -void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, long long index,long value){ +void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, lua_Integer index,lua_Integer value){ // Movendo os elementos existentes para frente long formatted_index = index + LUA_CEMBED_INDEX_DIF; @@ -83,7 +79,7 @@ void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, long long index private_LuaCEmbedTable_add_space(self,formatted_index); // Inserindo o novo valor na posição especificada lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); + lua_pushinteger(self->main_object->state, formatted_index); lua_pushinteger(self->main_object->state, value); lua_settable(self->main_object->state, -3); @@ -91,7 +87,7 @@ void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, long long index lua_settop(self->main_object->state, 0); } -void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, long index,double value){ +void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, lua_Integer index,double value){ // Movendo os elementos existentes para frente long formatted_index = index + LUA_CEMBED_INDEX_DIF; @@ -99,7 +95,7 @@ void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, long index,dou private_LuaCEmbedTable_add_space(self,formatted_index); // Inserindo o novo valor na posição especificada lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); + lua_pushinteger(self->main_object->state, formatted_index); lua_pushnumber(self->main_object->state, value); lua_settable(self->main_object->state, -3); @@ -107,17 +103,17 @@ void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, long index,dou lua_settop(self->main_object->state, 0); } -void LuaCEmbedTable_insert_table_at_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *table){ +void LuaCEmbedTable_insert_table_at_index(LuaCEmbedTable *self, lua_Integer index,LuaCEmbedTable *table){ // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; + lua_Integer formatted_index = index + LUA_CEMBED_INDEX_DIF; private_LuaCEmbedTable_add_space(self,formatted_index); // Inserindo o novo valor na posição especificada lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); + lua_pushinteger(self->main_object->state, formatted_index); lua_getglobal(self->main_object->state,table->global_name); lua_settable(self->main_object->state, -3); // Limpando a pilha lua_settop(self->main_object->state, 0); -} \ No newline at end of file +} diff --git a/src/LuaCEmbed/table/table/setters/keys/fdeclare.keys.h b/src/LuaCEmbed/table/table/setters/keys/fdeclare.keys.h index 9937644..218eca6 100644 --- a/src/LuaCEmbed/table/table/setters/keys/fdeclare.keys.h +++ b/src/LuaCEmbed/table/table/setters/keys/fdeclare.keys.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../../imports/imports.typesD.h" -//silver_chain_scope_end @@ -12,7 +8,9 @@ void LuaCEmbedTable_set_method(LuaCEmbedTable *self, const char *name, LuaCEmbed void LuaCEmbedTable_set_string_prop(LuaCEmbedTable *self, const char *name, const char *value); -void LuaCEmbedTable_set_long_prop(LuaCEmbedTable *self, const char *name, long long value); +void LuaCEmbedTable_set_raw_string_prop(LuaCEmbedTable *self , const char *name, const char *value,lua_Integer size); + +void LuaCEmbedTable_set_long_prop(LuaCEmbedTable *self, const char *name,lua_Integer value); void LuaCEmbedTable_set_double_prop(LuaCEmbedTable *self, const char *name, double value); @@ -20,4 +18,3 @@ void LuaCEmbedTable_set_bool_prop(LuaCEmbedTable *self, const char *name, bool void LuaCEmbedTable_set_evaluation_prop(LuaCEmbedTable *self, const char *name, const char *code, ...); - diff --git a/src/LuaCEmbed/table/table/setters/keys/fdefine.keys.c b/src/LuaCEmbed/table/table/setters/keys/fdefine.keys.c index f12201f..2be0753 100644 --- a/src/LuaCEmbed/table/table/setters/keys/fdefine.keys.c +++ b/src/LuaCEmbed/table/table/setters/keys/fdefine.keys.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../../imports/imports.fdeclare.h" -//silver_chain_scope_end @@ -72,13 +68,23 @@ void LuaCEmbedTable_set_string_prop(LuaCEmbedTable *self , const char *name, co lua_settop(self->main_object->state, 0); } +void LuaCEmbedTable_set_raw_string_prop(LuaCEmbedTable *self , const char *name, const char *value,lua_Integer size){ + PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID -void LuaCEmbedTable_set_long_prop(LuaCEmbedTable *self , const char *name, long long value){ + lua_getglobal(self->main_object->state,self->global_name); + lua_pushstring(self->main_object->state,name); + lua_pushlstring(self->main_object->state,value,size); + lua_settable(self->main_object->state,-3); + lua_settop(self->main_object->state, 0); + +} + +void LuaCEmbedTable_set_long_prop(LuaCEmbedTable *self , const char *name,lua_Integer value){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID lua_getglobal(self->main_object->state,self->global_name); lua_pushstring(self->main_object->state,name); - lua_pushnumber(self->main_object->state,(double)value); + lua_pushinteger(self->main_object->state,value); lua_settable(self->main_object->state,-3); lua_settop(self->main_object->state, 0); @@ -130,4 +136,4 @@ void LuaCEmbedTable_set_evaluation_prop(LuaCEmbedTable *self, const char *name, lua_settable(self->main_object->state,-3); lua_settop(self->main_object->state, 0); -} \ No newline at end of file +} diff --git a/src/LuaCEmbed/table/table/sub_tables/index/fdeclare.index.h b/src/LuaCEmbed/table/table/sub_tables/index/fdeclare.index.h index eceacb4..7e41518 100644 --- a/src/LuaCEmbed/table/table/sub_tables/index/fdeclare.index.h +++ b/src/LuaCEmbed/table/table/sub_tables/index/fdeclare.index.h @@ -1,17 +1,10 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../../imports/imports.typesD.h" -//silver_chain_scope_end LuaCEmbedTable *LuaCEmbedTable_new_sub_table_appending(LuaCEmbedTable *self); -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, long index); - - -void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table); - +LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, lua_Integer index); +void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, lua_Integer index,LuaCEmbedTable *sub_table); diff --git a/src/LuaCEmbed/table/table/sub_tables/index/fdefine.index.c b/src/LuaCEmbed/table/table/sub_tables/index/fdefine.index.c index 38ac0a6..4016521 100644 --- a/src/LuaCEmbed/table/table/sub_tables/index/fdefine.index.c +++ b/src/LuaCEmbed/table/table/sub_tables/index/fdefine.index.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../../imports/imports.fdeclare.h" -//silver_chain_scope_end LuaCEmbedTable *LuaCEmbedTable_new_sub_table_appending(LuaCEmbedTable *self){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL @@ -11,7 +7,7 @@ LuaCEmbedTable *LuaCEmbedTable_new_sub_table_appending(LuaCEmbedTable *self){ //equivalent of: full_sub_table_name = {} long index= LuaCEmbedTable_get_listable_size(self) +1; - char *full_sub_table_name = private_LuaCembed_format("%s_%d", self->global_name, index); + char *full_sub_table_name = private_LuaCembed_format("%s_%ld", self->global_name, index); lua_newtable(self->main_object->state); lua_setglobal(self->main_object->state,full_sub_table_name); @@ -47,7 +43,7 @@ LuaCEmbedTable *LuaCEmbedTable_new_sub_table_appending(LuaCEmbedTable *self){ return created; } -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, long index){ +LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, lua_Integer index){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL @@ -55,9 +51,9 @@ LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, lon long formatted_index = index + LUA_CEMBED_INDEX_DIF; lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; + lua_Integer table_index = lua_gettop(self->main_object->state); + lua_Integer converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); + lua_Integer total = 1; lua_pushnil(self->main_object->state); while(lua_next(self->main_object->state,table_index)){ @@ -70,7 +66,7 @@ LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, lon } //equivalent of full_sub_table_name = table[index] - char *full_sub_table_name = private_LuaCembed_format("%s_%d", self->global_name, index); + char *full_sub_table_name = private_LuaCembed_format("%s_%ld", self->global_name, (long)index); lua_setglobal(self->main_object->state,full_sub_table_name); LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_internal_index( @@ -115,7 +111,7 @@ LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, lon return NULL; } -void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table){ +void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, lua_Integer index,LuaCEmbedTable *sub_table){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID @@ -126,7 +122,7 @@ void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, long index,LuaC return; } - long formatted_index = index + LUA_CEMBED_INDEX_DIF; + lua_Integer formatted_index = index + LUA_CEMBED_INDEX_DIF; lua_getglobal(self->main_object->state,self->global_name); lua_pushinteger(self->main_object->state,formatted_index); lua_getglobal(self->main_object->state,sub_table->global_name); diff --git a/src/LuaCEmbed/table/table/sub_tables/key/fdeclare.key.h b/src/LuaCEmbed/table/table/sub_tables/key/fdeclare.key.h index 8e7f7c9..6903722 100644 --- a/src/LuaCEmbed/table/table/sub_tables/key/fdeclare.key.h +++ b/src/LuaCEmbed/table/table/sub_tables/key/fdeclare.key.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../../imports/imports.typesD.h" -//silver_chain_scope_end LuaCEmbedTable *LuaCEmbedTable_new_sub_table_by_key(LuaCEmbedTable *self, const char *name); diff --git a/src/LuaCEmbed/table/table/sub_tables/key/fdefine.key.c b/src/LuaCEmbed/table/table/sub_tables/key/fdefine.key.c index 5477de5..bcb23e1 100644 --- a/src/LuaCEmbed/table/table/sub_tables/key/fdefine.key.c +++ b/src/LuaCEmbed/table/table/sub_tables/key/fdefine.key.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../../../imports/imports.fdeclare.h" -//silver_chain_scope_end LuaCEmbedTable *LuaCEmbedTable_new_sub_table_by_key(LuaCEmbedTable *self, const char *name){ PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL diff --git a/src/LuaCEmbed/table/table/typesB.table.h b/src/LuaCEmbed/table/table/typesB.table.h index bf8a23d..33ba6f2 100644 --- a/src/LuaCEmbed/table/table/typesB.table.h +++ b/src/LuaCEmbed/table/table/typesB.table.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../imports/imports.types.h" -//silver_chain_scope_end typedef struct { diff --git a/src/LuaCEmbed/table/table_array/fdeclare.table_array.h b/src/LuaCEmbed/table/table_array/fdeclare.table_array.h index 6b30a7f..f697719 100644 --- a/src/LuaCEmbed/table/table_array/fdeclare.table_array.h +++ b/src/LuaCEmbed/table/table_array/fdeclare.table_array.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../imports/imports.typesD.h" -//silver_chain_scope_end typedef struct { @@ -20,6 +16,6 @@ LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_global_name(privateLuaCEmbed LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_prop_name(privateLuaCEmbedTableArray *self, const char *name); -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_internal_index(privateLuaCEmbedTableArray *self, long internal_index); +LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_internal_index(privateLuaCEmbedTableArray *self, lua_Integer internal_index); void privateLuaCEmbedTableArray_free(privateLuaCEmbedTableArray *self); diff --git a/src/LuaCEmbed/table/table_array/fdefine.table_array.c b/src/LuaCEmbed/table/table_array/fdefine.table_array.c index b0ce909..3112793 100644 --- a/src/LuaCEmbed/table/table_array/fdefine.table_array.c +++ b/src/LuaCEmbed/table/table_array/fdefine.table_array.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../../imports/imports.fdeclare.h" -//silver_chain_scope_end privateLuaCEmbedTableArray *newprivateLuaCEmbedTableArray(){ @@ -45,8 +41,8 @@ LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_global_name(privateLuaCEmbed return NULL; } -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_internal_index(privateLuaCEmbedTableArray *self, long internal_index){ - for(int i = 0; i < self->size;i++){ +LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_internal_index(privateLuaCEmbedTableArray *self, lua_Integer internal_index){ + for(lua_Integer i = 0; i < self->size;i++){ LuaCEmbedTable *current_table = self->tables[i]; if(current_table->index == internal_index){ return current_table; diff --git a/src/LuaCEmbed/types.LuaCEmbed.h b/src/LuaCEmbed/types.LuaCEmbed.h index e049ec0..190e6eb 100644 --- a/src/LuaCEmbed/types.LuaCEmbed.h +++ b/src/LuaCEmbed/types.LuaCEmbed.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../imports/imports.macros.h" -//silver_chain_scope_end typedef struct LuaCEmbed{ lua_State *state; @@ -19,5 +15,3 @@ typedef struct LuaCEmbed{ bool field_protection; }LuaCEmbed; -int lua_cembed_timeout = -1; -LuaCEmbed *global_current_lua_embed_object; diff --git a/src/LuaCEmbedResponse/fdeclare.LuaCEmbedResponse.h b/src/LuaCEmbedResponse/fdeclare.LuaCEmbedResponse.h index 38bf311..1a026c6 100644 --- a/src/LuaCEmbedResponse/fdeclare.LuaCEmbedResponse.h +++ b/src/LuaCEmbedResponse/fdeclare.LuaCEmbedResponse.h @@ -1,19 +1,15 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../imports/imports.typesD.h" -//silver_chain_scope_end LuaCEmbedResponse *private_LuaCEmbedReturn_raw(); LuaCEmbedResponse * LuaCEmbed_send_str(const char *text); -LuaCEmbedResponse * LuaCEmbed_send_raw_string(const char *text,long size); +LuaCEmbedResponse * LuaCEmbed_send_raw_string(const char *text,lua_Integer size); LuaCEmbedResponse * LuaCEmbed_send_str_reference( const char *text); -LuaCEmbedResponse * LuaCEmbed_send_raw_string_reference(const char *text,long size); +LuaCEmbedResponse * LuaCEmbed_send_raw_string_reference(const char *text,lua_Integer size); LuaCEmbedResponse * LuaCEmbed_send_error(const char *format,...); @@ -29,7 +25,7 @@ LuaCEmbedResponse * LuaCEmbed_send_double(double value); LuaCEmbedResponse * LuaCEmbed_send_bool(bool value); -LuaCEmbedResponse * LuaCEmbed_send_long(long value); +LuaCEmbedResponse * LuaCEmbed_send_long(lua_Integer value); void private_LuaCEmbedResponse_free(LuaCEmbedResponse *self); diff --git a/src/LuaCEmbedResponse/fdefine.LuaCEmbedResponse.c b/src/LuaCEmbedResponse/fdefine.LuaCEmbedResponse.c index 5382447..59c0dad 100644 --- a/src/LuaCEmbedResponse/fdefine.LuaCEmbedResponse.c +++ b/src/LuaCEmbedResponse/fdefine.LuaCEmbedResponse.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../imports/imports.fdeclare.h" -//silver_chain_scope_end @@ -15,7 +11,7 @@ LuaCEmbedResponse *private_LuaCEmbedReturn_raw(){ LuaCEmbedResponse * LuaCEmbed_send_bool(bool value){ LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); self->type = PRIVATE_LUA_CEMBED_BOOL_RESPONSE; - self->num_val = (double)value; + self->int_val = value; return self; } @@ -30,7 +26,7 @@ LuaCEmbedResponse * LuaCEmbed_send_str(const char *text){ return self; } -LuaCEmbedResponse * LuaCEmbed_send_raw_string(const char *text,long size){ +LuaCEmbedResponse * LuaCEmbed_send_raw_string(const char *text,lua_Integer size){ LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; self->string_size = size; @@ -49,7 +45,7 @@ LuaCEmbedResponse * LuaCEmbed_send_str_reference(const char *text){ return self; } -LuaCEmbedResponse * LuaCEmbed_send_raw_string_reference(const char *text,long size){ +LuaCEmbedResponse * LuaCEmbed_send_raw_string_reference(const char *text,lua_Integer size){ LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; self->string_size = size; @@ -100,14 +96,14 @@ LuaCEmbedResponse * LuaCEmbed_send_evaluation(const char *code){ LuaCEmbedResponse * LuaCEmbed_send_double(double value){ LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); self->type = PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE; - self->num_val = value; + self->double_val = value; return self; } -LuaCEmbedResponse * LuaCEmbed_send_long(long value){ +LuaCEmbedResponse * LuaCEmbed_send_long(lua_Integer value){ LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); self->type = PRIVATE_LUA_CEMBED_LONG_RESPONSE; - self->num_val = (double)value; + self->int_val = value; return self; } diff --git a/src/LuaCEmbedResponse/types.LuaCembedResponse.h b/src/LuaCEmbedResponse/types.LuaCembedResponse.h index 57c6adc..082c0e1 100644 --- a/src/LuaCEmbedResponse/types.LuaCembedResponse.h +++ b/src/LuaCEmbedResponse/types.LuaCembedResponse.h @@ -1,15 +1,12 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../imports/imports.macros.h" -//silver_chain_scope_end typedef struct { int type; - double num_val; + double double_val; + lua_Integer int_val; bool its_string_ref; - long string_size; + lua_Integer string_size; char *string_val; }LuaCEmbedResponse; diff --git a/src/constants/consts.aplication.h b/src/constants/consts.aplication.h index ced248f..b55bbaa 100644 --- a/src/constants/consts.aplication.h +++ b/src/constants/consts.aplication.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../imports/imports.dependencies.h" -//silver_chain_scope_end #ifndef LUA_CEMBED_INDEX_DIF #define LUA_CEMBED_INDEX_DIF 1 #endif diff --git a/src/constants/consts.errors.h b/src/constants/consts.errors.h index 0be7aef..413b825 100644 --- a/src/constants/consts.errors.h +++ b/src/constants/consts.errors.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../imports/imports.dependencies.h" -//silver_chain_scope_end #define PRIVATE_LUA_CEMBED_TIMEOUT_ERROR "timeout error" diff --git a/src/constants/consts.lua_code.h b/src/constants/consts.lua_code.h index d7f39fa..cb8b693 100644 --- a/src/constants/consts.lua_code.h +++ b/src/constants/consts.lua_code.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../imports/imports.dependencies.h" -//silver_chain_scope_end #define PRIVATE_LUA_CEMBED_TOTAL_LIBS "private_lua_c_embed_total_running_libs" #define PRIVATE_LUA_CEMBED_STACK_LEVEL "private_lua_c_embed_stack_level" diff --git a/src/constants/consts.main_callback.h b/src/constants/consts.main_callback.h index 800a195..79ef00b 100644 --- a/src/constants/consts.main_callback.h +++ b/src/constants/consts.main_callback.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../imports/imports.dependencies.h" -//silver_chain_scope_end #define PRIVATE_LUACEMBED_NO_RETURN 0 #define PRIVATE_LUACEMBED_ONE_RETURN 1 diff --git a/src/constants/consts.responses.h b/src/constants/consts.responses.h index 799d128..4573573 100644 --- a/src/constants/consts.responses.h +++ b/src/constants/consts.responses.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../imports/imports.dependencies.h" -//silver_chain_scope_end #define PRIVATE_LUA_CEMBED_STRING_RESPONSE 1 #define PRIVATE_LUA_CEMBED_LONG_RESPONSE 2 #define PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE 3 diff --git a/src/constants/consts.types.h b/src/constants/consts.types.h index 22d744c..afe60f4 100644 --- a/src/constants/consts.types.h +++ b/src/constants/consts.types.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../imports/imports.dependencies.h" -//silver_chain_scope_end #define LUA_CEMBED_NOT_FOUND LUA_TNONE #define LUA_CEMBED_STRING LUA_TSTRING #define LUA_CEMBED_NUMBER LUA_TNUMBER diff --git a/src/dependencies.native.h b/src/dependencies.native.h deleted file mode 100644 index fe2a666..0000000 --- a/src/dependencies.native.h +++ /dev/null @@ -1,21 +0,0 @@ -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -#ifdef _WIN32 -#include -#else -#include -#include -#endif diff --git a/src/dependencies/UniversalGarbage.h b/src/dependencies/UniversalGarbage.h deleted file mode 100644 index 6ba5987..0000000 --- a/src/dependencies/UniversalGarbage.h +++ /dev/null @@ -1,321 +0,0 @@ - - - -#ifndef UNIVERSAL_GARBAGE_H - - -#include -#include -#include -#include - - - - - -#define UniversalGarbage_create_empty_struct(name,element_type) \ -(element_type*)malloc(sizeof(element_type)); \ -*name = (element_type){0}; - - -#define UniversalGarbage_cast(value) ((void**)&value) - - -#define UniversalGarbage_add(garbage,deallocator_callback,value) \ - rawUniversalGarbage_add(garbage,(void*)deallocator_callback,UniversalGarbage_cast(value)) - -#define UniversalGarbage_add_simple(garbage,value) \ - UniversalGarbage_add(garbage,free,value) - - -#define UniversalGarbage_add_return(garbage,deallocator_callback,value) \ - UniversalGarbage_add(garbage->return_values,deallocator_callback,value) - - -#define UniversalGarbage_add_simple_return(garbage,value) \ - UniversalGarbage_add_simple(garbage->return_values,value) - - - -#define UniversalGarbage_remove(garbage,value) \ - rawUniversalGarbage_remove(garbage,UniversalGarbage_cast(value)); - - -#define UniversalGarbage_disconnect(garbage,value) \ - rawUniversalGarbage_disconnect(garbage,UniversalGarbage_cast(value)); - - - - -#define UniversalGarbage_reallocate(garbage,value) \ - rawUniversalGarbage_reallocate(garbage,UniversalGarbage_cast(value)) - - -#define UniversalGarbage_resset(garbage,value) \ - rawUniversalGarbage_resset(garbage,UniversalGarbage_cast(value)) - - - - - - -typedef struct privateUniversalGarbageElement{ - void **pointer; - void (*deallocator_callback)(void *element); - void *pointed_value; -}privateUniversalGarbageElement; - -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self); - - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self); - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer); - - - -typedef struct UniversalGarbage{ - - struct UniversalGarbage *return_values; - privateUniversalGarbageElement **elements; - int elements_size; - bool is_the_root; - -}UniversalGarbage; - -UniversalGarbage * newUniversalGarbage(); - -UniversalGarbage * private_new_MainUniversalGarbage(); - - - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer); - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self); - -void UniversalGarbage_free_including_return(UniversalGarbage *self); - -void UniversalGarbage_free(UniversalGarbage *self); - - - - - - - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer){ - - privateUniversalGarbageElement * self = UniversalGarbage_create_empty_struct( - self, - privateUniversalGarbageElement - ); - self->pointer = pointer; - self->deallocator_callback = dealocator_callback; - self->pointed_value = *pointer; - return self; -} -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self){ - if(self->pointed_value){ - self->deallocator_callback(self->pointed_value); - self->pointed_value = NULL; - } -} - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self){ - private_UniversalGarbageSimpleElement_free_pointed_value(self); - free(self); -} - - -UniversalGarbage * private_new_MainUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->is_the_root = false; - return self; -} - -UniversalGarbage * newUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->is_the_root = true; - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->return_values =private_new_MainUniversalGarbage(); - - return self; -} - - - - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - - if(rawUniversalGarbage_reallocate(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - - privateUniversalGarbageElement *current = self->elements[i]; - bool reallocate = current->pointer == pointer; - - if(reallocate){ - current->pointed_value = *pointer; - return true; - } - } - return false; -} - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - if(rawUniversalGarbage_resset(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - bool resset = current->pointer == pointer; - if(resset){ - private_UniversalGarbageSimpleElement_free_pointed_value(current); - current->pointed_value = *pointer; - return true; - } - } - return false; - -} -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_remove(self->return_values,pointer)){ - *pointer = NULL; - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - private_UniversalGarbageSimpleElement_free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - - } - *pointer = NULL; - return true; - } - } - return false; -} -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_disconnect(self->return_values,pointer)){ - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - } - return true; - } - } - return false; - - - -} -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer){ - - if(!pointer){ - return false; - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - return false; - } - } - - self->elements = (privateUniversalGarbageElement**)realloc( - self->elements, - (self->elements_size + 1) * sizeof(privateUniversalGarbageElement*) - ); - void (*dealocator_callback)(void *element); -#ifdef __cplusplus - dealocator_callback =reinterpret_cast(release_callback); -#else - dealocator_callback = (void*)(void*)release_callback; - -#endif - - - - self->elements[self->elements_size] = private_newUniversalGarbageSimpleElement(dealocator_callback, pointer); - self->elements_size+=1; - return true; -} - - - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self){ - for(int i = 0; i < self->elements_size; i++){ - private_UniversalGarbageSimpleElement_free(self->elements[i]); - } - free(self->elements); -} - -void UniversalGarbage_free_including_return(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - if(self->is_the_root){ - UniversalGarbage_free(self->return_values); - } - free(self); -} - -void UniversalGarbage_free(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - - if(self->is_the_root){ - - UniversalGarbage *return_garbage = self->return_values; - for(int i = 0; i < return_garbage->elements_size; i++){ - free(return_garbage->elements[i]); - } - - free(return_garbage->elements); - free(return_garbage); - } - - - free(self); -} - - - - -#define UNIVERSAL_GARBAGE_H -#endif \ No newline at end of file diff --git a/src/dependencies/dependencies.all.h b/src/dependencies/dependencies.all.h deleted file mode 100644 index b15fa41..0000000 --- a/src/dependencies/dependencies.all.h +++ /dev/null @@ -1,5 +0,0 @@ -#include "UniversalGarbage.h" - - -#include "lua/onelua.c" - diff --git a/src/dependencies/lua/custom_math/custom_math.c b/src/dependencies/lua/custom_math/custom_math.c deleted file mode 100644 index 0f2654b..0000000 --- a/src/dependencies/lua/custom_math/custom_math.c +++ /dev/null @@ -1,240 +0,0 @@ - -// Função que multiplica um número de ponto flutuante por 2 elevado a um expoente -double private_lua_cembed_ldexp(double x, int exp) { - if (x == 0.0) return x; - - while (exp > 0) { - x *= 2.0; - exp--; - } - while (exp < 0) { - x *= 0.5; - exp++; - } - - return x; -} - -double private_lua_cembed_frexp(double x, int *exp) { - *exp = 0; - if (x == 0.0) return x; - - while (x >= 1.0 || x < -1.0) { - x *= 0.5; - (*exp)++; - } - while (x < 0.5 && x != 0.0) { - x /= 0.5; - (*exp)--; - } - - return x; -} -double private_lua_cembed_asin(double x) { - if (x <= -1.0 || x >= 1.0) { - return x / 0.0; // Retorna NaN para x fora do intervalo [-1, 1] - } - - return private_lua_cembed_atan2(x, private_lua_cembed_sqrt(1.0 - x * x)); -} - -double private_lua_cembed_acos(double x) { - if (x <= -1.0 || x >= 1.0) { - return x / 0.0; // Retorna NaN para x fora do intervalo [-1, 1] - } - - return 1.5707963267948966 - private_lua_cembed_asin(x); -} - -double private_lua_cembed_atan2(double y, double x) { - if (x == 0.0 && y == 0.0) { - return y / x; // Retorna NaN para x = 0 e y = 0 - } - - double abs_y = private_lua_cembed_fabs(y); - double angle; - if (x >= 0.0) { - double r = (x - abs_y) / (x + abs_y); - angle = 0.7853981633974483 - 0.7853981633974483 * r; - } else { - double r = (x + abs_y) / (abs_y - x); - angle = 2.356194490192345 + 0.7853981633974483 * r; - } - if (y < 0.0) { - return -angle; - } else { - return angle; - } -} - -double private_lua_cembed_ceil(double x) { - double f = private_lua_embed_floor(x); - if (f >= x) { - return f; - } else { - return f + 1.0; - } -} - -double private_lua_cembed_sqrt(double x) { - if (x < 0.0) { - return x / 0.0; // Retorna NaN para x < 0 - } - - double x_half = 0.5 * x; - long i = *(long*)&x; - i = 0x5fe6ec85e7de30da - (i >> 1); - x = *(double*)&i; - x = x * (1.5 - x_half * x * x); - - return 1.0 / x; -} - -double private_lua_cembed_exp(double x) { - double result = 1.0; - double term = 1.0; - int i = 1; - - while (term > 1.0e-15) { - term *= x / i; - result += term; - i++; - } - - return result; -} - -double private_lua_cembed_fabs(double x) { - return x < 0.0 ? -x : x; -} - -double private_lua_cembed_factorial(int n) { - if (n <= 1) { - return 1.0; - } - double result = 1.0; - for (int i = 2; i <= n; ++i) { - result *= i; - } - return result; -} - -double private_lua_cembed_sin(double x) { - double result = 0.0; - int n = 0; - double term = x; - double current_term = term; - double term_squared = term * term; - - while (current_term > 1.0e-15) { - result += current_term; - n += 2; - term *= -term_squared / ((n + 1) * (n + 2)); - current_term = term / private_lua_cembed_factorial(n); - } - - return result; -} - -double private_lua_cembed_cos(double x) { - double result = 0.0; - int n = 0; - double term = 1.0; - double current_term = term; - double term_squared = term * term; - - while (current_term > 1.0e-15) { - result += current_term; - n += 2; - term *= -term_squared / (n * (n + 1)); - current_term = term / private_lua_cembed_factorial(n); - } - - return result; -} - -double private_lua_cembed_tan(double x) { - return private_lua_cembed_sin(x) / private_lua_cembed_cos(x); -} - -double private_lua_cembed_log(double x) { - if (x <= 0.0) { - return -1.0 / 0.0; - } - - double result = 0.0; - double term = (x - 1) / (x + 1); - double current_term = term; - double term_squared = term * term; - int n = 1; - - while (current_term > 1.0e-15) { - result += current_term / n; - current_term *= term_squared; - n += 2; - } - - result *= 2.302585092994046; - return result; -} - -double private_lua_cembed_log2(double x) { - if (x <= 0.0) { - return -1.0 / 0.0; - } - - return private_lua_cembed_log(x) / private_lua_cembed_log(2.0); -} - -double private_lua_embed_log10(double x) { - if (x <= 0.0) { - return -1.0 / 0.0; - } - - return private_lua_cembed_log(x) / private_lua_cembed_log(10.0); -} - -double private_lua_embed_fmod(double x, double y) { - while (y != 0.0) { - while (x >= y) { - x -= y; - } - if (x < y) { - return x; - } - } - return 0.0 / 0.0; -} - -double private_lua_embed_pow(double b, double e) { - double result = 1.0; - int i; - - if (e == 0.0) { - return 1.0; - } - if (e < 0.0) { - b = 1.0 / b; - e = -e; - } - - for (i = 0; i < e; i++) { - result *= b; - } - - return result; -} - -double private_lua_embed_floor(double x) { - int i = (int)x; - - if (x == (double)i) { - return x; - } - - if (x < 0.0) { - return (double)(i - 1); - } - - return (double)i; -} diff --git a/src/dependencies/lua/custom_math/custom_math.h b/src/dependencies/lua/custom_math/custom_math.h deleted file mode 100644 index c7164e3..0000000 --- a/src/dependencies/lua/custom_math/custom_math.h +++ /dev/null @@ -1,45 +0,0 @@ - -// Função que multiplica um número de ponto flutuante por 2 elevado a um expoente -double private_lua_cembed_ldexp(double x, int exp); - -double private_lua_cembed_frexp(double x, int *exp); - -double private_lua_cembed_asin(double x); - -double private_lua_cembed_acos(double x); - - -double private_lua_cembed_atan2(double y, double x); - - -double private_lua_cembed_ceil(double x); - - -double private_lua_cembed_sqrt(double x); - -double private_lua_cembed_exp(double x); - -double private_lua_cembed_fabs(double x); - - -double private_lua_cembed_factorial(int n); - -double private_lua_cembed_sin(double x); - - -double private_lua_cembed_cos(double x); - - -double private_lua_cembed_tan(double x); - -double private_lua_cembed_log(double x); - -double private_lua_cembed_log2(double x); - -double private_lua_embed_log10(double x); - -double private_lua_embed_fmod(double x, double y); - -double private_lua_embed_pow(double b, double e); - -double private_lua_embed_floor(double x); \ No newline at end of file diff --git a/src/dependencies/lua/lapi.c b/src/dependencies/lua/lapi.c deleted file mode 100644 index 5de3767..0000000 --- a/src/dependencies/lua/lapi.c +++ /dev/null @@ -1,1471 +0,0 @@ -/* -** $Id: lapi.c $ -** Lua API -** See Copyright Notice in lua.h -*/ - -#define lapi_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lundump.h" -#include "lvm.h" - - - -const char lua_ident[] = - "$LuaVersion: " LUA_COPYRIGHT " $" - "$LuaAuthors: " LUA_AUTHORS " $"; - - - -/* -** Test for a valid index (one that is not the 'nilvalue'). -** '!ttisnil(o)' implies 'o != &G(L)->nilvalue', so it is not needed. -** However, it covers the most common cases in a faster way. -*/ -#define isvalid(L, o) (!ttisnil(o) || o != &G(L)->nilvalue) - - -/* test for pseudo index */ -#define ispseudo(i) ((i) <= LUA_REGISTRYINDEX) - -/* test for upvalue */ -#define isupvalue(i) ((i) < LUA_REGISTRYINDEX) - - -/* Advance the garbage collector when creating large objects */ -static void advancegc (lua_State *L, size_t delta) { - delta >>= 5; /* one object for each 32 bytes (empirical) */ - if (delta > 0) { - global_State *g = G(L); - luaE_setdebt(g, g->GCdebt - delta); - } -} - - -/* -** Convert an acceptable index to a pointer to its respective value. -** Non-valid indices return the special nil value 'G(L)->nilvalue'. -*/ -static TValue *index2value (lua_State *L, int idx) { - CallInfo *ci = L->ci; - if (idx > 0) { - StkId o = ci->func.p + idx; - api_check(L, idx <= ci->top.p - (ci->func.p + 1), "unacceptable index"); - if (o >= L->top.p) return &G(L)->nilvalue; - else return s2v(o); - } - else if (!ispseudo(idx)) { /* negative index */ - api_check(L, idx != 0 && -idx <= L->top.p - (ci->func.p + 1), - "invalid index"); - return s2v(L->top.p + idx); - } - else if (idx == LUA_REGISTRYINDEX) - return &G(L)->l_registry; - else { /* upvalues */ - idx = LUA_REGISTRYINDEX - idx; - api_check(L, idx <= MAXUPVAL + 1, "upvalue index too large"); - if (ttisCclosure(s2v(ci->func.p))) { /* C closure? */ - CClosure *func = clCvalue(s2v(ci->func.p)); - return (idx <= func->nupvalues) ? &func->upvalue[idx-1] - : &G(L)->nilvalue; - } - else { /* light C function or Lua function (through a hook)?) */ - api_check(L, ttislcf(s2v(ci->func.p)), "caller not a C function"); - return &G(L)->nilvalue; /* no upvalues */ - } - } -} - - - -/* -** Convert a valid actual index (not a pseudo-index) to its address. -*/ -static StkId index2stack (lua_State *L, int idx) { - CallInfo *ci = L->ci; - if (idx > 0) { - StkId o = ci->func.p + idx; - api_check(L, o < L->top.p, "invalid index"); - return o; - } - else { /* non-positive index */ - api_check(L, idx != 0 && -idx <= L->top.p - (ci->func.p + 1), - "invalid index"); - api_check(L, !ispseudo(idx), "invalid index"); - return L->top.p + idx; - } -} - - -LUA_API int lua_checkstack (lua_State *L, int n) { - int res; - CallInfo *ci; - lua_lock(L); - ci = L->ci; - api_check(L, n >= 0, "negative 'n'"); - if (L->stack_last.p - L->top.p > n) /* stack large enough? */ - res = 1; /* yes; check is OK */ - else /* need to grow stack */ - res = luaD_growstack(L, n, 0); - if (res && ci->top.p < L->top.p + n) - ci->top.p = L->top.p + n; /* adjust frame top */ - lua_unlock(L); - return res; -} - - -LUA_API void lua_xmove (lua_State *from, lua_State *to, int n) { - int i; - if (from == to) return; - lua_lock(to); - api_checkpop(from, n); - api_check(from, G(from) == G(to), "moving among independent states"); - api_check(from, to->ci->top.p - to->top.p >= n, "stack overflow"); - from->top.p -= n; - for (i = 0; i < n; i++) { - setobjs2s(to, to->top.p, from->top.p + i); - to->top.p++; /* stack already checked by previous 'api_check' */ - } - lua_unlock(to); -} - - -LUA_API lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf) { - lua_CFunction old; - lua_lock(L); - old = G(L)->panic; - G(L)->panic = panicf; - lua_unlock(L); - return old; -} - - -LUA_API lua_Number lua_version (lua_State *L) { - UNUSED(L); - return LUA_VERSION_NUM; -} - - - -/* -** basic stack manipulation -*/ - - -/* -** convert an acceptable stack index into an absolute index -*/ -LUA_API int lua_absindex (lua_State *L, int idx) { - return (idx > 0 || ispseudo(idx)) - ? idx - : cast_int(L->top.p - L->ci->func.p) + idx; -} - - -LUA_API int lua_gettop (lua_State *L) { - return cast_int(L->top.p - (L->ci->func.p + 1)); -} - - -LUA_API void lua_settop (lua_State *L, int idx) { - CallInfo *ci; - StkId func, newtop; - ptrdiff_t diff; /* difference for new top */ - lua_lock(L); - ci = L->ci; - func = ci->func.p; - if (idx >= 0) { - api_check(L, idx <= ci->top.p - (func + 1), "new top too large"); - diff = ((func + 1) + idx) - L->top.p; - for (; diff > 0; diff--) - setnilvalue(s2v(L->top.p++)); /* clear new slots */ - } - else { - api_check(L, -(idx+1) <= (L->top.p - (func + 1)), "invalid new top"); - diff = idx + 1; /* will "subtract" index (as it is negative) */ - } - newtop = L->top.p + diff; - if (diff < 0 && L->tbclist.p >= newtop) { - lua_assert(hastocloseCfunc(ci->nresults)); - newtop = luaF_close(L, newtop, CLOSEKTOP, 0); - } - L->top.p = newtop; /* correct top only after closing any upvalue */ - lua_unlock(L); -} - - -LUA_API void lua_closeslot (lua_State *L, int idx) { - StkId level; - lua_lock(L); - level = index2stack(L, idx); - api_check(L, hastocloseCfunc(L->ci->nresults) && L->tbclist.p == level, - "no variable to close at given level"); - level = luaF_close(L, level, CLOSEKTOP, 0); - setnilvalue(s2v(level)); - lua_unlock(L); -} - - -/* -** Reverse the stack segment from 'from' to 'to' -** (auxiliary to 'lua_rotate') -** Note that we move(copy) only the value inside the stack. -** (We do not move additional fields that may exist.) -*/ -static void reverse (lua_State *L, StkId from, StkId to) { - for (; from < to; from++, to--) { - TValue temp; - setobj(L, &temp, s2v(from)); - setobjs2s(L, from, to); - setobj2s(L, to, &temp); - } -} - - -/* -** Let x = AB, where A is a prefix of length 'n'. Then, -** rotate x n == BA. But BA == (A^r . B^r)^r. -*/ -LUA_API void lua_rotate (lua_State *L, int idx, int n) { - StkId p, t, m; - lua_lock(L); - t = L->top.p - 1; /* end of stack segment being rotated */ - p = index2stack(L, idx); /* start of segment */ - api_check(L, L->tbclist.p < p, "moving a to-be-closed slot"); - api_check(L, (n >= 0 ? n : -n) <= (t - p + 1), "invalid 'n'"); - m = (n >= 0 ? t - n : p - n - 1); /* end of prefix */ - reverse(L, p, m); /* reverse the prefix with length 'n' */ - reverse(L, m + 1, t); /* reverse the suffix */ - reverse(L, p, t); /* reverse the entire segment */ - lua_unlock(L); -} - - -LUA_API void lua_copy (lua_State *L, int fromidx, int toidx) { - TValue *fr, *to; - lua_lock(L); - fr = index2value(L, fromidx); - to = index2value(L, toidx); - api_check(L, isvalid(L, to), "invalid index"); - setobj(L, to, fr); - if (isupvalue(toidx)) /* function upvalue? */ - luaC_barrier(L, clCvalue(s2v(L->ci->func.p)), fr); - /* LUA_REGISTRYINDEX does not need gc barrier - (collector revisits it before finishing collection) */ - lua_unlock(L); -} - - -LUA_API void lua_pushvalue (lua_State *L, int idx) { - lua_lock(L); - setobj2s(L, L->top.p, index2value(L, idx)); - api_incr_top(L); - lua_unlock(L); -} - - - -/* -** access functions (stack -> C) -*/ - - -LUA_API int lua_type (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (isvalid(L, o) ? ttype(o) : LUA_TNONE); -} - - -LUA_API const char *lua_typename (lua_State *L, int t) { - UNUSED(L); - api_check(L, LUA_TNONE <= t && t < LUA_NUMTYPES, "invalid type"); - return ttypename(t); -} - - -LUA_API int lua_iscfunction (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttislcf(o) || (ttisCclosure(o))); -} - - -LUA_API int lua_isinteger (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return ttisinteger(o); -} - - -LUA_API int lua_isnumber (lua_State *L, int idx) { - lua_Number n; - const TValue *o = index2value(L, idx); - return tonumber(o, &n); -} - - -LUA_API int lua_isstring (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttisstring(o) || cvt2str(o)); -} - - -LUA_API int lua_isuserdata (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttisfulluserdata(o) || ttislightuserdata(o)); -} - - -LUA_API int lua_rawequal (lua_State *L, int index1, int index2) { - const TValue *o1 = index2value(L, index1); - const TValue *o2 = index2value(L, index2); - return (isvalid(L, o1) && isvalid(L, o2)) ? luaV_rawequalobj(o1, o2) : 0; -} - - -LUA_API void lua_arith (lua_State *L, int op) { - lua_lock(L); - if (op != LUA_OPUNM && op != LUA_OPBNOT) - api_checkpop(L, 2); /* all other operations expect two operands */ - else { /* for unary operations, add fake 2nd operand */ - api_checkpop(L, 1); - setobjs2s(L, L->top.p, L->top.p - 1); - api_incr_top(L); - } - /* first operand at top - 2, second at top - 1; result go to top - 2 */ - luaO_arith(L, op, s2v(L->top.p - 2), s2v(L->top.p - 1), L->top.p - 2); - L->top.p--; /* pop second operand */ - lua_unlock(L); -} - - -LUA_API int lua_compare (lua_State *L, int index1, int index2, int op) { - const TValue *o1; - const TValue *o2; - int i = 0; - lua_lock(L); /* may call tag method */ - o1 = index2value(L, index1); - o2 = index2value(L, index2); - if (isvalid(L, o1) && isvalid(L, o2)) { - switch (op) { - case LUA_OPEQ: i = luaV_equalobj(L, o1, o2); break; - case LUA_OPLT: i = luaV_lessthan(L, o1, o2); break; - case LUA_OPLE: i = luaV_lessequal(L, o1, o2); break; - default: api_check(L, 0, "invalid option"); - } - } - lua_unlock(L); - return i; -} - - -LUA_API size_t lua_stringtonumber (lua_State *L, const char *s) { - size_t sz = luaO_str2num(s, s2v(L->top.p)); - if (sz != 0) - api_incr_top(L); - return sz; -} - - -LUA_API lua_Number lua_tonumberx (lua_State *L, int idx, int *pisnum) { - lua_Number n = 0; - const TValue *o = index2value(L, idx); - int isnum = tonumber(o, &n); - if (pisnum) - *pisnum = isnum; - return n; -} - - -LUA_API lua_Integer lua_tointegerx (lua_State *L, int idx, int *pisnum) { - lua_Integer res = 0; - const TValue *o = index2value(L, idx); - int isnum = tointeger(o, &res); - if (pisnum) - *pisnum = isnum; - return res; -} - - -LUA_API int lua_toboolean (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return !l_isfalse(o); -} - - -LUA_API const char *lua_tolstring (lua_State *L, int idx, size_t *len) { - TValue *o; - lua_lock(L); - o = index2value(L, idx); - if (!ttisstring(o)) { - if (!cvt2str(o)) { /* not convertible? */ - if (len != NULL) *len = 0; - lua_unlock(L); - return NULL; - } - luaO_tostring(L, o); - luaC_checkGC(L); - o = index2value(L, idx); /* previous call may reallocate the stack */ - } - lua_unlock(L); - if (len != NULL) - return getlstr(tsvalue(o), *len); - else - return getstr(tsvalue(o)); -} - - -LUA_API lua_Unsigned lua_rawlen (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - switch (ttypetag(o)) { - case LUA_VSHRSTR: return tsvalue(o)->shrlen; - case LUA_VLNGSTR: return tsvalue(o)->u.lnglen; - case LUA_VUSERDATA: return uvalue(o)->len; - case LUA_VTABLE: return luaH_getn(hvalue(o)); - default: return 0; - } -} - - -LUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - if (ttislcf(o)) return fvalue(o); - else if (ttisCclosure(o)) - return clCvalue(o)->f; - else return NULL; /* not a C function */ -} - - -l_sinline void *touserdata (const TValue *o) { - switch (ttype(o)) { - case LUA_TUSERDATA: return getudatamem(uvalue(o)); - case LUA_TLIGHTUSERDATA: return pvalue(o); - default: return NULL; - } -} - - -LUA_API void *lua_touserdata (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return touserdata(o); -} - - -LUA_API lua_State *lua_tothread (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (!ttisthread(o)) ? NULL : thvalue(o); -} - - -/* -** Returns a pointer to the internal representation of an object. -** Note that ANSI C does not allow the conversion of a pointer to -** function to a 'void*', so the conversion here goes through -** a 'size_t'. (As the returned pointer is only informative, this -** conversion should not be a problem.) -*/ -LUA_API const void *lua_topointer (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - switch (ttypetag(o)) { - case LUA_VLCF: return cast_voidp(cast_sizet(fvalue(o))); - case LUA_VUSERDATA: case LUA_VLIGHTUSERDATA: - return touserdata(o); - default: { - if (iscollectable(o)) - return gcvalue(o); - else - return NULL; - } - } -} - - - -/* -** push functions (C -> stack) -*/ - - -LUA_API void lua_pushnil (lua_State *L) { - lua_lock(L); - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushnumber (lua_State *L, lua_Number n) { - lua_lock(L); - setfltvalue(s2v(L->top.p), n); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushinteger (lua_State *L, lua_Integer n) { - lua_lock(L); - setivalue(s2v(L->top.p), n); - api_incr_top(L); - lua_unlock(L); -} - - -/* -** Pushes on the stack a string with given length. Avoid using 's' when -** 'len' == 0 (as 's' can be NULL in that case), due to later use of -** 'memcmp' and 'memcpy'. -*/ -LUA_API const char *lua_pushlstring (lua_State *L, const char *s, size_t len) { - TString *ts; - lua_lock(L); - ts = (len == 0) ? luaS_new(L, "") : luaS_newlstr(L, s, len); - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - advancegc(L, len); - luaC_checkGC(L); - lua_unlock(L); - return getstr(ts); -} - - -LUA_API const char *lua_pushextlstring (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud) { - TString *ts; - lua_lock(L); - api_check(L, s[len] == '\0', "string not ending with zero"); - ts = luaS_newextlstr (L, s, len, falloc, ud); - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - if (falloc != NULL) /* non-static string? */ - advancegc(L, len); /* count its memory */ - luaC_checkGC(L); - lua_unlock(L); - return getstr(ts); -} - - -LUA_API const char *lua_pushstring (lua_State *L, const char *s) { - lua_lock(L); - if (s == NULL) - setnilvalue(s2v(L->top.p)); - else { - TString *ts; - ts = luaS_new(L, s); - setsvalue2s(L, L->top.p, ts); - s = getstr(ts); /* internal copy's address */ - } - api_incr_top(L); - luaC_checkGC(L); - lua_unlock(L); - return s; -} - - -LUA_API const char *lua_pushvfstring (lua_State *L, const char *fmt, - va_list argp) { - const char *ret; - lua_lock(L); - ret = luaO_pushvfstring(L, fmt, argp); - luaC_checkGC(L); - lua_unlock(L); - return ret; -} - - -LUA_API const char *lua_pushfstring (lua_State *L, const char *fmt, ...) { - const char *ret; - va_list argp; - lua_lock(L); - va_start(argp, fmt); - ret = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - luaC_checkGC(L); - lua_unlock(L); - return ret; -} - - -LUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) { - lua_lock(L); - if (n == 0) { - setfvalue(s2v(L->top.p), fn); - api_incr_top(L); - } - else { - int i; - CClosure *cl; - api_checkpop(L, n); - api_check(L, n <= MAXUPVAL, "upvalue index too large"); - cl = luaF_newCclosure(L, n); - cl->f = fn; - for (i = 0; i < n; i++) { - setobj2n(L, &cl->upvalue[i], s2v(L->top.p - n + i)); - /* does not need barrier because closure is white */ - lua_assert(iswhite(cl)); - } - L->top.p -= n; - setclCvalue(L, s2v(L->top.p), cl); - api_incr_top(L); - luaC_checkGC(L); - } - lua_unlock(L); -} - - -LUA_API void lua_pushboolean (lua_State *L, int b) { - lua_lock(L); - if (b) - setbtvalue(s2v(L->top.p)); - else - setbfvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushlightuserdata (lua_State *L, void *p) { - lua_lock(L); - setpvalue(s2v(L->top.p), p); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API int lua_pushthread (lua_State *L) { - lua_lock(L); - setthvalue(L, s2v(L->top.p), L); - api_incr_top(L); - lua_unlock(L); - return (G(L)->mainthread == L); -} - - - -/* -** get functions (Lua -> stack) -*/ - - -static int auxgetstr (lua_State *L, const TValue *t, const char *k) { - int tag; - TString *str = luaS_new(L, k); - luaV_fastget(t, str, s2v(L->top.p), luaH_getstr, tag); - if (!tagisempty(tag)) { - api_incr_top(L); - } - else { - setsvalue2s(L, L->top.p, str); - api_incr_top(L); - tag = luaV_finishget(L, t, s2v(L->top.p - 1), L->top.p - 1, tag); - } - lua_unlock(L); - return novariant(tag); -} - - -static void getGlobalTable (lua_State *L, TValue *gt) { - Table *registry = hvalue(&G(L)->l_registry); - int tag = luaH_getint(registry, LUA_RIDX_GLOBALS, gt); - (void)tag; /* avoid not-used warnings when checks are off */ - api_check(L, novariant(tag) == LUA_TTABLE, "global table must exist"); -} - - -LUA_API int lua_getglobal (lua_State *L, const char *name) { - TValue gt; - lua_lock(L); - getGlobalTable(L, >); - return auxgetstr(L, >, name); -} - - -LUA_API int lua_gettable (lua_State *L, int idx) { - int tag; - TValue *t; - lua_lock(L); - api_checkpop(L, 1); - t = index2value(L, idx); - luaV_fastget(t, s2v(L->top.p - 1), s2v(L->top.p - 1), luaH_get, tag); - if (tagisempty(tag)) - tag = luaV_finishget(L, t, s2v(L->top.p - 1), L->top.p - 1, tag); - lua_unlock(L); - return novariant(tag); -} - - -LUA_API int lua_getfield (lua_State *L, int idx, const char *k) { - lua_lock(L); - return auxgetstr(L, index2value(L, idx), k); -} - - -LUA_API int lua_geti (lua_State *L, int idx, lua_Integer n) { - TValue *t; - int tag; - lua_lock(L); - t = index2value(L, idx); - luaV_fastgeti(t, n, s2v(L->top.p), tag); - if (tagisempty(tag)) { - TValue key; - setivalue(&key, n); - tag = luaV_finishget(L, t, &key, L->top.p, tag); - } - api_incr_top(L); - lua_unlock(L); - return novariant(tag); -} - - -static int finishrawget (lua_State *L, int tag) { - if (tagisempty(tag)) /* avoid copying empty items to the stack */ - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); - return novariant(tag); -} - - -l_sinline Table *gettable (lua_State *L, int idx) { - TValue *t = index2value(L, idx); - api_check(L, ttistable(t), "table expected"); - return hvalue(t); -} - - -LUA_API int lua_rawget (lua_State *L, int idx) { - Table *t; - int tag; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - tag = luaH_get(t, s2v(L->top.p - 1), s2v(L->top.p - 1)); - L->top.p--; /* pop key */ - return finishrawget(L, tag); -} - - -LUA_API int lua_rawgeti (lua_State *L, int idx, lua_Integer n) { - Table *t; - int tag; - lua_lock(L); - t = gettable(L, idx); - luaH_fastgeti(t, n, s2v(L->top.p), tag); - return finishrawget(L, tag); -} - - -LUA_API int lua_rawgetp (lua_State *L, int idx, const void *p) { - Table *t; - TValue k; - lua_lock(L); - t = gettable(L, idx); - setpvalue(&k, cast_voidp(p)); - return finishrawget(L, luaH_get(t, &k, s2v(L->top.p))); -} - - -LUA_API void lua_createtable (lua_State *L, unsigned narray, unsigned nrec) { - Table *t; - lua_lock(L); - t = luaH_new(L); - sethvalue2s(L, L->top.p, t); - api_incr_top(L); - if (narray > 0 || nrec > 0) - luaH_resize(L, t, narray, nrec); - luaC_checkGC(L); - lua_unlock(L); -} - - -LUA_API int lua_getmetatable (lua_State *L, int objindex) { - const TValue *obj; - Table *mt; - int res = 0; - lua_lock(L); - obj = index2value(L, objindex); - switch (ttype(obj)) { - case LUA_TTABLE: - mt = hvalue(obj)->metatable; - break; - case LUA_TUSERDATA: - mt = uvalue(obj)->metatable; - break; - default: - mt = G(L)->mt[ttype(obj)]; - break; - } - if (mt != NULL) { - sethvalue2s(L, L->top.p, mt); - api_incr_top(L); - res = 1; - } - lua_unlock(L); - return res; -} - - -LUA_API int lua_getiuservalue (lua_State *L, int idx, int n) { - TValue *o; - int t; - lua_lock(L); - o = index2value(L, idx); - api_check(L, ttisfulluserdata(o), "full userdata expected"); - if (n <= 0 || n > uvalue(o)->nuvalue) { - setnilvalue(s2v(L->top.p)); - t = LUA_TNONE; - } - else { - setobj2s(L, L->top.p, &uvalue(o)->uv[n - 1].uv); - t = ttype(s2v(L->top.p)); - } - api_incr_top(L); - lua_unlock(L); - return t; -} - - -/* -** set functions (stack -> Lua) -*/ - -/* -** t[k] = value at the top of the stack (where 'k' is a string) -*/ -static void auxsetstr (lua_State *L, const TValue *t, const char *k) { - int hres; - TString *str = luaS_new(L, k); - api_checkpop(L, 1); - luaV_fastset(t, str, s2v(L->top.p - 1), hres, luaH_psetstr); - if (hres == HOK) { - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - L->top.p--; /* pop value */ - } - else { - setsvalue2s(L, L->top.p, str); /* push 'str' (to make it a TValue) */ - api_incr_top(L); - luaV_finishset(L, t, s2v(L->top.p - 1), s2v(L->top.p - 2), hres); - L->top.p -= 2; /* pop value and key */ - } - lua_unlock(L); /* lock done by caller */ -} - - -LUA_API void lua_setglobal (lua_State *L, const char *name) { - TValue gt; - lua_lock(L); /* unlock done in 'auxsetstr' */ - getGlobalTable(L, >); - auxsetstr(L, >, name); -} - - -LUA_API void lua_settable (lua_State *L, int idx) { - TValue *t; - int hres; - lua_lock(L); - api_checkpop(L, 2); - t = index2value(L, idx); - luaV_fastset(t, s2v(L->top.p - 2), s2v(L->top.p - 1), hres, luaH_pset); - if (hres == HOK) { - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - } - else - luaV_finishset(L, t, s2v(L->top.p - 2), s2v(L->top.p - 1), hres); - L->top.p -= 2; /* pop index and value */ - lua_unlock(L); -} - - -LUA_API void lua_setfield (lua_State *L, int idx, const char *k) { - lua_lock(L); /* unlock done in 'auxsetstr' */ - auxsetstr(L, index2value(L, idx), k); -} - - -LUA_API void lua_seti (lua_State *L, int idx, lua_Integer n) { - TValue *t; - int hres; - lua_lock(L); - api_checkpop(L, 1); - t = index2value(L, idx); - luaV_fastseti(t, n, s2v(L->top.p - 1), hres); - if (hres == HOK) - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - else { - TValue temp; - setivalue(&temp, n); - luaV_finishset(L, t, &temp, s2v(L->top.p - 1), hres); - } - L->top.p--; /* pop value */ - lua_unlock(L); -} - - -static void aux_rawset (lua_State *L, int idx, TValue *key, int n) { - Table *t; - lua_lock(L); - api_checkpop(L, n); - t = gettable(L, idx); - luaH_set(L, t, key, s2v(L->top.p - 1)); - invalidateTMcache(t); - luaC_barrierback(L, obj2gco(t), s2v(L->top.p - 1)); - L->top.p -= n; - lua_unlock(L); -} - - -LUA_API void lua_rawset (lua_State *L, int idx) { - aux_rawset(L, idx, s2v(L->top.p - 2), 2); -} - - -LUA_API void lua_rawsetp (lua_State *L, int idx, const void *p) { - TValue k; - setpvalue(&k, cast_voidp(p)); - aux_rawset(L, idx, &k, 1); -} - - -LUA_API void lua_rawseti (lua_State *L, int idx, lua_Integer n) { - Table *t; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - luaH_setint(L, t, n, s2v(L->top.p - 1)); - luaC_barrierback(L, obj2gco(t), s2v(L->top.p - 1)); - L->top.p--; - lua_unlock(L); -} - - -LUA_API int lua_setmetatable (lua_State *L, int objindex) { - TValue *obj; - Table *mt; - lua_lock(L); - api_checkpop(L, 1); - obj = index2value(L, objindex); - if (ttisnil(s2v(L->top.p - 1))) - mt = NULL; - else { - api_check(L, ttistable(s2v(L->top.p - 1)), "table expected"); - mt = hvalue(s2v(L->top.p - 1)); - } - switch (ttype(obj)) { - case LUA_TTABLE: { - hvalue(obj)->metatable = mt; - if (mt) { - luaC_objbarrier(L, gcvalue(obj), mt); - luaC_checkfinalizer(L, gcvalue(obj), mt); - } - break; - } - case LUA_TUSERDATA: { - uvalue(obj)->metatable = mt; - if (mt) { - luaC_objbarrier(L, uvalue(obj), mt); - luaC_checkfinalizer(L, gcvalue(obj), mt); - } - break; - } - default: { - G(L)->mt[ttype(obj)] = mt; - break; - } - } - L->top.p--; - lua_unlock(L); - return 1; -} - - -LUA_API int lua_setiuservalue (lua_State *L, int idx, int n) { - TValue *o; - int res; - lua_lock(L); - api_checkpop(L, 1); - o = index2value(L, idx); - api_check(L, ttisfulluserdata(o), "full userdata expected"); - if (!(cast_uint(n) - 1u < cast_uint(uvalue(o)->nuvalue))) - res = 0; /* 'n' not in [1, uvalue(o)->nuvalue] */ - else { - setobj(L, &uvalue(o)->uv[n - 1].uv, s2v(L->top.p - 1)); - luaC_barrierback(L, gcvalue(o), s2v(L->top.p - 1)); - res = 1; - } - L->top.p--; - lua_unlock(L); - return res; -} - - -/* -** 'load' and 'call' functions (run Lua code) -*/ - - -#define checkresults(L,na,nr) \ - api_check(L, (nr) == LUA_MULTRET \ - || (L->ci->top.p - L->top.p >= (nr) - (na)), \ - "results from function overflow current stack size") - - -LUA_API void lua_callk (lua_State *L, int nargs, int nresults, - lua_KContext ctx, lua_KFunction k) { - StkId func; - lua_lock(L); - api_check(L, k == NULL || !isLua(L->ci), - "cannot use continuations inside hooks"); - api_checkpop(L, nargs + 1); - api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); - checkresults(L, nargs, nresults); - func = L->top.p - (nargs+1); - if (k != NULL && yieldable(L)) { /* need to prepare continuation? */ - L->ci->u.c.k = k; /* save continuation */ - L->ci->u.c.ctx = ctx; /* save context */ - luaD_call(L, func, nresults); /* do the call */ - } - else /* no continuation or no yieldable */ - luaD_callnoyield(L, func, nresults); /* just do the call */ - adjustresults(L, nresults); - lua_unlock(L); -} - - - -/* -** Execute a protected call. -*/ -struct CallS { /* data to 'f_call' */ - StkId func; - int nresults; -}; - - -static void f_call (lua_State *L, void *ud) { - struct CallS *c = cast(struct CallS *, ud); - luaD_callnoyield(L, c->func, c->nresults); -} - - - -LUA_API int lua_pcallk (lua_State *L, int nargs, int nresults, int errfunc, - lua_KContext ctx, lua_KFunction k) { - struct CallS c; - int status; - ptrdiff_t func; - lua_lock(L); - api_check(L, k == NULL || !isLua(L->ci), - "cannot use continuations inside hooks"); - api_checkpop(L, nargs + 1); - api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); - checkresults(L, nargs, nresults); - if (errfunc == 0) - func = 0; - else { - StkId o = index2stack(L, errfunc); - api_check(L, ttisfunction(s2v(o)), "private_lua_error handler must be a function"); - func = savestack(L, o); - } - c.func = L->top.p - (nargs+1); /* function to be called */ - if (k == NULL || !yieldable(L)) { /* no continuation or no yieldable? */ - c.nresults = nresults; /* do a 'conventional' protected call */ - status = luaD_pcall(L, f_call, &c, savestack(L, c.func), func); - } - else { /* prepare continuation (call is already protected by 'resume') */ - CallInfo *ci = L->ci; - ci->u.c.k = k; /* save continuation */ - ci->u.c.ctx = ctx; /* save context */ - /* save information for error recovery */ - ci->u2.funcidx = cast_int(savestack(L, c.func)); - ci->u.c.old_errfunc = L->errfunc; - L->errfunc = func; - setoah(ci->callstatus, L->allowhook); /* save value of 'allowhook' */ - ci->callstatus |= CIST_YPCALL; /* function can do error recovery */ - luaD_call(L, c.func, nresults); /* do the call */ - ci->callstatus &= ~CIST_YPCALL; - L->errfunc = ci->u.c.old_errfunc; - status = LUA_OK; /* if it is here, there were no errors */ - } - adjustresults(L, nresults); - lua_unlock(L); - return status; -} - - -LUA_API int lua_load (lua_State *L, lua_Reader reader, void *data, - const char *chunkname, const char *mode) { - ZIO z; - int status; - lua_lock(L); - if (!chunkname) chunkname = "?"; - luaZ_init(L, &z, reader, data); - status = luaD_protectedparser(L, &z, chunkname, mode); - if (status == LUA_OK) { /* no errors? */ - LClosure *f = clLvalue(s2v(L->top.p - 1)); /* get new function */ - if (f->nupvalues >= 1) { /* does it have an upvalue? */ - /* get global table from registry */ - TValue gt; - getGlobalTable(L, >); - /* set global table as 1st upvalue of 'f' (may be LUA_ENV) */ - setobj(L, f->upvals[0]->v.p, >); - luaC_barrier(L, f->upvals[0], >); - } - } - lua_unlock(L); - return status; -} - - -/* -** Dump a Lua function, calling 'writer' to write its parts. Ensure -** the stack returns with its original size. -*/ -LUA_API int lua_dump (lua_State *L, lua_Writer writer, void *data, int strip) { - int status; - ptrdiff_t otop = savestack(L, L->top.p); /* original top */ - TValue *f = s2v(L->top.p - 1); /* function to be dumped */ - lua_lock(L); - api_checkpop(L, 1); - api_check(L, isLfunction(f), "Lua function expected"); - status = luaU_dump(L, clLvalue(f)->p, writer, data, strip); - L->top.p = restorestack(L, otop); /* restore top */ - lua_unlock(L); - return status; -} - - -LUA_API int lua_status (lua_State *L) { - return L->status; -} - - -/* -** Garbage-collection function -*/ -LUA_API int lua_gc (lua_State *L, int what, ...) { - va_list argp; - int res = 0; - global_State *g = G(L); - if (g->gcstp & (GCSTPGC | GCSTPCLS)) /* internal stop? */ - return -1; /* all options are invalid when stopped */ - lua_lock(L); - va_start(argp, what); - switch (what) { - case LUA_GCSTOP: { - g->gcstp = GCSTPUSR; /* stopped by the user */ - break; - } - case LUA_GCRESTART: { - luaE_setdebt(g, 0); - g->gcstp = 0; /* (other bits must be zero here) */ - break; - } - case LUA_GCCOLLECT: { - luaC_fullgc(L, 0); - break; - } - case LUA_GCCOUNT: { - /* GC values are expressed in Kbytes: #bytes/2^10 */ - res = cast_int(g->totalbytes >> 10); - break; - } - case LUA_GCCOUNTB: { - res = cast_int(g->totalbytes & 0x3ff); - break; - } - case LUA_GCSTEP: { - lu_byte oldstp = g->gcstp; - l_obj n = va_arg(argp, int); - int work = 0; /* true if GC did some work */ - g->gcstp = 0; /* allow GC to run (other bits must be zero here) */ - if (n <= 0) - n = g->GCdebt; /* force to run one basic step */ - luaE_setdebt(g, g->GCdebt - n); - luaC_condGC(L, (void)0, work = 1); - if (work && g->gcstate == GCSpause) /* end of cycle? */ - res = 1; /* signal it */ - g->gcstp = oldstp; /* restore previous state */ - break; - } - case LUA_GCISRUNNING: { - res = gcrunning(g); - break; - } - case LUA_GCGEN: { - res = (g->gckind == KGC_INC) ? LUA_GCINC : LUA_GCGEN; - luaC_changemode(L, KGC_GENMINOR); - break; - } - case LUA_GCINC: { - res = (g->gckind == KGC_INC) ? LUA_GCINC : LUA_GCGEN; - luaC_changemode(L, KGC_INC); - break; - } - case LUA_GCPARAM: { - int param = va_arg(argp, int); - int value = va_arg(argp, int); - api_check(L, 0 <= param && param < LUA_GCPN, "invalid parameter"); - res = cast_int(luaO_applyparam(g->gcparams[param], 100)); - if (value >= 0) - g->gcparams[param] = luaO_codeparam(value); - break; - } - default: res = -1; /* invalid option */ - } - va_end(argp); - lua_unlock(L); - return res; -} - - - -/* -** miscellaneous functions -*/ - - -LUA_API int lua_error (lua_State *L) { - TValue *errobj; - lua_lock(L); - errobj = s2v(L->top.p - 1); - api_checkpop(L, 1); - /* error object is the memory error message? */ - if (ttisshrstring(errobj) && eqshrstr(tsvalue(errobj), G(L)->memerrmsg)) - luaM_error(L); /* raise a memory error */ - else - luaG_errormsg(L); /* raise a regular error */ - /* code unreachable; will unlock when control actually leaves the kernel */ - return 0; /* to avoid warnings */ -} - - -LUA_API int lua_next (lua_State *L, int idx) { - Table *t; - int more; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - more = luaH_next(L, t, L->top.p - 1); - if (more) - api_incr_top(L); - else /* no more elements */ - L->top.p--; /* pop key */ - lua_unlock(L); - return more; -} - - -LUA_API void lua_toclose (lua_State *L, int idx) { - int nresults; - StkId o; - lua_lock(L); - o = index2stack(L, idx); - nresults = L->ci->nresults; - api_check(L, L->tbclist.p < o, "given index below or equal a marked one"); - luaF_newtbcupval(L, o); /* create new to-be-closed upvalue */ - if (!hastocloseCfunc(nresults)) /* function not marked yet? */ - L->ci->nresults = codeNresults(nresults); /* mark it */ - lua_assert(hastocloseCfunc(L->ci->nresults)); - lua_unlock(L); -} - - -LUA_API void lua_concat (lua_State *L, int n) { - lua_lock(L); - api_checknelems(L, n); - if (n > 0) { - luaV_concat(L, n); - luaC_checkGC(L); - } - else { /* nothing to concatenate */ - setsvalue2s(L, L->top.p, luaS_newlstr(L, "", 0)); /* push empty string */ - api_incr_top(L); - } - lua_unlock(L); -} - - -LUA_API void lua_len (lua_State *L, int idx) { - TValue *t; - lua_lock(L); - t = index2value(L, idx); - luaV_objlen(L, L->top.p, t); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API lua_Alloc lua_getallocf (lua_State *L, void **ud) { - lua_Alloc f; - lua_lock(L); - if (ud) *ud = G(L)->ud; - f = G(L)->frealloc; - lua_unlock(L); - return f; -} - - -LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud) { - lua_lock(L); - G(L)->ud = ud; - G(L)->frealloc = f; - lua_unlock(L); -} - - -void lua_setwarnf (lua_State *L, lua_WarnFunction f, void *ud) { - lua_lock(L); - G(L)->ud_warn = ud; - G(L)->warnf = f; - lua_unlock(L); -} - - -void lua_warning (lua_State *L, const char *msg, int tocont) { - lua_lock(L); - luaE_warning(L, msg, tocont); - lua_unlock(L); -} - - - -LUA_API void *lua_newuserdatauv (lua_State *L, size_t size, int nuvalue) { - Udata *u; - lua_lock(L); - api_check(L, 0 <= nuvalue && nuvalue < USHRT_MAX, "invalid value"); - u = luaS_newudata(L, size, nuvalue); - setuvalue(L, s2v(L->top.p), u); - api_incr_top(L); - advancegc(L, size); - luaC_checkGC(L); - lua_unlock(L); - return getudatamem(u); -} - - - -static const char *aux_upvalue (TValue *fi, int n, TValue **val, - GCObject **owner) { - switch (ttypetag(fi)) { - case LUA_VCCL: { /* C closure */ - CClosure *f = clCvalue(fi); - if (!(cast_uint(n) - 1u < cast_uint(f->nupvalues))) - return NULL; /* 'n' not in [1, f->nupvalues] */ - *val = &f->upvalue[n-1]; - if (owner) *owner = obj2gco(f); - return ""; - } - case LUA_VLCL: { /* Lua closure */ - LClosure *f = clLvalue(fi); - TString *name; - Proto *p = f->p; - if (!(cast_uint(n) - 1u < cast_uint(p->sizeupvalues))) - return NULL; /* 'n' not in [1, p->sizeupvalues] */ - *val = f->upvals[n-1]->v.p; - if (owner) *owner = obj2gco(f->upvals[n - 1]); - name = p->upvalues[n-1].name; - return (name == NULL) ? "(no name)" : getstr(name); - } - default: return NULL; /* not a closure */ - } -} - - -LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n) { - const char *name; - TValue *val = NULL; /* to avoid warnings */ - lua_lock(L); - name = aux_upvalue(index2value(L, funcindex), n, &val, NULL); - if (name) { - setobj2s(L, L->top.p, val); - api_incr_top(L); - } - lua_unlock(L); - return name; -} - - -LUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n) { - const char *name; - TValue *val = NULL; /* to avoid warnings */ - GCObject *owner = NULL; /* to avoid warnings */ - TValue *fi; - lua_lock(L); - fi = index2value(L, funcindex); - api_checknelems(L, 1); - name = aux_upvalue(fi, n, &val, &owner); - if (name) { - L->top.p--; - setobj(L, val, s2v(L->top.p)); - luaC_barrier(L, owner, val); - } - lua_unlock(L); - return name; -} - - -static UpVal **getupvalref (lua_State *L, int fidx, int n, LClosure **pf) { - static const UpVal *const nullup = NULL; - LClosure *f; - TValue *fi = index2value(L, fidx); - api_check(L, ttisLclosure(fi), "Lua function expected"); - f = clLvalue(fi); - if (pf) *pf = f; - if (1 <= n && n <= f->p->sizeupvalues) - return &f->upvals[n - 1]; /* get its upvalue pointer */ - else - return (UpVal**)&nullup; -} - - -LUA_API void *lua_upvalueid (lua_State *L, int fidx, int n) { - TValue *fi = index2value(L, fidx); - switch (ttypetag(fi)) { - case LUA_VLCL: { /* lua closure */ - return *getupvalref(L, fidx, n, NULL); - } - case LUA_VCCL: { /* C closure */ - CClosure *f = clCvalue(fi); - if (1 <= n && n <= f->nupvalues) - return &f->upvalue[n - 1]; - /* else */ - } /* FALLTHROUGH */ - case LUA_VLCF: - return NULL; /* light C functions have no upvalues */ - default: { - api_check(L, 0, "function expected"); - return NULL; - } - } -} - - -LUA_API void lua_upvaluejoin (lua_State *L, int fidx1, int n1, - int fidx2, int n2) { - LClosure *f1; - UpVal **up1 = getupvalref(L, fidx1, n1, &f1); - UpVal **up2 = getupvalref(L, fidx2, n2, NULL); - api_check(L, *up1 != NULL && *up2 != NULL, "invalid upvalue index"); - *up1 = *up2; - luaC_objbarrier(L, f1, *up1); -} - - diff --git a/src/dependencies/lua/lapi.h b/src/dependencies/lua/lapi.h deleted file mode 100644 index 757bf3d..0000000 --- a/src/dependencies/lua/lapi.h +++ /dev/null @@ -1,61 +0,0 @@ -/* -** $Id: lapi.h $ -** Auxiliary functions from Lua API -** See Copyright Notice in lua.h -*/ - -#ifndef lapi_h -#define lapi_h - - -#include "llimits.h" -#include "lstate.h" - - -/* Increments 'L->top.p', checking for stack overflows */ -#define api_incr_top(L) \ - (L->top.p++, api_check(L, L->top.p <= L->ci->top.p, "stack overflow")) - - -/* -** If a call returns too many multiple returns, the callee may not have -** stack space to accommodate all results. In this case, this macro -** increases its stack space ('L->ci->top.p'). -*/ -#define adjustresults(L,nres) \ - { if ((nres) <= LUA_MULTRET && L->ci->top.p < L->top.p) \ - L->ci->top.p = L->top.p; } - - -/* Ensure the stack has at least 'n' elements */ -#define api_checknelems(L,n) \ - api_check(L, (n) < (L->top.p - L->ci->func.p), \ - "not enough elements in the stack") - - -/* Ensure the stack has at least 'n' elements to be popped. (Some -** functions only update a slot after checking it for popping, but that -** is only an optimization for a pop followed by a push.) -*/ -#define api_checkpop(L,n) \ - api_check(L, (n) < L->top.p - L->ci->func.p && \ - L->tbclist.p < L->top.p - (n), \ - "not enough free elements in the stack") - - -/* -** To reduce the overhead of returning from C functions, the presence of -** to-be-closed variables in these functions is coded in the CallInfo's -** field 'nresults', in a way that functions with no to-be-closed variables -** with zero, one, or "all" wanted results have no overhead. Functions -** with other number of wanted results, as well as functions with -** variables to be closed, have an extra check. -*/ - -#define hastocloseCfunc(n) ((n) < LUA_MULTRET) - -/* Map [-1, inf) (range of 'nresults') into (-inf, -2] */ -#define codeNresults(n) (-(n) - 3) -#define decodeNresults(n) (-(n) - 3) - -#endif diff --git a/src/dependencies/lua/lauxlib.c b/src/dependencies/lua/lauxlib.c deleted file mode 100644 index 45d033b..0000000 --- a/src/dependencies/lua/lauxlib.c +++ /dev/null @@ -1,1184 +0,0 @@ -/* -** $Id: lauxlib.c $ -** Auxiliary functions for building Lua libraries -** See Copyright Notice in lua.h -*/ - -#define lauxlib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include - - -/* -** This file uses only the official API of Lua. -** Any function declared here could be written as an application function. -*/ - -#include "lua.h" - -#include "lauxlib.h" - - -#if !defined(MAX_SIZET) -/* maximum value for size_t */ -#define MAX_SIZET ((size_t)(~(size_t)0)) -#endif - - -/* -** {====================================================== -** Traceback -** ======================================================= -*/ - - -#define LEVELS1 10 /* size of the first part of the stack */ -#define LEVELS2 11 /* size of the second part of the stack */ - - - -/* -** Search for 'objidx' in table at index -1. ('objidx' must be an -** absolute index.) Return 1 + string at top if it found a good name. -*/ -static int findfield (lua_State *L, int objidx, int level) { - if (level == 0 || !lua_istable(L, -1)) - return 0; /* not found */ - lua_pushnil(L); /* start 'next' loop */ - while (lua_next(L, -2)) { /* for each pair in table */ - if (lua_type(L, -2) == LUA_TSTRING) { /* ignore non-string keys */ - if (lua_rawequal(L, objidx, -1)) { /* found object? */ - lua_pop(L, 1); /* remove value (but keep name) */ - return 1; - } - else if (findfield(L, objidx, level - 1)) { /* try recursively */ - /* stack: lib_name, lib_table, field_name (top) */ - lua_pushliteral(L, "."); /* place '.' between the two names */ - lua_replace(L, -3); /* (in the slot occupied by table) */ - lua_concat(L, 3); /* lib_name.field_name */ - return 1; - } - } - lua_pop(L, 1); /* remove value */ - } - return 0; /* not found */ -} - - -/* -** Search for a name for a function in all loaded modules -*/ -static int pushglobalfuncname (lua_State *L, lua_Debug *ar) { - int top = lua_gettop(L); - lua_getinfo(L, "f", ar); /* push function */ - lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - if (findfield(L, top + 1, 2)) { - const char *name = lua_tostring(L, -1); - if (strncmp(name, LUA_GNAME ".", 3) == 0) { /* name start with '_G.'? */ - lua_pushstring(L, name + 3); /* push name without prefix */ - lua_remove(L, -2); /* remove original name */ - } - lua_copy(L, -1, top + 1); /* copy name to proper place */ - lua_settop(L, top + 1); /* remove table "loaded" and name copy */ - return 1; - } - else { - lua_settop(L, top); /* remove function and global table */ - return 0; - } -} - - -static void pushfuncname (lua_State *L, lua_Debug *ar) { - if (pushglobalfuncname(L, ar)) { /* try first a global name */ - lua_pushfstring(L, "function '%s'", lua_tostring(L, -1)); - lua_remove(L, -2); /* remove name */ - } - else if (*ar->namewhat != '\0') /* is there a name from code? */ - lua_pushfstring(L, "%s '%s'", ar->namewhat, ar->name); /* use it */ - else if (*ar->what == 'm') /* main? */ - lua_pushliteral(L, "main chunk"); - else if (*ar->what != 'C') /* for Lua functions, use */ - lua_pushfstring(L, "function <%s:%d>", ar->short_src, ar->linedefined); - else /* nothing left... */ - lua_pushliteral(L, "?"); -} - - -static int lastlevel (lua_State *L) { - lua_Debug ar; - int li = 1, le = 1; - /* find an upper bound */ - while (lua_getstack(L, le, &ar)) { li = le; le *= 2; } - /* do a binary search */ - while (li < le) { - int m = (li + le)/2; - if (lua_getstack(L, m, &ar)) li = m + 1; - else le = m; - } - return le - 1; -} - - -LUALIB_API void luaL_traceback (lua_State *L, lua_State *L1, - const char *msg, int level) { - luaL_Buffer b; - lua_Debug ar; - int last = lastlevel(L1); - int limit2show = (last - level > LEVELS1 + LEVELS2) ? LEVELS1 : -1; - luaL_buffinit(L, &b); - if (msg) { - luaL_addstring(&b, msg); - luaL_addchar(&b, '\n'); - } - luaL_addstring(&b, "stack traceback:"); - while (lua_getstack(L1, level++, &ar)) { - if (limit2show-- == 0) { /* too many levels? */ - int n = last - level - LEVELS2 + 1; /* number of levels to skip */ - lua_pushfstring(L, "\n\t...\t(skipping %d levels)", n); - luaL_addvalue(&b); /* add warning about skip */ - level += n; /* and skip to last levels */ - } - else { - lua_getinfo(L1, "Slnt", &ar); - if (ar.currentline <= 0) - lua_pushfstring(L, "\n\t%s: in ", ar.short_src); - else - lua_pushfstring(L, "\n\t%s:%d: in ", ar.short_src, ar.currentline); - luaL_addvalue(&b); - pushfuncname(L, &ar); - luaL_addvalue(&b); - if (ar.istailcall) - luaL_addstring(&b, "\n\t(...tail calls...)"); - } - } - luaL_pushresult(&b); -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Error-report functions -** ======================================================= -*/ - -LUALIB_API int luaL_argerror (lua_State *L, int arg, const char *extramsg) { - lua_Debug ar; - if (!lua_getstack(L, 0, &ar)) /* no stack frame? */ - return luaL_error(L, "bad argument #%d (%s)", arg, extramsg); - lua_getinfo(L, "n", &ar); - if (strcmp(ar.namewhat, "method") == 0) { - arg--; /* do not count 'self' */ - if (arg == 0) /* error is in the self argument itself? */ - return luaL_error(L, "calling '%s' on bad self (%s)", - ar.name, extramsg); - } - if (ar.name == NULL) - ar.name = (pushglobalfuncname(L, &ar)) ? lua_tostring(L, -1) : "?"; - return luaL_error(L, "bad argument #%d to '%s' (%s)", - arg, ar.name, extramsg); -} - - -LUALIB_API int luaL_typeerror (lua_State *L, int arg, const char *tname) { - const char *msg; - const char *typearg; /* name for the type of the actual argument */ - if (luaL_getmetafield(L, arg, "__name") == LUA_TSTRING) - typearg = lua_tostring(L, -1); /* use the given type name */ - else if (lua_type(L, arg) == LUA_TLIGHTUSERDATA) - typearg = "light userdata"; /* special name for messages */ - else - typearg = luaL_typename(L, arg); /* standard name */ - msg = lua_pushfstring(L, "%s expected, got %s", tname, typearg); - return luaL_argerror(L, arg, msg); -} - - -static void tag_error (lua_State *L, int arg, int tag) { - luaL_typeerror(L, arg, lua_typename(L, tag)); -} - - -/* -** The use of 'lua_pushfstring' ensures this function does not -** need reserved stack space when called. -*/ -LUALIB_API void luaL_where (lua_State *L, int level) { - lua_Debug ar; - if (lua_getstack(L, level, &ar)) { /* check function at level */ - lua_getinfo(L, "Sl", &ar); /* get info about it */ - if (ar.currentline > 0) { /* is there info? */ - lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline); - return; - } - } - lua_pushfstring(L, ""); /* else, no information available... */ -} - - -/* -** Again, the use of 'lua_pushvfstring' ensures this function does -** not need reserved stack space when called. (At worst, it generates -** an error with "stack overflow" instead of the given message.) -*/ -LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) { - va_list argp; - va_start(argp, fmt); - luaL_where(L, 1); - lua_pushvfstring(L, fmt, argp); - va_end(argp); - lua_concat(L, 2); - return lua_error(L); -} - - -LUALIB_API int luaL_fileresult (lua_State *L, int stat, const char *fname) { - int en = errno; /* calls to Lua API may change this value */ - if (stat) { - lua_pushboolean(L, 1); - return 1; - } - else { - luaL_pushfail(L); - if (fname) - lua_pushfstring(L, "%s: %s", fname, strerror(en)); - else - lua_pushstring(L, strerror(en)); - lua_pushinteger(L, en); - return 3; - } -} - - -#if !defined(l_inspectstat) /* { */ - -#if defined(LUA_USE_POSIX) - -#include - -/* -** use appropriate macros to interpret 'pclose' return status -*/ -#define l_inspectstat(stat,what) \ - if (WIFEXITED(stat)) { stat = WEXITSTATUS(stat); } \ - else if (WIFSIGNALED(stat)) { stat = WTERMSIG(stat); what = "signal"; } - -#else - -#define l_inspectstat(stat,what) /* no op */ - -#endif - -#endif /* } */ - - -LUALIB_API int luaL_execresult (lua_State *L, int stat) { - if (stat != 0 && errno != 0) /* error with an 'errno'? */ - return luaL_fileresult(L, 0, NULL); - else { - const char *what = "exit"; /* type of termination */ - l_inspectstat(stat, what); /* interpret result */ - if (*what == 'e' && stat == 0) /* successful termination? */ - lua_pushboolean(L, 1); - else - luaL_pushfail(L); - lua_pushstring(L, what); - lua_pushinteger(L, stat); - return 3; /* return true/fail,what,code */ - } -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Userdata's metatable manipulation -** ======================================================= -*/ - -LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) { - if (luaL_getmetatable(L, tname) != LUA_TNIL) /* name already in use? */ - return 0; /* leave previous value on top, but return 0 */ - lua_pop(L, 1); - lua_createtable(L, 0, 2); /* create metatable */ - lua_pushstring(L, tname); - lua_setfield(L, -2, "__name"); /* metatable.__name = tname */ - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, tname); /* registry.name = metatable */ - return 1; -} - - -LUALIB_API void luaL_setmetatable (lua_State *L, const char *tname) { - luaL_getmetatable(L, tname); - lua_setmetatable(L, -2); -} - - -LUALIB_API void *luaL_testudata (lua_State *L, int ud, const char *tname) { - void *p = lua_touserdata(L, ud); - if (p != NULL) { /* value is a userdata? */ - if (lua_getmetatable(L, ud)) { /* does it have a metatable? */ - luaL_getmetatable(L, tname); /* get correct metatable */ - if (!lua_rawequal(L, -1, -2)) /* not the same? */ - p = NULL; /* value is a userdata with wrong metatable */ - lua_pop(L, 2); /* remove both metatables */ - return p; - } - } - return NULL; /* value is not a userdata with a metatable */ -} - - -LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) { - void *p = luaL_testudata(L, ud, tname); - luaL_argexpected(L, p != NULL, ud, tname); - return p; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Argument check functions -** ======================================================= -*/ - -LUALIB_API int luaL_checkoption (lua_State *L, int arg, const char *def, - const char *const lst[]) { - const char *name = (def) ? luaL_optstring(L, arg, def) : - luaL_checkstring(L, arg); - int i; - for (i=0; lst[i]; i++) - if (strcmp(lst[i], name) == 0) - return i; - return luaL_argerror(L, arg, - lua_pushfstring(L, "invalid option '%s'", name)); -} - - -/* -** Ensures the stack has at least 'space' extra slots, raising an error -** if it cannot fulfill the request. (The error handling needs a few -** extra slots to format the error message. In case of an error without -** this extra space, Lua will generate the same 'stack overflow' error, -** but without 'msg'.) -*/ -LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *msg) { - if (l_unlikely(!lua_checkstack(L, space))) { - if (msg) - luaL_error(L, "stack overflow (%s)", msg); - else - luaL_error(L, "stack overflow"); - } -} - - -LUALIB_API void luaL_checktype (lua_State *L, int arg, int t) { - if (l_unlikely(lua_type(L, arg) != t)) - tag_error(L, arg, t); -} - - -LUALIB_API void luaL_checkany (lua_State *L, int arg) { - if (l_unlikely(lua_type(L, arg) == LUA_TNONE)) - luaL_argerror(L, arg, "value expected"); -} - - -LUALIB_API const char *luaL_checklstring (lua_State *L, int arg, size_t *len) { - const char *s = lua_tolstring(L, arg, len); - if (l_unlikely(!s)) tag_error(L, arg, LUA_TSTRING); - return s; -} - - -LUALIB_API const char *luaL_optlstring (lua_State *L, int arg, - const char *def, size_t *len) { - if (lua_isnoneornil(L, arg)) { - if (len) - *len = (def ? strlen(def) : 0); - return def; - } - else return luaL_checklstring(L, arg, len); -} - - -LUALIB_API lua_Number luaL_checknumber (lua_State *L, int arg) { - int isnum; - lua_Number d = lua_tonumberx(L, arg, &isnum); - if (l_unlikely(!isnum)) - tag_error(L, arg, LUA_TNUMBER); - return d; -} - - -LUALIB_API lua_Number luaL_optnumber (lua_State *L, int arg, lua_Number def) { - return luaL_opt(L, luaL_checknumber, arg, def); -} - - -static void interror (lua_State *L, int arg) { - if (lua_isnumber(L, arg)) - luaL_argerror(L, arg, "number has no integer representation"); - else - tag_error(L, arg, LUA_TNUMBER); -} - - -LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int arg) { - int isnum; - lua_Integer d = lua_tointegerx(L, arg, &isnum); - if (l_unlikely(!isnum)) { - interror(L, arg); - } - return d; -} - - -LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int arg, - lua_Integer def) { - return luaL_opt(L, luaL_checkinteger, arg, def); -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Generic Buffer manipulation -** ======================================================= -*/ - -/* userdata to box arbitrary data */ -typedef struct UBox { - void *box; - size_t bsize; -} UBox; - - -/* Resize the buffer used by a box. Optimize for the common case of -** resizing to the old size. (For instance, __gc will resize the box -** to 0 even after it was closed. 'pushresult' may also resize it to a -** final size that is equal to the one set when the buffer was created.) -*/ -static void *resizebox (lua_State *L, int idx, size_t newsize) { - UBox *box = (UBox *)lua_touserdata(L, idx); - if (box->bsize == newsize) /* not changing size? */ - return box->box; /* keep the buffer */ - else { - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); - void *temp = allocf(ud, box->box, box->bsize, newsize); - if (l_unlikely(temp == NULL && newsize > 0)) { /* allocation error? */ - lua_pushliteral(L, "not enough memory"); - lua_error(L); /* raise a memory error */ - } - box->box = temp; - box->bsize = newsize; - return temp; - } -} - - -static int boxgc (lua_State *L) { - resizebox(L, 1, 0); - return 0; -} - - -static const luaL_Reg boxmt[] = { /* box metamethods */ - {"__gc", boxgc}, - {"__close", boxgc}, - {NULL, NULL} -}; - - -static void newbox (lua_State *L) { - UBox *box = (UBox *)lua_newuserdatauv(L, sizeof(UBox), 0); - box->box = NULL; - box->bsize = 0; - if (luaL_newmetatable(L, "_UBOX*")) /* creating metatable? */ - luaL_setfuncs(L, boxmt, 0); /* set its metamethods */ - lua_setmetatable(L, -2); -} - - -/* -** check whether buffer is using a userdata on the stack as a temporary -** buffer -*/ -#define buffonstack(B) ((B)->b != (B)->init.b) - - -/* -** Whenever buffer is accessed, slot 'idx' must either be a box (which -** cannot be NULL) or it is a placeholder for the buffer. -*/ -#define checkbufferlevel(B,idx) \ - lua_assert(buffonstack(B) ? lua_touserdata(B->L, idx) != NULL \ - : lua_touserdata(B->L, idx) == (void*)B) - - -/* -** Compute new size for buffer 'B', enough to accommodate extra 'sz' -** bytes plus one for a terminating zero. (The test for "not big enough" -** also gets the case when the computation of 'newsize' overflows.) -*/ -static size_t newbuffsize (luaL_Buffer *B, size_t sz) { - size_t newsize = (B->size / 2) * 3; /* buffer size * 1.5 */ - if (l_unlikely(MAX_SIZET - sz - 1 < B->n)) /* overflow in (B->n + sz + 1)? */ - return luaL_error(B->L, "buffer too large"); - if (newsize < B->n + sz + 1) /* not big enough? */ - newsize = B->n + sz + 1; - return newsize; -} - - -/* -** Returns a pointer to a free area with at least 'sz' bytes in buffer -** 'B'. 'boxidx' is the relative position in the stack where is the -** buffer's box or its placeholder. -*/ -static char *prepbuffsize (luaL_Buffer *B, size_t sz, int boxidx) { - checkbufferlevel(B, boxidx); - if (B->size - B->n >= sz) /* enough space? */ - return B->b + B->n; - else { - lua_State *L = B->L; - char *newbuff; - size_t newsize = newbuffsize(B, sz); - /* create larger buffer */ - if (buffonstack(B)) /* buffer already has a box? */ - newbuff = (char *)resizebox(L, boxidx, newsize); /* resize it */ - else { /* no box yet */ - lua_remove(L, boxidx); /* remove placeholder */ - newbox(L); /* create a new box */ - lua_insert(L, boxidx); /* move box to its intended position */ - lua_toclose(L, boxidx); - newbuff = (char *)resizebox(L, boxidx, newsize); - memcpy(newbuff, B->b, B->n * sizeof(char)); /* copy original content */ - } - B->b = newbuff; - B->size = newsize; - return newbuff + B->n; - } -} - -/* -** returns a pointer to a free area with at least 'sz' bytes -*/ -LUALIB_API char *luaL_prepbuffsize (luaL_Buffer *B, size_t sz) { - return prepbuffsize(B, sz, -1); -} - - -LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) { - if (l > 0) { /* avoid 'memcpy' when 's' can be NULL */ - char *b = prepbuffsize(B, l, -1); - memcpy(b, s, l * sizeof(char)); - luaL_addsize(B, l); - } -} - - -LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) { - luaL_addlstring(B, s, strlen(s)); -} - - -LUALIB_API void luaL_pushresult (luaL_Buffer *B) { - lua_State *L = B->L; - checkbufferlevel(B, -1); - if (!buffonstack(B)) /* using static buffer? */ - lua_pushlstring(L, B->b, B->n); /* save result as regular string */ - else { /* reuse buffer already allocated */ - UBox *box = (UBox *)lua_touserdata(L, -1); - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); /* function to free buffer */ - size_t len = B->n; /* final string length */ - char *s; - resizebox(L, -1, len + 1); /* adjust box size to content size */ - s = (char*)box->box; /* final buffer address */ - s[len] = '\0'; /* add ending zero */ - /* clear box, as 'lua_pushextlstring' will take control over buffer */ - box->bsize = 0; box->box = NULL; - lua_pushextlstring(L, s, len, allocf, ud); - lua_closeslot(L, -2); /* close the box */ - } - lua_remove(L, -2); /* remove box or placeholder from the stack */ -} - - -LUALIB_API void luaL_pushresultsize (luaL_Buffer *B, size_t sz) { - luaL_addsize(B, sz); - luaL_pushresult(B); -} - - -/* -** 'luaL_addvalue' is the only function in the Buffer system where the -** box (if existent) is not on the top of the stack. So, instead of -** calling 'luaL_addlstring', it replicates the code using -2 as the -** last argument to 'prepbuffsize', signaling that the box is (or will -** be) below the string being added to the buffer. (Box creation can -** trigger an emergency GC, so we should not remove the string from the -** stack before we have the space guaranteed.) -*/ -LUALIB_API void luaL_addvalue (luaL_Buffer *B) { - lua_State *L = B->L; - size_t len; - const char *s = lua_tolstring(L, -1, &len); - char *b = prepbuffsize(B, len, -2); - memcpy(b, s, len * sizeof(char)); - luaL_addsize(B, len); - lua_pop(L, 1); /* pop string */ -} - - -LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) { - B->L = L; - B->b = B->init.b; - B->n = 0; - B->size = LUAL_BUFFERSIZE; - lua_pushlightuserdata(L, (void*)B); /* push placeholder */ -} - - -LUALIB_API char *luaL_buffinitsize (lua_State *L, luaL_Buffer *B, size_t sz) { - luaL_buffinit(L, B); - return prepbuffsize(B, sz, -1); -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Reference system -** ======================================================= -*/ - -/* -** The previously freed references form a linked list: t[1] is the index -** of a first free index, t[t[1]] is the index of the second element, -** etc. A zero signals the end of the list. -*/ -LUALIB_API int luaL_ref (lua_State *L, int t) { - int ref; - if (lua_isnil(L, -1)) { - lua_pop(L, 1); /* remove from stack */ - return LUA_REFNIL; /* 'nil' has a unique fixed reference */ - } - t = lua_absindex(L, t); - if (lua_rawgeti(L, t, 1) == LUA_TNUMBER) /* already initialized? */ - ref = (int)lua_tointeger(L, -1); /* ref = t[1] */ - else { /* first access */ - lua_assert(!lua_toboolean(L, -1)); /* must be nil or false */ - ref = 0; /* list is empty */ - lua_pushinteger(L, 0); /* initialize as an empty list */ - lua_rawseti(L, t, 1); /* ref = t[1] = 0 */ - } - lua_pop(L, 1); /* remove element from stack */ - if (ref != 0) { /* any free element? */ - lua_rawgeti(L, t, ref); /* remove it from list */ - lua_rawseti(L, t, 1); /* (t[1] = t[ref]) */ - } - else /* no free elements */ - ref = (int)lua_rawlen(L, t) + 1; /* get a new reference */ - lua_rawseti(L, t, ref); - return ref; -} - - -LUALIB_API void luaL_unref (lua_State *L, int t, int ref) { - if (ref >= 0) { - t = lua_absindex(L, t); - lua_rawgeti(L, t, 1); - lua_assert(lua_isinteger(L, -1)); - lua_rawseti(L, t, ref); /* t[ref] = t[1] */ - lua_pushinteger(L, ref); - lua_rawseti(L, t, 1); /* t[1] = ref */ - } -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Load functions -** ======================================================= -*/ - -typedef struct LoadF { - int n; /* number of pre-read characters */ - FILE *f; /* file being read */ - char buff[BUFSIZ]; /* area for reading file */ -} LoadF; - - -static const char *getF (lua_State *L, void *ud, size_t *size) { - LoadF *lf = (LoadF *)ud; - (void)L; /* not used */ - if (lf->n > 0) { /* are there pre-read characters to be read? */ - *size = lf->n; /* return them (chars already in buffer) */ - lf->n = 0; /* no more pre-read characters */ - } - else { /* read a block from file */ - /* 'fread' can return > 0 *and* set the EOF flag. If next call to - 'getF' called 'fread', it might still wait for user input. - The next check avoids this problem. */ - if (feof(lf->f)) return NULL; - *size = fread(lf->buff, 1, sizeof(lf->buff), lf->f); /* read block */ - } - return lf->buff; -} - - -static int errfile (lua_State *L, const char *what, int fnameindex) { - const char *serr = strerror(errno); - const char *filename = lua_tostring(L, fnameindex) + 1; - lua_pushfstring(L, "cannot %s %s: %s", what, filename, serr); - lua_remove(L, fnameindex); - return LUA_ERRFILE; -} - - -/* -** Skip an optional BOM at the start of a stream. If there is an -** incomplete BOM (the first character is correct but the rest is -** not), returns the first character anyway to force an error -** (as no chunk can start with 0xEF). -*/ -static int skipBOM (FILE *f) { - int c = getc(f); /* read first character */ - if (c == 0xEF && getc(f) == 0xBB && getc(f) == 0xBF) /* correct BOM? */ - return getc(f); /* ignore BOM and return next char */ - else /* no (valid) BOM */ - return c; /* return first character */ -} - - -/* -** reads the first character of file 'f' and skips an optional BOM mark -** in its beginning plus its first line if it starts with '#'. Returns -** true if it skipped the first line. In any case, '*cp' has the -** first "valid" character of the file (after the optional BOM and -** a first-line comment). -*/ -static int skipcomment (FILE *f, int *cp) { - int c = *cp = skipBOM(f); - if (c == '#') { /* first line is a comment (Unix exec. file)? */ - do { /* skip first line */ - c = getc(f); - } while (c != EOF && c != '\n'); - *cp = getc(f); /* next character after comment, if present */ - return 1; /* there was a comment */ - } - else return 0; /* no comment */ -} - - -LUALIB_API int luaL_loadfilex (lua_State *L, const char *filename, - const char *mode) { - LoadF lf; - int status, readstatus; - int c; - int fnameindex = lua_gettop(L) + 1; /* index of filename on the stack */ - if (filename == NULL) { - lua_pushliteral(L, "=stdin"); - lf.f = stdin; - } - else { - lua_pushfstring(L, "@%s", filename); - lf.f = fopen(filename, "r"); - if (lf.f == NULL) return errfile(L, "open", fnameindex); - } - lf.n = 0; - if (skipcomment(lf.f, &c)) /* read initial portion */ - lf.buff[lf.n++] = '\n'; /* add newline to correct line numbers */ - if (c == LUA_SIGNATURE[0]) { /* binary file? */ - lf.n = 0; /* remove possible newline */ - if (filename) { /* "real" file? */ - lf.f = freopen(filename, "rb", lf.f); /* reopen in binary mode */ - if (lf.f == NULL) return errfile(L, "reopen", fnameindex); - skipcomment(lf.f, &c); /* re-read initial portion */ - } - } - if (c != EOF) - lf.buff[lf.n++] = c; /* 'c' is the first character of the stream */ - status = lua_load(L, getF, &lf, lua_tostring(L, -1), mode); - readstatus = ferror(lf.f); - if (filename) fclose(lf.f); /* close file (even in case of errors) */ - if (readstatus) { - lua_settop(L, fnameindex); /* ignore results from 'lua_load' */ - return errfile(L, "read", fnameindex); - } - lua_remove(L, fnameindex); - return status; -} - - -typedef struct LoadS { - const char *s; - size_t size; -} LoadS; - - -static const char *getS (lua_State *L, void *ud, size_t *size) { - LoadS *ls = (LoadS *)ud; - (void)L; /* not used */ - if (ls->size == 0) return NULL; - *size = ls->size; - ls->size = 0; - return ls->s; -} - - -LUALIB_API int luaL_loadbufferx (lua_State *L, const char *buff, size_t size, - const char *name, const char *mode) { - LoadS ls; - ls.s = buff; - ls.size = size; - return lua_load(L, getS, &ls, name, mode); -} - - -LUALIB_API int luaL_loadstring (lua_State *L, const char *s) { - return luaL_loadbuffer(L, s, strlen(s), s); -} - -/* }====================================================== */ - - - -LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) { - if (!lua_getmetatable(L, obj)) /* no metatable? */ - return LUA_TNIL; - else { - int tt; - lua_pushstring(L, event); - tt = lua_rawget(L, -2); - if (tt == LUA_TNIL) /* is metafield nil? */ - lua_pop(L, 2); /* remove metatable and metafield */ - else - lua_remove(L, -2); /* remove only metatable */ - return tt; /* return metafield type */ - } -} - - -LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) { - obj = lua_absindex(L, obj); - if (luaL_getmetafield(L, obj, event) == LUA_TNIL) /* no metafield? */ - return 0; - lua_pushvalue(L, obj); - lua_call(L, 1, 1); - return 1; -} - - -LUALIB_API lua_Integer luaL_len (lua_State *L, int idx) { - lua_Integer l; - int isnum; - lua_len(L, idx); - l = lua_tointegerx(L, -1, &isnum); - if (l_unlikely(!isnum)) - luaL_error(L, "object length is not an integer"); - lua_pop(L, 1); /* remove object */ - return l; -} - - -LUALIB_API const char *luaL_tolstring (lua_State *L, int idx, size_t *len) { - idx = lua_absindex(L,idx); - if (luaL_callmeta(L, idx, "__tostring")) { /* metafield? */ - if (!lua_isstring(L, -1)) - luaL_error(L, "'__tostring' must return a string"); - } - else { - switch (lua_type(L, idx)) { - case LUA_TNUMBER: { - if (lua_isinteger(L, idx)) - lua_pushfstring(L, "%I", (LUAI_UACINT)lua_tointeger(L, idx)); - else - lua_pushfstring(L, "%f", (LUAI_UACNUMBER)lua_tonumber(L, idx)); - break; - } - case LUA_TSTRING: - lua_pushvalue(L, idx); - break; - case LUA_TBOOLEAN: - lua_pushstring(L, (lua_toboolean(L, idx) ? "true" : "false")); - break; - case LUA_TNIL: - lua_pushliteral(L, "nil"); - break; - default: { - int tt = luaL_getmetafield(L, idx, "__name"); /* try name */ - const char *kind = (tt == LUA_TSTRING) ? lua_tostring(L, -1) : - luaL_typename(L, idx); - lua_pushfstring(L, "%s: %p", kind, lua_topointer(L, idx)); - if (tt != LUA_TNIL) - lua_remove(L, -2); /* remove '__name' */ - break; - } - } - } - return lua_tolstring(L, -1, len); -} - - -/* -** set functions from list 'l' into table at top - 'nup'; each -** function gets the 'nup' elements at the top as upvalues. -** Returns with only the table at the stack. -*/ -LUALIB_API void luaL_setfuncs (lua_State *L, const luaL_Reg *l, int nup) { - luaL_checkstack(L, nup, "too many upvalues"); - for (; l->name != NULL; l++) { /* fill the table with given functions */ - if (l->func == NULL) /* place holder? */ - lua_pushboolean(L, 0); - else { - int i; - for (i = 0; i < nup; i++) /* copy upvalues to the top */ - lua_pushvalue(L, -nup); - lua_pushcclosure(L, l->func, nup); /* closure with those upvalues */ - } - lua_setfield(L, -(nup + 2), l->name); - } - lua_pop(L, nup); /* remove upvalues */ -} - - -/* -** ensure that stack[idx][fname] has a table and push that table -** into the stack -*/ -LUALIB_API int luaL_getsubtable (lua_State *L, int idx, const char *fname) { - if (lua_getfield(L, idx, fname) == LUA_TTABLE) - return 1; /* table already there */ - else { - lua_pop(L, 1); /* remove previous result */ - idx = lua_absindex(L, idx); - lua_newtable(L); - lua_pushvalue(L, -1); /* copy to be left at top */ - lua_setfield(L, idx, fname); /* assign new table to field */ - return 0; /* false, because did not find table there */ - } -} - - -/* -** Stripped-down 'require': After checking "loaded" table, calls 'openf' -** to open a module, registers the result in 'package.loaded' table and, -** if 'glb' is true, also registers the result in the global table. -** Leaves resulting module on the top. -*/ -LUALIB_API void luaL_requiref (lua_State *L, const char *modname, - lua_CFunction openf, int glb) { - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_getfield(L, -1, modname); /* LOADED[modname] */ - if (!lua_toboolean(L, -1)) { /* package not already loaded? */ - lua_pop(L, 1); /* remove field */ - lua_pushcfunction(L, openf); - lua_pushstring(L, modname); /* argument to open function */ - lua_call(L, 1, 1); /* call 'openf' to open module */ - lua_pushvalue(L, -1); /* make copy of module (call result) */ - lua_setfield(L, -3, modname); /* LOADED[modname] = module */ - } - lua_remove(L, -2); /* remove LOADED table */ - if (glb) { - lua_pushvalue(L, -1); /* copy of module */ - lua_setglobal(L, modname); /* _G[modname] = module */ - } -} - - -LUALIB_API void luaL_addgsub (luaL_Buffer *b, const char *s, - const char *p, const char *r) { - const char *wild; - size_t l = strlen(p); - while ((wild = strstr(s, p)) != NULL) { - luaL_addlstring(b, s, wild - s); /* push prefix */ - luaL_addstring(b, r); /* push replacement in place of pattern */ - s = wild + l; /* continue after 'p' */ - } - luaL_addstring(b, s); /* push last suffix */ -} - - -LUALIB_API const char *luaL_gsub (lua_State *L, const char *s, - const char *p, const char *r) { - luaL_Buffer b; - luaL_buffinit(L, &b); - luaL_addgsub(&b, s, p, r); - luaL_pushresult(&b); - return lua_tostring(L, -1); -} - - -static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) { - (void)ud; (void)osize; /* not used */ - if (nsize == 0) { - free(ptr); - return NULL; - } - else - return realloc(ptr, nsize); -} - - -/* -** Standard panic funcion just prints an error message. The test -** with 'lua_type' avoids possible memory errors in 'lua_tostring'. -*/ -static int panic (lua_State *L) { - const char *msg = (lua_type(L, -1) == LUA_TSTRING) - ? lua_tostring(L, -1) - : "private_lua_error object is not a string"; - lua_writestringerror("PANIC: unprotected private_lua_error in call to Lua API (%s)\n", - msg); - return 0; /* return to Lua to abort */ -} - - -/* -** Warning functions: -** warnfoff: warning system is off -** warnfon: ready to start a new message -** warnfcont: previous message is to be continued -*/ -static void warnfoff (void *ud, const char *message, int tocont); -static void warnfon (void *ud, const char *message, int tocont); -static void warnfcont (void *ud, const char *message, int tocont); - - -/* -** Check whether message is a control message. If so, execute the -** control or ignore it if unknown. -*/ -static int checkcontrol (lua_State *L, const char *message, int tocont) { - if (tocont || *(message++) != '@') /* not a control message? */ - return 0; - else { - if (strcmp(message, "off") == 0) - lua_setwarnf(L, warnfoff, L); /* turn warnings off */ - else if (strcmp(message, "on") == 0) - lua_setwarnf(L, warnfon, L); /* turn warnings on */ - return 1; /* it was a control message */ - } -} - - -static void warnfoff (void *ud, const char *message, int tocont) { - checkcontrol((lua_State *)ud, message, tocont); -} - - -/* -** Writes the message and handle 'tocont', finishing the message -** if needed and setting the next warn function. -*/ -static void warnfcont (void *ud, const char *message, int tocont) { - lua_State *L = (lua_State *)ud; - lua_writestringerror("%s", message); /* write message */ - if (tocont) /* not the last part? */ - lua_setwarnf(L, warnfcont, L); /* to be continued */ - else { /* last part */ - lua_writestringerror("%s", "\n"); /* finish message with end-of-line */ - lua_setwarnf(L, warnfon, L); /* next call is a new message */ - } -} - - -static void warnfon (void *ud, const char *message, int tocont) { - if (checkcontrol((lua_State *)ud, message, tocont)) /* control message? */ - return; /* nothing else to be done */ - lua_writestringerror("%s", "Lua warning: "); /* start a new warning */ - warnfcont(ud, message, tocont); /* finish processing */ -} - - - -/* -** A function to compute an unsigned int with some level of -** randomness. Rely on Address Space Layout Randomization (if present) -** and the current time. -*/ -#if !defined(luai_makeseed) - -#include - - -/* Size for the buffer, in bytes */ -#define BUFSEEDB (sizeof(void*) + sizeof(time_t)) - -/* Size for the buffer in int's, rounded up */ -#define BUFSEED ((BUFSEEDB + sizeof(int) - 1) / sizeof(int)) - -/* -** Copy the contents of variable 'v' into the buffer pointed by 'b'. -** (The '&b[0]' disguises 'b' to fix an absurd warning from clang.) -*/ -#define addbuff(b,v) (memcpy(&b[0], &(v), sizeof(v)), b += sizeof(v)) - - -static unsigned int luai_makeseed (void) { - unsigned int buff[BUFSEED]; - unsigned int res; - unsigned int i; - time_t t = time(NULL); - char *b = (char*)buff; - addbuff(b, b); /* local variable's address */ - addbuff(b, t); /* time */ - /* fill (rare but possible) remain of the buffer with zeros */ - memset(b, 0, sizeof(buff) - BUFSEEDB); - res = buff[0]; - for (i = 1; i < BUFSEED; i++) - res ^= (res >> 3) + (res << 7) + buff[i]; - return res; -} - -#endif - - -LUALIB_API unsigned int luaL_makeseed (lua_State *L) { - (void)L; /* unused */ - return luai_makeseed(); -} - - -LUALIB_API lua_State *luaL_newstate (void) { - lua_State *L = lua_newstate(l_alloc, NULL, luai_makeseed()); - if (l_likely(L)) { - lua_atpanic(L, &panic); - lua_setwarnf(L, warnfoff, L); /* default is warnings off */ - } - return L; -} - - -LUALIB_API void luaL_checkversion_ (lua_State *L, lua_Number ver, size_t sz) { - lua_Number v = lua_version(L); - if (sz != LUAL_NUMSIZES) /* check numeric types */ - luaL_error(L, "core and library have incompatible numeric types"); - else if (v != ver) - luaL_error(L, "version mismatch: app. needs %f, Lua core provides %f", - (LUAI_UACNUMBER)ver, (LUAI_UACNUMBER)v); -} - diff --git a/src/dependencies/lua/lauxlib.h b/src/dependencies/lua/lauxlib.h deleted file mode 100644 index 3c37068..0000000 --- a/src/dependencies/lua/lauxlib.h +++ /dev/null @@ -1,303 +0,0 @@ -/* -** $Id: lauxlib.h $ -** Auxiliary functions for building Lua libraries -** See Copyright Notice in lua.h -*/ - - -#ifndef lauxlib_h -#define lauxlib_h - - -#include -#include - -#include "luaconf.h" -#include "lua.h" - - -/* global table */ -#define LUA_GNAME "_G" - - -typedef struct luaL_Buffer luaL_Buffer; - - -/* extra error code for 'luaL_loadfilex' */ -#define LUA_ERRFILE (LUA_ERRERR+1) - - -/* key, in the registry, for table of loaded modules */ -#define LUA_LOADED_TABLE "_LOADED" - - -/* key, in the registry, for table of preloaded loaders */ -#define LUA_PRELOAD_TABLE "_PRELOAD" - - -typedef struct luaL_Reg { - const char *name; - lua_CFunction func; -} luaL_Reg; - - -#define LUAL_NUMSIZES (sizeof(lua_Integer)*16 + sizeof(lua_Number)) - -LUALIB_API void (luaL_checkversion_) (lua_State *L, lua_Number ver, size_t sz); -#define luaL_checkversion(L) \ - luaL_checkversion_(L, LUA_VERSION_NUM, LUAL_NUMSIZES) - -LUALIB_API int (luaL_getmetafield) (lua_State *L, int obj, const char *e); -LUALIB_API int (luaL_callmeta) (lua_State *L, int obj, const char *e); -LUALIB_API const char *(luaL_tolstring) (lua_State *L, int idx, size_t *len); -LUALIB_API int (luaL_argerror) (lua_State *L, int arg, const char *extramsg); -LUALIB_API int (luaL_typeerror) (lua_State *L, int arg, const char *tname); -LUALIB_API const char *(luaL_checklstring) (lua_State *L, int arg, - size_t *l); -LUALIB_API const char *(luaL_optlstring) (lua_State *L, int arg, - const char *def, size_t *l); -LUALIB_API lua_Number (luaL_checknumber) (lua_State *L, int arg); -LUALIB_API lua_Number (luaL_optnumber) (lua_State *L, int arg, lua_Number def); - -LUALIB_API lua_Integer (luaL_checkinteger) (lua_State *L, int arg); -LUALIB_API lua_Integer (luaL_optinteger) (lua_State *L, int arg, - lua_Integer def); - -LUALIB_API void (luaL_checkstack) (lua_State *L, int sz, const char *msg); -LUALIB_API void (luaL_checktype) (lua_State *L, int arg, int t); -LUALIB_API void (luaL_checkany) (lua_State *L, int arg); - -LUALIB_API int (luaL_newmetatable) (lua_State *L, const char *tname); -LUALIB_API void (luaL_setmetatable) (lua_State *L, const char *tname); -LUALIB_API void *(luaL_testudata) (lua_State *L, int ud, const char *tname); -LUALIB_API void *(luaL_checkudata) (lua_State *L, int ud, const char *tname); - -LUALIB_API void (luaL_where) (lua_State *L, int lvl); -LUALIB_API int (luaL_error) (lua_State *L, const char *fmt, ...); - -LUALIB_API int (luaL_checkoption) (lua_State *L, int arg, const char *def, - const char *const lst[]); - -LUALIB_API int (luaL_fileresult) (lua_State *L, int stat, const char *fname); -LUALIB_API int (luaL_execresult) (lua_State *L, int stat); - - -/* predefined references */ -#define LUA_NOREF (-2) -#define LUA_REFNIL (-1) - -LUALIB_API int (luaL_ref) (lua_State *L, int t); -LUALIB_API void (luaL_unref) (lua_State *L, int t, int ref); - -LUALIB_API int (luaL_loadfilex) (lua_State *L, const char *filename, - const char *mode); - -#define luaL_loadfile(L,f) luaL_loadfilex(L,f,NULL) - -LUALIB_API int (luaL_loadbufferx) (lua_State *L, const char *buff, size_t sz, - const char *name, const char *mode); -LUALIB_API int (luaL_loadstring) (lua_State *L, const char *s); - -LUALIB_API lua_State *(luaL_newstate) (void); - -LUALIB_API unsigned luaL_makeseed (lua_State *L); - -LUALIB_API lua_Integer (luaL_len) (lua_State *L, int idx); - -LUALIB_API void (luaL_addgsub) (luaL_Buffer *b, const char *s, - const char *p, const char *r); -LUALIB_API const char *(luaL_gsub) (lua_State *L, const char *s, - const char *p, const char *r); - -LUALIB_API void (luaL_setfuncs) (lua_State *L, const luaL_Reg *l, int nup); - -LUALIB_API int (luaL_getsubtable) (lua_State *L, int idx, const char *fname); - -LUALIB_API void (luaL_traceback) (lua_State *L, lua_State *L1, - const char *msg, int level); - -LUALIB_API void (luaL_requiref) (lua_State *L, const char *modname, - lua_CFunction openf, int glb); - -/* -** =============================================================== -** some useful macros -** =============================================================== -*/ - - -#define luaL_newlibtable(L,l) \ - lua_createtable(L, 0, sizeof(l)/sizeof((l)[0]) - 1) - -#define luaL_newlib(L,l) \ - (luaL_checkversion(L), luaL_newlibtable(L,l), luaL_setfuncs(L,l,0)) - -#define luaL_argcheck(L, cond,arg,extramsg) \ - ((void)(luai_likely(cond) || luaL_argerror(L, (arg), (extramsg)))) - -#define luaL_argexpected(L,cond,arg,tname) \ - ((void)(luai_likely(cond) || luaL_typeerror(L, (arg), (tname)))) - -#define luaL_checkstring(L,n) (luaL_checklstring(L, (n), NULL)) -#define luaL_optstring(L,n,d) (luaL_optlstring(L, (n), (d), NULL)) - -#define luaL_typename(L,i) lua_typename(L, lua_type(L,(i))) - -#define luaL_dofile(L, fn) \ - (luaL_loadfile(L, fn) || lua_pcall(L, 0, LUA_MULTRET, 0)) - -#define luaL_dostring(L, s) \ - (luaL_loadstring(L, s) || lua_pcall(L, 0, LUA_MULTRET, 0)) - -#define luaL_getmetatable(L,n) (lua_getfield(L, LUA_REGISTRYINDEX, (n))) - -#define luaL_opt(L,f,n,d) (lua_isnoneornil(L,(n)) ? (d) : f(L,(n))) - -#define luaL_loadbuffer(L,s,sz,n) luaL_loadbufferx(L,s,sz,n,NULL) - - -/* -** Perform arithmetic operations on lua_Integer values with wrap-around -** semantics, as the Lua core does. -*/ -#define luaL_intop(op,v1,v2) \ - ((lua_Integer)((lua_Unsigned)(v1) op (lua_Unsigned)(v2))) - - -/* push the value used to represent failure/error */ -#define luaL_pushfail(L) lua_pushnil(L) - - -/* -** Internal assertions for in-house debugging -*/ -#if !defined(lua_assert) - -#if defined LUAI_ASSERT - #include - #define lua_assert(c) assert(c) -#else - #define lua_assert(c) ((void)0) -#endif - -#endif - - - -/* -** {====================================================== -** Generic Buffer manipulation -** ======================================================= -*/ - -struct luaL_Buffer { - char *b; /* buffer address */ - size_t size; /* buffer size */ - size_t n; /* number of characters in buffer */ - lua_State *L; - union { - LUAI_MAXALIGN; /* ensure maximum alignment for buffer */ - char b[LUAL_BUFFERSIZE]; /* initial buffer */ - } init; -}; - - -#define luaL_bufflen(bf) ((bf)->n) -#define luaL_buffaddr(bf) ((bf)->b) - - -#define luaL_addchar(B,c) \ - ((void)((B)->n < (B)->size || luaL_prepbuffsize((B), 1)), \ - ((B)->b[(B)->n++] = (c))) - -#define luaL_addsize(B,s) ((B)->n += (s)) - -#define luaL_buffsub(B,s) ((B)->n -= (s)) - -LUALIB_API void (luaL_buffinit) (lua_State *L, luaL_Buffer *B); -LUALIB_API char *(luaL_prepbuffsize) (luaL_Buffer *B, size_t sz); -LUALIB_API void (luaL_addlstring) (luaL_Buffer *B, const char *s, size_t l); -LUALIB_API void (luaL_addstring) (luaL_Buffer *B, const char *s); -LUALIB_API void (luaL_addvalue) (luaL_Buffer *B); -LUALIB_API void (luaL_pushresult) (luaL_Buffer *B); -LUALIB_API void (luaL_pushresultsize) (luaL_Buffer *B, size_t sz); -LUALIB_API char *(luaL_buffinitsize) (lua_State *L, luaL_Buffer *B, size_t sz); - -#define luaL_prepbuffer(B) luaL_prepbuffsize(B, LUAL_BUFFERSIZE) - -/* }====================================================== */ - - - -/* -** {====================================================== -** File handles for IO library -** ======================================================= -*/ - -/* -** A file handle is a userdata with metatable 'LUA_FILEHANDLE' and -** initial structure 'luaL_Stream' (it may contain other fields -** after that initial structure). -*/ - -#define LUA_FILEHANDLE "FILE*" - - -typedef struct luaL_Stream { - FILE *f; /* stream (NULL for incompletely created streams) */ - lua_CFunction closef; /* to close stream (NULL for closed streams) */ -} luaL_Stream; - -/* }====================================================== */ - -/* -** {================================================================== -** "Abstraction Layer" for basic report of messages and errors -** =================================================================== -*/ - -/* print a string */ -#if !defined(lua_writestring) -#define lua_writestring(s,l) fwrite((s), sizeof(char), (l), stdout) -#endif - -/* print a newline and flush the output */ -#if !defined(lua_writeline) -#define lua_writeline() (lua_writestring("\n", 1), fflush(stdout)) -#endif - -/* print an error message */ -#if !defined(lua_writestringerror) -#define lua_writestringerror(s,p) \ - (fprintf(stderr, (s), (p)), fflush(stderr)) -#endif - -/* }================================================================== */ - - -/* -** {============================================================ -** Compatibility with deprecated conversions -** ============================================================= -*/ -#if defined(LUA_COMPAT_APIINTCASTS) - -#define luaL_checkunsigned(L,a) ((lua_Unsigned)luaL_checkinteger(L,a)) -#define luaL_optunsigned(L,a,d) \ - ((lua_Unsigned)luaL_optinteger(L,a,(lua_Integer)(d))) - -#define luaL_checkint(L,n) ((int)luaL_checkinteger(L, (n))) -#define luaL_optint(L,n,d) ((int)luaL_optinteger(L, (n), (d))) - -#define luaL_checklong(L,n) ((long)luaL_checkinteger(L, (n))) -#define luaL_optlong(L,n,d) ((long)luaL_optinteger(L, (n), (d))) - -#endif -/* }============================================================ */ - - - -#endif - - diff --git a/src/dependencies/lua/lbaselib.c b/src/dependencies/lua/lbaselib.c deleted file mode 100644 index 4238f96..0000000 --- a/src/dependencies/lua/lbaselib.c +++ /dev/null @@ -1,556 +0,0 @@ -/* -** $Id: lbaselib.c $ -** Basic library -** See Copyright Notice in lua.h -*/ - -#define lbaselib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -static int luaB_print (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - int i; - for (i = 1; i <= n; i++) { /* for each argument */ - size_t l; - const char *s = luaL_tolstring(L, i, &l); /* convert it to string */ - if (i > 1) /* not the first element? */ - lua_writestring("\t", 1); /* add a tab before it */ - lua_writestring(s, l); /* print it */ - lua_pop(L, 1); /* pop result */ - } - lua_writeline(); - return 0; -} - - -/* -** Creates a warning with all given arguments. -** Check first for errors; otherwise an error may interrupt -** the composition of a warning, leaving it unfinished. -*/ -static int luaB_warn (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - int i; - luaL_checkstring(L, 1); /* at least one argument */ - for (i = 2; i <= n; i++) - luaL_checkstring(L, i); /* make sure all arguments are strings */ - for (i = 1; i < n; i++) /* compose warning */ - lua_warning(L, lua_tostring(L, i), 1); - lua_warning(L, lua_tostring(L, n), 0); /* close warning */ - return 0; -} - - -#define SPACECHARS " \f\n\r\t\v" - -static const char *b_str2int (const char *s, int base, lua_Integer *pn) { - lua_Unsigned n = 0; - int neg = 0; - s += strspn(s, SPACECHARS); /* skip initial spaces */ - if (*s == '-') { s++; neg = 1; } /* handle sign */ - else if (*s == '+') s++; - if (!isalnum((unsigned char)*s)) /* no digit? */ - return NULL; - do { - int digit = (isdigit((unsigned char)*s)) ? *s - '0' - : (toupper((unsigned char)*s) - 'A') + 10; - if (digit >= base) return NULL; /* invalid numeral */ - n = n * base + digit; - s++; - } while (isalnum((unsigned char)*s)); - s += strspn(s, SPACECHARS); /* skip trailing spaces */ - *pn = (lua_Integer)((neg) ? (0u - n) : n); - return s; -} - - -static int luaB_tonumber (lua_State *L) { - if (lua_isnoneornil(L, 2)) { /* standard conversion? */ - if (lua_type(L, 1) == LUA_TNUMBER) { /* already a number? */ - lua_settop(L, 1); /* yes; return it */ - return 1; - } - else { - size_t l; - const char *s = lua_tolstring(L, 1, &l); - if (s != NULL && lua_stringtonumber(L, s) == l + 1) - return 1; /* successful conversion to number */ - /* else not a number */ - luaL_checkany(L, 1); /* (but there must be some parameter) */ - } - } - else { - size_t l; - const char *s; - lua_Integer n = 0; /* to avoid warnings */ - lua_Integer base = luaL_checkinteger(L, 2); - luaL_checktype(L, 1, LUA_TSTRING); /* no numbers as strings */ - s = lua_tolstring(L, 1, &l); - luaL_argcheck(L, 2 <= base && base <= 36, 2, "base out of range"); - if (b_str2int(s, (int)base, &n) == s + l) { - lua_pushinteger(L, n); - return 1; - } /* else not a number */ - } /* else not a number */ - luaL_pushfail(L); /* not a number */ - return 1; -} - - -static int luaB_error (lua_State *L) { - int level = (int)luaL_optinteger(L, 2, 1); - lua_settop(L, 1); - if (lua_type(L, 1) == LUA_TSTRING && level > 0) { - luaL_where(L, level); /* add extra information */ - lua_pushvalue(L, 1); - lua_concat(L, 2); - } - return lua_error(L); -} - - -static int luaB_getmetatable (lua_State *L) { - luaL_checkany(L, 1); - if (!lua_getmetatable(L, 1)) { - lua_pushnil(L); - return 1; /* no metatable */ - } - luaL_getmetafield(L, 1, "__metatable"); - return 1; /* returns either __metatable field (if present) or metatable */ -} - - -static int luaB_setmetatable (lua_State *L) { - int t = lua_type(L, 2); - luaL_checktype(L, 1, LUA_TTABLE); - luaL_argexpected(L, t == LUA_TNIL || t == LUA_TTABLE, 2, "nil or table"); - if (l_unlikely(luaL_getmetafield(L, 1, "__metatable") != LUA_TNIL)) - return luaL_error(L, "cannot change a protected metatable"); - lua_settop(L, 2); - lua_setmetatable(L, 1); - return 1; -} - - -static int luaB_rawequal (lua_State *L) { - luaL_checkany(L, 1); - luaL_checkany(L, 2); - lua_pushboolean(L, lua_rawequal(L, 1, 2)); - return 1; -} - - -static int luaB_rawlen (lua_State *L) { - int t = lua_type(L, 1); - luaL_argexpected(L, t == LUA_TTABLE || t == LUA_TSTRING, 1, - "table or string"); - lua_pushinteger(L, lua_rawlen(L, 1)); - return 1; -} - - -static int luaB_rawget (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - luaL_checkany(L, 2); - lua_settop(L, 2); - lua_rawget(L, 1); - return 1; -} - -static int luaB_rawset (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - luaL_checkany(L, 2); - luaL_checkany(L, 3); - lua_settop(L, 3); - lua_rawset(L, 1); - return 1; -} - - -static int pushmode (lua_State *L, int oldmode) { - if (oldmode == -1) - luaL_pushfail(L); /* invalid call to 'lua_gc' */ - else - lua_pushstring(L, (oldmode == LUA_GCINC) ? "incremental" - : "generational"); - return 1; -} - - -/* -** check whether call to 'lua_gc' was valid (not inside a finalizer) -*/ -#define checkvalres(res) { if (res == -1) break; } - -static int luaB_collectgarbage (lua_State *L) { - static const char *const opts[] = {"stop", "restart", "collect", - "count", "step", "isrunning", "generational", "incremental", - "param", NULL}; - static const char optsnum[] = {LUA_GCSTOP, LUA_GCRESTART, LUA_GCCOLLECT, - LUA_GCCOUNT, LUA_GCSTEP, LUA_GCISRUNNING, LUA_GCGEN, LUA_GCINC, - LUA_GCPARAM}; - int o = optsnum[luaL_checkoption(L, 1, "collect", opts)]; - switch (o) { - case LUA_GCCOUNT: { - int k = lua_gc(L, o); - int b = lua_gc(L, LUA_GCCOUNTB); - checkvalres(k); - lua_pushnumber(L, (lua_Number)k + ((lua_Number)b/1024)); - return 1; - } - case LUA_GCSTEP: { - lua_Integer n = luaL_optinteger(L, 2, 0); - int res = lua_gc(L, o, (int)n); - checkvalres(res); - lua_pushboolean(L, res); - return 1; - } - case LUA_GCISRUNNING: { - int res = lua_gc(L, o); - checkvalres(res); - lua_pushboolean(L, res); - return 1; - } - case LUA_GCGEN: { - return pushmode(L, lua_gc(L, o)); - } - case LUA_GCINC: { - return pushmode(L, lua_gc(L, o)); - } - case LUA_GCPARAM: { - static const char *const params[] = { - "minormul", "majorminor", "minormajor", - "pause", "stepmul", "stepsize", NULL}; - static const char pnum[] = { - LUA_GCPMINORMUL, LUA_GCPMAJORMINOR, LUA_GCPMINORMAJOR, - LUA_GCPPAUSE, LUA_GCPSTEPMUL, LUA_GCPSTEPSIZE}; - int p = pnum[luaL_checkoption(L, 2, NULL, params)]; - lua_Integer value = luaL_optinteger(L, 3, -1); - lua_pushinteger(L, lua_gc(L, o, p, (int)value)); - return 1; - } - default: { - int res = lua_gc(L, o); - checkvalres(res); - lua_pushinteger(L, res); - return 1; - } - } - luaL_pushfail(L); /* invalid call (inside a finalizer) */ - return 1; -} - - -static int luaB_type (lua_State *L) { - int t = lua_type(L, 1); - luaL_argcheck(L, t != LUA_TNONE, 1, "value expected"); - lua_pushstring(L, lua_typename(L, t)); - return 1; -} - - -static int luaB_next (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - lua_settop(L, 2); /* create a 2nd argument if there isn't one */ - if (lua_next(L, 1)) - return 2; - else { - lua_pushnil(L); - return 1; - } -} - - -static int pairscont (lua_State *L, int status, lua_KContext k) { - (void)L; (void)status; (void)k; /* unused */ - return 3; -} - -static int luaB_pairs (lua_State *L) { - luaL_checkany(L, 1); - if (luaL_getmetafield(L, 1, "__pairs") == LUA_TNIL) { /* no metamethod? */ - lua_pushcfunction(L, luaB_next); /* will return generator, */ - lua_pushvalue(L, 1); /* state, */ - lua_pushnil(L); /* and initial value */ - } - else { - lua_pushvalue(L, 1); /* argument 'self' to metamethod */ - lua_callk(L, 1, 3, 0, pairscont); /* get 3 values from metamethod */ - } - return 3; -} - - -/* -** Traversal function for 'ipairs' -*/ -static int ipairsaux (lua_State *L) { - lua_Integer i = luaL_checkinteger(L, 2); - i = luaL_intop(+, i, 1); - lua_pushinteger(L, i); - return (lua_geti(L, 1, i) == LUA_TNIL) ? 1 : 2; -} - - -/* -** 'ipairs' function. Returns 'ipairsaux', given "table", 0. -** (The given "table" may not be a table.) -*/ -static int luaB_ipairs (lua_State *L) { - luaL_checkany(L, 1); - lua_pushcfunction(L, ipairsaux); /* iteration function */ - lua_pushvalue(L, 1); /* state */ - lua_pushinteger(L, 0); /* initial value */ - return 3; -} - - -static int load_aux (lua_State *L, int status, int envidx) { - if (l_likely(status == LUA_OK)) { - if (envidx != 0) { /* 'env' parameter? */ - lua_pushvalue(L, envidx); /* environment for loaded function */ - if (!lua_setupvalue(L, -2, 1)) /* set it as 1st upvalue */ - lua_pop(L, 1); /* remove 'env' if not used by previous call */ - } - return 1; - } - else { /* error (message is on top of the stack) */ - luaL_pushfail(L); - lua_insert(L, -2); /* put before error message */ - return 2; /* return fail plus error message */ - } -} - - -static const char *getmode (lua_State *L, int idx) { - const char *mode = luaL_optstring(L, idx, "bt"); - if (strchr(mode, 'B') != NULL) /* Lua code cannot use fixed buffers */ - luaL_argerror(L, idx, "invalid mode"); - return mode; -} - - -static int luaB_loadfile (lua_State *L) { - const char *fname = luaL_optstring(L, 1, NULL); - const char *mode = getmode(L, 2); - int env = (!lua_isnone(L, 3) ? 3 : 0); /* 'env' index or 0 if no 'env' */ - int status = luaL_loadfilex(L, fname, mode); - return load_aux(L, status, env); -} - - -/* -** {====================================================== -** Generic Read function -** ======================================================= -*/ - - -/* -** reserved slot, above all arguments, to hold a copy of the returned -** string to avoid it being collected while parsed. 'load' has four -** optional arguments (chunk, source name, mode, and environment). -*/ -#define RESERVEDSLOT 5 - - -/* -** Reader for generic 'load' function: 'lua_load' uses the -** stack for internal stuff, so the reader cannot change the -** stack top. Instead, it keeps its resulting string in a -** reserved slot inside the stack. -*/ -static const char *generic_reader (lua_State *L, void *ud, size_t *size) { - (void)(ud); /* not used */ - luaL_checkstack(L, 2, "too many nested functions"); - lua_pushvalue(L, 1); /* get function */ - lua_call(L, 0, 1); /* call it */ - if (lua_isnil(L, -1)) { - lua_pop(L, 1); /* pop result */ - *size = 0; - return NULL; - } - else if (l_unlikely(!lua_isstring(L, -1))) - luaL_error(L, "reader function must return a string"); - lua_replace(L, RESERVEDSLOT); /* save string in reserved slot */ - return lua_tolstring(L, RESERVEDSLOT, size); -} - - -static int luaB_load (lua_State *L) { - int status; - size_t l; - const char *s = lua_tolstring(L, 1, &l); - const char *mode = getmode(L, 3); - int env = (!lua_isnone(L, 4) ? 4 : 0); /* 'env' index or 0 if no 'env' */ - if (s != NULL) { /* loading a string? */ - const char *chunkname = luaL_optstring(L, 2, s); - status = luaL_loadbufferx(L, s, l, chunkname, mode); - } - else { /* loading from a reader function */ - const char *chunkname = luaL_optstring(L, 2, "=(load)"); - luaL_checktype(L, 1, LUA_TFUNCTION); - lua_settop(L, RESERVEDSLOT); /* create reserved slot */ - status = lua_load(L, generic_reader, NULL, chunkname, mode); - } - return load_aux(L, status, env); -} - -/* }====================================================== */ - - -static int dofilecont (lua_State *L, int d1, lua_KContext d2) { - (void)d1; (void)d2; /* only to match 'lua_Kfunction' prototype */ - return lua_gettop(L) - 1; -} - - -static int luaB_dofile (lua_State *L) { - const char *fname = luaL_optstring(L, 1, NULL); - lua_settop(L, 1); - if (l_unlikely(luaL_loadfile(L, fname) != LUA_OK)) - return lua_error(L); - lua_callk(L, 0, LUA_MULTRET, 0, dofilecont); - return dofilecont(L, 0, 0); -} - - -static int luaB_assert (lua_State *L) { - if (l_likely(lua_toboolean(L, 1))) /* condition is true? */ - return lua_gettop(L); /* return all arguments */ - else { /* error */ - luaL_checkany(L, 1); /* there must be a condition */ - lua_remove(L, 1); /* remove it */ - lua_pushliteral(L, "assertion failed!"); /* default message */ - lua_settop(L, 1); /* leave only message (default if no other one) */ - return luaB_error(L); /* call 'error' */ - } -} - - -static int luaB_select (lua_State *L) { - int n = lua_gettop(L); - if (lua_type(L, 1) == LUA_TSTRING && *lua_tostring(L, 1) == '#') { - lua_pushinteger(L, n-1); - return 1; - } - else { - lua_Integer i = luaL_checkinteger(L, 1); - if (i < 0) i = n + i; - else if (i > n) i = n; - luaL_argcheck(L, 1 <= i, 1, "index out of range"); - return n - (int)i; - } -} - - -/* -** Continuation function for 'pcall' and 'xpcall'. Both functions -** already pushed a 'true' before doing the call, so in case of success -** 'finishpcall' only has to return everything in the stack minus -** 'extra' values (where 'extra' is exactly the number of items to be -** ignored). -*/ -static int finishpcall (lua_State *L, int status, lua_KContext extra) { - if (l_unlikely(status != LUA_OK && status != LUA_YIELD)) { /* error? */ - lua_pushboolean(L, 0); /* first result (false) */ - lua_pushvalue(L, -2); /* error message */ - return 2; /* return false, msg */ - } - else - return lua_gettop(L) - (int)extra; /* return all results */ -} - - -static int luaB_pcall (lua_State *L) { - int status; - luaL_checkany(L, 1); - lua_pushboolean(L, 1); /* first result if no errors */ - lua_insert(L, 1); /* put it in place */ - status = lua_pcallk(L, lua_gettop(L) - 2, LUA_MULTRET, 0, 0, finishpcall); - return finishpcall(L, status, 0); -} - - -/* -** Do a protected call with error handling. After 'lua_rotate', the -** stack will have ; so, the function passes -** 2 to 'finishpcall' to skip the 2 first values when returning results. -*/ -static int luaB_xpcall (lua_State *L) { - int status; - int n = lua_gettop(L); - luaL_checktype(L, 2, LUA_TFUNCTION); /* check error function */ - lua_pushboolean(L, 1); /* first result */ - lua_pushvalue(L, 1); /* function */ - lua_rotate(L, 3, 2); /* move them below function's arguments */ - status = lua_pcallk(L, n - 2, LUA_MULTRET, 2, 2, finishpcall); - return finishpcall(L, status, 2); -} - - -static int luaB_tostring (lua_State *L) { - luaL_checkany(L, 1); - luaL_tolstring(L, 1, NULL); - return 1; -} - - -static const luaL_Reg base_funcs[] = { - {"assert", luaB_assert}, - {"collectgarbage", luaB_collectgarbage}, - {"dofile", luaB_dofile}, - {"error", luaB_error}, - {"getmetatable", luaB_getmetatable}, - {"ipairs", luaB_ipairs}, - {"loadfile", luaB_loadfile}, - {"load", luaB_load}, - {"next", luaB_next}, - {"pairs", luaB_pairs}, - {"pcall", luaB_pcall}, - {"print", luaB_print}, - {"warn", luaB_warn}, - {"rawequal", luaB_rawequal}, - {"rawlen", luaB_rawlen}, - {"rawget", luaB_rawget}, - {"rawset", luaB_rawset}, - {"select", luaB_select}, - {"setmetatable", luaB_setmetatable}, - {"tonumber", luaB_tonumber}, - {"tostring", luaB_tostring}, - {"type", luaB_type}, - {"xpcall", luaB_xpcall}, - /* placeholders */ - {LUA_GNAME, NULL}, - {"_VERSION", NULL}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_base (lua_State *L) { - /* open lib into global table */ - lua_pushglobaltable(L); - luaL_setfuncs(L, base_funcs, 0); - /* set global _G */ - lua_pushvalue(L, -1); - lua_setfield(L, -2, LUA_GNAME); - /* set global _VERSION */ - lua_pushliteral(L, LUA_VERSION); - lua_setfield(L, -2, "_VERSION"); - return 1; -} - diff --git a/src/dependencies/lua/lcode.c b/src/dependencies/lua/lcode.c deleted file mode 100644 index 97919ea..0000000 --- a/src/dependencies/lua/lcode.c +++ /dev/null @@ -1,1871 +0,0 @@ -/* -** $Id: lcode.c $ -** Code generator for Lua -** See Copyright Notice in lua.h -*/ - -#define lcode_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lcode.h" -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "llex.h" -#include "lmem.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lparser.h" -#include "lstring.h" -#include "ltable.h" -#include "lvm.h" - - -/* Maximum number of registers in a Lua function (must fit in 8 bits) */ -#define MAXREGS 255 - - -#define hasjumps(e) ((e)->t != (e)->f) - - -static int codesJ (FuncState *fs, OpCode o, int sj, int k); - - - -/* semantic error */ -l_noret luaK_semerror (LexState *ls, const char *msg) { - ls->t.token = 0; /* remove "near " from final message */ - luaX_syntaxerror(ls, msg); -} - - -/* -** If expression is a numeric constant, fills 'v' with its value -** and returns 1. Otherwise, returns 0. -*/ -static int tonumeral (const expdesc *e, TValue *v) { - if (hasjumps(e)) - return 0; /* not a numeral */ - switch (e->k) { - case VKINT: - if (v) setivalue(v, e->u.ival); - return 1; - case VKFLT: - if (v) setfltvalue(v, e->u.nval); - return 1; - default: return 0; - } -} - - -/* -** Get the constant value from a constant expression -*/ -static TValue *const2val (FuncState *fs, const expdesc *e) { - lua_assert(e->k == VCONST); - return &fs->ls->dyd->actvar.arr[e->u.info].k; -} - - -/* -** If expression is a constant, fills 'v' with its value -** and returns 1. Otherwise, returns 0. -*/ -int luaK_exp2const (FuncState *fs, const expdesc *e, TValue *v) { - if (hasjumps(e)) - return 0; /* not a constant */ - switch (e->k) { - case VFALSE: - setbfvalue(v); - return 1; - case VTRUE: - setbtvalue(v); - return 1; - case VNIL: - setnilvalue(v); - return 1; - case VKSTR: { - setsvalue(fs->ls->L, v, e->u.strval); - return 1; - } - case VCONST: { - setobj(fs->ls->L, v, const2val(fs, e)); - return 1; - } - default: return tonumeral(e, v); - } -} - - -/* -** Return the previous instruction of the current code. If there -** may be a jump target between the current instruction and the -** previous one, return an invalid instruction (to avoid wrong -** optimizations). -*/ -static Instruction *previousinstruction (FuncState *fs) { - static const Instruction invalidinstruction = ~(Instruction)0; - if (fs->pc > fs->lasttarget) - return &fs->f->code[fs->pc - 1]; /* previous instruction */ - else - return cast(Instruction*, &invalidinstruction); -} - - -/* -** Create a OP_LOADNIL instruction, but try to optimize: if the previous -** instruction is also OP_LOADNIL and ranges are compatible, adjust -** range of previous instruction instead of emitting a new one. (For -** instance, 'local a; local b' will generate a single opcode.) -*/ -void luaK_nil (FuncState *fs, int from, int n) { - int l = from + n - 1; /* last register to set nil */ - Instruction *previous = previousinstruction(fs); - if (GET_OPCODE(*previous) == OP_LOADNIL) { /* previous is LOADNIL? */ - int pfrom = GETARG_A(*previous); /* get previous range */ - int pl = pfrom + GETARG_B(*previous); - if ((pfrom <= from && from <= pl + 1) || - (from <= pfrom && pfrom <= l + 1)) { /* can connect both? */ - if (pfrom < from) from = pfrom; /* from = min(from, pfrom) */ - if (pl > l) l = pl; /* l = max(l, pl) */ - SETARG_A(*previous, from); - SETARG_B(*previous, l - from); - return; - } /* else go through */ - } - luaK_codeABC(fs, OP_LOADNIL, from, n - 1, 0); /* else no optimization */ -} - - -/* -** Gets the destination address of a jump instruction. Used to traverse -** a list of jumps. -*/ -static int getjump (FuncState *fs, int pc) { - int offset = GETARG_sJ(fs->f->code[pc]); - if (offset == NO_JUMP) /* point to itself represents end of list */ - return NO_JUMP; /* end of list */ - else - return (pc+1)+offset; /* turn offset into absolute position */ -} - - -/* -** Fix jump instruction at position 'pc' to jump to 'dest'. -** (Jump addresses are relative in Lua) -*/ -static void fixjump (FuncState *fs, int pc, int dest) { - Instruction *jmp = &fs->f->code[pc]; - int offset = dest - (pc + 1); - lua_assert(dest != NO_JUMP); - if (!(-OFFSET_sJ <= offset && offset <= MAXARG_sJ - OFFSET_sJ)) - luaX_syntaxerror(fs->ls, "control structure too long"); - lua_assert(GET_OPCODE(*jmp) == OP_JMP); - SETARG_sJ(*jmp, offset); -} - - -/* -** Concatenate jump-list 'l2' into jump-list 'l1' -*/ -void luaK_concat (FuncState *fs, int *l1, int l2) { - if (l2 == NO_JUMP) return; /* nothing to concatenate? */ - else if (*l1 == NO_JUMP) /* no original list? */ - *l1 = l2; /* 'l1' points to 'l2' */ - else { - int list = *l1; - int next; - while ((next = getjump(fs, list)) != NO_JUMP) /* find last element */ - list = next; - fixjump(fs, list, l2); /* last element links to 'l2' */ - } -} - - -/* -** Create a jump instruction and return its position, so its destination -** can be fixed later (with 'fixjump'). -*/ -int luaK_jump (FuncState *fs) { - return codesJ(fs, OP_JMP, NO_JUMP, 0); -} - - -/* -** Code a 'return' instruction -*/ -void luaK_ret (FuncState *fs, int first, int nret) { - OpCode op; - switch (nret) { - case 0: op = OP_RETURN0; break; - case 1: op = OP_RETURN1; break; - default: op = OP_RETURN; break; - } - luaK_codeABC(fs, op, first, nret + 1, 0); -} - - -/* -** Code a "conditional jump", that is, a test or comparison opcode -** followed by a jump. Return jump position. -*/ -static int condjump (FuncState *fs, OpCode op, int A, int B, int C, int k) { - luaK_codeABCk(fs, op, A, B, C, k); - return luaK_jump(fs); -} - - -/* -** returns current 'pc' and marks it as a jump target (to avoid wrong -** optimizations with consecutive instructions not in the same basic block). -*/ -int luaK_getlabel (FuncState *fs) { - fs->lasttarget = fs->pc; - return fs->pc; -} - - -/* -** Returns the position of the instruction "controlling" a given -** jump (that is, its condition), or the jump itself if it is -** unconditional. -*/ -static Instruction *getjumpcontrol (FuncState *fs, int pc) { - Instruction *pi = &fs->f->code[pc]; - if (pc >= 1 && testTMode(GET_OPCODE(*(pi-1)))) - return pi-1; - else - return pi; -} - - -/* -** Patch destination register for a TESTSET instruction. -** If instruction in position 'node' is not a TESTSET, return 0 ("fails"). -** Otherwise, if 'reg' is not 'NO_REG', set it as the destination -** register. Otherwise, change instruction to a simple 'TEST' (produces -** no register value) -*/ -static int patchtestreg (FuncState *fs, int node, int reg) { - Instruction *i = getjumpcontrol(fs, node); - if (GET_OPCODE(*i) != OP_TESTSET) - return 0; /* cannot patch other instructions */ - if (reg != NO_REG && reg != GETARG_B(*i)) - SETARG_A(*i, reg); - else { - /* no register to put value or register already has the value; - change instruction to simple test */ - *i = CREATE_ABCk(OP_TEST, GETARG_B(*i), 0, 0, GETARG_k(*i)); - } - return 1; -} - - -/* -** Traverse a list of tests ensuring no one produces a value -*/ -static void removevalues (FuncState *fs, int list) { - for (; list != NO_JUMP; list = getjump(fs, list)) - patchtestreg(fs, list, NO_REG); -} - - -/* -** Traverse a list of tests, patching their destination address and -** registers: tests producing values jump to 'vtarget' (and put their -** values in 'reg'), other tests jump to 'dtarget'. -*/ -static void patchlistaux (FuncState *fs, int list, int vtarget, int reg, - int dtarget) { - while (list != NO_JUMP) { - int next = getjump(fs, list); - if (patchtestreg(fs, list, reg)) - fixjump(fs, list, vtarget); - else - fixjump(fs, list, dtarget); /* jump to default target */ - list = next; - } -} - - -/* -** Path all jumps in 'list' to jump to 'target'. -** (The assert means that we cannot fix a jump to a forward address -** because we only know addresses once code is generated.) -*/ -void luaK_patchlist (FuncState *fs, int list, int target) { - lua_assert(target <= fs->pc); - patchlistaux(fs, list, target, NO_REG, target); -} - - -void luaK_patchtohere (FuncState *fs, int list) { - int hr = luaK_getlabel(fs); /* mark "here" as a jump target */ - luaK_patchlist(fs, list, hr); -} - - -/* limit for difference between lines in relative line info. */ -#define LIMLINEDIFF 0x80 - - -/* -** Save line info for a new instruction. If difference from last line -** does not fit in a byte, of after that many instructions, save a new -** absolute line info; (in that case, the special value 'ABSLINEINFO' -** in 'lineinfo' signals the existence of this absolute information.) -** Otherwise, store the difference from last line in 'lineinfo'. -*/ -static void savelineinfo (FuncState *fs, Proto *f, int line) { - int linedif = line - fs->previousline; - int pc = fs->pc - 1; /* last instruction coded */ - if (abs(linedif) >= LIMLINEDIFF || fs->iwthabs++ >= MAXIWTHABS) { - luaM_growvector(fs->ls->L, f->abslineinfo, fs->nabslineinfo, - f->sizeabslineinfo, AbsLineInfo, MAX_INT, "lines"); - f->abslineinfo[fs->nabslineinfo].pc = pc; - f->abslineinfo[fs->nabslineinfo++].line = line; - linedif = ABSLINEINFO; /* signal that there is absolute information */ - fs->iwthabs = 1; /* restart counter */ - } - luaM_growvector(fs->ls->L, f->lineinfo, pc, f->sizelineinfo, ls_byte, - MAX_INT, "opcodes"); - f->lineinfo[pc] = linedif; - fs->previousline = line; /* last line saved */ -} - - -/* -** Remove line information from the last instruction. -** If line information for that instruction is absolute, set 'iwthabs' -** above its max to force the new (replacing) instruction to have -** absolute line info, too. -*/ -static void removelastlineinfo (FuncState *fs) { - Proto *f = fs->f; - int pc = fs->pc - 1; /* last instruction coded */ - if (f->lineinfo[pc] != ABSLINEINFO) { /* relative line info? */ - fs->previousline -= f->lineinfo[pc]; /* correct last line saved */ - fs->iwthabs--; /* undo previous increment */ - } - else { /* absolute line information */ - lua_assert(f->abslineinfo[fs->nabslineinfo - 1].pc == pc); - fs->nabslineinfo--; /* remove it */ - fs->iwthabs = MAXIWTHABS + 1; /* force next line info to be absolute */ - } -} - - -/* -** Remove the last instruction created, correcting line information -** accordingly. -*/ -static void removelastinstruction (FuncState *fs) { - removelastlineinfo(fs); - fs->pc--; -} - - -/* -** Emit instruction 'i', checking for array sizes and saving also its -** line information. Return 'i' position. -*/ -int luaK_code (FuncState *fs, Instruction i) { - Proto *f = fs->f; - /* put new instruction in code array */ - luaM_growvector(fs->ls->L, f->code, fs->pc, f->sizecode, Instruction, - MAX_INT, "opcodes"); - f->code[fs->pc++] = i; - savelineinfo(fs, f, fs->ls->lastline); - return fs->pc - 1; /* index of new instruction */ -} - - -/* -** Format and emit an 'iABC' instruction. (Assertions check consistency -** of parameters versus opcode.) -*/ -int luaK_codeABCk (FuncState *fs, OpCode o, int a, int b, int c, int k) { - lua_assert(getOpMode(o) == iABC); - lua_assert(a <= MAXARG_A && b <= MAXARG_B && - c <= MAXARG_C && (k & ~1) == 0); - return luaK_code(fs, CREATE_ABCk(o, a, b, c, k)); -} - - -/* -** Format and emit an 'iABx' instruction. -*/ -int luaK_codeABx (FuncState *fs, OpCode o, int a, unsigned int bc) { - lua_assert(getOpMode(o) == iABx); - lua_assert(a <= MAXARG_A && bc <= MAXARG_Bx); - return luaK_code(fs, CREATE_ABx(o, a, bc)); -} - - -/* -** Format and emit an 'iAsBx' instruction. -*/ -static int codeAsBx (FuncState *fs, OpCode o, int a, int bc) { - unsigned int b = bc + OFFSET_sBx; - lua_assert(getOpMode(o) == iAsBx); - lua_assert(a <= MAXARG_A && b <= MAXARG_Bx); - return luaK_code(fs, CREATE_ABx(o, a, b)); -} - - -/* -** Format and emit an 'isJ' instruction. -*/ -static int codesJ (FuncState *fs, OpCode o, int sj, int k) { - unsigned int j = sj + OFFSET_sJ; - lua_assert(getOpMode(o) == isJ); - lua_assert(j <= MAXARG_sJ && (k & ~1) == 0); - return luaK_code(fs, CREATE_sJ(o, j, k)); -} - - -/* -** Emit an "extra argument" instruction (format 'iAx') -*/ -static int codeextraarg (FuncState *fs, int a) { - lua_assert(a <= MAXARG_Ax); - return luaK_code(fs, CREATE_Ax(OP_EXTRAARG, a)); -} - - -/* -** Emit a "load constant" instruction, using either 'OP_LOADK' -** (if constant index 'k' fits in 18 bits) or an 'OP_LOADKX' -** instruction with "extra argument". -*/ -static int luaK_codek (FuncState *fs, int reg, int k) { - if (k <= MAXARG_Bx) - return luaK_codeABx(fs, OP_LOADK, reg, k); - else { - int p = luaK_codeABx(fs, OP_LOADKX, reg, 0); - codeextraarg(fs, k); - return p; - } -} - - -/* -** Check register-stack level, keeping track of its maximum size -** in field 'maxstacksize' -*/ -void luaK_checkstack (FuncState *fs, int n) { - int newstack = fs->freereg + n; - if (newstack > fs->f->maxstacksize) { - if (newstack >= MAXREGS) - luaX_syntaxerror(fs->ls, - "function or expression needs too many registers"); - fs->f->maxstacksize = cast_byte(newstack); - } -} - - -/* -** Reserve 'n' registers in register stack -*/ -void luaK_reserveregs (FuncState *fs, int n) { - luaK_checkstack(fs, n); - fs->freereg += n; -} - - -/* -** Free register 'reg', if it is neither a constant index nor -** a local variable. -) -*/ -static void freereg (FuncState *fs, int reg) { - if (reg >= luaY_nvarstack(fs)) { - fs->freereg--; - lua_assert(reg == fs->freereg); - } -} - - -/* -** Free two registers in proper order -*/ -static void freeregs (FuncState *fs, int r1, int r2) { - if (r1 > r2) { - freereg(fs, r1); - freereg(fs, r2); - } - else { - freereg(fs, r2); - freereg(fs, r1); - } -} - - -/* -** Free register used by expression 'e' (if any) -*/ -static void freeexp (FuncState *fs, expdesc *e) { - if (e->k == VNONRELOC) - freereg(fs, e->u.info); -} - - -/* -** Free registers used by expressions 'e1' and 'e2' (if any) in proper -** order. -*/ -static void freeexps (FuncState *fs, expdesc *e1, expdesc *e2) { - int r1 = (e1->k == VNONRELOC) ? e1->u.info : -1; - int r2 = (e2->k == VNONRELOC) ? e2->u.info : -1; - freeregs(fs, r1, r2); -} - - -/* -** Add constant 'v' to prototype's list of constants (field 'k'). -** Use scanner's table to cache position of constants in constant list -** and try to reuse constants. Because some values should not be used -** as keys (nil cannot be a key, integer keys can collapse with float -** keys), the caller must provide a useful 'key' for indexing the cache. -** Note that all functions share the same table, so entering or exiting -** a function can make some indices wrong. -*/ -static int addk (FuncState *fs, TValue *key, TValue *v) { - TValue val; - lua_State *L = fs->ls->L; - Proto *f = fs->f; - int tag = luaH_get(fs->ls->h, key, &val); /* query scanner table */ - int k, oldsize; - if (tag == LUA_VNUMINT) { /* is there an index there? */ - k = cast_int(ivalue(&val)); - /* correct value? (warning: must distinguish floats from integers!) */ - if (k < fs->nk && ttypetag(&f->k[k]) == ttypetag(v) && - luaV_rawequalobj(&f->k[k], v)) - return k; /* reuse index */ - } - /* constant not found; create a new entry */ - oldsize = f->sizek; - k = fs->nk; - /* numerical value does not need GC barrier; - table has no metatable, so it does not need to invalidate cache */ - setivalue(&val, k); - luaH_set(L, fs->ls->h, key, &val); - luaM_growvector(L, f->k, k, f->sizek, TValue, MAXARG_Ax, "constants"); - while (oldsize < f->sizek) setnilvalue(&f->k[oldsize++]); - setobj(L, &f->k[k], v); - fs->nk++; - luaC_barrier(L, f, v); - return k; -} - - -/* -** Add a string to list of constants and return its index. -*/ -static int stringK (FuncState *fs, TString *s) { - TValue o; - setsvalue(fs->ls->L, &o, s); - return addk(fs, &o, &o); /* use string itself as key */ -} - - -/* -** Add an integer to list of constants and return its index. -*/ -static int luaK_intK (FuncState *fs, lua_Integer n) { - TValue o; - setivalue(&o, n); - return addk(fs, &o, &o); /* use integer itself as key */ -} - -/* -** Add a float to list of constants and return its index. Floats -** with integral values need a different key, to avoid collision -** with actual integers. To that, we add to the number its smaller -** power-of-two fraction that is still significant in its scale. -** For doubles, that would be 1/2^52. -** (This method is not bulletproof: there may be another float -** with that value, and for floats larger than 2^53 the result is -** still an integer. At worst, this only wastes an entry with -** a duplicate.) -*/ -static int luaK_numberK (FuncState *fs, lua_Number r) { - TValue o; - lua_Integer ik; - setfltvalue(&o, r); - if (!luaV_flttointeger(r, &ik, F2Ieq)) /* not an integral value? */ - return addk(fs, &o, &o); /* use number itself as key */ - else { /* must build an alternative key */ - const int nbm = l_floatatt(MANT_DIG); - const lua_Number q = l_mathop(private_lua_cembed_ldexp)(l_mathop(1.0), -nbm + 1); - const lua_Number k = (ik == 0) ? q : r + r*q; /* new key */ - TValue kv; - setfltvalue(&kv, k); - /* result is not an integral value, unless value is too large */ - lua_assert(!luaV_flttointeger(k, &ik, F2Ieq) || - l_mathop(fabs)(r) >= l_mathop(1e6)); - return addk(fs, &kv, &o); - } -} - - -/* -** Add a false to list of constants and return its index. -*/ -static int boolF (FuncState *fs) { - TValue o; - setbfvalue(&o); - return addk(fs, &o, &o); /* use boolean itself as key */ -} - - -/* -** Add a true to list of constants and return its index. -*/ -static int boolT (FuncState *fs) { - TValue o; - setbtvalue(&o); - return addk(fs, &o, &o); /* use boolean itself as key */ -} - - -/* -** Add nil to list of constants and return its index. -*/ -static int nilK (FuncState *fs) { - TValue k, v; - setnilvalue(&v); - /* cannot use nil as key; instead use table itself to represent nil */ - sethvalue(fs->ls->L, &k, fs->ls->h); - return addk(fs, &k, &v); -} - - -/* -** Check whether 'i' can be stored in an 'sC' operand. Equivalent to -** (0 <= int2sC(i) && int2sC(i) <= MAXARG_C) but without risk of -** overflows in the hidden addition inside 'int2sC'. -*/ -static int fitsC (lua_Integer i) { - return (l_castS2U(i) + OFFSET_sC <= cast_uint(MAXARG_C)); -} - - -/* -** Check whether 'i' can be stored in an 'sBx' operand. -*/ -static int fitsBx (lua_Integer i) { - return (-OFFSET_sBx <= i && i <= MAXARG_Bx - OFFSET_sBx); -} - - -void luaK_int (FuncState *fs, int reg, lua_Integer i) { - if (fitsBx(i)) - codeAsBx(fs, OP_LOADI, reg, cast_int(i)); - else - luaK_codek(fs, reg, luaK_intK(fs, i)); -} - - -static void luaK_float (FuncState *fs, int reg, lua_Number f) { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ieq) && fitsBx(fi)) - codeAsBx(fs, OP_LOADF, reg, cast_int(fi)); - else - luaK_codek(fs, reg, luaK_numberK(fs, f)); -} - - -/* -** Convert a constant in 'v' into an expression description 'e' -*/ -static void const2exp (TValue *v, expdesc *e) { - switch (ttypetag(v)) { - case LUA_VNUMINT: - e->k = VKINT; e->u.ival = ivalue(v); - break; - case LUA_VNUMFLT: - e->k = VKFLT; e->u.nval = fltvalue(v); - break; - case LUA_VFALSE: - e->k = VFALSE; - break; - case LUA_VTRUE: - e->k = VTRUE; - break; - case LUA_VNIL: - e->k = VNIL; - break; - case LUA_VSHRSTR: case LUA_VLNGSTR: - e->k = VKSTR; e->u.strval = tsvalue(v); - break; - default: lua_assert(0); - } -} - - -/* -** Fix an expression to return the number of results 'nresults'. -** 'e' must be a multi-ret expression (function call or vararg). -*/ -void luaK_setreturns (FuncState *fs, expdesc *e, int nresults) { - Instruction *pc = &getinstruction(fs, e); - if (e->k == VCALL) /* expression is an open function call? */ - SETARG_C(*pc, nresults + 1); - else { - lua_assert(e->k == VVARARG); - SETARG_C(*pc, nresults + 1); - SETARG_A(*pc, fs->freereg); - luaK_reserveregs(fs, 1); - } -} - - -/* -** Convert a VKSTR to a VK -*/ -static void str2K (FuncState *fs, expdesc *e) { - lua_assert(e->k == VKSTR); - e->u.info = stringK(fs, e->u.strval); - e->k = VK; -} - - -/* -** Fix an expression to return one result. -** If expression is not a multi-ret expression (function call or -** vararg), it already returns one result, so nothing needs to be done. -** Function calls become VNONRELOC expressions (as its result comes -** fixed in the base register of the call), while vararg expressions -** become VRELOC (as OP_VARARG puts its results where it wants). -** (Calls are created returning one result, so that does not need -** to be fixed.) -*/ -void luaK_setoneret (FuncState *fs, expdesc *e) { - if (e->k == VCALL) { /* expression is an open function call? */ - /* already returns 1 value */ - lua_assert(GETARG_C(getinstruction(fs, e)) == 2); - e->k = VNONRELOC; /* result has fixed position */ - e->u.info = GETARG_A(getinstruction(fs, e)); - } - else if (e->k == VVARARG) { - SETARG_C(getinstruction(fs, e), 2); - e->k = VRELOC; /* can relocate its simple result */ - } -} - - -/* -** Ensure that expression 'e' is not a variable (nor a ). -** (Expression still may have jump lists.) -*/ -void luaK_dischargevars (FuncState *fs, expdesc *e) { - switch (e->k) { - case VCONST: { - const2exp(const2val(fs, e), e); - break; - } - case VLOCAL: { /* already in a register */ - e->u.info = e->u.var.ridx; - e->k = VNONRELOC; /* becomes a non-relocatable value */ - break; - } - case VUPVAL: { /* move value to some (pending) register */ - e->u.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.info, 0); - e->k = VRELOC; - break; - } - case VINDEXUP: { - e->u.info = luaK_codeABC(fs, OP_GETTABUP, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXI: { - freereg(fs, e->u.ind.t); - e->u.info = luaK_codeABC(fs, OP_GETI, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXSTR: { - freereg(fs, e->u.ind.t); - e->u.info = luaK_codeABC(fs, OP_GETFIELD, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXED: { - freeregs(fs, e->u.ind.t, e->u.ind.idx); - e->u.info = luaK_codeABC(fs, OP_GETTABLE, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VVARARG: case VCALL: { - luaK_setoneret(fs, e); - break; - } - default: break; /* there is one value available (somewhere) */ - } -} - - -/* -** Ensure expression value is in register 'reg', making 'e' a -** non-relocatable expression. -** (Expression still may have jump lists.) -*/ -static void discharge2reg (FuncState *fs, expdesc *e, int reg) { - luaK_dischargevars(fs, e); - switch (e->k) { - case VNIL: { - luaK_nil(fs, reg, 1); - break; - } - case VFALSE: { - luaK_codeABC(fs, OP_LOADFALSE, reg, 0, 0); - break; - } - case VTRUE: { - luaK_codeABC(fs, OP_LOADTRUE, reg, 0, 0); - break; - } - case VKSTR: { - str2K(fs, e); - } /* FALLTHROUGH */ - case VK: { - luaK_codek(fs, reg, e->u.info); - break; - } - case VKFLT: { - luaK_float(fs, reg, e->u.nval); - break; - } - case VKINT: { - luaK_int(fs, reg, e->u.ival); - break; - } - case VRELOC: { - Instruction *pc = &getinstruction(fs, e); - SETARG_A(*pc, reg); /* instruction will put result in 'reg' */ - break; - } - case VNONRELOC: { - if (reg != e->u.info) - luaK_codeABC(fs, OP_MOVE, reg, e->u.info, 0); - break; - } - default: { - lua_assert(e->k == VJMP); - return; /* nothing to do... */ - } - } - e->u.info = reg; - e->k = VNONRELOC; -} - - -/* -** Ensure expression value is in a register, making 'e' a -** non-relocatable expression. -** (Expression still may have jump lists.) -*/ -static void discharge2anyreg (FuncState *fs, expdesc *e) { - if (e->k != VNONRELOC) { /* no fixed register yet? */ - luaK_reserveregs(fs, 1); /* get a register */ - discharge2reg(fs, e, fs->freereg-1); /* put value there */ - } -} - - -static int code_loadbool (FuncState *fs, int A, OpCode op) { - luaK_getlabel(fs); /* those instructions may be jump targets */ - return luaK_codeABC(fs, op, A, 0, 0); -} - - -/* -** check whether list has any jump that do not produce a value -** or produce an inverted value -*/ -static int need_value (FuncState *fs, int list) { - for (; list != NO_JUMP; list = getjump(fs, list)) { - Instruction i = *getjumpcontrol(fs, list); - if (GET_OPCODE(i) != OP_TESTSET) return 1; - } - return 0; /* not found */ -} - - -/* -** Ensures final expression result (which includes results from its -** jump lists) is in register 'reg'. -** If expression has jumps, need to patch these jumps either to -** its final position or to "load" instructions (for those tests -** that do not produce values). -*/ -static void exp2reg (FuncState *fs, expdesc *e, int reg) { - discharge2reg(fs, e, reg); - if (e->k == VJMP) /* expression itself is a test? */ - luaK_concat(fs, &e->t, e->u.info); /* put this jump in 't' list */ - if (hasjumps(e)) { - int final; /* position after whole expression */ - int p_f = NO_JUMP; /* position of an eventual LOAD false */ - int p_t = NO_JUMP; /* position of an eventual LOAD true */ - if (need_value(fs, e->t) || need_value(fs, e->f)) { - int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs); - p_f = code_loadbool(fs, reg, OP_LFALSESKIP); /* skip next inst. */ - p_t = code_loadbool(fs, reg, OP_LOADTRUE); - /* jump around these booleans if 'e' is not a test */ - luaK_patchtohere(fs, fj); - } - final = luaK_getlabel(fs); - patchlistaux(fs, e->f, final, reg, p_f); - patchlistaux(fs, e->t, final, reg, p_t); - } - e->f = e->t = NO_JUMP; - e->u.info = reg; - e->k = VNONRELOC; -} - - -/* -** Ensures final expression result is in next available register. -*/ -void luaK_exp2nextreg (FuncState *fs, expdesc *e) { - luaK_dischargevars(fs, e); - freeexp(fs, e); - luaK_reserveregs(fs, 1); - exp2reg(fs, e, fs->freereg - 1); -} - - -/* -** Ensures final expression result is in some (any) register -** and return that register. -*/ -int luaK_exp2anyreg (FuncState *fs, expdesc *e) { - luaK_dischargevars(fs, e); - if (e->k == VNONRELOC) { /* expression already has a register? */ - if (!hasjumps(e)) /* no jumps? */ - return e->u.info; /* result is already in a register */ - if (e->u.info >= luaY_nvarstack(fs)) { /* reg. is not a local? */ - exp2reg(fs, e, e->u.info); /* put final result in it */ - return e->u.info; - } - /* else expression has jumps and cannot change its register - to hold the jump values, because it is a local variable. - Go through to the default case. */ - } - luaK_exp2nextreg(fs, e); /* default: use next available register */ - return e->u.info; -} - - -/* -** Ensures final expression result is either in a register -** or in an upvalue. -*/ -void luaK_exp2anyregup (FuncState *fs, expdesc *e) { - if (e->k != VUPVAL || hasjumps(e)) - luaK_exp2anyreg(fs, e); -} - - -/* -** Ensures final expression result is either in a register -** or it is a constant. -*/ -void luaK_exp2val (FuncState *fs, expdesc *e) { - if (hasjumps(e)) - luaK_exp2anyreg(fs, e); - else - luaK_dischargevars(fs, e); -} - - -/* -** Try to make 'e' a K expression with an index in the range of R/K -** indices. Return true iff succeeded. -*/ -static int luaK_exp2K (FuncState *fs, expdesc *e) { - if (!hasjumps(e)) { - int info; - switch (e->k) { /* move constants to 'k' */ - case VTRUE: info = boolT(fs); break; - case VFALSE: info = boolF(fs); break; - case VNIL: info = nilK(fs); break; - case VKINT: info = luaK_intK(fs, e->u.ival); break; - case VKFLT: info = luaK_numberK(fs, e->u.nval); break; - case VKSTR: info = stringK(fs, e->u.strval); break; - case VK: info = e->u.info; break; - default: return 0; /* not a constant */ - } - if (info <= MAXINDEXRK) { /* does constant fit in 'argC'? */ - e->k = VK; /* make expression a 'K' expression */ - e->u.info = info; - return 1; - } - } - /* else, expression doesn't fit; leave it unchanged */ - return 0; -} - - -/* -** Ensures final expression result is in a valid R/K index -** (that is, it is either in a register or in 'k' with an index -** in the range of R/K indices). -** Returns 1 iff expression is K. -*/ -static int exp2RK (FuncState *fs, expdesc *e) { - if (luaK_exp2K(fs, e)) - return 1; - else { /* not a constant in the right range: put it in a register */ - luaK_exp2anyreg(fs, e); - return 0; - } -} - - -static void codeABRK (FuncState *fs, OpCode o, int a, int b, - expdesc *ec) { - int k = exp2RK(fs, ec); - luaK_codeABCk(fs, o, a, b, ec->u.info, k); -} - - -/* -** Generate code to store result of expression 'ex' into variable 'var'. -*/ -void luaK_storevar (FuncState *fs, expdesc *var, expdesc *ex) { - switch (var->k) { - case VLOCAL: { - freeexp(fs, ex); - exp2reg(fs, ex, var->u.var.ridx); /* compute 'ex' into proper place */ - return; - } - case VUPVAL: { - int e = luaK_exp2anyreg(fs, ex); - luaK_codeABC(fs, OP_SETUPVAL, e, var->u.info, 0); - break; - } - case VINDEXUP: { - codeABRK(fs, OP_SETTABUP, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXI: { - codeABRK(fs, OP_SETI, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXSTR: { - codeABRK(fs, OP_SETFIELD, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXED: { - codeABRK(fs, OP_SETTABLE, var->u.ind.t, var->u.ind.idx, ex); - break; - } - default: lua_assert(0); /* invalid var kind to store */ - } - freeexp(fs, ex); -} - - -/* -** Emit SELF instruction (convert expression 'e' into 'e:key(e,'). -*/ -void luaK_self (FuncState *fs, expdesc *e, expdesc *key) { - int ereg; - luaK_exp2anyreg(fs, e); - ereg = e->u.info; /* register where 'e' was placed */ - freeexp(fs, e); - e->u.info = fs->freereg; /* base register for op_self */ - e->k = VNONRELOC; /* self expression has a fixed register */ - luaK_reserveregs(fs, 2); /* function and 'self' produced by op_self */ - codeABRK(fs, OP_SELF, e->u.info, ereg, key); - freeexp(fs, key); -} - - -/* -** Negate condition 'e' (where 'e' is a comparison). -*/ -static void negatecondition (FuncState *fs, expdesc *e) { - Instruction *pc = getjumpcontrol(fs, e->u.info); - lua_assert(testTMode(GET_OPCODE(*pc)) && GET_OPCODE(*pc) != OP_TESTSET && - GET_OPCODE(*pc) != OP_TEST); - SETARG_k(*pc, (GETARG_k(*pc) ^ 1)); -} - - -/* -** Emit instruction to jump if 'e' is 'cond' (that is, if 'cond' -** is true, code will jump if 'e' is true.) Return jump position. -** Optimize when 'e' is 'not' something, inverting the condition -** and removing the 'not'. -*/ -static int jumponcond (FuncState *fs, expdesc *e, int cond) { - if (e->k == VRELOC) { - Instruction ie = getinstruction(fs, e); - if (GET_OPCODE(ie) == OP_NOT) { - removelastinstruction(fs); /* remove previous OP_NOT */ - return condjump(fs, OP_TEST, GETARG_B(ie), 0, 0, !cond); - } - /* else go through */ - } - discharge2anyreg(fs, e); - freeexp(fs, e); - return condjump(fs, OP_TESTSET, NO_REG, e->u.info, 0, cond); -} - - -/* -** Emit code to go through if 'e' is true, jump otherwise. -*/ -void luaK_goiftrue (FuncState *fs, expdesc *e) { - int pc; /* pc of new jump */ - luaK_dischargevars(fs, e); - switch (e->k) { - case VJMP: { /* condition? */ - negatecondition(fs, e); /* jump when it is false */ - pc = e->u.info; /* save jump position */ - break; - } - case VK: case VKFLT: case VKINT: case VKSTR: case VTRUE: { - pc = NO_JUMP; /* always true; do nothing */ - break; - } - default: { - pc = jumponcond(fs, e, 0); /* jump when false */ - break; - } - } - luaK_concat(fs, &e->f, pc); /* insert new jump in false list */ - luaK_patchtohere(fs, e->t); /* true list jumps to here (to go through) */ - e->t = NO_JUMP; -} - - -/* -** Emit code to go through if 'e' is false, jump otherwise. -*/ -void luaK_goiffalse (FuncState *fs, expdesc *e) { - int pc; /* pc of new jump */ - luaK_dischargevars(fs, e); - switch (e->k) { - case VJMP: { - pc = e->u.info; /* already jump if true */ - break; - } - case VNIL: case VFALSE: { - pc = NO_JUMP; /* always false; do nothing */ - break; - } - default: { - pc = jumponcond(fs, e, 1); /* jump if true */ - break; - } - } - luaK_concat(fs, &e->t, pc); /* insert new jump in 't' list */ - luaK_patchtohere(fs, e->f); /* false list jumps to here (to go through) */ - e->f = NO_JUMP; -} - - -/* -** Code 'not e', doing constant folding. -*/ -static void codenot (FuncState *fs, expdesc *e) { - switch (e->k) { - case VNIL: case VFALSE: { - e->k = VTRUE; /* true == not nil == not false */ - break; - } - case VK: case VKFLT: case VKINT: case VKSTR: case VTRUE: { - e->k = VFALSE; /* false == not "x" == not 0.5 == not 1 == not true */ - break; - } - case VJMP: { - negatecondition(fs, e); - break; - } - case VRELOC: - case VNONRELOC: { - discharge2anyreg(fs, e); - freeexp(fs, e); - e->u.info = luaK_codeABC(fs, OP_NOT, 0, e->u.info, 0); - e->k = VRELOC; - break; - } - default: lua_assert(0); /* cannot happen */ - } - /* interchange true and false lists */ - { int temp = e->f; e->f = e->t; e->t = temp; } - removevalues(fs, e->f); /* values are useless when negated */ - removevalues(fs, e->t); -} - - -/* -** Check whether expression 'e' is a short literal string -*/ -static int isKstr (FuncState *fs, expdesc *e) { - return (e->k == VK && !hasjumps(e) && e->u.info <= MAXARG_B && - ttisshrstring(&fs->f->k[e->u.info])); -} - -/* -** Check whether expression 'e' is a literal integer. -*/ -static int isKint (expdesc *e) { - return (e->k == VKINT && !hasjumps(e)); -} - - -/* -** Check whether expression 'e' is a literal integer in -** proper range to fit in register C -*/ -static int isCint (expdesc *e) { - return isKint(e) && (l_castS2U(e->u.ival) <= l_castS2U(MAXARG_C)); -} - - -/* -** Check whether expression 'e' is a literal integer in -** proper range to fit in register sC -*/ -static int isSCint (expdesc *e) { - return isKint(e) && fitsC(e->u.ival); -} - - -/* -** Check whether expression 'e' is a literal integer or float in -** proper range to fit in a register (sB or sC). -*/ -static int isSCnumber (expdesc *e, int *pi, int *isfloat) { - lua_Integer i; - if (e->k == VKINT) - i = e->u.ival; - else if (e->k == VKFLT && luaV_flttointeger(e->u.nval, &i, F2Ieq)) - *isfloat = 1; - else - return 0; /* not a number */ - if (!hasjumps(e) && fitsC(i)) { - *pi = int2sC(cast_int(i)); - return 1; - } - else - return 0; -} - - -/* -** Create expression 't[k]'. 't' must have its final result already in a -** register or upvalue. Upvalues can only be indexed by literal strings. -** Keys can be literal strings in the constant table or arbitrary -** values in registers. -*/ -void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) { - if (k->k == VKSTR) - str2K(fs, k); - lua_assert(!hasjumps(t) && - (t->k == VLOCAL || t->k == VNONRELOC || t->k == VUPVAL)); - if (t->k == VUPVAL && !isKstr(fs, k)) /* upvalue indexed by non 'Kstr'? */ - luaK_exp2anyreg(fs, t); /* put it in a register */ - if (t->k == VUPVAL) { - lua_assert(isKstr(fs, k)); - t->u.ind.t = t->u.info; /* upvalue index */ - t->u.ind.idx = k->u.info; /* literal short string */ - t->k = VINDEXUP; - } - else { - /* register index of the table */ - t->u.ind.t = (t->k == VLOCAL) ? t->u.var.ridx: t->u.info; - if (isKstr(fs, k)) { - t->u.ind.idx = k->u.info; /* literal short string */ - t->k = VINDEXSTR; - } - else if (isCint(k)) { - t->u.ind.idx = cast_int(k->u.ival); /* int. constant in proper range */ - t->k = VINDEXI; - } - else { - t->u.ind.idx = luaK_exp2anyreg(fs, k); /* register */ - t->k = VINDEXED; - } - } -} - - -/* -** Return false if folding can raise an error. -** Bitwise operations need operands convertible to integers; division -** operations cannot have 0 as divisor. -*/ -static int validop (int op, TValue *v1, TValue *v2) { - switch (op) { - case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: - case LUA_OPSHL: case LUA_OPSHR: case LUA_OPBNOT: { /* conversion errors */ - lua_Integer i; - return (luaV_tointegerns(v1, &i, LUA_FLOORN2I) && - luaV_tointegerns(v2, &i, LUA_FLOORN2I)); - } - case LUA_OPDIV: case LUA_OPIDIV: case LUA_OPMOD: /* division by 0 */ - return (nvalue(v2) != 0); - default: return 1; /* everything else is valid */ - } -} - - -/* -** Try to "constant-fold" an operation; return 1 iff successful. -** (In this case, 'e1' has the final result.) -*/ -static int constfolding (FuncState *fs, int op, expdesc *e1, - const expdesc *e2) { - TValue v1, v2, res; - if (!tonumeral(e1, &v1) || !tonumeral(e2, &v2) || !validop(op, &v1, &v2)) - return 0; /* non-numeric operands or not safe to fold */ - luaO_rawarith(fs->ls->L, op, &v1, &v2, &res); /* does operation */ - if (ttisinteger(&res)) { - e1->k = VKINT; - e1->u.ival = ivalue(&res); - } - else { /* folds neither NaN nor 0.0 (to avoid problems with -0.0) */ - lua_Number n = fltvalue(&res); - if (luai_numisnan(n) || n == 0) - return 0; - e1->k = VKFLT; - e1->u.nval = n; - } - return 1; -} - - -/* -** Convert a BinOpr to an OpCode (ORDER OPR - ORDER OP) -*/ -l_sinline OpCode binopr2op (BinOpr opr, BinOpr baser, OpCode base) { - lua_assert(baser <= opr && - ((baser == OPR_ADD && opr <= OPR_SHR) || - (baser == OPR_LT && opr <= OPR_LE))); - return cast(OpCode, (cast_int(opr) - cast_int(baser)) + cast_int(base)); -} - - -/* -** Convert a UnOpr to an OpCode (ORDER OPR - ORDER OP) -*/ -l_sinline OpCode unopr2op (UnOpr opr) { - return cast(OpCode, (cast_int(opr) - cast_int(OPR_MINUS)) + - cast_int(OP_UNM)); -} - - -/* -** Convert a BinOpr to a tag method (ORDER OPR - ORDER TM) -*/ -l_sinline TMS binopr2TM (BinOpr opr) { - lua_assert(OPR_ADD <= opr && opr <= OPR_SHR); - return cast(TMS, (cast_int(opr) - cast_int(OPR_ADD)) + cast_int(TM_ADD)); -} - - -/* -** Emit code for unary expressions that "produce values" -** (everything but 'not'). -** Expression to produce final result will be encoded in 'e'. -*/ -static void codeunexpval (FuncState *fs, OpCode op, expdesc *e, int line) { - int r = luaK_exp2anyreg(fs, e); /* opcodes operate only on registers */ - freeexp(fs, e); - e->u.info = luaK_codeABC(fs, op, 0, r, 0); /* generate opcode */ - e->k = VRELOC; /* all those operations are relocatable */ - luaK_fixline(fs, line); -} - - -/* -** Emit code for binary expressions that "produce values" -** (everything but logical operators 'and'/'or' and comparison -** operators). -** Expression to produce final result will be encoded in 'e1'. -*/ -static void finishbinexpval (FuncState *fs, expdesc *e1, expdesc *e2, - OpCode op, int v2, int flip, int line, - OpCode mmop, TMS event) { - int v1 = luaK_exp2anyreg(fs, e1); - int pc = luaK_codeABCk(fs, op, 0, v1, v2, 0); - freeexps(fs, e1, e2); - e1->u.info = pc; - e1->k = VRELOC; /* all those operations are relocatable */ - luaK_fixline(fs, line); - luaK_codeABCk(fs, mmop, v1, v2, event, flip); /* to call metamethod */ - luaK_fixline(fs, line); -} - - -/* -** Emit code for binary expressions that "produce values" over -** two registers. -*/ -static void codebinexpval (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - OpCode op = binopr2op(opr, OPR_ADD, OP_ADD); - int v2 = luaK_exp2anyreg(fs, e2); /* make sure 'e2' is in a register */ - /* 'e1' must be already in a register or it is a constant */ - lua_assert((VNIL <= e1->k && e1->k <= VKSTR) || - e1->k == VNONRELOC || e1->k == VRELOC); - lua_assert(OP_ADD <= op && op <= OP_SHR); - finishbinexpval(fs, e1, e2, op, v2, 0, line, OP_MMBIN, binopr2TM(opr)); -} - - -/* -** Code binary operators with immediate operands. -*/ -static void codebini (FuncState *fs, OpCode op, - expdesc *e1, expdesc *e2, int flip, int line, - TMS event) { - int v2 = int2sC(cast_int(e2->u.ival)); /* immediate operand */ - lua_assert(e2->k == VKINT); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINI, event); -} - - -/* -** Code binary operators with K operand. -*/ -static void codebinK (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - TMS event = binopr2TM(opr); - int v2 = e2->u.info; /* K index */ - OpCode op = binopr2op(opr, OPR_ADD, OP_ADDK); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINK, event); -} - - -/* Try to code a binary operator negating its second operand. -** For the metamethod, 2nd operand must keep its original value. -*/ -static int finishbinexpneg (FuncState *fs, expdesc *e1, expdesc *e2, - OpCode op, int line, TMS event) { - if (!isKint(e2)) - return 0; /* not an integer constant */ - else { - lua_Integer i2 = e2->u.ival; - if (!(fitsC(i2) && fitsC(-i2))) - return 0; /* not in the proper range */ - else { /* operating a small integer constant */ - int v2 = cast_int(i2); - finishbinexpval(fs, e1, e2, op, int2sC(-v2), 0, line, OP_MMBINI, event); - /* correct metamethod argument */ - SETARG_B(fs->f->code[fs->pc - 1], int2sC(v2)); - return 1; /* successfully coded */ - } - } -} - - -static void swapexps (expdesc *e1, expdesc *e2) { - expdesc temp = *e1; *e1 = *e2; *e2 = temp; /* swap 'e1' and 'e2' */ -} - - -/* -** Code binary operators with no constant operand. -*/ -static void codebinNoK (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - if (flip) - swapexps(e1, e2); /* back to original order */ - codebinexpval(fs, opr, e1, e2, line); /* use standard operators */ -} - - -/* -** Code arithmetic operators ('+', '-', ...). If second operand is a -** constant in the proper range, use variant opcodes with K operands. -*/ -static void codearith (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - if (tonumeral(e2, NULL) && luaK_exp2K(fs, e2)) /* K operand? */ - codebinK(fs, opr, e1, e2, flip, line); - else /* 'e2' is neither an immediate nor a K operand */ - codebinNoK(fs, opr, e1, e2, flip, line); -} - - -/* -** Code commutative operators ('+', '*'). If first operand is a -** numeric constant, change order of operands to try to use an -** immediate or K operator. -*/ -static void codecommutative (FuncState *fs, BinOpr op, - expdesc *e1, expdesc *e2, int line) { - int flip = 0; - if (tonumeral(e1, NULL)) { /* is first operand a numeric constant? */ - swapexps(e1, e2); /* change order */ - flip = 1; - } - if (op == OPR_ADD && isSCint(e2)) /* immediate operand? */ - codebini(fs, OP_ADDI, e1, e2, flip, line, TM_ADD); - else - codearith(fs, op, e1, e2, flip, line); -} - - -/* -** Code bitwise operations; they are all commutative, so the function -** tries to put an integer constant as the 2nd operand (a K operand). -*/ -static void codebitwise (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - int flip = 0; - if (e1->k == VKINT) { - swapexps(e1, e2); /* 'e2' will be the constant operand */ - flip = 1; - } - if (e2->k == VKINT && luaK_exp2K(fs, e2)) /* K operand? */ - codebinK(fs, opr, e1, e2, flip, line); - else /* no constants */ - codebinNoK(fs, opr, e1, e2, flip, line); -} - - -/* -** Emit code for order comparisons. When using an immediate operand, -** 'isfloat' tells whether the original value was a float. -*/ -static void codeorder (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { - int r1, r2; - int im; - int isfloat = 0; - OpCode op; - if (isSCnumber(e2, &im, &isfloat)) { - /* use immediate operand */ - r1 = luaK_exp2anyreg(fs, e1); - r2 = im; - op = binopr2op(opr, OPR_LT, OP_LTI); - } - else if (isSCnumber(e1, &im, &isfloat)) { - /* transform (A < B) to (B > A) and (A <= B) to (B >= A) */ - r1 = luaK_exp2anyreg(fs, e2); - r2 = im; - op = binopr2op(opr, OPR_LT, OP_GTI); - } - else { /* regular case, compare two registers */ - r1 = luaK_exp2anyreg(fs, e1); - r2 = luaK_exp2anyreg(fs, e2); - op = binopr2op(opr, OPR_LT, OP_LT); - } - freeexps(fs, e1, e2); - e1->u.info = condjump(fs, op, r1, r2, isfloat, 1); - e1->k = VJMP; -} - - -/* -** Emit code for equality comparisons ('==', '~='). -** 'e1' was already put as RK by 'luaK_infix'. -*/ -static void codeeq (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { - int r1, r2; - int im; - int isfloat = 0; /* not needed here, but kept for symmetry */ - OpCode op; - if (e1->k != VNONRELOC) { - lua_assert(e1->k == VK || e1->k == VKINT || e1->k == VKFLT); - swapexps(e1, e2); - } - r1 = luaK_exp2anyreg(fs, e1); /* 1st expression must be in register */ - if (isSCnumber(e2, &im, &isfloat)) { - op = OP_EQI; - r2 = im; /* immediate operand */ - } - else if (exp2RK(fs, e2)) { /* 2nd expression is constant? */ - op = OP_EQK; - r2 = e2->u.info; /* constant index */ - } - else { - op = OP_EQ; /* will compare two registers */ - r2 = luaK_exp2anyreg(fs, e2); - } - freeexps(fs, e1, e2); - e1->u.info = condjump(fs, op, r1, r2, isfloat, (opr == OPR_EQ)); - e1->k = VJMP; -} - - -/* -** Apply prefix operation 'op' to expression 'e'. -*/ -void luaK_prefix (FuncState *fs, UnOpr opr, expdesc *e, int line) { - static const expdesc ef = {VKINT, {0}, NO_JUMP, NO_JUMP}; - luaK_dischargevars(fs, e); - switch (opr) { - case OPR_MINUS: case OPR_BNOT: /* use 'ef' as fake 2nd operand */ - if (constfolding(fs, opr + LUA_OPUNM, e, &ef)) - break; - /* else */ /* FALLTHROUGH */ - case OPR_LEN: - codeunexpval(fs, unopr2op(opr), e, line); - break; - case OPR_NOT: codenot(fs, e); break; - default: lua_assert(0); - } -} - - -/* -** Process 1st operand 'v' of binary operation 'op' before reading -** 2nd operand. -*/ -void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) { - luaK_dischargevars(fs, v); - switch (op) { - case OPR_AND: { - luaK_goiftrue(fs, v); /* go ahead only if 'v' is true */ - break; - } - case OPR_OR: { - luaK_goiffalse(fs, v); /* go ahead only if 'v' is false */ - break; - } - case OPR_CONCAT: { - luaK_exp2nextreg(fs, v); /* operand must be on the stack */ - break; - } - case OPR_ADD: case OPR_SUB: - case OPR_MUL: case OPR_DIV: case OPR_IDIV: - case OPR_MOD: case OPR_POW: - case OPR_BAND: case OPR_BOR: case OPR_BXOR: - case OPR_SHL: case OPR_SHR: { - if (!tonumeral(v, NULL)) - luaK_exp2anyreg(fs, v); - /* else keep numeral, which may be folded or used as an immediate - operand */ - break; - } - case OPR_EQ: case OPR_NE: { - if (!tonumeral(v, NULL)) - exp2RK(fs, v); - /* else keep numeral, which may be an immediate operand */ - break; - } - case OPR_LT: case OPR_LE: - case OPR_GT: case OPR_GE: { - int dummy, dummy2; - if (!isSCnumber(v, &dummy, &dummy2)) - luaK_exp2anyreg(fs, v); - /* else keep numeral, which may be an immediate operand */ - break; - } - default: lua_assert(0); - } -} - -/* -** Create code for '(e1 .. e2)'. -** For '(e1 .. e2.1 .. e2.2)' (which is '(e1 .. (e2.1 .. e2.2))', -** because concatenation is right associative), merge both CONCATs. -*/ -static void codeconcat (FuncState *fs, expdesc *e1, expdesc *e2, int line) { - Instruction *ie2 = previousinstruction(fs); - if (GET_OPCODE(*ie2) == OP_CONCAT) { /* is 'e2' a concatenation? */ - int n = GETARG_B(*ie2); /* # of elements concatenated in 'e2' */ - lua_assert(e1->u.info + 1 == GETARG_A(*ie2)); - freeexp(fs, e2); - SETARG_A(*ie2, e1->u.info); /* correct first element ('e1') */ - SETARG_B(*ie2, n + 1); /* will concatenate one more element */ - } - else { /* 'e2' is not a concatenation */ - luaK_codeABC(fs, OP_CONCAT, e1->u.info, 2, 0); /* new concat opcode */ - freeexp(fs, e2); - luaK_fixline(fs, line); - } -} - - -/* -** Finalize code for binary operation, after reading 2nd operand. -*/ -void luaK_posfix (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - luaK_dischargevars(fs, e2); - if (foldbinop(opr) && constfolding(fs, opr + LUA_OPADD, e1, e2)) - return; /* done by folding */ - switch (opr) { - case OPR_AND: { - lua_assert(e1->t == NO_JUMP); /* list closed by 'luaK_infix' */ - luaK_concat(fs, &e2->f, e1->f); - *e1 = *e2; - break; - } - case OPR_OR: { - lua_assert(e1->f == NO_JUMP); /* list closed by 'luaK_infix' */ - luaK_concat(fs, &e2->t, e1->t); - *e1 = *e2; - break; - } - case OPR_CONCAT: { /* e1 .. e2 */ - luaK_exp2nextreg(fs, e2); - codeconcat(fs, e1, e2, line); - break; - } - case OPR_ADD: case OPR_MUL: { - codecommutative(fs, opr, e1, e2, line); - break; - } - case OPR_SUB: { - if (finishbinexpneg(fs, e1, e2, OP_ADDI, line, TM_SUB)) - break; /* coded as (r1 + -I) */ - /* ELSE */ - } /* FALLTHROUGH */ - case OPR_DIV: case OPR_IDIV: case OPR_MOD: case OPR_POW: { - codearith(fs, opr, e1, e2, 0, line); - break; - } - case OPR_BAND: case OPR_BOR: case OPR_BXOR: { - codebitwise(fs, opr, e1, e2, line); - break; - } - case OPR_SHL: { - if (isSCint(e1)) { - swapexps(e1, e2); - codebini(fs, OP_SHLI, e1, e2, 1, line, TM_SHL); /* I << r2 */ - } - else if (finishbinexpneg(fs, e1, e2, OP_SHRI, line, TM_SHL)) { - /* coded as (r1 >> -I) */; - } - else /* regular case (two registers) */ - codebinexpval(fs, opr, e1, e2, line); - break; - } - case OPR_SHR: { - if (isSCint(e2)) - codebini(fs, OP_SHRI, e1, e2, 0, line, TM_SHR); /* r1 >> I */ - else /* regular case (two registers) */ - codebinexpval(fs, opr, e1, e2, line); - break; - } - case OPR_EQ: case OPR_NE: { - codeeq(fs, opr, e1, e2); - break; - } - case OPR_GT: case OPR_GE: { - /* '(a > b)' <=> '(b < a)'; '(a >= b)' <=> '(b <= a)' */ - swapexps(e1, e2); - opr = cast(BinOpr, (opr - OPR_GT) + OPR_LT); - } /* FALLTHROUGH */ - case OPR_LT: case OPR_LE: { - codeorder(fs, opr, e1, e2); - break; - } - default: lua_assert(0); - } -} - - -/* -** Change line information associated with current position, by removing -** previous info and adding it again with new line. -*/ -void luaK_fixline (FuncState *fs, int line) { - removelastlineinfo(fs); - savelineinfo(fs, fs->f, line); -} - - -void luaK_settablesize (FuncState *fs, int pc, int ra, int asize, int hsize) { - Instruction *inst = &fs->f->code[pc]; - int rb = (hsize != 0) ? luaO_ceillog2(hsize) + 1 : 0; /* hash size */ - int extra = asize / (MAXARG_C + 1); /* higher bits of array size */ - int rc = asize % (MAXARG_C + 1); /* lower bits of array size */ - int k = (extra > 0); /* true iff needs extra argument */ - *inst = CREATE_ABCk(OP_NEWTABLE, ra, rb, rc, k); - *(inst + 1) = CREATE_Ax(OP_EXTRAARG, extra); -} - - -/* -** Emit a SETLIST instruction. -** 'base' is register that keeps table; -** 'nelems' is #table plus those to be stored now; -** 'tostore' is number of values (in registers 'base + 1',...) to add to -** table (or LUA_MULTRET to add up to stack top). -*/ -void luaK_setlist (FuncState *fs, int base, int nelems, int tostore) { - lua_assert(tostore != 0 && tostore <= LFIELDS_PER_FLUSH); - if (tostore == LUA_MULTRET) - tostore = 0; - if (nelems <= MAXARG_C) - luaK_codeABC(fs, OP_SETLIST, base, tostore, nelems); - else { - int extra = nelems / (MAXARG_C + 1); - nelems %= (MAXARG_C + 1); - luaK_codeABCk(fs, OP_SETLIST, base, tostore, nelems, 1); - codeextraarg(fs, extra); - } - fs->freereg = base + 1; /* free registers with list values */ -} - - -/* -** return the final target of a jump (skipping jumps to jumps) -*/ -static int finaltarget (Instruction *code, int i) { - int count; - for (count = 0; count < 100; count++) { /* avoid infinite loops */ - Instruction pc = code[i]; - if (GET_OPCODE(pc) != OP_JMP) - break; - else - i += GETARG_sJ(pc) + 1; - } - return i; -} - - -/* -** Do a final pass over the code of a function, doing small peephole -** optimizations and adjustments. -*/ -void luaK_finish (FuncState *fs) { - int i; - Proto *p = fs->f; - for (i = 0; i < fs->pc; i++) { - Instruction *pc = &p->code[i]; - lua_assert(i == 0 || isOT(*(pc - 1)) == isIT(*pc)); - switch (GET_OPCODE(*pc)) { - case OP_RETURN0: case OP_RETURN1: { - if (!(fs->needclose || (p->flag & PF_ISVARARG))) - break; /* no extra work */ - /* else use OP_RETURN to do the extra work */ - SET_OPCODE(*pc, OP_RETURN); - } /* FALLTHROUGH */ - case OP_RETURN: case OP_TAILCALL: { - if (fs->needclose) - SETARG_k(*pc, 1); /* signal that it needs to close */ - if (p->flag & PF_ISVARARG) - SETARG_C(*pc, p->numparams + 1); /* signal that it is vararg */ - break; - } - case OP_JMP: { - int target = finaltarget(p->code, i); - fixjump(fs, i, target); - break; - } - default: break; - } - } -} diff --git a/src/dependencies/lua/lcode.h b/src/dependencies/lua/lcode.h deleted file mode 100644 index 5b8eb29..0000000 --- a/src/dependencies/lua/lcode.h +++ /dev/null @@ -1,101 +0,0 @@ -/* -** $Id: lcode.h $ -** Code generator for Lua -** See Copyright Notice in lua.h -*/ - -#ifndef lcode_h -#define lcode_h - -#include "llex.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lparser.h" - - -/* -** Marks the end of a patch list. It is an invalid value both as an absolute -** address, and as a list link (would link an element to itself). -*/ -#define NO_JUMP (-1) - - -/* -** grep "ORDER OPR" if you change these enums (ORDER OP) -*/ -typedef enum BinOpr { - /* arithmetic operators */ - OPR_ADD, OPR_SUB, OPR_MUL, OPR_MOD, OPR_POW, - OPR_DIV, OPR_IDIV, - /* bitwise operators */ - OPR_BAND, OPR_BOR, OPR_BXOR, - OPR_SHL, OPR_SHR, - /* string operator */ - OPR_CONCAT, - /* comparison operators */ - OPR_EQ, OPR_LT, OPR_LE, - OPR_NE, OPR_GT, OPR_GE, - /* logical operators */ - OPR_AND, OPR_OR, - OPR_NOBINOPR -} BinOpr; - - -/* true if operation is foldable (that is, it is arithmetic or bitwise) */ -#define foldbinop(op) ((op) <= OPR_SHR) - - -#define luaK_codeABC(fs,o,a,b,c) luaK_codeABCk(fs,o,a,b,c,0) - - -typedef enum UnOpr { OPR_MINUS, OPR_BNOT, OPR_NOT, OPR_LEN, OPR_NOUNOPR } UnOpr; - - -/* get (pointer to) instruction of given 'expdesc' */ -#define getinstruction(fs,e) ((fs)->f->code[(e)->u.info]) - - -#define luaK_setmultret(fs,e) luaK_setreturns(fs, e, LUA_MULTRET) - -#define luaK_jumpto(fs,t) luaK_patchlist(fs, luaK_jump(fs), t) - -LUAI_FUNC int luaK_code (FuncState *fs, Instruction i); -LUAI_FUNC int luaK_codeABx (FuncState *fs, OpCode o, int A, unsigned Bx); -LUAI_FUNC int luaK_codeABCk (FuncState *fs, OpCode o, int A, - int B, int C, int k); -LUAI_FUNC int luaK_exp2const (FuncState *fs, const expdesc *e, TValue *v); -LUAI_FUNC void luaK_fixline (FuncState *fs, int line); -LUAI_FUNC void luaK_nil (FuncState *fs, int from, int n); -LUAI_FUNC void luaK_reserveregs (FuncState *fs, int n); -LUAI_FUNC void luaK_checkstack (FuncState *fs, int n); -LUAI_FUNC void luaK_int (FuncState *fs, int reg, lua_Integer n); -LUAI_FUNC void luaK_dischargevars (FuncState *fs, expdesc *e); -LUAI_FUNC int luaK_exp2anyreg (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2anyregup (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2nextreg (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2val (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_self (FuncState *fs, expdesc *e, expdesc *key); -LUAI_FUNC void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k); -LUAI_FUNC void luaK_goiftrue (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_goiffalse (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_storevar (FuncState *fs, expdesc *var, expdesc *e); -LUAI_FUNC void luaK_setreturns (FuncState *fs, expdesc *e, int nresults); -LUAI_FUNC void luaK_setoneret (FuncState *fs, expdesc *e); -LUAI_FUNC int luaK_jump (FuncState *fs); -LUAI_FUNC void luaK_ret (FuncState *fs, int first, int nret); -LUAI_FUNC void luaK_patchlist (FuncState *fs, int list, int target); -LUAI_FUNC void luaK_patchtohere (FuncState *fs, int list); -LUAI_FUNC void luaK_concat (FuncState *fs, int *l1, int l2); -LUAI_FUNC int luaK_getlabel (FuncState *fs); -LUAI_FUNC void luaK_prefix (FuncState *fs, UnOpr op, expdesc *v, int line); -LUAI_FUNC void luaK_infix (FuncState *fs, BinOpr op, expdesc *v); -LUAI_FUNC void luaK_posfix (FuncState *fs, BinOpr op, expdesc *v1, - expdesc *v2, int line); -LUAI_FUNC void luaK_settablesize (FuncState *fs, int pc, - int ra, int asize, int hsize); -LUAI_FUNC void luaK_setlist (FuncState *fs, int base, int nelems, int tostore); -LUAI_FUNC void luaK_finish (FuncState *fs); -LUAI_FUNC l_noret luaK_semerror (LexState *ls, const char *msg); - - -#endif diff --git a/src/dependencies/lua/lcorolib.c b/src/dependencies/lua/lcorolib.c deleted file mode 100644 index c64adf0..0000000 --- a/src/dependencies/lua/lcorolib.c +++ /dev/null @@ -1,210 +0,0 @@ -/* -** $Id: lcorolib.c $ -** Coroutine Library -** See Copyright Notice in lua.h -*/ - -#define lcorolib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -static lua_State *getco (lua_State *L) { - lua_State *co = lua_tothread(L, 1); - luaL_argexpected(L, co, 1, "thread"); - return co; -} - - -/* -** Resumes a coroutine. Returns the number of results for non-error -** cases or -1 for errors. -*/ -static int auxresume (lua_State *L, lua_State *co, int narg) { - int status, nres; - if (l_unlikely(!lua_checkstack(co, narg))) { - lua_pushliteral(L, "too many arguments to resume"); - return -1; /* error flag */ - } - lua_xmove(L, co, narg); - status = lua_resume(co, L, narg, &nres); - if (l_likely(status == LUA_OK || status == LUA_YIELD)) { - if (l_unlikely(!lua_checkstack(L, nres + 1))) { - lua_pop(co, nres); /* remove results anyway */ - lua_pushliteral(L, "too many results to resume"); - return -1; /* error flag */ - } - lua_xmove(co, L, nres); /* move yielded values */ - return nres; - } - else { - lua_xmove(co, L, 1); /* move error message */ - return -1; /* error flag */ - } -} - - -static int luaB_coresume (lua_State *L) { - lua_State *co = getco(L); - int r; - r = auxresume(L, co, lua_gettop(L) - 1); - if (l_unlikely(r < 0)) { - lua_pushboolean(L, 0); - lua_insert(L, -2); - return 2; /* return false + error message */ - } - else { - lua_pushboolean(L, 1); - lua_insert(L, -(r + 1)); - return r + 1; /* return true + 'resume' returns */ - } -} - - -static int luaB_auxwrap (lua_State *L) { - lua_State *co = lua_tothread(L, lua_upvalueindex(1)); - int r = auxresume(L, co, lua_gettop(L)); - if (l_unlikely(r < 0)) { /* error? */ - int stat = lua_status(co); - if (stat != LUA_OK && stat != LUA_YIELD) { /* error in the coroutine? */ - stat = lua_closethread(co, L); /* close its tbc variables */ - lua_assert(stat != LUA_OK); - lua_xmove(co, L, 1); /* move error message to the caller */ - } - if (stat != LUA_ERRMEM && /* not a memory error and ... */ - lua_type(L, -1) == LUA_TSTRING) { /* ... error object is a string? */ - luaL_where(L, 1); /* add extra info, if available */ - lua_insert(L, -2); - lua_concat(L, 2); - } - return lua_error(L); /* propagate error */ - } - return r; -} - - -static int luaB_cocreate (lua_State *L) { - lua_State *NL; - luaL_checktype(L, 1, LUA_TFUNCTION); - NL = lua_newthread(L); - lua_pushvalue(L, 1); /* move function to top */ - lua_xmove(L, NL, 1); /* move function from L to NL */ - return 1; -} - - -static int luaB_cowrap (lua_State *L) { - luaB_cocreate(L); - lua_pushcclosure(L, luaB_auxwrap, 1); - return 1; -} - - -static int luaB_yield (lua_State *L) { - return lua_yield(L, lua_gettop(L)); -} - - -#define COS_RUN 0 -#define COS_DEAD 1 -#define COS_YIELD 2 -#define COS_NORM 3 - - -static const char *const statname[] = - {"running", "dead", "suspended", "normal"}; - - -static int auxstatus (lua_State *L, lua_State *co) { - if (L == co) return COS_RUN; - else { - switch (lua_status(co)) { - case LUA_YIELD: - return COS_YIELD; - case LUA_OK: { - lua_Debug ar; - if (lua_getstack(co, 0, &ar)) /* does it have frames? */ - return COS_NORM; /* it is running */ - else if (lua_gettop(co) == 0) - return COS_DEAD; - else - return COS_YIELD; /* initial state */ - } - default: /* some error occurred */ - return COS_DEAD; - } - } -} - - -static int luaB_costatus (lua_State *L) { - lua_State *co = getco(L); - lua_pushstring(L, statname[auxstatus(L, co)]); - return 1; -} - - -static int luaB_yieldable (lua_State *L) { - lua_State *co = lua_isnone(L, 1) ? L : getco(L); - lua_pushboolean(L, lua_isyieldable(co)); - return 1; -} - - -static int luaB_corunning (lua_State *L) { - int ismain = lua_pushthread(L); - lua_pushboolean(L, ismain); - return 2; -} - - -static int luaB_close (lua_State *L) { - lua_State *co = getco(L); - int status = auxstatus(L, co); - switch (status) { - case COS_DEAD: case COS_YIELD: { - status = lua_closethread(co, L); - if (status == LUA_OK) { - lua_pushboolean(L, 1); - return 1; - } - else { - lua_pushboolean(L, 0); - lua_xmove(co, L, 1); /* move error message */ - return 2; - } - } - default: /* normal or running coroutine */ - return luaL_error(L, "cannot close a %s coroutine", statname[status]); - } -} - - -static const luaL_Reg co_funcs[] = { - {"create", luaB_cocreate}, - {"resume", luaB_coresume}, - {"running", luaB_corunning}, - {"status", luaB_costatus}, - {"wrap", luaB_cowrap}, - {"yield", luaB_yield}, - {"isyieldable", luaB_yieldable}, - {"close", luaB_close}, - {NULL, NULL} -}; - - - -LUAMOD_API int luaopen_coroutine (lua_State *L) { - luaL_newlib(L, co_funcs); - return 1; -} - diff --git a/src/dependencies/lua/lctype.c b/src/dependencies/lua/lctype.c deleted file mode 100644 index 9542280..0000000 --- a/src/dependencies/lua/lctype.c +++ /dev/null @@ -1,64 +0,0 @@ -/* -** $Id: lctype.c $ -** 'ctype' functions for Lua -** See Copyright Notice in lua.h -*/ - -#define lctype_c -#define LUA_CORE - -#include "lprefix.h" - - -#include "lctype.h" - -#if !LUA_USE_CTYPE /* { */ - -#include - - -#if defined (LUA_UCID) /* accept UniCode IDentifiers? */ -/* consider all non-ascii codepoints to be alphabetic */ -#define NONA 0x01 -#else -#define NONA 0x00 /* default */ -#endif - - -LUAI_DDEF const lu_byte luai_ctype_[UCHAR_MAX + 2] = { - 0x00, /* EOZ */ - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0. */ - 0x00, 0x08, 0x08, 0x08, 0x08, 0x08, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 1. */ - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x0c, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, /* 2. */ - 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, /* 3. */ - 0x16, 0x16, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x04, 0x15, 0x15, 0x15, 0x15, 0x15, 0x15, 0x05, /* 4. */ - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, /* 5. */ - 0x05, 0x05, 0x05, 0x04, 0x04, 0x04, 0x04, 0x05, - 0x04, 0x15, 0x15, 0x15, 0x15, 0x15, 0x15, 0x05, /* 6. */ - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, /* 7. */ - 0x05, 0x05, 0x05, 0x04, 0x04, 0x04, 0x04, 0x00, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* 8. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* 9. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* a. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* b. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - 0x00, 0x00, NONA, NONA, NONA, NONA, NONA, NONA, /* c. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* d. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* e. */ - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, 0x00, 0x00, 0x00, /* f. */ - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 -}; - -#endif /* } */ diff --git a/src/dependencies/lua/lctype.h b/src/dependencies/lua/lctype.h deleted file mode 100644 index 864e190..0000000 --- a/src/dependencies/lua/lctype.h +++ /dev/null @@ -1,101 +0,0 @@ -/* -** $Id: lctype.h $ -** 'ctype' functions for Lua -** See Copyright Notice in lua.h -*/ - -#ifndef lctype_h -#define lctype_h - -#include "lua.h" - - -/* -** WARNING: the functions defined here do not necessarily correspond -** to the similar functions in the standard C ctype.h. They are -** optimized for the specific needs of Lua. -*/ - -#if !defined(LUA_USE_CTYPE) - -#if 'A' == 65 && '0' == 48 -/* ASCII case: can use its own tables; faster and fixed */ -#define LUA_USE_CTYPE 0 -#else -/* must use standard C ctype */ -#define LUA_USE_CTYPE 1 -#endif - -#endif - - -#if !LUA_USE_CTYPE /* { */ - -#include - -#include "llimits.h" - - -#define ALPHABIT 0 -#define DIGITBIT 1 -#define PRINTBIT 2 -#define SPACEBIT 3 -#define XDIGITBIT 4 - - -#define MASK(B) (1 << (B)) - - -/* -** add 1 to char to allow index -1 (EOZ) -*/ -#define testprop(c,p) (luai_ctype_[(c)+1] & (p)) - -/* -** 'lalpha' (Lua alphabetic) and 'lalnum' (Lua alphanumeric) both include '_' -*/ -#define lislalpha(c) testprop(c, MASK(ALPHABIT)) -#define lislalnum(c) testprop(c, (MASK(ALPHABIT) | MASK(DIGITBIT))) -#define lisdigit(c) testprop(c, MASK(DIGITBIT)) -#define lisspace(c) testprop(c, MASK(SPACEBIT)) -#define lisprint(c) testprop(c, MASK(PRINTBIT)) -#define lisxdigit(c) testprop(c, MASK(XDIGITBIT)) - - -/* -** In ASCII, this 'ltolower' is correct for alphabetic characters and -** for '.'. That is enough for Lua needs. ('check_exp' ensures that -** the character either is an upper-case letter or is unchanged by -** the transformation, which holds for lower-case letters and '.'.) -*/ -#define ltolower(c) \ - check_exp(('A' <= (c) && (c) <= 'Z') || (c) == ((c) | ('A' ^ 'a')), \ - (c) | ('A' ^ 'a')) - - -/* one entry for each character and for -1 (EOZ) */ -LUAI_DDEC(const lu_byte luai_ctype_[UCHAR_MAX + 2];) - - -#else /* }{ */ - -/* -** use standard C ctypes -*/ - -#include - - -#define lislalpha(c) (isalpha(c) || (c) == '_') -#define lislalnum(c) (isalnum(c) || (c) == '_') -#define lisdigit(c) (isdigit(c)) -#define lisspace(c) (isspace(c)) -#define lisprint(c) (isprint(c)) -#define lisxdigit(c) (isxdigit(c)) - -#define ltolower(c) (tolower(c)) - -#endif /* } */ - -#endif - diff --git a/src/dependencies/lua/ldblib.c b/src/dependencies/lua/ldblib.c deleted file mode 100644 index 2c94138..0000000 --- a/src/dependencies/lua/ldblib.c +++ /dev/null @@ -1,474 +0,0 @@ -/* -** $Id: ldblib.c $ -** Interface from Lua to its debug API -** See Copyright Notice in lua.h -*/ - -#define ldblib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** The hook table at registry[HOOKKEY] maps threads to their current -** hook function. -*/ -static const char *const HOOKKEY = "_HOOKKEY"; - - -/* -** If L1 != L, L1 can be in any state, and therefore there are no -** guarantees about its stack space; any push in L1 must be -** checked. -*/ -static void checkstack (lua_State *L, lua_State *L1, int n) { - if (l_unlikely(L != L1 && !lua_checkstack(L1, n))) - luaL_error(L, "stack overflow"); -} - - -static int db_getregistry (lua_State *L) { - lua_pushvalue(L, LUA_REGISTRYINDEX); - return 1; -} - - -static int db_getmetatable (lua_State *L) { - luaL_checkany(L, 1); - if (!lua_getmetatable(L, 1)) { - lua_pushnil(L); /* no metatable */ - } - return 1; -} - - -static int db_setmetatable (lua_State *L) { - int t = lua_type(L, 2); - luaL_argexpected(L, t == LUA_TNIL || t == LUA_TTABLE, 2, "nil or table"); - lua_settop(L, 2); - lua_setmetatable(L, 1); - return 1; /* return 1st argument */ -} - - -static int db_getuservalue (lua_State *L) { - int n = (int)luaL_optinteger(L, 2, 1); - if (lua_type(L, 1) != LUA_TUSERDATA) - luaL_pushfail(L); - else if (lua_getiuservalue(L, 1, n) != LUA_TNONE) { - lua_pushboolean(L, 1); - return 2; - } - return 1; -} - - -static int db_setuservalue (lua_State *L) { - int n = (int)luaL_optinteger(L, 3, 1); - luaL_checktype(L, 1, LUA_TUSERDATA); - luaL_checkany(L, 2); - lua_settop(L, 2); - if (!lua_setiuservalue(L, 1, n)) - luaL_pushfail(L); - return 1; -} - - -/* -** Auxiliary function used by several library functions: check for -** an optional thread as function's first argument and set 'arg' with -** 1 if this argument is present (so that functions can skip it to -** access their other arguments) -*/ -static lua_State *getthread (lua_State *L, int *arg) { - if (lua_isthread(L, 1)) { - *arg = 1; - return lua_tothread(L, 1); - } - else { - *arg = 0; - return L; /* function will operate over current thread */ - } -} - - -/* -** Variations of 'lua_settable', used by 'db_getinfo' to put results -** from 'lua_getinfo' into result table. Key is always a string; -** value can be a string, an int, or a boolean. -*/ -static void settabss (lua_State *L, const char *k, const char *v) { - lua_pushstring(L, v); - lua_setfield(L, -2, k); -} - -static void settabsi (lua_State *L, const char *k, int v) { - lua_pushinteger(L, v); - lua_setfield(L, -2, k); -} - -static void settabsb (lua_State *L, const char *k, int v) { - lua_pushboolean(L, v); - lua_setfield(L, -2, k); -} - - -/* -** In function 'db_getinfo', the call to 'lua_getinfo' may push -** results on the stack; later it creates the result table to put -** these objects. Function 'treatstackoption' puts the result from -** 'lua_getinfo' on top of the result table so that it can call -** 'lua_setfield'. -*/ -static void treatstackoption (lua_State *L, lua_State *L1, const char *fname) { - if (L == L1) - lua_rotate(L, -2, 1); /* exchange object and table */ - else - lua_xmove(L1, L, 1); /* move object to the "main" stack */ - lua_setfield(L, -2, fname); /* put object into table */ -} - - -/* -** Calls 'lua_getinfo' and collects all results in a new table. -** L1 needs stack space for an optional input (function) plus -** two optional outputs (function and line table) from function -** 'lua_getinfo'. -*/ -static int db_getinfo (lua_State *L) { - lua_Debug ar; - int arg; - lua_State *L1 = getthread(L, &arg); - const char *options = luaL_optstring(L, arg+2, "flnSrtu"); - checkstack(L, L1, 3); - luaL_argcheck(L, options[0] != '>', arg + 2, "invalid option '>'"); - if (lua_isfunction(L, arg + 1)) { /* info about a function? */ - options = lua_pushfstring(L, ">%s", options); /* add '>' to 'options' */ - lua_pushvalue(L, arg + 1); /* move function to 'L1' stack */ - lua_xmove(L, L1, 1); - } - else { /* stack level */ - if (!lua_getstack(L1, (int)luaL_checkinteger(L, arg + 1), &ar)) { - luaL_pushfail(L); /* level out of range */ - return 1; - } - } - if (!lua_getinfo(L1, options, &ar)) - return luaL_argerror(L, arg+2, "invalid option"); - lua_newtable(L); /* table to collect results */ - if (strchr(options, 'S')) { - lua_pushlstring(L, ar.source, ar.srclen); - lua_setfield(L, -2, "source"); - settabss(L, "short_src", ar.short_src); - settabsi(L, "linedefined", ar.linedefined); - settabsi(L, "lastlinedefined", ar.lastlinedefined); - settabss(L, "what", ar.what); - } - if (strchr(options, 'l')) - settabsi(L, "currentline", ar.currentline); - if (strchr(options, 'u')) { - settabsi(L, "nups", ar.nups); - settabsi(L, "nparams", ar.nparams); - settabsb(L, "isvararg", ar.isvararg); - } - if (strchr(options, 'n')) { - settabss(L, "name", ar.name); - settabss(L, "namewhat", ar.namewhat); - } - if (strchr(options, 'r')) { - settabsi(L, "ftransfer", ar.ftransfer); - settabsi(L, "ntransfer", ar.ntransfer); - } - if (strchr(options, 't')) - settabsb(L, "istailcall", ar.istailcall); - if (strchr(options, 'L')) - treatstackoption(L, L1, "activelines"); - if (strchr(options, 'f')) - treatstackoption(L, L1, "func"); - return 1; /* return table */ -} - - -static int db_getlocal (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - int nvar = (int)luaL_checkinteger(L, arg + 2); /* local-variable index */ - if (lua_isfunction(L, arg + 1)) { /* function argument? */ - lua_pushvalue(L, arg + 1); /* push function */ - lua_pushstring(L, lua_getlocal(L, NULL, nvar)); /* push local name */ - return 1; /* return only name (there is no value) */ - } - else { /* stack-level argument */ - lua_Debug ar; - const char *name; - int level = (int)luaL_checkinteger(L, arg + 1); - if (l_unlikely(!lua_getstack(L1, level, &ar))) /* out of range? */ - return luaL_argerror(L, arg+1, "level out of range"); - checkstack(L, L1, 1); - name = lua_getlocal(L1, &ar, nvar); - if (name) { - lua_xmove(L1, L, 1); /* move local value */ - lua_pushstring(L, name); /* push name */ - lua_rotate(L, -2, 1); /* re-order */ - return 2; - } - else { - luaL_pushfail(L); /* no name (nor value) */ - return 1; - } - } -} - - -static int db_setlocal (lua_State *L) { - int arg; - const char *name; - lua_State *L1 = getthread(L, &arg); - lua_Debug ar; - int level = (int)luaL_checkinteger(L, arg + 1); - int nvar = (int)luaL_checkinteger(L, arg + 2); - if (l_unlikely(!lua_getstack(L1, level, &ar))) /* out of range? */ - return luaL_argerror(L, arg+1, "level out of range"); - luaL_checkany(L, arg+3); - lua_settop(L, arg+3); - checkstack(L, L1, 1); - lua_xmove(L, L1, 1); - name = lua_setlocal(L1, &ar, nvar); - if (name == NULL) - lua_pop(L1, 1); /* pop value (if not popped by 'lua_setlocal') */ - lua_pushstring(L, name); - return 1; -} - - -/* -** get (if 'get' is true) or set an upvalue from a closure -*/ -static int auxupvalue (lua_State *L, int get) { - const char *name; - int n = (int)luaL_checkinteger(L, 2); /* upvalue index */ - luaL_checktype(L, 1, LUA_TFUNCTION); /* closure */ - name = get ? lua_getupvalue(L, 1, n) : lua_setupvalue(L, 1, n); - if (name == NULL) return 0; - lua_pushstring(L, name); - lua_insert(L, -(get+1)); /* no-op if get is false */ - return get + 1; -} - - -static int db_getupvalue (lua_State *L) { - return auxupvalue(L, 1); -} - - -static int db_setupvalue (lua_State *L) { - luaL_checkany(L, 3); - return auxupvalue(L, 0); -} - - -/* -** Check whether a given upvalue from a given closure exists and -** returns its index -*/ -static void *checkupval (lua_State *L, int argf, int argnup, int *pnup) { - void *id; - int nup = (int)luaL_checkinteger(L, argnup); /* upvalue index */ - luaL_checktype(L, argf, LUA_TFUNCTION); /* closure */ - id = lua_upvalueid(L, argf, nup); - if (pnup) { - luaL_argcheck(L, id != NULL, argnup, "invalid upvalue index"); - *pnup = nup; - } - return id; -} - - -static int db_upvalueid (lua_State *L) { - void *id = checkupval(L, 1, 2, NULL); - if (id != NULL) - lua_pushlightuserdata(L, id); - else - luaL_pushfail(L); - return 1; -} - - -static int db_upvaluejoin (lua_State *L) { - int n1, n2; - checkupval(L, 1, 2, &n1); - checkupval(L, 3, 4, &n2); - luaL_argcheck(L, !lua_iscfunction(L, 1), 1, "Lua function expected"); - luaL_argcheck(L, !lua_iscfunction(L, 3), 3, "Lua function expected"); - lua_upvaluejoin(L, 1, n1, 3, n2); - return 0; -} - - -/* -** Call hook function registered at hook table for the current -** thread (if there is one) -*/ -static void hookf (lua_State *L, lua_Debug *ar) { - static const char *const hooknames[] = - {"call", "return", "line", "count", "tail call"}; - lua_getfield(L, LUA_REGISTRYINDEX, HOOKKEY); - lua_pushthread(L); - if (lua_rawget(L, -2) == LUA_TFUNCTION) { /* is there a hook function? */ - lua_pushstring(L, hooknames[(int)ar->event]); /* push event name */ - if (ar->currentline >= 0) - lua_pushinteger(L, ar->currentline); /* push current line */ - else lua_pushnil(L); - lua_assert(lua_getinfo(L, "lS", ar)); - lua_call(L, 2, 0); /* call hook function */ - } -} - - -/* -** Convert a string mask (for 'sethook') into a bit mask -*/ -static int makemask (const char *smask, int count) { - int mask = 0; - if (strchr(smask, 'c')) mask |= LUA_MASKCALL; - if (strchr(smask, 'r')) mask |= LUA_MASKRET; - if (strchr(smask, 'l')) mask |= LUA_MASKLINE; - if (count > 0) mask |= LUA_MASKCOUNT; - return mask; -} - - -/* -** Convert a bit mask (for 'gethook') into a string mask -*/ -static char *unmakemask (int mask, char *smask) { - int i = 0; - if (mask & LUA_MASKCALL) smask[i++] = 'c'; - if (mask & LUA_MASKRET) smask[i++] = 'r'; - if (mask & LUA_MASKLINE) smask[i++] = 'l'; - smask[i] = '\0'; - return smask; -} - - -static int db_sethook (lua_State *L) { - int arg, mask, count; - lua_Hook func; - lua_State *L1 = getthread(L, &arg); - if (lua_isnoneornil(L, arg+1)) { /* no hook? */ - lua_settop(L, arg+1); - func = NULL; mask = 0; count = 0; /* turn off hooks */ - } - else { - const char *smask = luaL_checkstring(L, arg+2); - luaL_checktype(L, arg+1, LUA_TFUNCTION); - count = (int)luaL_optinteger(L, arg + 3, 0); - func = hookf; mask = makemask(smask, count); - } - if (!luaL_getsubtable(L, LUA_REGISTRYINDEX, HOOKKEY)) { - /* table just created; initialize it */ - lua_pushliteral(L, "k"); - lua_setfield(L, -2, "__mode"); /** hooktable.__mode = "k" */ - lua_pushvalue(L, -1); - lua_setmetatable(L, -2); /* metatable(hooktable) = hooktable */ - } - checkstack(L, L1, 1); - lua_pushthread(L1); lua_xmove(L1, L, 1); /* key (thread) */ - lua_pushvalue(L, arg + 1); /* value (hook function) */ - lua_rawset(L, -3); /* hooktable[L1] = new Lua hook */ - lua_sethook(L1, func, mask, count); - return 0; -} - - -static int db_gethook (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - char buff[5]; - int mask = lua_gethookmask(L1); - lua_Hook hook = lua_gethook(L1); - if (hook == NULL) { /* no hook? */ - luaL_pushfail(L); - return 1; - } - else if (hook != hookf) /* external hook? */ - lua_pushliteral(L, "external hook"); - else { /* hook table must exist */ - lua_getfield(L, LUA_REGISTRYINDEX, HOOKKEY); - checkstack(L, L1, 1); - lua_pushthread(L1); lua_xmove(L1, L, 1); - lua_rawget(L, -2); /* 1st result = hooktable[L1] */ - lua_remove(L, -2); /* remove hook table */ - } - lua_pushstring(L, unmakemask(mask, buff)); /* 2nd result = mask */ - lua_pushinteger(L, lua_gethookcount(L1)); /* 3rd result = count */ - return 3; -} - - -static int db_debug (lua_State *L) { - for (;;) { - char buffer[250]; - lua_writestringerror("%s", "lua_debug> "); - if (fgets(buffer, sizeof(buffer), stdin) == NULL || - strcmp(buffer, "cont\n") == 0) - return 0; - if (luaL_loadbuffer(L, buffer, strlen(buffer), "=(debug command)") || - lua_pcall(L, 0, 0, 0)) - lua_writestringerror("%s\n", luaL_tolstring(L, -1, NULL)); - lua_settop(L, 0); /* remove eventual returns */ - } -} - - -static int db_traceback (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - const char *msg = lua_tostring(L, arg + 1); - if (msg == NULL && !lua_isnoneornil(L, arg + 1)) /* non-string 'msg'? */ - lua_pushvalue(L, arg + 1); /* return it untouched */ - else { - int level = (int)luaL_optinteger(L, arg + 2, (L == L1) ? 1 : 0); - luaL_traceback(L, L1, msg, level); - } - return 1; -} - - -static const luaL_Reg dblib[] = { - {"debug", db_debug}, - {"getuservalue", db_getuservalue}, - {"gethook", db_gethook}, - {"getinfo", db_getinfo}, - {"getlocal", db_getlocal}, - {"getregistry", db_getregistry}, - {"getmetatable", db_getmetatable}, - {"getupvalue", db_getupvalue}, - {"upvaluejoin", db_upvaluejoin}, - {"upvalueid", db_upvalueid}, - {"setuservalue", db_setuservalue}, - {"sethook", db_sethook}, - {"setlocal", db_setlocal}, - {"setmetatable", db_setmetatable}, - {"setupvalue", db_setupvalue}, - {"traceback", db_traceback}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_debug (lua_State *L) { - luaL_newlib(L, dblib); - return 1; -} - diff --git a/src/dependencies/lua/ldebug.c b/src/dependencies/lua/ldebug.c deleted file mode 100644 index daa979a..0000000 --- a/src/dependencies/lua/ldebug.c +++ /dev/null @@ -1,963 +0,0 @@ -/* -** $Id: ldebug.c $ -** Debug Interface -** See Copyright Notice in lua.h -*/ - -#define ldebug_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "lcode.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lvm.h" - - - -#define noLuaClosure(f) ((f) == NULL || (f)->c.tt == LUA_VCCL) - - -static const char *funcnamefromcall (lua_State *L, CallInfo *ci, - const char **name); - - -static int currentpc (CallInfo *ci) { - lua_assert(isLua(ci)); - return pcRel(ci->u.l.savedpc, ci_func(ci)->p); -} - - -/* -** Get a "base line" to find the line corresponding to an instruction. -** Base lines are regularly placed at MAXIWTHABS intervals, so usually -** an integer division gets the right place. When the source file has -** large sequences of empty/comment lines, it may need extra entries, -** so the original estimate needs a correction. -** If the original estimate is -1, the initial 'if' ensures that the -** 'while' will run at least once. -** The assertion that the estimate is a lower bound for the correct base -** is valid as long as the debug info has been generated with the same -** value for MAXIWTHABS or smaller. (Previous releases use a little -** smaller value.) -*/ -static int getbaseline (const Proto *f, int pc, int *basepc) { - if (f->sizeabslineinfo == 0 || pc < f->abslineinfo[0].pc) { - *basepc = -1; /* start from the beginning */ - return f->linedefined; - } - else { - int i = cast_uint(pc) / MAXIWTHABS - 1; /* get an estimate */ - /* estimate must be a lower bound of the correct base */ - lua_assert(i < 0 || - (i < f->sizeabslineinfo && f->abslineinfo[i].pc <= pc)); - while (i + 1 < f->sizeabslineinfo && pc >= f->abslineinfo[i + 1].pc) - i++; /* low estimate; adjust it */ - *basepc = f->abslineinfo[i].pc; - return f->abslineinfo[i].line; - } -} - - -/* -** Get the line corresponding to instruction 'pc' in function 'f'; -** first gets a base line and from there does the increments until -** the desired instruction. -*/ -int luaG_getfuncline (const Proto *f, int pc) { - if (f->lineinfo == NULL) /* no debug information? */ - return -1; - else { - int basepc; - int baseline = getbaseline(f, pc, &basepc); - while (basepc++ < pc) { /* walk until given instruction */ - lua_assert(f->lineinfo[basepc] != ABSLINEINFO); - baseline += f->lineinfo[basepc]; /* correct line */ - } - return baseline; - } -} - - -static int getcurrentline (CallInfo *ci) { - return luaG_getfuncline(ci_func(ci)->p, currentpc(ci)); -} - - -/* -** Set 'trap' for all active Lua frames. -** This function can be called during a signal, under "reasonable" -** assumptions. A new 'ci' is completely linked in the list before it -** becomes part of the "active" list, and we assume that pointers are -** atomic; see comment in next function. -** (A compiler doing interprocedural optimizations could, theoretically, -** reorder memory writes in such a way that the list could be -** temporarily broken while inserting a new element. We simply assume it -** has no good reasons to do that.) -*/ -static void settraps (CallInfo *ci) { - for (; ci != NULL; ci = ci->previous) - if (isLua(ci)) - ci->u.l.trap = 1; -} - - -/* -** This function can be called during a signal, under "reasonable" -** assumptions. -** Fields 'basehookcount' and 'hookcount' (set by 'resethookcount') -** are for debug only, and it is no problem if they get arbitrary -** values (causes at most one wrong hook call). 'hookmask' is an atomic -** value. We assume that pointers are atomic too (e.g., gcc ensures that -** for all platforms where it runs). Moreover, 'hook' is always checked -** before being called (see 'luaD_hook'). -*/ -LUA_API void lua_sethook (lua_State *L, lua_Hook func, int mask, int count) { - if (func == NULL || mask == 0) { /* turn off hooks? */ - mask = 0; - func = NULL; - } - L->hook = func; - L->basehookcount = count; - resethookcount(L); - L->hookmask = cast_byte(mask); - if (mask) - settraps(L->ci); /* to trace inside 'luaV_execute' */ -} - - -LUA_API lua_Hook lua_gethook (lua_State *L) { - return L->hook; -} - - -LUA_API int lua_gethookmask (lua_State *L) { - return L->hookmask; -} - - -LUA_API int lua_gethookcount (lua_State *L) { - return L->basehookcount; -} - - -LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar) { - int status; - CallInfo *ci; - if (level < 0) return 0; /* invalid (negative) level */ - lua_lock(L); - for (ci = L->ci; level > 0 && ci != &L->base_ci; ci = ci->previous) - level--; - if (level == 0 && ci != &L->base_ci) { /* level found? */ - status = 1; - ar->i_ci = ci; - } - else status = 0; /* no such level */ - lua_unlock(L); - return status; -} - - -static const char *upvalname (const Proto *p, int uv) { - TString *s = check_exp(uv < p->sizeupvalues, p->upvalues[uv].name); - if (s == NULL) return "?"; - else return getstr(s); -} - - -static const char *findvararg (CallInfo *ci, int n, StkId *pos) { - if (clLvalue(s2v(ci->func.p))->p->flag & PF_ISVARARG) { - int nextra = ci->u.l.nextraargs; - if (n >= -nextra) { /* 'n' is negative */ - *pos = ci->func.p - nextra - (n + 1); - return "(vararg)"; /* generic name for any vararg */ - } - } - return NULL; /* no such vararg */ -} - - -const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, StkId *pos) { - StkId base = ci->func.p + 1; - const char *name = NULL; - if (isLua(ci)) { - if (n < 0) /* access to vararg values? */ - return findvararg(ci, n, pos); - else - name = luaF_getlocalname(ci_func(ci)->p, n, currentpc(ci)); - } - if (name == NULL) { /* no 'standard' name? */ - StkId limit = (ci == L->ci) ? L->top.p : ci->next->func.p; - if (limit - base >= n && n > 0) { /* is 'n' inside 'ci' stack? */ - /* generic name for any valid slot */ - name = isLua(ci) ? "(temporary)" : "(C temporary)"; - } - else - return NULL; /* no name */ - } - if (pos) - *pos = base + (n - 1); - return name; -} - - -LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) { - const char *name; - lua_lock(L); - if (ar == NULL) { /* information about non-active function? */ - if (!isLfunction(s2v(L->top.p - 1))) /* not a Lua function? */ - name = NULL; - else /* consider live variables at function start (parameters) */ - name = luaF_getlocalname(clLvalue(s2v(L->top.p - 1))->p, n, 0); - } - else { /* active function; get information through 'ar' */ - StkId pos = NULL; /* to avoid warnings */ - name = luaG_findlocal(L, ar->i_ci, n, &pos); - if (name) { - setobjs2s(L, L->top.p, pos); - api_incr_top(L); - } - } - lua_unlock(L); - return name; -} - - -LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) { - StkId pos = NULL; /* to avoid warnings */ - const char *name; - lua_lock(L); - name = luaG_findlocal(L, ar->i_ci, n, &pos); - if (name) { - api_checkpop(L, 1); - setobjs2s(L, pos, L->top.p - 1); - L->top.p--; /* pop value */ - } - lua_unlock(L); - return name; -} - - -static void funcinfo (lua_Debug *ar, Closure *cl) { - if (noLuaClosure(cl)) { - ar->source = "=[C]"; - ar->srclen = LL("=[C]"); - ar->linedefined = -1; - ar->lastlinedefined = -1; - ar->what = "C"; - } - else { - const Proto *p = cl->l.p; - if (p->source) { - ar->source = getlstr(p->source, ar->srclen); - } - else { - ar->source = "=?"; - ar->srclen = LL("=?"); - } - ar->linedefined = p->linedefined; - ar->lastlinedefined = p->lastlinedefined; - ar->what = (ar->linedefined == 0) ? "main" : "Lua"; - } - luaO_chunkid(ar->short_src, ar->source, ar->srclen); -} - - -static int nextline (const Proto *p, int currentline, int pc) { - if (p->lineinfo[pc] != ABSLINEINFO) - return currentline + p->lineinfo[pc]; - else - return luaG_getfuncline(p, pc); -} - - -static void collectvalidlines (lua_State *L, Closure *f) { - if (noLuaClosure(f)) { - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - } - else { - int i; - TValue v; - const Proto *p = f->l.p; - int currentline = p->linedefined; - Table *t = luaH_new(L); /* new table to store active lines */ - sethvalue2s(L, L->top.p, t); /* push it on stack */ - api_incr_top(L); - setbtvalue(&v); /* boolean 'true' to be the value of all indices */ - if (!(p->flag & PF_ISVARARG)) /* regular function? */ - i = 0; /* consider all instructions */ - else { /* vararg function */ - lua_assert(GET_OPCODE(p->code[0]) == OP_VARARGPREP); - currentline = nextline(p, currentline, 0); - i = 1; /* skip first instruction (OP_VARARGPREP) */ - } - for (; i < p->sizelineinfo; i++) { /* for each instruction */ - currentline = nextline(p, currentline, i); /* get its line */ - luaH_setint(L, t, currentline, &v); /* table[line] = true */ - } - } -} - - -static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name) { - /* calling function is a known function? */ - if (ci != NULL && !(ci->callstatus & CIST_TAIL)) - return funcnamefromcall(L, ci->previous, name); - else return NULL; /* no way to find a name */ -} - - -static int auxgetinfo (lua_State *L, const char *what, lua_Debug *ar, - Closure *f, CallInfo *ci) { - int status = 1; - for (; *what; what++) { - switch (*what) { - case 'S': { - funcinfo(ar, f); - break; - } - case 'l': { - ar->currentline = (ci && isLua(ci)) ? getcurrentline(ci) : -1; - break; - } - case 'u': { - ar->nups = (f == NULL) ? 0 : f->c.nupvalues; - if (noLuaClosure(f)) { - ar->isvararg = 1; - ar->nparams = 0; - } - else { - ar->isvararg = f->l.p->flag & PF_ISVARARG; - ar->nparams = f->l.p->numparams; - } - break; - } - case 't': { - ar->istailcall = (ci) ? ci->callstatus & CIST_TAIL : 0; - break; - } - case 'n': { - ar->namewhat = getfuncname(L, ci, &ar->name); - if (ar->namewhat == NULL) { - ar->namewhat = ""; /* not found */ - ar->name = NULL; - } - break; - } - case 'r': { - if (ci == NULL || !(ci->callstatus & CIST_TRAN)) - ar->ftransfer = ar->ntransfer = 0; - else { - ar->ftransfer = ci->u2.transferinfo.ftransfer; - ar->ntransfer = ci->u2.transferinfo.ntransfer; - } - break; - } - case 'L': - case 'f': /* handled by lua_getinfo */ - break; - default: status = 0; /* invalid option */ - } - } - return status; -} - - -LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) { - int status; - Closure *cl; - CallInfo *ci; - TValue *func; - lua_lock(L); - if (*what == '>') { - ci = NULL; - func = s2v(L->top.p - 1); - api_check(L, ttisfunction(func), "function expected"); - what++; /* skip the '>' */ - L->top.p--; /* pop function */ - } - else { - ci = ar->i_ci; - func = s2v(ci->func.p); - lua_assert(ttisfunction(func)); - } - cl = ttisclosure(func) ? clvalue(func) : NULL; - status = auxgetinfo(L, what, ar, cl, ci); - if (strchr(what, 'f')) { - setobj2s(L, L->top.p, func); - api_incr_top(L); - } - if (strchr(what, 'L')) - collectvalidlines(L, cl); - lua_unlock(L); - return status; -} - - -/* -** {====================================================== -** Symbolic Execution -** ======================================================= -*/ - - -static int filterpc (int pc, int jmptarget) { - if (pc < jmptarget) /* is code conditional (inside a jump)? */ - return -1; /* cannot know who sets that register */ - else return pc; /* current position sets that register */ -} - - -/* -** Try to find last instruction before 'lastpc' that modified register 'reg'. -*/ -static int findsetreg (const Proto *p, int lastpc, int reg) { - int pc; - int setreg = -1; /* keep last instruction that changed 'reg' */ - int jmptarget = 0; /* any code before this address is conditional */ - if (testMMMode(GET_OPCODE(p->code[lastpc]))) - lastpc--; /* previous instruction was not actually executed */ - for (pc = 0; pc < lastpc; pc++) { - Instruction i = p->code[pc]; - OpCode op = GET_OPCODE(i); - int a = GETARG_A(i); - int change; /* true if current instruction changed 'reg' */ - switch (op) { - case OP_LOADNIL: { /* set registers from 'a' to 'a+b' */ - int b = GETARG_B(i); - change = (a <= reg && reg <= a + b); - break; - } - case OP_TFORCALL: { /* affect all regs above its base */ - change = (reg >= a + 2); - break; - } - case OP_CALL: - case OP_TAILCALL: { /* affect all registers above base */ - change = (reg >= a); - break; - } - case OP_JMP: { /* doesn't change registers, but changes 'jmptarget' */ - int b = GETARG_sJ(i); - int dest = pc + 1 + b; - /* jump does not skip 'lastpc' and is larger than current one? */ - if (dest <= lastpc && dest > jmptarget) - jmptarget = dest; /* update 'jmptarget' */ - change = 0; - break; - } - default: /* any instruction that sets A */ - change = (testAMode(op) && reg == a); - break; - } - if (change) - setreg = filterpc(pc, jmptarget); - } - return setreg; -} - - -/* -** Find a "name" for the constant 'c'. -*/ -static const char *kname (const Proto *p, int index, const char **name) { - TValue *kvalue = &p->k[index]; - if (ttisstring(kvalue)) { - *name = getstr(tsvalue(kvalue)); - return "constant"; - } - else { - *name = "?"; - return NULL; - } -} - - -static const char *basicgetobjname (const Proto *p, int *ppc, int reg, - const char **name) { - int pc = *ppc; - *name = luaF_getlocalname(p, reg + 1, pc); - if (*name) /* is a local? */ - return "local"; - /* else try symbolic execution */ - *ppc = pc = findsetreg(p, pc, reg); - if (pc != -1) { /* could find instruction? */ - Instruction i = p->code[pc]; - OpCode op = GET_OPCODE(i); - switch (op) { - case OP_MOVE: { - int b = GETARG_B(i); /* move from 'b' to 'a' */ - if (b < GETARG_A(i)) - return basicgetobjname(p, ppc, b, name); /* get name for 'b' */ - break; - } - case OP_GETUPVAL: { - *name = upvalname(p, GETARG_B(i)); - return "upvalue"; - } - case OP_LOADK: return kname(p, GETARG_Bx(i), name); - case OP_LOADKX: return kname(p, GETARG_Ax(p->code[pc + 1]), name); - default: break; - } - } - return NULL; /* could not find reasonable name */ -} - - -/* -** Find a "name" for the register 'c'. -*/ -static void rname (const Proto *p, int pc, int c, const char **name) { - const char *what = basicgetobjname(p, &pc, c, name); /* search for 'c' */ - if (!(what && *what == 'c')) /* did not find a constant name? */ - *name = "?"; -} - - -/* -** Find a "name" for a 'C' value in an RK instruction. -*/ -static void rkname (const Proto *p, int pc, Instruction i, const char **name) { - int c = GETARG_C(i); /* key index */ - if (GETARG_k(i)) /* is 'c' a constant? */ - kname(p, c, name); - else /* 'c' is a register */ - rname(p, pc, c, name); -} - - -/* -** Check whether table being indexed by instruction 'i' is the -** environment '_ENV' -*/ -static const char *isEnv (const Proto *p, int pc, Instruction i, int isup) { - int t = GETARG_B(i); /* table index */ - const char *name; /* name of indexed variable */ - if (isup) /* is 't' an upvalue? */ - name = upvalname(p, t); - else /* 't' is a register */ - basicgetobjname(p, &pc, t, &name); - return (name && strcmp(name, LUA_ENV) == 0) ? "global" : "field"; -} - - -/* -** Extend 'basicgetobjname' to handle table accesses -*/ -static const char *getobjname (const Proto *p, int lastpc, int reg, - const char **name) { - const char *kind = basicgetobjname(p, &lastpc, reg, name); - if (kind != NULL) - return kind; - else if (lastpc != -1) { /* could find instruction? */ - Instruction i = p->code[lastpc]; - OpCode op = GET_OPCODE(i); - switch (op) { - case OP_GETTABUP: { - int k = GETARG_C(i); /* key index */ - kname(p, k, name); - return isEnv(p, lastpc, i, 1); - } - case OP_GETTABLE: { - int k = GETARG_C(i); /* key index */ - rname(p, lastpc, k, name); - return isEnv(p, lastpc, i, 0); - } - case OP_GETI: { - *name = "integer index"; - return "field"; - } - case OP_GETFIELD: { - int k = GETARG_C(i); /* key index */ - kname(p, k, name); - return isEnv(p, lastpc, i, 0); - } - case OP_SELF: { - rkname(p, lastpc, i, name); - return "method"; - } - default: break; /* go through to return NULL */ - } - } - return NULL; /* could not find reasonable name */ -} - - -/* -** Try to find a name for a function based on the code that called it. -** (Only works when function was called by a Lua function.) -** Returns what the name is (e.g., "for iterator", "method", -** "metamethod") and sets '*name' to point to the name. -*/ -static const char *funcnamefromcode (lua_State *L, const Proto *p, - int pc, const char **name) { - TMS tm = (TMS)0; /* (initial value avoids warnings) */ - Instruction i = p->code[pc]; /* calling instruction */ - switch (GET_OPCODE(i)) { - case OP_CALL: - case OP_TAILCALL: - return getobjname(p, pc, GETARG_A(i), name); /* get function name */ - case OP_TFORCALL: { /* for iterator */ - *name = "for iterator"; - return "for iterator"; - } - /* other instructions can do calls through metamethods */ - case OP_SELF: case OP_GETTABUP: case OP_GETTABLE: - case OP_GETI: case OP_GETFIELD: - tm = TM_INDEX; - break; - case OP_SETTABUP: case OP_SETTABLE: case OP_SETI: case OP_SETFIELD: - tm = TM_NEWINDEX; - break; - case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { - tm = cast(TMS, GETARG_C(i)); - break; - } - case OP_UNM: tm = TM_UNM; break; - case OP_BNOT: tm = TM_BNOT; break; - case OP_LEN: tm = TM_LEN; break; - case OP_CONCAT: tm = TM_CONCAT; break; - case OP_EQ: tm = TM_EQ; break; - /* no cases for OP_EQI and OP_EQK, as they don't call metamethods */ - case OP_LT: case OP_LTI: case OP_GTI: tm = TM_LT; break; - case OP_LE: case OP_LEI: case OP_GEI: tm = TM_LE; break; - case OP_CLOSE: case OP_RETURN: tm = TM_CLOSE; break; - default: - return NULL; /* cannot find a reasonable name */ - } - *name = getshrstr(G(L)->tmname[tm]) + 2; - return "metamethod"; -} - - -/* -** Try to find a name for a function based on how it was called. -*/ -static const char *funcnamefromcall (lua_State *L, CallInfo *ci, - const char **name) { - if (ci->callstatus & CIST_HOOKED) { /* was it called inside a hook? */ - *name = "?"; - return "hook"; - } - else if (ci->callstatus & CIST_FIN) { /* was it called as a finalizer? */ - *name = "__gc"; - return "metamethod"; /* report it as such */ - } - else if (isLua(ci)) - return funcnamefromcode(L, ci_func(ci)->p, currentpc(ci), name); - else - return NULL; -} - -/* }====================================================== */ - - - -/* -** Check whether pointer 'o' points to some value in the stack frame of -** the current function and, if so, returns its index. Because 'o' may -** not point to a value in this stack, we cannot compare it with the -** region boundaries (undefined behavior in ISO C). -*/ -static int instack (CallInfo *ci, const TValue *o) { - int pos; - StkId base = ci->func.p + 1; - for (pos = 0; base + pos < ci->top.p; pos++) { - if (o == s2v(base + pos)) - return pos; - } - return -1; /* not found */ -} - - -/* -** Checks whether value 'o' came from an upvalue. (That can only happen -** with instructions OP_GETTABUP/OP_SETTABUP, which operate directly on -** upvalues.) -*/ -static const char *getupvalname (CallInfo *ci, const TValue *o, - const char **name) { - LClosure *c = ci_func(ci); - int i; - for (i = 0; i < c->nupvalues; i++) { - if (c->upvals[i]->v.p == o) { - *name = upvalname(c->p, i); - return "upvalue"; - } - } - return NULL; -} - - -static const char *formatvarinfo (lua_State *L, const char *kind, - const char *name) { - if (kind == NULL) - return ""; /* no information */ - else - return luaO_pushfstring(L, " (%s '%s')", kind, name); -} - -/* -** Build a string with a "description" for the value 'o', such as -** "variable 'x'" or "upvalue 'y'". -*/ -static const char *varinfo (lua_State *L, const TValue *o) { - CallInfo *ci = L->ci; - const char *name = NULL; /* to avoid warnings */ - const char *kind = NULL; - if (isLua(ci)) { - kind = getupvalname(ci, o, &name); /* check whether 'o' is an upvalue */ - if (!kind) { /* not an upvalue? */ - int reg = instack(ci, o); /* try a register */ - if (reg >= 0) /* is 'o' a register? */ - kind = getobjname(ci_func(ci)->p, currentpc(ci), reg, &name); - } - } - return formatvarinfo(L, kind, name); -} - - -/* -** Raise a type error -*/ -static l_noret typeerror (lua_State *L, const TValue *o, const char *op, - const char *extra) { - const char *t = luaT_objtypename(L, o); - luaG_runerror(L, "attempt to %s a %s value%s", op, t, extra); -} - - -/* -** Raise a type error with "standard" information about the faulty -** object 'o' (using 'varinfo'). -*/ -l_noret luaG_typeerror (lua_State *L, const TValue *o, const char *op) { - typeerror(L, o, op, varinfo(L, o)); -} - - -/* -** Raise an error for calling a non-callable object. Try to find a name -** for the object based on how it was called ('funcnamefromcall'); if it -** cannot get a name there, try 'varinfo'. -*/ -l_noret luaG_callerror (lua_State *L, const TValue *o) { - CallInfo *ci = L->ci; - const char *name = NULL; /* to avoid warnings */ - const char *kind = funcnamefromcall(L, ci, &name); - const char *extra = kind ? formatvarinfo(L, kind, name) : varinfo(L, o); - typeerror(L, o, "call", extra); -} - - -l_noret luaG_forerror (lua_State *L, const TValue *o, const char *what) { - luaG_runerror(L, "bad 'for' %s (number expected, got %s)", - what, luaT_objtypename(L, o)); -} - - -l_noret luaG_concaterror (lua_State *L, const TValue *p1, const TValue *p2) { - if (ttisstring(p1) || cvt2str(p1)) p1 = p2; - luaG_typeerror(L, p1, "concatenate"); -} - - -l_noret luaG_opinterror (lua_State *L, const TValue *p1, - const TValue *p2, const char *msg) { - if (!ttisnumber(p1)) /* first operand is wrong? */ - p2 = p1; /* now second is wrong */ - luaG_typeerror(L, p2, msg); -} - - -/* -** Error when both values are convertible to numbers, but not to integers -*/ -l_noret luaG_tointerror (lua_State *L, const TValue *p1, const TValue *p2) { - lua_Integer temp; - if (!luaV_tointegerns(p1, &temp, LUA_FLOORN2I)) - p2 = p1; - luaG_runerror(L, "number%s has no integer representation", varinfo(L, p2)); -} - - -l_noret luaG_ordererror (lua_State *L, const TValue *p1, const TValue *p2) { - const char *t1 = luaT_objtypename(L, p1); - const char *t2 = luaT_objtypename(L, p2); - if (strcmp(t1, t2) == 0) - luaG_runerror(L, "attempt to compare two %s values", t1); - else - luaG_runerror(L, "attempt to compare %s with %s", t1, t2); -} - - -/* add src:line information to 'msg' */ -const char *luaG_addinfo (lua_State *L, const char *msg, TString *src, - int line) { - char buff[LUA_IDSIZE]; - if (src) { - size_t idlen; - const char *id = getlstr(src, idlen); - luaO_chunkid(buff, id, idlen); - } - else { /* no source available; use "?" instead */ - buff[0] = '?'; buff[1] = '\0'; - } - return luaO_pushfstring(L, "%s:%d: %s", buff, line, msg); -} - - -l_noret luaG_errormsg (lua_State *L) { - if (L->errfunc != 0) { /* is there an error handling function? */ - StkId errfunc = restorestack(L, L->errfunc); - lua_assert(ttisfunction(s2v(errfunc))); - setobjs2s(L, L->top.p, L->top.p - 1); /* move argument */ - setobjs2s(L, L->top.p - 1, errfunc); /* push function */ - L->top.p++; /* assume EXTRA_STACK */ - luaD_callnoyield(L, L->top.p - 2, 1); /* call it */ - } - luaD_throw(L, LUA_ERRRUN); -} - - -l_noret luaG_runerror (lua_State *L, const char *fmt, ...) { - CallInfo *ci = L->ci; - const char *msg; - va_list argp; - luaC_checkGC(L); /* error message uses memory */ - va_start(argp, fmt); - msg = luaO_pushvfstring(L, fmt, argp); /* format message */ - va_end(argp); - if (isLua(ci)) { /* if Lua function, add source:line information */ - luaG_addinfo(L, msg, ci_func(ci)->p->source, getcurrentline(ci)); - setobjs2s(L, L->top.p - 2, L->top.p - 1); /* remove 'msg' */ - L->top.p--; - } - luaG_errormsg(L); -} - - -/* -** Check whether new instruction 'newpc' is in a different line from -** previous instruction 'oldpc'. More often than not, 'newpc' is only -** one or a few instructions after 'oldpc' (it must be after, see -** caller), so try to avoid calling 'luaG_getfuncline'. If they are -** too far apart, there is a good chance of a ABSLINEINFO in the way, -** so it goes directly to 'luaG_getfuncline'. -*/ -static int changedline (const Proto *p, int oldpc, int newpc) { - if (p->lineinfo == NULL) /* no debug information? */ - return 0; - if (newpc - oldpc < MAXIWTHABS / 2) { /* not too far apart? */ - int delta = 0; /* line difference */ - int pc = oldpc; - for (;;) { - int lineinfo = p->lineinfo[++pc]; - if (lineinfo == ABSLINEINFO) - break; /* cannot compute delta; fall through */ - delta += lineinfo; - if (pc == newpc) - return (delta != 0); /* delta computed successfully */ - } - } - /* either instructions are too far apart or there is an absolute line - info in the way; compute line difference explicitly */ - return (luaG_getfuncline(p, oldpc) != luaG_getfuncline(p, newpc)); -} - - -/* -** Traces Lua calls. If code is running the first instruction of a function, -** and function is not vararg, and it is not coming from an yield, -** calls 'luaD_hookcall'. (Vararg functions will call 'luaD_hookcall' -** after adjusting its variable arguments; otherwise, they could call -** a line/count hook before the call hook. Functions coming from -** an yield already called 'luaD_hookcall' before yielding.) -*/ -int luaG_tracecall (lua_State *L) { - CallInfo *ci = L->ci; - Proto *p = ci_func(ci)->p; - ci->u.l.trap = 1; /* ensure hooks will be checked */ - if (ci->u.l.savedpc == p->code) { /* first instruction (not resuming)? */ - if (p->flag & PF_ISVARARG) - return 0; /* hooks will start at VARARGPREP instruction */ - else if (!(ci->callstatus & CIST_HOOKYIELD)) /* not yieded? */ - luaD_hookcall(L, ci); /* check 'call' hook */ - } - return 1; /* keep 'trap' on */ -} - - -/* -** Traces the execution of a Lua function. Called before the execution -** of each opcode, when debug is on. 'L->oldpc' stores the last -** instruction traced, to detect line changes. When entering a new -** function, 'npci' will be zero and will test as a new line whatever -** the value of 'oldpc'. Some exceptional conditions may return to -** a function without setting 'oldpc'. In that case, 'oldpc' may be -** invalid; if so, use zero as a valid value. (A wrong but valid 'oldpc' -** at most causes an extra call to a line hook.) -** This function is not "Protected" when called, so it should correct -** 'L->top.p' before calling anything that can run the GC. -*/ -int luaG_traceexec (lua_State *L, const Instruction *pc) { - CallInfo *ci = L->ci; - lu_byte mask = L->hookmask; - const Proto *p = ci_func(ci)->p; - int counthook; - if (!(mask & (LUA_MASKLINE | LUA_MASKCOUNT))) { /* no hooks? */ - ci->u.l.trap = 0; /* don't need to stop again */ - return 0; /* turn off 'trap' */ - } - pc++; /* reference is always next instruction */ - ci->u.l.savedpc = pc; /* save 'pc' */ - counthook = (mask & LUA_MASKCOUNT) && (--L->hookcount == 0); - if (counthook) - resethookcount(L); /* reset count */ - else if (!(mask & LUA_MASKLINE)) - return 1; /* no line hook and count != 0; nothing to be done now */ - if (ci->callstatus & CIST_HOOKYIELD) { /* hook yielded last time? */ - ci->callstatus &= ~CIST_HOOKYIELD; /* erase mark */ - return 1; /* do not call hook again (VM yielded, so it did not move) */ - } - if (!isIT(*(ci->u.l.savedpc - 1))) /* top not being used? */ - L->top.p = ci->top.p; /* correct top */ - if (counthook) - luaD_hook(L, LUA_HOOKCOUNT, -1, 0, 0); /* call count hook */ - if (mask & LUA_MASKLINE) { - /* 'L->oldpc' may be invalid; use zero in this case */ - int oldpc = (L->oldpc < p->sizecode) ? L->oldpc : 0; - int npci = pcRel(pc, p); - if (npci <= oldpc || /* call hook when jump back (loop), */ - changedline(p, oldpc, npci)) { /* or when enter new line */ - int newline = luaG_getfuncline(p, npci); - luaD_hook(L, LUA_HOOKLINE, newline, 0, 0); /* call line hook */ - } - L->oldpc = npci; /* 'pc' of last call to line hook */ - } - if (L->status == LUA_YIELD) { /* did hook yield? */ - if (counthook) - L->hookcount = 1; /* undo decrement to zero */ - ci->callstatus |= CIST_HOOKYIELD; /* mark that it yielded */ - luaD_throw(L, LUA_YIELD); - } - return 1; /* keep 'trap' on */ -} - diff --git a/src/dependencies/lua/ldebug.h b/src/dependencies/lua/ldebug.h deleted file mode 100644 index 2bfce3c..0000000 --- a/src/dependencies/lua/ldebug.h +++ /dev/null @@ -1,64 +0,0 @@ -/* -** $Id: ldebug.h $ -** Auxiliary functions from Debug Interface module -** See Copyright Notice in lua.h -*/ - -#ifndef ldebug_h -#define ldebug_h - - -#include "lstate.h" - - -#define pcRel(pc, p) (cast_int((pc) - (p)->code) - 1) - - -/* Active Lua function (given call info) */ -#define ci_func(ci) (clLvalue(s2v((ci)->func.p))) - - -#define resethookcount(L) (L->hookcount = L->basehookcount) - -/* -** mark for entries in 'lineinfo' array that has absolute information in -** 'abslineinfo' array -*/ -#define ABSLINEINFO (-0x80) - - -/* -** MAXimum number of successive Instructions WiTHout ABSolute line -** information. (A power of two allows fast divisions.) -*/ -#if !defined(MAXIWTHABS) -#define MAXIWTHABS 128 -#endif - - -LUAI_FUNC int luaG_getfuncline (const Proto *f, int pc); -LUAI_FUNC const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, - StkId *pos); -LUAI_FUNC l_noret luaG_typeerror (lua_State *L, const TValue *o, - const char *opname); -LUAI_FUNC l_noret luaG_callerror (lua_State *L, const TValue *o); -LUAI_FUNC l_noret luaG_forerror (lua_State *L, const TValue *o, - const char *what); -LUAI_FUNC l_noret luaG_concaterror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_opinterror (lua_State *L, const TValue *p1, - const TValue *p2, - const char *msg); -LUAI_FUNC l_noret luaG_tointerror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_ordererror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_runerror (lua_State *L, const char *fmt, ...); -LUAI_FUNC const char *luaG_addinfo (lua_State *L, const char *msg, - TString *src, int line); -LUAI_FUNC l_noret luaG_errormsg (lua_State *L); -LUAI_FUNC int luaG_traceexec (lua_State *L, const Instruction *pc); -LUAI_FUNC int luaG_tracecall (lua_State *L); - - -#endif diff --git a/src/dependencies/lua/ldo.c b/src/dependencies/lua/ldo.c deleted file mode 100644 index b8d36cc..0000000 --- a/src/dependencies/lua/ldo.c +++ /dev/null @@ -1,1034 +0,0 @@ -/* -** $Id: ldo.c $ -** Stack and Call structure of Lua -** See Copyright Notice in lua.h -*/ - -#define ldo_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lparser.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lundump.h" -#include "lvm.h" -#include "lzio.h" - - - -#define errorstatus(s) ((s) > LUA_YIELD) - - -/* -** {====================================================== -** Error-recovery functions -** ======================================================= -*/ - -/* -** LUAI_THROW/LUAI_TRY define how Lua does exception handling. By -** default, Lua handles errors with exceptions when compiling as -** C++ code, with _longjmp/_setjmp when asked to use them, and with -** longjmp/setjmp otherwise. -*/ -#if !defined(LUAI_THROW) /* { */ - -#if defined(__cplusplus) && !defined(LUA_USE_LONGJMP) /* { */ - -/* C++ exceptions */ -#define LUAI_THROW(L,c) throw(c) -#define LUAI_TRY(L,c,a) \ - try { a } catch(...) { if ((c)->status == 0) (c)->status = -1; } -#define luai_jmpbuf int /* dummy variable */ - -#elif defined(LUA_USE_POSIX) /* }{ */ - -/* in POSIX, try _longjmp/_setjmp (more efficient) */ -#define LUAI_THROW(L,c) _longjmp((c)->b, 1) -#define LUAI_TRY(L,c,a) if (_setjmp((c)->b) == 0) { a } -#define luai_jmpbuf jmp_buf - -#else /* }{ */ - -/* ISO C handling with long jumps */ -#define LUAI_THROW(L,c) longjmp((c)->b, 1) -#define LUAI_TRY(L,c,a) if (setjmp((c)->b) == 0) { a } -#define luai_jmpbuf jmp_buf - -#endif /* } */ - -#endif /* } */ - - - -/* chain list of long jump buffers */ -struct lua_longjmp { - struct lua_longjmp *previous; - luai_jmpbuf b; - volatile int status; /* error code */ -}; - - -void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop) { - switch (errcode) { - case LUA_ERRMEM: { /* memory error? */ - setsvalue2s(L, oldtop, G(L)->memerrmsg); /* reuse preregistered msg. */ - break; - } - case LUA_ERRERR: { - setsvalue2s(L, oldtop, luaS_newliteral(L, "error in private_lua_error handling")); - break; - } - case LUA_OK: { /* special case only for closing upvalues */ - setnilvalue(s2v(oldtop)); /* no error message */ - break; - } - default: { - lua_assert(errorstatus(errcode)); /* real error */ - setobjs2s(L, oldtop, L->top.p - 1); /* error message on current top */ - break; - } - } - L->top.p = oldtop + 1; -} - - -l_noret luaD_throw (lua_State *L, int errcode) { - if (L->errorJmp) { /* thread has an error handler? */ - L->errorJmp->status = errcode; /* set status */ - LUAI_THROW(L, L->errorJmp); /* jump to it */ - } - else { /* thread has no error handler */ - global_State *g = G(L); - errcode = luaE_resetthread(L, errcode); /* close all upvalues */ - if (g->mainthread->errorJmp) { /* main thread has a handler? */ - setobjs2s(L, g->mainthread->top.p++, L->top.p - 1); /* copy error obj. */ - luaD_throw(g->mainthread, errcode); /* re-throw in main thread */ - } - else { /* no handler at all; abort */ - if (g->panic) { /* panic function? */ - lua_unlock(L); - g->panic(L); /* call panic function (last chance to jump out) */ - } - abort(); - } - } -} - - -int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) { - l_uint32 oldnCcalls = L->nCcalls; - struct lua_longjmp lj; - lj.status = LUA_OK; - lj.previous = L->errorJmp; /* chain new error handler */ - L->errorJmp = &lj; - LUAI_TRY(L, &lj, - (*f)(L, ud); - ); - L->errorJmp = lj.previous; /* restore old error handler */ - L->nCcalls = oldnCcalls; - return lj.status; -} - -/* }====================================================== */ - - -/* -** {================================================================== -** Stack reallocation -** =================================================================== -*/ - - -/* -** Change all pointers to the stack into offsets. -*/ -static void relstack (lua_State *L) { - CallInfo *ci; - UpVal *up; - L->top.offset = savestack(L, L->top.p); - L->tbclist.offset = savestack(L, L->tbclist.p); - for (up = L->openupval; up != NULL; up = up->u.open.next) - up->v.offset = savestack(L, uplevel(up)); - for (ci = L->ci; ci != NULL; ci = ci->previous) { - ci->top.offset = savestack(L, ci->top.p); - ci->func.offset = savestack(L, ci->func.p); - } -} - - -/* -** Change back all offsets into pointers. -*/ -static void correctstack (lua_State *L) { - CallInfo *ci; - UpVal *up; - L->top.p = restorestack(L, L->top.offset); - L->tbclist.p = restorestack(L, L->tbclist.offset); - for (up = L->openupval; up != NULL; up = up->u.open.next) - up->v.p = s2v(restorestack(L, up->v.offset)); - for (ci = L->ci; ci != NULL; ci = ci->previous) { - ci->top.p = restorestack(L, ci->top.offset); - ci->func.p = restorestack(L, ci->func.offset); - if (isLua(ci)) - ci->u.l.trap = 1; /* signal to update 'trap' in 'luaV_execute' */ - } -} - - -/* some space for error handling */ -#define ERRORSTACKSIZE (LUAI_MAXSTACK + 200) - -/* -** Reallocate the stack to a new size, correcting all pointers into it. -** In ISO C, any pointer use after the pointer has been deallocated is -** undefined behavior. So, before the reallocation, all pointers are -** changed to offsets, and after the reallocation they are changed back -** to pointers. As during the reallocation the pointers are invalid, the -** reallocation cannot run emergency collections. -** -** In case of allocation error, raise an error or return false according -** to 'raiseerror'. -*/ -int luaD_reallocstack (lua_State *L, int newsize, int raiseerror) { - int oldsize = stacksize(L); - int i; - StkId newstack; - int oldgcstop = G(L)->gcstopem; - lua_assert(newsize <= LUAI_MAXSTACK || newsize == ERRORSTACKSIZE); - relstack(L); /* change pointers to offsets */ - G(L)->gcstopem = 1; /* stop emergency collection */ - newstack = luaM_reallocvector(L, L->stack.p, oldsize + EXTRA_STACK, - newsize + EXTRA_STACK, StackValue); - G(L)->gcstopem = oldgcstop; /* restore emergency collection */ - if (l_unlikely(newstack == NULL)) { /* reallocation failed? */ - correctstack(L); /* change offsets back to pointers */ - if (raiseerror) - luaM_error(L); - else return 0; /* do not raise an error */ - } - L->stack.p = newstack; - correctstack(L); /* change offsets back to pointers */ - L->stack_last.p = L->stack.p + newsize; - for (i = oldsize + EXTRA_STACK; i < newsize + EXTRA_STACK; i++) - setnilvalue(s2v(newstack + i)); /* erase new segment */ - return 1; -} - - -/* -** Try to grow the stack by at least 'n' elements. When 'raiseerror' -** is true, raises any error; otherwise, return 0 in case of errors. -*/ -int luaD_growstack (lua_State *L, int n, int raiseerror) { - int size = stacksize(L); - if (l_unlikely(size > LUAI_MAXSTACK)) { - /* if stack is larger than maximum, thread is already using the - extra space reserved for errors, that is, thread is handling - a stack error; cannot grow further than that. */ - lua_assert(stacksize(L) == ERRORSTACKSIZE); - if (raiseerror) - luaD_throw(L, LUA_ERRERR); /* error inside message handler */ - return 0; /* if not 'raiseerror', just signal it */ - } - else if (n < LUAI_MAXSTACK) { /* avoids arithmetic overflows */ - int newsize = 2 * size; /* tentative new size */ - int needed = cast_int(L->top.p - L->stack.p) + n; - if (newsize > LUAI_MAXSTACK) /* cannot cross the limit */ - newsize = LUAI_MAXSTACK; - if (newsize < needed) /* but must respect what was asked for */ - newsize = needed; - if (l_likely(newsize <= LUAI_MAXSTACK)) - return luaD_reallocstack(L, newsize, raiseerror); - } - /* else stack overflow */ - /* add extra size to be able to handle the error message */ - luaD_reallocstack(L, ERRORSTACKSIZE, raiseerror); - if (raiseerror) - luaG_runerror(L, "stack overflow"); - return 0; -} - - -/* -** Compute how much of the stack is being used, by computing the -** maximum top of all call frames in the stack and the current top. -*/ -static int stackinuse (lua_State *L) { - CallInfo *ci; - int res; - StkId lim = L->top.p; - for (ci = L->ci; ci != NULL; ci = ci->previous) { - if (lim < ci->top.p) lim = ci->top.p; - } - lua_assert(lim <= L->stack_last.p + EXTRA_STACK); - res = cast_int(lim - L->stack.p) + 1; /* part of stack in use */ - if (res < LUA_MINSTACK) - res = LUA_MINSTACK; /* ensure a minimum size */ - return res; -} - - -/* -** If stack size is more than 3 times the current use, reduce that size -** to twice the current use. (So, the final stack size is at most 2/3 the -** previous size, and half of its entries are empty.) -** As a particular case, if stack was handling a stack overflow and now -** it is not, 'max' (limited by LUAI_MAXSTACK) will be smaller than -** stacksize (equal to ERRORSTACKSIZE in this case), and so the stack -** will be reduced to a "regular" size. -*/ -void luaD_shrinkstack (lua_State *L) { - int inuse = stackinuse(L); - int max = (inuse > LUAI_MAXSTACK / 3) ? LUAI_MAXSTACK : inuse * 3; - /* if thread is currently not handling a stack overflow and its - size is larger than maximum "reasonable" size, shrink it */ - if (inuse <= LUAI_MAXSTACK && stacksize(L) > max) { - int nsize = (inuse > LUAI_MAXSTACK / 2) ? LUAI_MAXSTACK : inuse * 2; - luaD_reallocstack(L, nsize, 0); /* ok if that fails */ - } - else /* don't change stack */ - condmovestack(L,{},{}); /* (change only for debugging) */ - luaE_shrinkCI(L); /* shrink CI list */ -} - - -void luaD_inctop (lua_State *L) { - luaD_checkstack(L, 1); - L->top.p++; -} - -/* }================================================================== */ - - -/* -** Call a hook for the given event. Make sure there is a hook to be -** called. (Both 'L->hook' and 'L->hookmask', which trigger this -** function, can be changed asynchronously by signals.) -*/ -void luaD_hook (lua_State *L, int event, int line, - int ftransfer, int ntransfer) { - lua_Hook hook = L->hook; - if (hook && L->allowhook) { /* make sure there is a hook */ - int mask = CIST_HOOKED; - CallInfo *ci = L->ci; - ptrdiff_t top = savestack(L, L->top.p); /* preserve original 'top' */ - ptrdiff_t ci_top = savestack(L, ci->top.p); /* idem for 'ci->top' */ - lua_Debug ar; - ar.event = event; - ar.currentline = line; - ar.i_ci = ci; - if (ntransfer != 0) { - mask |= CIST_TRAN; /* 'ci' has transfer information */ - ci->u2.transferinfo.ftransfer = ftransfer; - ci->u2.transferinfo.ntransfer = ntransfer; - } - if (isLua(ci) && L->top.p < ci->top.p) - L->top.p = ci->top.p; /* protect entire activation register */ - luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */ - if (ci->top.p < L->top.p + LUA_MINSTACK) - ci->top.p = L->top.p + LUA_MINSTACK; - L->allowhook = 0; /* cannot call hooks inside a hook */ - ci->callstatus |= mask; - lua_unlock(L); - (*hook)(L, &ar); - lua_lock(L); - lua_assert(!L->allowhook); - L->allowhook = 1; - ci->top.p = restorestack(L, ci_top); - L->top.p = restorestack(L, top); - ci->callstatus &= ~mask; - } -} - - -/* -** Executes a call hook for Lua functions. This function is called -** whenever 'hookmask' is not zero, so it checks whether call hooks are -** active. -*/ -void luaD_hookcall (lua_State *L, CallInfo *ci) { - L->oldpc = 0; /* set 'oldpc' for new function */ - if (L->hookmask & LUA_MASKCALL) { /* is call hook on? */ - int event = (ci->callstatus & CIST_TAIL) ? LUA_HOOKTAILCALL - : LUA_HOOKCALL; - Proto *p = ci_func(ci)->p; - ci->u.l.savedpc++; /* hooks assume 'pc' is already incremented */ - luaD_hook(L, event, -1, 1, p->numparams); - ci->u.l.savedpc--; /* correct 'pc' */ - } -} - - -/* -** Executes a return hook for Lua and C functions and sets/corrects -** 'oldpc'. (Note that this correction is needed by the line hook, so it -** is done even when return hooks are off.) -*/ -static void rethook (lua_State *L, CallInfo *ci, int nres) { - if (L->hookmask & LUA_MASKRET) { /* is return hook on? */ - StkId firstres = L->top.p - nres; /* index of first result */ - int delta = 0; /* correction for vararg functions */ - int ftransfer; - if (isLua(ci)) { - Proto *p = ci_func(ci)->p; - if (p->flag & PF_ISVARARG) - delta = ci->u.l.nextraargs + p->numparams + 1; - } - ci->func.p += delta; /* if vararg, back to virtual 'func' */ - ftransfer = cast(unsigned short, firstres - ci->func.p); - luaD_hook(L, LUA_HOOKRET, -1, ftransfer, nres); /* call it */ - ci->func.p -= delta; - } - if (isLua(ci = ci->previous)) - L->oldpc = pcRel(ci->u.l.savedpc, ci_func(ci)->p); /* set 'oldpc' */ -} - - -/* -** Check whether 'func' has a '__call' metafield. If so, put it in the -** stack, below original 'func', so that 'luaD_precall' can call it. Raise -** an error if there is no '__call' metafield. -*/ -static StkId tryfuncTM (lua_State *L, StkId func) { - const TValue *tm; - StkId p; - checkstackp(L, 1, func); /* space for metamethod */ - tm = luaT_gettmbyobj(L, s2v(func), TM_CALL); /* (after previous GC) */ - if (l_unlikely(ttisnil(tm))) - luaG_callerror(L, s2v(func)); /* nothing to call */ - for (p = L->top.p; p > func; p--) /* open space for metamethod */ - setobjs2s(L, p, p-1); - L->top.p++; /* stack space pre-allocated by the caller */ - setobj2s(L, func, tm); /* metamethod is the new function to be called */ - return func; -} - - -/* -** Given 'nres' results at 'firstResult', move 'wanted' of them to 'res'. -** Handle most typical cases (zero results for commands, one result for -** expressions, multiple results for tail calls/single parameters) -** separated. -*/ -l_sinline void moveresults (lua_State *L, StkId res, int nres, int wanted) { - StkId firstresult; - int i; - switch (wanted) { /* handle typical cases separately */ - case 0: /* no values needed */ - L->top.p = res; - return; - case 1: /* one value needed */ - if (nres == 0) /* no results? */ - setnilvalue(s2v(res)); /* adjust with nil */ - else /* at least one result */ - setobjs2s(L, res, L->top.p - nres); /* move it to proper place */ - L->top.p = res + 1; - return; - case LUA_MULTRET: - wanted = nres; /* we want all results */ - break; - default: /* two/more results and/or to-be-closed variables */ - if (hastocloseCfunc(wanted)) { /* to-be-closed variables? */ - L->ci->callstatus |= CIST_CLSRET; /* in case of yields */ - L->ci->u2.nres = nres; - res = luaF_close(L, res, CLOSEKTOP, 1); - L->ci->callstatus &= ~CIST_CLSRET; - if (L->hookmask) { /* if needed, call hook after '__close's */ - ptrdiff_t savedres = savestack(L, res); - rethook(L, L->ci, nres); - res = restorestack(L, savedres); /* hook can move stack */ - } - wanted = decodeNresults(wanted); - if (wanted == LUA_MULTRET) - wanted = nres; /* we want all results */ - } - break; - } - /* generic case */ - firstresult = L->top.p - nres; /* index of first result */ - if (nres > wanted) /* extra results? */ - nres = wanted; /* don't need them */ - for (i = 0; i < nres; i++) /* move all results to correct place */ - setobjs2s(L, res + i, firstresult + i); - for (; i < wanted; i++) /* complete wanted number of results */ - setnilvalue(s2v(res + i)); - L->top.p = res + wanted; /* top points after the last result */ -} - - -/* -** Finishes a function call: calls hook if necessary, moves current -** number of results to proper place, and returns to previous call -** info. If function has to close variables, hook must be called after -** that. -*/ -void luaD_poscall (lua_State *L, CallInfo *ci, int nres) { - int wanted = ci->nresults; - if (l_unlikely(L->hookmask && !hastocloseCfunc(wanted))) - rethook(L, ci, nres); - /* move results to proper place */ - moveresults(L, ci->func.p, nres, wanted); - /* function cannot be in any of these cases when returning */ - lua_assert(!(ci->callstatus & - (CIST_HOOKED | CIST_YPCALL | CIST_FIN | CIST_TRAN | CIST_CLSRET))); - L->ci = ci->previous; /* back to caller (after closing variables) */ -} - - - -#define next_ci(L) (L->ci->next ? L->ci->next : luaE_extendCI(L)) - - -l_sinline CallInfo *prepCallInfo (lua_State *L, StkId func, int nret, - int mask, StkId top) { - CallInfo *ci = L->ci = next_ci(L); /* new frame */ - ci->func.p = func; - ci->nresults = nret; - ci->callstatus = mask; - ci->top.p = top; - return ci; -} - - -/* -** precall for C functions -*/ -l_sinline int precallC (lua_State *L, StkId func, int nresults, - lua_CFunction f) { - int n; /* number of returns */ - CallInfo *ci; - checkstackp(L, LUA_MINSTACK, func); /* ensure minimum stack size */ - L->ci = ci = prepCallInfo(L, func, nresults, CIST_C, - L->top.p + LUA_MINSTACK); - lua_assert(ci->top.p <= L->stack_last.p); - if (l_unlikely(L->hookmask & LUA_MASKCALL)) { - int narg = cast_int(L->top.p - func) - 1; - luaD_hook(L, LUA_HOOKCALL, -1, 1, narg); - } - lua_unlock(L); - n = (*f)(L); /* do the actual call */ - lua_lock(L); - api_checknelems(L, n); - luaD_poscall(L, ci, n); - return n; -} - - -/* -** Prepare a function for a tail call, building its call info on top -** of the current call info. 'narg1' is the number of arguments plus 1 -** (so that it includes the function itself). Return the number of -** results, if it was a C function, or -1 for a Lua function. -*/ -int luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, - int narg1, int delta) { - retry: - switch (ttypetag(s2v(func))) { - case LUA_VCCL: /* C closure */ - return precallC(L, func, LUA_MULTRET, clCvalue(s2v(func))->f); - case LUA_VLCF: /* light C function */ - return precallC(L, func, LUA_MULTRET, fvalue(s2v(func))); - case LUA_VLCL: { /* Lua function */ - Proto *p = clLvalue(s2v(func))->p; - int fsize = p->maxstacksize; /* frame size */ - int nfixparams = p->numparams; - int i; - checkstackp(L, fsize - delta, func); - ci->func.p -= delta; /* restore 'func' (if vararg) */ - for (i = 0; i < narg1; i++) /* move down function and arguments */ - setobjs2s(L, ci->func.p + i, func + i); - func = ci->func.p; /* moved-down function */ - for (; narg1 <= nfixparams; narg1++) - setnilvalue(s2v(func + narg1)); /* complete missing arguments */ - ci->top.p = func + 1 + fsize; /* top for new function */ - lua_assert(ci->top.p <= L->stack_last.p); - ci->u.l.savedpc = p->code; /* starting point */ - ci->callstatus |= CIST_TAIL; - L->top.p = func + narg1; /* set top */ - return -1; - } - default: { /* not a function */ - func = tryfuncTM(L, func); /* try to get '__call' metamethod */ - /* return luaD_pretailcall(L, ci, func, narg1 + 1, delta); */ - narg1++; - goto retry; /* try again */ - } - } -} - - -/* -** Prepares the call to a function (C or Lua). For C functions, also do -** the call. The function to be called is at '*func'. The arguments -** are on the stack, right after the function. Returns the CallInfo -** to be executed, if it was a Lua function. Otherwise (a C function) -** returns NULL, with all the results on the stack, starting at the -** original function position. -*/ -CallInfo *luaD_precall (lua_State *L, StkId func, int nresults) { - retry: - switch (ttypetag(s2v(func))) { - case LUA_VCCL: /* C closure */ - precallC(L, func, nresults, clCvalue(s2v(func))->f); - return NULL; - case LUA_VLCF: /* light C function */ - precallC(L, func, nresults, fvalue(s2v(func))); - return NULL; - case LUA_VLCL: { /* Lua function */ - CallInfo *ci; - Proto *p = clLvalue(s2v(func))->p; - int narg = cast_int(L->top.p - func) - 1; /* number of real arguments */ - int nfixparams = p->numparams; - int fsize = p->maxstacksize; /* frame size */ - checkstackp(L, fsize, func); - L->ci = ci = prepCallInfo(L, func, nresults, 0, func + 1 + fsize); - ci->u.l.savedpc = p->code; /* starting point */ - for (; narg < nfixparams; narg++) - setnilvalue(s2v(L->top.p++)); /* complete missing arguments */ - lua_assert(ci->top.p <= L->stack_last.p); - return ci; - } - default: { /* not a function */ - func = tryfuncTM(L, func); /* try to get '__call' metamethod */ - /* return luaD_precall(L, func, nresults); */ - goto retry; /* try again with metamethod */ - } - } -} - - -/* -** Call a function (C or Lua) through C. 'inc' can be 1 (increment -** number of recursive invocations in the C stack) or nyci (the same -** plus increment number of non-yieldable calls). -** This function can be called with some use of EXTRA_STACK, so it should -** check the stack before doing anything else. 'luaD_precall' already -** does that. -*/ -l_sinline void ccall (lua_State *L, StkId func, int nResults, l_uint32 inc) { - CallInfo *ci; - L->nCcalls += inc; - if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) { - checkstackp(L, 0, func); /* free any use of EXTRA_STACK */ - luaE_checkcstack(L); - } - if ((ci = luaD_precall(L, func, nResults)) != NULL) { /* Lua function? */ - ci->callstatus = CIST_FRESH; /* mark that it is a "fresh" execute */ - luaV_execute(L, ci); /* call it */ - } - L->nCcalls -= inc; -} - - -/* -** External interface for 'ccall' -*/ -void luaD_call (lua_State *L, StkId func, int nResults) { - ccall(L, func, nResults, 1); -} - - -/* -** Similar to 'luaD_call', but does not allow yields during the call. -*/ -void luaD_callnoyield (lua_State *L, StkId func, int nResults) { - ccall(L, func, nResults, nyci); -} - - -/* -** Finish the job of 'lua_pcallk' after it was interrupted by an yield. -** (The caller, 'finishCcall', does the final call to 'adjustresults'.) -** The main job is to complete the 'luaD_pcall' called by 'lua_pcallk'. -** If a '__close' method yields here, eventually control will be back -** to 'finishCcall' (when that '__close' method finally returns) and -** 'finishpcallk' will run again and close any still pending '__close' -** methods. Similarly, if a '__close' method errs, 'precover' calls -** 'unroll' which calls ''finishCcall' and we are back here again, to -** close any pending '__close' methods. -** Note that, up to the call to 'luaF_close', the corresponding -** 'CallInfo' is not modified, so that this repeated run works like the -** first one (except that it has at least one less '__close' to do). In -** particular, field CIST_RECST preserves the error status across these -** multiple runs, changing only if there is a new error. -*/ -static int finishpcallk (lua_State *L, CallInfo *ci) { - int status = getcistrecst(ci); /* get original status */ - if (l_likely(status == LUA_OK)) /* no error? */ - status = LUA_YIELD; /* was interrupted by an yield */ - else { /* error */ - StkId func = restorestack(L, ci->u2.funcidx); - L->allowhook = getoah(ci->callstatus); /* restore 'allowhook' */ - func = luaF_close(L, func, status, 1); /* can yield or raise an error */ - luaD_seterrorobj(L, status, func); - luaD_shrinkstack(L); /* restore stack size in case of overflow */ - setcistrecst(ci, LUA_OK); /* clear original status */ - } - ci->callstatus &= ~CIST_YPCALL; - L->errfunc = ci->u.c.old_errfunc; - /* if it is here, there were errors or yields; unlike 'lua_pcallk', - do not change status */ - return status; -} - - -/* -** Completes the execution of a C function interrupted by an yield. -** The interruption must have happened while the function was either -** closing its tbc variables in 'moveresults' or executing -** 'lua_callk'/'lua_pcallk'. In the first case, it just redoes -** 'luaD_poscall'. In the second case, the call to 'finishpcallk' -** finishes the interrupted execution of 'lua_pcallk'. After that, it -** calls the continuation of the interrupted function and finally it -** completes the job of the 'luaD_call' that called the function. In -** the call to 'adjustresults', we do not know the number of results -** of the function called by 'lua_callk'/'lua_pcallk', so we are -** conservative and use LUA_MULTRET (always adjust). -*/ -static void finishCcall (lua_State *L, CallInfo *ci) { - int n; /* actual number of results from C function */ - if (ci->callstatus & CIST_CLSRET) { /* was returning? */ - lua_assert(hastocloseCfunc(ci->nresults)); - n = ci->u2.nres; /* just redo 'luaD_poscall' */ - /* don't need to reset CIST_CLSRET, as it will be set again anyway */ - } - else { - int status = LUA_YIELD; /* default if there were no errors */ - /* must have a continuation and must be able to call it */ - lua_assert(ci->u.c.k != NULL && yieldable(L)); - if (ci->callstatus & CIST_YPCALL) /* was inside a 'lua_pcallk'? */ - status = finishpcallk(L, ci); /* finish it */ - adjustresults(L, LUA_MULTRET); /* finish 'lua_callk' */ - lua_unlock(L); - n = (*ci->u.c.k)(L, status, ci->u.c.ctx); /* call continuation */ - lua_lock(L); - api_checknelems(L, n); - } - luaD_poscall(L, ci, n); /* finish 'luaD_call' */ -} - - -/* -** Executes "full continuation" (everything in the stack) of a -** previously interrupted coroutine until the stack is empty (or another -** interruption long-jumps out of the loop). -*/ -static void unroll (lua_State *L, void *ud) { - CallInfo *ci; - UNUSED(ud); - while ((ci = L->ci) != &L->base_ci) { /* something in the stack */ - if (!isLua(ci)) /* C function? */ - finishCcall(L, ci); /* complete its execution */ - else { /* Lua function */ - luaV_finishOp(L); /* finish interrupted instruction */ - luaV_execute(L, ci); /* execute down to higher C 'boundary' */ - } - } -} - - -/* -** Try to find a suspended protected call (a "recover point") for the -** given thread. -*/ -static CallInfo *findpcall (lua_State *L) { - CallInfo *ci; - for (ci = L->ci; ci != NULL; ci = ci->previous) { /* search for a pcall */ - if (ci->callstatus & CIST_YPCALL) - return ci; - } - return NULL; /* no pending pcall */ -} - - -/* -** Signal an error in the call to 'lua_resume', not in the execution -** of the coroutine itself. (Such errors should not be handled by any -** coroutine error handler and should not kill the coroutine.) -*/ -static int resume_error (lua_State *L, const char *msg, int narg) { - api_checkpop(L, narg); - L->top.p -= narg; /* remove args from the stack */ - setsvalue2s(L, L->top.p, luaS_new(L, msg)); /* push error message */ - api_incr_top(L); - lua_unlock(L); - return LUA_ERRRUN; -} - - -/* -** Do the work for 'lua_resume' in protected mode. Most of the work -** depends on the status of the coroutine: initial state, suspended -** inside a hook, or regularly suspended (optionally with a continuation -** function), plus erroneous cases: non-suspended coroutine or dead -** coroutine. -*/ -static void resume (lua_State *L, void *ud) { - int n = *(cast(int*, ud)); /* number of arguments */ - StkId firstArg = L->top.p - n; /* first argument */ - CallInfo *ci = L->ci; - if (L->status == LUA_OK) /* starting a coroutine? */ - ccall(L, firstArg - 1, LUA_MULTRET, 0); /* just call its body */ - else { /* resuming from previous yield */ - lua_assert(L->status == LUA_YIELD); - L->status = LUA_OK; /* mark that it is running (again) */ - if (isLua(ci)) { /* yielded inside a hook? */ - /* undo increment made by 'luaG_traceexec': instruction was not - executed yet */ - lua_assert(ci->callstatus & CIST_HOOKYIELD); - ci->u.l.savedpc--; - L->top.p = firstArg; /* discard arguments */ - luaV_execute(L, ci); /* just continue running Lua code */ - } - else { /* 'common' yield */ - if (ci->u.c.k != NULL) { /* does it have a continuation function? */ - lua_unlock(L); - n = (*ci->u.c.k)(L, LUA_YIELD, ci->u.c.ctx); /* call continuation */ - lua_lock(L); - api_checknelems(L, n); - } - luaD_poscall(L, ci, n); /* finish 'luaD_call' */ - } - unroll(L, NULL); /* run continuation */ - } -} - - -/* -** Unrolls a coroutine in protected mode while there are recoverable -** errors, that is, errors inside a protected call. (Any error -** interrupts 'unroll', and this loop protects it again so it can -** continue.) Stops with a normal end (status == LUA_OK), an yield -** (status == LUA_YIELD), or an unprotected error ('findpcall' doesn't -** find a recover point). -*/ -static int precover (lua_State *L, int status) { - CallInfo *ci; - while (errorstatus(status) && (ci = findpcall(L)) != NULL) { - L->ci = ci; /* go down to recovery functions */ - setcistrecst(ci, status); /* status to finish 'pcall' */ - status = luaD_rawrunprotected(L, unroll, NULL); - } - return status; -} - - -LUA_API int lua_resume (lua_State *L, lua_State *from, int nargs, - int *nresults) { - int status; - lua_lock(L); - if (L->status == LUA_OK) { /* may be starting a coroutine */ - if (L->ci != &L->base_ci) /* not in base level? */ - return resume_error(L, "cannot resume non-suspended coroutine", nargs); - else if (L->top.p - (L->ci->func.p + 1) == nargs) /* no function? */ - return resume_error(L, "cannot resume dead coroutine", nargs); - } - else if (L->status != LUA_YIELD) /* ended with errors? */ - return resume_error(L, "cannot resume dead coroutine", nargs); - L->nCcalls = (from) ? getCcalls(from) : 0; - if (getCcalls(L) >= LUAI_MAXCCALLS) - return resume_error(L, "C stack overflow", nargs); - L->nCcalls++; - luai_userstateresume(L, nargs); - api_checkpop(L, (L->status == LUA_OK) ? nargs + 1 : nargs); - status = luaD_rawrunprotected(L, resume, &nargs); - /* continue running after recoverable errors */ - status = precover(L, status); - if (l_likely(!errorstatus(status))) - lua_assert(status == L->status); /* normal end or yield */ - else { /* unrecoverable error */ - L->status = cast_byte(status); /* mark thread as 'dead' */ - luaD_seterrorobj(L, status, L->top.p); /* push error message */ - L->ci->top.p = L->top.p; - } - *nresults = (status == LUA_YIELD) ? L->ci->u2.nyield - : cast_int(L->top.p - (L->ci->func.p + 1)); - lua_unlock(L); - return status; -} - - -LUA_API int lua_isyieldable (lua_State *L) { - return yieldable(L); -} - - -LUA_API int lua_yieldk (lua_State *L, int nresults, lua_KContext ctx, - lua_KFunction k) { - CallInfo *ci; - luai_userstateyield(L, nresults); - lua_lock(L); - ci = L->ci; - api_checkpop(L, nresults); - if (l_unlikely(!yieldable(L))) { - if (L != G(L)->mainthread) - luaG_runerror(L, "attempt to yield across a C-call boundary"); - else - luaG_runerror(L, "attempt to yield from outside a coroutine"); - } - L->status = LUA_YIELD; - ci->u2.nyield = nresults; /* save number of results */ - if (isLua(ci)) { /* inside a hook? */ - lua_assert(!isLuacode(ci)); - api_check(L, nresults == 0, "hooks cannot yield values"); - api_check(L, k == NULL, "hooks cannot continue after yielding"); - } - else { - if ((ci->u.c.k = k) != NULL) /* is there a continuation? */ - ci->u.c.ctx = ctx; /* save context */ - luaD_throw(L, LUA_YIELD); - } - lua_assert(ci->callstatus & CIST_HOOKED); /* must be inside a hook */ - lua_unlock(L); - return 0; /* return to 'luaD_hook' */ -} - - -/* -** Auxiliary structure to call 'luaF_close' in protected mode. -*/ -struct CloseP { - StkId level; - int status; -}; - - -/* -** Auxiliary function to call 'luaF_close' in protected mode. -*/ -static void closepaux (lua_State *L, void *ud) { - struct CloseP *pcl = cast(struct CloseP *, ud); - luaF_close(L, pcl->level, pcl->status, 0); -} - - -/* -** Calls 'luaF_close' in protected mode. Return the original status -** or, in case of errors, the new status. -*/ -int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status) { - CallInfo *old_ci = L->ci; - lu_byte old_allowhooks = L->allowhook; - for (;;) { /* keep closing upvalues until no more errors */ - struct CloseP pcl; - pcl.level = restorestack(L, level); pcl.status = status; - status = luaD_rawrunprotected(L, &closepaux, &pcl); - if (l_likely(status == LUA_OK)) /* no more errors? */ - return pcl.status; - else { /* an error occurred; restore saved state and repeat */ - L->ci = old_ci; - L->allowhook = old_allowhooks; - } - } -} - - -/* -** Call the C function 'func' in protected mode, restoring basic -** thread information ('allowhook', etc.) and in particular -** its stack level in case of errors. -*/ -int luaD_pcall (lua_State *L, Pfunc func, void *u, - ptrdiff_t old_top, ptrdiff_t ef) { - int status; - CallInfo *old_ci = L->ci; - lu_byte old_allowhooks = L->allowhook; - ptrdiff_t old_errfunc = L->errfunc; - L->errfunc = ef; - status = luaD_rawrunprotected(L, func, u); - if (l_unlikely(status != LUA_OK)) { /* an error occurred? */ - L->ci = old_ci; - L->allowhook = old_allowhooks; - status = luaD_closeprotected(L, old_top, status); - luaD_seterrorobj(L, status, restorestack(L, old_top)); - luaD_shrinkstack(L); /* restore stack size in case of overflow */ - } - L->errfunc = old_errfunc; - return status; -} - - - -/* -** Execute a protected parser. -*/ -struct SParser { /* data to 'f_parser' */ - ZIO *z; - Mbuffer buff; /* dynamic structure used by the scanner */ - Dyndata dyd; /* dynamic structures used by the parser */ - const char *mode; - const char *name; -}; - - -static void checkmode (lua_State *L, const char *mode, const char *x) { - if (strchr(mode, x[0]) == NULL) { - luaO_pushfstring(L, - "attempt to load a %s chunk (mode is '%s')", x, mode); - luaD_throw(L, LUA_ERRSYNTAX); - } -} - - -static void f_parser (lua_State *L, void *ud) { - LClosure *cl; - struct SParser *p = cast(struct SParser *, ud); - const char *mode = p->mode ? p->mode : "bt"; - int c = zgetc(p->z); /* read first character */ - if (c == LUA_SIGNATURE[0]) { - int fixed = 0; - if (strchr(mode, 'B') != NULL) - fixed = 1; - else - checkmode(L, mode, "binary"); - cl = luaU_undump(L, p->z, p->name, fixed); - } - else { - checkmode(L, mode, "text"); - cl = luaY_parser(L, p->z, &p->buff, &p->dyd, p->name, c); - } - lua_assert(cl->nupvalues == cl->p->sizeupvalues); - luaF_initupvals(L, cl); -} - - -int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, - const char *mode) { - struct SParser p; - int status; - incnny(L); /* cannot yield during parsing */ - p.z = z; p.name = name; p.mode = mode; - p.dyd.actvar.arr = NULL; p.dyd.actvar.size = 0; - p.dyd.gt.arr = NULL; p.dyd.gt.size = 0; - p.dyd.label.arr = NULL; p.dyd.label.size = 0; - luaZ_initbuffer(L, &p.buff); - status = luaD_pcall(L, f_parser, &p, savestack(L, L->top.p), L->errfunc); - luaZ_freebuffer(L, &p.buff); - luaM_freearray(L, p.dyd.actvar.arr, p.dyd.actvar.size); - luaM_freearray(L, p.dyd.gt.arr, p.dyd.gt.size); - luaM_freearray(L, p.dyd.label.arr, p.dyd.label.size); - decnny(L); - return status; -} - - diff --git a/src/dependencies/lua/ldo.h b/src/dependencies/lua/ldo.h deleted file mode 100644 index 4bc7503..0000000 --- a/src/dependencies/lua/ldo.h +++ /dev/null @@ -1,75 +0,0 @@ -/* -** $Id: ldo.h $ -** Stack and Call structure of Lua -** See Copyright Notice in lua.h -*/ - -#ifndef ldo_h -#define ldo_h - - -#include "llimits.h" -#include "lobject.h" -#include "lstate.h" -#include "lzio.h" - - -/* -** Macro to check stack size and grow stack if needed. Parameters -** 'pre'/'pos' allow the macro to preserve a pointer into the -** stack across reallocations, doing the work only when needed. -** It also allows the running of one GC step when the stack is -** reallocated. -** 'condmovestack' is used in heavy tests to force a stack reallocation -** at every check. -*/ -#define luaD_checkstackaux(L,n,pre,pos) \ - if (l_unlikely(L->stack_last.p - L->top.p <= (n))) \ - { pre; luaD_growstack(L, n, 1); pos; } \ - else { condmovestack(L,pre,pos); } - -/* In general, 'pre'/'pos' are empty (nothing to save) */ -#define luaD_checkstack(L,n) luaD_checkstackaux(L,n,(void)0,(void)0) - - - -#define savestack(L,pt) (cast_charp(pt) - cast_charp(L->stack.p)) -#define restorestack(L,n) cast(StkId, cast_charp(L->stack.p) + (n)) - - -/* macro to check stack size, preserving 'p' */ -#define checkstackp(L,n,p) \ - luaD_checkstackaux(L, n, \ - ptrdiff_t t__ = savestack(L, p), /* save 'p' */ \ - p = restorestack(L, t__)) /* 'pos' part: restore 'p' */ - - - -/* type of protected functions, to be ran by 'runprotected' */ -typedef void (*Pfunc) (lua_State *L, void *ud); - -LUAI_FUNC void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop); -LUAI_FUNC int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, - const char *mode); -LUAI_FUNC void luaD_hook (lua_State *L, int event, int line, - int fTransfer, int nTransfer); -LUAI_FUNC void luaD_hookcall (lua_State *L, CallInfo *ci); -LUAI_FUNC int luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, - int narg1, int delta); -LUAI_FUNC CallInfo *luaD_precall (lua_State *L, StkId func, int nResults); -LUAI_FUNC void luaD_call (lua_State *L, StkId func, int nResults); -LUAI_FUNC void luaD_callnoyield (lua_State *L, StkId func, int nResults); -LUAI_FUNC int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status); -LUAI_FUNC int luaD_pcall (lua_State *L, Pfunc func, void *u, - ptrdiff_t oldtop, ptrdiff_t ef); -LUAI_FUNC void luaD_poscall (lua_State *L, CallInfo *ci, int nres); -LUAI_FUNC int luaD_reallocstack (lua_State *L, int newsize, int raiseerror); -LUAI_FUNC int luaD_growstack (lua_State *L, int n, int raiseerror); -LUAI_FUNC void luaD_shrinkstack (lua_State *L); -LUAI_FUNC void luaD_inctop (lua_State *L); - -LUAI_FUNC l_noret luaD_throw (lua_State *L, int errcode); -LUAI_FUNC int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud); - -#endif - diff --git a/src/dependencies/lua/ldump.c b/src/dependencies/lua/ldump.c deleted file mode 100644 index ca708a4..0000000 --- a/src/dependencies/lua/ldump.c +++ /dev/null @@ -1,290 +0,0 @@ -/* -** $Id: ldump.c $ -** save precompiled Lua chunks -** See Copyright Notice in lua.h -*/ - -#define ldump_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "lgc.h" -#include "lobject.h" -#include "lstate.h" -#include "ltable.h" -#include "lundump.h" - - -typedef struct { - lua_State *L; - lua_Writer writer; - void *data; - lu_mem offset; /* current position relative to beginning of dump */ - int strip; - int status; - Table *h; /* table to track saved strings */ - lua_Integer nstr; /* counter for counting saved strings */ -} DumpState; - - -/* -** All high-level dumps go through dumpVector; you can change it to -** change the endianness of the result -*/ -#define dumpVector(D,v,n) dumpBlock(D,v,(n)*sizeof((v)[0])) - -#define dumpLiteral(D, s) dumpBlock(D,s,sizeof(s) - sizeof(char)) - - -/* -** Dump the block of memory pointed by 'b' with given 'size'. -** 'b' should not be NULL, except for the last call signaling the end -** of the dump. -*/ -static void dumpBlock (DumpState *D, const void *b, size_t size) { - if (D->status == 0) { /* do not write anything after an error */ - lua_unlock(D->L); - D->status = (*D->writer)(D->L, b, size, D->data); - lua_lock(D->L); - D->offset += size; - } -} - - -/* -** Dump enough zeros to ensure that current position is a multiple of -** 'align'. -*/ -static void dumpAlign (DumpState *D, int align) { - int padding = align - (D->offset % align); - if (padding < align) { /* padding == align means no padding */ - static lua_Integer paddingContent = 0; - lua_assert(cast_uint(align) <= sizeof(lua_Integer)); - dumpBlock(D, &paddingContent, padding); - } - lua_assert(D->offset % align == 0); -} - - -#define dumpVar(D,x) dumpVector(D,&x,1) - - -static void dumpByte (DumpState *D, int y) { - lu_byte x = (lu_byte)y; - dumpVar(D, x); -} - - -/* -** size for 'dumpVarint' buffer: each byte can store up to 7 bits. -** (The "+6" rounds up the division.) -*/ -#define DIBS ((sizeof(size_t) * CHAR_BIT + 6) / 7) - -/* -** Dumps an unsigned integer using the MSB Varint encoding -*/ -static void dumpVarint (DumpState *D, size_t x) { - lu_byte buff[DIBS]; - int n = 1; - buff[DIBS - 1] = x & 0x7f; /* fill least-significant byte */ - while ((x >>= 7) != 0) /* fill other bytes in reverse order */ - buff[DIBS - (++n)] = (x & 0x7f) | 0x80; - dumpVector(D, buff + DIBS - n, n); -} - - -static void dumpSize (DumpState *D, size_t sz) { - dumpVarint(D, sz); -} - -static void dumpInt (DumpState *D, int x) { - lua_assert(x >= 0); - dumpVarint(D, cast(size_t, x)); -} - - -static void dumpNumber (DumpState *D, lua_Number x) { - dumpVar(D, x); -} - - -static void dumpInteger (DumpState *D, lua_Integer x) { - dumpVar(D, x); -} - - -/* -** Dump a String. First dump its "size": size==0 means NULL; -** size==1 is followed by an index and means "reuse saved string with -** that index"; size>=2 is followed by the string contents with real -** size==size-2 and means that string, which will be saved with -** the next available index. -*/ -static void dumpString (DumpState *D, TString *ts) { - if (ts == NULL) - dumpSize(D, 0); - else { - TValue idx; - int tag = luaH_getstr(D->h, ts, &idx); - if (!tagisempty(tag)) { /* string already saved? */ - dumpSize(D, 1); /* reuse a saved string */ - dumpSize(D, cast_sizet(ivalue(&idx))); /* index of saved string */ - } - else { /* must write and save the string */ - TValue key, value; /* to save the string in the hash */ - size_t size; - const char *s = getlstr(ts, size); - dumpSize(D, size + 2); - dumpVector(D, s, size + 1); /* include ending '\0' */ - D->nstr++; /* one more saved string */ - setsvalue(D->L, &key, ts); /* the string is the key */ - setivalue(&value, D->nstr); /* its index is the value */ - luaH_set(D->L, D->h, &key, &value); /* h[ts] = nstr */ - /* integer value does not need barrier */ - } - } -} - - -static void dumpCode (DumpState *D, const Proto *f) { - dumpInt(D, f->sizecode); - dumpAlign(D, sizeof(f->code[0])); - lua_assert(f->code != NULL); - dumpVector(D, f->code, f->sizecode); -} - - -static void dumpFunction (DumpState *D, const Proto *f); - -static void dumpConstants (DumpState *D, const Proto *f) { - int i; - int n = f->sizek; - dumpInt(D, n); - for (i = 0; i < n; i++) { - const TValue *o = &f->k[i]; - int tt = ttypetag(o); - dumpByte(D, tt); - switch (tt) { - case LUA_VNUMFLT: - dumpNumber(D, fltvalue(o)); - break; - case LUA_VNUMINT: - dumpInteger(D, ivalue(o)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - dumpString(D, tsvalue(o)); - break; - default: - lua_assert(tt == LUA_VNIL || tt == LUA_VFALSE || tt == LUA_VTRUE); - } - } -} - - -static void dumpProtos (DumpState *D, const Proto *f) { - int i; - int n = f->sizep; - dumpInt(D, n); - for (i = 0; i < n; i++) - dumpFunction(D, f->p[i]); -} - - -static void dumpUpvalues (DumpState *D, const Proto *f) { - int i, n = f->sizeupvalues; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpByte(D, f->upvalues[i].instack); - dumpByte(D, f->upvalues[i].idx); - dumpByte(D, f->upvalues[i].kind); - } -} - - -static void dumpDebug (DumpState *D, const Proto *f) { - int i, n; - n = (D->strip) ? 0 : f->sizelineinfo; - dumpInt(D, n); - if (f->lineinfo != NULL) - dumpVector(D, f->lineinfo, n); - n = (D->strip) ? 0 : f->sizeabslineinfo; - dumpInt(D, n); - if (n > 0) { - /* 'abslineinfo' is an array of structures of int's */ - dumpAlign(D, sizeof(int)); - dumpVector(D, f->abslineinfo, n); - } - n = (D->strip) ? 0 : f->sizelocvars; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpString(D, f->locvars[i].varname); - dumpInt(D, f->locvars[i].startpc); - dumpInt(D, f->locvars[i].endpc); - } - n = (D->strip) ? 0 : f->sizeupvalues; - dumpInt(D, n); - for (i = 0; i < n; i++) - dumpString(D, f->upvalues[i].name); -} - - -static void dumpFunction (DumpState *D, const Proto *f) { - dumpInt(D, f->linedefined); - dumpInt(D, f->lastlinedefined); - dumpByte(D, f->numparams); - dumpByte(D, f->flag); - dumpByte(D, f->maxstacksize); - dumpCode(D, f); - dumpConstants(D, f); - dumpUpvalues(D, f); - dumpProtos(D, f); - dumpString(D, D->strip ? NULL : f->source); - dumpDebug(D, f); -} - - -static void dumpHeader (DumpState *D) { - dumpLiteral(D, LUA_SIGNATURE); - dumpByte(D, LUAC_VERSION); - dumpByte(D, LUAC_FORMAT); - dumpLiteral(D, LUAC_DATA); - dumpByte(D, sizeof(Instruction)); - dumpByte(D, sizeof(lua_Integer)); - dumpByte(D, sizeof(lua_Number)); - dumpInteger(D, LUAC_INT); - dumpNumber(D, LUAC_NUM); -} - - -/* -** dump Lua function as precompiled chunk -*/ -int luaU_dump (lua_State *L, const Proto *f, lua_Writer w, void *data, - int strip) { - DumpState D; - D.h = luaH_new(L); /* aux. table to keep strings already dumped */ - sethvalue2s(L, L->top.p, D.h); /* anchor it */ - L->top.p++; - D.L = L; - D.writer = w; - D.offset = 0; - D.data = data; - D.strip = strip; - D.status = 0; - D.nstr = 0; - dumpHeader(&D); - dumpByte(&D, f->sizeupvalues); - dumpFunction(&D, f); - dumpBlock(&D, NULL, 0); /* signal end of dump */ - return D.status; -} - diff --git a/src/dependencies/lua/lfunc.c b/src/dependencies/lua/lfunc.c deleted file mode 100644 index d63d05f..0000000 --- a/src/dependencies/lua/lfunc.c +++ /dev/null @@ -1,296 +0,0 @@ -/* -** $Id: lfunc.c $ -** Auxiliary functions to manipulate prototypes and closures -** See Copyright Notice in lua.h -*/ - -#define lfunc_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" - - - -CClosure *luaF_newCclosure (lua_State *L, int nupvals) { - GCObject *o = luaC_newobj(L, LUA_VCCL, sizeCclosure(nupvals)); - CClosure *c = gco2ccl(o); - c->nupvalues = cast_byte(nupvals); - return c; -} - - -LClosure *luaF_newLclosure (lua_State *L, int nupvals) { - GCObject *o = luaC_newobj(L, LUA_VLCL, sizeLclosure(nupvals)); - LClosure *c = gco2lcl(o); - c->p = NULL; - c->nupvalues = cast_byte(nupvals); - while (nupvals--) c->upvals[nupvals] = NULL; - return c; -} - - -/* -** fill a closure with new closed upvalues -*/ -void luaF_initupvals (lua_State *L, LClosure *cl) { - int i; - for (i = 0; i < cl->nupvalues; i++) { - GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); - UpVal *uv = gco2upv(o); - uv->v.p = &uv->u.value; /* make it closed */ - setnilvalue(uv->v.p); - cl->upvals[i] = uv; - luaC_objbarrier(L, cl, uv); - } -} - - -/* -** Create a new upvalue at the given level, and link it to the list of -** open upvalues of 'L' after entry 'prev'. -**/ -static UpVal *newupval (lua_State *L, StkId level, UpVal **prev) { - GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); - UpVal *uv = gco2upv(o); - UpVal *next = *prev; - uv->v.p = s2v(level); /* current value lives in the stack */ - uv->u.open.next = next; /* link it to list of open upvalues */ - uv->u.open.previous = prev; - if (next) - next->u.open.previous = &uv->u.open.next; - *prev = uv; - if (!isintwups(L)) { /* thread not in list of threads with upvalues? */ - L->twups = G(L)->twups; /* link it to the list */ - G(L)->twups = L; - } - return uv; -} - - -/* -** Find and reuse, or create if it does not exist, an upvalue -** at the given level. -*/ -UpVal *luaF_findupval (lua_State *L, StkId level) { - UpVal **pp = &L->openupval; - UpVal *p; - lua_assert(isintwups(L) || L->openupval == NULL); - while ((p = *pp) != NULL && uplevel(p) >= level) { /* search for it */ - lua_assert(!isdead(G(L), p)); - if (uplevel(p) == level) /* corresponding upvalue? */ - return p; /* return it */ - pp = &p->u.open.next; - } - /* not found: create a new upvalue after 'pp' */ - return newupval(L, level, pp); -} - - -/* -** Call closing method for object 'obj' with error message 'err'. The -** boolean 'yy' controls whether the call is yieldable. -** (This function assumes EXTRA_STACK.) -*/ -static void callclosemethod (lua_State *L, TValue *obj, TValue *err, int yy) { - StkId top = L->top.p; - const TValue *tm = luaT_gettmbyobj(L, obj, TM_CLOSE); - setobj2s(L, top, tm); /* will call metamethod... */ - setobj2s(L, top + 1, obj); /* with 'self' as the 1st argument */ - setobj2s(L, top + 2, err); /* and error msg. as 2nd argument */ - L->top.p = top + 3; /* add function and arguments */ - if (yy) - luaD_call(L, top, 0); - else - luaD_callnoyield(L, top, 0); -} - - -/* -** Check whether object at given level has a close metamethod and raise -** an error if not. -*/ -static void checkclosemth (lua_State *L, StkId level) { - const TValue *tm = luaT_gettmbyobj(L, s2v(level), TM_CLOSE); - if (ttisnil(tm)) { /* no metamethod? */ - int idx = cast_int(level - L->ci->func.p); /* variable index */ - const char *vname = luaG_findlocal(L, L->ci, idx, NULL); - if (vname == NULL) vname = "?"; - luaG_runerror(L, "variable '%s' got a non-closable value", vname); - } -} - - -/* -** Prepare and call a closing method. -** If status is CLOSEKTOP, the call to the closing method will be pushed -** at the top of the stack. Otherwise, values can be pushed right after -** the 'level' of the upvalue being closed, as everything after that -** won't be used again. -*/ -static void prepcallclosemth (lua_State *L, StkId level, int status, int yy) { - TValue *uv = s2v(level); /* value being closed */ - TValue *errobj; - if (status == CLOSEKTOP) - errobj = &G(L)->nilvalue; /* error object is nil */ - else { /* 'luaD_seterrorobj' will set top to level + 2 */ - errobj = s2v(level + 1); /* error object goes after 'uv' */ - luaD_seterrorobj(L, status, level + 1); /* set error object */ - } - callclosemethod(L, uv, errobj, yy); -} - - -/* -** Maximum value for deltas in 'tbclist', dependent on the type -** of delta. (This macro assumes that an 'L' is in scope where it -** is used.) -*/ -#define MAXDELTA \ - ((256ul << ((sizeof(L->stack.p->tbclist.delta) - 1) * 8)) - 1) - - -/* -** Insert a variable in the list of to-be-closed variables. -*/ -void luaF_newtbcupval (lua_State *L, StkId level) { - lua_assert(level > L->tbclist.p); - if (l_isfalse(s2v(level))) - return; /* false doesn't need to be closed */ - checkclosemth(L, level); /* value must have a close method */ - while (cast_uint(level - L->tbclist.p) > MAXDELTA) { - L->tbclist.p += MAXDELTA; /* create a dummy node at maximum delta */ - L->tbclist.p->tbclist.delta = 0; - } - level->tbclist.delta = cast(unsigned short, level - L->tbclist.p); - L->tbclist.p = level; -} - - -void luaF_unlinkupval (UpVal *uv) { - lua_assert(upisopen(uv)); - *uv->u.open.previous = uv->u.open.next; - if (uv->u.open.next) - uv->u.open.next->u.open.previous = uv->u.open.previous; -} - - -/* -** Close all upvalues up to the given stack level. -*/ -void luaF_closeupval (lua_State *L, StkId level) { - UpVal *uv; - StkId upl; /* stack index pointed by 'uv' */ - while ((uv = L->openupval) != NULL && (upl = uplevel(uv)) >= level) { - TValue *slot = &uv->u.value; /* new position for value */ - lua_assert(uplevel(uv) < L->top.p); - luaF_unlinkupval(uv); /* remove upvalue from 'openupval' list */ - setobj(L, slot, uv->v.p); /* move value to upvalue slot */ - uv->v.p = slot; /* now current value lives here */ - if (!iswhite(uv)) { /* neither white nor dead? */ - nw2black(uv); /* closed upvalues cannot be gray */ - luaC_barrier(L, uv, slot); - } - } -} - - -/* -** Remove first element from the tbclist plus its dummy nodes. -*/ -static void poptbclist (lua_State *L) { - StkId tbc = L->tbclist.p; - lua_assert(tbc->tbclist.delta > 0); /* first element cannot be dummy */ - tbc -= tbc->tbclist.delta; - while (tbc > L->stack.p && tbc->tbclist.delta == 0) - tbc -= MAXDELTA; /* remove dummy nodes */ - L->tbclist.p = tbc; -} - - -/* -** Close all upvalues and to-be-closed variables up to the given stack -** level. Return restored 'level'. -*/ -StkId luaF_close (lua_State *L, StkId level, int status, int yy) { - ptrdiff_t levelrel = savestack(L, level); - luaF_closeupval(L, level); /* first, close the upvalues */ - while (L->tbclist.p >= level) { /* traverse tbc's down to that level */ - StkId tbc = L->tbclist.p; /* get variable index */ - poptbclist(L); /* remove it from list */ - prepcallclosemth(L, tbc, status, yy); /* close variable */ - level = restorestack(L, levelrel); - } - return level; -} - - -Proto *luaF_newproto (lua_State *L) { - GCObject *o = luaC_newobj(L, LUA_VPROTO, sizeof(Proto)); - Proto *f = gco2p(o); - f->k = NULL; - f->sizek = 0; - f->p = NULL; - f->sizep = 0; - f->code = NULL; - f->sizecode = 0; - f->lineinfo = NULL; - f->sizelineinfo = 0; - f->abslineinfo = NULL; - f->sizeabslineinfo = 0; - f->upvalues = NULL; - f->sizeupvalues = 0; - f->numparams = 0; - f->flag = 0; - f->maxstacksize = 0; - f->locvars = NULL; - f->sizelocvars = 0; - f->linedefined = 0; - f->lastlinedefined = 0; - f->source = NULL; - return f; -} - - -void luaF_freeproto (lua_State *L, Proto *f) { - if (!(f->flag & PF_FIXED)) { - luaM_freearray(L, f->code, f->sizecode); - luaM_freearray(L, f->lineinfo, f->sizelineinfo); - luaM_freearray(L, f->abslineinfo, f->sizeabslineinfo); - } - luaM_freearray(L, f->p, f->sizep); - luaM_freearray(L, f->k, f->sizek); - luaM_freearray(L, f->locvars, f->sizelocvars); - luaM_freearray(L, f->upvalues, f->sizeupvalues); - luaM_free(L, f); -} - - -/* -** Look for n-th local variable at line 'line' in function 'func'. -** Returns NULL if not found. -*/ -const char *luaF_getlocalname (const Proto *f, int local_number, int pc) { - int i; - for (i = 0; isizelocvars && f->locvars[i].startpc <= pc; i++) { - if (pc < f->locvars[i].endpc) { /* is variable active? */ - local_number--; - if (local_number == 0) - return getstr(f->locvars[i].varname); - } - } - return NULL; /* not found */ -} - diff --git a/src/dependencies/lua/lfunc.h b/src/dependencies/lua/lfunc.h deleted file mode 100644 index 3be265e..0000000 --- a/src/dependencies/lua/lfunc.h +++ /dev/null @@ -1,64 +0,0 @@ -/* -** $Id: lfunc.h $ -** Auxiliary functions to manipulate prototypes and closures -** See Copyright Notice in lua.h -*/ - -#ifndef lfunc_h -#define lfunc_h - - -#include "lobject.h" - - -#define sizeCclosure(n) (cast_int(offsetof(CClosure, upvalue)) + \ - cast_int(sizeof(TValue)) * (n)) - -#define sizeLclosure(n) (cast_int(offsetof(LClosure, upvals)) + \ - cast_int(sizeof(TValue *)) * (n)) - - -/* test whether thread is in 'twups' list */ -#define isintwups(L) (L->twups != L) - - -/* -** maximum number of upvalues in a closure (both C and Lua). (Value -** must fit in a VM register.) -*/ -#define MAXUPVAL 255 - - -#define upisopen(up) ((up)->v.p != &(up)->u.value) - - -#define uplevel(up) check_exp(upisopen(up), cast(StkId, (up)->v.p)) - - -/* -** maximum number of misses before giving up the cache of closures -** in prototypes -*/ -#define MAXMISS 10 - - - -/* special status to close upvalues preserving the top of the stack */ -#define CLOSEKTOP (-1) - - -LUAI_FUNC Proto *luaF_newproto (lua_State *L); -LUAI_FUNC CClosure *luaF_newCclosure (lua_State *L, int nupvals); -LUAI_FUNC LClosure *luaF_newLclosure (lua_State *L, int nupvals); -LUAI_FUNC void luaF_initupvals (lua_State *L, LClosure *cl); -LUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_newtbcupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_closeupval (lua_State *L, StkId level); -LUAI_FUNC StkId luaF_close (lua_State *L, StkId level, int status, int yy); -LUAI_FUNC void luaF_unlinkupval (UpVal *uv); -LUAI_FUNC void luaF_freeproto (lua_State *L, Proto *f); -LUAI_FUNC const char *luaF_getlocalname (const Proto *func, int local_number, - int pc); - - -#endif diff --git a/src/dependencies/lua/lgc.c b/src/dependencies/lua/lgc.c deleted file mode 100644 index 700390d..0000000 --- a/src/dependencies/lua/lgc.c +++ /dev/null @@ -1,1724 +0,0 @@ -/* -** $Id: lgc.c $ -** Garbage Collector -** See Copyright Notice in lua.h -*/ - -#define lgc_c -#define LUA_CORE - -#include "lprefix.h" - -#include - - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "llex.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" - - -/* -** Number of fixed (luaC_fix) objects in a Lua state: metafield names, -** plus reserved words, plus "_ENV", plus the memory-error message. -*/ -#define NFIXED (TM_N + NUM_RESERVED + 2) - - -/* -** Maximum number of elements to sweep in each single step. -** (Large enough to dissipate fixed overheads but small enough -** to allow small steps for the collector.) -*/ -#define GCSWEEPMAX 20 - - -/* mask with all color bits */ -#define maskcolors (bitmask(BLACKBIT) | WHITEBITS) - -/* mask with all GC bits */ -#define maskgcbits (maskcolors | AGEBITS) - - -/* macro to erase all color bits then set only the current white bit */ -#define makewhite(g,x) \ - (x->marked = cast_byte((x->marked & ~maskcolors) | luaC_white(g))) - -/* make an object gray (neither white nor black) */ -#define set2gray(x) resetbits(x->marked, maskcolors) - - -/* make an object black (coming from any color) */ -#define set2black(x) \ - (x->marked = cast_byte((x->marked & ~WHITEBITS) | bitmask(BLACKBIT))) - - -#define valiswhite(x) (iscollectable(x) && iswhite(gcvalue(x))) - -#define keyiswhite(n) (keyiscollectable(n) && iswhite(gckey(n))) - - -/* -** Protected access to objects in values -*/ -#define gcvalueN(o) (iscollectable(o) ? gcvalue(o) : NULL) - - -/* -** Access to collectable objects in array part of tables -*/ -#define gcvalarr(t,i) \ - ((*getArrTag(t,i) & BIT_ISCOLLECTABLE) ? getArrVal(t,i)->gc : NULL) - - -#define markvalue(g,o) { checkliveness(g->mainthread,o); \ - if (valiswhite(o)) reallymarkobject(g,gcvalue(o)); } - -#define markkey(g, n) { if keyiswhite(n) reallymarkobject(g,gckey(n)); } - -#define markobject(g,t) { if (iswhite(t)) reallymarkobject(g, obj2gco(t)); } - -/* -** mark an object that can be NULL (either because it is really optional, -** or it was stripped as debug info, or inside an uncompleted structure) -*/ -#define markobjectN(g,t) { if (t) markobject(g,t); } - - -static void reallymarkobject (global_State *g, GCObject *o); -static l_obj atomic (lua_State *L); -static void entersweep (lua_State *L); - - -/* -** {====================================================== -** Generic functions -** ======================================================= -*/ - - -/* -** one after last element in a hash array -*/ -#define gnodelast(h) gnode(h, cast_sizet(sizenode(h))) - - -static GCObject **getgclist (GCObject *o) { - switch (o->tt) { - case LUA_VTABLE: return &gco2t(o)->gclist; - case LUA_VLCL: return &gco2lcl(o)->gclist; - case LUA_VCCL: return &gco2ccl(o)->gclist; - case LUA_VTHREAD: return &gco2th(o)->gclist; - case LUA_VPROTO: return &gco2p(o)->gclist; - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - lua_assert(u->nuvalue > 0); - return &u->gclist; - } - default: lua_assert(0); return 0; - } -} - - -/* -** Link a collectable object 'o' with a known type into the list 'p'. -** (Must be a macro to access the 'gclist' field in different types.) -*/ -#define linkgclist(o,p) linkgclist_(obj2gco(o), &(o)->gclist, &(p)) - -static void linkgclist_ (GCObject *o, GCObject **pnext, GCObject **list) { - lua_assert(!isgray(o)); /* cannot be in a gray list */ - *pnext = *list; - *list = o; - set2gray(o); /* now it is */ -} - - -/* -** Link a generic collectable object 'o' into the list 'p'. -*/ -#define linkobjgclist(o,p) linkgclist_(obj2gco(o), getgclist(o), &(p)) - - - -/* -** Clear keys for empty entries in tables. If entry is empty, mark its -** entry as dead. This allows the collection of the key, but keeps its -** entry in the table: its removal could break a chain and could break -** a table traversal. Other places never manipulate dead keys, because -** its associated empty value is enough to signal that the entry is -** logically empty. -*/ -static void clearkey (Node *n) { - lua_assert(isempty(gval(n))); - if (keyiscollectable(n)) - setdeadkey(n); /* unused key; remove it */ -} - - -/* -** tells whether a key or value can be cleared from a weak -** table. Non-collectable objects are never removed from weak -** tables. Strings behave as 'values', so are never removed too. for -** other objects: if really collected, cannot keep them; for objects -** being finalized, keep them in keys, but not in values -*/ -static int iscleared (global_State *g, const GCObject *o) { - if (o == NULL) return 0; /* non-collectable value */ - else if (novariant(o->tt) == LUA_TSTRING) { - markobject(g, o); /* strings are 'values', so are never weak */ - return 0; - } - else return iswhite(o); -} - - -/* -** Barrier that moves collector forward, that is, marks the white object -** 'v' being pointed by the black object 'o'. In the generational -** mode, 'v' must also become old, if 'o' is old; however, it cannot -** be changed directly to OLD, because it may still point to non-old -** objects. So, it is marked as OLD0. In the next cycle it will become -** OLD1, and in the next it will finally become OLD (regular old). By -** then, any object it points to will also be old. If called in the -** incremental sweep phase, it clears the black object to white (sweep -** it) to avoid other barrier calls for this same object. (That cannot -** be done is generational mode, as its sweep does not distinguish -** whites from deads.) -*/ -void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v) { - global_State *g = G(L); - lua_assert(isblack(o) && iswhite(v) && !isdead(g, v) && !isdead(g, o)); - if (keepinvariant(g)) { /* must keep invariant? */ - reallymarkobject(g, v); /* restore invariant */ - if (isold(o)) { - lua_assert(!isold(v)); /* white object could not be old */ - setage(v, G_OLD0); /* restore generational invariant */ - } - } - else { /* sweep phase */ - lua_assert(issweepphase(g)); - if (g->gckind != KGC_GENMINOR) /* incremental mode? */ - makewhite(g, o); /* mark 'o' as white to avoid other barriers */ - } -} - - -/* -** barrier that moves collector backward, that is, mark the black object -** pointing to a white object as gray again. -*/ -void luaC_barrierback_ (lua_State *L, GCObject *o) { - global_State *g = G(L); - lua_assert(isblack(o) && !isdead(g, o)); - lua_assert((g->gckind != KGC_GENMINOR) - || (isold(o) && getage(o) != G_TOUCHED1)); - if (getage(o) == G_TOUCHED2) /* already in gray list? */ - set2gray(o); /* make it gray to become touched1 */ - else /* link it in 'grayagain' and paint it gray */ - linkobjgclist(o, g->grayagain); - if (isold(o)) /* generational mode? */ - setage(o, G_TOUCHED1); /* touched in current cycle */ -} - - -void luaC_fix (lua_State *L, GCObject *o) { - global_State *g = G(L); - lua_assert(g->allgc == o); /* object must be 1st in 'allgc' list! */ - set2gray(o); /* they will be gray forever */ - setage(o, G_OLD); /* and old forever */ - g->allgc = o->next; /* remove object from 'allgc' list */ - o->next = g->fixedgc; /* link it to 'fixedgc' list */ - g->fixedgc = o; -} - - -/* -** create a new collectable object (with given type, size, and offset) -** and link it to 'allgc' list. -*/ -GCObject *luaC_newobjdt (lua_State *L, int tt, size_t sz, size_t offset) { - global_State *g = G(L); - char *p = cast_charp(luaM_newobject(L, novariant(tt), sz)); - GCObject *o = cast(GCObject *, p + offset); - g->GCdebt--; - o->marked = luaC_white(g); - o->tt = tt; - o->next = g->allgc; - g->allgc = o; - return o; -} - - -/* -** create a new collectable object with no offset. -*/ -GCObject *luaC_newobj (lua_State *L, int tt, size_t sz) { - return luaC_newobjdt(L, tt, sz, 0); -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Mark functions -** ======================================================= -*/ - - -/* -** Mark an object. Userdata with no user values, strings, and closed -** upvalues are visited and turned black here. Open upvalues are -** already indirectly linked through their respective threads in the -** 'twups' list, so they don't go to the gray list; nevertheless, they -** are kept gray to avoid barriers, as their values will be revisited -** by the thread or by 'remarkupvals'. Other objects are added to the -** gray list to be visited (and turned black) later. Both userdata and -** upvalues can call this function recursively, but this recursion goes -** for at most two levels: An upvalue cannot refer to another upvalue -** (only closures can), and a userdata's metatable must be a table. -*/ -static void reallymarkobject (global_State *g, GCObject *o) { - g->marked++; - switch (o->tt) { - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - set2black(o); /* nothing to visit */ - break; - } - case LUA_VUPVAL: { - UpVal *uv = gco2upv(o); - if (upisopen(uv)) - set2gray(uv); /* open upvalues are kept gray */ - else - set2black(uv); /* closed upvalues are visited here */ - markvalue(g, uv->v.p); /* mark its content */ - break; - } - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - if (u->nuvalue == 0) { /* no user values? */ - markobjectN(g, u->metatable); /* mark its metatable */ - set2black(u); /* nothing else to mark */ - break; - } - /* else... */ - } /* FALLTHROUGH */ - case LUA_VLCL: case LUA_VCCL: case LUA_VTABLE: - case LUA_VTHREAD: case LUA_VPROTO: { - linkobjgclist(o, g->gray); /* to be visited later */ - break; - } - default: lua_assert(0); break; - } -} - - -/* -** mark metamethods for basic types -*/ -static void markmt (global_State *g) { - int i; - for (i=0; i < LUA_NUMTYPES; i++) - markobjectN(g, g->mt[i]); -} - - -/* -** mark all objects in list of being-finalized -*/ -static l_obj markbeingfnz (global_State *g) { - GCObject *o; - l_obj count = 0; - for (o = g->tobefnz; o != NULL; o = o->next) { - count++; - markobject(g, o); - } - return count; -} - - -/* -** For each non-marked thread, simulates a barrier between each open -** upvalue and its value. (If the thread is collected, the value will be -** assigned to the upvalue, but then it can be too late for the barrier -** to act. The "barrier" does not need to check colors: A non-marked -** thread must be young; upvalues cannot be older than their threads; so -** any visited upvalue must be young too.) Also removes the thread from -** the list, as it was already visited. Removes also threads with no -** upvalues, as they have nothing to be checked. (If the thread gets an -** upvalue later, it will be linked in the list again.) -*/ -static l_obj remarkupvals (global_State *g) { - l_obj work = 0; - lua_State *thread; - lua_State **p = &g->twups; - while ((thread = *p) != NULL) { - if (!iswhite(thread) && thread->openupval != NULL) - p = &thread->twups; /* keep marked thread with upvalues in the list */ - else { /* thread is not marked or without upvalues */ - UpVal *uv; - lua_assert(!isold(thread) || thread->openupval == NULL); - *p = thread->twups; /* remove thread from the list */ - thread->twups = thread; /* mark that it is out of list */ - for (uv = thread->openupval; uv != NULL; uv = uv->u.open.next) { - lua_assert(getage(uv) <= getage(thread)); - if (!iswhite(uv)) { /* upvalue already visited? */ - lua_assert(upisopen(uv) && isgray(uv)); - markvalue(g, uv->v.p); /* mark its value */ - } - } - } - work++; - } - return work; -} - - -static void cleargraylists (global_State *g) { - g->gray = g->grayagain = NULL; - g->weak = g->allweak = g->ephemeron = NULL; -} - - -/* -** mark root set and reset all gray lists, to start a new collection. -** 'marked' is initialized with the number of fixed objects in the state, -** to count the total number of live objects during a cycle. (That is -** the metafield names, plus the reserved words, plus "_ENV" plus the -** memory-error message.) -*/ -static void restartcollection (global_State *g) { - cleargraylists(g); - g->marked = NFIXED; - markobject(g, g->mainthread); - markvalue(g, &g->l_registry); - markmt(g); - markbeingfnz(g); /* mark any finalizing object left from previous cycle */ -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Traverse functions -** ======================================================= -*/ - - -/* -** Check whether object 'o' should be kept in the 'grayagain' list for -** post-processing by 'correctgraylist'. (It could put all old objects -** in the list and leave all the work to 'correctgraylist', but it is -** more efficient to avoid adding elements that will be removed.) Only -** TOUCHED1 objects need to be in the list. TOUCHED2 doesn't need to go -** back to a gray list, but then it must become OLD. (That is what -** 'correctgraylist' does when it finds a TOUCHED2 object.) -*/ -static void genlink (global_State *g, GCObject *o) { - lua_assert(isblack(o)); - if (getage(o) == G_TOUCHED1) { /* touched in this cycle? */ - linkobjgclist(o, g->grayagain); /* link it back in 'grayagain' */ - } /* everything else do not need to be linked back */ - else if (getage(o) == G_TOUCHED2) - setage(o, G_OLD); /* advance age */ -} - - -/* -** Traverse a table with weak values and link it to proper list. During -** propagate phase, keep it in 'grayagain' list, to be revisited in the -** atomic phase. In the atomic phase, if table has any white value, -** put it in 'weak' list, to be cleared. -*/ -static void traverseweakvalue (global_State *g, Table *h) { - Node *n, *limit = gnodelast(h); - /* if there is array part, assume it may have white values (it is not - worth traversing it now just to check) */ - int hasclears = (h->alimit > 0); - for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ - if (isempty(gval(n))) /* entry is empty? */ - clearkey(n); /* clear its key */ - else { - lua_assert(!keyisnil(n)); - markkey(g, n); - if (!hasclears && iscleared(g, gcvalueN(gval(n)))) /* a white value? */ - hasclears = 1; /* table will have to be cleared */ - } - } - if (g->gcstate == GCSatomic && hasclears) - linkgclist(h, g->weak); /* has to be cleared later */ - else - linkgclist(h, g->grayagain); /* must retraverse it in atomic phase */ -} - - -/* -** Traverse the array part of a table. -*/ -static int traversearray (global_State *g, Table *h) { - unsigned asize = luaH_realasize(h); - int marked = 0; /* true if some object is marked in this traversal */ - unsigned i; - for (i = 0; i < asize; i++) { - GCObject *o = gcvalarr(h, i); - if (o != NULL && iswhite(o)) { - marked = 1; - reallymarkobject(g, o); - } - } - return marked; -} - - -/* -** Traverse an ephemeron table and link it to proper list. Returns true -** iff any object was marked during this traversal (which implies that -** convergence has to continue). During propagation phase, keep table -** in 'grayagain' list, to be visited again in the atomic phase. In -** the atomic phase, if table has any white->white entry, it has to -** be revisited during ephemeron convergence (as that key may turn -** black). Otherwise, if it has any white key, table has to be cleared -** (in the atomic phase). In generational mode, some tables -** must be kept in some gray list for post-processing; this is done -** by 'genlink'. -*/ -static int traverseephemeron (global_State *g, Table *h, int inv) { - int hasclears = 0; /* true if table has white keys */ - int hasww = 0; /* true if table has entry "white-key -> white-value" */ - unsigned int i; - unsigned int nsize = sizenode(h); - int marked = traversearray(g, h); /* traverse array part */ - /* traverse hash part; if 'inv', traverse descending - (see 'convergeephemerons') */ - for (i = 0; i < nsize; i++) { - Node *n = inv ? gnode(h, nsize - 1 - i) : gnode(h, i); - if (isempty(gval(n))) /* entry is empty? */ - clearkey(n); /* clear its key */ - else if (iscleared(g, gckeyN(n))) { /* key is not marked (yet)? */ - hasclears = 1; /* table must be cleared */ - if (valiswhite(gval(n))) /* value not marked yet? */ - hasww = 1; /* white-white entry */ - } - else if (valiswhite(gval(n))) { /* value not marked yet? */ - marked = 1; - reallymarkobject(g, gcvalue(gval(n))); /* mark it now */ - } - } - /* link table into proper list */ - if (g->gcstate == GCSpropagate) - linkgclist(h, g->grayagain); /* must retraverse it in atomic phase */ - else if (hasww) /* table has white->white entries? */ - linkgclist(h, g->ephemeron); /* have to propagate again */ - else if (hasclears) /* table has white keys? */ - linkgclist(h, g->allweak); /* may have to clean white keys */ - else - genlink(g, obj2gco(h)); /* check whether collector still needs to see it */ - return marked; -} - - -static void traversestrongtable (global_State *g, Table *h) { - Node *n, *limit = gnodelast(h); - traversearray(g, h); - for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ - if (isempty(gval(n))) /* entry is empty? */ - clearkey(n); /* clear its key */ - else { - lua_assert(!keyisnil(n)); - markkey(g, n); - markvalue(g, gval(n)); - } - } - genlink(g, obj2gco(h)); -} - - -static void traversetable (global_State *g, Table *h) { - const char *weakkey, *weakvalue; - const TValue *mode = gfasttm(g, h->metatable, TM_MODE); - TString *smode; - markobjectN(g, h->metatable); - if (mode && ttisshrstring(mode) && /* is there a weak mode? */ - (cast_void(smode = tsvalue(mode)), - cast_void(weakkey = strchr(getshrstr(smode), 'k')), - cast_void(weakvalue = strchr(getshrstr(smode), 'v')), - (weakkey || weakvalue))) { /* is really weak? */ - if (!weakkey) /* strong keys? */ - traverseweakvalue(g, h); - else if (!weakvalue) /* strong values? */ - traverseephemeron(g, h, 0); - else /* all weak */ - linkgclist(h, g->allweak); /* nothing to traverse now */ - } - else /* not weak */ - traversestrongtable(g, h); -} - - -static void traverseudata (global_State *g, Udata *u) { - int i; - markobjectN(g, u->metatable); /* mark its metatable */ - for (i = 0; i < u->nuvalue; i++) - markvalue(g, &u->uv[i].uv); - genlink(g, obj2gco(u)); -} - - -/* -** Traverse a prototype. (While a prototype is being build, its -** arrays can be larger than needed; the extra slots are filled with -** NULL, so the use of 'markobjectN') -*/ -static void traverseproto (global_State *g, Proto *f) { - int i; - markobjectN(g, f->source); - for (i = 0; i < f->sizek; i++) /* mark literals */ - markvalue(g, &f->k[i]); - for (i = 0; i < f->sizeupvalues; i++) /* mark upvalue names */ - markobjectN(g, f->upvalues[i].name); - for (i = 0; i < f->sizep; i++) /* mark nested protos */ - markobjectN(g, f->p[i]); - for (i = 0; i < f->sizelocvars; i++) /* mark local-variable names */ - markobjectN(g, f->locvars[i].varname); -} - - -static void traverseCclosure (global_State *g, CClosure *cl) { - int i; - for (i = 0; i < cl->nupvalues; i++) /* mark its upvalues */ - markvalue(g, &cl->upvalue[i]); -} - -/* -** Traverse a Lua closure, marking its prototype and its upvalues. -** (Both can be NULL while closure is being created.) -*/ -static void traverseLclosure (global_State *g, LClosure *cl) { - int i; - markobjectN(g, cl->p); /* mark its prototype */ - for (i = 0; i < cl->nupvalues; i++) { /* visit its upvalues */ - UpVal *uv = cl->upvals[i]; - markobjectN(g, uv); /* mark upvalue */ - } -} - - -/* -** Traverse a thread, marking the elements in the stack up to its top -** and cleaning the rest of the stack in the final traversal. That -** ensures that the entire stack have valid (non-dead) objects. -** Threads have no barriers. In gen. mode, old threads must be visited -** at every cycle, because they might point to young objects. In inc. -** mode, the thread can still be modified before the end of the cycle, -** and therefore it must be visited again in the atomic phase. To ensure -** these visits, threads must return to a gray list if they are not new -** (which can only happen in generational mode) or if the traverse is in -** the propagate phase (which can only happen in incremental mode). -*/ -static void traversethread (global_State *g, lua_State *th) { - UpVal *uv; - StkId o = th->stack.p; - if (isold(th) || g->gcstate == GCSpropagate) - linkgclist(th, g->grayagain); /* insert into 'grayagain' list */ - if (o == NULL) - return; /* stack not completely built yet */ - lua_assert(g->gcstate == GCSatomic || - th->openupval == NULL || isintwups(th)); - for (; o < th->top.p; o++) /* mark live elements in the stack */ - markvalue(g, s2v(o)); - for (uv = th->openupval; uv != NULL; uv = uv->u.open.next) - markobject(g, uv); /* open upvalues cannot be collected */ - if (g->gcstate == GCSatomic) { /* final traversal? */ - if (!g->gcemergency) - luaD_shrinkstack(th); /* do not change stack in emergency cycle */ - for (o = th->top.p; o < th->stack_last.p + EXTRA_STACK; o++) - setnilvalue(s2v(o)); /* clear dead stack slice */ - /* 'remarkupvals' may have removed thread from 'twups' list */ - if (!isintwups(th) && th->openupval != NULL) { - th->twups = g->twups; /* link it back to the list */ - g->twups = th; - } - } -} - - -/* -** traverse one gray object, turning it to black. -*/ -static void propagatemark (global_State *g) { - GCObject *o = g->gray; - nw2black(o); - g->gray = *getgclist(o); /* remove from 'gray' list */ - switch (o->tt) { - case LUA_VTABLE: traversetable(g, gco2t(o)); break; - case LUA_VUSERDATA: traverseudata(g, gco2u(o)); break; - case LUA_VLCL: traverseLclosure(g, gco2lcl(o)); break; - case LUA_VCCL: traverseCclosure(g, gco2ccl(o)); break; - case LUA_VPROTO: traverseproto(g, gco2p(o)); break; - case LUA_VTHREAD: traversethread(g, gco2th(o)); break; - default: lua_assert(0); - } -} - - -static l_obj propagateall (global_State *g) { - l_obj work = 0; - while (g->gray) { - propagatemark(g); - work++; - } - return work; -} - - -/* -** Traverse all ephemeron tables propagating marks from keys to values. -** Repeat until it converges, that is, nothing new is marked. 'dir' -** inverts the direction of the traversals, trying to speed up -** convergence on chains in the same table. -*/ -static l_obj convergeephemerons (global_State *g) { - int changed; - l_obj work = 0; - int dir = 0; - do { - GCObject *w; - GCObject *next = g->ephemeron; /* get ephemeron list */ - g->ephemeron = NULL; /* tables may return to this list when traversed */ - changed = 0; - while ((w = next) != NULL) { /* for each ephemeron table */ - Table *h = gco2t(w); - next = h->gclist; /* list is rebuilt during loop */ - nw2black(h); /* out of the list (for now) */ - if (traverseephemeron(g, h, dir)) { /* marked some value? */ - propagateall(g); /* propagate changes */ - changed = 1; /* will have to revisit all ephemeron tables */ - } - work++; - } - dir = !dir; /* invert direction next time */ - } while (changed); /* repeat until no more changes */ - return work; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Sweep Functions -** ======================================================= -*/ - - -/* -** clear entries with unmarked keys from all weaktables in list 'l' -*/ -static l_obj clearbykeys (global_State *g, GCObject *l) { - l_obj work = 0; - for (; l; l = gco2t(l)->gclist) { - Table *h = gco2t(l); - Node *limit = gnodelast(h); - Node *n; - for (n = gnode(h, 0); n < limit; n++) { - if (iscleared(g, gckeyN(n))) /* unmarked key? */ - setempty(gval(n)); /* remove entry */ - if (isempty(gval(n))) /* is entry empty? */ - clearkey(n); /* clear its key */ - } - work++; - } - return work; -} - - -/* -** clear entries with unmarked values from all weaktables in list 'l' up -** to element 'f' -*/ -static l_obj clearbyvalues (global_State *g, GCObject *l, GCObject *f) { - l_obj work = 0; - for (; l != f; l = gco2t(l)->gclist) { - Table *h = gco2t(l); - Node *n, *limit = gnodelast(h); - unsigned int i; - unsigned int asize = luaH_realasize(h); - for (i = 0; i < asize; i++) { - GCObject *o = gcvalarr(h, i); - if (iscleared(g, o)) /* value was collected? */ - *getArrTag(h, i) = LUA_VEMPTY; /* remove entry */ - } - for (n = gnode(h, 0); n < limit; n++) { - if (iscleared(g, gcvalueN(gval(n)))) /* unmarked value? */ - setempty(gval(n)); /* remove entry */ - if (isempty(gval(n))) /* is entry empty? */ - clearkey(n); /* clear its key */ - } - work++; - } - return work; -} - - -static void freeupval (lua_State *L, UpVal *uv) { - if (upisopen(uv)) - luaF_unlinkupval(uv); - luaM_free(L, uv); -} - - -static void freeobj (lua_State *L, GCObject *o) { - G(L)->totalobjs--; - switch (o->tt) { - case LUA_VPROTO: - luaF_freeproto(L, gco2p(o)); - break; - case LUA_VUPVAL: - freeupval(L, gco2upv(o)); - break; - case LUA_VLCL: { - LClosure *cl = gco2lcl(o); - luaM_freemem(L, cl, sizeLclosure(cl->nupvalues)); - break; - } - case LUA_VCCL: { - CClosure *cl = gco2ccl(o); - luaM_freemem(L, cl, sizeCclosure(cl->nupvalues)); - break; - } - case LUA_VTABLE: - luaH_free(L, gco2t(o)); - break; - case LUA_VTHREAD: - luaE_freethread(L, gco2th(o)); - break; - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - luaM_freemem(L, o, sizeudata(u->nuvalue, u->len)); - break; - } - case LUA_VSHRSTR: { - TString *ts = gco2ts(o); - luaS_remove(L, ts); /* remove it from hash table */ - luaM_freemem(L, ts, sizestrshr(ts->shrlen)); - break; - } - case LUA_VLNGSTR: { - TString *ts = gco2ts(o); - if (ts->shrlen == LSTRMEM) /* must free external string? */ - (*ts->falloc)(ts->ud, ts->contents, ts->u.lnglen + 1, 0); - luaM_freemem(L, ts, luaS_sizelngstr(ts->u.lnglen, ts->shrlen)); - break; - } - default: lua_assert(0); - } -} - - -/* -** sweep at most 'countin' elements from a list of GCObjects erasing dead -** objects, where a dead object is one marked with the old (non current) -** white; change all non-dead objects back to white (and new), preparing -** for next collection cycle. Return where to continue the traversal or -** NULL if list is finished. -*/ -static GCObject **sweeplist (lua_State *L, GCObject **p, l_obj countin) { - global_State *g = G(L); - int ow = otherwhite(g); - l_obj i; - int white = luaC_white(g); /* current white */ - for (i = 0; *p != NULL && i < countin; i++) { - GCObject *curr = *p; - int marked = curr->marked; - if (isdeadm(ow, marked)) { /* is 'curr' dead? */ - *p = curr->next; /* remove 'curr' from list */ - freeobj(L, curr); /* erase 'curr' */ - } - else { /* change mark to 'white' and age to 'new' */ - curr->marked = cast_byte((marked & ~maskgcbits) | white | G_NEW); - p = &curr->next; /* go to next element */ - } - } - return (*p == NULL) ? NULL : p; -} - - -/* -** sweep a list until a live object (or end of list) -*/ -static GCObject **sweeptolive (lua_State *L, GCObject **p) { - GCObject **old = p; - do { - p = sweeplist(L, p, 1); - } while (p == old); - return p; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Finalization -** ======================================================= -*/ - -/* -** If possible, shrink string table. -*/ -static void checkSizes (lua_State *L, global_State *g) { - if (!g->gcemergency) { - if (g->strt.nuse < g->strt.size / 4) /* string table too big? */ - luaS_resize(L, g->strt.size / 2); - } -} - - -/* -** Get the next udata to be finalized from the 'tobefnz' list, and -** link it back into the 'allgc' list. -*/ -static GCObject *udata2finalize (global_State *g) { - GCObject *o = g->tobefnz; /* get first element */ - lua_assert(tofinalize(o)); - g->tobefnz = o->next; /* remove it from 'tobefnz' list */ - o->next = g->allgc; /* return it to 'allgc' list */ - g->allgc = o; - resetbit(o->marked, FINALIZEDBIT); /* object is "normal" again */ - if (issweepphase(g)) - makewhite(g, o); /* "sweep" object */ - else if (getage(o) == G_OLD1) - g->firstold1 = o; /* it is the first OLD1 object in the list */ - return o; -} - - -static void dothecall (lua_State *L, void *ud) { - UNUSED(ud); - luaD_callnoyield(L, L->top.p - 2, 0); -} - - -static void GCTM (lua_State *L) { - global_State *g = G(L); - const TValue *tm; - TValue v; - lua_assert(!g->gcemergency); - setgcovalue(L, &v, udata2finalize(g)); - tm = luaT_gettmbyobj(L, &v, TM_GC); - if (!notm(tm)) { /* is there a finalizer? */ - int status; - lu_byte oldah = L->allowhook; - int oldgcstp = g->gcstp; - g->gcstp |= GCSTPGC; /* avoid GC steps */ - L->allowhook = 0; /* stop debug hooks during GC metamethod */ - setobj2s(L, L->top.p++, tm); /* push finalizer... */ - setobj2s(L, L->top.p++, &v); /* ... and its argument */ - L->ci->callstatus |= CIST_FIN; /* will run a finalizer */ - status = luaD_pcall(L, dothecall, NULL, savestack(L, L->top.p - 2), 0); - L->ci->callstatus &= ~CIST_FIN; /* not running a finalizer anymore */ - L->allowhook = oldah; /* restore hooks */ - g->gcstp = oldgcstp; /* restore state */ - if (l_unlikely(status != LUA_OK)) { /* error while running __gc? */ - luaE_warnerror(L, "__gc"); - L->top.p--; /* pops error object */ - } - } -} - - -/* -** call all pending finalizers -*/ -static void callallpendingfinalizers (lua_State *L) { - global_State *g = G(L); - while (g->tobefnz) - GCTM(L); -} - - -/* -** find last 'next' field in list 'p' list (to add elements in its end) -*/ -static GCObject **findlast (GCObject **p) { - while (*p != NULL) - p = &(*p)->next; - return p; -} - - -/* -** Move all unreachable objects (or 'all' objects) that need -** finalization from list 'finobj' to list 'tobefnz' (to be finalized). -** (Note that objects after 'finobjold1' cannot be white, so they -** don't need to be traversed. In incremental mode, 'finobjold1' is NULL, -** so the whole list is traversed.) -*/ -static void separatetobefnz (global_State *g, int all) { - GCObject *curr; - GCObject **p = &g->finobj; - GCObject **lastnext = findlast(&g->tobefnz); - while ((curr = *p) != g->finobjold1) { /* traverse all finalizable objects */ - lua_assert(tofinalize(curr)); - if (!(iswhite(curr) || all)) /* not being collected? */ - p = &curr->next; /* don't bother with it */ - else { - if (curr == g->finobjsur) /* removing 'finobjsur'? */ - g->finobjsur = curr->next; /* correct it */ - *p = curr->next; /* remove 'curr' from 'finobj' list */ - curr->next = *lastnext; /* link at the end of 'tobefnz' list */ - *lastnext = curr; - lastnext = &curr->next; - } - } -} - - -/* -** If pointer 'p' points to 'o', move it to the next element. -*/ -static void checkpointer (GCObject **p, GCObject *o) { - if (o == *p) - *p = o->next; -} - - -/* -** Correct pointers to objects inside 'allgc' list when -** object 'o' is being removed from the list. -*/ -static void correctpointers (global_State *g, GCObject *o) { - checkpointer(&g->survival, o); - checkpointer(&g->old1, o); - checkpointer(&g->reallyold, o); - checkpointer(&g->firstold1, o); -} - - -/* -** if object 'o' has a finalizer, remove it from 'allgc' list (must -** search the list to find it) and link it in 'finobj' list. -*/ -void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt) { - global_State *g = G(L); - if (tofinalize(o) || /* obj. is already marked... */ - gfasttm(g, mt, TM_GC) == NULL || /* or has no finalizer... */ - (g->gcstp & GCSTPCLS)) /* or closing state? */ - return; /* nothing to be done */ - else { /* move 'o' to 'finobj' list */ - GCObject **p; - if (issweepphase(g)) { - makewhite(g, o); /* "sweep" object 'o' */ - if (g->sweepgc == &o->next) /* should not remove 'sweepgc' object */ - g->sweepgc = sweeptolive(L, g->sweepgc); /* change 'sweepgc' */ - } - else - correctpointers(g, o); - /* search for pointer pointing to 'o' */ - for (p = &g->allgc; *p != o; p = &(*p)->next) { /* empty */ } - *p = o->next; /* remove 'o' from 'allgc' list */ - o->next = g->finobj; /* link it in 'finobj' list */ - g->finobj = o; - l_setbit(o->marked, FINALIZEDBIT); /* mark it as such */ - } -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Generational Collector -** ======================================================= -*/ - - -/* -** Set the "time" to wait before starting a new incremental cycle; -** cycle will start when number of objects in use hits the threshold of -** approximately (marked * pause / 100). -*/ -static void setpause (global_State *g) { - l_obj threshold = applygcparam(g, PAUSE, g->marked); - l_obj debt = threshold - gettotalobjs(g); - if (debt < 0) debt = 0; - luaE_setdebt(g, debt); -} - - -/* -** Sweep a list of objects to enter generational mode. Deletes dead -** objects and turns the non dead to old. All non-dead threads---which -** are now old---must be in a gray list. Everything else is not in a -** gray list. Open upvalues are also kept gray. -*/ -static void sweep2old (lua_State *L, GCObject **p) { - GCObject *curr; - global_State *g = G(L); - while ((curr = *p) != NULL) { - if (iswhite(curr)) { /* is 'curr' dead? */ - lua_assert(isdead(g, curr)); - *p = curr->next; /* remove 'curr' from list */ - freeobj(L, curr); /* erase 'curr' */ - } - else { /* all surviving objects become old */ - setage(curr, G_OLD); - if (curr->tt == LUA_VTHREAD) { /* threads must be watched */ - lua_State *th = gco2th(curr); - linkgclist(th, g->grayagain); /* insert into 'grayagain' list */ - } - else if (curr->tt == LUA_VUPVAL && upisopen(gco2upv(curr))) - set2gray(curr); /* open upvalues are always gray */ - else /* everything else is black */ - nw2black(curr); - p = &curr->next; /* go to next element */ - } - } -} - - -/* -** Sweep for generational mode. Delete dead objects. (Because the -** collection is not incremental, there are no "new white" objects -** during the sweep. So, any white object must be dead.) For -** non-dead objects, advance their ages and clear the color of -** new objects. (Old objects keep their colors.) -** The ages of G_TOUCHED1 and G_TOUCHED2 objects cannot be advanced -** here, because these old-generation objects are usually not swept -** here. They will all be advanced in 'correctgraylist'. That function -** will also remove objects turned white here from any gray list. -*/ -static GCObject **sweepgen (lua_State *L, global_State *g, GCObject **p, - GCObject *limit, GCObject **pfirstold1, - l_obj *paddedold) { - static const lu_byte nextage[] = { - G_SURVIVAL, /* from G_NEW */ - G_OLD1, /* from G_SURVIVAL */ - G_OLD1, /* from G_OLD0 */ - G_OLD, /* from G_OLD1 */ - G_OLD, /* from G_OLD (do not change) */ - G_TOUCHED1, /* from G_TOUCHED1 (do not change) */ - G_TOUCHED2 /* from G_TOUCHED2 (do not change) */ - }; - l_obj addedold = 0; - int white = luaC_white(g); - GCObject *curr; - while ((curr = *p) != limit) { - if (iswhite(curr)) { /* is 'curr' dead? */ - lua_assert(!isold(curr) && isdead(g, curr)); - *p = curr->next; /* remove 'curr' from list */ - freeobj(L, curr); /* erase 'curr' */ - } - else { /* correct mark and age */ - int age = getage(curr); - if (age == G_NEW) { /* new objects go back to white */ - int marked = curr->marked & ~maskgcbits; /* erase GC bits */ - curr->marked = cast_byte(marked | G_SURVIVAL | white); - } - else { /* all other objects will be old, and so keep their color */ - lua_assert(age != G_OLD1); /* advanced in 'markold' */ - setage(curr, nextage[age]); - if (getage(curr) == G_OLD1) { - addedold++; /* one more object becoming old */ - if (*pfirstold1 == NULL) - *pfirstold1 = curr; /* first OLD1 object in the list */ - } - } - p = &curr->next; /* go to next element */ - } - } - *paddedold += addedold; - return p; -} - - -/* -** Correct a list of gray objects. Return a pointer to the last element -** left on the list, so that we can link another list to the end of -** this one. -** Because this correction is done after sweeping, young objects might -** be turned white and still be in the list. They are only removed. -** 'TOUCHED1' objects are advanced to 'TOUCHED2' and remain on the list; -** Non-white threads also remain on the list. 'TOUCHED2' objects and -** anything else become regular old, are marked black, and are removed -** from the list. -*/ -static GCObject **correctgraylist (GCObject **p) { - GCObject *curr; - while ((curr = *p) != NULL) { - GCObject **next = getgclist(curr); - if (iswhite(curr)) - goto remove; /* remove all white objects */ - else if (getage(curr) == G_TOUCHED1) { /* touched in this cycle? */ - lua_assert(isgray(curr)); - nw2black(curr); /* make it black, for next barrier */ - setage(curr, G_TOUCHED2); - goto remain; /* keep it in the list and go to next element */ - } - else if (curr->tt == LUA_VTHREAD) { - lua_assert(isgray(curr)); - goto remain; /* keep non-white threads on the list */ - } - else { /* everything else is removed */ - lua_assert(isold(curr)); /* young objects should be white here */ - if (getage(curr) == G_TOUCHED2) /* advance from TOUCHED2... */ - setage(curr, G_OLD); /* ... to OLD */ - nw2black(curr); /* make object black (to be removed) */ - goto remove; - } - remove: *p = *next; continue; - remain: p = next; continue; - } - return p; -} - - -/* -** Correct all gray lists, coalescing them into 'grayagain'. -*/ -static void correctgraylists (global_State *g) { - GCObject **list = correctgraylist(&g->grayagain); - *list = g->weak; g->weak = NULL; - list = correctgraylist(list); - *list = g->allweak; g->allweak = NULL; - list = correctgraylist(list); - *list = g->ephemeron; g->ephemeron = NULL; - correctgraylist(list); -} - - -/* -** Mark black 'OLD1' objects when starting a new young collection. -** Gray objects are already in some gray list, and so will be visited in -** the atomic step. -*/ -static void markold (global_State *g, GCObject *from, GCObject *to) { - GCObject *p; - for (p = from; p != to; p = p->next) { - if (getage(p) == G_OLD1) { - lua_assert(!iswhite(p)); - setage(p, G_OLD); /* now they are old */ - if (isblack(p)) - reallymarkobject(g, p); - } - } -} - - -/* -** Finish a young-generation collection. -*/ -static void finishgencycle (lua_State *L, global_State *g) { - correctgraylists(g); - checkSizes(L, g); - g->gcstate = GCSpropagate; /* skip restart */ - if (!g->gcemergency) - callallpendingfinalizers(L); -} - - -/* -** Shifts from a minor collection to major collections. It starts in -** the "sweep all" state to clear all objects, which are mostly black -** in generational mode. -*/ -static void minor2inc (lua_State *L, global_State *g, int kind) { - g->GCmajorminor = g->marked; /* number of live objects */ - g->gckind = kind; - g->reallyold = g->old1 = g->survival = NULL; - g->finobjrold = g->finobjold1 = g->finobjsur = NULL; - entersweep(L); /* continue as an incremental cycle */ - /* set a debt equal to the step size */ - luaE_setdebt(g, applygcparam(g, STEPSIZE, 100)); -} - - -/* -** Decide whether to shift to major mode. It tests two conditions: -** 1) Whether the number of added old objects in this collection is more -** than half the number of new objects. ('step' is the number of objects -** created between minor collections. Except for forward barriers, it -** is the maximum number of objects that can become old in each minor -** collection.) -** 2) Whether the accumulated number of added old objects is larger -** than 'minormajor'% of the number of lived objects after the last -** major collection. (That percentage is computed in 'limit'.) -*/ -static int checkminormajor (global_State *g, l_obj addedold1) { - l_obj step = applygcparam(g, MINORMUL, g->GCmajorminor); - l_obj limit = applygcparam(g, MINORMAJOR, g->GCmajorminor); - return (addedold1 >= (step >> 1) || g->marked >= limit); -} - -/* -** Does a young collection. First, mark 'OLD1' objects. Then does the -** atomic step. Then, check whether to continue in minor mode. If so, -** sweep all lists and advance pointers. Finally, finish the collection. -*/ -static void youngcollection (lua_State *L, global_State *g) { - l_obj addedold1 = 0; - l_obj marked = g->marked; /* preserve 'g->marked' */ - GCObject **psurvival; /* to point to first non-dead survival object */ - GCObject *dummy; /* dummy out parameter to 'sweepgen' */ - lua_assert(g->gcstate == GCSpropagate); - if (g->firstold1) { /* are there regular OLD1 objects? */ - markold(g, g->firstold1, g->reallyold); /* mark them */ - g->firstold1 = NULL; /* no more OLD1 objects (for now) */ - } - markold(g, g->finobj, g->finobjrold); - markold(g, g->tobefnz, NULL); - - atomic(L); /* will lose 'g->marked' */ - - /* sweep nursery and get a pointer to its last live element */ - g->gcstate = GCSswpallgc; - psurvival = sweepgen(L, g, &g->allgc, g->survival, &g->firstold1, &addedold1); - /* sweep 'survival' */ - sweepgen(L, g, psurvival, g->old1, &g->firstold1, &addedold1); - g->reallyold = g->old1; - g->old1 = *psurvival; /* 'survival' survivals are old now */ - g->survival = g->allgc; /* all news are survivals */ - - /* repeat for 'finobj' lists */ - dummy = NULL; /* no 'firstold1' optimization for 'finobj' lists */ - psurvival = sweepgen(L, g, &g->finobj, g->finobjsur, &dummy, &addedold1); - /* sweep 'survival' */ - sweepgen(L, g, psurvival, g->finobjold1, &dummy, &addedold1); - g->finobjrold = g->finobjold1; - g->finobjold1 = *psurvival; /* 'survival' survivals are old now */ - g->finobjsur = g->finobj; /* all news are survivals */ - - sweepgen(L, g, &g->tobefnz, NULL, &dummy, &addedold1); - - /* keep total number of added old1 objects */ - g->marked = marked + addedold1; - - /* decide whether to shift to major mode */ - if (checkminormajor(g, addedold1)) { - minor2inc(L, g, KGC_GENMAJOR); /* go to major mode */ - g->marked = 0; /* avoid pause in first major cycle */ - } - else - finishgencycle(L, g); /* still in minor mode; finish it */ -} - - -/* -** Clears all gray lists, sweeps objects, and prepare sublists to enter -** generational mode. The sweeps remove dead objects and turn all -** surviving objects to old. Threads go back to 'grayagain'; everything -** else is turned black (not in any gray list). -*/ -static void atomic2gen (lua_State *L, global_State *g) { - cleargraylists(g); - /* sweep all elements making them old */ - g->gcstate = GCSswpallgc; - sweep2old(L, &g->allgc); - /* everything alive now is old */ - g->reallyold = g->old1 = g->survival = g->allgc; - g->firstold1 = NULL; /* there are no OLD1 objects anywhere */ - - /* repeat for 'finobj' lists */ - sweep2old(L, &g->finobj); - g->finobjrold = g->finobjold1 = g->finobjsur = g->finobj; - - sweep2old(L, &g->tobefnz); - - g->gckind = KGC_GENMINOR; - g->GCmajorminor = g->marked; /* "base" for number of objects */ - g->marked = 0; /* to count the number of added old1 objects */ - finishgencycle(L, g); -} - - -/* -** Set debt for the next minor collection, which will happen when -** total number of objects grows 'genminormul'%. -*/ -static void setminordebt (global_State *g) { - luaE_setdebt(g, applygcparam(g, MINORMUL, g->GCmajorminor)); -} - - -/* -** Enter generational mode. Must go until the end of an atomic cycle -** to ensure that all objects are correctly marked and weak tables -** are cleared. Then, turn all objects into old and finishes the -** collection. -*/ -static void entergen (lua_State *L, global_State *g) { - luaC_runtilstate(L, GCSpause, 1); /* prepare to start a new cycle */ - luaC_runtilstate(L, GCSpropagate, 1); /* start new cycle */ - atomic(L); /* propagates all and then do the atomic stuff */ - atomic2gen(L, g); - setminordebt(g); /* set debt assuming next cycle will be minor */ -} - - -/* -** Change collector mode to 'newmode'. -*/ -void luaC_changemode (lua_State *L, int newmode) { - global_State *g = G(L); - if (g->gckind == KGC_GENMAJOR) /* doing major collections? */ - g->gckind = KGC_INC; /* already incremental but in name */ - if (newmode != g->gckind) { /* does it need to change? */ - if (newmode == KGC_INC) /* entering incremental mode? */ - minor2inc(L, g, KGC_INC); /* entering incremental mode */ - else { - lua_assert(newmode == KGC_GENMINOR); - entergen(L, g); - } - } -} - - -/* -** Does a full collection in generational mode. -*/ -static void fullgen (lua_State *L, global_State *g) { - minor2inc(L, g, KGC_INC); - entergen(L, g); -} - - -/* -** After an atomic incremental step from a major collection, -** check whether collector could return to minor collections. -** It checks whether the number of objects 'tobecollected' -** is greater than 'majorminor'% of the number of objects added -** since the last collection ('addedobjs'). -*/ -static int checkmajorminor (lua_State *L, global_State *g) { - if (g->gckind == KGC_GENMAJOR) { /* generational mode? */ - l_obj numobjs = gettotalobjs(g); - l_obj addedobjs = numobjs - g->GCmajorminor; - l_obj limit = applygcparam(g, MAJORMINOR, addedobjs); - l_obj tobecollected = numobjs - g->marked; - if (tobecollected > limit) { - atomic2gen(L, g); /* return to generational mode */ - setminordebt(g); - return 0; /* exit incremental collection */ - } - } - g->GCmajorminor = g->marked; /* prepare for next collection */ - return 1; /* stay doing incremental collections */ -} - -/* }====================================================== */ - - -/* -** {====================================================== -** GC control -** ======================================================= -*/ - - -/* -** Enter first sweep phase. -** The call to 'sweeptolive' makes the pointer point to an object -** inside the list (instead of to the header), so that the real sweep do -** not need to skip objects created between "now" and the start of the -** real sweep. -*/ -static void entersweep (lua_State *L) { - global_State *g = G(L); - g->gcstate = GCSswpallgc; - lua_assert(g->sweepgc == NULL); - g->sweepgc = sweeptolive(L, &g->allgc); -} - - -/* -** Delete all objects in list 'p' until (but not including) object -** 'limit'. -*/ -static void deletelist (lua_State *L, GCObject *p, GCObject *limit) { - while (p != limit) { - GCObject *next = p->next; - freeobj(L, p); - p = next; - } -} - - -/* -** Call all finalizers of the objects in the given Lua state, and -** then free all objects, except for the main thread. -*/ -void luaC_freeallobjects (lua_State *L) { - global_State *g = G(L); - g->gcstp = GCSTPCLS; /* no extra finalizers after here */ - luaC_changemode(L, KGC_INC); - separatetobefnz(g, 1); /* separate all objects with finalizers */ - lua_assert(g->finobj == NULL); - callallpendingfinalizers(L); - deletelist(L, g->allgc, obj2gco(g->mainthread)); - lua_assert(g->finobj == NULL); /* no new finalizers */ - deletelist(L, g->fixedgc, NULL); /* collect fixed objects */ - lua_assert(g->strt.nuse == 0); -} - - -static l_obj atomic (lua_State *L) { - l_obj work = 0; - global_State *g = G(L); - GCObject *origweak, *origall; - GCObject *grayagain = g->grayagain; /* save original list */ - g->grayagain = NULL; - lua_assert(g->ephemeron == NULL && g->weak == NULL); - lua_assert(!iswhite(g->mainthread)); - g->gcstate = GCSatomic; - markobject(g, L); /* mark running thread */ - /* registry and global metatables may be changed by API */ - markvalue(g, &g->l_registry); - markmt(g); /* mark global metatables */ - work += propagateall(g); /* empties 'gray' list */ - /* remark occasional upvalues of (maybe) dead threads */ - work += remarkupvals(g); - work += propagateall(g); /* propagate changes */ - g->gray = grayagain; - work += propagateall(g); /* traverse 'grayagain' list */ - work += convergeephemerons(g); - /* at this point, all strongly accessible objects are marked. */ - /* Clear values from weak tables, before checking finalizers */ - work += clearbyvalues(g, g->weak, NULL); - work += clearbyvalues(g, g->allweak, NULL); - origweak = g->weak; origall = g->allweak; - separatetobefnz(g, 0); /* separate objects to be finalized */ - work += markbeingfnz(g); /* mark objects that will be finalized */ - work += propagateall(g); /* remark, to propagate 'resurrection' */ - work += convergeephemerons(g); - /* at this point, all resurrected objects are marked. */ - /* remove dead objects from weak tables */ - work += clearbykeys(g, g->ephemeron); /* clear keys from all ephemeron */ - work += clearbykeys(g, g->allweak); /* clear keys from all 'allweak' */ - /* clear values from resurrected weak tables */ - work += clearbyvalues(g, g->weak, origweak); - work += clearbyvalues(g, g->allweak, origall); - luaS_clearcache(g); - g->currentwhite = cast_byte(otherwhite(g)); /* flip current white */ - lua_assert(g->gray == NULL); - return work; -} - - -/* -** Do a sweep step. The normal case (not fast) sweeps at most GCSWEEPMAX -** elements. The fast case sweeps the whole list. -*/ -static void sweepstep (lua_State *L, global_State *g, - int nextstate, GCObject **nextlist, int fast) { - if (g->sweepgc) - g->sweepgc = sweeplist(L, g->sweepgc, fast ? MAX_LOBJ : GCSWEEPMAX); - else { /* enter next state */ - g->gcstate = nextstate; - g->sweepgc = nextlist; - } -} - - -/* -** Performs one incremental "step" in an incremental garbage collection. -** For indivisible work, a step goes to the next state. When marking -** (propagating), a step traverses one object. When sweeping, a step -** sweeps GCSWEEPMAX objects, to avoid a big overhead for sweeping -** objects one by one. (Sweeping is inexpensive, no matter the -** object.) When 'fast' is true, 'singlestep' tries to finish a state -** "as fast as possible". In particular, it skips the propagation -** phase and leaves all objects to be traversed by the atomic phase: -** That avoids traversing twice some objects, such as theads and -** weak tables. -*/ -static l_obj singlestep (lua_State *L, int fast) { - global_State *g = G(L); - l_obj work; - lua_assert(!g->gcstopem); /* collector is not reentrant */ - g->gcstopem = 1; /* no emergency collections while collecting */ - switch (g->gcstate) { - case GCSpause: { - restartcollection(g); - g->gcstate = GCSpropagate; - work = 1; - break; - } - case GCSpropagate: { - if (fast || g->gray == NULL) { - g->gcstate = GCSenteratomic; /* finish propagate phase */ - work = 0; - } - else { - propagatemark(g); /* traverse one gray object */ - work = 1; - } - break; - } - case GCSenteratomic: { - work = atomic(L); - if (checkmajorminor(L, g)) - entersweep(L); - break; - } - case GCSswpallgc: { /* sweep "regular" objects */ - sweepstep(L, g, GCSswpfinobj, &g->finobj, fast); - work = GCSWEEPMAX; - break; - } - case GCSswpfinobj: { /* sweep objects with finalizers */ - sweepstep(L, g, GCSswptobefnz, &g->tobefnz, fast); - work = GCSWEEPMAX; - break; - } - case GCSswptobefnz: { /* sweep objects to be finalized */ - sweepstep(L, g, GCSswpend, NULL, fast); - work = GCSWEEPMAX; - break; - } - case GCSswpend: { /* finish sweeps */ - checkSizes(L, g); - g->gcstate = GCScallfin; - work = 0; - break; - } - case GCScallfin: { /* call finalizers */ - if (g->tobefnz && !g->gcemergency) { - g->gcstopem = 0; /* ok collections during finalizers */ - GCTM(L); /* call one finalizer */ - work = 1; - } - else { /* emergency mode or no more finalizers */ - g->gcstate = GCSpause; /* finish collection */ - work = 0; - } - break; - } - default: lua_assert(0); return 0; - } - g->gcstopem = 0; - return work; -} - - -/* -** Advances the garbage collector until it reaches the given state. -** (The option 'fast' is only for testing; in normal code, 'fast' -** here is always true.) -*/ -void luaC_runtilstate (lua_State *L, int state, int fast) { - global_State *g = G(L); - lua_assert(g->gckind == KGC_INC); - while (state != g->gcstate) - singlestep(L, fast); -} - - - -/* -** Performs a basic incremental step. The debt and step size are -** converted from bytes to "units of work"; then the function loops -** running single steps until adding that many units of work or -** finishing a cycle (pause state). Finally, it sets the debt that -** controls when next step will be performed. -*/ -static void incstep (lua_State *L, global_State *g) { - l_obj stepsize = applygcparam(g, STEPSIZE, 100); - l_obj work2do = applygcparam(g, STEPMUL, stepsize); - int fast = 0; - if (work2do == 0) { /* special case: do a full collection */ - work2do = MAX_LOBJ; /* do unlimited work */ - fast = 1; - } - do { /* repeat until pause or enough work */ - l_obj work = singlestep(L, fast); /* perform one single step */ - if (g->gckind == KGC_GENMINOR) /* returned to minor collections? */ - return; /* nothing else to be done here */ - work2do -= work; - } while (work2do > 0 && g->gcstate != GCSpause); - if (g->gcstate == GCSpause) - setpause(g); /* pause until next cycle */ - else - luaE_setdebt(g, stepsize); -} - -/* -** Performs a basic GC step if collector is running. (If collector is -** not running, set a reasonable debt to avoid it being called at -** every single check.) -*/ -void luaC_step (lua_State *L) { - global_State *g = G(L); - lua_assert(!g->gcemergency); - if (!gcrunning(g)) /* not running? */ - luaE_setdebt(g, 2000); - else { - switch (g->gckind) { - case KGC_INC: case KGC_GENMAJOR: - incstep(L, g); - break; - case KGC_GENMINOR: - youngcollection(L, g); - setminordebt(g); - break; - } - } -} - - -/* -** Perform a full collection in incremental mode. -** Before running the collection, check 'keepinvariant'; if it is true, -** there may be some objects marked as black, so the collector has -** to sweep all objects to turn them back to white (as white has not -** changed, nothing will be collected). -*/ -static void fullinc (lua_State *L, global_State *g) { - if (keepinvariant(g)) /* black objects? */ - entersweep(L); /* sweep everything to turn them back to white */ - /* finish any pending sweep phase to start a new cycle */ - luaC_runtilstate(L, GCSpause, 1); - luaC_runtilstate(L, GCScallfin, 1); /* run up to finalizers */ - /* 'marked' must be correct after a full GC cycle */ - lua_assert(g->marked == gettotalobjs(g)); - luaC_runtilstate(L, GCSpause, 1); /* finish collection */ - setpause(g); -} - - -/* -** Performs a full GC cycle; if 'isemergency', set a flag to avoid -** some operations which could change the interpreter state in some -** unexpected ways (running finalizers and shrinking some structures). -*/ -void luaC_fullgc (lua_State *L, int isemergency) { - global_State *g = G(L); - lua_assert(!g->gcemergency); - g->gcemergency = isemergency; /* set flag */ - switch (g->gckind) { - case KGC_GENMINOR: fullgen(L, g); break; - case KGC_INC: fullinc(L, g); break; - case KGC_GENMAJOR: - g->gckind = KGC_INC; - fullinc(L, g); - g->gckind = KGC_GENMAJOR; - break; - } - g->gcemergency = 0; -} - -/* }====================================================== */ - - diff --git a/src/dependencies/lua/lgc.h b/src/dependencies/lua/lgc.h deleted file mode 100644 index 5e47411..0000000 --- a/src/dependencies/lua/lgc.h +++ /dev/null @@ -1,249 +0,0 @@ -/* -** $Id: lgc.h $ -** Garbage Collector -** See Copyright Notice in lua.h -*/ - -#ifndef lgc_h -#define lgc_h - - -#include - - -#include "lobject.h" -#include "lstate.h" - -/* -** Collectable objects may have one of three colors: white, which means -** the object is not marked; gray, which means the object is marked, but -** its references may be not marked; and black, which means that the -** object and all its references are marked. The main invariant of the -** garbage collector, while marking objects, is that a black object can -** never point to a white one. Moreover, any gray object must be in a -** "gray list" (gray, grayagain, weak, allweak, ephemeron) so that it -** can be visited again before finishing the collection cycle. (Open -** upvalues are an exception to this rule.) These lists have no meaning -** when the invariant is not being enforced (e.g., sweep phase). -*/ - - -/* -** Possible states of the Garbage Collector -*/ -#define GCSpropagate 0 -#define GCSenteratomic 1 -#define GCSatomic 2 -#define GCSswpallgc 3 -#define GCSswpfinobj 4 -#define GCSswptobefnz 5 -#define GCSswpend 6 -#define GCScallfin 7 -#define GCSpause 8 - - -#define issweepphase(g) \ - (GCSswpallgc <= (g)->gcstate && (g)->gcstate <= GCSswpend) - - -/* -** macro to tell when main invariant (white objects cannot point to black -** ones) must be kept. During a collection, the sweep -** phase may break the invariant, as objects turned white may point to -** still-black objects. The invariant is restored when sweep ends and -** all objects are white again. -*/ - -#define keepinvariant(g) ((g)->gcstate <= GCSatomic) - - -/* -** some useful bit tricks -*/ -#define resetbits(x,m) ((x) &= cast_byte(~(m))) -#define setbits(x,m) ((x) |= (m)) -#define testbits(x,m) ((x) & (m)) -#define bitmask(b) (1<<(b)) -#define bit2mask(b1,b2) (bitmask(b1) | bitmask(b2)) -#define l_setbit(x,b) setbits(x, bitmask(b)) -#define resetbit(x,b) resetbits(x, bitmask(b)) -#define testbit(x,b) testbits(x, bitmask(b)) - - -/* -** Layout for bit use in 'marked' field. First three bits are -** used for object "age" in generational mode. Last bit is used -** by tests. -*/ -#define WHITE0BIT 3 /* object is white (type 0) */ -#define WHITE1BIT 4 /* object is white (type 1) */ -#define BLACKBIT 5 /* object is black */ -#define FINALIZEDBIT 6 /* object has been marked for finalization */ - -#define TESTBIT 7 - - - -#define WHITEBITS bit2mask(WHITE0BIT, WHITE1BIT) - - -#define iswhite(x) testbits((x)->marked, WHITEBITS) -#define isblack(x) testbit((x)->marked, BLACKBIT) -#define isgray(x) /* neither white nor black */ \ - (!testbits((x)->marked, WHITEBITS | bitmask(BLACKBIT))) - -#define tofinalize(x) testbit((x)->marked, FINALIZEDBIT) - -#define otherwhite(g) ((g)->currentwhite ^ WHITEBITS) -#define isdeadm(ow,m) ((m) & (ow)) -#define isdead(g,v) isdeadm(otherwhite(g), (v)->marked) - -#define changewhite(x) ((x)->marked ^= WHITEBITS) -#define nw2black(x) \ - check_exp(!iswhite(x), l_setbit((x)->marked, BLACKBIT)) - -#define luaC_white(g) cast_byte((g)->currentwhite & WHITEBITS) - - -/* object age in generational mode */ -#define G_NEW 0 /* created in current cycle */ -#define G_SURVIVAL 1 /* created in previous cycle */ -#define G_OLD0 2 /* marked old by frw. barrier in this cycle */ -#define G_OLD1 3 /* first full cycle as old */ -#define G_OLD 4 /* really old object (not to be visited) */ -#define G_TOUCHED1 5 /* old object touched this cycle */ -#define G_TOUCHED2 6 /* old object touched in previous cycle */ - -#define AGEBITS 7 /* all age bits (111) */ - -#define getage(o) ((o)->marked & AGEBITS) -#define setage(o,a) ((o)->marked = cast_byte(((o)->marked & (~AGEBITS)) | a)) -#define isold(o) (getage(o) > G_SURVIVAL) - - -/* -** In generational mode, objects are created 'new'. After surviving one -** cycle, they become 'survival'. Both 'new' and 'survival' can point -** to any other object, as they are traversed at the end of the cycle. -** We call them both 'young' objects. -** If a survival object survives another cycle, it becomes 'old1'. -** 'old1' objects can still point to survival objects (but not to -** new objects), so they still must be traversed. After another cycle -** (that, being old, 'old1' objects will "survive" no matter what) -** finally the 'old1' object becomes really 'old', and then they -** are no more traversed. -** -** To keep its invariants, the generational mode uses the same barriers -** also used by the incremental mode. If a young object is caught in a -** foward barrier, it cannot become old immediately, because it can -** still point to other young objects. Instead, it becomes 'old0', -** which in the next cycle becomes 'old1'. So, 'old0' objects is -** old but can point to new and survival objects; 'old1' is old -** but cannot point to new objects; and 'old' cannot point to any -** young object. -** -** If any old object ('old0', 'old1', 'old') is caught in a back -** barrier, it becomes 'touched1' and goes into a gray list, to be -** visited at the end of the cycle. There it evolves to 'touched2', -** which can point to survivals but not to new objects. In yet another -** cycle then it becomes 'old' again. -** -** The generational mode must also control the colors of objects, -** because of the barriers. While the mutator is running, young objects -** are kept white. 'old', 'old1', and 'touched2' objects are kept black, -** as they cannot point to new objects; exceptions are threads and open -** upvalues, which age to 'old1' and 'old' but are kept gray. 'old0' -** objects may be gray or black, as in the incremental mode. 'touched1' -** objects are kept gray, as they must be visited again at the end of -** the cycle. -*/ - - -/* Default Values for GC parameters */ - -/* -** Minor collections will shift to major ones after LUAI_MINORMAJOR% -** objects become old. -*/ -#define LUAI_MINORMAJOR 100 - -/* -** Major collections will shift to minor ones after a collection -** collects at least LUAI_MAJORMINOR% of the new objects. -*/ -#define LUAI_MAJORMINOR 50 - -/* -** A young (minor) collection will run after creating LUAI_GENMINORMUL% -** new objects. -*/ -#define LUAI_GENMINORMUL 25 - - -/* incremental */ - -/* Number of objects must be LUAI_GCPAUSE% before starting new cycle */ -#define LUAI_GCPAUSE 200 - -/* Step multiplier. (Roughly, the collector handles LUAI_GCMUL% objects - for each new allocated object.) */ -#define LUAI_GCMUL 200 - -/* How many objects to allocate before next GC step */ -#define LUAI_GCSTEPSIZE 250 - - -#define setgcparam(g,p,v) (g->gcparams[LUA_GCP##p] = luaO_codeparam(v)) -#define applygcparam(g,p,x) luaO_applyparam(g->gcparams[LUA_GCP##p], x) - -/* -** Control when GC is running: -*/ -#define GCSTPUSR 1 /* bit true when GC stopped by user */ -#define GCSTPGC 2 /* bit true when GC stopped by itself */ -#define GCSTPCLS 4 /* bit true when closing Lua state */ -#define gcrunning(g) ((g)->gcstp == 0) - - -/* -** Does one step of collection when debt becomes zero. 'pre'/'pos' -** allows some adjustments to be done only when needed. macro -** 'condchangemem' is used only for heavy tests (forcing a full -** GC cycle on every opportunity) -*/ -#define luaC_condGC(L,pre,pos) \ - { if (G(L)->GCdebt <= 0) { pre; luaC_step(L); pos;}; \ - condchangemem(L,pre,pos); } - -/* more often than not, 'pre'/'pos' are empty */ -#define luaC_checkGC(L) luaC_condGC(L,(void)0,(void)0) - - -#define luaC_objbarrier(L,p,o) ( \ - (isblack(p) && iswhite(o)) ? \ - luaC_barrier_(L,obj2gco(p),obj2gco(o)) : cast_void(0)) - -#define luaC_barrier(L,p,v) ( \ - iscollectable(v) ? luaC_objbarrier(L,p,gcvalue(v)) : cast_void(0)) - -#define luaC_objbarrierback(L,p,o) ( \ - (isblack(p) && iswhite(o)) ? luaC_barrierback_(L,p) : cast_void(0)) - -#define luaC_barrierback(L,p,v) ( \ - iscollectable(v) ? luaC_objbarrierback(L, p, gcvalue(v)) : cast_void(0)) - -LUAI_FUNC void luaC_fix (lua_State *L, GCObject *o); -LUAI_FUNC void luaC_freeallobjects (lua_State *L); -LUAI_FUNC void luaC_step (lua_State *L); -LUAI_FUNC void luaC_runtilstate (lua_State *L, int state, int fast); -LUAI_FUNC void luaC_fullgc (lua_State *L, int isemergency); -LUAI_FUNC GCObject *luaC_newobj (lua_State *L, int tt, size_t sz); -LUAI_FUNC GCObject *luaC_newobjdt (lua_State *L, int tt, size_t sz, - size_t offset); -LUAI_FUNC void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v); -LUAI_FUNC void luaC_barrierback_ (lua_State *L, GCObject *o); -LUAI_FUNC void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt); -LUAI_FUNC void luaC_changemode (lua_State *L, int newmode); - - -#endif diff --git a/src/dependencies/lua/linit.c b/src/dependencies/lua/linit.c deleted file mode 100644 index 140f6d7..0000000 --- a/src/dependencies/lua/linit.c +++ /dev/null @@ -1,62 +0,0 @@ -/* -** $Id: linit.c $ -** Initialization of libraries for lua.c and other clients -** See Copyright Notice in lua.h -*/ - - -#define linit_c -#define LUA_LIB - - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "lualib.h" -#include "lauxlib.h" - - -/* -** Standard Libraries. (Must be listed in the same ORDER of their -** respective constants LUA_K.) -*/ -static const luaL_Reg stdlibs[] = { - {LUA_GNAME, luaopen_base}, - {LUA_LOADLIBNAME, luaopen_package}, - {LUA_COLIBNAME, luaopen_coroutine}, - {LUA_DBLIBNAME, luaopen_debug}, - {LUA_IOLIBNAME, luaopen_io}, - {LUA_MATHLIBNAME, luaopen_math}, - {LUA_OSLIBNAME, luaopen_os}, - {LUA_STRLIBNAME, luaopen_string}, - {LUA_TABLIBNAME, luaopen_table}, - {LUA_UTF8LIBNAME, luaopen_utf8}, - {NULL, NULL} -}; - - -/* -** require and preload selected standard libraries -*/ -LUALIB_API void luaL_openselectedlibs (lua_State *L, int load, int preload) { - int mask; - const luaL_Reg *lib; - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - for (lib = stdlibs, mask = 1; lib->name != NULL; lib++, mask <<= 1) { - if (load & mask) { /* selected? */ - luaL_requiref(L, lib->name, lib->func, 1); /* require library */ - lua_pop(L, 1); /* remove result from the stack */ - } - else if (preload & mask) { /* selected? */ - lua_pushcfunction(L, lib->func); - lua_setfield(L, -2, lib->name); /* add library to PRELOAD table */ - } - } - lua_assert((mask >> 1) == LUA_UTF8LIBK); - lua_pop(L, 1); /* remove PRELOAD table */ -} - diff --git a/src/dependencies/lua/liolib.c b/src/dependencies/lua/liolib.c deleted file mode 100644 index b08397d..0000000 --- a/src/dependencies/lua/liolib.c +++ /dev/null @@ -1,828 +0,0 @@ -/* -** $Id: liolib.c $ -** Standard I/O (and system) library -** See Copyright Notice in lua.h -*/ - -#define liolib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - - - -/* -** Change this macro to accept other modes for 'fopen' besides -** the standard ones. -*/ -#if !defined(l_checkmode) - -/* accepted extensions to 'mode' in 'fopen' */ -#if !defined(L_MODEEXT) -#define L_MODEEXT "b" -#endif - -/* Check whether 'mode' matches '[rwa]%+?[L_MODEEXT]*' */ -static int l_checkmode (const char *mode) { - return (*mode != '\0' && strchr("rwa", *(mode++)) != NULL && - (*mode != '+' || ((void)(++mode), 1)) && /* skip if char is '+' */ - (strspn(mode, L_MODEEXT) == strlen(mode))); /* check extensions */ -} - -#endif - -/* -** {====================================================== -** l_popen spawns a new process connected to the current -** one through the file streams. -** ======================================================= -*/ - -#if !defined(l_popen) /* { */ - -#if defined(LUA_USE_POSIX) /* { */ - -#define l_popen(L,c,m) (fflush(NULL), popen(c,m)) -#define l_pclose(L,file) (pclose(file)) - -#elif defined(LUA_USE_WINDOWS) /* }{ */ - -#define l_popen(L,c,m) (_popen(c,m)) -#define l_pclose(L,file) (_pclose(file)) - -#if !defined(l_checkmodep) -/* Windows accepts "[rw][bt]?" as valid modes */ -#define l_checkmodep(m) ((m[0] == 'r' || m[0] == 'w') && \ - (m[1] == '\0' || ((m[1] == 'b' || m[1] == 't') && m[2] == '\0'))) -#endif - -#else /* }{ */ - -/* ISO C definitions */ -#define l_popen(L,c,m) \ - ((void)c, (void)m, \ - luaL_error(L, "'popen' not supported"), \ - (FILE*)0) -#define l_pclose(L,file) ((void)L, (void)file, -1) - -#endif /* } */ - -#endif /* } */ - - -#if !defined(l_checkmodep) -/* By default, Lua accepts only "r" or "w" as valid modes */ -#define l_checkmodep(m) ((m[0] == 'r' || m[0] == 'w') && m[1] == '\0') -#endif - -/* }====================================================== */ - - -#if !defined(l_getc) /* { */ - -#if defined(LUA_USE_POSIX) -#define l_getc(f) getc_unlocked(f) -#define l_lockfile(f) flockfile(f) -#define l_unlockfile(f) funlockfile(f) -#else -#define l_getc(f) getc(f) -#define l_lockfile(f) ((void)0) -#define l_unlockfile(f) ((void)0) -#endif - -#endif /* } */ - - -/* -** {====================================================== -** l_fseek: configuration for longer offsets -** ======================================================= -*/ - -#if !defined(l_fseek) /* { */ - -#if defined(LUA_USE_POSIX) /* { */ - -#include - -#define l_fseek(f,o,w) fseeko(f,o,w) -#define l_ftell(f) ftello(f) -#define l_seeknum off_t - -#elif defined(LUA_USE_WINDOWS) && !defined(_CRTIMP_TYPEINFO) \ - && defined(_MSC_VER) && (_MSC_VER >= 1400) /* }{ */ - -/* Windows (but not DDK) and Visual C++ 2005 or higher */ -#define l_fseek(f,o,w) _fseeki64(f,o,w) -#define l_ftell(f) _ftelli64(f) -#define l_seeknum __int64 - -#else /* }{ */ - -/* ISO C definitions */ -#define l_fseek(f,o,w) fseek(f,o,w) -#define l_ftell(f) ftell(f) -#define l_seeknum long - -#endif /* } */ - -#endif /* } */ - -/* }====================================================== */ - - - -#define IO_PREFIX "_IO_" -#define IOPREF_LEN (sizeof(IO_PREFIX)/sizeof(char) - 1) -#define IO_INPUT (IO_PREFIX "input") -#define IO_OUTPUT (IO_PREFIX "output") - - -typedef luaL_Stream LStream; - - -#define tolstream(L) ((LStream *)luaL_checkudata(L, 1, LUA_FILEHANDLE)) - -#define isclosed(p) ((p)->closef == NULL) - - -static int io_type (lua_State *L) { - LStream *p; - luaL_checkany(L, 1); - p = (LStream *)luaL_testudata(L, 1, LUA_FILEHANDLE); - if (p == NULL) - luaL_pushfail(L); /* not a file */ - else if (isclosed(p)) - lua_pushliteral(L, "closed file"); - else - lua_pushliteral(L, "file"); - return 1; -} - - -static int f_tostring (lua_State *L) { - LStream *p = tolstream(L); - if (isclosed(p)) - lua_pushliteral(L, "file (closed)"); - else - lua_pushfstring(L, "file (%p)", p->f); - return 1; -} - - -static FILE *tofile (lua_State *L) { - LStream *p = tolstream(L); - if (l_unlikely(isclosed(p))) - luaL_error(L, "attempt to use a closed file"); - lua_assert(p->f); - return p->f; -} - - -/* -** When creating file handles, always creates a 'closed' file handle -** before opening the actual file; so, if there is a memory error, the -** handle is in a consistent state. -*/ -static LStream *newprefile (lua_State *L) { - LStream *p = (LStream *)lua_newuserdatauv(L, sizeof(LStream), 0); - p->closef = NULL; /* mark file handle as 'closed' */ - luaL_setmetatable(L, LUA_FILEHANDLE); - return p; -} - - -/* -** Calls the 'close' function from a file handle. The 'volatile' avoids -** a bug in some versions of the Clang compiler (e.g., clang 3.0 for -** 32 bits). -*/ -static int aux_close (lua_State *L) { - LStream *p = tolstream(L); - volatile lua_CFunction cf = p->closef; - p->closef = NULL; /* mark stream as closed */ - return (*cf)(L); /* close it */ -} - - -static int f_close (lua_State *L) { - tofile(L); /* make sure argument is an open stream */ - return aux_close(L); -} - - -static int io_close (lua_State *L) { - if (lua_isnone(L, 1)) /* no argument? */ - lua_getfield(L, LUA_REGISTRYINDEX, IO_OUTPUT); /* use default output */ - return f_close(L); -} - - -static int f_gc (lua_State *L) { - LStream *p = tolstream(L); - if (!isclosed(p) && p->f != NULL) - aux_close(L); /* ignore closed and incompletely open files */ - return 0; -} - - -/* -** function to close regular files -*/ -static int io_fclose (lua_State *L) { - LStream *p = tolstream(L); - int res = fclose(p->f); - return luaL_fileresult(L, (res == 0), NULL); -} - - -static LStream *newfile (lua_State *L) { - LStream *p = newprefile(L); - p->f = NULL; - p->closef = &io_fclose; - return p; -} - - -static void opencheck (lua_State *L, const char *fname, const char *mode) { - LStream *p = newfile(L); - p->f = fopen(fname, mode); - if (l_unlikely(p->f == NULL)) - luaL_error(L, "cannot open file '%s' (%s)", fname, strerror(errno)); -} - - -static int io_open (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - const char *mode = luaL_optstring(L, 2, "r"); - LStream *p = newfile(L); - const char *md = mode; /* to traverse/check mode */ - luaL_argcheck(L, l_checkmode(md), 2, "invalid mode"); - p->f = fopen(filename, mode); - return (p->f == NULL) ? luaL_fileresult(L, 0, filename) : 1; -} - - -/* -** function to close 'popen' files -*/ -static int io_pclose (lua_State *L) { - LStream *p = tolstream(L); - errno = 0; - return luaL_execresult(L, l_pclose(L, p->f)); -} - - -static int io_popen (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - const char *mode = luaL_optstring(L, 2, "r"); - LStream *p = newprefile(L); - luaL_argcheck(L, l_checkmodep(mode), 2, "invalid mode"); - p->f = l_popen(L, filename, mode); - p->closef = &io_pclose; - return (p->f == NULL) ? luaL_fileresult(L, 0, filename) : 1; -} - - -static int io_tmpfile (lua_State *L) { - LStream *p = newfile(L); - p->f = tmpfile(); - return (p->f == NULL) ? luaL_fileresult(L, 0, NULL) : 1; -} - - -static FILE *getiofile (lua_State *L, const char *findex) { - LStream *p; - lua_getfield(L, LUA_REGISTRYINDEX, findex); - p = (LStream *)lua_touserdata(L, -1); - if (l_unlikely(isclosed(p))) - luaL_error(L, "default %s file is closed", findex + IOPREF_LEN); - return p->f; -} - - -static int g_iofile (lua_State *L, const char *f, const char *mode) { - if (!lua_isnoneornil(L, 1)) { - const char *filename = lua_tostring(L, 1); - if (filename) - opencheck(L, filename, mode); - else { - tofile(L); /* check that it's a valid file handle */ - lua_pushvalue(L, 1); - } - lua_setfield(L, LUA_REGISTRYINDEX, f); - } - /* return current value */ - lua_getfield(L, LUA_REGISTRYINDEX, f); - return 1; -} - - -static int io_input (lua_State *L) { - return g_iofile(L, IO_INPUT, "r"); -} - - -static int io_output (lua_State *L) { - return g_iofile(L, IO_OUTPUT, "w"); -} - - -static int io_readline (lua_State *L); - - -/* -** maximum number of arguments to 'f:lines'/'io.lines' (it + 3 must fit -** in the limit for upvalues of a closure) -*/ -#define MAXARGLINE 250 - -/* -** Auxiliary function to create the iteration function for 'lines'. -** The iteration function is a closure over 'io_readline', with -** the following upvalues: -** 1) The file being read (first value in the stack) -** 2) the number of arguments to read -** 3) a boolean, true iff file has to be closed when finished ('toclose') -** *) a variable number of format arguments (rest of the stack) -*/ -static void aux_lines (lua_State *L, int toclose) { - int n = lua_gettop(L) - 1; /* number of arguments to read */ - luaL_argcheck(L, n <= MAXARGLINE, MAXARGLINE + 2, "too many arguments"); - lua_pushvalue(L, 1); /* file */ - lua_pushinteger(L, n); /* number of arguments to read */ - lua_pushboolean(L, toclose); /* close/not close file when finished */ - lua_rotate(L, 2, 3); /* move the three values to their positions */ - lua_pushcclosure(L, io_readline, 3 + n); -} - - -static int f_lines (lua_State *L) { - tofile(L); /* check that it's a valid file handle */ - aux_lines(L, 0); - return 1; -} - - -/* -** Return an iteration function for 'io.lines'. If file has to be -** closed, also returns the file itself as a second result (to be -** closed as the state at the exit of a generic for). -*/ -static int io_lines (lua_State *L) { - int toclose; - if (lua_isnone(L, 1)) lua_pushnil(L); /* at least one argument */ - if (lua_isnil(L, 1)) { /* no file name? */ - lua_getfield(L, LUA_REGISTRYINDEX, IO_INPUT); /* get default input */ - lua_replace(L, 1); /* put it at index 1 */ - tofile(L); /* check that it's a valid file handle */ - toclose = 0; /* do not close it after iteration */ - } - else { /* open a new file */ - const char *filename = luaL_checkstring(L, 1); - opencheck(L, filename, "r"); - lua_replace(L, 1); /* put file at index 1 */ - toclose = 1; /* close it after iteration */ - } - aux_lines(L, toclose); /* push iteration function */ - if (toclose) { - lua_pushnil(L); /* state */ - lua_pushnil(L); /* control */ - lua_pushvalue(L, 1); /* file is the to-be-closed variable (4th result) */ - return 4; - } - else - return 1; -} - - -/* -** {====================================================== -** READ -** ======================================================= -*/ - - -/* maximum length of a numeral */ -#if !defined (L_MAXLENNUM) -#define L_MAXLENNUM 200 -#endif - - -/* auxiliary structure used by 'read_number' */ -typedef struct { - FILE *f; /* file being read */ - int c; /* current character (look ahead) */ - int n; /* number of elements in buffer 'buff' */ - char buff[L_MAXLENNUM + 1]; /* +1 for ending '\0' */ -} RN; - - -/* -** Add current char to buffer (if not out of space) and read next one -*/ -static int nextc (RN *rn) { - if (l_unlikely(rn->n >= L_MAXLENNUM)) { /* buffer overflow? */ - rn->buff[0] = '\0'; /* invalidate result */ - return 0; /* fail */ - } - else { - rn->buff[rn->n++] = rn->c; /* save current char */ - rn->c = l_getc(rn->f); /* read next one */ - return 1; - } -} - - -/* -** Accept current char if it is in 'set' (of size 2) -*/ -static int test2 (RN *rn, const char *set) { - if (rn->c == set[0] || rn->c == set[1]) - return nextc(rn); - else return 0; -} - - -/* -** Read a sequence of (hex)digits -*/ -static int readdigits (RN *rn, int hex) { - int count = 0; - while ((hex ? isxdigit(rn->c) : isdigit(rn->c)) && nextc(rn)) - count++; - return count; -} - - -/* -** Read a number: first reads a valid prefix of a numeral into a buffer. -** Then it calls 'lua_stringtonumber' to check whether the format is -** correct and to convert it to a Lua number. -*/ -static int read_number (lua_State *L, FILE *f) { - RN rn; - int count = 0; - int hex = 0; - char decp[2]; - rn.f = f; rn.n = 0; - decp[0] = lua_getlocaledecpoint(); /* get decimal point from locale */ - decp[1] = '.'; /* always accept a dot */ - l_lockfile(rn.f); - do { rn.c = l_getc(rn.f); } while (isspace(rn.c)); /* skip spaces */ - test2(&rn, "-+"); /* optional sign */ - if (test2(&rn, "00")) { - if (test2(&rn, "xX")) hex = 1; /* numeral is hexadecimal */ - else count = 1; /* count initial '0' as a valid digit */ - } - count += readdigits(&rn, hex); /* integral part */ - if (test2(&rn, decp)) /* decimal point? */ - count += readdigits(&rn, hex); /* fractional part */ - if (count > 0 && test2(&rn, (hex ? "pP" : "eE"))) { /* exponent mark? */ - test2(&rn, "-+"); /* exponent sign */ - readdigits(&rn, 0); /* exponent digits */ - } - ungetc(rn.c, rn.f); /* unread look-ahead char */ - l_unlockfile(rn.f); - rn.buff[rn.n] = '\0'; /* finish string */ - if (l_likely(lua_stringtonumber(L, rn.buff))) - return 1; /* ok, it is a valid number */ - else { /* invalid format */ - lua_pushnil(L); /* "result" to be removed */ - return 0; /* read fails */ - } -} - - -static int test_eof (lua_State *L, FILE *f) { - int c = getc(f); - ungetc(c, f); /* no-op when c == EOF */ - lua_pushliteral(L, ""); - return (c != EOF); -} - - -static int read_line (lua_State *L, FILE *f, int chop) { - luaL_Buffer b; - int c; - luaL_buffinit(L, &b); - do { /* may need to read several chunks to get whole line */ - char *buff = luaL_prepbuffer(&b); /* preallocate buffer space */ - int i = 0; - l_lockfile(f); /* no memory errors can happen inside the lock */ - while (i < LUAL_BUFFERSIZE && (c = l_getc(f)) != EOF && c != '\n') - buff[i++] = c; /* read up to end of line or buffer limit */ - l_unlockfile(f); - luaL_addsize(&b, i); - } while (c != EOF && c != '\n'); /* repeat until end of line */ - if (!chop && c == '\n') /* want a newline and have one? */ - luaL_addchar(&b, c); /* add ending newline to result */ - luaL_pushresult(&b); /* close buffer */ - /* return ok if read something (either a newline or something else) */ - return (c == '\n' || lua_rawlen(L, -1) > 0); -} - - -static void read_all (lua_State *L, FILE *f) { - size_t nr; - luaL_Buffer b; - luaL_buffinit(L, &b); - do { /* read file in chunks of LUAL_BUFFERSIZE bytes */ - char *p = luaL_prepbuffer(&b); - nr = fread(p, sizeof(char), LUAL_BUFFERSIZE, f); - luaL_addsize(&b, nr); - } while (nr == LUAL_BUFFERSIZE); - luaL_pushresult(&b); /* close buffer */ -} - - -static int read_chars (lua_State *L, FILE *f, size_t n) { - size_t nr; /* number of chars actually read */ - char *p; - luaL_Buffer b; - luaL_buffinit(L, &b); - p = luaL_prepbuffsize(&b, n); /* prepare buffer to read whole block */ - nr = fread(p, sizeof(char), n, f); /* try to read 'n' chars */ - luaL_addsize(&b, nr); - luaL_pushresult(&b); /* close buffer */ - return (nr > 0); /* true iff read something */ -} - - -static int g_read (lua_State *L, FILE *f, int first) { - int nargs = lua_gettop(L) - 1; - int n, success; - clearerr(f); - if (nargs == 0) { /* no arguments? */ - success = read_line(L, f, 1); - n = first + 1; /* to return 1 result */ - } - else { - /* ensure stack space for all results and for auxlib's buffer */ - luaL_checkstack(L, nargs+LUA_MINSTACK, "too many arguments"); - success = 1; - for (n = first; nargs-- && success; n++) { - if (lua_type(L, n) == LUA_TNUMBER) { - size_t l = (size_t)luaL_checkinteger(L, n); - success = (l == 0) ? test_eof(L, f) : read_chars(L, f, l); - } - else { - const char *p = luaL_checkstring(L, n); - if (*p == '*') p++; /* skip optional '*' (for compatibility) */ - switch (*p) { - case 'n': /* number */ - success = read_number(L, f); - break; - case 'l': /* line */ - success = read_line(L, f, 1); - break; - case 'L': /* line with end-of-line */ - success = read_line(L, f, 0); - break; - case 'a': /* file */ - read_all(L, f); /* read entire file */ - success = 1; /* always success */ - break; - default: - return luaL_argerror(L, n, "invalid format"); - } - } - } - } - if (ferror(f)) - return luaL_fileresult(L, 0, NULL); - if (!success) { - lua_pop(L, 1); /* remove last result */ - luaL_pushfail(L); /* push nil instead */ - } - return n - first; -} - - -static int io_read (lua_State *L) { - return g_read(L, getiofile(L, IO_INPUT), 1); -} - - -static int f_read (lua_State *L) { - return g_read(L, tofile(L), 2); -} - - -/* -** Iteration function for 'lines'. -*/ -static int io_readline (lua_State *L) { - LStream *p = (LStream *)lua_touserdata(L, lua_upvalueindex(1)); - int i; - int n = (int)lua_tointeger(L, lua_upvalueindex(2)); - if (isclosed(p)) /* file is already closed? */ - return luaL_error(L, "file is already closed"); - lua_settop(L , 1); - luaL_checkstack(L, n, "too many arguments"); - for (i = 1; i <= n; i++) /* push arguments to 'g_read' */ - lua_pushvalue(L, lua_upvalueindex(3 + i)); - n = g_read(L, p->f, 2); /* 'n' is number of results */ - lua_assert(n > 0); /* should return at least a nil */ - if (lua_toboolean(L, -n)) /* read at least one value? */ - return n; /* return them */ - else { /* first result is false: EOF or error */ - if (n > 1) { /* is there error information? */ - /* 2nd result is error message */ - return luaL_error(L, "%s", lua_tostring(L, -n + 1)); - } - if (lua_toboolean(L, lua_upvalueindex(3))) { /* generator created file? */ - lua_settop(L, 0); /* clear stack */ - lua_pushvalue(L, lua_upvalueindex(1)); /* push file at index 1 */ - aux_close(L); /* close it */ - } - return 0; - } -} - -/* }====================================================== */ - - -static int g_write (lua_State *L, FILE *f, int arg) { - int nargs = lua_gettop(L) - arg; - int status = 1; - for (; nargs--; arg++) { - if (lua_type(L, arg) == LUA_TNUMBER) { - /* optimization: could be done exactly as for strings */ - int len = lua_isinteger(L, arg) - ? fprintf(f, LUA_INTEGER_FMT, - (LUAI_UACINT)lua_tointeger(L, arg)) - : fprintf(f, LUA_NUMBER_FMT, - (LUAI_UACNUMBER)lua_tonumber(L, arg)); - status = status && (len > 0); - } - else { - size_t l; - const char *s = luaL_checklstring(L, arg, &l); - status = status && (fwrite(s, sizeof(char), l, f) == l); - } - } - if (l_likely(status)) - return 1; /* file handle already on stack top */ - else return luaL_fileresult(L, status, NULL); -} - - -static int io_write (lua_State *L) { - return g_write(L, getiofile(L, IO_OUTPUT), 1); -} - - -static int f_write (lua_State *L) { - FILE *f = tofile(L); - lua_pushvalue(L, 1); /* push file at the stack top (to be returned) */ - return g_write(L, f, 2); -} - - -static int f_seek (lua_State *L) { - static const int mode[] = {SEEK_SET, SEEK_CUR, SEEK_END}; - static const char *const modenames[] = {"set", "cur", "end", NULL}; - FILE *f = tofile(L); - int op = luaL_checkoption(L, 2, "cur", modenames); - lua_Integer p3 = luaL_optinteger(L, 3, 0); - l_seeknum offset = (l_seeknum)p3; - luaL_argcheck(L, (lua_Integer)offset == p3, 3, - "not an integer in proper range"); - op = l_fseek(f, offset, mode[op]); - if (l_unlikely(op)) - return luaL_fileresult(L, 0, NULL); /* error */ - else { - lua_pushinteger(L, (lua_Integer)l_ftell(f)); - return 1; - } -} - - -static int f_setvbuf (lua_State *L) { - static const int mode[] = {_IONBF, _IOFBF, _IOLBF}; - static const char *const modenames[] = {"no", "full", "line", NULL}; - FILE *f = tofile(L); - int op = luaL_checkoption(L, 2, NULL, modenames); - lua_Integer sz = luaL_optinteger(L, 3, LUAL_BUFFERSIZE); - int res = setvbuf(f, NULL, mode[op], (size_t)sz); - return luaL_fileresult(L, res == 0, NULL); -} - - - -static int io_flush (lua_State *L) { - return luaL_fileresult(L, fflush(getiofile(L, IO_OUTPUT)) == 0, NULL); -} - - -static int f_flush (lua_State *L) { - return luaL_fileresult(L, fflush(tofile(L)) == 0, NULL); -} - - -/* -** functions for 'io' library -*/ -static const luaL_Reg iolib[] = { - {"close", io_close}, - {"flush", io_flush}, - {"input", io_input}, - {"lines", io_lines}, - {"open", io_open}, - {"output", io_output}, - {"popen", io_popen}, - {"read", io_read}, - {"tmpfile", io_tmpfile}, - {"type", io_type}, - {"write", io_write}, - {NULL, NULL} -}; - - -/* -** methods for file handles -*/ -static const luaL_Reg meth[] = { - {"read", f_read}, - {"write", f_write}, - {"lines", f_lines}, - {"flush", f_flush}, - {"seek", f_seek}, - {"close", f_close}, - {"setvbuf", f_setvbuf}, - {NULL, NULL} -}; - - -/* -** metamethods for file handles -*/ -static const luaL_Reg metameth[] = { - {"__index", NULL}, /* place holder */ - {"__gc", f_gc}, - {"__close", f_gc}, - {"__tostring", f_tostring}, - {NULL, NULL} -}; - - -static void createmeta (lua_State *L) { - luaL_newmetatable(L, LUA_FILEHANDLE); /* metatable for file handles */ - luaL_setfuncs(L, metameth, 0); /* add metamethods to new metatable */ - luaL_newlibtable(L, meth); /* create method table */ - luaL_setfuncs(L, meth, 0); /* add file methods to method table */ - lua_setfield(L, -2, "__index"); /* metatable.__index = method table */ - lua_pop(L, 1); /* pop metatable */ -} - - -/* -** function to (not) close the standard files stdin, stdout, and stderr -*/ -static int io_noclose (lua_State *L) { - LStream *p = tolstream(L); - p->closef = &io_noclose; /* keep file opened */ - luaL_pushfail(L); - lua_pushliteral(L, "cannot close standard file"); - return 2; -} - - -static void createstdfile (lua_State *L, FILE *f, const char *k, - const char *fname) { - LStream *p = newprefile(L); - p->f = f; - p->closef = &io_noclose; - if (k != NULL) { - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, k); /* add file to registry */ - } - lua_setfield(L, -2, fname); /* add file to module */ -} - - -LUAMOD_API int luaopen_io (lua_State *L) { - luaL_newlib(L, iolib); /* new module */ - createmeta(L); - /* create (and set) default files */ - createstdfile(L, stdin, IO_INPUT, "stdin"); - createstdfile(L, stdout, IO_OUTPUT, "stdout"); - createstdfile(L, stderr, NULL, "stderr"); - return 1; -} - diff --git a/src/dependencies/lua/ljumptab.h b/src/dependencies/lua/ljumptab.h deleted file mode 100644 index 8306f25..0000000 --- a/src/dependencies/lua/ljumptab.h +++ /dev/null @@ -1,112 +0,0 @@ -/* -** $Id: ljumptab.h $ -** Jump Table for the Lua interpreter -** See Copyright Notice in lua.h -*/ - - -#undef vmdispatch -#undef vmcase -#undef vmbreak - -#define vmdispatch(x) goto *disptab[x]; - -#define vmcase(l) L_##l: - -#define vmbreak vmfetch(); vmdispatch(GET_OPCODE(i)); - - -static const void *const disptab[NUM_OPCODES] = { - -#if 0 -** you can update the following list with this command: -** -** sed -n '/^OP_/\!d; s/OP_/\&\&L_OP_/ ; s/,.*/,/ ; s/\/.*// ; p' lopcodes.h -** -#endif - -&&L_OP_MOVE, -&&L_OP_LOADI, -&&L_OP_LOADF, -&&L_OP_LOADK, -&&L_OP_LOADKX, -&&L_OP_LOADFALSE, -&&L_OP_LFALSESKIP, -&&L_OP_LOADTRUE, -&&L_OP_LOADNIL, -&&L_OP_GETUPVAL, -&&L_OP_SETUPVAL, -&&L_OP_GETTABUP, -&&L_OP_GETTABLE, -&&L_OP_GETI, -&&L_OP_GETFIELD, -&&L_OP_SETTABUP, -&&L_OP_SETTABLE, -&&L_OP_SETI, -&&L_OP_SETFIELD, -&&L_OP_NEWTABLE, -&&L_OP_SELF, -&&L_OP_ADDI, -&&L_OP_ADDK, -&&L_OP_SUBK, -&&L_OP_MULK, -&&L_OP_MODK, -&&L_OP_POWK, -&&L_OP_DIVK, -&&L_OP_IDIVK, -&&L_OP_BANDK, -&&L_OP_BORK, -&&L_OP_BXORK, -&&L_OP_SHRI, -&&L_OP_SHLI, -&&L_OP_ADD, -&&L_OP_SUB, -&&L_OP_MUL, -&&L_OP_MOD, -&&L_OP_POW, -&&L_OP_DIV, -&&L_OP_IDIV, -&&L_OP_BAND, -&&L_OP_BOR, -&&L_OP_BXOR, -&&L_OP_SHL, -&&L_OP_SHR, -&&L_OP_MMBIN, -&&L_OP_MMBINI, -&&L_OP_MMBINK, -&&L_OP_UNM, -&&L_OP_BNOT, -&&L_OP_NOT, -&&L_OP_LEN, -&&L_OP_CONCAT, -&&L_OP_CLOSE, -&&L_OP_TBC, -&&L_OP_JMP, -&&L_OP_EQ, -&&L_OP_LT, -&&L_OP_LE, -&&L_OP_EQK, -&&L_OP_EQI, -&&L_OP_LTI, -&&L_OP_LEI, -&&L_OP_GTI, -&&L_OP_GEI, -&&L_OP_TEST, -&&L_OP_TESTSET, -&&L_OP_CALL, -&&L_OP_TAILCALL, -&&L_OP_RETURN, -&&L_OP_RETURN0, -&&L_OP_RETURN1, -&&L_OP_FORLOOP, -&&L_OP_FORPREP, -&&L_OP_TFORPREP, -&&L_OP_TFORCALL, -&&L_OP_TFORLOOP, -&&L_OP_SETLIST, -&&L_OP_CLOSURE, -&&L_OP_VARARG, -&&L_OP_VARARGPREP, -&&L_OP_EXTRAARG - -}; diff --git a/src/dependencies/lua/llex.c b/src/dependencies/lua/llex.c deleted file mode 100644 index 9f20d3c..0000000 --- a/src/dependencies/lua/llex.c +++ /dev/null @@ -1,581 +0,0 @@ -/* -** $Id: llex.c $ -** Lexical Analyzer -** See Copyright Notice in lua.h -*/ - -#define llex_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "lctype.h" -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "llex.h" -#include "lobject.h" -#include "lparser.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "lzio.h" - - - -#define next(ls) (ls->current = zgetc(ls->z)) - - - -#define currIsNewline(ls) (ls->current == '\n' || ls->current == '\r') - - -/* ORDER RESERVED */ -static const char *const luaX_tokens [] = { - "and", "break", "do", "else", "elseif", - "end", "false", "for", "function", "goto", "if", - "in", "local", "nil", "not", "or", "repeat", - "return", "then", "true", "until", "while", - "//", "..", "...", "==", ">=", "<=", "~=", - "<<", ">>", "::", "", - "", "", "", "" -}; - - -#define save_and_next(ls) (save(ls, ls->current), next(ls)) - - -static l_noret lexerror (LexState *ls, const char *msg, int token); - - -static void save (LexState *ls, int c) { - Mbuffer *b = ls->buff; - if (luaZ_bufflen(b) + 1 > luaZ_sizebuffer(b)) { - size_t newsize; - if (luaZ_sizebuffer(b) >= MAX_SIZE/2) - lexerror(ls, "lexical element too long", 0); - newsize = luaZ_sizebuffer(b) * 2; - luaZ_resizebuffer(ls->L, b, newsize); - } - b->buffer[luaZ_bufflen(b)++] = cast_char(c); -} - - -void luaX_init (lua_State *L) { - int i; - TString *e = luaS_newliteral(L, LUA_ENV); /* create env name */ - luaC_fix(L, obj2gco(e)); /* never collect this name */ - for (i=0; iextra = cast_byte(i+1); /* reserved word */ - } -} - - -const char *luaX_token2str (LexState *ls, int token) { - if (token < FIRST_RESERVED) { /* single-byte symbols? */ - if (lisprint(token)) - return luaO_pushfstring(ls->L, "'%c'", token); - else /* control character */ - return luaO_pushfstring(ls->L, "'<\\%d>'", token); - } - else { - const char *s = luaX_tokens[token - FIRST_RESERVED]; - if (token < TK_EOS) /* fixed format (symbols and reserved words)? */ - return luaO_pushfstring(ls->L, "'%s'", s); - else /* names, strings, and numerals */ - return s; - } -} - - -static const char *txtToken (LexState *ls, int token) { - switch (token) { - case TK_NAME: case TK_STRING: - case TK_FLT: case TK_INT: - save(ls, '\0'); - return luaO_pushfstring(ls->L, "'%s'", luaZ_buffer(ls->buff)); - default: - return luaX_token2str(ls, token); - } -} - - -static l_noret lexerror (LexState *ls, const char *msg, int token) { - msg = luaG_addinfo(ls->L, msg, ls->source, ls->linenumber); - if (token) - luaO_pushfstring(ls->L, "%s near %s", msg, txtToken(ls, token)); - luaD_throw(ls->L, LUA_ERRSYNTAX); -} - - -l_noret luaX_syntaxerror (LexState *ls, const char *msg) { - lexerror(ls, msg, ls->t.token); -} - - -/* -** Creates a new string and anchors it in scanner's table so that it -** will not be collected until the end of the compilation; by that time -** it should be anchored somewhere. It also internalizes long strings, -** ensuring there is only one copy of each unique string. The table -** here is used as a set: the string enters as the key, while its value -** is irrelevant. We use the string itself as the value only because it -** is a TValue readily available. Later, the code generation can change -** this value. -*/ -TString *luaX_newstring (LexState *ls, const char *str, size_t l) { - lua_State *L = ls->L; - TString *ts = luaS_newlstr(L, str, l); /* create new string */ - TString *oldts = luaH_getstrkey(ls->h, ts); - if (oldts != NULL) /* string already present? */ - return oldts; /* use it */ - else { /* create a new entry */ - TValue *stv = s2v(L->top.p++); /* reserve stack space for string */ - setsvalue(L, stv, ts); /* temporarily anchor the string */ - luaH_set(L, ls->h, stv, stv); /* t[string] = string */ - /* table is not a metatable, so it does not need to invalidate cache */ - luaC_checkGC(L); - L->top.p--; /* remove string from stack */ - } - return ts; -} - - -/* -** increment line number and skips newline sequence (any of -** \n, \r, \n\r, or \r\n) -*/ -static void inclinenumber (LexState *ls) { - int old = ls->current; - lua_assert(currIsNewline(ls)); - next(ls); /* skip '\n' or '\r' */ - if (currIsNewline(ls) && ls->current != old) - next(ls); /* skip '\n\r' or '\r\n' */ - if (++ls->linenumber >= MAX_INT) - lexerror(ls, "chunk has too many lines", 0); -} - - -void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source, - int firstchar) { - ls->t.token = 0; - ls->L = L; - ls->current = firstchar; - ls->lookahead.token = TK_EOS; /* no look-ahead token */ - ls->z = z; - ls->fs = NULL; - ls->linenumber = 1; - ls->lastline = 1; - ls->source = source; - ls->envn = luaS_newliteral(L, LUA_ENV); /* get env name */ - luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER); /* initialize buffer */ -} - - - -/* -** ======================================================= -** LEXICAL ANALYZER -** ======================================================= -*/ - - -static int check_next1 (LexState *ls, int c) { - if (ls->current == c) { - next(ls); - return 1; - } - else return 0; -} - - -/* -** Check whether current char is in set 'set' (with two chars) and -** saves it -*/ -static int check_next2 (LexState *ls, const char *set) { - lua_assert(set[2] == '\0'); - if (ls->current == set[0] || ls->current == set[1]) { - save_and_next(ls); - return 1; - } - else return 0; -} - - -/* LUA_NUMBER */ -/* -** This function is quite liberal in what it accepts, as 'luaO_str2num' -** will reject ill-formed numerals. Roughly, it accepts the following -** pattern: -** -** %d(%x|%.|([Ee][+-]?))* | 0[Xx](%x|%.|([Pp][+-]?))* -** -** The only tricky part is to accept [+-] only after a valid exponent -** mark, to avoid reading '3-4' or '0xe+1' as a single number. -** -** The caller might have already read an initial dot. -*/ -static int read_numeral (LexState *ls, SemInfo *seminfo) { - TValue obj; - const char *expo = "Ee"; - int first = ls->current; - lua_assert(lisdigit(ls->current)); - save_and_next(ls); - if (first == '0' && check_next2(ls, "xX")) /* hexadecimal? */ - expo = "Pp"; - for (;;) { - if (check_next2(ls, expo)) /* exponent mark? */ - check_next2(ls, "-+"); /* optional exponent sign */ - else if (lisxdigit(ls->current) || ls->current == '.') /* '%x|%.' */ - save_and_next(ls); - else break; - } - if (lislalpha(ls->current)) /* is numeral touching a letter? */ - save_and_next(ls); /* force an error */ - save(ls, '\0'); - if (luaO_str2num(luaZ_buffer(ls->buff), &obj) == 0) /* format error? */ - lexerror(ls, "malformed number", TK_FLT); - if (ttisinteger(&obj)) { - seminfo->i = ivalue(&obj); - return TK_INT; - } - else { - lua_assert(ttisfloat(&obj)); - seminfo->r = fltvalue(&obj); - return TK_FLT; - } -} - - -/* -** read a sequence '[=*[' or ']=*]', leaving the last bracket. If -** sequence is well formed, return its number of '='s + 2; otherwise, -** return 1 if it is a single bracket (no '='s and no 2nd bracket); -** otherwise (an unfinished '[==...') return 0. -*/ -static size_t skip_sep (LexState *ls) { - size_t count = 0; - int s = ls->current; - lua_assert(s == '[' || s == ']'); - save_and_next(ls); - while (ls->current == '=') { - save_and_next(ls); - count++; - } - return (ls->current == s) ? count + 2 - : (count == 0) ? 1 - : 0; -} - - -static void read_long_string (LexState *ls, SemInfo *seminfo, size_t sep) { - int line = ls->linenumber; /* initial line (for error message) */ - save_and_next(ls); /* skip 2nd '[' */ - if (currIsNewline(ls)) /* string starts with a newline? */ - inclinenumber(ls); /* skip it */ - for (;;) { - switch (ls->current) { - case EOZ: { /* error */ - const char *what = (seminfo ? "string" : "comment"); - const char *msg = luaO_pushfstring(ls->L, - "unfinished long %s (starting at line %d)", what, line); - lexerror(ls, msg, TK_EOS); - break; /* to avoid warnings */ - } - case ']': { - if (skip_sep(ls) == sep) { - save_and_next(ls); /* skip 2nd ']' */ - goto endloop; - } - break; - } - case '\n': case '\r': { - save(ls, '\n'); - inclinenumber(ls); - if (!seminfo) luaZ_resetbuffer(ls->buff); /* avoid wasting space */ - break; - } - default: { - if (seminfo) save_and_next(ls); - else next(ls); - } - } - } endloop: - if (seminfo) - seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + sep, - luaZ_bufflen(ls->buff) - 2 * sep); -} - - -static void esccheck (LexState *ls, int c, const char *msg) { - if (!c) { - if (ls->current != EOZ) - save_and_next(ls); /* add current to buffer for error message */ - lexerror(ls, msg, TK_STRING); - } -} - - -static int gethexa (LexState *ls) { - save_and_next(ls); - esccheck (ls, lisxdigit(ls->current), "hexadecimal digit expected"); - return luaO_hexavalue(ls->current); -} - - -static int readhexaesc (LexState *ls) { - int r = gethexa(ls); - r = (r << 4) + gethexa(ls); - luaZ_buffremove(ls->buff, 2); /* remove saved chars from buffer */ - return r; -} - - -static unsigned long readutf8esc (LexState *ls) { - unsigned long r; - int i = 4; /* chars to be removed: '\', 'u', '{', and first digit */ - save_and_next(ls); /* skip 'u' */ - esccheck(ls, ls->current == '{', "missing '{'"); - r = gethexa(ls); /* must have at least one digit */ - while (cast_void(save_and_next(ls)), lisxdigit(ls->current)) { - i++; - esccheck(ls, r <= (0x7FFFFFFFu >> 4), "UTF-8 value too large"); - r = (r << 4) + luaO_hexavalue(ls->current); - } - esccheck(ls, ls->current == '}', "missing '}'"); - next(ls); /* skip '}' */ - luaZ_buffremove(ls->buff, i); /* remove saved chars from buffer */ - return r; -} - - -static void utf8esc (LexState *ls) { - char buff[UTF8BUFFSZ]; - int n = luaO_utf8esc(buff, readutf8esc(ls)); - for (; n > 0; n--) /* add 'buff' to string */ - save(ls, buff[UTF8BUFFSZ - n]); -} - - -static int readdecesc (LexState *ls) { - int i; - int r = 0; /* result accumulator */ - for (i = 0; i < 3 && lisdigit(ls->current); i++) { /* read up to 3 digits */ - r = 10*r + ls->current - '0'; - save_and_next(ls); - } - esccheck(ls, r <= UCHAR_MAX, "decimal escape too large"); - luaZ_buffremove(ls->buff, i); /* remove read digits from buffer */ - return r; -} - - -static void read_string (LexState *ls, int del, SemInfo *seminfo) { - save_and_next(ls); /* keep delimiter (for error messages) */ - while (ls->current != del) { - switch (ls->current) { - case EOZ: - lexerror(ls, "unfinished string", TK_EOS); - break; /* to avoid warnings */ - case '\n': - case '\r': - lexerror(ls, "unfinished string", TK_STRING); - break; /* to avoid warnings */ - case '\\': { /* escape sequences */ - int c; /* final character to be saved */ - save_and_next(ls); /* keep '\\' for error messages */ - switch (ls->current) { - case 'a': c = '\a'; goto read_save; - case 'b': c = '\b'; goto read_save; - case 'f': c = '\f'; goto read_save; - case 'n': c = '\n'; goto read_save; - case 'r': c = '\r'; goto read_save; - case 't': c = '\t'; goto read_save; - case 'v': c = '\v'; goto read_save; - case 'x': c = readhexaesc(ls); goto read_save; - case 'u': utf8esc(ls); goto no_save; - case '\n': case '\r': - inclinenumber(ls); c = '\n'; goto only_save; - case '\\': case '\"': case '\'': - c = ls->current; goto read_save; - case EOZ: goto no_save; /* will raise an error next loop */ - case 'z': { /* zap following span of spaces */ - luaZ_buffremove(ls->buff, 1); /* remove '\\' */ - next(ls); /* skip the 'z' */ - while (lisspace(ls->current)) { - if (currIsNewline(ls)) inclinenumber(ls); - else next(ls); - } - goto no_save; - } - default: { - esccheck(ls, lisdigit(ls->current), "invalid escape sequence"); - c = readdecesc(ls); /* digital escape '\ddd' */ - goto only_save; - } - } - read_save: - next(ls); - /* go through */ - only_save: - luaZ_buffremove(ls->buff, 1); /* remove '\\' */ - save(ls, c); - /* go through */ - no_save: break; - } - default: - save_and_next(ls); - } - } - save_and_next(ls); /* skip delimiter */ - seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1, - luaZ_bufflen(ls->buff) - 2); -} - - -static int llex (LexState *ls, SemInfo *seminfo) { - luaZ_resetbuffer(ls->buff); - for (;;) { - switch (ls->current) { - case '\n': case '\r': { /* line breaks */ - inclinenumber(ls); - break; - } - case ' ': case '\f': case '\t': case '\v': { /* spaces */ - next(ls); - break; - } - case '-': { /* '-' or '--' (comment) */ - next(ls); - if (ls->current != '-') return '-'; - /* else is a comment */ - next(ls); - if (ls->current == '[') { /* long comment? */ - size_t sep = skip_sep(ls); - luaZ_resetbuffer(ls->buff); /* 'skip_sep' may dirty the buffer */ - if (sep >= 2) { - read_long_string(ls, NULL, sep); /* skip long comment */ - luaZ_resetbuffer(ls->buff); /* previous call may dirty the buff. */ - break; - } - } - /* else short comment */ - while (!currIsNewline(ls) && ls->current != EOZ) - next(ls); /* skip until end of line (or end of file) */ - break; - } - case '[': { /* long string or simply '[' */ - size_t sep = skip_sep(ls); - if (sep >= 2) { - read_long_string(ls, seminfo, sep); - return TK_STRING; - } - else if (sep == 0) /* '[=...' missing second bracket? */ - lexerror(ls, "invalid long string delimiter", TK_STRING); - return '['; - } - case '=': { - next(ls); - if (check_next1(ls, '=')) return TK_EQ; /* '==' */ - else return '='; - } - case '<': { - next(ls); - if (check_next1(ls, '=')) return TK_LE; /* '<=' */ - else if (check_next1(ls, '<')) return TK_SHL; /* '<<' */ - else return '<'; - } - case '>': { - next(ls); - if (check_next1(ls, '=')) return TK_GE; /* '>=' */ - else if (check_next1(ls, '>')) return TK_SHR; /* '>>' */ - else return '>'; - } - case '/': { - next(ls); - if (check_next1(ls, '/')) return TK_IDIV; /* '//' */ - else return '/'; - } - case '~': { - next(ls); - if (check_next1(ls, '=')) return TK_NE; /* '~=' */ - else return '~'; - } - case ':': { - next(ls); - if (check_next1(ls, ':')) return TK_DBCOLON; /* '::' */ - else return ':'; - } - case '"': case '\'': { /* short literal strings */ - read_string(ls, ls->current, seminfo); - return TK_STRING; - } - case '.': { /* '.', '..', '...', or number */ - save_and_next(ls); - if (check_next1(ls, '.')) { - if (check_next1(ls, '.')) - return TK_DOTS; /* '...' */ - else return TK_CONCAT; /* '..' */ - } - else if (!lisdigit(ls->current)) return '.'; - else return read_numeral(ls, seminfo); - } - case '0': case '1': case '2': case '3': case '4': - case '5': case '6': case '7': case '8': case '9': { - return read_numeral(ls, seminfo); - } - case EOZ: { - return TK_EOS; - } - default: { - if (lislalpha(ls->current)) { /* identifier or reserved word? */ - TString *ts; - do { - save_and_next(ls); - } while (lislalnum(ls->current)); - ts = luaX_newstring(ls, luaZ_buffer(ls->buff), - luaZ_bufflen(ls->buff)); - seminfo->ts = ts; - if (isreserved(ts)) /* reserved word? */ - return ts->extra - 1 + FIRST_RESERVED; - else { - return TK_NAME; - } - } - else { /* single-char tokens ('+', '*', '%', '{', '}', ...) */ - int c = ls->current; - next(ls); - return c; - } - } - } - } -} - - -void luaX_next (LexState *ls) { - ls->lastline = ls->linenumber; - if (ls->lookahead.token != TK_EOS) { /* is there a look-ahead token? */ - ls->t = ls->lookahead; /* use this one */ - ls->lookahead.token = TK_EOS; /* and discharge it */ - } - else - ls->t.token = llex(ls, &ls->t.seminfo); /* read next token */ -} - - -int luaX_lookahead (LexState *ls) { - lua_assert(ls->lookahead.token == TK_EOS); - ls->lookahead.token = llex(ls, &ls->lookahead.seminfo); - return ls->lookahead.token; -} - diff --git a/src/dependencies/lua/llex.h b/src/dependencies/lua/llex.h deleted file mode 100644 index 389d2f8..0000000 --- a/src/dependencies/lua/llex.h +++ /dev/null @@ -1,91 +0,0 @@ -/* -** $Id: llex.h $ -** Lexical Analyzer -** See Copyright Notice in lua.h -*/ - -#ifndef llex_h -#define llex_h - -#include - -#include "lobject.h" -#include "lzio.h" - - -/* -** Single-char tokens (terminal symbols) are represented by their own -** numeric code. Other tokens start at the following value. -*/ -#define FIRST_RESERVED (UCHAR_MAX + 1) - - -#if !defined(LUA_ENV) -#define LUA_ENV "_ENV" -#endif - - -/* -* WARNING: if you change the order of this enumeration, -* grep "ORDER RESERVED" -*/ -enum RESERVED { - /* terminal symbols denoted by reserved words */ - TK_AND = FIRST_RESERVED, TK_BREAK, - TK_DO, TK_ELSE, TK_ELSEIF, TK_END, TK_FALSE, TK_FOR, TK_FUNCTION, - TK_GOTO, TK_IF, TK_IN, TK_LOCAL, TK_NIL, TK_NOT, TK_OR, TK_REPEAT, - TK_RETURN, TK_THEN, TK_TRUE, TK_UNTIL, TK_WHILE, - /* other terminal symbols */ - TK_IDIV, TK_CONCAT, TK_DOTS, TK_EQ, TK_GE, TK_LE, TK_NE, - TK_SHL, TK_SHR, - TK_DBCOLON, TK_EOS, - TK_FLT, TK_INT, TK_NAME, TK_STRING -}; - -/* number of reserved words */ -#define NUM_RESERVED (cast_int(TK_WHILE-FIRST_RESERVED + 1)) - - -typedef union { - lua_Number r; - lua_Integer i; - TString *ts; -} SemInfo; /* semantics information */ - - -typedef struct Token { - int token; - SemInfo seminfo; -} Token; - - -/* state of the lexer plus state of the parser when shared by all - functions */ -typedef struct LexState { - int current; /* current character (charint) */ - int linenumber; /* input line counter */ - int lastline; /* line of last token 'consumed' */ - Token t; /* current token */ - Token lookahead; /* look ahead token */ - struct FuncState *fs; /* current function (parser) */ - struct lua_State *L; - ZIO *z; /* input stream */ - Mbuffer *buff; /* buffer for tokens */ - Table *h; /* to avoid collection/reuse strings */ - struct Dyndata *dyd; /* dynamic structures used by the parser */ - TString *source; /* current source name */ - TString *envn; /* environment variable name */ -} LexState; - - -LUAI_FUNC void luaX_init (lua_State *L); -LUAI_FUNC void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, - TString *source, int firstchar); -LUAI_FUNC TString *luaX_newstring (LexState *ls, const char *str, size_t l); -LUAI_FUNC void luaX_next (LexState *ls); -LUAI_FUNC int luaX_lookahead (LexState *ls); -LUAI_FUNC l_noret luaX_syntaxerror (LexState *ls, const char *s); -LUAI_FUNC const char *luaX_token2str (LexState *ls, int token); - - -#endif diff --git a/src/dependencies/lua/llimits.h b/src/dependencies/lua/llimits.h deleted file mode 100644 index a32e977..0000000 --- a/src/dependencies/lua/llimits.h +++ /dev/null @@ -1,383 +0,0 @@ -/* -** $Id: llimits.h $ -** Limits, basic types, and some other 'installation-dependent' definitions -** See Copyright Notice in lua.h -*/ - -#ifndef llimits_h -#define llimits_h - - -#include -#include - - -#include "lua.h" - - -/* -** 'lu_mem' is an unsigned integer big enough to count the total memory -** used by Lua (in bytes). 'l_obj' is a signed integer big enough to -** count the total number of objects used by Lua. (It is signed due -** to the use of debt in several computations.) Usually, 'size_t' and -** 'ptrdiff_t' should work, but we use 'long' for 16-bit machines. -*/ -#if defined(LUAI_MEM) /* { external definitions? */ -typedef LUAI_UMEM lu_mem; -typedef LUAI_MEM l_obj; -#elif LUAI_IS32INT /* }{ */ -typedef size_t lu_mem; -typedef ptrdiff_t l_obj; -#else /* 16-bit ints */ /* }{ */ -typedef unsigned long lu_mem; -typedef long l_obj; -#endif /* } */ - -#define MAX_LOBJ \ - cast(l_obj, (cast(lu_mem, 1) << (sizeof(l_obj) * CHAR_BIT - 1)) - 1) - - -/* chars used as small naturals (so that 'char' is reserved for characters) */ -typedef unsigned char lu_byte; -typedef signed char ls_byte; - - -/* maximum value for size_t */ -#define MAX_SIZET ((size_t)(~(size_t)0)) - -/* -** Maximum size for strings and userdata visible for Lua (should be -** representable in a lua_Integer) -*/ -#define MAX_SIZE (sizeof(size_t) < sizeof(lua_Integer) ? MAX_SIZET \ - : (size_t)(LUA_MAXINTEGER)) - - -#define MAX_INT INT_MAX /* maximum value of an int */ - - -/* -** floor of the log2 of the maximum signed value for integral type 't'. -** (That is, maximum 'n' such that '2^n' fits in the given signed type.) -*/ -#define log2maxs(t) cast_int(sizeof(t) * 8 - 2) - - -/* -** test whether an unsigned value is a power of 2 (or zero) -*/ -#define ispow2(x) (((x) & ((x) - 1)) == 0) - - -/* number of chars of a literal string without the ending \0 */ -#define LL(x) (sizeof(x)/sizeof(char) - 1) - - -/* -** conversion of pointer to unsigned integer: this is for hashing only; -** there is no problem if the integer cannot hold the whole pointer -** value. (In strict ISO C this may cause undefined behavior, but no -** actual machine seems to bother.) -*/ -#if !defined(LUA_USE_C89) && defined(__STDC_VERSION__) && \ - __STDC_VERSION__ >= 199901L -#include -#if defined(UINTPTR_MAX) /* even in C99 this type is optional */ -#define L_P2I uintptr_t -#else /* no 'intptr'? */ -#define L_P2I uintmax_t /* use the largest available integer */ -#endif -#else /* C89 option */ -#define L_P2I size_t -#endif - -#define point2uint(p) cast_uint((L_P2I)(p) & UINT_MAX) - - - -/* types of 'usual argument conversions' for lua_Number and lua_Integer */ -typedef LUAI_UACNUMBER l_uacNumber; -typedef LUAI_UACINT l_uacInt; - - -/* -** Internal assertions for in-house debugging -*/ -#if defined LUAI_ASSERT -#undef NDEBUG -#include -#define lua_assert(c) assert(c) -#endif - -#if defined(lua_assert) -#define check_exp(c,e) (lua_assert(c), (e)) -/* to avoid problems with conditions too long */ -#define lua_longassert(c) ((c) ? (void)0 : lua_assert(0)) -#else -#define lua_assert(c) ((void)0) -#define check_exp(c,e) (e) -#define lua_longassert(c) ((void)0) -#endif - -/* -** assertion for checking API calls -*/ -#if !defined(luai_apicheck) -#define luai_apicheck(l,e) ((void)l, lua_assert(e)) -#endif - -#define api_check(l,e,msg) luai_apicheck(l,(e) && msg) - - -/* macro to avoid warnings about unused variables */ -#if !defined(UNUSED) -#define UNUSED(x) ((void)(x)) -#endif - - -/* type casts (a macro highlights casts in the code) */ -#define cast(t, exp) ((t)(exp)) - -#define cast_void(i) cast(void, (i)) -#define cast_voidp(i) cast(void *, (i)) -#define cast_num(i) cast(lua_Number, (i)) -#define cast_int(i) cast(int, (i)) -#define cast_uint(i) cast(unsigned int, (i)) -#define cast_byte(i) cast(lu_byte, (i)) -#define cast_uchar(i) cast(unsigned char, (i)) -#define cast_char(i) cast(char, (i)) -#define cast_charp(i) cast(char *, (i)) -#define cast_sizet(i) cast(size_t, (i)) - - -/* cast a signed lua_Integer to lua_Unsigned */ -#if !defined(l_castS2U) -#define l_castS2U(i) ((lua_Unsigned)(i)) -#endif - -/* -** cast a lua_Unsigned to a signed lua_Integer; this cast is -** not strict ISO C, but two-complement architectures should -** work fine. -*/ -#if !defined(l_castU2S) -#define l_castU2S(i) ((lua_Integer)(i)) -#endif - - -/* -** non-return type -*/ -#if !defined(l_noret) - -#if defined(__GNUC__) -#define l_noret void __attribute__((noreturn)) -#elif defined(_MSC_VER) && _MSC_VER >= 1200 -#define l_noret void __declspec(noreturn) -#else -#define l_noret void -#endif - -#endif - - -/* -** Inline functions -*/ -#if !defined(LUA_USE_C89) -#define l_inline inline -#elif defined(__GNUC__) -#define l_inline __inline__ -#else -#define l_inline /* empty */ -#endif - -#define l_sinline static l_inline - - -/* -** type for virtual-machine instructions; -** must be an unsigned with (at least) 4 bytes (see details in lopcodes.h) -*/ -#if LUAI_IS32INT -typedef unsigned int l_uint32; -#else -typedef unsigned long l_uint32; -#endif - -typedef l_uint32 Instruction; - - - -/* -** Maximum length for short strings, that is, strings that are -** internalized. (Cannot be smaller than reserved words or tags for -** metamethods, as these strings must be internalized; -** #("function") = 8, #("__newindex") = 10.) -*/ -#if !defined(LUAI_MAXSHORTLEN) -#define LUAI_MAXSHORTLEN 40 -#endif - - -/* -** Initial size for the string table (must be power of 2). -** The Lua core alone registers ~50 strings (reserved words + -** metaevent keys + a few others). Libraries would typically add -** a few dozens more. -*/ -#if !defined(MINSTRTABSIZE) -#define MINSTRTABSIZE 128 -#endif - - -/* -** Size of cache for strings in the API. 'N' is the number of -** sets (better be a prime) and "M" is the size of each set (M == 1 -** makes a direct cache.) -*/ -#if !defined(STRCACHE_N) -#define STRCACHE_N 53 -#define STRCACHE_M 2 -#endif - - -/* minimum size for string buffer */ -#if !defined(LUA_MINBUFFER) -#define LUA_MINBUFFER 32 -#endif - - -/* -** Maximum depth for nested C calls, syntactical nested non-terminals, -** and other features implemented through recursion in C. (Value must -** fit in a 16-bit unsigned integer. It must also be compatible with -** the size of the C stack.) -*/ -#if !defined(LUAI_MAXCCALLS) -#define LUAI_MAXCCALLS 200 -#endif - - -/* -** macros that are executed whenever program enters the Lua core -** ('lua_lock') and leaves the core ('lua_unlock') -*/ -#if !defined(lua_lock) -#define lua_lock(L) ((void) 0) -#define lua_unlock(L) ((void) 0) -#endif - -/* -** macro executed during Lua functions at points where the -** function can yield. -*/ -#if !defined(luai_threadyield) -#define luai_threadyield(L) {lua_unlock(L); lua_lock(L);} -#endif - - -/* -** these macros allow user-specific actions when a thread is -** created/deleted/resumed/yielded. -*/ -#if !defined(luai_userstateopen) -#define luai_userstateopen(L) ((void)L) -#endif - -#if !defined(luai_userstateclose) -#define luai_userstateclose(L) ((void)L) -#endif - -#if !defined(luai_userstatethread) -#define luai_userstatethread(L,L1) ((void)L) -#endif - -#if !defined(luai_userstatefree) -#define luai_userstatefree(L,L1) ((void)L) -#endif - -#if !defined(luai_userstateresume) -#define luai_userstateresume(L,n) ((void)L) -#endif - -#if !defined(luai_userstateyield) -#define luai_userstateyield(L,n) ((void)L) -#endif - - - -/* -** The luai_num* macros define the primitive operations over numbers. -*/ - -/* floor division (defined as 'floor(a/b)') */ -#if !defined(luai_numidiv) -#define luai_numidiv(L,a,b) ((void)L, l_floor(luai_numdiv(L,a,b))) -#endif - -/* float division */ -#if !defined(luai_numdiv) -#define luai_numdiv(L,a,b) ((a)/(b)) -#endif - -/* -** modulo: defined as 'a - floor(a/b)*b'; the direct computation -** using this definition has several problems with rounding errors, -** so it is better to use 'fmod'. 'fmod' gives the result of -** 'a - trunc(a/b)*b', and therefore must be corrected when -** 'trunc(a/b) ~= floor(a/b)'. That happens when the division has a -** non-integer negative result: non-integer result is equivalent to -** a non-zero remainder 'm'; negative result is equivalent to 'a' and -** 'b' with different signs, or 'm' and 'b' with different signs -** (as the result 'm' of 'fmod' has the same sign of 'a'). -*/ -#if !defined(luai_nummod) -#define luai_nummod(L,a,b,m) \ - { (void)L; (m) = l_mathop(private_lua_embed_fmod)(a,b); \ - if (((m) > 0) ? (b) < 0 : ((m) < 0 && (b) > 0)) (m) += (b); } -#endif - -/* exponentiation */ -#if !defined(luai_numpow) -#define luai_numpow(L,a,b) \ - ((void)L, (b == 2) ? (a)*(a) : l_mathop(private_lua_embed_pow)(a,b)) -#endif - -/* the others are quite standard operations */ -#if !defined(luai_numadd) -#define luai_numadd(L,a,b) ((a)+(b)) -#define luai_numsub(L,a,b) ((a)-(b)) -#define luai_nummul(L,a,b) ((a)*(b)) -#define luai_numunm(L,a) (-(a)) -#define luai_numeq(a,b) ((a)==(b)) -#define luai_numlt(a,b) ((a)<(b)) -#define luai_numle(a,b) ((a)<=(b)) -#define luai_numgt(a,b) ((a)>(b)) -#define luai_numge(a,b) ((a)>=(b)) -#define luai_numisnan(a) (!luai_numeq((a), (a))) -#endif - - - - - -/* -** macro to control inclusion of some hard tests on stack reallocation -*/ -#if !defined(HARDSTACKTESTS) -#define condmovestack(L,pre,pos) ((void)0) -#else -/* realloc stack keeping its size */ -#define condmovestack(L,pre,pos) \ - { int sz_ = stacksize(L); pre; luaD_reallocstack((L), sz_, 0); pos; } -#endif - -#if !defined(HARDMEMTESTS) -#define condchangemem(L,pre,pos) ((void)0) -#else -#define condchangemem(L,pre,pos) \ - { if (gcrunning(G(L))) { pre; luaC_fullgc(L, 0); pos; } } -#endif - -#endif diff --git a/src/dependencies/lua/lmathlib.c b/src/dependencies/lua/lmathlib.c deleted file mode 100644 index cb11d21..0000000 --- a/src/dependencies/lua/lmathlib.c +++ /dev/null @@ -1,768 +0,0 @@ -/* -** $Id: lmathlib.c $ -** Standard mathematical library -** See Copyright Notice in lua.h -*/ -#define lmathlib_c -#define LUA_LIB -#include "lprefix.h" - - -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -#undef PI -#define PI (l_mathop(3.141592653589793238462643383279502884)) - - -static int math_abs (lua_State *L) { - if (lua_isinteger(L, 1)) { - lua_Integer n = lua_tointeger(L, 1); - if (n < 0) n = (lua_Integer)(0u - (lua_Unsigned)n); - lua_pushinteger(L, n); - } - else - lua_pushnumber(L, l_mathop(private_lua_cembed_fabs)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_sin (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_sin)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_cos (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_cos)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_tan (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_tan)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_asin (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_asin)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_acos (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_acos)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_atan (lua_State *L) { - lua_Number y = luaL_checknumber(L, 1); - lua_Number x = luaL_optnumber(L, 2, 1); - lua_pushnumber(L, l_mathop(private_lua_cembed_atan2)(y, x)); - return 1; -} - - -static int math_toint (lua_State *L) { - int valid; - lua_Integer n = lua_tointegerx(L, 1, &valid); - if (l_likely(valid)) - lua_pushinteger(L, n); - else { - luaL_checkany(L, 1); - luaL_pushfail(L); /* value is not convertible to integer */ - } - return 1; -} - - -static void pushnumint (lua_State *L, lua_Number d) { - lua_Integer n; - if (lua_numbertointeger(d, &n)) /* does 'd' fit in an integer? */ - lua_pushinteger(L, n); /* result is integer */ - else - lua_pushnumber(L, d); /* result is float */ -} - - -static int math_floor (lua_State *L) { - if (lua_isinteger(L, 1)) - lua_settop(L, 1); /* integer is its own floor */ - else { - lua_Number d = l_mathop(private_lua_embed_floor)(luaL_checknumber(L, 1)); - pushnumint(L, d); - } - return 1; -} - - -static int math_ceil (lua_State *L) { - if (lua_isinteger(L, 1)) - lua_settop(L, 1); /* integer is its own ceil */ - else { - lua_Number d = l_mathop(private_lua_cembed_ceil)(luaL_checknumber(L, 1)); - pushnumint(L, d); - } - return 1; -} - - -static int math_fmod (lua_State *L) { - if (lua_isinteger(L, 1) && lua_isinteger(L, 2)) { - lua_Integer d = lua_tointeger(L, 2); - if ((lua_Unsigned)d + 1u <= 1u) { /* special cases: -1 or 0 */ - luaL_argcheck(L, d != 0, 2, "zero"); - lua_pushinteger(L, 0); /* avoid overflow with 0x80000... / -1 */ - } - else - lua_pushinteger(L, lua_tointeger(L, 1) % d); - } - else - lua_pushnumber(L, l_mathop(private_lua_embed_fmod)(luaL_checknumber(L, 1), - luaL_checknumber(L, 2))); - return 1; -} - - -/* -** next function does not use 'modf', avoiding problems with 'double*' -** (which is not compatible with 'float*') when lua_Number is not -** 'double'. -*/ -static int math_modf (lua_State *L) { - if (lua_isinteger(L ,1)) { - lua_settop(L, 1); /* number is its own integer part */ - lua_pushnumber(L, 0); /* no fractional part */ - } - else { - lua_Number n = luaL_checknumber(L, 1); - /* integer part (rounds toward zero) */ - lua_Number ip = (n < 0) ? l_mathop(private_lua_cembed_ceil)(n) : l_mathop(private_lua_embed_floor)(n); - pushnumint(L, ip); - /* fractional part (test needed for inf/-inf) */ - lua_pushnumber(L, (n == ip) ? l_mathop(0.0) : (n - ip)); - } - return 2; -} - - -static int math_sqrt (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_sqrt)(luaL_checknumber(L, 1))); - return 1; -} - - -static int math_ult (lua_State *L) { - lua_Integer a = luaL_checkinteger(L, 1); - lua_Integer b = luaL_checkinteger(L, 2); - lua_pushboolean(L, (lua_Unsigned)a < (lua_Unsigned)b); - return 1; -} - -static int math_log (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - lua_Number res; - if (lua_isnoneornil(L, 2)) - res = l_mathop(private_lua_cembed_log)(x); - else { - lua_Number base = luaL_checknumber(L, 2); -#if !defined(LUA_USE_C89) - if (base == l_mathop(2.0)) - res = l_mathop(private_lua_cembed_log2)(x); - else -#endif - if (base == l_mathop(10.0)) - res = l_mathop(private_lua_embed_log10)(x); - else - res = l_mathop(private_lua_cembed_log)(x)/l_mathop(private_lua_cembed_log)(base); - } - lua_pushnumber(L, res); - return 1; -} - -static int math_exp (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_exp)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_deg (lua_State *L) { - lua_pushnumber(L, luaL_checknumber(L, 1) * (l_mathop(180.0) / PI)); - return 1; -} - -static int math_rad (lua_State *L) { - lua_pushnumber(L, luaL_checknumber(L, 1) * (PI / l_mathop(180.0))); - return 1; -} - - -static int math_min (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - int imin = 1; /* index of current minimum value */ - int i; - luaL_argcheck(L, n >= 1, 1, "value expected"); - for (i = 2; i <= n; i++) { - if (lua_compare(L, i, imin, LUA_OPLT)) - imin = i; - } - lua_pushvalue(L, imin); - return 1; -} - - -static int math_max (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - int imax = 1; /* index of current maximum value */ - int i; - luaL_argcheck(L, n >= 1, 1, "value expected"); - for (i = 2; i <= n; i++) { - if (lua_compare(L, imax, i, LUA_OPLT)) - imax = i; - } - lua_pushvalue(L, imax); - return 1; -} - - -static int math_type (lua_State *L) { - if (lua_type(L, 1) == LUA_TNUMBER) - lua_pushstring(L, (lua_isinteger(L, 1)) ? "integer" : "float"); - else { - luaL_checkany(L, 1); - luaL_pushfail(L); - } - return 1; -} - - - -/* -** {================================================================== -** Pseudo-Random Number Generator based on 'xoshiro256**'. -** =================================================================== -*/ - -/* -** This code uses lots of shifts. ANSI C does not allow shifts greater -** than or equal to the width of the type being shifted, so some shifts -** are written in convoluted ways to match that restriction. For -** preprocessor tests, it assumes a width of 32 bits, so the maximum -** shift there is 31 bits. -*/ - - -/* number of binary digits in the mantissa of a float */ -#define FIGS l_floatatt(MANT_DIG) - -#if FIGS > 64 -/* there are only 64 random bits; use them all */ -#undef FIGS -#define FIGS 64 -#endif - - -/* -** LUA_RAND32 forces the use of 32-bit integers in the implementation -** of the PRN generator (mainly for testing). -*/ -#if !defined(LUA_RAND32) && !defined(Rand64) - -/* try to find an integer type with at least 64 bits */ - -#if ((ULONG_MAX >> 31) >> 31) >= 3 - -/* 'long' has at least 64 bits */ -#define Rand64 unsigned long -#define SRand64 long - -#elif !defined(LUA_USE_C89) && defined(LLONG_MAX) - -/* there is a 'long long' type (which must have at least 64 bits) */ -#define Rand64 unsigned long long -#define SRand64 long long - -#elif ((LUA_MAXUNSIGNED >> 31) >> 31) >= 3 - -/* 'lua_Unsigned' has at least 64 bits */ -#define Rand64 lua_Unsigned -#define SRand64 lua_Integer - -#endif - -#endif - - -#if defined(Rand64) /* { */ - -/* -** Standard implementation, using 64-bit integers. -** If 'Rand64' has more than 64 bits, the extra bits do not interfere -** with the 64 initial bits, except in a right shift. Moreover, the -** final result has to discard the extra bits. -*/ - -/* avoid using extra bits when needed */ -#define trim64(x) ((x) & 0xffffffffffffffffu) - - -/* rotate left 'x' by 'n' bits */ -static Rand64 rotl (Rand64 x, int n) { - return (x << n) | (trim64(x) >> (64 - n)); -} - -static Rand64 nextrand (Rand64 *state) { - Rand64 state0 = state[0]; - Rand64 state1 = state[1]; - Rand64 state2 = state[2] ^ state0; - Rand64 state3 = state[3] ^ state1; - Rand64 res = rotl(state1 * 5, 7) * 9; - state[0] = state0 ^ state3; - state[1] = state1 ^ state2; - state[2] = state2 ^ (state1 << 17); - state[3] = rotl(state3, 45); - return res; -} - - -/* -** Convert bits from a random integer into a float in the -** interval [0,1), getting the higher FIG bits from the -** random unsigned integer and converting that to a float. -** Some old Microsoft compilers cannot cast an unsigned long -** to a floating-point number, so we use a signed long as an -** intermediary. When lua_Number is float or double, the shift ensures -** that 'sx' is non negative; in that case, a good compiler will remove -** the correction. -*/ - -/* must throw out the extra (64 - FIGS) bits */ -#define shift64_FIG (64 - FIGS) - -/* 2^(-FIGS) == 2^-1 / 2^(FIGS-1) */ -#define scaleFIG (l_mathop(0.5) / ((Rand64)1 << (FIGS - 1))) - -static lua_Number I2d (Rand64 x) { - SRand64 sx = (SRand64)(trim64(x) >> shift64_FIG); - lua_Number res = (lua_Number)(sx) * scaleFIG; - if (sx < 0) - res += l_mathop(1.0); /* correct the two's complement if negative */ - lua_assert(0 <= res && res < 1); - return res; -} - -/* convert a 'Rand64' to a 'lua_Unsigned' */ -#define I2UInt(x) ((lua_Unsigned)trim64(x)) - -/* convert a 'lua_Unsigned' to a 'Rand64' */ -#define Int2I(x) ((Rand64)(x)) - - -#else /* no 'Rand64' }{ */ - -/* get an integer with at least 32 bits */ -#if LUAI_IS32INT -typedef unsigned int lu_int32; -#else -typedef unsigned long lu_int32; -#endif - - -/* -** Use two 32-bit integers to represent a 64-bit quantity. -*/ -typedef struct Rand64 { - lu_int32 h; /* higher half */ - lu_int32 l; /* lower half */ -} Rand64; - - -/* -** If 'lu_int32' has more than 32 bits, the extra bits do not interfere -** with the 32 initial bits, except in a right shift and comparisons. -** Moreover, the final result has to discard the extra bits. -*/ - -/* avoid using extra bits when needed */ -#define trim32(x) ((x) & 0xffffffffu) - - -/* -** basic operations on 'Rand64' values -*/ - -/* build a new Rand64 value */ -static Rand64 packI (lu_int32 h, lu_int32 l) { - Rand64 result; - result.h = h; - result.l = l; - return result; -} - -/* return i << n */ -static Rand64 Ishl (Rand64 i, int n) { - lua_assert(n > 0 && n < 32); - return packI((i.h << n) | (trim32(i.l) >> (32 - n)), i.l << n); -} - -/* i1 ^= i2 */ -static void Ixor (Rand64 *i1, Rand64 i2) { - i1->h ^= i2.h; - i1->l ^= i2.l; -} - -/* return i1 + i2 */ -static Rand64 Iadd (Rand64 i1, Rand64 i2) { - Rand64 result = packI(i1.h + i2.h, i1.l + i2.l); - if (trim32(result.l) < trim32(i1.l)) /* carry? */ - result.h++; - return result; -} - -/* return i * 5 */ -static Rand64 times5 (Rand64 i) { - return Iadd(Ishl(i, 2), i); /* i * 5 == (i << 2) + i */ -} - -/* return i * 9 */ -static Rand64 times9 (Rand64 i) { - return Iadd(Ishl(i, 3), i); /* i * 9 == (i << 3) + i */ -} - -/* return 'i' rotated left 'n' bits */ -static Rand64 rotl (Rand64 i, int n) { - lua_assert(n > 0 && n < 32); - return packI((i.h << n) | (trim32(i.l) >> (32 - n)), - (trim32(i.h) >> (32 - n)) | (i.l << n)); -} - -/* for offsets larger than 32, rotate right by 64 - offset */ -static Rand64 rotl1 (Rand64 i, int n) { - lua_assert(n > 32 && n < 64); - n = 64 - n; - return packI((trim32(i.h) >> n) | (i.l << (32 - n)), - (i.h << (32 - n)) | (trim32(i.l) >> n)); -} - -/* -** implementation of 'xoshiro256**' algorithm on 'Rand64' values -*/ -static Rand64 nextrand (Rand64 *state) { - Rand64 res = times9(rotl(times5(state[1]), 7)); - Rand64 t = Ishl(state[1], 17); - Ixor(&state[2], state[0]); - Ixor(&state[3], state[1]); - Ixor(&state[1], state[2]); - Ixor(&state[0], state[3]); - Ixor(&state[2], t); - state[3] = rotl1(state[3], 45); - return res; -} - - -/* -** Converts a 'Rand64' into a float. -*/ - -/* an unsigned 1 with proper type */ -#define UONE ((lu_int32)1) - - -#if FIGS <= 32 - -/* 2^(-FIGS) */ -#define scaleFIG (l_mathop(0.5) / (UONE << (FIGS - 1))) - -/* -** get up to 32 bits from higher half, shifting right to -** throw out the extra bits. -*/ -static lua_Number I2d (Rand64 x) { - lua_Number h = (lua_Number)(trim32(x.h) >> (32 - FIGS)); - return h * scaleFIG; -} - -#else /* 32 < FIGS <= 64 */ - -/* 2^(-FIGS) = 1.0 / 2^30 / 2^3 / 2^(FIGS-33) */ -#define scaleFIG \ - (l_mathop(1.0) / (UONE << 30) / l_mathop(8.0) / (UONE << (FIGS - 33))) - -/* -** use FIGS - 32 bits from lower half, throwing out the other -** (32 - (FIGS - 32)) = (64 - FIGS) bits -*/ -#define shiftLOW (64 - FIGS) - -/* -** higher 32 bits go after those (FIGS - 32) bits: shiftHI = 2^(FIGS - 32) -*/ -#define shiftHI ((lua_Number)(UONE << (FIGS - 33)) * l_mathop(2.0)) - - -static lua_Number I2d (Rand64 x) { - lua_Number h = (lua_Number)trim32(x.h) * shiftHI; - lua_Number l = (lua_Number)(trim32(x.l) >> shiftLOW); - return (h + l) * scaleFIG; -} - -#endif - - -/* convert a 'Rand64' to a 'lua_Unsigned' */ -static lua_Unsigned I2UInt (Rand64 x) { - return (((lua_Unsigned)trim32(x.h) << 31) << 1) | (lua_Unsigned)trim32(x.l); -} - -/* convert a 'lua_Unsigned' to a 'Rand64' */ -static Rand64 Int2I (lua_Unsigned n) { - return packI((lu_int32)((n >> 31) >> 1), (lu_int32)n); -} - -#endif /* } */ - - -/* -** A state uses four 'Rand64' values. -*/ -typedef struct { - Rand64 s[4]; -} RanState; - - -/* -** Project the random integer 'ran' into the interval [0, n]. -** Because 'ran' has 2^B possible values, the projection can only be -** uniform when the size of the interval is a power of 2 (exact -** division). Otherwise, to get a uniform projection into [0, n], we -** first compute 'lim', the smallest Mersenne number not smaller than -** 'n'. We then project 'ran' into the interval [0, lim]. If the result -** is inside [0, n], we are done. Otherwise, we try with another 'ran', -** until we have a result inside the interval. -*/ -static lua_Unsigned project (lua_Unsigned ran, lua_Unsigned n, - RanState *state) { - if ((n & (n + 1)) == 0) /* is 'n + 1' a power of 2? */ - return ran & n; /* no bias */ - else { - lua_Unsigned lim = n; - /* compute the smallest (2^b - 1) not smaller than 'n' */ - lim |= (lim >> 1); - lim |= (lim >> 2); - lim |= (lim >> 4); - lim |= (lim >> 8); - lim |= (lim >> 16); -#if (LUA_MAXUNSIGNED >> 31) >= 3 - lim |= (lim >> 32); /* integer type has more than 32 bits */ -#endif - lua_assert((lim & (lim + 1)) == 0 /* 'lim + 1' is a power of 2, */ - && lim >= n /* not smaller than 'n', */ - && (lim >> 1) < n); /* and it is the smallest one */ - while ((ran &= lim) > n) /* project 'ran' into [0..lim] */ - ran = I2UInt(nextrand(state->s)); /* not inside [0..n]? try again */ - return ran; - } -} - - -static int math_random (lua_State *L) { - lua_Integer low, up; - lua_Unsigned p; - RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1)); - Rand64 rv = nextrand(state->s); /* next pseudo-random value */ - switch (lua_gettop(L)) { /* check number of arguments */ - case 0: { /* no arguments */ - lua_pushnumber(L, I2d(rv)); /* float between 0 and 1 */ - return 1; - } - case 1: { /* only upper limit */ - low = 1; - up = luaL_checkinteger(L, 1); - if (up == 0) { /* single 0 as argument? */ - lua_pushinteger(L, I2UInt(rv)); /* full random integer */ - return 1; - } - break; - } - case 2: { /* lower and upper limits */ - low = luaL_checkinteger(L, 1); - up = luaL_checkinteger(L, 2); - break; - } - default: return luaL_error(L, "wrong number of arguments"); - } - /* random integer in the interval [low, up] */ - luaL_argcheck(L, low <= up, 1, "interval is empty"); - /* project random integer into the interval [0, up - low] */ - p = project(I2UInt(rv), (lua_Unsigned)up - (lua_Unsigned)low, state); - lua_pushinteger(L, p + (lua_Unsigned)low); - return 1; -} - - -static void setseed (lua_State *L, Rand64 *state, - lua_Unsigned n1, lua_Unsigned n2) { - int i; - state[0] = Int2I(n1); - state[1] = Int2I(0xff); /* avoid a zero state */ - state[2] = Int2I(n2); - state[3] = Int2I(0); - for (i = 0; i < 16; i++) - nextrand(state); /* discard initial values to "spread" seed */ - lua_pushinteger(L, n1); - lua_pushinteger(L, n2); -} - - -static int math_randomseed (lua_State *L) { - RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1)); - lua_Unsigned n1, n2; - if (lua_isnone(L, 1)) { - n1 = luaL_makeseed(L); /* "random" seed */ - n2 = I2UInt(nextrand(state->s)); /* in case seed is not that random... */ - } - else { - n1 = luaL_checkinteger(L, 1); - n2 = luaL_optinteger(L, 2, 0); - } - setseed(L, state->s, n1, n2); - return 2; /* return seeds */ -} - - -static const luaL_Reg randfuncs[] = { - {"random", math_random}, - {"randomseed", math_randomseed}, - {NULL, NULL} -}; - - -/* -** Register the random functions and initialize their state. -*/ -static void setrandfunc (lua_State *L) { - RanState *state = (RanState *)lua_newuserdatauv(L, sizeof(RanState), 0); - setseed(L, state->s, luaL_makeseed(L), 0); /* initialize with random seed */ - lua_pop(L, 2); /* remove pushed seeds */ - luaL_setfuncs(L, randfuncs, 1); -} - -/* }================================================================== */ - - -/* -** {================================================================== -** Deprecated functions (for compatibility only) -** =================================================================== -*/ -#if defined(LUA_COMPAT_MATHLIB) - -static int math_cosh (lua_State *L) { - lua_pushnumber(L, l_mathop(cosh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_sinh (lua_State *L) { - lua_pushnumber(L, l_mathop(sinh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_tanh (lua_State *L) { - lua_pushnumber(L, l_mathop(tanh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_pow (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - lua_Number y = luaL_checknumber(L, 2); - lua_pushnumber(L, l_mathop(pow)(x, y)); - return 1; -} - -static int math_frexp (lua_State *L) { - int e; - lua_pushnumber(L, l_mathop(frexp)(luaL_checknumber(L, 1), &e)); - lua_pushinteger(L, e); - return 2; -} - -static int math_ldexp (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - int ep = (int)luaL_checkinteger(L, 2); - lua_pushnumber(L, l_mathop(ldexp)(x, ep)); - return 1; -} - -static int math_log10 (lua_State *L) { - lua_pushnumber(L, l_mathop(log10)(luaL_checknumber(L, 1))); - return 1; -} - -#endif -/* }================================================================== */ - - - -static const luaL_Reg mathlib[] = { - {"abs", math_abs}, - {"acos", math_acos}, - {"asin", math_asin}, - {"atan", math_atan}, - {"ceil", math_ceil}, - {"cos", math_cos}, - {"deg", math_deg}, - {"exp", math_exp}, - {"tointeger", math_toint}, - {"floor", math_floor}, - {"fmod", math_fmod}, - {"ult", math_ult}, - {"log", math_log}, - {"max", math_max}, - {"min", math_min}, - {"modf", math_modf}, - {"rad", math_rad}, - {"sin", math_sin}, - {"sqrt", math_sqrt}, - {"tan", math_tan}, - {"type", math_type}, -#if defined(LUA_COMPAT_MATHLIB) - {"atan2", math_atan}, - {"cosh", math_cosh}, - {"sinh", math_sinh}, - {"tanh", math_tanh}, - {"pow", math_pow}, - {"frexp", math_frexp}, - {"ldexp", math_ldexp}, - {"log10", math_log10}, -#endif - /* placeholders */ - {"random", NULL}, - {"randomseed", NULL}, - {"pi", NULL}, - {"huge", NULL}, - {"maxinteger", NULL}, - {"mininteger", NULL}, - {NULL, NULL} -}; - - -/* -** Open math library -*/ -LUAMOD_API int luaopen_math (lua_State *L) { - luaL_newlib(L, mathlib); - lua_pushnumber(L, PI); - lua_setfield(L, -2, "pi"); - lua_pushnumber(L, (lua_Number)HUGE_VAL); - lua_setfield(L, -2, "huge"); - lua_pushinteger(L, LUA_MAXINTEGER); - lua_setfield(L, -2, "maxinteger"); - lua_pushinteger(L, LUA_MININTEGER); - lua_setfield(L, -2, "mininteger"); - setrandfunc(L); - return 1; -} - diff --git a/src/dependencies/lua/lmem.c b/src/dependencies/lua/lmem.c deleted file mode 100644 index f6a3d95..0000000 --- a/src/dependencies/lua/lmem.c +++ /dev/null @@ -1,215 +0,0 @@ -/* -** $Id: lmem.c $ -** Interface to Memory Manager -** See Copyright Notice in lua.h -*/ - -#define lmem_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" - - - -/* -** About the realloc function: -** void *frealloc (void *ud, void *ptr, size_t osize, size_t nsize); -** ('osize' is the old size, 'nsize' is the new size) -** -** - frealloc(ud, p, x, 0) frees the block 'p' and returns NULL. -** Particularly, frealloc(ud, NULL, 0, 0) does nothing, -** which is equivalent to free(NULL) in ISO C. -** -** - frealloc(ud, NULL, x, s) creates a new block of size 's' -** (no matter 'x'). Returns NULL if it cannot create the new block. -** -** - otherwise, frealloc(ud, b, x, y) reallocates the block 'b' from -** size 'x' to size 'y'. Returns NULL if it cannot reallocate the -** block to the new size. -*/ - - -/* -** Macro to call the allocation function. -*/ -#define callfrealloc(g,block,os,ns) ((*g->frealloc)(g->ud, block, os, ns)) - - -/* -** When an allocation fails, it will try again after an emergency -** collection, except when it cannot run a collection. The GC should -** not be called while the state is not fully built, as the collector -** is not yet fully initialized. Also, it should not be called when -** 'gcstopem' is true, because then the interpreter is in the middle of -** a collection step. -*/ -#define cantryagain(g) (completestate(g) && !g->gcstopem) - - - - -#if defined(EMERGENCYGCTESTS) -/* -** First allocation will fail except when freeing a block (frees never -** fail) and when it cannot try again; this fail will trigger 'tryagain' -** and a full GC cycle at every allocation. -*/ -static void *firsttry (global_State *g, void *block, size_t os, size_t ns) { - if (ns > 0 && cantryagain(g)) - return NULL; /* fail */ - else /* normal allocation */ - return callfrealloc(g, block, os, ns); -} -#else -#define firsttry(g,block,os,ns) callfrealloc(g, block, os, ns) -#endif - - - - - -/* -** {================================================================== -** Functions to allocate/deallocate arrays for the Parser -** =================================================================== -*/ - -/* -** Minimum size for arrays during parsing, to avoid overhead of -** reallocating to size 1, then 2, and then 4. All these arrays -** will be reallocated to exact sizes or erased when parsing ends. -*/ -#define MINSIZEARRAY 4 - - -void *luaM_growaux_ (lua_State *L, void *block, int nelems, int *psize, - int size_elems, int limit, const char *what) { - void *newblock; - int size = *psize; - if (nelems + 1 <= size) /* does one extra element still fit? */ - return block; /* nothing to be done */ - if (size >= limit / 2) { /* cannot double it? */ - if (l_unlikely(size >= limit)) /* cannot grow even a little? */ - luaG_runerror(L, "too many %s (limit is %d)", what, limit); - size = limit; /* still have at least one free place */ - } - else { - size *= 2; - if (size < MINSIZEARRAY) - size = MINSIZEARRAY; /* minimum size */ - } - lua_assert(nelems + 1 <= size && size <= limit); - /* 'limit' ensures that multiplication will not overflow */ - newblock = luaM_saferealloc_(L, block, cast_sizet(*psize) * size_elems, - cast_sizet(size) * size_elems); - *psize = size; /* update only when everything else is OK */ - return newblock; -} - - -/* -** In prototypes, the size of the array is also its number of -** elements (to save memory). So, if it cannot shrink an array -** to its number of elements, the only option is to raise an -** error. -*/ -void *luaM_shrinkvector_ (lua_State *L, void *block, int *size, - int final_n, int size_elem) { - void *newblock; - size_t oldsize = cast_sizet((*size) * size_elem); - size_t newsize = cast_sizet(final_n * size_elem); - lua_assert(newsize <= oldsize); - newblock = luaM_saferealloc_(L, block, oldsize, newsize); - *size = final_n; - return newblock; -} - -/* }================================================================== */ - - -l_noret luaM_toobig (lua_State *L) { - luaG_runerror(L, "memory allocation private_lua_error: block too big"); -} - - -/* -** Free memory -*/ -void luaM_free_ (lua_State *L, void *block, size_t osize) { - global_State *g = G(L); - lua_assert((osize == 0) == (block == NULL)); - callfrealloc(g, block, osize, 0); - g->totalbytes -= osize; -} - - -/* -** In case of allocation fail, this function will do an emergency -** collection to free some memory and then try the allocation again. -*/ -static void *tryagain (lua_State *L, void *block, - size_t osize, size_t nsize) { - global_State *g = G(L); - if (cantryagain(g)) { - luaC_fullgc(L, 1); /* try to free some memory... */ - return callfrealloc(g, block, osize, nsize); /* try again */ - } - else return NULL; /* cannot run an emergency collection */ -} - - -/* -** Generic allocation routine. -*/ -void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) { - void *newblock; - global_State *g = G(L); - lua_assert((osize == 0) == (block == NULL)); - newblock = firsttry(g, block, osize, nsize); - if (l_unlikely(newblock == NULL && nsize > 0)) { - newblock = tryagain(L, block, osize, nsize); - if (newblock == NULL) /* still no memory? */ - return NULL; /* do not update 'totalbytes' */ - } - lua_assert((nsize == 0) == (newblock == NULL)); - g->totalbytes += nsize - osize; - return newblock; -} - - -void *luaM_saferealloc_ (lua_State *L, void *block, size_t osize, - size_t nsize) { - void *newblock = luaM_realloc_(L, block, osize, nsize); - if (l_unlikely(newblock == NULL && nsize > 0)) /* allocation failed? */ - luaM_error(L); - return newblock; -} - - -void *luaM_malloc_ (lua_State *L, size_t size, int tag) { - if (size == 0) - return NULL; /* that's all */ - else { - global_State *g = G(L); - void *newblock = firsttry(g, NULL, tag, size); - if (l_unlikely(newblock == NULL)) { - newblock = tryagain(L, NULL, tag, size); - if (newblock == NULL) - luaM_error(L); - } - g->totalbytes += size; - return newblock; - } -} diff --git a/src/dependencies/lua/lmem.h b/src/dependencies/lua/lmem.h deleted file mode 100644 index c5dada9..0000000 --- a/src/dependencies/lua/lmem.h +++ /dev/null @@ -1,95 +0,0 @@ -/* -** $Id: lmem.h $ -** Interface to Memory Manager -** See Copyright Notice in lua.h -*/ - -#ifndef lmem_h -#define lmem_h - - -#include - -#include "llimits.h" -#include "lua.h" - - -#define luaM_error(L) luaD_throw(L, LUA_ERRMEM) - - -/* -** This macro tests whether it is safe to multiply 'n' by the size of -** type 't' without overflows. Because 'e' is always constant, it avoids -** the runtime division MAX_SIZET/(e). -** (The macro is somewhat complex to avoid warnings: The 'sizeof' -** comparison avoids a runtime comparison when overflow cannot occur. -** The compiler should be able to optimize the real test by itself, but -** when it does it, it may give a warning about "comparison is always -** false due to limited range of data type"; the +1 tricks the compiler, -** avoiding this warning but also this optimization.) -*/ -#define luaM_testsize(n,e) \ - (sizeof(n) >= sizeof(size_t) && cast_sizet((n)) + 1 > MAX_SIZET/(e)) - -#define luaM_checksize(L,n,e) \ - (luaM_testsize(n,e) ? luaM_toobig(L) : cast_void(0)) - - -/* -** Computes the minimum between 'n' and 'MAX_SIZET/sizeof(t)', so that -** the result is not larger than 'n' and cannot overflow a 'size_t' -** when multiplied by the size of type 't'. (Assumes that 'n' is an -** 'int' or 'unsigned int' and that 'int' is not larger than 'size_t'.) -*/ -#define luaM_limitN(n,t) \ - ((cast_sizet(n) <= MAX_SIZET/sizeof(t)) ? (n) : \ - cast_uint((MAX_SIZET/sizeof(t)))) - - -/* -** Arrays of chars do not need any test -*/ -#define luaM_reallocvchar(L,b,on,n) \ - cast_charp(luaM_saferealloc_(L, (b), (on)*sizeof(char), (n)*sizeof(char))) - -#define luaM_freemem(L, b, s) luaM_free_(L, (b), (s)) -#define luaM_free(L, b) luaM_free_(L, (b), sizeof(*(b))) -#define luaM_freearray(L, b, n) luaM_free_(L, (b), (n)*sizeof(*(b))) - -#define luaM_new(L,t) cast(t*, luaM_malloc_(L, sizeof(t), 0)) -#define luaM_newvector(L,n,t) cast(t*, luaM_malloc_(L, (n)*sizeof(t), 0)) -#define luaM_newvectorchecked(L,n,t) \ - (luaM_checksize(L,n,sizeof(t)), luaM_newvector(L,n,t)) - -#define luaM_newobject(L,tag,s) luaM_malloc_(L, (s), tag) - -#define luaM_newblock(L, size) luaM_newvector(L, size, char) - -#define luaM_growvector(L,v,nelems,size,t,limit,e) \ - ((v)=cast(t *, luaM_growaux_(L,v,nelems,&(size),sizeof(t), \ - luaM_limitN(limit,t),e))) - -#define luaM_reallocvector(L, v,oldn,n,t) \ - (cast(t *, luaM_realloc_(L, v, cast_sizet(oldn) * sizeof(t), \ - cast_sizet(n) * sizeof(t)))) - -#define luaM_shrinkvector(L,v,size,fs,t) \ - ((v)=cast(t *, luaM_shrinkvector_(L, v, &(size), fs, sizeof(t)))) - -LUAI_FUNC l_noret luaM_toobig (lua_State *L); - -/* not to be called directly */ -LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize, - size_t size); -LUAI_FUNC void *luaM_saferealloc_ (lua_State *L, void *block, size_t oldsize, - size_t size); -LUAI_FUNC void luaM_free_ (lua_State *L, void *block, size_t osize); -LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int nelems, - int *size, int size_elem, int limit, - const char *what); -LUAI_FUNC void *luaM_shrinkvector_ (lua_State *L, void *block, int *nelem, - int final_n, int size_elem); -LUAI_FUNC void *luaM_malloc_ (lua_State *L, size_t size, int tag); - -#endif - diff --git a/src/dependencies/lua/loadlib.c b/src/dependencies/lua/loadlib.c deleted file mode 100644 index 4f8024c..0000000 --- a/src/dependencies/lua/loadlib.c +++ /dev/null @@ -1,759 +0,0 @@ -/* -** $Id: loadlib.c $ -** Dynamic library loader for Lua -** See Copyright Notice in lua.h -** -** This module contains an implementation of loadlib for Unix systems -** that have dlfcn, an implementation for Windows, and a stub for other -** systems. -*/ - -#define loadlib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** LUA_CSUBSEP is the character that replaces dots in submodule names -** when searching for a C loader. -** LUA_LSUBSEP is the character that replaces dots in submodule names -** when searching for a Lua loader. -*/ -#if !defined(LUA_CSUBSEP) -#define LUA_CSUBSEP LUA_DIRSEP -#endif - -#if !defined(LUA_LSUBSEP) -#define LUA_LSUBSEP LUA_DIRSEP -#endif - - -/* prefix for open functions in C libraries */ -#define LUA_POF "luaopen_" - -/* separator for open functions in C libraries */ -#define LUA_OFSEP "_" - - -/* -** key for table in the registry that keeps handles -** for all loaded C libraries -*/ -static const char *const CLIBS = "_CLIBS"; - -#define LIB_FAIL "open" - - -#define setprogdir(L) ((void)0) - - -/* -** Special type equivalent to '(void*)' for functions in gcc -** (to suppress warnings when converting function pointers) -*/ -typedef void (*voidf)(void); - - -/* -** system-dependent functions -*/ - -/* -** unload library 'lib' -*/ -static void lsys_unloadlib (void *lib); - -/* -** load C library in file 'path'. If 'seeglb', load with all names in -** the library global. -** Returns the library; in case of error, returns NULL plus an -** error string in the stack. -*/ -static void *lsys_load (lua_State *L, const char *path, int seeglb); - -/* -** Try to find a function named 'sym' in library 'lib'. -** Returns the function; in case of error, returns NULL plus an -** error string in the stack. -*/ -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym); - - - - -#if defined(LUA_USE_DLOPEN) /* { */ -/* -** {======================================================================== -** This is an implementation of loadlib based on the dlfcn interface. -** The dlfcn interface is available in Linux, SunOS, Solaris, IRIX, FreeBSD, -** NetBSD, AIX 4.2, HPUX 11, and probably most other Unix flavors, at least -** as an emulation layer on top of native functions. -** ========================================================================= -*/ - -#include - -/* -** Macro to convert pointer-to-void* to pointer-to-function. This cast -** is undefined according to ISO C, but POSIX assumes that it works. -** (The '__extension__' in gnu compilers is only to avoid warnings.) -*/ -#if defined(__GNUC__) -#define cast_func(p) (__extension__ (lua_CFunction)(p)) -#else -#define cast_func(p) ((lua_CFunction)(p)) -#endif - - -static void lsys_unloadlib (void *lib) { - dlclose(lib); -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - void *lib = dlopen(path, RTLD_NOW | (seeglb ? RTLD_GLOBAL : RTLD_LOCAL)); - if (l_unlikely(lib == NULL)) - lua_pushstring(L, dlerror()); - return lib; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - lua_CFunction f = cast_func(dlsym(lib, sym)); - if (l_unlikely(f == NULL)) - lua_pushstring(L, dlerror()); - return f; -} - -/* }====================================================== */ - - - -#elif defined(LUA_DL_DLL) /* }{ */ -/* -** {====================================================================== -** This is an implementation of loadlib for Windows using native functions. -** ======================================================================= -*/ - -#include - - -/* -** optional flags for LoadLibraryEx -*/ -#if !defined(LUA_LLE_FLAGS) -#define LUA_LLE_FLAGS 0 -#endif - - -#undef setprogdir - - -/* -** Replace in the path (on the top of the stack) any occurrence -** of LUA_EXEC_DIR with the executable's path. -*/ -static void setprogdir (lua_State *L) { - char buff[MAX_PATH + 1]; - char *lb; - DWORD nsize = sizeof(buff)/sizeof(char); - DWORD n = GetModuleFileNameA(NULL, buff, nsize); /* get exec. name */ - if (n == 0 || n == nsize || (lb = strrchr(buff, '\\')) == NULL) - luaL_error(L, "unable to get ModuleFileName"); - else { - *lb = '\0'; /* cut name on the last '\\' to get the path */ - luaL_gsub(L, lua_tostring(L, -1), LUA_EXEC_DIR, buff); - lua_remove(L, -2); /* remove original string */ - } -} - - - - -static void pusherror (lua_State *L) { - int error = GetLastError(); - char buffer[128]; - if (FormatMessageA(FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM, - NULL, error, 0, buffer, sizeof(buffer)/sizeof(char), NULL)) - lua_pushstring(L, buffer); - else - lua_pushfstring(L, "system error %d\n", error); -} - -static void lsys_unloadlib (void *lib) { - FreeLibrary((HMODULE)lib); -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - HMODULE lib = LoadLibraryExA(path, NULL, LUA_LLE_FLAGS); - (void)(seeglb); /* not used: symbols are 'global' by default */ - if (lib == NULL) pusherror(L); - return lib; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - lua_CFunction f = (lua_CFunction)(voidf)GetProcAddress((HMODULE)lib, sym); - if (f == NULL) pusherror(L); - return f; -} - -/* }====================================================== */ - - -#else /* }{ */ -/* -** {====================================================== -** Fallback for other systems -** ======================================================= -*/ - -#undef LIB_FAIL -#define LIB_FAIL "absent" - - -#define DLMSG "dynamic libraries not enabled; check your Lua installation" - - -static void lsys_unloadlib (void *lib) { - (void)(lib); /* not used */ -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - (void)(path); (void)(seeglb); /* not used */ - lua_pushliteral(L, DLMSG); - return NULL; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - (void)(lib); (void)(sym); /* not used */ - lua_pushliteral(L, DLMSG); - return NULL; -} - -/* }====================================================== */ -#endif /* } */ - - -/* -** {================================================================== -** Set Paths -** =================================================================== -*/ - -/* -** LUA_PATH_VAR and LUA_CPATH_VAR are the names of the environment -** variables that Lua check to set its paths. -*/ -#if !defined(LUA_PATH_VAR) -#define LUA_PATH_VAR "LUA_PATH" -#endif - -#if !defined(LUA_CPATH_VAR) -#define LUA_CPATH_VAR "LUA_CPATH" -#endif - - - -/* -** return registry.LUA_NOENV as a boolean -*/ -static int noenv (lua_State *L) { - int b; - lua_getfield(L, LUA_REGISTRYINDEX, "LUA_NOENV"); - b = lua_toboolean(L, -1); - lua_pop(L, 1); /* remove value */ - return b; -} - - -/* -** Set a path. (If using the default path, assume it is a string -** literal in C and create it as an external string.) -*/ -static void setpath (lua_State *L, const char *fieldname, - const char *envname, - const char *dft) { - const char *dftmark; - const char *nver = lua_pushfstring(L, "%s%s", envname, LUA_VERSUFFIX); - const char *path = getenv(nver); /* try versioned name */ - if (path == NULL) /* no versioned environment variable? */ - path = getenv(envname); /* try unversioned name */ - if (path == NULL || noenv(L)) /* no environment variable? */ - lua_pushextlstring(L, dft, strlen(dft), NULL, NULL); /* use default */ - else if ((dftmark = strstr(path, LUA_PATH_SEP LUA_PATH_SEP)) == NULL) - lua_pushstring(L, path); /* nothing to change */ - else { /* path contains a ";;": insert default path in its place */ - size_t len = strlen(path); - luaL_Buffer b; - luaL_buffinit(L, &b); - if (path < dftmark) { /* is there a prefix before ';;'? */ - luaL_addlstring(&b, path, dftmark - path); /* add it */ - luaL_addchar(&b, *LUA_PATH_SEP); - } - luaL_addstring(&b, dft); /* add default */ - if (dftmark < path + len - 2) { /* is there a suffix after ';;'? */ - luaL_addchar(&b, *LUA_PATH_SEP); - luaL_addlstring(&b, dftmark + 2, (path + len - 2) - dftmark); - } - luaL_pushresult(&b); - } - setprogdir(L); - lua_setfield(L, -3, fieldname); /* package[fieldname] = path value */ - lua_pop(L, 1); /* pop versioned variable name ('nver') */ -} - -/* }================================================================== */ - - -/* -** return registry.CLIBS[path] -*/ -static void *checkclib (lua_State *L, const char *path) { - void *plib; - lua_getfield(L, LUA_REGISTRYINDEX, CLIBS); - lua_getfield(L, -1, path); - plib = lua_touserdata(L, -1); /* plib = CLIBS[path] */ - lua_pop(L, 2); /* pop CLIBS table and 'plib' */ - return plib; -} - - -/* -** registry.CLIBS[path] = plib -- for queries -** registry.CLIBS[#CLIBS + 1] = plib -- also keep a list of all libraries -*/ -static void addtoclib (lua_State *L, const char *path, void *plib) { - lua_getfield(L, LUA_REGISTRYINDEX, CLIBS); - lua_pushlightuserdata(L, plib); - lua_pushvalue(L, -1); - lua_setfield(L, -3, path); /* CLIBS[path] = plib */ - lua_rawseti(L, -2, luaL_len(L, -2) + 1); /* CLIBS[#CLIBS + 1] = plib */ - lua_pop(L, 1); /* pop CLIBS table */ -} - - -/* -** __gc tag method for CLIBS table: calls 'lsys_unloadlib' for all lib -** handles in list CLIBS -*/ -static int gctm (lua_State *L) { - lua_Integer n = luaL_len(L, 1); - for (; n >= 1; n--) { /* for each handle, in reverse order */ - lua_rawgeti(L, 1, n); /* get handle CLIBS[n] */ - lsys_unloadlib(lua_touserdata(L, -1)); - lua_pop(L, 1); /* pop handle */ - } - return 0; -} - - - -/* error codes for 'lookforfunc' */ -#define ERRLIB 1 -#define ERRFUNC 2 - -/* -** Look for a C function named 'sym' in a dynamically loaded library -** 'path'. -** First, check whether the library is already loaded; if not, try -** to load it. -** Then, if 'sym' is '*', return true (as library has been loaded). -** Otherwise, look for symbol 'sym' in the library and push a -** C function with that symbol. -** Return 0 and 'true' or a function in the stack; in case of -** errors, return an error code and an error message in the stack. -*/ -static int lookforfunc (lua_State *L, const char *path, const char *sym) { - void *reg = checkclib(L, path); /* check loaded C libraries */ - if (reg == NULL) { /* must load library? */ - reg = lsys_load(L, path, *sym == '*'); /* global symbols if 'sym'=='*' */ - if (reg == NULL) return ERRLIB; /* unable to load library */ - addtoclib(L, path, reg); - } - if (*sym == '*') { /* loading only library (no function)? */ - lua_pushboolean(L, 1); /* return 'true' */ - return 0; /* no errors */ - } - else { - lua_CFunction f = lsys_sym(L, reg, sym); - if (f == NULL) - return ERRFUNC; /* unable to find function */ - lua_pushcfunction(L, f); /* else create new function */ - return 0; /* no errors */ - } -} - - -static int ll_loadlib (lua_State *L) { - const char *path = luaL_checkstring(L, 1); - const char *init = luaL_checkstring(L, 2); - int stat = lookforfunc(L, path, init); - if (l_likely(stat == 0)) /* no errors? */ - return 1; /* return the loaded function */ - else { /* error; error message is on stack top */ - luaL_pushfail(L); - lua_insert(L, -2); - lua_pushstring(L, (stat == ERRLIB) ? LIB_FAIL : "init"); - return 3; /* return fail, error message, and where */ - } -} - - - -/* -** {====================================================== -** 'require' function -** ======================================================= -*/ - - -static int readable (const char *filename) { - FILE *f = fopen(filename, "r"); /* try to open file */ - if (f == NULL) return 0; /* open failed */ - fclose(f); - return 1; -} - - -/* -** Get the next name in '*path' = 'name1;name2;name3;...', changing -** the ending ';' to '\0' to create a zero-terminated string. Return -** NULL when list ends. -*/ -static const char *getnextfilename (char **path, char *end) { - char *sep; - char *name = *path; - if (name == end) - return NULL; /* no more names */ - else if (*name == '\0') { /* from previous iteration? */ - *name = *LUA_PATH_SEP; /* restore separator */ - name++; /* skip it */ - } - sep = strchr(name, *LUA_PATH_SEP); /* find next separator */ - if (sep == NULL) /* separator not found? */ - sep = end; /* name goes until the end */ - *sep = '\0'; /* finish file name */ - *path = sep; /* will start next search from here */ - return name; -} - - -/* -** Given a path such as ";blabla.so;blublu.so", pushes the string -** -** no file 'blabla.so' -** no file 'blublu.so' -*/ -static void pusherrornotfound (lua_State *L, const char *path) { - luaL_Buffer b; - luaL_buffinit(L, &b); - luaL_addstring(&b, "no file '"); - luaL_addgsub(&b, path, LUA_PATH_SEP, "'\n\tno file '"); - luaL_addstring(&b, "'"); - luaL_pushresult(&b); -} - - -static const char *searchpath (lua_State *L, const char *name, - const char *path, - const char *sep, - const char *dirsep) { - luaL_Buffer buff; - char *pathname; /* path with name inserted */ - char *endpathname; /* its end */ - const char *filename; - /* separator is non-empty and appears in 'name'? */ - if (*sep != '\0' && strchr(name, *sep) != NULL) - name = luaL_gsub(L, name, sep, dirsep); /* replace it by 'dirsep' */ - luaL_buffinit(L, &buff); - /* add path to the buffer, replacing marks ('?') with the file name */ - luaL_addgsub(&buff, path, LUA_PATH_MARK, name); - luaL_addchar(&buff, '\0'); - pathname = luaL_buffaddr(&buff); /* writable list of file names */ - endpathname = pathname + luaL_bufflen(&buff) - 1; - while ((filename = getnextfilename(&pathname, endpathname)) != NULL) { - if (readable(filename)) /* does file exist and is readable? */ - return lua_pushstring(L, filename); /* save and return name */ - } - luaL_pushresult(&buff); /* push path to create error message */ - pusherrornotfound(L, lua_tostring(L, -1)); /* create error message */ - return NULL; /* not found */ -} - - -static int ll_searchpath (lua_State *L) { - const char *f = searchpath(L, luaL_checkstring(L, 1), - luaL_checkstring(L, 2), - luaL_optstring(L, 3, "."), - luaL_optstring(L, 4, LUA_DIRSEP)); - if (f != NULL) return 1; - else { /* error message is on top of the stack */ - luaL_pushfail(L); - lua_insert(L, -2); - return 2; /* return fail + error message */ - } -} - - -static const char *findfile (lua_State *L, const char *name, - const char *pname, - const char *dirsep) { - const char *path; - lua_getfield(L, lua_upvalueindex(1), pname); - path = lua_tostring(L, -1); - if (l_unlikely(path == NULL)) - luaL_error(L, "'package.%s' must be a string", pname); - return searchpath(L, name, path, ".", dirsep); -} - - -static int checkload (lua_State *L, int stat, const char *filename) { - if (l_likely(stat)) { /* module loaded successfully? */ - lua_pushstring(L, filename); /* will be 2nd argument to module */ - return 2; /* return open function and file name */ - } - else - return luaL_error(L, "error loading module '%s' from file '%s':\n\t%s", - lua_tostring(L, 1), filename, lua_tostring(L, -1)); -} - - -static int searcher_Lua (lua_State *L) { - const char *filename; - const char *name = luaL_checkstring(L, 1); - filename = findfile(L, name, "path", LUA_LSUBSEP); - if (filename == NULL) return 1; /* module not found in this path */ - return checkload(L, (luaL_loadfile(L, filename) == LUA_OK), filename); -} - - -/* -** Try to find a load function for module 'modname' at file 'filename'. -** First, change '.' to '_' in 'modname'; then, if 'modname' has -** the form X-Y (that is, it has an "ignore mark"), build a function -** name "luaopen_X" and look for it. (For compatibility, if that -** fails, it also tries "luaopen_Y".) If there is no ignore mark, -** look for a function named "luaopen_modname". -*/ -static int loadfunc (lua_State *L, const char *filename, const char *modname) { - const char *openfunc; - const char *mark; - modname = luaL_gsub(L, modname, ".", LUA_OFSEP); - mark = strchr(modname, *LUA_IGMARK); - if (mark) { - int stat; - openfunc = lua_pushlstring(L, modname, mark - modname); - openfunc = lua_pushfstring(L, LUA_POF"%s", openfunc); - stat = lookforfunc(L, filename, openfunc); - if (stat != ERRFUNC) return stat; - modname = mark + 1; /* else go ahead and try old-style name */ - } - openfunc = lua_pushfstring(L, LUA_POF"%s", modname); - return lookforfunc(L, filename, openfunc); -} - - -static int searcher_C (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - const char *filename = findfile(L, name, "cpath", LUA_CSUBSEP); - if (filename == NULL) return 1; /* module not found in this path */ - return checkload(L, (loadfunc(L, filename, name) == 0), filename); -} - - -static int searcher_Croot (lua_State *L) { - const char *filename; - const char *name = luaL_checkstring(L, 1); - const char *p = strchr(name, '.'); - int stat; - if (p == NULL) return 0; /* is root */ - lua_pushlstring(L, name, p - name); - filename = findfile(L, lua_tostring(L, -1), "cpath", LUA_CSUBSEP); - if (filename == NULL) return 1; /* root not found */ - if ((stat = loadfunc(L, filename, name)) != 0) { - if (stat != ERRFUNC) - return checkload(L, 0, filename); /* real error */ - else { /* open function not found */ - lua_pushfstring(L, "no module '%s' in file '%s'", name, filename); - return 1; - } - } - lua_pushstring(L, filename); /* will be 2nd argument to module */ - return 2; -} - - -static int searcher_preload (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - lua_getfield(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - if (lua_getfield(L, -1, name) == LUA_TNIL) { /* not found? */ - lua_pushfstring(L, "no field package.preload['%s']", name); - return 1; - } - else { - lua_pushliteral(L, ":preload:"); - return 2; - } -} - - -static void findloader (lua_State *L, const char *name) { - int i; - luaL_Buffer msg; /* to build error message */ - /* push 'package.searchers' to index 3 in the stack */ - if (l_unlikely(lua_getfield(L, lua_upvalueindex(1), "searchers") - != LUA_TTABLE)) - luaL_error(L, "'package.searchers' must be a table"); - luaL_buffinit(L, &msg); - /* iterate over available searchers to find a loader */ - for (i = 1; ; i++) { - luaL_addstring(&msg, "\n\t"); /* error-message prefix */ - if (l_unlikely(lua_rawgeti(L, 3, i) == LUA_TNIL)) { /* no more searchers? */ - lua_pop(L, 1); /* remove nil */ - luaL_buffsub(&msg, 2); /* remove prefix */ - luaL_pushresult(&msg); /* create error message */ - luaL_error(L, "module '%s' not found:%s", name, lua_tostring(L, -1)); - } - lua_pushstring(L, name); - lua_call(L, 1, 2); /* call it */ - if (lua_isfunction(L, -2)) /* did it find a loader? */ - return; /* module loader found */ - else if (lua_isstring(L, -2)) { /* searcher returned error message? */ - lua_pop(L, 1); /* remove extra return */ - luaL_addvalue(&msg); /* concatenate error message */ - } - else { /* no error message */ - lua_pop(L, 2); /* remove both returns */ - luaL_buffsub(&msg, 2); /* remove prefix */ - } - } -} - - -static int ll_require (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - lua_settop(L, 1); /* LOADED table will be at index 2 */ - lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_getfield(L, 2, name); /* LOADED[name] */ - if (lua_toboolean(L, -1)) /* is it there? */ - return 1; /* package is already loaded */ - /* else must load package */ - lua_pop(L, 1); /* remove 'getfield' result */ - findloader(L, name); - lua_rotate(L, -2, 1); /* function <-> loader data */ - lua_pushvalue(L, 1); /* name is 1st argument to module loader */ - lua_pushvalue(L, -3); /* loader data is 2nd argument */ - /* stack: ...; loader data; loader function; mod. name; loader data */ - lua_call(L, 2, 1); /* run loader to load module */ - /* stack: ...; loader data; result from loader */ - if (!lua_isnil(L, -1)) /* non-nil return? */ - lua_setfield(L, 2, name); /* LOADED[name] = returned value */ - else - lua_pop(L, 1); /* pop nil */ - if (lua_getfield(L, 2, name) == LUA_TNIL) { /* module set no value? */ - lua_pushboolean(L, 1); /* use true as result */ - lua_copy(L, -1, -2); /* replace loader result */ - lua_setfield(L, 2, name); /* LOADED[name] = true */ - } - lua_rotate(L, -2, 1); /* loader data <-> module result */ - return 2; /* return module result and loader data */ -} - -/* }====================================================== */ - - - - -static const luaL_Reg pk_funcs[] = { - {"loadlib", ll_loadlib}, - {"searchpath", ll_searchpath}, - /* placeholders */ - {"preload", NULL}, - {"cpath", NULL}, - {"path", NULL}, - {"searchers", NULL}, - {"loaded", NULL}, - {NULL, NULL} -}; - - -static const luaL_Reg ll_funcs[] = { - {"require", ll_require}, - {NULL, NULL} -}; - - -static void createsearcherstable (lua_State *L) { - static const lua_CFunction searchers[] = { - searcher_preload, - searcher_Lua, - searcher_C, - searcher_Croot, - NULL - }; - int i; - /* create 'searchers' table */ - lua_createtable(L, sizeof(searchers)/sizeof(searchers[0]) - 1, 0); - /* fill it with predefined searchers */ - for (i=0; searchers[i] != NULL; i++) { - lua_pushvalue(L, -2); /* set 'package' as upvalue for all searchers */ - lua_pushcclosure(L, searchers[i], 1); - lua_rawseti(L, -2, i+1); - } - lua_setfield(L, -2, "searchers"); /* put it in field 'searchers' */ -} - - -/* -** create table CLIBS to keep track of loaded C libraries, -** setting a finalizer to close all libraries when closing state. -*/ -static void createclibstable (lua_State *L) { - luaL_getsubtable(L, LUA_REGISTRYINDEX, CLIBS); /* create CLIBS table */ - lua_createtable(L, 0, 1); /* create metatable for CLIBS */ - lua_pushcfunction(L, gctm); - lua_setfield(L, -2, "__gc"); /* set finalizer for CLIBS table */ - lua_setmetatable(L, -2); -} - - -LUAMOD_API int luaopen_package (lua_State *L) { - createclibstable(L); - luaL_newlib(L, pk_funcs); /* create 'package' table */ - createsearcherstable(L); - /* set paths */ - setpath(L, "path", LUA_PATH_VAR, LUA_PATH_DEFAULT); - setpath(L, "cpath", LUA_CPATH_VAR, LUA_CPATH_DEFAULT); - /* store config information */ - lua_pushliteral(L, LUA_DIRSEP "\n" LUA_PATH_SEP "\n" LUA_PATH_MARK "\n" - LUA_EXEC_DIR "\n" LUA_IGMARK "\n"); - lua_setfield(L, -2, "config"); - /* set field 'loaded' */ - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_setfield(L, -2, "loaded"); - /* set field 'preload' */ - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - lua_setfield(L, -2, "preload"); - lua_pushglobaltable(L); - lua_pushvalue(L, -2); /* set 'package' as upvalue for next lib */ - luaL_setfuncs(L, ll_funcs, 1); /* open lib into global table */ - lua_pop(L, 1); /* pop global table */ - return 1; /* return 'package' table */ -} - diff --git a/src/dependencies/lua/lobject.c b/src/dependencies/lua/lobject.c deleted file mode 100644 index 7504a69..0000000 --- a/src/dependencies/lua/lobject.c +++ /dev/null @@ -1,658 +0,0 @@ -/* -** $Id: lobject.c $ -** Some generic functions over Lua objects -** See Copyright Notice in lua.h -*/ - -#define lobject_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lctype.h" -#include "ldebug.h" -#include "ldo.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "lvm.h" - - -/* -** Computes ceil(log2(x)) -*/ -int luaO_ceillog2 (unsigned int x) { - static const lu_byte log_2[256] = { /* log_2[i - 1] = ceil(log2(i)) */ - 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, - 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, - 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, - 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8 - }; - int l = 0; - x--; - while (x >= 256) { l += 8; x >>= 8; } - return l + log_2[x]; -} - -/* -** Encodes 'p'% as a floating-point byte, represented as (eeeexxxx). -** The exponent is represented using excess-7. Mimicking IEEE 754, the -** representation normalizes the number when possible, assuming an extra -** 1 before the mantissa (xxxx) and adding one to the exponent (eeee) -** to signal that. So, the real value is (1xxxx) * 2^(eeee - 7 - 1) if -** eeee != 0, and (xxxx) * 2^-7 otherwise (subnormal numbers). -*/ -unsigned int luaO_codeparam (unsigned int p) { - if (p >= (cast(lu_mem, 0x1F) << (0xF - 7 - 1)) * 100u) /* overflow? */ - return 0xFF; /* return maximum value */ - else { - p = (cast(l_uint32, p) * 128 + 99) / 100; /* round up the division */ - if (p < 0x10) /* subnormal number? */ - return p; /* exponent bits are already zero; nothing else to do */ - else { - int log = luaO_ceillog2(p + 1) - 5; /* preserve 5 bits */ - return ((p >> log) - 0x10) | ((log + 1) << 4); - } - } -} - - -/* -** Computes 'p' times 'x', where 'p' is a floating-point byte. Roughly, -** we have to multiply 'x' by the mantissa and then shift accordingly to -** the exponent. If the exponent is positive, both the multiplication -** and the shift increase 'x', so we have to care only about overflows. -** For negative exponents, however, multiplying before the shift keeps -** more significant bits, as long as the multiplication does not -** overflow, so we check which order is best. -*/ -l_obj luaO_applyparam (unsigned int p, l_obj x) { - unsigned int m = p & 0xF; /* mantissa */ - int e = (p >> 4); /* exponent */ - if (e > 0) { /* normalized? */ - e--; /* correct exponent */ - m += 0x10; /* correct mantissa; maximum value is 0x1F */ - } - e -= 7; /* correct excess-7 */ - if (e >= 0) { - if (x < (MAX_LOBJ / 0x1F) >> e) /* no overflow? */ - return (x * m) << e; /* order doesn't matter here */ - else /* real overflow */ - return MAX_LOBJ; - } - else { /* negative exponent */ - e = -e; - if (x < MAX_LOBJ / 0x1F) /* multiplication cannot overflow? */ - return (x * m) >> e; /* multiplying first gives more precision */ - else if ((x >> e) < MAX_LOBJ / 0x1F) /* cannot overflow after shift? */ - return (x >> e) * m; - else /* real overflow */ - return MAX_LOBJ; - } -} - - -static lua_Integer intarith (lua_State *L, int op, lua_Integer v1, - lua_Integer v2) { - switch (op) { - case LUA_OPADD: return intop(+, v1, v2); - case LUA_OPSUB:return intop(-, v1, v2); - case LUA_OPMUL:return intop(*, v1, v2); - case LUA_OPMOD: return luaV_mod(L, v1, v2); - case LUA_OPIDIV: return luaV_idiv(L, v1, v2); - case LUA_OPBAND: return intop(&, v1, v2); - case LUA_OPBOR: return intop(|, v1, v2); - case LUA_OPBXOR: return intop(^, v1, v2); - case LUA_OPSHL: return luaV_shiftl(v1, v2); - case LUA_OPSHR: return luaV_shiftr(v1, v2); - case LUA_OPUNM: return intop(-, 0, v1); - case LUA_OPBNOT: return intop(^, ~l_castS2U(0), v1); - default: lua_assert(0); return 0; - } -} - - -static lua_Number numarith (lua_State *L, int op, lua_Number v1, - lua_Number v2) { - switch (op) { - case LUA_OPADD: return luai_numadd(L, v1, v2); - case LUA_OPSUB: return luai_numsub(L, v1, v2); - case LUA_OPMUL: return luai_nummul(L, v1, v2); - case LUA_OPDIV: return luai_numdiv(L, v1, v2); - case LUA_OPPOW: return luai_numpow(L, v1, v2); - case LUA_OPIDIV: return luai_numidiv(L, v1, v2); - case LUA_OPUNM: return luai_numunm(L, v1); - case LUA_OPMOD: return luaV_modf(L, v1, v2); - default: lua_assert(0); return 0; - } -} - - -int luaO_rawarith (lua_State *L, int op, const TValue *p1, const TValue *p2, - TValue *res) { - switch (op) { - case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: - case LUA_OPSHL: case LUA_OPSHR: - case LUA_OPBNOT: { /* operate only on integers */ - lua_Integer i1; lua_Integer i2; - if (tointegerns(p1, &i1) && tointegerns(p2, &i2)) { - setivalue(res, intarith(L, op, i1, i2)); - return 1; - } - else return 0; /* fail */ - } - case LUA_OPDIV: case LUA_OPPOW: { /* operate only on floats */ - lua_Number n1; lua_Number n2; - if (tonumberns(p1, n1) && tonumberns(p2, n2)) { - setfltvalue(res, numarith(L, op, n1, n2)); - return 1; - } - else return 0; /* fail */ - } - default: { /* other operations */ - lua_Number n1; lua_Number n2; - if (ttisinteger(p1) && ttisinteger(p2)) { - setivalue(res, intarith(L, op, ivalue(p1), ivalue(p2))); - return 1; - } - else if (tonumberns(p1, n1) && tonumberns(p2, n2)) { - setfltvalue(res, numarith(L, op, n1, n2)); - return 1; - } - else return 0; /* fail */ - } - } -} - - -void luaO_arith (lua_State *L, int op, const TValue *p1, const TValue *p2, - StkId res) { - if (!luaO_rawarith(L, op, p1, p2, s2v(res))) { - /* could not perform raw operation; try metamethod */ - luaT_trybinTM(L, p1, p2, res, cast(TMS, (op - LUA_OPADD) + TM_ADD)); - } -} - - -int luaO_hexavalue (int c) { - if (lisdigit(c)) return c - '0'; - else return (ltolower(c) - 'a') + 10; -} - - -static int isneg (const char **s) { - if (**s == '-') { (*s)++; return 1; } - else if (**s == '+') (*s)++; - return 0; -} - - - -/* -** {================================================================== -** Lua's implementation for 'lua_strx2number' -** =================================================================== -*/ - -#if !defined(lua_strx2number) - -/* maximum number of significant digits to read (to avoid overflows - even with single floats) */ -#define MAXSIGDIG 30 - -/* -** convert a hexadecimal numeric string to a number, following -** C99 specification for 'strtod' -*/ -static lua_Number lua_strx2number (const char *s, char **endptr) { - int dot = lua_getlocaledecpoint(); - lua_Number r = l_mathop(0.0); /* result (accumulator) */ - int sigdig = 0; /* number of significant digits */ - int nosigdig = 0; /* number of non-significant digits */ - int e = 0; /* exponent correction */ - int neg; /* 1 if number is negative */ - int hasdot = 0; /* true after seen a dot */ - *endptr = cast_charp(s); /* nothing is valid yet */ - while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */ - neg = isneg(&s); /* check sign */ - if (!(*s == '0' && (*(s + 1) == 'x' || *(s + 1) == 'X'))) /* check '0x' */ - return l_mathop(0.0); /* invalid format (no '0x') */ - for (s += 2; ; s++) { /* skip '0x' and read numeral */ - if (*s == dot) { - if (hasdot) break; /* second dot? stop loop */ - else hasdot = 1; - } - else if (lisxdigit(cast_uchar(*s))) { - if (sigdig == 0 && *s == '0') /* non-significant digit (zero)? */ - nosigdig++; - else if (++sigdig <= MAXSIGDIG) /* can read it without overflow? */ - r = (r * l_mathop(16.0)) + luaO_hexavalue(*s); - else e++; /* too many digits; ignore, but still count for exponent */ - if (hasdot) e--; /* decimal digit? correct exponent */ - } - else break; /* neither a dot nor a digit */ - } - if (nosigdig + sigdig == 0) /* no digits? */ - return l_mathop(0.0); /* invalid format */ - *endptr = cast_charp(s); /* valid up to here */ - e *= 4; /* each digit multiplies/divides value by 2^4 */ - if (*s == 'p' || *s == 'P') { /* exponent part? */ - int exp1 = 0; /* exponent value */ - int neg1; /* exponent sign */ - s++; /* skip 'p' */ - neg1 = isneg(&s); /* sign */ - if (!lisdigit(cast_uchar(*s))) - return l_mathop(0.0); /* invalid; must have at least one digit */ - while (lisdigit(cast_uchar(*s))) /* read exponent */ - exp1 = exp1 * 10 + *(s++) - '0'; - if (neg1) exp1 = -exp1; - e += exp1; - *endptr = cast_charp(s); /* valid up to here */ - } - if (neg) r = -r; - return l_mathop(ldexp)(r, e); -} - -#endif -/* }====================================================== */ - - -/* maximum length of a numeral to be converted to a number */ -#if !defined (L_MAXLENNUM) -#define L_MAXLENNUM 200 -#endif - -/* -** Convert string 's' to a Lua number (put in 'result'). Return NULL on -** fail or the address of the ending '\0' on success. ('mode' == 'x') -** means a hexadecimal numeral. -*/ -static const char *l_str2dloc (const char *s, lua_Number *result, int mode) { - char *endptr; - *result = (mode == 'x') ? lua_strx2number(s, &endptr) /* try to convert */ - : lua_str2number(s, &endptr); - if (endptr == s) return NULL; /* nothing recognized? */ - while (lisspace(cast_uchar(*endptr))) endptr++; /* skip trailing spaces */ - return (*endptr == '\0') ? endptr : NULL; /* OK iff no trailing chars */ -} - - -/* -** Convert string 's' to a Lua number (put in 'result') handling the -** current locale. -** This function accepts both the current locale or a dot as the radix -** mark. If the conversion fails, it may mean number has a dot but -** locale accepts something else. In that case, the code copies 's' -** to a buffer (because 's' is read-only), changes the dot to the -** current locale radix mark, and tries to convert again. -** The variable 'mode' checks for special characters in the string: -** - 'n' means 'inf' or 'nan' (which should be rejected) -** - 'x' means a hexadecimal numeral -** - '.' just optimizes the search for the common case (no special chars) -*/ -static const char *l_str2d (const char *s, lua_Number *result) { - const char *endptr; - const char *pmode = strpbrk(s, ".xXnN"); /* look for special chars */ - int mode = pmode ? ltolower(cast_uchar(*pmode)) : 0; - if (mode == 'n') /* reject 'inf' and 'nan' */ - return NULL; - endptr = l_str2dloc(s, result, mode); /* try to convert */ - if (endptr == NULL) { /* failed? may be a different locale */ - char buff[L_MAXLENNUM + 1]; - const char *pdot = strchr(s, '.'); - if (pdot == NULL || strlen(s) > L_MAXLENNUM) - return NULL; /* string too long or no dot; fail */ - strcpy(buff, s); /* copy string to buffer */ - buff[pdot - s] = lua_getlocaledecpoint(); /* correct decimal point */ - endptr = l_str2dloc(buff, result, mode); /* try again */ - if (endptr != NULL) - endptr = s + (endptr - buff); /* make relative to 's' */ - } - return endptr; -} - - -#define MAXBY10 cast(lua_Unsigned, LUA_MAXINTEGER / 10) -#define MAXLASTD cast_int(LUA_MAXINTEGER % 10) - -static const char *l_str2int (const char *s, lua_Integer *result) { - lua_Unsigned a = 0; - int empty = 1; - int neg; - while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */ - neg = isneg(&s); - if (s[0] == '0' && - (s[1] == 'x' || s[1] == 'X')) { /* hex? */ - s += 2; /* skip '0x' */ - for (; lisxdigit(cast_uchar(*s)); s++) { - a = a * 16 + luaO_hexavalue(*s); - empty = 0; - } - } - else { /* decimal */ - for (; lisdigit(cast_uchar(*s)); s++) { - int d = *s - '0'; - if (a >= MAXBY10 && (a > MAXBY10 || d > MAXLASTD + neg)) /* overflow? */ - return NULL; /* do not accept it (as integer) */ - a = a * 10 + d; - empty = 0; - } - } - while (lisspace(cast_uchar(*s))) s++; /* skip trailing spaces */ - if (empty || *s != '\0') return NULL; /* something wrong in the numeral */ - else { - *result = l_castU2S((neg) ? 0u - a : a); - return s; - } -} - - -size_t luaO_str2num (const char *s, TValue *o) { - lua_Integer i; lua_Number n; - const char *e; - if ((e = l_str2int(s, &i)) != NULL) { /* try as an integer */ - setivalue(o, i); - } - else if ((e = l_str2d(s, &n)) != NULL) { /* else try as a float */ - setfltvalue(o, n); - } - else - return 0; /* conversion failed */ - return (e - s) + 1; /* success; return string size */ -} - - -int luaO_utf8esc (char *buff, unsigned long x) { - int n = 1; /* number of bytes put in buffer (backwards) */ - lua_assert(x <= 0x7FFFFFFFu); - if (x < 0x80) /* ascii? */ - buff[UTF8BUFFSZ - 1] = cast_char(x); - else { /* need continuation bytes */ - unsigned int mfb = 0x3f; /* maximum that fits in first byte */ - do { /* add continuation bytes */ - buff[UTF8BUFFSZ - (n++)] = cast_char(0x80 | (x & 0x3f)); - x >>= 6; /* remove added bits */ - mfb >>= 1; /* now there is one less bit available in first byte */ - } while (x > mfb); /* still needs continuation byte? */ - buff[UTF8BUFFSZ - n] = cast_char((~mfb << 1) | x); /* add first byte */ - } - return n; -} - - -/* -** Maximum length of the conversion of a number to a string. Must be -** enough to accommodate both LUA_INTEGER_FMT and LUA_NUMBER_FMT. -** (For a long long int, this is 19 digits plus a sign and a final '\0', -** adding to 21. For a long double, it can go to a sign, 33 digits, -** the dot, an exponent letter, an exponent sign, 5 exponent digits, -** and a final '\0', adding to 43.) -*/ -#define MAXNUMBER2STR 44 - - -/* -** Convert a number object to a string, adding it to a buffer -*/ -static int tostringbuff (TValue *obj, char *buff) { - int len; - lua_assert(ttisnumber(obj)); - if (ttisinteger(obj)) - len = lua_integer2str(buff, MAXNUMBER2STR, ivalue(obj)); - else { - len = lua_number2str(buff, MAXNUMBER2STR, fltvalue(obj)); - if (buff[strspn(buff, "-0123456789")] == '\0') { /* looks like an int? */ - buff[len++] = lua_getlocaledecpoint(); - buff[len++] = '0'; /* adds '.0' to result */ - } - } - return len; -} - - -/* -** Convert a number object to a Lua string, replacing the value at 'obj' -*/ -void luaO_tostring (lua_State *L, TValue *obj) { - char buff[MAXNUMBER2STR]; - int len = tostringbuff(obj, buff); - setsvalue(L, obj, luaS_newlstr(L, buff, len)); -} - - - - -/* -** {================================================================== -** 'luaO_pushvfstring' -** =================================================================== -*/ - -/* -** Size for buffer space used by 'luaO_pushvfstring'. It should be -** (LUA_IDSIZE + MAXNUMBER2STR) + a minimal space for basic messages, -** so that 'luaG_addinfo' can work directly on the buffer. -*/ -#define BUFVFS (LUA_IDSIZE + MAXNUMBER2STR + 95) - -/* buffer used by 'luaO_pushvfstring' */ -typedef struct BuffFS { - lua_State *L; - int pushed; /* true if there is a part of the result on the stack */ - int blen; /* length of partial string in 'space' */ - char space[BUFVFS]; /* holds last part of the result */ -} BuffFS; - - -/* -** Push given string to the stack, as part of the result, and -** join it to previous partial result if there is one. -** It may call 'luaV_concat' while using one slot from EXTRA_STACK. -** This call cannot invoke metamethods, as both operands must be -** strings. It can, however, raise an error if the result is too -** long. In that case, 'luaV_concat' frees the extra slot before -** raising the error. -*/ -static void pushstr (BuffFS *buff, const char *str, size_t lstr) { - lua_State *L = buff->L; - setsvalue2s(L, L->top.p, luaS_newlstr(L, str, lstr)); - L->top.p++; /* may use one slot from EXTRA_STACK */ - if (!buff->pushed) /* no previous string on the stack? */ - buff->pushed = 1; /* now there is one */ - else /* join previous string with new one */ - luaV_concat(L, 2); -} - - -/* -** empty the buffer space into the stack -*/ -static void clearbuff (BuffFS *buff) { - pushstr(buff, buff->space, buff->blen); /* push buffer contents */ - buff->blen = 0; /* space now is empty */ -} - - -/* -** Get a space of size 'sz' in the buffer. If buffer has not enough -** space, empty it. 'sz' must fit in an empty buffer. -*/ -static char *getbuff (BuffFS *buff, int sz) { - lua_assert(buff->blen <= BUFVFS); lua_assert(sz <= BUFVFS); - if (sz > BUFVFS - buff->blen) /* not enough space? */ - clearbuff(buff); - return buff->space + buff->blen; -} - - -#define addsize(b,sz) ((b)->blen += (sz)) - - -/* -** Add 'str' to the buffer. If string is larger than the buffer space, -** push the string directly to the stack. -*/ -static void addstr2buff (BuffFS *buff, const char *str, size_t slen) { - if (slen <= BUFVFS) { /* does string fit into buffer? */ - char *bf = getbuff(buff, cast_int(slen)); - memcpy(bf, str, slen); /* add string to buffer */ - addsize(buff, cast_int(slen)); - } - else { /* string larger than buffer */ - clearbuff(buff); /* string comes after buffer's content */ - pushstr(buff, str, slen); /* push string */ - } -} - - -/* -** Add a numeral to the buffer. -*/ -static void addnum2buff (BuffFS *buff, TValue *num) { - char *numbuff = getbuff(buff, MAXNUMBER2STR); - int len = tostringbuff(num, numbuff); /* format number into 'numbuff' */ - addsize(buff, len); -} - - -/* -** this function handles only '%d', '%c', '%f', '%p', '%s', and '%%' - conventional formats, plus Lua-specific '%I' and '%U' -*/ -const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) { - BuffFS buff; /* holds last part of the result */ - const char *e; /* points to next '%' */ - buff.pushed = buff.blen = 0; - buff.L = L; - while ((e = strchr(fmt, '%')) != NULL) { - addstr2buff(&buff, fmt, e - fmt); /* add 'fmt' up to '%' */ - switch (*(e + 1)) { /* conversion specifier */ - case 's': { /* zero-terminated string */ - const char *s = va_arg(argp, char *); - if (s == NULL) s = "(null)"; - addstr2buff(&buff, s, strlen(s)); - break; - } - case 'c': { /* an 'int' as a character */ - char c = cast_uchar(va_arg(argp, int)); - addstr2buff(&buff, &c, sizeof(char)); - break; - } - case 'd': { /* an 'int' */ - TValue num; - setivalue(&num, va_arg(argp, int)); - addnum2buff(&buff, &num); - break; - } - case 'I': { /* a 'lua_Integer' */ - TValue num; - setivalue(&num, cast(lua_Integer, va_arg(argp, l_uacInt))); - addnum2buff(&buff, &num); - break; - } - case 'f': { /* a 'lua_Number' */ - TValue num; - setfltvalue(&num, cast_num(va_arg(argp, l_uacNumber))); - addnum2buff(&buff, &num); - break; - } - case 'p': { /* a pointer */ - const int sz = 3 * sizeof(void*) + 8; /* enough space for '%p' */ - char *bf = getbuff(&buff, sz); - void *p = va_arg(argp, void *); - int len = lua_pointer2str(bf, sz, p); - addsize(&buff, len); - break; - } - case 'U': { /* a 'long' as a UTF-8 sequence */ - char bf[UTF8BUFFSZ]; - int len = luaO_utf8esc(bf, va_arg(argp, long)); - addstr2buff(&buff, bf + UTF8BUFFSZ - len, len); - break; - } - case '%': { - addstr2buff(&buff, "%", 1); - break; - } - default: { - luaG_runerror(L, "invalid option '%%%c' to 'lua_pushfstring'", - *(e + 1)); - } - } - fmt = e + 2; /* skip '%' and the specifier */ - } - addstr2buff(&buff, fmt, strlen(fmt)); /* rest of 'fmt' */ - clearbuff(&buff); /* empty buffer into the stack */ - lua_assert(buff.pushed == 1); - return getstr(tsvalue(s2v(L->top.p - 1))); -} - - -const char *luaO_pushfstring (lua_State *L, const char *fmt, ...) { - const char *msg; - va_list argp; - va_start(argp, fmt); - msg = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - return msg; -} - -/* }================================================================== */ - - -#define RETS "..." -#define PRE "[string \"" -#define POS "\"]" - -#define addstr(a,b,l) ( memcpy(a,b,(l) * sizeof(char)), a += (l) ) - -void luaO_chunkid (char *out, const char *source, size_t srclen) { - size_t bufflen = LUA_IDSIZE; /* free space in buffer */ - if (*source == '=') { /* 'literal' source */ - if (srclen <= bufflen) /* small enough? */ - memcpy(out, source + 1, srclen * sizeof(char)); - else { /* truncate it */ - addstr(out, source + 1, bufflen - 1); - *out = '\0'; - } - } - else if (*source == '@') { /* file name */ - if (srclen <= bufflen) /* small enough? */ - memcpy(out, source + 1, srclen * sizeof(char)); - else { /* add '...' before rest of name */ - addstr(out, RETS, LL(RETS)); - bufflen -= LL(RETS); - memcpy(out, source + 1 + srclen - bufflen, bufflen * sizeof(char)); - } - } - else { /* string; format as [string "source"] */ - const char *nl = strchr(source, '\n'); /* find first new line (if any) */ - addstr(out, PRE, LL(PRE)); /* add prefix */ - bufflen -= LL(PRE RETS POS) + 1; /* save space for prefix+suffix+'\0' */ - if (srclen < bufflen && nl == NULL) { /* small one-line source? */ - addstr(out, source, srclen); /* keep it */ - } - else { - if (nl != NULL) srclen = nl - source; /* stop at first newline */ - if (srclen > bufflen) srclen = bufflen; - addstr(out, source, srclen); - addstr(out, RETS, LL(RETS)); - } - memcpy(out, POS, (LL(POS) + 1) * sizeof(char)); - } -} - diff --git a/src/dependencies/lua/lobject.h b/src/dependencies/lua/lobject.h deleted file mode 100644 index 169512f..0000000 --- a/src/dependencies/lua/lobject.h +++ /dev/null @@ -1,857 +0,0 @@ -/* -** $Id: lobject.h $ -** Type definitions for Lua objects -** See Copyright Notice in lua.h -*/ - - -#ifndef lobject_h -#define lobject_h - - -#include - - -#include "llimits.h" -#include "lua.h" - - -/* -** Extra types for collectable non-values -*/ -#define LUA_TUPVAL LUA_NUMTYPES /* upvalues */ -#define LUA_TPROTO (LUA_NUMTYPES+1) /* function prototypes */ -#define LUA_TDEADKEY (LUA_NUMTYPES+2) /* removed keys in tables */ - - - -/* -** number of all possible types (including LUA_TNONE but excluding DEADKEY) -*/ -#define LUA_TOTALTYPES (LUA_TPROTO + 2) - - -/* -** tags for Tagged Values have the following use of bits: -** bits 0-3: actual tag (a LUA_T* constant) -** bits 4-5: variant bits -** bit 6: whether value is collectable -*/ - -/* add variant bits to a type */ -#define makevariant(t,v) ((t) | ((v) << 4)) - - - -/* -** Union of all Lua values -*/ -typedef union Value { - struct GCObject *gc; /* collectable objects */ - void *p; /* light userdata */ - lua_CFunction f; /* light C functions */ - lua_Integer i; /* integer numbers */ - lua_Number n; /* float numbers */ - /* not used, but may avoid warnings for uninitialized value */ - lu_byte ub; -} Value; - - -/* -** Tagged Values. This is the basic representation of values in Lua: -** an actual value plus a tag with its type. -*/ - -#define TValuefields Value value_; lu_byte tt_ - -typedef struct TValue { - TValuefields; -} TValue; - - -#define val_(o) ((o)->value_) -#define valraw(o) (val_(o)) - - -/* raw type tag of a TValue */ -#define rawtt(o) ((o)->tt_) - -/* tag with no variants (bits 0-3) */ -#define novariant(t) ((t) & 0x0F) - -/* type tag of a TValue (bits 0-3 for tags + variant bits 4-5) */ -#define withvariant(t) ((t) & 0x3F) -#define ttypetag(o) withvariant(rawtt(o)) - -/* type of a TValue */ -#define ttype(o) (novariant(rawtt(o))) - - -/* Macros to test type */ -#define checktag(o,t) (rawtt(o) == (t)) -#define checktype(o,t) (ttype(o) == (t)) - - -/* Macros for internal tests */ - -/* collectable object has the same tag as the original value */ -#define righttt(obj) (ttypetag(obj) == gcvalue(obj)->tt) - -/* -** Any value being manipulated by the program either is non -** collectable, or the collectable object has the right tag -** and it is not dead. The option 'L == NULL' allows other -** macros using this one to be used where L is not available. -*/ -#define checkliveness(L,obj) \ - ((void)L, lua_longassert(!iscollectable(obj) || \ - (righttt(obj) && (L == NULL || !isdead(G(L),gcvalue(obj)))))) - - -/* Macros to set values */ - -/* set a value's tag */ -#define settt_(o,t) ((o)->tt_=(t)) - - -/* main macro to copy values (from 'obj2' to 'obj1') */ -#define setobj(L,obj1,obj2) \ - { TValue *io1=(obj1); const TValue *io2=(obj2); \ - io1->value_ = io2->value_; settt_(io1, io2->tt_); \ - checkliveness(L,io1); lua_assert(!isnonstrictnil(io1)); } - -/* -** Different types of assignments, according to source and destination. -** (They are mostly equal now, but may be different in the future.) -*/ - -/* from stack to stack */ -#define setobjs2s(L,o1,o2) setobj(L,s2v(o1),s2v(o2)) -/* to stack (not from same stack) */ -#define setobj2s(L,o1,o2) setobj(L,s2v(o1),o2) -/* from table to same table */ -#define setobjt2t setobj -/* to new object */ -#define setobj2n setobj -/* to table */ -#define setobj2t setobj - - -/* -** Entries in a Lua stack. Field 'tbclist' forms a list of all -** to-be-closed variables active in this stack. Dummy entries are -** used when the distance between two tbc variables does not fit -** in an unsigned short. They are represented by delta==0, and -** their real delta is always the maximum value that fits in -** that field. -*/ -typedef union StackValue { - TValue val; - struct { - TValuefields; - unsigned short delta; - } tbclist; -} StackValue; - - -/* index to stack elements */ -typedef StackValue *StkId; - - -/* -** When reallocating the stack, change all pointers to the stack into -** proper offsets. -*/ -typedef union { - StkId p; /* actual pointer */ - ptrdiff_t offset; /* used while the stack is being reallocated */ -} StkIdRel; - - -/* convert a 'StackValue' to a 'TValue' */ -#define s2v(o) (&(o)->val) - - - -/* -** {================================================================== -** Nil -** =================================================================== -*/ - -/* Standard nil */ -#define LUA_VNIL makevariant(LUA_TNIL, 0) - -/* Empty slot (which might be different from a slot containing nil) */ -#define LUA_VEMPTY makevariant(LUA_TNIL, 1) - -/* Value returned for a key not found in a table (absent key) */ -#define LUA_VABSTKEY makevariant(LUA_TNIL, 2) - -/* Special variant to signal that a fast get is accessing a non-table */ -#define LUA_VNOTABLE makevariant(LUA_TNIL, 3) - - -/* macro to test for (any kind of) nil */ -#define ttisnil(v) checktype((v), LUA_TNIL) - -/* -** Macro to test the result of a table access. Formally, it should -** distinguish between LUA_VEMPTY/LUA_VABSTKEY/LUA_VNOTABLE and -** other tags. As currently nil is equivalent to LUA_VEMPTY, it is -** simpler to just test whether the value is nil. -*/ -#define tagisempty(tag) (novariant(tag) == LUA_TNIL) - - -/* macro to test for a standard nil */ -#define ttisstrictnil(o) checktag((o), LUA_VNIL) - - -#define setnilvalue(obj) settt_(obj, LUA_VNIL) - - -#define isabstkey(v) checktag((v), LUA_VABSTKEY) - - -/* -** macro to detect non-standard nils (used only in assertions) -*/ -#define isnonstrictnil(v) (ttisnil(v) && !ttisstrictnil(v)) - - -/* -** By default, entries with any kind of nil are considered empty. -** (In any definition, values associated with absent keys must also -** be accepted as empty.) -*/ -#define isempty(v) ttisnil(v) - - -/* macro defining a value corresponding to an absent key */ -#define ABSTKEYCONSTANT {NULL}, LUA_VABSTKEY - - -/* mark an entry as empty */ -#define setempty(v) settt_(v, LUA_VEMPTY) - - - -/* }================================================================== */ - - -/* -** {================================================================== -** Booleans -** =================================================================== -*/ - - -#define LUA_VFALSE makevariant(LUA_TBOOLEAN, 0) -#define LUA_VTRUE makevariant(LUA_TBOOLEAN, 1) - -#define ttisboolean(o) checktype((o), LUA_TBOOLEAN) -#define ttisfalse(o) checktag((o), LUA_VFALSE) -#define ttistrue(o) checktag((o), LUA_VTRUE) - - -#define l_isfalse(o) (ttisfalse(o) || ttisnil(o)) -#define tagisfalse(t) ((t) == LUA_VFALSE || novariant(t) == LUA_TNIL) - - - -#define setbfvalue(obj) settt_(obj, LUA_VFALSE) -#define setbtvalue(obj) settt_(obj, LUA_VTRUE) - -/* }================================================================== */ - - -/* -** {================================================================== -** Threads -** =================================================================== -*/ - -#define LUA_VTHREAD makevariant(LUA_TTHREAD, 0) - -#define ttisthread(o) checktag((o), ctb(LUA_VTHREAD)) - -#define thvalue(o) check_exp(ttisthread(o), gco2th(val_(o).gc)) - -#define setthvalue(L,obj,x) \ - { TValue *io = (obj); lua_State *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTHREAD)); \ - checkliveness(L,io); } - -#define setthvalue2s(L,o,t) setthvalue(L,s2v(o),t) - -/* }================================================================== */ - - -/* -** {================================================================== -** Collectable Objects -** =================================================================== -*/ - -/* -** Common Header for all collectable objects (in macro form, to be -** included in other objects) -*/ -#define CommonHeader struct GCObject *next; lu_byte tt; lu_byte marked - - -/* Common type for all collectable objects */ -typedef struct GCObject { - CommonHeader; -} GCObject; - - -/* Bit mark for collectable types */ -#define BIT_ISCOLLECTABLE (1 << 6) - -#define iscollectable(o) (rawtt(o) & BIT_ISCOLLECTABLE) - -/* mark a tag as collectable */ -#define ctb(t) ((t) | BIT_ISCOLLECTABLE) - -#define gcvalue(o) check_exp(iscollectable(o), val_(o).gc) - -#define gcvalueraw(v) ((v).gc) - -#define setgcovalue(L,obj,x) \ - { TValue *io = (obj); GCObject *i_g=(x); \ - val_(io).gc = i_g; settt_(io, ctb(i_g->tt)); } - -/* }================================================================== */ - - -/* -** {================================================================== -** Numbers -** =================================================================== -*/ - -/* Variant tags for numbers */ -#define LUA_VNUMINT makevariant(LUA_TNUMBER, 0) /* integer numbers */ -#define LUA_VNUMFLT makevariant(LUA_TNUMBER, 1) /* float numbers */ - -#define ttisnumber(o) checktype((o), LUA_TNUMBER) -#define ttisfloat(o) checktag((o), LUA_VNUMFLT) -#define ttisinteger(o) checktag((o), LUA_VNUMINT) - -#define nvalue(o) check_exp(ttisnumber(o), \ - (ttisinteger(o) ? cast_num(ivalue(o)) : fltvalue(o))) -#define fltvalue(o) check_exp(ttisfloat(o), val_(o).n) -#define ivalue(o) check_exp(ttisinteger(o), val_(o).i) - -#define fltvalueraw(v) ((v).n) -#define ivalueraw(v) ((v).i) - -#define setfltvalue(obj,x) \ - { TValue *io=(obj); val_(io).n=(x); settt_(io, LUA_VNUMFLT); } - -#define chgfltvalue(obj,x) \ - { TValue *io=(obj); lua_assert(ttisfloat(io)); val_(io).n=(x); } - -#define setivalue(obj,x) \ - { TValue *io=(obj); val_(io).i=(x); settt_(io, LUA_VNUMINT); } - -#define chgivalue(obj,x) \ - { TValue *io=(obj); lua_assert(ttisinteger(io)); val_(io).i=(x); } - -/* }================================================================== */ - - -/* -** {================================================================== -** Strings -** =================================================================== -*/ - -/* Variant tags for strings */ -#define LUA_VSHRSTR makevariant(LUA_TSTRING, 0) /* short strings */ -#define LUA_VLNGSTR makevariant(LUA_TSTRING, 1) /* long strings */ - -#define ttisstring(o) checktype((o), LUA_TSTRING) -#define ttisshrstring(o) checktag((o), ctb(LUA_VSHRSTR)) -#define ttislngstring(o) checktag((o), ctb(LUA_VLNGSTR)) - -#define tsvalueraw(v) (gco2ts((v).gc)) - -#define tsvalue(o) check_exp(ttisstring(o), gco2ts(val_(o).gc)) - -#define setsvalue(L,obj,x) \ - { TValue *io = (obj); TString *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(x_->tt)); \ - checkliveness(L,io); } - -/* set a string to the stack */ -#define setsvalue2s(L,o,s) setsvalue(L,s2v(o),s) - -/* set a string to a new object */ -#define setsvalue2n setsvalue - - -/* Kinds of long strings (stored in 'shrlen') */ -#define LSTRREG -1 /* regular long string */ -#define LSTRFIX -2 /* fixed external long string */ -#define LSTRMEM -3 /* external long string with deallocation */ - - -/* -** Header for a string value. -*/ -typedef struct TString { - CommonHeader; - lu_byte extra; /* reserved words for short strings; "has hash" for longs */ - ls_byte shrlen; /* length for short strings, negative for long strings */ - unsigned int hash; - union { - size_t lnglen; /* length for long strings */ - struct TString *hnext; /* linked list for hash table */ - } u; - char *contents; /* pointer to content in long strings */ - lua_Alloc falloc; /* deallocation function for external strings */ - void *ud; /* user data for external strings */ -} TString; - - -#define strisshr(ts) ((ts)->shrlen >= 0) - - -/* -** Get the actual string (array of bytes) from a 'TString'. (Generic -** version and specialized versions for long and short strings.) -*/ -#define rawgetshrstr(ts) (cast_charp(&(ts)->contents)) -#define getshrstr(ts) check_exp(strisshr(ts), rawgetshrstr(ts)) -#define getlngstr(ts) check_exp(!strisshr(ts), (ts)->contents) -#define getstr(ts) (strisshr(ts) ? rawgetshrstr(ts) : (ts)->contents) - - -/* get string length from 'TString *ts' */ -#define tsslen(ts) \ - (strisshr(ts) ? cast_uint((ts)->shrlen) : (ts)->u.lnglen) - -/* -** Get string and length */ -#define getlstr(ts, len) \ - (strisshr(ts) \ - ? (cast_void((len) = (ts)->shrlen), rawgetshrstr(ts)) \ - : (cast_void((len) = (ts)->u.lnglen), (ts)->contents)) - -/* }================================================================== */ - - -/* -** {================================================================== -** Userdata -** =================================================================== -*/ - - -/* -** Light userdata should be a variant of userdata, but for compatibility -** reasons they are also different types. -*/ -#define LUA_VLIGHTUSERDATA makevariant(LUA_TLIGHTUSERDATA, 0) - -#define LUA_VUSERDATA makevariant(LUA_TUSERDATA, 0) - -#define ttislightuserdata(o) checktag((o), LUA_VLIGHTUSERDATA) -#define ttisfulluserdata(o) checktag((o), ctb(LUA_VUSERDATA)) - -#define pvalue(o) check_exp(ttislightuserdata(o), val_(o).p) -#define uvalue(o) check_exp(ttisfulluserdata(o), gco2u(val_(o).gc)) - -#define pvalueraw(v) ((v).p) - -#define setpvalue(obj,x) \ - { TValue *io=(obj); val_(io).p=(x); settt_(io, LUA_VLIGHTUSERDATA); } - -#define setuvalue(L,obj,x) \ - { TValue *io = (obj); Udata *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VUSERDATA)); \ - checkliveness(L,io); } - - -/* Ensures that addresses after this type are always fully aligned. */ -typedef union UValue { - TValue uv; - LUAI_MAXALIGN; /* ensures maximum alignment for udata bytes */ -} UValue; - - -/* -** Header for userdata with user values; -** memory area follows the end of this structure. -*/ -typedef struct Udata { - CommonHeader; - unsigned short nuvalue; /* number of user values */ - size_t len; /* number of bytes */ - struct Table *metatable; - GCObject *gclist; - UValue uv[1]; /* user values */ -} Udata; - - -/* -** Header for userdata with no user values. These userdata do not need -** to be gray during GC, and therefore do not need a 'gclist' field. -** To simplify, the code always use 'Udata' for both kinds of userdata, -** making sure it never accesses 'gclist' on userdata with no user values. -** This structure here is used only to compute the correct size for -** this representation. (The 'bindata' field in its end ensures correct -** alignment for binary data following this header.) -*/ -typedef struct Udata0 { - CommonHeader; - unsigned short nuvalue; /* number of user values */ - size_t len; /* number of bytes */ - struct Table *metatable; - union {LUAI_MAXALIGN;} bindata; -} Udata0; - - -/* compute the offset of the memory area of a userdata */ -#define udatamemoffset(nuv) \ - ((nuv) == 0 ? offsetof(Udata0, bindata) \ - : offsetof(Udata, uv) + (sizeof(UValue) * (nuv))) - -/* get the address of the memory block inside 'Udata' */ -#define getudatamem(u) (cast_charp(u) + udatamemoffset((u)->nuvalue)) - -/* compute the size of a userdata */ -#define sizeudata(nuv,nb) (udatamemoffset(nuv) + (nb)) - -/* }================================================================== */ - - -/* -** {================================================================== -** Prototypes -** =================================================================== -*/ - -#define LUA_VPROTO makevariant(LUA_TPROTO, 0) - - -/* -** Description of an upvalue for function prototypes -*/ -typedef struct Upvaldesc { - TString *name; /* upvalue name (for debug information) */ - lu_byte instack; /* whether it is in stack (register) */ - lu_byte idx; /* index of upvalue (in stack or in outer function's list) */ - lu_byte kind; /* kind of corresponding variable */ -} Upvaldesc; - - -/* -** Description of a local variable for function prototypes -** (used for debug information) -*/ -typedef struct LocVar { - TString *varname; - int startpc; /* first point where variable is active */ - int endpc; /* first point where variable is dead */ -} LocVar; - - -/* -** Associates the absolute line source for a given instruction ('pc'). -** The array 'lineinfo' gives, for each instruction, the difference in -** lines from the previous instruction. When that difference does not -** fit into a byte, Lua saves the absolute line for that instruction. -** (Lua also saves the absolute line periodically, to speed up the -** computation of a line number: we can use binary search in the -** absolute-line array, but we must traverse the 'lineinfo' array -** linearly to compute a line.) -*/ -typedef struct AbsLineInfo { - int pc; - int line; -} AbsLineInfo; - - -/* -** Flags in Prototypes -*/ -#define PF_ISVARARG 1 -#define PF_FIXED 2 /* prototype has parts in fixed memory */ - - -/* -** Function Prototypes -*/ -typedef struct Proto { - CommonHeader; - lu_byte numparams; /* number of fixed (named) parameters */ - lu_byte flag; - lu_byte maxstacksize; /* number of registers needed by this function */ - int sizeupvalues; /* size of 'upvalues' */ - int sizek; /* size of 'k' */ - int sizecode; - int sizelineinfo; - int sizep; /* size of 'p' */ - int sizelocvars; - int sizeabslineinfo; /* size of 'abslineinfo' */ - int linedefined; /* debug information */ - int lastlinedefined; /* debug information */ - TValue *k; /* constants used by the function */ - Instruction *code; /* opcodes */ - struct Proto **p; /* functions defined inside the function */ - Upvaldesc *upvalues; /* upvalue information */ - ls_byte *lineinfo; /* information about source lines (debug information) */ - AbsLineInfo *abslineinfo; /* idem */ - LocVar *locvars; /* information about local variables (debug information) */ - TString *source; /* used for debug information */ - GCObject *gclist; -} Proto; - -/* }================================================================== */ - - -/* -** {================================================================== -** Functions -** =================================================================== -*/ - -#define LUA_VUPVAL makevariant(LUA_TUPVAL, 0) - - -/* Variant tags for functions */ -#define LUA_VLCL makevariant(LUA_TFUNCTION, 0) /* Lua closure */ -#define LUA_VLCF makevariant(LUA_TFUNCTION, 1) /* light C function */ -#define LUA_VCCL makevariant(LUA_TFUNCTION, 2) /* C closure */ - -#define ttisfunction(o) checktype(o, LUA_TFUNCTION) -#define ttisLclosure(o) checktag((o), ctb(LUA_VLCL)) -#define ttislcf(o) checktag((o), LUA_VLCF) -#define ttisCclosure(o) checktag((o), ctb(LUA_VCCL)) -#define ttisclosure(o) (ttisLclosure(o) || ttisCclosure(o)) - - -#define isLfunction(o) ttisLclosure(o) - -#define clvalue(o) check_exp(ttisclosure(o), gco2cl(val_(o).gc)) -#define clLvalue(o) check_exp(ttisLclosure(o), gco2lcl(val_(o).gc)) -#define fvalue(o) check_exp(ttislcf(o), val_(o).f) -#define clCvalue(o) check_exp(ttisCclosure(o), gco2ccl(val_(o).gc)) - -#define fvalueraw(v) ((v).f) - -#define setclLvalue(L,obj,x) \ - { TValue *io = (obj); LClosure *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VLCL)); \ - checkliveness(L,io); } - -#define setclLvalue2s(L,o,cl) setclLvalue(L,s2v(o),cl) - -#define setfvalue(obj,x) \ - { TValue *io=(obj); val_(io).f=(x); settt_(io, LUA_VLCF); } - -#define setclCvalue(L,obj,x) \ - { TValue *io = (obj); CClosure *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VCCL)); \ - checkliveness(L,io); } - - -/* -** Upvalues for Lua closures -*/ -typedef struct UpVal { - CommonHeader; - union { - TValue *p; /* points to stack or to its own value */ - ptrdiff_t offset; /* used while the stack is being reallocated */ - } v; - union { - struct { /* (when open) */ - struct UpVal *next; /* linked list */ - struct UpVal **previous; - } open; - TValue value; /* the value (when closed) */ - } u; -} UpVal; - - - -#define ClosureHeader \ - CommonHeader; lu_byte nupvalues; GCObject *gclist - -typedef struct CClosure { - ClosureHeader; - lua_CFunction f; - TValue upvalue[1]; /* list of upvalues */ -} CClosure; - - -typedef struct LClosure { - ClosureHeader; - struct Proto *p; - UpVal *upvals[1]; /* list of upvalues */ -} LClosure; - - -typedef union Closure { - CClosure c; - LClosure l; -} Closure; - - -#define getproto(o) (clLvalue(o)->p) - -/* }================================================================== */ - - -/* -** {================================================================== -** Tables -** =================================================================== -*/ - -#define LUA_VTABLE makevariant(LUA_TTABLE, 0) - -#define ttistable(o) checktag((o), ctb(LUA_VTABLE)) - -#define hvalue(o) check_exp(ttistable(o), gco2t(val_(o).gc)) - -#define sethvalue(L,obj,x) \ - { TValue *io = (obj); Table *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTABLE)); \ - checkliveness(L,io); } - -#define sethvalue2s(L,o,h) sethvalue(L,s2v(o),h) - - -/* -** Nodes for Hash tables: A pack of two TValue's (key-value pairs) -** plus a 'next' field to link colliding entries. The distribution -** of the key's fields ('key_tt' and 'key_val') not forming a proper -** 'TValue' allows for a smaller size for 'Node' both in 4-byte -** and 8-byte alignments. -*/ -typedef union Node { - struct NodeKey { - TValuefields; /* fields for value */ - lu_byte key_tt; /* key type */ - int next; /* for chaining */ - Value key_val; /* key value */ - } u; - TValue i_val; /* direct access to node's value as a proper 'TValue' */ -} Node; - - -/* copy a value into a key */ -#define setnodekey(L,node,obj) \ - { Node *n_=(node); const TValue *io_=(obj); \ - n_->u.key_val = io_->value_; n_->u.key_tt = io_->tt_; \ - checkliveness(L,io_); } - - -/* copy a value from a key */ -#define getnodekey(L,obj,node) \ - { TValue *io_=(obj); const Node *n_=(node); \ - io_->value_ = n_->u.key_val; io_->tt_ = n_->u.key_tt; \ - checkliveness(L,io_); } - - -/* -** About 'alimit': if 'isrealasize(t)' is true, then 'alimit' is the -** real size of 'array'. Otherwise, the real size of 'array' is the -** smallest power of two not smaller than 'alimit' (or zero iff 'alimit' -** is zero); 'alimit' is then used as a hint for #t. -*/ - -#define BITRAS (1 << 7) -#define isrealasize(t) (!((t)->flags & BITRAS)) -#define setrealasize(t) ((t)->flags &= cast_byte(~BITRAS)) -#define setnorealasize(t) ((t)->flags |= BITRAS) - - -typedef struct ArrayCell ArrayCell; - - -typedef struct Table { - CommonHeader; - lu_byte flags; /* 1<

u.key_tt) -#define keyval(node) ((node)->u.key_val) - -#define keyisnil(node) (keytt(node) == LUA_TNIL) -#define keyisinteger(node) (keytt(node) == LUA_VNUMINT) -#define keyival(node) (keyval(node).i) -#define keyisshrstr(node) (keytt(node) == ctb(LUA_VSHRSTR)) -#define keystrval(node) (gco2ts(keyval(node).gc)) - -#define setnilkey(node) (keytt(node) = LUA_TNIL) - -#define keyiscollectable(n) (keytt(n) & BIT_ISCOLLECTABLE) - -#define gckey(n) (keyval(n).gc) -#define gckeyN(n) (keyiscollectable(n) ? gckey(n) : NULL) - - -/* -** Dead keys in tables have the tag DEADKEY but keep their original -** gcvalue. This distinguishes them from regular keys but allows them to -** be found when searched in a special way. ('next' needs that to find -** keys removed from a table during a traversal.) -*/ -#define setdeadkey(node) (keytt(node) = LUA_TDEADKEY) -#define keyisdead(node) (keytt(node) == LUA_TDEADKEY) - -/* }================================================================== */ - - - -/* -** 'module' operation for hashing (size is always a power of 2) -*/ -#define lmod(s,size) \ - (check_exp((size&(size-1))==0, (cast_int((s) & ((size)-1))))) - - -#define twoto(x) (1<<(x)) -#define sizenode(t) (twoto((t)->lsizenode)) - - -/* size of buffer for 'luaO_utf8esc' function */ -#define UTF8BUFFSZ 8 - -LUAI_FUNC int luaO_utf8esc (char *buff, unsigned long x); -LUAI_FUNC int luaO_ceillog2 (unsigned int x); -LUAI_FUNC unsigned int luaO_codeparam (unsigned int p); -LUAI_FUNC l_obj luaO_applyparam (unsigned int p, l_obj x); - -LUAI_FUNC int luaO_rawarith (lua_State *L, int op, const TValue *p1, - const TValue *p2, TValue *res); -LUAI_FUNC void luaO_arith (lua_State *L, int op, const TValue *p1, - const TValue *p2, StkId res); -LUAI_FUNC size_t luaO_str2num (const char *s, TValue *o); -LUAI_FUNC int luaO_hexavalue (int c); -LUAI_FUNC void luaO_tostring (lua_State *L, TValue *obj); -LUAI_FUNC const char *luaO_pushvfstring (lua_State *L, const char *fmt, - va_list argp); -LUAI_FUNC const char *luaO_pushfstring (lua_State *L, const char *fmt, ...); -LUAI_FUNC void luaO_chunkid (char *out, const char *source, size_t srclen); - - -#endif - diff --git a/src/dependencies/lua/lopcodes.c b/src/dependencies/lua/lopcodes.c deleted file mode 100644 index c67aa22..0000000 --- a/src/dependencies/lua/lopcodes.c +++ /dev/null @@ -1,104 +0,0 @@ -/* -** $Id: lopcodes.c $ -** Opcodes for Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#define lopcodes_c -#define LUA_CORE - -#include "lprefix.h" - - -#include "lopcodes.h" - - -/* ORDER OP */ - -LUAI_DDEF const lu_byte luaP_opmodes[NUM_OPCODES] = { -/* MM OT IT T A mode opcode */ - opmode(0, 0, 0, 0, 1, iABC) /* OP_MOVE */ - ,opmode(0, 0, 0, 0, 1, iAsBx) /* OP_LOADI */ - ,opmode(0, 0, 0, 0, 1, iAsBx) /* OP_LOADF */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_LOADK */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_LOADKX */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LOADFALSE */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LFALSESKIP */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LOADTRUE */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LOADNIL */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETUPVAL */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETUPVAL */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETTABUP */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETTABLE */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETI */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETFIELD */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETTABUP */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETTABLE */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETI */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETFIELD */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_NEWTABLE */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SELF */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_ADDI */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_ADDK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SUBK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MULK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MODK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_POWK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_DIVK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_IDIVK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BANDK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BORK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BXORK */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHRI */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHLI */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_ADD */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SUB */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MUL */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MOD */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_POW */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_DIV */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_IDIV */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BAND */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BOR */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BXOR */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHL */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHR */ - ,opmode(1, 0, 0, 0, 0, iABC) /* OP_MMBIN */ - ,opmode(1, 0, 0, 0, 0, iABC) /* OP_MMBINI*/ - ,opmode(1, 0, 0, 0, 0, iABC) /* OP_MMBINK*/ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_UNM */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BNOT */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_NOT */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LEN */ - ,opmode(0, 0, 0, 0, 1, iABC) /* OP_CONCAT */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_CLOSE */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_TBC */ - ,opmode(0, 0, 0, 0, 0, isJ) /* OP_JMP */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_EQ */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LT */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LE */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_EQK */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_EQI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LTI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LEI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_GTI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_GEI */ - ,opmode(0, 0, 0, 1, 0, iABC) /* OP_TEST */ - ,opmode(0, 0, 0, 1, 1, iABC) /* OP_TESTSET */ - ,opmode(0, 1, 1, 0, 1, iABC) /* OP_CALL */ - ,opmode(0, 1, 1, 0, 1, iABC) /* OP_TAILCALL */ - ,opmode(0, 0, 1, 0, 0, iABC) /* OP_RETURN */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_RETURN0 */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_RETURN1 */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_FORLOOP */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_FORPREP */ - ,opmode(0, 0, 0, 0, 0, iABx) /* OP_TFORPREP */ - ,opmode(0, 0, 0, 0, 0, iABC) /* OP_TFORCALL */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_TFORLOOP */ - ,opmode(0, 0, 1, 0, 0, iABC) /* OP_SETLIST */ - ,opmode(0, 0, 0, 0, 1, iABx) /* OP_CLOSURE */ - ,opmode(0, 1, 0, 0, 1, iABC) /* OP_VARARG */ - ,opmode(0, 0, 1, 0, 1, iABC) /* OP_VARARGPREP */ - ,opmode(0, 0, 0, 0, 0, iAx) /* OP_EXTRAARG */ -}; - diff --git a/src/dependencies/lua/lopcodes.h b/src/dependencies/lua/lopcodes.h deleted file mode 100644 index 46911ca..0000000 --- a/src/dependencies/lua/lopcodes.h +++ /dev/null @@ -1,405 +0,0 @@ -/* -** $Id: lopcodes.h $ -** Opcodes for Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#ifndef lopcodes_h -#define lopcodes_h - -#include "llimits.h" - - -/*=========================================================================== - We assume that instructions are unsigned 32-bit integers. - All instructions have an opcode in the first 7 bits. - Instructions can have the following formats: - - 3 3 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 - 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 -iABC C(8) | B(8) |k| A(8) | Op(7) | -iABx Bx(17) | A(8) | Op(7) | -iAsBx sBx (signed)(17) | A(8) | Op(7) | -iAx Ax(25) | Op(7) | -isJ sJ (signed)(25) | Op(7) | - - A signed argument is represented in excess K: the represented value is - the written unsigned value minus K, where K is half the maximum for the - corresponding unsigned argument. -===========================================================================*/ - - -enum OpMode {iABC, iABx, iAsBx, iAx, isJ}; /* basic instruction formats */ - - -/* -** size and position of opcode arguments. -*/ -#define SIZE_C 8 -#define SIZE_B 8 -#define SIZE_Bx (SIZE_C + SIZE_B + 1) -#define SIZE_A 8 -#define SIZE_Ax (SIZE_Bx + SIZE_A) -#define SIZE_sJ (SIZE_Bx + SIZE_A) - -#define SIZE_OP 7 - -#define POS_OP 0 - -#define POS_A (POS_OP + SIZE_OP) -#define POS_k (POS_A + SIZE_A) -#define POS_B (POS_k + 1) -#define POS_C (POS_B + SIZE_B) - -#define POS_Bx POS_k - -#define POS_Ax POS_A - -#define POS_sJ POS_A - - -/* -** limits for opcode arguments. -** we use (signed) 'int' to manipulate most arguments, -** so they must fit in ints. -*/ - -/* Check whether type 'int' has at least 'b' bits ('b' < 32) */ -#define L_INTHASBITS(b) ((UINT_MAX >> ((b) - 1)) >= 1) - - -#if L_INTHASBITS(SIZE_Bx) -#define MAXARG_Bx ((1<>1) /* 'sBx' is signed */ - - -#if L_INTHASBITS(SIZE_Ax) -#define MAXARG_Ax ((1<> 1) - - -#define MAXARG_A ((1<> 1) - -#define int2sC(i) ((i) + OFFSET_sC) -#define sC2int(i) ((i) - OFFSET_sC) - - -/* creates a mask with 'n' 1 bits at position 'p' */ -#define MASK1(n,p) ((~((~(Instruction)0)<<(n)))<<(p)) - -/* creates a mask with 'n' 0 bits at position 'p' */ -#define MASK0(n,p) (~MASK1(n,p)) - -/* -** the following macros help to manipulate instructions -*/ - -#define GET_OPCODE(i) (cast(OpCode, ((i)>>POS_OP) & MASK1(SIZE_OP,0))) -#define SET_OPCODE(i,o) ((i) = (((i)&MASK0(SIZE_OP,POS_OP)) | \ - ((cast(Instruction, o)<>(pos)) & MASK1(size,0))) -#define setarg(i,v,pos,size) ((i) = (((i)&MASK0(size,pos)) | \ - ((cast(Instruction, v)<> sC */ -OP_SHLI,/* A B sC R[A] := sC << R[B] */ - -OP_ADD,/* A B C R[A] := R[B] + R[C] */ -OP_SUB,/* A B C R[A] := R[B] - R[C] */ -OP_MUL,/* A B C R[A] := R[B] * R[C] */ -OP_MOD,/* A B C R[A] := R[B] % R[C] */ -OP_POW,/* A B C R[A] := R[B] ^ R[C] */ -OP_DIV,/* A B C R[A] := R[B] / R[C] */ -OP_IDIV,/* A B C R[A] := R[B] // R[C] */ - -OP_BAND,/* A B C R[A] := R[B] & R[C] */ -OP_BOR,/* A B C R[A] := R[B] | R[C] */ -OP_BXOR,/* A B C R[A] := R[B] ~ R[C] */ -OP_SHL,/* A B C R[A] := R[B] << R[C] */ -OP_SHR,/* A B C R[A] := R[B] >> R[C] */ - -OP_MMBIN,/* A B C call C metamethod over R[A] and R[B] (*) */ -OP_MMBINI,/* A sB C k call C metamethod over R[A] and sB */ -OP_MMBINK,/* A B C k call C metamethod over R[A] and K[B] */ - -OP_UNM,/* A B R[A] := -R[B] */ -OP_BNOT,/* A B R[A] := ~R[B] */ -OP_NOT,/* A B R[A] := not R[B] */ -OP_LEN,/* A B R[A] := #R[B] (length operator) */ - -OP_CONCAT,/* A B R[A] := R[A].. ... ..R[A + B - 1] */ - -OP_CLOSE,/* A close all upvalues >= R[A] */ -OP_TBC,/* A mark variable A "to be closed" */ -OP_JMP,/* sJ pc += sJ */ -OP_EQ,/* A B k if ((R[A] == R[B]) ~= k) then pc++ */ -OP_LT,/* A B k if ((R[A] < R[B]) ~= k) then pc++ */ -OP_LE,/* A B k if ((R[A] <= R[B]) ~= k) then pc++ */ - -OP_EQK,/* A B k if ((R[A] == K[B]) ~= k) then pc++ */ -OP_EQI,/* A sB k if ((R[A] == sB) ~= k) then pc++ */ -OP_LTI,/* A sB k if ((R[A] < sB) ~= k) then pc++ */ -OP_LEI,/* A sB k if ((R[A] <= sB) ~= k) then pc++ */ -OP_GTI,/* A sB k if ((R[A] > sB) ~= k) then pc++ */ -OP_GEI,/* A sB k if ((R[A] >= sB) ~= k) then pc++ */ - -OP_TEST,/* A k if (not R[A] == k) then pc++ */ -OP_TESTSET,/* A B k if (not R[B] == k) then pc++ else R[A] := R[B] (*) */ - -OP_CALL,/* A B C R[A], ... ,R[A+C-2] := R[A](R[A+1], ... ,R[A+B-1]) */ -OP_TAILCALL,/* A B C k return R[A](R[A+1], ... ,R[A+B-1]) */ - -OP_RETURN,/* A B C k return R[A], ... ,R[A+B-2] (see note) */ -OP_RETURN0,/* return */ -OP_RETURN1,/* A return R[A] */ - -OP_FORLOOP,/* A Bx update counters; if loop continues then pc-=Bx; */ -OP_FORPREP,/* A Bx ; - if not to run then pc+=Bx+1; */ - -OP_TFORPREP,/* A Bx create upvalue for R[A + 3]; pc+=Bx */ -OP_TFORCALL,/* A C R[A+4], ... ,R[A+3+C] := R[A](R[A+1], R[A+2]); */ -OP_TFORLOOP,/* A Bx if R[A+2] ~= nil then { R[A]=R[A+2]; pc -= Bx } */ - -OP_SETLIST,/* A B C k R[A][C+i] := R[A+i], 1 <= i <= B */ - -OP_CLOSURE,/* A Bx R[A] := closure(KPROTO[Bx]) */ - -OP_VARARG,/* A C R[A], R[A+1], ..., R[A+C-2] = vararg */ - -OP_VARARGPREP,/*A (adjust vararg parameters) */ - -OP_EXTRAARG/* Ax extra (larger) argument for previous opcode */ -} OpCode; - - -#define NUM_OPCODES ((int)(OP_EXTRAARG) + 1) - - - -/*=========================================================================== - Notes: - - (*) Opcode OP_LFALSESKIP is used to convert a condition to a boolean - value, in a code equivalent to (not cond ? false : true). (It - produces false and skips the next instruction producing true.) - - (*) Opcodes OP_MMBIN and variants follow each arithmetic and - bitwise opcode. If the operation succeeds, it skips this next - opcode. Otherwise, this opcode calls the corresponding metamethod. - - (*) Opcode OP_TESTSET is used in short-circuit expressions that need - both to jump and to produce a value, such as (a = b or c). - - (*) In OP_CALL, if (B == 0) then B = top - A. If (C == 0), then - 'top' is set to last_result+1, so next open instruction (OP_CALL, - OP_RETURN*, OP_SETLIST) may use 'top'. - - (*) In OP_VARARG, if (C == 0) then use actual number of varargs and - set top (like in OP_CALL with C == 0). - - (*) In OP_RETURN, if (B == 0) then return up to 'top'. - - (*) In OP_LOADKX and OP_NEWTABLE, the next instruction is always - OP_EXTRAARG. - - (*) In OP_SETLIST, if (B == 0) then real B = 'top'; if k, then - real C = EXTRAARG _ C (the bits of EXTRAARG concatenated with the - bits of C). - - (*) In OP_NEWTABLE, B is log2 of the hash size (which is always a - power of 2) plus 1, or zero for size zero. If not k, the array size - is C. Otherwise, the array size is EXTRAARG _ C. - - (*) For comparisons, k specifies what condition the test should accept - (true or false). - - (*) In OP_MMBINI/OP_MMBINK, k means the arguments were flipped - (the constant is the first operand). - - (*) All 'skips' (pc++) assume that next instruction is a jump. - - (*) In instructions OP_RETURN/OP_TAILCALL, 'k' specifies that the - function builds upvalues, which may need to be closed. C > 0 means - the function is vararg, so that its 'func' must be corrected before - returning; in this case, (C - 1) is its number of fixed parameters. - - (*) In comparisons with an immediate operand, C signals whether the - original operand was a float. (It must be corrected in case of - metamethods.) - -===========================================================================*/ - - -/* -** masks for instruction properties. The format is: -** bits 0-2: op mode -** bit 3: instruction set register A -** bit 4: operator is a test (next instruction must be a jump) -** bit 5: instruction uses 'L->top' set by previous instruction (when B == 0) -** bit 6: instruction sets 'L->top' for next instruction (when C == 0) -** bit 7: instruction is an MM instruction (call a metamethod) -*/ - -LUAI_DDEC(const lu_byte luaP_opmodes[NUM_OPCODES];) - -#define getOpMode(m) (cast(enum OpMode, luaP_opmodes[m] & 7)) -#define testAMode(m) (luaP_opmodes[m] & (1 << 3)) -#define testTMode(m) (luaP_opmodes[m] & (1 << 4)) -#define testITMode(m) (luaP_opmodes[m] & (1 << 5)) -#define testOTMode(m) (luaP_opmodes[m] & (1 << 6)) -#define testMMMode(m) (luaP_opmodes[m] & (1 << 7)) - -/* "out top" (set top for next instruction) */ -#define isOT(i) \ - ((testOTMode(GET_OPCODE(i)) && GETARG_C(i) == 0) || \ - GET_OPCODE(i) == OP_TAILCALL) - -/* "in top" (uses top from previous instruction) */ -#define isIT(i) (testITMode(GET_OPCODE(i)) && GETARG_B(i) == 0) - -#define opmode(mm,ot,it,t,a,m) \ - (((mm) << 7) | ((ot) << 6) | ((it) << 5) | ((t) << 4) | ((a) << 3) | (m)) - - -/* number of list items to accumulate before a SETLIST instruction */ -#define LFIELDS_PER_FLUSH 50 - -#endif diff --git a/src/dependencies/lua/lopnames.h b/src/dependencies/lua/lopnames.h deleted file mode 100644 index 965cec9..0000000 --- a/src/dependencies/lua/lopnames.h +++ /dev/null @@ -1,103 +0,0 @@ -/* -** $Id: lopnames.h $ -** Opcode names -** See Copyright Notice in lua.h -*/ - -#if !defined(lopnames_h) -#define lopnames_h - -#include - - -/* ORDER OP */ - -static const char *const opnames[] = { - "MOVE", - "LOADI", - "LOADF", - "LOADK", - "LOADKX", - "LOADFALSE", - "LFALSESKIP", - "LOADTRUE", - "LOADNIL", - "GETUPVAL", - "SETUPVAL", - "GETTABUP", - "GETTABLE", - "GETI", - "GETFIELD", - "SETTABUP", - "SETTABLE", - "SETI", - "SETFIELD", - "NEWTABLE", - "SELF", - "ADDI", - "ADDK", - "SUBK", - "MULK", - "MODK", - "POWK", - "DIVK", - "IDIVK", - "BANDK", - "BORK", - "BXORK", - "SHRI", - "SHLI", - "ADD", - "SUB", - "MUL", - "MOD", - "POW", - "DIV", - "IDIV", - "BAND", - "BOR", - "BXOR", - "SHL", - "SHR", - "MMBIN", - "MMBINI", - "MMBINK", - "UNM", - "BNOT", - "NOT", - "LEN", - "CONCAT", - "CLOSE", - "TBC", - "JMP", - "EQ", - "LT", - "LE", - "EQK", - "EQI", - "LTI", - "LEI", - "GTI", - "GEI", - "TEST", - "TESTSET", - "CALL", - "TAILCALL", - "RETURN", - "RETURN0", - "RETURN1", - "FORLOOP", - "FORPREP", - "TFORPREP", - "TFORCALL", - "TFORLOOP", - "SETLIST", - "CLOSURE", - "VARARG", - "VARARGPREP", - "EXTRAARG", - NULL -}; - -#endif - diff --git a/src/dependencies/lua/loslib.c b/src/dependencies/lua/loslib.c deleted file mode 100644 index e48e657..0000000 --- a/src/dependencies/lua/loslib.c +++ /dev/null @@ -1,445 +0,0 @@ -/* -** $Id: loslib.c $ -** Standard Operating System library -** See Copyright Notice in lua.h -*/ - -#define loslib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** {================================================================== -** List of valid conversion specifiers for the 'strftime' function; -** options are grouped by length; group of length 2 start with '||'. -** =================================================================== -*/ -#if !defined(LUA_STRFTIMEOPTIONS) /* { */ - -#if defined(LUA_USE_WINDOWS) -#define LUA_STRFTIMEOPTIONS "aAbBcdHIjmMpSUwWxXyYzZ%" \ - "||" "#c#x#d#H#I#j#m#M#S#U#w#W#y#Y" /* two-char options */ -#elif defined(LUA_USE_C89) /* ANSI C 89 (only 1-char options) */ -#define LUA_STRFTIMEOPTIONS "aAbBcdHIjmMpSUwWxXyYZ%" -#else /* C99 specification */ -#define LUA_STRFTIMEOPTIONS "aAbBcCdDeFgGhHIjmMnprRStTuUVwWxXyYzZ%" \ - "||" "EcECExEXEyEY" "OdOeOHOIOmOMOSOuOUOVOwOWOy" /* two-char options */ -#endif - -#endif /* } */ -/* }================================================================== */ - - -/* -** {================================================================== -** Configuration for time-related stuff -** =================================================================== -*/ - -/* -** type to represent time_t in Lua -*/ -#if !defined(LUA_NUMTIME) /* { */ - -#define l_timet lua_Integer -#define l_pushtime(L,t) lua_pushinteger(L,(lua_Integer)(t)) -#define l_gettime(L,arg) luaL_checkinteger(L, arg) - -#else /* }{ */ - -#define l_timet lua_Number -#define l_pushtime(L,t) lua_pushnumber(L,(lua_Number)(t)) -#define l_gettime(L,arg) luaL_checknumber(L, arg) - -#endif /* } */ - - -#if !defined(l_gmtime) /* { */ -/* -** By default, Lua uses gmtime/localtime, except when POSIX is available, -** where it uses gmtime_r/localtime_r -*/ - -#if defined(LUA_USE_POSIX) /* { */ - -#define l_gmtime(t,r) gmtime_r(t,r) -#define l_localtime(t,r) localtime_r(t,r) - -#else /* }{ */ - -/* ISO C definitions */ -#define l_gmtime(t,r) ((void)(r)->tm_sec, gmtime(t)) -#define l_localtime(t,r) ((void)(r)->tm_sec, localtime(t)) - -#endif /* } */ - -#endif /* } */ - -/* }================================================================== */ - - -/* -** {================================================================== -** Configuration for 'tmpnam': -** By default, Lua uses tmpnam except when POSIX is available, where -** it uses mkstemp. -** =================================================================== -*/ -#if !defined(lua_tmpnam) /* { */ - -#if defined(LUA_USE_POSIX) /* { */ - -#include - -#define LUA_TMPNAMBUFSIZE 32 - -#if !defined(LUA_TMPNAMTEMPLATE) -#define LUA_TMPNAMTEMPLATE "/tmp/lua_XXXXXX" -#endif - -#define lua_tmpnam(b,e) { \ - strcpy(b, LUA_TMPNAMTEMPLATE); \ - e = mkstemp(b); \ - if (e != -1) close(e); \ - e = (e == -1); } - -#else /* }{ */ - -/* ISO C definitions */ -#define LUA_TMPNAMBUFSIZE L_tmpnam -#define lua_tmpnam(b,e) { e = (tmpnam(b) == NULL); } - -#endif /* } */ - -#endif /* } */ -/* }================================================================== */ - - -#if !defined(l_system) -#if defined(LUA_USE_IOS) -/* Despite claiming to be ISO C, iOS does not implement 'system'. */ -#define l_system(cmd) ((cmd) == NULL ? 0 : -1) -#else -#define l_system(cmd) system(cmd) /* default definition */ -#endif -#endif - - -static int os_execute (lua_State *L) { - const char *cmd = luaL_optstring(L, 1, NULL); - int stat; - errno = 0; - stat = l_system(cmd); - if (cmd != NULL) - return luaL_execresult(L, stat); - else { - lua_pushboolean(L, stat); /* true if there is a shell */ - return 1; - } -} - - -static int os_remove (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - return luaL_fileresult(L, remove(filename) == 0, filename); -} - - -static int os_rename (lua_State *L) { - const char *fromname = luaL_checkstring(L, 1); - const char *toname = luaL_checkstring(L, 2); - return luaL_fileresult(L, rename(fromname, toname) == 0, NULL); -} -#ifdef __linux -static int os_tmpname(lua_State *L) { - char buff[100]; - /// const char *tmpdir = "/tmp/lua_XXXXXX"; - int fd = mkstemp(buff); - if (fd == -1) { - return luaL_error(L, "unable to generate a unique filename"); - } - - close(fd); - lua_pushstring(L, buff); - return 1; -} -#endif -#ifdef _WIN32 - -static int os_tmpname(lua_State *L) { - char buff[100] = {0}; - const char *template_file = "lua_XXXXXX"; - - GetTempPathA(sizeof(buff), buff); - - UINT fd = GetTempFileNameA(buff, template_file, 0, buff); - if (fd == -1) { - return luaL_error(L, "unable to generate a unique filename"); - } - lua_pushstring(L, buff); - return 1; -} -#endif -static int os_getenv (lua_State *L) { - lua_pushstring(L, getenv(luaL_checkstring(L, 1))); /* if NULL push nil */ - return 1; -} - - -static int os_clock (lua_State *L) { - lua_pushnumber(L, ((lua_Number)clock())/(lua_Number)CLOCKS_PER_SEC); - return 1; -} - - -/* -** {====================================================== -** Time/Date operations -** { year=%Y, month=%m, day=%d, hour=%H, min=%M, sec=%S, -** wday=%w+1, yday=%j, isdst=? } -** ======================================================= -*/ - -/* -** About the overflow check: an overflow cannot occur when time -** is represented by a lua_Integer, because either lua_Integer is -** large enough to represent all int fields or it is not large enough -** to represent a time that cause a field to overflow. However, if -** times are represented as doubles and lua_Integer is int, then the -** time 0x1.e1853b0d184f6p+55 would cause an overflow when adding 1900 -** to compute the year. -*/ -static void setfield (lua_State *L, const char *key, int value, int delta) { - #if (defined(LUA_NUMTIME) && LUA_MAXINTEGER <= INT_MAX) - if (l_unlikely(value > LUA_MAXINTEGER - delta)) - luaL_error(L, "field '%s' is out-of-bound", key); - #endif - lua_pushinteger(L, (lua_Integer)value + delta); - lua_setfield(L, -2, key); -} - - -static void setboolfield (lua_State *L, const char *key, int value) { - if (value < 0) /* undefined? */ - return; /* does not set field */ - lua_pushboolean(L, value); - lua_setfield(L, -2, key); -} - - -/* -** Set all fields from structure 'tm' in the table on top of the stack -*/ -static void setallfields (lua_State *L, struct tm *stm) { - setfield(L, "year", stm->tm_year, 1900); - setfield(L, "month", stm->tm_mon, 1); - setfield(L, "day", stm->tm_mday, 0); - setfield(L, "hour", stm->tm_hour, 0); - setfield(L, "min", stm->tm_min, 0); - setfield(L, "sec", stm->tm_sec, 0); - setfield(L, "yday", stm->tm_yday, 1); - setfield(L, "wday", stm->tm_wday, 1); - setboolfield(L, "isdst", stm->tm_isdst); -} - - -static int getboolfield (lua_State *L, const char *key) { - int res; - res = (lua_getfield(L, -1, key) == LUA_TNIL) ? -1 : lua_toboolean(L, -1); - lua_pop(L, 1); - return res; -} - - -static int getfield (lua_State *L, const char *key, int d, int delta) { - int isnum; - int t = lua_getfield(L, -1, key); /* get field and its type */ - lua_Integer res = lua_tointegerx(L, -1, &isnum); - if (!isnum) { /* field is not an integer? */ - if (l_unlikely(t != LUA_TNIL)) /* some other value? */ - return luaL_error(L, "field '%s' is not an integer", key); - else if (l_unlikely(d < 0)) /* absent field; no default? */ - return luaL_error(L, "field '%s' missing in date table", key); - res = d; - } - else { - if (!(res >= 0 ? res - delta <= INT_MAX : INT_MIN + delta <= res)) - return luaL_error(L, "field '%s' is out-of-bound", key); - res -= delta; - } - lua_pop(L, 1); - return (int)res; -} - - -static const char *checkoption (lua_State *L, const char *conv, - ptrdiff_t convlen, char *buff) { - const char *option = LUA_STRFTIMEOPTIONS; - int oplen = 1; /* length of options being checked */ - for (; *option != '\0' && oplen <= convlen; option += oplen) { - if (*option == '|') /* next block? */ - oplen++; /* will check options with next length (+1) */ - else if (memcmp(conv, option, oplen) == 0) { /* match? */ - memcpy(buff, conv, oplen); /* copy valid option to buffer */ - buff[oplen] = '\0'; - return conv + oplen; /* return next item */ - } - } - luaL_argerror(L, 1, - lua_pushfstring(L, "invalid conversion specifier '%%%s'", conv)); - return conv; /* to avoid warnings */ -} - - -static time_t l_checktime (lua_State *L, int arg) { - l_timet t = l_gettime(L, arg); - luaL_argcheck(L, (time_t)t == t, arg, "time out-of-bounds"); - return (time_t)t; -} - - -/* maximum size for an individual 'strftime' item */ -#define SIZETIMEFMT 250 - - -static int os_date (lua_State *L) { - size_t slen; - const char *s = luaL_optlstring(L, 1, "%c", &slen); - time_t t = luaL_opt(L, l_checktime, 2, time(NULL)); - const char *se = s + slen; /* 's' end */ - struct tm tmr, *stm; - if (*s == '!') { /* UTC? */ - stm = l_gmtime(&t, &tmr); - s++; /* skip '!' */ - } - else - stm = l_localtime(&t, &tmr); - if (stm == NULL) /* invalid date? */ - return luaL_error(L, - "date result cannot be represented in this installation"); - if (strcmp(s, "*t") == 0) { - lua_createtable(L, 0, 9); /* 9 = number of fields */ - setallfields(L, stm); - } - else { - char cc[4]; /* buffer for individual conversion specifiers */ - luaL_Buffer b; - cc[0] = '%'; - luaL_buffinit(L, &b); - while (s < se) { - if (*s != '%') /* not a conversion specifier? */ - luaL_addchar(&b, *s++); - else { - size_t reslen; - char *buff = luaL_prepbuffsize(&b, SIZETIMEFMT); - s++; /* skip '%' */ - s = checkoption(L, s, se - s, cc + 1); /* copy specifier to 'cc' */ - reslen = strftime(buff, SIZETIMEFMT, cc, stm); - luaL_addsize(&b, reslen); - } - } - luaL_pushresult(&b); - } - return 1; -} - - -static int os_time (lua_State *L) { - time_t t; - if (lua_isnoneornil(L, 1)) /* called without args? */ - t = time(NULL); /* get current time */ - else { - struct tm ts; - luaL_checktype(L, 1, LUA_TTABLE); - lua_settop(L, 1); /* make sure table is at the top */ - ts.tm_year = getfield(L, "year", -1, 1900); - ts.tm_mon = getfield(L, "month", -1, 1); - ts.tm_mday = getfield(L, "day", -1, 0); - ts.tm_hour = getfield(L, "hour", 12, 0); - ts.tm_min = getfield(L, "min", 0, 0); - ts.tm_sec = getfield(L, "sec", 0, 0); - ts.tm_isdst = getboolfield(L, "isdst"); - t = mktime(&ts); - setallfields(L, &ts); /* update fields with normalized values */ - } - if (t != (time_t)(l_timet)t || t == (time_t)(-1)) - return luaL_error(L, - "time result cannot be represented in this installation"); - l_pushtime(L, t); - return 1; -} - - -static int os_difftime (lua_State *L) { - time_t t1 = l_checktime(L, 1); - time_t t2 = l_checktime(L, 2); - lua_pushnumber(L, (lua_Number)difftime(t1, t2)); - return 1; -} - -/* }====================================================== */ - - -static int os_setlocale (lua_State *L) { - static const int cat[] = {LC_ALL, LC_COLLATE, LC_CTYPE, LC_MONETARY, - LC_NUMERIC, LC_TIME}; - static const char *const catnames[] = {"all", "collate", "ctype", "monetary", - "numeric", "time", NULL}; - const char *l = luaL_optstring(L, 1, NULL); - int op = luaL_checkoption(L, 2, "all", catnames); - lua_pushstring(L, setlocale(cat[op], l)); - return 1; -} - - -static int os_exit (lua_State *L) { - int status; - if (lua_isboolean(L, 1)) - status = (lua_toboolean(L, 1) ? EXIT_SUCCESS : EXIT_FAILURE); - else - status = (int)luaL_optinteger(L, 1, EXIT_SUCCESS); - if (lua_toboolean(L, 2)) - lua_close(L); - if (L) exit(status); /* 'if' to avoid warnings for unreachable 'return' */ - return 0; -} - - -static const luaL_Reg syslib[] = { - {"clock", os_clock}, - {"date", os_date}, - {"difftime", os_difftime}, - {"execute", os_execute}, - {"exit", os_exit}, - {"getenv", os_getenv}, - {"remove", os_remove}, - {"rename", os_rename}, - {"setlocale", os_setlocale}, - {"time", os_time}, - {"tmpname", os_tmpname}, - {NULL, NULL} -}; - -/* }====================================================== */ - - - -LUAMOD_API int luaopen_os (lua_State *L) { - luaL_newlib(L, syslib); - return 1; -} - diff --git a/src/dependencies/lua/lparser.c b/src/dependencies/lua/lparser.c deleted file mode 100644 index 48cba06..0000000 --- a/src/dependencies/lua/lparser.c +++ /dev/null @@ -1,1976 +0,0 @@ -/* -** $Id: lparser.c $ -** Lua Parser -** See Copyright Notice in lua.h -*/ - -#define lparser_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "lcode.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "llex.h" -#include "lmem.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lparser.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" - - - -/* maximum number of local variables per function (must be smaller - than 250, due to the bytecode format) */ -#define MAXVARS 200 - - -#define hasmultret(k) ((k) == VCALL || (k) == VVARARG) - - -/* because all strings are unified by the scanner, the parser - can use pointer equality for string equality */ -#define eqstr(a,b) ((a) == (b)) - - -/* -** nodes for block list (list of active blocks) -*/ -typedef struct BlockCnt { - struct BlockCnt *previous; /* chain */ - int firstlabel; /* index of first label in this block */ - int firstgoto; /* index of first pending goto in this block */ - lu_byte nactvar; /* # active locals outside the block */ - lu_byte upval; /* true if some variable in the block is an upvalue */ - lu_byte isloop; /* true if 'block' is a loop */ - lu_byte insidetbc; /* true if inside the scope of a to-be-closed var. */ -} BlockCnt; - - - -/* -** prototypes for recursive non-terminal functions -*/ -static void statement (LexState *ls); -static void expr (LexState *ls, expdesc *v); - - -static l_noret error_expected (LexState *ls, int token) { - luaX_syntaxerror(ls, - luaO_pushfstring(ls->L, "%s expected", luaX_token2str(ls, token))); -} - - -static l_noret errorlimit (FuncState *fs, int limit, const char *what) { - lua_State *L = fs->ls->L; - const char *msg; - int line = fs->f->linedefined; - const char *where = (line == 0) - ? "main function" - : luaO_pushfstring(L, "function at line %d", line); - msg = luaO_pushfstring(L, "too many %s (limit is %d) in %s", - what, limit, where); - luaX_syntaxerror(fs->ls, msg); -} - - -static void checklimit (FuncState *fs, int v, int l, const char *what) { - if (v > l) errorlimit(fs, l, what); -} - - -/* -** Test whether next token is 'c'; if so, skip it. -*/ -static int testnext (LexState *ls, int c) { - if (ls->t.token == c) { - luaX_next(ls); - return 1; - } - else return 0; -} - - -/* -** Check that next token is 'c'. -*/ -static void check (LexState *ls, int c) { - if (ls->t.token != c) - error_expected(ls, c); -} - - -/* -** Check that next token is 'c' and skip it. -*/ -static void checknext (LexState *ls, int c) { - check(ls, c); - luaX_next(ls); -} - - -#define check_condition(ls,c,msg) { if (!(c)) luaX_syntaxerror(ls, msg); } - - -/* -** Check that next token is 'what' and skip it. In case of error, -** raise an error that the expected 'what' should match a 'who' -** in line 'where' (if that is not the current line). -*/ -static void check_match (LexState *ls, int what, int who, int where) { - if (l_unlikely(!testnext(ls, what))) { - if (where == ls->linenumber) /* all in the same line? */ - error_expected(ls, what); /* do not need a complex message */ - else { - luaX_syntaxerror(ls, luaO_pushfstring(ls->L, - "%s expected (to close %s at line %d)", - luaX_token2str(ls, what), luaX_token2str(ls, who), where)); - } - } -} - - -static TString *str_checkname (LexState *ls) { - TString *ts; - check(ls, TK_NAME); - ts = ls->t.seminfo.ts; - luaX_next(ls); - return ts; -} - - -static void init_exp (expdesc *e, expkind k, int i) { - e->f = e->t = NO_JUMP; - e->k = k; - e->u.info = i; -} - - -static void codestring (expdesc *e, TString *s) { - e->f = e->t = NO_JUMP; - e->k = VKSTR; - e->u.strval = s; -} - - -static void codename (LexState *ls, expdesc *e) { - codestring(e, str_checkname(ls)); -} - - -/* -** Register a new local variable in the active 'Proto' (for debug -** information). -*/ -static int registerlocalvar (LexState *ls, FuncState *fs, TString *varname) { - Proto *f = fs->f; - int oldsize = f->sizelocvars; - luaM_growvector(ls->L, f->locvars, fs->ndebugvars, f->sizelocvars, - LocVar, SHRT_MAX, "local variables"); - while (oldsize < f->sizelocvars) - f->locvars[oldsize++].varname = NULL; - f->locvars[fs->ndebugvars].varname = varname; - f->locvars[fs->ndebugvars].startpc = fs->pc; - luaC_objbarrier(ls->L, f, varname); - return fs->ndebugvars++; -} - - -/* -** Create a new local variable with the given 'name' and given 'kind'. -** Return its index in the function. -*/ -static int new_localvarkind (LexState *ls, TString *name, int kind) { - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Dyndata *dyd = ls->dyd; - Vardesc *var; - checklimit(fs, dyd->actvar.n + 1 - fs->firstlocal, - MAXVARS, "local variables"); - luaM_growvector(L, dyd->actvar.arr, dyd->actvar.n + 1, - dyd->actvar.size, Vardesc, USHRT_MAX, "local variables"); - var = &dyd->actvar.arr[dyd->actvar.n++]; - var->vd.kind = kind; /* default */ - var->vd.name = name; - return dyd->actvar.n - 1 - fs->firstlocal; -} - - -/* -** Create a new local variable with the given 'name' and regular kind. -*/ -static int new_localvar (LexState *ls, TString *name) { - return new_localvarkind(ls, name, VDKREG); -} - -#define new_localvarliteral(ls,v) \ - new_localvar(ls, \ - luaX_newstring(ls, "" v, (sizeof(v)/sizeof(char)) - 1)); - - - -/* -** Return the "variable description" (Vardesc) of a given variable. -** (Unless noted otherwise, all variables are referred to by their -** compiler indices.) -*/ -static Vardesc *getlocalvardesc (FuncState *fs, int vidx) { - return &fs->ls->dyd->actvar.arr[fs->firstlocal + vidx]; -} - - -/* -** Convert 'nvar', a compiler index level, to its corresponding -** register. For that, search for the highest variable below that level -** that is in a register and uses its register index ('ridx') plus one. -*/ -static int reglevel (FuncState *fs, int nvar) { - while (nvar-- > 0) { - Vardesc *vd = getlocalvardesc(fs, nvar); /* get previous variable */ - if (vd->vd.kind != RDKCTC) /* is in a register? */ - return vd->vd.ridx + 1; - } - return 0; /* no variables in registers */ -} - - -/* -** Return the number of variables in the register stack for the given -** function. -*/ -int luaY_nvarstack (FuncState *fs) { - return reglevel(fs, fs->nactvar); -} - - -/* -** Get the debug-information entry for current variable 'vidx'. -*/ -static LocVar *localdebuginfo (FuncState *fs, int vidx) { - Vardesc *vd = getlocalvardesc(fs, vidx); - if (vd->vd.kind == RDKCTC) - return NULL; /* no debug info. for constants */ - else { - int idx = vd->vd.pidx; - lua_assert(idx < fs->ndebugvars); - return &fs->f->locvars[idx]; - } -} - - -/* -** Create an expression representing variable 'vidx' -*/ -static void init_var (FuncState *fs, expdesc *e, int vidx) { - e->f = e->t = NO_JUMP; - e->k = VLOCAL; - e->u.var.vidx = vidx; - e->u.var.ridx = getlocalvardesc(fs, vidx)->vd.ridx; -} - - -/* -** Raises an error if variable described by 'e' is read only -*/ -static void check_readonly (LexState *ls, expdesc *e) { - FuncState *fs = ls->fs; - TString *varname = NULL; /* to be set if variable is const */ - switch (e->k) { - case VCONST: { - varname = ls->dyd->actvar.arr[e->u.info].vd.name; - break; - } - case VLOCAL: { - Vardesc *vardesc = getlocalvardesc(fs, e->u.var.vidx); - if (vardesc->vd.kind != VDKREG) /* not a regular variable? */ - varname = vardesc->vd.name; - break; - } - case VUPVAL: { - Upvaldesc *up = &fs->f->upvalues[e->u.info]; - if (up->kind != VDKREG) - varname = up->name; - break; - } - default: - return; /* other cases cannot be read-only */ - } - if (varname) { - const char *msg = luaO_pushfstring(ls->L, - "attempt to assign to const variable '%s'", getstr(varname)); - luaK_semerror(ls, msg); /* error */ - } -} - - -/* -** Start the scope for the last 'nvars' created variables. -*/ -static void adjustlocalvars (LexState *ls, int nvars) { - FuncState *fs = ls->fs; - int reglevel = luaY_nvarstack(fs); - int i; - for (i = 0; i < nvars; i++) { - int vidx = fs->nactvar++; - Vardesc *var = getlocalvardesc(fs, vidx); - var->vd.ridx = reglevel++; - var->vd.pidx = registerlocalvar(ls, fs, var->vd.name); - } -} - - -/* -** Close the scope for all variables up to level 'tolevel'. -** (debug info.) -*/ -static void removevars (FuncState *fs, int tolevel) { - fs->ls->dyd->actvar.n -= (fs->nactvar - tolevel); - while (fs->nactvar > tolevel) { - LocVar *var = localdebuginfo(fs, --fs->nactvar); - if (var) /* does it have debug information? */ - var->endpc = fs->pc; - } -} - - -/* -** Search the upvalues of the function 'fs' for one -** with the given 'name'. -*/ -static int searchupvalue (FuncState *fs, TString *name) { - int i; - Upvaldesc *up = fs->f->upvalues; - for (i = 0; i < fs->nups; i++) { - if (eqstr(up[i].name, name)) return i; - } - return -1; /* not found */ -} - - -static Upvaldesc *allocupvalue (FuncState *fs) { - Proto *f = fs->f; - int oldsize = f->sizeupvalues; - checklimit(fs, fs->nups + 1, MAXUPVAL, "upvalues"); - luaM_growvector(fs->ls->L, f->upvalues, fs->nups, f->sizeupvalues, - Upvaldesc, MAXUPVAL, "upvalues"); - while (oldsize < f->sizeupvalues) - f->upvalues[oldsize++].name = NULL; - return &f->upvalues[fs->nups++]; -} - - -static int newupvalue (FuncState *fs, TString *name, expdesc *v) { - Upvaldesc *up = allocupvalue(fs); - FuncState *prev = fs->prev; - if (v->k == VLOCAL) { - up->instack = 1; - up->idx = v->u.var.ridx; - up->kind = getlocalvardesc(prev, v->u.var.vidx)->vd.kind; - lua_assert(eqstr(name, getlocalvardesc(prev, v->u.var.vidx)->vd.name)); - } - else { - up->instack = 0; - up->idx = cast_byte(v->u.info); - up->kind = prev->f->upvalues[v->u.info].kind; - lua_assert(eqstr(name, prev->f->upvalues[v->u.info].name)); - } - up->name = name; - luaC_objbarrier(fs->ls->L, fs->f, name); - return fs->nups - 1; -} - - -/* -** Look for an active local variable with the name 'n' in the -** function 'fs'. If found, initialize 'var' with it and return -** its expression kind; otherwise return -1. -*/ -static int searchvar (FuncState *fs, TString *n, expdesc *var) { - int i; - for (i = cast_int(fs->nactvar) - 1; i >= 0; i--) { - Vardesc *vd = getlocalvardesc(fs, i); - if (eqstr(n, vd->vd.name)) { /* found? */ - if (vd->vd.kind == RDKCTC) /* compile-time constant? */ - init_exp(var, VCONST, fs->firstlocal + i); - else /* real variable */ - init_var(fs, var, i); - return var->k; - } - } - return -1; /* not found */ -} - - -/* -** Mark block where variable at given level was defined -** (to emit close instructions later). -*/ -static void markupval (FuncState *fs, int level) { - BlockCnt *bl = fs->bl; - while (bl->nactvar > level) - bl = bl->previous; - bl->upval = 1; - fs->needclose = 1; -} - - -/* -** Mark that current block has a to-be-closed variable. -*/ -static void marktobeclosed (FuncState *fs) { - BlockCnt *bl = fs->bl; - bl->upval = 1; - bl->insidetbc = 1; - fs->needclose = 1; -} - - -/* -** Find a variable with the given name 'n'. If it is an upvalue, add -** this upvalue into all intermediate functions. If it is a global, set -** 'var' as 'void' as a flag. -*/ -static void singlevaraux (FuncState *fs, TString *n, expdesc *var, int base) { - if (fs == NULL) /* no more levels? */ - init_exp(var, VVOID, 0); /* default is global */ - else { - int v = searchvar(fs, n, var); /* look up locals at current level */ - if (v >= 0) { /* found? */ - if (v == VLOCAL && !base) - markupval(fs, var->u.var.vidx); /* local will be used as an upval */ - } - else { /* not found as local at current level; try upvalues */ - int idx = searchupvalue(fs, n); /* try existing upvalues */ - if (idx < 0) { /* not found? */ - singlevaraux(fs->prev, n, var, 0); /* try upper levels */ - if (var->k == VLOCAL || var->k == VUPVAL) /* local or upvalue? */ - idx = newupvalue(fs, n, var); /* will be a new upvalue */ - else /* it is a global or a constant */ - return; /* don't need to do anything at this level */ - } - init_exp(var, VUPVAL, idx); /* new or old upvalue */ - } - } -} - - -/* -** Find a variable with the given name 'n', handling global variables -** too. -*/ -static void singlevar (LexState *ls, expdesc *var) { - TString *varname = str_checkname(ls); - FuncState *fs = ls->fs; - singlevaraux(fs, varname, var, 1); - if (var->k == VVOID) { /* global name? */ - expdesc key; - singlevaraux(fs, ls->envn, var, 1); /* get environment variable */ - lua_assert(var->k != VVOID); /* this one must exist */ - luaK_exp2anyregup(fs, var); /* but could be a constant */ - codestring(&key, varname); /* key is variable name */ - luaK_indexed(fs, var, &key); /* env[varname] */ - } -} - - -/* -** Adjust the number of results from an expression list 'e' with 'nexps' -** expressions to 'nvars' values. -*/ -static void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) { - FuncState *fs = ls->fs; - int needed = nvars - nexps; /* extra values needed */ - if (hasmultret(e->k)) { /* last expression has multiple returns? */ - int extra = needed + 1; /* discount last expression itself */ - if (extra < 0) - extra = 0; - luaK_setreturns(fs, e, extra); /* last exp. provides the difference */ - } - else { - if (e->k != VVOID) /* at least one expression? */ - luaK_exp2nextreg(fs, e); /* close last expression */ - if (needed > 0) /* missing values? */ - luaK_nil(fs, fs->freereg, needed); /* complete with nils */ - } - if (needed > 0) - luaK_reserveregs(fs, needed); /* registers for extra values */ - else /* adding 'needed' is actually a subtraction */ - fs->freereg += needed; /* remove extra values */ -} - - -#define enterlevel(ls) luaE_incCstack(ls->L) - - -#define leavelevel(ls) ((ls)->L->nCcalls--) - - -/* -** Generates an error that a goto jumps into the scope of some -** local variable. -*/ -static l_noret jumpscopeerror (LexState *ls, Labeldesc *gt) { - TString *tsname = getlocalvardesc(ls->fs, gt->nactvar)->vd.name; - const char *varname = getstr(tsname); - const char *msg = " at line %d jumps into the scope of local '%s'"; - msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line, varname); - luaK_semerror(ls, msg); /* raise the error */ -} - - -/* -** Solves the goto at index 'g' to given 'label' and removes it -** from the list of pending gotos. -** If it jumps into the scope of some variable, raises an error. -*/ -static void solvegoto (LexState *ls, int g, Labeldesc *label) { - int i; - Labellist *gl = &ls->dyd->gt; /* list of gotos */ - Labeldesc *gt = &gl->arr[g]; /* goto to be resolved */ - lua_assert(eqstr(gt->name, label->name)); - if (l_unlikely(gt->nactvar < label->nactvar)) /* enter some scope? */ - jumpscopeerror(ls, gt); - luaK_patchlist(ls->fs, gt->pc, label->pc); - for (i = g; i < gl->n - 1; i++) /* remove goto from pending list */ - gl->arr[i] = gl->arr[i + 1]; - gl->n--; -} - - -/* -** Search for an active label with the given name. -*/ -static Labeldesc *findlabel (LexState *ls, TString *name) { - int i; - Dyndata *dyd = ls->dyd; - /* check labels in current function for a match */ - for (i = ls->fs->firstlabel; i < dyd->label.n; i++) { - Labeldesc *lb = &dyd->label.arr[i]; - if (eqstr(lb->name, name)) /* correct label? */ - return lb; - } - return NULL; /* label not found */ -} - - -/* -** Adds a new label/goto in the corresponding list. -*/ -static int newlabelentry (LexState *ls, Labellist *l, TString *name, - int line, int pc) { - int n = l->n; - luaM_growvector(ls->L, l->arr, n, l->size, - Labeldesc, SHRT_MAX, "labels/gotos"); - l->arr[n].name = name; - l->arr[n].line = line; - l->arr[n].nactvar = ls->fs->nactvar; - l->arr[n].close = 0; - l->arr[n].pc = pc; - l->n = n + 1; - return n; -} - - -static int newgotoentry (LexState *ls, TString *name, int line, int pc) { - return newlabelentry(ls, &ls->dyd->gt, name, line, pc); -} - - -/* -** Solves forward jumps. Check whether new label 'lb' matches any -** pending gotos in current block and solves them. Return true -** if any of the gotos need to close upvalues. -*/ -static int solvegotos (LexState *ls, Labeldesc *lb) { - Labellist *gl = &ls->dyd->gt; - int i = ls->fs->bl->firstgoto; - int needsclose = 0; - while (i < gl->n) { - if (eqstr(gl->arr[i].name, lb->name)) { - needsclose |= gl->arr[i].close; - solvegoto(ls, i, lb); /* will remove 'i' from the list */ - } - else - i++; - } - return needsclose; -} - - -/* -** Create a new label with the given 'name' at the given 'line'. -** 'last' tells whether label is the last non-op statement in its -** block. Solves all pending gotos to this new label and adds -** a close instruction if necessary. -** Returns true iff it added a close instruction. -*/ -static int createlabel (LexState *ls, TString *name, int line, - int last) { - FuncState *fs = ls->fs; - Labellist *ll = &ls->dyd->label; - int l = newlabelentry(ls, ll, name, line, luaK_getlabel(fs)); - if (last) { /* label is last no-op statement in the block? */ - /* assume that locals are already out of scope */ - ll->arr[l].nactvar = fs->bl->nactvar; - } - if (solvegotos(ls, &ll->arr[l])) { /* need close? */ - luaK_codeABC(fs, OP_CLOSE, luaY_nvarstack(fs), 0, 0); - return 1; - } - return 0; -} - - -/* -** Adjust pending gotos to outer level of a block. -*/ -static void movegotosout (FuncState *fs, BlockCnt *bl) { - int i; - Labellist *gl = &fs->ls->dyd->gt; - /* correct pending gotos to current block */ - for (i = bl->firstgoto; i < gl->n; i++) { /* for each pending goto */ - Labeldesc *gt = &gl->arr[i]; - /* leaving a variable scope? */ - if (reglevel(fs, gt->nactvar) > reglevel(fs, bl->nactvar)) - gt->close |= bl->upval; /* jump may need a close */ - gt->nactvar = bl->nactvar; /* update goto level */ - } -} - - -static void enterblock (FuncState *fs, BlockCnt *bl, lu_byte isloop) { - bl->isloop = isloop; - bl->nactvar = fs->nactvar; - bl->firstlabel = fs->ls->dyd->label.n; - bl->firstgoto = fs->ls->dyd->gt.n; - bl->upval = 0; - bl->insidetbc = (fs->bl != NULL && fs->bl->insidetbc); - bl->previous = fs->bl; - fs->bl = bl; - lua_assert(fs->freereg == luaY_nvarstack(fs)); -} - - -/* -** generates an error for an undefined 'goto'. -*/ -static l_noret undefgoto (LexState *ls, Labeldesc *gt) { - const char *msg; - if (eqstr(gt->name, luaS_newliteral(ls->L, "break"))) { - msg = "break outside loop at line %d"; - msg = luaO_pushfstring(ls->L, msg, gt->line); - } - else { - msg = "no visible label '%s' for at line %d"; - msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line); - } - luaK_semerror(ls, msg); -} - - -static void leaveblock (FuncState *fs) { - BlockCnt *bl = fs->bl; - LexState *ls = fs->ls; - int hasclose = 0; - int stklevel = reglevel(fs, bl->nactvar); /* level outside the block */ - removevars(fs, bl->nactvar); /* remove block locals */ - lua_assert(bl->nactvar == fs->nactvar); /* back to level on entry */ - if (bl->isloop) /* has to fix pending breaks? */ - hasclose = createlabel(ls, luaS_newliteral(ls->L, "break"), 0, 0); - if (!hasclose && bl->previous && bl->upval) /* still need a 'close'? */ - luaK_codeABC(fs, OP_CLOSE, stklevel, 0, 0); - fs->freereg = stklevel; /* free registers */ - ls->dyd->label.n = bl->firstlabel; /* remove local labels */ - fs->bl = bl->previous; /* current block now is previous one */ - if (bl->previous) /* was it a nested block? */ - movegotosout(fs, bl); /* update pending gotos to enclosing block */ - else { - if (bl->firstgoto < ls->dyd->gt.n) /* still pending gotos? */ - undefgoto(ls, &ls->dyd->gt.arr[bl->firstgoto]); /* error */ - } -} - - -/* -** adds a new prototype into list of prototypes -*/ -static Proto *addprototype (LexState *ls) { - Proto *clp; - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Proto *f = fs->f; /* prototype of current function */ - if (fs->np >= f->sizep) { - int oldsize = f->sizep; - luaM_growvector(L, f->p, fs->np, f->sizep, Proto *, MAXARG_Bx, "functions"); - while (oldsize < f->sizep) - f->p[oldsize++] = NULL; - } - f->p[fs->np++] = clp = luaF_newproto(L); - luaC_objbarrier(L, f, clp); - return clp; -} - - -/* -** codes instruction to create new closure in parent function. -** The OP_CLOSURE instruction uses the last available register, -** so that, if it invokes the GC, the GC knows which registers -** are in use at that time. - -*/ -static void codeclosure (LexState *ls, expdesc *v) { - FuncState *fs = ls->fs->prev; - init_exp(v, VRELOC, luaK_codeABx(fs, OP_CLOSURE, 0, fs->np - 1)); - luaK_exp2nextreg(fs, v); /* fix it at the last register */ -} - - -static void open_func (LexState *ls, FuncState *fs, BlockCnt *bl) { - Proto *f = fs->f; - fs->prev = ls->fs; /* linked list of funcstates */ - fs->ls = ls; - ls->fs = fs; - fs->pc = 0; - fs->previousline = f->linedefined; - fs->iwthabs = 0; - fs->lasttarget = 0; - fs->freereg = 0; - fs->nk = 0; - fs->nabslineinfo = 0; - fs->np = 0; - fs->nups = 0; - fs->ndebugvars = 0; - fs->nactvar = 0; - fs->needclose = 0; - fs->firstlocal = ls->dyd->actvar.n; - fs->firstlabel = ls->dyd->label.n; - fs->bl = NULL; - f->source = ls->source; - luaC_objbarrier(ls->L, f, f->source); - f->maxstacksize = 2; /* registers 0/1 are always valid */ - enterblock(fs, bl, 0); -} - - -static void close_func (LexState *ls) { - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Proto *f = fs->f; - luaK_ret(fs, luaY_nvarstack(fs), 0); /* final return */ - leaveblock(fs); - lua_assert(fs->bl == NULL); - luaK_finish(fs); - luaM_shrinkvector(L, f->code, f->sizecode, fs->pc, Instruction); - luaM_shrinkvector(L, f->lineinfo, f->sizelineinfo, fs->pc, ls_byte); - luaM_shrinkvector(L, f->abslineinfo, f->sizeabslineinfo, - fs->nabslineinfo, AbsLineInfo); - luaM_shrinkvector(L, f->k, f->sizek, fs->nk, TValue); - luaM_shrinkvector(L, f->p, f->sizep, fs->np, Proto *); - luaM_shrinkvector(L, f->locvars, f->sizelocvars, fs->ndebugvars, LocVar); - luaM_shrinkvector(L, f->upvalues, f->sizeupvalues, fs->nups, Upvaldesc); - ls->fs = fs->prev; - luaC_checkGC(L); -} - - - -/*============================================================*/ -/* GRAMMAR RULES */ -/*============================================================*/ - - -/* -** check whether current token is in the follow set of a block. -** 'until' closes syntactical blocks, but do not close scope, -** so it is handled in separate. -*/ -static int block_follow (LexState *ls, int withuntil) { - switch (ls->t.token) { - case TK_ELSE: case TK_ELSEIF: - case TK_END: case TK_EOS: - return 1; - case TK_UNTIL: return withuntil; - default: return 0; - } -} - - -static void statlist (LexState *ls) { - /* statlist -> { stat [';'] } */ - while (!block_follow(ls, 1)) { - if (ls->t.token == TK_RETURN) { - statement(ls); - return; /* 'return' must be last statement */ - } - statement(ls); - } -} - - -static void fieldsel (LexState *ls, expdesc *v) { - /* fieldsel -> ['.' | ':'] NAME */ - FuncState *fs = ls->fs; - expdesc key; - luaK_exp2anyregup(fs, v); - luaX_next(ls); /* skip the dot or colon */ - codename(ls, &key); - luaK_indexed(fs, v, &key); -} - - -static void yindex (LexState *ls, expdesc *v) { - /* index -> '[' expr ']' */ - luaX_next(ls); /* skip the '[' */ - expr(ls, v); - luaK_exp2val(ls->fs, v); - checknext(ls, ']'); -} - - -/* -** {====================================================================== -** Rules for Constructors -** ======================================================================= -*/ - - -typedef struct ConsControl { - expdesc v; /* last list item read */ - expdesc *t; /* table descriptor */ - int nh; /* total number of 'record' elements */ - int na; /* number of array elements already stored */ - int tostore; /* number of array elements pending to be stored */ -} ConsControl; - - -static void recfield (LexState *ls, ConsControl *cc) { - /* recfield -> (NAME | '['exp']') = exp */ - FuncState *fs = ls->fs; - int reg = ls->fs->freereg; - expdesc tab, key, val; - if (ls->t.token == TK_NAME) { - checklimit(fs, cc->nh, MAX_INT, "items in a constructor"); - codename(ls, &key); - } - else /* ls->t.token == '[' */ - yindex(ls, &key); - cc->nh++; - checknext(ls, '='); - tab = *cc->t; - luaK_indexed(fs, &tab, &key); - expr(ls, &val); - luaK_storevar(fs, &tab, &val); - fs->freereg = reg; /* free registers */ -} - - -static void closelistfield (FuncState *fs, ConsControl *cc) { - if (cc->v.k == VVOID) return; /* there is no list item */ - luaK_exp2nextreg(fs, &cc->v); - cc->v.k = VVOID; - if (cc->tostore == LFIELDS_PER_FLUSH) { - luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); /* flush */ - cc->na += cc->tostore; - cc->tostore = 0; /* no more items pending */ - } -} - - -static void lastlistfield (FuncState *fs, ConsControl *cc) { - if (cc->tostore == 0) return; - if (hasmultret(cc->v.k)) { - luaK_setmultret(fs, &cc->v); - luaK_setlist(fs, cc->t->u.info, cc->na, LUA_MULTRET); - cc->na--; /* do not count last expression (unknown number of elements) */ - } - else { - if (cc->v.k != VVOID) - luaK_exp2nextreg(fs, &cc->v); - luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); - } - cc->na += cc->tostore; -} - - -static void listfield (LexState *ls, ConsControl *cc) { - /* listfield -> exp */ - expr(ls, &cc->v); - cc->tostore++; -} - - -static void field (LexState *ls, ConsControl *cc) { - /* field -> listfield | recfield */ - switch(ls->t.token) { - case TK_NAME: { /* may be 'listfield' or 'recfield' */ - if (luaX_lookahead(ls) != '=') /* expression? */ - listfield(ls, cc); - else - recfield(ls, cc); - break; - } - case '[': { - recfield(ls, cc); - break; - } - default: { - listfield(ls, cc); - break; - } - } -} - - -static void constructor (LexState *ls, expdesc *t) { - /* constructor -> '{' [ field { sep field } [sep] ] '}' - sep -> ',' | ';' */ - FuncState *fs = ls->fs; - int line = ls->linenumber; - int pc = luaK_codeABC(fs, OP_NEWTABLE, 0, 0, 0); - ConsControl cc; - luaK_code(fs, 0); /* space for extra arg. */ - cc.na = cc.nh = cc.tostore = 0; - cc.t = t; - init_exp(t, VNONRELOC, fs->freereg); /* table will be at stack top */ - luaK_reserveregs(fs, 1); - init_exp(&cc.v, VVOID, 0); /* no value (yet) */ - checknext(ls, '{'); - do { - lua_assert(cc.v.k == VVOID || cc.tostore > 0); - if (ls->t.token == '}') break; - closelistfield(fs, &cc); - field(ls, &cc); - } while (testnext(ls, ',') || testnext(ls, ';')); - check_match(ls, '}', '{', line); - lastlistfield(fs, &cc); - luaK_settablesize(fs, pc, t->u.info, cc.na, cc.nh); -} - -/* }====================================================================== */ - - -static void setvararg (FuncState *fs, int nparams) { - fs->f->flag |= PF_ISVARARG; - luaK_codeABC(fs, OP_VARARGPREP, nparams, 0, 0); -} - - -static void parlist (LexState *ls) { - /* parlist -> [ {NAME ','} (NAME | '...') ] */ - FuncState *fs = ls->fs; - Proto *f = fs->f; - int nparams = 0; - int isvararg = 0; - if (ls->t.token != ')') { /* is 'parlist' not empty? */ - do { - switch (ls->t.token) { - case TK_NAME: { - new_localvar(ls, str_checkname(ls)); - nparams++; - break; - } - case TK_DOTS: { - luaX_next(ls); - isvararg = 1; - break; - } - default: luaX_syntaxerror(ls, " or '...' expected"); - } - } while (!isvararg && testnext(ls, ',')); - } - adjustlocalvars(ls, nparams); - f->numparams = cast_byte(fs->nactvar); - if (isvararg) - setvararg(fs, f->numparams); /* declared vararg */ - luaK_reserveregs(fs, fs->nactvar); /* reserve registers for parameters */ -} - - -static void body (LexState *ls, expdesc *e, int ismethod, int line) { - /* body -> '(' parlist ')' block END */ - FuncState new_fs; - BlockCnt bl; - new_fs.f = addprototype(ls); - new_fs.f->linedefined = line; - open_func(ls, &new_fs, &bl); - checknext(ls, '('); - if (ismethod) { - new_localvarliteral(ls, "self"); /* create 'self' parameter */ - adjustlocalvars(ls, 1); - } - parlist(ls); - checknext(ls, ')'); - statlist(ls); - new_fs.f->lastlinedefined = ls->linenumber; - check_match(ls, TK_END, TK_FUNCTION, line); - codeclosure(ls, e); - close_func(ls); -} - - -static int explist (LexState *ls, expdesc *v) { - /* explist -> expr { ',' expr } */ - int n = 1; /* at least one expression */ - expr(ls, v); - while (testnext(ls, ',')) { - luaK_exp2nextreg(ls->fs, v); - expr(ls, v); - n++; - } - return n; -} - - -static void funcargs (LexState *ls, expdesc *f) { - FuncState *fs = ls->fs; - expdesc args; - int base, nparams; - int line = ls->linenumber; - switch (ls->t.token) { - case '(': { /* funcargs -> '(' [ explist ] ')' */ - luaX_next(ls); - if (ls->t.token == ')') /* arg list is empty? */ - args.k = VVOID; - else { - explist(ls, &args); - if (hasmultret(args.k)) - luaK_setmultret(fs, &args); - } - check_match(ls, ')', '(', line); - break; - } - case '{': { /* funcargs -> constructor */ - constructor(ls, &args); - break; - } - case TK_STRING: { /* funcargs -> STRING */ - codestring(&args, ls->t.seminfo.ts); - luaX_next(ls); /* must use 'seminfo' before 'next' */ - break; - } - default: { - luaX_syntaxerror(ls, "function arguments expected"); - } - } - lua_assert(f->k == VNONRELOC); - base = f->u.info; /* base register for call */ - if (hasmultret(args.k)) - nparams = LUA_MULTRET; /* open call */ - else { - if (args.k != VVOID) - luaK_exp2nextreg(fs, &args); /* close last argument */ - nparams = fs->freereg - (base+1); - } - init_exp(f, VCALL, luaK_codeABC(fs, OP_CALL, base, nparams+1, 2)); - luaK_fixline(fs, line); - fs->freereg = base+1; /* call removes function and arguments and leaves - one result (unless changed later) */ -} - - - - -/* -** {====================================================================== -** Expression parsing -** ======================================================================= -*/ - - -static void primaryexp (LexState *ls, expdesc *v) { - /* primaryexp -> NAME | '(' expr ')' */ - switch (ls->t.token) { - case '(': { - int line = ls->linenumber; - luaX_next(ls); - expr(ls, v); - check_match(ls, ')', '(', line); - luaK_dischargevars(ls->fs, v); - return; - } - case TK_NAME: { - singlevar(ls, v); - return; - } - default: { - luaX_syntaxerror(ls, "unexpected symbol"); - } - } -} - - -static void suffixedexp (LexState *ls, expdesc *v) { - /* suffixedexp -> - primaryexp { '.' NAME | '[' exp ']' | ':' NAME funcargs | funcargs } */ - FuncState *fs = ls->fs; - primaryexp(ls, v); - for (;;) { - switch (ls->t.token) { - case '.': { /* fieldsel */ - fieldsel(ls, v); - break; - } - case '[': { /* '[' exp ']' */ - expdesc key; - luaK_exp2anyregup(fs, v); - yindex(ls, &key); - luaK_indexed(fs, v, &key); - break; - } - case ':': { /* ':' NAME funcargs */ - expdesc key; - luaX_next(ls); - codename(ls, &key); - luaK_self(fs, v, &key); - funcargs(ls, v); - break; - } - case '(': case TK_STRING: case '{': { /* funcargs */ - luaK_exp2nextreg(fs, v); - funcargs(ls, v); - break; - } - default: return; - } - } -} - - -static void simpleexp (LexState *ls, expdesc *v) { - /* simpleexp -> FLT | INT | STRING | NIL | TRUE | FALSE | ... | - constructor | FUNCTION body | suffixedexp */ - switch (ls->t.token) { - case TK_FLT: { - init_exp(v, VKFLT, 0); - v->u.nval = ls->t.seminfo.r; - break; - } - case TK_INT: { - init_exp(v, VKINT, 0); - v->u.ival = ls->t.seminfo.i; - break; - } - case TK_STRING: { - codestring(v, ls->t.seminfo.ts); - break; - } - case TK_NIL: { - init_exp(v, VNIL, 0); - break; - } - case TK_TRUE: { - init_exp(v, VTRUE, 0); - break; - } - case TK_FALSE: { - init_exp(v, VFALSE, 0); - break; - } - case TK_DOTS: { /* vararg */ - FuncState *fs = ls->fs; - check_condition(ls, fs->f->flag & PF_ISVARARG, - "cannot use '...' outside a vararg function"); - init_exp(v, VVARARG, luaK_codeABC(fs, OP_VARARG, 0, 0, 1)); - break; - } - case '{': { /* constructor */ - constructor(ls, v); - return; - } - case TK_FUNCTION: { - luaX_next(ls); - body(ls, v, 0, ls->linenumber); - return; - } - default: { - suffixedexp(ls, v); - return; - } - } - luaX_next(ls); -} - - -static UnOpr getunopr (int op) { - switch (op) { - case TK_NOT: return OPR_NOT; - case '-': return OPR_MINUS; - case '~': return OPR_BNOT; - case '#': return OPR_LEN; - default: return OPR_NOUNOPR; - } -} - - -static BinOpr getbinopr (int op) { - switch (op) { - case '+': return OPR_ADD; - case '-': return OPR_SUB; - case '*': return OPR_MUL; - case '%': return OPR_MOD; - case '^': return OPR_POW; - case '/': return OPR_DIV; - case TK_IDIV: return OPR_IDIV; - case '&': return OPR_BAND; - case '|': return OPR_BOR; - case '~': return OPR_BXOR; - case TK_SHL: return OPR_SHL; - case TK_SHR: return OPR_SHR; - case TK_CONCAT: return OPR_CONCAT; - case TK_NE: return OPR_NE; - case TK_EQ: return OPR_EQ; - case '<': return OPR_LT; - case TK_LE: return OPR_LE; - case '>': return OPR_GT; - case TK_GE: return OPR_GE; - case TK_AND: return OPR_AND; - case TK_OR: return OPR_OR; - default: return OPR_NOBINOPR; - } -} - - -/* -** Priority table for binary operators. -*/ -static const struct { - lu_byte left; /* left priority for each binary operator */ - lu_byte right; /* right priority */ -} priority[] = { /* ORDER OPR */ - {10, 10}, {10, 10}, /* '+' '-' */ - {11, 11}, {11, 11}, /* '*' '%' */ - {14, 13}, /* '^' (right associative) */ - {11, 11}, {11, 11}, /* '/' '//' */ - {6, 6}, {4, 4}, {5, 5}, /* '&' '|' '~' */ - {7, 7}, {7, 7}, /* '<<' '>>' */ - {9, 8}, /* '..' (right associative) */ - {3, 3}, {3, 3}, {3, 3}, /* ==, <, <= */ - {3, 3}, {3, 3}, {3, 3}, /* ~=, >, >= */ - {2, 2}, {1, 1} /* and, or */ -}; - -#define UNARY_PRIORITY 12 /* priority for unary operators */ - - -/* -** subexpr -> (simpleexp | unop subexpr) { binop subexpr } -** where 'binop' is any binary operator with a priority higher than 'limit' -*/ -static BinOpr subexpr (LexState *ls, expdesc *v, int limit) { - BinOpr op; - UnOpr uop; - enterlevel(ls); - uop = getunopr(ls->t.token); - if (uop != OPR_NOUNOPR) { /* prefix (unary) operator? */ - int line = ls->linenumber; - luaX_next(ls); /* skip operator */ - subexpr(ls, v, UNARY_PRIORITY); - luaK_prefix(ls->fs, uop, v, line); - } - else simpleexp(ls, v); - /* expand while operators have priorities higher than 'limit' */ - op = getbinopr(ls->t.token); - while (op != OPR_NOBINOPR && priority[op].left > limit) { - expdesc v2; - BinOpr nextop; - int line = ls->linenumber; - luaX_next(ls); /* skip operator */ - luaK_infix(ls->fs, op, v); - /* read sub-expression with higher priority */ - nextop = subexpr(ls, &v2, priority[op].right); - luaK_posfix(ls->fs, op, v, &v2, line); - op = nextop; - } - leavelevel(ls); - return op; /* return first untreated operator */ -} - - -static void expr (LexState *ls, expdesc *v) { - subexpr(ls, v, 0); -} - -/* }==================================================================== */ - - - -/* -** {====================================================================== -** Rules for Statements -** ======================================================================= -*/ - - -static void block (LexState *ls) { - /* block -> statlist */ - FuncState *fs = ls->fs; - BlockCnt bl; - enterblock(fs, &bl, 0); - statlist(ls); - leaveblock(fs); -} - - -/* -** structure to chain all variables in the left-hand side of an -** assignment -*/ -struct LHS_assign { - struct LHS_assign *prev; - expdesc v; /* variable (global, local, upvalue, or indexed) */ -}; - - -/* -** check whether, in an assignment to an upvalue/local variable, the -** upvalue/local variable is begin used in a previous assignment to a -** table. If so, save original upvalue/local value in a safe place and -** use this safe copy in the previous assignment. -*/ -static void check_conflict (LexState *ls, struct LHS_assign *lh, expdesc *v) { - FuncState *fs = ls->fs; - int extra = fs->freereg; /* eventual position to save local variable */ - int conflict = 0; - for (; lh; lh = lh->prev) { /* check all previous assignments */ - if (vkisindexed(lh->v.k)) { /* assignment to table field? */ - if (lh->v.k == VINDEXUP) { /* is table an upvalue? */ - if (v->k == VUPVAL && lh->v.u.ind.t == v->u.info) { - conflict = 1; /* table is the upvalue being assigned now */ - lh->v.k = VINDEXSTR; - lh->v.u.ind.t = extra; /* assignment will use safe copy */ - } - } - else { /* table is a register */ - if (v->k == VLOCAL && lh->v.u.ind.t == v->u.var.ridx) { - conflict = 1; /* table is the local being assigned now */ - lh->v.u.ind.t = extra; /* assignment will use safe copy */ - } - /* is index the local being assigned? */ - if (lh->v.k == VINDEXED && v->k == VLOCAL && - lh->v.u.ind.idx == v->u.var.ridx) { - conflict = 1; - lh->v.u.ind.idx = extra; /* previous assignment will use safe copy */ - } - } - } - } - if (conflict) { - /* copy upvalue/local value to a temporary (in position 'extra') */ - if (v->k == VLOCAL) - luaK_codeABC(fs, OP_MOVE, extra, v->u.var.ridx, 0); - else - luaK_codeABC(fs, OP_GETUPVAL, extra, v->u.info, 0); - luaK_reserveregs(fs, 1); - } -} - -/* -** Parse and compile a multiple assignment. The first "variable" -** (a 'suffixedexp') was already read by the caller. -** -** assignment -> suffixedexp restassign -** restassign -> ',' suffixedexp restassign | '=' explist -*/ -static void restassign (LexState *ls, struct LHS_assign *lh, int nvars) { - expdesc e; - check_condition(ls, vkisvar(lh->v.k), "syntax private_lua_error"); - check_readonly(ls, &lh->v); - if (testnext(ls, ',')) { /* restassign -> ',' suffixedexp restassign */ - struct LHS_assign nv; - nv.prev = lh; - suffixedexp(ls, &nv.v); - if (!vkisindexed(nv.v.k)) - check_conflict(ls, lh, &nv.v); - enterlevel(ls); /* control recursion depth */ - restassign(ls, &nv, nvars+1); - leavelevel(ls); - } - else { /* restassign -> '=' explist */ - int nexps; - checknext(ls, '='); - nexps = explist(ls, &e); - if (nexps != nvars) - adjust_assign(ls, nvars, nexps, &e); - else { - luaK_setoneret(ls->fs, &e); /* close last expression */ - luaK_storevar(ls->fs, &lh->v, &e); - return; /* avoid default */ - } - } - init_exp(&e, VNONRELOC, ls->fs->freereg-1); /* default assignment */ - luaK_storevar(ls->fs, &lh->v, &e); -} - - -static int cond (LexState *ls) { - /* cond -> exp */ - expdesc v; - expr(ls, &v); /* read condition */ - if (v.k == VNIL) v.k = VFALSE; /* 'falses' are all equal here */ - luaK_goiftrue(ls->fs, &v); - return v.f; -} - - -static void gotostat (LexState *ls) { - FuncState *fs = ls->fs; - int line = ls->linenumber; - TString *name = str_checkname(ls); /* label's name */ - Labeldesc *lb = findlabel(ls, name); - if (lb == NULL) /* no label? */ - /* forward jump; will be resolved when the label is declared */ - newgotoentry(ls, name, line, luaK_jump(fs)); - else { /* found a label */ - /* backward jump; will be resolved here */ - int lblevel = reglevel(fs, lb->nactvar); /* label level */ - if (luaY_nvarstack(fs) > lblevel) /* leaving the scope of a variable? */ - luaK_codeABC(fs, OP_CLOSE, lblevel, 0, 0); - /* create jump and link it to the label */ - luaK_patchlist(fs, luaK_jump(fs), lb->pc); - } -} - - -/* -** Break statement. Semantically equivalent to "goto break". -*/ -static void breakstat (LexState *ls) { - int line = ls->linenumber; - luaX_next(ls); /* skip break */ - newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, luaK_jump(ls->fs)); -} - - -/* -** Check whether there is already a label with the given 'name'. -*/ -static void checkrepeated (LexState *ls, TString *name) { - Labeldesc *lb = findlabel(ls, name); - if (l_unlikely(lb != NULL)) { /* already defined? */ - const char *msg = "label '%s' already defined on line %d"; - msg = luaO_pushfstring(ls->L, msg, getstr(name), lb->line); - luaK_semerror(ls, msg); /* error */ - } -} - - -static void labelstat (LexState *ls, TString *name, int line) { - /* label -> '::' NAME '::' */ - checknext(ls, TK_DBCOLON); /* skip double colon */ - while (ls->t.token == ';' || ls->t.token == TK_DBCOLON) - statement(ls); /* skip other no-op statements */ - checkrepeated(ls, name); /* check for repeated labels */ - createlabel(ls, name, line, block_follow(ls, 0)); -} - - -static void whilestat (LexState *ls, int line) { - /* whilestat -> WHILE cond DO block END */ - FuncState *fs = ls->fs; - int whileinit; - int condexit; - BlockCnt bl; - luaX_next(ls); /* skip WHILE */ - whileinit = luaK_getlabel(fs); - condexit = cond(ls); - enterblock(fs, &bl, 1); - checknext(ls, TK_DO); - block(ls); - luaK_jumpto(fs, whileinit); - check_match(ls, TK_END, TK_WHILE, line); - leaveblock(fs); - luaK_patchtohere(fs, condexit); /* false conditions finish the loop */ -} - - -static void repeatstat (LexState *ls, int line) { - /* repeatstat -> REPEAT block UNTIL cond */ - int condexit; - FuncState *fs = ls->fs; - int repeat_init = luaK_getlabel(fs); - BlockCnt bl1, bl2; - enterblock(fs, &bl1, 1); /* loop block */ - enterblock(fs, &bl2, 0); /* scope block */ - luaX_next(ls); /* skip REPEAT */ - statlist(ls); - check_match(ls, TK_UNTIL, TK_REPEAT, line); - condexit = cond(ls); /* read condition (inside scope block) */ - leaveblock(fs); /* finish scope */ - if (bl2.upval) { /* upvalues? */ - int exit = luaK_jump(fs); /* normal exit must jump over fix */ - luaK_patchtohere(fs, condexit); /* repetition must close upvalues */ - luaK_codeABC(fs, OP_CLOSE, reglevel(fs, bl2.nactvar), 0, 0); - condexit = luaK_jump(fs); /* repeat after closing upvalues */ - luaK_patchtohere(fs, exit); /* normal exit comes to here */ - } - luaK_patchlist(fs, condexit, repeat_init); /* close the loop */ - leaveblock(fs); /* finish loop */ -} - - -/* -** Read an expression and generate code to put its results in next -** stack slot. -** -*/ -static void exp1 (LexState *ls) { - expdesc e; - expr(ls, &e); - luaK_exp2nextreg(ls->fs, &e); - lua_assert(e.k == VNONRELOC); -} - - -/* -** Fix for instruction at position 'pc' to jump to 'dest'. -** (Jump addresses are relative in Lua). 'back' true means -** a back jump. -*/ -static void fixforjump (FuncState *fs, int pc, int dest, int back) { - Instruction *jmp = &fs->f->code[pc]; - int offset = dest - (pc + 1); - if (back) - offset = -offset; - if (l_unlikely(offset > MAXARG_Bx)) - luaX_syntaxerror(fs->ls, "control structure too long"); - SETARG_Bx(*jmp, offset); -} - - -/* -** Generate code for a 'for' loop. -*/ -static void forbody (LexState *ls, int base, int line, int nvars, int isgen) { - /* forbody -> DO block */ - static const OpCode forprep[2] = {OP_FORPREP, OP_TFORPREP}; - static const OpCode forloop[2] = {OP_FORLOOP, OP_TFORLOOP}; - BlockCnt bl; - FuncState *fs = ls->fs; - int prep, endfor; - checknext(ls, TK_DO); - prep = luaK_codeABx(fs, forprep[isgen], base, 0); - fs->freereg--; /* both 'forprep' remove one register from the stack */ - enterblock(fs, &bl, 0); /* scope for declared variables */ - adjustlocalvars(ls, nvars); - luaK_reserveregs(fs, nvars); - block(ls); - leaveblock(fs); /* end of scope for declared variables */ - fixforjump(fs, prep, luaK_getlabel(fs), 0); - if (isgen) { /* generic for? */ - luaK_codeABC(fs, OP_TFORCALL, base, 0, nvars); - luaK_fixline(fs, line); - } - endfor = luaK_codeABx(fs, forloop[isgen], base, 0); - fixforjump(fs, endfor, prep + 1, 1); - luaK_fixline(fs, line); -} - - -static void fornum (LexState *ls, TString *varname, int line) { - /* fornum -> NAME = exp,exp[,exp] forbody */ - FuncState *fs = ls->fs; - int base = fs->freereg; - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvarkind(ls, varname, RDKCONST); /* control variable */ - checknext(ls, '='); - exp1(ls); /* initial value */ - checknext(ls, ','); - exp1(ls); /* limit */ - if (testnext(ls, ',')) - exp1(ls); /* optional step */ - else { /* default step = 1 */ - luaK_int(fs, fs->freereg, 1); - luaK_reserveregs(fs, 1); - } - adjustlocalvars(ls, 2); /* start scope for internal variables */ - forbody(ls, base, line, 1, 0); -} - - -static void forlist (LexState *ls, TString *indexname) { - /* forlist -> NAME {,NAME} IN explist forbody */ - FuncState *fs = ls->fs; - expdesc e; - int nvars = 4; /* function, state, closing, control */ - int line; - int base = fs->freereg; - /* create internal variables */ - new_localvarliteral(ls, "(for state)"); /* iterator function */ - new_localvarliteral(ls, "(for state)"); /* state */ - new_localvarliteral(ls, "(for state)"); /* closing var. (after swap) */ - new_localvarkind(ls, indexname, RDKCONST); /* control variable */ - /* other declared variables */ - while (testnext(ls, ',')) { - new_localvar(ls, str_checkname(ls)); - nvars++; - } - checknext(ls, TK_IN); - line = ls->linenumber; - adjust_assign(ls, 4, explist(ls, &e), &e); - adjustlocalvars(ls, 3); /* start scope for internal variables */ - marktobeclosed(fs); /* last internal var. must be closed */ - luaK_checkstack(fs, 2); /* extra space to call iterator */ - forbody(ls, base, line, nvars - 3, 1); -} - - -static void forstat (LexState *ls, int line) { - /* forstat -> FOR (fornum | forlist) END */ - FuncState *fs = ls->fs; - TString *varname; - BlockCnt bl; - enterblock(fs, &bl, 1); /* scope for loop and control variables */ - luaX_next(ls); /* skip 'for' */ - varname = str_checkname(ls); /* first variable name */ - switch (ls->t.token) { - case '=': fornum(ls, varname, line); break; - case ',': case TK_IN: forlist(ls, varname); break; - default: luaX_syntaxerror(ls, "'=' or 'in' expected"); - } - check_match(ls, TK_END, TK_FOR, line); - leaveblock(fs); /* loop scope ('break' jumps to this point) */ -} - - -static void test_then_block (LexState *ls, int *escapelist) { - /* test_then_block -> [IF | ELSEIF] cond THEN block */ - BlockCnt bl; - FuncState *fs = ls->fs; - expdesc v; - int jf; /* instruction to skip 'then' code (if condition is false) */ - luaX_next(ls); /* skip IF or ELSEIF */ - expr(ls, &v); /* read condition */ - checknext(ls, TK_THEN); - if (ls->t.token == TK_BREAK) { /* 'if x then break' ? */ - int line = ls->linenumber; - luaK_goiffalse(ls->fs, &v); /* will jump if condition is true */ - luaX_next(ls); /* skip 'break' */ - enterblock(fs, &bl, 0); /* must enter block before 'goto' */ - newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, v.t); - while (testnext(ls, ';')) {} /* skip semicolons */ - if (block_follow(ls, 0)) { /* jump is the entire block? */ - leaveblock(fs); - return; /* and that is it */ - } - else /* must skip over 'then' part if condition is false */ - jf = luaK_jump(fs); - } - else { /* regular case (not a break) */ - luaK_goiftrue(ls->fs, &v); /* skip over block if condition is false */ - enterblock(fs, &bl, 0); - jf = v.f; - } - statlist(ls); /* 'then' part */ - leaveblock(fs); - if (ls->t.token == TK_ELSE || - ls->t.token == TK_ELSEIF) /* followed by 'else'/'elseif'? */ - luaK_concat(fs, escapelist, luaK_jump(fs)); /* must jump over it */ - luaK_patchtohere(fs, jf); -} - - -static void ifstat (LexState *ls, int line) { - /* ifstat -> IF cond THEN block {ELSEIF cond THEN block} [ELSE block] END */ - FuncState *fs = ls->fs; - int escapelist = NO_JUMP; /* exit list for finished parts */ - test_then_block(ls, &escapelist); /* IF cond THEN block */ - while (ls->t.token == TK_ELSEIF) - test_then_block(ls, &escapelist); /* ELSEIF cond THEN block */ - if (testnext(ls, TK_ELSE)) - block(ls); /* 'else' part */ - check_match(ls, TK_END, TK_IF, line); - luaK_patchtohere(fs, escapelist); /* patch escape list to 'if' end */ -} - - -static void localfunc (LexState *ls) { - expdesc b; - FuncState *fs = ls->fs; - int fvar = fs->nactvar; /* function's variable index */ - new_localvar(ls, str_checkname(ls)); /* new local variable */ - adjustlocalvars(ls, 1); /* enter its scope */ - body(ls, &b, 0, ls->linenumber); /* function created in next register */ - /* debug information will only see the variable after this point! */ - localdebuginfo(fs, fvar)->startpc = fs->pc; -} - - -static int getlocalattribute (LexState *ls) { - /* ATTRIB -> ['<' Name '>'] */ - if (testnext(ls, '<')) { - TString *ts = str_checkname(ls); - const char *attr = getstr(ts); - checknext(ls, '>'); - if (strcmp(attr, "const") == 0) - return RDKCONST; /* read-only variable */ - else if (strcmp(attr, "close") == 0) - return RDKTOCLOSE; /* to-be-closed variable */ - else - luaK_semerror(ls, - luaO_pushfstring(ls->L, "unknown attribute '%s'", attr)); - } - return VDKREG; /* regular variable */ -} - - -static void checktoclose (FuncState *fs, int level) { - if (level != -1) { /* is there a to-be-closed variable? */ - marktobeclosed(fs); - luaK_codeABC(fs, OP_TBC, reglevel(fs, level), 0, 0); - } -} - - -static void localstat (LexState *ls) { - /* stat -> LOCAL NAME ATTRIB { ',' NAME ATTRIB } ['=' explist] */ - FuncState *fs = ls->fs; - int toclose = -1; /* index of to-be-closed variable (if any) */ - Vardesc *var; /* last variable */ - int vidx; /* index of last variable */ - int nvars = 0; - int nexps; - expdesc e; - do { - TString *vname = str_checkname(ls); - int kind = getlocalattribute(ls); - vidx = new_localvarkind(ls, vname, kind); - if (kind == RDKTOCLOSE) { /* to-be-closed? */ - if (toclose != -1) /* one already present? */ - luaK_semerror(ls, "multiple to-be-closed variables in local list"); - toclose = fs->nactvar + nvars; - } - nvars++; - } while (testnext(ls, ',')); - if (testnext(ls, '=')) - nexps = explist(ls, &e); - else { - e.k = VVOID; - nexps = 0; - } - var = getlocalvardesc(fs, vidx); /* get last variable */ - if (nvars == nexps && /* no adjustments? */ - var->vd.kind == RDKCONST && /* last variable is const? */ - luaK_exp2const(fs, &e, &var->k)) { /* compile-time constant? */ - var->vd.kind = RDKCTC; /* variable is a compile-time constant */ - adjustlocalvars(ls, nvars - 1); /* exclude last variable */ - fs->nactvar++; /* but count it */ - } - else { - adjust_assign(ls, nvars, nexps, &e); - adjustlocalvars(ls, nvars); - } - checktoclose(fs, toclose); -} - - -static int funcname (LexState *ls, expdesc *v) { - /* funcname -> NAME {fieldsel} [':' NAME] */ - int ismethod = 0; - singlevar(ls, v); - while (ls->t.token == '.') - fieldsel(ls, v); - if (ls->t.token == ':') { - ismethod = 1; - fieldsel(ls, v); - } - return ismethod; -} - - -static void funcstat (LexState *ls, int line) { - /* funcstat -> FUNCTION funcname body */ - int ismethod; - expdesc v, b; - luaX_next(ls); /* skip FUNCTION */ - ismethod = funcname(ls, &v); - body(ls, &b, ismethod, line); - check_readonly(ls, &v); - luaK_storevar(ls->fs, &v, &b); - luaK_fixline(ls->fs, line); /* definition "happens" in the first line */ -} - - -static void exprstat (LexState *ls) { - /* stat -> func | assignment */ - FuncState *fs = ls->fs; - struct LHS_assign v; - suffixedexp(ls, &v.v); - if (ls->t.token == '=' || ls->t.token == ',') { /* stat -> assignment ? */ - v.prev = NULL; - restassign(ls, &v, 1); - } - else { /* stat -> func */ - Instruction *inst; - check_condition(ls, v.v.k == VCALL, "syntax private_lua_error"); - inst = &getinstruction(fs, &v.v); - SETARG_C(*inst, 1); /* call statement uses no results */ - } -} - - -static void retstat (LexState *ls) { - /* stat -> RETURN [explist] [';'] */ - FuncState *fs = ls->fs; - expdesc e; - int nret; /* number of values being returned */ - int first = luaY_nvarstack(fs); /* first slot to be returned */ - if (block_follow(ls, 1) || ls->t.token == ';') - nret = 0; /* return no values */ - else { - nret = explist(ls, &e); /* optional return values */ - if (hasmultret(e.k)) { - luaK_setmultret(fs, &e); - if (e.k == VCALL && nret == 1 && !fs->bl->insidetbc) { /* tail call? */ - SET_OPCODE(getinstruction(fs,&e), OP_TAILCALL); - lua_assert(GETARG_A(getinstruction(fs,&e)) == luaY_nvarstack(fs)); - } - nret = LUA_MULTRET; /* return all values */ - } - else { - if (nret == 1) /* only one single value? */ - first = luaK_exp2anyreg(fs, &e); /* can use original slot */ - else { /* values must go to the top of the stack */ - luaK_exp2nextreg(fs, &e); - lua_assert(nret == fs->freereg - first); - } - } - } - luaK_ret(fs, first, nret); - testnext(ls, ';'); /* skip optional semicolon */ -} - - -static void statement (LexState *ls) { - int line = ls->linenumber; /* may be needed for error messages */ - enterlevel(ls); - switch (ls->t.token) { - case ';': { /* stat -> ';' (empty statement) */ - luaX_next(ls); /* skip ';' */ - break; - } - case TK_IF: { /* stat -> ifstat */ - ifstat(ls, line); - break; - } - case TK_WHILE: { /* stat -> whilestat */ - whilestat(ls, line); - break; - } - case TK_DO: { /* stat -> DO block END */ - luaX_next(ls); /* skip DO */ - block(ls); - check_match(ls, TK_END, TK_DO, line); - break; - } - case TK_FOR: { /* stat -> forstat */ - forstat(ls, line); - break; - } - case TK_REPEAT: { /* stat -> repeatstat */ - repeatstat(ls, line); - break; - } - case TK_FUNCTION: { /* stat -> funcstat */ - funcstat(ls, line); - break; - } - case TK_LOCAL: { /* stat -> localstat */ - luaX_next(ls); /* skip LOCAL */ - if (testnext(ls, TK_FUNCTION)) /* local function? */ - localfunc(ls); - else - localstat(ls); - break; - } - case TK_DBCOLON: { /* stat -> label */ - luaX_next(ls); /* skip double colon */ - labelstat(ls, str_checkname(ls), line); - break; - } - case TK_RETURN: { /* stat -> retstat */ - luaX_next(ls); /* skip RETURN */ - retstat(ls); - break; - } - case TK_BREAK: { /* stat -> breakstat */ - breakstat(ls); - break; - } - case TK_GOTO: { /* stat -> 'goto' NAME */ - luaX_next(ls); /* skip 'goto' */ - gotostat(ls); - break; - } - default: { /* stat -> func | assignment */ - exprstat(ls); - break; - } - } - lua_assert(ls->fs->f->maxstacksize >= ls->fs->freereg && - ls->fs->freereg >= luaY_nvarstack(ls->fs)); - ls->fs->freereg = luaY_nvarstack(ls->fs); /* free registers */ - leavelevel(ls); -} - -/* }====================================================================== */ - - -/* -** compiles the main function, which is a regular vararg function with an -** upvalue named LUA_ENV -*/ -static void mainfunc (LexState *ls, FuncState *fs) { - BlockCnt bl; - Upvaldesc *env; - open_func(ls, fs, &bl); - setvararg(fs, 0); /* main function is always declared vararg */ - env = allocupvalue(fs); /* ...set environment upvalue */ - env->instack = 1; - env->idx = 0; - env->kind = VDKREG; - env->name = ls->envn; - luaC_objbarrier(ls->L, fs->f, env->name); - luaX_next(ls); /* read first token */ - statlist(ls); /* parse main body */ - check(ls, TK_EOS); - close_func(ls); -} - - -LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, - Dyndata *dyd, const char *name, int firstchar) { - LexState lexstate; - FuncState funcstate; - LClosure *cl = luaF_newLclosure(L, 1); /* create main closure */ - setclLvalue2s(L, L->top.p, cl); /* anchor it (to avoid being collected) */ - luaD_inctop(L); - lexstate.h = luaH_new(L); /* create table for scanner */ - sethvalue2s(L, L->top.p, lexstate.h); /* anchor it */ - luaD_inctop(L); - funcstate.f = cl->p = luaF_newproto(L); - luaC_objbarrier(L, cl, cl->p); - funcstate.f->source = luaS_new(L, name); /* create and anchor TString */ - luaC_objbarrier(L, funcstate.f, funcstate.f->source); - lexstate.buff = buff; - lexstate.dyd = dyd; - dyd->actvar.n = dyd->gt.n = dyd->label.n = 0; - luaX_setinput(L, &lexstate, z, funcstate.f->source, firstchar); - mainfunc(&lexstate, &funcstate); - lua_assert(!funcstate.prev && funcstate.nups == 1 && !lexstate.fs); - /* all scopes should be correctly finished */ - lua_assert(dyd->actvar.n == 0 && dyd->gt.n == 0 && dyd->label.n == 0); - L->top.p--; /* remove scanner's table */ - return cl; /* closure is on the stack, too */ -} - diff --git a/src/dependencies/lua/lparser.h b/src/dependencies/lua/lparser.h deleted file mode 100644 index 5e4500f..0000000 --- a/src/dependencies/lua/lparser.h +++ /dev/null @@ -1,171 +0,0 @@ -/* -** $Id: lparser.h $ -** Lua Parser -** See Copyright Notice in lua.h -*/ - -#ifndef lparser_h -#define lparser_h - -#include "llimits.h" -#include "lobject.h" -#include "lzio.h" - - -/* -** Expression and variable descriptor. -** Code generation for variables and expressions can be delayed to allow -** optimizations; An 'expdesc' structure describes a potentially-delayed -** variable/expression. It has a description of its "main" value plus a -** list of conditional jumps that can also produce its value (generated -** by short-circuit operators 'and'/'or'). -*/ - -/* kinds of variables/expressions */ -typedef enum { - VVOID, /* when 'expdesc' describes the last expression of a list, - this kind means an empty list (so, no expression) */ - VNIL, /* constant nil */ - VTRUE, /* constant true */ - VFALSE, /* constant false */ - VK, /* constant in 'k'; info = index of constant in 'k' */ - VKFLT, /* floating constant; nval = numerical float value */ - VKINT, /* integer constant; ival = numerical integer value */ - VKSTR, /* string constant; strval = TString address; - (string is fixed by the lexer) */ - VNONRELOC, /* expression has its value in a fixed register; - info = result register */ - VLOCAL, /* local variable; var.ridx = register index; - var.vidx = relative index in 'actvar.arr' */ - VUPVAL, /* upvalue variable; info = index of upvalue in 'upvalues' */ - VCONST, /* compile-time variable; - info = absolute index in 'actvar.arr' */ - VINDEXED, /* indexed variable; - ind.t = table register; - ind.idx = key's R index */ - VINDEXUP, /* indexed upvalue; - ind.t = table upvalue; - ind.idx = key's K index */ - VINDEXI, /* indexed variable with constant integer; - ind.t = table register; - ind.idx = key's value */ - VINDEXSTR, /* indexed variable with literal string; - ind.t = table register; - ind.idx = key's K index */ - VJMP, /* expression is a test/comparison; - info = pc of corresponding jump instruction */ - VRELOC, /* expression can put result in any register; - info = instruction pc */ - VCALL, /* expression is a function call; info = instruction pc */ - VVARARG /* vararg expression; info = instruction pc */ -} expkind; - - -#define vkisvar(k) (VLOCAL <= (k) && (k) <= VINDEXSTR) -#define vkisindexed(k) (VINDEXED <= (k) && (k) <= VINDEXSTR) - - -typedef struct expdesc { - expkind k; - union { - lua_Integer ival; /* for VKINT */ - lua_Number nval; /* for VKFLT */ - TString *strval; /* for VKSTR */ - int info; /* for generic use */ - struct { /* for indexed variables */ - short idx; /* index (R or "long" K) */ - lu_byte t; /* table (register or upvalue) */ - } ind; - struct { /* for local variables */ - lu_byte ridx; /* register holding the variable */ - unsigned short vidx; /* compiler index (in 'actvar.arr') */ - } var; - } u; - int t; /* patch list of 'exit when true' */ - int f; /* patch list of 'exit when false' */ -} expdesc; - - -/* kinds of variables */ -#define VDKREG 0 /* regular */ -#define RDKCONST 1 /* constant */ -#define RDKTOCLOSE 2 /* to-be-closed */ -#define RDKCTC 3 /* compile-time constant */ - -/* description of an active local variable */ -typedef union Vardesc { - struct { - TValuefields; /* constant value (if it is a compile-time constant) */ - lu_byte kind; - lu_byte ridx; /* register holding the variable */ - short pidx; /* index of the variable in the Proto's 'locvars' array */ - TString *name; /* variable name */ - } vd; - TValue k; /* constant value (if any) */ -} Vardesc; - - - -/* description of pending goto statements and label statements */ -typedef struct Labeldesc { - TString *name; /* label identifier */ - int pc; /* position in code */ - int line; /* line where it appeared */ - lu_byte nactvar; /* number of active variables in that position */ - lu_byte close; /* goto that escapes upvalues */ -} Labeldesc; - - -/* list of labels or gotos */ -typedef struct Labellist { - Labeldesc *arr; /* array */ - int n; /* number of entries in use */ - int size; /* array size */ -} Labellist; - - -/* dynamic structures used by the parser */ -typedef struct Dyndata { - struct { /* list of all active local variables */ - Vardesc *arr; - int n; - int size; - } actvar; - Labellist gt; /* list of pending gotos */ - Labellist label; /* list of active labels */ -} Dyndata; - - -/* control of blocks */ -struct BlockCnt; /* defined in lparser.c */ - - -/* state needed to generate code for a given function */ -typedef struct FuncState { - Proto *f; /* current function header */ - struct FuncState *prev; /* enclosing function */ - struct LexState *ls; /* lexical state */ - struct BlockCnt *bl; /* chain of current blocks */ - int pc; /* next position to code (equivalent to 'ncode') */ - int lasttarget; /* 'label' of last 'jump label' */ - int previousline; /* last line that was saved in 'lineinfo' */ - int nk; /* number of elements in 'k' */ - int np; /* number of elements in 'p' */ - int nabslineinfo; /* number of elements in 'abslineinfo' */ - int firstlocal; /* index of first local var (in Dyndata array) */ - int firstlabel; /* index of first label (in 'dyd->label->arr') */ - short ndebugvars; /* number of elements in 'f->locvars' */ - lu_byte nactvar; /* number of active local variables */ - lu_byte nups; /* number of upvalues */ - lu_byte freereg; /* first free register */ - lu_byte iwthabs; /* instructions issued since last absolute line info */ - lu_byte needclose; /* function needs to close upvalues when returning */ -} FuncState; - - -LUAI_FUNC int luaY_nvarstack (FuncState *fs); -LUAI_FUNC LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, - Dyndata *dyd, const char *name, int firstchar); - - -#endif diff --git a/src/dependencies/lua/lprefix.h b/src/dependencies/lua/lprefix.h deleted file mode 100644 index 484f2ad..0000000 --- a/src/dependencies/lua/lprefix.h +++ /dev/null @@ -1,45 +0,0 @@ -/* -** $Id: lprefix.h $ -** Definitions for Lua code that must come before any other header file -** See Copyright Notice in lua.h -*/ - -#ifndef lprefix_h -#define lprefix_h - - -/* -** Allows POSIX/XSI stuff -*/ -#if !defined(LUA_USE_C89) /* { */ - -#if !defined(_XOPEN_SOURCE) -#define _XOPEN_SOURCE 600 -#elif _XOPEN_SOURCE == 0 -#undef _XOPEN_SOURCE /* use -D_XOPEN_SOURCE=0 to undefine it */ -#endif - -/* -** Allows manipulation of large files in gcc and some other compilers -*/ -#if !defined(LUA_32BITS) && !defined(_FILE_OFFSET_BITS) -#define _LARGEFILE_SOURCE 1 -#define _FILE_OFFSET_BITS 64 -#endif - -#endif /* } */ - - -/* -** Windows stuff -*/ -#if defined(_WIN32) /* { */ - -#if !defined(_CRT_SECURE_NO_WARNINGS) -#define _CRT_SECURE_NO_WARNINGS /* avoid warnings about ISO C functions */ -#endif - -#endif /* } */ - -#endif - diff --git a/src/dependencies/lua/lstate.c b/src/dependencies/lua/lstate.c deleted file mode 100644 index 476b2b0..0000000 --- a/src/dependencies/lua/lstate.c +++ /dev/null @@ -1,410 +0,0 @@ -/* -** $Id: lstate.c $ -** Global State -** See Copyright Notice in lua.h -*/ - -#define lstate_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "llex.h" -#include "lmem.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" - - - -/* -** thread state + extra space -*/ -typedef struct LX { - lu_byte extra_[LUA_EXTRASPACE]; - lua_State l; -} LX; - - -/* -** Main thread combines a thread state and the global state -*/ -typedef struct LG { - LX l; - global_State g; -} LG; - - - -#define fromstate(L) (cast(LX *, cast(lu_byte *, (L)) - offsetof(LX, l))) - - -/* -** set GCdebt to a new value keeping the real number of allocated -** objects (totalobjs - GCdebt) invariant and avoiding overflows in -** 'totalobjs'. -*/ -void luaE_setdebt (global_State *g, l_obj debt) { - l_obj tb = gettotalobjs(g); - lua_assert(tb > 0); - if (debt > MAX_LOBJ - tb) - debt = MAX_LOBJ - tb; /* will make 'totalobjs == MAX_LMEM' */ - g->totalobjs = tb + debt; - g->GCdebt = debt; -} - - -CallInfo *luaE_extendCI (lua_State *L) { - CallInfo *ci; - lua_assert(L->ci->next == NULL); - ci = luaM_new(L, CallInfo); - lua_assert(L->ci->next == NULL); - L->ci->next = ci; - ci->previous = L->ci; - ci->next = NULL; - ci->u.l.trap = 0; - L->nci++; - return ci; -} - - -/* -** free all CallInfo structures not in use by a thread -*/ -static void freeCI (lua_State *L) { - CallInfo *ci = L->ci; - CallInfo *next = ci->next; - ci->next = NULL; - while ((ci = next) != NULL) { - next = ci->next; - luaM_free(L, ci); - L->nci--; - } -} - - -/* -** free half of the CallInfo structures not in use by a thread, -** keeping the first one. -*/ -void luaE_shrinkCI (lua_State *L) { - CallInfo *ci = L->ci->next; /* first free CallInfo */ - CallInfo *next; - if (ci == NULL) - return; /* no extra elements */ - while ((next = ci->next) != NULL) { /* two extra elements? */ - CallInfo *next2 = next->next; /* next's next */ - ci->next = next2; /* remove next from the list */ - L->nci--; - luaM_free(L, next); /* free next */ - if (next2 == NULL) - break; /* no more elements */ - else { - next2->previous = ci; - ci = next2; /* continue */ - } - } -} - - -/* -** Called when 'getCcalls(L)' larger or equal to LUAI_MAXCCALLS. -** If equal, raises an overflow error. If value is larger than -** LUAI_MAXCCALLS (which means it is handling an overflow) but -** not much larger, does not report an error (to allow overflow -** handling to work). -*/ -void luaE_checkcstack (lua_State *L) { - if (getCcalls(L) == LUAI_MAXCCALLS) - luaG_runerror(L, "C stack overflow"); - else if (getCcalls(L) >= (LUAI_MAXCCALLS / 10 * 11)) - luaD_throw(L, LUA_ERRERR); /* error while handling stack error */ -} - - -LUAI_FUNC void luaE_incCstack (lua_State *L) { - L->nCcalls++; - if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) - luaE_checkcstack(L); -} - - -static void stack_init (lua_State *L1, lua_State *L) { - int i; CallInfo *ci; - /* initialize stack array */ - L1->stack.p = luaM_newvector(L, BASIC_STACK_SIZE + EXTRA_STACK, StackValue); - L1->tbclist.p = L1->stack.p; - for (i = 0; i < BASIC_STACK_SIZE + EXTRA_STACK; i++) - setnilvalue(s2v(L1->stack.p + i)); /* erase new stack */ - L1->top.p = L1->stack.p; - L1->stack_last.p = L1->stack.p + BASIC_STACK_SIZE; - /* initialize first ci */ - ci = &L1->base_ci; - ci->next = ci->previous = NULL; - ci->callstatus = CIST_C; - ci->func.p = L1->top.p; - ci->u.c.k = NULL; - ci->nresults = 0; - setnilvalue(s2v(L1->top.p)); /* 'function' entry for this 'ci' */ - L1->top.p++; - ci->top.p = L1->top.p + LUA_MINSTACK; - L1->ci = ci; -} - - -static void freestack (lua_State *L) { - if (L->stack.p == NULL) - return; /* stack not completely built yet */ - L->ci = &L->base_ci; /* free the entire 'ci' list */ - freeCI(L); - lua_assert(L->nci == 0); - luaM_freearray(L, L->stack.p, stacksize(L) + EXTRA_STACK); /* free stack */ -} - - -/* -** Create registry table and its predefined values -*/ -static void init_registry (lua_State *L, global_State *g) { - /* create registry */ - TValue aux; - Table *registry = luaH_new(L); - sethvalue(L, &g->l_registry, registry); - luaH_resize(L, registry, LUA_RIDX_LAST, 0); - /* registry[1] = false */ - setbfvalue(&aux); - luaH_setint(L, registry, 1, &aux); - /* registry[LUA_RIDX_MAINTHREAD] = L */ - setthvalue(L, &aux, L); - luaH_setint(L, registry, LUA_RIDX_MAINTHREAD, &aux); - /* registry[LUA_RIDX_GLOBALS] = new table (table of globals) */ - sethvalue(L, &aux, luaH_new(L)); - luaH_setint(L, registry, LUA_RIDX_GLOBALS, &aux); -} - - -/* -** open parts of the state that may cause memory-allocation errors. -*/ -static void f_luaopen (lua_State *L, void *ud) { - global_State *g = G(L); - UNUSED(ud); - stack_init(L, L); /* init stack */ - init_registry(L, g); - luaS_init(L); - luaT_init(L); - luaX_init(L); - g->gcstp = 0; /* allow gc */ - setnilvalue(&g->nilvalue); /* now state is complete */ - luai_userstateopen(L); -} - - -/* -** preinitialize a thread with consistent values without allocating -** any memory (to avoid errors) -*/ -static void preinit_thread (lua_State *L, global_State *g) { - G(L) = g; - L->stack.p = NULL; - L->ci = NULL; - L->nci = 0; - L->twups = L; /* thread has no upvalues */ - L->nCcalls = 0; - L->errorJmp = NULL; - L->hook = NULL; - L->hookmask = 0; - L->basehookcount = 0; - L->allowhook = 1; - resethookcount(L); - L->openupval = NULL; - L->status = LUA_OK; - L->errfunc = 0; - L->oldpc = 0; -} - - -static void close_state (lua_State *L) { - global_State *g = G(L); - if (!completestate(g)) /* closing a partially built state? */ - luaC_freeallobjects(L); /* just collect its objects */ - else { /* closing a fully built state */ - L->ci = &L->base_ci; /* unwind CallInfo list */ - luaD_closeprotected(L, 1, LUA_OK); /* close all upvalues */ - luaC_freeallobjects(L); /* collect all objects */ - luai_userstateclose(L); - } - luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size); - freestack(L); - lua_assert(g->totalbytes == sizeof(LG)); - lua_assert(gettotalobjs(g) == 1); - (*g->frealloc)(g->ud, fromstate(L), sizeof(LG), 0); /* free main block */ -} - - -LUA_API lua_State *lua_newthread (lua_State *L) { - global_State *g = G(L); - GCObject *o; - lua_State *L1; - lua_lock(L); - luaC_checkGC(L); - /* create new thread */ - o = luaC_newobjdt(L, LUA_TTHREAD, sizeof(LX), offsetof(LX, l)); - L1 = gco2th(o); - /* anchor it on L stack */ - setthvalue2s(L, L->top.p, L1); - api_incr_top(L); - preinit_thread(L1, g); - L1->hookmask = L->hookmask; - L1->basehookcount = L->basehookcount; - L1->hook = L->hook; - resethookcount(L1); - /* initialize L1 extra space */ - memcpy(lua_getextraspace(L1), lua_getextraspace(g->mainthread), - LUA_EXTRASPACE); - luai_userstatethread(L, L1); - stack_init(L1, L); /* init stack */ - lua_unlock(L); - return L1; -} - - -void luaE_freethread (lua_State *L, lua_State *L1) { - LX *l = fromstate(L1); - luaF_closeupval(L1, L1->stack.p); /* close all upvalues */ - lua_assert(L1->openupval == NULL); - luai_userstatefree(L, L1); - freestack(L1); - luaM_free(L, l); -} - - -int luaE_resetthread (lua_State *L, int status) { - CallInfo *ci = L->ci = &L->base_ci; /* unwind CallInfo list */ - setnilvalue(s2v(L->stack.p)); /* 'function' entry for basic 'ci' */ - ci->func.p = L->stack.p; - ci->callstatus = CIST_C; - if (status == LUA_YIELD) - status = LUA_OK; - L->status = LUA_OK; /* so it can run __close metamethods */ - status = luaD_closeprotected(L, 1, status); - if (status != LUA_OK) /* errors? */ - luaD_seterrorobj(L, status, L->stack.p + 1); - else - L->top.p = L->stack.p + 1; - ci->top.p = L->top.p + LUA_MINSTACK; - luaD_reallocstack(L, cast_int(ci->top.p - L->stack.p), 0); - return status; -} - - -LUA_API int lua_closethread (lua_State *L, lua_State *from) { - int status; - lua_lock(L); - L->nCcalls = (from) ? getCcalls(from) : 0; - status = luaE_resetthread(L, L->status); - lua_unlock(L); - return status; -} - - -LUA_API lua_State *lua_newstate (lua_Alloc f, void *ud, unsigned seed) { - int i; - lua_State *L; - global_State *g; - LG *l = cast(LG *, (*f)(ud, NULL, LUA_TTHREAD, sizeof(LG))); - if (l == NULL) return NULL; - L = &l->l.l; - g = &l->g; - L->tt = LUA_VTHREAD; - g->currentwhite = bitmask(WHITE0BIT); - L->marked = luaC_white(g); - preinit_thread(L, g); - g->allgc = obj2gco(L); /* by now, only object is the main thread */ - L->next = NULL; - incnny(L); /* main thread is always non yieldable */ - g->frealloc = f; - g->ud = ud; - g->warnf = NULL; - g->ud_warn = NULL; - g->mainthread = L; - g->seed = seed; - g->gcstp = GCSTPGC; /* no GC while building state */ - g->strt.size = g->strt.nuse = 0; - g->strt.hash = NULL; - setnilvalue(&g->l_registry); - g->panic = NULL; - g->gcstate = GCSpause; - g->gckind = KGC_INC; - g->gcstopem = 0; - g->gcemergency = 0; - g->finobj = g->tobefnz = g->fixedgc = NULL; - g->firstold1 = g->survival = g->old1 = g->reallyold = NULL; - g->finobjsur = g->finobjold1 = g->finobjrold = NULL; - g->sweepgc = NULL; - g->gray = g->grayagain = NULL; - g->weak = g->ephemeron = g->allweak = NULL; - g->twups = NULL; - g->totalbytes = sizeof(LG); - g->totalobjs = 1; - g->marked = 0; - g->GCdebt = 0; - setivalue(&g->nilvalue, 0); /* to signal that state is not yet built */ - setgcparam(g, PAUSE, LUAI_GCPAUSE); - setgcparam(g, STEPMUL, LUAI_GCMUL); - setgcparam(g, STEPSIZE, LUAI_GCSTEPSIZE); - setgcparam(g, MINORMUL, LUAI_GENMINORMUL); - setgcparam(g, MINORMAJOR, LUAI_MINORMAJOR); - setgcparam(g, MAJORMINOR, LUAI_MAJORMINOR); - for (i=0; i < LUA_NUMTYPES; i++) g->mt[i] = NULL; - if (luaD_rawrunprotected(L, f_luaopen, NULL) != LUA_OK) { - /* memory allocation error: free partial state */ - close_state(L); - L = NULL; - } - return L; -} - - -LUA_API void lua_close (lua_State *L) { - lua_lock(L); - L = G(L)->mainthread; /* only the main thread can be closed */ - close_state(L); -} - - -void luaE_warning (lua_State *L, const char *msg, int tocont) { - lua_WarnFunction wf = G(L)->warnf; - if (wf != NULL) - wf(G(L)->ud_warn, msg, tocont); -} - - -/* -** Generate a warning from an error message -*/ -void luaE_warnerror (lua_State *L, const char *where) { - TValue *errobj = s2v(L->top.p - 1); /* error object */ - const char *msg = (ttisstring(errobj)) - ? getstr(tsvalue(errobj)) - : "private_lua_error object is not a string"; - /* produce warning "error in %s (%s)" (where, msg) */ - luaE_warning(L, "private_lua_error in ", 1); - luaE_warning(L, where, 1); - luaE_warning(L, " (", 1); - luaE_warning(L, msg, 1); - luaE_warning(L, ")", 0); -} - diff --git a/src/dependencies/lua/lstate.h b/src/dependencies/lua/lstate.h deleted file mode 100644 index 7f56745..0000000 --- a/src/dependencies/lua/lstate.h +++ /dev/null @@ -1,407 +0,0 @@ -/* -** $Id: lstate.h $ -** Global State -** See Copyright Notice in lua.h -*/ - -#ifndef lstate_h -#define lstate_h - -#include "lua.h" - - -/* Some header files included here need this definition */ -typedef struct CallInfo CallInfo; - - -#include "lobject.h" -#include "ltm.h" -#include "lzio.h" - - -/* -** Some notes about garbage-collected objects: All objects in Lua must -** be kept somehow accessible until being freed, so all objects always -** belong to one (and only one) of these lists, using field 'next' of -** the 'CommonHeader' for the link: -** -** 'allgc': all objects not marked for finalization; -** 'finobj': all objects marked for finalization; -** 'tobefnz': all objects ready to be finalized; -** 'fixedgc': all objects that are not to be collected (currently -** only small strings, such as reserved words). -** -** For the generational collector, some of these lists have marks for -** generations. Each mark points to the first element in the list for -** that particular generation; that generation goes until the next mark. -** -** 'allgc' -> 'survival': new objects; -** 'survival' -> 'old': objects that survived one collection; -** 'old1' -> 'reallyold': objects that became old in last collection; -** 'reallyold' -> NULL: objects old for more than one cycle. -** -** 'finobj' -> 'finobjsur': new objects marked for finalization; -** 'finobjsur' -> 'finobjold1': survived """"; -** 'finobjold1' -> 'finobjrold': just old """"; -** 'finobjrold' -> NULL: really old """". -** -** All lists can contain elements older than their main ages, due -** to 'luaC_checkfinalizer' and 'udata2finalize', which move -** objects between the normal lists and the "marked for finalization" -** lists. Moreover, barriers can age young objects in young lists as -** OLD0, which then become OLD1. However, a list never contains -** elements younger than their main ages. -** -** The generational collector also uses a pointer 'firstold1', which -** points to the first OLD1 object in the list. It is used to optimize -** 'markold'. (Potentially OLD1 objects can be anywhere between 'allgc' -** and 'reallyold', but often the list has no OLD1 objects or they are -** after 'old1'.) Note the difference between it and 'old1': -** 'firstold1': no OLD1 objects before this point; there can be all -** ages after it. -** 'old1': no objects younger than OLD1 after this point. -*/ - -/* -** Moreover, there is another set of lists that control gray objects. -** These lists are linked by fields 'gclist'. (All objects that -** can become gray have such a field. The field is not the same -** in all objects, but it always has this name.) Any gray object -** must belong to one of these lists, and all objects in these lists -** must be gray (with two exceptions explained below): -** -** 'gray': regular gray objects, still waiting to be visited. -** 'grayagain': objects that must be revisited at the atomic phase. -** That includes -** - black objects got in a write barrier; -** - all kinds of weak tables during propagation phase; -** - all threads. -** 'weak': tables with weak values to be cleared; -** 'ephemeron': ephemeron tables with white->white entries; -** 'allweak': tables with weak keys and/or weak values to be cleared. -** -** The exceptions to that "gray rule" are: -** - TOUCHED2 objects in generational mode stay in a gray list (because -** they must be visited again at the end of the cycle), but they are -** marked black because assignments to them must activate barriers (to -** move them back to TOUCHED1). -** - Open upvales are kept gray to avoid barriers, but they stay out -** of gray lists. (They don't even have a 'gclist' field.) -*/ - - - -/* -** About 'nCcalls': This count has two parts: the lower 16 bits counts -** the number of recursive invocations in the C stack; the higher -** 16 bits counts the number of non-yieldable calls in the stack. -** (They are together so that we can change and save both with one -** instruction.) -*/ - - -/* true if this thread does not have non-yieldable calls in the stack */ -#define yieldable(L) (((L)->nCcalls & 0xffff0000) == 0) - -/* real number of C calls */ -#define getCcalls(L) ((L)->nCcalls & 0xffff) - - -/* Increment the number of non-yieldable calls */ -#define incnny(L) ((L)->nCcalls += 0x10000) - -/* Decrement the number of non-yieldable calls */ -#define decnny(L) ((L)->nCcalls -= 0x10000) - -/* Non-yieldable call increment */ -#define nyci (0x10000 | 1) - - - - -struct lua_longjmp; /* defined in ldo.c */ - - -/* -** Atomic type (relative to signals) to better ensure that 'lua_sethook' -** is thread safe -*/ -#if !defined(l_signalT) -#include -#define l_signalT sig_atomic_t -#endif - - -/* -** Extra stack space to handle TM calls and some other extras. This -** space is not included in 'stack_last'. It is used only to avoid stack -** checks, either because the element will be promptly popped or because -** there will be a stack check soon after the push. Function frames -** never use this extra space, so it does not need to be kept clean. -*/ -#define EXTRA_STACK 5 - - -#define BASIC_STACK_SIZE (2*LUA_MINSTACK) - -#define stacksize(th) cast_int((th)->stack_last.p - (th)->stack.p) - - -/* kinds of Garbage Collection */ -#define KGC_INC 0 /* incremental gc */ -#define KGC_GENMINOR 1 /* generational gc in minor (regular) mode */ -#define KGC_GENMAJOR 2 /* generational in major mode */ - - -typedef struct stringtable { - TString **hash; /* array of buckets (linked lists of strings) */ - int nuse; /* number of elements */ - int size; /* number of buckets */ -} stringtable; - - -/* -** Information about a call. -** About union 'u': -** - field 'l' is used only for Lua functions; -** - field 'c' is used only for C functions. -** About union 'u2': -** - field 'funcidx' is used only by C functions while doing a -** protected call; -** - field 'nyield' is used only while a function is "doing" an -** yield (from the yield until the next resume); -** - field 'nres' is used only while closing tbc variables when -** returning from a function; -** - field 'transferinfo' is used only during call/returnhooks, -** before the function starts or after it ends. -*/ -struct CallInfo { - StkIdRel func; /* function index in the stack */ - StkIdRel top; /* top for this function */ - struct CallInfo *previous, *next; /* dynamic call link */ - union { - struct { /* only for Lua functions */ - const Instruction *savedpc; - volatile l_signalT trap; /* function is tracing lines/counts */ - int nextraargs; /* # of extra arguments in vararg functions */ - } l; - struct { /* only for C functions */ - lua_KFunction k; /* continuation in case of yields */ - ptrdiff_t old_errfunc; - lua_KContext ctx; /* context info. in case of yields */ - } c; - } u; - union { - int funcidx; /* called-function index */ - int nyield; /* number of values yielded */ - int nres; /* number of values returned */ - struct { /* info about transferred values (for call/return hooks) */ - unsigned short ftransfer; /* offset of first value transferred */ - unsigned short ntransfer; /* number of values transferred */ - } transferinfo; - } u2; - short nresults; /* expected number of results from this function */ - unsigned short callstatus; -}; - - -/* -** Bits in CallInfo status -*/ -#define CIST_OAH (1<<0) /* original value of 'allowhook' */ -#define CIST_C (1<<1) /* call is running a C function */ -#define CIST_FRESH (1<<2) /* call is on a fresh "luaV_execute" frame */ -#define CIST_HOOKED (1<<3) /* call is running a debug hook */ -#define CIST_YPCALL (1<<4) /* doing a yieldable protected call */ -#define CIST_TAIL (1<<5) /* call was tail called */ -#define CIST_HOOKYIELD (1<<6) /* last hook called yielded */ -#define CIST_FIN (1<<7) /* function "called" a finalizer */ -#define CIST_TRAN (1<<8) /* 'ci' has transfer information */ -#define CIST_CLSRET (1<<9) /* function is closing tbc variables */ -/* Bits 10-12 are used for CIST_RECST (see below) */ -#define CIST_RECST 10 -#if defined(LUA_COMPAT_LT_LE) -#define CIST_LEQ (1<<13) /* using __lt for __le */ -#endif - - -/* -** Field CIST_RECST stores the "recover status", used to keep the error -** status while closing to-be-closed variables in coroutines, so that -** Lua can correctly resume after an yield from a __close method called -** because of an error. (Three bits are enough for error status.) -*/ -#define getcistrecst(ci) (((ci)->callstatus >> CIST_RECST) & 7) -#define setcistrecst(ci,st) \ - check_exp(((st) & 7) == (st), /* status must fit in three bits */ \ - ((ci)->callstatus = ((ci)->callstatus & ~(7 << CIST_RECST)) \ - | ((st) << CIST_RECST))) - - -/* active function is a Lua function */ -#define isLua(ci) (!((ci)->callstatus & CIST_C)) - -/* call is running Lua code (not a hook) */ -#define isLuacode(ci) (!((ci)->callstatus & (CIST_C | CIST_HOOKED))) - -/* assume that CIST_OAH has offset 0 and that 'v' is strictly 0/1 */ -#define setoah(st,v) ((st) = ((st) & ~CIST_OAH) | (v)) -#define getoah(st) ((st) & CIST_OAH) - - -/* -** 'global state', shared by all threads of this state -*/ -typedef struct global_State { - lua_Alloc frealloc; /* function to reallocate memory */ - void *ud; /* auxiliary data to 'frealloc' */ - lu_mem totalbytes; /* number of bytes currently allocated */ - l_obj totalobjs; /* total number of objects allocated + GCdebt */ - l_obj GCdebt; /* objects counted but not yet allocated */ - l_obj marked; /* number of objects marked in a GC cycle */ - l_obj GCmajorminor; /* auxiliar counter to control major-minor shifts */ - stringtable strt; /* hash table for strings */ - TValue l_registry; - TValue nilvalue; /* a nil value */ - unsigned int seed; /* randomized seed for hashes */ - lu_byte gcparams[LUA_GCPN]; - lu_byte currentwhite; - lu_byte gcstate; /* state of garbage collector */ - lu_byte gckind; /* kind of GC running */ - lu_byte gcstopem; /* stops emergency collections */ - lu_byte gcstp; /* control whether GC is running */ - lu_byte gcemergency; /* true if this is an emergency collection */ - GCObject *allgc; /* list of all collectable objects */ - GCObject **sweepgc; /* current position of sweep in list */ - GCObject *finobj; /* list of collectable objects with finalizers */ - GCObject *gray; /* list of gray objects */ - GCObject *grayagain; /* list of objects to be traversed atomically */ - GCObject *weak; /* list of tables with weak values */ - GCObject *ephemeron; /* list of ephemeron tables (weak keys) */ - GCObject *allweak; /* list of all-weak tables */ - GCObject *tobefnz; /* list of userdata to be GC */ - GCObject *fixedgc; /* list of objects not to be collected */ - /* fields for generational collector */ - GCObject *survival; /* start of objects that survived one GC cycle */ - GCObject *old1; /* start of old1 objects */ - GCObject *reallyold; /* objects more than one cycle old ("really old") */ - GCObject *firstold1; /* first OLD1 object in the list (if any) */ - GCObject *finobjsur; /* list of survival objects with finalizers */ - GCObject *finobjold1; /* list of old1 objects with finalizers */ - GCObject *finobjrold; /* list of really old objects with finalizers */ - struct lua_State *twups; /* list of threads with open upvalues */ - lua_CFunction panic; /* to be called in unprotected errors */ - struct lua_State *mainthread; - TString *memerrmsg; /* message for memory-allocation errors */ - TString *tmname[TM_N]; /* array with tag-method names */ - struct Table *mt[LUA_NUMTYPES]; /* metatables for basic types */ - TString *strcache[STRCACHE_N][STRCACHE_M]; /* cache for strings in API */ - lua_WarnFunction warnf; /* warning function */ - void *ud_warn; /* auxiliary data to 'warnf' */ -} global_State; - - -/* -** 'per thread' state -*/ -struct lua_State { - CommonHeader; - lu_byte status; - lu_byte allowhook; - unsigned short nci; /* number of items in 'ci' list */ - StkIdRel top; /* first free slot in the stack */ - global_State *l_G; - CallInfo *ci; /* call info for current function */ - StkIdRel stack_last; /* end of stack (last element + 1) */ - StkIdRel stack; /* stack base */ - UpVal *openupval; /* list of open upvalues in this stack */ - StkIdRel tbclist; /* list of to-be-closed variables */ - GCObject *gclist; - struct lua_State *twups; /* list of threads with open upvalues */ - struct lua_longjmp *errorJmp; /* current error recover point */ - CallInfo base_ci; /* CallInfo for first level (C calling Lua) */ - volatile lua_Hook hook; - ptrdiff_t errfunc; /* current error handling function (stack index) */ - l_uint32 nCcalls; /* number of nested (non-yieldable | C) calls */ - int oldpc; /* last pc traced */ - int basehookcount; - int hookcount; - volatile l_signalT hookmask; -}; - - -#define G(L) (L->l_G) - -/* -** 'g->nilvalue' being a nil value flags that the state was completely -** build. -*/ -#define completestate(g) ttisnil(&g->nilvalue) - - -/* -** Union of all collectable objects (only for conversions) -** ISO C99, 6.5.2.3 p.5: -** "if a union contains several structures that share a common initial -** sequence [...], and if the union object currently contains one -** of these structures, it is permitted to inspect the common initial -** part of any of them anywhere that a declaration of the complete type -** of the union is visible." -*/ -union GCUnion { - GCObject gc; /* common header */ - struct TString ts; - struct Udata u; - union Closure cl; - struct Table h; - struct Proto p; - struct lua_State th; /* thread */ - struct UpVal upv; -}; - - -/* -** ISO C99, 6.7.2.1 p.14: -** "A pointer to a union object, suitably converted, points to each of -** its members [...], and vice versa." -*/ -#define cast_u(o) cast(union GCUnion *, (o)) - -/* macros to convert a GCObject into a specific value */ -#define gco2ts(o) \ - check_exp(novariant((o)->tt) == LUA_TSTRING, &((cast_u(o))->ts)) -#define gco2u(o) check_exp((o)->tt == LUA_VUSERDATA, &((cast_u(o))->u)) -#define gco2lcl(o) check_exp((o)->tt == LUA_VLCL, &((cast_u(o))->cl.l)) -#define gco2ccl(o) check_exp((o)->tt == LUA_VCCL, &((cast_u(o))->cl.c)) -#define gco2cl(o) \ - check_exp(novariant((o)->tt) == LUA_TFUNCTION, &((cast_u(o))->cl)) -#define gco2t(o) check_exp((o)->tt == LUA_VTABLE, &((cast_u(o))->h)) -#define gco2p(o) check_exp((o)->tt == LUA_VPROTO, &((cast_u(o))->p)) -#define gco2th(o) check_exp((o)->tt == LUA_VTHREAD, &((cast_u(o))->th)) -#define gco2upv(o) check_exp((o)->tt == LUA_VUPVAL, &((cast_u(o))->upv)) - - -/* -** macro to convert a Lua object into a GCObject -** (The access to 'tt' tries to ensure that 'v' is actually a Lua object.) -*/ -#define obj2gco(v) check_exp((v)->tt >= LUA_TSTRING, &(cast_u(v)->gc)) - - -/* actual number of total objects allocated */ -#define gettotalobjs(g) ((g)->totalobjs - (g)->GCdebt) - - -LUAI_FUNC void luaE_setdebt (global_State *g, l_obj debt); -LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1); -LUAI_FUNC CallInfo *luaE_extendCI (lua_State *L); -LUAI_FUNC void luaE_shrinkCI (lua_State *L); -LUAI_FUNC void luaE_checkcstack (lua_State *L); -LUAI_FUNC void luaE_incCstack (lua_State *L); -LUAI_FUNC void luaE_warning (lua_State *L, const char *msg, int tocont); -LUAI_FUNC void luaE_warnerror (lua_State *L, const char *where); -LUAI_FUNC int luaE_resetthread (lua_State *L, int status); - - -#endif - diff --git a/src/dependencies/lua/lstring.c b/src/dependencies/lua/lstring.c deleted file mode 100644 index a374c96..0000000 --- a/src/dependencies/lua/lstring.c +++ /dev/null @@ -1,349 +0,0 @@ -/* -** $Id: lstring.c $ -** String table (keeps all strings handled by Lua) -** See Copyright Notice in lua.h -*/ - -#define lstring_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" - - -/* -** Maximum size for string table. -*/ -#define MAXSTRTB cast_int(luaM_limitN(MAX_INT, TString*)) - - -/* -** equality for long strings -*/ -int luaS_eqlngstr (TString *a, TString *b) { - size_t len = a->u.lnglen; - lua_assert(a->tt == LUA_VLNGSTR && b->tt == LUA_VLNGSTR); - return (a == b) || /* same instance or... */ - ((len == b->u.lnglen) && /* equal length and ... */ - (memcmp(getlngstr(a), getlngstr(b), len) == 0)); /* equal contents */ -} - - -unsigned luaS_hash (const char *str, size_t l, unsigned seed) { - unsigned int h = seed ^ cast_uint(l); - for (; l > 0; l--) - h ^= ((h<<5) + (h>>2) + cast_byte(str[l - 1])); - return h; -} - - -unsigned luaS_hashlongstr (TString *ts) { - lua_assert(ts->tt == LUA_VLNGSTR); - if (ts->extra == 0) { /* no hash? */ - size_t len = ts->u.lnglen; - ts->hash = luaS_hash(getlngstr(ts), len, ts->hash); - ts->extra = 1; /* now it has its hash */ - } - return ts->hash; -} - - -static void tablerehash (TString **vect, int osize, int nsize) { - int i; - for (i = osize; i < nsize; i++) /* clear new elements */ - vect[i] = NULL; - for (i = 0; i < osize; i++) { /* rehash old part of the array */ - TString *p = vect[i]; - vect[i] = NULL; - while (p) { /* for each string in the list */ - TString *hnext = p->u.hnext; /* save next */ - unsigned int h = lmod(p->hash, nsize); /* new position */ - p->u.hnext = vect[h]; /* chain it into array */ - vect[h] = p; - p = hnext; - } - } -} - - -/* -** Resize the string table. If allocation fails, keep the current size. -** (This can degrade performance, but any non-zero size should work -** correctly.) -*/ -void luaS_resize (lua_State *L, int nsize) { - stringtable *tb = &G(L)->strt; - int osize = tb->size; - TString **newvect; - if (nsize < osize) /* shrinking table? */ - tablerehash(tb->hash, osize, nsize); /* depopulate shrinking part */ - newvect = luaM_reallocvector(L, tb->hash, osize, nsize, TString*); - if (l_unlikely(newvect == NULL)) { /* reallocation failed? */ - if (nsize < osize) /* was it shrinking table? */ - tablerehash(tb->hash, nsize, osize); /* restore to original size */ - /* leave table as it was */ - } - else { /* allocation succeeded */ - tb->hash = newvect; - tb->size = nsize; - if (nsize > osize) - tablerehash(newvect, osize, nsize); /* rehash for new size */ - } -} - - -/* -** Clear API string cache. (Entries cannot be empty, so fill them with -** a non-collectable string.) -*/ -void luaS_clearcache (global_State *g) { - int i, j; - for (i = 0; i < STRCACHE_N; i++) - for (j = 0; j < STRCACHE_M; j++) { - if (iswhite(g->strcache[i][j])) /* will entry be collected? */ - g->strcache[i][j] = g->memerrmsg; /* replace it with something fixed */ - } -} - - -/* -** Initialize the string table and the string cache -*/ -void luaS_init (lua_State *L) { - global_State *g = G(L); - int i, j; - stringtable *tb = &G(L)->strt; - tb->hash = luaM_newvector(L, MINSTRTABSIZE, TString*); - tablerehash(tb->hash, 0, MINSTRTABSIZE); /* clear array */ - tb->size = MINSTRTABSIZE; - /* pre-create memory-error message */ - g->memerrmsg = luaS_newliteral(L, MEMERRMSG); - luaC_fix(L, obj2gco(g->memerrmsg)); /* it should never be collected */ - for (i = 0; i < STRCACHE_N; i++) /* fill cache with valid strings */ - for (j = 0; j < STRCACHE_M; j++) - g->strcache[i][j] = g->memerrmsg; -} - - -size_t luaS_sizelngstr (size_t len, int kind) { - switch (kind) { - case LSTRREG: /* regular long string */ - /* don't need 'falloc'/'ud', but need space for content */ - return offsetof(TString, falloc) + (len + 1) * sizeof(char); - case LSTRFIX: /* fixed external long string */ - /* don't need 'falloc'/'ud' */ - return offsetof(TString, falloc); - default: /* external long string with deallocation */ - lua_assert(kind == LSTRMEM); - return sizeof(TString); - } -} - - -/* -** creates a new string object -*/ -static TString *createstrobj (lua_State *L, size_t totalsize, int tag, - unsigned h) { - TString *ts; - GCObject *o; - o = luaC_newobj(L, tag, totalsize); - ts = gco2ts(o); - ts->hash = h; - ts->extra = 0; - return ts; -} - - -TString *luaS_createlngstrobj (lua_State *L, size_t l) { - size_t totalsize = luaS_sizelngstr(l, LSTRREG); - TString *ts = createstrobj(L, totalsize, LUA_VLNGSTR, G(L)->seed); - ts->u.lnglen = l; - ts->shrlen = LSTRREG; /* signals that it is a regular long string */ - ts->contents = cast_charp(ts) + offsetof(TString, falloc); - ts->contents[l] = '\0'; /* ending 0 */ - return ts; -} - - -void luaS_remove (lua_State *L, TString *ts) { - stringtable *tb = &G(L)->strt; - TString **p = &tb->hash[lmod(ts->hash, tb->size)]; - while (*p != ts) /* find previous element */ - p = &(*p)->u.hnext; - *p = (*p)->u.hnext; /* remove element from its list */ - tb->nuse--; -} - - -static void growstrtab (lua_State *L, stringtable *tb) { - if (l_unlikely(tb->nuse == MAX_INT)) { /* too many strings? */ - luaC_fullgc(L, 1); /* try to free some... */ - if (tb->nuse == MAX_INT) /* still too many? */ - luaM_error(L); /* cannot even create a message... */ - } - if (tb->size <= MAXSTRTB / 2) /* can grow string table? */ - luaS_resize(L, tb->size * 2); -} - - -/* -** Checks whether short string exists and reuses it or creates a new one. -*/ -static TString *internshrstr (lua_State *L, const char *str, size_t l) { - TString *ts; - global_State *g = G(L); - stringtable *tb = &g->strt; - unsigned int h = luaS_hash(str, l, g->seed); - TString **list = &tb->hash[lmod(h, tb->size)]; - lua_assert(str != NULL); /* otherwise 'memcmp'/'memcpy' are undefined */ - for (ts = *list; ts != NULL; ts = ts->u.hnext) { - if (l == cast_uint(ts->shrlen) && - (memcmp(str, getshrstr(ts), l * sizeof(char)) == 0)) { - /* found! */ - if (isdead(g, ts)) /* dead (but not collected yet)? */ - changewhite(ts); /* resurrect it */ - return ts; - } - } - /* else must create a new string */ - if (tb->nuse >= tb->size) { /* need to grow string table? */ - growstrtab(L, tb); - list = &tb->hash[lmod(h, tb->size)]; /* rehash with new size */ - } - ts = createstrobj(L, sizestrshr(l), LUA_VSHRSTR, h); - ts->shrlen = cast_byte(l); - getshrstr(ts)[l] = '\0'; /* ending 0 */ - memcpy(getshrstr(ts), str, l * sizeof(char)); - ts->u.hnext = *list; - *list = ts; - tb->nuse++; - return ts; -} - - -/* -** new string (with explicit length) -*/ -TString *luaS_newlstr (lua_State *L, const char *str, size_t l) { - if (l <= LUAI_MAXSHORTLEN) /* short string? */ - return internshrstr(L, str, l); - else { - TString *ts; - if (l_unlikely(l * sizeof(char) >= (MAX_SIZE - sizeof(TString)))) - luaM_toobig(L); - ts = luaS_createlngstrobj(L, l); - memcpy(getlngstr(ts), str, l * sizeof(char)); - return ts; - } -} - - -/* -** Create or reuse a zero-terminated string, first checking in the -** cache (using the string address as a key). The cache can contain -** only zero-terminated strings, so it is safe to use 'strcmp' to -** check hits. -*/ -TString *luaS_new (lua_State *L, const char *str) { - unsigned int i = point2uint(str) % STRCACHE_N; /* hash */ - int j; - TString **p = G(L)->strcache[i]; - for (j = 0; j < STRCACHE_M; j++) { - if (strcmp(str, getstr(p[j])) == 0) /* hit? */ - return p[j]; /* that is it */ - } - /* normal route */ - for (j = STRCACHE_M - 1; j > 0; j--) - p[j] = p[j - 1]; /* move out last element */ - /* new element is first in the list */ - p[0] = luaS_newlstr(L, str, strlen(str)); - return p[0]; -} - - -Udata *luaS_newudata (lua_State *L, size_t s, int nuvalue) { - Udata *u; - int i; - GCObject *o; - if (l_unlikely(s > MAX_SIZE - udatamemoffset(nuvalue))) - luaM_toobig(L); - o = luaC_newobj(L, LUA_VUSERDATA, sizeudata(nuvalue, s)); - u = gco2u(o); - u->len = s; - u->nuvalue = nuvalue; - u->metatable = NULL; - for (i = 0; i < nuvalue; i++) - setnilvalue(&u->uv[i].uv); - return u; -} - - -struct NewExt { - int kind; - const char *s; - size_t len; - TString *ts; /* output */ -}; - - -static void f_newext (lua_State *L, void *ud) { - struct NewExt *ne = cast(struct NewExt *, ud); - size_t size = luaS_sizelngstr(0, ne->kind); - ne->ts = createstrobj(L, size, LUA_VLNGSTR, G(L)->seed); -} - - -static void f_pintern (lua_State *L, void *ud) { - struct NewExt *ne = cast(struct NewExt *, ud); - ne->ts = internshrstr(L, ne->s, ne->len); -} - - -TString *luaS_newextlstr (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud) { - struct NewExt ne; - if (len <= LUAI_MAXSHORTLEN) { /* short string? */ - ne.s = s; ne.len = len; - if (!falloc) - f_pintern(L, &ne); /* just internalize string */ - else { - int status = luaD_rawrunprotected(L, f_pintern, &ne); - (*falloc)(ud, cast_voidp(s), len + 1, 0); /* free external string */ - if (status != LUA_OK) /* memory error? */ - luaM_error(L); /* re-raise memory error */ - } - return ne.ts; - } - /* "normal" case: long strings */ - if (!falloc) { - ne.kind = LSTRFIX; - f_newext(L, &ne); /* just create header */ - } - else { - ne.kind = LSTRMEM; - if (luaD_rawrunprotected(L, f_newext, &ne) != LUA_OK) { /* mem. error? */ - (*falloc)(ud, cast_voidp(s), len + 1, 0); /* free external string */ - luaM_error(L); /* re-raise memory error */ - } - ne.ts->falloc = falloc; - ne.ts->ud = ud; - } - ne.ts->shrlen = ne.kind; - ne.ts->u.lnglen = len; - ne.ts->contents = cast_charp(s); - return ne.ts; -} - - diff --git a/src/dependencies/lua/lstring.h b/src/dependencies/lua/lstring.h deleted file mode 100644 index b7226d8..0000000 --- a/src/dependencies/lua/lstring.h +++ /dev/null @@ -1,61 +0,0 @@ -/* -** $Id: lstring.h $ -** String table (keep all strings handled by Lua) -** See Copyright Notice in lua.h -*/ - -#ifndef lstring_h -#define lstring_h - -#include "lgc.h" -#include "lobject.h" -#include "lstate.h" - - -/* -** Memory-allocation error message must be preallocated (it cannot -** be created after memory is exhausted) -*/ -#define MEMERRMSG "not enough memory" - - -/* -** Size of a short TString: Size of the header plus space for the string -** itself (including final '\0'). -*/ -#define sizestrshr(l) \ - (offsetof(TString, contents) + ((l) + 1) * sizeof(char)) - - -#define luaS_newliteral(L, s) (luaS_newlstr(L, "" s, \ - (sizeof(s)/sizeof(char))-1)) - - -/* -** test whether a string is a reserved word -*/ -#define isreserved(s) ((s)->tt == LUA_VSHRSTR && (s)->extra > 0) - - -/* -** equality for short strings, which are always internalized -*/ -#define eqshrstr(a,b) check_exp((a)->tt == LUA_VSHRSTR, (a) == (b)) - - -LUAI_FUNC unsigned luaS_hash (const char *str, size_t l, unsigned seed); -LUAI_FUNC unsigned luaS_hashlongstr (TString *ts); -LUAI_FUNC int luaS_eqlngstr (TString *a, TString *b); -LUAI_FUNC void luaS_resize (lua_State *L, int newsize); -LUAI_FUNC void luaS_clearcache (global_State *g); -LUAI_FUNC void luaS_init (lua_State *L); -LUAI_FUNC void luaS_remove (lua_State *L, TString *ts); -LUAI_FUNC Udata *luaS_newudata (lua_State *L, size_t s, int nuvalue); -LUAI_FUNC TString *luaS_newlstr (lua_State *L, const char *str, size_t l); -LUAI_FUNC TString *luaS_new (lua_State *L, const char *str); -LUAI_FUNC TString *luaS_createlngstrobj (lua_State *L, size_t l); -LUAI_FUNC TString *luaS_newextlstr (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud); -LUAI_FUNC size_t luaS_sizelngstr (size_t len, int kind); - -#endif diff --git a/src/dependencies/lua/lstrlib.c b/src/dependencies/lua/lstrlib.c deleted file mode 100644 index eeaf725..0000000 --- a/src/dependencies/lua/lstrlib.c +++ /dev/null @@ -1,1879 +0,0 @@ -/* -** $Id: lstrlib.c $ -** Standard library for string operations and pattern-matching -** See Copyright Notice in lua.h -*/ - -#define lstrlib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** maximum number of captures that a pattern can do during -** pattern-matching. This limit is arbitrary, but must fit in -** an unsigned char. -*/ -#if !defined(LUA_MAXCAPTURES) -#define LUA_MAXCAPTURES 32 -#endif - - -/* macro to 'unsign' a character */ -#define uchar(c) ((unsigned char)(c)) - - -/* -** Some sizes are better limited to fit in 'int', but must also fit in -** 'size_t'. (We assume that 'lua_Integer' cannot be smaller than 'int'.) -*/ -#define MAX_SIZET ((size_t)(~(size_t)0)) - -#define MAXSIZE \ - (sizeof(size_t) < sizeof(int) ? MAX_SIZET : (size_t)(INT_MAX)) - - - - -static int str_len (lua_State *L) { - size_t l; - luaL_checklstring(L, 1, &l); - lua_pushinteger(L, (lua_Integer)l); - return 1; -} - - -/* -** translate a relative initial string position -** (negative means back from end): clip result to [1, inf). -** The length of any string in Lua must fit in a lua_Integer, -** so there are no overflows in the casts. -** The inverted comparison avoids a possible overflow -** computing '-pos'. -*/ -static size_t posrelatI (lua_Integer pos, size_t len) { - if (pos > 0) - return (size_t)pos; - else if (pos == 0) - return 1; - else if (pos < -(lua_Integer)len) /* inverted comparison */ - return 1; /* clip to 1 */ - else return len + (size_t)pos + 1; -} - - -/* -** Gets an optional ending string position from argument 'arg', -** with default value 'def'. -** Negative means back from end: clip result to [0, len] -*/ -static size_t getendpos (lua_State *L, int arg, lua_Integer def, - size_t len) { - lua_Integer pos = luaL_optinteger(L, arg, def); - if (pos > (lua_Integer)len) - return len; - else if (pos >= 0) - return (size_t)pos; - else if (pos < -(lua_Integer)len) - return 0; - else return len + (size_t)pos + 1; -} - - -static int str_sub (lua_State *L) { - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - size_t start = posrelatI(luaL_checkinteger(L, 2), l); - size_t end = getendpos(L, 3, -1, l); - if (start <= end) - lua_pushlstring(L, s + start - 1, (end - start) + 1); - else lua_pushliteral(L, ""); - return 1; -} - - -static int str_reverse (lua_State *L) { - size_t l, i; - luaL_Buffer b; - const char *s = luaL_checklstring(L, 1, &l); - char *p = luaL_buffinitsize(L, &b, l); - for (i = 0; i < l; i++) - p[i] = s[l - i - 1]; - luaL_pushresultsize(&b, l); - return 1; -} - - -static int str_lower (lua_State *L) { - size_t l; - size_t i; - luaL_Buffer b; - const char *s = luaL_checklstring(L, 1, &l); - char *p = luaL_buffinitsize(L, &b, l); - for (i=0; i MAXSIZE / n)) - return luaL_error(L, "resulting string too large"); - else { - size_t totallen = (size_t)n * l + (size_t)(n - 1) * lsep; - luaL_Buffer b; - char *p = luaL_buffinitsize(L, &b, totallen); - while (n-- > 1) { /* first n-1 copies (followed by separator) */ - memcpy(p, s, l * sizeof(char)); p += l; - if (lsep > 0) { /* empty 'memcpy' is not that cheap */ - memcpy(p, sep, lsep * sizeof(char)); - p += lsep; - } - } - memcpy(p, s, l * sizeof(char)); /* last copy (not followed by separator) */ - luaL_pushresultsize(&b, totallen); - } - return 1; -} - - -static int str_byte (lua_State *L) { - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - lua_Integer pi = luaL_optinteger(L, 2, 1); - size_t posi = posrelatI(pi, l); - size_t pose = getendpos(L, 3, pi, l); - int n, i; - if (posi > pose) return 0; /* empty interval; return no values */ - if (l_unlikely(pose - posi >= (size_t)INT_MAX)) /* arithmetic overflow? */ - return luaL_error(L, "string slice too long"); - n = (int)(pose - posi) + 1; - luaL_checkstack(L, n, "string slice too long"); - for (i=0; iinit) { - state->init = 1; - luaL_buffinit(L, &state->B); - } - if (b == NULL) { /* finishing dump? */ - luaL_pushresult(&state->B); /* push result */ - lua_replace(L, 1); /* move it to reserved slot */ - } - else - luaL_addlstring(&state->B, (const char *)b, size); - return 0; -} - - -static int str_dump (lua_State *L) { - struct str_Writer state; - int strip = lua_toboolean(L, 2); - luaL_argcheck(L, lua_type(L, 1) == LUA_TFUNCTION && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - /* ensure function is on the top of the stack and vacate slot 1 */ - lua_pushvalue(L, 1); - state.init = 0; - lua_dump(L, writer, &state, strip); - lua_settop(L, 1); /* leave final result on top */ - return 1; -} - - - -/* -** {====================================================== -** METAMETHODS -** ======================================================= -*/ - -#if defined(LUA_NOCVTS2N) /* { */ - -/* no coercion from strings to numbers */ - -static const luaL_Reg stringmetamethods[] = { - {"__index", NULL}, /* placeholder */ - {NULL, NULL} -}; - -#else /* }{ */ - -static int tonum (lua_State *L, int arg) { - if (lua_type(L, arg) == LUA_TNUMBER) { /* already a number? */ - lua_pushvalue(L, arg); - return 1; - } - else { /* check whether it is a numerical string */ - size_t len; - const char *s = lua_tolstring(L, arg, &len); - return (s != NULL && lua_stringtonumber(L, s) == len + 1); - } -} - - -static void trymt (lua_State *L, const char *mtname) { - lua_settop(L, 2); /* back to the original arguments */ - if (l_unlikely(lua_type(L, 2) == LUA_TSTRING || - !luaL_getmetafield(L, 2, mtname))) - luaL_error(L, "attempt to %s a '%s' with a '%s'", mtname + 2, - luaL_typename(L, -2), luaL_typename(L, -1)); - lua_insert(L, -3); /* put metamethod before arguments */ - lua_call(L, 2, 1); /* call metamethod */ -} - - -static int arith (lua_State *L, int op, const char *mtname) { - if (tonum(L, 1) && tonum(L, 2)) - lua_arith(L, op); /* result will be on the top */ - else - trymt(L, mtname); - return 1; -} - - -static int arith_add (lua_State *L) { - return arith(L, LUA_OPADD, "__add"); -} - -static int arith_sub (lua_State *L) { - return arith(L, LUA_OPSUB, "__sub"); -} - -static int arith_mul (lua_State *L) { - return arith(L, LUA_OPMUL, "__mul"); -} - -static int arith_mod (lua_State *L) { - return arith(L, LUA_OPMOD, "__mod"); -} - -static int arith_pow (lua_State *L) { - return arith(L, LUA_OPPOW, "__pow"); -} - -static int arith_div (lua_State *L) { - return arith(L, LUA_OPDIV, "__div"); -} - -static int arith_idiv (lua_State *L) { - return arith(L, LUA_OPIDIV, "__idiv"); -} - -static int arith_unm (lua_State *L) { - return arith(L, LUA_OPUNM, "__unm"); -} - - -static const luaL_Reg stringmetamethods[] = { - {"__add", arith_add}, - {"__sub", arith_sub}, - {"__mul", arith_mul}, - {"__mod", arith_mod}, - {"__pow", arith_pow}, - {"__div", arith_div}, - {"__idiv", arith_idiv}, - {"__unm", arith_unm}, - {"__index", NULL}, /* placeholder */ - {NULL, NULL} -}; - -#endif /* } */ - -/* }====================================================== */ - -/* -** {====================================================== -** PATTERN MATCHING -** ======================================================= -*/ - - -#define CAP_UNFINISHED (-1) -#define CAP_POSITION (-2) - - -typedef struct MatchState { - const char *src_init; /* init of source string */ - const char *src_end; /* end ('\0') of source string */ - const char *p_end; /* end ('\0') of pattern */ - lua_State *L; - int matchdepth; /* control for recursive depth (to avoid C stack overflow) */ - unsigned char level; /* total number of captures (finished or unfinished) */ - struct { - const char *init; - ptrdiff_t len; - } capture[LUA_MAXCAPTURES]; -} MatchState; - - -/* recursive function */ -static const char *match (MatchState *ms, const char *s, const char *p); - - -/* maximum recursion depth for 'match' */ -#if !defined(MAXCCALLS) -#define MAXCCALLS 200 -#endif - - -#define L_ESC '%' -#define SPECIALS "^$*+?.([%-" - - -static int check_capture (MatchState *ms, int l) { - l -= '1'; - if (l_unlikely(l < 0 || l >= ms->level || - ms->capture[l].len == CAP_UNFINISHED)) - return luaL_error(ms->L, "invalid capture index %%%d", l + 1); - return l; -} - - -static int capture_to_close (MatchState *ms) { - int level = ms->level; - for (level--; level>=0; level--) - if (ms->capture[level].len == CAP_UNFINISHED) return level; - return luaL_error(ms->L, "invalid pattern capture"); -} - - -static const char *classend (MatchState *ms, const char *p) { - switch (*p++) { - case L_ESC: { - if (l_unlikely(p == ms->p_end)) - luaL_error(ms->L, "malformed pattern (ends with '%%')"); - return p+1; - } - case '[': { - if (*p == '^') p++; - do { /* look for a ']' */ - if (l_unlikely(p == ms->p_end)) - luaL_error(ms->L, "malformed pattern (missing ']')"); - if (*(p++) == L_ESC && p < ms->p_end) - p++; /* skip escapes (e.g. '%]') */ - } while (*p != ']'); - return p+1; - } - default: { - return p; - } - } -} - - -static int match_class (int c, int cl) { - int res; - switch (tolower(cl)) { - case 'a' : res = isalpha(c); break; - case 'c' : res = iscntrl(c); break; - case 'd' : res = isdigit(c); break; - case 'g' : res = isgraph(c); break; - case 'l' : res = islower(c); break; - case 'p' : res = ispunct(c); break; - case 's' : res = isspace(c); break; - case 'u' : res = isupper(c); break; - case 'w' : res = isalnum(c); break; - case 'x' : res = isxdigit(c); break; - case 'z' : res = (c == 0); break; /* deprecated option */ - default: return (cl == c); - } - return (islower(cl) ? res : !res); -} - - -static int matchbracketclass (int c, const char *p, const char *ec) { - int sig = 1; - if (*(p+1) == '^') { - sig = 0; - p++; /* skip the '^' */ - } - while (++p < ec) { - if (*p == L_ESC) { - p++; - if (match_class(c, uchar(*p))) - return sig; - } - else if ((*(p+1) == '-') && (p+2 < ec)) { - p+=2; - if (uchar(*(p-2)) <= c && c <= uchar(*p)) - return sig; - } - else if (uchar(*p) == c) return sig; - } - return !sig; -} - - -static int singlematch (MatchState *ms, const char *s, const char *p, - const char *ep) { - if (s >= ms->src_end) - return 0; - else { - int c = uchar(*s); - switch (*p) { - case '.': return 1; /* matches any char */ - case L_ESC: return match_class(c, uchar(*(p+1))); - case '[': return matchbracketclass(c, p, ep-1); - default: return (uchar(*p) == c); - } - } -} - - -static const char *matchbalance (MatchState *ms, const char *s, - const char *p) { - if (l_unlikely(p >= ms->p_end - 1)) - luaL_error(ms->L, "malformed pattern (missing arguments to '%%b')"); - if (*s != *p) return NULL; - else { - int b = *p; - int e = *(p+1); - int cont = 1; - while (++s < ms->src_end) { - if (*s == e) { - if (--cont == 0) return s+1; - } - else if (*s == b) cont++; - } - } - return NULL; /* string ends out of balance */ -} - - -static const char *max_expand (MatchState *ms, const char *s, - const char *p, const char *ep) { - ptrdiff_t i = 0; /* counts maximum expand for item */ - while (singlematch(ms, s + i, p, ep)) - i++; - /* keeps trying to match with the maximum repetitions */ - while (i>=0) { - const char *res = match(ms, (s+i), ep+1); - if (res) return res; - i--; /* else didn't match; reduce 1 repetition to try again */ - } - return NULL; -} - - -static const char *min_expand (MatchState *ms, const char *s, - const char *p, const char *ep) { - for (;;) { - const char *res = match(ms, s, ep+1); - if (res != NULL) - return res; - else if (singlematch(ms, s, p, ep)) - s++; /* try with one more repetition */ - else return NULL; - } -} - - -static const char *start_capture (MatchState *ms, const char *s, - const char *p, int what) { - const char *res; - int level = ms->level; - if (level >= LUA_MAXCAPTURES) luaL_error(ms->L, "too many captures"); - ms->capture[level].init = s; - ms->capture[level].len = what; - ms->level = level+1; - if ((res=match(ms, s, p)) == NULL) /* match failed? */ - ms->level--; /* undo capture */ - return res; -} - - -static const char *end_capture (MatchState *ms, const char *s, - const char *p) { - int l = capture_to_close(ms); - const char *res; - ms->capture[l].len = s - ms->capture[l].init; /* close capture */ - if ((res = match(ms, s, p)) == NULL) /* match failed? */ - ms->capture[l].len = CAP_UNFINISHED; /* undo capture */ - return res; -} - - -static const char *match_capture (MatchState *ms, const char *s, int l) { - size_t len; - l = check_capture(ms, l); - len = ms->capture[l].len; - if ((size_t)(ms->src_end-s) >= len && - memcmp(ms->capture[l].init, s, len) == 0) - return s+len; - else return NULL; -} - - -static const char *match (MatchState *ms, const char *s, const char *p) { - if (l_unlikely(ms->matchdepth-- == 0)) - luaL_error(ms->L, "pattern too complex"); - init: /* using goto to optimize tail recursion */ - if (p != ms->p_end) { /* end of pattern? */ - switch (*p) { - case '(': { /* start capture */ - if (*(p + 1) == ')') /* position capture? */ - s = start_capture(ms, s, p + 2, CAP_POSITION); - else - s = start_capture(ms, s, p + 1, CAP_UNFINISHED); - break; - } - case ')': { /* end capture */ - s = end_capture(ms, s, p + 1); - break; - } - case '$': { - if ((p + 1) != ms->p_end) /* is the '$' the last char in pattern? */ - goto dflt; /* no; go to default */ - s = (s == ms->src_end) ? s : NULL; /* check end of string */ - break; - } - case L_ESC: { /* escaped sequences not in the format class[*+?-]? */ - switch (*(p + 1)) { - case 'b': { /* balanced string? */ - s = matchbalance(ms, s, p + 2); - if (s != NULL) { - p += 4; goto init; /* return match(ms, s, p + 4); */ - } /* else fail (s == NULL) */ - break; - } - case 'f': { /* frontier? */ - const char *ep; char previous; - p += 2; - if (l_unlikely(*p != '[')) - luaL_error(ms->L, "missing '[' after '%%f' in pattern"); - ep = classend(ms, p); /* points to what is next */ - previous = (s == ms->src_init) ? '\0' : *(s - 1); - if (!matchbracketclass(uchar(previous), p, ep - 1) && - matchbracketclass(uchar(*s), p, ep - 1)) { - p = ep; goto init; /* return match(ms, s, ep); */ - } - s = NULL; /* match failed */ - break; - } - case '0': case '1': case '2': case '3': - case '4': case '5': case '6': case '7': - case '8': case '9': { /* capture results (%0-%9)? */ - s = match_capture(ms, s, uchar(*(p + 1))); - if (s != NULL) { - p += 2; goto init; /* return match(ms, s, p + 2) */ - } - break; - } - default: goto dflt; - } - break; - } - default: dflt: { /* pattern class plus optional suffix */ - const char *ep = classend(ms, p); /* points to optional suffix */ - /* does not match at least once? */ - if (!singlematch(ms, s, p, ep)) { - if (*ep == '*' || *ep == '?' || *ep == '-') { /* accept empty? */ - p = ep + 1; goto init; /* return match(ms, s, ep + 1); */ - } - else /* '+' or no suffix */ - s = NULL; /* fail */ - } - else { /* matched once */ - switch (*ep) { /* handle optional suffix */ - case '?': { /* optional */ - const char *res; - if ((res = match(ms, s + 1, ep + 1)) != NULL) - s = res; - else { - p = ep + 1; goto init; /* else return match(ms, s, ep + 1); */ - } - break; - } - case '+': /* 1 or more repetitions */ - s++; /* 1 match already done */ - /* FALLTHROUGH */ - case '*': /* 0 or more repetitions */ - s = max_expand(ms, s, p, ep); - break; - case '-': /* 0 or more repetitions (minimum) */ - s = min_expand(ms, s, p, ep); - break; - default: /* no suffix */ - s++; p = ep; goto init; /* return match(ms, s + 1, ep); */ - } - } - break; - } - } - } - ms->matchdepth++; - return s; -} - - - -static const char *lmemfind (const char *s1, size_t l1, - const char *s2, size_t l2) { - if (l2 == 0) return s1; /* empty strings are everywhere */ - else if (l2 > l1) return NULL; /* avoids a negative 'l1' */ - else { - const char *init; /* to search for a '*s2' inside 's1' */ - l2--; /* 1st char will be checked by 'memchr' */ - l1 = l1-l2; /* 's2' cannot be found after that */ - while (l1 > 0 && (init = (const char *)memchr(s1, *s2, l1)) != NULL) { - init++; /* 1st char is already checked */ - if (memcmp(init, s2+1, l2) == 0) - return init-1; - else { /* correct 'l1' and 's1' to try again */ - l1 -= init-s1; - s1 = init; - } - } - return NULL; /* not found */ - } -} - - -/* -** get information about the i-th capture. If there are no captures -** and 'i==0', return information about the whole match, which -** is the range 's'..'e'. If the capture is a string, return -** its length and put its address in '*cap'. If it is an integer -** (a position), push it on the stack and return CAP_POSITION. -*/ -static size_t get_onecapture (MatchState *ms, int i, const char *s, - const char *e, const char **cap) { - if (i >= ms->level) { - if (l_unlikely(i != 0)) - luaL_error(ms->L, "invalid capture index %%%d", i + 1); - *cap = s; - return e - s; - } - else { - ptrdiff_t capl = ms->capture[i].len; - *cap = ms->capture[i].init; - if (l_unlikely(capl == CAP_UNFINISHED)) - luaL_error(ms->L, "unfinished capture"); - else if (capl == CAP_POSITION) - lua_pushinteger(ms->L, (ms->capture[i].init - ms->src_init) + 1); - return capl; - } -} - - -/* -** Push the i-th capture on the stack. -*/ -static void push_onecapture (MatchState *ms, int i, const char *s, - const char *e) { - const char *cap; - ptrdiff_t l = get_onecapture(ms, i, s, e, &cap); - if (l != CAP_POSITION) - lua_pushlstring(ms->L, cap, l); - /* else position was already pushed */ -} - - -static int push_captures (MatchState *ms, const char *s, const char *e) { - int i; - int nlevels = (ms->level == 0 && s) ? 1 : ms->level; - luaL_checkstack(ms->L, nlevels, "too many captures"); - for (i = 0; i < nlevels; i++) - push_onecapture(ms, i, s, e); - return nlevels; /* number of strings pushed */ -} - - -/* check whether pattern has no special characters */ -static int nospecials (const char *p, size_t l) { - size_t upto = 0; - do { - if (strpbrk(p + upto, SPECIALS)) - return 0; /* pattern has a special character */ - upto += strlen(p + upto) + 1; /* may have more after \0 */ - } while (upto <= l); - return 1; /* no special chars found */ -} - - -static void prepstate (MatchState *ms, lua_State *L, - const char *s, size_t ls, const char *p, size_t lp) { - ms->L = L; - ms->matchdepth = MAXCCALLS; - ms->src_init = s; - ms->src_end = s + ls; - ms->p_end = p + lp; -} - - -static void reprepstate (MatchState *ms) { - ms->level = 0; - lua_assert(ms->matchdepth == MAXCCALLS); -} - - -static int str_find_aux (lua_State *L, int find) { - size_t ls, lp; - const char *s = luaL_checklstring(L, 1, &ls); - const char *p = luaL_checklstring(L, 2, &lp); - size_t init = posrelatI(luaL_optinteger(L, 3, 1), ls) - 1; - if (init > ls) { /* start after string's end? */ - luaL_pushfail(L); /* cannot find anything */ - return 1; - } - /* explicit request or no special characters? */ - if (find && (lua_toboolean(L, 4) || nospecials(p, lp))) { - /* do a plain search */ - const char *s2 = lmemfind(s + init, ls - init, p, lp); - if (s2) { - lua_pushinteger(L, (s2 - s) + 1); - lua_pushinteger(L, (s2 - s) + lp); - return 2; - } - } - else { - MatchState ms; - const char *s1 = s + init; - int anchor = (*p == '^'); - if (anchor) { - p++; lp--; /* skip anchor character */ - } - prepstate(&ms, L, s, ls, p, lp); - do { - const char *res; - reprepstate(&ms); - if ((res=match(&ms, s1, p)) != NULL) { - if (find) { - lua_pushinteger(L, (s1 - s) + 1); /* start */ - lua_pushinteger(L, res - s); /* end */ - return push_captures(&ms, NULL, 0) + 2; - } - else - return push_captures(&ms, s1, res); - } - } while (s1++ < ms.src_end && !anchor); - } - luaL_pushfail(L); /* not found */ - return 1; -} - - -static int str_find (lua_State *L) { - return str_find_aux(L, 1); -} - - -static int str_match (lua_State *L) { - return str_find_aux(L, 0); -} - - -/* state for 'gmatch' */ -typedef struct GMatchState { - const char *src; /* current position */ - const char *p; /* pattern */ - const char *lastmatch; /* end of last match */ - MatchState ms; /* match state */ -} GMatchState; - - -static int gmatch_aux (lua_State *L) { - GMatchState *gm = (GMatchState *)lua_touserdata(L, lua_upvalueindex(3)); - const char *src; - gm->ms.L = L; - for (src = gm->src; src <= gm->ms.src_end; src++) { - const char *e; - reprepstate(&gm->ms); - if ((e = match(&gm->ms, src, gm->p)) != NULL && e != gm->lastmatch) { - gm->src = gm->lastmatch = e; - return push_captures(&gm->ms, src, e); - } - } - return 0; /* not found */ -} - - -static int gmatch (lua_State *L) { - size_t ls, lp; - const char *s = luaL_checklstring(L, 1, &ls); - const char *p = luaL_checklstring(L, 2, &lp); - size_t init = posrelatI(luaL_optinteger(L, 3, 1), ls) - 1; - GMatchState *gm; - lua_settop(L, 2); /* keep strings on closure to avoid being collected */ - gm = (GMatchState *)lua_newuserdatauv(L, sizeof(GMatchState), 0); - if (init > ls) /* start after string's end? */ - init = ls + 1; /* avoid overflows in 's + init' */ - prepstate(&gm->ms, L, s, ls, p, lp); - gm->src = s + init; gm->p = p; gm->lastmatch = NULL; - lua_pushcclosure(L, gmatch_aux, 3); - return 1; -} - - -static void add_s (MatchState *ms, luaL_Buffer *b, const char *s, - const char *e) { - size_t l; - lua_State *L = ms->L; - const char *news = lua_tolstring(L, 3, &l); - const char *p; - while ((p = (char *)memchr(news, L_ESC, l)) != NULL) { - luaL_addlstring(b, news, p - news); - p++; /* skip ESC */ - if (*p == L_ESC) /* '%%' */ - luaL_addchar(b, *p); - else if (*p == '0') /* '%0' */ - luaL_addlstring(b, s, e - s); - else if (isdigit(uchar(*p))) { /* '%n' */ - const char *cap; - ptrdiff_t resl = get_onecapture(ms, *p - '1', s, e, &cap); - if (resl == CAP_POSITION) - luaL_addvalue(b); /* add position to accumulated result */ - else - luaL_addlstring(b, cap, resl); - } - else - luaL_error(L, "invalid use of '%c' in replacement string", L_ESC); - l -= p + 1 - news; - news = p + 1; - } - luaL_addlstring(b, news, l); -} - - -/* -** Add the replacement value to the string buffer 'b'. -** Return true if the original string was changed. (Function calls and -** table indexing resulting in nil or false do not change the subject.) -*/ -static int add_value (MatchState *ms, luaL_Buffer *b, const char *s, - const char *e, int tr) { - lua_State *L = ms->L; - switch (tr) { - case LUA_TFUNCTION: { /* call the function */ - int n; - lua_pushvalue(L, 3); /* push the function */ - n = push_captures(ms, s, e); /* all captures as arguments */ - lua_call(L, n, 1); /* call it */ - break; - } - case LUA_TTABLE: { /* index the table */ - push_onecapture(ms, 0, s, e); /* first capture is the index */ - lua_gettable(L, 3); - break; - } - default: { /* LUA_TNUMBER or LUA_TSTRING */ - add_s(ms, b, s, e); /* add value to the buffer */ - return 1; /* something changed */ - } - } - if (!lua_toboolean(L, -1)) { /* nil or false? */ - lua_pop(L, 1); /* remove value */ - luaL_addlstring(b, s, e - s); /* keep original text */ - return 0; /* no changes */ - } - else if (l_unlikely(!lua_isstring(L, -1))) - return luaL_error(L, "invalid replacement value (a %s)", - luaL_typename(L, -1)); - else { - luaL_addvalue(b); /* add result to accumulator */ - return 1; /* something changed */ - } -} - - -static int str_gsub (lua_State *L) { - size_t srcl, lp; - const char *src = luaL_checklstring(L, 1, &srcl); /* subject */ - const char *p = luaL_checklstring(L, 2, &lp); /* pattern */ - const char *lastmatch = NULL; /* end of last match */ - int tr = lua_type(L, 3); /* replacement type */ - lua_Integer max_s = luaL_optinteger(L, 4, srcl + 1); /* max replacements */ - int anchor = (*p == '^'); - lua_Integer n = 0; /* replacement count */ - int changed = 0; /* change flag */ - MatchState ms; - luaL_Buffer b; - luaL_argexpected(L, tr == LUA_TNUMBER || tr == LUA_TSTRING || - tr == LUA_TFUNCTION || tr == LUA_TTABLE, 3, - "string/function/table"); - luaL_buffinit(L, &b); - if (anchor) { - p++; lp--; /* skip anchor character */ - } - prepstate(&ms, L, src, srcl, p, lp); - while (n < max_s) { - const char *e; - reprepstate(&ms); /* (re)prepare state for new match */ - if ((e = match(&ms, src, p)) != NULL && e != lastmatch) { /* match? */ - n++; - changed = add_value(&ms, &b, src, e, tr) | changed; - src = lastmatch = e; - } - else if (src < ms.src_end) /* otherwise, skip one character */ - luaL_addchar(&b, *src++); - else break; /* end of subject */ - if (anchor) break; - } - if (!changed) /* no changes? */ - lua_pushvalue(L, 1); /* return original string */ - else { /* something changed */ - luaL_addlstring(&b, src, ms.src_end-src); - luaL_pushresult(&b); /* create and return new string */ - } - lua_pushinteger(L, n); /* number of substitutions */ - return 2; -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** STRING FORMAT -** ======================================================= -*/ - -#if !defined(lua_number2strx) /* { */ - -/* -** Hexadecimal floating-point formatter -*/ - -#define SIZELENMOD (sizeof(LUA_NUMBER_FRMLEN)/sizeof(char)) - - -/* -** Number of bits that goes into the first digit. It can be any value -** between 1 and 4; the following definition tries to align the number -** to nibble boundaries by making what is left after that first digit a -** multiple of 4. -*/ -#define L_NBFD ((l_floatatt(MANT_DIG) - 1)%4 + 1) - - -/* -** Add integer part of 'x' to buffer and return new 'x' -*/ -static lua_Number adddigit (char *buff, int n, lua_Number x) { - lua_Number dd = l_mathop(floor)(x); /* get integer part from 'x' */ - int d = (int)dd; - buff[n] = (d < 10 ? d + '0' : d - 10 + 'a'); /* add to buffer */ - return x - dd; /* return what is left */ -} - - -static int num2straux (char *buff, int sz, lua_Number x) { - /* if 'inf' or 'NaN', format it like '%g' */ - if (x != x || x == (lua_Number)HUGE_VAL || x == -(lua_Number)HUGE_VAL) - return l_sprintf(buff, sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)x); - else if (x == 0) { /* can be -0... */ - /* create "0" or "-0" followed by exponent */ - return l_sprintf(buff, sz, LUA_NUMBER_FMT "x0p+0", (LUAI_UACNUMBER)x); - } - else { - int e; - lua_Number m = l_mathop(frexp)(x, &e); /* 'x' fraction and exponent */ - int n = 0; /* character count */ - if (m < 0) { /* is number negative? */ - buff[n++] = '-'; /* add sign */ - m = -m; /* make it positive */ - } - buff[n++] = '0'; buff[n++] = 'x'; /* add "0x" */ - m = adddigit(buff, n++, m * (1 << L_NBFD)); /* add first digit */ - e -= L_NBFD; /* this digit goes before the radix point */ - if (m > 0) { /* more digits? */ - buff[n++] = lua_getlocaledecpoint(); /* add radix point */ - do { /* add as many digits as needed */ - m = adddigit(buff, n++, m * 16); - } while (m > 0); - } - n += l_sprintf(buff + n, sz - n, "p%+d", e); /* add exponent */ - lua_assert(n < sz); - return n; - } -} - - -static int lua_number2strx (lua_State *L, char *buff, int sz, - const char *fmt, lua_Number x) { - int n = num2straux(buff, sz, x); - if (fmt[SIZELENMOD] == 'A') { - int i; - for (i = 0; i < n; i++) - buff[i] = toupper(uchar(buff[i])); - } - else if (l_unlikely(fmt[SIZELENMOD] != 'a')) - return luaL_error(L, "modifiers for format '%%a'/'%%A' not implemented"); - return n; -} - -#endif /* } */ - - -/* -** Maximum size for items formatted with '%f'. This size is produced -** by format('%.99f', -maxfloat), and is equal to 99 + 3 ('-', '.', -** and '\0') + number of decimal digits to represent maxfloat (which -** is maximum exponent + 1). (99+3+1, adding some extra, 110) -*/ -#define MAX_ITEMF (110 + l_floatatt(MAX_10_EXP)) - - -/* -** All formats except '%f' do not need that large limit. The other -** float formats use exponents, so that they fit in the 99 limit for -** significant digits; 's' for large strings and 'q' add items directly -** to the buffer; all integer formats also fit in the 99 limit. The -** worst case are floats: they may need 99 significant digits, plus -** '0x', '-', '.', 'e+XXXX', and '\0'. Adding some extra, 120. -*/ -#define MAX_ITEM 120 - - -/* valid flags in a format specification */ -#if !defined(L_FMTFLAGSF) - -/* valid flags for a, A, e, E, f, F, g, and G conversions */ -#define L_FMTFLAGSF "-+#0 " - -/* valid flags for o, x, and X conversions */ -#define L_FMTFLAGSX "-#0" - -/* valid flags for d and i conversions */ -#define L_FMTFLAGSI "-+0 " - -/* valid flags for u conversions */ -#define L_FMTFLAGSU "-0" - -/* valid flags for c, p, and s conversions */ -#define L_FMTFLAGSC "-" - -#endif - - -/* -** Maximum size of each format specification (such as "%-099.99d"): -** Initial '%', flags (up to 5), width (2), period, precision (2), -** length modifier (8), conversion specifier, and final '\0', plus some -** extra. -*/ -#define MAX_FORMAT 32 - - -static void addquoted (luaL_Buffer *b, const char *s, size_t len) { - luaL_addchar(b, '"'); - while (len--) { - if (*s == '"' || *s == '\\' || *s == '\n') { - luaL_addchar(b, '\\'); - luaL_addchar(b, *s); - } - else if (iscntrl(uchar(*s))) { - char buff[10]; - if (!isdigit(uchar(*(s+1)))) - l_sprintf(buff, sizeof(buff), "\\%d", (int)uchar(*s)); - else - l_sprintf(buff, sizeof(buff), "\\%03d", (int)uchar(*s)); - luaL_addstring(b, buff); - } - else - luaL_addchar(b, *s); - s++; - } - luaL_addchar(b, '"'); -} - - -/* -** Serialize a floating-point number in such a way that it can be -** scanned back by Lua. Use hexadecimal format for "common" numbers -** (to preserve precision); inf, -inf, and NaN are handled separately. -** (NaN cannot be expressed as a numeral, so we write '(0/0)' for it.) -*/ -static int quotefloat (lua_State *L, char *buff, lua_Number n) { - const char *s; /* for the fixed representations */ - if (n == (lua_Number)HUGE_VAL) /* inf? */ - s = "1e9999"; - else if (n == -(lua_Number)HUGE_VAL) /* -inf? */ - s = "-1e9999"; - else if (n != n) /* NaN? */ - s = "(0/0)"; - else { /* format number as hexadecimal */ - int nb = lua_number2strx(L, buff, MAX_ITEM, - "%" LUA_NUMBER_FRMLEN "a", n); - /* ensures that 'buff' string uses a dot as the radix character */ - if (memchr(buff, '.', nb) == NULL) { /* no dot? */ - char point = lua_getlocaledecpoint(); /* try locale point */ - char *ppoint = (char *)memchr(buff, point, nb); - if (ppoint) *ppoint = '.'; /* change it to a dot */ - } - return nb; - } - /* for the fixed representations */ - return l_sprintf(buff, MAX_ITEM, "%s", s); -} - - -static void addliteral (lua_State *L, luaL_Buffer *b, int arg) { - switch (lua_type(L, arg)) { - case LUA_TSTRING: { - size_t len; - const char *s = lua_tolstring(L, arg, &len); - addquoted(b, s, len); - break; - } - case LUA_TNUMBER: { - char *buff = luaL_prepbuffsize(b, MAX_ITEM); - int nb; - if (!lua_isinteger(L, arg)) /* float? */ - nb = quotefloat(L, buff, lua_tonumber(L, arg)); - else { /* integers */ - lua_Integer n = lua_tointeger(L, arg); - const char *format = (n == LUA_MININTEGER) /* corner case? */ - ? "0x%" LUA_INTEGER_FRMLEN "x" /* use hex */ - : LUA_INTEGER_FMT; /* else use default format */ - nb = l_sprintf(buff, MAX_ITEM, format, (LUAI_UACINT)n); - } - luaL_addsize(b, nb); - break; - } - case LUA_TNIL: case LUA_TBOOLEAN: { - luaL_tolstring(L, arg, NULL); - luaL_addvalue(b); - break; - } - default: { - luaL_argerror(L, arg, "value has no literal form"); - } - } -} - - -static const char *get2digits (const char *s) { - if (isdigit(uchar(*s))) { - s++; - if (isdigit(uchar(*s))) s++; /* (2 digits at most) */ - } - return s; -} - - -/* -** Check whether a conversion specification is valid. When called, -** first character in 'form' must be '%' and last character must -** be a valid conversion specifier. 'flags' are the accepted flags; -** 'precision' signals whether to accept a precision. -*/ -static void checkformat (lua_State *L, const char *form, const char *flags, - int precision) { - const char *spec = form + 1; /* skip '%' */ - spec += strspn(spec, flags); /* skip flags */ - if (*spec != '0') { /* a width cannot start with '0' */ - spec = get2digits(spec); /* skip width */ - if (*spec == '.' && precision) { - spec++; - spec = get2digits(spec); /* skip precision */ - } - } - if (!isalpha(uchar(*spec))) /* did not go to the end? */ - luaL_error(L, "invalid conversion specification: '%s'", form); -} - - -/* -** Get a conversion specification and copy it to 'form'. -** Return the address of its last character. -*/ -static const char *getformat (lua_State *L, const char *strfrmt, - char *form) { - /* spans flags, width, and precision ('0' is included as a flag) */ - size_t len = strspn(strfrmt, L_FMTFLAGSF "123456789."); - len++; /* adds following character (should be the specifier) */ - /* still needs space for '%', '\0', plus a length modifier */ - if (len >= MAX_FORMAT - 10) - luaL_error(L, "invalid format (too long)"); - *(form++) = '%'; - memcpy(form, strfrmt, len * sizeof(char)); - *(form + len) = '\0'; - return strfrmt + len - 1; -} - - -/* -** add length modifier into formats -*/ -static void addlenmod (char *form, const char *lenmod) { - size_t l = strlen(form); - size_t lm = strlen(lenmod); - char spec = form[l - 1]; - strcpy(form + l - 1, lenmod); - form[l + lm - 1] = spec; - form[l + lm] = '\0'; -} - - -static int str_format (lua_State *L) { - int top = lua_gettop(L); - int arg = 1; - size_t sfl; - const char *strfrmt = luaL_checklstring(L, arg, &sfl); - const char *strfrmt_end = strfrmt+sfl; - const char *flags; - luaL_Buffer b; - luaL_buffinit(L, &b); - while (strfrmt < strfrmt_end) { - if (*strfrmt != L_ESC) - luaL_addchar(&b, *strfrmt++); - else if (*++strfrmt == L_ESC) - luaL_addchar(&b, *strfrmt++); /* %% */ - else { /* format item */ - char form[MAX_FORMAT]; /* to store the format ('%...') */ - int maxitem = MAX_ITEM; /* maximum length for the result */ - char *buff = luaL_prepbuffsize(&b, maxitem); /* to put result */ - int nb = 0; /* number of bytes in result */ - if (++arg > top) - return luaL_argerror(L, arg, "no value"); - strfrmt = getformat(L, strfrmt, form); - switch (*strfrmt++) { - case 'c': { - checkformat(L, form, L_FMTFLAGSC, 0); - nb = l_sprintf(buff, maxitem, form, (int)luaL_checkinteger(L, arg)); - break; - } - case 'd': case 'i': - flags = L_FMTFLAGSI; - goto intcase; - case 'u': - flags = L_FMTFLAGSU; - goto intcase; - case 'o': case 'x': case 'X': - flags = L_FMTFLAGSX; - intcase: { - lua_Integer n = luaL_checkinteger(L, arg); - checkformat(L, form, flags, 1); - addlenmod(form, LUA_INTEGER_FRMLEN); - nb = l_sprintf(buff, maxitem, form, (LUAI_UACINT)n); - break; - } - case 'a': case 'A': - checkformat(L, form, L_FMTFLAGSF, 1); - addlenmod(form, LUA_NUMBER_FRMLEN); - nb = lua_number2strx(L, buff, maxitem, form, - luaL_checknumber(L, arg)); - break; - case 'f': - maxitem = MAX_ITEMF; /* extra space for '%f' */ - buff = luaL_prepbuffsize(&b, maxitem); - /* FALLTHROUGH */ - case 'e': case 'E': case 'g': case 'G': { - lua_Number n = luaL_checknumber(L, arg); - checkformat(L, form, L_FMTFLAGSF, 1); - addlenmod(form, LUA_NUMBER_FRMLEN); - nb = l_sprintf(buff, maxitem, form, (LUAI_UACNUMBER)n); - break; - } - case 'p': { - const void *p = lua_topointer(L, arg); - checkformat(L, form, L_FMTFLAGSC, 0); - if (p == NULL) { /* avoid calling 'printf' with argument NULL */ - p = "(null)"; /* result */ - form[strlen(form) - 1] = 's'; /* format it as a string */ - } - nb = l_sprintf(buff, maxitem, form, p); - break; - } - case 'q': { - if (form[2] != '\0') /* modifiers? */ - return luaL_error(L, "specifier '%%q' cannot have modifiers"); - addliteral(L, &b, arg); - break; - } - case 's': { - size_t l; - const char *s = luaL_tolstring(L, arg, &l); - if (form[2] == '\0') /* no modifiers? */ - luaL_addvalue(&b); /* keep entire string */ - else { - luaL_argcheck(L, l == strlen(s), arg, "string contains zeros"); - checkformat(L, form, L_FMTFLAGSC, 1); - if (strchr(form, '.') == NULL && l >= 100) { - /* no precision and string is too long to be formatted */ - luaL_addvalue(&b); /* keep entire string */ - } - else { /* format the string into 'buff' */ - nb = l_sprintf(buff, maxitem, form, s); - lua_pop(L, 1); /* remove result from 'luaL_tolstring' */ - } - } - break; - } - default: { /* also treat cases 'pnLlh' */ - return luaL_error(L, "invalid conversion '%s' to 'format'", form); - } - } - lua_assert(nb < maxitem); - luaL_addsize(&b, nb); - } - } - luaL_pushresult(&b); - return 1; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** PACK/UNPACK -** ======================================================= -*/ - - -/* value used for padding */ -#if !defined(LUAL_PACKPADBYTE) -#define LUAL_PACKPADBYTE 0x00 -#endif - -/* maximum size for the binary representation of an integer */ -#define MAXINTSIZE 16 - -/* number of bits in a character */ -#define NB CHAR_BIT - -/* mask for one character (NB 1's) */ -#define MC ((1 << NB) - 1) - -/* size of a lua_Integer */ -#define SZINT ((int)sizeof(lua_Integer)) - - -/* dummy union to get native endianness */ -static const union { - int dummy; - char little; /* true iff machine is little endian */ -} nativeendian = {1}; - - -/* -** information to pack/unpack stuff -*/ -typedef struct Header { - lua_State *L; - int islittle; - int maxalign; -} Header; - - -/* -** options for pack/unpack -*/ -typedef enum KOption { - Kint, /* signed integers */ - Kuint, /* unsigned integers */ - Kfloat, /* single-precision floating-point numbers */ - Knumber, /* Lua "native" floating-point numbers */ - Kdouble, /* double-precision floating-point numbers */ - Kchar, /* fixed-length strings */ - Kstring, /* strings with prefixed length */ - Kzstr, /* zero-terminated strings */ - Kpadding, /* padding */ - Kpaddalign, /* padding for alignment */ - Knop /* no-op (configuration or spaces) */ -} KOption; - - -/* -** Read an integer numeral from string 'fmt' or return 'df' if -** there is no numeral -*/ -static int digit (int c) { return '0' <= c && c <= '9'; } - -static int getnum (const char **fmt, int df) { - if (!digit(**fmt)) /* no number? */ - return df; /* return default value */ - else { - int a = 0; - do { - a = a*10 + (*((*fmt)++) - '0'); - } while (digit(**fmt) && a <= ((int)MAXSIZE - 9)/10); - return a; - } -} - - -/* -** Read an integer numeral and raises an error if it is larger -** than the maximum size for integers. -*/ -static int getnumlimit (Header *h, const char **fmt, int df) { - int sz = getnum(fmt, df); - if (l_unlikely(sz > MAXINTSIZE || sz <= 0)) - return luaL_error(h->L, "integral size (%d) out of limits [1,%d]", - sz, MAXINTSIZE); - return sz; -} - - -/* -** Initialize Header -*/ -static void initheader (lua_State *L, Header *h) { - h->L = L; - h->islittle = nativeendian.little; - h->maxalign = 1; -} - - -/* -** Read and classify next option. 'size' is filled with option's size. -*/ -static KOption getoption (Header *h, const char **fmt, int *size) { - /* dummy structure to get native alignment requirements */ - struct cD { char c; union { LUAI_MAXALIGN; } u; }; - int opt = *((*fmt)++); - *size = 0; /* default */ - switch (opt) { - case 'b': *size = sizeof(char); return Kint; - case 'B': *size = sizeof(char); return Kuint; - case 'h': *size = sizeof(short); return Kint; - case 'H': *size = sizeof(short); return Kuint; - case 'l': *size = sizeof(long); return Kint; - case 'L': *size = sizeof(long); return Kuint; - case 'j': *size = sizeof(lua_Integer); return Kint; - case 'J': *size = sizeof(lua_Integer); return Kuint; - case 'T': *size = sizeof(size_t); return Kuint; - case 'f': *size = sizeof(float); return Kfloat; - case 'n': *size = sizeof(lua_Number); return Knumber; - case 'd': *size = sizeof(double); return Kdouble; - case 'i': *size = getnumlimit(h, fmt, sizeof(int)); return Kint; - case 'I': *size = getnumlimit(h, fmt, sizeof(int)); return Kuint; - case 's': *size = getnumlimit(h, fmt, sizeof(size_t)); return Kstring; - case 'c': - *size = getnum(fmt, -1); - if (l_unlikely(*size == -1)) - luaL_error(h->L, "missing size for format option 'c'"); - return Kchar; - case 'z': return Kzstr; - case 'x': *size = 1; return Kpadding; - case 'X': return Kpaddalign; - case ' ': break; - case '<': h->islittle = 1; break; - case '>': h->islittle = 0; break; - case '=': h->islittle = nativeendian.little; break; - case '!': { - const int maxalign = offsetof(struct cD, u); - h->maxalign = getnumlimit(h, fmt, maxalign); - break; - } - default: luaL_error(h->L, "invalid format option '%c'", opt); - } - return Knop; -} - - -/* -** Read, classify, and fill other details about the next option. -** 'psize' is filled with option's size, 'notoalign' with its -** alignment requirements. -** Local variable 'size' gets the size to be aligned. (Kpadal option -** always gets its full alignment, other options are limited by -** the maximum alignment ('maxalign'). Kchar option needs no alignment -** despite its size. -*/ -static KOption getdetails (Header *h, size_t totalsize, - const char **fmt, int *psize, int *ntoalign) { - KOption opt = getoption(h, fmt, psize); - int align = *psize; /* usually, alignment follows size */ - if (opt == Kpaddalign) { /* 'X' gets alignment from following option */ - if (**fmt == '\0' || getoption(h, fmt, &align) == Kchar || align == 0) - luaL_argerror(h->L, 1, "invalid next option for option 'X'"); - } - if (align <= 1 || opt == Kchar) /* need no alignment? */ - *ntoalign = 0; - else { - if (align > h->maxalign) /* enforce maximum alignment */ - align = h->maxalign; - if (l_unlikely((align & (align - 1)) != 0)) /* not a power of 2? */ - luaL_argerror(h->L, 1, "format asks for alignment not power of 2"); - *ntoalign = (align - (int)(totalsize & (align - 1))) & (align - 1); - } - return opt; -} - - -/* -** Pack integer 'n' with 'size' bytes and 'islittle' endianness. -** The final 'if' handles the case when 'size' is larger than -** the size of a Lua integer, correcting the extra sign-extension -** bytes if necessary (by default they would be zeros). -*/ -static void packint (luaL_Buffer *b, lua_Unsigned n, - int islittle, int size, int neg) { - char *buff = luaL_prepbuffsize(b, size); - int i; - buff[islittle ? 0 : size - 1] = (char)(n & MC); /* first byte */ - for (i = 1; i < size; i++) { - n >>= NB; - buff[islittle ? i : size - 1 - i] = (char)(n & MC); - } - if (neg && size > SZINT) { /* negative number need sign extension? */ - for (i = SZINT; i < size; i++) /* correct extra bytes */ - buff[islittle ? i : size - 1 - i] = (char)MC; - } - luaL_addsize(b, size); /* add result to buffer */ -} - - -/* -** Copy 'size' bytes from 'src' to 'dest', correcting endianness if -** given 'islittle' is different from native endianness. -*/ -static void copywithendian (char *dest, const char *src, - int size, int islittle) { - if (islittle == nativeendian.little) - memcpy(dest, src, size); - else { - dest += size - 1; - while (size-- != 0) - *(dest--) = *(src++); - } -} - - -static int str_pack (lua_State *L) { - luaL_Buffer b; - Header h; - const char *fmt = luaL_checkstring(L, 1); /* format string */ - int arg = 1; /* current argument to pack */ - size_t totalsize = 0; /* accumulate total size of result */ - initheader(L, &h); - lua_pushnil(L); /* mark to separate arguments from string buffer */ - luaL_buffinit(L, &b); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, totalsize, &fmt, &size, &ntoalign); - totalsize += ntoalign + size; - while (ntoalign-- > 0) - luaL_addchar(&b, LUAL_PACKPADBYTE); /* fill alignment */ - arg++; - switch (opt) { - case Kint: { /* signed integers */ - lua_Integer n = luaL_checkinteger(L, arg); - if (size < SZINT) { /* need overflow check? */ - lua_Integer lim = (lua_Integer)1 << ((size * NB) - 1); - luaL_argcheck(L, -lim <= n && n < lim, arg, "integer overflow"); - } - packint(&b, (lua_Unsigned)n, h.islittle, size, (n < 0)); - break; - } - case Kuint: { /* unsigned integers */ - lua_Integer n = luaL_checkinteger(L, arg); - if (size < SZINT) /* need overflow check? */ - luaL_argcheck(L, (lua_Unsigned)n < ((lua_Unsigned)1 << (size * NB)), - arg, "unsigned overflow"); - packint(&b, (lua_Unsigned)n, h.islittle, size, 0); - break; - } - case Kfloat: { /* C float */ - float f = (float)luaL_checknumber(L, arg); /* get argument */ - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - /* move 'f' to final result, correcting endianness if needed */ - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Knumber: { /* Lua float */ - lua_Number f = luaL_checknumber(L, arg); /* get argument */ - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - /* move 'f' to final result, correcting endianness if needed */ - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Kdouble: { /* C double */ - double f = (double)luaL_checknumber(L, arg); /* get argument */ - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - /* move 'f' to final result, correcting endianness if needed */ - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Kchar: { /* fixed-size string */ - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, len <= (size_t)size, arg, - "string longer than given size"); - luaL_addlstring(&b, s, len); /* add string */ - while (len++ < (size_t)size) /* pad extra space */ - luaL_addchar(&b, LUAL_PACKPADBYTE); - break; - } - case Kstring: { /* strings with length count */ - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, size >= (int)sizeof(size_t) || - len < ((size_t)1 << (size * NB)), - arg, "string length does not fit in given size"); - packint(&b, (lua_Unsigned)len, h.islittle, size, 0); /* pack length */ - luaL_addlstring(&b, s, len); - totalsize += len; - break; - } - case Kzstr: { /* zero-terminated string */ - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, strlen(s) == len, arg, "string contains zeros"); - luaL_addlstring(&b, s, len); - luaL_addchar(&b, '\0'); /* add zero at the end */ - totalsize += len + 1; - break; - } - case Kpadding: luaL_addchar(&b, LUAL_PACKPADBYTE); /* FALLTHROUGH */ - case Kpaddalign: case Knop: - arg--; /* undo increment */ - break; - } - } - luaL_pushresult(&b); - return 1; -} - - -static int str_packsize (lua_State *L) { - Header h; - const char *fmt = luaL_checkstring(L, 1); /* format string */ - size_t totalsize = 0; /* accumulate total size of result */ - initheader(L, &h); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, totalsize, &fmt, &size, &ntoalign); - luaL_argcheck(L, opt != Kstring && opt != Kzstr, 1, - "variable-length format"); - size += ntoalign; /* total space used by option */ - luaL_argcheck(L, totalsize <= MAXSIZE - size, 1, - "format result too large"); - totalsize += size; - } - lua_pushinteger(L, (lua_Integer)totalsize); - return 1; -} - - -/* -** Unpack an integer with 'size' bytes and 'islittle' endianness. -** If size is smaller than the size of a Lua integer and integer -** is signed, must do sign extension (propagating the sign to the -** higher bits); if size is larger than the size of a Lua integer, -** it must check the unread bytes to see whether they do not cause an -** overflow. -*/ -static lua_Integer unpackint (lua_State *L, const char *str, - int islittle, int size, int issigned) { - lua_Unsigned res = 0; - int i; - int limit = (size <= SZINT) ? size : SZINT; - for (i = limit - 1; i >= 0; i--) { - res <<= NB; - res |= (lua_Unsigned)(unsigned char)str[islittle ? i : size - 1 - i]; - } - if (size < SZINT) { /* real size smaller than lua_Integer? */ - if (issigned) { /* needs sign extension? */ - lua_Unsigned mask = (lua_Unsigned)1 << (size*NB - 1); - res = ((res ^ mask) - mask); /* do sign extension */ - } - } - else if (size > SZINT) { /* must check unread bytes */ - int mask = (!issigned || (lua_Integer)res >= 0) ? 0 : MC; - for (i = limit; i < size; i++) { - if (l_unlikely((unsigned char)str[islittle ? i : size - 1 - i] != mask)) - luaL_error(L, "%d-byte integer does not fit into Lua Integer", size); - } - } - return (lua_Integer)res; -} - - -static int str_unpack (lua_State *L) { - Header h; - const char *fmt = luaL_checkstring(L, 1); - size_t ld; - const char *data = luaL_checklstring(L, 2, &ld); - size_t pos = posrelatI(luaL_optinteger(L, 3, 1), ld) - 1; - int n = 0; /* number of results */ - luaL_argcheck(L, pos <= ld, 3, "initial position out of string"); - initheader(L, &h); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, pos, &fmt, &size, &ntoalign); - luaL_argcheck(L, (size_t)ntoalign + size <= ld - pos, 2, - "data string too short"); - pos += ntoalign; /* skip alignment */ - /* stack space for item + next position */ - luaL_checkstack(L, 2, "too many results"); - n++; - switch (opt) { - case Kint: - case Kuint: { - lua_Integer res = unpackint(L, data + pos, h.islittle, size, - (opt == Kint)); - lua_pushinteger(L, res); - break; - } - case Kfloat: { - float f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, (lua_Number)f); - break; - } - case Knumber: { - lua_Number f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, f); - break; - } - case Kdouble: { - double f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, (lua_Number)f); - break; - } - case Kchar: { - lua_pushlstring(L, data + pos, size); - break; - } - case Kstring: { - size_t len = (size_t)unpackint(L, data + pos, h.islittle, size, 0); - luaL_argcheck(L, len <= ld - pos - size, 2, "data string too short"); - lua_pushlstring(L, data + pos + size, len); - pos += len; /* skip string */ - break; - } - case Kzstr: { - size_t len = strlen(data + pos); - luaL_argcheck(L, pos + len < ld, 2, - "unfinished string for format 'z'"); - lua_pushlstring(L, data + pos, len); - pos += len + 1; /* skip string plus final '\0' */ - break; - } - case Kpaddalign: case Kpadding: case Knop: - n--; /* undo increment */ - break; - } - pos += size; - } - lua_pushinteger(L, pos + 1); /* next position */ - return n + 1; -} - -/* }====================================================== */ - - -static const luaL_Reg strlib[] = { - {"byte", str_byte}, - {"char", str_char}, - {"dump", str_dump}, - {"find", str_find}, - {"format", str_format}, - {"gmatch", gmatch}, - {"gsub", str_gsub}, - {"len", str_len}, - {"lower", str_lower}, - {"match", str_match}, - {"rep", str_rep}, - {"reverse", str_reverse}, - {"sub", str_sub}, - {"upper", str_upper}, - {"pack", str_pack}, - {"packsize", str_packsize}, - {"unpack", str_unpack}, - {NULL, NULL} -}; - - -static void createmetatable (lua_State *L) { - /* table to be metatable for strings */ - luaL_newlibtable(L, stringmetamethods); - luaL_setfuncs(L, stringmetamethods, 0); - lua_pushliteral(L, ""); /* dummy string */ - lua_pushvalue(L, -2); /* copy table */ - lua_setmetatable(L, -2); /* set table as metatable for strings */ - lua_pop(L, 1); /* pop dummy string */ - lua_pushvalue(L, -2); /* get string library */ - lua_setfield(L, -2, "__index"); /* metatable.__index = string */ - lua_pop(L, 1); /* pop metatable */ -} - - -/* -** Open string library -*/ -LUAMOD_API int luaopen_string (lua_State *L) { - luaL_newlib(L, strlib); - createmetatable(L); - return 1; -} - diff --git a/src/dependencies/lua/ltable.c b/src/dependencies/lua/ltable.c deleted file mode 100644 index 2295ddc..0000000 --- a/src/dependencies/lua/ltable.c +++ /dev/null @@ -1,1256 +0,0 @@ -/* -** $Id: ltable.c $ -** Lua tables (hash) -** See Copyright Notice in lua.h -*/ - -#define ltable_c -#define LUA_CORE - -#include "lprefix.h" - - -/* -** Implementation of tables (aka arrays, objects, or hash tables). -** Tables keep its elements in two parts: an array part and a hash part. -** Non-negative integer keys are all candidates to be kept in the array -** part. The actual size of the array is the largest 'n' such that -** more than half the slots between 1 and n are in use. -** Hash uses a mix of chained scatter table with Brent's variation. -** A main invariant of these tables is that, if an element is not -** in its main position (i.e. the 'original' position that its hash gives -** to it), then the colliding element is in its own main position. -** Hence even when the load factor reaches 100%, performance remains good. -*/ - -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "lvm.h" - - -/* -** Only tables with hash parts larger than 2^LIMFORLAST has a 'lastfree' -** field that optimizes finding a free slot. That field is stored just -** before the array of nodes, in the same block. Smaller tables do a -** complete search when looking for a free slot. -*/ -#define LIMFORLAST 2 /* log2 of real limit */ - -/* -** The union 'Limbox' stores 'lastfree' and ensures that what follows it -** is properly aligned to store a Node. -*/ -typedef struct { Node *dummy; Node follows_pNode; } Limbox_aux; - -typedef union { - Node *lastfree; - char padding[offsetof(Limbox_aux, follows_pNode)]; -} Limbox; - -#define haslastfree(t) ((t)->lsizenode > LIMFORLAST) -#define getlastfree(t) ((cast(Limbox *, (t)->node) - 1)->lastfree) - - -/* -** MAXABITS is the largest integer such that 2^MAXABITS fits in an -** unsigned int. -*/ -#define MAXABITS cast_int(sizeof(int) * CHAR_BIT - 1) - - -/* -** MAXASIZEB is the maximum number of elements in the array part such -** that the size of the array fits in 'size_t'. -*/ -#define MAXASIZEB ((MAX_SIZET/sizeof(ArrayCell)) * NM) - - -/* -** MAXASIZE is the maximum size of the array part. It is the minimum -** between 2^MAXABITS and MAXASIZEB. -*/ -#define MAXASIZE \ - (((1u << MAXABITS) < MAXASIZEB) ? (1u << MAXABITS) : cast_uint(MAXASIZEB)) - -/* -** MAXHBITS is the largest integer such that 2^MAXHBITS fits in a -** signed int. -*/ -#define MAXHBITS (MAXABITS - 1) - - -/* -** MAXHSIZE is the maximum size of the hash part. It is the minimum -** between 2^MAXHBITS and the maximum size such that, measured in bytes, -** it fits in a 'size_t'. -*/ -#define MAXHSIZE luaM_limitN(1u << MAXHBITS, Node) - - -/* -** When the original hash value is good, hashing by a power of 2 -** avoids the cost of '%'. -*/ -#define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t)))) - -/* -** for other types, it is better to avoid modulo by power of 2, as -** they can have many 2 factors. -*/ -#define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1)))) - - -#define hashstr(t,str) hashpow2(t, (str)->hash) -#define hashboolean(t,p) hashpow2(t, p) - - -#define hashpointer(t,p) hashmod(t, point2uint(p)) - - -#define dummynode (&dummynode_) - -static const Node dummynode_ = { - {{NULL}, LUA_VEMPTY, /* value's value and type */ - LUA_VNIL, 0, {NULL}} /* key type, next, and key value */ -}; - - -static const TValue absentkey = {ABSTKEYCONSTANT}; - - -/* -** Hash for integers. To allow a good hash, use the remainder operator -** ('%'). If integer fits as a non-negative int, compute an int -** remainder, which is faster. Otherwise, use an unsigned-integer -** remainder, which uses all bits and ensures a non-negative result. -*/ -static Node *hashint (const Table *t, lua_Integer i) { - lua_Unsigned ui = l_castS2U(i); - if (ui <= cast_uint(INT_MAX)) - return hashmod(t, cast_int(ui)); - else - return hashmod(t, ui); -} - - -/* -** Hash for floating-point numbers. -** The main computation should be just -** n = frexp(n, &i); return (n * INT_MAX) + i -** but there are some numerical subtleties. -** In a two-complement representation, INT_MAX does not has an exact -** representation as a float, but INT_MIN does; because the absolute -** value of 'frexp' is smaller than 1 (unless 'n' is inf/NaN), the -** absolute value of the product 'frexp * -INT_MIN' is smaller or equal -** to INT_MAX. Next, the use of 'unsigned int' avoids overflows when -** adding 'i'; the use of '~u' (instead of '-u') avoids problems with -** INT_MIN. -*/ -#if !defined(l_hashfloat) -static int l_hashfloat (lua_Number n) { - int i; - lua_Integer ni; - n = l_mathop(private_lua_cembed_frexp)(n, &i) * -cast_num(INT_MIN); - if (!lua_numbertointeger(n, &ni)) { /* is 'n' inf/-inf/NaN? */ - lua_assert(luai_numisnan(n) || l_mathop(fabs)(n) == cast_num(HUGE_VAL)); - return 0; - } - else { /* normal case */ - unsigned int u = cast_uint(i) + cast_uint(ni); - return cast_int(u <= cast_uint(INT_MAX) ? u : ~u); - } -} -#endif - - -/* -** returns the 'main' position of an element in a table (that is, -** the index of its hash value). -*/ -static Node *mainpositionTV (const Table *t, const TValue *key) { - switch (ttypetag(key)) { - case LUA_VNUMINT: { - lua_Integer i = ivalue(key); - return hashint(t, i); - } - case LUA_VNUMFLT: { - lua_Number n = fltvalue(key); - return hashmod(t, l_hashfloat(n)); - } - case LUA_VSHRSTR: { - TString *ts = tsvalue(key); - return hashstr(t, ts); - } - case LUA_VLNGSTR: { - TString *ts = tsvalue(key); - return hashpow2(t, luaS_hashlongstr(ts)); - } - case LUA_VFALSE: - return hashboolean(t, 0); - case LUA_VTRUE: - return hashboolean(t, 1); - case LUA_VLIGHTUSERDATA: { - void *p = pvalue(key); - return hashpointer(t, p); - } - case LUA_VLCF: { - lua_CFunction f = fvalue(key); - return hashpointer(t, f); - } - default: { - GCObject *o = gcvalue(key); - return hashpointer(t, o); - } - } -} - - -l_sinline Node *mainpositionfromnode (const Table *t, Node *nd) { - TValue key; - getnodekey(cast(lua_State *, NULL), &key, nd); - return mainpositionTV(t, &key); -} - - -/* -** Check whether key 'k1' is equal to the key in node 'n2'. This -** equality is raw, so there are no metamethods. Floats with integer -** values have been normalized, so integers cannot be equal to -** floats. It is assumed that 'eqshrstr' is simply pointer equality, so -** that short strings are handled in the default case. -** A true 'deadok' means to accept dead keys as equal to their original -** values. All dead keys are compared in the default case, by pointer -** identity. (Only collectable objects can produce dead keys.) Note that -** dead long strings are also compared by identity. -** Once a key is dead, its corresponding value may be collected, and -** then another value can be created with the same address. If this -** other value is given to 'next', 'equalkey' will signal a false -** positive. In a regular traversal, this situation should never happen, -** as all keys given to 'next' came from the table itself, and therefore -** could not have been collected. Outside a regular traversal, we -** have garbage in, garbage out. What is relevant is that this false -** positive does not break anything. (In particular, 'next' will return -** some other valid item on the table or nil.) -*/ -static int equalkey (const TValue *k1, const Node *n2, int deadok) { - if ((rawtt(k1) != keytt(n2)) && /* not the same variants? */ - !(deadok && keyisdead(n2) && iscollectable(k1))) - return 0; /* cannot be same key */ - switch (keytt(n2)) { - case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: - return 1; - case LUA_VNUMINT: - return (ivalue(k1) == keyival(n2)); - case LUA_VNUMFLT: - return luai_numeq(fltvalue(k1), fltvalueraw(keyval(n2))); - case LUA_VLIGHTUSERDATA: - return pvalue(k1) == pvalueraw(keyval(n2)); - case LUA_VLCF: - return fvalue(k1) == fvalueraw(keyval(n2)); - case ctb(LUA_VLNGSTR): - return luaS_eqlngstr(tsvalue(k1), keystrval(n2)); - default: - return gcvalue(k1) == gcvalueraw(keyval(n2)); - } -} - - -/* -** True if value of 'alimit' is equal to the real size of the array -** part of table 't'. (Otherwise, the array part must be larger than -** 'alimit'.) -*/ -#define limitequalsasize(t) (isrealasize(t) || ispow2((t)->alimit)) - - -/* -** Returns the real size of the 'array' array -*/ -LUAI_FUNC unsigned int luaH_realasize (const Table *t) { - if (limitequalsasize(t)) - return t->alimit; /* this is the size */ - else { - unsigned int size = t->alimit; - /* compute the smallest power of 2 not smaller than 'size' */ - size |= (size >> 1); - size |= (size >> 2); - size |= (size >> 4); - size |= (size >> 8); -#if (UINT_MAX >> 14) > 3 /* unsigned int has more than 16 bits */ - size |= (size >> 16); -#if (UINT_MAX >> 30) > 3 - size |= (size >> 32); /* unsigned int has more than 32 bits */ -#endif -#endif - size++; - lua_assert(ispow2(size) && size/2 < t->alimit && t->alimit < size); - return size; - } -} - - -/* -** Check whether real size of the array is a power of 2. -** (If it is not, 'alimit' cannot be changed to any other value -** without changing the real size.) -*/ -static int ispow2realasize (const Table *t) { - return (!isrealasize(t) || ispow2(t->alimit)); -} - - -static unsigned int setlimittosize (Table *t) { - t->alimit = luaH_realasize(t); - setrealasize(t); - return t->alimit; -} - - -#define limitasasize(t) check_exp(isrealasize(t), t->alimit) - - - -/* -** "Generic" get version. (Not that generic: not valid for integers, -** which may be in array part, nor for floats with integral values.) -** See explanation about 'deadok' in function 'equalkey'. -*/ -static const TValue *getgeneric (Table *t, const TValue *key, int deadok) { - Node *n = mainpositionTV(t, key); - for (;;) { /* check whether 'key' is somewhere in the chain */ - if (equalkey(key, n, deadok)) - return gval(n); /* that's it */ - else { - int nx = gnext(n); - if (nx == 0) - return &absentkey; /* not found */ - n += nx; - } - } -} - - -/* -** returns the index for 'k' if 'k' is an appropriate key to live in -** the array part of a table, 0 otherwise. -*/ -static unsigned int arrayindex (lua_Integer k) { - if (l_castS2U(k) - 1u < MAXASIZE) /* 'k' in [1, MAXASIZE]? */ - return cast_uint(k); /* 'key' is an appropriate array index */ - else - return 0; -} - - -/* -** returns the index of a 'key' for table traversals. First goes all -** elements in the array part, then elements in the hash part. The -** beginning of a traversal is signaled by 0. -*/ -static unsigned findindex (lua_State *L, Table *t, TValue *key, - unsigned asize) { - unsigned int i; - if (ttisnil(key)) return 0; /* first iteration */ - i = ttisinteger(key) ? arrayindex(ivalue(key)) : 0; - if (i - 1u < asize) /* is 'key' inside array part? */ - return i; /* yes; that's the index */ - else { - const TValue *n = getgeneric(t, key, 1); - if (l_unlikely(isabstkey(n))) - luaG_runerror(L, "invalid key to 'next'"); /* key not found */ - i = cast_int(nodefromval(n) - gnode(t, 0)); /* key index in hash table */ - /* hash elements are numbered after array ones */ - return (i + 1) + asize; - } -} - - -int luaH_next (lua_State *L, Table *t, StkId key) { - unsigned int asize = luaH_realasize(t); - unsigned int i = findindex(L, t, s2v(key), asize); /* find original key */ - for (; i < asize; i++) { /* try first array part */ - int tag = *getArrTag(t, i); - if (!tagisempty(tag)) { /* a non-empty entry? */ - setivalue(s2v(key), i + 1); - farr2val(t, i + 1, tag, s2v(key + 1)); - return 1; - } - } - for (i -= asize; cast_int(i) < sizenode(t); i++) { /* hash part */ - if (!isempty(gval(gnode(t, i)))) { /* a non-empty entry? */ - Node *n = gnode(t, i); - getnodekey(L, s2v(key), n); - setobj2s(L, key + 1, gval(n)); - return 1; - } - } - return 0; /* no more elements */ -} - - -static void freehash (lua_State *L, Table *t) { - if (!isdummy(t)) { - size_t bsize = sizenode(t) * sizeof(Node); /* 'node' size in bytes */ - char *arr = cast_charp(t->node); - if (haslastfree(t)) { - bsize += sizeof(Limbox); - arr -= sizeof(Limbox); - } - luaM_freearray(L, arr, bsize); - } -} - - -/* -** Check whether an integer key is in the array part. If 'alimit' is -** not the real size of the array, the key still can be in the array -** part. In this case, do the "Xmilia trick" to check whether 'key-1' -** is smaller than the real size. -** The trick works as follow: let 'p' be the integer such that -** '2^(p+1) >= alimit > 2^p', or '2^(p+1) > alimit-1 >= 2^p'. That is, -** 'p' is the highest 1-bit in 'alimit-1', and 2^(p+1) is the real size -** of the array. What we have to check becomes 'key-1 < 2^(p+1)'. We -** compute '(key-1) & ~(alimit-1)', which we call 'res'; it will have -** the 'p' bit cleared. (It may also clear other bits smaller than 'p', -** but no bit higher than 'p'.) If the key is outside the array, that -** is, 'key-1 >= 2^(p+1)', then 'res' will have some 1-bit higher than -** 'p', therefore it will be larger or equal to 'alimit', and the check -** will fail. If 'key-1 < 2^(p+1)', then 'res' has no 1-bit higher than -** 'p', and as the bit 'p' itself was cleared, 'res' will be smaller -** than 2^p, therefore smaller than 'alimit', and the check succeeds. -** As special cases, when 'alimit' is 0 the condition is trivially false, -** and when 'alimit' is 1 the condition simplifies to 'key-1 < alimit'. -** If key is 0 or negative, 'res' will have its higher bit on, so that -** it cannot be smaller than 'alimit'. -*/ -static int keyinarray (Table *t, lua_Integer key) { - lua_Unsigned alimit = t->alimit; - if (l_castS2U(key) - 1u < alimit) /* 'key' in [1, t->alimit]? */ - return 1; - else if (!isrealasize(t) && /* key still may be in the array part? */ - (((l_castS2U(key) - 1u) & ~(alimit - 1u)) < alimit)) { - t->alimit = cast_uint(key); /* probably '#t' is here now */ - return 1; - } - else - return 0; -} - - -/* -** {============================================================= -** Rehash -** ============================================================== -*/ - -/* -** Compute the optimal size for the array part of table 't'. 'nums' is a -** "count array" where 'nums[i]' is the number of integers in the table -** between 2^(i - 1) + 1 and 2^i. 'pna' enters with the total number of -** integer keys in the table and leaves with the number of keys that -** will go to the array part; return the optimal size. (The condition -** 'twotoi > 0' in the for loop stops the loop if 'twotoi' overflows.) -*/ -static unsigned computesizes (unsigned nums[], unsigned *pna) { - int i; - unsigned int twotoi; /* 2^i (candidate for optimal size) */ - unsigned int a = 0; /* number of elements smaller than 2^i */ - unsigned int na = 0; /* number of elements to go to array part */ - unsigned int optimal = 0; /* optimal size for array part */ - /* loop while keys can fill more than half of total size */ - for (i = 0, twotoi = 1; - twotoi > 0 && *pna > twotoi / 2; - i++, twotoi *= 2) { - a += nums[i]; - if (a > twotoi/2) { /* more than half elements present? */ - optimal = twotoi; /* optimal size (till now) */ - na = a; /* all elements up to 'optimal' will go to array part */ - } - } - lua_assert((optimal == 0 || optimal / 2 < na) && na <= optimal); - *pna = na; - return optimal; -} - - -static int countint (lua_Integer key, unsigned int *nums) { - unsigned int k = arrayindex(key); - if (k != 0) { /* is 'key' an appropriate array index? */ - nums[luaO_ceillog2(k)]++; /* count as such */ - return 1; - } - else - return 0; -} - - -l_sinline int arraykeyisempty (const Table *t, lua_Integer key) { - int tag = *getArrTag(t, key - 1); - return tagisempty(tag); -} - - -/* -** Count keys in array part of table 't': Fill 'nums[i]' with -** number of keys that will go into corresponding slice and return -** total number of non-nil keys. -*/ -static unsigned numusearray (const Table *t, unsigned *nums) { - int lg; - unsigned int ttlg; /* 2^lg */ - unsigned int ause = 0; /* summation of 'nums' */ - unsigned int i = 1; /* count to traverse all array keys */ - unsigned int asize = limitasasize(t); /* real array size */ - /* traverse each slice */ - for (lg = 0, ttlg = 1; lg <= MAXABITS; lg++, ttlg *= 2) { - unsigned int lc = 0; /* counter */ - unsigned int lim = ttlg; - if (lim > asize) { - lim = asize; /* adjust upper limit */ - if (i > lim) - break; /* no more elements to count */ - } - /* count elements in range (2^(lg - 1), 2^lg] */ - for (; i <= lim; i++) { - if (!arraykeyisempty(t, i)) - lc++; - } - nums[lg] += lc; - ause += lc; - } - return ause; -} - - -static int numusehash (const Table *t, unsigned *nums, unsigned *pna) { - int totaluse = 0; /* total number of elements */ - int ause = 0; /* elements added to 'nums' (can go to array part) */ - int i = sizenode(t); - while (i--) { - Node *n = &t->node[i]; - if (!isempty(gval(n))) { - if (keyisinteger(n)) - ause += countint(keyival(n), nums); - totaluse++; - } - } - *pna += ause; - return totaluse; -} - - -/* -** Convert an "abstract size" (number of slots in an array) to -** "concrete size" (number of bytes in the array). -** If the abstract size is not a multiple of NM, the last cell is -** incomplete, so we don't need to allocate memory for the whole cell. -** 'extra' computes how many values are not needed in that last cell. -** It will be zero when 'size' is a multiple of NM, and from there it -** increases as 'size' decreases, up to (NM - 1). -*/ -static size_t concretesize (unsigned int size) { - unsigned int numcells = (size + NM - 1) / NM; /* (size / NM) rounded up */ - unsigned int extra = NM - 1 - ((size + NM - 1) % NM); - return numcells * sizeof(ArrayCell) - extra * sizeof(Value); -} - - -static ArrayCell *resizearray (lua_State *L , Table *t, - unsigned oldasize, - unsigned newasize) { - size_t oldasizeb = concretesize(oldasize); - size_t newasizeb = concretesize(newasize); - void *a = luaM_reallocvector(L, t->array, oldasizeb, newasizeb, lu_byte); - return cast(ArrayCell*, a); -} - - -/* -** Creates an array for the hash part of a table with the given -** size, or reuses the dummy node if size is zero. -** The computation for size overflow is in two steps: the first -** comparison ensures that the shift in the second one does not -** overflow. -*/ -static void setnodevector (lua_State *L, Table *t, unsigned size) { - if (size == 0) { /* no elements to hash part? */ - t->node = cast(Node *, dummynode); /* use common 'dummynode' */ - t->lsizenode = 0; - setdummy(t); /* signal that it is using dummy node */ - } - else { - int i; - int lsize = luaO_ceillog2(size); - if (lsize > MAXHBITS || (1u << lsize) > MAXHSIZE) - luaG_runerror(L, "table overflow"); - size = twoto(lsize); - if (lsize <= LIMFORLAST) /* no 'lastfree' field? */ - t->node = luaM_newvector(L, size, Node); - else { - size_t bsize = size * sizeof(Node) + sizeof(Limbox); - char *node = luaM_newblock(L, bsize); - t->node = cast(Node *, node + sizeof(Limbox)); - getlastfree(t) = gnode(t, size); /* all positions are free */ - } - t->lsizenode = cast_byte(lsize); - setnodummy(t); - for (i = 0; i < cast_int(size); i++) { - Node *n = gnode(t, i); - gnext(n) = 0; - setnilkey(n); - setempty(gval(n)); - } - } -} - - -/* -** (Re)insert all elements from the hash part of 'ot' into table 't'. -*/ -static void reinsert (lua_State *L, Table *ot, Table *t) { - int j; - int size = sizenode(ot); - for (j = 0; j < size; j++) { - Node *old = gnode(ot, j); - if (!isempty(gval(old))) { - /* doesn't need barrier/invalidate cache, as entry was - already present in the table */ - TValue k; - getnodekey(L, &k, old); - luaH_set(L, t, &k, gval(old)); - } - } -} - - -/* -** Exchange the hash part of 't1' and 't2'. (In 'flags', only the -** dummy bit must be exchanged: The 'isrealasize' is not related -** to the hash part, and the metamethod bits do not change during -** a resize, so the "real" table can keep their values.) -*/ -static void exchangehashpart (Table *t1, Table *t2) { - lu_byte lsizenode = t1->lsizenode; - Node *node = t1->node; - int bitdummy1 = t1->flags & BITDUMMY; - t1->lsizenode = t2->lsizenode; - t1->node = t2->node; - t1->flags = (t1->flags & NOTBITDUMMY) | (t2->flags & BITDUMMY); - t2->lsizenode = lsizenode; - t2->node = node; - t2->flags = (t2->flags & NOTBITDUMMY) | bitdummy1; -} - - -/* -** Re-insert into the new hash part of a table the elements from the -** vanishing slice of the array part. -*/ -static void reinsertOldSlice (lua_State *L, Table *t, unsigned oldasize, - unsigned newasize) { - unsigned i; - t->alimit = newasize; /* pretend array has new size... */ - for (i = newasize; i < oldasize; i++) { /* traverse vanishing slice */ - int tag = *getArrTag(t, i); - if (!tagisempty(tag)) { /* a non-empty entry? */ - TValue aux; - farr2val(t, i + 1, tag, &aux); /* copy entry into 'aux' */ - luaH_setint(L, t, i + 1, &aux); /* re-insert it into the table */ - } - } - t->alimit = oldasize; /* restore current size... */ -} - - -/* -** Clear new slice of the array. -*/ -static void clearNewSlice (Table *t, unsigned oldasize, unsigned newasize) { - for (; oldasize < newasize; oldasize++) - *getArrTag(t, oldasize) = LUA_VEMPTY; -} - - -/* -** Resize table 't' for the new given sizes. Both allocations (for -** the hash part and for the array part) can fail, which creates some -** subtleties. If the first allocation, for the hash part, fails, an -** error is raised and that is it. Otherwise, it copies the elements from -** the shrinking part of the array (if it is shrinking) into the new -** hash. Then it reallocates the array part. If that fails, the table -** is in its original state; the function frees the new hash part and then -** raises the allocation error. Otherwise, it sets the new hash part -** into the table, initializes the new part of the array (if any) with -** nils and reinserts the elements of the old hash back into the new -** parts of the table. -*/ -void luaH_resize (lua_State *L, Table *t, unsigned newasize, - unsigned nhsize) { - Table newt; /* to keep the new hash part */ - unsigned int oldasize = setlimittosize(t); - ArrayCell *newarray; - if (newasize > MAXASIZE) - luaG_runerror(L, "table overflow"); - /* create new hash part with appropriate size into 'newt' */ - newt.flags = 0; - setnodevector(L, &newt, nhsize); - if (newasize < oldasize) { /* will array shrink? */ - /* re-insert into the new hash the elements from vanishing slice */ - exchangehashpart(t, &newt); /* pretend table has new hash */ - reinsertOldSlice(L, t, oldasize, newasize); - exchangehashpart(t, &newt); /* restore old hash (in case of errors) */ - } - /* allocate new array */ - newarray = resizearray(L, t, oldasize, newasize); - if (l_unlikely(newarray == NULL && newasize > 0)) { /* allocation failed? */ - freehash(L, &newt); /* release new hash part */ - luaM_error(L); /* raise error (with array unchanged) */ - } - /* allocation ok; initialize new part of the array */ - exchangehashpart(t, &newt); /* 't' has the new hash ('newt' has the old) */ - t->array = newarray; /* set new array part */ - t->alimit = newasize; - clearNewSlice(t, oldasize, newasize); - /* re-insert elements from old hash part into new parts */ - reinsert(L, &newt, t); /* 'newt' now has the old hash */ - freehash(L, &newt); /* free old hash part */ -} - - -void luaH_resizearray (lua_State *L, Table *t, unsigned int nasize) { - int nsize = allocsizenode(t); - luaH_resize(L, t, nasize, nsize); -} - -/* -** nums[i] = number of keys 'k' where 2^(i - 1) < k <= 2^i -*/ -static void rehash (lua_State *L, Table *t, const TValue *ek) { - unsigned int asize; /* optimal size for array part */ - unsigned int na; /* number of keys in the array part */ - unsigned int nums[MAXABITS + 1]; - int i; - int totaluse; - for (i = 0; i <= MAXABITS; i++) nums[i] = 0; /* reset counts */ - setlimittosize(t); - na = numusearray(t, nums); /* count keys in array part */ - totaluse = na; /* all those keys are integer keys */ - totaluse += numusehash(t, nums, &na); /* count keys in hash part */ - /* count extra key */ - if (ttisinteger(ek)) - na += countint(ivalue(ek), nums); - totaluse++; - /* compute new size for array part */ - asize = computesizes(nums, &na); - /* resize the table to new computed sizes */ - luaH_resize(L, t, asize, totaluse - na); -} - - - -/* -** }============================================================= -*/ - - -Table *luaH_new (lua_State *L) { - GCObject *o = luaC_newobj(L, LUA_VTABLE, sizeof(Table)); - Table *t = gco2t(o); - t->metatable = NULL; - t->flags = cast_byte(maskflags); /* table has no metamethod fields */ - t->array = NULL; - t->alimit = 0; - setnodevector(L, t, 0); - return t; -} - - -/* -** Frees a table. The assert ensures the correctness of 'concretesize', -** checking its result against the address of the last element in the -** array part of the table, computed abstractly. -*/ -void luaH_free (lua_State *L, Table *t) { - unsigned int realsize = luaH_realasize(t); - size_t sizeb = concretesize(realsize); - lua_assert((sizeb == 0 && realsize == 0) || - cast_charp(t->array) + sizeb - sizeof(Value) == - cast_charp(getArrVal(t, realsize - 1))); - freehash(L, t); - luaM_freemem(L, t->array, sizeb); - luaM_free(L, t); -} - - -static Node *getfreepos (Table *t) { - if (haslastfree(t)) { /* does it have 'lastfree' information? */ - /* look for a spot before 'lastfree', updating 'lastfree' */ - while (getlastfree(t) > t->node) { - Node *free = --getlastfree(t); - if (keyisnil(free)) - return free; - } - } - else { /* no 'lastfree' information */ - if (!isdummy(t)) { - int i = sizenode(t); - while (i--) { /* do a linear search */ - Node *free = gnode(t, i); - if (keyisnil(free)) - return free; - } - } - } - return NULL; /* could not find a free place */ -} - - - -/* -** Inserts a new key into a hash table; first, check whether key's main -** position is free. If not, check whether colliding node is in its main -** position or not: if it is not, move colliding node to an empty place -** and put new key in its main position; otherwise (colliding node is in -** its main position), new key goes to an empty position. -*/ -static void luaH_newkey (lua_State *L, Table *t, const TValue *key, - TValue *value) { - Node *mp; - TValue aux; - if (l_unlikely(ttisnil(key))) - luaG_runerror(L, "table index is nil"); - else if (ttisfloat(key)) { - lua_Number f = fltvalue(key); - lua_Integer k; - if (luaV_flttointeger(f, &k, F2Ieq)) { /* does key fit in an integer? */ - setivalue(&aux, k); - key = &aux; /* insert it as an integer */ - } - else if (l_unlikely(luai_numisnan(f))) - luaG_runerror(L, "table index is NaN"); - } - if (ttisnil(value)) - return; /* do not insert nil values */ - mp = mainpositionTV(t, key); - if (!isempty(gval(mp)) || isdummy(t)) { /* main position is taken? */ - Node *othern; - Node *f = getfreepos(t); /* get a free place */ - if (f == NULL) { /* cannot find a free place? */ - rehash(L, t, key); /* grow table */ - /* whatever called 'newkey' takes care of TM cache */ - luaH_set(L, t, key, value); /* insert key into grown table */ - return; - } - lua_assert(!isdummy(t)); - othern = mainpositionfromnode(t, mp); - if (othern != mp) { /* is colliding node out of its main position? */ - /* yes; move colliding node into free position */ - while (othern + gnext(othern) != mp) /* find previous */ - othern += gnext(othern); - gnext(othern) = cast_int(f - othern); /* rechain to point to 'f' */ - *f = *mp; /* copy colliding node into free pos. (mp->next also goes) */ - if (gnext(mp) != 0) { - gnext(f) += cast_int(mp - f); /* correct 'next' */ - gnext(mp) = 0; /* now 'mp' is free */ - } - setempty(gval(mp)); - } - else { /* colliding node is in its own main position */ - /* new node will go into free position */ - if (gnext(mp) != 0) - gnext(f) = cast_int((mp + gnext(mp)) - f); /* chain new position */ - else lua_assert(gnext(f) == 0); - gnext(mp) = cast_int(f - mp); - mp = f; - } - } - setnodekey(L, mp, key); - luaC_barrierback(L, obj2gco(t), key); - lua_assert(isempty(gval(mp))); - setobj2t(L, gval(mp), value); -} - - -static const TValue *getintfromhash (Table *t, lua_Integer key) { - Node *n = hashint(t, key); - lua_assert(l_castS2U(key) - 1u >= luaH_realasize(t)); - for (;;) { /* check whether 'key' is somewhere in the chain */ - if (keyisinteger(n) && keyival(n) == key) - return gval(n); /* that's it */ - else { - int nx = gnext(n); - if (nx == 0) break; - n += nx; - } - } - return &absentkey; -} - - -static int hashkeyisempty (Table *t, lua_Integer key) { - const TValue *val = getintfromhash(t, key); - return isempty(val); -} - - -static int finishnodeget (const TValue *val, TValue *res) { - if (!ttisnil(val)) { - setobj(((lua_State*)NULL), res, val); - } - return ttypetag(val); -} - - -int luaH_getint (Table *t, lua_Integer key, TValue *res) { - if (keyinarray(t, key)) { - int tag = *getArrTag(t, key - 1); - if (!tagisempty(tag)) - farr2val(t, key, tag, res); - return tag; - } - else - return finishnodeget(getintfromhash(t, key), res); -} - - -/* -** search function for short strings -*/ -const TValue *luaH_Hgetshortstr (Table *t, TString *key) { - Node *n = hashstr(t, key); - lua_assert(key->tt == LUA_VSHRSTR); - for (;;) { /* check whether 'key' is somewhere in the chain */ - if (keyisshrstr(n) && eqshrstr(keystrval(n), key)) - return gval(n); /* that's it */ - else { - int nx = gnext(n); - if (nx == 0) - return &absentkey; /* not found */ - n += nx; - } - } -} - - -int luaH_getshortstr (Table *t, TString *key, TValue *res) { - return finishnodeget(luaH_Hgetshortstr(t, key), res); -} - - -static const TValue *Hgetstr (Table *t, TString *key) { - if (key->tt == LUA_VSHRSTR) - return luaH_Hgetshortstr(t, key); - else { /* for long strings, use generic case */ - TValue ko; - setsvalue(cast(lua_State *, NULL), &ko, key); - return getgeneric(t, &ko, 0); - } -} - - -int luaH_getstr (Table *t, TString *key, TValue *res) { - return finishnodeget(Hgetstr(t, key), res); -} - - -TString *luaH_getstrkey (Table *t, TString *key) { - const TValue *o = Hgetstr(t, key); - if (!isabstkey(o)) /* string already present? */ - return keystrval(nodefromval(o)); /* get saved copy */ - else - return NULL; -} - - -/* -** main search function -*/ -int luaH_get (Table *t, const TValue *key, TValue *res) { - const TValue *slot; - switch (ttypetag(key)) { - case LUA_VSHRSTR: - slot = luaH_Hgetshortstr(t, tsvalue(key)); - break; - case LUA_VNUMINT: - return luaH_getint(t, ivalue(key), res); - case LUA_VNIL: - slot = &absentkey; - break; - case LUA_VNUMFLT: { - lua_Integer k; - if (luaV_flttointeger(fltvalue(key), &k, F2Ieq)) /* integral index? */ - return luaH_getint(t, k, res); /* use specialized version */ - /* else... */ - } /* FALLTHROUGH */ - default: - slot = getgeneric(t, key, 0); - break; - } - return finishnodeget(slot, res); -} - - -static int finishnodeset (Table *t, const TValue *slot, TValue *val) { - if (!ttisnil(slot)) { - setobj(((lua_State*)NULL), cast(TValue*, slot), val); - return HOK; /* success */ - } - else if (isabstkey(slot)) - return HNOTFOUND; /* no slot with that key */ - else /* return node encoded */ - return cast_int((cast(Node*, slot) - t->node)) + HFIRSTNODE; -} - - -static int rawfinishnodeset (const TValue *slot, TValue *val) { - if (isabstkey(slot)) - return 0; /* no slot with that key */ - else { - setobj(((lua_State*)NULL), cast(TValue*, slot), val); - return 1; /* success */ - } -} - - -int luaH_psetint (Table *t, lua_Integer key, TValue *val) { - if (keyinarray(t, key)) { - lu_byte *tag = getArrTag(t, key - 1); - if (!tagisempty(*tag) || checknoTM(t->metatable, TM_NEWINDEX)) { - fval2arr(t, key, tag, val); - return HOK; /* success */ - } - else - return ~cast_int(key); /* empty slot in the array part */ - } - else - return finishnodeset(t, getintfromhash(t, key), val); -} - - -int luaH_psetshortstr (Table *t, TString *key, TValue *val) { - return finishnodeset(t, luaH_Hgetshortstr(t, key), val); -} - - -int luaH_psetstr (Table *t, TString *key, TValue *val) { - return finishnodeset(t, Hgetstr(t, key), val); -} - - -int luaH_pset (Table *t, const TValue *key, TValue *val) { - switch (ttypetag(key)) { - case LUA_VSHRSTR: return luaH_psetshortstr(t, tsvalue(key), val); - case LUA_VNUMINT: return luaH_psetint(t, ivalue(key), val); - case LUA_VNIL: return HNOTFOUND; - case LUA_VNUMFLT: { - lua_Integer k; - if (luaV_flttointeger(fltvalue(key), &k, F2Ieq)) /* integral index? */ - return luaH_psetint(t, k, val); /* use specialized version */ - /* else... */ - } /* FALLTHROUGH */ - default: - return finishnodeset(t, getgeneric(t, key, 0), val); - } -} - -/* -** Finish a raw "set table" operation, where 'slot' is where the value -** should have been (the result of a previous "get table"). -** Beware: when using this function you probably need to check a GC -** barrier and invalidate the TM cache. -*/ - - -void luaH_finishset (lua_State *L, Table *t, const TValue *key, - TValue *value, int hres) { - lua_assert(hres != HOK); - if (hres == HNOTFOUND) { - luaH_newkey(L, t, key, value); - } - else if (hres > 0) { /* regular Node? */ - setobj2t(L, gval(gnode(t, hres - HFIRSTNODE)), value); - } - else { /* array entry */ - hres = ~hres; /* real index */ - obj2arr(t, hres, value); - } -} - - -/* -** beware: when using this function you probably need to check a GC -** barrier and invalidate the TM cache. -*/ -void luaH_set (lua_State *L, Table *t, const TValue *key, TValue *value) { - int hres = luaH_pset(t, key, value); - if (hres != HOK) - luaH_finishset(L, t, key, value, hres); -} - - -/* -** Ditto for a GC barrier. (No need to invalidate the TM cache, as -** integers cannot be keys to metamethods.) -*/ -void luaH_setint (lua_State *L, Table *t, lua_Integer key, TValue *value) { - if (keyinarray(t, key)) - obj2arr(t, key, value); - else { - int ok = rawfinishnodeset(getintfromhash(t, key), value); - if (!ok) { - TValue k; - setivalue(&k, key); - luaH_newkey(L, t, &k, value); - } - } -} - - -/* -** Try to find a boundary in the hash part of table 't'. From the -** caller, we know that 'j' is zero or present and that 'j + 1' is -** present. We want to find a larger key that is absent from the -** table, so that we can do a binary search between the two keys to -** find a boundary. We keep doubling 'j' until we get an absent index. -** If the doubling would overflow, we try LUA_MAXINTEGER. If it is -** absent, we are ready for the binary search. ('j', being max integer, -** is larger or equal to 'i', but it cannot be equal because it is -** absent while 'i' is present; so 'j > i'.) Otherwise, 'j' is a -** boundary. ('j + 1' cannot be a present integer key because it is -** not a valid integer in Lua.) -*/ -static lua_Unsigned hash_search (Table *t, lua_Unsigned j) { - lua_Unsigned i; - if (j == 0) j++; /* the caller ensures 'j + 1' is present */ - do { - i = j; /* 'i' is a present index */ - if (j <= l_castS2U(LUA_MAXINTEGER) / 2) - j *= 2; - else { - j = LUA_MAXINTEGER; - if (hashkeyisempty(t, j)) /* t[j] not present? */ - break; /* 'j' now is an absent index */ - else /* weird case */ - return j; /* well, max integer is a boundary... */ - } - } while (!hashkeyisempty(t, j)); /* repeat until an absent t[j] */ - /* i < j && t[i] present && t[j] absent */ - while (j - i > 1u) { /* do a binary search between them */ - lua_Unsigned m = (i + j) / 2; - if (hashkeyisempty(t, m)) j = m; - else i = m; - } - return i; -} - - -static unsigned int binsearch (Table *array, unsigned int i, unsigned int j) { - while (j - i > 1u) { /* binary search */ - unsigned int m = (i + j) / 2; - if (arraykeyisempty(array, m)) j = m; - else i = m; - } - return i; -} - - -/* -** Try to find a boundary in table 't'. (A 'boundary' is an integer index -** such that t[i] is present and t[i+1] is absent, or 0 if t[1] is absent -** and 'maxinteger' if t[maxinteger] is present.) -** (In the next explanation, we use Lua indices, that is, with base 1. -** The code itself uses base 0 when indexing the array part of the table.) -** The code starts with 'limit = t->alimit', a position in the array -** part that may be a boundary. -** -** (1) If 't[limit]' is empty, there must be a boundary before it. -** As a common case (e.g., after 't[#t]=nil'), check whether 'limit-1' -** is present. If so, it is a boundary. Otherwise, do a binary search -** between 0 and limit to find a boundary. In both cases, try to -** use this boundary as the new 'alimit', as a hint for the next call. -** -** (2) If 't[limit]' is not empty and the array has more elements -** after 'limit', try to find a boundary there. Again, try first -** the special case (which should be quite frequent) where 'limit+1' -** is empty, so that 'limit' is a boundary. Otherwise, check the -** last element of the array part. If it is empty, there must be a -** boundary between the old limit (present) and the last element -** (absent), which is found with a binary search. (This boundary always -** can be a new limit.) -** -** (3) The last case is when there are no elements in the array part -** (limit == 0) or its last element (the new limit) is present. -** In this case, must check the hash part. If there is no hash part -** or 'limit+1' is absent, 'limit' is a boundary. Otherwise, call -** 'hash_search' to find a boundary in the hash part of the table. -** (In those cases, the boundary is not inside the array part, and -** therefore cannot be used as a new limit.) -*/ -lua_Unsigned luaH_getn (Table *t) { - unsigned int limit = t->alimit; - if (limit > 0 && arraykeyisempty(t, limit)) { /* (1)? */ - /* there must be a boundary before 'limit' */ - if (limit >= 2 && !arraykeyisempty(t, limit - 1)) { - /* 'limit - 1' is a boundary; can it be a new limit? */ - if (ispow2realasize(t) && !ispow2(limit - 1)) { - t->alimit = limit - 1; - setnorealasize(t); /* now 'alimit' is not the real size */ - } - return limit - 1; - } - else { /* must search for a boundary in [0, limit] */ - unsigned int boundary = binsearch(t, 0, limit); - /* can this boundary represent the real size of the array? */ - if (ispow2realasize(t) && boundary > luaH_realasize(t) / 2) { - t->alimit = boundary; /* use it as the new limit */ - setnorealasize(t); - } - return boundary; - } - } - /* 'limit' is zero or present in table */ - if (!limitequalsasize(t)) { /* (2)? */ - /* 'limit' > 0 and array has more elements after 'limit' */ - if (arraykeyisempty(t, limit + 1)) /* 'limit + 1' is empty? */ - return limit; /* this is the boundary */ - /* else, try last element in the array */ - limit = luaH_realasize(t); - if (arraykeyisempty(t, limit)) { /* empty? */ - /* there must be a boundary in the array after old limit, - and it must be a valid new limit */ - unsigned int boundary = binsearch(t, t->alimit, limit); - t->alimit = boundary; - return boundary; - } - /* else, new limit is present in the table; check the hash part */ - } - /* (3) 'limit' is the last element and either is zero or present in table */ - lua_assert(limit == luaH_realasize(t) && - (limit == 0 || !arraykeyisempty(t, limit))); - if (isdummy(t) || hashkeyisempty(t, cast(lua_Integer, limit + 1))) - return limit; /* 'limit + 1' is absent */ - else /* 'limit + 1' is also present */ - return hash_search(t, limit); -} - - - -#if defined(LUA_DEBUG) - -/* export these functions for the test library */ - -Node *luaH_mainposition (const Table *t, const TValue *key) { - return mainpositionTV(t, key); -} - -#endif diff --git a/src/dependencies/lua/ltable.h b/src/dependencies/lua/ltable.h deleted file mode 100644 index 4734bd5..0000000 --- a/src/dependencies/lua/ltable.h +++ /dev/null @@ -1,168 +0,0 @@ -/* -** $Id: ltable.h $ -** Lua tables (hash) -** See Copyright Notice in lua.h -*/ - -#ifndef ltable_h -#define ltable_h - -#include "lobject.h" - - -#define gnode(t,i) (&(t)->node[i]) -#define gval(n) (&(n)->i_val) -#define gnext(n) ((n)->u.next) - - -/* -** Clear all bits of fast-access metamethods, which means that the table -** may have any of these metamethods. (First access that fails after the -** clearing will set the bit again.) -*/ -#define invalidateTMcache(t) ((t)->flags &= ~maskflags) - - -/* -** Bit BITDUMMY set in 'flags' means the table is using the dummy node -** for its hash part. -*/ - -#define BITDUMMY (1 << 6) -#define NOTBITDUMMY cast_byte(~BITDUMMY) -#define isdummy(t) ((t)->flags & BITDUMMY) - -#define setnodummy(t) ((t)->flags &= NOTBITDUMMY) -#define setdummy(t) ((t)->flags |= BITDUMMY) - - - -/* allocated size for hash nodes */ -#define allocsizenode(t) (isdummy(t) ? 0 : sizenode(t)) - - -/* returns the Node, given the value of a table entry */ -#define nodefromval(v) cast(Node *, (v)) - - - -#define luaH_fastgeti(t,k,res,tag) \ - { Table *h = t; lua_Unsigned u = l_castS2U(k); \ - if ((u - 1u < h->alimit)) { \ - tag = *getArrTag(h,(u)-1u); \ - if (!tagisempty(tag)) { farr2val(h, u, tag, res); }} \ - else { tag = luaH_getint(h, u, res); }} - - -#define luaH_fastseti(t,k,val,hres) \ - { Table *h = t; lua_Unsigned u = l_castS2U(k); \ - if ((u - 1u < h->alimit)) { \ - lu_byte *tag = getArrTag(h,(u)-1u); \ - if (tagisempty(*tag)) hres = ~cast_int(u); \ - else { fval2arr(h, u, tag, val); hres = HOK; }} \ - else { hres = luaH_psetint(h, u, val); }} - - -/* results from pset */ -#define HOK 0 -#define HNOTFOUND 1 -#define HNOTATABLE 2 -#define HFIRSTNODE 3 - -/* -** 'luaH_get*' operations set 'res', unless the value is absent, and -** return the tag of the result, -** The 'luaH_pset*' (pre-set) operations set the given value and return -** HOK, unless the original value is absent. In that case, if the key -** is really absent, they return HNOTFOUND. Otherwise, if there is a -** slot with that key but with no value, 'luaH_pset*' return an encoding -** of where the key is (usually called 'hres'). (pset cannot set that -** value because there might be a metamethod.) If the slot is in the -** hash part, the encoding is (HFIRSTNODE + hash index); if the slot is -** in the array part, the encoding is (~array index), a negative value. -** The value HNOTATABLE is used by the fast macros to signal that the -** value being indexed is not a table. -*/ - - -/* -** The array part of a table is represented by an array of cells. -** Each cell is composed of NM tags followed by NM values, so that -** no space is wasted in padding. The last cell may be incomplete, -** that is, it may have fewer than NM values. -*/ -#define NM cast_uint(sizeof(Value)) - -struct ArrayCell { - lu_byte tag[NM]; - Value value[NM]; -}; - - -/* Computes the address of the tag for the abstract index 'k' */ -#define getArrTag(t,k) (&(t)->array[(k)/NM].tag[(k)%NM]) - -/* Computes the address of the value for the abstract index 'k' */ -#define getArrVal(t,k) (&(t)->array[(k)/NM].value[(k)%NM]) - - -/* -** Move TValues to/from arrays, using Lua indices -*/ -#define arr2obj(h,k,val) \ - ((val)->tt_ = *getArrTag(h,(k)-1u), (val)->value_ = *getArrVal(h,(k)-1u)) - -#define obj2arr(h,k,val) \ - (*getArrTag(h,(k)-1u) = (val)->tt_, *getArrVal(h,(k)-1u) = (val)->value_) - - -/* -** Often, we need to check the tag of a value before moving it. These -** macros also move TValues to/from arrays, but receive the precomputed -** tag value or address as an extra argument. -*/ -#define farr2val(h,k,tag,res) \ - ((res)->tt_ = tag, (res)->value_ = *getArrVal(h,(k)-1u)) - -#define fval2arr(h,k,tag,val) \ - (*tag = (val)->tt_, *getArrVal(h,(k)-1u) = (val)->value_) - - -LUAI_FUNC int luaH_get (Table *t, const TValue *key, TValue *res); -LUAI_FUNC int luaH_getshortstr (Table *t, TString *key, TValue *res); -LUAI_FUNC int luaH_getstr (Table *t, TString *key, TValue *res); -LUAI_FUNC int luaH_getint (Table *t, lua_Integer key, TValue *res); - -/* Special get for metamethods */ -LUAI_FUNC const TValue *luaH_Hgetshortstr (Table *t, TString *key); - -LUAI_FUNC TString *luaH_getstrkey (Table *t, TString *key); - -LUAI_FUNC int luaH_psetint (Table *t, lua_Integer key, TValue *val); -LUAI_FUNC int luaH_psetshortstr (Table *t, TString *key, TValue *val); -LUAI_FUNC int luaH_psetstr (Table *t, TString *key, TValue *val); -LUAI_FUNC int luaH_pset (Table *t, const TValue *key, TValue *val); - -LUAI_FUNC void luaH_setint (lua_State *L, Table *t, lua_Integer key, - TValue *value); -LUAI_FUNC void luaH_set (lua_State *L, Table *t, const TValue *key, - TValue *value); - -LUAI_FUNC void luaH_finishset (lua_State *L, Table *t, const TValue *key, - TValue *value, int hres); -LUAI_FUNC Table *luaH_new (lua_State *L); -LUAI_FUNC void luaH_resize (lua_State *L, Table *t, unsigned nasize, - unsigned nhsize); -LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, unsigned nasize); -LUAI_FUNC void luaH_free (lua_State *L, Table *t); -LUAI_FUNC int luaH_next (lua_State *L, Table *t, StkId key); -LUAI_FUNC lua_Unsigned luaH_getn (Table *t); -LUAI_FUNC unsigned luaH_realasize (const Table *t); - - -#if defined(LUA_DEBUG) -LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key); -#endif - - -#endif diff --git a/src/dependencies/lua/ltablib.c b/src/dependencies/lua/ltablib.c deleted file mode 100644 index a402dae..0000000 --- a/src/dependencies/lua/ltablib.c +++ /dev/null @@ -1,417 +0,0 @@ -/* -** $Id: ltablib.c $ -** Library for Table Manipulation -** See Copyright Notice in lua.h -*/ - -#define ltablib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** Operations that an object must define to mimic a table -** (some functions only need some of them) -*/ -#define TAB_R 1 /* read */ -#define TAB_W 2 /* write */ -#define TAB_L 4 /* length */ -#define TAB_RW (TAB_R | TAB_W) /* read/write */ - - -#define aux_getn(L,n,w) (checktab(L, n, (w) | TAB_L), luaL_len(L, n)) - - -static int checkfield (lua_State *L, const char *key, int n) { - lua_pushstring(L, key); - return (lua_rawget(L, -n) != LUA_TNIL); -} - - -/* -** Check that 'arg' either is a table or can behave like one (that is, -** has a metatable with the required metamethods) -*/ -static void checktab (lua_State *L, int arg, int what) { - if (lua_type(L, arg) != LUA_TTABLE) { /* is it not a table? */ - int n = 1; /* number of elements to pop */ - if (lua_getmetatable(L, arg) && /* must have metatable */ - (!(what & TAB_R) || checkfield(L, "__index", ++n)) && - (!(what & TAB_W) || checkfield(L, "__newindex", ++n)) && - (!(what & TAB_L) || checkfield(L, "__len", ++n))) { - lua_pop(L, n); /* pop metatable and tested metamethods */ - } - else - luaL_checktype(L, arg, LUA_TTABLE); /* force an error */ - } -} - - -static int tcreate (lua_State *L) { - lua_Unsigned sizeseq = (lua_Unsigned)luaL_checkinteger(L, 1); - lua_Unsigned sizerest = (lua_Unsigned)luaL_optinteger(L, 2, 0); - luaL_argcheck(L, sizeseq <= UINT_MAX, 1, "out of range"); - luaL_argcheck(L, sizerest <= UINT_MAX, 2, "out of range"); - lua_createtable(L, (unsigned)sizeseq, (unsigned)sizerest); - return 1; -} - - -static int tinsert (lua_State *L) { - lua_Integer pos; /* where to insert new element */ - lua_Integer e = aux_getn(L, 1, TAB_RW); - e = luaL_intop(+, e, 1); /* first empty element */ - switch (lua_gettop(L)) { - case 2: { /* called with only 2 arguments */ - pos = e; /* insert new element at the end */ - break; - } - case 3: { - lua_Integer i; - pos = luaL_checkinteger(L, 2); /* 2nd argument is the position */ - /* check whether 'pos' is in [1, e] */ - luaL_argcheck(L, (lua_Unsigned)pos - 1u < (lua_Unsigned)e, 2, - "position out of bounds"); - for (i = e; i > pos; i--) { /* move up elements */ - lua_geti(L, 1, i - 1); - lua_seti(L, 1, i); /* t[i] = t[i - 1] */ - } - break; - } - default: { - return luaL_error(L, "wrong number of arguments to 'insert'"); - } - } - lua_seti(L, 1, pos); /* t[pos] = v */ - return 0; -} - - -static int tremove (lua_State *L) { - lua_Integer size = aux_getn(L, 1, TAB_RW); - lua_Integer pos = luaL_optinteger(L, 2, size); - if (pos != size) /* validate 'pos' if given */ - /* check whether 'pos' is in [1, size + 1] */ - luaL_argcheck(L, (lua_Unsigned)pos - 1u <= (lua_Unsigned)size, 2, - "position out of bounds"); - lua_geti(L, 1, pos); /* result = t[pos] */ - for ( ; pos < size; pos++) { - lua_geti(L, 1, pos + 1); - lua_seti(L, 1, pos); /* t[pos] = t[pos + 1] */ - } - lua_pushnil(L); - lua_seti(L, 1, pos); /* remove entry t[pos] */ - return 1; -} - - -/* -** Copy elements (1[f], ..., 1[e]) into (tt[t], tt[t+1], ...). Whenever -** possible, copy in increasing order, which is better for rehashing. -** "possible" means destination after original range, or smaller -** than origin, or copying to another table. -*/ -static int tmove (lua_State *L) { - lua_Integer f = luaL_checkinteger(L, 2); - lua_Integer e = luaL_checkinteger(L, 3); - lua_Integer t = luaL_checkinteger(L, 4); - int tt = !lua_isnoneornil(L, 5) ? 5 : 1; /* destination table */ - checktab(L, 1, TAB_R); - checktab(L, tt, TAB_W); - if (e >= f) { /* otherwise, nothing to move */ - lua_Integer n, i; - luaL_argcheck(L, f > 0 || e < LUA_MAXINTEGER + f, 3, - "too many elements to move"); - n = e - f + 1; /* number of elements to move */ - luaL_argcheck(L, t <= LUA_MAXINTEGER - n + 1, 4, - "destination wrap around"); - if (t > e || t <= f || (tt != 1 && !lua_compare(L, 1, tt, LUA_OPEQ))) { - for (i = 0; i < n; i++) { - lua_geti(L, 1, f + i); - lua_seti(L, tt, t + i); - } - } - else { - for (i = n - 1; i >= 0; i--) { - lua_geti(L, 1, f + i); - lua_seti(L, tt, t + i); - } - } - } - lua_pushvalue(L, tt); /* return destination table */ - return 1; -} - - -static void addfield (lua_State *L, luaL_Buffer *b, lua_Integer i) { - lua_geti(L, 1, i); - if (l_unlikely(!lua_isstring(L, -1))) - luaL_error(L, "invalid value (%s) at index %I in table for 'concat'", - luaL_typename(L, -1), (LUAI_UACINT)i); - luaL_addvalue(b); -} - - -static int tconcat (lua_State *L) { - luaL_Buffer b; - lua_Integer last = aux_getn(L, 1, TAB_R); - size_t lsep; - const char *sep = luaL_optlstring(L, 2, "", &lsep); - lua_Integer i = luaL_optinteger(L, 3, 1); - last = luaL_optinteger(L, 4, last); - luaL_buffinit(L, &b); - for (; i < last; i++) { - addfield(L, &b, i); - luaL_addlstring(&b, sep, lsep); - } - if (i == last) /* add last value (if interval was not empty) */ - addfield(L, &b, i); - luaL_pushresult(&b); - return 1; -} - - -/* -** {====================================================== -** Pack/unpack -** ======================================================= -*/ - -static int tpack (lua_State *L) { - int i; - int n = lua_gettop(L); /* number of elements to pack */ - lua_createtable(L, n, 1); /* create result table */ - lua_insert(L, 1); /* put it at index 1 */ - for (i = n; i >= 1; i--) /* assign elements */ - lua_seti(L, 1, i); - lua_pushinteger(L, n); - lua_setfield(L, 1, "n"); /* t.n = number of elements */ - return 1; /* return table */ -} - - -static int tunpack (lua_State *L) { - lua_Unsigned n; - lua_Integer i = luaL_optinteger(L, 2, 1); - lua_Integer e = luaL_opt(L, luaL_checkinteger, 3, luaL_len(L, 1)); - if (i > e) return 0; /* empty range */ - n = (lua_Unsigned)e - i; /* number of elements minus 1 (avoid overflows) */ - if (l_unlikely(n >= (unsigned int)INT_MAX || - !lua_checkstack(L, (int)(++n)))) - return luaL_error(L, "too many results to unpack"); - for (; i < e; i++) { /* push arg[i..e - 1] (to avoid overflows) */ - lua_geti(L, 1, i); - } - lua_geti(L, 1, e); /* push last element */ - return (int)n; -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Quicksort -** (based on 'Algorithms in MODULA-3', Robert Sedgewick; -** Addison-Wesley, 1993.) -** ======================================================= -*/ - - -/* type for array indices */ -typedef unsigned int IdxT; - - -/* -** Produce a "random" 'unsigned int' to randomize pivot choice. This -** macro is used only when 'sort' detects a big imbalance in the result -** of a partition. (If you don't want/need this "randomness", ~0 is a -** good choice.) -*/ -#if !defined(l_randomizePivot) -#define l_randomizePivot(L) luaL_makeseed(L) -#endif /* } */ - - -/* arrays larger than 'RANLIMIT' may use randomized pivots */ -#define RANLIMIT 100u - - -static void set2 (lua_State *L, IdxT i, IdxT j) { - lua_seti(L, 1, i); - lua_seti(L, 1, j); -} - - -/* -** Return true iff value at stack index 'a' is less than the value at -** index 'b' (according to the order of the sort). -*/ -static int sort_comp (lua_State *L, int a, int b) { - if (lua_isnil(L, 2)) /* no function? */ - return lua_compare(L, a, b, LUA_OPLT); /* a < b */ - else { /* function */ - int res; - lua_pushvalue(L, 2); /* push function */ - lua_pushvalue(L, a-1); /* -1 to compensate function */ - lua_pushvalue(L, b-2); /* -2 to compensate function and 'a' */ - lua_call(L, 2, 1); /* call function */ - res = lua_toboolean(L, -1); /* get result */ - lua_pop(L, 1); /* pop result */ - return res; - } -} - - -/* -** Does the partition: Pivot P is at the top of the stack. -** precondition: a[lo] <= P == a[up-1] <= a[up], -** so it only needs to do the partition from lo + 1 to up - 2. -** Pos-condition: a[lo .. i - 1] <= a[i] == P <= a[i + 1 .. up] -** returns 'i'. -*/ -static IdxT partition (lua_State *L, IdxT lo, IdxT up) { - IdxT i = lo; /* will be incremented before first use */ - IdxT j = up - 1; /* will be decremented before first use */ - /* loop invariant: a[lo .. i] <= P <= a[j .. up] */ - for (;;) { - /* next loop: repeat ++i while a[i] < P */ - while ((void)lua_geti(L, 1, ++i), sort_comp(L, -1, -2)) { - if (l_unlikely(i == up - 1)) /* a[i] < P but a[up - 1] == P ?? */ - luaL_error(L, "invalid order function for sorting"); - lua_pop(L, 1); /* remove a[i] */ - } - /* after the loop, a[i] >= P and a[lo .. i - 1] < P */ - /* next loop: repeat --j while P < a[j] */ - while ((void)lua_geti(L, 1, --j), sort_comp(L, -3, -1)) { - if (l_unlikely(j < i)) /* j < i but a[j] > P ?? */ - luaL_error(L, "invalid order function for sorting"); - lua_pop(L, 1); /* remove a[j] */ - } - /* after the loop, a[j] <= P and a[j + 1 .. up] >= P */ - if (j < i) { /* no elements out of place? */ - /* a[lo .. i - 1] <= P <= a[j + 1 .. i .. up] */ - lua_pop(L, 1); /* pop a[j] */ - /* swap pivot (a[up - 1]) with a[i] to satisfy pos-condition */ - set2(L, up - 1, i); - return i; - } - /* otherwise, swap a[i] - a[j] to restore invariant and repeat */ - set2(L, i, j); - } -} - - -/* -** Choose an element in the middle (2nd-3th quarters) of [lo,up] -** "randomized" by 'rnd' -*/ -static IdxT choosePivot (IdxT lo, IdxT up, unsigned int rnd) { - IdxT r4 = (up - lo) / 4; /* range/4 */ - IdxT p = (rnd ^ lo ^ up) % (r4 * 2) + (lo + r4); - lua_assert(lo + r4 <= p && p <= up - r4); - return p; -} - - -/* -** Quicksort algorithm (recursive function) -*/ -static void auxsort (lua_State *L, IdxT lo, IdxT up, unsigned rnd) { - while (lo < up) { /* loop for tail recursion */ - IdxT p; /* Pivot index */ - IdxT n; /* to be used later */ - /* sort elements 'lo', 'p', and 'up' */ - lua_geti(L, 1, lo); - lua_geti(L, 1, up); - if (sort_comp(L, -1, -2)) /* a[up] < a[lo]? */ - set2(L, lo, up); /* swap a[lo] - a[up] */ - else - lua_pop(L, 2); /* remove both values */ - if (up - lo == 1) /* only 2 elements? */ - return; /* already sorted */ - if (up - lo < RANLIMIT || rnd == 0) /* small interval or no randomize? */ - p = (lo + up)/2; /* middle element is a good pivot */ - else /* for larger intervals, it is worth a random pivot */ - p = choosePivot(lo, up, rnd); - lua_geti(L, 1, p); - lua_geti(L, 1, lo); - if (sort_comp(L, -2, -1)) /* a[p] < a[lo]? */ - set2(L, p, lo); /* swap a[p] - a[lo] */ - else { - lua_pop(L, 1); /* remove a[lo] */ - lua_geti(L, 1, up); - if (sort_comp(L, -1, -2)) /* a[up] < a[p]? */ - set2(L, p, up); /* swap a[up] - a[p] */ - else - lua_pop(L, 2); - } - if (up - lo == 2) /* only 3 elements? */ - return; /* already sorted */ - lua_geti(L, 1, p); /* get middle element (Pivot) */ - lua_pushvalue(L, -1); /* push Pivot */ - lua_geti(L, 1, up - 1); /* push a[up - 1] */ - set2(L, p, up - 1); /* swap Pivot (a[p]) with a[up - 1] */ - p = partition(L, lo, up); - /* a[lo .. p - 1] <= a[p] == P <= a[p + 1 .. up] */ - if (p - lo < up - p) { /* lower interval is smaller? */ - auxsort(L, lo, p - 1, rnd); /* call recursively for lower interval */ - n = p - lo; /* size of smaller interval */ - lo = p + 1; /* tail call for [p + 1 .. up] (upper interval) */ - } - else { - auxsort(L, p + 1, up, rnd); /* call recursively for upper interval */ - n = up - p; /* size of smaller interval */ - up = p - 1; /* tail call for [lo .. p - 1] (lower interval) */ - } - if ((up - lo) / 128 > n) /* partition too imbalanced? */ - rnd = l_randomizePivot(L); /* try a new randomization */ - } /* tail call auxsort(L, lo, up, rnd) */ -} - - -static int sort (lua_State *L) { - lua_Integer n = aux_getn(L, 1, TAB_RW); - if (n > 1) { /* non-trivial interval? */ - luaL_argcheck(L, n < INT_MAX, 1, "array too big"); - if (!lua_isnoneornil(L, 2)) /* is there a 2nd argument? */ - luaL_checktype(L, 2, LUA_TFUNCTION); /* must be a function */ - lua_settop(L, 2); /* make sure there are two arguments */ - auxsort(L, 1, (IdxT)n, 0); - } - return 0; -} - -/* }====================================================== */ - - -static const luaL_Reg tab_funcs[] = { - {"concat", tconcat}, - {"create", tcreate}, - {"insert", tinsert}, - {"pack", tpack}, - {"unpack", tunpack}, - {"remove", tremove}, - {"move", tmove}, - {"sort", sort}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_table (lua_State *L) { - luaL_newlib(L, tab_funcs); - return 1; -} - diff --git a/src/dependencies/lua/ltests.c b/src/dependencies/lua/ltests.c deleted file mode 100644 index 4780673..0000000 --- a/src/dependencies/lua/ltests.c +++ /dev/null @@ -1,2067 +0,0 @@ -/* -** $Id: ltests.c $ -** Internal Module for Debugging of the Lua Implementation -** See Copyright Notice in lua.h -*/ - -#define ltests_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "lauxlib.h" -#include "lcode.h" -#include "lctype.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lmem.h" -#include "lopcodes.h" -#include "lopnames.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "lualib.h" - - - -/* -** The whole module only makes sense with LUA_DEBUG on -*/ -#if defined(LUA_DEBUG) - - -void *l_Trick = 0; - - -#define obj_at(L,k) s2v(L->ci->func.p + (k)) - - -static int runC (lua_State *L, lua_State *L1, const char *pc); - - -static void setnameval (lua_State *L, const char *name, int val) { - lua_pushinteger(L, val); - lua_setfield(L, -2, name); -} - - -static void pushobject (lua_State *L, const TValue *o) { - setobj2s(L, L->top.p, o); - api_incr_top(L); -} - - -static void badexit (const char *fmt, const char *s1, const char *s2) { - fprintf(stderr, fmt, s1); - if (s2) - fprintf(stderr, "extra info: %s\n", s2); - /* avoid assertion failures when exiting */ - l_memcontrol.numblocks = l_memcontrol.total = 0; - exit(EXIT_FAILURE); -} - - -static int tpanic (lua_State *L) { - const char *msg = (lua_type(L, -1) == LUA_TSTRING) - ? lua_tostring(L, -1) - : "error object is not a string"; - return (badexit("PANIC: unprotected error in call to Lua API (%s)\n", - msg, NULL), - 0); /* do not return to Lua */ -} - - -/* -** Warning function for tests. First, it concatenates all parts of -** a warning in buffer 'buff'. Then, it has three modes: -** - 0.normal: messages starting with '#' are shown on standard output; -** - other messages abort the tests (they represent real warning -** conditions; the standard tests should not generate these conditions -** unexpectedly); -** - 1.allow: all messages are shown; -** - 2.store: all warnings go to the global '_WARN'; -*/ -static void warnf (void *ud, const char *msg, int tocont) { - lua_State *L = cast(lua_State *, ud); - static char buff[200] = ""; /* should be enough for tests... */ - static int onoff = 0; - static int mode = 0; /* start in normal mode */ - static int lasttocont = 0; - if (!lasttocont && !tocont && *msg == '@') { /* control message? */ - if (buff[0] != '\0') - badexit("Control warning during warning: %s\naborting...\n", msg, buff); - if (strcmp(msg, "@off") == 0) - onoff = 0; - else if (strcmp(msg, "@on") == 0) - onoff = 1; - else if (strcmp(msg, "@normal") == 0) - mode = 0; - else if (strcmp(msg, "@allow") == 0) - mode = 1; - else if (strcmp(msg, "@store") == 0) - mode = 2; - else - badexit("Invalid control warning in test mode: %s\naborting...\n", - msg, NULL); - return; - } - lasttocont = tocont; - if (strlen(msg) >= sizeof(buff) - strlen(buff)) - badexit("warnf-buffer overflow (%s)\n", msg, buff); - strcat(buff, msg); /* add new message to current warning */ - if (!tocont) { /* message finished? */ - lua_unlock(L); - luaL_checkstack(L, 1, "warn stack space"); - lua_getglobal(L, "_WARN"); - if (!lua_toboolean(L, -1)) - lua_pop(L, 1); /* ok, no previous unexpected warning */ - else { - badexit("Unhandled warning in store mode: %s\naborting...\n", - lua_tostring(L, -1), buff); - } - lua_lock(L); - switch (mode) { - case 0: { /* normal */ - if (buff[0] != '#' && onoff) /* unexpected warning? */ - badexit("Unexpected warning in test mode: %s\naborting...\n", - buff, NULL); - } /* FALLTHROUGH */ - case 1: { /* allow */ - if (onoff) - fprintf(stderr, "Lua warning: %s\n", buff); /* print warning */ - break; - } - case 2: { /* store */ - lua_unlock(L); - luaL_checkstack(L, 1, "warn stack space"); - lua_pushstring(L, buff); - lua_setglobal(L, "_WARN"); /* assign message to global '_WARN' */ - lua_lock(L); - break; - } - } - buff[0] = '\0'; /* prepare buffer for next warning */ - } -} - - -/* -** {====================================================================== -** Controlled version for realloc. -** ======================================================================= -*/ - -#define MARK 0x55 /* 01010101 (a nice pattern) */ - -typedef union Header { - LUAI_MAXALIGN; - struct { - size_t size; - int type; - } d; -} Header; - - -#if !defined(EXTERNMEMCHECK) - -/* full memory check */ -#define MARKSIZE 16 /* size of marks after each block */ -#define fillmem(mem,size) memset(mem, -MARK, size) - -#else - -/* external memory check: don't do it twice */ -#define MARKSIZE 0 -#define fillmem(mem,size) /* empty */ - -#endif - - -Memcontrol l_memcontrol = - {0, 0UL, 0UL, 0UL, 0UL, (~0UL), - {0UL, 0UL, 0UL, 0UL, 0UL, 0UL, 0UL, 0UL, 0UL}}; - - -static void freeblock (Memcontrol *mc, Header *block) { - if (block) { - size_t size = block->d.size; - int i; - for (i = 0; i < MARKSIZE; i++) /* check marks after block */ - lua_assert(*(cast_charp(block + 1) + size + i) == MARK); - mc->objcount[block->d.type]--; - fillmem(block, sizeof(Header) + size + MARKSIZE); /* erase block */ - free(block); /* actually free block */ - mc->numblocks--; /* update counts */ - mc->total -= size; - } -} - - -void *debug_realloc (void *ud, void *b, size_t oldsize, size_t size) { - Memcontrol *mc = cast(Memcontrol *, ud); - Header *block = cast(Header *, b); - int type; - if (mc->memlimit == 0) { /* first time? */ - char *limit = getenv("MEMLIMIT"); /* initialize memory limit */ - mc->memlimit = limit ? strtoul(limit, NULL, 10) : ULONG_MAX; - } - if (block == NULL) { - type = (oldsize < LUA_NUMTYPES) ? oldsize : 0; - oldsize = 0; - } - else { - block--; /* go to real header */ - type = block->d.type; - lua_assert(oldsize == block->d.size); - } - if (size == 0) { - freeblock(mc, block); - return NULL; - } - if (mc->failnext) { - mc->failnext = 0; - return NULL; /* fake a single memory allocation error */ - } - if (mc->countlimit != ~0UL && size != oldsize) { /* count limit in use? */ - if (mc->countlimit == 0) - return NULL; /* fake a memory allocation error */ - mc->countlimit--; - } - if (size > oldsize && mc->total+size-oldsize > mc->memlimit) - return NULL; /* fake a memory allocation error */ - else { - Header *newblock; - int i; - size_t commonsize = (oldsize < size) ? oldsize : size; - size_t realsize = sizeof(Header) + size + MARKSIZE; - if (realsize < size) return NULL; /* arithmetic overflow! */ - newblock = cast(Header *, malloc(realsize)); /* alloc a new block */ - if (newblock == NULL) - return NULL; /* really out of memory? */ - if (block) { - memcpy(newblock + 1, block + 1, commonsize); /* copy old contents */ - freeblock(mc, block); /* erase (and check) old copy */ - } - /* initialize new part of the block with something weird */ - fillmem(cast_charp(newblock + 1) + commonsize, size - commonsize); - /* initialize marks after block */ - for (i = 0; i < MARKSIZE; i++) - *(cast_charp(newblock + 1) + size + i) = MARK; - newblock->d.size = size; - newblock->d.type = type; - mc->total += size; - if (mc->total > mc->maxmem) - mc->maxmem = mc->total; - mc->numblocks++; - mc->objcount[type]++; - return newblock + 1; - } -} - - -/* }====================================================================== */ - - - -/* -** {===================================================================== -** Functions to check memory consistency. -** Most of these checks are done through asserts, so this code does -** not make sense with asserts off. For this reason, it uses 'assert' -** directly, instead of 'lua_assert'. -** ====================================================================== -*/ - -#include - -/* -** Check GC invariants. For incremental mode, a black object cannot -** point to a white one. For generational mode, really old objects -** cannot point to young objects. Both old1 and touched2 objects -** cannot point to new objects (but can point to survivals). -** (Threads and open upvalues, despite being marked "really old", -** continue to be visited in all collections, and therefore can point to -** new objects. They, and only they, are old but gray.) -*/ -static int testobjref1 (global_State *g, GCObject *f, GCObject *t) { - if (isdead(g,t)) return 0; - if (issweepphase(g)) - return 1; /* no invariants */ - else if (g->gckind != KGC_GENMINOR) - return !(isblack(f) && iswhite(t)); /* basic incremental invariant */ - else { /* generational mode */ - if ((getage(f) == G_OLD && isblack(f)) && !isold(t)) - return 0; - if ((getage(f) == G_OLD1 || getage(f) == G_TOUCHED2) && - getage(t) == G_NEW) - return 0; - return 1; - } -} - - -static void printobj (global_State *g, GCObject *o) { - printf("||%s(%p)-%c%c(%02X)||", - ttypename(novariant(o->tt)), (void *)o, - isdead(g,o) ? 'd' : isblack(o) ? 'b' : iswhite(o) ? 'w' : 'g', - "ns01oTt"[getage(o)], o->marked); - if (o->tt == LUA_VSHRSTR || o->tt == LUA_VLNGSTR) - printf(" '%s'", getstr(gco2ts(o))); -} - - -void lua_printobj (lua_State *L, struct GCObject *o) { - printobj(G(L), o); -} - -static int testobjref (global_State *g, GCObject *f, GCObject *t) { - int r1 = testobjref1(g, f, t); - if (!r1) { - printf("%d(%02X) - ", g->gcstate, g->currentwhite); - printobj(g, f); - printf(" -> "); - printobj(g, t); - printf("\n"); - } - return r1; -} - - -static void checkobjref (global_State *g, GCObject *f, GCObject *t) { - assert(testobjref(g, f, t)); -} - - -/* -** Version where 't' can be NULL. In that case, it should not apply the -** macro 'obj2gco' over the object. ('t' may have several types, so this -** definition must be a macro.) Most checks need this version, because -** the check may run while an object is still being created. -*/ -#define checkobjrefN(g,f,t) { if (t) checkobjref(g,f,obj2gco(t)); } - - -static void checkvalref (global_State *g, GCObject *f, const TValue *t) { - assert(!iscollectable(t) || (righttt(t) && testobjref(g, f, gcvalue(t)))); -} - - -static void checktable (global_State *g, Table *h) { - unsigned int i; - unsigned int asize = luaH_realasize(h); - Node *n, *limit = gnode(h, sizenode(h)); - GCObject *hgc = obj2gco(h); - checkobjrefN(g, hgc, h->metatable); - for (i = 0; i < asize; i++) { - TValue aux; - arr2obj(h, i + 1, &aux); - checkvalref(g, hgc, &aux); - } - for (n = gnode(h, 0); n < limit; n++) { - if (!isempty(gval(n))) { - TValue k; - getnodekey(g->mainthread, &k, n); - assert(!keyisnil(n)); - checkvalref(g, hgc, &k); - checkvalref(g, hgc, gval(n)); - } - } -} - - -static void checkudata (global_State *g, Udata *u) { - int i; - GCObject *hgc = obj2gco(u); - checkobjrefN(g, hgc, u->metatable); - for (i = 0; i < u->nuvalue; i++) - checkvalref(g, hgc, &u->uv[i].uv); -} - - -static void checkproto (global_State *g, Proto *f) { - int i; - GCObject *fgc = obj2gco(f); - checkobjrefN(g, fgc, f->source); - for (i=0; isizek; i++) { - if (iscollectable(f->k + i)) - checkobjref(g, fgc, gcvalue(f->k + i)); - } - for (i=0; isizeupvalues; i++) - checkobjrefN(g, fgc, f->upvalues[i].name); - for (i=0; isizep; i++) - checkobjrefN(g, fgc, f->p[i]); - for (i=0; isizelocvars; i++) - checkobjrefN(g, fgc, f->locvars[i].varname); -} - - -static void checkCclosure (global_State *g, CClosure *cl) { - GCObject *clgc = obj2gco(cl); - int i; - for (i = 0; i < cl->nupvalues; i++) - checkvalref(g, clgc, &cl->upvalue[i]); -} - - -static void checkLclosure (global_State *g, LClosure *cl) { - GCObject *clgc = obj2gco(cl); - int i; - checkobjrefN(g, clgc, cl->p); - for (i=0; inupvalues; i++) { - UpVal *uv = cl->upvals[i]; - if (uv) { - checkobjrefN(g, clgc, uv); - if (!upisopen(uv)) - checkvalref(g, obj2gco(uv), uv->v.p); - } - } -} - - -static int lua_checkpc (CallInfo *ci) { - if (!isLua(ci)) return 1; - else { - StkId f = ci->func.p; - Proto *p = clLvalue(s2v(f))->p; - return p->code <= ci->u.l.savedpc && - ci->u.l.savedpc <= p->code + p->sizecode; - } -} - - -static void checkstack (global_State *g, lua_State *L1) { - StkId o; - CallInfo *ci; - UpVal *uv; - assert(!isdead(g, L1)); - if (L1->stack.p == NULL) { /* incomplete thread? */ - assert(L1->openupval == NULL && L1->ci == NULL); - return; - } - for (uv = L1->openupval; uv != NULL; uv = uv->u.open.next) - assert(upisopen(uv)); /* must be open */ - assert(L1->top.p <= L1->stack_last.p); - assert(L1->tbclist.p <= L1->top.p); - for (ci = L1->ci; ci != NULL; ci = ci->previous) { - assert(ci->top.p <= L1->stack_last.p); - assert(lua_checkpc(ci)); - } - for (o = L1->stack.p; o < L1->stack_last.p; o++) - checkliveness(L1, s2v(o)); /* entire stack must have valid values */ -} - - -static void checkrefs (global_State *g, GCObject *o) { - switch (o->tt) { - case LUA_VUSERDATA: { - checkudata(g, gco2u(o)); - break; - } - case LUA_VUPVAL: { - checkvalref(g, o, gco2upv(o)->v.p); - break; - } - case LUA_VTABLE: { - checktable(g, gco2t(o)); - break; - } - case LUA_VTHREAD: { - checkstack(g, gco2th(o)); - break; - } - case LUA_VLCL: { - checkLclosure(g, gco2lcl(o)); - break; - } - case LUA_VCCL: { - checkCclosure(g, gco2ccl(o)); - break; - } - case LUA_VPROTO: { - checkproto(g, gco2p(o)); - break; - } - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - assert(!isgray(o)); /* strings are never gray */ - break; - } - default: assert(0); - } -} - - -/* -** Check consistency of an object: -** - Dead objects can only happen in the 'allgc' list during a sweep -** phase (controlled by the caller through 'maybedead'). -** - During pause, all objects must be white. -** - In generational mode: -** * objects must be old enough for their lists ('listage'). -** * old objects cannot be white. -** * old objects must be black, except for 'touched1', 'old0', -** threads, and open upvalues. -** * 'touched1' objects must be gray. -*/ -static void checkobject (global_State *g, GCObject *o, int maybedead, - int listage) { - if (isdead(g, o)) - assert(maybedead); - else { - assert(g->gcstate != GCSpause || iswhite(o)); - if (g->gckind == KGC_GENMINOR) { /* generational mode? */ - assert(getage(o) >= listage); - if (isold(o)) { - assert(!iswhite(o)); - assert(isblack(o) || - getage(o) == G_TOUCHED1 || - getage(o) == G_OLD0 || - o->tt == LUA_VTHREAD || - (o->tt == LUA_VUPVAL && upisopen(gco2upv(o)))); - } - assert(getage(o) != G_TOUCHED1 || isgray(o)); - } - checkrefs(g, o); - } -} - - -static l_obj checkgraylist (global_State *g, GCObject *o) { - int total = 0; /* count number of elements in the list */ - cast_void(g); /* better to keep it if we need to print an object */ - while (o) { - assert(!!isgray(o) ^ (getage(o) == G_TOUCHED2)); - assert(!testbit(o->marked, TESTBIT)); - if (keepinvariant(g)) - l_setbit(o->marked, TESTBIT); /* mark that object is in a gray list */ - total++; - switch (o->tt) { - case LUA_VTABLE: o = gco2t(o)->gclist; break; - case LUA_VLCL: o = gco2lcl(o)->gclist; break; - case LUA_VCCL: o = gco2ccl(o)->gclist; break; - case LUA_VTHREAD: o = gco2th(o)->gclist; break; - case LUA_VPROTO: o = gco2p(o)->gclist; break; - case LUA_VUSERDATA: - assert(gco2u(o)->nuvalue > 0); - o = gco2u(o)->gclist; - break; - default: assert(0); /* other objects cannot be in a gray list */ - } - } - return total; -} - - -/* -** Check objects in gray lists. -*/ -static l_obj checkgrays (global_State *g) { - int total = 0; /* count number of elements in all lists */ - if (!keepinvariant(g)) return total; - total += checkgraylist(g, g->gray); - total += checkgraylist(g, g->grayagain); - total += checkgraylist(g, g->weak); - total += checkgraylist(g, g->allweak); - total += checkgraylist(g, g->ephemeron); - return total; -} - - -/* -** Check whether 'o' should be in a gray list. If so, increment -** 'count' and check its TESTBIT. (It must have been previously set by -** 'checkgraylist'.) -*/ -static void incifingray (global_State *g, GCObject *o, l_obj *count) { - if (!keepinvariant(g)) - return; /* gray lists not being kept in these phases */ - if (o->tt == LUA_VUPVAL) { - /* only open upvalues can be gray */ - assert(!isgray(o) || upisopen(gco2upv(o))); - return; /* upvalues are never in gray lists */ - } - /* these are the ones that must be in gray lists */ - if (isgray(o) || getage(o) == G_TOUCHED2) { - (*count)++; - assert(testbit(o->marked, TESTBIT)); - resetbit(o->marked, TESTBIT); /* prepare for next cycle */ - } -} - - -static l_obj checklist (global_State *g, int maybedead, int tof, - GCObject *newl, GCObject *survival, GCObject *old, GCObject *reallyold) { - GCObject *o; - l_obj total = 0; /* number of object that should be in gray lists */ - for (o = newl; o != survival; o = o->next) { - checkobject(g, o, maybedead, G_NEW); - incifingray(g, o, &total); - assert(!tof == !tofinalize(o)); - } - for (o = survival; o != old; o = o->next) { - checkobject(g, o, 0, G_SURVIVAL); - incifingray(g, o, &total); - assert(!tof == !tofinalize(o)); - } - for (o = old; o != reallyold; o = o->next) { - checkobject(g, o, 0, G_OLD1); - incifingray(g, o, &total); - assert(!tof == !tofinalize(o)); - } - for (o = reallyold; o != NULL; o = o->next) { - checkobject(g, o, 0, G_OLD); - incifingray(g, o, &total); - assert(!tof == !tofinalize(o)); - } - return total; -} - - -int lua_checkmemory (lua_State *L) { - global_State *g = G(L); - GCObject *o; - int maybedead; - l_obj totalin; /* total of objects that are in gray lists */ - l_obj totalshould; /* total of objects that should be in gray lists */ - if (keepinvariant(g)) { - assert(!iswhite(g->mainthread)); - assert(!iswhite(gcvalue(&g->l_registry))); - } - assert(!isdead(g, gcvalue(&g->l_registry))); - assert(g->sweepgc == NULL || issweepphase(g)); - totalin = checkgrays(g); - - /* check 'fixedgc' list */ - for (o = g->fixedgc; o != NULL; o = o->next) { - assert(o->tt == LUA_VSHRSTR && isgray(o) && getage(o) == G_OLD); - } - - /* check 'allgc' list */ - maybedead = (GCSatomic < g->gcstate && g->gcstate <= GCSswpallgc); - totalshould = checklist(g, maybedead, 0, g->allgc, - g->survival, g->old1, g->reallyold); - - /* check 'finobj' list */ - totalshould += checklist(g, 0, 1, g->finobj, - g->finobjsur, g->finobjold1, g->finobjrold); - - /* check 'tobefnz' list */ - for (o = g->tobefnz; o != NULL; o = o->next) { - checkobject(g, o, 0, G_NEW); - incifingray(g, o, &totalshould); - assert(tofinalize(o)); - assert(o->tt == LUA_VUSERDATA || o->tt == LUA_VTABLE); - } - if (keepinvariant(g)) - assert(totalin == totalshould); - return 0; -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Disassembler -** ======================================================= -*/ - - -static char *buildop (Proto *p, int pc, char *buff) { - char *obuff = buff; - Instruction i = p->code[pc]; - OpCode o = GET_OPCODE(i); - const char *name = opnames[o]; - int line = luaG_getfuncline(p, pc); - int lineinfo = (p->lineinfo != NULL) ? p->lineinfo[pc] : 0; - if (lineinfo == ABSLINEINFO) - buff += sprintf(buff, "(__"); - else - buff += sprintf(buff, "(%2d", lineinfo); - buff += sprintf(buff, " - %4d) %4d - ", line, pc); - switch (getOpMode(o)) { - case iABC: - sprintf(buff, "%-12s%4d %4d %4d%s", name, - GETARG_A(i), GETARG_B(i), GETARG_C(i), - GETARG_k(i) ? " (k)" : ""); - break; - case iABx: - sprintf(buff, "%-12s%4d %4d", name, GETARG_A(i), GETARG_Bx(i)); - break; - case iAsBx: - sprintf(buff, "%-12s%4d %4d", name, GETARG_A(i), GETARG_sBx(i)); - break; - case iAx: - sprintf(buff, "%-12s%4d", name, GETARG_Ax(i)); - break; - case isJ: - sprintf(buff, "%-12s%4d", name, GETARG_sJ(i)); - break; - } - return obuff; -} - - -#if 0 -void luaI_printcode (Proto *pt, int size) { - int pc; - for (pc=0; pcmaxstacksize); - setnameval(L, "numparams", p->numparams); - for (pc=0; pcsizecode; pc++) { - char buff[100]; - lua_pushinteger(L, pc+1); - lua_pushstring(L, buildop(p, pc, buff)); - lua_settable(L, -3); - } - return 1; -} - - -static int printcode (lua_State *L) { - int pc; - Proto *p; - luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - p = getproto(obj_at(L, 1)); - printf("maxstack: %d\n", p->maxstacksize); - printf("numparams: %d\n", p->numparams); - for (pc=0; pcsizecode; pc++) { - char buff[100]; - printf("%s\n", buildop(p, pc, buff)); - } - return 0; -} - - -static int listk (lua_State *L) { - Proto *p; - int i; - luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - p = getproto(obj_at(L, 1)); - lua_createtable(L, p->sizek, 0); - for (i=0; isizek; i++) { - pushobject(L, p->k+i); - lua_rawseti(L, -2, i+1); - } - return 1; -} - - -static int listabslineinfo (lua_State *L) { - Proto *p; - int i; - luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - p = getproto(obj_at(L, 1)); - luaL_argcheck(L, p->abslineinfo != NULL, 1, "function has no debug info"); - lua_createtable(L, 2 * p->sizeabslineinfo, 0); - for (i=0; i < p->sizeabslineinfo; i++) { - lua_pushinteger(L, p->abslineinfo[i].pc); - lua_rawseti(L, -2, 2 * i + 1); - lua_pushinteger(L, p->abslineinfo[i].line); - lua_rawseti(L, -2, 2 * i + 2); - } - return 1; -} - - -static int listlocals (lua_State *L) { - Proto *p; - int pc = cast_int(luaL_checkinteger(L, 2)) - 1; - int i = 0; - const char *name; - luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - p = getproto(obj_at(L, 1)); - while ((name = luaF_getlocalname(p, ++i, pc)) != NULL) - lua_pushstring(L, name); - return i-1; -} - -/* }====================================================== */ - - - -static void printstack (lua_State *L) { - int i; - int n = lua_gettop(L); - printf("stack: >>\n"); - for (i = 1; i <= n; i++) { - printf("%3d: %s\n", i, luaL_tolstring(L, i, NULL)); - lua_pop(L, 1); - } - printf("<<\n"); -} - - -static int get_limits (lua_State *L) { - lua_createtable(L, 0, 6); - setnameval(L, "IS32INT", LUAI_IS32INT); - setnameval(L, "MAXARG_Ax", MAXARG_Ax); - setnameval(L, "MAXARG_Bx", MAXARG_Bx); - setnameval(L, "OFFSET_sBx", OFFSET_sBx); - setnameval(L, "LFPF", LFIELDS_PER_FLUSH); - setnameval(L, "NUM_OPCODES", NUM_OPCODES); - return 1; -} - - -static int mem_query (lua_State *L) { - if (lua_isnone(L, 1)) { - lua_pushinteger(L, l_memcontrol.total); - lua_pushinteger(L, l_memcontrol.numblocks); - lua_pushinteger(L, l_memcontrol.maxmem); - return 3; - } - else if (lua_isnumber(L, 1)) { - unsigned long limit = cast(unsigned long, luaL_checkinteger(L, 1)); - if (limit == 0) limit = ULONG_MAX; - l_memcontrol.memlimit = limit; - return 0; - } - else { - const char *t = luaL_checkstring(L, 1); - int i; - for (i = LUA_NUMTYPES - 1; i >= 0; i--) { - if (strcmp(t, ttypename(i)) == 0) { - lua_pushinteger(L, l_memcontrol.objcount[i]); - return 1; - } - } - return luaL_error(L, "unknown type '%s'", t); - } -} - - -static int alloc_count (lua_State *L) { - if (lua_isnone(L, 1)) - l_memcontrol.countlimit = ~0L; - else - l_memcontrol.countlimit = luaL_checkinteger(L, 1); - return 0; -} - - -static int alloc_failnext (lua_State *L) { - UNUSED(L); - l_memcontrol.failnext = 1; - return 0; -} - - -static int settrick (lua_State *L) { - if (ttisnil(obj_at(L, 1))) - l_Trick = NULL; - else - l_Trick = gcvalue(obj_at(L, 1)); - return 0; -} - - -static int gc_color (lua_State *L) { - TValue *o; - luaL_checkany(L, 1); - o = obj_at(L, 1); - if (!iscollectable(o)) - lua_pushstring(L, "no collectable"); - else { - GCObject *obj = gcvalue(o); - lua_pushstring(L, isdead(G(L), obj) ? "dead" : - iswhite(obj) ? "white" : - isblack(obj) ? "black" : "gray"); - } - return 1; -} - - -static int gc_age (lua_State *L) { - TValue *o; - luaL_checkany(L, 1); - o = obj_at(L, 1); - if (!iscollectable(o)) - lua_pushstring(L, "no collectable"); - else { - static const char *gennames[] = {"new", "survival", "old0", "old1", - "old", "touched1", "touched2"}; - GCObject *obj = gcvalue(o); - lua_pushstring(L, gennames[getage(obj)]); - } - return 1; -} - - -static int gc_printobj (lua_State *L) { - TValue *o; - luaL_checkany(L, 1); - o = obj_at(L, 1); - if (!iscollectable(o)) - printf("no collectable\n"); - else { - GCObject *obj = gcvalue(o); - printobj(G(L), obj); - printf("\n"); - } - return 0; -} - - -static int gc_state (lua_State *L) { - static const char *statenames[] = { - "propagate", "atomic", "sweepallgc", "sweepfinobj", - "sweeptobefnz", "sweepend", "callfin", "pause", ""}; - static const int states[] = { - GCSpropagate, GCSenteratomic, GCSswpallgc, GCSswpfinobj, - GCSswptobefnz, GCSswpend, GCScallfin, GCSpause, -1}; - int option = states[luaL_checkoption(L, 1, "", statenames)]; - if (option == -1) { - lua_pushstring(L, statenames[G(L)->gcstate]); - return 1; - } - else { - global_State *g = G(L); - if (G(L)->gckind != KGC_INC) - luaL_error(L, "cannot change states in generational mode"); - lua_lock(L); - if (option < g->gcstate) { /* must cross 'pause'? */ - luaC_runtilstate(L, GCSpause, 1); /* run until pause */ - } - luaC_runtilstate(L, option, 0); /* do not skip propagation state */ - lua_assert(G(L)->gcstate == option); - lua_unlock(L); - return 0; - } -} - - -static int hash_query (lua_State *L) { - if (lua_isnone(L, 2)) { - luaL_argcheck(L, lua_type(L, 1) == LUA_TSTRING, 1, "string expected"); - lua_pushinteger(L, tsvalue(obj_at(L, 1))->hash); - } - else { - TValue *o = obj_at(L, 1); - Table *t; - luaL_checktype(L, 2, LUA_TTABLE); - t = hvalue(obj_at(L, 2)); - lua_pushinteger(L, luaH_mainposition(t, o) - t->node); - } - return 1; -} - - -static int stacklevel (lua_State *L) { - unsigned long a = 0; - lua_pushinteger(L, (L->top.p - L->stack.p)); - lua_pushinteger(L, stacksize(L)); - lua_pushinteger(L, L->nCcalls); - lua_pushinteger(L, L->nci); - lua_pushinteger(L, (unsigned long)&a); - return 5; -} - - -static int table_query (lua_State *L) { - const Table *t; - int i = cast_int(luaL_optinteger(L, 2, -1)); - unsigned int asize; - luaL_checktype(L, 1, LUA_TTABLE); - t = hvalue(obj_at(L, 1)); - asize = luaH_realasize(t); - if (i == -1) { - lua_pushinteger(L, asize); - lua_pushinteger(L, allocsizenode(t)); - lua_pushinteger(L, t->alimit); - return 3; - } - else if (cast_uint(i) < asize) { - lua_pushinteger(L, i); - arr2obj(t, i + 1, s2v(L->top.p)); - api_incr_top(L); - lua_pushnil(L); - } - else if ((i -= asize) < sizenode(t)) { - TValue k; - getnodekey(L, &k, gnode(t, i)); - if (!isempty(gval(gnode(t, i))) || - ttisnil(&k) || - ttisnumber(&k)) { - pushobject(L, &k); - } - else - lua_pushliteral(L, ""); - pushobject(L, gval(gnode(t, i))); - if (gnext(&t->node[i]) != 0) - lua_pushinteger(L, gnext(&t->node[i])); - else - lua_pushnil(L); - } - return 3; -} - - -static int query_GCparams (lua_State *L) { - global_State *g = G(L); - lua_pushinteger(L, gettotalobjs(g)); - lua_pushinteger(L, g->GCdebt); - lua_pushinteger(L, applygcparam(g, MINORMUL, 100)); - lua_pushinteger(L, applygcparam(g, MAJORMINOR, 100)); - lua_pushinteger(L, applygcparam(g, MINORMAJOR, 100)); - lua_pushinteger(L, applygcparam(g, PAUSE, 100)); - lua_pushinteger(L, applygcparam(g, STEPMUL, 100)); - lua_pushinteger(L, applygcparam(g, STEPSIZE, 100)); - return 8; -} - - -static int test_codeparam (lua_State *L) { - lua_Integer p = luaL_checkinteger(L, 1); - lua_pushinteger(L, luaO_codeparam(p)); - return 1; -} - - -static int test_applyparam (lua_State *L) { - lua_Integer p = luaL_checkinteger(L, 1); - lua_Integer x = luaL_checkinteger(L, 2); - lua_pushinteger(L, luaO_applyparam(p, x)); - return 1; -} - - -static int string_query (lua_State *L) { - stringtable *tb = &G(L)->strt; - int s = cast_int(luaL_optinteger(L, 1, 0)) - 1; - if (s == -1) { - lua_pushinteger(L ,tb->size); - lua_pushinteger(L ,tb->nuse); - return 2; - } - else if (s < tb->size) { - TString *ts; - int n = 0; - for (ts = tb->hash[s]; ts != NULL; ts = ts->u.hnext) { - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - n++; - } - return n; - } - else return 0; -} - - -static int getreftable (lua_State *L) { - if (lua_istable(L, 2)) /* is there a table as second argument? */ - return 2; /* use it as the table */ - else - return LUA_REGISTRYINDEX; /* default is to use the register */ -} - - -static int tref (lua_State *L) { - int t = getreftable(L); - int level = lua_gettop(L); - luaL_checkany(L, 1); - lua_pushvalue(L, 1); - lua_pushinteger(L, luaL_ref(L, t)); - cast_void(level); /* to avoid warnings */ - lua_assert(lua_gettop(L) == level+1); /* +1 for result */ - return 1; -} - - -static int getref (lua_State *L) { - int t = getreftable(L); - int level = lua_gettop(L); - lua_rawgeti(L, t, luaL_checkinteger(L, 1)); - cast_void(level); /* to avoid warnings */ - lua_assert(lua_gettop(L) == level+1); - return 1; -} - -static int unref (lua_State *L) { - int t = getreftable(L); - int level = lua_gettop(L); - luaL_unref(L, t, cast_int(luaL_checkinteger(L, 1))); - cast_void(level); /* to avoid warnings */ - lua_assert(lua_gettop(L) == level); - return 0; -} - - -static int upvalue (lua_State *L) { - int n = cast_int(luaL_checkinteger(L, 2)); - luaL_checktype(L, 1, LUA_TFUNCTION); - if (lua_isnone(L, 3)) { - const char *name = lua_getupvalue(L, 1, n); - if (name == NULL) return 0; - lua_pushstring(L, name); - return 2; - } - else { - const char *name = lua_setupvalue(L, 1, n); - lua_pushstring(L, name); - return 1; - } -} - - -static int newuserdata (lua_State *L) { - size_t size = cast_sizet(luaL_optinteger(L, 1, 0)); - int nuv = luaL_optinteger(L, 2, 0); - char *p = cast_charp(lua_newuserdatauv(L, size, nuv)); - while (size--) *p++ = '\0'; - return 1; -} - - -static int pushuserdata (lua_State *L) { - lua_Integer u = luaL_checkinteger(L, 1); - lua_pushlightuserdata(L, cast_voidp(cast_sizet(u))); - return 1; -} - - -static int udataval (lua_State *L) { - lua_pushinteger(L, cast(long, lua_touserdata(L, 1))); - return 1; -} - - -static int doonnewstack (lua_State *L) { - lua_State *L1 = lua_newthread(L); - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - int status = luaL_loadbuffer(L1, s, l, s); - if (status == LUA_OK) - status = lua_pcall(L1, 0, 0, 0); - lua_pushinteger(L, status); - return 1; -} - - -static int s2d (lua_State *L) { - lua_pushnumber(L, cast_num(*cast(const double *, luaL_checkstring(L, 1)))); - return 1; -} - - -static int d2s (lua_State *L) { - double d = cast(double, luaL_checknumber(L, 1)); - lua_pushlstring(L, cast_charp(&d), sizeof(d)); - return 1; -} - - -static int num2int (lua_State *L) { - lua_pushinteger(L, lua_tointeger(L, 1)); - return 1; -} - - -static int makeseed (lua_State *L) { - lua_pushinteger(L, luaL_makeseed(L)); - return 1; -} - - -static int newstate (lua_State *L) { - void *ud; - lua_Alloc f = lua_getallocf(L, &ud); - lua_State *L1 = lua_newstate(f, ud, 0); - if (L1) { - lua_atpanic(L1, tpanic); - lua_pushlightuserdata(L, L1); - } - else - lua_pushnil(L); - return 1; -} - - -static lua_State *getstate (lua_State *L) { - lua_State *L1 = cast(lua_State *, lua_touserdata(L, 1)); - luaL_argcheck(L, L1 != NULL, 1, "state expected"); - return L1; -} - - -static int loadlib (lua_State *L) { - lua_State *L1 = getstate(L); - int load = luaL_checkinteger(L, 2); - int preload = luaL_checkinteger(L, 3); - luaL_openselectedlibs(L1, load, preload); - luaL_requiref(L1, "T", luaB_opentests, 0); - lua_assert(lua_type(L1, -1) == LUA_TTABLE); - /* 'requiref' should not reload module already loaded... */ - luaL_requiref(L1, "T", NULL, 1); /* seg. fault if it reloads */ - /* ...but should return the same module */ - lua_assert(lua_compare(L1, -1, -2, LUA_OPEQ)); - return 0; -} - -static int closestate (lua_State *L) { - lua_State *L1 = getstate(L); - lua_close(L1); - return 0; -} - -static int doremote (lua_State *L) { - lua_State *L1 = getstate(L); - size_t lcode; - const char *code = luaL_checklstring(L, 2, &lcode); - int status; - lua_settop(L1, 0); - status = luaL_loadbuffer(L1, code, lcode, code); - if (status == LUA_OK) - status = lua_pcall(L1, 0, LUA_MULTRET, 0); - if (status != LUA_OK) { - lua_pushnil(L); - lua_pushstring(L, lua_tostring(L1, -1)); - lua_pushinteger(L, status); - return 3; - } - else { - int i = 0; - while (!lua_isnone(L1, ++i)) - lua_pushstring(L, lua_tostring(L1, i)); - lua_pop(L1, i-1); - return i-1; - } -} - - -static int log2_aux (lua_State *L) { - unsigned int x = (unsigned int)luaL_checkinteger(L, 1); - lua_pushinteger(L, luaO_ceillog2(x)); - return 1; -} - - -struct Aux { jmp_buf jb; const char *paniccode; lua_State *L; }; - -/* -** does a long-jump back to "main program". -*/ -static int panicback (lua_State *L) { - struct Aux *b; - lua_checkstack(L, 1); /* open space for 'Aux' struct */ - lua_getfield(L, LUA_REGISTRYINDEX, "_jmpbuf"); /* get 'Aux' struct */ - b = (struct Aux *)lua_touserdata(L, -1); - lua_pop(L, 1); /* remove 'Aux' struct */ - runC(b->L, L, b->paniccode); /* run optional panic code */ - longjmp(b->jb, 1); - return 1; /* to avoid warnings */ -} - -static int checkpanic (lua_State *L) { - struct Aux b; - void *ud; - lua_State *L1; - const char *code = luaL_checkstring(L, 1); - lua_Alloc f = lua_getallocf(L, &ud); - b.paniccode = luaL_optstring(L, 2, ""); - b.L = L; - L1 = lua_newstate(f, ud, 0); /* create new state */ - if (L1 == NULL) { /* error? */ - lua_pushnil(L); - return 1; - } - lua_atpanic(L1, panicback); /* set its panic function */ - lua_pushlightuserdata(L1, &b); - lua_setfield(L1, LUA_REGISTRYINDEX, "_jmpbuf"); /* store 'Aux' struct */ - if (setjmp(b.jb) == 0) { /* set jump buffer */ - runC(L, L1, code); /* run code unprotected */ - lua_pushliteral(L, "no errors"); - } - else { /* error handling */ - /* move error message to original state */ - lua_pushstring(L, lua_tostring(L1, -1)); - } - lua_close(L1); - return 1; -} - - -static int externKstr (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_pushextlstring(L, s, len, NULL, NULL); - return 1; -} - - -/* -** Create a buffer with the content of a given string and then -** create an external string using that buffer. Use the allocation -** function from Lua to create and free the buffer. -*/ -static int externstr (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); /* get allocation function */ - /* create the buffer */ - char *buff = cast_charp((*allocf)(ud, NULL, 0, len + 1)); - if (buff == NULL) { /* memory error? */ - lua_pushliteral(L, "not enough memory"); - lua_error(L); /* raise a memory error */ - } - /* copy string content to buffer, including ending 0 */ - memcpy(buff, s, (len + 1) * sizeof(char)); - /* create external string */ - lua_pushextlstring(L, buff, len, allocf, ud); - return 1; -} - - -/* -** {==================================================================== -** function to test the API with C. It interprets a kind of assembler -** language with calls to the API, so the test can be driven by Lua code -** ===================================================================== -*/ - - -static void sethookaux (lua_State *L, int mask, int count, const char *code); - -static const char *const delimits = " \t\n,;"; - -static void skip (const char **pc) { - for (;;) { - if (**pc != '\0' && strchr(delimits, **pc)) (*pc)++; - else if (**pc == '#') { /* comment? */ - while (**pc != '\n' && **pc != '\0') (*pc)++; /* until end-of-line */ - } - else break; - } -} - -static int getnum_aux (lua_State *L, lua_State *L1, const char **pc) { - int res = 0; - int sig = 1; - skip(pc); - if (**pc == '.') { - res = cast_int(lua_tointeger(L1, -1)); - lua_pop(L1, 1); - (*pc)++; - return res; - } - else if (**pc == '*') { - res = lua_gettop(L1); - (*pc)++; - return res; - } - else if (**pc == '!') { - (*pc)++; - if (**pc == 'G') - res = LUA_RIDX_GLOBALS; - else if (**pc == 'M') - res = LUA_RIDX_MAINTHREAD; - else lua_assert(0); - (*pc)++; - return res; - } - else if (**pc == '-') { - sig = -1; - (*pc)++; - } - if (!lisdigit(cast_uchar(**pc))) - luaL_error(L, "number expected (%s)", *pc); - while (lisdigit(cast_uchar(**pc))) res = res*10 + (*(*pc)++) - '0'; - return sig*res; -} - -static const char *getstring_aux (lua_State *L, char *buff, const char **pc) { - int i = 0; - skip(pc); - if (**pc == '"' || **pc == '\'') { /* quoted string? */ - int quote = *(*pc)++; - while (**pc != quote) { - if (**pc == '\0') luaL_error(L, "unfinished string in C script"); - buff[i++] = *(*pc)++; - } - (*pc)++; - } - else { - while (**pc != '\0' && !strchr(delimits, **pc)) - buff[i++] = *(*pc)++; - } - buff[i] = '\0'; - return buff; -} - - -static int getindex_aux (lua_State *L, lua_State *L1, const char **pc) { - skip(pc); - switch (*(*pc)++) { - case 'R': return LUA_REGISTRYINDEX; - case 'G': return luaL_error(L, "deprecated index 'G'"); - case 'U': return lua_upvalueindex(getnum_aux(L, L1, pc)); - default: (*pc)--; return getnum_aux(L, L1, pc); - } -} - - -static const char *const statcodes[] = {"OK", "YIELD", "ERRRUN", - "ERRSYNTAX", MEMERRMSG, "ERRGCMM", "ERRERR"}; - -/* -** Avoid these stat codes from being collected, to avoid possible -** memory error when pushing them. -*/ -static void regcodes (lua_State *L) { - unsigned int i; - for (i = 0; i < sizeof(statcodes) / sizeof(statcodes[0]); i++) { - lua_pushboolean(L, 1); - lua_setfield(L, LUA_REGISTRYINDEX, statcodes[i]); - } -} - - -#define EQ(s1) (strcmp(s1, inst) == 0) - -#define getnum (getnum_aux(L, L1, &pc)) -#define getstring (getstring_aux(L, buff, &pc)) -#define getindex (getindex_aux(L, L1, &pc)) - - -static int testC (lua_State *L); -static int Cfunck (lua_State *L, int status, lua_KContext ctx); - -/* -** arithmetic operation encoding for 'arith' instruction -** LUA_OPIDIV -> \ -** LUA_OPSHL -> < -** LUA_OPSHR -> > -** LUA_OPUNM -> _ -** LUA_OPBNOT -> ! -*/ -static const char ops[] = "+-*%^/\\&|~<>_!"; - -static int runC (lua_State *L, lua_State *L1, const char *pc) { - char buff[300]; - int status = 0; - if (pc == NULL) return luaL_error(L, "attempt to runC null script"); - for (;;) { - const char *inst = getstring; - if EQ("") return 0; - else if EQ("absindex") { - lua_pushnumber(L1, lua_absindex(L1, getindex)); - } - else if EQ("append") { - int t = getindex; - int i = lua_rawlen(L1, t); - lua_rawseti(L1, t, i + 1); - } - else if EQ("arith") { - int op; - skip(&pc); - op = strchr(ops, *pc++) - ops; - lua_arith(L1, op); - } - else if EQ("call") { - int narg = getnum; - int nres = getnum; - lua_call(L1, narg, nres); - } - else if EQ("callk") { - int narg = getnum; - int nres = getnum; - int i = getindex; - lua_callk(L1, narg, nres, i, Cfunck); - } - else if EQ("checkstack") { - int sz = getnum; - const char *msg = getstring; - if (*msg == '\0') - msg = NULL; /* to test 'luaL_checkstack' with no message */ - luaL_checkstack(L1, sz, msg); - } - else if EQ("rawcheckstack") { - int sz = getnum; - lua_pushboolean(L1, lua_checkstack(L1, sz)); - } - else if EQ("compare") { - const char *opt = getstring; /* EQ, LT, or LE */ - int op = (opt[0] == 'E') ? LUA_OPEQ - : (opt[1] == 'T') ? LUA_OPLT : LUA_OPLE; - int a = getindex; - int b = getindex; - lua_pushboolean(L1, lua_compare(L1, a, b, op)); - } - else if EQ("concat") { - lua_concat(L1, getnum); - } - else if EQ("copy") { - int f = getindex; - lua_copy(L1, f, getindex); - } - else if EQ("func2num") { - lua_CFunction func = lua_tocfunction(L1, getindex); - lua_pushnumber(L1, cast_sizet(func)); - } - else if EQ("getfield") { - int t = getindex; - int tp = lua_getfield(L1, t, getstring); - lua_assert(tp == lua_type(L1, -1)); - } - else if EQ("getglobal") { - lua_getglobal(L1, getstring); - } - else if EQ("getmetatable") { - if (lua_getmetatable(L1, getindex) == 0) - lua_pushnil(L1); - } - else if EQ("gettable") { - int tp = lua_gettable(L1, getindex); - lua_assert(tp == lua_type(L1, -1)); - } - else if EQ("gettop") { - lua_pushinteger(L1, lua_gettop(L1)); - } - else if EQ("gsub") { - int a = getnum; int b = getnum; int c = getnum; - luaL_gsub(L1, lua_tostring(L1, a), - lua_tostring(L1, b), - lua_tostring(L1, c)); - } - else if EQ("insert") { - lua_insert(L1, getnum); - } - else if EQ("iscfunction") { - lua_pushboolean(L1, lua_iscfunction(L1, getindex)); - } - else if EQ("isfunction") { - lua_pushboolean(L1, lua_isfunction(L1, getindex)); - } - else if EQ("isnil") { - lua_pushboolean(L1, lua_isnil(L1, getindex)); - } - else if EQ("isnull") { - lua_pushboolean(L1, lua_isnone(L1, getindex)); - } - else if EQ("isnumber") { - lua_pushboolean(L1, lua_isnumber(L1, getindex)); - } - else if EQ("isstring") { - lua_pushboolean(L1, lua_isstring(L1, getindex)); - } - else if EQ("istable") { - lua_pushboolean(L1, lua_istable(L1, getindex)); - } - else if EQ("isudataval") { - lua_pushboolean(L1, lua_islightuserdata(L1, getindex)); - } - else if EQ("isuserdata") { - lua_pushboolean(L1, lua_isuserdata(L1, getindex)); - } - else if EQ("len") { - lua_len(L1, getindex); - } - else if EQ("Llen") { - lua_pushinteger(L1, luaL_len(L1, getindex)); - } - else if EQ("loadfile") { - luaL_loadfile(L1, luaL_checkstring(L1, getnum)); - } - else if EQ("loadstring") { - size_t slen; - const char *s = luaL_checklstring(L1, getnum, &slen); - const char *name = getstring; - const char *mode = getstring; - luaL_loadbufferx(L1, s, slen, name, mode); - } - else if EQ("newmetatable") { - lua_pushboolean(L1, luaL_newmetatable(L1, getstring)); - } - else if EQ("newtable") { - lua_newtable(L1); - } - else if EQ("newthread") { - lua_newthread(L1); - } - else if EQ("resetthread") { - lua_pushinteger(L1, lua_resetthread(L1)); /* deprecated */ - } - else if EQ("newuserdata") { - lua_newuserdata(L1, getnum); - } - else if EQ("next") { - lua_next(L1, -2); - } - else if EQ("objsize") { - lua_pushinteger(L1, lua_rawlen(L1, getindex)); - } - else if EQ("pcall") { - int narg = getnum; - int nres = getnum; - status = lua_pcall(L1, narg, nres, getnum); - } - else if EQ("pcallk") { - int narg = getnum; - int nres = getnum; - int i = getindex; - status = lua_pcallk(L1, narg, nres, 0, i, Cfunck); - } - else if EQ("pop") { - lua_pop(L1, getnum); - } - else if EQ("printstack") { - int n = getnum; - if (n != 0) { - printf("%s\n", luaL_tolstring(L1, n, NULL)); - lua_pop(L1, 1); - } - else printstack(L1); - } - else if EQ("print") { - const char *msg = getstring; - printf("%s\n", msg); - } - else if EQ("warningC") { - const char *msg = getstring; - lua_warning(L1, msg, 1); - } - else if EQ("warning") { - const char *msg = getstring; - lua_warning(L1, msg, 0); - } - else if EQ("pushbool") { - lua_pushboolean(L1, getnum); - } - else if EQ("pushcclosure") { - lua_pushcclosure(L1, testC, getnum); - } - else if EQ("pushint") { - lua_pushinteger(L1, getnum); - } - else if EQ("pushnil") { - lua_pushnil(L1); - } - else if EQ("pushnum") { - lua_pushnumber(L1, (lua_Number)getnum); - } - else if EQ("pushstatus") { - lua_pushstring(L1, statcodes[status]); - } - else if EQ("pushstring") { - lua_pushstring(L1, getstring); - } - else if EQ("pushupvalueindex") { - lua_pushinteger(L1, lua_upvalueindex(getnum)); - } - else if EQ("pushvalue") { - lua_pushvalue(L1, getindex); - } - else if EQ("pushfstringI") { - lua_pushfstring(L1, lua_tostring(L, -2), (int)lua_tointeger(L, -1)); - } - else if EQ("pushfstringS") { - lua_pushfstring(L1, lua_tostring(L, -2), lua_tostring(L, -1)); - } - else if EQ("pushfstringP") { - lua_pushfstring(L1, lua_tostring(L, -2), lua_topointer(L, -1)); - } - else if EQ("rawget") { - int t = getindex; - lua_rawget(L1, t); - } - else if EQ("rawgeti") { - int t = getindex; - lua_rawgeti(L1, t, getnum); - } - else if EQ("rawgetp") { - int t = getindex; - lua_rawgetp(L1, t, cast_voidp(cast_sizet(getnum))); - } - else if EQ("rawset") { - int t = getindex; - lua_rawset(L1, t); - } - else if EQ("rawseti") { - int t = getindex; - lua_rawseti(L1, t, getnum); - } - else if EQ("rawsetp") { - int t = getindex; - lua_rawsetp(L1, t, cast_voidp(cast_sizet(getnum))); - } - else if EQ("remove") { - lua_remove(L1, getnum); - } - else if EQ("replace") { - lua_replace(L1, getindex); - } - else if EQ("resume") { - int i = getindex; - int nres; - status = lua_resume(lua_tothread(L1, i), L, getnum, &nres); - } - else if EQ("return") { - int n = getnum; - if (L1 != L) { - int i; - for (i = 0; i < n; i++) { - int idx = -(n - i); - switch (lua_type(L1, idx)) { - case LUA_TBOOLEAN: - lua_pushboolean(L, lua_toboolean(L1, idx)); - break; - default: - lua_pushstring(L, lua_tostring(L1, idx)); - break; - } - } - } - return n; - } - else if EQ("rotate") { - int i = getindex; - lua_rotate(L1, i, getnum); - } - else if EQ("setfield") { - int t = getindex; - const char *s = getstring; - lua_setfield(L1, t, s); - } - else if EQ("seti") { - int t = getindex; - lua_seti(L1, t, getnum); - } - else if EQ("setglobal") { - const char *s = getstring; - lua_setglobal(L1, s); - } - else if EQ("sethook") { - int mask = getnum; - int count = getnum; - const char *s = getstring; - sethookaux(L1, mask, count, s); - } - else if EQ("setmetatable") { - int idx = getindex; - lua_setmetatable(L1, idx); - } - else if EQ("settable") { - lua_settable(L1, getindex); - } - else if EQ("settop") { - lua_settop(L1, getnum); - } - else if EQ("testudata") { - int i = getindex; - lua_pushboolean(L1, luaL_testudata(L1, i, getstring) != NULL); - } - else if EQ("error") { - lua_error(L1); - } - else if EQ("abort") { - abort(); - } - else if EQ("throw") { -#if defined(__cplusplus) -static struct X { int x; } x; - throw x; -#else - luaL_error(L1, "C++"); -#endif - break; - } - else if EQ("tobool") { - lua_pushboolean(L1, lua_toboolean(L1, getindex)); - } - else if EQ("tocfunction") { - lua_pushcfunction(L1, lua_tocfunction(L1, getindex)); - } - else if EQ("tointeger") { - lua_pushinteger(L1, lua_tointeger(L1, getindex)); - } - else if EQ("tonumber") { - lua_pushnumber(L1, lua_tonumber(L1, getindex)); - } - else if EQ("topointer") { - lua_pushlightuserdata(L1, cast_voidp(lua_topointer(L1, getindex))); - } - else if EQ("touserdata") { - lua_pushlightuserdata(L1, lua_touserdata(L1, getindex)); - } - else if EQ("tostring") { - const char *s = lua_tostring(L1, getindex); - const char *s1 = lua_pushstring(L1, s); - cast_void(s1); /* to avoid warnings */ - lua_longassert((s == NULL && s1 == NULL) || strcmp(s, s1) == 0); - } - else if EQ("Ltolstring") { - luaL_tolstring(L1, getindex, NULL); - } - else if EQ("type") { - lua_pushstring(L1, luaL_typename(L1, getnum)); - } - else if EQ("xmove") { - int f = getindex; - int t = getindex; - lua_State *fs = (f == 0) ? L1 : lua_tothread(L1, f); - lua_State *ts = (t == 0) ? L1 : lua_tothread(L1, t); - int n = getnum; - if (n == 0) n = lua_gettop(fs); - lua_xmove(fs, ts, n); - } - else if EQ("isyieldable") { - lua_pushboolean(L1, lua_isyieldable(lua_tothread(L1, getindex))); - } - else if EQ("yield") { - return lua_yield(L1, getnum); - } - else if EQ("yieldk") { - int nres = getnum; - int i = getindex; - return lua_yieldk(L1, nres, i, Cfunck); - } - else if EQ("toclose") { - lua_toclose(L1, getnum); - } - else if EQ("closeslot") { - lua_closeslot(L1, getnum); - } - else luaL_error(L, "unknown instruction %s", buff); - } - return 0; -} - - -static int testC (lua_State *L) { - lua_State *L1; - const char *pc; - if (lua_isuserdata(L, 1)) { - L1 = getstate(L); - pc = luaL_checkstring(L, 2); - } - else if (lua_isthread(L, 1)) { - L1 = lua_tothread(L, 1); - pc = luaL_checkstring(L, 2); - } - else { - L1 = L; - pc = luaL_checkstring(L, 1); - } - return runC(L, L1, pc); -} - - -static int Cfunc (lua_State *L) { - return runC(L, L, lua_tostring(L, lua_upvalueindex(1))); -} - - -static int Cfunck (lua_State *L, int status, lua_KContext ctx) { - lua_pushstring(L, statcodes[status]); - lua_setglobal(L, "status"); - lua_pushinteger(L, ctx); - lua_setglobal(L, "ctx"); - return runC(L, L, lua_tostring(L, ctx)); -} - - -static int makeCfunc (lua_State *L) { - luaL_checkstring(L, 1); - lua_pushcclosure(L, Cfunc, lua_gettop(L)); - return 1; -} - - -/* }====================================================== */ - - -/* -** {====================================================== -** tests for C hooks -** ======================================================= -*/ - -/* -** C hook that runs the C script stored in registry.C_HOOK[L] -*/ -static void Chook (lua_State *L, lua_Debug *ar) { - const char *scpt; - const char *const events [] = {"call", "ret", "line", "count", "tailcall"}; - lua_getfield(L, LUA_REGISTRYINDEX, "C_HOOK"); - lua_pushlightuserdata(L, L); - lua_gettable(L, -2); /* get C_HOOK[L] (script saved by sethookaux) */ - scpt = lua_tostring(L, -1); /* not very religious (string will be popped) */ - lua_pop(L, 2); /* remove C_HOOK and script */ - lua_pushstring(L, events[ar->event]); /* may be used by script */ - lua_pushinteger(L, ar->currentline); /* may be used by script */ - runC(L, L, scpt); /* run script from C_HOOK[L] */ -} - - -/* -** sets 'registry.C_HOOK[L] = scpt' and sets 'Chook' as a hook -*/ -static void sethookaux (lua_State *L, int mask, int count, const char *scpt) { - if (*scpt == '\0') { /* no script? */ - lua_sethook(L, NULL, 0, 0); /* turn off hooks */ - return; - } - lua_getfield(L, LUA_REGISTRYINDEX, "C_HOOK"); /* get C_HOOK table */ - if (!lua_istable(L, -1)) { /* no hook table? */ - lua_pop(L, 1); /* remove previous value */ - lua_newtable(L); /* create new C_HOOK table */ - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, "C_HOOK"); /* register it */ - } - lua_pushlightuserdata(L, L); - lua_pushstring(L, scpt); - lua_settable(L, -3); /* C_HOOK[L] = script */ - lua_sethook(L, Chook, mask, count); -} - - -static int sethook (lua_State *L) { - if (lua_isnoneornil(L, 1)) - lua_sethook(L, NULL, 0, 0); /* turn off hooks */ - else { - const char *scpt = luaL_checkstring(L, 1); - const char *smask = luaL_checkstring(L, 2); - int count = cast_int(luaL_optinteger(L, 3, 0)); - int mask = 0; - if (strchr(smask, 'c')) mask |= LUA_MASKCALL; - if (strchr(smask, 'r')) mask |= LUA_MASKRET; - if (strchr(smask, 'l')) mask |= LUA_MASKLINE; - if (count > 0) mask |= LUA_MASKCOUNT; - sethookaux(L, mask, count, scpt); - } - return 0; -} - - -static int coresume (lua_State *L) { - int status, nres; - lua_State *co = lua_tothread(L, 1); - luaL_argcheck(L, co, 1, "coroutine expected"); - status = lua_resume(co, L, 0, &nres); - if (status != LUA_OK && status != LUA_YIELD) { - lua_pushboolean(L, 0); - lua_insert(L, -2); - return 2; /* return false + error message */ - } - else { - lua_pushboolean(L, 1); - return 1; - } -} - -/* }====================================================== */ - - - -static const struct luaL_Reg tests_funcs[] = { - {"checkmemory", lua_checkmemory}, - {"closestate", closestate}, - {"d2s", d2s}, - {"doonnewstack", doonnewstack}, - {"doremote", doremote}, - {"gccolor", gc_color}, - {"gcage", gc_age}, - {"gcstate", gc_state}, - {"pobj", gc_printobj}, - {"getref", getref}, - {"hash", hash_query}, - {"log2", log2_aux}, - {"limits", get_limits}, - {"listcode", listcode}, - {"printcode", printcode}, - {"listk", listk}, - {"listabslineinfo", listabslineinfo}, - {"listlocals", listlocals}, - {"loadlib", loadlib}, - {"checkpanic", checkpanic}, - {"newstate", newstate}, - {"newuserdata", newuserdata}, - {"num2int", num2int}, - {"makeseed", makeseed}, - {"pushuserdata", pushuserdata}, - {"querystr", string_query}, - {"querytab", table_query}, - {"queryGCparams", query_GCparams}, - {"codeparam", test_codeparam}, - {"applyparam", test_applyparam}, - {"ref", tref}, - {"resume", coresume}, - {"s2d", s2d}, - {"sethook", sethook}, - {"stacklevel", stacklevel}, - {"testC", testC}, - {"makeCfunc", makeCfunc}, - {"totalmem", mem_query}, - {"alloccount", alloc_count}, - {"allocfailnext", alloc_failnext}, - {"trick", settrick}, - {"udataval", udataval}, - {"unref", unref}, - {"upvalue", upvalue}, - {"externKstr", externKstr}, - {"externstr", externstr}, - {NULL, NULL} -}; - - -static void checkfinalmem (void) { - lua_assert(l_memcontrol.numblocks == 0); - lua_assert(l_memcontrol.total == 0); -} - - -int luaB_opentests (lua_State *L) { - void *ud; - lua_Alloc f = lua_getallocf(L, &ud); - lua_atpanic(L, &tpanic); - lua_setwarnf(L, &warnf, L); - lua_pushboolean(L, 0); - lua_setglobal(L, "_WARN"); /* _WARN = false */ - regcodes(L); - atexit(checkfinalmem); - lua_assert(f == debug_realloc && ud == cast_voidp(&l_memcontrol)); - lua_setallocf(L, f, ud); /* exercise this function */ - luaL_newlib(L, tests_funcs); - return 1; -} - -#endif - diff --git a/src/dependencies/lua/ltests.h b/src/dependencies/lua/ltests.h deleted file mode 100644 index da773d6..0000000 --- a/src/dependencies/lua/ltests.h +++ /dev/null @@ -1,152 +0,0 @@ -/* -** $Id: ltests.h $ -** Internal Header for Debugging of the Lua Implementation -** See Copyright Notice in lua.h -*/ - -#ifndef ltests_h -#define ltests_h - - -#include -#include - -/* test Lua with compatibility code */ -#define LUA_COMPAT_MATHLIB -#define LUA_COMPAT_LT_LE - - -#define LUA_DEBUG - - -/* turn on assertions */ -#define LUAI_ASSERT - - -/* to avoid warnings, and to make sure value is really unused */ -#define UNUSED(x) (x=0, (void)(x)) - - -/* test for sizes in 'l_sprintf' (make sure whole buffer is available) */ -#undef l_sprintf -#if !defined(LUA_USE_C89) -#define l_sprintf(s,sz,f,i) (memset(s,0xAB,sz), snprintf(s,sz,f,i)) -#else -#define l_sprintf(s,sz,f,i) (memset(s,0xAB,sz), sprintf(s,f,i)) -#endif - - -/* get a chance to test code without jump tables */ -#define LUA_USE_JUMPTABLE 0 - - -/* use 32-bit integers in random generator */ -#define LUA_RAND32 - - -/* memory-allocator control variables */ -typedef struct Memcontrol { - int failnext; - unsigned long numblocks; - unsigned long total; - unsigned long maxmem; - unsigned long memlimit; - unsigned long countlimit; - unsigned long objcount[LUA_NUMTYPES]; -} Memcontrol; - -LUA_API Memcontrol l_memcontrol; - - -/* -** generic variable for debug tricks -*/ -extern void *l_Trick; - - - -/* -** Function to traverse and check all memory used by Lua -*/ -LUAI_FUNC int lua_checkmemory (lua_State *L); - -/* -** Function to print an object GC-friendly -*/ -struct GCObject; -LUAI_FUNC void lua_printobj (lua_State *L, struct GCObject *o); - - -/* test for lock/unlock */ - -struct L_EXTRA { int lock; int *plock; }; -#undef LUA_EXTRASPACE -#define LUA_EXTRASPACE sizeof(struct L_EXTRA) -#define getlock(l) cast(struct L_EXTRA*, lua_getextraspace(l)) -#define luai_userstateopen(l) \ - (getlock(l)->lock = 0, getlock(l)->plock = &(getlock(l)->lock)) -#define luai_userstateclose(l) \ - lua_assert(getlock(l)->lock == 1 && getlock(l)->plock == &(getlock(l)->lock)) -#define luai_userstatethread(l,l1) \ - lua_assert(getlock(l1)->plock == getlock(l)->plock) -#define luai_userstatefree(l,l1) \ - lua_assert(getlock(l)->plock == getlock(l1)->plock) -#define lua_lock(l) lua_assert((*getlock(l)->plock)++ == 0) -#define lua_unlock(l) lua_assert(--(*getlock(l)->plock) == 0) - - - -LUA_API int luaB_opentests (lua_State *L); - -LUA_API void *debug_realloc (void *ud, void *block, - size_t osize, size_t nsize); - -#if defined(lua_c) -#define luaL_newstate() \ - lua_newstate(debug_realloc, &l_memcontrol, luaL_makeseed(NULL)) -#define luai_openlibs(L) \ - { luaL_openlibs(L); \ - luaL_requiref(L, "T", luaB_opentests, 1); \ - lua_pop(L, 1); } -#endif - - - -/* change some sizes to give some bugs a chance */ - -#undef LUAL_BUFFERSIZE -#define LUAL_BUFFERSIZE 23 -#define MINSTRTABSIZE 2 -#define MAXIWTHABS 3 - -#define STRCACHE_N 23 -#define STRCACHE_M 5 - -#undef LUAI_USER_ALIGNMENT_T -#define LUAI_USER_ALIGNMENT_T union { char b[sizeof(void*) * 8]; } - - -/* -** This one is not compatible with tests for opcode optimizations, -** as it blocks some optimizations -#define MAXINDEXRK 0 -*/ - - -/* make stack-overflow tests run faster */ -#undef LUAI_MAXSTACK -#define LUAI_MAXSTACK 50000 - - -/* test mode uses more stack space */ -#undef LUAI_MAXCCALLS -#define LUAI_MAXCCALLS 180 - - -/* force Lua to use its own implementations */ -#undef lua_strx2number -#undef lua_number2strx - - -#endif - diff --git a/src/dependencies/lua/ltm.c b/src/dependencies/lua/ltm.c deleted file mode 100644 index 236f3bb..0000000 --- a/src/dependencies/lua/ltm.c +++ /dev/null @@ -1,276 +0,0 @@ -/* -** $Id: ltm.c $ -** Tag methods -** See Copyright Notice in lua.h -*/ - -#define ltm_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lvm.h" - - -static const char udatatypename[] = "userdata"; - -LUAI_DDEF const char *const luaT_typenames_[LUA_TOTALTYPES] = { - "no value", - "nil", "boolean", udatatypename, "number", - "string", "table", "function", udatatypename, "thread", - "upvalue", "proto" /* these last cases are used for tests only */ -}; - - -void luaT_init (lua_State *L) { - static const char *const luaT_eventname[] = { /* ORDER TM */ - "__index", "__newindex", - "__gc", "__mode", "__len", "__eq", - "__add", "__sub", "__mul", "__mod", "__pow", - "__div", "__idiv", - "__band", "__bor", "__bxor", "__shl", "__shr", - "__unm", "__bnot", "__lt", "__le", - "__concat", "__call", "__close" - }; - int i; - for (i=0; itmname[i] = luaS_new(L, luaT_eventname[i]); - luaC_fix(L, obj2gco(G(L)->tmname[i])); /* never collect these names */ - } -} - - -/* -** function to be used with macro "fasttm": optimized for absence of -** tag methods -*/ -const TValue *luaT_gettm (Table *events, TMS event, TString *ename) { - const TValue *tm = luaH_Hgetshortstr(events, ename); - lua_assert(event <= TM_EQ); - if (notm(tm)) { /* no tag method? */ - events->flags |= cast_byte(1u<metatable; - break; - case LUA_TUSERDATA: - mt = uvalue(o)->metatable; - break; - default: - mt = G(L)->mt[ttype(o)]; - } - return (mt ? luaH_Hgetshortstr(mt, G(L)->tmname[event]) : &G(L)->nilvalue); -} - - -/* -** Return the name of the type of an object. For tables and userdata -** with metatable, use their '__name' metafield, if present. -*/ -const char *luaT_objtypename (lua_State *L, const TValue *o) { - Table *mt; - if ((ttistable(o) && (mt = hvalue(o)->metatable) != NULL) || - (ttisfulluserdata(o) && (mt = uvalue(o)->metatable) != NULL)) { - const TValue *name = luaH_Hgetshortstr(mt, luaS_new(L, "__name")); - if (ttisstring(name)) /* is '__name' a string? */ - return getstr(tsvalue(name)); /* use it as type name */ - } - return ttypename(ttype(o)); /* else use standard type name */ -} - - -void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, const TValue *p3) { - StkId func = L->top.p; - setobj2s(L, func, f); /* push function (assume EXTRA_STACK) */ - setobj2s(L, func + 1, p1); /* 1st argument */ - setobj2s(L, func + 2, p2); /* 2nd argument */ - setobj2s(L, func + 3, p3); /* 3rd argument */ - L->top.p = func + 4; - /* metamethod may yield only when called from Lua code */ - if (isLuacode(L->ci)) - luaD_call(L, func, 0); - else - luaD_callnoyield(L, func, 0); -} - - -int luaT_callTMres (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, StkId res) { - ptrdiff_t result = savestack(L, res); - StkId func = L->top.p; - setobj2s(L, func, f); /* push function (assume EXTRA_STACK) */ - setobj2s(L, func + 1, p1); /* 1st argument */ - setobj2s(L, func + 2, p2); /* 2nd argument */ - L->top.p += 3; - /* metamethod may yield only when called from Lua code */ - if (isLuacode(L->ci)) - luaD_call(L, func, 1); - else - luaD_callnoyield(L, func, 1); - res = restorestack(L, result); - setobjs2s(L, res, --L->top.p); /* move result to its place */ - return ttypetag(s2v(res)); /* return tag of the result */ -} - - -static int callbinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event) { - const TValue *tm = luaT_gettmbyobj(L, p1, event); /* try first operand */ - if (notm(tm)) - tm = luaT_gettmbyobj(L, p2, event); /* try second operand */ - if (notm(tm)) - return -1; /* tag method not found */ - else /* call tag method and return the tag of the result */ - return luaT_callTMres(L, tm, p1, p2, res); -} - - -void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event) { - if (l_unlikely(callbinTM(L, p1, p2, res, event) < 0)) { - switch (event) { - case TM_BAND: case TM_BOR: case TM_BXOR: - case TM_SHL: case TM_SHR: case TM_BNOT: { - if (ttisnumber(p1) && ttisnumber(p2)) - luaG_tointerror(L, p1, p2); - else - luaG_opinterror(L, p1, p2, "perform bitwise operation on"); - } - /* calls never return, but to avoid warnings: *//* FALLTHROUGH */ - default: - luaG_opinterror(L, p1, p2, "perform arithmetic on"); - } - } -} - - -/* -** The use of 'p1' after 'callbinTM' is safe because, when a tag -** method is not found, 'callbinTM' cannot change the stack. -*/ -void luaT_tryconcatTM (lua_State *L) { - StkId p1 = L->top.p - 2; /* first argument */ - if (l_unlikely(callbinTM(L, s2v(p1), s2v(p1 + 1), p1, TM_CONCAT) < 0)) - luaG_concaterror(L, s2v(p1), s2v(p1 + 1)); -} - - -void luaT_trybinassocTM (lua_State *L, const TValue *p1, const TValue *p2, - int flip, StkId res, TMS event) { - if (flip) - luaT_trybinTM(L, p2, p1, res, event); - else - luaT_trybinTM(L, p1, p2, res, event); -} - - -void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, - int flip, StkId res, TMS event) { - TValue aux; - setivalue(&aux, i2); - luaT_trybinassocTM(L, p1, &aux, flip, res, event); -} - - -/* -** Calls an order tag method. -** For lessequal, LUA_COMPAT_LT_LE keeps compatibility with old -** behavior: if there is no '__le', try '__lt', based on l <= r iff -** !(r < l) (assuming a total order). If the metamethod yields during -** this substitution, the continuation has to know about it (to negate -** the result of rtop.p, event); /* try original event */ - if (tag >= 0) /* found tag method? */ - return !tagisfalse(tag); -#if defined(LUA_COMPAT_LT_LE) - else if (event == TM_LE) { - /* try '!(p2 < p1)' for '(p1 <= p2)' */ - L->ci->callstatus |= CIST_LEQ; /* mark it is doing 'lt' for 'le' */ - tag = callbinTM(L, p2, p1, L->top.p, TM_LT); - L->ci->callstatus ^= CIST_LEQ; /* clear mark */ - if (tag >= 0) /* found tag method? */ - return tagisfalse(tag); - } -#endif - luaG_ordererror(L, p1, p2); /* no metamethod found */ - return 0; /* to avoid warnings */ -} - - -int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, - int flip, int isfloat, TMS event) { - TValue aux; const TValue *p2; - if (isfloat) { - setfltvalue(&aux, cast_num(v2)); - } - else - setivalue(&aux, v2); - if (flip) { /* arguments were exchanged? */ - p2 = p1; p1 = &aux; /* correct them */ - } - else - p2 = &aux; - return luaT_callorderTM(L, p1, p2, event); -} - - -void luaT_adjustvarargs (lua_State *L, int nfixparams, CallInfo *ci, - const Proto *p) { - int i; - int actual = cast_int(L->top.p - ci->func.p) - 1; /* number of arguments */ - int nextra = actual - nfixparams; /* number of extra arguments */ - ci->u.l.nextraargs = nextra; - luaD_checkstack(L, p->maxstacksize + 1); - /* copy function to the top of the stack */ - setobjs2s(L, L->top.p++, ci->func.p); - /* move fixed parameters to the top of the stack */ - for (i = 1; i <= nfixparams; i++) { - setobjs2s(L, L->top.p++, ci->func.p + i); - setnilvalue(s2v(ci->func.p + i)); /* erase original parameter (for GC) */ - } - ci->func.p += actual + 1; - ci->top.p += actual + 1; - lua_assert(L->top.p <= ci->top.p && ci->top.p <= L->stack_last.p); -} - - -void luaT_getvarargs (lua_State *L, CallInfo *ci, StkId where, int wanted) { - int i; - int nextra = ci->u.l.nextraargs; - if (wanted < 0) { - wanted = nextra; /* get all extra arguments available */ - checkstackp(L, nextra, where); /* ensure stack space */ - L->top.p = where + nextra; /* next instruction will need top */ - } - for (i = 0; i < wanted && i < nextra; i++) - setobjs2s(L, where + i, ci->func.p - nextra + i); - for (; i < wanted; i++) /* complete required results with nil */ - setnilvalue(s2v(where + i)); -} - diff --git a/src/dependencies/lua/ltm.h b/src/dependencies/lua/ltm.h deleted file mode 100644 index df05b74..0000000 --- a/src/dependencies/lua/ltm.h +++ /dev/null @@ -1,104 +0,0 @@ -/* -** $Id: ltm.h $ -** Tag methods -** See Copyright Notice in lua.h -*/ - -#ifndef ltm_h -#define ltm_h - - -#include "lobject.h" - - -/* -* WARNING: if you change the order of this enumeration, -* grep "ORDER TM" and "ORDER OP" -*/ -typedef enum { - TM_INDEX, - TM_NEWINDEX, - TM_GC, - TM_MODE, - TM_LEN, - TM_EQ, /* last tag method with fast access */ - TM_ADD, - TM_SUB, - TM_MUL, - TM_MOD, - TM_POW, - TM_DIV, - TM_IDIV, - TM_BAND, - TM_BOR, - TM_BXOR, - TM_SHL, - TM_SHR, - TM_UNM, - TM_BNOT, - TM_LT, - TM_LE, - TM_CONCAT, - TM_CALL, - TM_CLOSE, - TM_N /* number of elements in the enum */ -} TMS; - - -/* -** Mask with 1 in all fast-access methods. A 1 in any of these bits -** in the flag of a (meta)table means the metatable does not have the -** corresponding metamethod field. (Bit 6 of the flag indicates that -** the table is using the dummy node; bit 7 is used for 'isrealasize'.) -*/ -#define maskflags (~(~0u << (TM_EQ + 1))) - - -/* -** Test whether there is no tagmethod. -** (Because tagmethods use raw accesses, the result may be an "empty" nil.) -*/ -#define notm(tm) ttisnil(tm) - -#define checknoTM(mt,e) ((mt) == NULL || (mt)->flags & (1u<<(e))) - -#define gfasttm(g,mt,e) \ - (checknoTM(mt, e) ? NULL : luaT_gettm(mt, e, (g)->tmname[e])) - -#define fasttm(l,mt,e) gfasttm(G(l), mt, e) - -#define ttypename(x) luaT_typenames_[(x) + 1] - -LUAI_DDEC(const char *const luaT_typenames_[LUA_TOTALTYPES];) - - -LUAI_FUNC const char *luaT_objtypename (lua_State *L, const TValue *o); - -LUAI_FUNC const TValue *luaT_gettm (Table *events, TMS event, TString *ename); -LUAI_FUNC const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, - TMS event); -LUAI_FUNC void luaT_init (lua_State *L); - -LUAI_FUNC void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, const TValue *p3); -LUAI_FUNC int luaT_callTMres (lua_State *L, const TValue *f, - const TValue *p1, const TValue *p2, StkId p3); -LUAI_FUNC void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event); -LUAI_FUNC void luaT_tryconcatTM (lua_State *L); -LUAI_FUNC void luaT_trybinassocTM (lua_State *L, const TValue *p1, - const TValue *p2, int inv, StkId res, TMS event); -LUAI_FUNC void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, - int inv, StkId res, TMS event); -LUAI_FUNC int luaT_callorderTM (lua_State *L, const TValue *p1, - const TValue *p2, TMS event); -LUAI_FUNC int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, - int inv, int isfloat, TMS event); - -LUAI_FUNC void luaT_adjustvarargs (lua_State *L, int nfixparams, - struct CallInfo *ci, const Proto *p); -LUAI_FUNC void luaT_getvarargs (lua_State *L, struct CallInfo *ci, - StkId where, int wanted); - - -#endif diff --git a/src/dependencies/lua/lua.c b/src/dependencies/lua/lua.c deleted file mode 100644 index 65cf1d4..0000000 --- a/src/dependencies/lua/lua.c +++ /dev/null @@ -1,673 +0,0 @@ -/* -** $Id: lua.c $ -** Lua stand-alone interpreter -** See Copyright Notice in lua.h -*/ - -#define lua_c - -#include "lprefix.h" - - -#include -#include -#include - -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -#if !defined(LUA_PROGNAME) -#define LUA_PROGNAME "lua" -#endif - -#if !defined(LUA_INIT_VAR) -#define LUA_INIT_VAR "LUA_INIT" -#endif - -#define LUA_INITVARVERSION LUA_INIT_VAR LUA_VERSUFFIX - - -static lua_State *globalL = NULL; - -static const char *progname = LUA_PROGNAME; - - -#if defined(LUA_USE_POSIX) /* { */ - -/* -** Use 'sigaction' when available. -*/ -static void setsignal (int sig, void (*handler)(int)) { - struct sigaction sa; - sa.sa_handler = handler; - sa.sa_flags = 0; - sigemptyset(&sa.sa_mask); /* do not mask any signal */ - sigaction(sig, &sa, NULL); -} - -#else /* }{ */ - -#define setsignal signal - -#endif /* } */ - - -/* -** Hook set by signal function to stop the interpreter. -*/ -static void lstop (lua_State *L, lua_Debug *ar) { - (void)ar; /* unused arg. */ - lua_sethook(L, NULL, 0, 0); /* reset hook */ - luaL_error(L, "interrupted!"); -} - - -/* -** Function to be called at a C signal. Because a C signal cannot -** just change a Lua state (as there is no proper synchronization), -** this function only sets a hook that, when called, will stop the -** interpreter. -*/ -static void laction (int i) { - int flag = LUA_MASKCALL | LUA_MASKRET | LUA_MASKLINE | LUA_MASKCOUNT; - setsignal(i, SIG_DFL); /* if another SIGINT happens, terminate process */ - lua_sethook(globalL, lstop, flag, 1); -} - - -static void print_usage (const char *badoption) { - lua_writestringerror("%s: ", progname); - if (badoption[1] == 'e' || badoption[1] == 'l') - lua_writestringerror("'%s' needs argument\n", badoption); - else - lua_writestringerror("unrecognized option '%s'\n", badoption); - lua_writestringerror( - "usage: %s [options] [script [args]]\n" - "Available options are:\n" - " -e stat execute string 'stat'\n" - " -i enter interactive mode after executing 'script'\n" - " -l mod require library 'mod' into global 'mod'\n" - " -l g=mod require library 'mod' into global 'g'\n" - " -v show version information\n" - " -E ignore environment variables\n" - " -W turn warnings on\n" - " -- stop handling options\n" - " - stop handling options and execute stdin\n" - , - progname); -} - - -/* -** Prints an error message, adding the program name in front of it -** (if present) -*/ -static void l_message (const char *pname, const char *msg) { - if (pname) lua_writestringerror("%s: ", pname); - lua_writestringerror("%s\n", msg); -} - - -/* -** Check whether 'status' is not OK and, if so, prints the error -** message on the top of the stack. It assumes that the error object -** is a string, as it was either generated by Lua or by 'msghandler'. -*/ -static int report (lua_State *L, int status) { - if (status != LUA_OK) { - const char *msg = lua_tostring(L, -1); - l_message(progname, msg); - lua_pop(L, 1); /* remove message */ - } - return status; -} - - -/* -** Message handler used to run all chunks -*/ -static int msghandler (lua_State *L) { - const char *msg = lua_tostring(L, 1); - if (msg == NULL) { /* is error object not a string? */ - if (luaL_callmeta(L, 1, "__tostring") && /* does it have a metamethod */ - lua_type(L, -1) == LUA_TSTRING) /* that produces a string? */ - return 1; /* that is the message */ - else - msg = lua_pushfstring(L, "(error object is a %s value)", - luaL_typename(L, 1)); - } - luaL_traceback(L, L, msg, 1); /* append a standard traceback */ - return 1; /* return the traceback */ -} - - -/* -** Interface to 'lua_pcall', which sets appropriate message function -** and C-signal handler. Used to run all chunks. -*/ -static int docall (lua_State *L, int narg, int nres) { - int status; - int base = lua_gettop(L) - narg; /* function index */ - lua_pushcfunction(L, msghandler); /* push message handler */ - lua_insert(L, base); /* put it under function and args */ - globalL = L; /* to be available to 'laction' */ - setsignal(SIGINT, laction); /* set C-signal handler */ - status = lua_pcall(L, narg, nres, base); - setsignal(SIGINT, SIG_DFL); /* reset C-signal handler */ - lua_remove(L, base); /* remove message handler from the stack */ - return status; -} - - -static void print_version (void) { - lua_writestring(LUA_COPYRIGHT, strlen(LUA_COPYRIGHT)); - lua_writeline(); -} - - -/* -** Create the 'arg' table, which stores all arguments from the -** command line ('argv'). It should be aligned so that, at index 0, -** it has 'argv[script]', which is the script name. The arguments -** to the script (everything after 'script') go to positive indices; -** other arguments (before the script name) go to negative indices. -** If there is no script name, assume interpreter's name as base. -** (If there is no interpreter's name either, 'script' is -1, so -** table sizes are zero.) -*/ -static void createargtable (lua_State *L, char **argv, int argc, int script) { - int i, narg; - narg = argc - (script + 1); /* number of positive indices */ - lua_createtable(L, narg, script + 1); - for (i = 0; i < argc; i++) { - lua_pushstring(L, argv[i]); - lua_rawseti(L, -2, i - script); - } - lua_setglobal(L, "arg"); -} - - -static int dochunk (lua_State *L, int status) { - if (status == LUA_OK) status = docall(L, 0, 0); - return report(L, status); -} - - -static int dofile (lua_State *L, const char *name) { - return dochunk(L, luaL_loadfile(L, name)); -} - - -static int dostring (lua_State *L, const char *s, const char *name) { - return dochunk(L, luaL_loadbuffer(L, s, strlen(s), name)); -} - - -/* -** Receives 'globname[=modname]' and runs 'globname = require(modname)'. -** If there is no explicit modname and globname contains a '-', cut -** the sufix after '-' (the "version") to make the global name. -*/ -static int dolibrary (lua_State *L, char *globname) { - int status; - char *suffix = NULL; - char *modname = strchr(globname, '='); - if (modname == NULL) { /* no explicit name? */ - modname = globname; /* module name is equal to global name */ - suffix = strchr(modname, *LUA_IGMARK); /* look for a suffix mark */ - } - else { - *modname = '\0'; /* global name ends here */ - modname++; /* module name starts after the '=' */ - } - lua_getglobal(L, "require"); - lua_pushstring(L, modname); - status = docall(L, 1, 1); /* call 'require(modname)' */ - if (status == LUA_OK) { - if (suffix != NULL) /* is there a suffix mark? */ - *suffix = '\0'; /* remove sufix from global name */ - lua_setglobal(L, globname); /* globname = require(modname) */ - } - return report(L, status); -} - - -/* -** Push on the stack the contents of table 'arg' from 1 to #arg -*/ -static int pushargs (lua_State *L) { - int i, n; - if (lua_getglobal(L, "arg") != LUA_TTABLE) - luaL_error(L, "'arg' is not a table"); - n = (int)luaL_len(L, -1); - luaL_checkstack(L, n + 3, "too many arguments to script"); - for (i = 1; i <= n; i++) - lua_rawgeti(L, -i, i); - lua_remove(L, -i); /* remove table from the stack */ - return n; -} - - -static int handle_script (lua_State *L, char **argv) { - int status; - const char *fname = argv[0]; - if (strcmp(fname, "-") == 0 && strcmp(argv[-1], "--") != 0) - fname = NULL; /* stdin */ - status = luaL_loadfile(L, fname); - if (status == LUA_OK) { - int n = pushargs(L); /* push arguments to script */ - status = docall(L, n, LUA_MULTRET); - } - return report(L, status); -} - - -/* bits of various argument indicators in 'args' */ -#define has_error 1 /* bad option */ -#define has_i 2 /* -i */ -#define has_v 4 /* -v */ -#define has_e 8 /* -e */ -#define has_E 16 /* -E */ - - -/* -** Traverses all arguments from 'argv', returning a mask with those -** needed before running any Lua code or an error code if it finds any -** invalid argument. In case of error, 'first' is the index of the bad -** argument. Otherwise, 'first' is -1 if there is no program name, -** 0 if there is no script name, or the index of the script name. -*/ -static int collectargs (char **argv, int *first) { - int args = 0; - int i; - if (argv[0] != NULL) { /* is there a program name? */ - if (argv[0][0]) /* not empty? */ - progname = argv[0]; /* save it */ - } - else { /* no program name */ - *first = -1; - return 0; - } - for (i = 1; argv[i] != NULL; i++) { /* handle arguments */ - *first = i; - if (argv[i][0] != '-') /* not an option? */ - return args; /* stop handling options */ - switch (argv[i][1]) { /* else check option */ - case '-': /* '--' */ - if (argv[i][2] != '\0') /* extra characters after '--'? */ - return has_error; /* invalid option */ - *first = i + 1; - return args; - case '\0': /* '-' */ - return args; /* script "name" is '-' */ - case 'E': - if (argv[i][2] != '\0') /* extra characters? */ - return has_error; /* invalid option */ - args |= has_E; - break; - case 'W': - if (argv[i][2] != '\0') /* extra characters? */ - return has_error; /* invalid option */ - break; - case 'i': - args |= has_i; /* (-i implies -v) *//* FALLTHROUGH */ - case 'v': - if (argv[i][2] != '\0') /* extra characters? */ - return has_error; /* invalid option */ - args |= has_v; - break; - case 'e': - args |= has_e; /* FALLTHROUGH */ - case 'l': /* both options need an argument */ - if (argv[i][2] == '\0') { /* no concatenated argument? */ - i++; /* try next 'argv' */ - if (argv[i] == NULL || argv[i][0] == '-') - return has_error; /* no next argument or it is another option */ - } - break; - default: /* invalid option */ - return has_error; - } - } - *first = 0; /* no script name */ - return args; -} - - -/* -** Processes options 'e' and 'l', which involve running Lua code, and -** 'W', which also affects the state. -** Returns 0 if some code raises an error. -*/ -static int runargs (lua_State *L, char **argv, int n) { - int i; - for (i = 1; i < n; i++) { - int option = argv[i][1]; - lua_assert(argv[i][0] == '-'); /* already checked */ - switch (option) { - case 'e': case 'l': { - int status; - char *extra = argv[i] + 2; /* both options need an argument */ - if (*extra == '\0') extra = argv[++i]; - lua_assert(extra != NULL); - status = (option == 'e') - ? dostring(L, extra, "=(command line)") - : dolibrary(L, extra); - if (status != LUA_OK) return 0; - break; - } - case 'W': - lua_warning(L, "@on", 0); /* warnings on */ - break; - } - } - return 1; -} - - -static int handle_luainit (lua_State *L) { - const char *name = "=" LUA_INITVARVERSION; - const char *init = getenv(name + 1); - if (init == NULL) { - name = "=" LUA_INIT_VAR; - init = getenv(name + 1); /* try alternative name */ - } - if (init == NULL) return LUA_OK; - else if (init[0] == '@') - return dofile(L, init+1); - else - return dostring(L, init, name); -} - - -/* -** {================================================================== -** Read-Eval-Print Loop (REPL) -** =================================================================== -*/ - -#if !defined(LUA_PROMPT) -#define LUA_PROMPT "> " -#define LUA_PROMPT2 ">> " -#endif - -#if !defined(LUA_MAXINPUT) -#define LUA_MAXINPUT 512 -#endif - - -/* -** lua_stdin_is_tty detects whether the standard input is a 'tty' (that -** is, whether we're running lua interactively). -*/ -#if !defined(lua_stdin_is_tty) /* { */ - -#if defined(LUA_USE_POSIX) /* { */ - -#include -#define lua_stdin_is_tty() isatty(0) - -#elif defined(LUA_USE_WINDOWS) /* }{ */ - -#include -#include - -#define lua_stdin_is_tty() _isatty(_fileno(stdin)) - -#else /* }{ */ - -/* ISO C definition */ -#define lua_stdin_is_tty() 1 /* assume stdin is a tty */ - -#endif /* } */ - -#endif /* } */ - - -/* -** lua_readline defines how to show a prompt and then read a line from -** the standard input. -** lua_saveline defines how to "save" a read line in a "history". -** lua_freeline defines how to free a line read by lua_readline. -*/ -#if !defined(lua_readline) /* { */ - -#if defined(LUA_USE_READLINE) /* { */ - -#include -#include -#define lua_initreadline(L) ((void)L, rl_readline_name="lua") -#define lua_readline(L,b,p) ((void)L, ((b)=readline(p)) != NULL) -#define lua_saveline(L,line) ((void)L, add_history(line)) -#define lua_freeline(L,b) ((void)L, free(b)) - -#else /* }{ */ - -#define lua_initreadline(L) ((void)L) -#define lua_readline(L,b,p) \ - ((void)L, fputs(p, stdout), fflush(stdout), /* show prompt */ \ - fgets(b, LUA_MAXINPUT, stdin) != NULL) /* get line */ -#define lua_saveline(L,line) { (void)L; (void)line; } -#define lua_freeline(L,b) { (void)L; (void)b; } - -#endif /* } */ - -#endif /* } */ - - -/* -** Return the string to be used as a prompt by the interpreter. Leave -** the string (or nil, if using the default value) on the stack, to keep -** it anchored. -*/ -static const char *get_prompt (lua_State *L, int firstline) { - if (lua_getglobal(L, firstline ? "_PROMPT" : "_PROMPT2") == LUA_TNIL) - return (firstline ? LUA_PROMPT : LUA_PROMPT2); /* use the default */ - else { /* apply 'tostring' over the value */ - const char *p = luaL_tolstring(L, -1, NULL); - lua_remove(L, -2); /* remove original value */ - return p; - } -} - -/* mark in error messages for incomplete statements */ -#define EOFMARK "" -#define marklen (sizeof(EOFMARK)/sizeof(char) - 1) - - -/* -** Check whether 'status' signals a syntax error and the error -** message at the top of the stack ends with the above mark for -** incomplete statements. -*/ -static int incomplete (lua_State *L, int status) { - if (status == LUA_ERRSYNTAX) { - size_t lmsg; - const char *msg = lua_tolstring(L, -1, &lmsg); - if (lmsg >= marklen && strcmp(msg + lmsg - marklen, EOFMARK) == 0) { - lua_pop(L, 1); - return 1; - } - } - return 0; /* else... */ -} - - -/* -** Prompt the user, read a line, and push it into the Lua stack. -*/ -static int pushline (lua_State *L, int firstline) { - char buffer[LUA_MAXINPUT]; - char *b = buffer; - size_t l; - const char *prmt = get_prompt(L, firstline); - int readstatus = lua_readline(L, b, prmt); - if (readstatus == 0) - return 0; /* no input (prompt will be popped by caller) */ - lua_pop(L, 1); /* remove prompt */ - l = strlen(b); - if (l > 0 && b[l-1] == '\n') /* line ends with newline? */ - b[--l] = '\0'; /* remove it */ - if (firstline && b[0] == '=') /* for compatibility with 5.2, ... */ - lua_pushfstring(L, "return %s", b + 1); /* change '=' to 'return' */ - else - lua_pushlstring(L, b, l); - lua_freeline(L, b); - return 1; -} - - -/* -** Try to compile line on the stack as 'return ;'; on return, stack -** has either compiled chunk or original line (if compilation failed). -*/ -static int addreturn (lua_State *L) { - const char *line = lua_tostring(L, -1); /* original line */ - const char *retline = lua_pushfstring(L, "return %s;", line); - int status = luaL_loadbuffer(L, retline, strlen(retline), "=stdin"); - if (status == LUA_OK) { - lua_remove(L, -2); /* remove modified line */ - if (line[0] != '\0') /* non empty? */ - lua_saveline(L, line); /* keep history */ - } - else - lua_pop(L, 2); /* pop result from 'luaL_loadbuffer' and modified line */ - return status; -} - - -/* -** Read multiple lines until a complete Lua statement -*/ -static int multiline (lua_State *L) { - for (;;) { /* repeat until gets a complete statement */ - size_t len; - const char *line = lua_tolstring(L, 1, &len); /* get what it has */ - int status = luaL_loadbuffer(L, line, len, "=stdin"); /* try it */ - if (!incomplete(L, status) || !pushline(L, 0)) { - lua_saveline(L, line); /* keep history */ - return status; /* cannot or should not try to add continuation line */ - } - lua_pushliteral(L, "\n"); /* add newline... */ - lua_insert(L, -2); /* ...between the two lines */ - lua_concat(L, 3); /* join them */ - } -} - - -/* -** Read a line and try to load (compile) it first as an expression (by -** adding "return " in front of it) and second as a statement. Return -** the final status of load/call with the resulting function (if any) -** in the top of the stack. -*/ -static int loadline (lua_State *L) { - int status; - lua_settop(L, 0); - if (!pushline(L, 1)) - return -1; /* no input */ - if ((status = addreturn(L)) != LUA_OK) /* 'return ...' did not work? */ - status = multiline(L); /* try as command, maybe with continuation lines */ - lua_remove(L, 1); /* remove line from the stack */ - lua_assert(lua_gettop(L) == 1); - return status; -} - - -/* -** Prints (calling the Lua 'print' function) any values on the stack -*/ -static void l_print (lua_State *L) { - int n = lua_gettop(L); - if (n > 0) { /* any result to be printed? */ - luaL_checkstack(L, LUA_MINSTACK, "too many results to print"); - lua_getglobal(L, "print"); - lua_insert(L, 1); - if (lua_pcall(L, n, 0, 0) != LUA_OK) - l_message(progname, lua_pushfstring(L, "error calling 'print' (%s)", - lua_tostring(L, -1))); - } -} - - -/* -** Do the REPL: repeatedly read (load) a line, evaluate (call) it, and -** print any results. -*/ -static void doREPL (lua_State *L) { - int status; - const char *oldprogname = progname; - progname = NULL; /* no 'progname' on errors in interactive mode */ - lua_initreadline(L); - while ((status = loadline(L)) != -1) { - if (status == LUA_OK) - status = docall(L, 0, LUA_MULTRET); - if (status == LUA_OK) l_print(L); - else report(L, status); - } - lua_settop(L, 0); /* clear stack */ - lua_writeline(); - progname = oldprogname; -} - -/* }================================================================== */ - -#if !defined(luai_openlibs) -#define luai_openlibs(L) luaL_openselectedlibs(L, ~0, 0) -#endif - - -/* -** Main body of stand-alone interpreter (to be called in protected mode). -** Reads the options and handles them all. -*/ -static int pmain (lua_State *L) { - int argc = (int)lua_tointeger(L, 1); - char **argv = (char **)lua_touserdata(L, 2); - int script; - int args = collectargs(argv, &script); - int optlim = (script > 0) ? script : argc; /* first argv not an option */ - luaL_checkversion(L); /* check that interpreter has correct version */ - if (args == has_error) { /* bad arg? */ - print_usage(argv[script]); /* 'script' has index of bad arg. */ - return 0; - } - if (args & has_v) /* option '-v'? */ - print_version(); - if (args & has_E) { /* option '-E'? */ - lua_pushboolean(L, 1); /* signal for libraries to ignore env. vars. */ - lua_setfield(L, LUA_REGISTRYINDEX, "LUA_NOENV"); - } - luai_openlibs(L); /* open standard libraries */ - createargtable(L, argv, argc, script); /* create table 'arg' */ - lua_gc(L, LUA_GCRESTART); /* start GC... */ - lua_gc(L, LUA_GCGEN); /* ...in generational mode */ - if (!(args & has_E)) { /* no option '-E'? */ - if (handle_luainit(L) != LUA_OK) /* run LUA_INIT */ - return 0; /* error running LUA_INIT */ - } - if (!runargs(L, argv, optlim)) /* execute arguments -e and -l */ - return 0; /* something failed */ - if (script > 0) { /* execute main script (if there is one) */ - if (handle_script(L, argv + script) != LUA_OK) - return 0; /* interrupt in case of error */ - } - if (args & has_i) /* -i option? */ - doREPL(L); /* do read-eval-print loop */ - else if (script < 1 && !(args & (has_e | has_v))) { /* no active option? */ - if (lua_stdin_is_tty()) { /* running in interactive mode? */ - print_version(); - doREPL(L); /* do read-eval-print loop */ - } - else dofile(L, NULL); /* executes stdin as a file */ - } - lua_pushboolean(L, 1); /* signal no errors */ - return 1; -} - - diff --git a/src/dependencies/lua/lua.h b/src/dependencies/lua/lua.h deleted file mode 100644 index 3b4ba4b..0000000 --- a/src/dependencies/lua/lua.h +++ /dev/null @@ -1,544 +0,0 @@ -/* -** $Id: lua.h $ -** Lua - A Scripting Language -** Lua.org, PUC-Rio, Brazil (www.lua.org) -** See Copyright Notice at the end of this file -*/ - - -#ifndef lua_h -#define lua_h - -#include -#include - - -#define LUA_COPYRIGHT LUA_RELEASE " Copyright (C) 1994-2023 Lua.org, PUC-Rio" -#define LUA_AUTHORS "R. Ierusalimschy, L. H. de Figueiredo, W. Celes" - - -#define LUA_VERSION_MAJOR_N 5 -#define LUA_VERSION_MINOR_N 5 -#define LUA_VERSION_RELEASE_N 0 - -#define LUA_VERSION_NUM (LUA_VERSION_MAJOR_N * 100 + LUA_VERSION_MINOR_N) -#define LUA_VERSION_RELEASE_NUM (LUA_VERSION_NUM * 100 + LUA_VERSION_RELEASE_N) - - -#include "luaconf.h" - - -/* mark for precompiled code ('Lua') */ -#define LUA_SIGNATURE "\x1bLua" - -/* option for multiple returns in 'lua_pcall' and 'lua_call' */ -#define LUA_MULTRET (-1) - - -/* -** Pseudo-indices -** (-LUAI_MAXSTACK is the minimum valid index; we keep some free empty -** space after that to help overflow detection) -*/ -#define LUA_REGISTRYINDEX (-LUAI_MAXSTACK - 1000) -#define lua_upvalueindex(i) (LUA_REGISTRYINDEX - (i)) - - -/* thread status */ -#define LUA_OK 0 -#define LUA_YIELD 1 -#define LUA_ERRRUN 2 -#define LUA_ERRSYNTAX 3 -#define LUA_ERRMEM 4 -#define LUA_ERRERR 5 - - -typedef struct lua_State lua_State; - - -/* -** basic types -*/ -#define LUA_TNONE (-1) - -#define LUA_TNIL 0 -#define LUA_TBOOLEAN 1 -#define LUA_TLIGHTUSERDATA 2 -#define LUA_TNUMBER 3 -#define LUA_TSTRING 4 -#define LUA_TTABLE 5 -#define LUA_TFUNCTION 6 -#define LUA_TUSERDATA 7 -#define LUA_TTHREAD 8 - -#define LUA_NUMTYPES 9 - - - -/* minimum Lua stack available to a C function */ -#define LUA_MINSTACK 20 - - -/* predefined values in the registry */ -/* index 1 is reserved for the reference mechanism */ -#define LUA_RIDX_GLOBALS 2 -#define LUA_RIDX_MAINTHREAD 3 -#define LUA_RIDX_LAST 3 - - -/* type of numbers in Lua */ -typedef LUA_NUMBER lua_Number; - - -/* type for integer functions */ -typedef LUA_INTEGER lua_Integer; - -/* unsigned integer type */ -typedef LUA_UNSIGNED lua_Unsigned; - -/* type for continuation-function contexts */ -typedef LUA_KCONTEXT lua_KContext; - - -/* -** Type for C functions registered with Lua -*/ -typedef int (*lua_CFunction) (lua_State *L); - -/* -** Type for continuation functions -*/ -typedef int (*lua_KFunction) (lua_State *L, int status, lua_KContext ctx); - - -/* -** Type for functions that read/write blocks when loading/dumping Lua chunks -*/ -typedef const char * (*lua_Reader) (lua_State *L, void *ud, size_t *sz); - -typedef int (*lua_Writer) (lua_State *L, const void *p, size_t sz, void *ud); - - -/* -** Type for memory-allocation functions -*/ -typedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize); - - -/* -** Type for warning functions -*/ -typedef void (*lua_WarnFunction) (void *ud, const char *msg, int tocont); - - -/* -** Type used by the debug API to collect debug information -*/ -typedef struct lua_Debug lua_Debug; - - -/* -** Functions to be called by the debugger in specific events -*/ -typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar); - - - -/* -** RCS ident string -*/ -extern const char lua_ident[]; - - -/* -** state manipulation -*/ -LUA_API lua_State *(lua_newstate) (lua_Alloc f, void *ud, unsigned seed); -LUA_API void (lua_close) (lua_State *L); -LUA_API lua_State *(lua_newthread) (lua_State *L); -LUA_API int (lua_closethread) (lua_State *L, lua_State *from); - -LUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf); - - -LUA_API lua_Number (lua_version) (lua_State *L); - - -/* -** basic stack manipulation -*/ -LUA_API int (lua_absindex) (lua_State *L, int idx); -LUA_API int (lua_gettop) (lua_State *L); -LUA_API void (lua_settop) (lua_State *L, int idx); -LUA_API void (lua_pushvalue) (lua_State *L, int idx); -LUA_API void (lua_rotate) (lua_State *L, int idx, int n); -LUA_API void (lua_copy) (lua_State *L, int fromidx, int toidx); -LUA_API int (lua_checkstack) (lua_State *L, int n); - -LUA_API void (lua_xmove) (lua_State *from, lua_State *to, int n); - - -/* -** access functions (stack -> C) -*/ - -LUA_API int (lua_isnumber) (lua_State *L, int idx); -LUA_API int (lua_isstring) (lua_State *L, int idx); -LUA_API int (lua_iscfunction) (lua_State *L, int idx); -LUA_API int (lua_isinteger) (lua_State *L, int idx); -LUA_API int (lua_isuserdata) (lua_State *L, int idx); -LUA_API int (lua_type) (lua_State *L, int idx); -LUA_API const char *(lua_typename) (lua_State *L, int tp); - -LUA_API lua_Number (lua_tonumberx) (lua_State *L, int idx, int *isnum); -LUA_API lua_Integer (lua_tointegerx) (lua_State *L, int idx, int *isnum); -LUA_API int (lua_toboolean) (lua_State *L, int idx); -LUA_API const char *(lua_tolstring) (lua_State *L, int idx, size_t *len); -LUA_API lua_Unsigned (lua_rawlen) (lua_State *L, int idx); -LUA_API lua_CFunction (lua_tocfunction) (lua_State *L, int idx); -LUA_API void *(lua_touserdata) (lua_State *L, int idx); -LUA_API lua_State *(lua_tothread) (lua_State *L, int idx); -LUA_API const void *(lua_topointer) (lua_State *L, int idx); - - -/* -** Comparison and arithmetic functions -*/ - -#define LUA_OPADD 0 /* ORDER TM, ORDER OP */ -#define LUA_OPSUB 1 -#define LUA_OPMUL 2 -#define LUA_OPMOD 3 -#define LUA_OPPOW 4 -#define LUA_OPDIV 5 -#define LUA_OPIDIV 6 -#define LUA_OPBAND 7 -#define LUA_OPBOR 8 -#define LUA_OPBXOR 9 -#define LUA_OPSHL 10 -#define LUA_OPSHR 11 -#define LUA_OPUNM 12 -#define LUA_OPBNOT 13 - -LUA_API void (lua_arith) (lua_State *L, int op); - -#define LUA_OPEQ 0 -#define LUA_OPLT 1 -#define LUA_OPLE 2 - -LUA_API int (lua_rawequal) (lua_State *L, int idx1, int idx2); -LUA_API int (lua_compare) (lua_State *L, int idx1, int idx2, int op); - - -/* -** push functions (C -> stack) -*/ -LUA_API void (lua_pushnil) (lua_State *L); -LUA_API void (lua_pushnumber) (lua_State *L, lua_Number n); -LUA_API void (lua_pushinteger) (lua_State *L, lua_Integer n); -LUA_API const char *(lua_pushlstring) (lua_State *L, const char *s, size_t len); -LUA_API const char *(lua_pushextlstring) (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud); -LUA_API const char *(lua_pushstring) (lua_State *L, const char *s); -LUA_API const char *(lua_pushvfstring) (lua_State *L, const char *fmt, - va_list argp); -LUA_API const char *(lua_pushfstring) (lua_State *L, const char *fmt, ...); -LUA_API void (lua_pushcclosure) (lua_State *L, lua_CFunction fn, int n); -LUA_API void (lua_pushboolean) (lua_State *L, int b); -LUA_API void (lua_pushlightuserdata) (lua_State *L, void *p); -LUA_API int (lua_pushthread) (lua_State *L); - - -/* -** get functions (Lua -> stack) -*/ -LUA_API int (lua_getglobal) (lua_State *L, const char *name); -LUA_API int (lua_gettable) (lua_State *L, int idx); -LUA_API int (lua_getfield) (lua_State *L, int idx, const char *k); -LUA_API int (lua_geti) (lua_State *L, int idx, lua_Integer n); -LUA_API int (lua_rawget) (lua_State *L, int idx); -LUA_API int (lua_rawgeti) (lua_State *L, int idx, lua_Integer n); -LUA_API int (lua_rawgetp) (lua_State *L, int idx, const void *p); - -LUA_API void (lua_createtable) (lua_State *L, unsigned narr, unsigned nrec); -LUA_API void *(lua_newuserdatauv) (lua_State *L, size_t sz, int nuvalue); -LUA_API int (lua_getmetatable) (lua_State *L, int objindex); -LUA_API int (lua_getiuservalue) (lua_State *L, int idx, int n); - - -/* -** set functions (stack -> Lua) -*/ -LUA_API void (lua_setglobal) (lua_State *L, const char *name); -LUA_API void (lua_settable) (lua_State *L, int idx); -LUA_API void (lua_setfield) (lua_State *L, int idx, const char *k); -LUA_API void (lua_seti) (lua_State *L, int idx, lua_Integer n); -LUA_API void (lua_rawset) (lua_State *L, int idx); -LUA_API void (lua_rawseti) (lua_State *L, int idx, lua_Integer n); -LUA_API void (lua_rawsetp) (lua_State *L, int idx, const void *p); -LUA_API int (lua_setmetatable) (lua_State *L, int objindex); -LUA_API int (lua_setiuservalue) (lua_State *L, int idx, int n); - - -/* -** 'load' and 'call' functions (load and run Lua code) -*/ -LUA_API void (lua_callk) (lua_State *L, int nargs, int nresults, - lua_KContext ctx, lua_KFunction k); -#define lua_call(L,n,r) lua_callk(L, (n), (r), 0, NULL) - -LUA_API int (lua_pcallk) (lua_State *L, int nargs, int nresults, int errfunc, - lua_KContext ctx, lua_KFunction k); -#define lua_pcall(L,n,r,f) lua_pcallk(L, (n), (r), (f), 0, NULL) - -LUA_API int (lua_load) (lua_State *L, lua_Reader reader, void *dt, - const char *chunkname, const char *mode); - -LUA_API int (lua_dump) (lua_State *L, lua_Writer writer, void *data, int strip); - - -/* -** coroutine functions -*/ -LUA_API int (lua_yieldk) (lua_State *L, int nresults, lua_KContext ctx, - lua_KFunction k); -LUA_API int (lua_resume) (lua_State *L, lua_State *from, int narg, - int *nres); -LUA_API int (lua_status) (lua_State *L); -LUA_API int (lua_isyieldable) (lua_State *L); - -#define lua_yield(L,n) lua_yieldk(L, (n), 0, NULL) - - -/* -** Warning-related functions -*/ -LUA_API void (lua_setwarnf) (lua_State *L, lua_WarnFunction f, void *ud); -LUA_API void (lua_warning) (lua_State *L, const char *msg, int tocont); - - -/* -** garbage-collection options -*/ - -#define LUA_GCSTOP 0 -#define LUA_GCRESTART 1 -#define LUA_GCCOLLECT 2 -#define LUA_GCCOUNT 3 -#define LUA_GCCOUNTB 4 -#define LUA_GCSTEP 5 -#define LUA_GCISRUNNING 6 -#define LUA_GCGEN 7 -#define LUA_GCINC 8 -#define LUA_GCPARAM 9 - - -/* -** garbage-collection parameters -*/ -/* parameters for generational mode */ -#define LUA_GCPMINORMUL 0 /* control minor collections */ -#define LUA_GCPMAJORMINOR 1 /* control shift major->minor */ -#define LUA_GCPMINORMAJOR 2 /* control shift minor->major */ - -/* parameters for incremental mode */ -#define LUA_GCPPAUSE 3 /* size of pause between successive GCs */ -#define LUA_GCPSTEPMUL 4 /* GC */ -#define LUA_GCPSTEPSIZE 5 /* GC granularity */ - -/* number of parameters */ -#define LUA_GCPN 6 - - -LUA_API int (lua_gc) (lua_State *L, int what, ...); - - -/* -** miscellaneous functions -*/ - -LUA_API int (lua_error) (lua_State *L); - -LUA_API int (lua_next) (lua_State *L, int idx); - -LUA_API void (lua_concat) (lua_State *L, int n); -LUA_API void (lua_len) (lua_State *L, int idx); - -LUA_API size_t (lua_stringtonumber) (lua_State *L, const char *s); - -LUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud); -LUA_API void (lua_setallocf) (lua_State *L, lua_Alloc f, void *ud); - -LUA_API void (lua_toclose) (lua_State *L, int idx); -LUA_API void (lua_closeslot) (lua_State *L, int idx); - - -/* -** {============================================================== -** some useful macros -** =============================================================== -*/ - -#define lua_getextraspace(L) ((void *)((char *)(L) - LUA_EXTRASPACE)) - -#define lua_tonumber(L,i) lua_tonumberx(L,(i),NULL) -#define lua_tointeger(L,i) lua_tointegerx(L,(i),NULL) - -#define lua_pop(L,n) lua_settop(L, -(n)-1) - -#define lua_newtable(L) lua_createtable(L, 0, 0) - -#define lua_register(L,n,f) (lua_pushcfunction(L, (f)), lua_setglobal(L, (n))) - -#define lua_pushcfunction(L,f) lua_pushcclosure(L, (f), 0) - -#define lua_isfunction(L,n) (lua_type(L, (n)) == LUA_TFUNCTION) -#define lua_istable(L,n) (lua_type(L, (n)) == LUA_TTABLE) -#define lua_islightuserdata(L,n) (lua_type(L, (n)) == LUA_TLIGHTUSERDATA) -#define lua_isnil(L,n) (lua_type(L, (n)) == LUA_TNIL) -#define lua_isboolean(L,n) (lua_type(L, (n)) == LUA_TBOOLEAN) -#define lua_isthread(L,n) (lua_type(L, (n)) == LUA_TTHREAD) -#define lua_isnone(L,n) (lua_type(L, (n)) == LUA_TNONE) -#define lua_isnoneornil(L, n) (lua_type(L, (n)) <= 0) - -#define lua_pushliteral(L, s) lua_pushstring(L, "" s) - -#define lua_pushglobaltable(L) \ - ((void)lua_rawgeti(L, LUA_REGISTRYINDEX, LUA_RIDX_GLOBALS)) - -#define lua_tostring(L,i) lua_tolstring(L, (i), NULL) - - -#define lua_insert(L,idx) lua_rotate(L, (idx), 1) - -#define lua_remove(L,idx) (lua_rotate(L, (idx), -1), lua_pop(L, 1)) - -#define lua_replace(L,idx) (lua_copy(L, -1, (idx)), lua_pop(L, 1)) - -/* }============================================================== */ - - -/* -** {============================================================== -** compatibility macros -** =============================================================== -*/ -#if defined(LUA_COMPAT_APIINTCASTS) - -#define lua_pushunsigned(L,n) lua_pushinteger(L, (lua_Integer)(n)) -#define lua_tounsignedx(L,i,is) ((lua_Unsigned)lua_tointegerx(L,i,is)) -#define lua_tounsigned(L,i) lua_tounsignedx(L,(i),NULL) - -#endif - -#define lua_newuserdata(L,s) lua_newuserdatauv(L,s,1) -#define lua_getuservalue(L,idx) lua_getiuservalue(L,idx,1) -#define lua_setuservalue(L,idx) lua_setiuservalue(L,idx,1) - -#define lua_resetthread(L) lua_closethread(L,NULL) - -/* }============================================================== */ - -/* -** {====================================================================== -** Debug API -** ======================================================================= -*/ - - -/* -** Event codes -*/ -#define LUA_HOOKCALL 0 -#define LUA_HOOKRET 1 -#define LUA_HOOKLINE 2 -#define LUA_HOOKCOUNT 3 -#define LUA_HOOKTAILCALL 4 - - -/* -** Event masks -*/ -#define LUA_MASKCALL (1 << LUA_HOOKCALL) -#define LUA_MASKRET (1 << LUA_HOOKRET) -#define LUA_MASKLINE (1 << LUA_HOOKLINE) -#define LUA_MASKCOUNT (1 << LUA_HOOKCOUNT) - - -LUA_API int (lua_getstack) (lua_State *L, int level, lua_Debug *ar); -LUA_API int (lua_getinfo) (lua_State *L, const char *what, lua_Debug *ar); -LUA_API const char *(lua_getlocal) (lua_State *L, const lua_Debug *ar, int n); -LUA_API const char *(lua_setlocal) (lua_State *L, const lua_Debug *ar, int n); -LUA_API const char *(lua_getupvalue) (lua_State *L, int funcindex, int n); -LUA_API const char *(lua_setupvalue) (lua_State *L, int funcindex, int n); - -LUA_API void *(lua_upvalueid) (lua_State *L, int fidx, int n); -LUA_API void (lua_upvaluejoin) (lua_State *L, int fidx1, int n1, - int fidx2, int n2); - -LUA_API void (lua_sethook) (lua_State *L, lua_Hook func, int mask, int count); -LUA_API lua_Hook (lua_gethook) (lua_State *L); -LUA_API int (lua_gethookmask) (lua_State *L); -LUA_API int (lua_gethookcount) (lua_State *L); - - -struct lua_Debug { - int event; - const char *name; /* (n) */ - const char *namewhat; /* (n) 'global', 'local', 'field', 'method' */ - const char *what; /* (S) 'Lua', 'C', 'main', 'tail' */ - const char *source; /* (S) */ - size_t srclen; /* (S) */ - int currentline; /* (l) */ - int linedefined; /* (S) */ - int lastlinedefined; /* (S) */ - unsigned char nups; /* (u) number of upvalues */ - unsigned char nparams;/* (u) number of parameters */ - char isvararg; /* (u) */ - char istailcall; /* (t) */ - unsigned short ftransfer; /* (r) index of first value transferred */ - unsigned short ntransfer; /* (r) number of transferred values */ - char short_src[LUA_IDSIZE]; /* (S) */ - /* private part */ - struct CallInfo *i_ci; /* active function */ -}; - -/* }====================================================================== */ - - -#define LUAI_TOSTRAUX(x) #x -#define LUAI_TOSTR(x) LUAI_TOSTRAUX(x) - -#define LUA_VERSION_MAJOR LUAI_TOSTR(LUA_VERSION_MAJOR_N) -#define LUA_VERSION_MINOR LUAI_TOSTR(LUA_VERSION_MINOR_N) -#define LUA_VERSION_RELEASE LUAI_TOSTR(LUA_VERSION_RELEASE_N) - -#define LUA_VERSION "Lua " LUA_VERSION_MAJOR "." LUA_VERSION_MINOR -#define LUA_RELEASE LUA_VERSION "." LUA_VERSION_RELEASE - - -/****************************************************************************** -* Copyright (C) 1994-2023 Lua.org, PUC-Rio. -* -* Permission is hereby granted, free of charge, to any person obtaining -* a copy of this software and associated documentation files (the -* "Software"), to deal in the Software without restriction, including -* without limitation the rights to use, copy, modify, merge, publish, -* distribute, sublicense, and/or sell copies of the Software, and to -* permit persons to whom the Software is furnished to do so, subject to -* the following conditions: -* -* The above copyright notice and this permission notice shall be -* included in all copies or substantial portions of the Software. -* -* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. -* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY -* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, -* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE -* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. -******************************************************************************/ - - -#endif diff --git a/src/dependencies/lua/luac.c b/src/dependencies/lua/luac.c deleted file mode 100644 index 7c3f967..0000000 --- a/src/dependencies/lua/luac.c +++ /dev/null @@ -1,724 +0,0 @@ - -/* -** $Id: luac.c $ -** Lua compiler (saves bytecodes to files; also lists bytecodes) -** See Copyright Notice in lua.h -*/ - -#define luac_c -#define LUA_CORE - -#include "lprefix.h" - -#include -#include -#include -#include -#include - -#include "lua.h" -#include "lauxlib.h" - -#include "ldebug.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lopnames.h" -#include "lstate.h" -#include "lundump.h" - -static void PrintFunction(const Proto* f, int full); -#define luaU_print PrintFunction - -#define PROGNAME "luac" /* default program name */ -#define OUTPUT PROGNAME ".out" /* default output file */ - -static int listing=0; /* list bytecodes? */ -static int dumping=1; /* dump bytecodes? */ -static int stripping=0; /* strip debug information? */ -static char Output[]={ OUTPUT }; /* default output file name */ -static const char* output=Output; /* actual output file name */ -static const char* progname=PROGNAME; /* actual program name */ -static TString **tmname; - -static void fatal(const char* message) -{ - fprintf(stderr,"%s: %s\n",progname,message); - exit(EXIT_FAILURE); -} - -static void cannot(const char* what) -{ - fprintf(stderr,"%s: cannot %s %s: %s\n",progname,what,output,strerror(errno)); - exit(EXIT_FAILURE); -} - -static void usage(const char* message) -{ - if (*message=='-') - fprintf(stderr,"%s: unrecognized option '%s'\n",progname,message); - else - fprintf(stderr,"%s: %s\n",progname,message); - fprintf(stderr, - "usage: %s [options] [filenames]\n" - "Available options are:\n" - " -l list (use -l -l for full listing)\n" - " -o name output to file 'name' (default is \"%s\")\n" - " -p parse only\n" - " -s strip debug information\n" - " -v show version information\n" - " -- stop handling options\n" - " - stop handling options and process stdin\n" - ,progname,Output); - exit(EXIT_FAILURE); -} - -#define IS(s) (strcmp(argv[i],s)==0) - -static int doargs(int argc, char* argv[]) -{ - int i; - int version=0; - if (argv[0]!=NULL && *argv[0]!=0) progname=argv[0]; - for (i=1; itop.p+(i))) - -static const Proto* combine(lua_State* L, int n) -{ - if (n==1) - return toproto(L,-1); - else - { - Proto* f; - int i=n; - if (lua_load(L,reader,&i,"=(" PROGNAME ")",NULL)!=LUA_OK) fatal(lua_tostring(L,-1)); - f=toproto(L,-1); - for (i=0; ip[i]=toproto(L,i-n-1); - if (f->p[i]->sizeupvalues>0) f->p[i]->upvalues[0].instack=0; - } - return f; - } -} - -static int writer(lua_State* L, const void* p, size_t size, void* u) -{ - UNUSED(L); - return (fwrite(p,size,1,(FILE*)u)!=1) && (size!=0); -} - -static int pmain(lua_State* L) -{ - int argc=(int)lua_tointeger(L,1); - char** argv=(char**)lua_touserdata(L,2); - const Proto* f; - int i; - tmname=G(L)->tmname; - if (!lua_checkstack(L,argc)) fatal("too many input files"); - for (i=0; i1); - if (dumping) - { - FILE* D= (output==NULL) ? stdout : fopen(output,"wb"); - if (D==NULL) cannot("open"); - lua_lock(L); - luaU_dump(L,f,writer,D,stripping); - lua_unlock(L); - if (ferror(D)) cannot("write"); - if (fclose(D)) cannot("close"); - } - return 0; -} - -int main(int argc, char* argv[]) -{ - lua_State* L; - int i=doargs(argc,argv); - argc-=i; argv+=i; - if (argc<=0) usage("no input files given"); - L=luaL_newstate(); - if (L==NULL) fatal("cannot create state: not enough memory"); - lua_pushcfunction(L,&pmain); - lua_pushinteger(L,argc); - lua_pushlightuserdata(L,argv); - if (lua_pcall(L,2,0,0)!=LUA_OK) fatal(lua_tostring(L,-1)); - lua_close(L); - return EXIT_SUCCESS; -} - -/* -** print bytecodes -*/ - -#define UPVALNAME(x) ((f->upvalues[x].name) ? getstr(f->upvalues[x].name) : "-") -#define VOID(p) ((const void*)(p)) -#define eventname(i) (getstr(tmname[i])) - -static void PrintString(const TString* ts) -{ - const char* s=getstr(ts); - size_t i,n=tsslen(ts); - printf("\""); - for (i=0; ik[i]; - switch (ttypetag(o)) - { - case LUA_VNIL: - printf("N"); - break; - case LUA_VFALSE: - case LUA_VTRUE: - printf("B"); - break; - case LUA_VNUMFLT: - printf("F"); - break; - case LUA_VNUMINT: - printf("I"); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - printf("S"); - break; - default: /* cannot happen */ - printf("?%d",ttypetag(o)); - break; - } - printf("\t"); -} - -static void PrintConstant(const Proto* f, int i) -{ - const TValue* o=&f->k[i]; - switch (ttypetag(o)) - { - case LUA_VNIL: - printf("nil"); - break; - case LUA_VFALSE: - printf("false"); - break; - case LUA_VTRUE: - printf("true"); - break; - case LUA_VNUMFLT: - { - char buff[100]; - sprintf(buff,LUA_NUMBER_FMT,fltvalue(o)); - printf("%s",buff); - if (buff[strspn(buff,"-0123456789")]=='\0') printf(".0"); - break; - } - case LUA_VNUMINT: - printf(LUA_INTEGER_FMT,ivalue(o)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - PrintString(tsvalue(o)); - break; - default: /* cannot happen */ - printf("?%d",ttypetag(o)); - break; - } -} - -#define COMMENT "\t; " -#define EXTRAARG GETARG_Ax(code[pc+1]) -#define EXTRAARGC (EXTRAARG*(MAXARG_C+1)) -#define ISK (isk ? "k" : "") - -static void PrintCode(const Proto* f) -{ - const Instruction* code=f->code; - int pc,n=f->sizecode; - for (pc=0; pc0) printf("[%d]\t",line); else printf("[-]\t"); - printf("%-9s\t",opnames[o]); - switch (o) - { - case OP_MOVE: - printf("%d %d",a,b); - break; - case OP_LOADI: - printf("%d %d",a,sbx); - break; - case OP_LOADF: - printf("%d %d",a,sbx); - break; - case OP_LOADK: - printf("%d %d",a,bx); - printf(COMMENT); PrintConstant(f,bx); - break; - case OP_LOADKX: - printf("%d",a); - printf(COMMENT); PrintConstant(f,EXTRAARG); - break; - case OP_LOADFALSE: - printf("%d",a); - break; - case OP_LFALSESKIP: - printf("%d",a); - break; - case OP_LOADTRUE: - printf("%d",a); - break; - case OP_LOADNIL: - printf("%d %d",a,b); - printf(COMMENT "%d out",b+1); - break; - case OP_GETUPVAL: - printf("%d %d",a,b); - printf(COMMENT "%s",UPVALNAME(b)); - break; - case OP_SETUPVAL: - printf("%d %d",a,b); - printf(COMMENT "%s",UPVALNAME(b)); - break; - case OP_GETTABUP: - printf("%d %d %d",a,b,c); - printf(COMMENT "%s",UPVALNAME(b)); - printf(" "); PrintConstant(f,c); - break; - case OP_GETTABLE: - printf("%d %d %d",a,b,c); - break; - case OP_GETI: - printf("%d %d %d",a,b,c); - break; - case OP_GETFIELD: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_SETTABUP: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT "%s",UPVALNAME(a)); - printf(" "); PrintConstant(f,b); - if (isk) { printf(" "); PrintConstant(f,c); } - break; - case OP_SETTABLE: - printf("%d %d %d%s",a,b,c,ISK); - if (isk) { printf(COMMENT); PrintConstant(f,c); } - break; - case OP_SETI: - printf("%d %d %d%s",a,b,c,ISK); - if (isk) { printf(COMMENT); PrintConstant(f,c); } - break; - case OP_SETFIELD: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT); PrintConstant(f,b); - if (isk) { printf(" "); PrintConstant(f,c); } - break; - case OP_NEWTABLE: - printf("%d %d %d",a,b,c); - printf(COMMENT "%d",c+EXTRAARGC); - break; - case OP_SELF: - printf("%d %d %d%s",a,b,c,ISK); - if (isk) { printf(COMMENT); PrintConstant(f,c); } - break; - case OP_ADDI: - printf("%d %d %d",a,b,sc); - break; - case OP_ADDK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_SUBK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_MULK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_MODK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_POWK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_DIVK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_IDIVK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_BANDK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_BORK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_BXORK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_SHRI: - printf("%d %d %d",a,b,sc); - break; - case OP_SHLI: - printf("%d %d %d",a,b,sc); - break; - case OP_ADD: - printf("%d %d %d",a,b,c); - break; - case OP_SUB: - printf("%d %d %d",a,b,c); - break; - case OP_MUL: - printf("%d %d %d",a,b,c); - break; - case OP_MOD: - printf("%d %d %d",a,b,c); - break; - case OP_POW: - printf("%d %d %d",a,b,c); - break; - case OP_DIV: - printf("%d %d %d",a,b,c); - break; - case OP_IDIV: - printf("%d %d %d",a,b,c); - break; - case OP_BAND: - printf("%d %d %d",a,b,c); - break; - case OP_BOR: - printf("%d %d %d",a,b,c); - break; - case OP_BXOR: - printf("%d %d %d",a,b,c); - break; - case OP_SHL: - printf("%d %d %d",a,b,c); - break; - case OP_SHR: - printf("%d %d %d",a,b,c); - break; - case OP_MMBIN: - printf("%d %d %d",a,b,c); - printf(COMMENT "%s",eventname(c)); - break; - case OP_MMBINI: - printf("%d %d %d %d",a,sb,c,isk); - printf(COMMENT "%s",eventname(c)); - if (isk) printf(" flip"); - break; - case OP_MMBINK: - printf("%d %d %d %d",a,b,c,isk); - printf(COMMENT "%s ",eventname(c)); PrintConstant(f,b); - if (isk) printf(" flip"); - break; - case OP_UNM: - printf("%d %d",a,b); - break; - case OP_BNOT: - printf("%d %d",a,b); - break; - case OP_NOT: - printf("%d %d",a,b); - break; - case OP_LEN: - printf("%d %d",a,b); - break; - case OP_CONCAT: - printf("%d %d",a,b); - break; - case OP_CLOSE: - printf("%d",a); - break; - case OP_TBC: - printf("%d",a); - break; - case OP_JMP: - printf("%d",GETARG_sJ(i)); - printf(COMMENT "to %d",GETARG_sJ(i)+pc+2); - break; - case OP_EQ: - printf("%d %d %d",a,b,isk); - break; - case OP_LT: - printf("%d %d %d",a,b,isk); - break; - case OP_LE: - printf("%d %d %d",a,b,isk); - break; - case OP_EQK: - printf("%d %d %d",a,b,isk); - printf(COMMENT); PrintConstant(f,b); - break; - case OP_EQI: - printf("%d %d %d",a,sb,isk); - break; - case OP_LTI: - printf("%d %d %d",a,sb,isk); - break; - case OP_LEI: - printf("%d %d %d",a,sb,isk); - break; - case OP_GTI: - printf("%d %d %d",a,sb,isk); - break; - case OP_GEI: - printf("%d %d %d",a,sb,isk); - break; - case OP_TEST: - printf("%d %d",a,isk); - break; - case OP_TESTSET: - printf("%d %d %d",a,b,isk); - break; - case OP_CALL: - printf("%d %d %d",a,b,c); - printf(COMMENT); - if (b==0) printf("all in "); else printf("%d in ",b-1); - if (c==0) printf("all out"); else printf("%d out",c-1); - break; - case OP_TAILCALL: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT "%d in",b-1); - break; - case OP_RETURN: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT); - if (b==0) printf("all out"); else printf("%d out",b-1); - break; - case OP_RETURN0: - break; - case OP_RETURN1: - printf("%d",a); - break; - case OP_FORLOOP: - printf("%d %d",a,bx); - printf(COMMENT "to %d",pc-bx+2); - break; - case OP_FORPREP: - printf("%d %d",a,bx); - printf(COMMENT "exit to %d",pc+bx+3); - break; - case OP_TFORPREP: - printf("%d %d",a,bx); - printf(COMMENT "to %d",pc+bx+2); - break; - case OP_TFORCALL: - printf("%d %d",a,c); - break; - case OP_TFORLOOP: - printf("%d %d",a,bx); - printf(COMMENT "to %d",pc-bx+2); - break; - case OP_SETLIST: - printf("%d %d %d",a,b,c); - if (isk) printf(COMMENT "%d",c+EXTRAARGC); - break; - case OP_CLOSURE: - printf("%d %d",a,bx); - printf(COMMENT "%p",VOID(f->p[bx])); - break; - case OP_VARARG: - printf("%d %d",a,c); - printf(COMMENT); - if (c==0) printf("all out"); else printf("%d out",c-1); - break; - case OP_VARARGPREP: - printf("%d",a); - break; - case OP_EXTRAARG: - printf("%d",ax); - break; -#if 0 - default: - printf("%d %d %d",a,b,c); - printf(COMMENT "not handled"); - break; -#endif - } - printf("\n"); - } -} - - -#define SS(x) ((x==1)?"":"s") -#define S(x) (int)(x),SS(x) - -static void PrintHeader(const Proto* f) -{ - const char* s=f->source ? getstr(f->source) : "=?"; - if (*s=='@' || *s=='=') - s++; - else if (*s==LUA_SIGNATURE[0]) - s="(bstring)"; - else - s="(string)"; - printf("\n%s <%s:%d,%d> (%d instruction%s at %p)\n", - (f->linedefined==0)?"main":"function",s, - f->linedefined,f->lastlinedefined, - S(f->sizecode),VOID(f)); - printf("%d%s param%s, %d slot%s, %d upvalue%s, ", - (int)(f->numparams),f->is_vararg?"+":"",SS(f->numparams), - S(f->maxstacksize),S(f->sizeupvalues)); - printf("%d local%s, %d constant%s, %d function%s\n", - S(f->sizelocvars),S(f->sizek),S(f->sizep)); -} - -static void PrintDebug(const Proto* f) -{ - int i,n; - n=f->sizek; - printf("constants (%d) for %p:\n",n,VOID(f)); - for (i=0; isizelocvars; - printf("locals (%d) for %p:\n",n,VOID(f)); - for (i=0; ilocvars[i].varname),f->locvars[i].startpc+1,f->locvars[i].endpc+1); - } - n=f->sizeupvalues; - printf("upvalues (%d) for %p:\n",n,VOID(f)); - for (i=0; iupvalues[i].instack,f->upvalues[i].idx); - } -} - -static void PrintFunction(const Proto* f, int full) -{ - int i,n=f->sizep; - PrintHeader(f); - PrintCode(f); - if (full) PrintDebug(f); - for (i=0; ip[i],full); -} \ No newline at end of file diff --git a/src/dependencies/lua/luaconf.h b/src/dependencies/lua/luaconf.h deleted file mode 100644 index aea48de..0000000 --- a/src/dependencies/lua/luaconf.h +++ /dev/null @@ -1,802 +0,0 @@ -/* -** $Id: luaconf.h $ -** Configuration file for Lua -** See Copyright Notice in lua.h -*/ - - -#ifndef luaconf_h -#define luaconf_h - -#include -#include - - -/* -** =================================================================== -** General Configuration File for Lua -** -** Some definitions here can be changed externally, through the compiler -** (e.g., with '-D' options): They are commented out or protected -** by '#if !defined' guards. However, several other definitions -** should be changed directly here, either because they affect the -** Lua ABI (by making the changes here, you ensure that all software -** connected to Lua, such as C libraries, will be compiled with the same -** configuration); or because they are seldom changed. -** -** Search for "@@" to find all configurable definitions. -** =================================================================== -*/ - - -/* -** {==================================================================== -** System Configuration: macros to adapt (if needed) Lua to some -** particular platform, for instance restricting it to C89. -** ===================================================================== -*/ - -/* -@@ LUA_USE_C89 controls the use of non-ISO-C89 features. -** Define it if you want Lua to avoid the use of a few C99 features -** or Windows-specific features on Windows. -*/ -/* #define LUA_USE_C89 */ - - -/* -** By default, Lua on Windows use (some) specific Windows features -*/ -#if !defined(LUA_USE_C89) && defined(_WIN32) && !defined(_WIN32_WCE) -#define LUA_USE_WINDOWS /* enable goodies for regular Windows */ -#endif - - -#if defined(LUA_USE_WINDOWS) -#define LUA_DL_DLL /* enable support for DLL */ -#define LUA_USE_C89 /* broadly, Windows is C89 */ -#endif - - -#if defined(LUA_USE_LINUX) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN /* needs an extra library: -ldl */ -#endif - - -#if defined(LUA_USE_MACOSX) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN /* MacOS does not need -ldl */ -#endif - - -#if defined(LUA_USE_IOS) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN -#endif - - -/* -@@ LUAI_IS32INT is true iff 'int' has (at least) 32 bits. -*/ -#define LUAI_IS32INT ((UINT_MAX >> 30) >= 3) - -/* }================================================================== */ - - - -/* -** {================================================================== -** Configuration for Number types. These options should not be -** set externally, because any other code connected to Lua must -** use the same configuration. -** =================================================================== -*/ - -/* -@@ LUA_INT_TYPE defines the type for Lua integers. -@@ LUA_FLOAT_TYPE defines the type for Lua floats. -** Lua should work fine with any mix of these options supported -** by your C compiler. The usual configurations are 64-bit integers -** and 'double' (the default), 32-bit integers and 'float' (for -** restricted platforms), and 'long'/'double' (for C compilers not -** compliant with C99, which may not have support for 'long long'). -*/ - -/* predefined options for LUA_INT_TYPE */ -#define LUA_INT_INT 1 -#define LUA_INT_LONG 2 -#define LUA_INT_LONGLONG 3 - -/* predefined options for LUA_FLOAT_TYPE */ -#define LUA_FLOAT_FLOAT 1 -#define LUA_FLOAT_DOUBLE 2 -#define LUA_FLOAT_LONGDOUBLE 3 - - -/* Default configuration ('long long' and 'double', for 64-bit Lua) */ -#define LUA_INT_DEFAULT LUA_INT_LONGLONG -#define LUA_FLOAT_DEFAULT LUA_FLOAT_DOUBLE - - -/* -@@ LUA_32BITS enables Lua with 32-bit integers and 32-bit floats. -*/ -#define LUA_32BITS 0 - - -/* -@@ LUA_C89_NUMBERS ensures that Lua uses the largest types available for -** C89 ('long' and 'double'); Windows always has '__int64', so it does -** not need to use this case. -*/ -#if defined(LUA_USE_C89) && !defined(LUA_USE_WINDOWS) -#define LUA_C89_NUMBERS 1 -#else -#define LUA_C89_NUMBERS 0 -#endif - - -#if LUA_32BITS /* { */ -/* -** 32-bit integers and 'float' -*/ -#if LUAI_IS32INT /* use 'int' if big enough */ -#define LUA_INT_TYPE LUA_INT_INT -#else /* otherwise use 'long' */ -#define LUA_INT_TYPE LUA_INT_LONG -#endif -#define LUA_FLOAT_TYPE LUA_FLOAT_FLOAT - -#elif LUA_C89_NUMBERS /* }{ */ -/* -** largest types available for C89 ('long' and 'double') -*/ -#define LUA_INT_TYPE LUA_INT_LONG -#define LUA_FLOAT_TYPE LUA_FLOAT_DOUBLE - -#else /* }{ */ -/* use defaults */ - -#define LUA_INT_TYPE LUA_INT_DEFAULT -#define LUA_FLOAT_TYPE LUA_FLOAT_DEFAULT - -#endif /* } */ - - -/* }================================================================== */ - - - -/* -** {================================================================== -** Configuration for Paths. -** =================================================================== -*/ - -/* -** LUA_PATH_SEP is the character that separates templates in a path. -** LUA_PATH_MARK is the string that marks the substitution points in a -** template. -** LUA_EXEC_DIR in a Windows path is replaced by the executable's -** directory. -*/ -#define LUA_PATH_SEP ";" -#define LUA_PATH_MARK "?" -#define LUA_EXEC_DIR "!" - - -/* -@@ LUA_PATH_DEFAULT is the default path that Lua uses to look for -** Lua libraries. -@@ LUA_CPATH_DEFAULT is the default path that Lua uses to look for -** C libraries. -** CHANGE them if your machine has a non-conventional directory -** hierarchy or if you want to install your libraries in -** non-conventional directories. -*/ - -#define LUA_VDIR LUA_VERSION_MAJOR "." LUA_VERSION_MINOR -#if defined(_WIN32) /* { */ -/* -** In Windows, any exclamation mark ('!') in the path is replaced by the -** path of the directory of the executable file of the current process. -*/ -#define LUA_LDIR "!\\lua\\" -#define LUA_CDIR "!\\" -#define LUA_SHRDIR "!\\..\\share\\lua\\" LUA_VDIR "\\" - -#if !defined(LUA_PATH_DEFAULT) -#define LUA_PATH_DEFAULT \ - LUA_LDIR"?.lua;" LUA_LDIR"?\\init.lua;" \ - LUA_CDIR"?.lua;" LUA_CDIR"?\\init.lua;" \ - LUA_SHRDIR"?.lua;" LUA_SHRDIR"?\\init.lua;" \ - ".\\?.lua;" ".\\?\\init.lua" -#endif - -#if !defined(LUA_CPATH_DEFAULT) -#define LUA_CPATH_DEFAULT \ - LUA_CDIR"?.dll;" \ - LUA_CDIR"..\\lib\\lua\\" LUA_VDIR "\\?.dll;" \ - LUA_CDIR"loadall.dll;" ".\\?.dll" -#endif - -#else /* }{ */ - -#define LUA_ROOT "/usr/local/" -#define LUA_LDIR LUA_ROOT "share/lua/" LUA_VDIR "/" -#define LUA_CDIR LUA_ROOT "lib/lua/" LUA_VDIR "/" - -#if !defined(LUA_PATH_DEFAULT) -#define LUA_PATH_DEFAULT \ - LUA_LDIR"?.lua;" LUA_LDIR"?/init.lua;" \ - LUA_CDIR"?.lua;" LUA_CDIR"?/init.lua;" \ - "./?.lua;" "./?/init.lua" -#endif - -#if !defined(LUA_CPATH_DEFAULT) -#define LUA_CPATH_DEFAULT \ - LUA_CDIR"?.so;" LUA_CDIR"loadall.so;" "./?.so" -#endif - -#endif /* } */ - - -/* -@@ LUA_DIRSEP is the directory separator (for submodules). -** CHANGE it if your machine does not use "/" as the directory separator -** and is not Windows. (On Windows Lua automatically uses "\".) -*/ -#if !defined(LUA_DIRSEP) - -#if defined(_WIN32) -#define LUA_DIRSEP "\\" -#else -#define LUA_DIRSEP "/" -#endif - -#endif - - -/* -** LUA_IGMARK is a mark to ignore all after it when building the -** module name (e.g., used to build the luaopen_ function name). -** Typically, the sufix after the mark is the module version, -** as in "mod-v1.2.so". -*/ -#define LUA_IGMARK "-" - -/* }================================================================== */ - - -/* -** {================================================================== -** Marks for exported symbols in the C code -** =================================================================== -*/ - -/* -@@ LUA_API is a mark for all core API functions. -@@ LUALIB_API is a mark for all auxiliary library functions. -@@ LUAMOD_API is a mark for all standard library opening functions. -** CHANGE them if you need to define those functions in some special way. -** For instance, if you want to create one Windows DLL with the core and -** the libraries, you may want to use the following definition (define -** LUA_BUILD_AS_DLL to get it). -*/ -#if defined(LUA_BUILD_AS_DLL) /* { */ - -#if defined(LUA_CORE) || defined(LUA_LIB) /* { */ -#define LUA_API __declspec(dllexport) -#else /* }{ */ -#define LUA_API __declspec(dllimport) -#endif /* } */ - -#else /* }{ */ - -#define LUA_API extern - -#endif /* } */ - - -/* -** More often than not the libs go together with the core. -*/ -#define LUALIB_API LUA_API -#define LUAMOD_API LUA_API - - -/* -@@ LUAI_FUNC is a mark for all extern functions that are not to be -** exported to outside modules. -@@ LUAI_DDEF and LUAI_DDEC are marks for all extern (const) variables, -** none of which to be exported to outside modules (LUAI_DDEF for -** definitions and LUAI_DDEC for declarations). -** CHANGE them if you need to mark them in some special way. Elf/gcc -** (versions 3.2 and later) mark them as "hidden" to optimize access -** when Lua is compiled as a shared library. Not all elf targets support -** this attribute. Unfortunately, gcc does not offer a way to check -** whether the target offers that support, and those without support -** give a warning about it. To avoid these warnings, change to the -** default definition. -*/ -#if defined(__GNUC__) && ((__GNUC__*100 + __GNUC_MINOR__) >= 302) && \ - defined(__ELF__) /* { */ -#define LUAI_FUNC __attribute__((visibility("internal"))) extern -#else /* }{ */ -#define LUAI_FUNC extern -#endif /* } */ - -#define LUAI_DDEC(dec) LUAI_FUNC dec -#define LUAI_DDEF /* empty */ - -/* }================================================================== */ - - -/* -** {================================================================== -** Compatibility with previous versions -** =================================================================== -*/ - -/* -@@ LUA_COMPAT_5_3 controls other macros for compatibility with Lua 5.3. -** You can define it to get all options, or change specific options -** to fit your specific needs. -*/ -#if defined(LUA_COMPAT_5_3) /* { */ - -/* -@@ LUA_COMPAT_MATHLIB controls the presence of several deprecated -** functions in the mathematical library. -** (These functions were already officially removed in 5.3; -** nevertheless they are still available here.) -*/ -#define LUA_COMPAT_MATHLIB - -/* -@@ LUA_COMPAT_APIINTCASTS controls the presence of macros for -** manipulating other integer types (lua_pushunsigned, lua_tounsigned, -** luaL_checkint, luaL_checklong, etc.) -** (These macros were also officially removed in 5.3, but they are still -** available here.) -*/ -#define LUA_COMPAT_APIINTCASTS - - -/* -@@ LUA_COMPAT_LT_LE controls the emulation of the '__le' metamethod -** using '__lt'. -*/ -#define LUA_COMPAT_LT_LE - - -/* -@@ The following macros supply trivial compatibility for some -** changes in the API. The macros themselves document how to -** change your code to avoid using them. -** (Once more, these macros were officially removed in 5.3, but they are -** still available here.) -*/ -#define lua_strlen(L,i) lua_rawlen(L, (i)) - -#define lua_objlen(L,i) lua_rawlen(L, (i)) - -#define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ) -#define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT) - -#endif /* } */ - -/* }================================================================== */ - - - -/* -** {================================================================== -** Configuration for Numbers (low-level part). -** Change these definitions if no predefined LUA_FLOAT_* / LUA_INT_* -** satisfy your needs. -** =================================================================== -*/ - -/* -@@ LUAI_UACNUMBER is the result of a 'default argument promotion' -@@ over a floating number. -@@ l_floatatt(x) corrects float attribute 'x' to the proper float type -** by prefixing it with one of FLT/DBL/LDBL. -@@ LUA_NUMBER_FRMLEN is the length modifier for writing floats. -@@ LUA_NUMBER_FMT is the format for writing floats. -@@ lua_number2str converts a float to a string. -@@ l_mathop allows the addition of an 'l' or 'f' to all math operations. -@@ l_floor takes the floor of a float. -@@ lua_str2number converts a decimal numeral to a number. -*/ - - -/* The following definitions are good for most cases here */ - -#define l_floor(x) (l_mathop(private_lua_embed_floor)(x)) - -#define lua_number2str(s,sz,n) \ - l_sprintf((s), sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)(n)) - -/* -@@ lua_numbertointeger converts a float number with an integral value -** to an integer, or returns 0 if float is not within the range of -** a lua_Integer. (The range comparisons are tricky because of -** rounding. The tests here assume a two-complement representation, -** where MININTEGER always has an exact representation as a float; -** MAXINTEGER may not have one, and therefore its conversion to float -** may have an ill-defined value.) -*/ -#define lua_numbertointeger(n,p) \ - ((n) >= (LUA_NUMBER)(LUA_MININTEGER) && \ - (n) < -(LUA_NUMBER)(LUA_MININTEGER) && \ - (*(p) = (LUA_INTEGER)(n), 1)) - - -/* now the variable definitions */ - -#if LUA_FLOAT_TYPE == LUA_FLOAT_FLOAT /* { single float */ - -#define LUA_NUMBER float - -#define l_floatatt(n) (FLT_##n) - -#define LUAI_UACNUMBER double - -#define LUA_NUMBER_FRMLEN "" -#define LUA_NUMBER_FMT "%.7g" - -#define l_mathop(op) op##f - -#define lua_str2number(s,p) strtof((s), (p)) - - -#elif LUA_FLOAT_TYPE == LUA_FLOAT_LONGDOUBLE /* }{ long double */ - -#define LUA_NUMBER long double - -#define l_floatatt(n) (LDBL_##n) - -#define LUAI_UACNUMBER long double - -#define LUA_NUMBER_FRMLEN "L" -#define LUA_NUMBER_FMT "%.19Lg" - -#define l_mathop(op) op##l - -#define lua_str2number(s,p) strtold((s), (p)) - -#elif LUA_FLOAT_TYPE == LUA_FLOAT_DOUBLE /* }{ double */ - -#define LUA_NUMBER double - -#define l_floatatt(n) (DBL_##n) - -#define LUAI_UACNUMBER double - -#define LUA_NUMBER_FRMLEN "" -#define LUA_NUMBER_FMT "%.14g" - -#define l_mathop(op) op - -#define lua_str2number(s,p) strtod((s), (p)) - -#else /* }{ */ - -#error "numeric float type not defined" - -#endif /* } */ - - - -/* -@@ LUA_UNSIGNED is the unsigned version of LUA_INTEGER. -@@ LUAI_UACINT is the result of a 'default argument promotion' -@@ over a LUA_INTEGER. -@@ LUA_INTEGER_FRMLEN is the length modifier for reading/writing integers. -@@ LUA_INTEGER_FMT is the format for writing integers. -@@ LUA_MAXINTEGER is the maximum value for a LUA_INTEGER. -@@ LUA_MININTEGER is the minimum value for a LUA_INTEGER. -@@ LUA_MAXUNSIGNED is the maximum value for a LUA_UNSIGNED. -@@ lua_integer2str converts an integer to a string. -*/ - - -/* The following definitions are good for most cases here */ - -#define LUA_INTEGER_FMT "%" LUA_INTEGER_FRMLEN "d" - -#define LUAI_UACINT LUA_INTEGER - -#define lua_integer2str(s,sz,n) \ - l_sprintf((s), sz, LUA_INTEGER_FMT, (LUAI_UACINT)(n)) - -/* -** use LUAI_UACINT here to avoid problems with promotions (which -** can turn a comparison between unsigneds into a signed comparison) -*/ -#define LUA_UNSIGNED unsigned LUAI_UACINT - - -/* now the variable definitions */ - -#if LUA_INT_TYPE == LUA_INT_INT /* { int */ - -#define LUA_INTEGER int -#define LUA_INTEGER_FRMLEN "" - -#define LUA_MAXINTEGER INT_MAX -#define LUA_MININTEGER INT_MIN - -#define LUA_MAXUNSIGNED UINT_MAX - -#elif LUA_INT_TYPE == LUA_INT_LONG /* }{ long */ - -#define LUA_INTEGER long -#define LUA_INTEGER_FRMLEN "l" - -#define LUA_MAXINTEGER LONG_MAX -#define LUA_MININTEGER LONG_MIN - -#define LUA_MAXUNSIGNED ULONG_MAX - -#elif LUA_INT_TYPE == LUA_INT_LONGLONG /* }{ long long */ - -/* use presence of macro LLONG_MAX as proxy for C99 compliance */ -#if defined(LLONG_MAX) /* { */ -/* use ISO C99 stuff */ - -#define LUA_INTEGER long long -#define LUA_INTEGER_FRMLEN "ll" - -#define LUA_MAXINTEGER LLONG_MAX -#define LUA_MININTEGER LLONG_MIN - -#define LUA_MAXUNSIGNED ULLONG_MAX - -#elif defined(LUA_USE_WINDOWS) /* }{ */ -/* in Windows, can use specific Windows types */ - -#define LUA_INTEGER __int64 -#define LUA_INTEGER_FRMLEN "I64" - -#define LUA_MAXINTEGER _I64_MAX -#define LUA_MININTEGER _I64_MIN - -#define LUA_MAXUNSIGNED _UI64_MAX - -#else /* }{ */ - -#error "Compiler does not support 'long long'. Use option '-DLUA_32BITS' \ - or '-DLUA_C89_NUMBERS' (see file 'luaconf.h' for details)" - -#endif /* } */ - -#else /* }{ */ - -#error "numeric integer type not defined" - -#endif /* } */ - -/* }================================================================== */ - - -/* -** {================================================================== -** Dependencies with C99 and other C details -** =================================================================== -*/ - -/* -@@ l_sprintf is equivalent to 'snprintf' or 'sprintf' in C89. -** (All uses in Lua have only one format item.) -*/ -#if !defined(LUA_USE_C89) -#define l_sprintf(s,sz,f,i) snprintf(s,sz,f,i) -#else -#define l_sprintf(s,sz,f,i) ((void)(sz), sprintf(s,f,i)) -#endif - - -/* -@@ lua_strx2number converts a hexadecimal numeral to a number. -** In C99, 'strtod' does that conversion. Otherwise, you can -** leave 'lua_strx2number' undefined and Lua will provide its own -** implementation. -*/ -#if !defined(LUA_USE_C89) -#define lua_strx2number(s,p) lua_str2number(s,p) -#endif - - -/* -@@ lua_pointer2str converts a pointer to a readable string in a -** non-specified way. -*/ -#define lua_pointer2str(buff,sz,p) l_sprintf(buff,sz,"%p",p) - - -/* -@@ lua_number2strx converts a float to a hexadecimal numeral. -** In C99, 'sprintf' (with format specifiers '%a'/'%A') does that. -** Otherwise, you can leave 'lua_number2strx' undefined and Lua will -** provide its own implementation. -*/ -#if !defined(LUA_USE_C89) -#define lua_number2strx(L,b,sz,f,n) \ - ((void)L, l_sprintf(b,sz,f,(LUAI_UACNUMBER)(n))) -#endif - - -/* -** 'strtof' and 'opf' variants for math functions are not valid in -** C89. Otherwise, the macro 'HUGE_VALF' is a good proxy for testing the -** availability of these variants. ('math.h' is already included in -** all files that use these macros.) -*/ -#if defined(LUA_USE_C89) || (defined(HUGE_VAL) && !defined(HUGE_VALF)) -#undef l_mathop /* variants not available */ -#undef lua_str2number -#define l_mathop(op) (lua_Number)op /* no variant */ -#define lua_str2number(s,p) ((lua_Number)strtod((s), (p))) -#endif - - -/* -@@ LUA_KCONTEXT is the type of the context ('ctx') for continuation -** functions. It must be a numerical type; Lua will use 'intptr_t' if -** available, otherwise it will use 'ptrdiff_t' (the nearest thing to -** 'intptr_t' in C89) -*/ -#define LUA_KCONTEXT ptrdiff_t - -#if !defined(LUA_USE_C89) && defined(__STDC_VERSION__) && \ - __STDC_VERSION__ >= 199901L -#include -#if defined(INTPTR_MAX) /* even in C99 this type is optional */ -#undef LUA_KCONTEXT -#define LUA_KCONTEXT intptr_t -#endif -#endif - - -/* -@@ lua_getlocaledecpoint gets the locale "radix character" (decimal point). -** Change that if you do not want to use C locales. (Code using this -** macro must include the header 'locale.h'.) -*/ -#if !defined(lua_getlocaledecpoint) -#define lua_getlocaledecpoint() (localeconv()->decimal_point[0]) -#endif - - -/* -** macros to improve jump prediction, used mostly for error handling -** and debug facilities. (Some macros in the Lua API use these macros. -** Define LUA_NOBUILTIN if you do not want '__builtin_expect' in your -** code.) -*/ -#if !defined(luai_likely) - -#if defined(__GNUC__) && !defined(LUA_NOBUILTIN) -#define luai_likely(x) (__builtin_expect(((x) != 0), 1)) -#define luai_unlikely(x) (__builtin_expect(((x) != 0), 0)) -#else -#define luai_likely(x) (x) -#define luai_unlikely(x) (x) -#endif - -#endif - - -#if defined(LUA_CORE) || defined(LUA_LIB) -/* shorter names for Lua's own use */ -#define l_likely(x) luai_likely(x) -#define l_unlikely(x) luai_unlikely(x) -#endif - - - -/* }================================================================== */ - - -/* -** {================================================================== -** Language Variations -** ===================================================================== -*/ - -/* -@@ LUA_NOCVTN2S/LUA_NOCVTS2N control how Lua performs some -** coercions. Define LUA_NOCVTN2S to turn off automatic coercion from -** numbers to strings. Define LUA_NOCVTS2N to turn off automatic -** coercion from strings to numbers. -*/ -/* #define LUA_NOCVTN2S */ -/* #define LUA_NOCVTS2N */ - - -/* -@@ LUA_USE_APICHECK turns on several consistency checks on the C API. -** Define it as a help when debugging C code. -*/ -#if defined(LUA_USE_APICHECK) -#include -#define luai_apicheck(l,e) assert(e) -#endif - -/* }================================================================== */ - - -/* -** {================================================================== -** Macros that affect the API and must be stable (that is, must be the -** same when you compile Lua and when you compile code that links to -** Lua). -** ===================================================================== -*/ - -/* -@@ LUAI_MAXSTACK limits the size of the Lua stack. -** CHANGE it if you need a different limit. This limit is arbitrary; -** its only purpose is to stop Lua from consuming unlimited stack -** space (and to reserve some numbers for pseudo-indices). -** (It must fit into max(size_t)/32 and max(int)/2.) -*/ -#if LUAI_IS32INT -#define LUAI_MAXSTACK 1000000 -#else -#define LUAI_MAXSTACK 15000 -#endif - - -/* -@@ LUA_EXTRASPACE defines the size of a raw memory area associated with -** a Lua state with very fast access. -** CHANGE it if you need a different size. -*/ -#define LUA_EXTRASPACE (sizeof(void *)) - - -/* -@@ LUA_IDSIZE gives the maximum size for the description of the source -** of a function in debug information. -** CHANGE it if you want a different size. -*/ -#define LUA_IDSIZE 60 - - -/* -@@ LUAL_BUFFERSIZE is the initial buffer size used by the lauxlib -** buffer system. -*/ -#define LUAL_BUFFERSIZE ((int)(16 * sizeof(void*) * sizeof(lua_Number))) - - -/* -@@ LUAI_MAXALIGN defines fields that, when used in a union, ensure -** maximum alignment for the other items in that union. -*/ -#define LUAI_MAXALIGN lua_Number n; double u; void *s; lua_Integer i; long l - -/* }================================================================== */ - - - - - -/* =================================================================== */ - -/* -** Local configuration. You can use this space to add your redefinitions -** without modifying the main part of the file. -*/ - - - - - -#endif - diff --git a/src/dependencies/lua/lualib.h b/src/dependencies/lua/lualib.h deleted file mode 100644 index 068f60a..0000000 --- a/src/dependencies/lua/lualib.h +++ /dev/null @@ -1,65 +0,0 @@ -/* -** $Id: lualib.h $ -** Lua standard libraries -** See Copyright Notice in lua.h -*/ - - -#ifndef lualib_h -#define lualib_h - -#include "lua.h" - - -/* version suffix for environment variable names */ -#define LUA_VERSUFFIX "_" LUA_VERSION_MAJOR "_" LUA_VERSION_MINOR - -#define LUA_GLIBK 1 -LUAMOD_API int (luaopen_base) (lua_State *L); - -#define LUA_LOADLIBNAME "package" -#define LUA_LOADLIBK (LUA_GLIBK << 1) -LUAMOD_API int (luaopen_package) (lua_State *L); - - -#define LUA_COLIBNAME "coroutine" -#define LUA_COLIBK (LUA_LOADLIBK << 1) -LUAMOD_API int (luaopen_coroutine) (lua_State *L); - -#define LUA_DBLIBNAME "debug" -#define LUA_DBLIBK (LUA_COLIBK << 1) -LUAMOD_API int (luaopen_debug) (lua_State *L); - -#define LUA_IOLIBNAME "io" -#define LUA_IOLIBK (LUA_DBLIBK << 1) -LUAMOD_API int (luaopen_io) (lua_State *L); - -#define LUA_MATHLIBNAME "math" -#define LUA_MATHLIBK (LUA_IOLIBK << 1) -LUAMOD_API int (luaopen_math) (lua_State *L); - -#define LUA_OSLIBNAME "os" -#define LUA_OSLIBK (LUA_MATHLIBK << 1) -LUAMOD_API int (luaopen_os) (lua_State *L); - -#define LUA_STRLIBNAME "string" -#define LUA_STRLIBK (LUA_OSLIBK << 1) -LUAMOD_API int (luaopen_string) (lua_State *L); - -#define LUA_TABLIBNAME "table" -#define LUA_TABLIBK (LUA_STRLIBK << 1) -LUAMOD_API int (luaopen_table) (lua_State *L); - -#define LUA_UTF8LIBNAME "utf8" -#define LUA_UTF8LIBK (LUA_TABLIBK << 1) -LUAMOD_API int (luaopen_utf8) (lua_State *L); - - -/* open selected libraries */ -LUALIB_API void (luaL_openselectedlibs) (lua_State *L, int load, int preload); - -/* open all libraries */ -#define luaL_openlibs(L) luaL_openselectedlibs(L, ~0, 0) - - -#endif diff --git a/src/dependencies/lua/lundump.c b/src/dependencies/lua/lundump.c deleted file mode 100644 index ed03ab8..0000000 --- a/src/dependencies/lua/lundump.c +++ /dev/null @@ -1,405 +0,0 @@ -/* -** $Id: lundump.c $ -** load precompiled Lua chunks -** See Copyright Notice in lua.h -*/ - -#define lundump_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstring.h" -#include "ltable.h" -#include "lundump.h" -#include "lzio.h" - - -#if !defined(luai_verifycode) -#define luai_verifycode(L,f) /* empty */ -#endif - - -typedef struct { - lua_State *L; - ZIO *Z; - const char *name; - Table *h; /* list for string reuse */ - lu_mem offset; /* current position relative to beginning of dump */ - lua_Integer nstr; /* number of strings in the list */ - lu_byte fixed; /* dump is fixed in memory */ -} LoadState; - - -static l_noret private_lua_error (LoadState *S, const char *why) { - luaO_pushfstring(S->L, "%s: bad binary format (%s)", S->name, why); - luaD_throw(S->L, LUA_ERRSYNTAX); -} - - -/* -** All high-level loads go through loadVector; you can change it to -** adapt to the endianness of the input -*/ -#define loadVector(S,b,n) loadBlock(S,b,(n)*sizeof((b)[0])) - -static void loadBlock (LoadState *S, void *b, size_t size) { - if (luaZ_read(S->Z, b, size) != 0) - private_lua_error(S, "truncated chunk"); - S->offset += size; -} - - -static void loadAlign (LoadState *S, int align) { - int padding = align - (S->offset % align); - if (padding < align) { /* apd == align means no padding */ - lua_Integer paddingContent; - loadBlock(S, &paddingContent, padding); - lua_assert(S->offset % align == 0); - } -} - - -#define getaddr(S,n,t) cast(t *, getaddr_(S,(n) * sizeof(t))) - -static const void *getaddr_ (LoadState *S, size_t size) { - const void *block = luaZ_getaddr(S->Z, size); - S->offset += size; - if (block == NULL) - private_lua_error(S, "truncated fixed buffer"); - return block; -} - - -#define loadVar(S,x) loadVector(S,&x,1) - - -static lu_byte loadByte (LoadState *S) { - int b = zgetc(S->Z); - if (b == EOZ) - private_lua_error(S, "truncated chunk"); - S->offset++; - return cast_byte(b); -} - - -static size_t loadVarint (LoadState *S, size_t limit) { - size_t x = 0; - int b; - limit >>= 7; - do { - b = loadByte(S); - if (x > limit) - private_lua_error(S, "integer overflow"); - x = (x << 7) | (b & 0x7f); - } while ((b & 0x80) != 0); - return x; -} - - -static size_t loadSize (LoadState *S) { - return loadVarint(S, MAX_SIZET); -} - - -static int loadInt (LoadState *S) { - return cast_int(loadVarint(S, cast_sizet(INT_MAX))); -} - - -static lua_Number loadNumber (LoadState *S) { - lua_Number x; - loadVar(S, x); - return x; -} - - -static lua_Integer loadInteger (LoadState *S) { - lua_Integer x; - loadVar(S, x); - return x; -} - - -/* -** Load a nullable string into slot 'sl' from prototype 'p'. The -** assignment to the slot and the barrier must be performed before any -** possible GC activity, to anchor the string. (Both 'loadVector' and -** 'luaH_setint' can call the GC.) -*/ -static void loadString (LoadState *S, Proto *p, TString **sl) { - lua_State *L = S->L; - TString *ts; - TValue sv; - size_t size = loadSize(S); - if (size == 0) { /* no string? */ - lua_assert(*sl == NULL); /* must be prefilled */ - return; - } - else if (size == 1) { /* previously saved string? */ - lua_Integer idx = cast(lua_Integer, loadSize(S)); /* get its index */ - TValue stv; - luaH_getint(S->h, idx, &stv); /* get its value */ - *sl = ts = tsvalue(&stv); - luaC_objbarrier(L, p, ts); - return; /* do not save it again */ - } - else if ((size -= 2) <= LUAI_MAXSHORTLEN) { /* short string? */ - char buff[LUAI_MAXSHORTLEN + 1]; /* extra space for '\0' */ - loadVector(S, buff, size + 1); /* load string into buffer */ - *sl = ts = luaS_newlstr(L, buff, size); /* create string */ - luaC_objbarrier(L, p, ts); - } - else if (S->fixed) { /* for a fixed buffer, use a fixed string */ - const char *s = getaddr(S, size + 1, char); /* get content address */ - *sl = ts = luaS_newextlstr(L, s, size, NULL, NULL); - luaC_objbarrier(L, p, ts); - } - else { /* create internal copy */ - *sl = ts = luaS_createlngstrobj(L, size); /* create string */ - luaC_objbarrier(L, p, ts); - loadVector(S, getlngstr(ts), size + 1); /* load directly in final place */ - } - /* add string to list of saved strings */ - S->nstr++; - setsvalue(L, &sv, ts); - luaH_setint(L, S->h, S->nstr, &sv); - luaC_objbarrierback(L, obj2gco(S->h), ts); -} - - -static void loadCode (LoadState *S, Proto *f) { - int n = loadInt(S); - loadAlign(S, sizeof(f->code[0])); - if (S->fixed) { - f->code = getaddr(S, n, Instruction); - f->sizecode = n; - } - else { - f->code = luaM_newvectorchecked(S->L, n, Instruction); - f->sizecode = n; - loadVector(S, f->code, n); - } -} - - -static void loadFunction(LoadState *S, Proto *f); - - -static void loadConstants (LoadState *S, Proto *f) { - int i; - int n = loadInt(S); - f->k = luaM_newvectorchecked(S->L, n, TValue); - f->sizek = n; - for (i = 0; i < n; i++) - setnilvalue(&f->k[i]); - for (i = 0; i < n; i++) { - TValue *o = &f->k[i]; - int t = loadByte(S); - switch (t) { - case LUA_VNIL: - setnilvalue(o); - break; - case LUA_VFALSE: - setbfvalue(o); - break; - case LUA_VTRUE: - setbtvalue(o); - break; - case LUA_VNUMFLT: - setfltvalue(o, loadNumber(S)); - break; - case LUA_VNUMINT: - setivalue(o, loadInteger(S)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - lua_assert(f->source == NULL); - loadString(S, f, &f->source); /* use 'source' to anchor string */ - if (f->source == NULL) - private_lua_error(S, "bad format for constant string"); - setsvalue2n(S->L, o, f->source); /* save it in the right place */ - f->source = NULL; - break; - } - default: lua_assert(0); - } - } -} - - -static void loadProtos (LoadState *S, Proto *f) { - int i; - int n = loadInt(S); - f->p = luaM_newvectorchecked(S->L, n, Proto *); - f->sizep = n; - for (i = 0; i < n; i++) - f->p[i] = NULL; - for (i = 0; i < n; i++) { - f->p[i] = luaF_newproto(S->L); - luaC_objbarrier(S->L, f, f->p[i]); - loadFunction(S, f->p[i]); - } -} - - -/* -** Load the upvalues for a function. The names must be filled first, -** because the filling of the other fields can raise read errors and -** the creation of the error message can call an emergency collection; -** in that case all prototypes must be consistent for the GC. -*/ -static void loadUpvalues (LoadState *S, Proto *f) { - int i, n; - n = loadInt(S); - f->upvalues = luaM_newvectorchecked(S->L, n, Upvaldesc); - f->sizeupvalues = n; - for (i = 0; i < n; i++) /* make array valid for GC */ - f->upvalues[i].name = NULL; - for (i = 0; i < n; i++) { /* following calls can raise errors */ - f->upvalues[i].instack = loadByte(S); - f->upvalues[i].idx = loadByte(S); - f->upvalues[i].kind = loadByte(S); - } -} - - -static void loadDebug (LoadState *S, Proto *f) { - int i, n; - n = loadInt(S); - if (S->fixed) { - f->lineinfo = getaddr(S, n, ls_byte); - f->sizelineinfo = n; - } - else { - f->lineinfo = luaM_newvectorchecked(S->L, n, ls_byte); - f->sizelineinfo = n; - loadVector(S, f->lineinfo, n); - } - n = loadInt(S); - if (n > 0) { - loadAlign(S, sizeof(int)); - if (S->fixed) { - f->abslineinfo = getaddr(S, n, AbsLineInfo); - f->sizeabslineinfo = n; - } - else { - f->abslineinfo = luaM_newvectorchecked(S->L, n, AbsLineInfo); - f->sizeabslineinfo = n; - loadVector(S, f->abslineinfo, n); - } - } - n = loadInt(S); - f->locvars = luaM_newvectorchecked(S->L, n, LocVar); - f->sizelocvars = n; - for (i = 0; i < n; i++) - f->locvars[i].varname = NULL; - for (i = 0; i < n; i++) { - loadString(S, f, &f->locvars[i].varname); - f->locvars[i].startpc = loadInt(S); - f->locvars[i].endpc = loadInt(S); - } - n = loadInt(S); - if (n != 0) /* does it have debug information? */ - n = f->sizeupvalues; /* must be this many */ - for (i = 0; i < n; i++) - loadString(S, f, &f->upvalues[i].name); -} - - -static void loadFunction (LoadState *S, Proto *f) { - f->linedefined = loadInt(S); - f->lastlinedefined = loadInt(S); - f->numparams = loadByte(S); - f->flag = loadByte(S) & PF_ISVARARG; /* get only the meaningful flags */ - if (S->fixed) - f->flag |= PF_FIXED; /* signal that code is fixed */ - f->maxstacksize = loadByte(S); - loadCode(S, f); - loadConstants(S, f); - loadUpvalues(S, f); - loadProtos(S, f); - loadString(S, f, &f->source); - loadDebug(S, f); -} - - -static void checkliteral (LoadState *S, const char *s, const char *msg) { - char buff[sizeof(LUA_SIGNATURE) + sizeof(LUAC_DATA)]; /* larger than both */ - size_t len = strlen(s); - loadVector(S, buff, len); - if (memcmp(s, buff, len) != 0) - private_lua_error(S, msg); -} - - -static void fchecksize (LoadState *S, size_t size, const char *tname) { - if (loadByte(S) != size) - private_lua_error(S, luaO_pushfstring(S->L, "%s size mismatch", tname)); -} - - -#define checksize(S,t) fchecksize(S,sizeof(t),#t) - -static void checkHeader (LoadState *S) { - /* skip 1st char (already read and checked) */ - checkliteral(S, &LUA_SIGNATURE[1], "not a binary chunk"); - if (loadByte(S) != LUAC_VERSION) - private_lua_error(S, "version mismatch"); - if (loadByte(S) != LUAC_FORMAT) - private_lua_error(S, "format mismatch"); - checkliteral(S, LUAC_DATA, "corrupted chunk"); - checksize(S, Instruction); - checksize(S, lua_Integer); - checksize(S, lua_Number); - if (loadInteger(S) != LUAC_INT) - private_lua_error(S, "integer format mismatch"); - if (loadNumber(S) != LUAC_NUM) - private_lua_error(S, "float format mismatch"); -} - - -/* -** Load precompiled chunk. -*/ -LClosure *luaU_undump (lua_State *L, ZIO *Z, const char *name, int fixed) { - LoadState S; - LClosure *cl; - if (*name == '@' || *name == '=') - S.name = name + 1; - else if (*name == LUA_SIGNATURE[0]) - S.name = "binary string"; - else - S.name = name; - S.L = L; - S.Z = Z; - S.fixed = fixed; - S.offset = 1; /* fist byte was already read */ - checkHeader(&S); - cl = luaF_newLclosure(L, loadByte(&S)); - setclLvalue2s(L, L->top.p, cl); - luaD_inctop(L); - S.h = luaH_new(L); /* create list of saved strings */ - S.nstr = 0; - sethvalue2s(L, L->top.p, S.h); /* anchor it */ - luaD_inctop(L); - cl->p = luaF_newproto(L); - luaC_objbarrier(L, cl, cl->p); - loadFunction(&S, cl->p); - lua_assert(cl->nupvalues == cl->p->sizeupvalues); - luai_verifycode(L, cl->p); - L->top.p--; /* pop table */ - return cl; -} - diff --git a/src/dependencies/lua/lundump.h b/src/dependencies/lua/lundump.h deleted file mode 100644 index 1d6e50e..0000000 --- a/src/dependencies/lua/lundump.h +++ /dev/null @@ -1,39 +0,0 @@ -/* -** $Id: lundump.h $ -** load precompiled Lua chunks -** See Copyright Notice in lua.h -*/ - -#ifndef lundump_h -#define lundump_h - -#include - -#include "llimits.h" -#include "lobject.h" -#include "lzio.h" - - -/* data to catch conversion errors */ -#define LUAC_DATA "\x19\x93\r\n\x1a\n" - -#define LUAC_INT 0x5678 -#define LUAC_NUM cast_num(370.5) - -/* -** Encode major-minor version in one byte, one nibble for each -*/ -#define LUAC_VERSION (LUA_VERSION_MAJOR_N*16+LUA_VERSION_MINOR_N) - -#define LUAC_FORMAT 0 /* this is the official format */ - - -/* load one chunk; from lundump.c */ -LUAI_FUNC LClosure* luaU_undump (lua_State* L, ZIO* Z, const char* name, - int fixed); - -/* dump one chunk; from ldump.c */ -LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, - void* data, int strip); - -#endif diff --git a/src/dependencies/lua/lutf8lib.c b/src/dependencies/lua/lutf8lib.c deleted file mode 100644 index 3a5b9bc..0000000 --- a/src/dependencies/lua/lutf8lib.c +++ /dev/null @@ -1,291 +0,0 @@ -/* -** $Id: lutf8lib.c $ -** Standard library for UTF-8 manipulation -** See Copyright Notice in lua.h -*/ - -#define lutf8lib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -#define MAXUNICODE 0x10FFFFu - -#define MAXUTF 0x7FFFFFFFu - - -#define MSGInvalid "invalid UTF-8 code" - -/* -** Integer type for decoded UTF-8 values; MAXUTF needs 31 bits. -*/ -#if (UINT_MAX >> 30) >= 1 -typedef unsigned int utfint; -#else -typedef unsigned long utfint; -#endif - - -#define iscont(c) (((c) & 0xC0) == 0x80) -#define iscontp(p) iscont(*(p)) - - -/* from strlib */ -/* translate a relative string position: negative means back from end */ -static lua_Integer u_posrelat (lua_Integer pos, size_t len) { - if (pos >= 0) return pos; - else if (0u - (size_t)pos > len) return 0; - else return (lua_Integer)len + pos + 1; -} - - -/* -** Decode one UTF-8 sequence, returning NULL if byte sequence is -** invalid. The array 'limits' stores the minimum value for each -** sequence length, to check for overlong representations. Its first -** entry forces an error for non-ascii bytes with no continuation -** bytes (count == 0). -*/ -static const char *utf8_decode (const char *s, utfint *val, int strict) { - static const utfint limits[] = - {~(utfint)0, 0x80, 0x800, 0x10000u, 0x200000u, 0x4000000u}; - unsigned int c = (unsigned char)s[0]; - utfint res = 0; /* final result */ - if (c < 0x80) /* ascii? */ - res = c; - else { - int count = 0; /* to count number of continuation bytes */ - for (; c & 0x40; c <<= 1) { /* while it needs continuation bytes... */ - unsigned int cc = (unsigned char)s[++count]; /* read next byte */ - if (!iscont(cc)) /* not a continuation byte? */ - return NULL; /* invalid byte sequence */ - res = (res << 6) | (cc & 0x3F); /* add lower 6 bits from cont. byte */ - } - res |= ((utfint)(c & 0x7F) << (count * 5)); /* add first byte */ - if (count > 5 || res > MAXUTF || res < limits[count]) - return NULL; /* invalid byte sequence */ - s += count; /* skip continuation bytes read */ - } - if (strict) { - /* check for invalid code points; too large or surrogates */ - if (res > MAXUNICODE || (0xD800u <= res && res <= 0xDFFFu)) - return NULL; - } - if (val) *val = res; - return s + 1; /* +1 to include first byte */ -} - - -/* -** utf8len(s [, i [, j [, lax]]]) --> number of characters that -** start in the range [i,j], or nil + current position if 's' is not -** well formed in that interval -*/ -static int utflen (lua_State *L) { - lua_Integer n = 0; /* counter for the number of characters */ - size_t len; /* string length in bytes */ - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer posi = u_posrelat(luaL_optinteger(L, 2, 1), len); - lua_Integer posj = u_posrelat(luaL_optinteger(L, 3, -1), len); - int lax = lua_toboolean(L, 4); - luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 2, - "initial position out of bounds"); - luaL_argcheck(L, --posj < (lua_Integer)len, 3, - "final position out of bounds"); - while (posi <= posj) { - const char *s1 = utf8_decode(s + posi, NULL, !lax); - if (s1 == NULL) { /* conversion error? */ - luaL_pushfail(L); /* return fail ... */ - lua_pushinteger(L, posi + 1); /* ... and current position */ - return 2; - } - posi = s1 - s; - n++; - } - lua_pushinteger(L, n); - return 1; -} - - -/* -** codepoint(s, [i, [j [, lax]]]) -> returns codepoints for all -** characters that start in the range [i,j] -*/ -static int codepoint (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer posi = u_posrelat(luaL_optinteger(L, 2, 1), len); - lua_Integer pose = u_posrelat(luaL_optinteger(L, 3, posi), len); - int lax = lua_toboolean(L, 4); - int n; - const char *se; - luaL_argcheck(L, posi >= 1, 2, "out of bounds"); - luaL_argcheck(L, pose <= (lua_Integer)len, 3, "out of bounds"); - if (posi > pose) return 0; /* empty interval; return no values */ - if (pose - posi >= INT_MAX) /* (lua_Integer -> int) overflow? */ - return luaL_error(L, "string slice too long"); - n = (int)(pose - posi) + 1; /* upper bound for number of returns */ - luaL_checkstack(L, n, "string slice too long"); - n = 0; /* count the number of returns */ - se = s + pose; /* string end */ - for (s += posi - 1; s < se;) { - utfint code; - s = utf8_decode(s, &code, !lax); - if (s == NULL) - return luaL_error(L, MSGInvalid); - lua_pushinteger(L, code); - n++; - } - return n; -} - - -static void pushutfchar (lua_State *L, int arg) { - lua_Unsigned code = (lua_Unsigned)luaL_checkinteger(L, arg); - luaL_argcheck(L, code <= MAXUTF, arg, "value out of range"); - lua_pushfstring(L, "%U", (long)code); -} - - -/* -** utfchar(n1, n2, ...) -> char(n1)..char(n2)... -*/ -static int utfchar (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - if (n == 1) /* optimize common case of single char */ - pushutfchar(L, 1); - else { - int i; - luaL_Buffer b; - luaL_buffinit(L, &b); - for (i = 1; i <= n; i++) { - pushutfchar(L, i); - luaL_addvalue(&b); - } - luaL_pushresult(&b); - } - return 1; -} - - -/* -** offset(s, n, [i]) -> index where n-th character counting from -** position 'i' starts; 0 means character at 'i'. -*/ -static int byteoffset (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer n = luaL_checkinteger(L, 2); - lua_Integer posi = (n >= 0) ? 1 : len + 1; - posi = u_posrelat(luaL_optinteger(L, 3, posi), len); - luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 3, - "position out of bounds"); - if (n == 0) { - /* find beginning of current byte sequence */ - while (posi > 0 && iscontp(s + posi)) posi--; - } - else { - if (iscontp(s + posi)) - return luaL_error(L, "initial position is a continuation byte"); - if (n < 0) { - while (n < 0 && posi > 0) { /* move back */ - do { /* find beginning of previous character */ - posi--; - } while (posi > 0 && iscontp(s + posi)); - n++; - } - } - else { - n--; /* do not move for 1st character */ - while (n > 0 && posi < (lua_Integer)len) { - do { /* find beginning of next character */ - posi++; - } while (iscontp(s + posi)); /* (cannot pass final '\0') */ - n--; - } - } - } - if (n == 0) /* did it find given character? */ - lua_pushinteger(L, posi + 1); - else /* no such character */ - luaL_pushfail(L); - return 1; -} - - -static int iter_aux (lua_State *L, int strict) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Unsigned n = (lua_Unsigned)lua_tointeger(L, 2); - if (n < len) { - while (iscontp(s + n)) n++; /* go to next character */ - } - if (n >= len) /* (also handles original 'n' being negative) */ - return 0; /* no more codepoints */ - else { - utfint code; - const char *next = utf8_decode(s + n, &code, strict); - if (next == NULL || iscontp(next)) - return luaL_error(L, MSGInvalid); - lua_pushinteger(L, n + 1); - lua_pushinteger(L, code); - return 2; - } -} - - -static int iter_auxstrict (lua_State *L) { - return iter_aux(L, 1); -} - -static int iter_auxlax (lua_State *L) { - return iter_aux(L, 0); -} - - -static int iter_codes (lua_State *L) { - int lax = lua_toboolean(L, 2); - const char *s = luaL_checkstring(L, 1); - luaL_argcheck(L, !iscontp(s), 1, MSGInvalid); - lua_pushcfunction(L, lax ? iter_auxlax : iter_auxstrict); - lua_pushvalue(L, 1); - lua_pushinteger(L, 0); - return 3; -} - - -/* pattern to match a single UTF-8 character */ -#define UTF8PATT "[\0-\x7F\xC2-\xFD][\x80-\xBF]*" - - -static const luaL_Reg funcs[] = { - {"offset", byteoffset}, - {"codepoint", codepoint}, - {"char", utfchar}, - {"len", utflen}, - {"codes", iter_codes}, - /* placeholders */ - {"charpattern", NULL}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_utf8 (lua_State *L) { - luaL_newlib(L, funcs); - lua_pushlstring(L, UTF8PATT, sizeof(UTF8PATT)/sizeof(char) - 1); - lua_setfield(L, -2, "charpattern"); - return 1; -} - diff --git a/src/dependencies/lua/lvm.c b/src/dependencies/lua/lvm.c deleted file mode 100644 index 4fc74ad..0000000 --- a/src/dependencies/lua/lvm.c +++ /dev/null @@ -1,1895 +0,0 @@ -/* -** $Id: lvm.c $ -** Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#define lvm_c -#define LUA_CORE - -#include "lprefix.h" - -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lvm.h" - - -/* -** By default, use jump tables in the main interpreter loop on gcc -** and compatible compilers. -*/ -#if !defined(LUA_USE_JUMPTABLE) -#if defined(__GNUC__) -#define LUA_USE_JUMPTABLE 1 -#else -#define LUA_USE_JUMPTABLE 0 -#endif -#endif - - - -/* limit for table tag-method chains (to avoid infinite loops) */ -#define MAXTAGLOOP 2000 - - -/* -** 'l_intfitsf' checks whether a given integer is in the range that -** can be converted to a float without rounding. Used in comparisons. -*/ - -/* number of bits in the mantissa of a float */ -#define NBM (l_floatatt(MANT_DIG)) - -/* -** Check whether some integers may not fit in a float, testing whether -** (maxinteger >> NBM) > 0. (That implies (1 << NBM) <= maxinteger.) -** (The shifts are done in parts, to avoid shifting by more than the size -** of an integer. In a worst case, NBM == 113 for long double and -** sizeof(long) == 32.) -*/ -#if ((((LUA_MAXINTEGER >> (NBM / 4)) >> (NBM / 4)) >> (NBM / 4)) \ - >> (NBM - (3 * (NBM / 4)))) > 0 - -/* limit for integers that fit in a float */ -#define MAXINTFITSF ((lua_Unsigned)1 << NBM) - -/* check whether 'i' is in the interval [-MAXINTFITSF, MAXINTFITSF] */ -#define l_intfitsf(i) ((MAXINTFITSF + l_castS2U(i)) <= (2 * MAXINTFITSF)) - -#else /* all integers fit in a float precisely */ - -#define l_intfitsf(i) 1 - -#endif - - -/* -** Try to convert a value from string to a number value. -** If the value is not a string or is a string not representing -** a valid numeral (or if coercions from strings to numbers -** are disabled via macro 'cvt2num'), do not modify 'result' -** and return 0. -*/ -static int l_strton (const TValue *obj, TValue *result) { - lua_assert(obj != result); - if (!cvt2num(obj)) /* is object not a string? */ - return 0; - else { - TString *st = tsvalue(obj); - size_t stlen; - const char *s = getlstr(st, stlen); - return (luaO_str2num(s, result) == stlen + 1); - } -} - - -/* -** Try to convert a value to a float. The float case is already handled -** by the macro 'tonumber'. -*/ -int luaV_tonumber_ (const TValue *obj, lua_Number *n) { - TValue v; - if (ttisinteger(obj)) { - *n = cast_num(ivalue(obj)); - return 1; - } - else if (l_strton(obj, &v)) { /* string coercible to number? */ - *n = nvalue(&v); /* convert result of 'luaO_str2num' to a float */ - return 1; - } - else - return 0; /* conversion failed */ -} - - -/* -** try to convert a float to an integer, rounding according to 'mode'. -*/ -int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode) { - lua_Number f = l_floor(n); - if (n != f) { /* not an integral value? */ - if (mode == F2Ieq) return 0; /* fails if mode demands integral value */ - else if (mode == F2Iceil) /* needs ceil? */ - f += 1; /* convert floor to ceil (remember: n != f) */ - } - return lua_numbertointeger(f, p); -} - - -/* -** try to convert a value to an integer, rounding according to 'mode', -** without string coercion. -** ("Fast track" handled by macro 'tointegerns'.) -*/ -int luaV_tointegerns (const TValue *obj, lua_Integer *p, F2Imod mode) { - if (ttisfloat(obj)) - return luaV_flttointeger(fltvalue(obj), p, mode); - else if (ttisinteger(obj)) { - *p = ivalue(obj); - return 1; - } - else - return 0; -} - - -/* -** try to convert a value to an integer. -*/ -int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode) { - TValue v; - if (l_strton(obj, &v)) /* does 'obj' point to a numerical string? */ - obj = &v; /* change it to point to its corresponding number */ - return luaV_tointegerns(obj, p, mode); -} - - -/* -** Try to convert a 'for' limit to an integer, preserving the semantics -** of the loop. Return true if the loop must not run; otherwise, '*p' -** gets the integer limit. -** (The following explanation assumes a positive step; it is valid for -** negative steps mutatis mutandis.) -** If the limit is an integer or can be converted to an integer, -** rounding down, that is the limit. -** Otherwise, check whether the limit can be converted to a float. If -** the float is too large, clip it to LUA_MAXINTEGER. If the float -** is too negative, the loop should not run, because any initial -** integer value is greater than such limit; so, the function returns -** true to signal that. (For this latter case, no integer limit would be -** correct; even a limit of LUA_MININTEGER would run the loop once for -** an initial value equal to LUA_MININTEGER.) -*/ -static int forlimit (lua_State *L, lua_Integer init, const TValue *lim, - lua_Integer *p, lua_Integer step) { - if (!luaV_tointeger(lim, p, (step < 0 ? F2Iceil : F2Ifloor))) { - /* not coercible to in integer */ - lua_Number flim; /* try to convert to float */ - if (!tonumber(lim, &flim)) /* cannot convert to float? */ - luaG_forerror(L, lim, "limit"); - /* else 'flim' is a float out of integer bounds */ - if (luai_numlt(0, flim)) { /* if it is positive, it is too large */ - if (step < 0) return 1; /* initial value must be less than it */ - *p = LUA_MAXINTEGER; /* truncate */ - } - else { /* it is less than min integer */ - if (step > 0) return 1; /* initial value must be greater than it */ - *p = LUA_MININTEGER; /* truncate */ - } - } - return (step > 0 ? init > *p : init < *p); /* not to run? */ -} - - -/* -** Prepare a numerical for loop (opcode OP_FORPREP). -** Before execution, stack is as follows: -** ra : initial value -** ra + 1 : limit -** ra + 2 : step -** Return true to skip the loop. Otherwise, -** after preparation, stack will be as follows: -** ra : loop counter (integer loops) or limit (float loops) -** ra + 1 : step -** ra + 2 : control variable -*/ -static int forprep (lua_State *L, StkId ra) { - TValue *pinit = s2v(ra); - TValue *plimit = s2v(ra + 1); - TValue *pstep = s2v(ra + 2); - if (ttisinteger(pinit) && ttisinteger(pstep)) { /* integer loop? */ - lua_Integer init = ivalue(pinit); - lua_Integer step = ivalue(pstep); - lua_Integer limit; - if (step == 0) - luaG_runerror(L, "'for' step is zero"); - if (forlimit(L, init, plimit, &limit, step)) - return 1; /* skip the loop */ - else { /* prepare loop counter */ - lua_Unsigned count; - if (step > 0) { /* ascending loop? */ - count = l_castS2U(limit) - l_castS2U(init); - if (step != 1) /* avoid division in the too common case */ - count /= l_castS2U(step); - } - else { /* step < 0; descending loop */ - count = l_castS2U(init) - l_castS2U(limit); - /* 'step+1' avoids negating 'mininteger' */ - count /= l_castS2U(-(step + 1)) + 1u; - } - /* use 'chgivalue' for places that for sure had integers */ - chgivalue(s2v(ra), l_castU2S(count)); /* change init to count */ - setivalue(s2v(ra + 1), step); /* change limit to step */ - chgivalue(s2v(ra + 2), init); /* change step to init */ - } - } - else { /* try making all values floats */ - lua_Number init; lua_Number limit; lua_Number step; - if (l_unlikely(!tonumber(plimit, &limit))) - luaG_forerror(L, plimit, "limit"); - if (l_unlikely(!tonumber(pstep, &step))) - luaG_forerror(L, pstep, "step"); - if (l_unlikely(!tonumber(pinit, &init))) - luaG_forerror(L, pinit, "initial value"); - if (step == 0) - luaG_runerror(L, "'for' step is zero"); - if (luai_numlt(0, step) ? luai_numlt(limit, init) - : luai_numlt(init, limit)) - return 1; /* skip the loop */ - else { - /* make sure all values are floats */ - setfltvalue(s2v(ra), limit); - setfltvalue(s2v(ra + 1), step); - setfltvalue(s2v(ra + 2), init); /* control variable */ - } - } - return 0; -} - - -/* -** Execute a step of a float numerical for loop, returning -** true iff the loop must continue. (The integer case is -** written online with opcode OP_FORLOOP, for performance.) -*/ -static int floatforloop (StkId ra) { - lua_Number step = fltvalue(s2v(ra + 1)); - lua_Number limit = fltvalue(s2v(ra)); - lua_Number idx = fltvalue(s2v(ra + 2)); /* control variable */ - idx = luai_numadd(L, idx, step); /* increment index */ - if (luai_numlt(0, step) ? luai_numle(idx, limit) - : luai_numle(limit, idx)) { - chgfltvalue(s2v(ra + 2), idx); /* update control variable */ - return 1; /* jump back */ - } - else - return 0; /* finish the loop */ -} - - -/* -** Finish the table access 'val = t[key]' and return the tag of the result. -*/ -int luaV_finishget (lua_State *L, const TValue *t, TValue *key, StkId val, - int tag) { - int loop; /* counter to avoid infinite loops */ - const TValue *tm; /* metamethod */ - for (loop = 0; loop < MAXTAGLOOP; loop++) { - if (tag == LUA_VNOTABLE) { /* 't' is not a table? */ - lua_assert(!ttistable(t)); - tm = luaT_gettmbyobj(L, t, TM_INDEX); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, t, "index"); /* no metamethod */ - /* else will try the metamethod */ - } - else { /* 't' is a table */ - tm = fasttm(L, hvalue(t)->metatable, TM_INDEX); /* table's metamethod */ - if (tm == NULL) { /* no metamethod? */ - setnilvalue(s2v(val)); /* result is nil */ - return LUA_VNIL; - } - /* else will try the metamethod */ - } - if (ttisfunction(tm)) { /* is metamethod a function? */ - tag = luaT_callTMres(L, tm, t, key, val); /* call it */ - return tag; /* return tag of the result */ - } - t = tm; /* else try to access 'tm[key]' */ - luaV_fastget(t, key, s2v(val), luaH_get, tag); - if (!tagisempty(tag)) - return tag; /* done */ - /* else repeat (tail call 'luaV_finishget') */ - } - luaG_runerror(L, "'__index' chain too long; possible loop"); - return 0; /* to avoid warnings */ -} - - -/* -** Finish a table assignment 't[key] = val'. -*/ -void luaV_finishset (lua_State *L, const TValue *t, TValue *key, - TValue *val, int hres) { - int loop; /* counter to avoid infinite loops */ - for (loop = 0; loop < MAXTAGLOOP; loop++) { - const TValue *tm; /* '__newindex' metamethod */ - if (hres != HNOTATABLE) { /* is 't' a table? */ - Table *h = hvalue(t); /* save 't' table */ - tm = fasttm(L, h->metatable, TM_NEWINDEX); /* get metamethod */ - if (tm == NULL) { /* no metamethod? */ - luaH_finishset(L, h, key, val, hres); /* set new value */ - invalidateTMcache(h); - luaC_barrierback(L, obj2gco(h), val); - return; - } - /* else will try the metamethod */ - } - else { /* not a table; check metamethod */ - tm = luaT_gettmbyobj(L, t, TM_NEWINDEX); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, t, "index"); - } - /* try the metamethod */ - if (ttisfunction(tm)) { - luaT_callTM(L, tm, t, key, val); - return; - } - t = tm; /* else repeat assignment over 'tm' */ - luaV_fastset(t, key, val, hres, luaH_pset); - if (hres == HOK) - return; /* done */ - /* else 'return luaV_finishset(L, t, key, val, slot)' (loop) */ - } - luaG_runerror(L, "'__newindex' chain too long; possible loop"); -} - - -/* -** Compare two strings 'ts1' x 'ts2', returning an integer less-equal- -** -greater than zero if 'ts1' is less-equal-greater than 'ts2'. -** The code is a little tricky because it allows '\0' in the strings -** and it uses 'strcoll' (to respect locales) for each segment -** of the strings. Note that segments can compare equal but still -** have different lengths. -*/ -static int l_strcmp (const TString *ts1, const TString *ts2) { - size_t rl1; /* real length */ - const char *s1 = getlstr(ts1, rl1); - size_t rl2; - const char *s2 = getlstr(ts2, rl2); - for (;;) { /* for each segment */ - int temp = strcoll(s1, s2); - if (temp != 0) /* not equal? */ - return temp; /* done */ - else { /* strings are equal up to a '\0' */ - size_t zl1 = strlen(s1); /* index of first '\0' in 's1' */ - size_t zl2 = strlen(s2); /* index of first '\0' in 's2' */ - if (zl2 == rl2) /* 's2' is finished? */ - return (zl1 == rl1) ? 0 : 1; /* check 's1' */ - else if (zl1 == rl1) /* 's1' is finished? */ - return -1; /* 's1' is less than 's2' ('s2' is not finished) */ - /* both strings longer than 'zl'; go on comparing after the '\0' */ - zl1++; zl2++; - s1 += zl1; rl1 -= zl1; s2 += zl2; rl2 -= zl2; - } - } -} - - -/* -** Check whether integer 'i' is less than float 'f'. If 'i' has an -** exact representation as a float ('l_intfitsf'), compare numbers as -** floats. Otherwise, use the equivalence 'i < f <=> i < ceil(f)'. -** If 'ceil(f)' is out of integer range, either 'f' is greater than -** all integers or less than all integers. -** (The test with 'l_intfitsf' is only for performance; the else -** case is correct for all values, but it is slow due to the conversion -** from float to int.) -** When 'f' is NaN, comparisons must result in false. -*/ -l_sinline int LTintfloat (lua_Integer i, lua_Number f) { - if (l_intfitsf(i)) - return luai_numlt(cast_num(i), f); /* compare them as floats */ - else { /* i < f <=> i < ceil(f) */ - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Iceil)) /* fi = ceil(f) */ - return i < fi; /* compare them as integers */ - else /* 'f' is either greater or less than all integers */ - return f > 0; /* greater? */ - } -} - - -/* -** Check whether integer 'i' is less than or equal to float 'f'. -** See comments on previous function. -*/ -l_sinline int LEintfloat (lua_Integer i, lua_Number f) { - if (l_intfitsf(i)) - return luai_numle(cast_num(i), f); /* compare them as floats */ - else { /* i <= f <=> i <= floor(f) */ - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ifloor)) /* fi = floor(f) */ - return i <= fi; /* compare them as integers */ - else /* 'f' is either greater or less than all integers */ - return f > 0; /* greater? */ - } -} - - -/* -** Check whether float 'f' is less than integer 'i'. -** See comments on previous function. -*/ -l_sinline int LTfloatint (lua_Number f, lua_Integer i) { - if (l_intfitsf(i)) - return luai_numlt(f, cast_num(i)); /* compare them as floats */ - else { /* f < i <=> floor(f) < i */ - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ifloor)) /* fi = floor(f) */ - return fi < i; /* compare them as integers */ - else /* 'f' is either greater or less than all integers */ - return f < 0; /* less? */ - } -} - - -/* -** Check whether float 'f' is less than or equal to integer 'i'. -** See comments on previous function. -*/ -l_sinline int LEfloatint (lua_Number f, lua_Integer i) { - if (l_intfitsf(i)) - return luai_numle(f, cast_num(i)); /* compare them as floats */ - else { /* f <= i <=> ceil(f) <= i */ - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Iceil)) /* fi = ceil(f) */ - return fi <= i; /* compare them as integers */ - else /* 'f' is either greater or less than all integers */ - return f < 0; /* less? */ - } -} - - -/* -** Return 'l < r', for numbers. -*/ -l_sinline int LTnum (const TValue *l, const TValue *r) { - lua_assert(ttisnumber(l) && ttisnumber(r)); - if (ttisinteger(l)) { - lua_Integer li = ivalue(l); - if (ttisinteger(r)) - return li < ivalue(r); /* both are integers */ - else /* 'l' is int and 'r' is float */ - return LTintfloat(li, fltvalue(r)); /* l < r ? */ - } - else { - lua_Number lf = fltvalue(l); /* 'l' must be float */ - if (ttisfloat(r)) - return luai_numlt(lf, fltvalue(r)); /* both are float */ - else /* 'l' is float and 'r' is int */ - return LTfloatint(lf, ivalue(r)); - } -} - - -/* -** Return 'l <= r', for numbers. -*/ -l_sinline int LEnum (const TValue *l, const TValue *r) { - lua_assert(ttisnumber(l) && ttisnumber(r)); - if (ttisinteger(l)) { - lua_Integer li = ivalue(l); - if (ttisinteger(r)) - return li <= ivalue(r); /* both are integers */ - else /* 'l' is int and 'r' is float */ - return LEintfloat(li, fltvalue(r)); /* l <= r ? */ - } - else { - lua_Number lf = fltvalue(l); /* 'l' must be float */ - if (ttisfloat(r)) - return luai_numle(lf, fltvalue(r)); /* both are float */ - else /* 'l' is float and 'r' is int */ - return LEfloatint(lf, ivalue(r)); - } -} - - -/* -** return 'l < r' for non-numbers. -*/ -static int lessthanothers (lua_State *L, const TValue *l, const TValue *r) { - lua_assert(!ttisnumber(l) || !ttisnumber(r)); - if (ttisstring(l) && ttisstring(r)) /* both are strings? */ - return l_strcmp(tsvalue(l), tsvalue(r)) < 0; - else - return luaT_callorderTM(L, l, r, TM_LT); -} - - -/* -** Main operation less than; return 'l < r'. -*/ -int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) { - if (ttisnumber(l) && ttisnumber(r)) /* both operands are numbers? */ - return LTnum(l, r); - else return lessthanothers(L, l, r); -} - - -/* -** return 'l <= r' for non-numbers. -*/ -static int lessequalothers (lua_State *L, const TValue *l, const TValue *r) { - lua_assert(!ttisnumber(l) || !ttisnumber(r)); - if (ttisstring(l) && ttisstring(r)) /* both are strings? */ - return l_strcmp(tsvalue(l), tsvalue(r)) <= 0; - else - return luaT_callorderTM(L, l, r, TM_LE); -} - - -/* -** Main operation less than or equal to; return 'l <= r'. -*/ -int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r) { - if (ttisnumber(l) && ttisnumber(r)) /* both operands are numbers? */ - return LEnum(l, r); - else return lessequalothers(L, l, r); -} - - -/* -** Main operation for equality of Lua values; return 't1 == t2'. -** L == NULL means raw equality (no metamethods) -*/ -int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2) { - const TValue *tm; - if (ttypetag(t1) != ttypetag(t2)) { /* not the same variant? */ - if (ttype(t1) != ttype(t2) || ttype(t1) != LUA_TNUMBER) - return 0; /* only numbers can be equal with different variants */ - else { /* two numbers with different variants */ - /* One of them is an integer. If the other does not have an - integer value, they cannot be equal; otherwise, compare their - integer values. */ - lua_Integer i1, i2; - return (luaV_tointegerns(t1, &i1, F2Ieq) && - luaV_tointegerns(t2, &i2, F2Ieq) && - i1 == i2); - } - } - /* values have same type and same variant */ - switch (ttypetag(t1)) { - case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: return 1; - case LUA_VNUMINT: return (ivalue(t1) == ivalue(t2)); - case LUA_VNUMFLT: return luai_numeq(fltvalue(t1), fltvalue(t2)); - case LUA_VLIGHTUSERDATA: return pvalue(t1) == pvalue(t2); - case LUA_VLCF: return fvalue(t1) == fvalue(t2); - case LUA_VSHRSTR: return eqshrstr(tsvalue(t1), tsvalue(t2)); - case LUA_VLNGSTR: return luaS_eqlngstr(tsvalue(t1), tsvalue(t2)); - case LUA_VUSERDATA: { - if (uvalue(t1) == uvalue(t2)) return 1; - else if (L == NULL) return 0; - tm = fasttm(L, uvalue(t1)->metatable, TM_EQ); - if (tm == NULL) - tm = fasttm(L, uvalue(t2)->metatable, TM_EQ); - break; /* will try TM */ - } - case LUA_VTABLE: { - if (hvalue(t1) == hvalue(t2)) return 1; - else if (L == NULL) return 0; - tm = fasttm(L, hvalue(t1)->metatable, TM_EQ); - if (tm == NULL) - tm = fasttm(L, hvalue(t2)->metatable, TM_EQ); - break; /* will try TM */ - } - default: - return gcvalue(t1) == gcvalue(t2); - } - if (tm == NULL) /* no TM? */ - return 0; /* objects are different */ - else { - int tag = luaT_callTMres(L, tm, t1, t2, L->top.p); /* call TM */ - return !tagisfalse(tag); - } -} - - -/* macro used by 'luaV_concat' to ensure that element at 'o' is a string */ -#define tostring(L,o) \ - (ttisstring(o) || (cvt2str(o) && (luaO_tostring(L, o), 1))) - -#define isemptystr(o) (ttisshrstring(o) && tsvalue(o)->shrlen == 0) - -/* copy strings in stack from top - n up to top - 1 to buffer */ -static void copy2buff (StkId top, int n, char *buff) { - size_t tl = 0; /* size already copied */ - do { - TString *st = tsvalue(s2v(top - n)); - size_t l; /* length of string being copied */ - const char *s = getlstr(st, l); - memcpy(buff + tl, s, l * sizeof(char)); - tl += l; - } while (--n > 0); -} - - -/* -** Main operation for concatenation: concat 'total' values in the stack, -** from 'L->top.p - total' up to 'L->top.p - 1'. -*/ -void luaV_concat (lua_State *L, int total) { - if (total == 1) - return; /* "all" values already concatenated */ - do { - StkId top = L->top.p; - int n = 2; /* number of elements handled in this pass (at least 2) */ - if (!(ttisstring(s2v(top - 2)) || cvt2str(s2v(top - 2))) || - !tostring(L, s2v(top - 1))) - luaT_tryconcatTM(L); /* may invalidate 'top' */ - else if (isemptystr(s2v(top - 1))) /* second operand is empty? */ - cast_void(tostring(L, s2v(top - 2))); /* result is first operand */ - else if (isemptystr(s2v(top - 2))) { /* first operand is empty string? */ - setobjs2s(L, top - 2, top - 1); /* result is second op. */ - } - else { - /* at least two non-empty string values; get as many as possible */ - size_t tl = tsslen(tsvalue(s2v(top - 1))); - TString *ts; - /* collect total length and number of strings */ - for (n = 1; n < total && tostring(L, s2v(top - n - 1)); n++) { - size_t l = tsslen(tsvalue(s2v(top - n - 1))); - if (l_unlikely(l >= MAX_SIZE - sizeof(TString) - tl)) { - L->top.p = top - total; /* pop strings to avoid wasting stack */ - luaG_runerror(L, "string length overflow"); - } - tl += l; - } - if (tl <= LUAI_MAXSHORTLEN) { /* is result a short string? */ - char buff[LUAI_MAXSHORTLEN]; - copy2buff(top, n, buff); /* copy strings to buffer */ - ts = luaS_newlstr(L, buff, tl); - } - else { /* long string; copy strings directly to final result */ - ts = luaS_createlngstrobj(L, tl); - copy2buff(top, n, getlngstr(ts)); - } - setsvalue2s(L, top - n, ts); /* create result */ - } - total -= n - 1; /* got 'n' strings to create one new */ - L->top.p -= n - 1; /* popped 'n' strings and pushed one */ - } while (total > 1); /* repeat until only 1 result left */ -} - - -/* -** Main operation 'ra = #rb'. -*/ -void luaV_objlen (lua_State *L, StkId ra, const TValue *rb) { - const TValue *tm; - switch (ttypetag(rb)) { - case LUA_VTABLE: { - Table *h = hvalue(rb); - tm = fasttm(L, h->metatable, TM_LEN); - if (tm) break; /* metamethod? break switch to call it */ - setivalue(s2v(ra), luaH_getn(h)); /* else primitive len */ - return; - } - case LUA_VSHRSTR: { - setivalue(s2v(ra), tsvalue(rb)->shrlen); - return; - } - case LUA_VLNGSTR: { - setivalue(s2v(ra), tsvalue(rb)->u.lnglen); - return; - } - default: { /* try metamethod */ - tm = luaT_gettmbyobj(L, rb, TM_LEN); - if (l_unlikely(notm(tm))) /* no metamethod? */ - luaG_typeerror(L, rb, "get length of"); - break; - } - } - luaT_callTMres(L, tm, rb, rb, ra); -} - - -/* -** Integer division; return 'm // n', that is, floor(m/n). -** C division truncates its result (rounds towards zero). -** 'floor(q) == trunc(q)' when 'q >= 0' or when 'q' is integer, -** otherwise 'floor(q) == trunc(q) - 1'. -*/ -lua_Integer luaV_idiv (lua_State *L, lua_Integer m, lua_Integer n) { - if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { /* special cases: -1 or 0 */ - if (n == 0) - luaG_runerror(L, "attempt to divide by zero"); - return intop(-, 0, m); /* n==-1; avoid overflow with 0x80000...//-1 */ - } - else { - lua_Integer q = m / n; /* perform C division */ - if ((m ^ n) < 0 && m % n != 0) /* 'm/n' would be negative non-integer? */ - q -= 1; /* correct result for different rounding */ - return q; - } -} - - -/* -** Integer modulus; return 'm % n'. (Assume that C '%' with -** negative operands follows C99 behavior. See previous comment -** about luaV_idiv.) -*/ -lua_Integer luaV_mod (lua_State *L, lua_Integer m, lua_Integer n) { - if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { /* special cases: -1 or 0 */ - if (n == 0) - luaG_runerror(L, "attempt to perform 'n%%0'"); - return 0; /* m % -1 == 0; avoid overflow with 0x80000...%-1 */ - } - else { - lua_Integer r = m % n; - if (r != 0 && (r ^ n) < 0) /* 'm/n' would be non-integer negative? */ - r += n; /* correct result for different rounding */ - return r; - } -} - - -/* -** Float modulus -*/ -lua_Number luaV_modf (lua_State *L, lua_Number m, lua_Number n) { - lua_Number r; - luai_nummod(L, m, n, r); - return r; -} - - -/* number of bits in an integer */ -#define NBITS cast_int(sizeof(lua_Integer) * CHAR_BIT) - - -/* -** Shift left operation. (Shift right just negates 'y'.) -*/ -lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y) { - if (y < 0) { /* shift right? */ - if (y <= -NBITS) return 0; - else return intop(>>, x, -y); - } - else { /* shift left */ - if (y >= NBITS) return 0; - else return intop(<<, x, y); - } -} - - -/* -** create a new Lua closure, push it in the stack, and initialize -** its upvalues. -*/ -static void pushclosure (lua_State *L, Proto *p, UpVal **encup, StkId base, - StkId ra) { - int nup = p->sizeupvalues; - Upvaldesc *uv = p->upvalues; - int i; - LClosure *ncl = luaF_newLclosure(L, nup); - ncl->p = p; - setclLvalue2s(L, ra, ncl); /* anchor new closure in stack */ - for (i = 0; i < nup; i++) { /* fill in its upvalues */ - if (uv[i].instack) /* upvalue refers to local variable? */ - ncl->upvals[i] = luaF_findupval(L, base + uv[i].idx); - else /* get upvalue from enclosing function */ - ncl->upvals[i] = encup[uv[i].idx]; - luaC_objbarrier(L, ncl, ncl->upvals[i]); - } -} - - -/* -** finish execution of an opcode interrupted by a yield -*/ -void luaV_finishOp (lua_State *L) { - CallInfo *ci = L->ci; - StkId base = ci->func.p + 1; - Instruction inst = *(ci->u.l.savedpc - 1); /* interrupted instruction */ - OpCode op = GET_OPCODE(inst); - switch (op) { /* finish its execution */ - case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { - setobjs2s(L, base + GETARG_A(*(ci->u.l.savedpc - 2)), --L->top.p); - break; - } - case OP_UNM: case OP_BNOT: case OP_LEN: - case OP_GETTABUP: case OP_GETTABLE: case OP_GETI: - case OP_GETFIELD: case OP_SELF: { - setobjs2s(L, base + GETARG_A(inst), --L->top.p); - break; - } - case OP_LT: case OP_LE: - case OP_LTI: case OP_LEI: - case OP_GTI: case OP_GEI: - case OP_EQ: { /* note that 'OP_EQI'/'OP_EQK' cannot yield */ - int res = !l_isfalse(s2v(L->top.p - 1)); - L->top.p--; -#if defined(LUA_COMPAT_LT_LE) - if (ci->callstatus & CIST_LEQ) { /* "<=" using "<" instead? */ - ci->callstatus ^= CIST_LEQ; /* clear mark */ - res = !res; /* negate result */ - } -#endif - lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_JMP); - if (res != GETARG_k(inst)) /* condition failed? */ - ci->u.l.savedpc++; /* skip jump instruction */ - break; - } - case OP_CONCAT: { - StkId top = L->top.p - 1; /* top when 'luaT_tryconcatTM' was called */ - int a = GETARG_A(inst); /* first element to concatenate */ - int total = cast_int(top - 1 - (base + a)); /* yet to concatenate */ - setobjs2s(L, top - 2, top); /* put TM result in proper position */ - L->top.p = top - 1; /* top is one after last element (at top-2) */ - luaV_concat(L, total); /* concat them (may yield again) */ - break; - } - case OP_CLOSE: { /* yielded closing variables */ - ci->u.l.savedpc--; /* repeat instruction to close other vars. */ - break; - } - case OP_RETURN: { /* yielded closing variables */ - StkId ra = base + GETARG_A(inst); - /* adjust top to signal correct number of returns, in case the - return is "up to top" ('isIT') */ - L->top.p = ra + ci->u2.nres; - /* repeat instruction to close other vars. and complete the return */ - ci->u.l.savedpc--; - break; - } - default: { - /* only these other opcodes can yield */ - lua_assert(op == OP_TFORCALL || op == OP_CALL || - op == OP_TAILCALL || op == OP_SETTABUP || op == OP_SETTABLE || - op == OP_SETI || op == OP_SETFIELD); - break; - } - } -} - - - - -/* -** {================================================================== -** Macros for arithmetic/bitwise/comparison opcodes in 'luaV_execute' -** =================================================================== -*/ - -#define l_addi(L,a,b) intop(+, a, b) -#define l_subi(L,a,b) intop(-, a, b) -#define l_muli(L,a,b) intop(*, a, b) -#define l_band(a,b) intop(&, a, b) -#define l_bor(a,b) intop(|, a, b) -#define l_bxor(a,b) intop(^, a, b) - -#define l_lti(a,b) (a < b) -#define l_lei(a,b) (a <= b) -#define l_gti(a,b) (a > b) -#define l_gei(a,b) (a >= b) - - -/* -** Arithmetic operations with immediate operands. 'iop' is the integer -** operation, 'fop' is the float operation. -*/ -#define op_arithI(L,iop,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - int imm = GETARG_sC(i); \ - if (ttisinteger(v1)) { \ - lua_Integer iv1 = ivalue(v1); \ - pc++; setivalue(s2v(ra), iop(L, iv1, imm)); \ - } \ - else if (ttisfloat(v1)) { \ - lua_Number nb = fltvalue(v1); \ - lua_Number fimm = cast_num(imm); \ - pc++; setfltvalue(s2v(ra), fop(L, nb, fimm)); \ - }} - - -/* -** Auxiliary function for arithmetic operations over floats and others -** with two operands. -*/ -#define op_arithf_aux(L,v1,v2,fop) { \ - lua_Number n1; lua_Number n2; \ - if (tonumberns(v1, n1) && tonumberns(v2, n2)) { \ - pc++; setfltvalue(s2v(ra), fop(L, n1, n2)); \ - }} - - -/* -** Arithmetic operations over floats and others with register operands. -*/ -#define op_arithf(L,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - op_arithf_aux(L, v1, v2, fop); } - - -/* -** Arithmetic operations with K operands for floats. -*/ -#define op_arithfK(L,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ - op_arithf_aux(L, v1, v2, fop); } - - -/* -** Arithmetic operations over integers and floats. -*/ -#define op_arith_aux(L,v1,v2,iop,fop) { \ - StkId ra = RA(i); \ - if (ttisinteger(v1) && ttisinteger(v2)) { \ - lua_Integer i1 = ivalue(v1); lua_Integer i2 = ivalue(v2); \ - pc++; setivalue(s2v(ra), iop(L, i1, i2)); \ - } \ - else op_arithf_aux(L, v1, v2, fop); } - - -/* -** Arithmetic operations with register operands. -*/ -#define op_arith(L,iop,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - op_arith_aux(L, v1, v2, iop, fop); } - - -/* -** Arithmetic operations with K operands. -*/ -#define op_arithK(L,iop,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ - op_arith_aux(L, v1, v2, iop, fop); } - - -/* -** Bitwise operations with constant operand. -*/ -#define op_bitwiseK(L,op) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); \ - lua_Integer i1; \ - lua_Integer i2 = ivalue(v2); \ - if (tointegerns(v1, &i1)) { \ - pc++; setivalue(s2v(ra), op(i1, i2)); \ - }} - - -/* -** Bitwise operations with register operands. -*/ -#define op_bitwise(L,op) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - lua_Integer i1; lua_Integer i2; \ - if (tointegerns(v1, &i1) && tointegerns(v2, &i2)) { \ - pc++; setivalue(s2v(ra), op(i1, i2)); \ - }} - - -/* -** Order operations with register operands. 'opn' actually works -** for all numbers, but the fast track improves performance for -** integers. -*/ -#define op_order(L,opi,opn,other) { \ - StkId ra = RA(i); \ - int cond; \ - TValue *rb = vRB(i); \ - if (ttisinteger(s2v(ra)) && ttisinteger(rb)) { \ - lua_Integer ia = ivalue(s2v(ra)); \ - lua_Integer ib = ivalue(rb); \ - cond = opi(ia, ib); \ - } \ - else if (ttisnumber(s2v(ra)) && ttisnumber(rb)) \ - cond = opn(s2v(ra), rb); \ - else \ - Protect(cond = other(L, s2v(ra), rb)); \ - docondjump(); } - - -/* -** Order operations with immediate operand. (Immediate operand is -** always small enough to have an exact representation as a float.) -*/ -#define op_orderI(L,opi,opf,inv,tm) { \ - StkId ra = RA(i); \ - int cond; \ - int im = GETARG_sB(i); \ - if (ttisinteger(s2v(ra))) \ - cond = opi(ivalue(s2v(ra)), im); \ - else if (ttisfloat(s2v(ra))) { \ - lua_Number fa = fltvalue(s2v(ra)); \ - lua_Number fim = cast_num(im); \ - cond = opf(fa, fim); \ - } \ - else { \ - int isf = GETARG_C(i); \ - Protect(cond = luaT_callorderiTM(L, s2v(ra), im, inv, isf, tm)); \ - } \ - docondjump(); } - -/* }================================================================== */ - - -/* -** {================================================================== -** Function 'luaV_execute': main interpreter loop -** =================================================================== -*/ - -/* -** some macros for common tasks in 'luaV_execute' -*/ - - -#define RA(i) (base+GETARG_A(i)) -#define RB(i) (base+GETARG_B(i)) -#define vRB(i) s2v(RB(i)) -#define KB(i) (k+GETARG_B(i)) -#define RC(i) (base+GETARG_C(i)) -#define vRC(i) s2v(RC(i)) -#define KC(i) (k+GETARG_C(i)) -#define RKC(i) ((TESTARG_k(i)) ? k + GETARG_C(i) : s2v(base + GETARG_C(i))) - - - -#define updatetrap(ci) (trap = ci->u.l.trap) - -#define updatebase(ci) (base = ci->func.p + 1) - - -#define updatestack(ci) \ - { if (l_unlikely(trap)) { updatebase(ci); ra = RA(i); } } - - -/* -** Execute a jump instruction. The 'updatetrap' allows signals to stop -** tight loops. (Without it, the local copy of 'trap' could never change.) -*/ -#define dojump(ci,i,e) { pc += GETARG_sJ(i) + e; updatetrap(ci); } - - -/* for test instructions, execute the jump instruction that follows it */ -#define donextjump(ci) { Instruction ni = *pc; dojump(ci, ni, 1); } - -/* -** do a conditional jump: skip next instruction if 'cond' is not what -** was expected (parameter 'k'), else do next instruction, which must -** be a jump. -*/ -#define docondjump() if (cond != GETARG_k(i)) pc++; else donextjump(ci); - - -/* -** Correct global 'pc'. -*/ -#define savepc(L) (ci->u.l.savedpc = pc) - - -/* -** Whenever code can raise errors, the global 'pc' and the global -** 'top' must be correct to report occasional errors. -*/ -#define savestate(L,ci) (savepc(L), L->top.p = ci->top.p) - - -/* -** Protect code that, in general, can raise errors, reallocate the -** stack, and change the hooks. -*/ -#define Protect(exp) (savestate(L,ci), (exp), updatetrap(ci)) - -/* special version that does not change the top */ -#define ProtectNT(exp) (savepc(L), (exp), updatetrap(ci)) - -/* -** Protect code that can only raise errors. (That is, it cannot change -** the stack or hooks.) -*/ -#define halfProtect(exp) (savestate(L,ci), (exp)) - -/* 'c' is the limit of live values in the stack */ -#define checkGC(L,c) \ - { luaC_condGC(L, (savepc(L), L->top.p = (c)), \ - updatetrap(ci)); \ - luai_threadyield(L); } - - -/* fetch an instruction and prepare its execution */ -#define vmfetch() { \ - if (l_unlikely(trap)) { /* stack reallocation or hooks? */ \ - trap = luaG_traceexec(L, pc); /* handle hooks */ \ - updatebase(ci); /* correct stack */ \ - } \ - i = *(pc++); \ -} - -#define vmdispatch(o) switch(o) -#define vmcase(l) case l: -#define vmbreak break - - -void luaV_execute (lua_State *L, CallInfo *ci) { - LClosure *cl; - TValue *k; - StkId base; - const Instruction *pc; - int trap; -#if LUA_USE_JUMPTABLE -#include "ljumptab.h" -#endif - startfunc: - trap = L->hookmask; - returning: /* trap already set */ - cl = ci_func(ci); - k = cl->p->k; - pc = ci->u.l.savedpc; - if (l_unlikely(trap)) - trap = luaG_tracecall(L); - base = ci->func.p + 1; - /* main loop of interpreter */ - for (;;) { - Instruction i; /* instruction being executed */ - vmfetch(); - #if 0 - /* low-level line tracing for debugging Lua */ - printf("line: %d\n", luaG_getfuncline(cl->p, pcRel(pc, cl->p))); - #endif - lua_assert(base == ci->func.p + 1); - lua_assert(base <= L->top.p && L->top.p <= L->stack_last.p); - /* invalidate top for instructions not expecting it */ - lua_assert(isIT(i) || (cast_void(L->top.p = base), 1)); - vmdispatch (GET_OPCODE(i)) { - vmcase(OP_MOVE) { - StkId ra = RA(i); - setobjs2s(L, ra, RB(i)); - vmbreak; - } - vmcase(OP_LOADI) { - StkId ra = RA(i); - lua_Integer b = GETARG_sBx(i); - setivalue(s2v(ra), b); - vmbreak; - } - vmcase(OP_LOADF) { - StkId ra = RA(i); - int b = GETARG_sBx(i); - setfltvalue(s2v(ra), cast_num(b)); - vmbreak; - } - vmcase(OP_LOADK) { - StkId ra = RA(i); - TValue *rb = k + GETARG_Bx(i); - setobj2s(L, ra, rb); - vmbreak; - } - vmcase(OP_LOADKX) { - StkId ra = RA(i); - TValue *rb; - rb = k + GETARG_Ax(*pc); pc++; - setobj2s(L, ra, rb); - vmbreak; - } - vmcase(OP_LOADFALSE) { - StkId ra = RA(i); - setbfvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LFALSESKIP) { - StkId ra = RA(i); - setbfvalue(s2v(ra)); - pc++; /* skip next instruction */ - vmbreak; - } - vmcase(OP_LOADTRUE) { - StkId ra = RA(i); - setbtvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LOADNIL) { - StkId ra = RA(i); - int b = GETARG_B(i); - do { - setnilvalue(s2v(ra++)); - } while (b--); - vmbreak; - } - vmcase(OP_GETUPVAL) { - StkId ra = RA(i); - int b = GETARG_B(i); - setobj2s(L, ra, cl->upvals[b]->v.p); - vmbreak; - } - vmcase(OP_SETUPVAL) { - StkId ra = RA(i); - UpVal *uv = cl->upvals[GETARG_B(i)]; - setobj(L, uv->v.p, s2v(ra)); - luaC_barrier(L, uv, s2v(ra)); - vmbreak; - } - vmcase(OP_GETTABUP) { - StkId ra = RA(i); - TValue *upval = cl->upvals[GETARG_B(i)]->v.p; - TValue *rc = KC(i); - TString *key = tsvalue(rc); /* key must be a short string */ - int tag; - luaV_fastget(upval, key, s2v(ra), luaH_getshortstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, upval, rc, ra, tag)); - vmbreak; - } - vmcase(OP_GETTABLE) { - StkId ra = RA(i); - TValue *rb = vRB(i); - TValue *rc = vRC(i); - int tag; - if (ttisinteger(rc)) { /* fast track for integers? */ - luaV_fastgeti(rb, ivalue(rc), s2v(ra), tag); - } - else - luaV_fastget(rb, rc, s2v(ra), luaH_get, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_GETI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int c = GETARG_C(i); - int tag; - luaV_fastgeti(rb, c, s2v(ra), tag); - if (tagisempty(tag)) { - TValue key; - setivalue(&key, c); - Protect(luaV_finishget(L, rb, &key, ra, tag)); - } - vmbreak; - } - vmcase(OP_GETFIELD) { - StkId ra = RA(i); - TValue *rb = vRB(i); - TValue *rc = KC(i); - TString *key = tsvalue(rc); /* key must be a short string */ - int tag; - luaV_fastget(rb, key, s2v(ra), luaH_getshortstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_SETTABUP) { - int hres; - TValue *upval = cl->upvals[GETARG_A(i)]->v.p; - TValue *rb = KB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rb); /* key must be a short string */ - luaV_fastset(upval, key, rc, hres, luaH_psetshortstr); - if (hres == HOK) - luaV_finishfastset(L, upval, rc); - else - Protect(luaV_finishset(L, upval, rb, rc, hres)); - vmbreak; - } - vmcase(OP_SETTABLE) { - StkId ra = RA(i); - int hres; - TValue *rb = vRB(i); /* key (table is in 'ra') */ - TValue *rc = RKC(i); /* value */ - if (ttisinteger(rb)) { /* fast track for integers? */ - luaV_fastseti(s2v(ra), ivalue(rb), rc, hres); - } - else { - luaV_fastset(s2v(ra), rb, rc, hres, luaH_pset); - } - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else - Protect(luaV_finishset(L, s2v(ra), rb, rc, hres)); - vmbreak; - } - vmcase(OP_SETI) { - StkId ra = RA(i); - int hres; - int b = GETARG_B(i); - TValue *rc = RKC(i); - luaV_fastseti(s2v(ra), b, rc, hres); - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else { - TValue key; - setivalue(&key, b); - Protect(luaV_finishset(L, s2v(ra), &key, rc, hres)); - } - vmbreak; - } - vmcase(OP_SETFIELD) { - StkId ra = RA(i); - int hres; - TValue *rb = KB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rb); /* key must be a short string */ - luaV_fastset(s2v(ra), key, rc, hres, luaH_psetshortstr); - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else - Protect(luaV_finishset(L, s2v(ra), rb, rc, hres)); - vmbreak; - } - vmcase(OP_NEWTABLE) { - StkId ra = RA(i); - int b = GETARG_B(i); /* log2(hash size) + 1 */ - int c = GETARG_C(i); /* array size */ - Table *t; - if (b > 0) - b = 1 << (b - 1); /* size is 2^(b - 1) */ - lua_assert((!TESTARG_k(i)) == (GETARG_Ax(*pc) == 0)); - if (TESTARG_k(i)) /* non-zero extra argument? */ - c += GETARG_Ax(*pc) * (MAXARG_C + 1); /* add it to size */ - pc++; /* skip extra argument */ - L->top.p = ra + 1; /* correct top in case of emergency GC */ - t = luaH_new(L); /* memory allocation */ - sethvalue2s(L, ra, t); - if (b != 0 || c != 0) - luaH_resize(L, t, c, b); /* idem */ - checkGC(L, ra + 1); - vmbreak; - } - vmcase(OP_SELF) { - StkId ra = RA(i); - int tag; - TValue *rb = vRB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rc); /* key must be a string */ - setobj2s(L, ra + 1, rb); - luaV_fastget(rb, key, s2v(ra), luaH_getstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_ADDI) { - op_arithI(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_ADDK) { - op_arithK(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_SUBK) { - op_arithK(L, l_subi, luai_numsub); - vmbreak; - } - vmcase(OP_MULK) { - op_arithK(L, l_muli, luai_nummul); - vmbreak; - } - vmcase(OP_MODK) { - savestate(L, ci); /* in case of division by 0 */ - op_arithK(L, luaV_mod, luaV_modf); - vmbreak; - } - vmcase(OP_POWK) { - op_arithfK(L, luai_numpow); - vmbreak; - } - vmcase(OP_DIVK) { - op_arithfK(L, luai_numdiv); - vmbreak; - } - vmcase(OP_IDIVK) { - savestate(L, ci); /* in case of division by 0 */ - op_arithK(L, luaV_idiv, luai_numidiv); - vmbreak; - } - vmcase(OP_BANDK) { - op_bitwiseK(L, l_band); - vmbreak; - } - vmcase(OP_BORK) { - op_bitwiseK(L, l_bor); - vmbreak; - } - vmcase(OP_BXORK) { - op_bitwiseK(L, l_bxor); - vmbreak; - } - vmcase(OP_SHRI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int ic = GETARG_sC(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - pc++; setivalue(s2v(ra), luaV_shiftl(ib, -ic)); - } - vmbreak; - } - vmcase(OP_SHLI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int ic = GETARG_sC(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - pc++; setivalue(s2v(ra), luaV_shiftl(ic, ib)); - } - vmbreak; - } - vmcase(OP_ADD) { - op_arith(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_SUB) { - op_arith(L, l_subi, luai_numsub); - vmbreak; - } - vmcase(OP_MUL) { - op_arith(L, l_muli, luai_nummul); - vmbreak; - } - vmcase(OP_MOD) { - savestate(L, ci); /* in case of division by 0 */ - op_arith(L, luaV_mod, luaV_modf); - vmbreak; - } - vmcase(OP_POW) { - op_arithf(L, luai_numpow); - vmbreak; - } - vmcase(OP_DIV) { /* float division (always with floats) */ - op_arithf(L, luai_numdiv); - vmbreak; - } - vmcase(OP_IDIV) { /* floor division */ - savestate(L, ci); /* in case of division by 0 */ - op_arith(L, luaV_idiv, luai_numidiv); - vmbreak; - } - vmcase(OP_BAND) { - op_bitwise(L, l_band); - vmbreak; - } - vmcase(OP_BOR) { - op_bitwise(L, l_bor); - vmbreak; - } - vmcase(OP_BXOR) { - op_bitwise(L, l_bxor); - vmbreak; - } - vmcase(OP_SHR) { - op_bitwise(L, luaV_shiftr); - vmbreak; - } - vmcase(OP_SHL) { - op_bitwise(L, luaV_shiftl); - vmbreak; - } - vmcase(OP_MMBIN) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); /* original arith. expression */ - TValue *rb = vRB(i); - TMS tm = (TMS)GETARG_C(i); - StkId result = RA(pi); - lua_assert(OP_ADD <= GET_OPCODE(pi) && GET_OPCODE(pi) <= OP_SHR); - Protect(luaT_trybinTM(L, s2v(ra), rb, result, tm)); - vmbreak; - } - vmcase(OP_MMBINI) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); /* original arith. expression */ - int imm = GETARG_sB(i); - TMS tm = (TMS)GETARG_C(i); - int flip = GETARG_k(i); - StkId result = RA(pi); - Protect(luaT_trybiniTM(L, s2v(ra), imm, flip, result, tm)); - vmbreak; - } - vmcase(OP_MMBINK) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); /* original arith. expression */ - TValue *imm = KB(i); - TMS tm = (TMS)GETARG_C(i); - int flip = GETARG_k(i); - StkId result = RA(pi); - Protect(luaT_trybinassocTM(L, s2v(ra), imm, flip, result, tm)); - vmbreak; - } - vmcase(OP_UNM) { - StkId ra = RA(i); - TValue *rb = vRB(i); - lua_Number nb; - if (ttisinteger(rb)) { - lua_Integer ib = ivalue(rb); - setivalue(s2v(ra), intop(-, 0, ib)); - } - else if (tonumberns(rb, nb)) { - setfltvalue(s2v(ra), luai_numunm(L, nb)); - } - else - Protect(luaT_trybinTM(L, rb, rb, ra, TM_UNM)); - vmbreak; - } - vmcase(OP_BNOT) { - StkId ra = RA(i); - TValue *rb = vRB(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - setivalue(s2v(ra), intop(^, ~l_castS2U(0), ib)); - } - else - Protect(luaT_trybinTM(L, rb, rb, ra, TM_BNOT)); - vmbreak; - } - vmcase(OP_NOT) { - StkId ra = RA(i); - TValue *rb = vRB(i); - if (l_isfalse(rb)) - setbtvalue(s2v(ra)); - else - setbfvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LEN) { - StkId ra = RA(i); - Protect(luaV_objlen(L, ra, vRB(i))); - vmbreak; - } - vmcase(OP_CONCAT) { - StkId ra = RA(i); - int n = GETARG_B(i); /* number of elements to concatenate */ - L->top.p = ra + n; /* mark the end of concat operands */ - ProtectNT(luaV_concat(L, n)); - checkGC(L, L->top.p); /* 'luaV_concat' ensures correct top */ - vmbreak; - } - vmcase(OP_CLOSE) { - StkId ra = RA(i); - Protect(luaF_close(L, ra, LUA_OK, 1)); - vmbreak; - } - vmcase(OP_TBC) { - StkId ra = RA(i); - /* create new to-be-closed upvalue */ - halfProtect(luaF_newtbcupval(L, ra)); - vmbreak; - } - vmcase(OP_JMP) { - dojump(ci, i, 0); - vmbreak; - } - vmcase(OP_EQ) { - StkId ra = RA(i); - int cond; - TValue *rb = vRB(i); - Protect(cond = luaV_equalobj(L, s2v(ra), rb)); - docondjump(); - vmbreak; - } - vmcase(OP_LT) { - op_order(L, l_lti, LTnum, lessthanothers); - vmbreak; - } - vmcase(OP_LE) { - op_order(L, l_lei, LEnum, lessequalothers); - vmbreak; - } - vmcase(OP_EQK) { - StkId ra = RA(i); - TValue *rb = KB(i); - /* basic types do not use '__eq'; we can use raw equality */ - int cond = luaV_rawequalobj(s2v(ra), rb); - docondjump(); - vmbreak; - } - vmcase(OP_EQI) { - StkId ra = RA(i); - int cond; - int im = GETARG_sB(i); - if (ttisinteger(s2v(ra))) - cond = (ivalue(s2v(ra)) == im); - else if (ttisfloat(s2v(ra))) - cond = luai_numeq(fltvalue(s2v(ra)), cast_num(im)); - else - cond = 0; /* other types cannot be equal to a number */ - docondjump(); - vmbreak; - } - vmcase(OP_LTI) { - op_orderI(L, l_lti, luai_numlt, 0, TM_LT); - vmbreak; - } - vmcase(OP_LEI) { - op_orderI(L, l_lei, luai_numle, 0, TM_LE); - vmbreak; - } - vmcase(OP_GTI) { - op_orderI(L, l_gti, luai_numgt, 1, TM_LT); - vmbreak; - } - vmcase(OP_GEI) { - op_orderI(L, l_gei, luai_numge, 1, TM_LE); - vmbreak; - } - vmcase(OP_TEST) { - StkId ra = RA(i); - int cond = !l_isfalse(s2v(ra)); - docondjump(); - vmbreak; - } - vmcase(OP_TESTSET) { - StkId ra = RA(i); - TValue *rb = vRB(i); - if (l_isfalse(rb) == GETARG_k(i)) - pc++; - else { - setobj2s(L, ra, rb); - donextjump(ci); - } - vmbreak; - } - vmcase(OP_CALL) { - StkId ra = RA(i); - CallInfo *newci; - int b = GETARG_B(i); - int nresults = GETARG_C(i) - 1; - if (b != 0) /* fixed number of arguments? */ - L->top.p = ra + b; /* top signals number of arguments */ - /* else previous instruction set top */ - savepc(L); /* in case of errors */ - if ((newci = luaD_precall(L, ra, nresults)) == NULL) - updatetrap(ci); /* C call; nothing else to be done */ - else { /* Lua call: run function in this same C frame */ - ci = newci; - goto startfunc; - } - vmbreak; - } - vmcase(OP_TAILCALL) { - StkId ra = RA(i); - int b = GETARG_B(i); /* number of arguments + 1 (function) */ - int n; /* number of results when calling a C function */ - int nparams1 = GETARG_C(i); - /* delta is virtual 'func' - real 'func' (vararg functions) */ - int delta = (nparams1) ? ci->u.l.nextraargs + nparams1 : 0; - if (b != 0) - L->top.p = ra + b; - else /* previous instruction set top */ - b = cast_int(L->top.p - ra); - savepc(ci); /* several calls here can raise errors */ - if (TESTARG_k(i)) { - luaF_closeupval(L, base); /* close upvalues from current call */ - lua_assert(L->tbclist.p < base); /* no pending tbc variables */ - lua_assert(base == ci->func.p + 1); - } - if ((n = luaD_pretailcall(L, ci, ra, b, delta)) < 0) /* Lua function? */ - goto startfunc; /* execute the callee */ - else { /* C function? */ - ci->func.p -= delta; /* restore 'func' (if vararg) */ - luaD_poscall(L, ci, n); /* finish caller */ - updatetrap(ci); /* 'luaD_poscall' can change hooks */ - goto ret; /* caller returns after the tail call */ - } - } - vmcase(OP_RETURN) { - StkId ra = RA(i); - int n = GETARG_B(i) - 1; /* number of results */ - int nparams1 = GETARG_C(i); - if (n < 0) /* not fixed? */ - n = cast_int(L->top.p - ra); /* get what is available */ - savepc(ci); - if (TESTARG_k(i)) { /* may there be open upvalues? */ - ci->u2.nres = n; /* save number of returns */ - if (L->top.p < ci->top.p) - L->top.p = ci->top.p; - luaF_close(L, base, CLOSEKTOP, 1); - updatetrap(ci); - updatestack(ci); - } - if (nparams1) /* vararg function? */ - ci->func.p -= ci->u.l.nextraargs + nparams1; - L->top.p = ra + n; /* set call for 'luaD_poscall' */ - luaD_poscall(L, ci, n); - updatetrap(ci); /* 'luaD_poscall' can change hooks */ - goto ret; - } - vmcase(OP_RETURN0) { - if (l_unlikely(L->hookmask)) { - StkId ra = RA(i); - L->top.p = ra; - savepc(ci); - luaD_poscall(L, ci, 0); /* no hurry... */ - trap = 1; - } - else { /* do the 'poscall' here */ - int nres; - L->ci = ci->previous; /* back to caller */ - L->top.p = base - 1; - for (nres = ci->nresults; l_unlikely(nres > 0); nres--) - setnilvalue(s2v(L->top.p++)); /* all results are nil */ - } - goto ret; - } - vmcase(OP_RETURN1) { - if (l_unlikely(L->hookmask)) { - StkId ra = RA(i); - L->top.p = ra + 1; - savepc(ci); - luaD_poscall(L, ci, 1); /* no hurry... */ - trap = 1; - } - else { /* do the 'poscall' here */ - int nres = ci->nresults; - L->ci = ci->previous; /* back to caller */ - if (nres == 0) - L->top.p = base - 1; /* asked for no results */ - else { - StkId ra = RA(i); - setobjs2s(L, base - 1, ra); /* at least this result */ - L->top.p = base; - for (; l_unlikely(nres > 1); nres--) - setnilvalue(s2v(L->top.p++)); /* complete missing results */ - } - } - ret: /* return from a Lua function */ - if (ci->callstatus & CIST_FRESH) - return; /* end this frame */ - else { - ci = ci->previous; - goto returning; /* continue running caller in this frame */ - } - } - vmcase(OP_FORLOOP) { - StkId ra = RA(i); - if (ttisinteger(s2v(ra + 1))) { /* integer loop? */ - lua_Unsigned count = l_castS2U(ivalue(s2v(ra))); - if (count > 0) { /* still more iterations? */ - lua_Integer step = ivalue(s2v(ra + 1)); - lua_Integer idx = ivalue(s2v(ra + 2)); /* control variable */ - chgivalue(s2v(ra), count - 1); /* update counter */ - idx = intop(+, idx, step); /* add step to index */ - chgivalue(s2v(ra + 2), idx); /* update control variable */ - pc -= GETARG_Bx(i); /* jump back */ - } - } - else if (floatforloop(ra)) /* float loop */ - pc -= GETARG_Bx(i); /* jump back */ - updatetrap(ci); /* allows a signal to break the loop */ - vmbreak; - } - vmcase(OP_FORPREP) { - StkId ra = RA(i); - savestate(L, ci); /* in case of errors */ - if (forprep(L, ra)) - pc += GETARG_Bx(i) + 1; /* skip the loop */ - vmbreak; - } - vmcase(OP_TFORPREP) { - /* before: 'ra' has the iterator function, 'ra + 1' has the state, - 'ra + 2' has the initial value for the control variable, and - 'ra + 3' has the closing variable. This opcode then swaps the - control and the closing variables and marks the closing variable - as to-be-closed. - */ - StkId ra = RA(i); - TValue temp; /* to swap control and closing variables */ - setobj(L, &temp, s2v(ra + 3)); - setobjs2s(L, ra + 3, ra + 2); - setobj2s(L, ra + 2, &temp); - /* create to-be-closed upvalue (if closing var. is not nil) */ - halfProtect(luaF_newtbcupval(L, ra + 2)); - pc += GETARG_Bx(i); /* go to end of the loop */ - i = *(pc++); /* fetch next instruction */ - lua_assert(GET_OPCODE(i) == OP_TFORCALL && ra == RA(i)); - goto l_tforcall; - } - vmcase(OP_TFORCALL) { - l_tforcall: { - /* 'ra' has the iterator function, 'ra + 1' has the state, - 'ra + 2' has the closing variable, and 'ra + 3' has the control - variable. The call will use the stack starting at 'ra + 3', - so that it preserves the first three values, and the first - return will be the new value for the control variable. - */ - StkId ra = RA(i); - setobjs2s(L, ra + 5, ra + 3); /* copy the control variable */ - setobjs2s(L, ra + 4, ra + 1); /* copy state */ - setobjs2s(L, ra + 3, ra); /* copy function */ - L->top.p = ra + 3 + 3; - ProtectNT(luaD_call(L, ra + 3, GETARG_C(i))); /* do the call */ - updatestack(ci); /* stack may have changed */ - i = *(pc++); /* go to next instruction */ - lua_assert(GET_OPCODE(i) == OP_TFORLOOP && ra == RA(i)); - goto l_tforloop; - }} - vmcase(OP_TFORLOOP) { - l_tforloop: { - StkId ra = RA(i); - if (!ttisnil(s2v(ra + 3))) /* continue loop? */ - pc -= GETARG_Bx(i); /* jump back */ - vmbreak; - }} - vmcase(OP_SETLIST) { - StkId ra = RA(i); - int n = GETARG_B(i); - unsigned int last = GETARG_C(i); - Table *h = hvalue(s2v(ra)); - if (n == 0) - n = cast_int(L->top.p - ra) - 1; /* get up to the top */ - else - L->top.p = ci->top.p; /* correct top in case of emergency GC */ - last += n; - if (TESTARG_k(i)) { - last += GETARG_Ax(*pc) * (MAXARG_C + 1); - pc++; - } - if (last > luaH_realasize(h)) /* needs more space? */ - luaH_resizearray(L, h, last); /* preallocate it at once */ - for (; n > 0; n--) { - TValue *val = s2v(ra + n); - obj2arr(h, last, val); - last--; - luaC_barrierback(L, obj2gco(h), val); - } - vmbreak; - } - vmcase(OP_CLOSURE) { - StkId ra = RA(i); - Proto *p = cl->p->p[GETARG_Bx(i)]; - halfProtect(pushclosure(L, p, cl->upvals, base, ra)); - checkGC(L, ra + 1); - vmbreak; - } - vmcase(OP_VARARG) { - StkId ra = RA(i); - int n = GETARG_C(i) - 1; /* required results */ - Protect(luaT_getvarargs(L, ci, ra, n)); - vmbreak; - } - vmcase(OP_VARARGPREP) { - ProtectNT(luaT_adjustvarargs(L, GETARG_A(i), ci, cl->p)); - if (l_unlikely(trap)) { /* previous "Protect" updated trap */ - luaD_hookcall(L, ci); - L->oldpc = 1; /* next opcode will be seen as a "new" line */ - } - updatebase(ci); /* function has new base after adjustment */ - vmbreak; - } - vmcase(OP_EXTRAARG) { - lua_assert(0); - vmbreak; - } - } - } -} - -/* }================================================================== */ diff --git a/src/dependencies/lua/lvm.h b/src/dependencies/lua/lvm.h deleted file mode 100644 index a11db83..0000000 --- a/src/dependencies/lua/lvm.h +++ /dev/null @@ -1,136 +0,0 @@ -/* -** $Id: lvm.h $ -** Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#ifndef lvm_h -#define lvm_h - - -#include "ldo.h" -#include "lobject.h" -#include "ltm.h" - - -#if !defined(LUA_NOCVTN2S) -#define cvt2str(o) ttisnumber(o) -#else -#define cvt2str(o) 0 /* no conversion from numbers to strings */ -#endif - - -#if !defined(LUA_NOCVTS2N) -#define cvt2num(o) ttisstring(o) -#else -#define cvt2num(o) 0 /* no conversion from strings to numbers */ -#endif - - -/* -** You can define LUA_FLOORN2I if you want to convert floats to integers -** by flooring them (instead of raising an error if they are not -** integral values) -*/ -#if !defined(LUA_FLOORN2I) -#define LUA_FLOORN2I F2Ieq -#endif - - -/* -** Rounding modes for float->integer coercion - */ -typedef enum { - F2Ieq, /* no rounding; accepts only integral values */ - F2Ifloor, /* takes the floor of the number */ - F2Iceil /* takes the ceil of the number */ -} F2Imod; - - -/* convert an object to a float (including string coercion) */ -#define tonumber(o,n) \ - (ttisfloat(o) ? (*(n) = fltvalue(o), 1) : luaV_tonumber_(o,n)) - - -/* convert an object to a float (without string coercion) */ -#define tonumberns(o,n) \ - (ttisfloat(o) ? ((n) = fltvalue(o), 1) : \ - (ttisinteger(o) ? ((n) = cast_num(ivalue(o)), 1) : 0)) - - -/* convert an object to an integer (including string coercion) */ -#define tointeger(o,i) \ - (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ - : luaV_tointeger(o,i,LUA_FLOORN2I)) - - -/* convert an object to an integer (without string coercion) */ -#define tointegerns(o,i) \ - (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ - : luaV_tointegerns(o,i,LUA_FLOORN2I)) - - -#define intop(op,v1,v2) l_castU2S(l_castS2U(v1) op l_castS2U(v2)) - -#define luaV_rawequalobj(t1,t2) luaV_equalobj(NULL,t1,t2) - - -/* -** fast track for 'gettable' -*/ -#define luaV_fastget(t,k,res,f, tag) \ - (tag = (!ttistable(t) ? LUA_VNOTABLE : f(hvalue(t), k, res))) - - -/* -** Special case of 'luaV_fastget' for integers, inlining the fast case -** of 'luaH_getint'. -*/ -#define luaV_fastgeti(t,k,res,tag) \ - if (!ttistable(t)) tag = LUA_VNOTABLE; \ - else { luaH_fastgeti(hvalue(t), k, res, tag); } - - -#define luaV_fastset(t,k,val,hres,f) \ - (hres = (!ttistable(t) ? HNOTATABLE : f(hvalue(t), k, val))) - -#define luaV_fastseti(t,k,val,hres) \ - if (!ttistable(t)) hres = HNOTATABLE; \ - else { luaH_fastseti(hvalue(t), k, val, hres); } - - -/* -** Finish a fast set operation (when fast set succeeds). -*/ -#define luaV_finishfastset(L,t,v) luaC_barrierback(L, gcvalue(t), v) - - -/* -** Shift right is the same as shift left with a negative 'y' -*/ -#define luaV_shiftr(x,y) luaV_shiftl(x,intop(-, 0, y)) - - - -LUAI_FUNC int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2); -LUAI_FUNC int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r); -LUAI_FUNC int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r); -LUAI_FUNC int luaV_tonumber_ (const TValue *obj, lua_Number *n); -LUAI_FUNC int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode); -LUAI_FUNC int luaV_tointegerns (const TValue *obj, lua_Integer *p, - F2Imod mode); -LUAI_FUNC int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode); -LUAI_FUNC int luaV_finishget (lua_State *L, const TValue *t, TValue *key, - StkId val, int tag); -LUAI_FUNC void luaV_finishset (lua_State *L, const TValue *t, TValue *key, - TValue *val, int aux); -LUAI_FUNC void luaV_finishOp (lua_State *L); -LUAI_FUNC void luaV_execute (lua_State *L, CallInfo *ci); -LUAI_FUNC void luaV_concat (lua_State *L, int total); -LUAI_FUNC lua_Integer luaV_idiv (lua_State *L, lua_Integer x, lua_Integer y); -LUAI_FUNC lua_Integer luaV_mod (lua_State *L, lua_Integer x, lua_Integer y); -LUAI_FUNC lua_Number luaV_modf (lua_State *L, lua_Number x, lua_Number y); -LUAI_FUNC lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y); -LUAI_FUNC void luaV_objlen (lua_State *L, StkId ra, const TValue *rb); - -#endif diff --git a/src/dependencies/lua/lzio.c b/src/dependencies/lua/lzio.c deleted file mode 100644 index 22f4d53..0000000 --- a/src/dependencies/lua/lzio.c +++ /dev/null @@ -1,87 +0,0 @@ -/* -** $Id: lzio.c $ -** Buffered streams -** See Copyright Notice in lua.h -*/ - -#define lzio_c -#define LUA_CORE - - - -#include - -#include "lua.h" - -#include "llimits.h" -#include "lmem.h" -#include "lstate.h" -#include "lzio.h" - - -int luaZ_fill (ZIO *z) { - size_t size; - lua_State *L = z->L; - const char *buff; - lua_unlock(L); - buff = z->reader(L, z->data, &size); - lua_lock(L); - if (buff == NULL || size == 0) - return EOZ; - z->n = size - 1; /* discount char being returned */ - z->p = buff; - return cast_uchar(*(z->p++)); -} - - -void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, void *data) { - z->L = L; - z->reader = reader; - z->data = data; - z->n = 0; - z->p = NULL; -} - - -/* --------------------------------------------------------------- read --- */ - -static int checkbuffer (ZIO *z) { - if (z->n == 0) { /* no bytes in buffer? */ - if (luaZ_fill(z) == EOZ) /* try to read more */ - return 0; /* no more input */ - else { - z->n++; /* luaZ_fill consumed first byte; put it back */ - z->p--; - } - } - return 1; /* now buffer has something */ -} - - -size_t luaZ_read (ZIO *z, void *b, size_t n) { - while (n) { - size_t m; - if (!checkbuffer(z)) - return n; /* no more input; return number of missing bytes */ - m = (n <= z->n) ? n : z->n; /* min. between n and z->n */ - memcpy(b, z->p, m); - z->n -= m; - z->p += m; - b = (char *)b + m; - n -= m; - } - return 0; -} - - -const void *luaZ_getaddr (ZIO* z, size_t n) { - const void *res; - if (!checkbuffer(z)) - return NULL; /* no more input */ - if (z->n < n) /* not enough bytes? */ - return NULL; /* block not whole; cannot give an address */ - res = z->p; /* get block address */ - z->n -= n; /* consume these bytes */ - z->p += n; - return res; -} diff --git a/src/dependencies/lua/lzio.h b/src/dependencies/lua/lzio.h deleted file mode 100644 index 55cc74a..0000000 --- a/src/dependencies/lua/lzio.h +++ /dev/null @@ -1,67 +0,0 @@ -/* -** $Id: lzio.h $ -** Buffered streams -** See Copyright Notice in lua.h -*/ - - -#ifndef lzio_h -#define lzio_h - -#include "lua.h" - -#include "lmem.h" - - -#define EOZ (-1) /* end of stream */ - -typedef struct Zio ZIO; - -#define zgetc(z) (((z)->n--)>0 ? cast_uchar(*(z)->p++) : luaZ_fill(z)) - - -typedef struct Mbuffer { - char *buffer; - size_t n; - size_t buffsize; -} Mbuffer; - -#define luaZ_initbuffer(L, buff) ((buff)->buffer = NULL, (buff)->buffsize = 0) - -#define luaZ_buffer(buff) ((buff)->buffer) -#define luaZ_sizebuffer(buff) ((buff)->buffsize) -#define luaZ_bufflen(buff) ((buff)->n) - -#define luaZ_buffremove(buff,i) ((buff)->n -= (i)) -#define luaZ_resetbuffer(buff) ((buff)->n = 0) - - -#define luaZ_resizebuffer(L, buff, size) \ - ((buff)->buffer = luaM_reallocvchar(L, (buff)->buffer, \ - (buff)->buffsize, size), \ - (buff)->buffsize = size) - -#define luaZ_freebuffer(L, buff) luaZ_resizebuffer(L, buff, 0) - - -LUAI_FUNC void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, - void *data); -LUAI_FUNC size_t luaZ_read (ZIO* z, void *b, size_t n); /* read next n bytes */ - -LUAI_FUNC const void *luaZ_getaddr (ZIO* z, size_t n); - - -/* --------- Private Part ------------------ */ - -struct Zio { - size_t n; /* bytes still unread */ - const char *p; /* current position in buffer */ - lua_Reader reader; /* reader function */ - void *data; /* additional data */ - lua_State *L; /* Lua state (for reader) */ -}; - - -LUAI_FUNC int luaZ_fill (ZIO *z); - -#endif diff --git a/src/dependencies/lua/onelua.c b/src/dependencies/lua/onelua.c deleted file mode 100644 index e6addc8..0000000 --- a/src/dependencies/lua/onelua.c +++ /dev/null @@ -1,124 +0,0 @@ -/* -** Lua core, libraries, and interpreter in a single file. -** Compiling just this file generates a complete Lua stand-alone -** program: -** -** $ gcc -O2 -std=c99 -o lua onelua.c -lm -** -** or -** -** $ gcc -O2 -std=c89 -DLUA_USE_C89 -o lua onelua.c -lm -** -*/ - -/* default is to build the full interpreter */ -#ifndef MAKE_LIB -#ifndef MAKE_LUAC -#ifndef MAKE_LUA -#define MAKE_LUA -#endif -#endif -#endif -#include -#include "custom_math/custom_math.h" -#include "custom_math/custom_math.c" -/* -** Choose suitable platform-specific features. Default is no -** platform-specific features. Some of these options may need extra -** libraries such as -ldl -lreadline -lncurses -*/ -#if 0 -#define LUA_USE_LINUX -#define LUA_USE_MACOSX -#define LUA_USE_POSIX -#define LUA_ANSI -#endif - - -/* no need to change anything below this line ----------------------------- */ - -#include "lprefix.h" - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -#ifdef _WIN32 -#include -#else -#include -#include -#endif - -/* setup for luaconf.h */ -#define LUA_CORE -#define LUA_LIB -#define ltable_c -#define lvm_c -#include "luaconf.h" - -/* do not export internal symbols */ -#undef LUAI_FUNC -#undef LUAI_DDEC -#undef LUAI_DDEF -#define LUAI_FUNC static -#define LUAI_DDEC(def) /* empty */ -#define LUAI_DDEF static - -/* core -- used by all */ -#include "lzio.c" -#include "lctype.c" -#include "lopcodes.c" -#include "lmem.c" -#include "lundump.c" -#include "ldump.c" -#include "lstate.c" -#include "lgc.c" -#include "llex.c" -#include "lcode.c" -#include "lparser.c" -#include "ldebug.c" -#include "lfunc.c" -#include "lobject.c" -#include "ltm.c" -#include "lstring.c" -#include "ltable.c" -#include "ldo.c" -#include "lvm.c" -#include "lapi.c" - -/* auxiliary library -- used by all */ -#include "lauxlib.c" - - - -/* standard library -- not used by luac */ -#ifndef MAKE_LUAC -#include "lbaselib.c" -#include "lcorolib.c" -#include "ldblib.c" -#include "liolib.c" -#include "lmathlib.c" -#include "loadlib.c" -#include "loslib.c" -#include "lstrlib.c" -#include "ltablib.c" -#include "lutf8lib.c" -#include "linit.c" -#endif - -/* luac */ -#ifdef MAKE_LUAC -#include "luac.c" -#endif \ No newline at end of file diff --git a/src/extra/fdeclare.extra.h b/src/extra/fdeclare.extra.h index 8d9e024..afb205f 100644 --- a/src/extra/fdeclare.extra.h +++ b/src/extra/fdeclare.extra.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../imports/imports.typesD.h" -//silver_chain_scope_end const char * LuaCembed_convert_arg_code(int arg_code); diff --git a/src/extra/fdefine.extra.c b/src/extra/fdefine.extra.c index f76ae6c..b267350 100644 --- a/src/extra/fdefine.extra.c +++ b/src/extra/fdefine.extra.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../imports/imports.fdeclare.h" -//silver_chain_scope_end const char * LuaCembed_convert_arg_code(int arg_code){ diff --git a/src/imports/imports.consts.h b/src/imports/imports.consts.h deleted file mode 100644 index 584709e..0000000 --- a/src/imports/imports.consts.h +++ /dev/null @@ -1,10 +0,0 @@ -#include "imports.dependencies.h" -#ifndef privateluacembed_consts -#define privateluacembed_consts -#include "../constants/consts.aplication.h" -#include "../constants/consts.errors.h" -#include "../constants/consts.lua_code.h" -#include "../constants/consts.main_callback.h" -#include "../constants/consts.responses.h" -#include "../constants/consts.types.h" -#endif diff --git a/src/imports/imports.dependencies.h b/src/imports/imports.dependencies.h deleted file mode 100644 index ed9a21a..0000000 --- a/src/imports/imports.dependencies.h +++ /dev/null @@ -1,5 +0,0 @@ -#ifndef privateluacembed_dependencies -#define privateluacembed_dependencies -#include "../dependencies.native.h" -#include "../dependencies/dependencies.all.h" -#endif diff --git a/src/imports/imports.fdeclare.h b/src/imports/imports.fdeclare.h index e50d5d6..b63aa9f 100644 --- a/src/imports/imports.fdeclare.h +++ b/src/imports/imports.fdeclare.h @@ -1,11 +1,12 @@ -#include "imports.typesD.h" -#ifndef privateluacembed_fdeclare -#define privateluacembed_fdeclare +#include "imports.consts.h" +#ifndef LuaCEmbed_fdeclare +#define LuaCEmbed_fdeclare #include "../LuaCEmbed/args/args_error/fdeclare.args_error.h" #include "../LuaCEmbed/args/basic/fdeclare.basic.h" #include "../LuaCEmbed/args/evaluation/fdeclare.evaluation.h" #include "../LuaCEmbed/basic/fdeclare.basic.h" #include "../LuaCEmbed/callback_handle/fdeclare.callback_handle.h" +#include "../LuaCEmbed/errors/fdeclare.errors.h" #include "../LuaCEmbed/evaluation/fdeclare.evaluation.h" #include "../LuaCEmbed/globals/errors/fdeclare.errors.h" #include "../LuaCEmbed/globals/getters/fdeclare.getters.h" diff --git a/src/imports/imports.fdefine.h b/src/imports/imports.fdefine.h index 14020e0..74c59a7 100644 --- a/src/imports/imports.fdefine.h +++ b/src/imports/imports.fdefine.h @@ -1,11 +1,12 @@ -#include "imports.fdeclare.h" -#ifndef privateluacembed_fdefine -#define privateluacembed_fdefine +#include "imports.dep_define.h" +#ifndef LuaCEmbed_fdefine +#define LuaCEmbed_fdefine #include "../LuaCEmbed/args/args_error/fdefine.args_error.c" #include "../LuaCEmbed/args/basic/fdefine.basic.c" #include "../LuaCEmbed/args/evaluation/fdefine.evaluation.c" #include "../LuaCEmbed/basic/fdefine.basic.c" #include "../LuaCEmbed/callback_handle/fdefine.callback_handle.c" +#include "../LuaCEmbed/errors/fdefine.errors.c" #include "../LuaCEmbed/evaluation/fdefine.evaluation.c" #include "../LuaCEmbed/globals/errors/fdefine.errors.c" #include "../LuaCEmbed/globals/getters/fdefine.getters.c" diff --git a/src/imports/imports.macros.h b/src/imports/imports.macros.h index fc10446..d454a40 100644 --- a/src/imports/imports.macros.h +++ b/src/imports/imports.macros.h @@ -1,6 +1,6 @@ -#include "imports.consts.h" -#ifndef privateluacembed_macros -#define privateluacembed_macros +#include "imports.dep_declare.h" +#ifndef LuaCEmbed_macros +#define LuaCEmbed_macros #include "../LuaCEmbed/macros.protection_macros.h" #include "../LuaCEmbed/table/macros.protection_macros.h" #endif diff --git a/src/imports/imports.types.h b/src/imports/imports.types.h index cff662b..f86eac8 100644 --- a/src/imports/imports.types.h +++ b/src/imports/imports.types.h @@ -1,6 +1,6 @@ #include "imports.macros.h" -#ifndef privateluacembed_types -#define privateluacembed_types +#ifndef LuaCEmbed_types +#define LuaCEmbed_types #include "../LuaCEmbed/types.LuaCEmbed.h" #include "../LuaCEmbedResponse/types.LuaCembedResponse.h" #include "../types.typedefs.h" diff --git a/src/imports/imports.typesB.h b/src/imports/imports.typesB.h index f7458d4..d86c640 100644 --- a/src/imports/imports.typesB.h +++ b/src/imports/imports.typesB.h @@ -1,5 +1,5 @@ #include "imports.types.h" -#ifndef privateluacembed_typesB -#define privateluacembed_typesB +#ifndef LuaCEmbed_typesB +#define LuaCEmbed_typesB #include "../LuaCEmbed/table/table/typesB.table.h" #endif diff --git a/src/imports/imports.typesC.h b/src/imports/imports.typesC.h index 1c1ac3c..2d44f4c 100644 --- a/src/imports/imports.typesC.h +++ b/src/imports/imports.typesC.h @@ -1,6 +1,6 @@ #include "imports.typesB.h" -#ifndef privateluacembed_typesC -#define privateluacembed_typesC +#ifndef LuaCEmbed_typesC +#define LuaCEmbed_typesC #include "../namespace/args/typesC.args.h" #include "../namespace/globals/typesC.globals.h" #include "../namespace/response/typesC.response.h" diff --git a/src/imports/imports.typesD.h b/src/imports/imports.typesD.h index 8ed2cc1..0732b50 100644 --- a/src/imports/imports.typesD.h +++ b/src/imports/imports.typesD.h @@ -1,5 +1,5 @@ #include "imports.typesC.h" -#ifndef privateluacembed_typesD -#define privateluacembed_typesD +#ifndef LuaCEmbed_typesD +#define LuaCEmbed_typesD #include "../namespace/LuaCEmbedNamespace/typesD.LuaCEmbedNamespace.h" #endif diff --git a/src/namespace/LuaCEmbedNamespace/fdeclare.LuaCEmbedNamespace.h b/src/namespace/LuaCEmbedNamespace/fdeclare.LuaCEmbedNamespace.h index 79070d5..9751d6f 100644 --- a/src/namespace/LuaCEmbedNamespace/fdeclare.LuaCEmbedNamespace.h +++ b/src/namespace/LuaCEmbedNamespace/fdeclare.LuaCEmbedNamespace.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesD.h" -//silver_chain_scope_end LuaCEmbedNamespace newLuaCEmbedNamespace(); diff --git a/src/namespace/LuaCEmbedNamespace/fdefine.LuaCEmbedNamespace.c b/src/namespace/LuaCEmbedNamespace/fdefine.LuaCEmbedNamespace.c index f717f13..fbbf0d4 100644 --- a/src/namespace/LuaCEmbedNamespace/fdefine.LuaCEmbedNamespace.c +++ b/src/namespace/LuaCEmbedNamespace/fdefine.LuaCEmbedNamespace.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.fdeclare.h" -//silver_chain_scope_end @@ -13,6 +9,9 @@ LuaCEmbedNamespace newLuaCEmbedNamespace(){ self.newLuaEvaluation = newLuaCEmbedEvaluation; self.set_delete_function = LuaCembed_set_delete_function; self.perform = LuaCembed_perform; + self.send_self_as_lib = LuaCembed_send_self_as_lib; + self.send_global_as_lib = LuaCembed_send_global_as_lib; + self.load_native_libs = LuaCEmbed_load_native_libs; self.set_memory_limit = LuaCEmbed_set_memory_limit; self.clear_errors = LuaCEmbed_clear_errors; @@ -45,6 +44,8 @@ LuaCEmbedNamespace newLuaCEmbedNamespace(){ self.get_bool_lib_prop = LuaCEmbed_get_bool_lib_prop; self.get_string_lib_prop = LuaCEmbed_get_string_lib_prop; self.get_table_lib_prop = LuaCEmbed_get_table_lib_prop; + self.dangerous_raise_error_jumping = LuaCEmbed_dangerous_raise_error_jumping; + self.dangerous_raise_self_error_jumping = LuaCEmbed_dangerous_raise_self_error_jumping; self.free = LuaCEmbed_free; return self; diff --git a/src/namespace/LuaCEmbedNamespace/typesD.LuaCEmbedNamespace.h b/src/namespace/LuaCEmbedNamespace/typesD.LuaCEmbedNamespace.h index f7c7e5d..233f747 100644 --- a/src/namespace/LuaCEmbedNamespace/typesD.LuaCEmbedNamespace.h +++ b/src/namespace/LuaCEmbedNamespace/typesD.LuaCEmbedNamespace.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesC.h" -//silver_chain_scope_end typedef struct{ LuaCEmbedTypeModule types; @@ -17,6 +13,9 @@ typedef struct{ void (*load_native_libs)(LuaCEmbed *self); void (*load_lib_from_c)(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name); int (*perform)(LuaCEmbed *self); + int (*send_self_as_lib)(LuaCEmbed *self); + int (*send_global_as_lib)(LuaCEmbed *self,const char *global_name); + const char * (*convert_arg_code)(int arg_code); void (*set_memory_limit)(LuaCEmbed *self, double limit); @@ -31,14 +30,14 @@ typedef struct{ double (*get_evaluation_double)(LuaCEmbed *self,const char *code,...); bool (*get_evaluation_bool)(LuaCEmbed *self, const char *code,...); - void (*set_long_lib_prop)(LuaCEmbed *self,const char *name,long long value); + void (*set_long_lib_prop)(LuaCEmbed *self,const char *name,lua_Integer value); void (*set_double_lib_prop)(LuaCEmbed *self,const char *name,double value); void (*set_bool_lib_prop)(LuaCEmbed *self,const char *name,bool value); void (*set_string_lib_prop)(LuaCEmbed *self,const char *name,const char * value); void (*set_table_lib_prop)(LuaCEmbed *self,const char *name,LuaCEmbedTable *value); - long long (*get_long_lib_prop)(LuaCEmbed *self,const char *name); + lua_Integer (*get_long_lib_prop)(LuaCEmbed *self,const char *name); double (*get_double_lib_prop)(LuaCEmbed *self,const char *name); bool (*get_bool_lib_prop)(LuaCEmbed *self,const char *name); char * (*get_string_lib_prop)(LuaCEmbed *self,const char *name); @@ -48,6 +47,9 @@ typedef struct{ void (*add_callback)(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); void (*add_global_callback)(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); + void (*dangerous_raise_error_jumping)(LuaCEmbed *self,const char *error_msg,...); + void (*dangerous_raise_self_error_jumping)(LuaCEmbed *self); + void (*free)(LuaCEmbed *self); } LuaCEmbedNamespace; diff --git a/src/namespace/args/fdeclare.args.h b/src/namespace/args/fdeclare.args.h index eed6486..53c585e 100644 --- a/src/namespace/args/fdeclare.args.h +++ b/src/namespace/args/fdeclare.args.h @@ -1,7 +1,3 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesD.h" -//silver_chain_scope_end LuaCembedArgsModule newLuaCembedArgsModule(); diff --git a/src/namespace/args/fdefine.args.c b/src/namespace/args/fdefine.args.c index d55beb8..be0c4cb 100644 --- a/src/namespace/args/fdefine.args.c +++ b/src/namespace/args/fdefine.args.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.fdeclare.h" -//silver_chain_scope_end LuaCembedArgsModule newLuaCembedArgsModule(){ diff --git a/src/namespace/args/typesC.args.h b/src/namespace/args/typesC.args.h index 9ea1ad8..bc0519c 100644 --- a/src/namespace/args/typesC.args.h +++ b/src/namespace/args/typesC.args.h @@ -1,27 +1,23 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesB.h" -//silver_chain_scope_end typedef struct { - int (*size)(LuaCEmbed *self); - int (*get_type)(LuaCEmbed *self,int index); - long long (*get_long)(LuaCEmbed *self, int index); - double (*get_double)(LuaCEmbed *self, int index); - bool (*get_bool)(LuaCEmbed *self, int index); - char * (*get_raw_str)(LuaCEmbed *self, long *size, int index); - char * (*get_str)(LuaCEmbed *self, int index); - LuaCEmbedTable * (*get_table)(LuaCEmbed *self,int index); - int (*generate_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - int (*get_type_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - long long (*get_long_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - double (*get_double_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - bool (*get_bool_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - char* (*get_string_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - LuaCEmbedTable* (*run_lambda)(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call,int total_returns); + lua_Integer (*size)(LuaCEmbed *self); + lua_Integer (*get_type)(LuaCEmbed *self,lua_Integer index); + lua_Integer (*get_long)(LuaCEmbed *self, lua_Integer index); + double (*get_double)(LuaCEmbed *self, lua_Integer index); + bool (*get_bool)(LuaCEmbed *self, lua_Integer index); + char * (*get_raw_str)(LuaCEmbed *self, lua_Integer *size, lua_Integer index); + char * (*get_str)(LuaCEmbed *self, lua_Integer index); + LuaCEmbedTable * (*get_table)(LuaCEmbed *self,lua_Integer index); + lua_Integer (*generate_arg_clojure_evalation)(LuaCEmbed *self,lua_Integer index,const char *code,...); + lua_Integer (*get_type_clojure_evalation)(LuaCEmbed *self,lua_Integer index,const char *code,...); + lua_Integer (*get_long_arg_clojure_evalation)(LuaCEmbed *self,lua_Integer index,const char *code,...); + double (*get_double_arg_clojure_evalation)(LuaCEmbed *self,lua_Integer index,const char *code,...); + bool (*get_bool_arg_clojure_evalation)(LuaCEmbed *self,lua_Integer index,const char *code,...); + char* (*get_string_arg_clojure_evalation)(LuaCEmbed *self,lua_Integer index,const char *code,...); + LuaCEmbedTable* (*run_lambda)(LuaCEmbed *self, lua_Integer index, LuaCEmbedTable *args_to_call,lua_Integer total_returns); diff --git a/src/namespace/globals/fdeclare.globals.h b/src/namespace/globals/fdeclare.globals.h index a5a09ac..42bb843 100644 --- a/src/namespace/globals/fdeclare.globals.h +++ b/src/namespace/globals/fdeclare.globals.h @@ -1,7 +1,3 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesD.h" -//silver_chain_scope_end LuaCEmbedGlobalModule newLuaCEmbedGlobalModule(); diff --git a/src/namespace/globals/fdefine.globals.c b/src/namespace/globals/fdefine.globals.c index 7940664..7c629e0 100644 --- a/src/namespace/globals/fdefine.globals.c +++ b/src/namespace/globals/fdefine.globals.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.fdeclare.h" -//silver_chain_scope_end LuaCEmbedGlobalModule newLuaCEmbedGlobalModule(){ diff --git a/src/namespace/globals/typesC.globals.h b/src/namespace/globals/typesC.globals.h index 2f11a70..47f4fe5 100644 --- a/src/namespace/globals/typesC.globals.h +++ b/src/namespace/globals/typesC.globals.h @@ -1,15 +1,11 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesB.h" -//silver_chain_scope_end typedef struct { int (*ensure_type)(LuaCEmbed *self, const char *name,int expected_type); int (*get_type)(LuaCEmbed *self,const char *name); - long long (*get_long)(LuaCEmbed *self,const char *name); + lua_Integer (*get_long)(LuaCEmbed *self,const char *name); double (*get_double)(LuaCEmbed *self,const char *name); bool (*get_bool)(LuaCEmbed *self,const char *name); char * (*get_string)(LuaCEmbed *self,const char *name); @@ -20,7 +16,7 @@ typedef struct { void (*set_string)(LuaCEmbed *self,const char *name,const char *value); - void (*set_long)(LuaCEmbed *self,const char *name,long long value); + void (*set_long)(LuaCEmbed *self,const char *name,lua_Integer value); void (*set_double)(LuaCEmbed *self,const char *name,double value); void (*set_bool)(LuaCEmbed *self,const char *name,bool value); diff --git a/src/namespace/response/fdeclare.response.h b/src/namespace/response/fdeclare.response.h index 8bd6a6d..58022fa 100644 --- a/src/namespace/response/fdeclare.response.h +++ b/src/namespace/response/fdeclare.response.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesD.h" -//silver_chain_scope_end LuaCEmbedResponseModule newLuaCEmbedResponseModule(); diff --git a/src/namespace/response/fdefine.response.c b/src/namespace/response/fdefine.response.c index 71231bf..4ccda10 100644 --- a/src/namespace/response/fdefine.response.c +++ b/src/namespace/response/fdefine.response.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.fdeclare.h" -//silver_chain_scope_end LuaCEmbedResponseModule newLuaCEmbedResponseModule(){ diff --git a/src/namespace/response/typesC.response.h b/src/namespace/response/typesC.response.h index 61c4f70..da2fb57 100644 --- a/src/namespace/response/typesC.response.h +++ b/src/namespace/response/typesC.response.h @@ -1,20 +1,16 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesB.h" -//silver_chain_scope_end typedef struct { LuaCEmbedResponse * (*send_multi_return)(LuaCEmbedTable *table); LuaCEmbedResponse * (*send_str)(const char *text); - LuaCEmbedResponse * (*send_raw_string)(const char *text,long size); + LuaCEmbedResponse * (*send_raw_string)(const char *text,lua_Integer size); LuaCEmbedResponse * (*send_str_reference)( const char *text); - LuaCEmbedResponse * (*send_raw_string_reference)(const char *text,long size); + LuaCEmbedResponse * (*send_raw_string_reference)(const char *text,lua_Integer size); LuaCEmbedResponse * (*send_table)(LuaCEmbedTable *table); LuaCEmbedResponse * (*send_evaluation_function)(const char *function); LuaCEmbedResponse * (*send_double)(double value); LuaCEmbedResponse * (*send_bool)(bool value); - LuaCEmbedResponse * (*send_long)(long value); + LuaCEmbedResponse * (*send_long)(lua_Integer value); LuaCEmbedResponse * (*send_error)(const char *format,...); }LuaCEmbedResponseModule; diff --git a/src/namespace/table/fdeclare.table.h b/src/namespace/table/fdeclare.table.h index 96a1af7..f63d818 100644 --- a/src/namespace/table/fdeclare.table.h +++ b/src/namespace/table/fdeclare.table.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesD.h" -//silver_chain_scope_end LuaCembedTableModule newLuaCembedTableModule(); diff --git a/src/namespace/table/fdefine.table.c b/src/namespace/table/fdefine.table.c index 674dde1..9f3ab54 100644 --- a/src/namespace/table/fdefine.table.c +++ b/src/namespace/table/fdefine.table.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.fdeclare.h" -//silver_chain_scope_end LuaCembedTableModule newLuaCembedTableModule(){ @@ -27,7 +23,7 @@ LuaCembedTableModule newLuaCembedTableModule(){ self.set_double_prop = LuaCEmbedTable_set_double_prop; self.set_long_prop = LuaCEmbedTable_set_long_prop; self.set_string_prop = LuaCEmbedTable_set_string_prop; - + self.set_raw_string_prop = LuaCEmbedTable_set_raw_string_prop; self.get_sub_table_prop = LuaCEmbedTable_get_sub_table_by_key; self.new_sub_table_prop = LuaCEmbedTable_new_sub_table_by_key; self.set_sub_table_prop = LuaCEmbedTable_set_sub_table_prop; @@ -38,6 +34,7 @@ LuaCembedTableModule newLuaCembedTableModule(){ self.get_double_prop = LuaCembedTable_get_double_prop; self.get_long_prop = LuaCembedTable_get_long_prop; self.get_string_prop = LuaCembedTable_get_string_prop; + self.get_raw_string_prop= LuaCembedTable_get_raw_string_prop; self.get_type_prop = LuaCEmbedTable_get_type_prop; self.destroy_prop = LuaCembedTable_destroy_prop; @@ -45,10 +42,10 @@ LuaCembedTableModule newLuaCembedTableModule(){ self.set_bool_by_index= LuaCEmbedTable_set_bool_by_index; self.set_double_by_index =LuaCEmbedTable_set_double_by_index; self.set_string_by_index = LuaCEmbedTable_set_string_by_index; + self.set_raw_string_by_index = LuaCEmbedTable_set_raw_string_by_index; self.set_evaluation_by_index = LuaCEmbedTable_set_evaluation_by_index; self.get_listable_size = LuaCEmbedTable_get_listable_size; - self.new_sub_table_appending = LuaCEmbedTable_new_sub_table_appending; self.has_key = LuaCembedTable_has_key_at_index; self.get_key_by_index = LuaCembedTable_get_key_by_index; @@ -58,6 +55,7 @@ LuaCembedTableModule newLuaCembedTableModule(){ self.get_double_by_index = LuaCEmbedTable_get_double_by_index; self.get_bool_by_index = LuaCEmbedTable_get_bool_by_index; self.get_string_by_index= LuaCEmbedTable_get_string_by_index; + self.get_raw_string_by_index =LuaCEmbedTable_get_raw_string_by_index; self.get_sub_table_by_index = LuaCEmbedTable_get_sub_table_by_index; return self; } diff --git a/src/namespace/table/typesC.table.h b/src/namespace/table/typesC.table.h index ec258f1..9b7a114 100644 --- a/src/namespace/table/typesC.table.h +++ b/src/namespace/table/typesC.table.h @@ -1,45 +1,45 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesB.h" -//silver_chain_scope_end typedef struct { void (*append_string)(LuaCEmbedTable *self, const char *value); - void (*append_long)(LuaCEmbedTable *self, long long value); + void (*append_long)(LuaCEmbedTable *self, lua_Integer value); void (*append_double)(LuaCEmbedTable *self, double value); void (*append_bool)(LuaCEmbedTable *self, bool value); void (*append_table)(LuaCEmbedTable *self, LuaCEmbedTable *table); void (*set_evaluation_prop)(LuaCEmbedTable *self, const char *name, const char *code, ...); void (*append_evaluation)(LuaCEmbedTable *self, const char *code, ...); - void (*insert_string_at_index)(LuaCEmbedTable *self, long index, const char *value); - void (*insert_bool_at_index)(LuaCEmbedTable *self, long index,bool value); - void (*insert_long_at_index)(LuaCEmbedTable *self, long long index,long value); - void (*insert_double_at_index)(LuaCEmbedTable *self, long index,double value); - void (*insert_table_at_index)(LuaCEmbedTable *self, long index,LuaCEmbedTable *table); + void (*insert_string_at_index)(LuaCEmbedTable *self, lua_Integer index, const char *value); + void (*insert_bool_at_index)(LuaCEmbedTable *self, lua_Integer index,bool value); + void (*insert_long_at_index)(LuaCEmbedTable *self, lua_Integer index,lua_Integer value); + void (*insert_double_at_index)(LuaCEmbedTable *self, lua_Integer index,double value); + void (*insert_table_at_index)(LuaCEmbedTable *self, lua_Integer index,LuaCEmbedTable *table); - void (*set_sub_table_by_index)(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table); - void (*set_string_by_index)(LuaCEmbedTable *self, long index, const char *value); - void (*set_long_by_index)(LuaCEmbedTable *self, long long index, long value); - void (*set_double_by_index)(LuaCEmbedTable *self, long index, double value); - void (*set_bool_by_index)(LuaCEmbedTable *self, long index, bool value); - void (*set_evaluation_by_index)(LuaCEmbedTable *self, long index, const char *code, ...); - long (*get_listable_size)(LuaCEmbedTable *self); - LuaCEmbedTable *(*get_sub_table_by_index)(LuaCEmbedTable *self, long index); + void (*set_sub_table_by_index)(LuaCEmbedTable *self, lua_Integer index,LuaCEmbedTable *sub_table); + void (*set_string_by_index)(LuaCEmbedTable *self, lua_Integer index, const char *value); + void (*set_raw_string_by_index)(LuaCEmbedTable *self, lua_Integer index, const char *value,lua_Integer size); + void (*set_long_by_index)(LuaCEmbedTable *self, lua_Integer index, lua_Integer value); + void (*set_double_by_index)(LuaCEmbedTable *self, lua_Integer index, double value); + void (*set_bool_by_index)(LuaCEmbedTable *self, lua_Integer index, bool value); + void (*set_evaluation_by_index)(LuaCEmbedTable *self, lua_Integer index, const char *code, ...); + lua_Integer (*get_listable_size)(LuaCEmbedTable *self); + LuaCEmbedTable *(*get_sub_table_by_index)(LuaCEmbedTable *self, lua_Integer index); LuaCEmbedTable *(*new_sub_table_appending)(LuaCEmbedTable *self); void (*set_method)(LuaCEmbedTable *self , const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)); void (*set_string_prop)(LuaCEmbedTable *self , const char *name, const char *value); - void (*set_long_prop)(LuaCEmbedTable *self , const char *name, long long value); + void (*set_raw_string_prop)(LuaCEmbedTable *self , const char *name, const char *value,lua_Integer size); + + void (*set_long_prop)(LuaCEmbedTable *self , const char *name,lua_Integer value); void (*set_double_prop)(LuaCEmbedTable *self , const char *name, double value); void (*set_bool_prop)(LuaCEmbedTable *self , const char *name, bool value); int (*get_type_prop)(LuaCEmbedTable *self, const char *name); char* (*get_string_prop)(LuaCEmbedTable *self , const char *name); - long long (*get_long_prop)(LuaCEmbedTable *self , const char *name); + char* (*get_raw_string_prop)(LuaCEmbedTable *self, const char *name,lua_Integer *size); + lua_Integer (*get_long_prop)(LuaCEmbedTable *self , const char *name); double (*get_double_prop)(LuaCEmbedTable *self , const char *name); bool (*get_bool_prop)(LuaCEmbedTable *self , const char *name); LuaCEmbedTable * (*new_anonymous_table)(LuaCEmbed *self); @@ -48,14 +48,16 @@ typedef struct { LuaCEmbedTable *(*get_sub_table_prop)(LuaCEmbedTable *self, const char *name); LuaCEmbedTable *(*new_sub_table_prop)(LuaCEmbedTable *self, const char *name); void (*set_sub_table_prop)(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table); - char *(*get_key_by_index)(LuaCEmbedTable *self, long index); - bool (*has_key)(LuaCEmbedTable *self,long index); - - long (*get_size)(LuaCEmbedTable *self); - int (*get_type_by_index)(LuaCEmbedTable *self, int index); - long long (*get_long_by_index)(LuaCEmbedTable *self, int index); - double (*get_double_by_index)(LuaCEmbedTable *self, int index); - char * (*get_string_by_index)(LuaCEmbedTable *self, int index); - bool (*get_bool_by_index)(LuaCEmbedTable *self, int index); + char *(*get_key_by_index)(LuaCEmbedTable *self, lua_Integer index); + bool (*has_key)(LuaCEmbedTable *self,lua_Integer index); + + lua_Integer (*get_size)(LuaCEmbedTable *self); + int (*get_type_by_index)(LuaCEmbedTable *self, lua_Integer index); + lua_Integer (*get_long_by_index)(LuaCEmbedTable *self, lua_Integer index); + double (*get_double_by_index)(LuaCEmbedTable *self, lua_Integer index); + char * (*get_string_by_index)(LuaCEmbedTable *self, lua_Integer index); + char * (*get_raw_string_by_index)(LuaCEmbedTable *self, lua_Integer index, lua_Integer *size); + + bool (*get_bool_by_index)(LuaCEmbedTable *self, lua_Integer index); }LuaCembedTableModule; diff --git a/src/namespace/types/fdeclare.types.h b/src/namespace/types/fdeclare.types.h index 40d203b..0064062 100644 --- a/src/namespace/types/fdeclare.types.h +++ b/src/namespace/types/fdeclare.types.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesD.h" -//silver_chain_scope_end diff --git a/src/namespace/types/fdefine.types.c b/src/namespace/types/fdefine.types.c index 0cf953e..989452c 100644 --- a/src/namespace/types/fdefine.types.c +++ b/src/namespace/types/fdefine.types.c @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.fdeclare.h" -//silver_chain_scope_end LuaCEmbedTypeModule newLuaCEmbedTypeModule(){ LuaCEmbedTypeModule self = {0}; diff --git a/src/namespace/types/typesC.types.h b/src/namespace/types/typesC.types.h index 937bc78..71af5db 100644 --- a/src/namespace/types/typesC.types.h +++ b/src/namespace/types/typesC.types.h @@ -1,8 +1,4 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "../../imports/imports.typesB.h" -//silver_chain_scope_end typedef struct { diff --git a/src/src_dependencies/dep_declare.dependecies.h b/src/src_dependencies/dep_declare.dependecies.h new file mode 100644 index 0000000..32b5cea --- /dev/null +++ b/src/src_dependencies/dep_declare.dependecies.h @@ -0,0 +1,23 @@ + +#if defined(__unix__) || defined(__APPLE__) + #include + #include +#endif + +#if !defined(lua_h) && !defined(LUA_CEMBED_MOCK_LUA) + #define LUA_SINGLE_UNITY_GUESS_OS + #define LUA_SINGLE_UNITY_EMBED_MODE + #if !defined(LUA_CEMBED_NOT_IMPLEMENT_MATH) + #define LUA_SINGLE_UNITY_IMPLEMENT_MATH + #endif + + #include "../../dependencies/lua_single_unity.h" + #define LUA_CEMBED_LUA_DECLARATED +#endif + + +#if !defined(UniversalGarbage_fdeclare) && !defined(LUA_CEMBED_MOCK_UNIVERSAL_GARBAGE) + #include "../../dependencies/UniversalGarbage.h" + #define LUA_CEMBED_UNIVERSAL_GARBAGE_DECLARATED +#endif + diff --git a/src/src_dependencies/dep_define.dependencies.c b/src/src_dependencies/dep_define.dependencies.c new file mode 100644 index 0000000..27f07ea --- /dev/null +++ b/src/src_dependencies/dep_define.dependencies.c @@ -0,0 +1,13 @@ + +#if !defined(LUA_CEMBED_MOCK_LUA_DEFINE) && defined(LUA_CEMBED_LUA_DECLARATED) + + + + #include "../../dependencies/lua_single_unity_classic_onelua.c" + +#endif + + +#if !defined(LUA_CEMBED_MOCK_UNIVERSAL_GARBAGE_DEFINE) && defined(LUA_CEMBED_UNIVERSAL_GARBAGE_DECLARATED) +#include "../../dependencies/UniversalGarbage.c" +#endif \ No newline at end of file diff --git a/src/types.typedefs.h b/src/types.typedefs.h index d9acee3..d69cddb 100644 --- a/src/types.typedefs.h +++ b/src/types.typedefs.h @@ -1,6 +1,2 @@ -//silver_chain_scope_start -//mannaged by silver chain -#include "imports/imports.macros.h" -//silver_chain_scope_end -typedef long private_lua_cembed_incremented_arg ; +typedef lua_Integer private_lua_cembed_incremented_arg ; diff --git a/teste b/teste deleted file mode 100755 index f11da72..0000000 Binary files a/teste and /dev/null differ diff --git a/teste.c b/teste.c deleted file mode 100644 index f000d42..0000000 --- a/teste.c +++ /dev/null @@ -1,37 +0,0 @@ -#include "src/one.c" - -LuaCEmbedNamespace lua_n; - - - LuaCEmbedResponse *add_cfunc(LuaCEmbed *args){ - double first_num = lua_n.args.get_double(args,0); - double second_num = lua_n.args.get_double(args,1); - - if(lua_n.has_errors(args)){ - char *message = lua_n.get_error_message(args); - return lua_n.response.send_error(message); - } - double result = first_num + second_num; - return lua_n.response.send_double(result); -} -LuaCEmbedResponse *sub_cfunc(LuaCEmbed *args){ - double first_num = lua_n.args.get_double(args,0); - double second_num = lua_n.args.get_double(args,1); - - if(lua_n.has_errors(args)){ - char *message = lua_n.get_error_message(args); - return lua_n.response.send_error(message); - } - double result = first_num - second_num; - return lua_n.response.send_double(result); -} -int luaopen_my_lib(lua_State *state){ - lua_n = newLuaCEmbedNamespace(); - //functions will be only assescible by the required reciver - LuaCEmbed * l = lua_n.newLuaLib(state); - lua_n.add_callback(l,"add",add_cfunc); - lua_n.add_callback(l,"sub",sub_cfunc); - -return lua_n.perform(l); - -} diff --git a/tests/LuaCEmbed.h b/tests/LuaCEmbed.h deleted file mode 100644 index 659de13..0000000 --- a/tests/LuaCEmbed.h +++ /dev/null @@ -1,32362 +0,0 @@ -//path: src/one.c - -#ifndef LUACEMBED_H -//path: src/imports/imports.fdefine.h -//path: src/imports/imports.fdeclare.h -//path: src/imports/imports.typesD.h -//path: src/imports/imports.typesC.h -//path: src/imports/imports.typesB.h -//path: src/imports/imports.types.h -//path: src/imports/imports.macros.h -//path: src/imports/imports.consts.h -//path: src/imports/imports.dependencies.h -#ifndef privateluacembed_dependencies -#define privateluacembed_dependencies -//path: src/imports/../dependencies.native.h -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -#ifdef _WIN32 -#include -#else -#include -#include -#endif - - -//path: src/imports/../dependencies/dependencies.all.h -//path: src/imports/../dependencies/UniversalGarbage.h - - - -#ifndef UNIVERSAL_GARBAGE_H - - -#include -#include -#include -#include - - - - - -#define UniversalGarbage_create_empty_struct(name,element_type) \ -(element_type*)malloc(sizeof(element_type)); \ -*name = (element_type){0}; - - -#define UniversalGarbage_cast(value) ((void**)&value) - - -#define UniversalGarbage_add(garbage,deallocator_callback,value) \ - rawUniversalGarbage_add(garbage,(void*)deallocator_callback,UniversalGarbage_cast(value)) - -#define UniversalGarbage_add_simple(garbage,value) \ - UniversalGarbage_add(garbage,free,value) - - -#define UniversalGarbage_add_return(garbage,deallocator_callback,value) \ - UniversalGarbage_add(garbage->return_values,deallocator_callback,value) - - -#define UniversalGarbage_add_simple_return(garbage,value) \ - UniversalGarbage_add_simple(garbage->return_values,value) - - - -#define UniversalGarbage_remove(garbage,value) \ - rawUniversalGarbage_remove(garbage,UniversalGarbage_cast(value)); - - -#define UniversalGarbage_disconnect(garbage,value) \ - rawUniversalGarbage_disconnect(garbage,UniversalGarbage_cast(value)); - - - - -#define UniversalGarbage_reallocate(garbage,value) \ - rawUniversalGarbage_reallocate(garbage,UniversalGarbage_cast(value)) - - -#define UniversalGarbage_resset(garbage,value) \ - rawUniversalGarbage_resset(garbage,UniversalGarbage_cast(value)) - - - - - - -typedef struct privateUniversalGarbageElement{ - void **pointer; - void (*deallocator_callback)(void *element); - void *pointed_value; -}privateUniversalGarbageElement; - -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self); - - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self); - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer); - - - -typedef struct UniversalGarbage{ - - struct UniversalGarbage *return_values; - privateUniversalGarbageElement **elements; - int elements_size; - bool is_the_root; - -}UniversalGarbage; - -UniversalGarbage * newUniversalGarbage(); - -UniversalGarbage * private_new_MainUniversalGarbage(); - - - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer); - -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer); - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self); - -void UniversalGarbage_free_including_return(UniversalGarbage *self); - -void UniversalGarbage_free(UniversalGarbage *self); - - - - - - - -privateUniversalGarbageElement * private_newUniversalGarbageSimpleElement(void (*dealocator_callback)(void *element), void **pointer){ - - privateUniversalGarbageElement * self = UniversalGarbage_create_empty_struct( - self, - privateUniversalGarbageElement - ); - self->pointer = pointer; - self->deallocator_callback = dealocator_callback; - self->pointed_value = *pointer; - return self; -} -void private_UniversalGarbageSimpleElement_free_pointed_value(privateUniversalGarbageElement *self){ - if(self->pointed_value){ - self->deallocator_callback(self->pointed_value); - self->pointed_value = NULL; - } -} - -void private_UniversalGarbageSimpleElement_free(privateUniversalGarbageElement *self){ - private_UniversalGarbageSimpleElement_free_pointed_value(self); - free(self); -} - - -UniversalGarbage * private_new_MainUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->is_the_root = false; - return self; -} - -UniversalGarbage * newUniversalGarbage(){ - UniversalGarbage *self = UniversalGarbage_create_empty_struct(self,UniversalGarbage) - self->is_the_root = true; - self->elements = (privateUniversalGarbageElement**)malloc(0); - self->return_values =private_new_MainUniversalGarbage(); - - return self; -} - - - - -bool rawUniversalGarbage_reallocate(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - - if(rawUniversalGarbage_reallocate(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - - privateUniversalGarbageElement *current = self->elements[i]; - bool reallocate = current->pointer == pointer; - - if(reallocate){ - current->pointed_value = *pointer; - return true; - } - } - return false; -} - -bool rawUniversalGarbage_resset(UniversalGarbage *self, void **pointer){ - - if(self->is_the_root){ - if(rawUniversalGarbage_resset(self->return_values,pointer)){ - return true; - } - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - bool resset = current->pointer == pointer; - if(resset){ - private_UniversalGarbageSimpleElement_free_pointed_value(current); - current->pointed_value = *pointer; - return true; - } - } - return false; - -} -bool rawUniversalGarbage_remove(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_remove(self->return_values,pointer)){ - *pointer = NULL; - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - private_UniversalGarbageSimpleElement_free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - - } - *pointer = NULL; - return true; - } - } - return false; -} -bool rawUniversalGarbage_disconnect(UniversalGarbage *self, void **pointer){ - if(self->is_the_root){ - if(rawUniversalGarbage_disconnect(self->return_values,pointer)){ - return true; - } - } - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - free(current); - self->elements_size-=1; - bool its_not_the_last = i < self->elements_size; - if(its_not_the_last){ - self->elements[i] = self->elements[self->elements_size]; - } - return true; - } - } - return false; - - - -} -bool rawUniversalGarbage_add(UniversalGarbage *self, void *release_callback, void **pointer){ - - if(!pointer){ - return false; - } - - - for(int i = 0; i < self->elements_size; i++){ - privateUniversalGarbageElement *current = self->elements[i]; - if(current->pointer == pointer){ - return false; - } - } - - self->elements = (privateUniversalGarbageElement**)realloc( - self->elements, - (self->elements_size + 1) * sizeof(privateUniversalGarbageElement*) - ); - void (*dealocator_callback)(void *element); -#ifdef __cplusplus - dealocator_callback =reinterpret_cast(release_callback); -#else - dealocator_callback = (void*)(void*)release_callback; - -#endif - - - - self->elements[self->elements_size] = private_newUniversalGarbageSimpleElement(dealocator_callback, pointer); - self->elements_size+=1; - return true; -} - - - -void private_UniversalGarbage_free_all_sub_elements(UniversalGarbage *self){ - for(int i = 0; i < self->elements_size; i++){ - private_UniversalGarbageSimpleElement_free(self->elements[i]); - } - free(self->elements); -} - -void UniversalGarbage_free_including_return(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - if(self->is_the_root){ - UniversalGarbage_free(self->return_values); - } - free(self); -} - -void UniversalGarbage_free(UniversalGarbage *self){ - private_UniversalGarbage_free_all_sub_elements(self); - - if(self->is_the_root){ - - UniversalGarbage *return_garbage = self->return_values; - for(int i = 0; i < return_garbage->elements_size; i++){ - free(return_garbage->elements[i]); - } - - free(return_garbage->elements); - free(return_garbage); - } - - - free(self); -} - - - - -#define UNIVERSAL_GARBAGE_H -#endif - - - -//path: src/imports/../dependencies/lua/onelua.c - - - -#ifndef MAKE_LIB -#ifndef MAKE_LUAC -#ifndef MAKE_LUA -#define MAKE_LUA -#endif -#endif -#endif -#include -//path: src/imports/../dependencies/lua/custom_math/custom_math.h -double private_lua_cembed_ldexp(double x, int exp); - -double private_lua_cembed_frexp(double x, int *exp); - -double private_lua_cembed_asin(double x); - -double private_lua_cembed_acos(double x); - - -double private_lua_cembed_atan2(double y, double x); - - -double private_lua_cembed_ceil(double x); - - -double private_lua_cembed_sqrt(double x); - -double private_lua_cembed_exp(double x); - -double private_lua_cembed_fabs(double x); - - -double private_lua_cembed_factorial(int n); - -double private_lua_cembed_sin(double x); - - -double private_lua_cembed_cos(double x); - - -double private_lua_cembed_tan(double x); - -double private_lua_cembed_log(double x); - -double private_lua_cembed_log2(double x); - -double private_lua_embed_log10(double x); - -double private_lua_embed_fmod(double x, double y); - -double private_lua_embed_pow(double b, double e); - -double private_lua_embed_floor(double x); - -//path: src/imports/../dependencies/lua/custom_math/custom_math.c -double private_lua_cembed_ldexp(double x, int exp) { - if (x == 0.0) return x; - - while (exp > 0) { - x *= 2.0; - exp--; - } - while (exp < 0) { - x *= 0.5; - exp++; - } - - return x; -} - -double private_lua_cembed_frexp(double x, int *exp) { - *exp = 0; - if (x == 0.0) return x; - - while (x >= 1.0 || x < -1.0) { - x *= 0.5; - (*exp)++; - } - while (x < 0.5 && x != 0.0) { - x /= 0.5; - (*exp)--; - } - - return x; -} -double private_lua_cembed_asin(double x) { - if (x <= -1.0 || x >= 1.0) { - return x / 0.0; // Retorna NaN para x fora do intervalo [-1, 1] - } - - return private_lua_cembed_atan2(x, private_lua_cembed_sqrt(1.0 - x * x)); -} - -double private_lua_cembed_acos(double x) { - if (x <= -1.0 || x >= 1.0) { - return x / 0.0; // Retorna NaN para x fora do intervalo [-1, 1] - } - - return 1.5707963267948966 - private_lua_cembed_asin(x); -} - -double private_lua_cembed_atan2(double y, double x) { - if (x == 0.0 && y == 0.0) { - return y / x; // Retorna NaN para x = 0 e y = 0 - } - - double abs_y = private_lua_cembed_fabs(y); - double angle; - if (x >= 0.0) { - double r = (x - abs_y) / (x + abs_y); - angle = 0.7853981633974483 - 0.7853981633974483 * r; - } else { - double r = (x + abs_y) / (abs_y - x); - angle = 2.356194490192345 + 0.7853981633974483 * r; - } - if (y < 0.0) { - return -angle; - } else { - return angle; - } -} - -double private_lua_cembed_ceil(double x) { - double f = private_lua_embed_floor(x); - if (f >= x) { - return f; - } else { - return f + 1.0; - } -} - -double private_lua_cembed_sqrt(double x) { - if (x < 0.0) { - return x / 0.0; // Retorna NaN para x < 0 - } - - double x_half = 0.5 * x; - long i = *(long*)&x; - i = 0x5fe6ec85e7de30da - (i >> 1); - x = *(double*)&i; - x = x * (1.5 - x_half * x * x); - - return 1.0 / x; -} - -double private_lua_cembed_exp(double x) { - double result = 1.0; - double term = 1.0; - int i = 1; - - while (term > 1.0e-15) { - term *= x / i; - result += term; - i++; - } - - return result; -} - -double private_lua_cembed_fabs(double x) { - return x < 0.0 ? -x : x; -} - -double private_lua_cembed_factorial(int n) { - if (n <= 1) { - return 1.0; - } - double result = 1.0; - for (int i = 2; i <= n; ++i) { - result *= i; - } - return result; -} - -double private_lua_cembed_sin(double x) { - double result = 0.0; - int n = 0; - double term = x; - double current_term = term; - double term_squared = term * term; - - while (current_term > 1.0e-15) { - result += current_term; - n += 2; - term *= -term_squared / ((n + 1) * (n + 2)); - current_term = term / private_lua_cembed_factorial(n); - } - - return result; -} - -double private_lua_cembed_cos(double x) { - double result = 0.0; - int n = 0; - double term = 1.0; - double current_term = term; - double term_squared = term * term; - - while (current_term > 1.0e-15) { - result += current_term; - n += 2; - term *= -term_squared / (n * (n + 1)); - current_term = term / private_lua_cembed_factorial(n); - } - - return result; -} - -double private_lua_cembed_tan(double x) { - return private_lua_cembed_sin(x) / private_lua_cembed_cos(x); -} - -double private_lua_cembed_log(double x) { - if (x <= 0.0) { - return -1.0 / 0.0; - } - - double result = 0.0; - double term = (x - 1) / (x + 1); - double current_term = term; - double term_squared = term * term; - int n = 1; - - while (current_term > 1.0e-15) { - result += current_term / n; - current_term *= term_squared; - n += 2; - } - - result *= 2.302585092994046; - return result; -} - -double private_lua_cembed_log2(double x) { - if (x <= 0.0) { - return -1.0 / 0.0; - } - - return private_lua_cembed_log(x) / private_lua_cembed_log(2.0); -} - -double private_lua_embed_log10(double x) { - if (x <= 0.0) { - return -1.0 / 0.0; - } - - return private_lua_cembed_log(x) / private_lua_cembed_log(10.0); -} - -double private_lua_embed_fmod(double x, double y) { - while (y != 0.0) { - while (x >= y) { - x -= y; - } - if (x < y) { - return x; - } - } - return 0.0 / 0.0; -} - -double private_lua_embed_pow(double b, double e) { - double result = 1.0; - int i; - - if (e == 0.0) { - return 1.0; - } - if (e < 0.0) { - b = 1.0 / b; - e = -e; - } - - for (i = 0; i < e; i++) { - result *= b; - } - - return result; -} - -double private_lua_embed_floor(double x) { - int i = (int)x; - - if (x == (double)i) { - return x; - } - - if (x < 0.0) { - return (double)(i - 1); - } - - return (double)i; -} - - - -#if 0 -#define LUA_USE_LINUX -#define LUA_USE_MACOSX -#define LUA_USE_POSIX -#define LUA_ANSI -#endif - - - - -//path: src/imports/../dependencies/lua/lprefix.h - - -#ifndef lprefix_h -#define lprefix_h - - - -#if !defined(LUA_USE_C89) - -#if !defined(_XOPEN_SOURCE) -#define _XOPEN_SOURCE 600 -#elif _XOPEN_SOURCE == 0 -#undef _XOPEN_SOURCE -#endif - - -#if !defined(LUA_32BITS) && !defined(_FILE_OFFSET_BITS) -#define _LARGEFILE_SOURCE 1 -#define _FILE_OFFSET_BITS 64 -#endif - -#endif - - - -#if defined(_WIN32) - -#if !defined(_CRT_SECURE_NO_WARNINGS) -#define _CRT_SECURE_NO_WARNINGS -#endif - -#endif - -#endif - - - - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -#ifdef _WIN32 -#include -#else -#include -#include -#endif - - -#define LUA_CORE -#define LUA_LIB -#define ltable_c -#define lvm_c -//path: src/imports/../dependencies/lua/luaconf.h - - - -#ifndef luaconf_h -#define luaconf_h - -#include -#include - - - - - - - - - - - - -#if !defined(LUA_USE_C89) && defined(_WIN32) && !defined(_WIN32_WCE) -#define LUA_USE_WINDOWS -#endif - - -#if defined(LUA_USE_WINDOWS) -#define LUA_DL_DLL -#define LUA_USE_C89 -#endif - - -#if defined(LUA_USE_LINUX) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN -#endif - - -#if defined(LUA_USE_MACOSX) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN -#endif - - -#if defined(LUA_USE_IOS) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN -#endif - - - -#define LUAI_IS32INT ((UINT_MAX >> 30) >= 3) - - - - - - - - - - -#define LUA_INT_INT 1 -#define LUA_INT_LONG 2 -#define LUA_INT_LONGLONG 3 - - -#define LUA_FLOAT_FLOAT 1 -#define LUA_FLOAT_DOUBLE 2 -#define LUA_FLOAT_LONGDOUBLE 3 - - - -#define LUA_INT_DEFAULT LUA_INT_LONGLONG -#define LUA_FLOAT_DEFAULT LUA_FLOAT_DOUBLE - - - -#define LUA_32BITS 0 - - - -#if defined(LUA_USE_C89) && !defined(LUA_USE_WINDOWS) -#define LUA_C89_NUMBERS 1 -#else -#define LUA_C89_NUMBERS 0 -#endif - - -#if LUA_32BITS - -#if LUAI_IS32INT -#define LUA_INT_TYPE LUA_INT_INT -#else -#define LUA_INT_TYPE LUA_INT_LONG -#endif -#define LUA_FLOAT_TYPE LUA_FLOAT_FLOAT - -#elif LUA_C89_NUMBERS - -#define LUA_INT_TYPE LUA_INT_LONG -#define LUA_FLOAT_TYPE LUA_FLOAT_DOUBLE - -#else - - -#define LUA_INT_TYPE LUA_INT_DEFAULT -#define LUA_FLOAT_TYPE LUA_FLOAT_DEFAULT - -#endif - - - - - - - - - -#define LUA_PATH_SEP ";" -#define LUA_PATH_MARK "?" -#define LUA_EXEC_DIR "!" - - - - -#define LUA_VDIR LUA_VERSION_MAJOR "." LUA_VERSION_MINOR -#if defined(_WIN32) - -#define LUA_LDIR "!\\lua\\" -#define LUA_CDIR "!\\" -#define LUA_SHRDIR "!\\..\\share\\lua\\" LUA_VDIR "\\" - -#if !defined(LUA_PATH_DEFAULT) -#define LUA_PATH_DEFAULT \ - LUA_LDIR"?.lua;" LUA_LDIR"?\\init.lua;" \ - LUA_CDIR"?.lua;" LUA_CDIR"?\\init.lua;" \ - LUA_SHRDIR"?.lua;" LUA_SHRDIR"?\\init.lua;" \ - ".\\?.lua;" ".\\?\\init.lua" -#endif - -#if !defined(LUA_CPATH_DEFAULT) -#define LUA_CPATH_DEFAULT \ - LUA_CDIR"?.dll;" \ - LUA_CDIR"..\\lib\\lua\\" LUA_VDIR "\\?.dll;" \ - LUA_CDIR"loadall.dll;" ".\\?.dll" -#endif - -#else - -#define LUA_ROOT "/usr/local/" -#define LUA_LDIR LUA_ROOT "share/lua/" LUA_VDIR "/" -#define LUA_CDIR LUA_ROOT "lib/lua/" LUA_VDIR "/" - -#if !defined(LUA_PATH_DEFAULT) -#define LUA_PATH_DEFAULT \ - LUA_LDIR"?.lua;" LUA_LDIR"?/init.lua;" \ - LUA_CDIR"?.lua;" LUA_CDIR"?/init.lua;" \ - "./?.lua;" "./?/init.lua" -#endif - -#if !defined(LUA_CPATH_DEFAULT) -#define LUA_CPATH_DEFAULT \ - LUA_CDIR"?.so;" LUA_CDIR"loadall.so;" "./?.so" -#endif - -#endif - - - -#if !defined(LUA_DIRSEP) - -#if defined(_WIN32) -#define LUA_DIRSEP "\\" -#else -#define LUA_DIRSEP "/" -#endif - -#endif - - - -#define LUA_IGMARK "-" - - - - - - - -#if defined(LUA_BUILD_AS_DLL) - -#if defined(LUA_CORE) || defined(LUA_LIB) -#define LUA_API __declspec(dllexport) -#else -#define LUA_API __declspec(dllimport) -#endif - -#else - -#define LUA_API extern - -#endif - - - -#define LUALIB_API LUA_API -#define LUAMOD_API LUA_API - - - -#if defined(__GNUC__) && ((__GNUC__*100 + __GNUC_MINOR__) >= 302) && \ - defined(__ELF__) -#define LUAI_FUNC __attribute__((visibility("internal"))) extern -#else -#define LUAI_FUNC extern -#endif - -#define LUAI_DDEC(dec) LUAI_FUNC dec -#define LUAI_DDEF - - - - - - - -#if defined(LUA_COMPAT_5_3) - - -#define LUA_COMPAT_MATHLIB - - -#define LUA_COMPAT_APIINTCASTS - - - -#define LUA_COMPAT_LT_LE - - - -#define lua_strlen(L,i) lua_rawlen(L, (i)) - -#define lua_objlen(L,i) lua_rawlen(L, (i)) - -#define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ) -#define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT) - -#endif - - - - - - - - - - - - -#define l_floor(x) (l_mathop(private_lua_embed_floor)(x)) - -#define lua_number2str(s,sz,n) \ - l_sprintf((s), sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)(n)) - - -#define lua_numbertointeger(n,p) \ - ((n) >= (LUA_NUMBER)(LUA_MININTEGER) && \ - (n) < -(LUA_NUMBER)(LUA_MININTEGER) && \ - (*(p) = (LUA_INTEGER)(n), 1)) - - - - -#if LUA_FLOAT_TYPE == LUA_FLOAT_FLOAT - -#define LUA_NUMBER float - -#define l_floatatt(n) (FLT_##n) - -#define LUAI_UACNUMBER double - -#define LUA_NUMBER_FRMLEN "" -#define LUA_NUMBER_FMT "%.7g" - -#define l_mathop(op) op##f - -#define lua_str2number(s,p) strtof((s), (p)) - - -#elif LUA_FLOAT_TYPE == LUA_FLOAT_LONGDOUBLE - -#define LUA_NUMBER long double - -#define l_floatatt(n) (LDBL_##n) - -#define LUAI_UACNUMBER long double - -#define LUA_NUMBER_FRMLEN "L" -#define LUA_NUMBER_FMT "%.19Lg" - -#define l_mathop(op) op##l - -#define lua_str2number(s,p) strtold((s), (p)) - -#elif LUA_FLOAT_TYPE == LUA_FLOAT_DOUBLE - -#define LUA_NUMBER double - -#define l_floatatt(n) (DBL_##n) - -#define LUAI_UACNUMBER double - -#define LUA_NUMBER_FRMLEN "" -#define LUA_NUMBER_FMT "%.14g" - -#define l_mathop(op) op - -#define lua_str2number(s,p) strtod((s), (p)) - -#else - -#error "numeric float type not defined" - -#endif - - - - - - - - -#define LUA_INTEGER_FMT "%" LUA_INTEGER_FRMLEN "d" - -#define LUAI_UACINT LUA_INTEGER - -#define lua_integer2str(s,sz,n) \ - l_sprintf((s), sz, LUA_INTEGER_FMT, (LUAI_UACINT)(n)) - - -#define LUA_UNSIGNED unsigned LUAI_UACINT - - - - -#if LUA_INT_TYPE == LUA_INT_INT - -#define LUA_INTEGER int -#define LUA_INTEGER_FRMLEN "" - -#define LUA_MAXINTEGER INT_MAX -#define LUA_MININTEGER INT_MIN - -#define LUA_MAXUNSIGNED UINT_MAX - -#elif LUA_INT_TYPE == LUA_INT_LONG - -#define LUA_INTEGER long -#define LUA_INTEGER_FRMLEN "l" - -#define LUA_MAXINTEGER LONG_MAX -#define LUA_MININTEGER LONG_MIN - -#define LUA_MAXUNSIGNED ULONG_MAX - -#elif LUA_INT_TYPE == LUA_INT_LONGLONG - - -#if defined(LLONG_MAX) - - -#define LUA_INTEGER long long -#define LUA_INTEGER_FRMLEN "ll" - -#define LUA_MAXINTEGER LLONG_MAX -#define LUA_MININTEGER LLONG_MIN - -#define LUA_MAXUNSIGNED ULLONG_MAX - -#elif defined(LUA_USE_WINDOWS) - - -#define LUA_INTEGER __int64 -#define LUA_INTEGER_FRMLEN "I64" - -#define LUA_MAXINTEGER _I64_MAX -#define LUA_MININTEGER _I64_MIN - -#define LUA_MAXUNSIGNED _UI64_MAX - -#else - -#error "Compiler does not support 'long long'. Use option '-DLUA_32BITS' \ - or '-DLUA_C89_NUMBERS' (see file 'luaconf.h' for details)" - -#endif - -#else - -#error "numeric integer type not defined" - -#endif - - - - - - - -#if !defined(LUA_USE_C89) -#define l_sprintf(s,sz,f,i) snprintf(s,sz,f,i) -#else -#define l_sprintf(s,sz,f,i) ((void)(sz), sprintf(s,f,i)) -#endif - - - -#if !defined(LUA_USE_C89) -#define lua_strx2number(s,p) lua_str2number(s,p) -#endif - - - -#define lua_pointer2str(buff,sz,p) l_sprintf(buff,sz,"%p",p) - - - -#if !defined(LUA_USE_C89) -#define lua_number2strx(L,b,sz,f,n) \ - ((void)L, l_sprintf(b,sz,f,(LUAI_UACNUMBER)(n))) -#endif - - - -#if defined(LUA_USE_C89) || (defined(HUGE_VAL) && !defined(HUGE_VALF)) -#undef l_mathop -#undef lua_str2number -#define l_mathop(op) (lua_Number)op -#define lua_str2number(s,p) ((lua_Number)strtod((s), (p))) -#endif - - - -#define LUA_KCONTEXT ptrdiff_t - -#if !defined(LUA_USE_C89) && defined(__STDC_VERSION__) && \ - __STDC_VERSION__ >= 199901L -#include -#if defined(INTPTR_MAX) -#undef LUA_KCONTEXT -#define LUA_KCONTEXT intptr_t -#endif -#endif - - - -#if !defined(lua_getlocaledecpoint) -#define lua_getlocaledecpoint() (localeconv()->decimal_point[0]) -#endif - - - -#if !defined(luai_likely) - -#if defined(__GNUC__) && !defined(LUA_NOBUILTIN) -#define luai_likely(x) (__builtin_expect(((x) != 0), 1)) -#define luai_unlikely(x) (__builtin_expect(((x) != 0), 0)) -#else -#define luai_likely(x) (x) -#define luai_unlikely(x) (x) -#endif - -#endif - - -#if defined(LUA_CORE) || defined(LUA_LIB) - -#define l_likely(x) luai_likely(x) -#define l_unlikely(x) luai_unlikely(x) -#endif - - - - - - - - - - - - - - -#if defined(LUA_USE_APICHECK) -#include -#define luai_apicheck(l,e) assert(e) -#endif - - - - - - - -#if LUAI_IS32INT -#define LUAI_MAXSTACK 1000000 -#else -#define LUAI_MAXSTACK 15000 -#endif - - - -#define LUA_EXTRASPACE (sizeof(void *)) - - - -#define LUA_IDSIZE 60 - - - -#define LUAL_BUFFERSIZE ((int)(16 * sizeof(void*) * sizeof(lua_Number))) - - - -#define LUAI_MAXALIGN lua_Number n; double u; void *s; lua_Integer i; long l - - - - - - - - - - - - - - - -#endif - - - - - -#undef LUAI_FUNC -#undef LUAI_DDEC -#undef LUAI_DDEF -#define LUAI_FUNC static -#define LUAI_DDEC(def) -#define LUAI_DDEF static - - -//path: src/imports/../dependencies/lua/lzio.c - - -#define lzio_c -#define LUA_CORE - - - -#include - -//path: src/imports/../dependencies/lua/lua.h - - - -#ifndef lua_h -#define lua_h - -#include -#include - - -#define LUA_COPYRIGHT LUA_RELEASE " Copyright (C) 1994-2023 Lua.org, PUC-Rio" -#define LUA_AUTHORS "R. Ierusalimschy, L. H. de Figueiredo, W. Celes" - - -#define LUA_VERSION_MAJOR_N 5 -#define LUA_VERSION_MINOR_N 5 -#define LUA_VERSION_RELEASE_N 0 - -#define LUA_VERSION_NUM (LUA_VERSION_MAJOR_N * 100 + LUA_VERSION_MINOR_N) -#define LUA_VERSION_RELEASE_NUM (LUA_VERSION_NUM * 100 + LUA_VERSION_RELEASE_N) - - - - - - - -#define LUA_SIGNATURE "\x1bLua" - - -#define LUA_MULTRET (-1) - - - -#define LUA_REGISTRYINDEX (-LUAI_MAXSTACK - 1000) -#define lua_upvalueindex(i) (LUA_REGISTRYINDEX - (i)) - - - -#define LUA_OK 0 -#define LUA_YIELD 1 -#define LUA_ERRRUN 2 -#define LUA_ERRSYNTAX 3 -#define LUA_ERRMEM 4 -#define LUA_ERRERR 5 - - -typedef struct lua_State lua_State; - - - -#define LUA_TNONE (-1) - -#define LUA_TNIL 0 -#define LUA_TBOOLEAN 1 -#define LUA_TLIGHTUSERDATA 2 -#define LUA_TNUMBER 3 -#define LUA_TSTRING 4 -#define LUA_TTABLE 5 -#define LUA_TFUNCTION 6 -#define LUA_TUSERDATA 7 -#define LUA_TTHREAD 8 - -#define LUA_NUMTYPES 9 - - - - -#define LUA_MINSTACK 20 - - - - -#define LUA_RIDX_GLOBALS 2 -#define LUA_RIDX_MAINTHREAD 3 -#define LUA_RIDX_LAST 3 - - - -typedef LUA_NUMBER lua_Number; - - - -typedef LUA_INTEGER lua_Integer; - - -typedef LUA_UNSIGNED lua_Unsigned; - - -typedef LUA_KCONTEXT lua_KContext; - - - -typedef int (*lua_CFunction) (lua_State *L); - - -typedef int (*lua_KFunction) (lua_State *L, int status, lua_KContext ctx); - - - -typedef const char * (*lua_Reader) (lua_State *L, void *ud, size_t *sz); - -typedef int (*lua_Writer) (lua_State *L, const void *p, size_t sz, void *ud); - - - -typedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize); - - - -typedef void (*lua_WarnFunction) (void *ud, const char *msg, int tocont); - - - -typedef struct lua_Debug lua_Debug; - - - -typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar); - - - - -extern const char lua_ident[]; - - - -LUA_API lua_State *(lua_newstate) (lua_Alloc f, void *ud, unsigned seed); -LUA_API void (lua_close) (lua_State *L); -LUA_API lua_State *(lua_newthread) (lua_State *L); -LUA_API int (lua_closethread) (lua_State *L, lua_State *from); - -LUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf); - - -LUA_API lua_Number (lua_version) (lua_State *L); - - - -LUA_API int (lua_absindex) (lua_State *L, int idx); -LUA_API int (lua_gettop) (lua_State *L); -LUA_API void (lua_settop) (lua_State *L, int idx); -LUA_API void (lua_pushvalue) (lua_State *L, int idx); -LUA_API void (lua_rotate) (lua_State *L, int idx, int n); -LUA_API void (lua_copy) (lua_State *L, int fromidx, int toidx); -LUA_API int (lua_checkstack) (lua_State *L, int n); - -LUA_API void (lua_xmove) (lua_State *from, lua_State *to, int n); - - - - -LUA_API int (lua_isnumber) (lua_State *L, int idx); -LUA_API int (lua_isstring) (lua_State *L, int idx); -LUA_API int (lua_iscfunction) (lua_State *L, int idx); -LUA_API int (lua_isinteger) (lua_State *L, int idx); -LUA_API int (lua_isuserdata) (lua_State *L, int idx); -LUA_API int (lua_type) (lua_State *L, int idx); -LUA_API const char *(lua_typename) (lua_State *L, int tp); - -LUA_API lua_Number (lua_tonumberx) (lua_State *L, int idx, int *isnum); -LUA_API lua_Integer (lua_tointegerx) (lua_State *L, int idx, int *isnum); -LUA_API int (lua_toboolean) (lua_State *L, int idx); -LUA_API const char *(lua_tolstring) (lua_State *L, int idx, size_t *len); -LUA_API lua_Unsigned (lua_rawlen) (lua_State *L, int idx); -LUA_API lua_CFunction (lua_tocfunction) (lua_State *L, int idx); -LUA_API void *(lua_touserdata) (lua_State *L, int idx); -LUA_API lua_State *(lua_tothread) (lua_State *L, int idx); -LUA_API const void *(lua_topointer) (lua_State *L, int idx); - - - - -#define LUA_OPADD 0 -#define LUA_OPSUB 1 -#define LUA_OPMUL 2 -#define LUA_OPMOD 3 -#define LUA_OPPOW 4 -#define LUA_OPDIV 5 -#define LUA_OPIDIV 6 -#define LUA_OPBAND 7 -#define LUA_OPBOR 8 -#define LUA_OPBXOR 9 -#define LUA_OPSHL 10 -#define LUA_OPSHR 11 -#define LUA_OPUNM 12 -#define LUA_OPBNOT 13 - -LUA_API void (lua_arith) (lua_State *L, int op); - -#define LUA_OPEQ 0 -#define LUA_OPLT 1 -#define LUA_OPLE 2 - -LUA_API int (lua_rawequal) (lua_State *L, int idx1, int idx2); -LUA_API int (lua_compare) (lua_State *L, int idx1, int idx2, int op); - - - -LUA_API void (lua_pushnil) (lua_State *L); -LUA_API void (lua_pushnumber) (lua_State *L, lua_Number n); -LUA_API void (lua_pushinteger) (lua_State *L, lua_Integer n); -LUA_API const char *(lua_pushlstring) (lua_State *L, const char *s, size_t len); -LUA_API const char *(lua_pushextlstring) (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud); -LUA_API const char *(lua_pushstring) (lua_State *L, const char *s); -LUA_API const char *(lua_pushvfstring) (lua_State *L, const char *fmt, - va_list argp); -LUA_API const char *(lua_pushfstring) (lua_State *L, const char *fmt, ...); -LUA_API void (lua_pushcclosure) (lua_State *L, lua_CFunction fn, int n); -LUA_API void (lua_pushboolean) (lua_State *L, int b); -LUA_API void (lua_pushlightuserdata) (lua_State *L, void *p); -LUA_API int (lua_pushthread) (lua_State *L); - - - -LUA_API int (lua_getglobal) (lua_State *L, const char *name); -LUA_API int (lua_gettable) (lua_State *L, int idx); -LUA_API int (lua_getfield) (lua_State *L, int idx, const char *k); -LUA_API int (lua_geti) (lua_State *L, int idx, lua_Integer n); -LUA_API int (lua_rawget) (lua_State *L, int idx); -LUA_API int (lua_rawgeti) (lua_State *L, int idx, lua_Integer n); -LUA_API int (lua_rawgetp) (lua_State *L, int idx, const void *p); - -LUA_API void (lua_createtable) (lua_State *L, unsigned narr, unsigned nrec); -LUA_API void *(lua_newuserdatauv) (lua_State *L, size_t sz, int nuvalue); -LUA_API int (lua_getmetatable) (lua_State *L, int objindex); -LUA_API int (lua_getiuservalue) (lua_State *L, int idx, int n); - - - -LUA_API void (lua_setglobal) (lua_State *L, const char *name); -LUA_API void (lua_settable) (lua_State *L, int idx); -LUA_API void (lua_setfield) (lua_State *L, int idx, const char *k); -LUA_API void (lua_seti) (lua_State *L, int idx, lua_Integer n); -LUA_API void (lua_rawset) (lua_State *L, int idx); -LUA_API void (lua_rawseti) (lua_State *L, int idx, lua_Integer n); -LUA_API void (lua_rawsetp) (lua_State *L, int idx, const void *p); -LUA_API int (lua_setmetatable) (lua_State *L, int objindex); -LUA_API int (lua_setiuservalue) (lua_State *L, int idx, int n); - - - -LUA_API void (lua_callk) (lua_State *L, int nargs, int nresults, - lua_KContext ctx, lua_KFunction k); -#define lua_call(L,n,r) lua_callk(L, (n), (r), 0, NULL) - -LUA_API int (lua_pcallk) (lua_State *L, int nargs, int nresults, int errfunc, - lua_KContext ctx, lua_KFunction k); -#define lua_pcall(L,n,r,f) lua_pcallk(L, (n), (r), (f), 0, NULL) - -LUA_API int (lua_load) (lua_State *L, lua_Reader reader, void *dt, - const char *chunkname, const char *mode); - -LUA_API int (lua_dump) (lua_State *L, lua_Writer writer, void *data, int strip); - - - -LUA_API int (lua_yieldk) (lua_State *L, int nresults, lua_KContext ctx, - lua_KFunction k); -LUA_API int (lua_resume) (lua_State *L, lua_State *from, int narg, - int *nres); -LUA_API int (lua_status) (lua_State *L); -LUA_API int (lua_isyieldable) (lua_State *L); - -#define lua_yield(L,n) lua_yieldk(L, (n), 0, NULL) - - - -LUA_API void (lua_setwarnf) (lua_State *L, lua_WarnFunction f, void *ud); -LUA_API void (lua_warning) (lua_State *L, const char *msg, int tocont); - - - - -#define LUA_GCSTOP 0 -#define LUA_GCRESTART 1 -#define LUA_GCCOLLECT 2 -#define LUA_GCCOUNT 3 -#define LUA_GCCOUNTB 4 -#define LUA_GCSTEP 5 -#define LUA_GCISRUNNING 6 -#define LUA_GCGEN 7 -#define LUA_GCINC 8 -#define LUA_GCPARAM 9 - - - - -#define LUA_GCPMINORMUL 0 -#define LUA_GCPMAJORMINOR 1 -#define LUA_GCPMINORMAJOR 2 - - -#define LUA_GCPPAUSE 3 -#define LUA_GCPSTEPMUL 4 -#define LUA_GCPSTEPSIZE 5 - - -#define LUA_GCPN 6 - - -LUA_API int (lua_gc) (lua_State *L, int what, ...); - - - - -LUA_API int (lua_error) (lua_State *L); - -LUA_API int (lua_next) (lua_State *L, int idx); - -LUA_API void (lua_concat) (lua_State *L, int n); -LUA_API void (lua_len) (lua_State *L, int idx); - -LUA_API size_t (lua_stringtonumber) (lua_State *L, const char *s); - -LUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud); -LUA_API void (lua_setallocf) (lua_State *L, lua_Alloc f, void *ud); - -LUA_API void (lua_toclose) (lua_State *L, int idx); -LUA_API void (lua_closeslot) (lua_State *L, int idx); - - - - -#define lua_getextraspace(L) ((void *)((char *)(L) - LUA_EXTRASPACE)) - -#define lua_tonumber(L,i) lua_tonumberx(L,(i),NULL) -#define lua_tointeger(L,i) lua_tointegerx(L,(i),NULL) - -#define lua_pop(L,n) lua_settop(L, -(n)-1) - -#define lua_newtable(L) lua_createtable(L, 0, 0) - -#define lua_register(L,n,f) (lua_pushcfunction(L, (f)), lua_setglobal(L, (n))) - -#define lua_pushcfunction(L,f) lua_pushcclosure(L, (f), 0) - -#define lua_isfunction(L,n) (lua_type(L, (n)) == LUA_TFUNCTION) -#define lua_istable(L,n) (lua_type(L, (n)) == LUA_TTABLE) -#define lua_islightuserdata(L,n) (lua_type(L, (n)) == LUA_TLIGHTUSERDATA) -#define lua_isnil(L,n) (lua_type(L, (n)) == LUA_TNIL) -#define lua_isboolean(L,n) (lua_type(L, (n)) == LUA_TBOOLEAN) -#define lua_isthread(L,n) (lua_type(L, (n)) == LUA_TTHREAD) -#define lua_isnone(L,n) (lua_type(L, (n)) == LUA_TNONE) -#define lua_isnoneornil(L, n) (lua_type(L, (n)) <= 0) - -#define lua_pushliteral(L, s) lua_pushstring(L, "" s) - -#define lua_pushglobaltable(L) \ - ((void)lua_rawgeti(L, LUA_REGISTRYINDEX, LUA_RIDX_GLOBALS)) - -#define lua_tostring(L,i) lua_tolstring(L, (i), NULL) - - -#define lua_insert(L,idx) lua_rotate(L, (idx), 1) - -#define lua_remove(L,idx) (lua_rotate(L, (idx), -1), lua_pop(L, 1)) - -#define lua_replace(L,idx) (lua_copy(L, -1, (idx)), lua_pop(L, 1)) - - - - - -#if defined(LUA_COMPAT_APIINTCASTS) - -#define lua_pushunsigned(L,n) lua_pushinteger(L, (lua_Integer)(n)) -#define lua_tounsignedx(L,i,is) ((lua_Unsigned)lua_tointegerx(L,i,is)) -#define lua_tounsigned(L,i) lua_tounsignedx(L,(i),NULL) - -#endif - -#define lua_newuserdata(L,s) lua_newuserdatauv(L,s,1) -#define lua_getuservalue(L,idx) lua_getiuservalue(L,idx,1) -#define lua_setuservalue(L,idx) lua_setiuservalue(L,idx,1) - -#define lua_resetthread(L) lua_closethread(L,NULL) - - - - - - - -#define LUA_HOOKCALL 0 -#define LUA_HOOKRET 1 -#define LUA_HOOKLINE 2 -#define LUA_HOOKCOUNT 3 -#define LUA_HOOKTAILCALL 4 - - - -#define LUA_MASKCALL (1 << LUA_HOOKCALL) -#define LUA_MASKRET (1 << LUA_HOOKRET) -#define LUA_MASKLINE (1 << LUA_HOOKLINE) -#define LUA_MASKCOUNT (1 << LUA_HOOKCOUNT) - - -LUA_API int (lua_getstack) (lua_State *L, int level, lua_Debug *ar); -LUA_API int (lua_getinfo) (lua_State *L, const char *what, lua_Debug *ar); -LUA_API const char *(lua_getlocal) (lua_State *L, const lua_Debug *ar, int n); -LUA_API const char *(lua_setlocal) (lua_State *L, const lua_Debug *ar, int n); -LUA_API const char *(lua_getupvalue) (lua_State *L, int funcindex, int n); -LUA_API const char *(lua_setupvalue) (lua_State *L, int funcindex, int n); - -LUA_API void *(lua_upvalueid) (lua_State *L, int fidx, int n); -LUA_API void (lua_upvaluejoin) (lua_State *L, int fidx1, int n1, - int fidx2, int n2); - -LUA_API void (lua_sethook) (lua_State *L, lua_Hook func, int mask, int count); -LUA_API lua_Hook (lua_gethook) (lua_State *L); -LUA_API int (lua_gethookmask) (lua_State *L); -LUA_API int (lua_gethookcount) (lua_State *L); - - -struct lua_Debug { - int event; - const char *name; - const char *namewhat; - const char *what; - const char *source; - size_t srclen; - int currentline; - int linedefined; - int lastlinedefined; - unsigned char nups; - unsigned char nparams; - char isvararg; - char istailcall; - unsigned short ftransfer; - unsigned short ntransfer; - char short_src[LUA_IDSIZE]; - - struct CallInfo *i_ci; -}; - - - - -#define LUAI_TOSTRAUX(x) #x -#define LUAI_TOSTR(x) LUAI_TOSTRAUX(x) - -#define LUA_VERSION_MAJOR LUAI_TOSTR(LUA_VERSION_MAJOR_N) -#define LUA_VERSION_MINOR LUAI_TOSTR(LUA_VERSION_MINOR_N) -#define LUA_VERSION_RELEASE LUAI_TOSTR(LUA_VERSION_RELEASE_N) - -#define LUA_VERSION "Lua " LUA_VERSION_MAJOR "." LUA_VERSION_MINOR -#define LUA_RELEASE LUA_VERSION "." LUA_VERSION_RELEASE - - - - - -#endif - - - -//path: src/imports/../dependencies/lua/llimits.h - - -#ifndef llimits_h -#define llimits_h - - -#include -#include - - - - - - - -#if defined(LUAI_MEM) -typedef LUAI_UMEM lu_mem; -typedef LUAI_MEM l_obj; -#elif LUAI_IS32INT -typedef size_t lu_mem; -typedef ptrdiff_t l_obj; -#else -typedef unsigned long lu_mem; -typedef long l_obj; -#endif - -#define MAX_LOBJ \ - cast(l_obj, (cast(lu_mem, 1) << (sizeof(l_obj) * CHAR_BIT - 1)) - 1) - - - -typedef unsigned char lu_byte; -typedef signed char ls_byte; - - - -#define MAX_SIZET ((size_t)(~(size_t)0)) - - -#define MAX_SIZE (sizeof(size_t) < sizeof(lua_Integer) ? MAX_SIZET \ - : (size_t)(LUA_MAXINTEGER)) - - -#define MAX_INT INT_MAX - - - -#define log2maxs(t) cast_int(sizeof(t) * 8 - 2) - - - -#define ispow2(x) (((x) & ((x) - 1)) == 0) - - - -#define LL(x) (sizeof(x)/sizeof(char) - 1) - - - -#if !defined(LUA_USE_C89) && defined(__STDC_VERSION__) && \ - __STDC_VERSION__ >= 199901L -#include -#if defined(UINTPTR_MAX) -#define L_P2I uintptr_t -#else -#define L_P2I uintmax_t -#endif -#else -#define L_P2I size_t -#endif - -#define point2uint(p) cast_uint((L_P2I)(p) & UINT_MAX) - - - - -typedef LUAI_UACNUMBER l_uacNumber; -typedef LUAI_UACINT l_uacInt; - - - -#if defined LUAI_ASSERT -#undef NDEBUG -#include -#define lua_assert(c) assert(c) -#endif - -#if defined(lua_assert) -#define check_exp(c,e) (lua_assert(c), (e)) - -#define lua_longassert(c) ((c) ? (void)0 : lua_assert(0)) -#else -#define lua_assert(c) ((void)0) -#define check_exp(c,e) (e) -#define lua_longassert(c) ((void)0) -#endif - - -#if !defined(luai_apicheck) -#define luai_apicheck(l,e) ((void)l, lua_assert(e)) -#endif - -#define api_check(l,e,msg) luai_apicheck(l,(e) && msg) - - - -#if !defined(UNUSED) -#define UNUSED(x) ((void)(x)) -#endif - - - -#define cast(t, exp) ((t)(exp)) - -#define cast_void(i) cast(void, (i)) -#define cast_voidp(i) cast(void *, (i)) -#define cast_num(i) cast(lua_Number, (i)) -#define cast_int(i) cast(int, (i)) -#define cast_uint(i) cast(unsigned int, (i)) -#define cast_byte(i) cast(lu_byte, (i)) -#define cast_uchar(i) cast(unsigned char, (i)) -#define cast_char(i) cast(char, (i)) -#define cast_charp(i) cast(char *, (i)) -#define cast_sizet(i) cast(size_t, (i)) - - - -#if !defined(l_castS2U) -#define l_castS2U(i) ((lua_Unsigned)(i)) -#endif - - -#if !defined(l_castU2S) -#define l_castU2S(i) ((lua_Integer)(i)) -#endif - - - -#if !defined(l_noret) - -#if defined(__GNUC__) -#define l_noret void __attribute__((noreturn)) -#elif defined(_MSC_VER) && _MSC_VER >= 1200 -#define l_noret void __declspec(noreturn) -#else -#define l_noret void -#endif - -#endif - - - -#if !defined(LUA_USE_C89) -#define l_inline inline -#elif defined(__GNUC__) -#define l_inline __inline__ -#else -#define l_inline -#endif - -#define l_sinline static l_inline - - - -#if LUAI_IS32INT -typedef unsigned int l_uint32; -#else -typedef unsigned long l_uint32; -#endif - -typedef l_uint32 Instruction; - - - - -#if !defined(LUAI_MAXSHORTLEN) -#define LUAI_MAXSHORTLEN 40 -#endif - - - -#if !defined(MINSTRTABSIZE) -#define MINSTRTABSIZE 128 -#endif - - - -#if !defined(STRCACHE_N) -#define STRCACHE_N 53 -#define STRCACHE_M 2 -#endif - - - -#if !defined(LUA_MINBUFFER) -#define LUA_MINBUFFER 32 -#endif - - - -#if !defined(LUAI_MAXCCALLS) -#define LUAI_MAXCCALLS 200 -#endif - - - -#if !defined(lua_lock) -#define lua_lock(L) ((void) 0) -#define lua_unlock(L) ((void) 0) -#endif - - -#if !defined(luai_threadyield) -#define luai_threadyield(L) {lua_unlock(L); lua_lock(L);} -#endif - - - -#if !defined(luai_userstateopen) -#define luai_userstateopen(L) ((void)L) -#endif - -#if !defined(luai_userstateclose) -#define luai_userstateclose(L) ((void)L) -#endif - -#if !defined(luai_userstatethread) -#define luai_userstatethread(L,L1) ((void)L) -#endif - -#if !defined(luai_userstatefree) -#define luai_userstatefree(L,L1) ((void)L) -#endif - -#if !defined(luai_userstateresume) -#define luai_userstateresume(L,n) ((void)L) -#endif - -#if !defined(luai_userstateyield) -#define luai_userstateyield(L,n) ((void)L) -#endif - - - - - - -#if !defined(luai_numidiv) -#define luai_numidiv(L,a,b) ((void)L, l_floor(luai_numdiv(L,a,b))) -#endif - - -#if !defined(luai_numdiv) -#define luai_numdiv(L,a,b) ((a)/(b)) -#endif - - -#if !defined(luai_nummod) -#define luai_nummod(L,a,b,m) \ - { (void)L; (m) = l_mathop(private_lua_embed_fmod)(a,b); \ - if (((m) > 0) ? (b) < 0 : ((m) < 0 && (b) > 0)) (m) += (b); } -#endif - - -#if !defined(luai_numpow) -#define luai_numpow(L,a,b) \ - ((void)L, (b == 2) ? (a)*(a) : l_mathop(private_lua_embed_pow)(a,b)) -#endif - - -#if !defined(luai_numadd) -#define luai_numadd(L,a,b) ((a)+(b)) -#define luai_numsub(L,a,b) ((a)-(b)) -#define luai_nummul(L,a,b) ((a)*(b)) -#define luai_numunm(L,a) (-(a)) -#define luai_numeq(a,b) ((a)==(b)) -#define luai_numlt(a,b) ((a)<(b)) -#define luai_numle(a,b) ((a)<=(b)) -#define luai_numgt(a,b) ((a)>(b)) -#define luai_numge(a,b) ((a)>=(b)) -#define luai_numisnan(a) (!luai_numeq((a), (a))) -#endif - - - - - - -#if !defined(HARDSTACKTESTS) -#define condmovestack(L,pre,pos) ((void)0) -#else - -#define condmovestack(L,pre,pos) \ - { int sz_ = stacksize(L); pre; luaD_reallocstack((L), sz_, 0); pos; } -#endif - -#if !defined(HARDMEMTESTS) -#define condchangemem(L,pre,pos) ((void)0) -#else -#define condchangemem(L,pre,pos) \ - { if (gcrunning(G(L))) { pre; luaC_fullgc(L, 0); pos; } } -#endif - -#endif - - -//path: src/imports/../dependencies/lua/lmem.h - - -#ifndef lmem_h -#define lmem_h - - -#include - - - - - - - -#define luaM_error(L) luaD_throw(L, LUA_ERRMEM) - - - -#define luaM_testsize(n,e) \ - (sizeof(n) >= sizeof(size_t) && cast_sizet((n)) + 1 > MAX_SIZET/(e)) - -#define luaM_checksize(L,n,e) \ - (luaM_testsize(n,e) ? luaM_toobig(L) : cast_void(0)) - - - -#define luaM_limitN(n,t) \ - ((cast_sizet(n) <= MAX_SIZET/sizeof(t)) ? (n) : \ - cast_uint((MAX_SIZET/sizeof(t)))) - - - -#define luaM_reallocvchar(L,b,on,n) \ - cast_charp(luaM_saferealloc_(L, (b), (on)*sizeof(char), (n)*sizeof(char))) - -#define luaM_freemem(L, b, s) luaM_free_(L, (b), (s)) -#define luaM_free(L, b) luaM_free_(L, (b), sizeof(*(b))) -#define luaM_freearray(L, b, n) luaM_free_(L, (b), (n)*sizeof(*(b))) - -#define luaM_new(L,t) cast(t*, luaM_malloc_(L, sizeof(t), 0)) -#define luaM_newvector(L,n,t) cast(t*, luaM_malloc_(L, (n)*sizeof(t), 0)) -#define luaM_newvectorchecked(L,n,t) \ - (luaM_checksize(L,n,sizeof(t)), luaM_newvector(L,n,t)) - -#define luaM_newobject(L,tag,s) luaM_malloc_(L, (s), tag) - -#define luaM_newblock(L, size) luaM_newvector(L, size, char) - -#define luaM_growvector(L,v,nelems,size,t,limit,e) \ - ((v)=cast(t *, luaM_growaux_(L,v,nelems,&(size),sizeof(t), \ - luaM_limitN(limit,t),e))) - -#define luaM_reallocvector(L, v,oldn,n,t) \ - (cast(t *, luaM_realloc_(L, v, cast_sizet(oldn) * sizeof(t), \ - cast_sizet(n) * sizeof(t)))) - -#define luaM_shrinkvector(L,v,size,fs,t) \ - ((v)=cast(t *, luaM_shrinkvector_(L, v, &(size), fs, sizeof(t)))) - -LUAI_FUNC l_noret luaM_toobig (lua_State *L); - - -LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize, - size_t size); -LUAI_FUNC void *luaM_saferealloc_ (lua_State *L, void *block, size_t oldsize, - size_t size); -LUAI_FUNC void luaM_free_ (lua_State *L, void *block, size_t osize); -LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int nelems, - int *size, int size_elem, int limit, - const char *what); -LUAI_FUNC void *luaM_shrinkvector_ (lua_State *L, void *block, int *nelem, - int final_n, int size_elem); -LUAI_FUNC void *luaM_malloc_ (lua_State *L, size_t size, int tag); - -#endif - - - -//path: src/imports/../dependencies/lua/lstate.h - - -#ifndef lstate_h -#define lstate_h - - - - - - -typedef struct CallInfo CallInfo; - - -//path: src/imports/../dependencies/lua/lobject.h - - - -#ifndef lobject_h -#define lobject_h - - -#include - - - - - - - - - -#define LUA_TUPVAL LUA_NUMTYPES -#define LUA_TPROTO (LUA_NUMTYPES+1) -#define LUA_TDEADKEY (LUA_NUMTYPES+2) - - - - -#define LUA_TOTALTYPES (LUA_TPROTO + 2) - - - - - -#define makevariant(t,v) ((t) | ((v) << 4)) - - - - -typedef union Value { - struct GCObject *gc; - void *p; - lua_CFunction f; - lua_Integer i; - lua_Number n; - - lu_byte ub; -} Value; - - - - -#define TValuefields Value value_; lu_byte tt_ - -typedef struct TValue { - TValuefields; -} TValue; - - -#define val_(o) ((o)->value_) -#define valraw(o) (val_(o)) - - - -#define rawtt(o) ((o)->tt_) - - -#define novariant(t) ((t) & 0x0F) - - -#define withvariant(t) ((t) & 0x3F) -#define ttypetag(o) withvariant(rawtt(o)) - - -#define ttype(o) (novariant(rawtt(o))) - - - -#define checktag(o,t) (rawtt(o) == (t)) -#define checktype(o,t) (ttype(o) == (t)) - - - - - -#define righttt(obj) (ttypetag(obj) == gcvalue(obj)->tt) - - -#define checkliveness(L,obj) \ - ((void)L, lua_longassert(!iscollectable(obj) || \ - (righttt(obj) && (L == NULL || !isdead(G(L),gcvalue(obj)))))) - - - - - -#define settt_(o,t) ((o)->tt_=(t)) - - - -#define setobj(L,obj1,obj2) \ - { TValue *io1=(obj1); const TValue *io2=(obj2); \ - io1->value_ = io2->value_; settt_(io1, io2->tt_); \ - checkliveness(L,io1); lua_assert(!isnonstrictnil(io1)); } - - - - -#define setobjs2s(L,o1,o2) setobj(L,s2v(o1),s2v(o2)) - -#define setobj2s(L,o1,o2) setobj(L,s2v(o1),o2) - -#define setobjt2t setobj - -#define setobj2n setobj - -#define setobj2t setobj - - - -typedef union StackValue { - TValue val; - struct { - TValuefields; - unsigned short delta; - } tbclist; -} StackValue; - - - -typedef StackValue *StkId; - - - -typedef union { - StkId p; - ptrdiff_t offset; -} StkIdRel; - - - -#define s2v(o) (&(o)->val) - - - - - - -#define LUA_VNIL makevariant(LUA_TNIL, 0) - - -#define LUA_VEMPTY makevariant(LUA_TNIL, 1) - - -#define LUA_VABSTKEY makevariant(LUA_TNIL, 2) - - -#define LUA_VNOTABLE makevariant(LUA_TNIL, 3) - - - -#define ttisnil(v) checktype((v), LUA_TNIL) - - -#define tagisempty(tag) (novariant(tag) == LUA_TNIL) - - - -#define ttisstrictnil(o) checktag((o), LUA_VNIL) - - -#define setnilvalue(obj) settt_(obj, LUA_VNIL) - - -#define isabstkey(v) checktag((v), LUA_VABSTKEY) - - - -#define isnonstrictnil(v) (ttisnil(v) && !ttisstrictnil(v)) - - - -#define isempty(v) ttisnil(v) - - - -#define ABSTKEYCONSTANT {NULL}, LUA_VABSTKEY - - - -#define setempty(v) settt_(v, LUA_VEMPTY) - - - - - - - - - -#define LUA_VFALSE makevariant(LUA_TBOOLEAN, 0) -#define LUA_VTRUE makevariant(LUA_TBOOLEAN, 1) - -#define ttisboolean(o) checktype((o), LUA_TBOOLEAN) -#define ttisfalse(o) checktag((o), LUA_VFALSE) -#define ttistrue(o) checktag((o), LUA_VTRUE) - - -#define l_isfalse(o) (ttisfalse(o) || ttisnil(o)) -#define tagisfalse(t) ((t) == LUA_VFALSE || novariant(t) == LUA_TNIL) - - - -#define setbfvalue(obj) settt_(obj, LUA_VFALSE) -#define setbtvalue(obj) settt_(obj, LUA_VTRUE) - - - - - - -#define LUA_VTHREAD makevariant(LUA_TTHREAD, 0) - -#define ttisthread(o) checktag((o), ctb(LUA_VTHREAD)) - -#define thvalue(o) check_exp(ttisthread(o), gco2th(val_(o).gc)) - -#define setthvalue(L,obj,x) \ - { TValue *io = (obj); lua_State *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTHREAD)); \ - checkliveness(L,io); } - -#define setthvalue2s(L,o,t) setthvalue(L,s2v(o),t) - - - - - - - -#define CommonHeader struct GCObject *next; lu_byte tt; lu_byte marked - - - -typedef struct GCObject { - CommonHeader; -} GCObject; - - - -#define BIT_ISCOLLECTABLE (1 << 6) - -#define iscollectable(o) (rawtt(o) & BIT_ISCOLLECTABLE) - - -#define ctb(t) ((t) | BIT_ISCOLLECTABLE) - -#define gcvalue(o) check_exp(iscollectable(o), val_(o).gc) - -#define gcvalueraw(v) ((v).gc) - -#define setgcovalue(L,obj,x) \ - { TValue *io = (obj); GCObject *i_g=(x); \ - val_(io).gc = i_g; settt_(io, ctb(i_g->tt)); } - - - - - - - -#define LUA_VNUMINT makevariant(LUA_TNUMBER, 0) -#define LUA_VNUMFLT makevariant(LUA_TNUMBER, 1) - -#define ttisnumber(o) checktype((o), LUA_TNUMBER) -#define ttisfloat(o) checktag((o), LUA_VNUMFLT) -#define ttisinteger(o) checktag((o), LUA_VNUMINT) - -#define nvalue(o) check_exp(ttisnumber(o), \ - (ttisinteger(o) ? cast_num(ivalue(o)) : fltvalue(o))) -#define fltvalue(o) check_exp(ttisfloat(o), val_(o).n) -#define ivalue(o) check_exp(ttisinteger(o), val_(o).i) - -#define fltvalueraw(v) ((v).n) -#define ivalueraw(v) ((v).i) - -#define setfltvalue(obj,x) \ - { TValue *io=(obj); val_(io).n=(x); settt_(io, LUA_VNUMFLT); } - -#define chgfltvalue(obj,x) \ - { TValue *io=(obj); lua_assert(ttisfloat(io)); val_(io).n=(x); } - -#define setivalue(obj,x) \ - { TValue *io=(obj); val_(io).i=(x); settt_(io, LUA_VNUMINT); } - -#define chgivalue(obj,x) \ - { TValue *io=(obj); lua_assert(ttisinteger(io)); val_(io).i=(x); } - - - - - - - -#define LUA_VSHRSTR makevariant(LUA_TSTRING, 0) -#define LUA_VLNGSTR makevariant(LUA_TSTRING, 1) - -#define ttisstring(o) checktype((o), LUA_TSTRING) -#define ttisshrstring(o) checktag((o), ctb(LUA_VSHRSTR)) -#define ttislngstring(o) checktag((o), ctb(LUA_VLNGSTR)) - -#define tsvalueraw(v) (gco2ts((v).gc)) - -#define tsvalue(o) check_exp(ttisstring(o), gco2ts(val_(o).gc)) - -#define setsvalue(L,obj,x) \ - { TValue *io = (obj); TString *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(x_->tt)); \ - checkliveness(L,io); } - - -#define setsvalue2s(L,o,s) setsvalue(L,s2v(o),s) - - -#define setsvalue2n setsvalue - - - -#define LSTRREG -1 -#define LSTRFIX -2 -#define LSTRMEM -3 - - - -typedef struct TString { - CommonHeader; - lu_byte extra; - ls_byte shrlen; - unsigned int hash; - union { - size_t lnglen; - struct TString *hnext; - } u; - char *contents; - lua_Alloc falloc; - void *ud; -} TString; - - -#define strisshr(ts) ((ts)->shrlen >= 0) - - - -#define rawgetshrstr(ts) (cast_charp(&(ts)->contents)) -#define getshrstr(ts) check_exp(strisshr(ts), rawgetshrstr(ts)) -#define getlngstr(ts) check_exp(!strisshr(ts), (ts)->contents) -#define getstr(ts) (strisshr(ts) ? rawgetshrstr(ts) : (ts)->contents) - - - -#define tsslen(ts) \ - (strisshr(ts) ? cast_uint((ts)->shrlen) : (ts)->u.lnglen) - - -#define getlstr(ts, len) \ - (strisshr(ts) \ - ? (cast_void((len) = (ts)->shrlen), rawgetshrstr(ts)) \ - : (cast_void((len) = (ts)->u.lnglen), (ts)->contents)) - - - - - - - - -#define LUA_VLIGHTUSERDATA makevariant(LUA_TLIGHTUSERDATA, 0) - -#define LUA_VUSERDATA makevariant(LUA_TUSERDATA, 0) - -#define ttislightuserdata(o) checktag((o), LUA_VLIGHTUSERDATA) -#define ttisfulluserdata(o) checktag((o), ctb(LUA_VUSERDATA)) - -#define pvalue(o) check_exp(ttislightuserdata(o), val_(o).p) -#define uvalue(o) check_exp(ttisfulluserdata(o), gco2u(val_(o).gc)) - -#define pvalueraw(v) ((v).p) - -#define setpvalue(obj,x) \ - { TValue *io=(obj); val_(io).p=(x); settt_(io, LUA_VLIGHTUSERDATA); } - -#define setuvalue(L,obj,x) \ - { TValue *io = (obj); Udata *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VUSERDATA)); \ - checkliveness(L,io); } - - - -typedef union UValue { - TValue uv; - LUAI_MAXALIGN; -} UValue; - - - -typedef struct Udata { - CommonHeader; - unsigned short nuvalue; - size_t len; - struct Table *metatable; - GCObject *gclist; - UValue uv[1]; -} Udata; - - - -typedef struct Udata0 { - CommonHeader; - unsigned short nuvalue; - size_t len; - struct Table *metatable; - union {LUAI_MAXALIGN;} bindata; -} Udata0; - - - -#define udatamemoffset(nuv) \ - ((nuv) == 0 ? offsetof(Udata0, bindata) \ - : offsetof(Udata, uv) + (sizeof(UValue) * (nuv))) - - -#define getudatamem(u) (cast_charp(u) + udatamemoffset((u)->nuvalue)) - - -#define sizeudata(nuv,nb) (udatamemoffset(nuv) + (nb)) - - - - - - -#define LUA_VPROTO makevariant(LUA_TPROTO, 0) - - - -typedef struct Upvaldesc { - TString *name; - lu_byte instack; - lu_byte idx; - lu_byte kind; -} Upvaldesc; - - - -typedef struct LocVar { - TString *varname; - int startpc; - int endpc; -} LocVar; - - - -typedef struct AbsLineInfo { - int pc; - int line; -} AbsLineInfo; - - - -#define PF_ISVARARG 1 -#define PF_FIXED 2 - - - -typedef struct Proto { - CommonHeader; - lu_byte numparams; - lu_byte flag; - lu_byte maxstacksize; - int sizeupvalues; - int sizek; - int sizecode; - int sizelineinfo; - int sizep; - int sizelocvars; - int sizeabslineinfo; - int linedefined; - int lastlinedefined; - TValue *k; - Instruction *code; - struct Proto **p; - Upvaldesc *upvalues; - ls_byte *lineinfo; - AbsLineInfo *abslineinfo; - LocVar *locvars; - TString *source; - GCObject *gclist; -} Proto; - - - - - - -#define LUA_VUPVAL makevariant(LUA_TUPVAL, 0) - - - -#define LUA_VLCL makevariant(LUA_TFUNCTION, 0) -#define LUA_VLCF makevariant(LUA_TFUNCTION, 1) -#define LUA_VCCL makevariant(LUA_TFUNCTION, 2) - -#define ttisfunction(o) checktype(o, LUA_TFUNCTION) -#define ttisLclosure(o) checktag((o), ctb(LUA_VLCL)) -#define ttislcf(o) checktag((o), LUA_VLCF) -#define ttisCclosure(o) checktag((o), ctb(LUA_VCCL)) -#define ttisclosure(o) (ttisLclosure(o) || ttisCclosure(o)) - - -#define isLfunction(o) ttisLclosure(o) - -#define clvalue(o) check_exp(ttisclosure(o), gco2cl(val_(o).gc)) -#define clLvalue(o) check_exp(ttisLclosure(o), gco2lcl(val_(o).gc)) -#define fvalue(o) check_exp(ttislcf(o), val_(o).f) -#define clCvalue(o) check_exp(ttisCclosure(o), gco2ccl(val_(o).gc)) - -#define fvalueraw(v) ((v).f) - -#define setclLvalue(L,obj,x) \ - { TValue *io = (obj); LClosure *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VLCL)); \ - checkliveness(L,io); } - -#define setclLvalue2s(L,o,cl) setclLvalue(L,s2v(o),cl) - -#define setfvalue(obj,x) \ - { TValue *io=(obj); val_(io).f=(x); settt_(io, LUA_VLCF); } - -#define setclCvalue(L,obj,x) \ - { TValue *io = (obj); CClosure *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VCCL)); \ - checkliveness(L,io); } - - - -typedef struct UpVal { - CommonHeader; - union { - TValue *p; - ptrdiff_t offset; - } v; - union { - struct { - struct UpVal *next; - struct UpVal **previous; - } open; - TValue value; - } u; -} UpVal; - - - -#define ClosureHeader \ - CommonHeader; lu_byte nupvalues; GCObject *gclist - -typedef struct CClosure { - ClosureHeader; - lua_CFunction f; - TValue upvalue[1]; -} CClosure; - - -typedef struct LClosure { - ClosureHeader; - struct Proto *p; - UpVal *upvals[1]; -} LClosure; - - -typedef union Closure { - CClosure c; - LClosure l; -} Closure; - - -#define getproto(o) (clLvalue(o)->p) - - - - - - -#define LUA_VTABLE makevariant(LUA_TTABLE, 0) - -#define ttistable(o) checktag((o), ctb(LUA_VTABLE)) - -#define hvalue(o) check_exp(ttistable(o), gco2t(val_(o).gc)) - -#define sethvalue(L,obj,x) \ - { TValue *io = (obj); Table *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTABLE)); \ - checkliveness(L,io); } - -#define sethvalue2s(L,o,h) sethvalue(L,s2v(o),h) - - - -typedef union Node { - struct NodeKey { - TValuefields; - lu_byte key_tt; - int next; - Value key_val; - } u; - TValue i_val; -} Node; - - - -#define setnodekey(L,node,obj) \ - { Node *n_=(node); const TValue *io_=(obj); \ - n_->u.key_val = io_->value_; n_->u.key_tt = io_->tt_; \ - checkliveness(L,io_); } - - - -#define getnodekey(L,obj,node) \ - { TValue *io_=(obj); const Node *n_=(node); \ - io_->value_ = n_->u.key_val; io_->tt_ = n_->u.key_tt; \ - checkliveness(L,io_); } - - - - -#define BITRAS (1 << 7) -#define isrealasize(t) (!((t)->flags & BITRAS)) -#define setrealasize(t) ((t)->flags &= cast_byte(~BITRAS)) -#define setnorealasize(t) ((t)->flags |= BITRAS) - - -typedef struct ArrayCell ArrayCell; - - -typedef struct Table { - CommonHeader; - lu_byte flags; - lu_byte lsizenode; - unsigned int alimit; - ArrayCell *array; - Node *node; - struct Table *metatable; - GCObject *gclist; -} Table; - - - -#define keytt(node) ((node)->u.key_tt) -#define keyval(node) ((node)->u.key_val) - -#define keyisnil(node) (keytt(node) == LUA_TNIL) -#define keyisinteger(node) (keytt(node) == LUA_VNUMINT) -#define keyival(node) (keyval(node).i) -#define keyisshrstr(node) (keytt(node) == ctb(LUA_VSHRSTR)) -#define keystrval(node) (gco2ts(keyval(node).gc)) - -#define setnilkey(node) (keytt(node) = LUA_TNIL) - -#define keyiscollectable(n) (keytt(n) & BIT_ISCOLLECTABLE) - -#define gckey(n) (keyval(n).gc) -#define gckeyN(n) (keyiscollectable(n) ? gckey(n) : NULL) - - - -#define setdeadkey(node) (keytt(node) = LUA_TDEADKEY) -#define keyisdead(node) (keytt(node) == LUA_TDEADKEY) - - - - - - -#define lmod(s,size) \ - (check_exp((size&(size-1))==0, (cast_int((s) & ((size)-1))))) - - -#define twoto(x) (1<<(x)) -#define sizenode(t) (twoto((t)->lsizenode)) - - - -#define UTF8BUFFSZ 8 - -LUAI_FUNC int luaO_utf8esc (char *buff, unsigned long x); -LUAI_FUNC int luaO_ceillog2 (unsigned int x); -LUAI_FUNC unsigned int luaO_codeparam (unsigned int p); -LUAI_FUNC l_obj luaO_applyparam (unsigned int p, l_obj x); - -LUAI_FUNC int luaO_rawarith (lua_State *L, int op, const TValue *p1, - const TValue *p2, TValue *res); -LUAI_FUNC void luaO_arith (lua_State *L, int op, const TValue *p1, - const TValue *p2, StkId res); -LUAI_FUNC size_t luaO_str2num (const char *s, TValue *o); -LUAI_FUNC int luaO_hexavalue (int c); -LUAI_FUNC void luaO_tostring (lua_State *L, TValue *obj); -LUAI_FUNC const char *luaO_pushvfstring (lua_State *L, const char *fmt, - va_list argp); -LUAI_FUNC const char *luaO_pushfstring (lua_State *L, const char *fmt, ...); -LUAI_FUNC void luaO_chunkid (char *out, const char *source, size_t srclen); - - -#endif - - - -//path: src/imports/../dependencies/lua/ltm.h - - -#ifndef ltm_h -#define ltm_h - - - - - - - -typedef enum { - TM_INDEX, - TM_NEWINDEX, - TM_GC, - TM_MODE, - TM_LEN, - TM_EQ, - TM_ADD, - TM_SUB, - TM_MUL, - TM_MOD, - TM_POW, - TM_DIV, - TM_IDIV, - TM_BAND, - TM_BOR, - TM_BXOR, - TM_SHL, - TM_SHR, - TM_UNM, - TM_BNOT, - TM_LT, - TM_LE, - TM_CONCAT, - TM_CALL, - TM_CLOSE, - TM_N -} TMS; - - - -#define maskflags (~(~0u << (TM_EQ + 1))) - - - -#define notm(tm) ttisnil(tm) - -#define checknoTM(mt,e) ((mt) == NULL || (mt)->flags & (1u<<(e))) - -#define gfasttm(g,mt,e) \ - (checknoTM(mt, e) ? NULL : luaT_gettm(mt, e, (g)->tmname[e])) - -#define fasttm(l,mt,e) gfasttm(G(l), mt, e) - -#define ttypename(x) luaT_typenames_[(x) + 1] - -LUAI_DDEC(const char *const luaT_typenames_[LUA_TOTALTYPES];) - - -LUAI_FUNC const char *luaT_objtypename (lua_State *L, const TValue *o); - -LUAI_FUNC const TValue *luaT_gettm (Table *events, TMS event, TString *ename); -LUAI_FUNC const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, - TMS event); -LUAI_FUNC void luaT_init (lua_State *L); - -LUAI_FUNC void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, const TValue *p3); -LUAI_FUNC int luaT_callTMres (lua_State *L, const TValue *f, - const TValue *p1, const TValue *p2, StkId p3); -LUAI_FUNC void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event); -LUAI_FUNC void luaT_tryconcatTM (lua_State *L); -LUAI_FUNC void luaT_trybinassocTM (lua_State *L, const TValue *p1, - const TValue *p2, int inv, StkId res, TMS event); -LUAI_FUNC void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, - int inv, StkId res, TMS event); -LUAI_FUNC int luaT_callorderTM (lua_State *L, const TValue *p1, - const TValue *p2, TMS event); -LUAI_FUNC int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, - int inv, int isfloat, TMS event); - -LUAI_FUNC void luaT_adjustvarargs (lua_State *L, int nfixparams, - struct CallInfo *ci, const Proto *p); -LUAI_FUNC void luaT_getvarargs (lua_State *L, struct CallInfo *ci, - StkId where, int wanted); - - -#endif - - -//path: src/imports/../dependencies/lua/lzio.h - - - -#ifndef lzio_h -#define lzio_h - - - - - - - - -#define EOZ (-1) - -typedef struct Zio ZIO; - -#define zgetc(z) (((z)->n--)>0 ? cast_uchar(*(z)->p++) : luaZ_fill(z)) - - -typedef struct Mbuffer { - char *buffer; - size_t n; - size_t buffsize; -} Mbuffer; - -#define luaZ_initbuffer(L, buff) ((buff)->buffer = NULL, (buff)->buffsize = 0) - -#define luaZ_buffer(buff) ((buff)->buffer) -#define luaZ_sizebuffer(buff) ((buff)->buffsize) -#define luaZ_bufflen(buff) ((buff)->n) - -#define luaZ_buffremove(buff,i) ((buff)->n -= (i)) -#define luaZ_resetbuffer(buff) ((buff)->n = 0) - - -#define luaZ_resizebuffer(L, buff, size) \ - ((buff)->buffer = luaM_reallocvchar(L, (buff)->buffer, \ - (buff)->buffsize, size), \ - (buff)->buffsize = size) - -#define luaZ_freebuffer(L, buff) luaZ_resizebuffer(L, buff, 0) - - -LUAI_FUNC void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, - void *data); -LUAI_FUNC size_t luaZ_read (ZIO* z, void *b, size_t n); - -LUAI_FUNC const void *luaZ_getaddr (ZIO* z, size_t n); - - - - -struct Zio { - size_t n; - const char *p; - lua_Reader reader; - void *data; - lua_State *L; -}; - - -LUAI_FUNC int luaZ_fill (ZIO *z); - -#endif - - - - - - - - - - - - - - -#define yieldable(L) (((L)->nCcalls & 0xffff0000) == 0) - - -#define getCcalls(L) ((L)->nCcalls & 0xffff) - - - -#define incnny(L) ((L)->nCcalls += 0x10000) - - -#define decnny(L) ((L)->nCcalls -= 0x10000) - - -#define nyci (0x10000 | 1) - - - - -struct lua_longjmp; - - - -#if !defined(l_signalT) -#include -#define l_signalT sig_atomic_t -#endif - - - -#define EXTRA_STACK 5 - - -#define BASIC_STACK_SIZE (2*LUA_MINSTACK) - -#define stacksize(th) cast_int((th)->stack_last.p - (th)->stack.p) - - - -#define KGC_INC 0 -#define KGC_GENMINOR 1 -#define KGC_GENMAJOR 2 - - -typedef struct stringtable { - TString **hash; - int nuse; - int size; -} stringtable; - - - -struct CallInfo { - StkIdRel func; - StkIdRel top; - struct CallInfo *previous, *next; - union { - struct { - const Instruction *savedpc; - volatile l_signalT trap; - int nextraargs; - } l; - struct { - lua_KFunction k; - ptrdiff_t old_errfunc; - lua_KContext ctx; - } c; - } u; - union { - int funcidx; - int nyield; - int nres; - struct { - unsigned short ftransfer; - unsigned short ntransfer; - } transferinfo; - } u2; - short nresults; - unsigned short callstatus; -}; - - - -#define CIST_OAH (1<<0) -#define CIST_C (1<<1) -#define CIST_FRESH (1<<2) -#define CIST_HOOKED (1<<3) -#define CIST_YPCALL (1<<4) -#define CIST_TAIL (1<<5) -#define CIST_HOOKYIELD (1<<6) -#define CIST_FIN (1<<7) -#define CIST_TRAN (1<<8) -#define CIST_CLSRET (1<<9) - -#define CIST_RECST 10 -#if defined(LUA_COMPAT_LT_LE) -#define CIST_LEQ (1<<13) -#endif - - - -#define getcistrecst(ci) (((ci)->callstatus >> CIST_RECST) & 7) -#define setcistrecst(ci,st) \ - check_exp(((st) & 7) == (st), \ - ((ci)->callstatus = ((ci)->callstatus & ~(7 << CIST_RECST)) \ - | ((st) << CIST_RECST))) - - - -#define isLua(ci) (!((ci)->callstatus & CIST_C)) - - -#define isLuacode(ci) (!((ci)->callstatus & (CIST_C | CIST_HOOKED))) - - -#define setoah(st,v) ((st) = ((st) & ~CIST_OAH) | (v)) -#define getoah(st) ((st) & CIST_OAH) - - - -typedef struct global_State { - lua_Alloc frealloc; - void *ud; - lu_mem totalbytes; - l_obj totalobjs; - l_obj GCdebt; - l_obj marked; - l_obj GCmajorminor; - stringtable strt; - TValue l_registry; - TValue nilvalue; - unsigned int seed; - lu_byte gcparams[LUA_GCPN]; - lu_byte currentwhite; - lu_byte gcstate; - lu_byte gckind; - lu_byte gcstopem; - lu_byte gcstp; - lu_byte gcemergency; - GCObject *allgc; - GCObject **sweepgc; - GCObject *finobj; - GCObject *gray; - GCObject *grayagain; - GCObject *weak; - GCObject *ephemeron; - GCObject *allweak; - GCObject *tobefnz; - GCObject *fixedgc; - - GCObject *survival; - GCObject *old1; - GCObject *reallyold; - GCObject *firstold1; - GCObject *finobjsur; - GCObject *finobjold1; - GCObject *finobjrold; - struct lua_State *twups; - lua_CFunction panic; - struct lua_State *mainthread; - TString *memerrmsg; - TString *tmname[TM_N]; - struct Table *mt[LUA_NUMTYPES]; - TString *strcache[STRCACHE_N][STRCACHE_M]; - lua_WarnFunction warnf; - void *ud_warn; -} global_State; - - - -struct lua_State { - CommonHeader; - lu_byte status; - lu_byte allowhook; - unsigned short nci; - StkIdRel top; - global_State *l_G; - CallInfo *ci; - StkIdRel stack_last; - StkIdRel stack; - UpVal *openupval; - StkIdRel tbclist; - GCObject *gclist; - struct lua_State *twups; - struct lua_longjmp *errorJmp; - CallInfo base_ci; - volatile lua_Hook hook; - ptrdiff_t errfunc; - l_uint32 nCcalls; - int oldpc; - int basehookcount; - int hookcount; - volatile l_signalT hookmask; -}; - - -#define G(L) (L->l_G) - - -#define completestate(g) ttisnil(&g->nilvalue) - - - -union GCUnion { - GCObject gc; - struct TString ts; - struct Udata u; - union Closure cl; - struct Table h; - struct Proto p; - struct lua_State th; - struct UpVal upv; -}; - - - -#define cast_u(o) cast(union GCUnion *, (o)) - - -#define gco2ts(o) \ - check_exp(novariant((o)->tt) == LUA_TSTRING, &((cast_u(o))->ts)) -#define gco2u(o) check_exp((o)->tt == LUA_VUSERDATA, &((cast_u(o))->u)) -#define gco2lcl(o) check_exp((o)->tt == LUA_VLCL, &((cast_u(o))->cl.l)) -#define gco2ccl(o) check_exp((o)->tt == LUA_VCCL, &((cast_u(o))->cl.c)) -#define gco2cl(o) \ - check_exp(novariant((o)->tt) == LUA_TFUNCTION, &((cast_u(o))->cl)) -#define gco2t(o) check_exp((o)->tt == LUA_VTABLE, &((cast_u(o))->h)) -#define gco2p(o) check_exp((o)->tt == LUA_VPROTO, &((cast_u(o))->p)) -#define gco2th(o) check_exp((o)->tt == LUA_VTHREAD, &((cast_u(o))->th)) -#define gco2upv(o) check_exp((o)->tt == LUA_VUPVAL, &((cast_u(o))->upv)) - - - -#define obj2gco(v) check_exp((v)->tt >= LUA_TSTRING, &(cast_u(v)->gc)) - - - -#define gettotalobjs(g) ((g)->totalobjs - (g)->GCdebt) - - -LUAI_FUNC void luaE_setdebt (global_State *g, l_obj debt); -LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1); -LUAI_FUNC CallInfo *luaE_extendCI (lua_State *L); -LUAI_FUNC void luaE_shrinkCI (lua_State *L); -LUAI_FUNC void luaE_checkcstack (lua_State *L); -LUAI_FUNC void luaE_incCstack (lua_State *L); -LUAI_FUNC void luaE_warning (lua_State *L, const char *msg, int tocont); -LUAI_FUNC void luaE_warnerror (lua_State *L, const char *where); -LUAI_FUNC int luaE_resetthread (lua_State *L, int status); - - -#endif - - - - - - - -int luaZ_fill (ZIO *z) { - size_t size; - lua_State *L = z->L; - const char *buff; - lua_unlock(L); - buff = z->reader(L, z->data, &size); - lua_lock(L); - if (buff == NULL || size == 0) - return EOZ; - z->n = size - 1; - z->p = buff; - return cast_uchar(*(z->p++)); -} - - -void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, void *data) { - z->L = L; - z->reader = reader; - z->data = data; - z->n = 0; - z->p = NULL; -} - - - - -static int checkbuffer (ZIO *z) { - if (z->n == 0) { - if (luaZ_fill(z) == EOZ) - return 0; - else { - z->n++; - z->p--; - } - } - return 1; -} - - -size_t luaZ_read (ZIO *z, void *b, size_t n) { - while (n) { - size_t m; - if (!checkbuffer(z)) - return n; - m = (n <= z->n) ? n : z->n; - memcpy(b, z->p, m); - z->n -= m; - z->p += m; - b = (char *)b + m; - n -= m; - } - return 0; -} - - -const void *luaZ_getaddr (ZIO* z, size_t n) { - const void *res; - if (!checkbuffer(z)) - return NULL; - if (z->n < n) - return NULL; - res = z->p; - z->n -= n; - z->p += n; - return res; -} - - -//path: src/imports/../dependencies/lua/lctype.c - - -#define lctype_c -#define LUA_CORE - - - - - -//path: src/imports/../dependencies/lua/lctype.h - - -#ifndef lctype_h -#define lctype_h - - - - - - - -#if !defined(LUA_USE_CTYPE) - -#if 'A' == 65 && '0' == 48 - -#define LUA_USE_CTYPE 0 -#else - -#define LUA_USE_CTYPE 1 -#endif - -#endif - - -#if !LUA_USE_CTYPE - -#include - - - - - -#define ALPHABIT 0 -#define DIGITBIT 1 -#define PRINTBIT 2 -#define SPACEBIT 3 -#define XDIGITBIT 4 - - -#define MASK(B) (1 << (B)) - - - -#define testprop(c,p) (luai_ctype_[(c)+1] & (p)) - - -#define lislalpha(c) testprop(c, MASK(ALPHABIT)) -#define lislalnum(c) testprop(c, (MASK(ALPHABIT) | MASK(DIGITBIT))) -#define lisdigit(c) testprop(c, MASK(DIGITBIT)) -#define lisspace(c) testprop(c, MASK(SPACEBIT)) -#define lisprint(c) testprop(c, MASK(PRINTBIT)) -#define lisxdigit(c) testprop(c, MASK(XDIGITBIT)) - - - -#define ltolower(c) \ - check_exp(('A' <= (c) && (c) <= 'Z') || (c) == ((c) | ('A' ^ 'a')), \ - (c) | ('A' ^ 'a')) - - - -LUAI_DDEC(const lu_byte luai_ctype_[UCHAR_MAX + 2];) - - -#else - - - -#include - - -#define lislalpha(c) (isalpha(c) || (c) == '_') -#define lislalnum(c) (isalnum(c) || (c) == '_') -#define lisdigit(c) (isdigit(c)) -#define lisspace(c) (isspace(c)) -#define lisprint(c) (isprint(c)) -#define lisxdigit(c) (isxdigit(c)) - -#define ltolower(c) (tolower(c)) - -#endif - -#endif - - - - -#if !LUA_USE_CTYPE - -#include - - -#if defined (LUA_UCID) - -#define NONA 0x01 -#else -#define NONA 0x00 -#endif - - -LUAI_DDEF const lu_byte luai_ctype_[UCHAR_MAX + 2] = { - 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x00, 0x08, 0x08, 0x08, 0x08, 0x08, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, - 0x0c, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, - 0x16, 0x16, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, - 0x04, 0x15, 0x15, 0x15, 0x15, 0x15, 0x15, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x04, 0x04, 0x04, 0x04, 0x05, - 0x04, 0x15, 0x15, 0x15, 0x15, 0x15, 0x15, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, - 0x05, 0x05, 0x05, 0x04, 0x04, 0x04, 0x04, 0x00, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - 0x00, 0x00, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, - NONA, NONA, NONA, NONA, NONA, 0x00, 0x00, 0x00, - 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 -}; - -#endif - -//path: src/imports/../dependencies/lua/lopcodes.c - - -#define lopcodes_c -#define LUA_CORE - - - - - -//path: src/imports/../dependencies/lua/lopcodes.h - - -#ifndef lopcodes_h -#define lopcodes_h - - - - - - - - -enum OpMode {iABC, iABx, iAsBx, iAx, isJ}; - - - -#define SIZE_C 8 -#define SIZE_B 8 -#define SIZE_Bx (SIZE_C + SIZE_B + 1) -#define SIZE_A 8 -#define SIZE_Ax (SIZE_Bx + SIZE_A) -#define SIZE_sJ (SIZE_Bx + SIZE_A) - -#define SIZE_OP 7 - -#define POS_OP 0 - -#define POS_A (POS_OP + SIZE_OP) -#define POS_k (POS_A + SIZE_A) -#define POS_B (POS_k + 1) -#define POS_C (POS_B + SIZE_B) - -#define POS_Bx POS_k - -#define POS_Ax POS_A - -#define POS_sJ POS_A - - - - - -#define L_INTHASBITS(b) ((UINT_MAX >> ((b) - 1)) >= 1) - - -#if L_INTHASBITS(SIZE_Bx) -#define MAXARG_Bx ((1<>1) - - -#if L_INTHASBITS(SIZE_Ax) -#define MAXARG_Ax ((1<> 1) - - -#define MAXARG_A ((1<> 1) - -#define int2sC(i) ((i) + OFFSET_sC) -#define sC2int(i) ((i) - OFFSET_sC) - - - -#define MASK1(n,p) ((~((~(Instruction)0)<<(n)))<<(p)) - - -#define MASK0(n,p) (~MASK1(n,p)) - - - -#define GET_OPCODE(i) (cast(OpCode, ((i)>>POS_OP) & MASK1(SIZE_OP,0))) -#define SET_OPCODE(i,o) ((i) = (((i)&MASK0(SIZE_OP,POS_OP)) | \ - ((cast(Instruction, o)<>(pos)) & MASK1(size,0))) -#define setarg(i,v,pos,size) ((i) = (((i)&MASK0(size,pos)) | \ - ((cast(Instruction, v)< - - - - -//path: src/imports/../dependencies/lua/ldebug.h - - -#ifndef ldebug_h -#define ldebug_h - - - - - - -#define pcRel(pc, p) (cast_int((pc) - (p)->code) - 1) - - - -#define ci_func(ci) (clLvalue(s2v((ci)->func.p))) - - -#define resethookcount(L) (L->hookcount = L->basehookcount) - - -#define ABSLINEINFO (-0x80) - - - -#if !defined(MAXIWTHABS) -#define MAXIWTHABS 128 -#endif - - -LUAI_FUNC int luaG_getfuncline (const Proto *f, int pc); -LUAI_FUNC const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, - StkId *pos); -LUAI_FUNC l_noret luaG_typeerror (lua_State *L, const TValue *o, - const char *opname); -LUAI_FUNC l_noret luaG_callerror (lua_State *L, const TValue *o); -LUAI_FUNC l_noret luaG_forerror (lua_State *L, const TValue *o, - const char *what); -LUAI_FUNC l_noret luaG_concaterror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_opinterror (lua_State *L, const TValue *p1, - const TValue *p2, - const char *msg); -LUAI_FUNC l_noret luaG_tointerror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_ordererror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_runerror (lua_State *L, const char *fmt, ...); -LUAI_FUNC const char *luaG_addinfo (lua_State *L, const char *msg, - TString *src, int line); -LUAI_FUNC l_noret luaG_errormsg (lua_State *L); -LUAI_FUNC int luaG_traceexec (lua_State *L, const Instruction *pc); -LUAI_FUNC int luaG_tracecall (lua_State *L); - - -#endif - - -//path: src/imports/../dependencies/lua/ldo.h - - -#ifndef ldo_h -#define ldo_h - - - - - - - - - - - - - -#define luaD_checkstackaux(L,n,pre,pos) \ - if (l_unlikely(L->stack_last.p - L->top.p <= (n))) \ - { pre; luaD_growstack(L, n, 1); pos; } \ - else { condmovestack(L,pre,pos); } - - -#define luaD_checkstack(L,n) luaD_checkstackaux(L,n,(void)0,(void)0) - - - -#define savestack(L,pt) (cast_charp(pt) - cast_charp(L->stack.p)) -#define restorestack(L,n) cast(StkId, cast_charp(L->stack.p) + (n)) - - - -#define checkstackp(L,n,p) \ - luaD_checkstackaux(L, n, \ - ptrdiff_t t__ = savestack(L, p), \ - p = restorestack(L, t__)) - - - - -typedef void (*Pfunc) (lua_State *L, void *ud); - -LUAI_FUNC void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop); -LUAI_FUNC int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, - const char *mode); -LUAI_FUNC void luaD_hook (lua_State *L, int event, int line, - int fTransfer, int nTransfer); -LUAI_FUNC void luaD_hookcall (lua_State *L, CallInfo *ci); -LUAI_FUNC int luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, - int narg1, int delta); -LUAI_FUNC CallInfo *luaD_precall (lua_State *L, StkId func, int nResults); -LUAI_FUNC void luaD_call (lua_State *L, StkId func, int nResults); -LUAI_FUNC void luaD_callnoyield (lua_State *L, StkId func, int nResults); -LUAI_FUNC int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status); -LUAI_FUNC int luaD_pcall (lua_State *L, Pfunc func, void *u, - ptrdiff_t oldtop, ptrdiff_t ef); -LUAI_FUNC void luaD_poscall (lua_State *L, CallInfo *ci, int nres); -LUAI_FUNC int luaD_reallocstack (lua_State *L, int newsize, int raiseerror); -LUAI_FUNC int luaD_growstack (lua_State *L, int n, int raiseerror); -LUAI_FUNC void luaD_shrinkstack (lua_State *L); -LUAI_FUNC void luaD_inctop (lua_State *L); - -LUAI_FUNC l_noret luaD_throw (lua_State *L, int errcode); -LUAI_FUNC int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud); - -#endif - - - -//path: src/imports/../dependencies/lua/lgc.h - - -#ifndef lgc_h -#define lgc_h - - -#include - - - - - - - - - - - -#define GCSpropagate 0 -#define GCSenteratomic 1 -#define GCSatomic 2 -#define GCSswpallgc 3 -#define GCSswpfinobj 4 -#define GCSswptobefnz 5 -#define GCSswpend 6 -#define GCScallfin 7 -#define GCSpause 8 - - -#define issweepphase(g) \ - (GCSswpallgc <= (g)->gcstate && (g)->gcstate <= GCSswpend) - - - - -#define keepinvariant(g) ((g)->gcstate <= GCSatomic) - - - -#define resetbits(x,m) ((x) &= cast_byte(~(m))) -#define setbits(x,m) ((x) |= (m)) -#define testbits(x,m) ((x) & (m)) -#define bitmask(b) (1<<(b)) -#define bit2mask(b1,b2) (bitmask(b1) | bitmask(b2)) -#define l_setbit(x,b) setbits(x, bitmask(b)) -#define resetbit(x,b) resetbits(x, bitmask(b)) -#define testbit(x,b) testbits(x, bitmask(b)) - - - -#define WHITE0BIT 3 -#define WHITE1BIT 4 -#define BLACKBIT 5 -#define FINALIZEDBIT 6 - -#define TESTBIT 7 - - - -#define WHITEBITS bit2mask(WHITE0BIT, WHITE1BIT) - - -#define iswhite(x) testbits((x)->marked, WHITEBITS) -#define isblack(x) testbit((x)->marked, BLACKBIT) -#define isgray(x) \ - (!testbits((x)->marked, WHITEBITS | bitmask(BLACKBIT))) - -#define tofinalize(x) testbit((x)->marked, FINALIZEDBIT) - -#define otherwhite(g) ((g)->currentwhite ^ WHITEBITS) -#define isdeadm(ow,m) ((m) & (ow)) -#define isdead(g,v) isdeadm(otherwhite(g), (v)->marked) - -#define changewhite(x) ((x)->marked ^= WHITEBITS) -#define nw2black(x) \ - check_exp(!iswhite(x), l_setbit((x)->marked, BLACKBIT)) - -#define luaC_white(g) cast_byte((g)->currentwhite & WHITEBITS) - - - -#define G_NEW 0 -#define G_SURVIVAL 1 -#define G_OLD0 2 -#define G_OLD1 3 -#define G_OLD 4 -#define G_TOUCHED1 5 -#define G_TOUCHED2 6 - -#define AGEBITS 7 - -#define getage(o) ((o)->marked & AGEBITS) -#define setage(o,a) ((o)->marked = cast_byte(((o)->marked & (~AGEBITS)) | a)) -#define isold(o) (getage(o) > G_SURVIVAL) - - - - - - - - -#define LUAI_MINORMAJOR 100 - - -#define LUAI_MAJORMINOR 50 - - -#define LUAI_GENMINORMUL 25 - - - - - -#define LUAI_GCPAUSE 200 - - -#define LUAI_GCMUL 200 - - -#define LUAI_GCSTEPSIZE 250 - - -#define setgcparam(g,p,v) (g->gcparams[LUA_GCP##p] = luaO_codeparam(v)) -#define applygcparam(g,p,x) luaO_applyparam(g->gcparams[LUA_GCP##p], x) - - -#define GCSTPUSR 1 -#define GCSTPGC 2 -#define GCSTPCLS 4 -#define gcrunning(g) ((g)->gcstp == 0) - - - -#define luaC_condGC(L,pre,pos) \ - { if (G(L)->GCdebt <= 0) { pre; luaC_step(L); pos;}; \ - condchangemem(L,pre,pos); } - - -#define luaC_checkGC(L) luaC_condGC(L,(void)0,(void)0) - - -#define luaC_objbarrier(L,p,o) ( \ - (isblack(p) && iswhite(o)) ? \ - luaC_barrier_(L,obj2gco(p),obj2gco(o)) : cast_void(0)) - -#define luaC_barrier(L,p,v) ( \ - iscollectable(v) ? luaC_objbarrier(L,p,gcvalue(v)) : cast_void(0)) - -#define luaC_objbarrierback(L,p,o) ( \ - (isblack(p) && iswhite(o)) ? luaC_barrierback_(L,p) : cast_void(0)) - -#define luaC_barrierback(L,p,v) ( \ - iscollectable(v) ? luaC_objbarrierback(L, p, gcvalue(v)) : cast_void(0)) - -LUAI_FUNC void luaC_fix (lua_State *L, GCObject *o); -LUAI_FUNC void luaC_freeallobjects (lua_State *L); -LUAI_FUNC void luaC_step (lua_State *L); -LUAI_FUNC void luaC_runtilstate (lua_State *L, int state, int fast); -LUAI_FUNC void luaC_fullgc (lua_State *L, int isemergency); -LUAI_FUNC GCObject *luaC_newobj (lua_State *L, int tt, size_t sz); -LUAI_FUNC GCObject *luaC_newobjdt (lua_State *L, int tt, size_t sz, - size_t offset); -LUAI_FUNC void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v); -LUAI_FUNC void luaC_barrierback_ (lua_State *L, GCObject *o); -LUAI_FUNC void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt); -LUAI_FUNC void luaC_changemode (lua_State *L, int newmode); - - -#endif - - - - - - - - - - - - - - - -#define callfrealloc(g,block,os,ns) ((*g->frealloc)(g->ud, block, os, ns)) - - - -#define cantryagain(g) (completestate(g) && !g->gcstopem) - - - - -#if defined(EMERGENCYGCTESTS) - -static void *firsttry (global_State *g, void *block, size_t os, size_t ns) { - if (ns > 0 && cantryagain(g)) - return NULL; - else - return callfrealloc(g, block, os, ns); -} -#else -#define firsttry(g,block,os,ns) callfrealloc(g, block, os, ns) -#endif - - - - - - - - -#define MINSIZEARRAY 4 - - -void *luaM_growaux_ (lua_State *L, void *block, int nelems, int *psize, - int size_elems, int limit, const char *what) { - void *newblock; - int size = *psize; - if (nelems + 1 <= size) - return block; - if (size >= limit / 2) { - if (l_unlikely(size >= limit)) - luaG_runerror(L, "too many %s (limit is %d)", what, limit); - size = limit; - } - else { - size *= 2; - if (size < MINSIZEARRAY) - size = MINSIZEARRAY; - } - lua_assert(nelems + 1 <= size && size <= limit); - - newblock = luaM_saferealloc_(L, block, cast_sizet(*psize) * size_elems, - cast_sizet(size) * size_elems); - *psize = size; - return newblock; -} - - - -void *luaM_shrinkvector_ (lua_State *L, void *block, int *size, - int final_n, int size_elem) { - void *newblock; - size_t oldsize = cast_sizet((*size) * size_elem); - size_t newsize = cast_sizet(final_n * size_elem); - lua_assert(newsize <= oldsize); - newblock = luaM_saferealloc_(L, block, oldsize, newsize); - *size = final_n; - return newblock; -} - - - - -l_noret luaM_toobig (lua_State *L) { - luaG_runerror(L, "memory allocation private_lua_error: block too big"); -} - - - -void luaM_free_ (lua_State *L, void *block, size_t osize) { - global_State *g = G(L); - lua_assert((osize == 0) == (block == NULL)); - callfrealloc(g, block, osize, 0); - g->totalbytes -= osize; -} - - - -static void *tryagain (lua_State *L, void *block, - size_t osize, size_t nsize) { - global_State *g = G(L); - if (cantryagain(g)) { - luaC_fullgc(L, 1); - return callfrealloc(g, block, osize, nsize); - } - else return NULL; -} - - - -void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) { - void *newblock; - global_State *g = G(L); - lua_assert((osize == 0) == (block == NULL)); - newblock = firsttry(g, block, osize, nsize); - if (l_unlikely(newblock == NULL && nsize > 0)) { - newblock = tryagain(L, block, osize, nsize); - if (newblock == NULL) - return NULL; - } - lua_assert((nsize == 0) == (newblock == NULL)); - g->totalbytes += nsize - osize; - return newblock; -} - - -void *luaM_saferealloc_ (lua_State *L, void *block, size_t osize, - size_t nsize) { - void *newblock = luaM_realloc_(L, block, osize, nsize); - if (l_unlikely(newblock == NULL && nsize > 0)) - luaM_error(L); - return newblock; -} - - -void *luaM_malloc_ (lua_State *L, size_t size, int tag) { - if (size == 0) - return NULL; - else { - global_State *g = G(L); - void *newblock = firsttry(g, NULL, tag, size); - if (l_unlikely(newblock == NULL)) { - newblock = tryagain(L, NULL, tag, size); - if (newblock == NULL) - luaM_error(L); - } - g->totalbytes += size; - return newblock; - } -} - - -//path: src/imports/../dependencies/lua/lundump.c - - -#define lundump_c -#define LUA_CORE - - - - - -#include -#include - - - - - - - - -//path: src/imports/../dependencies/lua/lfunc.h - - -#ifndef lfunc_h -#define lfunc_h - - - - - - -#define sizeCclosure(n) (cast_int(offsetof(CClosure, upvalue)) + \ - cast_int(sizeof(TValue)) * (n)) - -#define sizeLclosure(n) (cast_int(offsetof(LClosure, upvals)) + \ - cast_int(sizeof(TValue *)) * (n)) - - - -#define isintwups(L) (L->twups != L) - - - -#define MAXUPVAL 255 - - -#define upisopen(up) ((up)->v.p != &(up)->u.value) - - -#define uplevel(up) check_exp(upisopen(up), cast(StkId, (up)->v.p)) - - - -#define MAXMISS 10 - - - - -#define CLOSEKTOP (-1) - - -LUAI_FUNC Proto *luaF_newproto (lua_State *L); -LUAI_FUNC CClosure *luaF_newCclosure (lua_State *L, int nupvals); -LUAI_FUNC LClosure *luaF_newLclosure (lua_State *L, int nupvals); -LUAI_FUNC void luaF_initupvals (lua_State *L, LClosure *cl); -LUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_newtbcupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_closeupval (lua_State *L, StkId level); -LUAI_FUNC StkId luaF_close (lua_State *L, StkId level, int status, int yy); -LUAI_FUNC void luaF_unlinkupval (UpVal *uv); -LUAI_FUNC void luaF_freeproto (lua_State *L, Proto *f); -LUAI_FUNC const char *luaF_getlocalname (const Proto *func, int local_number, - int pc); - - -#endif - - - - - - -//path: src/imports/../dependencies/lua/lstring.h - - -#ifndef lstring_h -#define lstring_h - - - - - - - - - - -#define MEMERRMSG "not enough memory" - - - -#define sizestrshr(l) \ - (offsetof(TString, contents) + ((l) + 1) * sizeof(char)) - - -#define luaS_newliteral(L, s) (luaS_newlstr(L, "" s, \ - (sizeof(s)/sizeof(char))-1)) - - - -#define isreserved(s) ((s)->tt == LUA_VSHRSTR && (s)->extra > 0) - - - -#define eqshrstr(a,b) check_exp((a)->tt == LUA_VSHRSTR, (a) == (b)) - - -LUAI_FUNC unsigned luaS_hash (const char *str, size_t l, unsigned seed); -LUAI_FUNC unsigned luaS_hashlongstr (TString *ts); -LUAI_FUNC int luaS_eqlngstr (TString *a, TString *b); -LUAI_FUNC void luaS_resize (lua_State *L, int newsize); -LUAI_FUNC void luaS_clearcache (global_State *g); -LUAI_FUNC void luaS_init (lua_State *L); -LUAI_FUNC void luaS_remove (lua_State *L, TString *ts); -LUAI_FUNC Udata *luaS_newudata (lua_State *L, size_t s, int nuvalue); -LUAI_FUNC TString *luaS_newlstr (lua_State *L, const char *str, size_t l); -LUAI_FUNC TString *luaS_new (lua_State *L, const char *str); -LUAI_FUNC TString *luaS_createlngstrobj (lua_State *L, size_t l); -LUAI_FUNC TString *luaS_newextlstr (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud); -LUAI_FUNC size_t luaS_sizelngstr (size_t len, int kind); - -#endif - - -//path: src/imports/../dependencies/lua/ltable.h - - -#ifndef ltable_h -#define ltable_h - - - - - -#define gnode(t,i) (&(t)->node[i]) -#define gval(n) (&(n)->i_val) -#define gnext(n) ((n)->u.next) - - - -#define invalidateTMcache(t) ((t)->flags &= ~maskflags) - - - - -#define BITDUMMY (1 << 6) -#define NOTBITDUMMY cast_byte(~BITDUMMY) -#define isdummy(t) ((t)->flags & BITDUMMY) - -#define setnodummy(t) ((t)->flags &= NOTBITDUMMY) -#define setdummy(t) ((t)->flags |= BITDUMMY) - - - - -#define allocsizenode(t) (isdummy(t) ? 0 : sizenode(t)) - - - -#define nodefromval(v) cast(Node *, (v)) - - - -#define luaH_fastgeti(t,k,res,tag) \ - { Table *h = t; lua_Unsigned u = l_castS2U(k); \ - if ((u - 1u < h->alimit)) { \ - tag = *getArrTag(h,(u)-1u); \ - if (!tagisempty(tag)) { farr2val(h, u, tag, res); }} \ - else { tag = luaH_getint(h, u, res); }} - - -#define luaH_fastseti(t,k,val,hres) \ - { Table *h = t; lua_Unsigned u = l_castS2U(k); \ - if ((u - 1u < h->alimit)) { \ - lu_byte *tag = getArrTag(h,(u)-1u); \ - if (tagisempty(*tag)) hres = ~cast_int(u); \ - else { fval2arr(h, u, tag, val); hres = HOK; }} \ - else { hres = luaH_psetint(h, u, val); }} - - - -#define HOK 0 -#define HNOTFOUND 1 -#define HNOTATABLE 2 -#define HFIRSTNODE 3 - - - - - -#define NM cast_uint(sizeof(Value)) - -struct ArrayCell { - lu_byte tag[NM]; - Value value[NM]; -}; - - - -#define getArrTag(t,k) (&(t)->array[(k)/NM].tag[(k)%NM]) - - -#define getArrVal(t,k) (&(t)->array[(k)/NM].value[(k)%NM]) - - - -#define arr2obj(h,k,val) \ - ((val)->tt_ = *getArrTag(h,(k)-1u), (val)->value_ = *getArrVal(h,(k)-1u)) - -#define obj2arr(h,k,val) \ - (*getArrTag(h,(k)-1u) = (val)->tt_, *getArrVal(h,(k)-1u) = (val)->value_) - - - -#define farr2val(h,k,tag,res) \ - ((res)->tt_ = tag, (res)->value_ = *getArrVal(h,(k)-1u)) - -#define fval2arr(h,k,tag,val) \ - (*tag = (val)->tt_, *getArrVal(h,(k)-1u) = (val)->value_) - - -LUAI_FUNC int luaH_get (Table *t, const TValue *key, TValue *res); -LUAI_FUNC int luaH_getshortstr (Table *t, TString *key, TValue *res); -LUAI_FUNC int luaH_getstr (Table *t, TString *key, TValue *res); -LUAI_FUNC int luaH_getint (Table *t, lua_Integer key, TValue *res); - - -LUAI_FUNC const TValue *luaH_Hgetshortstr (Table *t, TString *key); - -LUAI_FUNC TString *luaH_getstrkey (Table *t, TString *key); - -LUAI_FUNC int luaH_psetint (Table *t, lua_Integer key, TValue *val); -LUAI_FUNC int luaH_psetshortstr (Table *t, TString *key, TValue *val); -LUAI_FUNC int luaH_psetstr (Table *t, TString *key, TValue *val); -LUAI_FUNC int luaH_pset (Table *t, const TValue *key, TValue *val); - -LUAI_FUNC void luaH_setint (lua_State *L, Table *t, lua_Integer key, - TValue *value); -LUAI_FUNC void luaH_set (lua_State *L, Table *t, const TValue *key, - TValue *value); - -LUAI_FUNC void luaH_finishset (lua_State *L, Table *t, const TValue *key, - TValue *value, int hres); -LUAI_FUNC Table *luaH_new (lua_State *L); -LUAI_FUNC void luaH_resize (lua_State *L, Table *t, unsigned nasize, - unsigned nhsize); -LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, unsigned nasize); -LUAI_FUNC void luaH_free (lua_State *L, Table *t); -LUAI_FUNC int luaH_next (lua_State *L, Table *t, StkId key); -LUAI_FUNC lua_Unsigned luaH_getn (Table *t); -LUAI_FUNC unsigned luaH_realasize (const Table *t); - - -#if defined(LUA_DEBUG) -LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key); -#endif - - -#endif - - -//path: src/imports/../dependencies/lua/lundump.h - - -#ifndef lundump_h -#define lundump_h - -#include - - - - - - - - - - -#define LUAC_DATA "\x19\x93\r\n\x1a\n" - -#define LUAC_INT 0x5678 -#define LUAC_NUM cast_num(370.5) - - -#define LUAC_VERSION (LUA_VERSION_MAJOR_N*16+LUA_VERSION_MINOR_N) - -#define LUAC_FORMAT 0 - - - -LUAI_FUNC LClosure* luaU_undump (lua_State* L, ZIO* Z, const char* name, - int fixed); - - -LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, - void* data, int strip); - -#endif - - - - - - -#if !defined(luai_verifycode) -#define luai_verifycode(L,f) -#endif - - -typedef struct { - lua_State *L; - ZIO *Z; - const char *name; - Table *h; - lu_mem offset; - lua_Integer nstr; - lu_byte fixed; -} LoadState; - - -static l_noret private_lua_error (LoadState *S, const char *why) { - luaO_pushfstring(S->L, "%s: bad binary format (%s)", S->name, why); - luaD_throw(S->L, LUA_ERRSYNTAX); -} - - - -#define loadVector(S,b,n) loadBlock(S,b,(n)*sizeof((b)[0])) - -static void loadBlock (LoadState *S, void *b, size_t size) { - if (luaZ_read(S->Z, b, size) != 0) - private_lua_error(S, "truncated chunk"); - S->offset += size; -} - - -static void loadAlign (LoadState *S, int align) { - int padding = align - (S->offset % align); - if (padding < align) { - lua_Integer paddingContent; - loadBlock(S, &paddingContent, padding); - lua_assert(S->offset % align == 0); - } -} - - -#define getaddr(S,n,t) cast(t *, getaddr_(S,(n) * sizeof(t))) - -static const void *getaddr_ (LoadState *S, size_t size) { - const void *block = luaZ_getaddr(S->Z, size); - S->offset += size; - if (block == NULL) - private_lua_error(S, "truncated fixed buffer"); - return block; -} - - -#define loadVar(S,x) loadVector(S,&x,1) - - -static lu_byte loadByte (LoadState *S) { - int b = zgetc(S->Z); - if (b == EOZ) - private_lua_error(S, "truncated chunk"); - S->offset++; - return cast_byte(b); -} - - -static size_t loadVarint (LoadState *S, size_t limit) { - size_t x = 0; - int b; - limit >>= 7; - do { - b = loadByte(S); - if (x > limit) - private_lua_error(S, "integer overflow"); - x = (x << 7) | (b & 0x7f); - } while ((b & 0x80) != 0); - return x; -} - - -static size_t loadSize (LoadState *S) { - return loadVarint(S, MAX_SIZET); -} - - -static int loadInt (LoadState *S) { - return cast_int(loadVarint(S, cast_sizet(INT_MAX))); -} - - -static lua_Number loadNumber (LoadState *S) { - lua_Number x; - loadVar(S, x); - return x; -} - - -static lua_Integer loadInteger (LoadState *S) { - lua_Integer x; - loadVar(S, x); - return x; -} - - - -static void loadString (LoadState *S, Proto *p, TString **sl) { - lua_State *L = S->L; - TString *ts; - TValue sv; - size_t size = loadSize(S); - if (size == 0) { - lua_assert(*sl == NULL); - return; - } - else if (size == 1) { - lua_Integer idx = cast(lua_Integer, loadSize(S)); - TValue stv; - luaH_getint(S->h, idx, &stv); - *sl = ts = tsvalue(&stv); - luaC_objbarrier(L, p, ts); - return; - } - else if ((size -= 2) <= LUAI_MAXSHORTLEN) { - char buff[LUAI_MAXSHORTLEN + 1]; - loadVector(S, buff, size + 1); - *sl = ts = luaS_newlstr(L, buff, size); - luaC_objbarrier(L, p, ts); - } - else if (S->fixed) { - const char *s = getaddr(S, size + 1, char); - *sl = ts = luaS_newextlstr(L, s, size, NULL, NULL); - luaC_objbarrier(L, p, ts); - } - else { - *sl = ts = luaS_createlngstrobj(L, size); - luaC_objbarrier(L, p, ts); - loadVector(S, getlngstr(ts), size + 1); - } - - S->nstr++; - setsvalue(L, &sv, ts); - luaH_setint(L, S->h, S->nstr, &sv); - luaC_objbarrierback(L, obj2gco(S->h), ts); -} - - -static void loadCode (LoadState *S, Proto *f) { - int n = loadInt(S); - loadAlign(S, sizeof(f->code[0])); - if (S->fixed) { - f->code = getaddr(S, n, Instruction); - f->sizecode = n; - } - else { - f->code = luaM_newvectorchecked(S->L, n, Instruction); - f->sizecode = n; - loadVector(S, f->code, n); - } -} - - -static void loadFunction(LoadState *S, Proto *f); - - -static void loadConstants (LoadState *S, Proto *f) { - int i; - int n = loadInt(S); - f->k = luaM_newvectorchecked(S->L, n, TValue); - f->sizek = n; - for (i = 0; i < n; i++) - setnilvalue(&f->k[i]); - for (i = 0; i < n; i++) { - TValue *o = &f->k[i]; - int t = loadByte(S); - switch (t) { - case LUA_VNIL: - setnilvalue(o); - break; - case LUA_VFALSE: - setbfvalue(o); - break; - case LUA_VTRUE: - setbtvalue(o); - break; - case LUA_VNUMFLT: - setfltvalue(o, loadNumber(S)); - break; - case LUA_VNUMINT: - setivalue(o, loadInteger(S)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - lua_assert(f->source == NULL); - loadString(S, f, &f->source); - if (f->source == NULL) - private_lua_error(S, "bad format for constant string"); - setsvalue2n(S->L, o, f->source); - f->source = NULL; - break; - } - default: lua_assert(0); - } - } -} - - -static void loadProtos (LoadState *S, Proto *f) { - int i; - int n = loadInt(S); - f->p = luaM_newvectorchecked(S->L, n, Proto *); - f->sizep = n; - for (i = 0; i < n; i++) - f->p[i] = NULL; - for (i = 0; i < n; i++) { - f->p[i] = luaF_newproto(S->L); - luaC_objbarrier(S->L, f, f->p[i]); - loadFunction(S, f->p[i]); - } -} - - - -static void loadUpvalues (LoadState *S, Proto *f) { - int i, n; - n = loadInt(S); - f->upvalues = luaM_newvectorchecked(S->L, n, Upvaldesc); - f->sizeupvalues = n; - for (i = 0; i < n; i++) - f->upvalues[i].name = NULL; - for (i = 0; i < n; i++) { - f->upvalues[i].instack = loadByte(S); - f->upvalues[i].idx = loadByte(S); - f->upvalues[i].kind = loadByte(S); - } -} - - -static void loadDebug (LoadState *S, Proto *f) { - int i, n; - n = loadInt(S); - if (S->fixed) { - f->lineinfo = getaddr(S, n, ls_byte); - f->sizelineinfo = n; - } - else { - f->lineinfo = luaM_newvectorchecked(S->L, n, ls_byte); - f->sizelineinfo = n; - loadVector(S, f->lineinfo, n); - } - n = loadInt(S); - if (n > 0) { - loadAlign(S, sizeof(int)); - if (S->fixed) { - f->abslineinfo = getaddr(S, n, AbsLineInfo); - f->sizeabslineinfo = n; - } - else { - f->abslineinfo = luaM_newvectorchecked(S->L, n, AbsLineInfo); - f->sizeabslineinfo = n; - loadVector(S, f->abslineinfo, n); - } - } - n = loadInt(S); - f->locvars = luaM_newvectorchecked(S->L, n, LocVar); - f->sizelocvars = n; - for (i = 0; i < n; i++) - f->locvars[i].varname = NULL; - for (i = 0; i < n; i++) { - loadString(S, f, &f->locvars[i].varname); - f->locvars[i].startpc = loadInt(S); - f->locvars[i].endpc = loadInt(S); - } - n = loadInt(S); - if (n != 0) - n = f->sizeupvalues; - for (i = 0; i < n; i++) - loadString(S, f, &f->upvalues[i].name); -} - - -static void loadFunction (LoadState *S, Proto *f) { - f->linedefined = loadInt(S); - f->lastlinedefined = loadInt(S); - f->numparams = loadByte(S); - f->flag = loadByte(S) & PF_ISVARARG; - if (S->fixed) - f->flag |= PF_FIXED; - f->maxstacksize = loadByte(S); - loadCode(S, f); - loadConstants(S, f); - loadUpvalues(S, f); - loadProtos(S, f); - loadString(S, f, &f->source); - loadDebug(S, f); -} - - -static void checkliteral (LoadState *S, const char *s, const char *msg) { - char buff[sizeof(LUA_SIGNATURE) + sizeof(LUAC_DATA)]; - size_t len = strlen(s); - loadVector(S, buff, len); - if (memcmp(s, buff, len) != 0) - private_lua_error(S, msg); -} - - -static void fchecksize (LoadState *S, size_t size, const char *tname) { - if (loadByte(S) != size) - private_lua_error(S, luaO_pushfstring(S->L, "%s size mismatch", tname)); -} - - -#define checksize(S,t) fchecksize(S,sizeof(t),#t) - -static void checkHeader (LoadState *S) { - - checkliteral(S, &LUA_SIGNATURE[1], "not a binary chunk"); - if (loadByte(S) != LUAC_VERSION) - private_lua_error(S, "version mismatch"); - if (loadByte(S) != LUAC_FORMAT) - private_lua_error(S, "format mismatch"); - checkliteral(S, LUAC_DATA, "corrupted chunk"); - checksize(S, Instruction); - checksize(S, lua_Integer); - checksize(S, lua_Number); - if (loadInteger(S) != LUAC_INT) - private_lua_error(S, "integer format mismatch"); - if (loadNumber(S) != LUAC_NUM) - private_lua_error(S, "float format mismatch"); -} - - - -LClosure *luaU_undump (lua_State *L, ZIO *Z, const char *name, int fixed) { - LoadState S; - LClosure *cl; - if (*name == '@' || *name == '=') - S.name = name + 1; - else if (*name == LUA_SIGNATURE[0]) - S.name = "binary string"; - else - S.name = name; - S.L = L; - S.Z = Z; - S.fixed = fixed; - S.offset = 1; - checkHeader(&S); - cl = luaF_newLclosure(L, loadByte(&S)); - setclLvalue2s(L, L->top.p, cl); - luaD_inctop(L); - S.h = luaH_new(L); - S.nstr = 0; - sethvalue2s(L, L->top.p, S.h); - luaD_inctop(L); - cl->p = luaF_newproto(L); - luaC_objbarrier(L, cl, cl->p); - loadFunction(&S, cl->p); - lua_assert(cl->nupvalues == cl->p->sizeupvalues); - luai_verifycode(L, cl->p); - L->top.p--; - return cl; -} - - - -//path: src/imports/../dependencies/lua/ldump.c - - -#define ldump_c -#define LUA_CORE - - - - - -#include -#include - - - - - - - - - - - - - - - - -typedef struct { - lua_State *L; - lua_Writer writer; - void *data; - lu_mem offset; - int strip; - int status; - Table *h; - lua_Integer nstr; -} DumpState; - - - -#define dumpVector(D,v,n) dumpBlock(D,v,(n)*sizeof((v)[0])) - -#define dumpLiteral(D, s) dumpBlock(D,s,sizeof(s) - sizeof(char)) - - - -static void dumpBlock (DumpState *D, const void *b, size_t size) { - if (D->status == 0) { - lua_unlock(D->L); - D->status = (*D->writer)(D->L, b, size, D->data); - lua_lock(D->L); - D->offset += size; - } -} - - - -static void dumpAlign (DumpState *D, int align) { - int padding = align - (D->offset % align); - if (padding < align) { - static lua_Integer paddingContent = 0; - lua_assert(cast_uint(align) <= sizeof(lua_Integer)); - dumpBlock(D, &paddingContent, padding); - } - lua_assert(D->offset % align == 0); -} - - -#define dumpVar(D,x) dumpVector(D,&x,1) - - -static void dumpByte (DumpState *D, int y) { - lu_byte x = (lu_byte)y; - dumpVar(D, x); -} - - - -#define DIBS ((sizeof(size_t) * CHAR_BIT + 6) / 7) - - -static void dumpVarint (DumpState *D, size_t x) { - lu_byte buff[DIBS]; - int n = 1; - buff[DIBS - 1] = x & 0x7f; - while ((x >>= 7) != 0) - buff[DIBS - (++n)] = (x & 0x7f) | 0x80; - dumpVector(D, buff + DIBS - n, n); -} - - -static void dumpSize (DumpState *D, size_t sz) { - dumpVarint(D, sz); -} - -static void dumpInt (DumpState *D, int x) { - lua_assert(x >= 0); - dumpVarint(D, cast(size_t, x)); -} - - -static void dumpNumber (DumpState *D, lua_Number x) { - dumpVar(D, x); -} - - -static void dumpInteger (DumpState *D, lua_Integer x) { - dumpVar(D, x); -} - - - -static void dumpString (DumpState *D, TString *ts) { - if (ts == NULL) - dumpSize(D, 0); - else { - TValue idx; - int tag = luaH_getstr(D->h, ts, &idx); - if (!tagisempty(tag)) { - dumpSize(D, 1); - dumpSize(D, cast_sizet(ivalue(&idx))); - } - else { - TValue key, value; - size_t size; - const char *s = getlstr(ts, size); - dumpSize(D, size + 2); - dumpVector(D, s, size + 1); - D->nstr++; - setsvalue(D->L, &key, ts); - setivalue(&value, D->nstr); - luaH_set(D->L, D->h, &key, &value); - - } - } -} - - -static void dumpCode (DumpState *D, const Proto *f) { - dumpInt(D, f->sizecode); - dumpAlign(D, sizeof(f->code[0])); - lua_assert(f->code != NULL); - dumpVector(D, f->code, f->sizecode); -} - - -static void dumpFunction (DumpState *D, const Proto *f); - -static void dumpConstants (DumpState *D, const Proto *f) { - int i; - int n = f->sizek; - dumpInt(D, n); - for (i = 0; i < n; i++) { - const TValue *o = &f->k[i]; - int tt = ttypetag(o); - dumpByte(D, tt); - switch (tt) { - case LUA_VNUMFLT: - dumpNumber(D, fltvalue(o)); - break; - case LUA_VNUMINT: - dumpInteger(D, ivalue(o)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - dumpString(D, tsvalue(o)); - break; - default: - lua_assert(tt == LUA_VNIL || tt == LUA_VFALSE || tt == LUA_VTRUE); - } - } -} - - -static void dumpProtos (DumpState *D, const Proto *f) { - int i; - int n = f->sizep; - dumpInt(D, n); - for (i = 0; i < n; i++) - dumpFunction(D, f->p[i]); -} - - -static void dumpUpvalues (DumpState *D, const Proto *f) { - int i, n = f->sizeupvalues; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpByte(D, f->upvalues[i].instack); - dumpByte(D, f->upvalues[i].idx); - dumpByte(D, f->upvalues[i].kind); - } -} - - -static void dumpDebug (DumpState *D, const Proto *f) { - int i, n; - n = (D->strip) ? 0 : f->sizelineinfo; - dumpInt(D, n); - if (f->lineinfo != NULL) - dumpVector(D, f->lineinfo, n); - n = (D->strip) ? 0 : f->sizeabslineinfo; - dumpInt(D, n); - if (n > 0) { - - dumpAlign(D, sizeof(int)); - dumpVector(D, f->abslineinfo, n); - } - n = (D->strip) ? 0 : f->sizelocvars; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpString(D, f->locvars[i].varname); - dumpInt(D, f->locvars[i].startpc); - dumpInt(D, f->locvars[i].endpc); - } - n = (D->strip) ? 0 : f->sizeupvalues; - dumpInt(D, n); - for (i = 0; i < n; i++) - dumpString(D, f->upvalues[i].name); -} - - -static void dumpFunction (DumpState *D, const Proto *f) { - dumpInt(D, f->linedefined); - dumpInt(D, f->lastlinedefined); - dumpByte(D, f->numparams); - dumpByte(D, f->flag); - dumpByte(D, f->maxstacksize); - dumpCode(D, f); - dumpConstants(D, f); - dumpUpvalues(D, f); - dumpProtos(D, f); - dumpString(D, D->strip ? NULL : f->source); - dumpDebug(D, f); -} - - -static void dumpHeader (DumpState *D) { - dumpLiteral(D, LUA_SIGNATURE); - dumpByte(D, LUAC_VERSION); - dumpByte(D, LUAC_FORMAT); - dumpLiteral(D, LUAC_DATA); - dumpByte(D, sizeof(Instruction)); - dumpByte(D, sizeof(lua_Integer)); - dumpByte(D, sizeof(lua_Number)); - dumpInteger(D, LUAC_INT); - dumpNumber(D, LUAC_NUM); -} - - - -int luaU_dump (lua_State *L, const Proto *f, lua_Writer w, void *data, - int strip) { - DumpState D; - D.h = luaH_new(L); - sethvalue2s(L, L->top.p, D.h); - L->top.p++; - D.L = L; - D.writer = w; - D.offset = 0; - D.data = data; - D.strip = strip; - D.status = 0; - D.nstr = 0; - dumpHeader(&D); - dumpByte(&D, f->sizeupvalues); - dumpFunction(&D, f); - dumpBlock(&D, NULL, 0); - return D.status; -} - - - -//path: src/imports/../dependencies/lua/lstate.c - - -#define lstate_c -#define LUA_CORE - - - - - -#include -#include - - - - -//path: src/imports/../dependencies/lua/lapi.h - - -#ifndef lapi_h -#define lapi_h - - - - - - - - - -#define api_incr_top(L) \ - (L->top.p++, api_check(L, L->top.p <= L->ci->top.p, "stack overflow")) - - - -#define adjustresults(L,nres) \ - { if ((nres) <= LUA_MULTRET && L->ci->top.p < L->top.p) \ - L->ci->top.p = L->top.p; } - - - -#define api_checknelems(L,n) \ - api_check(L, (n) < (L->top.p - L->ci->func.p), \ - "not enough elements in the stack") - - - -#define api_checkpop(L,n) \ - api_check(L, (n) < L->top.p - L->ci->func.p && \ - L->tbclist.p < L->top.p - (n), \ - "not enough free elements in the stack") - - - - -#define hastocloseCfunc(n) ((n) < LUA_MULTRET) - - -#define codeNresults(n) (-(n) - 3) -#define decodeNresults(n) (-(n) - 3) - -#endif - - - - - - - - - - -//path: src/imports/../dependencies/lua/llex.h - - -#ifndef llex_h -#define llex_h - -#include - - - - - - - - -#define FIRST_RESERVED (UCHAR_MAX + 1) - - -#if !defined(LUA_ENV) -#define LUA_ENV "_ENV" -#endif - - - -enum RESERVED { - - TK_AND = FIRST_RESERVED, TK_BREAK, - TK_DO, TK_ELSE, TK_ELSEIF, TK_END, TK_FALSE, TK_FOR, TK_FUNCTION, - TK_GOTO, TK_IF, TK_IN, TK_LOCAL, TK_NIL, TK_NOT, TK_OR, TK_REPEAT, - TK_RETURN, TK_THEN, TK_TRUE, TK_UNTIL, TK_WHILE, - - TK_IDIV, TK_CONCAT, TK_DOTS, TK_EQ, TK_GE, TK_LE, TK_NE, - TK_SHL, TK_SHR, - TK_DBCOLON, TK_EOS, - TK_FLT, TK_INT, TK_NAME, TK_STRING -}; - - -#define NUM_RESERVED (cast_int(TK_WHILE-FIRST_RESERVED + 1)) - - -typedef union { - lua_Number r; - lua_Integer i; - TString *ts; -} SemInfo; - - -typedef struct Token { - int token; - SemInfo seminfo; -} Token; - - - -typedef struct LexState { - int current; - int linenumber; - int lastline; - Token t; - Token lookahead; - struct FuncState *fs; - struct lua_State *L; - ZIO *z; - Mbuffer *buff; - Table *h; - struct Dyndata *dyd; - TString *source; - TString *envn; -} LexState; - - -LUAI_FUNC void luaX_init (lua_State *L); -LUAI_FUNC void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, - TString *source, int firstchar); -LUAI_FUNC TString *luaX_newstring (LexState *ls, const char *str, size_t l); -LUAI_FUNC void luaX_next (LexState *ls); -LUAI_FUNC int luaX_lookahead (LexState *ls); -LUAI_FUNC l_noret luaX_syntaxerror (LexState *ls, const char *s); -LUAI_FUNC const char *luaX_token2str (LexState *ls, int token); - - -#endif - - - - - - - - - - - - - - - - -typedef struct LX { - lu_byte extra_[LUA_EXTRASPACE]; - lua_State l; -} LX; - - - -typedef struct LG { - LX l; - global_State g; -} LG; - - - -#define fromstate(L) (cast(LX *, cast(lu_byte *, (L)) - offsetof(LX, l))) - - - -void luaE_setdebt (global_State *g, l_obj debt) { - l_obj tb = gettotalobjs(g); - lua_assert(tb > 0); - if (debt > MAX_LOBJ - tb) - debt = MAX_LOBJ - tb; - g->totalobjs = tb + debt; - g->GCdebt = debt; -} - - -CallInfo *luaE_extendCI (lua_State *L) { - CallInfo *ci; - lua_assert(L->ci->next == NULL); - ci = luaM_new(L, CallInfo); - lua_assert(L->ci->next == NULL); - L->ci->next = ci; - ci->previous = L->ci; - ci->next = NULL; - ci->u.l.trap = 0; - L->nci++; - return ci; -} - - - -static void freeCI (lua_State *L) { - CallInfo *ci = L->ci; - CallInfo *next = ci->next; - ci->next = NULL; - while ((ci = next) != NULL) { - next = ci->next; - luaM_free(L, ci); - L->nci--; - } -} - - - -void luaE_shrinkCI (lua_State *L) { - CallInfo *ci = L->ci->next; - CallInfo *next; - if (ci == NULL) - return; - while ((next = ci->next) != NULL) { - CallInfo *next2 = next->next; - ci->next = next2; - L->nci--; - luaM_free(L, next); - if (next2 == NULL) - break; - else { - next2->previous = ci; - ci = next2; - } - } -} - - - -void luaE_checkcstack (lua_State *L) { - if (getCcalls(L) == LUAI_MAXCCALLS) - luaG_runerror(L, "C stack overflow"); - else if (getCcalls(L) >= (LUAI_MAXCCALLS / 10 * 11)) - luaD_throw(L, LUA_ERRERR); -} - - -LUAI_FUNC void luaE_incCstack (lua_State *L) { - L->nCcalls++; - if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) - luaE_checkcstack(L); -} - - -static void stack_init (lua_State *L1, lua_State *L) { - int i; CallInfo *ci; - - L1->stack.p = luaM_newvector(L, BASIC_STACK_SIZE + EXTRA_STACK, StackValue); - L1->tbclist.p = L1->stack.p; - for (i = 0; i < BASIC_STACK_SIZE + EXTRA_STACK; i++) - setnilvalue(s2v(L1->stack.p + i)); - L1->top.p = L1->stack.p; - L1->stack_last.p = L1->stack.p + BASIC_STACK_SIZE; - - ci = &L1->base_ci; - ci->next = ci->previous = NULL; - ci->callstatus = CIST_C; - ci->func.p = L1->top.p; - ci->u.c.k = NULL; - ci->nresults = 0; - setnilvalue(s2v(L1->top.p)); - L1->top.p++; - ci->top.p = L1->top.p + LUA_MINSTACK; - L1->ci = ci; -} - - -static void freestack (lua_State *L) { - if (L->stack.p == NULL) - return; - L->ci = &L->base_ci; - freeCI(L); - lua_assert(L->nci == 0); - luaM_freearray(L, L->stack.p, stacksize(L) + EXTRA_STACK); -} - - - -static void init_registry (lua_State *L, global_State *g) { - - TValue aux; - Table *registry = luaH_new(L); - sethvalue(L, &g->l_registry, registry); - luaH_resize(L, registry, LUA_RIDX_LAST, 0); - - setbfvalue(&aux); - luaH_setint(L, registry, 1, &aux); - - setthvalue(L, &aux, L); - luaH_setint(L, registry, LUA_RIDX_MAINTHREAD, &aux); - - sethvalue(L, &aux, luaH_new(L)); - luaH_setint(L, registry, LUA_RIDX_GLOBALS, &aux); -} - - - -static void f_luaopen (lua_State *L, void *ud) { - global_State *g = G(L); - UNUSED(ud); - stack_init(L, L); - init_registry(L, g); - luaS_init(L); - luaT_init(L); - luaX_init(L); - g->gcstp = 0; - setnilvalue(&g->nilvalue); - luai_userstateopen(L); -} - - - -static void preinit_thread (lua_State *L, global_State *g) { - G(L) = g; - L->stack.p = NULL; - L->ci = NULL; - L->nci = 0; - L->twups = L; - L->nCcalls = 0; - L->errorJmp = NULL; - L->hook = NULL; - L->hookmask = 0; - L->basehookcount = 0; - L->allowhook = 1; - resethookcount(L); - L->openupval = NULL; - L->status = LUA_OK; - L->errfunc = 0; - L->oldpc = 0; -} - - -static void close_state (lua_State *L) { - global_State *g = G(L); - if (!completestate(g)) - luaC_freeallobjects(L); - else { - L->ci = &L->base_ci; - luaD_closeprotected(L, 1, LUA_OK); - luaC_freeallobjects(L); - luai_userstateclose(L); - } - luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size); - freestack(L); - lua_assert(g->totalbytes == sizeof(LG)); - lua_assert(gettotalobjs(g) == 1); - (*g->frealloc)(g->ud, fromstate(L), sizeof(LG), 0); -} - - -LUA_API lua_State *lua_newthread (lua_State *L) { - global_State *g = G(L); - GCObject *o; - lua_State *L1; - lua_lock(L); - luaC_checkGC(L); - - o = luaC_newobjdt(L, LUA_TTHREAD, sizeof(LX), offsetof(LX, l)); - L1 = gco2th(o); - - setthvalue2s(L, L->top.p, L1); - api_incr_top(L); - preinit_thread(L1, g); - L1->hookmask = L->hookmask; - L1->basehookcount = L->basehookcount; - L1->hook = L->hook; - resethookcount(L1); - - memcpy(lua_getextraspace(L1), lua_getextraspace(g->mainthread), - LUA_EXTRASPACE); - luai_userstatethread(L, L1); - stack_init(L1, L); - lua_unlock(L); - return L1; -} - - -void luaE_freethread (lua_State *L, lua_State *L1) { - LX *l = fromstate(L1); - luaF_closeupval(L1, L1->stack.p); - lua_assert(L1->openupval == NULL); - luai_userstatefree(L, L1); - freestack(L1); - luaM_free(L, l); -} - - -int luaE_resetthread (lua_State *L, int status) { - CallInfo *ci = L->ci = &L->base_ci; - setnilvalue(s2v(L->stack.p)); - ci->func.p = L->stack.p; - ci->callstatus = CIST_C; - if (status == LUA_YIELD) - status = LUA_OK; - L->status = LUA_OK; - status = luaD_closeprotected(L, 1, status); - if (status != LUA_OK) - luaD_seterrorobj(L, status, L->stack.p + 1); - else - L->top.p = L->stack.p + 1; - ci->top.p = L->top.p + LUA_MINSTACK; - luaD_reallocstack(L, cast_int(ci->top.p - L->stack.p), 0); - return status; -} - - -LUA_API int lua_closethread (lua_State *L, lua_State *from) { - int status; - lua_lock(L); - L->nCcalls = (from) ? getCcalls(from) : 0; - status = luaE_resetthread(L, L->status); - lua_unlock(L); - return status; -} - - -LUA_API lua_State *lua_newstate (lua_Alloc f, void *ud, unsigned seed) { - int i; - lua_State *L; - global_State *g; - LG *l = cast(LG *, (*f)(ud, NULL, LUA_TTHREAD, sizeof(LG))); - if (l == NULL) return NULL; - L = &l->l.l; - g = &l->g; - L->tt = LUA_VTHREAD; - g->currentwhite = bitmask(WHITE0BIT); - L->marked = luaC_white(g); - preinit_thread(L, g); - g->allgc = obj2gco(L); - L->next = NULL; - incnny(L); - g->frealloc = f; - g->ud = ud; - g->warnf = NULL; - g->ud_warn = NULL; - g->mainthread = L; - g->seed = seed; - g->gcstp = GCSTPGC; - g->strt.size = g->strt.nuse = 0; - g->strt.hash = NULL; - setnilvalue(&g->l_registry); - g->panic = NULL; - g->gcstate = GCSpause; - g->gckind = KGC_INC; - g->gcstopem = 0; - g->gcemergency = 0; - g->finobj = g->tobefnz = g->fixedgc = NULL; - g->firstold1 = g->survival = g->old1 = g->reallyold = NULL; - g->finobjsur = g->finobjold1 = g->finobjrold = NULL; - g->sweepgc = NULL; - g->gray = g->grayagain = NULL; - g->weak = g->ephemeron = g->allweak = NULL; - g->twups = NULL; - g->totalbytes = sizeof(LG); - g->totalobjs = 1; - g->marked = 0; - g->GCdebt = 0; - setivalue(&g->nilvalue, 0); - setgcparam(g, PAUSE, LUAI_GCPAUSE); - setgcparam(g, STEPMUL, LUAI_GCMUL); - setgcparam(g, STEPSIZE, LUAI_GCSTEPSIZE); - setgcparam(g, MINORMUL, LUAI_GENMINORMUL); - setgcparam(g, MINORMAJOR, LUAI_MINORMAJOR); - setgcparam(g, MAJORMINOR, LUAI_MAJORMINOR); - for (i=0; i < LUA_NUMTYPES; i++) g->mt[i] = NULL; - if (luaD_rawrunprotected(L, f_luaopen, NULL) != LUA_OK) { - - close_state(L); - L = NULL; - } - return L; -} - - -LUA_API void lua_close (lua_State *L) { - lua_lock(L); - L = G(L)->mainthread; - close_state(L); -} - - -void luaE_warning (lua_State *L, const char *msg, int tocont) { - lua_WarnFunction wf = G(L)->warnf; - if (wf != NULL) - wf(G(L)->ud_warn, msg, tocont); -} - - - -void luaE_warnerror (lua_State *L, const char *where) { - TValue *errobj = s2v(L->top.p - 1); - const char *msg = (ttisstring(errobj)) - ? getstr(tsvalue(errobj)) - : "private_lua_error object is not a string"; - - luaE_warning(L, "private_lua_error in ", 1); - luaE_warning(L, where, 1); - luaE_warning(L, " (", 1); - luaE_warning(L, msg, 1); - luaE_warning(L, ")", 0); -} - - - -//path: src/imports/../dependencies/lua/lgc.c - - -#define lgc_c -#define LUA_CORE - - - - -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -#define NFIXED (TM_N + NUM_RESERVED + 2) - - - -#define GCSWEEPMAX 20 - - - -#define maskcolors (bitmask(BLACKBIT) | WHITEBITS) - - -#define maskgcbits (maskcolors | AGEBITS) - - - -#define makewhite(g,x) \ - (x->marked = cast_byte((x->marked & ~maskcolors) | luaC_white(g))) - - -#define set2gray(x) resetbits(x->marked, maskcolors) - - - -#define set2black(x) \ - (x->marked = cast_byte((x->marked & ~WHITEBITS) | bitmask(BLACKBIT))) - - -#define valiswhite(x) (iscollectable(x) && iswhite(gcvalue(x))) - -#define keyiswhite(n) (keyiscollectable(n) && iswhite(gckey(n))) - - - -#define gcvalueN(o) (iscollectable(o) ? gcvalue(o) : NULL) - - - -#define gcvalarr(t,i) \ - ((*getArrTag(t,i) & BIT_ISCOLLECTABLE) ? getArrVal(t,i)->gc : NULL) - - -#define markvalue(g,o) { checkliveness(g->mainthread,o); \ - if (valiswhite(o)) reallymarkobject(g,gcvalue(o)); } - -#define markkey(g, n) { if keyiswhite(n) reallymarkobject(g,gckey(n)); } - -#define markobject(g,t) { if (iswhite(t)) reallymarkobject(g, obj2gco(t)); } - - -#define markobjectN(g,t) { if (t) markobject(g,t); } - - -static void reallymarkobject (global_State *g, GCObject *o); -static l_obj atomic (lua_State *L); -static void entersweep (lua_State *L); - - - - - - -#define gnodelast(h) gnode(h, cast_sizet(sizenode(h))) - - -static GCObject **getgclist (GCObject *o) { - switch (o->tt) { - case LUA_VTABLE: return &gco2t(o)->gclist; - case LUA_VLCL: return &gco2lcl(o)->gclist; - case LUA_VCCL: return &gco2ccl(o)->gclist; - case LUA_VTHREAD: return &gco2th(o)->gclist; - case LUA_VPROTO: return &gco2p(o)->gclist; - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - lua_assert(u->nuvalue > 0); - return &u->gclist; - } - default: lua_assert(0); return 0; - } -} - - - -#define linkgclist(o,p) linkgclist_(obj2gco(o), &(o)->gclist, &(p)) - -static void linkgclist_ (GCObject *o, GCObject **pnext, GCObject **list) { - lua_assert(!isgray(o)); - *pnext = *list; - *list = o; - set2gray(o); -} - - - -#define linkobjgclist(o,p) linkgclist_(obj2gco(o), getgclist(o), &(p)) - - - - -static void clearkey (Node *n) { - lua_assert(isempty(gval(n))); - if (keyiscollectable(n)) - setdeadkey(n); -} - - - -static int iscleared (global_State *g, const GCObject *o) { - if (o == NULL) return 0; - else if (novariant(o->tt) == LUA_TSTRING) { - markobject(g, o); - return 0; - } - else return iswhite(o); -} - - - -void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v) { - global_State *g = G(L); - lua_assert(isblack(o) && iswhite(v) && !isdead(g, v) && !isdead(g, o)); - if (keepinvariant(g)) { - reallymarkobject(g, v); - if (isold(o)) { - lua_assert(!isold(v)); - setage(v, G_OLD0); - } - } - else { - lua_assert(issweepphase(g)); - if (g->gckind != KGC_GENMINOR) - makewhite(g, o); - } -} - - - -void luaC_barrierback_ (lua_State *L, GCObject *o) { - global_State *g = G(L); - lua_assert(isblack(o) && !isdead(g, o)); - lua_assert((g->gckind != KGC_GENMINOR) - || (isold(o) && getage(o) != G_TOUCHED1)); - if (getage(o) == G_TOUCHED2) - set2gray(o); - else - linkobjgclist(o, g->grayagain); - if (isold(o)) - setage(o, G_TOUCHED1); -} - - -void luaC_fix (lua_State *L, GCObject *o) { - global_State *g = G(L); - lua_assert(g->allgc == o); - set2gray(o); - setage(o, G_OLD); - g->allgc = o->next; - o->next = g->fixedgc; - g->fixedgc = o; -} - - - -GCObject *luaC_newobjdt (lua_State *L, int tt, size_t sz, size_t offset) { - global_State *g = G(L); - char *p = cast_charp(luaM_newobject(L, novariant(tt), sz)); - GCObject *o = cast(GCObject *, p + offset); - g->GCdebt--; - o->marked = luaC_white(g); - o->tt = tt; - o->next = g->allgc; - g->allgc = o; - return o; -} - - - -GCObject *luaC_newobj (lua_State *L, int tt, size_t sz) { - return luaC_newobjdt(L, tt, sz, 0); -} - - - - - - - - - -static void reallymarkobject (global_State *g, GCObject *o) { - g->marked++; - switch (o->tt) { - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - set2black(o); - break; - } - case LUA_VUPVAL: { - UpVal *uv = gco2upv(o); - if (upisopen(uv)) - set2gray(uv); - else - set2black(uv); - markvalue(g, uv->v.p); - break; - } - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - if (u->nuvalue == 0) { - markobjectN(g, u->metatable); - set2black(u); - break; - } - - } - case LUA_VLCL: case LUA_VCCL: case LUA_VTABLE: - case LUA_VTHREAD: case LUA_VPROTO: { - linkobjgclist(o, g->gray); - break; - } - default: lua_assert(0); break; - } -} - - - -static void markmt (global_State *g) { - int i; - for (i=0; i < LUA_NUMTYPES; i++) - markobjectN(g, g->mt[i]); -} - - - -static l_obj markbeingfnz (global_State *g) { - GCObject *o; - l_obj count = 0; - for (o = g->tobefnz; o != NULL; o = o->next) { - count++; - markobject(g, o); - } - return count; -} - - - -static l_obj remarkupvals (global_State *g) { - l_obj work = 0; - lua_State *thread; - lua_State **p = &g->twups; - while ((thread = *p) != NULL) { - if (!iswhite(thread) && thread->openupval != NULL) - p = &thread->twups; - else { - UpVal *uv; - lua_assert(!isold(thread) || thread->openupval == NULL); - *p = thread->twups; - thread->twups = thread; - for (uv = thread->openupval; uv != NULL; uv = uv->u.open.next) { - lua_assert(getage(uv) <= getage(thread)); - if (!iswhite(uv)) { - lua_assert(upisopen(uv) && isgray(uv)); - markvalue(g, uv->v.p); - } - } - } - work++; - } - return work; -} - - -static void cleargraylists (global_State *g) { - g->gray = g->grayagain = NULL; - g->weak = g->allweak = g->ephemeron = NULL; -} - - - -static void restartcollection (global_State *g) { - cleargraylists(g); - g->marked = NFIXED; - markobject(g, g->mainthread); - markvalue(g, &g->l_registry); - markmt(g); - markbeingfnz(g); -} - - - - - - - - -static void genlink (global_State *g, GCObject *o) { - lua_assert(isblack(o)); - if (getage(o) == G_TOUCHED1) { - linkobjgclist(o, g->grayagain); - } - else if (getage(o) == G_TOUCHED2) - setage(o, G_OLD); -} - - - -static void traverseweakvalue (global_State *g, Table *h) { - Node *n, *limit = gnodelast(h); - - int hasclears = (h->alimit > 0); - for (n = gnode(h, 0); n < limit; n++) { - if (isempty(gval(n))) - clearkey(n); - else { - lua_assert(!keyisnil(n)); - markkey(g, n); - if (!hasclears && iscleared(g, gcvalueN(gval(n)))) - hasclears = 1; - } - } - if (g->gcstate == GCSatomic && hasclears) - linkgclist(h, g->weak); - else - linkgclist(h, g->grayagain); -} - - - -static int traversearray (global_State *g, Table *h) { - unsigned asize = luaH_realasize(h); - int marked = 0; - unsigned i; - for (i = 0; i < asize; i++) { - GCObject *o = gcvalarr(h, i); - if (o != NULL && iswhite(o)) { - marked = 1; - reallymarkobject(g, o); - } - } - return marked; -} - - - -static int traverseephemeron (global_State *g, Table *h, int inv) { - int hasclears = 0; - int hasww = 0; - unsigned int i; - unsigned int nsize = sizenode(h); - int marked = traversearray(g, h); - - for (i = 0; i < nsize; i++) { - Node *n = inv ? gnode(h, nsize - 1 - i) : gnode(h, i); - if (isempty(gval(n))) - clearkey(n); - else if (iscleared(g, gckeyN(n))) { - hasclears = 1; - if (valiswhite(gval(n))) - hasww = 1; - } - else if (valiswhite(gval(n))) { - marked = 1; - reallymarkobject(g, gcvalue(gval(n))); - } - } - - if (g->gcstate == GCSpropagate) - linkgclist(h, g->grayagain); - else if (hasww) - linkgclist(h, g->ephemeron); - else if (hasclears) - linkgclist(h, g->allweak); - else - genlink(g, obj2gco(h)); - return marked; -} - - -static void traversestrongtable (global_State *g, Table *h) { - Node *n, *limit = gnodelast(h); - traversearray(g, h); - for (n = gnode(h, 0); n < limit; n++) { - if (isempty(gval(n))) - clearkey(n); - else { - lua_assert(!keyisnil(n)); - markkey(g, n); - markvalue(g, gval(n)); - } - } - genlink(g, obj2gco(h)); -} - - -static void traversetable (global_State *g, Table *h) { - const char *weakkey, *weakvalue; - const TValue *mode = gfasttm(g, h->metatable, TM_MODE); - TString *smode; - markobjectN(g, h->metatable); - if (mode && ttisshrstring(mode) && - (cast_void(smode = tsvalue(mode)), - cast_void(weakkey = strchr(getshrstr(smode), 'k')), - cast_void(weakvalue = strchr(getshrstr(smode), 'v')), - (weakkey || weakvalue))) { - if (!weakkey) - traverseweakvalue(g, h); - else if (!weakvalue) - traverseephemeron(g, h, 0); - else - linkgclist(h, g->allweak); - } - else - traversestrongtable(g, h); -} - - -static void traverseudata (global_State *g, Udata *u) { - int i; - markobjectN(g, u->metatable); - for (i = 0; i < u->nuvalue; i++) - markvalue(g, &u->uv[i].uv); - genlink(g, obj2gco(u)); -} - - - -static void traverseproto (global_State *g, Proto *f) { - int i; - markobjectN(g, f->source); - for (i = 0; i < f->sizek; i++) - markvalue(g, &f->k[i]); - for (i = 0; i < f->sizeupvalues; i++) - markobjectN(g, f->upvalues[i].name); - for (i = 0; i < f->sizep; i++) - markobjectN(g, f->p[i]); - for (i = 0; i < f->sizelocvars; i++) - markobjectN(g, f->locvars[i].varname); -} - - -static void traverseCclosure (global_State *g, CClosure *cl) { - int i; - for (i = 0; i < cl->nupvalues; i++) - markvalue(g, &cl->upvalue[i]); -} - - -static void traverseLclosure (global_State *g, LClosure *cl) { - int i; - markobjectN(g, cl->p); - for (i = 0; i < cl->nupvalues; i++) { - UpVal *uv = cl->upvals[i]; - markobjectN(g, uv); - } -} - - - -static void traversethread (global_State *g, lua_State *th) { - UpVal *uv; - StkId o = th->stack.p; - if (isold(th) || g->gcstate == GCSpropagate) - linkgclist(th, g->grayagain); - if (o == NULL) - return; - lua_assert(g->gcstate == GCSatomic || - th->openupval == NULL || isintwups(th)); - for (; o < th->top.p; o++) - markvalue(g, s2v(o)); - for (uv = th->openupval; uv != NULL; uv = uv->u.open.next) - markobject(g, uv); - if (g->gcstate == GCSatomic) { - if (!g->gcemergency) - luaD_shrinkstack(th); - for (o = th->top.p; o < th->stack_last.p + EXTRA_STACK; o++) - setnilvalue(s2v(o)); - - if (!isintwups(th) && th->openupval != NULL) { - th->twups = g->twups; - g->twups = th; - } - } -} - - - -static void propagatemark (global_State *g) { - GCObject *o = g->gray; - nw2black(o); - g->gray = *getgclist(o); - switch (o->tt) { - case LUA_VTABLE: traversetable(g, gco2t(o)); break; - case LUA_VUSERDATA: traverseudata(g, gco2u(o)); break; - case LUA_VLCL: traverseLclosure(g, gco2lcl(o)); break; - case LUA_VCCL: traverseCclosure(g, gco2ccl(o)); break; - case LUA_VPROTO: traverseproto(g, gco2p(o)); break; - case LUA_VTHREAD: traversethread(g, gco2th(o)); break; - default: lua_assert(0); - } -} - - -static l_obj propagateall (global_State *g) { - l_obj work = 0; - while (g->gray) { - propagatemark(g); - work++; - } - return work; -} - - - -static l_obj convergeephemerons (global_State *g) { - int changed; - l_obj work = 0; - int dir = 0; - do { - GCObject *w; - GCObject *next = g->ephemeron; - g->ephemeron = NULL; - changed = 0; - while ((w = next) != NULL) { - Table *h = gco2t(w); - next = h->gclist; - nw2black(h); - if (traverseephemeron(g, h, dir)) { - propagateall(g); - changed = 1; - } - work++; - } - dir = !dir; - } while (changed); - return work; -} - - - - - - - - -static l_obj clearbykeys (global_State *g, GCObject *l) { - l_obj work = 0; - for (; l; l = gco2t(l)->gclist) { - Table *h = gco2t(l); - Node *limit = gnodelast(h); - Node *n; - for (n = gnode(h, 0); n < limit; n++) { - if (iscleared(g, gckeyN(n))) - setempty(gval(n)); - if (isempty(gval(n))) - clearkey(n); - } - work++; - } - return work; -} - - - -static l_obj clearbyvalues (global_State *g, GCObject *l, GCObject *f) { - l_obj work = 0; - for (; l != f; l = gco2t(l)->gclist) { - Table *h = gco2t(l); - Node *n, *limit = gnodelast(h); - unsigned int i; - unsigned int asize = luaH_realasize(h); - for (i = 0; i < asize; i++) { - GCObject *o = gcvalarr(h, i); - if (iscleared(g, o)) - *getArrTag(h, i) = LUA_VEMPTY; - } - for (n = gnode(h, 0); n < limit; n++) { - if (iscleared(g, gcvalueN(gval(n)))) - setempty(gval(n)); - if (isempty(gval(n))) - clearkey(n); - } - work++; - } - return work; -} - - -static void freeupval (lua_State *L, UpVal *uv) { - if (upisopen(uv)) - luaF_unlinkupval(uv); - luaM_free(L, uv); -} - - -static void freeobj (lua_State *L, GCObject *o) { - G(L)->totalobjs--; - switch (o->tt) { - case LUA_VPROTO: - luaF_freeproto(L, gco2p(o)); - break; - case LUA_VUPVAL: - freeupval(L, gco2upv(o)); - break; - case LUA_VLCL: { - LClosure *cl = gco2lcl(o); - luaM_freemem(L, cl, sizeLclosure(cl->nupvalues)); - break; - } - case LUA_VCCL: { - CClosure *cl = gco2ccl(o); - luaM_freemem(L, cl, sizeCclosure(cl->nupvalues)); - break; - } - case LUA_VTABLE: - luaH_free(L, gco2t(o)); - break; - case LUA_VTHREAD: - luaE_freethread(L, gco2th(o)); - break; - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - luaM_freemem(L, o, sizeudata(u->nuvalue, u->len)); - break; - } - case LUA_VSHRSTR: { - TString *ts = gco2ts(o); - luaS_remove(L, ts); - luaM_freemem(L, ts, sizestrshr(ts->shrlen)); - break; - } - case LUA_VLNGSTR: { - TString *ts = gco2ts(o); - if (ts->shrlen == LSTRMEM) - (*ts->falloc)(ts->ud, ts->contents, ts->u.lnglen + 1, 0); - luaM_freemem(L, ts, luaS_sizelngstr(ts->u.lnglen, ts->shrlen)); - break; - } - default: lua_assert(0); - } -} - - - -static GCObject **sweeplist (lua_State *L, GCObject **p, l_obj countin) { - global_State *g = G(L); - int ow = otherwhite(g); - l_obj i; - int white = luaC_white(g); - for (i = 0; *p != NULL && i < countin; i++) { - GCObject *curr = *p; - int marked = curr->marked; - if (isdeadm(ow, marked)) { - *p = curr->next; - freeobj(L, curr); - } - else { - curr->marked = cast_byte((marked & ~maskgcbits) | white | G_NEW); - p = &curr->next; - } - } - return (*p == NULL) ? NULL : p; -} - - - -static GCObject **sweeptolive (lua_State *L, GCObject **p) { - GCObject **old = p; - do { - p = sweeplist(L, p, 1); - } while (p == old); - return p; -} - - - - - - - -static void checkSizes (lua_State *L, global_State *g) { - if (!g->gcemergency) { - if (g->strt.nuse < g->strt.size / 4) - luaS_resize(L, g->strt.size / 2); - } -} - - - -static GCObject *udata2finalize (global_State *g) { - GCObject *o = g->tobefnz; - lua_assert(tofinalize(o)); - g->tobefnz = o->next; - o->next = g->allgc; - g->allgc = o; - resetbit(o->marked, FINALIZEDBIT); - if (issweepphase(g)) - makewhite(g, o); - else if (getage(o) == G_OLD1) - g->firstold1 = o; - return o; -} - - -static void dothecall (lua_State *L, void *ud) { - UNUSED(ud); - luaD_callnoyield(L, L->top.p - 2, 0); -} - - -static void GCTM (lua_State *L) { - global_State *g = G(L); - const TValue *tm; - TValue v; - lua_assert(!g->gcemergency); - setgcovalue(L, &v, udata2finalize(g)); - tm = luaT_gettmbyobj(L, &v, TM_GC); - if (!notm(tm)) { - int status; - lu_byte oldah = L->allowhook; - int oldgcstp = g->gcstp; - g->gcstp |= GCSTPGC; - L->allowhook = 0; - setobj2s(L, L->top.p++, tm); - setobj2s(L, L->top.p++, &v); - L->ci->callstatus |= CIST_FIN; - status = luaD_pcall(L, dothecall, NULL, savestack(L, L->top.p - 2), 0); - L->ci->callstatus &= ~CIST_FIN; - L->allowhook = oldah; - g->gcstp = oldgcstp; - if (l_unlikely(status != LUA_OK)) { - luaE_warnerror(L, "__gc"); - L->top.p--; - } - } -} - - - -static void callallpendingfinalizers (lua_State *L) { - global_State *g = G(L); - while (g->tobefnz) - GCTM(L); -} - - - -static GCObject **findlast (GCObject **p) { - while (*p != NULL) - p = &(*p)->next; - return p; -} - - - -static void separatetobefnz (global_State *g, int all) { - GCObject *curr; - GCObject **p = &g->finobj; - GCObject **lastnext = findlast(&g->tobefnz); - while ((curr = *p) != g->finobjold1) { - lua_assert(tofinalize(curr)); - if (!(iswhite(curr) || all)) - p = &curr->next; - else { - if (curr == g->finobjsur) - g->finobjsur = curr->next; - *p = curr->next; - curr->next = *lastnext; - *lastnext = curr; - lastnext = &curr->next; - } - } -} - - - -static void checkpointer (GCObject **p, GCObject *o) { - if (o == *p) - *p = o->next; -} - - - -static void correctpointers (global_State *g, GCObject *o) { - checkpointer(&g->survival, o); - checkpointer(&g->old1, o); - checkpointer(&g->reallyold, o); - checkpointer(&g->firstold1, o); -} - - - -void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt) { - global_State *g = G(L); - if (tofinalize(o) || - gfasttm(g, mt, TM_GC) == NULL || - (g->gcstp & GCSTPCLS)) - return; - else { - GCObject **p; - if (issweepphase(g)) { - makewhite(g, o); - if (g->sweepgc == &o->next) - g->sweepgc = sweeptolive(L, g->sweepgc); - } - else - correctpointers(g, o); - - for (p = &g->allgc; *p != o; p = &(*p)->next) { } - *p = o->next; - o->next = g->finobj; - g->finobj = o; - l_setbit(o->marked, FINALIZEDBIT); - } -} - - - - - - - - -static void setpause (global_State *g) { - l_obj threshold = applygcparam(g, PAUSE, g->marked); - l_obj debt = threshold - gettotalobjs(g); - if (debt < 0) debt = 0; - luaE_setdebt(g, debt); -} - - - -static void sweep2old (lua_State *L, GCObject **p) { - GCObject *curr; - global_State *g = G(L); - while ((curr = *p) != NULL) { - if (iswhite(curr)) { - lua_assert(isdead(g, curr)); - *p = curr->next; - freeobj(L, curr); - } - else { - setage(curr, G_OLD); - if (curr->tt == LUA_VTHREAD) { - lua_State *th = gco2th(curr); - linkgclist(th, g->grayagain); - } - else if (curr->tt == LUA_VUPVAL && upisopen(gco2upv(curr))) - set2gray(curr); - else - nw2black(curr); - p = &curr->next; - } - } -} - - - -static GCObject **sweepgen (lua_State *L, global_State *g, GCObject **p, - GCObject *limit, GCObject **pfirstold1, - l_obj *paddedold) { - static const lu_byte nextage[] = { - G_SURVIVAL, - G_OLD1, - G_OLD1, - G_OLD, - G_OLD, - G_TOUCHED1, - G_TOUCHED2 - }; - l_obj addedold = 0; - int white = luaC_white(g); - GCObject *curr; - while ((curr = *p) != limit) { - if (iswhite(curr)) { - lua_assert(!isold(curr) && isdead(g, curr)); - *p = curr->next; - freeobj(L, curr); - } - else { - int age = getage(curr); - if (age == G_NEW) { - int marked = curr->marked & ~maskgcbits; - curr->marked = cast_byte(marked | G_SURVIVAL | white); - } - else { - lua_assert(age != G_OLD1); - setage(curr, nextage[age]); - if (getage(curr) == G_OLD1) { - addedold++; - if (*pfirstold1 == NULL) - *pfirstold1 = curr; - } - } - p = &curr->next; - } - } - *paddedold += addedold; - return p; -} - - - -static GCObject **correctgraylist (GCObject **p) { - GCObject *curr; - while ((curr = *p) != NULL) { - GCObject **next = getgclist(curr); - if (iswhite(curr)) - goto remove; - else if (getage(curr) == G_TOUCHED1) { - lua_assert(isgray(curr)); - nw2black(curr); - setage(curr, G_TOUCHED2); - goto remain; - } - else if (curr->tt == LUA_VTHREAD) { - lua_assert(isgray(curr)); - goto remain; - } - else { - lua_assert(isold(curr)); - if (getage(curr) == G_TOUCHED2) - setage(curr, G_OLD); - nw2black(curr); - goto remove; - } - remove: *p = *next; continue; - remain: p = next; continue; - } - return p; -} - - - -static void correctgraylists (global_State *g) { - GCObject **list = correctgraylist(&g->grayagain); - *list = g->weak; g->weak = NULL; - list = correctgraylist(list); - *list = g->allweak; g->allweak = NULL; - list = correctgraylist(list); - *list = g->ephemeron; g->ephemeron = NULL; - correctgraylist(list); -} - - - -static void markold (global_State *g, GCObject *from, GCObject *to) { - GCObject *p; - for (p = from; p != to; p = p->next) { - if (getage(p) == G_OLD1) { - lua_assert(!iswhite(p)); - setage(p, G_OLD); - if (isblack(p)) - reallymarkobject(g, p); - } - } -} - - - -static void finishgencycle (lua_State *L, global_State *g) { - correctgraylists(g); - checkSizes(L, g); - g->gcstate = GCSpropagate; - if (!g->gcemergency) - callallpendingfinalizers(L); -} - - - -static void minor2inc (lua_State *L, global_State *g, int kind) { - g->GCmajorminor = g->marked; - g->gckind = kind; - g->reallyold = g->old1 = g->survival = NULL; - g->finobjrold = g->finobjold1 = g->finobjsur = NULL; - entersweep(L); - - luaE_setdebt(g, applygcparam(g, STEPSIZE, 100)); -} - - - -static int checkminormajor (global_State *g, l_obj addedold1) { - l_obj step = applygcparam(g, MINORMUL, g->GCmajorminor); - l_obj limit = applygcparam(g, MINORMAJOR, g->GCmajorminor); - return (addedold1 >= (step >> 1) || g->marked >= limit); -} - - -static void youngcollection (lua_State *L, global_State *g) { - l_obj addedold1 = 0; - l_obj marked = g->marked; - GCObject **psurvival; - GCObject *dummy; - lua_assert(g->gcstate == GCSpropagate); - if (g->firstold1) { - markold(g, g->firstold1, g->reallyold); - g->firstold1 = NULL; - } - markold(g, g->finobj, g->finobjrold); - markold(g, g->tobefnz, NULL); - - atomic(L); - - - g->gcstate = GCSswpallgc; - psurvival = sweepgen(L, g, &g->allgc, g->survival, &g->firstold1, &addedold1); - - sweepgen(L, g, psurvival, g->old1, &g->firstold1, &addedold1); - g->reallyold = g->old1; - g->old1 = *psurvival; - g->survival = g->allgc; - - - dummy = NULL; - psurvival = sweepgen(L, g, &g->finobj, g->finobjsur, &dummy, &addedold1); - - sweepgen(L, g, psurvival, g->finobjold1, &dummy, &addedold1); - g->finobjrold = g->finobjold1; - g->finobjold1 = *psurvival; - g->finobjsur = g->finobj; - - sweepgen(L, g, &g->tobefnz, NULL, &dummy, &addedold1); - - - g->marked = marked + addedold1; - - - if (checkminormajor(g, addedold1)) { - minor2inc(L, g, KGC_GENMAJOR); - g->marked = 0; - } - else - finishgencycle(L, g); -} - - - -static void atomic2gen (lua_State *L, global_State *g) { - cleargraylists(g); - - g->gcstate = GCSswpallgc; - sweep2old(L, &g->allgc); - - g->reallyold = g->old1 = g->survival = g->allgc; - g->firstold1 = NULL; - - - sweep2old(L, &g->finobj); - g->finobjrold = g->finobjold1 = g->finobjsur = g->finobj; - - sweep2old(L, &g->tobefnz); - - g->gckind = KGC_GENMINOR; - g->GCmajorminor = g->marked; - g->marked = 0; - finishgencycle(L, g); -} - - - -static void setminordebt (global_State *g) { - luaE_setdebt(g, applygcparam(g, MINORMUL, g->GCmajorminor)); -} - - - -static void entergen (lua_State *L, global_State *g) { - luaC_runtilstate(L, GCSpause, 1); - luaC_runtilstate(L, GCSpropagate, 1); - atomic(L); - atomic2gen(L, g); - setminordebt(g); -} - - - -void luaC_changemode (lua_State *L, int newmode) { - global_State *g = G(L); - if (g->gckind == KGC_GENMAJOR) - g->gckind = KGC_INC; - if (newmode != g->gckind) { - if (newmode == KGC_INC) - minor2inc(L, g, KGC_INC); - else { - lua_assert(newmode == KGC_GENMINOR); - entergen(L, g); - } - } -} - - - -static void fullgen (lua_State *L, global_State *g) { - minor2inc(L, g, KGC_INC); - entergen(L, g); -} - - - -static int checkmajorminor (lua_State *L, global_State *g) { - if (g->gckind == KGC_GENMAJOR) { - l_obj numobjs = gettotalobjs(g); - l_obj addedobjs = numobjs - g->GCmajorminor; - l_obj limit = applygcparam(g, MAJORMINOR, addedobjs); - l_obj tobecollected = numobjs - g->marked; - if (tobecollected > limit) { - atomic2gen(L, g); - setminordebt(g); - return 0; - } - } - g->GCmajorminor = g->marked; - return 1; -} - - - - - - - - -static void entersweep (lua_State *L) { - global_State *g = G(L); - g->gcstate = GCSswpallgc; - lua_assert(g->sweepgc == NULL); - g->sweepgc = sweeptolive(L, &g->allgc); -} - - - -static void deletelist (lua_State *L, GCObject *p, GCObject *limit) { - while (p != limit) { - GCObject *next = p->next; - freeobj(L, p); - p = next; - } -} - - - -void luaC_freeallobjects (lua_State *L) { - global_State *g = G(L); - g->gcstp = GCSTPCLS; - luaC_changemode(L, KGC_INC); - separatetobefnz(g, 1); - lua_assert(g->finobj == NULL); - callallpendingfinalizers(L); - deletelist(L, g->allgc, obj2gco(g->mainthread)); - lua_assert(g->finobj == NULL); - deletelist(L, g->fixedgc, NULL); - lua_assert(g->strt.nuse == 0); -} - - -static l_obj atomic (lua_State *L) { - l_obj work = 0; - global_State *g = G(L); - GCObject *origweak, *origall; - GCObject *grayagain = g->grayagain; - g->grayagain = NULL; - lua_assert(g->ephemeron == NULL && g->weak == NULL); - lua_assert(!iswhite(g->mainthread)); - g->gcstate = GCSatomic; - markobject(g, L); - - markvalue(g, &g->l_registry); - markmt(g); - work += propagateall(g); - - work += remarkupvals(g); - work += propagateall(g); - g->gray = grayagain; - work += propagateall(g); - work += convergeephemerons(g); - - - work += clearbyvalues(g, g->weak, NULL); - work += clearbyvalues(g, g->allweak, NULL); - origweak = g->weak; origall = g->allweak; - separatetobefnz(g, 0); - work += markbeingfnz(g); - work += propagateall(g); - work += convergeephemerons(g); - - - work += clearbykeys(g, g->ephemeron); - work += clearbykeys(g, g->allweak); - - work += clearbyvalues(g, g->weak, origweak); - work += clearbyvalues(g, g->allweak, origall); - luaS_clearcache(g); - g->currentwhite = cast_byte(otherwhite(g)); - lua_assert(g->gray == NULL); - return work; -} - - - -static void sweepstep (lua_State *L, global_State *g, - int nextstate, GCObject **nextlist, int fast) { - if (g->sweepgc) - g->sweepgc = sweeplist(L, g->sweepgc, fast ? MAX_LOBJ : GCSWEEPMAX); - else { - g->gcstate = nextstate; - g->sweepgc = nextlist; - } -} - - - -static l_obj singlestep (lua_State *L, int fast) { - global_State *g = G(L); - l_obj work; - lua_assert(!g->gcstopem); - g->gcstopem = 1; - switch (g->gcstate) { - case GCSpause: { - restartcollection(g); - g->gcstate = GCSpropagate; - work = 1; - break; - } - case GCSpropagate: { - if (fast || g->gray == NULL) { - g->gcstate = GCSenteratomic; - work = 0; - } - else { - propagatemark(g); - work = 1; - } - break; - } - case GCSenteratomic: { - work = atomic(L); - if (checkmajorminor(L, g)) - entersweep(L); - break; - } - case GCSswpallgc: { - sweepstep(L, g, GCSswpfinobj, &g->finobj, fast); - work = GCSWEEPMAX; - break; - } - case GCSswpfinobj: { - sweepstep(L, g, GCSswptobefnz, &g->tobefnz, fast); - work = GCSWEEPMAX; - break; - } - case GCSswptobefnz: { - sweepstep(L, g, GCSswpend, NULL, fast); - work = GCSWEEPMAX; - break; - } - case GCSswpend: { - checkSizes(L, g); - g->gcstate = GCScallfin; - work = 0; - break; - } - case GCScallfin: { - if (g->tobefnz && !g->gcemergency) { - g->gcstopem = 0; - GCTM(L); - work = 1; - } - else { - g->gcstate = GCSpause; - work = 0; - } - break; - } - default: lua_assert(0); return 0; - } - g->gcstopem = 0; - return work; -} - - - -void luaC_runtilstate (lua_State *L, int state, int fast) { - global_State *g = G(L); - lua_assert(g->gckind == KGC_INC); - while (state != g->gcstate) - singlestep(L, fast); -} - - - - -static void incstep (lua_State *L, global_State *g) { - l_obj stepsize = applygcparam(g, STEPSIZE, 100); - l_obj work2do = applygcparam(g, STEPMUL, stepsize); - int fast = 0; - if (work2do == 0) { - work2do = MAX_LOBJ; - fast = 1; - } - do { - l_obj work = singlestep(L, fast); - if (g->gckind == KGC_GENMINOR) - return; - work2do -= work; - } while (work2do > 0 && g->gcstate != GCSpause); - if (g->gcstate == GCSpause) - setpause(g); - else - luaE_setdebt(g, stepsize); -} - - -void luaC_step (lua_State *L) { - global_State *g = G(L); - lua_assert(!g->gcemergency); - if (!gcrunning(g)) - luaE_setdebt(g, 2000); - else { - switch (g->gckind) { - case KGC_INC: case KGC_GENMAJOR: - incstep(L, g); - break; - case KGC_GENMINOR: - youngcollection(L, g); - setminordebt(g); - break; - } - } -} - - - -static void fullinc (lua_State *L, global_State *g) { - if (keepinvariant(g)) - entersweep(L); - - luaC_runtilstate(L, GCSpause, 1); - luaC_runtilstate(L, GCScallfin, 1); - - lua_assert(g->marked == gettotalobjs(g)); - luaC_runtilstate(L, GCSpause, 1); - setpause(g); -} - - - -void luaC_fullgc (lua_State *L, int isemergency) { - global_State *g = G(L); - lua_assert(!g->gcemergency); - g->gcemergency = isemergency; - switch (g->gckind) { - case KGC_GENMINOR: fullgen(L, g); break; - case KGC_INC: fullinc(L, g); break; - case KGC_GENMAJOR: - g->gckind = KGC_INC; - fullinc(L, g); - g->gckind = KGC_GENMAJOR; - break; - } - g->gcemergency = 0; -} - - - - - - -//path: src/imports/../dependencies/lua/llex.c - - -#define llex_c -#define LUA_CORE - - - - - -#include -#include - - - - - - - - - - - - - - - - -//path: src/imports/../dependencies/lua/lparser.h - - -#ifndef lparser_h -#define lparser_h - - - - - - - - - - - - -typedef enum { - VVOID, - VNIL, - VTRUE, - VFALSE, - VK, - VKFLT, - VKINT, - VKSTR, - VNONRELOC, - VLOCAL, - VUPVAL, - VCONST, - VINDEXED, - VINDEXUP, - VINDEXI, - VINDEXSTR, - VJMP, - VRELOC, - VCALL, - VVARARG -} expkind; - - -#define vkisvar(k) (VLOCAL <= (k) && (k) <= VINDEXSTR) -#define vkisindexed(k) (VINDEXED <= (k) && (k) <= VINDEXSTR) - - -typedef struct expdesc { - expkind k; - union { - lua_Integer ival; - lua_Number nval; - TString *strval; - int info; - struct { - short idx; - lu_byte t; - } ind; - struct { - lu_byte ridx; - unsigned short vidx; - } var; - } u; - int t; - int f; -} expdesc; - - - -#define VDKREG 0 -#define RDKCONST 1 -#define RDKTOCLOSE 2 -#define RDKCTC 3 - - -typedef union Vardesc { - struct { - TValuefields; - lu_byte kind; - lu_byte ridx; - short pidx; - TString *name; - } vd; - TValue k; -} Vardesc; - - - - -typedef struct Labeldesc { - TString *name; - int pc; - int line; - lu_byte nactvar; - lu_byte close; -} Labeldesc; - - - -typedef struct Labellist { - Labeldesc *arr; - int n; - int size; -} Labellist; - - - -typedef struct Dyndata { - struct { - Vardesc *arr; - int n; - int size; - } actvar; - Labellist gt; - Labellist label; -} Dyndata; - - - -struct BlockCnt; - - - -typedef struct FuncState { - Proto *f; - struct FuncState *prev; - struct LexState *ls; - struct BlockCnt *bl; - int pc; - int lasttarget; - int previousline; - int nk; - int np; - int nabslineinfo; - int firstlocal; - int firstlabel; - short ndebugvars; - lu_byte nactvar; - lu_byte nups; - lu_byte freereg; - lu_byte iwthabs; - lu_byte needclose; -} FuncState; - - -LUAI_FUNC int luaY_nvarstack (FuncState *fs); -LUAI_FUNC LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, - Dyndata *dyd, const char *name, int firstchar); - - -#endif - - - - - - - - - - - - - -#define next(ls) (ls->current = zgetc(ls->z)) - - - -#define currIsNewline(ls) (ls->current == '\n' || ls->current == '\r') - - - -static const char *const luaX_tokens [] = { - "and", "break", "do", "else", "elseif", - "end", "false", "for", "function", "goto", "if", - "in", "local", "nil", "not", "or", "repeat", - "return", "then", "true", "until", "while", - "//", "..", "...", "==", ">=", "<=", "~=", - "<<", ">>", "::", "", - "", "", "", "" -}; - - -#define save_and_next(ls) (save(ls, ls->current), next(ls)) - - -static l_noret lexerror (LexState *ls, const char *msg, int token); - - -static void save (LexState *ls, int c) { - Mbuffer *b = ls->buff; - if (luaZ_bufflen(b) + 1 > luaZ_sizebuffer(b)) { - size_t newsize; - if (luaZ_sizebuffer(b) >= MAX_SIZE/2) - lexerror(ls, "lexical element too long", 0); - newsize = luaZ_sizebuffer(b) * 2; - luaZ_resizebuffer(ls->L, b, newsize); - } - b->buffer[luaZ_bufflen(b)++] = cast_char(c); -} - - -void luaX_init (lua_State *L) { - int i; - TString *e = luaS_newliteral(L, LUA_ENV); - luaC_fix(L, obj2gco(e)); - for (i=0; iextra = cast_byte(i+1); - } -} - - -const char *luaX_token2str (LexState *ls, int token) { - if (token < FIRST_RESERVED) { - if (lisprint(token)) - return luaO_pushfstring(ls->L, "'%c'", token); - else - return luaO_pushfstring(ls->L, "'<\\%d>'", token); - } - else { - const char *s = luaX_tokens[token - FIRST_RESERVED]; - if (token < TK_EOS) - return luaO_pushfstring(ls->L, "'%s'", s); - else - return s; - } -} - - -static const char *txtToken (LexState *ls, int token) { - switch (token) { - case TK_NAME: case TK_STRING: - case TK_FLT: case TK_INT: - save(ls, '\0'); - return luaO_pushfstring(ls->L, "'%s'", luaZ_buffer(ls->buff)); - default: - return luaX_token2str(ls, token); - } -} - - -static l_noret lexerror (LexState *ls, const char *msg, int token) { - msg = luaG_addinfo(ls->L, msg, ls->source, ls->linenumber); - if (token) - luaO_pushfstring(ls->L, "%s near %s", msg, txtToken(ls, token)); - luaD_throw(ls->L, LUA_ERRSYNTAX); -} - - -l_noret luaX_syntaxerror (LexState *ls, const char *msg) { - lexerror(ls, msg, ls->t.token); -} - - - -TString *luaX_newstring (LexState *ls, const char *str, size_t l) { - lua_State *L = ls->L; - TString *ts = luaS_newlstr(L, str, l); - TString *oldts = luaH_getstrkey(ls->h, ts); - if (oldts != NULL) - return oldts; - else { - TValue *stv = s2v(L->top.p++); - setsvalue(L, stv, ts); - luaH_set(L, ls->h, stv, stv); - - luaC_checkGC(L); - L->top.p--; - } - return ts; -} - - - -static void inclinenumber (LexState *ls) { - int old = ls->current; - lua_assert(currIsNewline(ls)); - next(ls); - if (currIsNewline(ls) && ls->current != old) - next(ls); - if (++ls->linenumber >= MAX_INT) - lexerror(ls, "chunk has too many lines", 0); -} - - -void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source, - int firstchar) { - ls->t.token = 0; - ls->L = L; - ls->current = firstchar; - ls->lookahead.token = TK_EOS; - ls->z = z; - ls->fs = NULL; - ls->linenumber = 1; - ls->lastline = 1; - ls->source = source; - ls->envn = luaS_newliteral(L, LUA_ENV); - luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER); -} - - - - - - -static int check_next1 (LexState *ls, int c) { - if (ls->current == c) { - next(ls); - return 1; - } - else return 0; -} - - - -static int check_next2 (LexState *ls, const char *set) { - lua_assert(set[2] == '\0'); - if (ls->current == set[0] || ls->current == set[1]) { - save_and_next(ls); - return 1; - } - else return 0; -} - - - - -static int read_numeral (LexState *ls, SemInfo *seminfo) { - TValue obj; - const char *expo = "Ee"; - int first = ls->current; - lua_assert(lisdigit(ls->current)); - save_and_next(ls); - if (first == '0' && check_next2(ls, "xX")) - expo = "Pp"; - for (;;) { - if (check_next2(ls, expo)) - check_next2(ls, "-+"); - else if (lisxdigit(ls->current) || ls->current == '.') - save_and_next(ls); - else break; - } - if (lislalpha(ls->current)) - save_and_next(ls); - save(ls, '\0'); - if (luaO_str2num(luaZ_buffer(ls->buff), &obj) == 0) - lexerror(ls, "malformed number", TK_FLT); - if (ttisinteger(&obj)) { - seminfo->i = ivalue(&obj); - return TK_INT; - } - else { - lua_assert(ttisfloat(&obj)); - seminfo->r = fltvalue(&obj); - return TK_FLT; - } -} - - - -static size_t skip_sep (LexState *ls) { - size_t count = 0; - int s = ls->current; - lua_assert(s == '[' || s == ']'); - save_and_next(ls); - while (ls->current == '=') { - save_and_next(ls); - count++; - } - return (ls->current == s) ? count + 2 - : (count == 0) ? 1 - : 0; -} - - -static void read_long_string (LexState *ls, SemInfo *seminfo, size_t sep) { - int line = ls->linenumber; - save_and_next(ls); - if (currIsNewline(ls)) - inclinenumber(ls); - for (;;) { - switch (ls->current) { - case EOZ: { - const char *what = (seminfo ? "string" : "comment"); - const char *msg = luaO_pushfstring(ls->L, - "unfinished long %s (starting at line %d)", what, line); - lexerror(ls, msg, TK_EOS); - break; - } - case ']': { - if (skip_sep(ls) == sep) { - save_and_next(ls); - goto endloop; - } - break; - } - case '\n': case '\r': { - save(ls, '\n'); - inclinenumber(ls); - if (!seminfo) luaZ_resetbuffer(ls->buff); - break; - } - default: { - if (seminfo) save_and_next(ls); - else next(ls); - } - } - } endloop: - if (seminfo) - seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + sep, - luaZ_bufflen(ls->buff) - 2 * sep); -} - - -static void esccheck (LexState *ls, int c, const char *msg) { - if (!c) { - if (ls->current != EOZ) - save_and_next(ls); - lexerror(ls, msg, TK_STRING); - } -} - - -static int gethexa (LexState *ls) { - save_and_next(ls); - esccheck (ls, lisxdigit(ls->current), "hexadecimal digit expected"); - return luaO_hexavalue(ls->current); -} - - -static int readhexaesc (LexState *ls) { - int r = gethexa(ls); - r = (r << 4) + gethexa(ls); - luaZ_buffremove(ls->buff, 2); - return r; -} - - -static unsigned long readutf8esc (LexState *ls) { - unsigned long r; - int i = 4; - save_and_next(ls); - esccheck(ls, ls->current == '{', "missing '{'"); - r = gethexa(ls); - while (cast_void(save_and_next(ls)), lisxdigit(ls->current)) { - i++; - esccheck(ls, r <= (0x7FFFFFFFu >> 4), "UTF-8 value too large"); - r = (r << 4) + luaO_hexavalue(ls->current); - } - esccheck(ls, ls->current == '}', "missing '}'"); - next(ls); - luaZ_buffremove(ls->buff, i); - return r; -} - - -static void utf8esc (LexState *ls) { - char buff[UTF8BUFFSZ]; - int n = luaO_utf8esc(buff, readutf8esc(ls)); - for (; n > 0; n--) - save(ls, buff[UTF8BUFFSZ - n]); -} - - -static int readdecesc (LexState *ls) { - int i; - int r = 0; - for (i = 0; i < 3 && lisdigit(ls->current); i++) { - r = 10*r + ls->current - '0'; - save_and_next(ls); - } - esccheck(ls, r <= UCHAR_MAX, "decimal escape too large"); - luaZ_buffremove(ls->buff, i); - return r; -} - - -static void read_string (LexState *ls, int del, SemInfo *seminfo) { - save_and_next(ls); - while (ls->current != del) { - switch (ls->current) { - case EOZ: - lexerror(ls, "unfinished string", TK_EOS); - break; - case '\n': - case '\r': - lexerror(ls, "unfinished string", TK_STRING); - break; - case '\\': { - int c; - save_and_next(ls); - switch (ls->current) { - case 'a': c = '\a'; goto read_save; - case 'b': c = '\b'; goto read_save; - case 'f': c = '\f'; goto read_save; - case 'n': c = '\n'; goto read_save; - case 'r': c = '\r'; goto read_save; - case 't': c = '\t'; goto read_save; - case 'v': c = '\v'; goto read_save; - case 'x': c = readhexaesc(ls); goto read_save; - case 'u': utf8esc(ls); goto no_save; - case '\n': case '\r': - inclinenumber(ls); c = '\n'; goto only_save; - case '\\': case '\"': case '\'': - c = ls->current; goto read_save; - case EOZ: goto no_save; /* will raise an error next loop */ - case 'z': { /* zap following span of spaces */ - luaZ_buffremove(ls->buff, 1); /* remove '\\' */ - next(ls); /* skip the 'z' */ - while (lisspace(ls->current)) { - if (currIsNewline(ls)) inclinenumber(ls); - else next(ls); - } - goto no_save; - } - default: { - esccheck(ls, lisdigit(ls->current), "invalid escape sequence"); - c = readdecesc(ls); /* digital escape '\ddd' */ - goto only_save; - } - } - read_save: - next(ls); - /* go through */ - only_save: - luaZ_buffremove(ls->buff, 1); /* remove '\\' */ - save(ls, c); - /* go through */ - no_save: break; - } - default: - save_and_next(ls); - } - } - save_and_next(ls); /* skip delimiter */ - seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1, - luaZ_bufflen(ls->buff) - 2); -} - - -static int llex (LexState *ls, SemInfo *seminfo) { - luaZ_resetbuffer(ls->buff); - for (;;) { - switch (ls->current) { - case '\n': case '\r': { /* line breaks */ - inclinenumber(ls); - break; - } - case ' ': case '\f': case '\t': case '\v': { /* spaces */ - next(ls); - break; - } - case '-': { /* '-' or '--' (comment) */ - next(ls); - if (ls->current != '-') return '-'; - /* else is a comment */ - next(ls); - if (ls->current == '[') { /* long comment? */ - size_t sep = skip_sep(ls); - luaZ_resetbuffer(ls->buff); /* 'skip_sep' may dirty the buffer */ - if (sep >= 2) { - read_long_string(ls, NULL, sep); /* skip long comment */ - luaZ_resetbuffer(ls->buff); /* previous call may dirty the buff. */ - break; - } - } - /* else short comment */ - while (!currIsNewline(ls) && ls->current != EOZ) - next(ls); /* skip until end of line (or end of file) */ - break; - } - case '[': { /* long string or simply '[' */ - size_t sep = skip_sep(ls); - if (sep >= 2) { - read_long_string(ls, seminfo, sep); - return TK_STRING; - } - else if (sep == 0) /* '[=...' missing second bracket? */ - lexerror(ls, "invalid long string delimiter", TK_STRING); - return '['; - } - case '=': { - next(ls); - if (check_next1(ls, '=')) return TK_EQ; /* '==' */ - else return '='; - } - case '<': { - next(ls); - if (check_next1(ls, '=')) return TK_LE; /* '<=' */ - else if (check_next1(ls, '<')) return TK_SHL; /* '<<' */ - else return '<'; - } - case '>': { - next(ls); - if (check_next1(ls, '=')) return TK_GE; /* '>=' */ - else if (check_next1(ls, '>')) return TK_SHR; /* '>>' */ - else return '>'; - } - case '/': { - next(ls); - if (check_next1(ls, '/')) return TK_IDIV; /* '//' */ - else return '/'; - } - case '~': { - next(ls); - if (check_next1(ls, '=')) return TK_NE; /* '~=' */ - else return '~'; - } - case ':': { - next(ls); - if (check_next1(ls, ':')) return TK_DBCOLON; /* '::' */ - else return ':'; - } - case '"': case '\'': { - read_string(ls, ls->current, seminfo); - return TK_STRING; - } - case '.': { - save_and_next(ls); - if (check_next1(ls, '.')) { - if (check_next1(ls, '.')) - return TK_DOTS; - else return TK_CONCAT; - } - else if (!lisdigit(ls->current)) return '.'; - else return read_numeral(ls, seminfo); - } - case '0': case '1': case '2': case '3': case '4': - case '5': case '6': case '7': case '8': case '9': { - return read_numeral(ls, seminfo); - } - case EOZ: { - return TK_EOS; - } - default: { - if (lislalpha(ls->current)) { - TString *ts; - do { - save_and_next(ls); - } while (lislalnum(ls->current)); - ts = luaX_newstring(ls, luaZ_buffer(ls->buff), - luaZ_bufflen(ls->buff)); - seminfo->ts = ts; - if (isreserved(ts)) - return ts->extra - 1 + FIRST_RESERVED; - else { - return TK_NAME; - } - } - else { - int c = ls->current; - next(ls); - return c; - } - } - } - } -} - - -void luaX_next (LexState *ls) { - ls->lastline = ls->linenumber; - if (ls->lookahead.token != TK_EOS) { - ls->t = ls->lookahead; - ls->lookahead.token = TK_EOS; - } - else - ls->t.token = llex(ls, &ls->t.seminfo); -} - - -int luaX_lookahead (LexState *ls) { - lua_assert(ls->lookahead.token == TK_EOS); - ls->lookahead.token = llex(ls, &ls->lookahead.seminfo); - return ls->lookahead.token; -} - - - -//path: src/imports/../dependencies/lua/lcode.c - - -#define lcode_c -#define LUA_CORE - - - - - -#include -#include -#include - - - - -//path: src/imports/../dependencies/lua/lcode.h - - -#ifndef lcode_h -#define lcode_h - - - - - - - - - - - - -#define NO_JUMP (-1) - - - -typedef enum BinOpr { - - OPR_ADD, OPR_SUB, OPR_MUL, OPR_MOD, OPR_POW, - OPR_DIV, OPR_IDIV, - - OPR_BAND, OPR_BOR, OPR_BXOR, - OPR_SHL, OPR_SHR, - - OPR_CONCAT, - - OPR_EQ, OPR_LT, OPR_LE, - OPR_NE, OPR_GT, OPR_GE, - - OPR_AND, OPR_OR, - OPR_NOBINOPR -} BinOpr; - - - -#define foldbinop(op) ((op) <= OPR_SHR) - - -#define luaK_codeABC(fs,o,a,b,c) luaK_codeABCk(fs,o,a,b,c,0) - - -typedef enum UnOpr { OPR_MINUS, OPR_BNOT, OPR_NOT, OPR_LEN, OPR_NOUNOPR } UnOpr; - - - -#define getinstruction(fs,e) ((fs)->f->code[(e)->u.info]) - - -#define luaK_setmultret(fs,e) luaK_setreturns(fs, e, LUA_MULTRET) - -#define luaK_jumpto(fs,t) luaK_patchlist(fs, luaK_jump(fs), t) - -LUAI_FUNC int luaK_code (FuncState *fs, Instruction i); -LUAI_FUNC int luaK_codeABx (FuncState *fs, OpCode o, int A, unsigned Bx); -LUAI_FUNC int luaK_codeABCk (FuncState *fs, OpCode o, int A, - int B, int C, int k); -LUAI_FUNC int luaK_exp2const (FuncState *fs, const expdesc *e, TValue *v); -LUAI_FUNC void luaK_fixline (FuncState *fs, int line); -LUAI_FUNC void luaK_nil (FuncState *fs, int from, int n); -LUAI_FUNC void luaK_reserveregs (FuncState *fs, int n); -LUAI_FUNC void luaK_checkstack (FuncState *fs, int n); -LUAI_FUNC void luaK_int (FuncState *fs, int reg, lua_Integer n); -LUAI_FUNC void luaK_dischargevars (FuncState *fs, expdesc *e); -LUAI_FUNC int luaK_exp2anyreg (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2anyregup (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2nextreg (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_exp2val (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_self (FuncState *fs, expdesc *e, expdesc *key); -LUAI_FUNC void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k); -LUAI_FUNC void luaK_goiftrue (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_goiffalse (FuncState *fs, expdesc *e); -LUAI_FUNC void luaK_storevar (FuncState *fs, expdesc *var, expdesc *e); -LUAI_FUNC void luaK_setreturns (FuncState *fs, expdesc *e, int nresults); -LUAI_FUNC void luaK_setoneret (FuncState *fs, expdesc *e); -LUAI_FUNC int luaK_jump (FuncState *fs); -LUAI_FUNC void luaK_ret (FuncState *fs, int first, int nret); -LUAI_FUNC void luaK_patchlist (FuncState *fs, int list, int target); -LUAI_FUNC void luaK_patchtohere (FuncState *fs, int list); -LUAI_FUNC void luaK_concat (FuncState *fs, int *l1, int l2); -LUAI_FUNC int luaK_getlabel (FuncState *fs); -LUAI_FUNC void luaK_prefix (FuncState *fs, UnOpr op, expdesc *v, int line); -LUAI_FUNC void luaK_infix (FuncState *fs, BinOpr op, expdesc *v); -LUAI_FUNC void luaK_posfix (FuncState *fs, BinOpr op, expdesc *v1, - expdesc *v2, int line); -LUAI_FUNC void luaK_settablesize (FuncState *fs, int pc, - int ra, int asize, int hsize); -LUAI_FUNC void luaK_setlist (FuncState *fs, int base, int nelems, int tostore); -LUAI_FUNC void luaK_finish (FuncState *fs); -LUAI_FUNC l_noret luaK_semerror (LexState *ls, const char *msg); - - -#endif - - - - - - - - - - - - - - - - - - - - - - -//path: src/imports/../dependencies/lua/lvm.h - - -#ifndef lvm_h -#define lvm_h - - - - - - - - - - -#if !defined(LUA_NOCVTN2S) -#define cvt2str(o) ttisnumber(o) -#else -#define cvt2str(o) 0 -#endif - - -#if !defined(LUA_NOCVTS2N) -#define cvt2num(o) ttisstring(o) -#else -#define cvt2num(o) 0 -#endif - - - -#if !defined(LUA_FLOORN2I) -#define LUA_FLOORN2I F2Ieq -#endif - - - -typedef enum { - F2Ieq, - F2Ifloor, - F2Iceil -} F2Imod; - - - -#define tonumber(o,n) \ - (ttisfloat(o) ? (*(n) = fltvalue(o), 1) : luaV_tonumber_(o,n)) - - - -#define tonumberns(o,n) \ - (ttisfloat(o) ? ((n) = fltvalue(o), 1) : \ - (ttisinteger(o) ? ((n) = cast_num(ivalue(o)), 1) : 0)) - - - -#define tointeger(o,i) \ - (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ - : luaV_tointeger(o,i,LUA_FLOORN2I)) - - - -#define tointegerns(o,i) \ - (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ - : luaV_tointegerns(o,i,LUA_FLOORN2I)) - - -#define intop(op,v1,v2) l_castU2S(l_castS2U(v1) op l_castS2U(v2)) - -#define luaV_rawequalobj(t1,t2) luaV_equalobj(NULL,t1,t2) - - - -#define luaV_fastget(t,k,res,f, tag) \ - (tag = (!ttistable(t) ? LUA_VNOTABLE : f(hvalue(t), k, res))) - - - -#define luaV_fastgeti(t,k,res,tag) \ - if (!ttistable(t)) tag = LUA_VNOTABLE; \ - else { luaH_fastgeti(hvalue(t), k, res, tag); } - - -#define luaV_fastset(t,k,val,hres,f) \ - (hres = (!ttistable(t) ? HNOTATABLE : f(hvalue(t), k, val))) - -#define luaV_fastseti(t,k,val,hres) \ - if (!ttistable(t)) hres = HNOTATABLE; \ - else { luaH_fastseti(hvalue(t), k, val, hres); } - - - -#define luaV_finishfastset(L,t,v) luaC_barrierback(L, gcvalue(t), v) - - - -#define luaV_shiftr(x,y) luaV_shiftl(x,intop(-, 0, y)) - - - -LUAI_FUNC int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2); -LUAI_FUNC int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r); -LUAI_FUNC int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r); -LUAI_FUNC int luaV_tonumber_ (const TValue *obj, lua_Number *n); -LUAI_FUNC int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode); -LUAI_FUNC int luaV_tointegerns (const TValue *obj, lua_Integer *p, - F2Imod mode); -LUAI_FUNC int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode); -LUAI_FUNC int luaV_finishget (lua_State *L, const TValue *t, TValue *key, - StkId val, int tag); -LUAI_FUNC void luaV_finishset (lua_State *L, const TValue *t, TValue *key, - TValue *val, int aux); -LUAI_FUNC void luaV_finishOp (lua_State *L); -LUAI_FUNC void luaV_execute (lua_State *L, CallInfo *ci); -LUAI_FUNC void luaV_concat (lua_State *L, int total); -LUAI_FUNC lua_Integer luaV_idiv (lua_State *L, lua_Integer x, lua_Integer y); -LUAI_FUNC lua_Integer luaV_mod (lua_State *L, lua_Integer x, lua_Integer y); -LUAI_FUNC lua_Number luaV_modf (lua_State *L, lua_Number x, lua_Number y); -LUAI_FUNC lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y); -LUAI_FUNC void luaV_objlen (lua_State *L, StkId ra, const TValue *rb); - -#endif - - - - - -#define MAXREGS 255 - - -#define hasjumps(e) ((e)->t != (e)->f) - - -static int codesJ (FuncState *fs, OpCode o, int sj, int k); - - - - -l_noret luaK_semerror (LexState *ls, const char *msg) { - ls->t.token = 0; - luaX_syntaxerror(ls, msg); -} - - - -static int tonumeral (const expdesc *e, TValue *v) { - if (hasjumps(e)) - return 0; - switch (e->k) { - case VKINT: - if (v) setivalue(v, e->u.ival); - return 1; - case VKFLT: - if (v) setfltvalue(v, e->u.nval); - return 1; - default: return 0; - } -} - - - -static TValue *const2val (FuncState *fs, const expdesc *e) { - lua_assert(e->k == VCONST); - return &fs->ls->dyd->actvar.arr[e->u.info].k; -} - - - -int luaK_exp2const (FuncState *fs, const expdesc *e, TValue *v) { - if (hasjumps(e)) - return 0; - switch (e->k) { - case VFALSE: - setbfvalue(v); - return 1; - case VTRUE: - setbtvalue(v); - return 1; - case VNIL: - setnilvalue(v); - return 1; - case VKSTR: { - setsvalue(fs->ls->L, v, e->u.strval); - return 1; - } - case VCONST: { - setobj(fs->ls->L, v, const2val(fs, e)); - return 1; - } - default: return tonumeral(e, v); - } -} - - - -static Instruction *previousinstruction (FuncState *fs) { - static const Instruction invalidinstruction = ~(Instruction)0; - if (fs->pc > fs->lasttarget) - return &fs->f->code[fs->pc - 1]; - else - return cast(Instruction*, &invalidinstruction); -} - - - -void luaK_nil (FuncState *fs, int from, int n) { - int l = from + n - 1; - Instruction *previous = previousinstruction(fs); - if (GET_OPCODE(*previous) == OP_LOADNIL) { - int pfrom = GETARG_A(*previous); - int pl = pfrom + GETARG_B(*previous); - if ((pfrom <= from && from <= pl + 1) || - (from <= pfrom && pfrom <= l + 1)) { - if (pfrom < from) from = pfrom; - if (pl > l) l = pl; - SETARG_A(*previous, from); - SETARG_B(*previous, l - from); - return; - } - } - luaK_codeABC(fs, OP_LOADNIL, from, n - 1, 0); -} - - - -static int getjump (FuncState *fs, int pc) { - int offset = GETARG_sJ(fs->f->code[pc]); - if (offset == NO_JUMP) - return NO_JUMP; - else - return (pc+1)+offset; -} - - - -static void fixjump (FuncState *fs, int pc, int dest) { - Instruction *jmp = &fs->f->code[pc]; - int offset = dest - (pc + 1); - lua_assert(dest != NO_JUMP); - if (!(-OFFSET_sJ <= offset && offset <= MAXARG_sJ - OFFSET_sJ)) - luaX_syntaxerror(fs->ls, "control structure too long"); - lua_assert(GET_OPCODE(*jmp) == OP_JMP); - SETARG_sJ(*jmp, offset); -} - - - -void luaK_concat (FuncState *fs, int *l1, int l2) { - if (l2 == NO_JUMP) return; - else if (*l1 == NO_JUMP) - *l1 = l2; - else { - int list = *l1; - int next; - while ((next = getjump(fs, list)) != NO_JUMP) - list = next; - fixjump(fs, list, l2); - } -} - - - -int luaK_jump (FuncState *fs) { - return codesJ(fs, OP_JMP, NO_JUMP, 0); -} - - - -void luaK_ret (FuncState *fs, int first, int nret) { - OpCode op; - switch (nret) { - case 0: op = OP_RETURN0; break; - case 1: op = OP_RETURN1; break; - default: op = OP_RETURN; break; - } - luaK_codeABC(fs, op, first, nret + 1, 0); -} - - - -static int condjump (FuncState *fs, OpCode op, int A, int B, int C, int k) { - luaK_codeABCk(fs, op, A, B, C, k); - return luaK_jump(fs); -} - - - -int luaK_getlabel (FuncState *fs) { - fs->lasttarget = fs->pc; - return fs->pc; -} - - - -static Instruction *getjumpcontrol (FuncState *fs, int pc) { - Instruction *pi = &fs->f->code[pc]; - if (pc >= 1 && testTMode(GET_OPCODE(*(pi-1)))) - return pi-1; - else - return pi; -} - - - -static int patchtestreg (FuncState *fs, int node, int reg) { - Instruction *i = getjumpcontrol(fs, node); - if (GET_OPCODE(*i) != OP_TESTSET) - return 0; - if (reg != NO_REG && reg != GETARG_B(*i)) - SETARG_A(*i, reg); - else { - - *i = CREATE_ABCk(OP_TEST, GETARG_B(*i), 0, 0, GETARG_k(*i)); - } - return 1; -} - - - -static void removevalues (FuncState *fs, int list) { - for (; list != NO_JUMP; list = getjump(fs, list)) - patchtestreg(fs, list, NO_REG); -} - - - -static void patchlistaux (FuncState *fs, int list, int vtarget, int reg, - int dtarget) { - while (list != NO_JUMP) { - int next = getjump(fs, list); - if (patchtestreg(fs, list, reg)) - fixjump(fs, list, vtarget); - else - fixjump(fs, list, dtarget); - list = next; - } -} - - - -void luaK_patchlist (FuncState *fs, int list, int target) { - lua_assert(target <= fs->pc); - patchlistaux(fs, list, target, NO_REG, target); -} - - -void luaK_patchtohere (FuncState *fs, int list) { - int hr = luaK_getlabel(fs); - luaK_patchlist(fs, list, hr); -} - - - -#define LIMLINEDIFF 0x80 - - - -static void savelineinfo (FuncState *fs, Proto *f, int line) { - int linedif = line - fs->previousline; - int pc = fs->pc - 1; - if (abs(linedif) >= LIMLINEDIFF || fs->iwthabs++ >= MAXIWTHABS) { - luaM_growvector(fs->ls->L, f->abslineinfo, fs->nabslineinfo, - f->sizeabslineinfo, AbsLineInfo, MAX_INT, "lines"); - f->abslineinfo[fs->nabslineinfo].pc = pc; - f->abslineinfo[fs->nabslineinfo++].line = line; - linedif = ABSLINEINFO; - fs->iwthabs = 1; - } - luaM_growvector(fs->ls->L, f->lineinfo, pc, f->sizelineinfo, ls_byte, - MAX_INT, "opcodes"); - f->lineinfo[pc] = linedif; - fs->previousline = line; -} - - - -static void removelastlineinfo (FuncState *fs) { - Proto *f = fs->f; - int pc = fs->pc - 1; - if (f->lineinfo[pc] != ABSLINEINFO) { - fs->previousline -= f->lineinfo[pc]; - fs->iwthabs--; - } - else { - lua_assert(f->abslineinfo[fs->nabslineinfo - 1].pc == pc); - fs->nabslineinfo--; - fs->iwthabs = MAXIWTHABS + 1; - } -} - - - -static void removelastinstruction (FuncState *fs) { - removelastlineinfo(fs); - fs->pc--; -} - - - -int luaK_code (FuncState *fs, Instruction i) { - Proto *f = fs->f; - - luaM_growvector(fs->ls->L, f->code, fs->pc, f->sizecode, Instruction, - MAX_INT, "opcodes"); - f->code[fs->pc++] = i; - savelineinfo(fs, f, fs->ls->lastline); - return fs->pc - 1; -} - - - -int luaK_codeABCk (FuncState *fs, OpCode o, int a, int b, int c, int k) { - lua_assert(getOpMode(o) == iABC); - lua_assert(a <= MAXARG_A && b <= MAXARG_B && - c <= MAXARG_C && (k & ~1) == 0); - return luaK_code(fs, CREATE_ABCk(o, a, b, c, k)); -} - - - -int luaK_codeABx (FuncState *fs, OpCode o, int a, unsigned int bc) { - lua_assert(getOpMode(o) == iABx); - lua_assert(a <= MAXARG_A && bc <= MAXARG_Bx); - return luaK_code(fs, CREATE_ABx(o, a, bc)); -} - - - -static int codeAsBx (FuncState *fs, OpCode o, int a, int bc) { - unsigned int b = bc + OFFSET_sBx; - lua_assert(getOpMode(o) == iAsBx); - lua_assert(a <= MAXARG_A && b <= MAXARG_Bx); - return luaK_code(fs, CREATE_ABx(o, a, b)); -} - - - -static int codesJ (FuncState *fs, OpCode o, int sj, int k) { - unsigned int j = sj + OFFSET_sJ; - lua_assert(getOpMode(o) == isJ); - lua_assert(j <= MAXARG_sJ && (k & ~1) == 0); - return luaK_code(fs, CREATE_sJ(o, j, k)); -} - - - -static int codeextraarg (FuncState *fs, int a) { - lua_assert(a <= MAXARG_Ax); - return luaK_code(fs, CREATE_Ax(OP_EXTRAARG, a)); -} - - - -static int luaK_codek (FuncState *fs, int reg, int k) { - if (k <= MAXARG_Bx) - return luaK_codeABx(fs, OP_LOADK, reg, k); - else { - int p = luaK_codeABx(fs, OP_LOADKX, reg, 0); - codeextraarg(fs, k); - return p; - } -} - - - -void luaK_checkstack (FuncState *fs, int n) { - int newstack = fs->freereg + n; - if (newstack > fs->f->maxstacksize) { - if (newstack >= MAXREGS) - luaX_syntaxerror(fs->ls, - "function or expression needs too many registers"); - fs->f->maxstacksize = cast_byte(newstack); - } -} - - - -void luaK_reserveregs (FuncState *fs, int n) { - luaK_checkstack(fs, n); - fs->freereg += n; -} - - - -static void freereg (FuncState *fs, int reg) { - if (reg >= luaY_nvarstack(fs)) { - fs->freereg--; - lua_assert(reg == fs->freereg); - } -} - - - -static void freeregs (FuncState *fs, int r1, int r2) { - if (r1 > r2) { - freereg(fs, r1); - freereg(fs, r2); - } - else { - freereg(fs, r2); - freereg(fs, r1); - } -} - - - -static void freeexp (FuncState *fs, expdesc *e) { - if (e->k == VNONRELOC) - freereg(fs, e->u.info); -} - - - -static void freeexps (FuncState *fs, expdesc *e1, expdesc *e2) { - int r1 = (e1->k == VNONRELOC) ? e1->u.info : -1; - int r2 = (e2->k == VNONRELOC) ? e2->u.info : -1; - freeregs(fs, r1, r2); -} - - - -static int addk (FuncState *fs, TValue *key, TValue *v) { - TValue val; - lua_State *L = fs->ls->L; - Proto *f = fs->f; - int tag = luaH_get(fs->ls->h, key, &val); - int k, oldsize; - if (tag == LUA_VNUMINT) { - k = cast_int(ivalue(&val)); - - if (k < fs->nk && ttypetag(&f->k[k]) == ttypetag(v) && - luaV_rawequalobj(&f->k[k], v)) - return k; - } - - oldsize = f->sizek; - k = fs->nk; - - setivalue(&val, k); - luaH_set(L, fs->ls->h, key, &val); - luaM_growvector(L, f->k, k, f->sizek, TValue, MAXARG_Ax, "constants"); - while (oldsize < f->sizek) setnilvalue(&f->k[oldsize++]); - setobj(L, &f->k[k], v); - fs->nk++; - luaC_barrier(L, f, v); - return k; -} - - - -static int stringK (FuncState *fs, TString *s) { - TValue o; - setsvalue(fs->ls->L, &o, s); - return addk(fs, &o, &o); -} - - - -static int luaK_intK (FuncState *fs, lua_Integer n) { - TValue o; - setivalue(&o, n); - return addk(fs, &o, &o); -} - - -static int luaK_numberK (FuncState *fs, lua_Number r) { - TValue o; - lua_Integer ik; - setfltvalue(&o, r); - if (!luaV_flttointeger(r, &ik, F2Ieq)) - return addk(fs, &o, &o); - else { - const int nbm = l_floatatt(MANT_DIG); - const lua_Number q = l_mathop(private_lua_cembed_ldexp)(l_mathop(1.0), -nbm + 1); - const lua_Number k = (ik == 0) ? q : r + r*q; - TValue kv; - setfltvalue(&kv, k); - - lua_assert(!luaV_flttointeger(k, &ik, F2Ieq) || - l_mathop(fabs)(r) >= l_mathop(1e6)); - return addk(fs, &kv, &o); - } -} - - - -static int boolF (FuncState *fs) { - TValue o; - setbfvalue(&o); - return addk(fs, &o, &o); -} - - - -static int boolT (FuncState *fs) { - TValue o; - setbtvalue(&o); - return addk(fs, &o, &o); -} - - - -static int nilK (FuncState *fs) { - TValue k, v; - setnilvalue(&v); - - sethvalue(fs->ls->L, &k, fs->ls->h); - return addk(fs, &k, &v); -} - - - -static int fitsC (lua_Integer i) { - return (l_castS2U(i) + OFFSET_sC <= cast_uint(MAXARG_C)); -} - - - -static int fitsBx (lua_Integer i) { - return (-OFFSET_sBx <= i && i <= MAXARG_Bx - OFFSET_sBx); -} - - -void luaK_int (FuncState *fs, int reg, lua_Integer i) { - if (fitsBx(i)) - codeAsBx(fs, OP_LOADI, reg, cast_int(i)); - else - luaK_codek(fs, reg, luaK_intK(fs, i)); -} - - -static void luaK_float (FuncState *fs, int reg, lua_Number f) { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ieq) && fitsBx(fi)) - codeAsBx(fs, OP_LOADF, reg, cast_int(fi)); - else - luaK_codek(fs, reg, luaK_numberK(fs, f)); -} - - - -static void const2exp (TValue *v, expdesc *e) { - switch (ttypetag(v)) { - case LUA_VNUMINT: - e->k = VKINT; e->u.ival = ivalue(v); - break; - case LUA_VNUMFLT: - e->k = VKFLT; e->u.nval = fltvalue(v); - break; - case LUA_VFALSE: - e->k = VFALSE; - break; - case LUA_VTRUE: - e->k = VTRUE; - break; - case LUA_VNIL: - e->k = VNIL; - break; - case LUA_VSHRSTR: case LUA_VLNGSTR: - e->k = VKSTR; e->u.strval = tsvalue(v); - break; - default: lua_assert(0); - } -} - - - -void luaK_setreturns (FuncState *fs, expdesc *e, int nresults) { - Instruction *pc = &getinstruction(fs, e); - if (e->k == VCALL) - SETARG_C(*pc, nresults + 1); - else { - lua_assert(e->k == VVARARG); - SETARG_C(*pc, nresults + 1); - SETARG_A(*pc, fs->freereg); - luaK_reserveregs(fs, 1); - } -} - - - -static void str2K (FuncState *fs, expdesc *e) { - lua_assert(e->k == VKSTR); - e->u.info = stringK(fs, e->u.strval); - e->k = VK; -} - - - -void luaK_setoneret (FuncState *fs, expdesc *e) { - if (e->k == VCALL) { - - lua_assert(GETARG_C(getinstruction(fs, e)) == 2); - e->k = VNONRELOC; - e->u.info = GETARG_A(getinstruction(fs, e)); - } - else if (e->k == VVARARG) { - SETARG_C(getinstruction(fs, e), 2); - e->k = VRELOC; - } -} - - - -void luaK_dischargevars (FuncState *fs, expdesc *e) { - switch (e->k) { - case VCONST: { - const2exp(const2val(fs, e), e); - break; - } - case VLOCAL: { - e->u.info = e->u.var.ridx; - e->k = VNONRELOC; - break; - } - case VUPVAL: { - e->u.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.info, 0); - e->k = VRELOC; - break; - } - case VINDEXUP: { - e->u.info = luaK_codeABC(fs, OP_GETTABUP, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXI: { - freereg(fs, e->u.ind.t); - e->u.info = luaK_codeABC(fs, OP_GETI, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXSTR: { - freereg(fs, e->u.ind.t); - e->u.info = luaK_codeABC(fs, OP_GETFIELD, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VINDEXED: { - freeregs(fs, e->u.ind.t, e->u.ind.idx); - e->u.info = luaK_codeABC(fs, OP_GETTABLE, 0, e->u.ind.t, e->u.ind.idx); - e->k = VRELOC; - break; - } - case VVARARG: case VCALL: { - luaK_setoneret(fs, e); - break; - } - default: break; - } -} - - - -static void discharge2reg (FuncState *fs, expdesc *e, int reg) { - luaK_dischargevars(fs, e); - switch (e->k) { - case VNIL: { - luaK_nil(fs, reg, 1); - break; - } - case VFALSE: { - luaK_codeABC(fs, OP_LOADFALSE, reg, 0, 0); - break; - } - case VTRUE: { - luaK_codeABC(fs, OP_LOADTRUE, reg, 0, 0); - break; - } - case VKSTR: { - str2K(fs, e); - } - case VK: { - luaK_codek(fs, reg, e->u.info); - break; - } - case VKFLT: { - luaK_float(fs, reg, e->u.nval); - break; - } - case VKINT: { - luaK_int(fs, reg, e->u.ival); - break; - } - case VRELOC: { - Instruction *pc = &getinstruction(fs, e); - SETARG_A(*pc, reg); - break; - } - case VNONRELOC: { - if (reg != e->u.info) - luaK_codeABC(fs, OP_MOVE, reg, e->u.info, 0); - break; - } - default: { - lua_assert(e->k == VJMP); - return; - } - } - e->u.info = reg; - e->k = VNONRELOC; -} - - - -static void discharge2anyreg (FuncState *fs, expdesc *e) { - if (e->k != VNONRELOC) { - luaK_reserveregs(fs, 1); - discharge2reg(fs, e, fs->freereg-1); - } -} - - -static int code_loadbool (FuncState *fs, int A, OpCode op) { - luaK_getlabel(fs); - return luaK_codeABC(fs, op, A, 0, 0); -} - - - -static int need_value (FuncState *fs, int list) { - for (; list != NO_JUMP; list = getjump(fs, list)) { - Instruction i = *getjumpcontrol(fs, list); - if (GET_OPCODE(i) != OP_TESTSET) return 1; - } - return 0; -} - - - -static void exp2reg (FuncState *fs, expdesc *e, int reg) { - discharge2reg(fs, e, reg); - if (e->k == VJMP) - luaK_concat(fs, &e->t, e->u.info); - if (hasjumps(e)) { - int final; - int p_f = NO_JUMP; - int p_t = NO_JUMP; - if (need_value(fs, e->t) || need_value(fs, e->f)) { - int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs); - p_f = code_loadbool(fs, reg, OP_LFALSESKIP); - p_t = code_loadbool(fs, reg, OP_LOADTRUE); - - luaK_patchtohere(fs, fj); - } - final = luaK_getlabel(fs); - patchlistaux(fs, e->f, final, reg, p_f); - patchlistaux(fs, e->t, final, reg, p_t); - } - e->f = e->t = NO_JUMP; - e->u.info = reg; - e->k = VNONRELOC; -} - - - -void luaK_exp2nextreg (FuncState *fs, expdesc *e) { - luaK_dischargevars(fs, e); - freeexp(fs, e); - luaK_reserveregs(fs, 1); - exp2reg(fs, e, fs->freereg - 1); -} - - - -int luaK_exp2anyreg (FuncState *fs, expdesc *e) { - luaK_dischargevars(fs, e); - if (e->k == VNONRELOC) { - if (!hasjumps(e)) - return e->u.info; - if (e->u.info >= luaY_nvarstack(fs)) { - exp2reg(fs, e, e->u.info); - return e->u.info; - } - - } - luaK_exp2nextreg(fs, e); - return e->u.info; -} - - - -void luaK_exp2anyregup (FuncState *fs, expdesc *e) { - if (e->k != VUPVAL || hasjumps(e)) - luaK_exp2anyreg(fs, e); -} - - - -void luaK_exp2val (FuncState *fs, expdesc *e) { - if (hasjumps(e)) - luaK_exp2anyreg(fs, e); - else - luaK_dischargevars(fs, e); -} - - - -static int luaK_exp2K (FuncState *fs, expdesc *e) { - if (!hasjumps(e)) { - int info; - switch (e->k) { - case VTRUE: info = boolT(fs); break; - case VFALSE: info = boolF(fs); break; - case VNIL: info = nilK(fs); break; - case VKINT: info = luaK_intK(fs, e->u.ival); break; - case VKFLT: info = luaK_numberK(fs, e->u.nval); break; - case VKSTR: info = stringK(fs, e->u.strval); break; - case VK: info = e->u.info; break; - default: return 0; - } - if (info <= MAXINDEXRK) { - e->k = VK; - e->u.info = info; - return 1; - } - } - - return 0; -} - - - -static int exp2RK (FuncState *fs, expdesc *e) { - if (luaK_exp2K(fs, e)) - return 1; - else { - luaK_exp2anyreg(fs, e); - return 0; - } -} - - -static void codeABRK (FuncState *fs, OpCode o, int a, int b, - expdesc *ec) { - int k = exp2RK(fs, ec); - luaK_codeABCk(fs, o, a, b, ec->u.info, k); -} - - - -void luaK_storevar (FuncState *fs, expdesc *var, expdesc *ex) { - switch (var->k) { - case VLOCAL: { - freeexp(fs, ex); - exp2reg(fs, ex, var->u.var.ridx); - return; - } - case VUPVAL: { - int e = luaK_exp2anyreg(fs, ex); - luaK_codeABC(fs, OP_SETUPVAL, e, var->u.info, 0); - break; - } - case VINDEXUP: { - codeABRK(fs, OP_SETTABUP, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXI: { - codeABRK(fs, OP_SETI, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXSTR: { - codeABRK(fs, OP_SETFIELD, var->u.ind.t, var->u.ind.idx, ex); - break; - } - case VINDEXED: { - codeABRK(fs, OP_SETTABLE, var->u.ind.t, var->u.ind.idx, ex); - break; - } - default: lua_assert(0); - } - freeexp(fs, ex); -} - - - -void luaK_self (FuncState *fs, expdesc *e, expdesc *key) { - int ereg; - luaK_exp2anyreg(fs, e); - ereg = e->u.info; - freeexp(fs, e); - e->u.info = fs->freereg; - e->k = VNONRELOC; - luaK_reserveregs(fs, 2); - codeABRK(fs, OP_SELF, e->u.info, ereg, key); - freeexp(fs, key); -} - - - -static void negatecondition (FuncState *fs, expdesc *e) { - Instruction *pc = getjumpcontrol(fs, e->u.info); - lua_assert(testTMode(GET_OPCODE(*pc)) && GET_OPCODE(*pc) != OP_TESTSET && - GET_OPCODE(*pc) != OP_TEST); - SETARG_k(*pc, (GETARG_k(*pc) ^ 1)); -} - - - -static int jumponcond (FuncState *fs, expdesc *e, int cond) { - if (e->k == VRELOC) { - Instruction ie = getinstruction(fs, e); - if (GET_OPCODE(ie) == OP_NOT) { - removelastinstruction(fs); - return condjump(fs, OP_TEST, GETARG_B(ie), 0, 0, !cond); - } - - } - discharge2anyreg(fs, e); - freeexp(fs, e); - return condjump(fs, OP_TESTSET, NO_REG, e->u.info, 0, cond); -} - - - -void luaK_goiftrue (FuncState *fs, expdesc *e) { - int pc; - luaK_dischargevars(fs, e); - switch (e->k) { - case VJMP: { - negatecondition(fs, e); - pc = e->u.info; - break; - } - case VK: case VKFLT: case VKINT: case VKSTR: case VTRUE: { - pc = NO_JUMP; - break; - } - default: { - pc = jumponcond(fs, e, 0); - break; - } - } - luaK_concat(fs, &e->f, pc); - luaK_patchtohere(fs, e->t); - e->t = NO_JUMP; -} - - - -void luaK_goiffalse (FuncState *fs, expdesc *e) { - int pc; - luaK_dischargevars(fs, e); - switch (e->k) { - case VJMP: { - pc = e->u.info; - break; - } - case VNIL: case VFALSE: { - pc = NO_JUMP; - break; - } - default: { - pc = jumponcond(fs, e, 1); - break; - } - } - luaK_concat(fs, &e->t, pc); - luaK_patchtohere(fs, e->f); - e->f = NO_JUMP; -} - - - -static void codenot (FuncState *fs, expdesc *e) { - switch (e->k) { - case VNIL: case VFALSE: { - e->k = VTRUE; - break; - } - case VK: case VKFLT: case VKINT: case VKSTR: case VTRUE: { - e->k = VFALSE; - break; - } - case VJMP: { - negatecondition(fs, e); - break; - } - case VRELOC: - case VNONRELOC: { - discharge2anyreg(fs, e); - freeexp(fs, e); - e->u.info = luaK_codeABC(fs, OP_NOT, 0, e->u.info, 0); - e->k = VRELOC; - break; - } - default: lua_assert(0); - } - - { int temp = e->f; e->f = e->t; e->t = temp; } - removevalues(fs, e->f); - removevalues(fs, e->t); -} - - - -static int isKstr (FuncState *fs, expdesc *e) { - return (e->k == VK && !hasjumps(e) && e->u.info <= MAXARG_B && - ttisshrstring(&fs->f->k[e->u.info])); -} - - -static int isKint (expdesc *e) { - return (e->k == VKINT && !hasjumps(e)); -} - - - -static int isCint (expdesc *e) { - return isKint(e) && (l_castS2U(e->u.ival) <= l_castS2U(MAXARG_C)); -} - - - -static int isSCint (expdesc *e) { - return isKint(e) && fitsC(e->u.ival); -} - - - -static int isSCnumber (expdesc *e, int *pi, int *isfloat) { - lua_Integer i; - if (e->k == VKINT) - i = e->u.ival; - else if (e->k == VKFLT && luaV_flttointeger(e->u.nval, &i, F2Ieq)) - *isfloat = 1; - else - return 0; - if (!hasjumps(e) && fitsC(i)) { - *pi = int2sC(cast_int(i)); - return 1; - } - else - return 0; -} - - - -void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) { - if (k->k == VKSTR) - str2K(fs, k); - lua_assert(!hasjumps(t) && - (t->k == VLOCAL || t->k == VNONRELOC || t->k == VUPVAL)); - if (t->k == VUPVAL && !isKstr(fs, k)) - luaK_exp2anyreg(fs, t); - if (t->k == VUPVAL) { - lua_assert(isKstr(fs, k)); - t->u.ind.t = t->u.info; - t->u.ind.idx = k->u.info; - t->k = VINDEXUP; - } - else { - - t->u.ind.t = (t->k == VLOCAL) ? t->u.var.ridx: t->u.info; - if (isKstr(fs, k)) { - t->u.ind.idx = k->u.info; - t->k = VINDEXSTR; - } - else if (isCint(k)) { - t->u.ind.idx = cast_int(k->u.ival); - t->k = VINDEXI; - } - else { - t->u.ind.idx = luaK_exp2anyreg(fs, k); - t->k = VINDEXED; - } - } -} - - - -static int validop (int op, TValue *v1, TValue *v2) { - switch (op) { - case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: - case LUA_OPSHL: case LUA_OPSHR: case LUA_OPBNOT: { - lua_Integer i; - return (luaV_tointegerns(v1, &i, LUA_FLOORN2I) && - luaV_tointegerns(v2, &i, LUA_FLOORN2I)); - } - case LUA_OPDIV: case LUA_OPIDIV: case LUA_OPMOD: - return (nvalue(v2) != 0); - default: return 1; - } -} - - - -static int constfolding (FuncState *fs, int op, expdesc *e1, - const expdesc *e2) { - TValue v1, v2, res; - if (!tonumeral(e1, &v1) || !tonumeral(e2, &v2) || !validop(op, &v1, &v2)) - return 0; - luaO_rawarith(fs->ls->L, op, &v1, &v2, &res); - if (ttisinteger(&res)) { - e1->k = VKINT; - e1->u.ival = ivalue(&res); - } - else { - lua_Number n = fltvalue(&res); - if (luai_numisnan(n) || n == 0) - return 0; - e1->k = VKFLT; - e1->u.nval = n; - } - return 1; -} - - - -l_sinline OpCode binopr2op (BinOpr opr, BinOpr baser, OpCode base) { - lua_assert(baser <= opr && - ((baser == OPR_ADD && opr <= OPR_SHR) || - (baser == OPR_LT && opr <= OPR_LE))); - return cast(OpCode, (cast_int(opr) - cast_int(baser)) + cast_int(base)); -} - - - -l_sinline OpCode unopr2op (UnOpr opr) { - return cast(OpCode, (cast_int(opr) - cast_int(OPR_MINUS)) + - cast_int(OP_UNM)); -} - - - -l_sinline TMS binopr2TM (BinOpr opr) { - lua_assert(OPR_ADD <= opr && opr <= OPR_SHR); - return cast(TMS, (cast_int(opr) - cast_int(OPR_ADD)) + cast_int(TM_ADD)); -} - - - -static void codeunexpval (FuncState *fs, OpCode op, expdesc *e, int line) { - int r = luaK_exp2anyreg(fs, e); - freeexp(fs, e); - e->u.info = luaK_codeABC(fs, op, 0, r, 0); - e->k = VRELOC; - luaK_fixline(fs, line); -} - - - -static void finishbinexpval (FuncState *fs, expdesc *e1, expdesc *e2, - OpCode op, int v2, int flip, int line, - OpCode mmop, TMS event) { - int v1 = luaK_exp2anyreg(fs, e1); - int pc = luaK_codeABCk(fs, op, 0, v1, v2, 0); - freeexps(fs, e1, e2); - e1->u.info = pc; - e1->k = VRELOC; - luaK_fixline(fs, line); - luaK_codeABCk(fs, mmop, v1, v2, event, flip); - luaK_fixline(fs, line); -} - - - -static void codebinexpval (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - OpCode op = binopr2op(opr, OPR_ADD, OP_ADD); - int v2 = luaK_exp2anyreg(fs, e2); - - lua_assert((VNIL <= e1->k && e1->k <= VKSTR) || - e1->k == VNONRELOC || e1->k == VRELOC); - lua_assert(OP_ADD <= op && op <= OP_SHR); - finishbinexpval(fs, e1, e2, op, v2, 0, line, OP_MMBIN, binopr2TM(opr)); -} - - - -static void codebini (FuncState *fs, OpCode op, - expdesc *e1, expdesc *e2, int flip, int line, - TMS event) { - int v2 = int2sC(cast_int(e2->u.ival)); - lua_assert(e2->k == VKINT); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINI, event); -} - - - -static void codebinK (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - TMS event = binopr2TM(opr); - int v2 = e2->u.info; - OpCode op = binopr2op(opr, OPR_ADD, OP_ADDK); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINK, event); -} - - - -static int finishbinexpneg (FuncState *fs, expdesc *e1, expdesc *e2, - OpCode op, int line, TMS event) { - if (!isKint(e2)) - return 0; - else { - lua_Integer i2 = e2->u.ival; - if (!(fitsC(i2) && fitsC(-i2))) - return 0; - else { - int v2 = cast_int(i2); - finishbinexpval(fs, e1, e2, op, int2sC(-v2), 0, line, OP_MMBINI, event); - - SETARG_B(fs->f->code[fs->pc - 1], int2sC(v2)); - return 1; - } - } -} - - -static void swapexps (expdesc *e1, expdesc *e2) { - expdesc temp = *e1; *e1 = *e2; *e2 = temp; -} - - - -static void codebinNoK (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - if (flip) - swapexps(e1, e2); - codebinexpval(fs, opr, e1, e2, line); -} - - - -static void codearith (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - if (tonumeral(e2, NULL) && luaK_exp2K(fs, e2)) - codebinK(fs, opr, e1, e2, flip, line); - else - codebinNoK(fs, opr, e1, e2, flip, line); -} - - - -static void codecommutative (FuncState *fs, BinOpr op, - expdesc *e1, expdesc *e2, int line) { - int flip = 0; - if (tonumeral(e1, NULL)) { - swapexps(e1, e2); - flip = 1; - } - if (op == OPR_ADD && isSCint(e2)) - codebini(fs, OP_ADDI, e1, e2, flip, line, TM_ADD); - else - codearith(fs, op, e1, e2, flip, line); -} - - - -static void codebitwise (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - int flip = 0; - if (e1->k == VKINT) { - swapexps(e1, e2); - flip = 1; - } - if (e2->k == VKINT && luaK_exp2K(fs, e2)) - codebinK(fs, opr, e1, e2, flip, line); - else - codebinNoK(fs, opr, e1, e2, flip, line); -} - - - -static void codeorder (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { - int r1, r2; - int im; - int isfloat = 0; - OpCode op; - if (isSCnumber(e2, &im, &isfloat)) { - - r1 = luaK_exp2anyreg(fs, e1); - r2 = im; - op = binopr2op(opr, OPR_LT, OP_LTI); - } - else if (isSCnumber(e1, &im, &isfloat)) { - - r1 = luaK_exp2anyreg(fs, e2); - r2 = im; - op = binopr2op(opr, OPR_LT, OP_GTI); - } - else { - r1 = luaK_exp2anyreg(fs, e1); - r2 = luaK_exp2anyreg(fs, e2); - op = binopr2op(opr, OPR_LT, OP_LT); - } - freeexps(fs, e1, e2); - e1->u.info = condjump(fs, op, r1, r2, isfloat, 1); - e1->k = VJMP; -} - - - -static void codeeq (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { - int r1, r2; - int im; - int isfloat = 0; - OpCode op; - if (e1->k != VNONRELOC) { - lua_assert(e1->k == VK || e1->k == VKINT || e1->k == VKFLT); - swapexps(e1, e2); - } - r1 = luaK_exp2anyreg(fs, e1); - if (isSCnumber(e2, &im, &isfloat)) { - op = OP_EQI; - r2 = im; - } - else if (exp2RK(fs, e2)) { - op = OP_EQK; - r2 = e2->u.info; - } - else { - op = OP_EQ; - r2 = luaK_exp2anyreg(fs, e2); - } - freeexps(fs, e1, e2); - e1->u.info = condjump(fs, op, r1, r2, isfloat, (opr == OPR_EQ)); - e1->k = VJMP; -} - - - -void luaK_prefix (FuncState *fs, UnOpr opr, expdesc *e, int line) { - static const expdesc ef = {VKINT, {0}, NO_JUMP, NO_JUMP}; - luaK_dischargevars(fs, e); - switch (opr) { - case OPR_MINUS: case OPR_BNOT: - if (constfolding(fs, opr + LUA_OPUNM, e, &ef)) - break; - - case OPR_LEN: - codeunexpval(fs, unopr2op(opr), e, line); - break; - case OPR_NOT: codenot(fs, e); break; - default: lua_assert(0); - } -} - - - -void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) { - luaK_dischargevars(fs, v); - switch (op) { - case OPR_AND: { - luaK_goiftrue(fs, v); - break; - } - case OPR_OR: { - luaK_goiffalse(fs, v); - break; - } - case OPR_CONCAT: { - luaK_exp2nextreg(fs, v); - break; - } - case OPR_ADD: case OPR_SUB: - case OPR_MUL: case OPR_DIV: case OPR_IDIV: - case OPR_MOD: case OPR_POW: - case OPR_BAND: case OPR_BOR: case OPR_BXOR: - case OPR_SHL: case OPR_SHR: { - if (!tonumeral(v, NULL)) - luaK_exp2anyreg(fs, v); - - break; - } - case OPR_EQ: case OPR_NE: { - if (!tonumeral(v, NULL)) - exp2RK(fs, v); - - break; - } - case OPR_LT: case OPR_LE: - case OPR_GT: case OPR_GE: { - int dummy, dummy2; - if (!isSCnumber(v, &dummy, &dummy2)) - luaK_exp2anyreg(fs, v); - - break; - } - default: lua_assert(0); - } -} - - -static void codeconcat (FuncState *fs, expdesc *e1, expdesc *e2, int line) { - Instruction *ie2 = previousinstruction(fs); - if (GET_OPCODE(*ie2) == OP_CONCAT) { - int n = GETARG_B(*ie2); - lua_assert(e1->u.info + 1 == GETARG_A(*ie2)); - freeexp(fs, e2); - SETARG_A(*ie2, e1->u.info); - SETARG_B(*ie2, n + 1); - } - else { - luaK_codeABC(fs, OP_CONCAT, e1->u.info, 2, 0); - freeexp(fs, e2); - luaK_fixline(fs, line); - } -} - - - -void luaK_posfix (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - luaK_dischargevars(fs, e2); - if (foldbinop(opr) && constfolding(fs, opr + LUA_OPADD, e1, e2)) - return; - switch (opr) { - case OPR_AND: { - lua_assert(e1->t == NO_JUMP); - luaK_concat(fs, &e2->f, e1->f); - *e1 = *e2; - break; - } - case OPR_OR: { - lua_assert(e1->f == NO_JUMP); - luaK_concat(fs, &e2->t, e1->t); - *e1 = *e2; - break; - } - case OPR_CONCAT: { - luaK_exp2nextreg(fs, e2); - codeconcat(fs, e1, e2, line); - break; - } - case OPR_ADD: case OPR_MUL: { - codecommutative(fs, opr, e1, e2, line); - break; - } - case OPR_SUB: { - if (finishbinexpneg(fs, e1, e2, OP_ADDI, line, TM_SUB)) - break; - - } - case OPR_DIV: case OPR_IDIV: case OPR_MOD: case OPR_POW: { - codearith(fs, opr, e1, e2, 0, line); - break; - } - case OPR_BAND: case OPR_BOR: case OPR_BXOR: { - codebitwise(fs, opr, e1, e2, line); - break; - } - case OPR_SHL: { - if (isSCint(e1)) { - swapexps(e1, e2); - codebini(fs, OP_SHLI, e1, e2, 1, line, TM_SHL); - } - else if (finishbinexpneg(fs, e1, e2, OP_SHRI, line, TM_SHL)) { - ; - } - else - codebinexpval(fs, opr, e1, e2, line); - break; - } - case OPR_SHR: { - if (isSCint(e2)) - codebini(fs, OP_SHRI, e1, e2, 0, line, TM_SHR); - else - codebinexpval(fs, opr, e1, e2, line); - break; - } - case OPR_EQ: case OPR_NE: { - codeeq(fs, opr, e1, e2); - break; - } - case OPR_GT: case OPR_GE: { - - swapexps(e1, e2); - opr = cast(BinOpr, (opr - OPR_GT) + OPR_LT); - } - case OPR_LT: case OPR_LE: { - codeorder(fs, opr, e1, e2); - break; - } - default: lua_assert(0); - } -} - - - -void luaK_fixline (FuncState *fs, int line) { - removelastlineinfo(fs); - savelineinfo(fs, fs->f, line); -} - - -void luaK_settablesize (FuncState *fs, int pc, int ra, int asize, int hsize) { - Instruction *inst = &fs->f->code[pc]; - int rb = (hsize != 0) ? luaO_ceillog2(hsize) + 1 : 0; - int extra = asize / (MAXARG_C + 1); - int rc = asize % (MAXARG_C + 1); - int k = (extra > 0); - *inst = CREATE_ABCk(OP_NEWTABLE, ra, rb, rc, k); - *(inst + 1) = CREATE_Ax(OP_EXTRAARG, extra); -} - - - -void luaK_setlist (FuncState *fs, int base, int nelems, int tostore) { - lua_assert(tostore != 0 && tostore <= LFIELDS_PER_FLUSH); - if (tostore == LUA_MULTRET) - tostore = 0; - if (nelems <= MAXARG_C) - luaK_codeABC(fs, OP_SETLIST, base, tostore, nelems); - else { - int extra = nelems / (MAXARG_C + 1); - nelems %= (MAXARG_C + 1); - luaK_codeABCk(fs, OP_SETLIST, base, tostore, nelems, 1); - codeextraarg(fs, extra); - } - fs->freereg = base + 1; -} - - - -static int finaltarget (Instruction *code, int i) { - int count; - for (count = 0; count < 100; count++) { - Instruction pc = code[i]; - if (GET_OPCODE(pc) != OP_JMP) - break; - else - i += GETARG_sJ(pc) + 1; - } - return i; -} - - - -void luaK_finish (FuncState *fs) { - int i; - Proto *p = fs->f; - for (i = 0; i < fs->pc; i++) { - Instruction *pc = &p->code[i]; - lua_assert(i == 0 || isOT(*(pc - 1)) == isIT(*pc)); - switch (GET_OPCODE(*pc)) { - case OP_RETURN0: case OP_RETURN1: { - if (!(fs->needclose || (p->flag & PF_ISVARARG))) - break; - - SET_OPCODE(*pc, OP_RETURN); - } - case OP_RETURN: case OP_TAILCALL: { - if (fs->needclose) - SETARG_k(*pc, 1); - if (p->flag & PF_ISVARARG) - SETARG_C(*pc, p->numparams + 1); - break; - } - case OP_JMP: { - int target = finaltarget(p->code, i); - fixjump(fs, i, target); - break; - } - default: break; - } - } -} - - -//path: src/imports/../dependencies/lua/lparser.c - - -#define lparser_c -#define LUA_CORE - - - - - -#include -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -#define MAXVARS 200 - - -#define hasmultret(k) ((k) == VCALL || (k) == VVARARG) - - - -#define eqstr(a,b) ((a) == (b)) - - - -typedef struct BlockCnt { - struct BlockCnt *previous; - int firstlabel; - int firstgoto; - lu_byte nactvar; - lu_byte upval; - lu_byte isloop; - lu_byte insidetbc; -} BlockCnt; - - - - -static void statement (LexState *ls); -static void expr (LexState *ls, expdesc *v); - - -static l_noret error_expected (LexState *ls, int token) { - luaX_syntaxerror(ls, - luaO_pushfstring(ls->L, "%s expected", luaX_token2str(ls, token))); -} - - -static l_noret errorlimit (FuncState *fs, int limit, const char *what) { - lua_State *L = fs->ls->L; - const char *msg; - int line = fs->f->linedefined; - const char *where = (line == 0) - ? "main function" - : luaO_pushfstring(L, "function at line %d", line); - msg = luaO_pushfstring(L, "too many %s (limit is %d) in %s", - what, limit, where); - luaX_syntaxerror(fs->ls, msg); -} - - -static void checklimit (FuncState *fs, int v, int l, const char *what) { - if (v > l) errorlimit(fs, l, what); -} - - - -static int testnext (LexState *ls, int c) { - if (ls->t.token == c) { - luaX_next(ls); - return 1; - } - else return 0; -} - - - -static void check (LexState *ls, int c) { - if (ls->t.token != c) - error_expected(ls, c); -} - - - -static void checknext (LexState *ls, int c) { - check(ls, c); - luaX_next(ls); -} - - -#define check_condition(ls,c,msg) { if (!(c)) luaX_syntaxerror(ls, msg); } - - - -static void check_match (LexState *ls, int what, int who, int where) { - if (l_unlikely(!testnext(ls, what))) { - if (where == ls->linenumber) - error_expected(ls, what); - else { - luaX_syntaxerror(ls, luaO_pushfstring(ls->L, - "%s expected (to close %s at line %d)", - luaX_token2str(ls, what), luaX_token2str(ls, who), where)); - } - } -} - - -static TString *str_checkname (LexState *ls) { - TString *ts; - check(ls, TK_NAME); - ts = ls->t.seminfo.ts; - luaX_next(ls); - return ts; -} - - -static void init_exp (expdesc *e, expkind k, int i) { - e->f = e->t = NO_JUMP; - e->k = k; - e->u.info = i; -} - - -static void codestring (expdesc *e, TString *s) { - e->f = e->t = NO_JUMP; - e->k = VKSTR; - e->u.strval = s; -} - - -static void codename (LexState *ls, expdesc *e) { - codestring(e, str_checkname(ls)); -} - - - -static int registerlocalvar (LexState *ls, FuncState *fs, TString *varname) { - Proto *f = fs->f; - int oldsize = f->sizelocvars; - luaM_growvector(ls->L, f->locvars, fs->ndebugvars, f->sizelocvars, - LocVar, SHRT_MAX, "local variables"); - while (oldsize < f->sizelocvars) - f->locvars[oldsize++].varname = NULL; - f->locvars[fs->ndebugvars].varname = varname; - f->locvars[fs->ndebugvars].startpc = fs->pc; - luaC_objbarrier(ls->L, f, varname); - return fs->ndebugvars++; -} - - - -static int new_localvarkind (LexState *ls, TString *name, int kind) { - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Dyndata *dyd = ls->dyd; - Vardesc *var; - checklimit(fs, dyd->actvar.n + 1 - fs->firstlocal, - MAXVARS, "local variables"); - luaM_growvector(L, dyd->actvar.arr, dyd->actvar.n + 1, - dyd->actvar.size, Vardesc, USHRT_MAX, "local variables"); - var = &dyd->actvar.arr[dyd->actvar.n++]; - var->vd.kind = kind; - var->vd.name = name; - return dyd->actvar.n - 1 - fs->firstlocal; -} - - - -static int new_localvar (LexState *ls, TString *name) { - return new_localvarkind(ls, name, VDKREG); -} - -#define new_localvarliteral(ls,v) \ - new_localvar(ls, \ - luaX_newstring(ls, "" v, (sizeof(v)/sizeof(char)) - 1)); - - - - -static Vardesc *getlocalvardesc (FuncState *fs, int vidx) { - return &fs->ls->dyd->actvar.arr[fs->firstlocal + vidx]; -} - - - -static int reglevel (FuncState *fs, int nvar) { - while (nvar-- > 0) { - Vardesc *vd = getlocalvardesc(fs, nvar); - if (vd->vd.kind != RDKCTC) - return vd->vd.ridx + 1; - } - return 0; -} - - - -int luaY_nvarstack (FuncState *fs) { - return reglevel(fs, fs->nactvar); -} - - - -static LocVar *localdebuginfo (FuncState *fs, int vidx) { - Vardesc *vd = getlocalvardesc(fs, vidx); - if (vd->vd.kind == RDKCTC) - return NULL; - else { - int idx = vd->vd.pidx; - lua_assert(idx < fs->ndebugvars); - return &fs->f->locvars[idx]; - } -} - - - -static void init_var (FuncState *fs, expdesc *e, int vidx) { - e->f = e->t = NO_JUMP; - e->k = VLOCAL; - e->u.var.vidx = vidx; - e->u.var.ridx = getlocalvardesc(fs, vidx)->vd.ridx; -} - - - -static void check_readonly (LexState *ls, expdesc *e) { - FuncState *fs = ls->fs; - TString *varname = NULL; - switch (e->k) { - case VCONST: { - varname = ls->dyd->actvar.arr[e->u.info].vd.name; - break; - } - case VLOCAL: { - Vardesc *vardesc = getlocalvardesc(fs, e->u.var.vidx); - if (vardesc->vd.kind != VDKREG) - varname = vardesc->vd.name; - break; - } - case VUPVAL: { - Upvaldesc *up = &fs->f->upvalues[e->u.info]; - if (up->kind != VDKREG) - varname = up->name; - break; - } - default: - return; - } - if (varname) { - const char *msg = luaO_pushfstring(ls->L, - "attempt to assign to const variable '%s'", getstr(varname)); - luaK_semerror(ls, msg); - } -} - - - -static void adjustlocalvars (LexState *ls, int nvars) { - FuncState *fs = ls->fs; - int reglevel = luaY_nvarstack(fs); - int i; - for (i = 0; i < nvars; i++) { - int vidx = fs->nactvar++; - Vardesc *var = getlocalvardesc(fs, vidx); - var->vd.ridx = reglevel++; - var->vd.pidx = registerlocalvar(ls, fs, var->vd.name); - } -} - - - -static void removevars (FuncState *fs, int tolevel) { - fs->ls->dyd->actvar.n -= (fs->nactvar - tolevel); - while (fs->nactvar > tolevel) { - LocVar *var = localdebuginfo(fs, --fs->nactvar); - if (var) - var->endpc = fs->pc; - } -} - - - -static int searchupvalue (FuncState *fs, TString *name) { - int i; - Upvaldesc *up = fs->f->upvalues; - for (i = 0; i < fs->nups; i++) { - if (eqstr(up[i].name, name)) return i; - } - return -1; -} - - -static Upvaldesc *allocupvalue (FuncState *fs) { - Proto *f = fs->f; - int oldsize = f->sizeupvalues; - checklimit(fs, fs->nups + 1, MAXUPVAL, "upvalues"); - luaM_growvector(fs->ls->L, f->upvalues, fs->nups, f->sizeupvalues, - Upvaldesc, MAXUPVAL, "upvalues"); - while (oldsize < f->sizeupvalues) - f->upvalues[oldsize++].name = NULL; - return &f->upvalues[fs->nups++]; -} - - -static int newupvalue (FuncState *fs, TString *name, expdesc *v) { - Upvaldesc *up = allocupvalue(fs); - FuncState *prev = fs->prev; - if (v->k == VLOCAL) { - up->instack = 1; - up->idx = v->u.var.ridx; - up->kind = getlocalvardesc(prev, v->u.var.vidx)->vd.kind; - lua_assert(eqstr(name, getlocalvardesc(prev, v->u.var.vidx)->vd.name)); - } - else { - up->instack = 0; - up->idx = cast_byte(v->u.info); - up->kind = prev->f->upvalues[v->u.info].kind; - lua_assert(eqstr(name, prev->f->upvalues[v->u.info].name)); - } - up->name = name; - luaC_objbarrier(fs->ls->L, fs->f, name); - return fs->nups - 1; -} - - - -static int searchvar (FuncState *fs, TString *n, expdesc *var) { - int i; - for (i = cast_int(fs->nactvar) - 1; i >= 0; i--) { - Vardesc *vd = getlocalvardesc(fs, i); - if (eqstr(n, vd->vd.name)) { - if (vd->vd.kind == RDKCTC) - init_exp(var, VCONST, fs->firstlocal + i); - else - init_var(fs, var, i); - return var->k; - } - } - return -1; -} - - - -static void markupval (FuncState *fs, int level) { - BlockCnt *bl = fs->bl; - while (bl->nactvar > level) - bl = bl->previous; - bl->upval = 1; - fs->needclose = 1; -} - - - -static void marktobeclosed (FuncState *fs) { - BlockCnt *bl = fs->bl; - bl->upval = 1; - bl->insidetbc = 1; - fs->needclose = 1; -} - - - -static void singlevaraux (FuncState *fs, TString *n, expdesc *var, int base) { - if (fs == NULL) - init_exp(var, VVOID, 0); - else { - int v = searchvar(fs, n, var); - if (v >= 0) { - if (v == VLOCAL && !base) - markupval(fs, var->u.var.vidx); - } - else { - int idx = searchupvalue(fs, n); - if (idx < 0) { - singlevaraux(fs->prev, n, var, 0); - if (var->k == VLOCAL || var->k == VUPVAL) - idx = newupvalue(fs, n, var); - else - return; - } - init_exp(var, VUPVAL, idx); - } - } -} - - - -static void singlevar (LexState *ls, expdesc *var) { - TString *varname = str_checkname(ls); - FuncState *fs = ls->fs; - singlevaraux(fs, varname, var, 1); - if (var->k == VVOID) { - expdesc key; - singlevaraux(fs, ls->envn, var, 1); - lua_assert(var->k != VVOID); - luaK_exp2anyregup(fs, var); - codestring(&key, varname); - luaK_indexed(fs, var, &key); - } -} - - - -static void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) { - FuncState *fs = ls->fs; - int needed = nvars - nexps; - if (hasmultret(e->k)) { - int extra = needed + 1; - if (extra < 0) - extra = 0; - luaK_setreturns(fs, e, extra); - } - else { - if (e->k != VVOID) - luaK_exp2nextreg(fs, e); - if (needed > 0) - luaK_nil(fs, fs->freereg, needed); - } - if (needed > 0) - luaK_reserveregs(fs, needed); - else - fs->freereg += needed; -} - - -#define enterlevel(ls) luaE_incCstack(ls->L) - - -#define leavelevel(ls) ((ls)->L->nCcalls--) - - - -static l_noret jumpscopeerror (LexState *ls, Labeldesc *gt) { - TString *tsname = getlocalvardesc(ls->fs, gt->nactvar)->vd.name; - const char *varname = getstr(tsname); - const char *msg = " at line %d jumps into the scope of local '%s'"; - msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line, varname); - luaK_semerror(ls, msg); -} - - - -static void solvegoto (LexState *ls, int g, Labeldesc *label) { - int i; - Labellist *gl = &ls->dyd->gt; - Labeldesc *gt = &gl->arr[g]; - lua_assert(eqstr(gt->name, label->name)); - if (l_unlikely(gt->nactvar < label->nactvar)) - jumpscopeerror(ls, gt); - luaK_patchlist(ls->fs, gt->pc, label->pc); - for (i = g; i < gl->n - 1; i++) - gl->arr[i] = gl->arr[i + 1]; - gl->n--; -} - - - -static Labeldesc *findlabel (LexState *ls, TString *name) { - int i; - Dyndata *dyd = ls->dyd; - - for (i = ls->fs->firstlabel; i < dyd->label.n; i++) { - Labeldesc *lb = &dyd->label.arr[i]; - if (eqstr(lb->name, name)) - return lb; - } - return NULL; -} - - - -static int newlabelentry (LexState *ls, Labellist *l, TString *name, - int line, int pc) { - int n = l->n; - luaM_growvector(ls->L, l->arr, n, l->size, - Labeldesc, SHRT_MAX, "labels/gotos"); - l->arr[n].name = name; - l->arr[n].line = line; - l->arr[n].nactvar = ls->fs->nactvar; - l->arr[n].close = 0; - l->arr[n].pc = pc; - l->n = n + 1; - return n; -} - - -static int newgotoentry (LexState *ls, TString *name, int line, int pc) { - return newlabelentry(ls, &ls->dyd->gt, name, line, pc); -} - - - -static int solvegotos (LexState *ls, Labeldesc *lb) { - Labellist *gl = &ls->dyd->gt; - int i = ls->fs->bl->firstgoto; - int needsclose = 0; - while (i < gl->n) { - if (eqstr(gl->arr[i].name, lb->name)) { - needsclose |= gl->arr[i].close; - solvegoto(ls, i, lb); - } - else - i++; - } - return needsclose; -} - - - -static int createlabel (LexState *ls, TString *name, int line, - int last) { - FuncState *fs = ls->fs; - Labellist *ll = &ls->dyd->label; - int l = newlabelentry(ls, ll, name, line, luaK_getlabel(fs)); - if (last) { - - ll->arr[l].nactvar = fs->bl->nactvar; - } - if (solvegotos(ls, &ll->arr[l])) { - luaK_codeABC(fs, OP_CLOSE, luaY_nvarstack(fs), 0, 0); - return 1; - } - return 0; -} - - - -static void movegotosout (FuncState *fs, BlockCnt *bl) { - int i; - Labellist *gl = &fs->ls->dyd->gt; - - for (i = bl->firstgoto; i < gl->n; i++) { - Labeldesc *gt = &gl->arr[i]; - - if (reglevel(fs, gt->nactvar) > reglevel(fs, bl->nactvar)) - gt->close |= bl->upval; - gt->nactvar = bl->nactvar; - } -} - - -static void enterblock (FuncState *fs, BlockCnt *bl, lu_byte isloop) { - bl->isloop = isloop; - bl->nactvar = fs->nactvar; - bl->firstlabel = fs->ls->dyd->label.n; - bl->firstgoto = fs->ls->dyd->gt.n; - bl->upval = 0; - bl->insidetbc = (fs->bl != NULL && fs->bl->insidetbc); - bl->previous = fs->bl; - fs->bl = bl; - lua_assert(fs->freereg == luaY_nvarstack(fs)); -} - - - -static l_noret undefgoto (LexState *ls, Labeldesc *gt) { - const char *msg; - if (eqstr(gt->name, luaS_newliteral(ls->L, "break"))) { - msg = "break outside loop at line %d"; - msg = luaO_pushfstring(ls->L, msg, gt->line); - } - else { - msg = "no visible label '%s' for at line %d"; - msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line); - } - luaK_semerror(ls, msg); -} - - -static void leaveblock (FuncState *fs) { - BlockCnt *bl = fs->bl; - LexState *ls = fs->ls; - int hasclose = 0; - int stklevel = reglevel(fs, bl->nactvar); - removevars(fs, bl->nactvar); - lua_assert(bl->nactvar == fs->nactvar); - if (bl->isloop) - hasclose = createlabel(ls, luaS_newliteral(ls->L, "break"), 0, 0); - if (!hasclose && bl->previous && bl->upval) - luaK_codeABC(fs, OP_CLOSE, stklevel, 0, 0); - fs->freereg = stklevel; - ls->dyd->label.n = bl->firstlabel; - fs->bl = bl->previous; - if (bl->previous) - movegotosout(fs, bl); - else { - if (bl->firstgoto < ls->dyd->gt.n) - undefgoto(ls, &ls->dyd->gt.arr[bl->firstgoto]); - } -} - - - -static Proto *addprototype (LexState *ls) { - Proto *clp; - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Proto *f = fs->f; - if (fs->np >= f->sizep) { - int oldsize = f->sizep; - luaM_growvector(L, f->p, fs->np, f->sizep, Proto *, MAXARG_Bx, "functions"); - while (oldsize < f->sizep) - f->p[oldsize++] = NULL; - } - f->p[fs->np++] = clp = luaF_newproto(L); - luaC_objbarrier(L, f, clp); - return clp; -} - - - -static void codeclosure (LexState *ls, expdesc *v) { - FuncState *fs = ls->fs->prev; - init_exp(v, VRELOC, luaK_codeABx(fs, OP_CLOSURE, 0, fs->np - 1)); - luaK_exp2nextreg(fs, v); -} - - -static void open_func (LexState *ls, FuncState *fs, BlockCnt *bl) { - Proto *f = fs->f; - fs->prev = ls->fs; - fs->ls = ls; - ls->fs = fs; - fs->pc = 0; - fs->previousline = f->linedefined; - fs->iwthabs = 0; - fs->lasttarget = 0; - fs->freereg = 0; - fs->nk = 0; - fs->nabslineinfo = 0; - fs->np = 0; - fs->nups = 0; - fs->ndebugvars = 0; - fs->nactvar = 0; - fs->needclose = 0; - fs->firstlocal = ls->dyd->actvar.n; - fs->firstlabel = ls->dyd->label.n; - fs->bl = NULL; - f->source = ls->source; - luaC_objbarrier(ls->L, f, f->source); - f->maxstacksize = 2; - enterblock(fs, bl, 0); -} - - -static void close_func (LexState *ls) { - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Proto *f = fs->f; - luaK_ret(fs, luaY_nvarstack(fs), 0); - leaveblock(fs); - lua_assert(fs->bl == NULL); - luaK_finish(fs); - luaM_shrinkvector(L, f->code, f->sizecode, fs->pc, Instruction); - luaM_shrinkvector(L, f->lineinfo, f->sizelineinfo, fs->pc, ls_byte); - luaM_shrinkvector(L, f->abslineinfo, f->sizeabslineinfo, - fs->nabslineinfo, AbsLineInfo); - luaM_shrinkvector(L, f->k, f->sizek, fs->nk, TValue); - luaM_shrinkvector(L, f->p, f->sizep, fs->np, Proto *); - luaM_shrinkvector(L, f->locvars, f->sizelocvars, fs->ndebugvars, LocVar); - luaM_shrinkvector(L, f->upvalues, f->sizeupvalues, fs->nups, Upvaldesc); - ls->fs = fs->prev; - luaC_checkGC(L); -} - - - - - - - - - -static int block_follow (LexState *ls, int withuntil) { - switch (ls->t.token) { - case TK_ELSE: case TK_ELSEIF: - case TK_END: case TK_EOS: - return 1; - case TK_UNTIL: return withuntil; - default: return 0; - } -} - - -static void statlist (LexState *ls) { - - while (!block_follow(ls, 1)) { - if (ls->t.token == TK_RETURN) { - statement(ls); - return; - } - statement(ls); - } -} - - -static void fieldsel (LexState *ls, expdesc *v) { - - FuncState *fs = ls->fs; - expdesc key; - luaK_exp2anyregup(fs, v); - luaX_next(ls); - codename(ls, &key); - luaK_indexed(fs, v, &key); -} - - -static void yindex (LexState *ls, expdesc *v) { - - luaX_next(ls); - expr(ls, v); - luaK_exp2val(ls->fs, v); - checknext(ls, ']'); -} - - - - - -typedef struct ConsControl { - expdesc v; - expdesc *t; - int nh; - int na; - int tostore; -} ConsControl; - - -static void recfield (LexState *ls, ConsControl *cc) { - - FuncState *fs = ls->fs; - int reg = ls->fs->freereg; - expdesc tab, key, val; - if (ls->t.token == TK_NAME) { - checklimit(fs, cc->nh, MAX_INT, "items in a constructor"); - codename(ls, &key); - } - else - yindex(ls, &key); - cc->nh++; - checknext(ls, '='); - tab = *cc->t; - luaK_indexed(fs, &tab, &key); - expr(ls, &val); - luaK_storevar(fs, &tab, &val); - fs->freereg = reg; -} - - -static void closelistfield (FuncState *fs, ConsControl *cc) { - if (cc->v.k == VVOID) return; - luaK_exp2nextreg(fs, &cc->v); - cc->v.k = VVOID; - if (cc->tostore == LFIELDS_PER_FLUSH) { - luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); - cc->na += cc->tostore; - cc->tostore = 0; - } -} - - -static void lastlistfield (FuncState *fs, ConsControl *cc) { - if (cc->tostore == 0) return; - if (hasmultret(cc->v.k)) { - luaK_setmultret(fs, &cc->v); - luaK_setlist(fs, cc->t->u.info, cc->na, LUA_MULTRET); - cc->na--; - } - else { - if (cc->v.k != VVOID) - luaK_exp2nextreg(fs, &cc->v); - luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); - } - cc->na += cc->tostore; -} - - -static void listfield (LexState *ls, ConsControl *cc) { - - expr(ls, &cc->v); - cc->tostore++; -} - - -static void field (LexState *ls, ConsControl *cc) { - - switch(ls->t.token) { - case TK_NAME: { - if (luaX_lookahead(ls) != '=') - listfield(ls, cc); - else - recfield(ls, cc); - break; - } - case '[': { - recfield(ls, cc); - break; - } - default: { - listfield(ls, cc); - break; - } - } -} - - -static void constructor (LexState *ls, expdesc *t) { - - FuncState *fs = ls->fs; - int line = ls->linenumber; - int pc = luaK_codeABC(fs, OP_NEWTABLE, 0, 0, 0); - ConsControl cc; - luaK_code(fs, 0); - cc.na = cc.nh = cc.tostore = 0; - cc.t = t; - init_exp(t, VNONRELOC, fs->freereg); - luaK_reserveregs(fs, 1); - init_exp(&cc.v, VVOID, 0); - checknext(ls, '{'); - do { - lua_assert(cc.v.k == VVOID || cc.tostore > 0); - if (ls->t.token == '}') break; - closelistfield(fs, &cc); - field(ls, &cc); - } while (testnext(ls, ',') || testnext(ls, ';')); - check_match(ls, '}', '{', line); - lastlistfield(fs, &cc); - luaK_settablesize(fs, pc, t->u.info, cc.na, cc.nh); -} - - - - -static void setvararg (FuncState *fs, int nparams) { - fs->f->flag |= PF_ISVARARG; - luaK_codeABC(fs, OP_VARARGPREP, nparams, 0, 0); -} - - -static void parlist (LexState *ls) { - - FuncState *fs = ls->fs; - Proto *f = fs->f; - int nparams = 0; - int isvararg = 0; - if (ls->t.token != ')') { - do { - switch (ls->t.token) { - case TK_NAME: { - new_localvar(ls, str_checkname(ls)); - nparams++; - break; - } - case TK_DOTS: { - luaX_next(ls); - isvararg = 1; - break; - } - default: luaX_syntaxerror(ls, " or '...' expected"); - } - } while (!isvararg && testnext(ls, ',')); - } - adjustlocalvars(ls, nparams); - f->numparams = cast_byte(fs->nactvar); - if (isvararg) - setvararg(fs, f->numparams); - luaK_reserveregs(fs, fs->nactvar); -} - - -static void body (LexState *ls, expdesc *e, int ismethod, int line) { - - FuncState new_fs; - BlockCnt bl; - new_fs.f = addprototype(ls); - new_fs.f->linedefined = line; - open_func(ls, &new_fs, &bl); - checknext(ls, '('); - if (ismethod) { - new_localvarliteral(ls, "self"); - adjustlocalvars(ls, 1); - } - parlist(ls); - checknext(ls, ')'); - statlist(ls); - new_fs.f->lastlinedefined = ls->linenumber; - check_match(ls, TK_END, TK_FUNCTION, line); - codeclosure(ls, e); - close_func(ls); -} - - -static int explist (LexState *ls, expdesc *v) { - - int n = 1; - expr(ls, v); - while (testnext(ls, ',')) { - luaK_exp2nextreg(ls->fs, v); - expr(ls, v); - n++; - } - return n; -} - - -static void funcargs (LexState *ls, expdesc *f) { - FuncState *fs = ls->fs; - expdesc args; - int base, nparams; - int line = ls->linenumber; - switch (ls->t.token) { - case '(': { - luaX_next(ls); - if (ls->t.token == ')') - args.k = VVOID; - else { - explist(ls, &args); - if (hasmultret(args.k)) - luaK_setmultret(fs, &args); - } - check_match(ls, ')', '(', line); - break; - } - case '{': { - constructor(ls, &args); - break; - } - case TK_STRING: { - codestring(&args, ls->t.seminfo.ts); - luaX_next(ls); - break; - } - default: { - luaX_syntaxerror(ls, "function arguments expected"); - } - } - lua_assert(f->k == VNONRELOC); - base = f->u.info; - if (hasmultret(args.k)) - nparams = LUA_MULTRET; - else { - if (args.k != VVOID) - luaK_exp2nextreg(fs, &args); - nparams = fs->freereg - (base+1); - } - init_exp(f, VCALL, luaK_codeABC(fs, OP_CALL, base, nparams+1, 2)); - luaK_fixline(fs, line); - fs->freereg = base+1; -} - - - - - - - -static void primaryexp (LexState *ls, expdesc *v) { - - switch (ls->t.token) { - case '(': { - int line = ls->linenumber; - luaX_next(ls); - expr(ls, v); - check_match(ls, ')', '(', line); - luaK_dischargevars(ls->fs, v); - return; - } - case TK_NAME: { - singlevar(ls, v); - return; - } - default: { - luaX_syntaxerror(ls, "unexpected symbol"); - } - } -} - - -static void suffixedexp (LexState *ls, expdesc *v) { - - FuncState *fs = ls->fs; - primaryexp(ls, v); - for (;;) { - switch (ls->t.token) { - case '.': { - fieldsel(ls, v); - break; - } - case '[': { - expdesc key; - luaK_exp2anyregup(fs, v); - yindex(ls, &key); - luaK_indexed(fs, v, &key); - break; - } - case ':': { - expdesc key; - luaX_next(ls); - codename(ls, &key); - luaK_self(fs, v, &key); - funcargs(ls, v); - break; - } - case '(': case TK_STRING: case '{': { - luaK_exp2nextreg(fs, v); - funcargs(ls, v); - break; - } - default: return; - } - } -} - - -static void simpleexp (LexState *ls, expdesc *v) { - - switch (ls->t.token) { - case TK_FLT: { - init_exp(v, VKFLT, 0); - v->u.nval = ls->t.seminfo.r; - break; - } - case TK_INT: { - init_exp(v, VKINT, 0); - v->u.ival = ls->t.seminfo.i; - break; - } - case TK_STRING: { - codestring(v, ls->t.seminfo.ts); - break; - } - case TK_NIL: { - init_exp(v, VNIL, 0); - break; - } - case TK_TRUE: { - init_exp(v, VTRUE, 0); - break; - } - case TK_FALSE: { - init_exp(v, VFALSE, 0); - break; - } - case TK_DOTS: { - FuncState *fs = ls->fs; - check_condition(ls, fs->f->flag & PF_ISVARARG, - "cannot use '...' outside a vararg function"); - init_exp(v, VVARARG, luaK_codeABC(fs, OP_VARARG, 0, 0, 1)); - break; - } - case '{': { - constructor(ls, v); - return; - } - case TK_FUNCTION: { - luaX_next(ls); - body(ls, v, 0, ls->linenumber); - return; - } - default: { - suffixedexp(ls, v); - return; - } - } - luaX_next(ls); -} - - -static UnOpr getunopr (int op) { - switch (op) { - case TK_NOT: return OPR_NOT; - case '-': return OPR_MINUS; - case '~': return OPR_BNOT; - case '#': return OPR_LEN; - default: return OPR_NOUNOPR; - } -} - - -static BinOpr getbinopr (int op) { - switch (op) { - case '+': return OPR_ADD; - case '-': return OPR_SUB; - case '*': return OPR_MUL; - case '%': return OPR_MOD; - case '^': return OPR_POW; - case '/': return OPR_DIV; - case TK_IDIV: return OPR_IDIV; - case '&': return OPR_BAND; - case '|': return OPR_BOR; - case '~': return OPR_BXOR; - case TK_SHL: return OPR_SHL; - case TK_SHR: return OPR_SHR; - case TK_CONCAT: return OPR_CONCAT; - case TK_NE: return OPR_NE; - case TK_EQ: return OPR_EQ; - case '<': return OPR_LT; - case TK_LE: return OPR_LE; - case '>': return OPR_GT; - case TK_GE: return OPR_GE; - case TK_AND: return OPR_AND; - case TK_OR: return OPR_OR; - default: return OPR_NOBINOPR; - } -} - - - -static const struct { - lu_byte left; - lu_byte right; -} priority[] = { - {10, 10}, {10, 10}, - {11, 11}, {11, 11}, - {14, 13}, - {11, 11}, {11, 11}, - {6, 6}, {4, 4}, {5, 5}, - {7, 7}, {7, 7}, - {9, 8}, - {3, 3}, {3, 3}, {3, 3}, - {3, 3}, {3, 3}, {3, 3}, - {2, 2}, {1, 1} -}; - -#define UNARY_PRIORITY 12 - - - -static BinOpr subexpr (LexState *ls, expdesc *v, int limit) { - BinOpr op; - UnOpr uop; - enterlevel(ls); - uop = getunopr(ls->t.token); - if (uop != OPR_NOUNOPR) { - int line = ls->linenumber; - luaX_next(ls); - subexpr(ls, v, UNARY_PRIORITY); - luaK_prefix(ls->fs, uop, v, line); - } - else simpleexp(ls, v); - - op = getbinopr(ls->t.token); - while (op != OPR_NOBINOPR && priority[op].left > limit) { - expdesc v2; - BinOpr nextop; - int line = ls->linenumber; - luaX_next(ls); - luaK_infix(ls->fs, op, v); - - nextop = subexpr(ls, &v2, priority[op].right); - luaK_posfix(ls->fs, op, v, &v2, line); - op = nextop; - } - leavelevel(ls); - return op; -} - - -static void expr (LexState *ls, expdesc *v) { - subexpr(ls, v, 0); -} - - - - - - - - -static void block (LexState *ls) { - - FuncState *fs = ls->fs; - BlockCnt bl; - enterblock(fs, &bl, 0); - statlist(ls); - leaveblock(fs); -} - - - -struct LHS_assign { - struct LHS_assign *prev; - expdesc v; -}; - - - -static void check_conflict (LexState *ls, struct LHS_assign *lh, expdesc *v) { - FuncState *fs = ls->fs; - int extra = fs->freereg; - int conflict = 0; - for (; lh; lh = lh->prev) { - if (vkisindexed(lh->v.k)) { - if (lh->v.k == VINDEXUP) { - if (v->k == VUPVAL && lh->v.u.ind.t == v->u.info) { - conflict = 1; - lh->v.k = VINDEXSTR; - lh->v.u.ind.t = extra; - } - } - else { - if (v->k == VLOCAL && lh->v.u.ind.t == v->u.var.ridx) { - conflict = 1; - lh->v.u.ind.t = extra; - } - - if (lh->v.k == VINDEXED && v->k == VLOCAL && - lh->v.u.ind.idx == v->u.var.ridx) { - conflict = 1; - lh->v.u.ind.idx = extra; - } - } - } - } - if (conflict) { - - if (v->k == VLOCAL) - luaK_codeABC(fs, OP_MOVE, extra, v->u.var.ridx, 0); - else - luaK_codeABC(fs, OP_GETUPVAL, extra, v->u.info, 0); - luaK_reserveregs(fs, 1); - } -} - - -static void restassign (LexState *ls, struct LHS_assign *lh, int nvars) { - expdesc e; - check_condition(ls, vkisvar(lh->v.k), "syntax private_lua_error"); - check_readonly(ls, &lh->v); - if (testnext(ls, ',')) { - struct LHS_assign nv; - nv.prev = lh; - suffixedexp(ls, &nv.v); - if (!vkisindexed(nv.v.k)) - check_conflict(ls, lh, &nv.v); - enterlevel(ls); - restassign(ls, &nv, nvars+1); - leavelevel(ls); - } - else { - int nexps; - checknext(ls, '='); - nexps = explist(ls, &e); - if (nexps != nvars) - adjust_assign(ls, nvars, nexps, &e); - else { - luaK_setoneret(ls->fs, &e); - luaK_storevar(ls->fs, &lh->v, &e); - return; - } - } - init_exp(&e, VNONRELOC, ls->fs->freereg-1); - luaK_storevar(ls->fs, &lh->v, &e); -} - - -static int cond (LexState *ls) { - - expdesc v; - expr(ls, &v); - if (v.k == VNIL) v.k = VFALSE; - luaK_goiftrue(ls->fs, &v); - return v.f; -} - - -static void gotostat (LexState *ls) { - FuncState *fs = ls->fs; - int line = ls->linenumber; - TString *name = str_checkname(ls); - Labeldesc *lb = findlabel(ls, name); - if (lb == NULL) - - newgotoentry(ls, name, line, luaK_jump(fs)); - else { - - int lblevel = reglevel(fs, lb->nactvar); - if (luaY_nvarstack(fs) > lblevel) - luaK_codeABC(fs, OP_CLOSE, lblevel, 0, 0); - - luaK_patchlist(fs, luaK_jump(fs), lb->pc); - } -} - - - -static void breakstat (LexState *ls) { - int line = ls->linenumber; - luaX_next(ls); - newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, luaK_jump(ls->fs)); -} - - - -static void checkrepeated (LexState *ls, TString *name) { - Labeldesc *lb = findlabel(ls, name); - if (l_unlikely(lb != NULL)) { - const char *msg = "label '%s' already defined on line %d"; - msg = luaO_pushfstring(ls->L, msg, getstr(name), lb->line); - luaK_semerror(ls, msg); - } -} - - -static void labelstat (LexState *ls, TString *name, int line) { - - checknext(ls, TK_DBCOLON); - while (ls->t.token == ';' || ls->t.token == TK_DBCOLON) - statement(ls); - checkrepeated(ls, name); - createlabel(ls, name, line, block_follow(ls, 0)); -} - - -static void whilestat (LexState *ls, int line) { - - FuncState *fs = ls->fs; - int whileinit; - int condexit; - BlockCnt bl; - luaX_next(ls); - whileinit = luaK_getlabel(fs); - condexit = cond(ls); - enterblock(fs, &bl, 1); - checknext(ls, TK_DO); - block(ls); - luaK_jumpto(fs, whileinit); - check_match(ls, TK_END, TK_WHILE, line); - leaveblock(fs); - luaK_patchtohere(fs, condexit); -} - - -static void repeatstat (LexState *ls, int line) { - - int condexit; - FuncState *fs = ls->fs; - int repeat_init = luaK_getlabel(fs); - BlockCnt bl1, bl2; - enterblock(fs, &bl1, 1); - enterblock(fs, &bl2, 0); - luaX_next(ls); - statlist(ls); - check_match(ls, TK_UNTIL, TK_REPEAT, line); - condexit = cond(ls); - leaveblock(fs); - if (bl2.upval) { - int exit = luaK_jump(fs); - luaK_patchtohere(fs, condexit); - luaK_codeABC(fs, OP_CLOSE, reglevel(fs, bl2.nactvar), 0, 0); - condexit = luaK_jump(fs); - luaK_patchtohere(fs, exit); - } - luaK_patchlist(fs, condexit, repeat_init); - leaveblock(fs); -} - - - -static void exp1 (LexState *ls) { - expdesc e; - expr(ls, &e); - luaK_exp2nextreg(ls->fs, &e); - lua_assert(e.k == VNONRELOC); -} - - - -static void fixforjump (FuncState *fs, int pc, int dest, int back) { - Instruction *jmp = &fs->f->code[pc]; - int offset = dest - (pc + 1); - if (back) - offset = -offset; - if (l_unlikely(offset > MAXARG_Bx)) - luaX_syntaxerror(fs->ls, "control structure too long"); - SETARG_Bx(*jmp, offset); -} - - - -static void forbody (LexState *ls, int base, int line, int nvars, int isgen) { - - static const OpCode forprep[2] = {OP_FORPREP, OP_TFORPREP}; - static const OpCode forloop[2] = {OP_FORLOOP, OP_TFORLOOP}; - BlockCnt bl; - FuncState *fs = ls->fs; - int prep, endfor; - checknext(ls, TK_DO); - prep = luaK_codeABx(fs, forprep[isgen], base, 0); - fs->freereg--; - enterblock(fs, &bl, 0); - adjustlocalvars(ls, nvars); - luaK_reserveregs(fs, nvars); - block(ls); - leaveblock(fs); - fixforjump(fs, prep, luaK_getlabel(fs), 0); - if (isgen) { - luaK_codeABC(fs, OP_TFORCALL, base, 0, nvars); - luaK_fixline(fs, line); - } - endfor = luaK_codeABx(fs, forloop[isgen], base, 0); - fixforjump(fs, endfor, prep + 1, 1); - luaK_fixline(fs, line); -} - - -static void fornum (LexState *ls, TString *varname, int line) { - - FuncState *fs = ls->fs; - int base = fs->freereg; - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvarkind(ls, varname, RDKCONST); - checknext(ls, '='); - exp1(ls); - checknext(ls, ','); - exp1(ls); - if (testnext(ls, ',')) - exp1(ls); - else { - luaK_int(fs, fs->freereg, 1); - luaK_reserveregs(fs, 1); - } - adjustlocalvars(ls, 2); - forbody(ls, base, line, 1, 0); -} - - -static void forlist (LexState *ls, TString *indexname) { - - FuncState *fs = ls->fs; - expdesc e; - int nvars = 4; - int line; - int base = fs->freereg; - - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvarkind(ls, indexname, RDKCONST); - - while (testnext(ls, ',')) { - new_localvar(ls, str_checkname(ls)); - nvars++; - } - checknext(ls, TK_IN); - line = ls->linenumber; - adjust_assign(ls, 4, explist(ls, &e), &e); - adjustlocalvars(ls, 3); - marktobeclosed(fs); - luaK_checkstack(fs, 2); - forbody(ls, base, line, nvars - 3, 1); -} - - -static void forstat (LexState *ls, int line) { - - FuncState *fs = ls->fs; - TString *varname; - BlockCnt bl; - enterblock(fs, &bl, 1); - luaX_next(ls); - varname = str_checkname(ls); - switch (ls->t.token) { - case '=': fornum(ls, varname, line); break; - case ',': case TK_IN: forlist(ls, varname); break; - default: luaX_syntaxerror(ls, "'=' or 'in' expected"); - } - check_match(ls, TK_END, TK_FOR, line); - leaveblock(fs); -} - - -static void test_then_block (LexState *ls, int *escapelist) { - - BlockCnt bl; - FuncState *fs = ls->fs; - expdesc v; - int jf; - luaX_next(ls); - expr(ls, &v); - checknext(ls, TK_THEN); - if (ls->t.token == TK_BREAK) { - int line = ls->linenumber; - luaK_goiffalse(ls->fs, &v); - luaX_next(ls); - enterblock(fs, &bl, 0); - newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, v.t); - while (testnext(ls, ';')) {} - if (block_follow(ls, 0)) { - leaveblock(fs); - return; - } - else - jf = luaK_jump(fs); - } - else { - luaK_goiftrue(ls->fs, &v); - enterblock(fs, &bl, 0); - jf = v.f; - } - statlist(ls); - leaveblock(fs); - if (ls->t.token == TK_ELSE || - ls->t.token == TK_ELSEIF) - luaK_concat(fs, escapelist, luaK_jump(fs)); - luaK_patchtohere(fs, jf); -} - - -static void ifstat (LexState *ls, int line) { - - FuncState *fs = ls->fs; - int escapelist = NO_JUMP; - test_then_block(ls, &escapelist); - while (ls->t.token == TK_ELSEIF) - test_then_block(ls, &escapelist); - if (testnext(ls, TK_ELSE)) - block(ls); - check_match(ls, TK_END, TK_IF, line); - luaK_patchtohere(fs, escapelist); -} - - -static void localfunc (LexState *ls) { - expdesc b; - FuncState *fs = ls->fs; - int fvar = fs->nactvar; - new_localvar(ls, str_checkname(ls)); - adjustlocalvars(ls, 1); - body(ls, &b, 0, ls->linenumber); - - localdebuginfo(fs, fvar)->startpc = fs->pc; -} - - -static int getlocalattribute (LexState *ls) { - - if (testnext(ls, '<')) { - TString *ts = str_checkname(ls); - const char *attr = getstr(ts); - checknext(ls, '>'); - if (strcmp(attr, "const") == 0) - return RDKCONST; - else if (strcmp(attr, "close") == 0) - return RDKTOCLOSE; - else - luaK_semerror(ls, - luaO_pushfstring(ls->L, "unknown attribute '%s'", attr)); - } - return VDKREG; -} - - -static void checktoclose (FuncState *fs, int level) { - if (level != -1) { - marktobeclosed(fs); - luaK_codeABC(fs, OP_TBC, reglevel(fs, level), 0, 0); - } -} - - -static void localstat (LexState *ls) { - - FuncState *fs = ls->fs; - int toclose = -1; - Vardesc *var; - int vidx; - int nvars = 0; - int nexps; - expdesc e; - do { - TString *vname = str_checkname(ls); - int kind = getlocalattribute(ls); - vidx = new_localvarkind(ls, vname, kind); - if (kind == RDKTOCLOSE) { - if (toclose != -1) - luaK_semerror(ls, "multiple to-be-closed variables in local list"); - toclose = fs->nactvar + nvars; - } - nvars++; - } while (testnext(ls, ',')); - if (testnext(ls, '=')) - nexps = explist(ls, &e); - else { - e.k = VVOID; - nexps = 0; - } - var = getlocalvardesc(fs, vidx); - if (nvars == nexps && - var->vd.kind == RDKCONST && - luaK_exp2const(fs, &e, &var->k)) { - var->vd.kind = RDKCTC; - adjustlocalvars(ls, nvars - 1); - fs->nactvar++; - } - else { - adjust_assign(ls, nvars, nexps, &e); - adjustlocalvars(ls, nvars); - } - checktoclose(fs, toclose); -} - - -static int funcname (LexState *ls, expdesc *v) { - - int ismethod = 0; - singlevar(ls, v); - while (ls->t.token == '.') - fieldsel(ls, v); - if (ls->t.token == ':') { - ismethod = 1; - fieldsel(ls, v); - } - return ismethod; -} - - -static void funcstat (LexState *ls, int line) { - - int ismethod; - expdesc v, b; - luaX_next(ls); - ismethod = funcname(ls, &v); - body(ls, &b, ismethod, line); - check_readonly(ls, &v); - luaK_storevar(ls->fs, &v, &b); - luaK_fixline(ls->fs, line); -} - - -static void exprstat (LexState *ls) { - - FuncState *fs = ls->fs; - struct LHS_assign v; - suffixedexp(ls, &v.v); - if (ls->t.token == '=' || ls->t.token == ',') { - v.prev = NULL; - restassign(ls, &v, 1); - } - else { - Instruction *inst; - check_condition(ls, v.v.k == VCALL, "syntax private_lua_error"); - inst = &getinstruction(fs, &v.v); - SETARG_C(*inst, 1); - } -} - - -static void retstat (LexState *ls) { - - FuncState *fs = ls->fs; - expdesc e; - int nret; - int first = luaY_nvarstack(fs); - if (block_follow(ls, 1) || ls->t.token == ';') - nret = 0; - else { - nret = explist(ls, &e); - if (hasmultret(e.k)) { - luaK_setmultret(fs, &e); - if (e.k == VCALL && nret == 1 && !fs->bl->insidetbc) { - SET_OPCODE(getinstruction(fs,&e), OP_TAILCALL); - lua_assert(GETARG_A(getinstruction(fs,&e)) == luaY_nvarstack(fs)); - } - nret = LUA_MULTRET; - } - else { - if (nret == 1) - first = luaK_exp2anyreg(fs, &e); - else { - luaK_exp2nextreg(fs, &e); - lua_assert(nret == fs->freereg - first); - } - } - } - luaK_ret(fs, first, nret); - testnext(ls, ';'); -} - - -static void statement (LexState *ls) { - int line = ls->linenumber; - enterlevel(ls); - switch (ls->t.token) { - case ';': { - luaX_next(ls); - break; - } - case TK_IF: { - ifstat(ls, line); - break; - } - case TK_WHILE: { - whilestat(ls, line); - break; - } - case TK_DO: { - luaX_next(ls); - block(ls); - check_match(ls, TK_END, TK_DO, line); - break; - } - case TK_FOR: { - forstat(ls, line); - break; - } - case TK_REPEAT: { - repeatstat(ls, line); - break; - } - case TK_FUNCTION: { - funcstat(ls, line); - break; - } - case TK_LOCAL: { - luaX_next(ls); - if (testnext(ls, TK_FUNCTION)) - localfunc(ls); - else - localstat(ls); - break; - } - case TK_DBCOLON: { - luaX_next(ls); - labelstat(ls, str_checkname(ls), line); - break; - } - case TK_RETURN: { - luaX_next(ls); - retstat(ls); - break; - } - case TK_BREAK: { - breakstat(ls); - break; - } - case TK_GOTO: { - luaX_next(ls); - gotostat(ls); - break; - } - default: { - exprstat(ls); - break; - } - } - lua_assert(ls->fs->f->maxstacksize >= ls->fs->freereg && - ls->fs->freereg >= luaY_nvarstack(ls->fs)); - ls->fs->freereg = luaY_nvarstack(ls->fs); - leavelevel(ls); -} - - - - - -static void mainfunc (LexState *ls, FuncState *fs) { - BlockCnt bl; - Upvaldesc *env; - open_func(ls, fs, &bl); - setvararg(fs, 0); - env = allocupvalue(fs); - env->instack = 1; - env->idx = 0; - env->kind = VDKREG; - env->name = ls->envn; - luaC_objbarrier(ls->L, fs->f, env->name); - luaX_next(ls); - statlist(ls); - check(ls, TK_EOS); - close_func(ls); -} - - -LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, - Dyndata *dyd, const char *name, int firstchar) { - LexState lexstate; - FuncState funcstate; - LClosure *cl = luaF_newLclosure(L, 1); - setclLvalue2s(L, L->top.p, cl); - luaD_inctop(L); - lexstate.h = luaH_new(L); - sethvalue2s(L, L->top.p, lexstate.h); - luaD_inctop(L); - funcstate.f = cl->p = luaF_newproto(L); - luaC_objbarrier(L, cl, cl->p); - funcstate.f->source = luaS_new(L, name); - luaC_objbarrier(L, funcstate.f, funcstate.f->source); - lexstate.buff = buff; - lexstate.dyd = dyd; - dyd->actvar.n = dyd->gt.n = dyd->label.n = 0; - luaX_setinput(L, &lexstate, z, funcstate.f->source, firstchar); - mainfunc(&lexstate, &funcstate); - lua_assert(!funcstate.prev && funcstate.nups == 1 && !lexstate.fs); - - lua_assert(dyd->actvar.n == 0 && dyd->gt.n == 0 && dyd->label.n == 0); - L->top.p--; - return cl; -} - - - -//path: src/imports/../dependencies/lua/ldebug.c - - -#define ldebug_c -#define LUA_CORE - - - - - -#include -#include -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -#define noLuaClosure(f) ((f) == NULL || (f)->c.tt == LUA_VCCL) - - -static const char *funcnamefromcall (lua_State *L, CallInfo *ci, - const char **name); - - -static int currentpc (CallInfo *ci) { - lua_assert(isLua(ci)); - return pcRel(ci->u.l.savedpc, ci_func(ci)->p); -} - - - -static int getbaseline (const Proto *f, int pc, int *basepc) { - if (f->sizeabslineinfo == 0 || pc < f->abslineinfo[0].pc) { - *basepc = -1; - return f->linedefined; - } - else { - int i = cast_uint(pc) / MAXIWTHABS - 1; - - lua_assert(i < 0 || - (i < f->sizeabslineinfo && f->abslineinfo[i].pc <= pc)); - while (i + 1 < f->sizeabslineinfo && pc >= f->abslineinfo[i + 1].pc) - i++; - *basepc = f->abslineinfo[i].pc; - return f->abslineinfo[i].line; - } -} - - - -int luaG_getfuncline (const Proto *f, int pc) { - if (f->lineinfo == NULL) - return -1; - else { - int basepc; - int baseline = getbaseline(f, pc, &basepc); - while (basepc++ < pc) { - lua_assert(f->lineinfo[basepc] != ABSLINEINFO); - baseline += f->lineinfo[basepc]; - } - return baseline; - } -} - - -static int getcurrentline (CallInfo *ci) { - return luaG_getfuncline(ci_func(ci)->p, currentpc(ci)); -} - - - -static void settraps (CallInfo *ci) { - for (; ci != NULL; ci = ci->previous) - if (isLua(ci)) - ci->u.l.trap = 1; -} - - - -LUA_API void lua_sethook (lua_State *L, lua_Hook func, int mask, int count) { - if (func == NULL || mask == 0) { - mask = 0; - func = NULL; - } - L->hook = func; - L->basehookcount = count; - resethookcount(L); - L->hookmask = cast_byte(mask); - if (mask) - settraps(L->ci); -} - - -LUA_API lua_Hook lua_gethook (lua_State *L) { - return L->hook; -} - - -LUA_API int lua_gethookmask (lua_State *L) { - return L->hookmask; -} - - -LUA_API int lua_gethookcount (lua_State *L) { - return L->basehookcount; -} - - -LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar) { - int status; - CallInfo *ci; - if (level < 0) return 0; - lua_lock(L); - for (ci = L->ci; level > 0 && ci != &L->base_ci; ci = ci->previous) - level--; - if (level == 0 && ci != &L->base_ci) { - status = 1; - ar->i_ci = ci; - } - else status = 0; - lua_unlock(L); - return status; -} - - -static const char *upvalname (const Proto *p, int uv) { - TString *s = check_exp(uv < p->sizeupvalues, p->upvalues[uv].name); - if (s == NULL) return "?"; - else return getstr(s); -} - - -static const char *findvararg (CallInfo *ci, int n, StkId *pos) { - if (clLvalue(s2v(ci->func.p))->p->flag & PF_ISVARARG) { - int nextra = ci->u.l.nextraargs; - if (n >= -nextra) { - *pos = ci->func.p - nextra - (n + 1); - return "(vararg)"; - } - } - return NULL; -} - - -const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, StkId *pos) { - StkId base = ci->func.p + 1; - const char *name = NULL; - if (isLua(ci)) { - if (n < 0) - return findvararg(ci, n, pos); - else - name = luaF_getlocalname(ci_func(ci)->p, n, currentpc(ci)); - } - if (name == NULL) { - StkId limit = (ci == L->ci) ? L->top.p : ci->next->func.p; - if (limit - base >= n && n > 0) { - - name = isLua(ci) ? "(temporary)" : "(C temporary)"; - } - else - return NULL; - } - if (pos) - *pos = base + (n - 1); - return name; -} - - -LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) { - const char *name; - lua_lock(L); - if (ar == NULL) { - if (!isLfunction(s2v(L->top.p - 1))) - name = NULL; - else - name = luaF_getlocalname(clLvalue(s2v(L->top.p - 1))->p, n, 0); - } - else { - StkId pos = NULL; - name = luaG_findlocal(L, ar->i_ci, n, &pos); - if (name) { - setobjs2s(L, L->top.p, pos); - api_incr_top(L); - } - } - lua_unlock(L); - return name; -} - - -LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) { - StkId pos = NULL; - const char *name; - lua_lock(L); - name = luaG_findlocal(L, ar->i_ci, n, &pos); - if (name) { - api_checkpop(L, 1); - setobjs2s(L, pos, L->top.p - 1); - L->top.p--; - } - lua_unlock(L); - return name; -} - - -static void funcinfo (lua_Debug *ar, Closure *cl) { - if (noLuaClosure(cl)) { - ar->source = "=[C]"; - ar->srclen = LL("=[C]"); - ar->linedefined = -1; - ar->lastlinedefined = -1; - ar->what = "C"; - } - else { - const Proto *p = cl->l.p; - if (p->source) { - ar->source = getlstr(p->source, ar->srclen); - } - else { - ar->source = "=?"; - ar->srclen = LL("=?"); - } - ar->linedefined = p->linedefined; - ar->lastlinedefined = p->lastlinedefined; - ar->what = (ar->linedefined == 0) ? "main" : "Lua"; - } - luaO_chunkid(ar->short_src, ar->source, ar->srclen); -} - - -static int nextline (const Proto *p, int currentline, int pc) { - if (p->lineinfo[pc] != ABSLINEINFO) - return currentline + p->lineinfo[pc]; - else - return luaG_getfuncline(p, pc); -} - - -static void collectvalidlines (lua_State *L, Closure *f) { - if (noLuaClosure(f)) { - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - } - else { - int i; - TValue v; - const Proto *p = f->l.p; - int currentline = p->linedefined; - Table *t = luaH_new(L); - sethvalue2s(L, L->top.p, t); - api_incr_top(L); - setbtvalue(&v); - if (!(p->flag & PF_ISVARARG)) - i = 0; - else { - lua_assert(GET_OPCODE(p->code[0]) == OP_VARARGPREP); - currentline = nextline(p, currentline, 0); - i = 1; - } - for (; i < p->sizelineinfo; i++) { - currentline = nextline(p, currentline, i); - luaH_setint(L, t, currentline, &v); - } - } -} - - -static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name) { - - if (ci != NULL && !(ci->callstatus & CIST_TAIL)) - return funcnamefromcall(L, ci->previous, name); - else return NULL; -} - - -static int auxgetinfo (lua_State *L, const char *what, lua_Debug *ar, - Closure *f, CallInfo *ci) { - int status = 1; - for (; *what; what++) { - switch (*what) { - case 'S': { - funcinfo(ar, f); - break; - } - case 'l': { - ar->currentline = (ci && isLua(ci)) ? getcurrentline(ci) : -1; - break; - } - case 'u': { - ar->nups = (f == NULL) ? 0 : f->c.nupvalues; - if (noLuaClosure(f)) { - ar->isvararg = 1; - ar->nparams = 0; - } - else { - ar->isvararg = f->l.p->flag & PF_ISVARARG; - ar->nparams = f->l.p->numparams; - } - break; - } - case 't': { - ar->istailcall = (ci) ? ci->callstatus & CIST_TAIL : 0; - break; - } - case 'n': { - ar->namewhat = getfuncname(L, ci, &ar->name); - if (ar->namewhat == NULL) { - ar->namewhat = ""; - ar->name = NULL; - } - break; - } - case 'r': { - if (ci == NULL || !(ci->callstatus & CIST_TRAN)) - ar->ftransfer = ar->ntransfer = 0; - else { - ar->ftransfer = ci->u2.transferinfo.ftransfer; - ar->ntransfer = ci->u2.transferinfo.ntransfer; - } - break; - } - case 'L': - case 'f': - break; - default: status = 0; - } - } - return status; -} - - -LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) { - int status; - Closure *cl; - CallInfo *ci; - TValue *func; - lua_lock(L); - if (*what == '>') { - ci = NULL; - func = s2v(L->top.p - 1); - api_check(L, ttisfunction(func), "function expected"); - what++; - L->top.p--; - } - else { - ci = ar->i_ci; - func = s2v(ci->func.p); - lua_assert(ttisfunction(func)); - } - cl = ttisclosure(func) ? clvalue(func) : NULL; - status = auxgetinfo(L, what, ar, cl, ci); - if (strchr(what, 'f')) { - setobj2s(L, L->top.p, func); - api_incr_top(L); - } - if (strchr(what, 'L')) - collectvalidlines(L, cl); - lua_unlock(L); - return status; -} - - - - - -static int filterpc (int pc, int jmptarget) { - if (pc < jmptarget) - return -1; - else return pc; -} - - - -static int findsetreg (const Proto *p, int lastpc, int reg) { - int pc; - int setreg = -1; - int jmptarget = 0; - if (testMMMode(GET_OPCODE(p->code[lastpc]))) - lastpc--; - for (pc = 0; pc < lastpc; pc++) { - Instruction i = p->code[pc]; - OpCode op = GET_OPCODE(i); - int a = GETARG_A(i); - int change; - switch (op) { - case OP_LOADNIL: { - int b = GETARG_B(i); - change = (a <= reg && reg <= a + b); - break; - } - case OP_TFORCALL: { - change = (reg >= a + 2); - break; - } - case OP_CALL: - case OP_TAILCALL: { - change = (reg >= a); - break; - } - case OP_JMP: { - int b = GETARG_sJ(i); - int dest = pc + 1 + b; - - if (dest <= lastpc && dest > jmptarget) - jmptarget = dest; - change = 0; - break; - } - default: - change = (testAMode(op) && reg == a); - break; - } - if (change) - setreg = filterpc(pc, jmptarget); - } - return setreg; -} - - - -static const char *kname (const Proto *p, int index, const char **name) { - TValue *kvalue = &p->k[index]; - if (ttisstring(kvalue)) { - *name = getstr(tsvalue(kvalue)); - return "constant"; - } - else { - *name = "?"; - return NULL; - } -} - - -static const char *basicgetobjname (const Proto *p, int *ppc, int reg, - const char **name) { - int pc = *ppc; - *name = luaF_getlocalname(p, reg + 1, pc); - if (*name) - return "local"; - - *ppc = pc = findsetreg(p, pc, reg); - if (pc != -1) { - Instruction i = p->code[pc]; - OpCode op = GET_OPCODE(i); - switch (op) { - case OP_MOVE: { - int b = GETARG_B(i); - if (b < GETARG_A(i)) - return basicgetobjname(p, ppc, b, name); - break; - } - case OP_GETUPVAL: { - *name = upvalname(p, GETARG_B(i)); - return "upvalue"; - } - case OP_LOADK: return kname(p, GETARG_Bx(i), name); - case OP_LOADKX: return kname(p, GETARG_Ax(p->code[pc + 1]), name); - default: break; - } - } - return NULL; -} - - - -static void rname (const Proto *p, int pc, int c, const char **name) { - const char *what = basicgetobjname(p, &pc, c, name); - if (!(what && *what == 'c')) - *name = "?"; -} - - - -static void rkname (const Proto *p, int pc, Instruction i, const char **name) { - int c = GETARG_C(i); - if (GETARG_k(i)) - kname(p, c, name); - else - rname(p, pc, c, name); -} - - - -static const char *isEnv (const Proto *p, int pc, Instruction i, int isup) { - int t = GETARG_B(i); - const char *name; - if (isup) - name = upvalname(p, t); - else - basicgetobjname(p, &pc, t, &name); - return (name && strcmp(name, LUA_ENV) == 0) ? "global" : "field"; -} - - - -static const char *getobjname (const Proto *p, int lastpc, int reg, - const char **name) { - const char *kind = basicgetobjname(p, &lastpc, reg, name); - if (kind != NULL) - return kind; - else if (lastpc != -1) { - Instruction i = p->code[lastpc]; - OpCode op = GET_OPCODE(i); - switch (op) { - case OP_GETTABUP: { - int k = GETARG_C(i); - kname(p, k, name); - return isEnv(p, lastpc, i, 1); - } - case OP_GETTABLE: { - int k = GETARG_C(i); - rname(p, lastpc, k, name); - return isEnv(p, lastpc, i, 0); - } - case OP_GETI: { - *name = "integer index"; - return "field"; - } - case OP_GETFIELD: { - int k = GETARG_C(i); - kname(p, k, name); - return isEnv(p, lastpc, i, 0); - } - case OP_SELF: { - rkname(p, lastpc, i, name); - return "method"; - } - default: break; - } - } - return NULL; -} - - - -static const char *funcnamefromcode (lua_State *L, const Proto *p, - int pc, const char **name) { - TMS tm = (TMS)0; - Instruction i = p->code[pc]; - switch (GET_OPCODE(i)) { - case OP_CALL: - case OP_TAILCALL: - return getobjname(p, pc, GETARG_A(i), name); - case OP_TFORCALL: { - *name = "for iterator"; - return "for iterator"; - } - - case OP_SELF: case OP_GETTABUP: case OP_GETTABLE: - case OP_GETI: case OP_GETFIELD: - tm = TM_INDEX; - break; - case OP_SETTABUP: case OP_SETTABLE: case OP_SETI: case OP_SETFIELD: - tm = TM_NEWINDEX; - break; - case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { - tm = cast(TMS, GETARG_C(i)); - break; - } - case OP_UNM: tm = TM_UNM; break; - case OP_BNOT: tm = TM_BNOT; break; - case OP_LEN: tm = TM_LEN; break; - case OP_CONCAT: tm = TM_CONCAT; break; - case OP_EQ: tm = TM_EQ; break; - - case OP_LT: case OP_LTI: case OP_GTI: tm = TM_LT; break; - case OP_LE: case OP_LEI: case OP_GEI: tm = TM_LE; break; - case OP_CLOSE: case OP_RETURN: tm = TM_CLOSE; break; - default: - return NULL; - } - *name = getshrstr(G(L)->tmname[tm]) + 2; - return "metamethod"; -} - - - -static const char *funcnamefromcall (lua_State *L, CallInfo *ci, - const char **name) { - if (ci->callstatus & CIST_HOOKED) { - *name = "?"; - return "hook"; - } - else if (ci->callstatus & CIST_FIN) { - *name = "__gc"; - return "metamethod"; - } - else if (isLua(ci)) - return funcnamefromcode(L, ci_func(ci)->p, currentpc(ci), name); - else - return NULL; -} - - - - - - -static int instack (CallInfo *ci, const TValue *o) { - int pos; - StkId base = ci->func.p + 1; - for (pos = 0; base + pos < ci->top.p; pos++) { - if (o == s2v(base + pos)) - return pos; - } - return -1; -} - - - -static const char *getupvalname (CallInfo *ci, const TValue *o, - const char **name) { - LClosure *c = ci_func(ci); - int i; - for (i = 0; i < c->nupvalues; i++) { - if (c->upvals[i]->v.p == o) { - *name = upvalname(c->p, i); - return "upvalue"; - } - } - return NULL; -} - - -static const char *formatvarinfo (lua_State *L, const char *kind, - const char *name) { - if (kind == NULL) - return ""; - else - return luaO_pushfstring(L, " (%s '%s')", kind, name); -} - - -static const char *varinfo (lua_State *L, const TValue *o) { - CallInfo *ci = L->ci; - const char *name = NULL; - const char *kind = NULL; - if (isLua(ci)) { - kind = getupvalname(ci, o, &name); - if (!kind) { - int reg = instack(ci, o); - if (reg >= 0) - kind = getobjname(ci_func(ci)->p, currentpc(ci), reg, &name); - } - } - return formatvarinfo(L, kind, name); -} - - - -static l_noret typeerror (lua_State *L, const TValue *o, const char *op, - const char *extra) { - const char *t = luaT_objtypename(L, o); - luaG_runerror(L, "attempt to %s a %s value%s", op, t, extra); -} - - - -l_noret luaG_typeerror (lua_State *L, const TValue *o, const char *op) { - typeerror(L, o, op, varinfo(L, o)); -} - - - -l_noret luaG_callerror (lua_State *L, const TValue *o) { - CallInfo *ci = L->ci; - const char *name = NULL; - const char *kind = funcnamefromcall(L, ci, &name); - const char *extra = kind ? formatvarinfo(L, kind, name) : varinfo(L, o); - typeerror(L, o, "call", extra); -} - - -l_noret luaG_forerror (lua_State *L, const TValue *o, const char *what) { - luaG_runerror(L, "bad 'for' %s (number expected, got %s)", - what, luaT_objtypename(L, o)); -} - - -l_noret luaG_concaterror (lua_State *L, const TValue *p1, const TValue *p2) { - if (ttisstring(p1) || cvt2str(p1)) p1 = p2; - luaG_typeerror(L, p1, "concatenate"); -} - - -l_noret luaG_opinterror (lua_State *L, const TValue *p1, - const TValue *p2, const char *msg) { - if (!ttisnumber(p1)) - p2 = p1; - luaG_typeerror(L, p2, msg); -} - - - -l_noret luaG_tointerror (lua_State *L, const TValue *p1, const TValue *p2) { - lua_Integer temp; - if (!luaV_tointegerns(p1, &temp, LUA_FLOORN2I)) - p2 = p1; - luaG_runerror(L, "number%s has no integer representation", varinfo(L, p2)); -} - - -l_noret luaG_ordererror (lua_State *L, const TValue *p1, const TValue *p2) { - const char *t1 = luaT_objtypename(L, p1); - const char *t2 = luaT_objtypename(L, p2); - if (strcmp(t1, t2) == 0) - luaG_runerror(L, "attempt to compare two %s values", t1); - else - luaG_runerror(L, "attempt to compare %s with %s", t1, t2); -} - - - -const char *luaG_addinfo (lua_State *L, const char *msg, TString *src, - int line) { - char buff[LUA_IDSIZE]; - if (src) { - size_t idlen; - const char *id = getlstr(src, idlen); - luaO_chunkid(buff, id, idlen); - } - else { - buff[0] = '?'; buff[1] = '\0'; - } - return luaO_pushfstring(L, "%s:%d: %s", buff, line, msg); -} - - -l_noret luaG_errormsg (lua_State *L) { - if (L->errfunc != 0) { - StkId errfunc = restorestack(L, L->errfunc); - lua_assert(ttisfunction(s2v(errfunc))); - setobjs2s(L, L->top.p, L->top.p - 1); - setobjs2s(L, L->top.p - 1, errfunc); - L->top.p++; - luaD_callnoyield(L, L->top.p - 2, 1); - } - luaD_throw(L, LUA_ERRRUN); -} - - -l_noret luaG_runerror (lua_State *L, const char *fmt, ...) { - CallInfo *ci = L->ci; - const char *msg; - va_list argp; - luaC_checkGC(L); - va_start(argp, fmt); - msg = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - if (isLua(ci)) { - luaG_addinfo(L, msg, ci_func(ci)->p->source, getcurrentline(ci)); - setobjs2s(L, L->top.p - 2, L->top.p - 1); - L->top.p--; - } - luaG_errormsg(L); -} - - - -static int changedline (const Proto *p, int oldpc, int newpc) { - if (p->lineinfo == NULL) - return 0; - if (newpc - oldpc < MAXIWTHABS / 2) { - int delta = 0; - int pc = oldpc; - for (;;) { - int lineinfo = p->lineinfo[++pc]; - if (lineinfo == ABSLINEINFO) - break; - delta += lineinfo; - if (pc == newpc) - return (delta != 0); - } - } - - return (luaG_getfuncline(p, oldpc) != luaG_getfuncline(p, newpc)); -} - - - -int luaG_tracecall (lua_State *L) { - CallInfo *ci = L->ci; - Proto *p = ci_func(ci)->p; - ci->u.l.trap = 1; - if (ci->u.l.savedpc == p->code) { - if (p->flag & PF_ISVARARG) - return 0; - else if (!(ci->callstatus & CIST_HOOKYIELD)) - luaD_hookcall(L, ci); - } - return 1; -} - - - -int luaG_traceexec (lua_State *L, const Instruction *pc) { - CallInfo *ci = L->ci; - lu_byte mask = L->hookmask; - const Proto *p = ci_func(ci)->p; - int counthook; - if (!(mask & (LUA_MASKLINE | LUA_MASKCOUNT))) { - ci->u.l.trap = 0; - return 0; - } - pc++; - ci->u.l.savedpc = pc; - counthook = (mask & LUA_MASKCOUNT) && (--L->hookcount == 0); - if (counthook) - resethookcount(L); - else if (!(mask & LUA_MASKLINE)) - return 1; - if (ci->callstatus & CIST_HOOKYIELD) { - ci->callstatus &= ~CIST_HOOKYIELD; - return 1; - } - if (!isIT(*(ci->u.l.savedpc - 1))) - L->top.p = ci->top.p; - if (counthook) - luaD_hook(L, LUA_HOOKCOUNT, -1, 0, 0); - if (mask & LUA_MASKLINE) { - - int oldpc = (L->oldpc < p->sizecode) ? L->oldpc : 0; - int npci = pcRel(pc, p); - if (npci <= oldpc || - changedline(p, oldpc, npci)) { - int newline = luaG_getfuncline(p, npci); - luaD_hook(L, LUA_HOOKLINE, newline, 0, 0); - } - L->oldpc = npci; - } - if (L->status == LUA_YIELD) { - if (counthook) - L->hookcount = 1; - ci->callstatus |= CIST_HOOKYIELD; - luaD_throw(L, LUA_YIELD); - } - return 1; -} - - - -//path: src/imports/../dependencies/lua/lfunc.c - - -#define lfunc_c -#define LUA_CORE - - - - - -#include - - - - - - - - - - - - - - - - - - - - - -CClosure *luaF_newCclosure (lua_State *L, int nupvals) { - GCObject *o = luaC_newobj(L, LUA_VCCL, sizeCclosure(nupvals)); - CClosure *c = gco2ccl(o); - c->nupvalues = cast_byte(nupvals); - return c; -} - - -LClosure *luaF_newLclosure (lua_State *L, int nupvals) { - GCObject *o = luaC_newobj(L, LUA_VLCL, sizeLclosure(nupvals)); - LClosure *c = gco2lcl(o); - c->p = NULL; - c->nupvalues = cast_byte(nupvals); - while (nupvals--) c->upvals[nupvals] = NULL; - return c; -} - - - -void luaF_initupvals (lua_State *L, LClosure *cl) { - int i; - for (i = 0; i < cl->nupvalues; i++) { - GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); - UpVal *uv = gco2upv(o); - uv->v.p = &uv->u.value; - setnilvalue(uv->v.p); - cl->upvals[i] = uv; - luaC_objbarrier(L, cl, uv); - } -} - - - -static UpVal *newupval (lua_State *L, StkId level, UpVal **prev) { - GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); - UpVal *uv = gco2upv(o); - UpVal *next = *prev; - uv->v.p = s2v(level); - uv->u.open.next = next; - uv->u.open.previous = prev; - if (next) - next->u.open.previous = &uv->u.open.next; - *prev = uv; - if (!isintwups(L)) { - L->twups = G(L)->twups; - G(L)->twups = L; - } - return uv; -} - - - -UpVal *luaF_findupval (lua_State *L, StkId level) { - UpVal **pp = &L->openupval; - UpVal *p; - lua_assert(isintwups(L) || L->openupval == NULL); - while ((p = *pp) != NULL && uplevel(p) >= level) { - lua_assert(!isdead(G(L), p)); - if (uplevel(p) == level) - return p; - pp = &p->u.open.next; - } - - return newupval(L, level, pp); -} - - - -static void callclosemethod (lua_State *L, TValue *obj, TValue *err, int yy) { - StkId top = L->top.p; - const TValue *tm = luaT_gettmbyobj(L, obj, TM_CLOSE); - setobj2s(L, top, tm); - setobj2s(L, top + 1, obj); - setobj2s(L, top + 2, err); - L->top.p = top + 3; - if (yy) - luaD_call(L, top, 0); - else - luaD_callnoyield(L, top, 0); -} - - - -static void checkclosemth (lua_State *L, StkId level) { - const TValue *tm = luaT_gettmbyobj(L, s2v(level), TM_CLOSE); - if (ttisnil(tm)) { - int idx = cast_int(level - L->ci->func.p); - const char *vname = luaG_findlocal(L, L->ci, idx, NULL); - if (vname == NULL) vname = "?"; - luaG_runerror(L, "variable '%s' got a non-closable value", vname); - } -} - - - -static void prepcallclosemth (lua_State *L, StkId level, int status, int yy) { - TValue *uv = s2v(level); - TValue *errobj; - if (status == CLOSEKTOP) - errobj = &G(L)->nilvalue; - else { - errobj = s2v(level + 1); - luaD_seterrorobj(L, status, level + 1); - } - callclosemethod(L, uv, errobj, yy); -} - - - -#define MAXDELTA \ - ((256ul << ((sizeof(L->stack.p->tbclist.delta) - 1) * 8)) - 1) - - - -void luaF_newtbcupval (lua_State *L, StkId level) { - lua_assert(level > L->tbclist.p); - if (l_isfalse(s2v(level))) - return; - checkclosemth(L, level); - while (cast_uint(level - L->tbclist.p) > MAXDELTA) { - L->tbclist.p += MAXDELTA; - L->tbclist.p->tbclist.delta = 0; - } - level->tbclist.delta = cast(unsigned short, level - L->tbclist.p); - L->tbclist.p = level; -} - - -void luaF_unlinkupval (UpVal *uv) { - lua_assert(upisopen(uv)); - *uv->u.open.previous = uv->u.open.next; - if (uv->u.open.next) - uv->u.open.next->u.open.previous = uv->u.open.previous; -} - - - -void luaF_closeupval (lua_State *L, StkId level) { - UpVal *uv; - StkId upl; - while ((uv = L->openupval) != NULL && (upl = uplevel(uv)) >= level) { - TValue *slot = &uv->u.value; - lua_assert(uplevel(uv) < L->top.p); - luaF_unlinkupval(uv); - setobj(L, slot, uv->v.p); - uv->v.p = slot; - if (!iswhite(uv)) { - nw2black(uv); - luaC_barrier(L, uv, slot); - } - } -} - - - -static void poptbclist (lua_State *L) { - StkId tbc = L->tbclist.p; - lua_assert(tbc->tbclist.delta > 0); - tbc -= tbc->tbclist.delta; - while (tbc > L->stack.p && tbc->tbclist.delta == 0) - tbc -= MAXDELTA; - L->tbclist.p = tbc; -} - - - -StkId luaF_close (lua_State *L, StkId level, int status, int yy) { - ptrdiff_t levelrel = savestack(L, level); - luaF_closeupval(L, level); - while (L->tbclist.p >= level) { - StkId tbc = L->tbclist.p; - poptbclist(L); - prepcallclosemth(L, tbc, status, yy); - level = restorestack(L, levelrel); - } - return level; -} - - -Proto *luaF_newproto (lua_State *L) { - GCObject *o = luaC_newobj(L, LUA_VPROTO, sizeof(Proto)); - Proto *f = gco2p(o); - f->k = NULL; - f->sizek = 0; - f->p = NULL; - f->sizep = 0; - f->code = NULL; - f->sizecode = 0; - f->lineinfo = NULL; - f->sizelineinfo = 0; - f->abslineinfo = NULL; - f->sizeabslineinfo = 0; - f->upvalues = NULL; - f->sizeupvalues = 0; - f->numparams = 0; - f->flag = 0; - f->maxstacksize = 0; - f->locvars = NULL; - f->sizelocvars = 0; - f->linedefined = 0; - f->lastlinedefined = 0; - f->source = NULL; - return f; -} - - -void luaF_freeproto (lua_State *L, Proto *f) { - if (!(f->flag & PF_FIXED)) { - luaM_freearray(L, f->code, f->sizecode); - luaM_freearray(L, f->lineinfo, f->sizelineinfo); - luaM_freearray(L, f->abslineinfo, f->sizeabslineinfo); - } - luaM_freearray(L, f->p, f->sizep); - luaM_freearray(L, f->k, f->sizek); - luaM_freearray(L, f->locvars, f->sizelocvars); - luaM_freearray(L, f->upvalues, f->sizeupvalues); - luaM_free(L, f); -} - - - -const char *luaF_getlocalname (const Proto *f, int local_number, int pc) { - int i; - for (i = 0; isizelocvars && f->locvars[i].startpc <= pc; i++) { - if (pc < f->locvars[i].endpc) { - local_number--; - if (local_number == 0) - return getstr(f->locvars[i].varname); - } - } - return NULL; -} - - - -//path: src/imports/../dependencies/lua/lobject.c - - -#define lobject_c -#define LUA_CORE - - - - - -#include -#include -#include -#include -#include - - - - - - - - - - - - - - - - - - - - - - - -int luaO_ceillog2 (unsigned int x) { - static const lu_byte log_2[256] = { - 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, - 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, - 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, - 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8 - }; - int l = 0; - x--; - while (x >= 256) { l += 8; x >>= 8; } - return l + log_2[x]; -} - - -unsigned int luaO_codeparam (unsigned int p) { - if (p >= (cast(lu_mem, 0x1F) << (0xF - 7 - 1)) * 100u) - return 0xFF; - else { - p = (cast(l_uint32, p) * 128 + 99) / 100; - if (p < 0x10) - return p; - else { - int log = luaO_ceillog2(p + 1) - 5; - return ((p >> log) - 0x10) | ((log + 1) << 4); - } - } -} - - - -l_obj luaO_applyparam (unsigned int p, l_obj x) { - unsigned int m = p & 0xF; - int e = (p >> 4); - if (e > 0) { - e--; - m += 0x10; - } - e -= 7; - if (e >= 0) { - if (x < (MAX_LOBJ / 0x1F) >> e) - return (x * m) << e; - else - return MAX_LOBJ; - } - else { - e = -e; - if (x < MAX_LOBJ / 0x1F) - return (x * m) >> e; - else if ((x >> e) < MAX_LOBJ / 0x1F) - return (x >> e) * m; - else - return MAX_LOBJ; - } -} - - -static lua_Integer intarith (lua_State *L, int op, lua_Integer v1, - lua_Integer v2) { - switch (op) { - case LUA_OPADD: return intop(+, v1, v2); - case LUA_OPSUB:return intop(-, v1, v2); - case LUA_OPMUL:return intop(*, v1, v2); - case LUA_OPMOD: return luaV_mod(L, v1, v2); - case LUA_OPIDIV: return luaV_idiv(L, v1, v2); - case LUA_OPBAND: return intop(&, v1, v2); - case LUA_OPBOR: return intop(|, v1, v2); - case LUA_OPBXOR: return intop(^, v1, v2); - case LUA_OPSHL: return luaV_shiftl(v1, v2); - case LUA_OPSHR: return luaV_shiftr(v1, v2); - case LUA_OPUNM: return intop(-, 0, v1); - case LUA_OPBNOT: return intop(^, ~l_castS2U(0), v1); - default: lua_assert(0); return 0; - } -} - - -static lua_Number numarith (lua_State *L, int op, lua_Number v1, - lua_Number v2) { - switch (op) { - case LUA_OPADD: return luai_numadd(L, v1, v2); - case LUA_OPSUB: return luai_numsub(L, v1, v2); - case LUA_OPMUL: return luai_nummul(L, v1, v2); - case LUA_OPDIV: return luai_numdiv(L, v1, v2); - case LUA_OPPOW: return luai_numpow(L, v1, v2); - case LUA_OPIDIV: return luai_numidiv(L, v1, v2); - case LUA_OPUNM: return luai_numunm(L, v1); - case LUA_OPMOD: return luaV_modf(L, v1, v2); - default: lua_assert(0); return 0; - } -} - - -int luaO_rawarith (lua_State *L, int op, const TValue *p1, const TValue *p2, - TValue *res) { - switch (op) { - case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: - case LUA_OPSHL: case LUA_OPSHR: - case LUA_OPBNOT: { - lua_Integer i1; lua_Integer i2; - if (tointegerns(p1, &i1) && tointegerns(p2, &i2)) { - setivalue(res, intarith(L, op, i1, i2)); - return 1; - } - else return 0; - } - case LUA_OPDIV: case LUA_OPPOW: { - lua_Number n1; lua_Number n2; - if (tonumberns(p1, n1) && tonumberns(p2, n2)) { - setfltvalue(res, numarith(L, op, n1, n2)); - return 1; - } - else return 0; - } - default: { - lua_Number n1; lua_Number n2; - if (ttisinteger(p1) && ttisinteger(p2)) { - setivalue(res, intarith(L, op, ivalue(p1), ivalue(p2))); - return 1; - } - else if (tonumberns(p1, n1) && tonumberns(p2, n2)) { - setfltvalue(res, numarith(L, op, n1, n2)); - return 1; - } - else return 0; - } - } -} - - -void luaO_arith (lua_State *L, int op, const TValue *p1, const TValue *p2, - StkId res) { - if (!luaO_rawarith(L, op, p1, p2, s2v(res))) { - - luaT_trybinTM(L, p1, p2, res, cast(TMS, (op - LUA_OPADD) + TM_ADD)); - } -} - - -int luaO_hexavalue (int c) { - if (lisdigit(c)) return c - '0'; - else return (ltolower(c) - 'a') + 10; -} - - -static int isneg (const char **s) { - if (**s == '-') { (*s)++; return 1; } - else if (**s == '+') (*s)++; - return 0; -} - - - - - -#if !defined(lua_strx2number) - - -#define MAXSIGDIG 30 - - -static lua_Number lua_strx2number (const char *s, char **endptr) { - int dot = lua_getlocaledecpoint(); - lua_Number r = l_mathop(0.0); - int sigdig = 0; - int nosigdig = 0; - int e = 0; - int neg; - int hasdot = 0; - *endptr = cast_charp(s); - while (lisspace(cast_uchar(*s))) s++; - neg = isneg(&s); - if (!(*s == '0' && (*(s + 1) == 'x' || *(s + 1) == 'X'))) - return l_mathop(0.0); - for (s += 2; ; s++) { - if (*s == dot) { - if (hasdot) break; - else hasdot = 1; - } - else if (lisxdigit(cast_uchar(*s))) { - if (sigdig == 0 && *s == '0') - nosigdig++; - else if (++sigdig <= MAXSIGDIG) - r = (r * l_mathop(16.0)) + luaO_hexavalue(*s); - else e++; - if (hasdot) e--; - } - else break; - } - if (nosigdig + sigdig == 0) - return l_mathop(0.0); - *endptr = cast_charp(s); - e *= 4; - if (*s == 'p' || *s == 'P') { - int exp1 = 0; - int neg1; - s++; - neg1 = isneg(&s); - if (!lisdigit(cast_uchar(*s))) - return l_mathop(0.0); - while (lisdigit(cast_uchar(*s))) - exp1 = exp1 * 10 + *(s++) - '0'; - if (neg1) exp1 = -exp1; - e += exp1; - *endptr = cast_charp(s); - } - if (neg) r = -r; - return l_mathop(ldexp)(r, e); -} - -#endif - - - - -#if !defined (L_MAXLENNUM) -#define L_MAXLENNUM 200 -#endif - - -static const char *l_str2dloc (const char *s, lua_Number *result, int mode) { - char *endptr; - *result = (mode == 'x') ? lua_strx2number(s, &endptr) - : lua_str2number(s, &endptr); - if (endptr == s) return NULL; - while (lisspace(cast_uchar(*endptr))) endptr++; - return (*endptr == '\0') ? endptr : NULL; -} - - - -static const char *l_str2d (const char *s, lua_Number *result) { - const char *endptr; - const char *pmode = strpbrk(s, ".xXnN"); - int mode = pmode ? ltolower(cast_uchar(*pmode)) : 0; - if (mode == 'n') - return NULL; - endptr = l_str2dloc(s, result, mode); - if (endptr == NULL) { - char buff[L_MAXLENNUM + 1]; - const char *pdot = strchr(s, '.'); - if (pdot == NULL || strlen(s) > L_MAXLENNUM) - return NULL; - strcpy(buff, s); - buff[pdot - s] = lua_getlocaledecpoint(); - endptr = l_str2dloc(buff, result, mode); - if (endptr != NULL) - endptr = s + (endptr - buff); - } - return endptr; -} - - -#define MAXBY10 cast(lua_Unsigned, LUA_MAXINTEGER / 10) -#define MAXLASTD cast_int(LUA_MAXINTEGER % 10) - -static const char *l_str2int (const char *s, lua_Integer *result) { - lua_Unsigned a = 0; - int empty = 1; - int neg; - while (lisspace(cast_uchar(*s))) s++; - neg = isneg(&s); - if (s[0] == '0' && - (s[1] == 'x' || s[1] == 'X')) { - s += 2; - for (; lisxdigit(cast_uchar(*s)); s++) { - a = a * 16 + luaO_hexavalue(*s); - empty = 0; - } - } - else { - for (; lisdigit(cast_uchar(*s)); s++) { - int d = *s - '0'; - if (a >= MAXBY10 && (a > MAXBY10 || d > MAXLASTD + neg)) - return NULL; - a = a * 10 + d; - empty = 0; - } - } - while (lisspace(cast_uchar(*s))) s++; - if (empty || *s != '\0') return NULL; - else { - *result = l_castU2S((neg) ? 0u - a : a); - return s; - } -} - - -size_t luaO_str2num (const char *s, TValue *o) { - lua_Integer i; lua_Number n; - const char *e; - if ((e = l_str2int(s, &i)) != NULL) { - setivalue(o, i); - } - else if ((e = l_str2d(s, &n)) != NULL) { - setfltvalue(o, n); - } - else - return 0; - return (e - s) + 1; -} - - -int luaO_utf8esc (char *buff, unsigned long x) { - int n = 1; - lua_assert(x <= 0x7FFFFFFFu); - if (x < 0x80) - buff[UTF8BUFFSZ - 1] = cast_char(x); - else { - unsigned int mfb = 0x3f; - do { - buff[UTF8BUFFSZ - (n++)] = cast_char(0x80 | (x & 0x3f)); - x >>= 6; - mfb >>= 1; - } while (x > mfb); - buff[UTF8BUFFSZ - n] = cast_char((~mfb << 1) | x); - } - return n; -} - - - -#define MAXNUMBER2STR 44 - - - -static int tostringbuff (TValue *obj, char *buff) { - int len; - lua_assert(ttisnumber(obj)); - if (ttisinteger(obj)) - len = lua_integer2str(buff, MAXNUMBER2STR, ivalue(obj)); - else { - len = lua_number2str(buff, MAXNUMBER2STR, fltvalue(obj)); - if (buff[strspn(buff, "-0123456789")] == '\0') { - buff[len++] = lua_getlocaledecpoint(); - buff[len++] = '0'; - } - } - return len; -} - - - -void luaO_tostring (lua_State *L, TValue *obj) { - char buff[MAXNUMBER2STR]; - int len = tostringbuff(obj, buff); - setsvalue(L, obj, luaS_newlstr(L, buff, len)); -} - - - - - - - -#define BUFVFS (LUA_IDSIZE + MAXNUMBER2STR + 95) - - -typedef struct BuffFS { - lua_State *L; - int pushed; - int blen; - char space[BUFVFS]; -} BuffFS; - - - -static void pushstr (BuffFS *buff, const char *str, size_t lstr) { - lua_State *L = buff->L; - setsvalue2s(L, L->top.p, luaS_newlstr(L, str, lstr)); - L->top.p++; - if (!buff->pushed) - buff->pushed = 1; - else - luaV_concat(L, 2); -} - - - -static void clearbuff (BuffFS *buff) { - pushstr(buff, buff->space, buff->blen); - buff->blen = 0; -} - - - -static char *getbuff (BuffFS *buff, int sz) { - lua_assert(buff->blen <= BUFVFS); lua_assert(sz <= BUFVFS); - if (sz > BUFVFS - buff->blen) - clearbuff(buff); - return buff->space + buff->blen; -} - - -#define addsize(b,sz) ((b)->blen += (sz)) - - - -static void addstr2buff (BuffFS *buff, const char *str, size_t slen) { - if (slen <= BUFVFS) { - char *bf = getbuff(buff, cast_int(slen)); - memcpy(bf, str, slen); - addsize(buff, cast_int(slen)); - } - else { - clearbuff(buff); - pushstr(buff, str, slen); - } -} - - - -static void addnum2buff (BuffFS *buff, TValue *num) { - char *numbuff = getbuff(buff, MAXNUMBER2STR); - int len = tostringbuff(num, numbuff); - addsize(buff, len); -} - - - -const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) { - BuffFS buff; - const char *e; - buff.pushed = buff.blen = 0; - buff.L = L; - while ((e = strchr(fmt, '%')) != NULL) { - addstr2buff(&buff, fmt, e - fmt); - switch (*(e + 1)) { - case 's': { - const char *s = va_arg(argp, char *); - if (s == NULL) s = "(null)"; - addstr2buff(&buff, s, strlen(s)); - break; - } - case 'c': { - char c = cast_uchar(va_arg(argp, int)); - addstr2buff(&buff, &c, sizeof(char)); - break; - } - case 'd': { - TValue num; - setivalue(&num, va_arg(argp, int)); - addnum2buff(&buff, &num); - break; - } - case 'I': { - TValue num; - setivalue(&num, cast(lua_Integer, va_arg(argp, l_uacInt))); - addnum2buff(&buff, &num); - break; - } - case 'f': { - TValue num; - setfltvalue(&num, cast_num(va_arg(argp, l_uacNumber))); - addnum2buff(&buff, &num); - break; - } - case 'p': { - const int sz = 3 * sizeof(void*) + 8; - char *bf = getbuff(&buff, sz); - void *p = va_arg(argp, void *); - int len = lua_pointer2str(bf, sz, p); - addsize(&buff, len); - break; - } - case 'U': { - char bf[UTF8BUFFSZ]; - int len = luaO_utf8esc(bf, va_arg(argp, long)); - addstr2buff(&buff, bf + UTF8BUFFSZ - len, len); - break; - } - case '%': { - addstr2buff(&buff, "%", 1); - break; - } - default: { - luaG_runerror(L, "invalid option '%%%c' to 'lua_pushfstring'", - *(e + 1)); - } - } - fmt = e + 2; - } - addstr2buff(&buff, fmt, strlen(fmt)); - clearbuff(&buff); - lua_assert(buff.pushed == 1); - return getstr(tsvalue(s2v(L->top.p - 1))); -} - - -const char *luaO_pushfstring (lua_State *L, const char *fmt, ...) { - const char *msg; - va_list argp; - va_start(argp, fmt); - msg = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - return msg; -} - - - - -#define RETS "..." -#define PRE "[string \"" -#define POS "\"]" - -#define addstr(a,b,l) ( memcpy(a,b,(l) * sizeof(char)), a += (l) ) - -void luaO_chunkid (char *out, const char *source, size_t srclen) { - size_t bufflen = LUA_IDSIZE; - if (*source == '=') { - if (srclen <= bufflen) - memcpy(out, source + 1, srclen * sizeof(char)); - else { - addstr(out, source + 1, bufflen - 1); - *out = '\0'; - } - } - else if (*source == '@') { - if (srclen <= bufflen) - memcpy(out, source + 1, srclen * sizeof(char)); - else { - addstr(out, RETS, LL(RETS)); - bufflen -= LL(RETS); - memcpy(out, source + 1 + srclen - bufflen, bufflen * sizeof(char)); - } - } - else { - const char *nl = strchr(source, '\n'); - addstr(out, PRE, LL(PRE)); - bufflen -= LL(PRE RETS POS) + 1; - if (srclen < bufflen && nl == NULL) { - addstr(out, source, srclen); - } - else { - if (nl != NULL) srclen = nl - source; - if (srclen > bufflen) srclen = bufflen; - addstr(out, source, srclen); - addstr(out, RETS, LL(RETS)); - } - memcpy(out, POS, (LL(POS) + 1) * sizeof(char)); - } -} - - - -//path: src/imports/../dependencies/lua/ltm.c - - -#define ltm_c -#define LUA_CORE - - - - - -#include - - - - - - - - - - - - - - - - - - - - - - - - -static const char udatatypename[] = "userdata"; - -LUAI_DDEF const char *const luaT_typenames_[LUA_TOTALTYPES] = { - "no value", - "nil", "boolean", udatatypename, "number", - "string", "table", "function", udatatypename, "thread", - "upvalue", "proto" -}; - - -void luaT_init (lua_State *L) { - static const char *const luaT_eventname[] = { - "__index", "__newindex", - "__gc", "__mode", "__len", "__eq", - "__add", "__sub", "__mul", "__mod", "__pow", - "__div", "__idiv", - "__band", "__bor", "__bxor", "__shl", "__shr", - "__unm", "__bnot", "__lt", "__le", - "__concat", "__call", "__close" - }; - int i; - for (i=0; itmname[i] = luaS_new(L, luaT_eventname[i]); - luaC_fix(L, obj2gco(G(L)->tmname[i])); - } -} - - - -const TValue *luaT_gettm (Table *events, TMS event, TString *ename) { - const TValue *tm = luaH_Hgetshortstr(events, ename); - lua_assert(event <= TM_EQ); - if (notm(tm)) { - events->flags |= cast_byte(1u<metatable; - break; - case LUA_TUSERDATA: - mt = uvalue(o)->metatable; - break; - default: - mt = G(L)->mt[ttype(o)]; - } - return (mt ? luaH_Hgetshortstr(mt, G(L)->tmname[event]) : &G(L)->nilvalue); -} - - - -const char *luaT_objtypename (lua_State *L, const TValue *o) { - Table *mt; - if ((ttistable(o) && (mt = hvalue(o)->metatable) != NULL) || - (ttisfulluserdata(o) && (mt = uvalue(o)->metatable) != NULL)) { - const TValue *name = luaH_Hgetshortstr(mt, luaS_new(L, "__name")); - if (ttisstring(name)) - return getstr(tsvalue(name)); - } - return ttypename(ttype(o)); -} - - -void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, const TValue *p3) { - StkId func = L->top.p; - setobj2s(L, func, f); - setobj2s(L, func + 1, p1); - setobj2s(L, func + 2, p2); - setobj2s(L, func + 3, p3); - L->top.p = func + 4; - - if (isLuacode(L->ci)) - luaD_call(L, func, 0); - else - luaD_callnoyield(L, func, 0); -} - - -int luaT_callTMres (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, StkId res) { - ptrdiff_t result = savestack(L, res); - StkId func = L->top.p; - setobj2s(L, func, f); - setobj2s(L, func + 1, p1); - setobj2s(L, func + 2, p2); - L->top.p += 3; - - if (isLuacode(L->ci)) - luaD_call(L, func, 1); - else - luaD_callnoyield(L, func, 1); - res = restorestack(L, result); - setobjs2s(L, res, --L->top.p); - return ttypetag(s2v(res)); -} - - -static int callbinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event) { - const TValue *tm = luaT_gettmbyobj(L, p1, event); - if (notm(tm)) - tm = luaT_gettmbyobj(L, p2, event); - if (notm(tm)) - return -1; - else - return luaT_callTMres(L, tm, p1, p2, res); -} - - -void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event) { - if (l_unlikely(callbinTM(L, p1, p2, res, event) < 0)) { - switch (event) { - case TM_BAND: case TM_BOR: case TM_BXOR: - case TM_SHL: case TM_SHR: case TM_BNOT: { - if (ttisnumber(p1) && ttisnumber(p2)) - luaG_tointerror(L, p1, p2); - else - luaG_opinterror(L, p1, p2, "perform bitwise operation on"); - } - /* FALLTHROUGH */ - default: - luaG_opinterror(L, p1, p2, "perform arithmetic on"); - } - } -} - - - -void luaT_tryconcatTM (lua_State *L) { - StkId p1 = L->top.p - 2; - if (l_unlikely(callbinTM(L, s2v(p1), s2v(p1 + 1), p1, TM_CONCAT) < 0)) - luaG_concaterror(L, s2v(p1), s2v(p1 + 1)); -} - - -void luaT_trybinassocTM (lua_State *L, const TValue *p1, const TValue *p2, - int flip, StkId res, TMS event) { - if (flip) - luaT_trybinTM(L, p2, p1, res, event); - else - luaT_trybinTM(L, p1, p2, res, event); -} - - -void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, - int flip, StkId res, TMS event) { - TValue aux; - setivalue(&aux, i2); - luaT_trybinassocTM(L, p1, &aux, flip, res, event); -} - - - -int luaT_callorderTM (lua_State *L, const TValue *p1, const TValue *p2, - TMS event) { - int tag = callbinTM(L, p1, p2, L->top.p, event); - if (tag >= 0) - return !tagisfalse(tag); -#if defined(LUA_COMPAT_LT_LE) - else if (event == TM_LE) { - - L->ci->callstatus |= CIST_LEQ; - tag = callbinTM(L, p2, p1, L->top.p, TM_LT); - L->ci->callstatus ^= CIST_LEQ; - if (tag >= 0) - return tagisfalse(tag); - } -#endif - luaG_ordererror(L, p1, p2); - return 0; -} - - -int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, - int flip, int isfloat, TMS event) { - TValue aux; const TValue *p2; - if (isfloat) { - setfltvalue(&aux, cast_num(v2)); - } - else - setivalue(&aux, v2); - if (flip) { - p2 = p1; p1 = &aux; - } - else - p2 = &aux; - return luaT_callorderTM(L, p1, p2, event); -} - - -void luaT_adjustvarargs (lua_State *L, int nfixparams, CallInfo *ci, - const Proto *p) { - int i; - int actual = cast_int(L->top.p - ci->func.p) - 1; - int nextra = actual - nfixparams; - ci->u.l.nextraargs = nextra; - luaD_checkstack(L, p->maxstacksize + 1); - - setobjs2s(L, L->top.p++, ci->func.p); - - for (i = 1; i <= nfixparams; i++) { - setobjs2s(L, L->top.p++, ci->func.p + i); - setnilvalue(s2v(ci->func.p + i)); - } - ci->func.p += actual + 1; - ci->top.p += actual + 1; - lua_assert(L->top.p <= ci->top.p && ci->top.p <= L->stack_last.p); -} - - -void luaT_getvarargs (lua_State *L, CallInfo *ci, StkId where, int wanted) { - int i; - int nextra = ci->u.l.nextraargs; - if (wanted < 0) { - wanted = nextra; - checkstackp(L, nextra, where); - L->top.p = where + nextra; - } - for (i = 0; i < wanted && i < nextra; i++) - setobjs2s(L, where + i, ci->func.p - nextra + i); - for (; i < wanted; i++) - setnilvalue(s2v(where + i)); -} - - - -//path: src/imports/../dependencies/lua/lstring.c - - -#define lstring_c -#define LUA_CORE - - - - - -#include - - - - - - - - - - - - - - - - - - - -#define MAXSTRTB cast_int(luaM_limitN(MAX_INT, TString*)) - - - -int luaS_eqlngstr (TString *a, TString *b) { - size_t len = a->u.lnglen; - lua_assert(a->tt == LUA_VLNGSTR && b->tt == LUA_VLNGSTR); - return (a == b) || - ((len == b->u.lnglen) && - (memcmp(getlngstr(a), getlngstr(b), len) == 0)); -} - - -unsigned luaS_hash (const char *str, size_t l, unsigned seed) { - unsigned int h = seed ^ cast_uint(l); - for (; l > 0; l--) - h ^= ((h<<5) + (h>>2) + cast_byte(str[l - 1])); - return h; -} - - -unsigned luaS_hashlongstr (TString *ts) { - lua_assert(ts->tt == LUA_VLNGSTR); - if (ts->extra == 0) { - size_t len = ts->u.lnglen; - ts->hash = luaS_hash(getlngstr(ts), len, ts->hash); - ts->extra = 1; - } - return ts->hash; -} - - -static void tablerehash (TString **vect, int osize, int nsize) { - int i; - for (i = osize; i < nsize; i++) - vect[i] = NULL; - for (i = 0; i < osize; i++) { - TString *p = vect[i]; - vect[i] = NULL; - while (p) { - TString *hnext = p->u.hnext; - unsigned int h = lmod(p->hash, nsize); - p->u.hnext = vect[h]; - vect[h] = p; - p = hnext; - } - } -} - - - -void luaS_resize (lua_State *L, int nsize) { - stringtable *tb = &G(L)->strt; - int osize = tb->size; - TString **newvect; - if (nsize < osize) - tablerehash(tb->hash, osize, nsize); - newvect = luaM_reallocvector(L, tb->hash, osize, nsize, TString*); - if (l_unlikely(newvect == NULL)) { - if (nsize < osize) - tablerehash(tb->hash, nsize, osize); - - } - else { - tb->hash = newvect; - tb->size = nsize; - if (nsize > osize) - tablerehash(newvect, osize, nsize); - } -} - - - -void luaS_clearcache (global_State *g) { - int i, j; - for (i = 0; i < STRCACHE_N; i++) - for (j = 0; j < STRCACHE_M; j++) { - if (iswhite(g->strcache[i][j])) - g->strcache[i][j] = g->memerrmsg; - } -} - - - -void luaS_init (lua_State *L) { - global_State *g = G(L); - int i, j; - stringtable *tb = &G(L)->strt; - tb->hash = luaM_newvector(L, MINSTRTABSIZE, TString*); - tablerehash(tb->hash, 0, MINSTRTABSIZE); - tb->size = MINSTRTABSIZE; - - g->memerrmsg = luaS_newliteral(L, MEMERRMSG); - luaC_fix(L, obj2gco(g->memerrmsg)); - for (i = 0; i < STRCACHE_N; i++) - for (j = 0; j < STRCACHE_M; j++) - g->strcache[i][j] = g->memerrmsg; -} - - -size_t luaS_sizelngstr (size_t len, int kind) { - switch (kind) { - case LSTRREG: - - return offsetof(TString, falloc) + (len + 1) * sizeof(char); - case LSTRFIX: - - return offsetof(TString, falloc); - default: - lua_assert(kind == LSTRMEM); - return sizeof(TString); - } -} - - - -static TString *createstrobj (lua_State *L, size_t totalsize, int tag, - unsigned h) { - TString *ts; - GCObject *o; - o = luaC_newobj(L, tag, totalsize); - ts = gco2ts(o); - ts->hash = h; - ts->extra = 0; - return ts; -} - - -TString *luaS_createlngstrobj (lua_State *L, size_t l) { - size_t totalsize = luaS_sizelngstr(l, LSTRREG); - TString *ts = createstrobj(L, totalsize, LUA_VLNGSTR, G(L)->seed); - ts->u.lnglen = l; - ts->shrlen = LSTRREG; - ts->contents = cast_charp(ts) + offsetof(TString, falloc); - ts->contents[l] = '\0'; - return ts; -} - - -void luaS_remove (lua_State *L, TString *ts) { - stringtable *tb = &G(L)->strt; - TString **p = &tb->hash[lmod(ts->hash, tb->size)]; - while (*p != ts) - p = &(*p)->u.hnext; - *p = (*p)->u.hnext; - tb->nuse--; -} - - -static void growstrtab (lua_State *L, stringtable *tb) { - if (l_unlikely(tb->nuse == MAX_INT)) { - luaC_fullgc(L, 1); - if (tb->nuse == MAX_INT) - luaM_error(L); - } - if (tb->size <= MAXSTRTB / 2) - luaS_resize(L, tb->size * 2); -} - - - -static TString *internshrstr (lua_State *L, const char *str, size_t l) { - TString *ts; - global_State *g = G(L); - stringtable *tb = &g->strt; - unsigned int h = luaS_hash(str, l, g->seed); - TString **list = &tb->hash[lmod(h, tb->size)]; - lua_assert(str != NULL); - for (ts = *list; ts != NULL; ts = ts->u.hnext) { - if (l == cast_uint(ts->shrlen) && - (memcmp(str, getshrstr(ts), l * sizeof(char)) == 0)) { - - if (isdead(g, ts)) - changewhite(ts); - return ts; - } - } - - if (tb->nuse >= tb->size) { - growstrtab(L, tb); - list = &tb->hash[lmod(h, tb->size)]; - } - ts = createstrobj(L, sizestrshr(l), LUA_VSHRSTR, h); - ts->shrlen = cast_byte(l); - getshrstr(ts)[l] = '\0'; - memcpy(getshrstr(ts), str, l * sizeof(char)); - ts->u.hnext = *list; - *list = ts; - tb->nuse++; - return ts; -} - - - -TString *luaS_newlstr (lua_State *L, const char *str, size_t l) { - if (l <= LUAI_MAXSHORTLEN) - return internshrstr(L, str, l); - else { - TString *ts; - if (l_unlikely(l * sizeof(char) >= (MAX_SIZE - sizeof(TString)))) - luaM_toobig(L); - ts = luaS_createlngstrobj(L, l); - memcpy(getlngstr(ts), str, l * sizeof(char)); - return ts; - } -} - - - -TString *luaS_new (lua_State *L, const char *str) { - unsigned int i = point2uint(str) % STRCACHE_N; - int j; - TString **p = G(L)->strcache[i]; - for (j = 0; j < STRCACHE_M; j++) { - if (strcmp(str, getstr(p[j])) == 0) - return p[j]; - } - - for (j = STRCACHE_M - 1; j > 0; j--) - p[j] = p[j - 1]; - - p[0] = luaS_newlstr(L, str, strlen(str)); - return p[0]; -} - - -Udata *luaS_newudata (lua_State *L, size_t s, int nuvalue) { - Udata *u; - int i; - GCObject *o; - if (l_unlikely(s > MAX_SIZE - udatamemoffset(nuvalue))) - luaM_toobig(L); - o = luaC_newobj(L, LUA_VUSERDATA, sizeudata(nuvalue, s)); - u = gco2u(o); - u->len = s; - u->nuvalue = nuvalue; - u->metatable = NULL; - for (i = 0; i < nuvalue; i++) - setnilvalue(&u->uv[i].uv); - return u; -} - - -struct NewExt { - int kind; - const char *s; - size_t len; - TString *ts; -}; - - -static void f_newext (lua_State *L, void *ud) { - struct NewExt *ne = cast(struct NewExt *, ud); - size_t size = luaS_sizelngstr(0, ne->kind); - ne->ts = createstrobj(L, size, LUA_VLNGSTR, G(L)->seed); -} - - -static void f_pintern (lua_State *L, void *ud) { - struct NewExt *ne = cast(struct NewExt *, ud); - ne->ts = internshrstr(L, ne->s, ne->len); -} - - -TString *luaS_newextlstr (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud) { - struct NewExt ne; - if (len <= LUAI_MAXSHORTLEN) { - ne.s = s; ne.len = len; - if (!falloc) - f_pintern(L, &ne); - else { - int status = luaD_rawrunprotected(L, f_pintern, &ne); - (*falloc)(ud, cast_voidp(s), len + 1, 0); - if (status != LUA_OK) - luaM_error(L); - } - return ne.ts; - } - - if (!falloc) { - ne.kind = LSTRFIX; - f_newext(L, &ne); - } - else { - ne.kind = LSTRMEM; - if (luaD_rawrunprotected(L, f_newext, &ne) != LUA_OK) { - (*falloc)(ud, cast_voidp(s), len + 1, 0); - luaM_error(L); - } - ne.ts->falloc = falloc; - ne.ts->ud = ud; - } - ne.ts->shrlen = ne.kind; - ne.ts->u.lnglen = len; - ne.ts->contents = cast_charp(s); - return ne.ts; -} - - - - -//path: src/imports/../dependencies/lua/ltable.c - - -#define ltable_c -#define LUA_CORE - - - - - - - -#include - - - - - - - - - - - - - - - - - - - - - - - - - -#define LIMFORLAST 2 - - -typedef struct { Node *dummy; Node follows_pNode; } Limbox_aux; - -typedef union { - Node *lastfree; - char padding[offsetof(Limbox_aux, follows_pNode)]; -} Limbox; - -#define haslastfree(t) ((t)->lsizenode > LIMFORLAST) -#define getlastfree(t) ((cast(Limbox *, (t)->node) - 1)->lastfree) - - - -#define MAXABITS cast_int(sizeof(int) * CHAR_BIT - 1) - - - -#define MAXASIZEB ((MAX_SIZET/sizeof(ArrayCell)) * NM) - - - -#define MAXASIZE \ - (((1u << MAXABITS) < MAXASIZEB) ? (1u << MAXABITS) : cast_uint(MAXASIZEB)) - - -#define MAXHBITS (MAXABITS - 1) - - - -#define MAXHSIZE luaM_limitN(1u << MAXHBITS, Node) - - - -#define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t)))) - - -#define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1)))) - - -#define hashstr(t,str) hashpow2(t, (str)->hash) -#define hashboolean(t,p) hashpow2(t, p) - - -#define hashpointer(t,p) hashmod(t, point2uint(p)) - - -#define dummynode (&dummynode_) - -static const Node dummynode_ = { - {{NULL}, LUA_VEMPTY, - LUA_VNIL, 0, {NULL}} -}; - - -static const TValue absentkey = {ABSTKEYCONSTANT}; - - - -static Node *hashint (const Table *t, lua_Integer i) { - lua_Unsigned ui = l_castS2U(i); - if (ui <= cast_uint(INT_MAX)) - return hashmod(t, cast_int(ui)); - else - return hashmod(t, ui); -} - - - -#if !defined(l_hashfloat) -static int l_hashfloat (lua_Number n) { - int i; - lua_Integer ni; - n = l_mathop(private_lua_cembed_frexp)(n, &i) * -cast_num(INT_MIN); - if (!lua_numbertointeger(n, &ni)) { - lua_assert(luai_numisnan(n) || l_mathop(fabs)(n) == cast_num(HUGE_VAL)); - return 0; - } - else { - unsigned int u = cast_uint(i) + cast_uint(ni); - return cast_int(u <= cast_uint(INT_MAX) ? u : ~u); - } -} -#endif - - - -static Node *mainpositionTV (const Table *t, const TValue *key) { - switch (ttypetag(key)) { - case LUA_VNUMINT: { - lua_Integer i = ivalue(key); - return hashint(t, i); - } - case LUA_VNUMFLT: { - lua_Number n = fltvalue(key); - return hashmod(t, l_hashfloat(n)); - } - case LUA_VSHRSTR: { - TString *ts = tsvalue(key); - return hashstr(t, ts); - } - case LUA_VLNGSTR: { - TString *ts = tsvalue(key); - return hashpow2(t, luaS_hashlongstr(ts)); - } - case LUA_VFALSE: - return hashboolean(t, 0); - case LUA_VTRUE: - return hashboolean(t, 1); - case LUA_VLIGHTUSERDATA: { - void *p = pvalue(key); - return hashpointer(t, p); - } - case LUA_VLCF: { - lua_CFunction f = fvalue(key); - return hashpointer(t, f); - } - default: { - GCObject *o = gcvalue(key); - return hashpointer(t, o); - } - } -} - - -l_sinline Node *mainpositionfromnode (const Table *t, Node *nd) { - TValue key; - getnodekey(cast(lua_State *, NULL), &key, nd); - return mainpositionTV(t, &key); -} - - - -static int equalkey (const TValue *k1, const Node *n2, int deadok) { - if ((rawtt(k1) != keytt(n2)) && - !(deadok && keyisdead(n2) && iscollectable(k1))) - return 0; - switch (keytt(n2)) { - case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: - return 1; - case LUA_VNUMINT: - return (ivalue(k1) == keyival(n2)); - case LUA_VNUMFLT: - return luai_numeq(fltvalue(k1), fltvalueraw(keyval(n2))); - case LUA_VLIGHTUSERDATA: - return pvalue(k1) == pvalueraw(keyval(n2)); - case LUA_VLCF: - return fvalue(k1) == fvalueraw(keyval(n2)); - case ctb(LUA_VLNGSTR): - return luaS_eqlngstr(tsvalue(k1), keystrval(n2)); - default: - return gcvalue(k1) == gcvalueraw(keyval(n2)); - } -} - - - -#define limitequalsasize(t) (isrealasize(t) || ispow2((t)->alimit)) - - - -LUAI_FUNC unsigned int luaH_realasize (const Table *t) { - if (limitequalsasize(t)) - return t->alimit; - else { - unsigned int size = t->alimit; - - size |= (size >> 1); - size |= (size >> 2); - size |= (size >> 4); - size |= (size >> 8); -#if (UINT_MAX >> 14) > 3 - size |= (size >> 16); -#if (UINT_MAX >> 30) > 3 - size |= (size >> 32); -#endif -#endif - size++; - lua_assert(ispow2(size) && size/2 < t->alimit && t->alimit < size); - return size; - } -} - - - -static int ispow2realasize (const Table *t) { - return (!isrealasize(t) || ispow2(t->alimit)); -} - - -static unsigned int setlimittosize (Table *t) { - t->alimit = luaH_realasize(t); - setrealasize(t); - return t->alimit; -} - - -#define limitasasize(t) check_exp(isrealasize(t), t->alimit) - - - - -static const TValue *getgeneric (Table *t, const TValue *key, int deadok) { - Node *n = mainpositionTV(t, key); - for (;;) { - if (equalkey(key, n, deadok)) - return gval(n); - else { - int nx = gnext(n); - if (nx == 0) - return &absentkey; - n += nx; - } - } -} - - - -static unsigned int arrayindex (lua_Integer k) { - if (l_castS2U(k) - 1u < MAXASIZE) - return cast_uint(k); - else - return 0; -} - - - -static unsigned findindex (lua_State *L, Table *t, TValue *key, - unsigned asize) { - unsigned int i; - if (ttisnil(key)) return 0; - i = ttisinteger(key) ? arrayindex(ivalue(key)) : 0; - if (i - 1u < asize) - return i; - else { - const TValue *n = getgeneric(t, key, 1); - if (l_unlikely(isabstkey(n))) - luaG_runerror(L, "invalid key to 'next'"); - i = cast_int(nodefromval(n) - gnode(t, 0)); - - return (i + 1) + asize; - } -} - - -int luaH_next (lua_State *L, Table *t, StkId key) { - unsigned int asize = luaH_realasize(t); - unsigned int i = findindex(L, t, s2v(key), asize); - for (; i < asize; i++) { - int tag = *getArrTag(t, i); - if (!tagisempty(tag)) { - setivalue(s2v(key), i + 1); - farr2val(t, i + 1, tag, s2v(key + 1)); - return 1; - } - } - for (i -= asize; cast_int(i) < sizenode(t); i++) { - if (!isempty(gval(gnode(t, i)))) { - Node *n = gnode(t, i); - getnodekey(L, s2v(key), n); - setobj2s(L, key + 1, gval(n)); - return 1; - } - } - return 0; -} - - -static void freehash (lua_State *L, Table *t) { - if (!isdummy(t)) { - size_t bsize = sizenode(t) * sizeof(Node); - char *arr = cast_charp(t->node); - if (haslastfree(t)) { - bsize += sizeof(Limbox); - arr -= sizeof(Limbox); - } - luaM_freearray(L, arr, bsize); - } -} - - - -static int keyinarray (Table *t, lua_Integer key) { - lua_Unsigned alimit = t->alimit; - if (l_castS2U(key) - 1u < alimit) - return 1; - else if (!isrealasize(t) && - (((l_castS2U(key) - 1u) & ~(alimit - 1u)) < alimit)) { - t->alimit = cast_uint(key); - return 1; - } - else - return 0; -} - - - - - -static unsigned computesizes (unsigned nums[], unsigned *pna) { - int i; - unsigned int twotoi; - unsigned int a = 0; - unsigned int na = 0; - unsigned int optimal = 0; - - for (i = 0, twotoi = 1; - twotoi > 0 && *pna > twotoi / 2; - i++, twotoi *= 2) { - a += nums[i]; - if (a > twotoi/2) { - optimal = twotoi; - na = a; - } - } - lua_assert((optimal == 0 || optimal / 2 < na) && na <= optimal); - *pna = na; - return optimal; -} - - -static int countint (lua_Integer key, unsigned int *nums) { - unsigned int k = arrayindex(key); - if (k != 0) { - nums[luaO_ceillog2(k)]++; - return 1; - } - else - return 0; -} - - -l_sinline int arraykeyisempty (const Table *t, lua_Integer key) { - int tag = *getArrTag(t, key - 1); - return tagisempty(tag); -} - - - -static unsigned numusearray (const Table *t, unsigned *nums) { - int lg; - unsigned int ttlg; - unsigned int ause = 0; - unsigned int i = 1; - unsigned int asize = limitasasize(t); - - for (lg = 0, ttlg = 1; lg <= MAXABITS; lg++, ttlg *= 2) { - unsigned int lc = 0; - unsigned int lim = ttlg; - if (lim > asize) { - lim = asize; - if (i > lim) - break; - } - - for (; i <= lim; i++) { - if (!arraykeyisempty(t, i)) - lc++; - } - nums[lg] += lc; - ause += lc; - } - return ause; -} - - -static int numusehash (const Table *t, unsigned *nums, unsigned *pna) { - int totaluse = 0; - int ause = 0; - int i = sizenode(t); - while (i--) { - Node *n = &t->node[i]; - if (!isempty(gval(n))) { - if (keyisinteger(n)) - ause += countint(keyival(n), nums); - totaluse++; - } - } - *pna += ause; - return totaluse; -} - - - -static size_t concretesize (unsigned int size) { - unsigned int numcells = (size + NM - 1) / NM; - unsigned int extra = NM - 1 - ((size + NM - 1) % NM); - return numcells * sizeof(ArrayCell) - extra * sizeof(Value); -} - - -static ArrayCell *resizearray (lua_State *L , Table *t, - unsigned oldasize, - unsigned newasize) { - size_t oldasizeb = concretesize(oldasize); - size_t newasizeb = concretesize(newasize); - void *a = luaM_reallocvector(L, t->array, oldasizeb, newasizeb, lu_byte); - return cast(ArrayCell*, a); -} - - - -static void setnodevector (lua_State *L, Table *t, unsigned size) { - if (size == 0) { - t->node = cast(Node *, dummynode); - t->lsizenode = 0; - setdummy(t); - } - else { - int i; - int lsize = luaO_ceillog2(size); - if (lsize > MAXHBITS || (1u << lsize) > MAXHSIZE) - luaG_runerror(L, "table overflow"); - size = twoto(lsize); - if (lsize <= LIMFORLAST) - t->node = luaM_newvector(L, size, Node); - else { - size_t bsize = size * sizeof(Node) + sizeof(Limbox); - char *node = luaM_newblock(L, bsize); - t->node = cast(Node *, node + sizeof(Limbox)); - getlastfree(t) = gnode(t, size); - } - t->lsizenode = cast_byte(lsize); - setnodummy(t); - for (i = 0; i < cast_int(size); i++) { - Node *n = gnode(t, i); - gnext(n) = 0; - setnilkey(n); - setempty(gval(n)); - } - } -} - - - -static void reinsert (lua_State *L, Table *ot, Table *t) { - int j; - int size = sizenode(ot); - for (j = 0; j < size; j++) { - Node *old = gnode(ot, j); - if (!isempty(gval(old))) { - - TValue k; - getnodekey(L, &k, old); - luaH_set(L, t, &k, gval(old)); - } - } -} - - - -static void exchangehashpart (Table *t1, Table *t2) { - lu_byte lsizenode = t1->lsizenode; - Node *node = t1->node; - int bitdummy1 = t1->flags & BITDUMMY; - t1->lsizenode = t2->lsizenode; - t1->node = t2->node; - t1->flags = (t1->flags & NOTBITDUMMY) | (t2->flags & BITDUMMY); - t2->lsizenode = lsizenode; - t2->node = node; - t2->flags = (t2->flags & NOTBITDUMMY) | bitdummy1; -} - - - -static void reinsertOldSlice (lua_State *L, Table *t, unsigned oldasize, - unsigned newasize) { - unsigned i; - t->alimit = newasize; - for (i = newasize; i < oldasize; i++) { - int tag = *getArrTag(t, i); - if (!tagisempty(tag)) { - TValue aux; - farr2val(t, i + 1, tag, &aux); - luaH_setint(L, t, i + 1, &aux); - } - } - t->alimit = oldasize; -} - - - -static void clearNewSlice (Table *t, unsigned oldasize, unsigned newasize) { - for (; oldasize < newasize; oldasize++) - *getArrTag(t, oldasize) = LUA_VEMPTY; -} - - - -void luaH_resize (lua_State *L, Table *t, unsigned newasize, - unsigned nhsize) { - Table newt; - unsigned int oldasize = setlimittosize(t); - ArrayCell *newarray; - if (newasize > MAXASIZE) - luaG_runerror(L, "table overflow"); - - newt.flags = 0; - setnodevector(L, &newt, nhsize); - if (newasize < oldasize) { - - exchangehashpart(t, &newt); - reinsertOldSlice(L, t, oldasize, newasize); - exchangehashpart(t, &newt); - } - - newarray = resizearray(L, t, oldasize, newasize); - if (l_unlikely(newarray == NULL && newasize > 0)) { - freehash(L, &newt); - luaM_error(L); - } - - exchangehashpart(t, &newt); - t->array = newarray; - t->alimit = newasize; - clearNewSlice(t, oldasize, newasize); - - reinsert(L, &newt, t); - freehash(L, &newt); -} - - -void luaH_resizearray (lua_State *L, Table *t, unsigned int nasize) { - int nsize = allocsizenode(t); - luaH_resize(L, t, nasize, nsize); -} - - -static void rehash (lua_State *L, Table *t, const TValue *ek) { - unsigned int asize; - unsigned int na; - unsigned int nums[MAXABITS + 1]; - int i; - int totaluse; - for (i = 0; i <= MAXABITS; i++) nums[i] = 0; - setlimittosize(t); - na = numusearray(t, nums); - totaluse = na; - totaluse += numusehash(t, nums, &na); - - if (ttisinteger(ek)) - na += countint(ivalue(ek), nums); - totaluse++; - - asize = computesizes(nums, &na); - - luaH_resize(L, t, asize, totaluse - na); -} - - - - - - -Table *luaH_new (lua_State *L) { - GCObject *o = luaC_newobj(L, LUA_VTABLE, sizeof(Table)); - Table *t = gco2t(o); - t->metatable = NULL; - t->flags = cast_byte(maskflags); - t->array = NULL; - t->alimit = 0; - setnodevector(L, t, 0); - return t; -} - - - -void luaH_free (lua_State *L, Table *t) { - unsigned int realsize = luaH_realasize(t); - size_t sizeb = concretesize(realsize); - lua_assert((sizeb == 0 && realsize == 0) || - cast_charp(t->array) + sizeb - sizeof(Value) == - cast_charp(getArrVal(t, realsize - 1))); - freehash(L, t); - luaM_freemem(L, t->array, sizeb); - luaM_free(L, t); -} - - -static Node *getfreepos (Table *t) { - if (haslastfree(t)) { - - while (getlastfree(t) > t->node) { - Node *free = --getlastfree(t); - if (keyisnil(free)) - return free; - } - } - else { - if (!isdummy(t)) { - int i = sizenode(t); - while (i--) { - Node *free = gnode(t, i); - if (keyisnil(free)) - return free; - } - } - } - return NULL; -} - - - - -static void luaH_newkey (lua_State *L, Table *t, const TValue *key, - TValue *value) { - Node *mp; - TValue aux; - if (l_unlikely(ttisnil(key))) - luaG_runerror(L, "table index is nil"); - else if (ttisfloat(key)) { - lua_Number f = fltvalue(key); - lua_Integer k; - if (luaV_flttointeger(f, &k, F2Ieq)) { - setivalue(&aux, k); - key = &aux; - } - else if (l_unlikely(luai_numisnan(f))) - luaG_runerror(L, "table index is NaN"); - } - if (ttisnil(value)) - return; - mp = mainpositionTV(t, key); - if (!isempty(gval(mp)) || isdummy(t)) { - Node *othern; - Node *f = getfreepos(t); - if (f == NULL) { - rehash(L, t, key); - - luaH_set(L, t, key, value); - return; - } - lua_assert(!isdummy(t)); - othern = mainpositionfromnode(t, mp); - if (othern != mp) { - - while (othern + gnext(othern) != mp) - othern += gnext(othern); - gnext(othern) = cast_int(f - othern); - *f = *mp; - if (gnext(mp) != 0) { - gnext(f) += cast_int(mp - f); - gnext(mp) = 0; - } - setempty(gval(mp)); - } - else { - - if (gnext(mp) != 0) - gnext(f) = cast_int((mp + gnext(mp)) - f); - else lua_assert(gnext(f) == 0); - gnext(mp) = cast_int(f - mp); - mp = f; - } - } - setnodekey(L, mp, key); - luaC_barrierback(L, obj2gco(t), key); - lua_assert(isempty(gval(mp))); - setobj2t(L, gval(mp), value); -} - - -static const TValue *getintfromhash (Table *t, lua_Integer key) { - Node *n = hashint(t, key); - lua_assert(l_castS2U(key) - 1u >= luaH_realasize(t)); - for (;;) { - if (keyisinteger(n) && keyival(n) == key) - return gval(n); - else { - int nx = gnext(n); - if (nx == 0) break; - n += nx; - } - } - return &absentkey; -} - - -static int hashkeyisempty (Table *t, lua_Integer key) { - const TValue *val = getintfromhash(t, key); - return isempty(val); -} - - -static int finishnodeget (const TValue *val, TValue *res) { - if (!ttisnil(val)) { - setobj(((lua_State*)NULL), res, val); - } - return ttypetag(val); -} - - -int luaH_getint (Table *t, lua_Integer key, TValue *res) { - if (keyinarray(t, key)) { - int tag = *getArrTag(t, key - 1); - if (!tagisempty(tag)) - farr2val(t, key, tag, res); - return tag; - } - else - return finishnodeget(getintfromhash(t, key), res); -} - - - -const TValue *luaH_Hgetshortstr (Table *t, TString *key) { - Node *n = hashstr(t, key); - lua_assert(key->tt == LUA_VSHRSTR); - for (;;) { - if (keyisshrstr(n) && eqshrstr(keystrval(n), key)) - return gval(n); - else { - int nx = gnext(n); - if (nx == 0) - return &absentkey; - n += nx; - } - } -} - - -int luaH_getshortstr (Table *t, TString *key, TValue *res) { - return finishnodeget(luaH_Hgetshortstr(t, key), res); -} - - -static const TValue *Hgetstr (Table *t, TString *key) { - if (key->tt == LUA_VSHRSTR) - return luaH_Hgetshortstr(t, key); - else { - TValue ko; - setsvalue(cast(lua_State *, NULL), &ko, key); - return getgeneric(t, &ko, 0); - } -} - - -int luaH_getstr (Table *t, TString *key, TValue *res) { - return finishnodeget(Hgetstr(t, key), res); -} - - -TString *luaH_getstrkey (Table *t, TString *key) { - const TValue *o = Hgetstr(t, key); - if (!isabstkey(o)) - return keystrval(nodefromval(o)); - else - return NULL; -} - - - -int luaH_get (Table *t, const TValue *key, TValue *res) { - const TValue *slot; - switch (ttypetag(key)) { - case LUA_VSHRSTR: - slot = luaH_Hgetshortstr(t, tsvalue(key)); - break; - case LUA_VNUMINT: - return luaH_getint(t, ivalue(key), res); - case LUA_VNIL: - slot = &absentkey; - break; - case LUA_VNUMFLT: { - lua_Integer k; - if (luaV_flttointeger(fltvalue(key), &k, F2Ieq)) - return luaH_getint(t, k, res); - - } - default: - slot = getgeneric(t, key, 0); - break; - } - return finishnodeget(slot, res); -} - - -static int finishnodeset (Table *t, const TValue *slot, TValue *val) { - if (!ttisnil(slot)) { - setobj(((lua_State*)NULL), cast(TValue*, slot), val); - return HOK; - } - else if (isabstkey(slot)) - return HNOTFOUND; - else - return cast_int((cast(Node*, slot) - t->node)) + HFIRSTNODE; -} - - -static int rawfinishnodeset (const TValue *slot, TValue *val) { - if (isabstkey(slot)) - return 0; - else { - setobj(((lua_State*)NULL), cast(TValue*, slot), val); - return 1; - } -} - - -int luaH_psetint (Table *t, lua_Integer key, TValue *val) { - if (keyinarray(t, key)) { - lu_byte *tag = getArrTag(t, key - 1); - if (!tagisempty(*tag) || checknoTM(t->metatable, TM_NEWINDEX)) { - fval2arr(t, key, tag, val); - return HOK; - } - else - return ~cast_int(key); - } - else - return finishnodeset(t, getintfromhash(t, key), val); -} - - -int luaH_psetshortstr (Table *t, TString *key, TValue *val) { - return finishnodeset(t, luaH_Hgetshortstr(t, key), val); -} - - -int luaH_psetstr (Table *t, TString *key, TValue *val) { - return finishnodeset(t, Hgetstr(t, key), val); -} - - -int luaH_pset (Table *t, const TValue *key, TValue *val) { - switch (ttypetag(key)) { - case LUA_VSHRSTR: return luaH_psetshortstr(t, tsvalue(key), val); - case LUA_VNUMINT: return luaH_psetint(t, ivalue(key), val); - case LUA_VNIL: return HNOTFOUND; - case LUA_VNUMFLT: { - lua_Integer k; - if (luaV_flttointeger(fltvalue(key), &k, F2Ieq)) - return luaH_psetint(t, k, val); - - } - default: - return finishnodeset(t, getgeneric(t, key, 0), val); - } -} - - - - -void luaH_finishset (lua_State *L, Table *t, const TValue *key, - TValue *value, int hres) { - lua_assert(hres != HOK); - if (hres == HNOTFOUND) { - luaH_newkey(L, t, key, value); - } - else if (hres > 0) { - setobj2t(L, gval(gnode(t, hres - HFIRSTNODE)), value); - } - else { - hres = ~hres; - obj2arr(t, hres, value); - } -} - - - -void luaH_set (lua_State *L, Table *t, const TValue *key, TValue *value) { - int hres = luaH_pset(t, key, value); - if (hres != HOK) - luaH_finishset(L, t, key, value, hres); -} - - - -void luaH_setint (lua_State *L, Table *t, lua_Integer key, TValue *value) { - if (keyinarray(t, key)) - obj2arr(t, key, value); - else { - int ok = rawfinishnodeset(getintfromhash(t, key), value); - if (!ok) { - TValue k; - setivalue(&k, key); - luaH_newkey(L, t, &k, value); - } - } -} - - - -static lua_Unsigned hash_search (Table *t, lua_Unsigned j) { - lua_Unsigned i; - if (j == 0) j++; - do { - i = j; - if (j <= l_castS2U(LUA_MAXINTEGER) / 2) - j *= 2; - else { - j = LUA_MAXINTEGER; - if (hashkeyisempty(t, j)) - break; - else - return j; - } - } while (!hashkeyisempty(t, j)); - - while (j - i > 1u) { - lua_Unsigned m = (i + j) / 2; - if (hashkeyisempty(t, m)) j = m; - else i = m; - } - return i; -} - - -static unsigned int binsearch (Table *array, unsigned int i, unsigned int j) { - while (j - i > 1u) { - unsigned int m = (i + j) / 2; - if (arraykeyisempty(array, m)) j = m; - else i = m; - } - return i; -} - - - -lua_Unsigned luaH_getn (Table *t) { - unsigned int limit = t->alimit; - if (limit > 0 && arraykeyisempty(t, limit)) { - - if (limit >= 2 && !arraykeyisempty(t, limit - 1)) { - - if (ispow2realasize(t) && !ispow2(limit - 1)) { - t->alimit = limit - 1; - setnorealasize(t); - } - return limit - 1; - } - else { - unsigned int boundary = binsearch(t, 0, limit); - - if (ispow2realasize(t) && boundary > luaH_realasize(t) / 2) { - t->alimit = boundary; - setnorealasize(t); - } - return boundary; - } - } - - if (!limitequalsasize(t)) { - - if (arraykeyisempty(t, limit + 1)) - return limit; - - limit = luaH_realasize(t); - if (arraykeyisempty(t, limit)) { - - unsigned int boundary = binsearch(t, t->alimit, limit); - t->alimit = boundary; - return boundary; - } - - } - - lua_assert(limit == luaH_realasize(t) && - (limit == 0 || !arraykeyisempty(t, limit))); - if (isdummy(t) || hashkeyisempty(t, cast(lua_Integer, limit + 1))) - return limit; - else - return hash_search(t, limit); -} - - - -#if defined(LUA_DEBUG) - - - -Node *luaH_mainposition (const Table *t, const TValue *key) { - return mainpositionTV(t, key); -} - -#endif - - -//path: src/imports/../dependencies/lua/ldo.c - - -#define ldo_c -#define LUA_CORE - - - - - -#include -#include -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -#define errorstatus(s) ((s) > LUA_YIELD) - - - - - -#if !defined(LUAI_THROW) - -#if defined(__cplusplus) && !defined(LUA_USE_LONGJMP) - - -#define LUAI_THROW(L,c) throw(c) -#define LUAI_TRY(L,c,a) \ - try { a } catch(...) { if ((c)->status == 0) (c)->status = -1; } -#define luai_jmpbuf int - -#elif defined(LUA_USE_POSIX) - - -#define LUAI_THROW(L,c) _longjmp((c)->b, 1) -#define LUAI_TRY(L,c,a) if (_setjmp((c)->b) == 0) { a } -#define luai_jmpbuf jmp_buf - -#else - - -#define LUAI_THROW(L,c) longjmp((c)->b, 1) -#define LUAI_TRY(L,c,a) if (setjmp((c)->b) == 0) { a } -#define luai_jmpbuf jmp_buf - -#endif - -#endif - - - - -struct lua_longjmp { - struct lua_longjmp *previous; - luai_jmpbuf b; - volatile int status; -}; - - -void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop) { - switch (errcode) { - case LUA_ERRMEM: { - setsvalue2s(L, oldtop, G(L)->memerrmsg); - break; - } - case LUA_ERRERR: { - setsvalue2s(L, oldtop, luaS_newliteral(L, "error in private_lua_error handling")); - break; - } - case LUA_OK: { - setnilvalue(s2v(oldtop)); - break; - } - default: { - lua_assert(errorstatus(errcode)); - setobjs2s(L, oldtop, L->top.p - 1); - break; - } - } - L->top.p = oldtop + 1; -} - - -l_noret luaD_throw (lua_State *L, int errcode) { - if (L->errorJmp) { - L->errorJmp->status = errcode; - LUAI_THROW(L, L->errorJmp); - } - else { - global_State *g = G(L); - errcode = luaE_resetthread(L, errcode); - if (g->mainthread->errorJmp) { - setobjs2s(L, g->mainthread->top.p++, L->top.p - 1); - luaD_throw(g->mainthread, errcode); - } - else { - if (g->panic) { - lua_unlock(L); - g->panic(L); - } - abort(); - } - } -} - - -int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) { - l_uint32 oldnCcalls = L->nCcalls; - struct lua_longjmp lj; - lj.status = LUA_OK; - lj.previous = L->errorJmp; - L->errorJmp = &lj; - LUAI_TRY(L, &lj, - (*f)(L, ud); - ); - L->errorJmp = lj.previous; - L->nCcalls = oldnCcalls; - return lj.status; -} - - - - - - - - -static void relstack (lua_State *L) { - CallInfo *ci; - UpVal *up; - L->top.offset = savestack(L, L->top.p); - L->tbclist.offset = savestack(L, L->tbclist.p); - for (up = L->openupval; up != NULL; up = up->u.open.next) - up->v.offset = savestack(L, uplevel(up)); - for (ci = L->ci; ci != NULL; ci = ci->previous) { - ci->top.offset = savestack(L, ci->top.p); - ci->func.offset = savestack(L, ci->func.p); - } -} - - - -static void correctstack (lua_State *L) { - CallInfo *ci; - UpVal *up; - L->top.p = restorestack(L, L->top.offset); - L->tbclist.p = restorestack(L, L->tbclist.offset); - for (up = L->openupval; up != NULL; up = up->u.open.next) - up->v.p = s2v(restorestack(L, up->v.offset)); - for (ci = L->ci; ci != NULL; ci = ci->previous) { - ci->top.p = restorestack(L, ci->top.offset); - ci->func.p = restorestack(L, ci->func.offset); - if (isLua(ci)) - ci->u.l.trap = 1; - } -} - - - -#define ERRORSTACKSIZE (LUAI_MAXSTACK + 200) - - -int luaD_reallocstack (lua_State *L, int newsize, int raiseerror) { - int oldsize = stacksize(L); - int i; - StkId newstack; - int oldgcstop = G(L)->gcstopem; - lua_assert(newsize <= LUAI_MAXSTACK || newsize == ERRORSTACKSIZE); - relstack(L); - G(L)->gcstopem = 1; - newstack = luaM_reallocvector(L, L->stack.p, oldsize + EXTRA_STACK, - newsize + EXTRA_STACK, StackValue); - G(L)->gcstopem = oldgcstop; - if (l_unlikely(newstack == NULL)) { - correctstack(L); - if (raiseerror) - luaM_error(L); - else return 0; - } - L->stack.p = newstack; - correctstack(L); - L->stack_last.p = L->stack.p + newsize; - for (i = oldsize + EXTRA_STACK; i < newsize + EXTRA_STACK; i++) - setnilvalue(s2v(newstack + i)); - return 1; -} - - - -int luaD_growstack (lua_State *L, int n, int raiseerror) { - int size = stacksize(L); - if (l_unlikely(size > LUAI_MAXSTACK)) { - - lua_assert(stacksize(L) == ERRORSTACKSIZE); - if (raiseerror) - luaD_throw(L, LUA_ERRERR); - return 0; - } - else if (n < LUAI_MAXSTACK) { - int newsize = 2 * size; - int needed = cast_int(L->top.p - L->stack.p) + n; - if (newsize > LUAI_MAXSTACK) - newsize = LUAI_MAXSTACK; - if (newsize < needed) - newsize = needed; - if (l_likely(newsize <= LUAI_MAXSTACK)) - return luaD_reallocstack(L, newsize, raiseerror); - } - - - luaD_reallocstack(L, ERRORSTACKSIZE, raiseerror); - if (raiseerror) - luaG_runerror(L, "stack overflow"); - return 0; -} - - - -static int stackinuse (lua_State *L) { - CallInfo *ci; - int res; - StkId lim = L->top.p; - for (ci = L->ci; ci != NULL; ci = ci->previous) { - if (lim < ci->top.p) lim = ci->top.p; - } - lua_assert(lim <= L->stack_last.p + EXTRA_STACK); - res = cast_int(lim - L->stack.p) + 1; - if (res < LUA_MINSTACK) - res = LUA_MINSTACK; - return res; -} - - - -void luaD_shrinkstack (lua_State *L) { - int inuse = stackinuse(L); - int max = (inuse > LUAI_MAXSTACK / 3) ? LUAI_MAXSTACK : inuse * 3; - - if (inuse <= LUAI_MAXSTACK && stacksize(L) > max) { - int nsize = (inuse > LUAI_MAXSTACK / 2) ? LUAI_MAXSTACK : inuse * 2; - luaD_reallocstack(L, nsize, 0); - } - else - condmovestack(L,{},{}); - luaE_shrinkCI(L); -} - - -void luaD_inctop (lua_State *L) { - luaD_checkstack(L, 1); - L->top.p++; -} - - - - - -void luaD_hook (lua_State *L, int event, int line, - int ftransfer, int ntransfer) { - lua_Hook hook = L->hook; - if (hook && L->allowhook) { - int mask = CIST_HOOKED; - CallInfo *ci = L->ci; - ptrdiff_t top = savestack(L, L->top.p); - ptrdiff_t ci_top = savestack(L, ci->top.p); - lua_Debug ar; - ar.event = event; - ar.currentline = line; - ar.i_ci = ci; - if (ntransfer != 0) { - mask |= CIST_TRAN; - ci->u2.transferinfo.ftransfer = ftransfer; - ci->u2.transferinfo.ntransfer = ntransfer; - } - if (isLua(ci) && L->top.p < ci->top.p) - L->top.p = ci->top.p; - luaD_checkstack(L, LUA_MINSTACK); - if (ci->top.p < L->top.p + LUA_MINSTACK) - ci->top.p = L->top.p + LUA_MINSTACK; - L->allowhook = 0; - ci->callstatus |= mask; - lua_unlock(L); - (*hook)(L, &ar); - lua_lock(L); - lua_assert(!L->allowhook); - L->allowhook = 1; - ci->top.p = restorestack(L, ci_top); - L->top.p = restorestack(L, top); - ci->callstatus &= ~mask; - } -} - - - -void luaD_hookcall (lua_State *L, CallInfo *ci) { - L->oldpc = 0; - if (L->hookmask & LUA_MASKCALL) { - int event = (ci->callstatus & CIST_TAIL) ? LUA_HOOKTAILCALL - : LUA_HOOKCALL; - Proto *p = ci_func(ci)->p; - ci->u.l.savedpc++; - luaD_hook(L, event, -1, 1, p->numparams); - ci->u.l.savedpc--; - } -} - - - -static void rethook (lua_State *L, CallInfo *ci, int nres) { - if (L->hookmask & LUA_MASKRET) { - StkId firstres = L->top.p - nres; - int delta = 0; - int ftransfer; - if (isLua(ci)) { - Proto *p = ci_func(ci)->p; - if (p->flag & PF_ISVARARG) - delta = ci->u.l.nextraargs + p->numparams + 1; - } - ci->func.p += delta; - ftransfer = cast(unsigned short, firstres - ci->func.p); - luaD_hook(L, LUA_HOOKRET, -1, ftransfer, nres); - ci->func.p -= delta; - } - if (isLua(ci = ci->previous)) - L->oldpc = pcRel(ci->u.l.savedpc, ci_func(ci)->p); -} - - - -static StkId tryfuncTM (lua_State *L, StkId func) { - const TValue *tm; - StkId p; - checkstackp(L, 1, func); - tm = luaT_gettmbyobj(L, s2v(func), TM_CALL); - if (l_unlikely(ttisnil(tm))) - luaG_callerror(L, s2v(func)); - for (p = L->top.p; p > func; p--) - setobjs2s(L, p, p-1); - L->top.p++; - setobj2s(L, func, tm); - return func; -} - - - -l_sinline void moveresults (lua_State *L, StkId res, int nres, int wanted) { - StkId firstresult; - int i; - switch (wanted) { - case 0: - L->top.p = res; - return; - case 1: - if (nres == 0) - setnilvalue(s2v(res)); - else - setobjs2s(L, res, L->top.p - nres); - L->top.p = res + 1; - return; - case LUA_MULTRET: - wanted = nres; - break; - default: - if (hastocloseCfunc(wanted)) { - L->ci->callstatus |= CIST_CLSRET; - L->ci->u2.nres = nres; - res = luaF_close(L, res, CLOSEKTOP, 1); - L->ci->callstatus &= ~CIST_CLSRET; - if (L->hookmask) { - ptrdiff_t savedres = savestack(L, res); - rethook(L, L->ci, nres); - res = restorestack(L, savedres); - } - wanted = decodeNresults(wanted); - if (wanted == LUA_MULTRET) - wanted = nres; - } - break; - } - - firstresult = L->top.p - nres; - if (nres > wanted) - nres = wanted; - for (i = 0; i < nres; i++) - setobjs2s(L, res + i, firstresult + i); - for (; i < wanted; i++) - setnilvalue(s2v(res + i)); - L->top.p = res + wanted; -} - - - -void luaD_poscall (lua_State *L, CallInfo *ci, int nres) { - int wanted = ci->nresults; - if (l_unlikely(L->hookmask && !hastocloseCfunc(wanted))) - rethook(L, ci, nres); - - moveresults(L, ci->func.p, nres, wanted); - - lua_assert(!(ci->callstatus & - (CIST_HOOKED | CIST_YPCALL | CIST_FIN | CIST_TRAN | CIST_CLSRET))); - L->ci = ci->previous; -} - - - -#define next_ci(L) (L->ci->next ? L->ci->next : luaE_extendCI(L)) - - -l_sinline CallInfo *prepCallInfo (lua_State *L, StkId func, int nret, - int mask, StkId top) { - CallInfo *ci = L->ci = next_ci(L); - ci->func.p = func; - ci->nresults = nret; - ci->callstatus = mask; - ci->top.p = top; - return ci; -} - - - -l_sinline int precallC (lua_State *L, StkId func, int nresults, - lua_CFunction f) { - int n; - CallInfo *ci; - checkstackp(L, LUA_MINSTACK, func); - L->ci = ci = prepCallInfo(L, func, nresults, CIST_C, - L->top.p + LUA_MINSTACK); - lua_assert(ci->top.p <= L->stack_last.p); - if (l_unlikely(L->hookmask & LUA_MASKCALL)) { - int narg = cast_int(L->top.p - func) - 1; - luaD_hook(L, LUA_HOOKCALL, -1, 1, narg); - } - lua_unlock(L); - n = (*f)(L); - lua_lock(L); - api_checknelems(L, n); - luaD_poscall(L, ci, n); - return n; -} - - - -int luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, - int narg1, int delta) { - retry: - switch (ttypetag(s2v(func))) { - case LUA_VCCL: - return precallC(L, func, LUA_MULTRET, clCvalue(s2v(func))->f); - case LUA_VLCF: - return precallC(L, func, LUA_MULTRET, fvalue(s2v(func))); - case LUA_VLCL: { - Proto *p = clLvalue(s2v(func))->p; - int fsize = p->maxstacksize; - int nfixparams = p->numparams; - int i; - checkstackp(L, fsize - delta, func); - ci->func.p -= delta; - for (i = 0; i < narg1; i++) - setobjs2s(L, ci->func.p + i, func + i); - func = ci->func.p; - for (; narg1 <= nfixparams; narg1++) - setnilvalue(s2v(func + narg1)); - ci->top.p = func + 1 + fsize; - lua_assert(ci->top.p <= L->stack_last.p); - ci->u.l.savedpc = p->code; - ci->callstatus |= CIST_TAIL; - L->top.p = func + narg1; - return -1; - } - default: { - func = tryfuncTM(L, func); - - narg1++; - goto retry; - } - } -} - - - -CallInfo *luaD_precall (lua_State *L, StkId func, int nresults) { - retry: - switch (ttypetag(s2v(func))) { - case LUA_VCCL: - precallC(L, func, nresults, clCvalue(s2v(func))->f); - return NULL; - case LUA_VLCF: - precallC(L, func, nresults, fvalue(s2v(func))); - return NULL; - case LUA_VLCL: { - CallInfo *ci; - Proto *p = clLvalue(s2v(func))->p; - int narg = cast_int(L->top.p - func) - 1; - int nfixparams = p->numparams; - int fsize = p->maxstacksize; - checkstackp(L, fsize, func); - L->ci = ci = prepCallInfo(L, func, nresults, 0, func + 1 + fsize); - ci->u.l.savedpc = p->code; - for (; narg < nfixparams; narg++) - setnilvalue(s2v(L->top.p++)); - lua_assert(ci->top.p <= L->stack_last.p); - return ci; - } - default: { - func = tryfuncTM(L, func); - - goto retry; - } - } -} - - - -l_sinline void ccall (lua_State *L, StkId func, int nResults, l_uint32 inc) { - CallInfo *ci; - L->nCcalls += inc; - if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) { - checkstackp(L, 0, func); - luaE_checkcstack(L); - } - if ((ci = luaD_precall(L, func, nResults)) != NULL) { - ci->callstatus = CIST_FRESH; - luaV_execute(L, ci); - } - L->nCcalls -= inc; -} - - - -void luaD_call (lua_State *L, StkId func, int nResults) { - ccall(L, func, nResults, 1); -} - - - -void luaD_callnoyield (lua_State *L, StkId func, int nResults) { - ccall(L, func, nResults, nyci); -} - - - -static int finishpcallk (lua_State *L, CallInfo *ci) { - int status = getcistrecst(ci); - if (l_likely(status == LUA_OK)) - status = LUA_YIELD; - else { - StkId func = restorestack(L, ci->u2.funcidx); - L->allowhook = getoah(ci->callstatus); - func = luaF_close(L, func, status, 1); - luaD_seterrorobj(L, status, func); - luaD_shrinkstack(L); - setcistrecst(ci, LUA_OK); - } - ci->callstatus &= ~CIST_YPCALL; - L->errfunc = ci->u.c.old_errfunc; - - return status; -} - - - -static void finishCcall (lua_State *L, CallInfo *ci) { - int n; - if (ci->callstatus & CIST_CLSRET) { - lua_assert(hastocloseCfunc(ci->nresults)); - n = ci->u2.nres; - - } - else { - int status = LUA_YIELD; - - lua_assert(ci->u.c.k != NULL && yieldable(L)); - if (ci->callstatus & CIST_YPCALL) - status = finishpcallk(L, ci); - adjustresults(L, LUA_MULTRET); - lua_unlock(L); - n = (*ci->u.c.k)(L, status, ci->u.c.ctx); - lua_lock(L); - api_checknelems(L, n); - } - luaD_poscall(L, ci, n); -} - - - -static void unroll (lua_State *L, void *ud) { - CallInfo *ci; - UNUSED(ud); - while ((ci = L->ci) != &L->base_ci) { - if (!isLua(ci)) - finishCcall(L, ci); - else { - luaV_finishOp(L); - luaV_execute(L, ci); - } - } -} - - - -static CallInfo *findpcall (lua_State *L) { - CallInfo *ci; - for (ci = L->ci; ci != NULL; ci = ci->previous) { - if (ci->callstatus & CIST_YPCALL) - return ci; - } - return NULL; -} - - - -static int resume_error (lua_State *L, const char *msg, int narg) { - api_checkpop(L, narg); - L->top.p -= narg; - setsvalue2s(L, L->top.p, luaS_new(L, msg)); - api_incr_top(L); - lua_unlock(L); - return LUA_ERRRUN; -} - - - -static void resume (lua_State *L, void *ud) { - int n = *(cast(int*, ud)); - StkId firstArg = L->top.p - n; - CallInfo *ci = L->ci; - if (L->status == LUA_OK) - ccall(L, firstArg - 1, LUA_MULTRET, 0); - else { - lua_assert(L->status == LUA_YIELD); - L->status = LUA_OK; - if (isLua(ci)) { - - lua_assert(ci->callstatus & CIST_HOOKYIELD); - ci->u.l.savedpc--; - L->top.p = firstArg; - luaV_execute(L, ci); - } - else { - if (ci->u.c.k != NULL) { - lua_unlock(L); - n = (*ci->u.c.k)(L, LUA_YIELD, ci->u.c.ctx); - lua_lock(L); - api_checknelems(L, n); - } - luaD_poscall(L, ci, n); - } - unroll(L, NULL); - } -} - - - -static int precover (lua_State *L, int status) { - CallInfo *ci; - while (errorstatus(status) && (ci = findpcall(L)) != NULL) { - L->ci = ci; - setcistrecst(ci, status); - status = luaD_rawrunprotected(L, unroll, NULL); - } - return status; -} - - -LUA_API int lua_resume (lua_State *L, lua_State *from, int nargs, - int *nresults) { - int status; - lua_lock(L); - if (L->status == LUA_OK) { - if (L->ci != &L->base_ci) - return resume_error(L, "cannot resume non-suspended coroutine", nargs); - else if (L->top.p - (L->ci->func.p + 1) == nargs) - return resume_error(L, "cannot resume dead coroutine", nargs); - } - else if (L->status != LUA_YIELD) - return resume_error(L, "cannot resume dead coroutine", nargs); - L->nCcalls = (from) ? getCcalls(from) : 0; - if (getCcalls(L) >= LUAI_MAXCCALLS) - return resume_error(L, "C stack overflow", nargs); - L->nCcalls++; - luai_userstateresume(L, nargs); - api_checkpop(L, (L->status == LUA_OK) ? nargs + 1 : nargs); - status = luaD_rawrunprotected(L, resume, &nargs); - - status = precover(L, status); - if (l_likely(!errorstatus(status))) - lua_assert(status == L->status); - else { - L->status = cast_byte(status); - luaD_seterrorobj(L, status, L->top.p); - L->ci->top.p = L->top.p; - } - *nresults = (status == LUA_YIELD) ? L->ci->u2.nyield - : cast_int(L->top.p - (L->ci->func.p + 1)); - lua_unlock(L); - return status; -} - - -LUA_API int lua_isyieldable (lua_State *L) { - return yieldable(L); -} - - -LUA_API int lua_yieldk (lua_State *L, int nresults, lua_KContext ctx, - lua_KFunction k) { - CallInfo *ci; - luai_userstateyield(L, nresults); - lua_lock(L); - ci = L->ci; - api_checkpop(L, nresults); - if (l_unlikely(!yieldable(L))) { - if (L != G(L)->mainthread) - luaG_runerror(L, "attempt to yield across a C-call boundary"); - else - luaG_runerror(L, "attempt to yield from outside a coroutine"); - } - L->status = LUA_YIELD; - ci->u2.nyield = nresults; - if (isLua(ci)) { - lua_assert(!isLuacode(ci)); - api_check(L, nresults == 0, "hooks cannot yield values"); - api_check(L, k == NULL, "hooks cannot continue after yielding"); - } - else { - if ((ci->u.c.k = k) != NULL) - ci->u.c.ctx = ctx; - luaD_throw(L, LUA_YIELD); - } - lua_assert(ci->callstatus & CIST_HOOKED); - lua_unlock(L); - return 0; -} - - - -struct CloseP { - StkId level; - int status; -}; - - - -static void closepaux (lua_State *L, void *ud) { - struct CloseP *pcl = cast(struct CloseP *, ud); - luaF_close(L, pcl->level, pcl->status, 0); -} - - - -int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status) { - CallInfo *old_ci = L->ci; - lu_byte old_allowhooks = L->allowhook; - for (;;) { - struct CloseP pcl; - pcl.level = restorestack(L, level); pcl.status = status; - status = luaD_rawrunprotected(L, &closepaux, &pcl); - if (l_likely(status == LUA_OK)) - return pcl.status; - else { - L->ci = old_ci; - L->allowhook = old_allowhooks; - } - } -} - - - -int luaD_pcall (lua_State *L, Pfunc func, void *u, - ptrdiff_t old_top, ptrdiff_t ef) { - int status; - CallInfo *old_ci = L->ci; - lu_byte old_allowhooks = L->allowhook; - ptrdiff_t old_errfunc = L->errfunc; - L->errfunc = ef; - status = luaD_rawrunprotected(L, func, u); - if (l_unlikely(status != LUA_OK)) { - L->ci = old_ci; - L->allowhook = old_allowhooks; - status = luaD_closeprotected(L, old_top, status); - luaD_seterrorobj(L, status, restorestack(L, old_top)); - luaD_shrinkstack(L); - } - L->errfunc = old_errfunc; - return status; -} - - - - -struct SParser { - ZIO *z; - Mbuffer buff; - Dyndata dyd; - const char *mode; - const char *name; -}; - - -static void checkmode (lua_State *L, const char *mode, const char *x) { - if (strchr(mode, x[0]) == NULL) { - luaO_pushfstring(L, - "attempt to load a %s chunk (mode is '%s')", x, mode); - luaD_throw(L, LUA_ERRSYNTAX); - } -} - - -static void f_parser (lua_State *L, void *ud) { - LClosure *cl; - struct SParser *p = cast(struct SParser *, ud); - const char *mode = p->mode ? p->mode : "bt"; - int c = zgetc(p->z); - if (c == LUA_SIGNATURE[0]) { - int fixed = 0; - if (strchr(mode, 'B') != NULL) - fixed = 1; - else - checkmode(L, mode, "binary"); - cl = luaU_undump(L, p->z, p->name, fixed); - } - else { - checkmode(L, mode, "text"); - cl = luaY_parser(L, p->z, &p->buff, &p->dyd, p->name, c); - } - lua_assert(cl->nupvalues == cl->p->sizeupvalues); - luaF_initupvals(L, cl); -} - - -int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, - const char *mode) { - struct SParser p; - int status; - incnny(L); - p.z = z; p.name = name; p.mode = mode; - p.dyd.actvar.arr = NULL; p.dyd.actvar.size = 0; - p.dyd.gt.arr = NULL; p.dyd.gt.size = 0; - p.dyd.label.arr = NULL; p.dyd.label.size = 0; - luaZ_initbuffer(L, &p.buff); - status = luaD_pcall(L, f_parser, &p, savestack(L, L->top.p), L->errfunc); - luaZ_freebuffer(L, &p.buff); - luaM_freearray(L, p.dyd.actvar.arr, p.dyd.actvar.size); - luaM_freearray(L, p.dyd.gt.arr, p.dyd.gt.size); - luaM_freearray(L, p.dyd.label.arr, p.dyd.label.size); - decnny(L); - return status; -} - - - - -//path: src/imports/../dependencies/lua/lvm.c - - -#define lvm_c -#define LUA_CORE - - - - -#include -#include -#include -#include -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -#if !defined(LUA_USE_JUMPTABLE) -#if defined(__GNUC__) -#define LUA_USE_JUMPTABLE 1 -#else -#define LUA_USE_JUMPTABLE 0 -#endif -#endif - - - - -#define MAXTAGLOOP 2000 - - - - - -#define NBM (l_floatatt(MANT_DIG)) - - -#if ((((LUA_MAXINTEGER >> (NBM / 4)) >> (NBM / 4)) >> (NBM / 4)) \ - >> (NBM - (3 * (NBM / 4)))) > 0 - - -#define MAXINTFITSF ((lua_Unsigned)1 << NBM) - - -#define l_intfitsf(i) ((MAXINTFITSF + l_castS2U(i)) <= (2 * MAXINTFITSF)) - -#else - -#define l_intfitsf(i) 1 - -#endif - - - -static int l_strton (const TValue *obj, TValue *result) { - lua_assert(obj != result); - if (!cvt2num(obj)) - return 0; - else { - TString *st = tsvalue(obj); - size_t stlen; - const char *s = getlstr(st, stlen); - return (luaO_str2num(s, result) == stlen + 1); - } -} - - - -int luaV_tonumber_ (const TValue *obj, lua_Number *n) { - TValue v; - if (ttisinteger(obj)) { - *n = cast_num(ivalue(obj)); - return 1; - } - else if (l_strton(obj, &v)) { - *n = nvalue(&v); - return 1; - } - else - return 0; -} - - - -int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode) { - lua_Number f = l_floor(n); - if (n != f) { - if (mode == F2Ieq) return 0; - else if (mode == F2Iceil) - f += 1; - } - return lua_numbertointeger(f, p); -} - - - -int luaV_tointegerns (const TValue *obj, lua_Integer *p, F2Imod mode) { - if (ttisfloat(obj)) - return luaV_flttointeger(fltvalue(obj), p, mode); - else if (ttisinteger(obj)) { - *p = ivalue(obj); - return 1; - } - else - return 0; -} - - - -int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode) { - TValue v; - if (l_strton(obj, &v)) - obj = &v; - return luaV_tointegerns(obj, p, mode); -} - - - -static int forlimit (lua_State *L, lua_Integer init, const TValue *lim, - lua_Integer *p, lua_Integer step) { - if (!luaV_tointeger(lim, p, (step < 0 ? F2Iceil : F2Ifloor))) { - - lua_Number flim; - if (!tonumber(lim, &flim)) - luaG_forerror(L, lim, "limit"); - - if (luai_numlt(0, flim)) { - if (step < 0) return 1; - *p = LUA_MAXINTEGER; - } - else { - if (step > 0) return 1; - *p = LUA_MININTEGER; - } - } - return (step > 0 ? init > *p : init < *p); -} - - - -static int forprep (lua_State *L, StkId ra) { - TValue *pinit = s2v(ra); - TValue *plimit = s2v(ra + 1); - TValue *pstep = s2v(ra + 2); - if (ttisinteger(pinit) && ttisinteger(pstep)) { - lua_Integer init = ivalue(pinit); - lua_Integer step = ivalue(pstep); - lua_Integer limit; - if (step == 0) - luaG_runerror(L, "'for' step is zero"); - if (forlimit(L, init, plimit, &limit, step)) - return 1; - else { - lua_Unsigned count; - if (step > 0) { - count = l_castS2U(limit) - l_castS2U(init); - if (step != 1) - count /= l_castS2U(step); - } - else { - count = l_castS2U(init) - l_castS2U(limit); - - count /= l_castS2U(-(step + 1)) + 1u; - } - - chgivalue(s2v(ra), l_castU2S(count)); - setivalue(s2v(ra + 1), step); - chgivalue(s2v(ra + 2), init); - } - } - else { - lua_Number init; lua_Number limit; lua_Number step; - if (l_unlikely(!tonumber(plimit, &limit))) - luaG_forerror(L, plimit, "limit"); - if (l_unlikely(!tonumber(pstep, &step))) - luaG_forerror(L, pstep, "step"); - if (l_unlikely(!tonumber(pinit, &init))) - luaG_forerror(L, pinit, "initial value"); - if (step == 0) - luaG_runerror(L, "'for' step is zero"); - if (luai_numlt(0, step) ? luai_numlt(limit, init) - : luai_numlt(init, limit)) - return 1; - else { - - setfltvalue(s2v(ra), limit); - setfltvalue(s2v(ra + 1), step); - setfltvalue(s2v(ra + 2), init); - } - } - return 0; -} - - - -static int floatforloop (StkId ra) { - lua_Number step = fltvalue(s2v(ra + 1)); - lua_Number limit = fltvalue(s2v(ra)); - lua_Number idx = fltvalue(s2v(ra + 2)); - idx = luai_numadd(L, idx, step); - if (luai_numlt(0, step) ? luai_numle(idx, limit) - : luai_numle(limit, idx)) { - chgfltvalue(s2v(ra + 2), idx); - return 1; - } - else - return 0; -} - - - -int luaV_finishget (lua_State *L, const TValue *t, TValue *key, StkId val, - int tag) { - int loop; - const TValue *tm; - for (loop = 0; loop < MAXTAGLOOP; loop++) { - if (tag == LUA_VNOTABLE) { - lua_assert(!ttistable(t)); - tm = luaT_gettmbyobj(L, t, TM_INDEX); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, t, "index"); - - } - else { - tm = fasttm(L, hvalue(t)->metatable, TM_INDEX); - if (tm == NULL) { - setnilvalue(s2v(val)); - return LUA_VNIL; - } - - } - if (ttisfunction(tm)) { - tag = luaT_callTMres(L, tm, t, key, val); - return tag; - } - t = tm; - luaV_fastget(t, key, s2v(val), luaH_get, tag); - if (!tagisempty(tag)) - return tag; - - } - luaG_runerror(L, "'__index' chain too long; possible loop"); - return 0; -} - - - -void luaV_finishset (lua_State *L, const TValue *t, TValue *key, - TValue *val, int hres) { - int loop; - for (loop = 0; loop < MAXTAGLOOP; loop++) { - const TValue *tm; - if (hres != HNOTATABLE) { - Table *h = hvalue(t); - tm = fasttm(L, h->metatable, TM_NEWINDEX); - if (tm == NULL) { - luaH_finishset(L, h, key, val, hres); - invalidateTMcache(h); - luaC_barrierback(L, obj2gco(h), val); - return; - } - - } - else { - tm = luaT_gettmbyobj(L, t, TM_NEWINDEX); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, t, "index"); - } - - if (ttisfunction(tm)) { - luaT_callTM(L, tm, t, key, val); - return; - } - t = tm; - luaV_fastset(t, key, val, hres, luaH_pset); - if (hres == HOK) - return; - - } - luaG_runerror(L, "'__newindex' chain too long; possible loop"); -} - - - -static int l_strcmp (const TString *ts1, const TString *ts2) { - size_t rl1; - const char *s1 = getlstr(ts1, rl1); - size_t rl2; - const char *s2 = getlstr(ts2, rl2); - for (;;) { - int temp = strcoll(s1, s2); - if (temp != 0) - return temp; - else { - size_t zl1 = strlen(s1); - size_t zl2 = strlen(s2); - if (zl2 == rl2) - return (zl1 == rl1) ? 0 : 1; - else if (zl1 == rl1) - return -1; - - zl1++; zl2++; - s1 += zl1; rl1 -= zl1; s2 += zl2; rl2 -= zl2; - } - } -} - - - -l_sinline int LTintfloat (lua_Integer i, lua_Number f) { - if (l_intfitsf(i)) - return luai_numlt(cast_num(i), f); - else { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Iceil)) - return i < fi; - else - return f > 0; - } -} - - - -l_sinline int LEintfloat (lua_Integer i, lua_Number f) { - if (l_intfitsf(i)) - return luai_numle(cast_num(i), f); - else { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ifloor)) - return i <= fi; - else - return f > 0; - } -} - - - -l_sinline int LTfloatint (lua_Number f, lua_Integer i) { - if (l_intfitsf(i)) - return luai_numlt(f, cast_num(i)); - else { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Ifloor)) - return fi < i; - else - return f < 0; - } -} - - - -l_sinline int LEfloatint (lua_Number f, lua_Integer i) { - if (l_intfitsf(i)) - return luai_numle(f, cast_num(i)); - else { - lua_Integer fi; - if (luaV_flttointeger(f, &fi, F2Iceil)) - return fi <= i; - else - return f < 0; - } -} - - - -l_sinline int LTnum (const TValue *l, const TValue *r) { - lua_assert(ttisnumber(l) && ttisnumber(r)); - if (ttisinteger(l)) { - lua_Integer li = ivalue(l); - if (ttisinteger(r)) - return li < ivalue(r); - else - return LTintfloat(li, fltvalue(r)); - } - else { - lua_Number lf = fltvalue(l); - if (ttisfloat(r)) - return luai_numlt(lf, fltvalue(r)); - else - return LTfloatint(lf, ivalue(r)); - } -} - - - -l_sinline int LEnum (const TValue *l, const TValue *r) { - lua_assert(ttisnumber(l) && ttisnumber(r)); - if (ttisinteger(l)) { - lua_Integer li = ivalue(l); - if (ttisinteger(r)) - return li <= ivalue(r); - else - return LEintfloat(li, fltvalue(r)); - } - else { - lua_Number lf = fltvalue(l); - if (ttisfloat(r)) - return luai_numle(lf, fltvalue(r)); - else - return LEfloatint(lf, ivalue(r)); - } -} - - - -static int lessthanothers (lua_State *L, const TValue *l, const TValue *r) { - lua_assert(!ttisnumber(l) || !ttisnumber(r)); - if (ttisstring(l) && ttisstring(r)) - return l_strcmp(tsvalue(l), tsvalue(r)) < 0; - else - return luaT_callorderTM(L, l, r, TM_LT); -} - - - -int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) { - if (ttisnumber(l) && ttisnumber(r)) - return LTnum(l, r); - else return lessthanothers(L, l, r); -} - - - -static int lessequalothers (lua_State *L, const TValue *l, const TValue *r) { - lua_assert(!ttisnumber(l) || !ttisnumber(r)); - if (ttisstring(l) && ttisstring(r)) - return l_strcmp(tsvalue(l), tsvalue(r)) <= 0; - else - return luaT_callorderTM(L, l, r, TM_LE); -} - - - -int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r) { - if (ttisnumber(l) && ttisnumber(r)) - return LEnum(l, r); - else return lessequalothers(L, l, r); -} - - - -int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2) { - const TValue *tm; - if (ttypetag(t1) != ttypetag(t2)) { - if (ttype(t1) != ttype(t2) || ttype(t1) != LUA_TNUMBER) - return 0; - else { - - lua_Integer i1, i2; - return (luaV_tointegerns(t1, &i1, F2Ieq) && - luaV_tointegerns(t2, &i2, F2Ieq) && - i1 == i2); - } - } - - switch (ttypetag(t1)) { - case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: return 1; - case LUA_VNUMINT: return (ivalue(t1) == ivalue(t2)); - case LUA_VNUMFLT: return luai_numeq(fltvalue(t1), fltvalue(t2)); - case LUA_VLIGHTUSERDATA: return pvalue(t1) == pvalue(t2); - case LUA_VLCF: return fvalue(t1) == fvalue(t2); - case LUA_VSHRSTR: return eqshrstr(tsvalue(t1), tsvalue(t2)); - case LUA_VLNGSTR: return luaS_eqlngstr(tsvalue(t1), tsvalue(t2)); - case LUA_VUSERDATA: { - if (uvalue(t1) == uvalue(t2)) return 1; - else if (L == NULL) return 0; - tm = fasttm(L, uvalue(t1)->metatable, TM_EQ); - if (tm == NULL) - tm = fasttm(L, uvalue(t2)->metatable, TM_EQ); - break; - } - case LUA_VTABLE: { - if (hvalue(t1) == hvalue(t2)) return 1; - else if (L == NULL) return 0; - tm = fasttm(L, hvalue(t1)->metatable, TM_EQ); - if (tm == NULL) - tm = fasttm(L, hvalue(t2)->metatable, TM_EQ); - break; - } - default: - return gcvalue(t1) == gcvalue(t2); - } - if (tm == NULL) - return 0; - else { - int tag = luaT_callTMres(L, tm, t1, t2, L->top.p); - return !tagisfalse(tag); - } -} - - - -#define tostring(L,o) \ - (ttisstring(o) || (cvt2str(o) && (luaO_tostring(L, o), 1))) - -#define isemptystr(o) (ttisshrstring(o) && tsvalue(o)->shrlen == 0) - - -static void copy2buff (StkId top, int n, char *buff) { - size_t tl = 0; - do { - TString *st = tsvalue(s2v(top - n)); - size_t l; - const char *s = getlstr(st, l); - memcpy(buff + tl, s, l * sizeof(char)); - tl += l; - } while (--n > 0); -} - - - -void luaV_concat (lua_State *L, int total) { - if (total == 1) - return; - do { - StkId top = L->top.p; - int n = 2; - if (!(ttisstring(s2v(top - 2)) || cvt2str(s2v(top - 2))) || - !tostring(L, s2v(top - 1))) - luaT_tryconcatTM(L); - else if (isemptystr(s2v(top - 1))) - cast_void(tostring(L, s2v(top - 2))); - else if (isemptystr(s2v(top - 2))) { - setobjs2s(L, top - 2, top - 1); - } - else { - - size_t tl = tsslen(tsvalue(s2v(top - 1))); - TString *ts; - - for (n = 1; n < total && tostring(L, s2v(top - n - 1)); n++) { - size_t l = tsslen(tsvalue(s2v(top - n - 1))); - if (l_unlikely(l >= MAX_SIZE - sizeof(TString) - tl)) { - L->top.p = top - total; - luaG_runerror(L, "string length overflow"); - } - tl += l; - } - if (tl <= LUAI_MAXSHORTLEN) { - char buff[LUAI_MAXSHORTLEN]; - copy2buff(top, n, buff); - ts = luaS_newlstr(L, buff, tl); - } - else { - ts = luaS_createlngstrobj(L, tl); - copy2buff(top, n, getlngstr(ts)); - } - setsvalue2s(L, top - n, ts); - } - total -= n - 1; - L->top.p -= n - 1; - } while (total > 1); -} - - - -void luaV_objlen (lua_State *L, StkId ra, const TValue *rb) { - const TValue *tm; - switch (ttypetag(rb)) { - case LUA_VTABLE: { - Table *h = hvalue(rb); - tm = fasttm(L, h->metatable, TM_LEN); - if (tm) break; - setivalue(s2v(ra), luaH_getn(h)); - return; - } - case LUA_VSHRSTR: { - setivalue(s2v(ra), tsvalue(rb)->shrlen); - return; - } - case LUA_VLNGSTR: { - setivalue(s2v(ra), tsvalue(rb)->u.lnglen); - return; - } - default: { - tm = luaT_gettmbyobj(L, rb, TM_LEN); - if (l_unlikely(notm(tm))) - luaG_typeerror(L, rb, "get length of"); - break; - } - } - luaT_callTMres(L, tm, rb, rb, ra); -} - - - -lua_Integer luaV_idiv (lua_State *L, lua_Integer m, lua_Integer n) { - if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { - if (n == 0) - luaG_runerror(L, "attempt to divide by zero"); - return intop(-, 0, m); - } - else { - lua_Integer q = m / n; - if ((m ^ n) < 0 && m % n != 0) - q -= 1; - return q; - } -} - - - -lua_Integer luaV_mod (lua_State *L, lua_Integer m, lua_Integer n) { - if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { - if (n == 0) - luaG_runerror(L, "attempt to perform 'n%%0'"); - return 0; - } - else { - lua_Integer r = m % n; - if (r != 0 && (r ^ n) < 0) - r += n; - return r; - } -} - - - -lua_Number luaV_modf (lua_State *L, lua_Number m, lua_Number n) { - lua_Number r; - luai_nummod(L, m, n, r); - return r; -} - - - -#define NBITS cast_int(sizeof(lua_Integer) * CHAR_BIT) - - - -lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y) { - if (y < 0) { - if (y <= -NBITS) return 0; - else return intop(>>, x, -y); - } - else { - if (y >= NBITS) return 0; - else return intop(<<, x, y); - } -} - - - -static void pushclosure (lua_State *L, Proto *p, UpVal **encup, StkId base, - StkId ra) { - int nup = p->sizeupvalues; - Upvaldesc *uv = p->upvalues; - int i; - LClosure *ncl = luaF_newLclosure(L, nup); - ncl->p = p; - setclLvalue2s(L, ra, ncl); - for (i = 0; i < nup; i++) { - if (uv[i].instack) - ncl->upvals[i] = luaF_findupval(L, base + uv[i].idx); - else - ncl->upvals[i] = encup[uv[i].idx]; - luaC_objbarrier(L, ncl, ncl->upvals[i]); - } -} - - - -void luaV_finishOp (lua_State *L) { - CallInfo *ci = L->ci; - StkId base = ci->func.p + 1; - Instruction inst = *(ci->u.l.savedpc - 1); - OpCode op = GET_OPCODE(inst); - switch (op) { - case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { - setobjs2s(L, base + GETARG_A(*(ci->u.l.savedpc - 2)), --L->top.p); - break; - } - case OP_UNM: case OP_BNOT: case OP_LEN: - case OP_GETTABUP: case OP_GETTABLE: case OP_GETI: - case OP_GETFIELD: case OP_SELF: { - setobjs2s(L, base + GETARG_A(inst), --L->top.p); - break; - } - case OP_LT: case OP_LE: - case OP_LTI: case OP_LEI: - case OP_GTI: case OP_GEI: - case OP_EQ: { - int res = !l_isfalse(s2v(L->top.p - 1)); - L->top.p--; -#if defined(LUA_COMPAT_LT_LE) - if (ci->callstatus & CIST_LEQ) { - ci->callstatus ^= CIST_LEQ; - res = !res; - } -#endif - lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_JMP); - if (res != GETARG_k(inst)) - ci->u.l.savedpc++; - break; - } - case OP_CONCAT: { - StkId top = L->top.p - 1; - int a = GETARG_A(inst); - int total = cast_int(top - 1 - (base + a)); - setobjs2s(L, top - 2, top); - L->top.p = top - 1; - luaV_concat(L, total); - break; - } - case OP_CLOSE: { - ci->u.l.savedpc--; - break; - } - case OP_RETURN: { - StkId ra = base + GETARG_A(inst); - - L->top.p = ra + ci->u2.nres; - - ci->u.l.savedpc--; - break; - } - default: { - - lua_assert(op == OP_TFORCALL || op == OP_CALL || - op == OP_TAILCALL || op == OP_SETTABUP || op == OP_SETTABLE || - op == OP_SETI || op == OP_SETFIELD); - break; - } - } -} - - - - - - -#define l_addi(L,a,b) intop(+, a, b) -#define l_subi(L,a,b) intop(-, a, b) -#define l_muli(L,a,b) intop(*, a, b) -#define l_band(a,b) intop(&, a, b) -#define l_bor(a,b) intop(|, a, b) -#define l_bxor(a,b) intop(^, a, b) - -#define l_lti(a,b) (a < b) -#define l_lei(a,b) (a <= b) -#define l_gti(a,b) (a > b) -#define l_gei(a,b) (a >= b) - - - -#define op_arithI(L,iop,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - int imm = GETARG_sC(i); \ - if (ttisinteger(v1)) { \ - lua_Integer iv1 = ivalue(v1); \ - pc++; setivalue(s2v(ra), iop(L, iv1, imm)); \ - } \ - else if (ttisfloat(v1)) { \ - lua_Number nb = fltvalue(v1); \ - lua_Number fimm = cast_num(imm); \ - pc++; setfltvalue(s2v(ra), fop(L, nb, fimm)); \ - }} - - - -#define op_arithf_aux(L,v1,v2,fop) { \ - lua_Number n1; lua_Number n2; \ - if (tonumberns(v1, n1) && tonumberns(v2, n2)) { \ - pc++; setfltvalue(s2v(ra), fop(L, n1, n2)); \ - }} - - - -#define op_arithf(L,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - op_arithf_aux(L, v1, v2, fop); } - - - -#define op_arithfK(L,fop) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ - op_arithf_aux(L, v1, v2, fop); } - - - -#define op_arith_aux(L,v1,v2,iop,fop) { \ - StkId ra = RA(i); \ - if (ttisinteger(v1) && ttisinteger(v2)) { \ - lua_Integer i1 = ivalue(v1); lua_Integer i2 = ivalue(v2); \ - pc++; setivalue(s2v(ra), iop(L, i1, i2)); \ - } \ - else op_arithf_aux(L, v1, v2, fop); } - - - -#define op_arith(L,iop,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - op_arith_aux(L, v1, v2, iop, fop); } - - - -#define op_arithK(L,iop,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ - op_arith_aux(L, v1, v2, iop, fop); } - - - -#define op_bitwiseK(L,op) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); \ - lua_Integer i1; \ - lua_Integer i2 = ivalue(v2); \ - if (tointegerns(v1, &i1)) { \ - pc++; setivalue(s2v(ra), op(i1, i2)); \ - }} - - - -#define op_bitwise(L,op) { \ - StkId ra = RA(i); \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - lua_Integer i1; lua_Integer i2; \ - if (tointegerns(v1, &i1) && tointegerns(v2, &i2)) { \ - pc++; setivalue(s2v(ra), op(i1, i2)); \ - }} - - - -#define op_order(L,opi,opn,other) { \ - StkId ra = RA(i); \ - int cond; \ - TValue *rb = vRB(i); \ - if (ttisinteger(s2v(ra)) && ttisinteger(rb)) { \ - lua_Integer ia = ivalue(s2v(ra)); \ - lua_Integer ib = ivalue(rb); \ - cond = opi(ia, ib); \ - } \ - else if (ttisnumber(s2v(ra)) && ttisnumber(rb)) \ - cond = opn(s2v(ra), rb); \ - else \ - Protect(cond = other(L, s2v(ra), rb)); \ - docondjump(); } - - - -#define op_orderI(L,opi,opf,inv,tm) { \ - StkId ra = RA(i); \ - int cond; \ - int im = GETARG_sB(i); \ - if (ttisinteger(s2v(ra))) \ - cond = opi(ivalue(s2v(ra)), im); \ - else if (ttisfloat(s2v(ra))) { \ - lua_Number fa = fltvalue(s2v(ra)); \ - lua_Number fim = cast_num(im); \ - cond = opf(fa, fim); \ - } \ - else { \ - int isf = GETARG_C(i); \ - Protect(cond = luaT_callorderiTM(L, s2v(ra), im, inv, isf, tm)); \ - } \ - docondjump(); } - - - - - - - - - -#define RA(i) (base+GETARG_A(i)) -#define RB(i) (base+GETARG_B(i)) -#define vRB(i) s2v(RB(i)) -#define KB(i) (k+GETARG_B(i)) -#define RC(i) (base+GETARG_C(i)) -#define vRC(i) s2v(RC(i)) -#define KC(i) (k+GETARG_C(i)) -#define RKC(i) ((TESTARG_k(i)) ? k + GETARG_C(i) : s2v(base + GETARG_C(i))) - - - -#define updatetrap(ci) (trap = ci->u.l.trap) - -#define updatebase(ci) (base = ci->func.p + 1) - - -#define updatestack(ci) \ - { if (l_unlikely(trap)) { updatebase(ci); ra = RA(i); } } - - - -#define dojump(ci,i,e) { pc += GETARG_sJ(i) + e; updatetrap(ci); } - - - -#define donextjump(ci) { Instruction ni = *pc; dojump(ci, ni, 1); } - - -#define docondjump() if (cond != GETARG_k(i)) pc++; else donextjump(ci); - - - -#define savepc(L) (ci->u.l.savedpc = pc) - - - -#define savestate(L,ci) (savepc(L), L->top.p = ci->top.p) - - - -#define Protect(exp) (savestate(L,ci), (exp), updatetrap(ci)) - - -#define ProtectNT(exp) (savepc(L), (exp), updatetrap(ci)) - - -#define halfProtect(exp) (savestate(L,ci), (exp)) - - -#define checkGC(L,c) \ - { luaC_condGC(L, (savepc(L), L->top.p = (c)), \ - updatetrap(ci)); \ - luai_threadyield(L); } - - - -#define vmfetch() { \ - if (l_unlikely(trap)) { \ - trap = luaG_traceexec(L, pc); \ - updatebase(ci); \ - } \ - i = *(pc++); \ -} - -#define vmdispatch(o) switch(o) -#define vmcase(l) case l: -#define vmbreak break - - -void luaV_execute (lua_State *L, CallInfo *ci) { - LClosure *cl; - TValue *k; - StkId base; - const Instruction *pc; - int trap; -#if LUA_USE_JUMPTABLE -//path: src/imports/../dependencies/lua/ljumptab.h - - - -#undef vmdispatch -#undef vmcase -#undef vmbreak - -#define vmdispatch(x) goto *disptab[x]; - -#define vmcase(l) L_##l: - -#define vmbreak vmfetch(); vmdispatch(GET_OPCODE(i)); - - -static const void *const disptab[NUM_OPCODES] = { - -#if 0 -** you can update the following list with this command: -** -** sed -n '/^OP_/\!d; s/OP_/\&\&L_OP_/ ; s/,.*/,/ ; s/\/.*// ; p' lopcodes.h -** -#endif - -&&L_OP_MOVE, -&&L_OP_LOADI, -&&L_OP_LOADF, -&&L_OP_LOADK, -&&L_OP_LOADKX, -&&L_OP_LOADFALSE, -&&L_OP_LFALSESKIP, -&&L_OP_LOADTRUE, -&&L_OP_LOADNIL, -&&L_OP_GETUPVAL, -&&L_OP_SETUPVAL, -&&L_OP_GETTABUP, -&&L_OP_GETTABLE, -&&L_OP_GETI, -&&L_OP_GETFIELD, -&&L_OP_SETTABUP, -&&L_OP_SETTABLE, -&&L_OP_SETI, -&&L_OP_SETFIELD, -&&L_OP_NEWTABLE, -&&L_OP_SELF, -&&L_OP_ADDI, -&&L_OP_ADDK, -&&L_OP_SUBK, -&&L_OP_MULK, -&&L_OP_MODK, -&&L_OP_POWK, -&&L_OP_DIVK, -&&L_OP_IDIVK, -&&L_OP_BANDK, -&&L_OP_BORK, -&&L_OP_BXORK, -&&L_OP_SHRI, -&&L_OP_SHLI, -&&L_OP_ADD, -&&L_OP_SUB, -&&L_OP_MUL, -&&L_OP_MOD, -&&L_OP_POW, -&&L_OP_DIV, -&&L_OP_IDIV, -&&L_OP_BAND, -&&L_OP_BOR, -&&L_OP_BXOR, -&&L_OP_SHL, -&&L_OP_SHR, -&&L_OP_MMBIN, -&&L_OP_MMBINI, -&&L_OP_MMBINK, -&&L_OP_UNM, -&&L_OP_BNOT, -&&L_OP_NOT, -&&L_OP_LEN, -&&L_OP_CONCAT, -&&L_OP_CLOSE, -&&L_OP_TBC, -&&L_OP_JMP, -&&L_OP_EQ, -&&L_OP_LT, -&&L_OP_LE, -&&L_OP_EQK, -&&L_OP_EQI, -&&L_OP_LTI, -&&L_OP_LEI, -&&L_OP_GTI, -&&L_OP_GEI, -&&L_OP_TEST, -&&L_OP_TESTSET, -&&L_OP_CALL, -&&L_OP_TAILCALL, -&&L_OP_RETURN, -&&L_OP_RETURN0, -&&L_OP_RETURN1, -&&L_OP_FORLOOP, -&&L_OP_FORPREP, -&&L_OP_TFORPREP, -&&L_OP_TFORCALL, -&&L_OP_TFORLOOP, -&&L_OP_SETLIST, -&&L_OP_CLOSURE, -&&L_OP_VARARG, -&&L_OP_VARARGPREP, -&&L_OP_EXTRAARG - -}; - - -#endif - startfunc: - trap = L->hookmask; - returning: - cl = ci_func(ci); - k = cl->p->k; - pc = ci->u.l.savedpc; - if (l_unlikely(trap)) - trap = luaG_tracecall(L); - base = ci->func.p + 1; - - for (;;) { - Instruction i; - vmfetch(); - #if 0 - - printf("line: %d\n", luaG_getfuncline(cl->p, pcRel(pc, cl->p))); - #endif - lua_assert(base == ci->func.p + 1); - lua_assert(base <= L->top.p && L->top.p <= L->stack_last.p); - - lua_assert(isIT(i) || (cast_void(L->top.p = base), 1)); - vmdispatch (GET_OPCODE(i)) { - vmcase(OP_MOVE) { - StkId ra = RA(i); - setobjs2s(L, ra, RB(i)); - vmbreak; - } - vmcase(OP_LOADI) { - StkId ra = RA(i); - lua_Integer b = GETARG_sBx(i); - setivalue(s2v(ra), b); - vmbreak; - } - vmcase(OP_LOADF) { - StkId ra = RA(i); - int b = GETARG_sBx(i); - setfltvalue(s2v(ra), cast_num(b)); - vmbreak; - } - vmcase(OP_LOADK) { - StkId ra = RA(i); - TValue *rb = k + GETARG_Bx(i); - setobj2s(L, ra, rb); - vmbreak; - } - vmcase(OP_LOADKX) { - StkId ra = RA(i); - TValue *rb; - rb = k + GETARG_Ax(*pc); pc++; - setobj2s(L, ra, rb); - vmbreak; - } - vmcase(OP_LOADFALSE) { - StkId ra = RA(i); - setbfvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LFALSESKIP) { - StkId ra = RA(i); - setbfvalue(s2v(ra)); - pc++; - vmbreak; - } - vmcase(OP_LOADTRUE) { - StkId ra = RA(i); - setbtvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LOADNIL) { - StkId ra = RA(i); - int b = GETARG_B(i); - do { - setnilvalue(s2v(ra++)); - } while (b--); - vmbreak; - } - vmcase(OP_GETUPVAL) { - StkId ra = RA(i); - int b = GETARG_B(i); - setobj2s(L, ra, cl->upvals[b]->v.p); - vmbreak; - } - vmcase(OP_SETUPVAL) { - StkId ra = RA(i); - UpVal *uv = cl->upvals[GETARG_B(i)]; - setobj(L, uv->v.p, s2v(ra)); - luaC_barrier(L, uv, s2v(ra)); - vmbreak; - } - vmcase(OP_GETTABUP) { - StkId ra = RA(i); - TValue *upval = cl->upvals[GETARG_B(i)]->v.p; - TValue *rc = KC(i); - TString *key = tsvalue(rc); - int tag; - luaV_fastget(upval, key, s2v(ra), luaH_getshortstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, upval, rc, ra, tag)); - vmbreak; - } - vmcase(OP_GETTABLE) { - StkId ra = RA(i); - TValue *rb = vRB(i); - TValue *rc = vRC(i); - int tag; - if (ttisinteger(rc)) { - luaV_fastgeti(rb, ivalue(rc), s2v(ra), tag); - } - else - luaV_fastget(rb, rc, s2v(ra), luaH_get, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_GETI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int c = GETARG_C(i); - int tag; - luaV_fastgeti(rb, c, s2v(ra), tag); - if (tagisempty(tag)) { - TValue key; - setivalue(&key, c); - Protect(luaV_finishget(L, rb, &key, ra, tag)); - } - vmbreak; - } - vmcase(OP_GETFIELD) { - StkId ra = RA(i); - TValue *rb = vRB(i); - TValue *rc = KC(i); - TString *key = tsvalue(rc); - int tag; - luaV_fastget(rb, key, s2v(ra), luaH_getshortstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_SETTABUP) { - int hres; - TValue *upval = cl->upvals[GETARG_A(i)]->v.p; - TValue *rb = KB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rb); - luaV_fastset(upval, key, rc, hres, luaH_psetshortstr); - if (hres == HOK) - luaV_finishfastset(L, upval, rc); - else - Protect(luaV_finishset(L, upval, rb, rc, hres)); - vmbreak; - } - vmcase(OP_SETTABLE) { - StkId ra = RA(i); - int hres; - TValue *rb = vRB(i); - TValue *rc = RKC(i); - if (ttisinteger(rb)) { - luaV_fastseti(s2v(ra), ivalue(rb), rc, hres); - } - else { - luaV_fastset(s2v(ra), rb, rc, hres, luaH_pset); - } - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else - Protect(luaV_finishset(L, s2v(ra), rb, rc, hres)); - vmbreak; - } - vmcase(OP_SETI) { - StkId ra = RA(i); - int hres; - int b = GETARG_B(i); - TValue *rc = RKC(i); - luaV_fastseti(s2v(ra), b, rc, hres); - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else { - TValue key; - setivalue(&key, b); - Protect(luaV_finishset(L, s2v(ra), &key, rc, hres)); - } - vmbreak; - } - vmcase(OP_SETFIELD) { - StkId ra = RA(i); - int hres; - TValue *rb = KB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rb); - luaV_fastset(s2v(ra), key, rc, hres, luaH_psetshortstr); - if (hres == HOK) - luaV_finishfastset(L, s2v(ra), rc); - else - Protect(luaV_finishset(L, s2v(ra), rb, rc, hres)); - vmbreak; - } - vmcase(OP_NEWTABLE) { - StkId ra = RA(i); - int b = GETARG_B(i); - int c = GETARG_C(i); - Table *t; - if (b > 0) - b = 1 << (b - 1); - lua_assert((!TESTARG_k(i)) == (GETARG_Ax(*pc) == 0)); - if (TESTARG_k(i)) - c += GETARG_Ax(*pc) * (MAXARG_C + 1); - pc++; - L->top.p = ra + 1; - t = luaH_new(L); - sethvalue2s(L, ra, t); - if (b != 0 || c != 0) - luaH_resize(L, t, c, b); - checkGC(L, ra + 1); - vmbreak; - } - vmcase(OP_SELF) { - StkId ra = RA(i); - int tag; - TValue *rb = vRB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rc); - setobj2s(L, ra + 1, rb); - luaV_fastget(rb, key, s2v(ra), luaH_getstr, tag); - if (tagisempty(tag)) - Protect(luaV_finishget(L, rb, rc, ra, tag)); - vmbreak; - } - vmcase(OP_ADDI) { - op_arithI(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_ADDK) { - op_arithK(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_SUBK) { - op_arithK(L, l_subi, luai_numsub); - vmbreak; - } - vmcase(OP_MULK) { - op_arithK(L, l_muli, luai_nummul); - vmbreak; - } - vmcase(OP_MODK) { - savestate(L, ci); - op_arithK(L, luaV_mod, luaV_modf); - vmbreak; - } - vmcase(OP_POWK) { - op_arithfK(L, luai_numpow); - vmbreak; - } - vmcase(OP_DIVK) { - op_arithfK(L, luai_numdiv); - vmbreak; - } - vmcase(OP_IDIVK) { - savestate(L, ci); - op_arithK(L, luaV_idiv, luai_numidiv); - vmbreak; - } - vmcase(OP_BANDK) { - op_bitwiseK(L, l_band); - vmbreak; - } - vmcase(OP_BORK) { - op_bitwiseK(L, l_bor); - vmbreak; - } - vmcase(OP_BXORK) { - op_bitwiseK(L, l_bxor); - vmbreak; - } - vmcase(OP_SHRI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int ic = GETARG_sC(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - pc++; setivalue(s2v(ra), luaV_shiftl(ib, -ic)); - } - vmbreak; - } - vmcase(OP_SHLI) { - StkId ra = RA(i); - TValue *rb = vRB(i); - int ic = GETARG_sC(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - pc++; setivalue(s2v(ra), luaV_shiftl(ic, ib)); - } - vmbreak; - } - vmcase(OP_ADD) { - op_arith(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_SUB) { - op_arith(L, l_subi, luai_numsub); - vmbreak; - } - vmcase(OP_MUL) { - op_arith(L, l_muli, luai_nummul); - vmbreak; - } - vmcase(OP_MOD) { - savestate(L, ci); - op_arith(L, luaV_mod, luaV_modf); - vmbreak; - } - vmcase(OP_POW) { - op_arithf(L, luai_numpow); - vmbreak; - } - vmcase(OP_DIV) { - op_arithf(L, luai_numdiv); - vmbreak; - } - vmcase(OP_IDIV) { - savestate(L, ci); - op_arith(L, luaV_idiv, luai_numidiv); - vmbreak; - } - vmcase(OP_BAND) { - op_bitwise(L, l_band); - vmbreak; - } - vmcase(OP_BOR) { - op_bitwise(L, l_bor); - vmbreak; - } - vmcase(OP_BXOR) { - op_bitwise(L, l_bxor); - vmbreak; - } - vmcase(OP_SHR) { - op_bitwise(L, luaV_shiftr); - vmbreak; - } - vmcase(OP_SHL) { - op_bitwise(L, luaV_shiftl); - vmbreak; - } - vmcase(OP_MMBIN) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); - TValue *rb = vRB(i); - TMS tm = (TMS)GETARG_C(i); - StkId result = RA(pi); - lua_assert(OP_ADD <= GET_OPCODE(pi) && GET_OPCODE(pi) <= OP_SHR); - Protect(luaT_trybinTM(L, s2v(ra), rb, result, tm)); - vmbreak; - } - vmcase(OP_MMBINI) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); - int imm = GETARG_sB(i); - TMS tm = (TMS)GETARG_C(i); - int flip = GETARG_k(i); - StkId result = RA(pi); - Protect(luaT_trybiniTM(L, s2v(ra), imm, flip, result, tm)); - vmbreak; - } - vmcase(OP_MMBINK) { - StkId ra = RA(i); - Instruction pi = *(pc - 2); - TValue *imm = KB(i); - TMS tm = (TMS)GETARG_C(i); - int flip = GETARG_k(i); - StkId result = RA(pi); - Protect(luaT_trybinassocTM(L, s2v(ra), imm, flip, result, tm)); - vmbreak; - } - vmcase(OP_UNM) { - StkId ra = RA(i); - TValue *rb = vRB(i); - lua_Number nb; - if (ttisinteger(rb)) { - lua_Integer ib = ivalue(rb); - setivalue(s2v(ra), intop(-, 0, ib)); - } - else if (tonumberns(rb, nb)) { - setfltvalue(s2v(ra), luai_numunm(L, nb)); - } - else - Protect(luaT_trybinTM(L, rb, rb, ra, TM_UNM)); - vmbreak; - } - vmcase(OP_BNOT) { - StkId ra = RA(i); - TValue *rb = vRB(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - setivalue(s2v(ra), intop(^, ~l_castS2U(0), ib)); - } - else - Protect(luaT_trybinTM(L, rb, rb, ra, TM_BNOT)); - vmbreak; - } - vmcase(OP_NOT) { - StkId ra = RA(i); - TValue *rb = vRB(i); - if (l_isfalse(rb)) - setbtvalue(s2v(ra)); - else - setbfvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LEN) { - StkId ra = RA(i); - Protect(luaV_objlen(L, ra, vRB(i))); - vmbreak; - } - vmcase(OP_CONCAT) { - StkId ra = RA(i); - int n = GETARG_B(i); - L->top.p = ra + n; - ProtectNT(luaV_concat(L, n)); - checkGC(L, L->top.p); - vmbreak; - } - vmcase(OP_CLOSE) { - StkId ra = RA(i); - Protect(luaF_close(L, ra, LUA_OK, 1)); - vmbreak; - } - vmcase(OP_TBC) { - StkId ra = RA(i); - - halfProtect(luaF_newtbcupval(L, ra)); - vmbreak; - } - vmcase(OP_JMP) { - dojump(ci, i, 0); - vmbreak; - } - vmcase(OP_EQ) { - StkId ra = RA(i); - int cond; - TValue *rb = vRB(i); - Protect(cond = luaV_equalobj(L, s2v(ra), rb)); - docondjump(); - vmbreak; - } - vmcase(OP_LT) { - op_order(L, l_lti, LTnum, lessthanothers); - vmbreak; - } - vmcase(OP_LE) { - op_order(L, l_lei, LEnum, lessequalothers); - vmbreak; - } - vmcase(OP_EQK) { - StkId ra = RA(i); - TValue *rb = KB(i); - - int cond = luaV_rawequalobj(s2v(ra), rb); - docondjump(); - vmbreak; - } - vmcase(OP_EQI) { - StkId ra = RA(i); - int cond; - int im = GETARG_sB(i); - if (ttisinteger(s2v(ra))) - cond = (ivalue(s2v(ra)) == im); - else if (ttisfloat(s2v(ra))) - cond = luai_numeq(fltvalue(s2v(ra)), cast_num(im)); - else - cond = 0; - docondjump(); - vmbreak; - } - vmcase(OP_LTI) { - op_orderI(L, l_lti, luai_numlt, 0, TM_LT); - vmbreak; - } - vmcase(OP_LEI) { - op_orderI(L, l_lei, luai_numle, 0, TM_LE); - vmbreak; - } - vmcase(OP_GTI) { - op_orderI(L, l_gti, luai_numgt, 1, TM_LT); - vmbreak; - } - vmcase(OP_GEI) { - op_orderI(L, l_gei, luai_numge, 1, TM_LE); - vmbreak; - } - vmcase(OP_TEST) { - StkId ra = RA(i); - int cond = !l_isfalse(s2v(ra)); - docondjump(); - vmbreak; - } - vmcase(OP_TESTSET) { - StkId ra = RA(i); - TValue *rb = vRB(i); - if (l_isfalse(rb) == GETARG_k(i)) - pc++; - else { - setobj2s(L, ra, rb); - donextjump(ci); - } - vmbreak; - } - vmcase(OP_CALL) { - StkId ra = RA(i); - CallInfo *newci; - int b = GETARG_B(i); - int nresults = GETARG_C(i) - 1; - if (b != 0) - L->top.p = ra + b; - - savepc(L); - if ((newci = luaD_precall(L, ra, nresults)) == NULL) - updatetrap(ci); - else { - ci = newci; - goto startfunc; - } - vmbreak; - } - vmcase(OP_TAILCALL) { - StkId ra = RA(i); - int b = GETARG_B(i); - int n; - int nparams1 = GETARG_C(i); - - int delta = (nparams1) ? ci->u.l.nextraargs + nparams1 : 0; - if (b != 0) - L->top.p = ra + b; - else - b = cast_int(L->top.p - ra); - savepc(ci); - if (TESTARG_k(i)) { - luaF_closeupval(L, base); - lua_assert(L->tbclist.p < base); - lua_assert(base == ci->func.p + 1); - } - if ((n = luaD_pretailcall(L, ci, ra, b, delta)) < 0) - goto startfunc; - else { - ci->func.p -= delta; - luaD_poscall(L, ci, n); - updatetrap(ci); - goto ret; - } - } - vmcase(OP_RETURN) { - StkId ra = RA(i); - int n = GETARG_B(i) - 1; - int nparams1 = GETARG_C(i); - if (n < 0) - n = cast_int(L->top.p - ra); - savepc(ci); - if (TESTARG_k(i)) { - ci->u2.nres = n; - if (L->top.p < ci->top.p) - L->top.p = ci->top.p; - luaF_close(L, base, CLOSEKTOP, 1); - updatetrap(ci); - updatestack(ci); - } - if (nparams1) - ci->func.p -= ci->u.l.nextraargs + nparams1; - L->top.p = ra + n; - luaD_poscall(L, ci, n); - updatetrap(ci); - goto ret; - } - vmcase(OP_RETURN0) { - if (l_unlikely(L->hookmask)) { - StkId ra = RA(i); - L->top.p = ra; - savepc(ci); - luaD_poscall(L, ci, 0); - trap = 1; - } - else { - int nres; - L->ci = ci->previous; - L->top.p = base - 1; - for (nres = ci->nresults; l_unlikely(nres > 0); nres--) - setnilvalue(s2v(L->top.p++)); - } - goto ret; - } - vmcase(OP_RETURN1) { - if (l_unlikely(L->hookmask)) { - StkId ra = RA(i); - L->top.p = ra + 1; - savepc(ci); - luaD_poscall(L, ci, 1); - trap = 1; - } - else { - int nres = ci->nresults; - L->ci = ci->previous; - if (nres == 0) - L->top.p = base - 1; - else { - StkId ra = RA(i); - setobjs2s(L, base - 1, ra); - L->top.p = base; - for (; l_unlikely(nres > 1); nres--) - setnilvalue(s2v(L->top.p++)); - } - } - ret: - if (ci->callstatus & CIST_FRESH) - return; - else { - ci = ci->previous; - goto returning; - } - } - vmcase(OP_FORLOOP) { - StkId ra = RA(i); - if (ttisinteger(s2v(ra + 1))) { - lua_Unsigned count = l_castS2U(ivalue(s2v(ra))); - if (count > 0) { - lua_Integer step = ivalue(s2v(ra + 1)); - lua_Integer idx = ivalue(s2v(ra + 2)); - chgivalue(s2v(ra), count - 1); - idx = intop(+, idx, step); - chgivalue(s2v(ra + 2), idx); - pc -= GETARG_Bx(i); - } - } - else if (floatforloop(ra)) - pc -= GETARG_Bx(i); - updatetrap(ci); - vmbreak; - } - vmcase(OP_FORPREP) { - StkId ra = RA(i); - savestate(L, ci); - if (forprep(L, ra)) - pc += GETARG_Bx(i) + 1; - vmbreak; - } - vmcase(OP_TFORPREP) { - - StkId ra = RA(i); - TValue temp; - setobj(L, &temp, s2v(ra + 3)); - setobjs2s(L, ra + 3, ra + 2); - setobj2s(L, ra + 2, &temp); - - halfProtect(luaF_newtbcupval(L, ra + 2)); - pc += GETARG_Bx(i); - i = *(pc++); - lua_assert(GET_OPCODE(i) == OP_TFORCALL && ra == RA(i)); - goto l_tforcall; - } - vmcase(OP_TFORCALL) { - l_tforcall: { - - StkId ra = RA(i); - setobjs2s(L, ra + 5, ra + 3); - setobjs2s(L, ra + 4, ra + 1); - setobjs2s(L, ra + 3, ra); - L->top.p = ra + 3 + 3; - ProtectNT(luaD_call(L, ra + 3, GETARG_C(i))); - updatestack(ci); - i = *(pc++); - lua_assert(GET_OPCODE(i) == OP_TFORLOOP && ra == RA(i)); - goto l_tforloop; - }} - vmcase(OP_TFORLOOP) { - l_tforloop: { - StkId ra = RA(i); - if (!ttisnil(s2v(ra + 3))) - pc -= GETARG_Bx(i); - vmbreak; - }} - vmcase(OP_SETLIST) { - StkId ra = RA(i); - int n = GETARG_B(i); - unsigned int last = GETARG_C(i); - Table *h = hvalue(s2v(ra)); - if (n == 0) - n = cast_int(L->top.p - ra) - 1; - else - L->top.p = ci->top.p; - last += n; - if (TESTARG_k(i)) { - last += GETARG_Ax(*pc) * (MAXARG_C + 1); - pc++; - } - if (last > luaH_realasize(h)) - luaH_resizearray(L, h, last); - for (; n > 0; n--) { - TValue *val = s2v(ra + n); - obj2arr(h, last, val); - last--; - luaC_barrierback(L, obj2gco(h), val); - } - vmbreak; - } - vmcase(OP_CLOSURE) { - StkId ra = RA(i); - Proto *p = cl->p->p[GETARG_Bx(i)]; - halfProtect(pushclosure(L, p, cl->upvals, base, ra)); - checkGC(L, ra + 1); - vmbreak; - } - vmcase(OP_VARARG) { - StkId ra = RA(i); - int n = GETARG_C(i) - 1; - Protect(luaT_getvarargs(L, ci, ra, n)); - vmbreak; - } - vmcase(OP_VARARGPREP) { - ProtectNT(luaT_adjustvarargs(L, GETARG_A(i), ci, cl->p)); - if (l_unlikely(trap)) { - luaD_hookcall(L, ci); - L->oldpc = 1; - } - updatebase(ci); - vmbreak; - } - vmcase(OP_EXTRAARG) { - lua_assert(0); - vmbreak; - } - } - } -} - - - -//path: src/imports/../dependencies/lua/lapi.c - - -#define lapi_c -#define LUA_CORE - - - - - -#include -#include -#include - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -const char lua_ident[] = - "$LuaVersion: " LUA_COPYRIGHT " $" - "$LuaAuthors: " LUA_AUTHORS " $"; - - - - -#define isvalid(L, o) (!ttisnil(o) || o != &G(L)->nilvalue) - - - -#define ispseudo(i) ((i) <= LUA_REGISTRYINDEX) - - -#define isupvalue(i) ((i) < LUA_REGISTRYINDEX) - - - -static void advancegc (lua_State *L, size_t delta) { - delta >>= 5; - if (delta > 0) { - global_State *g = G(L); - luaE_setdebt(g, g->GCdebt - delta); - } -} - - - -static TValue *index2value (lua_State *L, int idx) { - CallInfo *ci = L->ci; - if (idx > 0) { - StkId o = ci->func.p + idx; - api_check(L, idx <= ci->top.p - (ci->func.p + 1), "unacceptable index"); - if (o >= L->top.p) return &G(L)->nilvalue; - else return s2v(o); - } - else if (!ispseudo(idx)) { - api_check(L, idx != 0 && -idx <= L->top.p - (ci->func.p + 1), - "invalid index"); - return s2v(L->top.p + idx); - } - else if (idx == LUA_REGISTRYINDEX) - return &G(L)->l_registry; - else { - idx = LUA_REGISTRYINDEX - idx; - api_check(L, idx <= MAXUPVAL + 1, "upvalue index too large"); - if (ttisCclosure(s2v(ci->func.p))) { - CClosure *func = clCvalue(s2v(ci->func.p)); - return (idx <= func->nupvalues) ? &func->upvalue[idx-1] - : &G(L)->nilvalue; - } - else { - api_check(L, ttislcf(s2v(ci->func.p)), "caller not a C function"); - return &G(L)->nilvalue; - } - } -} - - - - -static StkId index2stack (lua_State *L, int idx) { - CallInfo *ci = L->ci; - if (idx > 0) { - StkId o = ci->func.p + idx; - api_check(L, o < L->top.p, "invalid index"); - return o; - } - else { - api_check(L, idx != 0 && -idx <= L->top.p - (ci->func.p + 1), - "invalid index"); - api_check(L, !ispseudo(idx), "invalid index"); - return L->top.p + idx; - } -} - - -LUA_API int lua_checkstack (lua_State *L, int n) { - int res; - CallInfo *ci; - lua_lock(L); - ci = L->ci; - api_check(L, n >= 0, "negative 'n'"); - if (L->stack_last.p - L->top.p > n) - res = 1; - else - res = luaD_growstack(L, n, 0); - if (res && ci->top.p < L->top.p + n) - ci->top.p = L->top.p + n; - lua_unlock(L); - return res; -} - - -LUA_API void lua_xmove (lua_State *from, lua_State *to, int n) { - int i; - if (from == to) return; - lua_lock(to); - api_checkpop(from, n); - api_check(from, G(from) == G(to), "moving among independent states"); - api_check(from, to->ci->top.p - to->top.p >= n, "stack overflow"); - from->top.p -= n; - for (i = 0; i < n; i++) { - setobjs2s(to, to->top.p, from->top.p + i); - to->top.p++; - } - lua_unlock(to); -} - - -LUA_API lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf) { - lua_CFunction old; - lua_lock(L); - old = G(L)->panic; - G(L)->panic = panicf; - lua_unlock(L); - return old; -} - - -LUA_API lua_Number lua_version (lua_State *L) { - UNUSED(L); - return LUA_VERSION_NUM; -} - - - - - - - -LUA_API int lua_absindex (lua_State *L, int idx) { - return (idx > 0 || ispseudo(idx)) - ? idx - : cast_int(L->top.p - L->ci->func.p) + idx; -} - - -LUA_API int lua_gettop (lua_State *L) { - return cast_int(L->top.p - (L->ci->func.p + 1)); -} - - -LUA_API void lua_settop (lua_State *L, int idx) { - CallInfo *ci; - StkId func, newtop; - ptrdiff_t diff; - lua_lock(L); - ci = L->ci; - func = ci->func.p; - if (idx >= 0) { - api_check(L, idx <= ci->top.p - (func + 1), "new top too large"); - diff = ((func + 1) + idx) - L->top.p; - for (; diff > 0; diff--) - setnilvalue(s2v(L->top.p++)); - } - else { - api_check(L, -(idx+1) <= (L->top.p - (func + 1)), "invalid new top"); - diff = idx + 1; - } - newtop = L->top.p + diff; - if (diff < 0 && L->tbclist.p >= newtop) { - lua_assert(hastocloseCfunc(ci->nresults)); - newtop = luaF_close(L, newtop, CLOSEKTOP, 0); - } - L->top.p = newtop; - lua_unlock(L); -} - - -LUA_API void lua_closeslot (lua_State *L, int idx) { - StkId level; - lua_lock(L); - level = index2stack(L, idx); - api_check(L, hastocloseCfunc(L->ci->nresults) && L->tbclist.p == level, - "no variable to close at given level"); - level = luaF_close(L, level, CLOSEKTOP, 0); - setnilvalue(s2v(level)); - lua_unlock(L); -} - - - -static void reverse (lua_State *L, StkId from, StkId to) { - for (; from < to; from++, to--) { - TValue temp; - setobj(L, &temp, s2v(from)); - setobjs2s(L, from, to); - setobj2s(L, to, &temp); - } -} - - - -LUA_API void lua_rotate (lua_State *L, int idx, int n) { - StkId p, t, m; - lua_lock(L); - t = L->top.p - 1; - p = index2stack(L, idx); - api_check(L, L->tbclist.p < p, "moving a to-be-closed slot"); - api_check(L, (n >= 0 ? n : -n) <= (t - p + 1), "invalid 'n'"); - m = (n >= 0 ? t - n : p - n - 1); - reverse(L, p, m); - reverse(L, m + 1, t); - reverse(L, p, t); - lua_unlock(L); -} - - -LUA_API void lua_copy (lua_State *L, int fromidx, int toidx) { - TValue *fr, *to; - lua_lock(L); - fr = index2value(L, fromidx); - to = index2value(L, toidx); - api_check(L, isvalid(L, to), "invalid index"); - setobj(L, to, fr); - if (isupvalue(toidx)) - luaC_barrier(L, clCvalue(s2v(L->ci->func.p)), fr); - - lua_unlock(L); -} - - -LUA_API void lua_pushvalue (lua_State *L, int idx) { - lua_lock(L); - setobj2s(L, L->top.p, index2value(L, idx)); - api_incr_top(L); - lua_unlock(L); -} - - - - - - -LUA_API int lua_type (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (isvalid(L, o) ? ttype(o) : LUA_TNONE); -} - - -LUA_API const char *lua_typename (lua_State *L, int t) { - UNUSED(L); - api_check(L, LUA_TNONE <= t && t < LUA_NUMTYPES, "invalid type"); - return ttypename(t); -} - - -LUA_API int lua_iscfunction (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttislcf(o) || (ttisCclosure(o))); -} - - -LUA_API int lua_isinteger (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return ttisinteger(o); -} - - -LUA_API int lua_isnumber (lua_State *L, int idx) { - lua_Number n; - const TValue *o = index2value(L, idx); - return tonumber(o, &n); -} - - -LUA_API int lua_isstring (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttisstring(o) || cvt2str(o)); -} - - -LUA_API int lua_isuserdata (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttisfulluserdata(o) || ttislightuserdata(o)); -} - - -LUA_API int lua_rawequal (lua_State *L, int index1, int index2) { - const TValue *o1 = index2value(L, index1); - const TValue *o2 = index2value(L, index2); - return (isvalid(L, o1) && isvalid(L, o2)) ? luaV_rawequalobj(o1, o2) : 0; -} - - -LUA_API void lua_arith (lua_State *L, int op) { - lua_lock(L); - if (op != LUA_OPUNM && op != LUA_OPBNOT) - api_checkpop(L, 2); - else { - api_checkpop(L, 1); - setobjs2s(L, L->top.p, L->top.p - 1); - api_incr_top(L); - } - - luaO_arith(L, op, s2v(L->top.p - 2), s2v(L->top.p - 1), L->top.p - 2); - L->top.p--; - lua_unlock(L); -} - - -LUA_API int lua_compare (lua_State *L, int index1, int index2, int op) { - const TValue *o1; - const TValue *o2; - int i = 0; - lua_lock(L); - o1 = index2value(L, index1); - o2 = index2value(L, index2); - if (isvalid(L, o1) && isvalid(L, o2)) { - switch (op) { - case LUA_OPEQ: i = luaV_equalobj(L, o1, o2); break; - case LUA_OPLT: i = luaV_lessthan(L, o1, o2); break; - case LUA_OPLE: i = luaV_lessequal(L, o1, o2); break; - default: api_check(L, 0, "invalid option"); - } - } - lua_unlock(L); - return i; -} - - -LUA_API size_t lua_stringtonumber (lua_State *L, const char *s) { - size_t sz = luaO_str2num(s, s2v(L->top.p)); - if (sz != 0) - api_incr_top(L); - return sz; -} - - -LUA_API lua_Number lua_tonumberx (lua_State *L, int idx, int *pisnum) { - lua_Number n = 0; - const TValue *o = index2value(L, idx); - int isnum = tonumber(o, &n); - if (pisnum) - *pisnum = isnum; - return n; -} - - -LUA_API lua_Integer lua_tointegerx (lua_State *L, int idx, int *pisnum) { - lua_Integer res = 0; - const TValue *o = index2value(L, idx); - int isnum = tointeger(o, &res); - if (pisnum) - *pisnum = isnum; - return res; -} - - -LUA_API int lua_toboolean (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return !l_isfalse(o); -} - - -LUA_API const char *lua_tolstring (lua_State *L, int idx, size_t *len) { - TValue *o; - lua_lock(L); - o = index2value(L, idx); - if (!ttisstring(o)) { - if (!cvt2str(o)) { - if (len != NULL) *len = 0; - lua_unlock(L); - return NULL; - } - luaO_tostring(L, o); - luaC_checkGC(L); - o = index2value(L, idx); - } - lua_unlock(L); - if (len != NULL) - return getlstr(tsvalue(o), *len); - else - return getstr(tsvalue(o)); -} - - -LUA_API lua_Unsigned lua_rawlen (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - switch (ttypetag(o)) { - case LUA_VSHRSTR: return tsvalue(o)->shrlen; - case LUA_VLNGSTR: return tsvalue(o)->u.lnglen; - case LUA_VUSERDATA: return uvalue(o)->len; - case LUA_VTABLE: return luaH_getn(hvalue(o)); - default: return 0; - } -} - - -LUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - if (ttislcf(o)) return fvalue(o); - else if (ttisCclosure(o)) - return clCvalue(o)->f; - else return NULL; -} - - -l_sinline void *touserdata (const TValue *o) { - switch (ttype(o)) { - case LUA_TUSERDATA: return getudatamem(uvalue(o)); - case LUA_TLIGHTUSERDATA: return pvalue(o); - default: return NULL; - } -} - - -LUA_API void *lua_touserdata (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return touserdata(o); -} - - -LUA_API lua_State *lua_tothread (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (!ttisthread(o)) ? NULL : thvalue(o); -} - - - -LUA_API const void *lua_topointer (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - switch (ttypetag(o)) { - case LUA_VLCF: return cast_voidp(cast_sizet(fvalue(o))); - case LUA_VUSERDATA: case LUA_VLIGHTUSERDATA: - return touserdata(o); - default: { - if (iscollectable(o)) - return gcvalue(o); - else - return NULL; - } - } -} - - - - - - -LUA_API void lua_pushnil (lua_State *L) { - lua_lock(L); - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushnumber (lua_State *L, lua_Number n) { - lua_lock(L); - setfltvalue(s2v(L->top.p), n); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushinteger (lua_State *L, lua_Integer n) { - lua_lock(L); - setivalue(s2v(L->top.p), n); - api_incr_top(L); - lua_unlock(L); -} - - - -LUA_API const char *lua_pushlstring (lua_State *L, const char *s, size_t len) { - TString *ts; - lua_lock(L); - ts = (len == 0) ? luaS_new(L, "") : luaS_newlstr(L, s, len); - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - advancegc(L, len); - luaC_checkGC(L); - lua_unlock(L); - return getstr(ts); -} - - -LUA_API const char *lua_pushextlstring (lua_State *L, - const char *s, size_t len, lua_Alloc falloc, void *ud) { - TString *ts; - lua_lock(L); - api_check(L, s[len] == '\0', "string not ending with zero"); - ts = luaS_newextlstr (L, s, len, falloc, ud); - setsvalue2s(L, L->top.p, ts); - api_incr_top(L); - if (falloc != NULL) - advancegc(L, len); - luaC_checkGC(L); - lua_unlock(L); - return getstr(ts); -} - - -LUA_API const char *lua_pushstring (lua_State *L, const char *s) { - lua_lock(L); - if (s == NULL) - setnilvalue(s2v(L->top.p)); - else { - TString *ts; - ts = luaS_new(L, s); - setsvalue2s(L, L->top.p, ts); - s = getstr(ts); - } - api_incr_top(L); - luaC_checkGC(L); - lua_unlock(L); - return s; -} - - -LUA_API const char *lua_pushvfstring (lua_State *L, const char *fmt, - va_list argp) { - const char *ret; - lua_lock(L); - ret = luaO_pushvfstring(L, fmt, argp); - luaC_checkGC(L); - lua_unlock(L); - return ret; -} - - -LUA_API const char *lua_pushfstring (lua_State *L, const char *fmt, ...) { - const char *ret; - va_list argp; - lua_lock(L); - va_start(argp, fmt); - ret = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - luaC_checkGC(L); - lua_unlock(L); - return ret; -} - - -LUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) { - lua_lock(L); - if (n == 0) { - setfvalue(s2v(L->top.p), fn); - api_incr_top(L); - } - else { - int i; - CClosure *cl; - api_checkpop(L, n); - api_check(L, n <= MAXUPVAL, "upvalue index too large"); - cl = luaF_newCclosure(L, n); - cl->f = fn; - for (i = 0; i < n; i++) { - setobj2n(L, &cl->upvalue[i], s2v(L->top.p - n + i)); - - lua_assert(iswhite(cl)); - } - L->top.p -= n; - setclCvalue(L, s2v(L->top.p), cl); - api_incr_top(L); - luaC_checkGC(L); - } - lua_unlock(L); -} - - -LUA_API void lua_pushboolean (lua_State *L, int b) { - lua_lock(L); - if (b) - setbtvalue(s2v(L->top.p)); - else - setbfvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushlightuserdata (lua_State *L, void *p) { - lua_lock(L); - setpvalue(s2v(L->top.p), p); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API int lua_pushthread (lua_State *L) { - lua_lock(L); - setthvalue(L, s2v(L->top.p), L); - api_incr_top(L); - lua_unlock(L); - return (G(L)->mainthread == L); -} - - - - - - -static int auxgetstr (lua_State *L, const TValue *t, const char *k) { - int tag; - TString *str = luaS_new(L, k); - luaV_fastget(t, str, s2v(L->top.p), luaH_getstr, tag); - if (!tagisempty(tag)) { - api_incr_top(L); - } - else { - setsvalue2s(L, L->top.p, str); - api_incr_top(L); - tag = luaV_finishget(L, t, s2v(L->top.p - 1), L->top.p - 1, tag); - } - lua_unlock(L); - return novariant(tag); -} - - -static void getGlobalTable (lua_State *L, TValue *gt) { - Table *registry = hvalue(&G(L)->l_registry); - int tag = luaH_getint(registry, LUA_RIDX_GLOBALS, gt); - (void)tag; - api_check(L, novariant(tag) == LUA_TTABLE, "global table must exist"); -} - - -LUA_API int lua_getglobal (lua_State *L, const char *name) { - TValue gt; - lua_lock(L); - getGlobalTable(L, >); - return auxgetstr(L, >, name); -} - - -LUA_API int lua_gettable (lua_State *L, int idx) { - int tag; - TValue *t; - lua_lock(L); - api_checkpop(L, 1); - t = index2value(L, idx); - luaV_fastget(t, s2v(L->top.p - 1), s2v(L->top.p - 1), luaH_get, tag); - if (tagisempty(tag)) - tag = luaV_finishget(L, t, s2v(L->top.p - 1), L->top.p - 1, tag); - lua_unlock(L); - return novariant(tag); -} - - -LUA_API int lua_getfield (lua_State *L, int idx, const char *k) { - lua_lock(L); - return auxgetstr(L, index2value(L, idx), k); -} - - -LUA_API int lua_geti (lua_State *L, int idx, lua_Integer n) { - TValue *t; - int tag; - lua_lock(L); - t = index2value(L, idx); - luaV_fastgeti(t, n, s2v(L->top.p), tag); - if (tagisempty(tag)) { - TValue key; - setivalue(&key, n); - tag = luaV_finishget(L, t, &key, L->top.p, tag); - } - api_incr_top(L); - lua_unlock(L); - return novariant(tag); -} - - -static int finishrawget (lua_State *L, int tag) { - if (tagisempty(tag)) - setnilvalue(s2v(L->top.p)); - api_incr_top(L); - lua_unlock(L); - return novariant(tag); -} - - -l_sinline Table *gettable (lua_State *L, int idx) { - TValue *t = index2value(L, idx); - api_check(L, ttistable(t), "table expected"); - return hvalue(t); -} - - -LUA_API int lua_rawget (lua_State *L, int idx) { - Table *t; - int tag; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - tag = luaH_get(t, s2v(L->top.p - 1), s2v(L->top.p - 1)); - L->top.p--; - return finishrawget(L, tag); -} - - -LUA_API int lua_rawgeti (lua_State *L, int idx, lua_Integer n) { - Table *t; - int tag; - lua_lock(L); - t = gettable(L, idx); - luaH_fastgeti(t, n, s2v(L->top.p), tag); - return finishrawget(L, tag); -} - - -LUA_API int lua_rawgetp (lua_State *L, int idx, const void *p) { - Table *t; - TValue k; - lua_lock(L); - t = gettable(L, idx); - setpvalue(&k, cast_voidp(p)); - return finishrawget(L, luaH_get(t, &k, s2v(L->top.p))); -} - - -LUA_API void lua_createtable (lua_State *L, unsigned narray, unsigned nrec) { - Table *t; - lua_lock(L); - t = luaH_new(L); - sethvalue2s(L, L->top.p, t); - api_incr_top(L); - if (narray > 0 || nrec > 0) - luaH_resize(L, t, narray, nrec); - luaC_checkGC(L); - lua_unlock(L); -} - - -LUA_API int lua_getmetatable (lua_State *L, int objindex) { - const TValue *obj; - Table *mt; - int res = 0; - lua_lock(L); - obj = index2value(L, objindex); - switch (ttype(obj)) { - case LUA_TTABLE: - mt = hvalue(obj)->metatable; - break; - case LUA_TUSERDATA: - mt = uvalue(obj)->metatable; - break; - default: - mt = G(L)->mt[ttype(obj)]; - break; - } - if (mt != NULL) { - sethvalue2s(L, L->top.p, mt); - api_incr_top(L); - res = 1; - } - lua_unlock(L); - return res; -} - - -LUA_API int lua_getiuservalue (lua_State *L, int idx, int n) { - TValue *o; - int t; - lua_lock(L); - o = index2value(L, idx); - api_check(L, ttisfulluserdata(o), "full userdata expected"); - if (n <= 0 || n > uvalue(o)->nuvalue) { - setnilvalue(s2v(L->top.p)); - t = LUA_TNONE; - } - else { - setobj2s(L, L->top.p, &uvalue(o)->uv[n - 1].uv); - t = ttype(s2v(L->top.p)); - } - api_incr_top(L); - lua_unlock(L); - return t; -} - - - - - -static void auxsetstr (lua_State *L, const TValue *t, const char *k) { - int hres; - TString *str = luaS_new(L, k); - api_checkpop(L, 1); - luaV_fastset(t, str, s2v(L->top.p - 1), hres, luaH_psetstr); - if (hres == HOK) { - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - L->top.p--; - } - else { - setsvalue2s(L, L->top.p, str); - api_incr_top(L); - luaV_finishset(L, t, s2v(L->top.p - 1), s2v(L->top.p - 2), hres); - L->top.p -= 2; - } - lua_unlock(L); -} - - -LUA_API void lua_setglobal (lua_State *L, const char *name) { - TValue gt; - lua_lock(L); - getGlobalTable(L, >); - auxsetstr(L, >, name); -} - - -LUA_API void lua_settable (lua_State *L, int idx) { - TValue *t; - int hres; - lua_lock(L); - api_checkpop(L, 2); - t = index2value(L, idx); - luaV_fastset(t, s2v(L->top.p - 2), s2v(L->top.p - 1), hres, luaH_pset); - if (hres == HOK) { - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - } - else - luaV_finishset(L, t, s2v(L->top.p - 2), s2v(L->top.p - 1), hres); - L->top.p -= 2; - lua_unlock(L); -} - - -LUA_API void lua_setfield (lua_State *L, int idx, const char *k) { - lua_lock(L); - auxsetstr(L, index2value(L, idx), k); -} - - -LUA_API void lua_seti (lua_State *L, int idx, lua_Integer n) { - TValue *t; - int hres; - lua_lock(L); - api_checkpop(L, 1); - t = index2value(L, idx); - luaV_fastseti(t, n, s2v(L->top.p - 1), hres); - if (hres == HOK) - luaV_finishfastset(L, t, s2v(L->top.p - 1)); - else { - TValue temp; - setivalue(&temp, n); - luaV_finishset(L, t, &temp, s2v(L->top.p - 1), hres); - } - L->top.p--; - lua_unlock(L); -} - - -static void aux_rawset (lua_State *L, int idx, TValue *key, int n) { - Table *t; - lua_lock(L); - api_checkpop(L, n); - t = gettable(L, idx); - luaH_set(L, t, key, s2v(L->top.p - 1)); - invalidateTMcache(t); - luaC_barrierback(L, obj2gco(t), s2v(L->top.p - 1)); - L->top.p -= n; - lua_unlock(L); -} - - -LUA_API void lua_rawset (lua_State *L, int idx) { - aux_rawset(L, idx, s2v(L->top.p - 2), 2); -} - - -LUA_API void lua_rawsetp (lua_State *L, int idx, const void *p) { - TValue k; - setpvalue(&k, cast_voidp(p)); - aux_rawset(L, idx, &k, 1); -} - - -LUA_API void lua_rawseti (lua_State *L, int idx, lua_Integer n) { - Table *t; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - luaH_setint(L, t, n, s2v(L->top.p - 1)); - luaC_barrierback(L, obj2gco(t), s2v(L->top.p - 1)); - L->top.p--; - lua_unlock(L); -} - - -LUA_API int lua_setmetatable (lua_State *L, int objindex) { - TValue *obj; - Table *mt; - lua_lock(L); - api_checkpop(L, 1); - obj = index2value(L, objindex); - if (ttisnil(s2v(L->top.p - 1))) - mt = NULL; - else { - api_check(L, ttistable(s2v(L->top.p - 1)), "table expected"); - mt = hvalue(s2v(L->top.p - 1)); - } - switch (ttype(obj)) { - case LUA_TTABLE: { - hvalue(obj)->metatable = mt; - if (mt) { - luaC_objbarrier(L, gcvalue(obj), mt); - luaC_checkfinalizer(L, gcvalue(obj), mt); - } - break; - } - case LUA_TUSERDATA: { - uvalue(obj)->metatable = mt; - if (mt) { - luaC_objbarrier(L, uvalue(obj), mt); - luaC_checkfinalizer(L, gcvalue(obj), mt); - } - break; - } - default: { - G(L)->mt[ttype(obj)] = mt; - break; - } - } - L->top.p--; - lua_unlock(L); - return 1; -} - - -LUA_API int lua_setiuservalue (lua_State *L, int idx, int n) { - TValue *o; - int res; - lua_lock(L); - api_checkpop(L, 1); - o = index2value(L, idx); - api_check(L, ttisfulluserdata(o), "full userdata expected"); - if (!(cast_uint(n) - 1u < cast_uint(uvalue(o)->nuvalue))) - res = 0; - else { - setobj(L, &uvalue(o)->uv[n - 1].uv, s2v(L->top.p - 1)); - luaC_barrierback(L, gcvalue(o), s2v(L->top.p - 1)); - res = 1; - } - L->top.p--; - lua_unlock(L); - return res; -} - - - - - -#define checkresults(L,na,nr) \ - api_check(L, (nr) == LUA_MULTRET \ - || (L->ci->top.p - L->top.p >= (nr) - (na)), \ - "results from function overflow current stack size") - - -LUA_API void lua_callk (lua_State *L, int nargs, int nresults, - lua_KContext ctx, lua_KFunction k) { - StkId func; - lua_lock(L); - api_check(L, k == NULL || !isLua(L->ci), - "cannot use continuations inside hooks"); - api_checkpop(L, nargs + 1); - api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); - checkresults(L, nargs, nresults); - func = L->top.p - (nargs+1); - if (k != NULL && yieldable(L)) { - L->ci->u.c.k = k; - L->ci->u.c.ctx = ctx; - luaD_call(L, func, nresults); - } - else - luaD_callnoyield(L, func, nresults); - adjustresults(L, nresults); - lua_unlock(L); -} - - - - -struct CallS { - StkId func; - int nresults; -}; - - -static void f_call (lua_State *L, void *ud) { - struct CallS *c = cast(struct CallS *, ud); - luaD_callnoyield(L, c->func, c->nresults); -} - - - -LUA_API int lua_pcallk (lua_State *L, int nargs, int nresults, int errfunc, - lua_KContext ctx, lua_KFunction k) { - struct CallS c; - int status; - ptrdiff_t func; - lua_lock(L); - api_check(L, k == NULL || !isLua(L->ci), - "cannot use continuations inside hooks"); - api_checkpop(L, nargs + 1); - api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); - checkresults(L, nargs, nresults); - if (errfunc == 0) - func = 0; - else { - StkId o = index2stack(L, errfunc); - api_check(L, ttisfunction(s2v(o)), "private_lua_error handler must be a function"); - func = savestack(L, o); - } - c.func = L->top.p - (nargs+1); - if (k == NULL || !yieldable(L)) { - c.nresults = nresults; - status = luaD_pcall(L, f_call, &c, savestack(L, c.func), func); - } - else { - CallInfo *ci = L->ci; - ci->u.c.k = k; - ci->u.c.ctx = ctx; - - ci->u2.funcidx = cast_int(savestack(L, c.func)); - ci->u.c.old_errfunc = L->errfunc; - L->errfunc = func; - setoah(ci->callstatus, L->allowhook); - ci->callstatus |= CIST_YPCALL; - luaD_call(L, c.func, nresults); - ci->callstatus &= ~CIST_YPCALL; - L->errfunc = ci->u.c.old_errfunc; - status = LUA_OK; - } - adjustresults(L, nresults); - lua_unlock(L); - return status; -} - - -LUA_API int lua_load (lua_State *L, lua_Reader reader, void *data, - const char *chunkname, const char *mode) { - ZIO z; - int status; - lua_lock(L); - if (!chunkname) chunkname = "?"; - luaZ_init(L, &z, reader, data); - status = luaD_protectedparser(L, &z, chunkname, mode); - if (status == LUA_OK) { - LClosure *f = clLvalue(s2v(L->top.p - 1)); - if (f->nupvalues >= 1) { - - TValue gt; - getGlobalTable(L, >); - - setobj(L, f->upvals[0]->v.p, >); - luaC_barrier(L, f->upvals[0], >); - } - } - lua_unlock(L); - return status; -} - - - -LUA_API int lua_dump (lua_State *L, lua_Writer writer, void *data, int strip) { - int status; - ptrdiff_t otop = savestack(L, L->top.p); - TValue *f = s2v(L->top.p - 1); - lua_lock(L); - api_checkpop(L, 1); - api_check(L, isLfunction(f), "Lua function expected"); - status = luaU_dump(L, clLvalue(f)->p, writer, data, strip); - L->top.p = restorestack(L, otop); - lua_unlock(L); - return status; -} - - -LUA_API int lua_status (lua_State *L) { - return L->status; -} - - - -LUA_API int lua_gc (lua_State *L, int what, ...) { - va_list argp; - int res = 0; - global_State *g = G(L); - if (g->gcstp & (GCSTPGC | GCSTPCLS)) - return -1; - lua_lock(L); - va_start(argp, what); - switch (what) { - case LUA_GCSTOP: { - g->gcstp = GCSTPUSR; - break; - } - case LUA_GCRESTART: { - luaE_setdebt(g, 0); - g->gcstp = 0; - break; - } - case LUA_GCCOLLECT: { - luaC_fullgc(L, 0); - break; - } - case LUA_GCCOUNT: { - - res = cast_int(g->totalbytes >> 10); - break; - } - case LUA_GCCOUNTB: { - res = cast_int(g->totalbytes & 0x3ff); - break; - } - case LUA_GCSTEP: { - lu_byte oldstp = g->gcstp; - l_obj n = va_arg(argp, int); - int work = 0; - g->gcstp = 0; - if (n <= 0) - n = g->GCdebt; - luaE_setdebt(g, g->GCdebt - n); - luaC_condGC(L, (void)0, work = 1); - if (work && g->gcstate == GCSpause) - res = 1; - g->gcstp = oldstp; - break; - } - case LUA_GCISRUNNING: { - res = gcrunning(g); - break; - } - case LUA_GCGEN: { - res = (g->gckind == KGC_INC) ? LUA_GCINC : LUA_GCGEN; - luaC_changemode(L, KGC_GENMINOR); - break; - } - case LUA_GCINC: { - res = (g->gckind == KGC_INC) ? LUA_GCINC : LUA_GCGEN; - luaC_changemode(L, KGC_INC); - break; - } - case LUA_GCPARAM: { - int param = va_arg(argp, int); - int value = va_arg(argp, int); - api_check(L, 0 <= param && param < LUA_GCPN, "invalid parameter"); - res = cast_int(luaO_applyparam(g->gcparams[param], 100)); - if (value >= 0) - g->gcparams[param] = luaO_codeparam(value); - break; - } - default: res = -1; - } - va_end(argp); - lua_unlock(L); - return res; -} - - - - - - -LUA_API int lua_error (lua_State *L) { - TValue *errobj; - lua_lock(L); - errobj = s2v(L->top.p - 1); - api_checkpop(L, 1); - - if (ttisshrstring(errobj) && eqshrstr(tsvalue(errobj), G(L)->memerrmsg)) - luaM_error(L); - else - luaG_errormsg(L); - - return 0; -} - - -LUA_API int lua_next (lua_State *L, int idx) { - Table *t; - int more; - lua_lock(L); - api_checkpop(L, 1); - t = gettable(L, idx); - more = luaH_next(L, t, L->top.p - 1); - if (more) - api_incr_top(L); - else - L->top.p--; - lua_unlock(L); - return more; -} - - -LUA_API void lua_toclose (lua_State *L, int idx) { - int nresults; - StkId o; - lua_lock(L); - o = index2stack(L, idx); - nresults = L->ci->nresults; - api_check(L, L->tbclist.p < o, "given index below or equal a marked one"); - luaF_newtbcupval(L, o); - if (!hastocloseCfunc(nresults)) - L->ci->nresults = codeNresults(nresults); - lua_assert(hastocloseCfunc(L->ci->nresults)); - lua_unlock(L); -} - - -LUA_API void lua_concat (lua_State *L, int n) { - lua_lock(L); - api_checknelems(L, n); - if (n > 0) { - luaV_concat(L, n); - luaC_checkGC(L); - } - else { - setsvalue2s(L, L->top.p, luaS_newlstr(L, "", 0)); - api_incr_top(L); - } - lua_unlock(L); -} - - -LUA_API void lua_len (lua_State *L, int idx) { - TValue *t; - lua_lock(L); - t = index2value(L, idx); - luaV_objlen(L, L->top.p, t); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API lua_Alloc lua_getallocf (lua_State *L, void **ud) { - lua_Alloc f; - lua_lock(L); - if (ud) *ud = G(L)->ud; - f = G(L)->frealloc; - lua_unlock(L); - return f; -} - - -LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud) { - lua_lock(L); - G(L)->ud = ud; - G(L)->frealloc = f; - lua_unlock(L); -} - - -void lua_setwarnf (lua_State *L, lua_WarnFunction f, void *ud) { - lua_lock(L); - G(L)->ud_warn = ud; - G(L)->warnf = f; - lua_unlock(L); -} - - -void lua_warning (lua_State *L, const char *msg, int tocont) { - lua_lock(L); - luaE_warning(L, msg, tocont); - lua_unlock(L); -} - - - -LUA_API void *lua_newuserdatauv (lua_State *L, size_t size, int nuvalue) { - Udata *u; - lua_lock(L); - api_check(L, 0 <= nuvalue && nuvalue < USHRT_MAX, "invalid value"); - u = luaS_newudata(L, size, nuvalue); - setuvalue(L, s2v(L->top.p), u); - api_incr_top(L); - advancegc(L, size); - luaC_checkGC(L); - lua_unlock(L); - return getudatamem(u); -} - - - -static const char *aux_upvalue (TValue *fi, int n, TValue **val, - GCObject **owner) { - switch (ttypetag(fi)) { - case LUA_VCCL: { - CClosure *f = clCvalue(fi); - if (!(cast_uint(n) - 1u < cast_uint(f->nupvalues))) - return NULL; - *val = &f->upvalue[n-1]; - if (owner) *owner = obj2gco(f); - return ""; - } - case LUA_VLCL: { - LClosure *f = clLvalue(fi); - TString *name; - Proto *p = f->p; - if (!(cast_uint(n) - 1u < cast_uint(p->sizeupvalues))) - return NULL; - *val = f->upvals[n-1]->v.p; - if (owner) *owner = obj2gco(f->upvals[n - 1]); - name = p->upvalues[n-1].name; - return (name == NULL) ? "(no name)" : getstr(name); - } - default: return NULL; - } -} - - -LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n) { - const char *name; - TValue *val = NULL; - lua_lock(L); - name = aux_upvalue(index2value(L, funcindex), n, &val, NULL); - if (name) { - setobj2s(L, L->top.p, val); - api_incr_top(L); - } - lua_unlock(L); - return name; -} - - -LUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n) { - const char *name; - TValue *val = NULL; - GCObject *owner = NULL; - TValue *fi; - lua_lock(L); - fi = index2value(L, funcindex); - api_checknelems(L, 1); - name = aux_upvalue(fi, n, &val, &owner); - if (name) { - L->top.p--; - setobj(L, val, s2v(L->top.p)); - luaC_barrier(L, owner, val); - } - lua_unlock(L); - return name; -} - - -static UpVal **getupvalref (lua_State *L, int fidx, int n, LClosure **pf) { - static const UpVal *const nullup = NULL; - LClosure *f; - TValue *fi = index2value(L, fidx); - api_check(L, ttisLclosure(fi), "Lua function expected"); - f = clLvalue(fi); - if (pf) *pf = f; - if (1 <= n && n <= f->p->sizeupvalues) - return &f->upvals[n - 1]; - else - return (UpVal**)&nullup; -} - - -LUA_API void *lua_upvalueid (lua_State *L, int fidx, int n) { - TValue *fi = index2value(L, fidx); - switch (ttypetag(fi)) { - case LUA_VLCL: { - return *getupvalref(L, fidx, n, NULL); - } - case LUA_VCCL: { - CClosure *f = clCvalue(fi); - if (1 <= n && n <= f->nupvalues) - return &f->upvalue[n - 1]; - - } - case LUA_VLCF: - return NULL; - default: { - api_check(L, 0, "function expected"); - return NULL; - } - } -} - - -LUA_API void lua_upvaluejoin (lua_State *L, int fidx1, int n1, - int fidx2, int n2) { - LClosure *f1; - UpVal **up1 = getupvalref(L, fidx1, n1, &f1); - UpVal **up2 = getupvalref(L, fidx2, n2, NULL); - api_check(L, *up1 != NULL && *up2 != NULL, "invalid upvalue index"); - *up1 = *up2; - luaC_objbarrier(L, f1, *up1); -} - - - - - - -//path: src/imports/../dependencies/lua/lauxlib.c - - -#define lauxlib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include -#include - - - - - - - -//path: src/imports/../dependencies/lua/lauxlib.h - - - -#ifndef lauxlib_h -#define lauxlib_h - - -#include -#include - - - - - - - - -#define LUA_GNAME "_G" - - -typedef struct luaL_Buffer luaL_Buffer; - - - -#define LUA_ERRFILE (LUA_ERRERR+1) - - - -#define LUA_LOADED_TABLE "_LOADED" - - - -#define LUA_PRELOAD_TABLE "_PRELOAD" - - -typedef struct luaL_Reg { - const char *name; - lua_CFunction func; -} luaL_Reg; - - -#define LUAL_NUMSIZES (sizeof(lua_Integer)*16 + sizeof(lua_Number)) - -LUALIB_API void (luaL_checkversion_) (lua_State *L, lua_Number ver, size_t sz); -#define luaL_checkversion(L) \ - luaL_checkversion_(L, LUA_VERSION_NUM, LUAL_NUMSIZES) - -LUALIB_API int (luaL_getmetafield) (lua_State *L, int obj, const char *e); -LUALIB_API int (luaL_callmeta) (lua_State *L, int obj, const char *e); -LUALIB_API const char *(luaL_tolstring) (lua_State *L, int idx, size_t *len); -LUALIB_API int (luaL_argerror) (lua_State *L, int arg, const char *extramsg); -LUALIB_API int (luaL_typeerror) (lua_State *L, int arg, const char *tname); -LUALIB_API const char *(luaL_checklstring) (lua_State *L, int arg, - size_t *l); -LUALIB_API const char *(luaL_optlstring) (lua_State *L, int arg, - const char *def, size_t *l); -LUALIB_API lua_Number (luaL_checknumber) (lua_State *L, int arg); -LUALIB_API lua_Number (luaL_optnumber) (lua_State *L, int arg, lua_Number def); - -LUALIB_API lua_Integer (luaL_checkinteger) (lua_State *L, int arg); -LUALIB_API lua_Integer (luaL_optinteger) (lua_State *L, int arg, - lua_Integer def); - -LUALIB_API void (luaL_checkstack) (lua_State *L, int sz, const char *msg); -LUALIB_API void (luaL_checktype) (lua_State *L, int arg, int t); -LUALIB_API void (luaL_checkany) (lua_State *L, int arg); - -LUALIB_API int (luaL_newmetatable) (lua_State *L, const char *tname); -LUALIB_API void (luaL_setmetatable) (lua_State *L, const char *tname); -LUALIB_API void *(luaL_testudata) (lua_State *L, int ud, const char *tname); -LUALIB_API void *(luaL_checkudata) (lua_State *L, int ud, const char *tname); - -LUALIB_API void (luaL_where) (lua_State *L, int lvl); -LUALIB_API int (luaL_error) (lua_State *L, const char *fmt, ...); - -LUALIB_API int (luaL_checkoption) (lua_State *L, int arg, const char *def, - const char *const lst[]); - -LUALIB_API int (luaL_fileresult) (lua_State *L, int stat, const char *fname); -LUALIB_API int (luaL_execresult) (lua_State *L, int stat); - - - -#define LUA_NOREF (-2) -#define LUA_REFNIL (-1) - -LUALIB_API int (luaL_ref) (lua_State *L, int t); -LUALIB_API void (luaL_unref) (lua_State *L, int t, int ref); - -LUALIB_API int (luaL_loadfilex) (lua_State *L, const char *filename, - const char *mode); - -#define luaL_loadfile(L,f) luaL_loadfilex(L,f,NULL) - -LUALIB_API int (luaL_loadbufferx) (lua_State *L, const char *buff, size_t sz, - const char *name, const char *mode); -LUALIB_API int (luaL_loadstring) (lua_State *L, const char *s); - -LUALIB_API lua_State *(luaL_newstate) (void); - -LUALIB_API unsigned luaL_makeseed (lua_State *L); - -LUALIB_API lua_Integer (luaL_len) (lua_State *L, int idx); - -LUALIB_API void (luaL_addgsub) (luaL_Buffer *b, const char *s, - const char *p, const char *r); -LUALIB_API const char *(luaL_gsub) (lua_State *L, const char *s, - const char *p, const char *r); - -LUALIB_API void (luaL_setfuncs) (lua_State *L, const luaL_Reg *l, int nup); - -LUALIB_API int (luaL_getsubtable) (lua_State *L, int idx, const char *fname); - -LUALIB_API void (luaL_traceback) (lua_State *L, lua_State *L1, - const char *msg, int level); - -LUALIB_API void (luaL_requiref) (lua_State *L, const char *modname, - lua_CFunction openf, int glb); - - - - -#define luaL_newlibtable(L,l) \ - lua_createtable(L, 0, sizeof(l)/sizeof((l)[0]) - 1) - -#define luaL_newlib(L,l) \ - (luaL_checkversion(L), luaL_newlibtable(L,l), luaL_setfuncs(L,l,0)) - -#define luaL_argcheck(L, cond,arg,extramsg) \ - ((void)(luai_likely(cond) || luaL_argerror(L, (arg), (extramsg)))) - -#define luaL_argexpected(L,cond,arg,tname) \ - ((void)(luai_likely(cond) || luaL_typeerror(L, (arg), (tname)))) - -#define luaL_checkstring(L,n) (luaL_checklstring(L, (n), NULL)) -#define luaL_optstring(L,n,d) (luaL_optlstring(L, (n), (d), NULL)) - -#define luaL_typename(L,i) lua_typename(L, lua_type(L,(i))) - -#define luaL_dofile(L, fn) \ - (luaL_loadfile(L, fn) || lua_pcall(L, 0, LUA_MULTRET, 0)) - -#define luaL_dostring(L, s) \ - (luaL_loadstring(L, s) || lua_pcall(L, 0, LUA_MULTRET, 0)) - -#define luaL_getmetatable(L,n) (lua_getfield(L, LUA_REGISTRYINDEX, (n))) - -#define luaL_opt(L,f,n,d) (lua_isnoneornil(L,(n)) ? (d) : f(L,(n))) - -#define luaL_loadbuffer(L,s,sz,n) luaL_loadbufferx(L,s,sz,n,NULL) - - - -#define luaL_intop(op,v1,v2) \ - ((lua_Integer)((lua_Unsigned)(v1) op (lua_Unsigned)(v2))) - - - -#define luaL_pushfail(L) lua_pushnil(L) - - - -#if !defined(lua_assert) - -#if defined LUAI_ASSERT - #include - #define lua_assert(c) assert(c) -#else - #define lua_assert(c) ((void)0) -#endif - -#endif - - - - - -struct luaL_Buffer { - char *b; - size_t size; - size_t n; - lua_State *L; - union { - LUAI_MAXALIGN; - char b[LUAL_BUFFERSIZE]; - } init; -}; - - -#define luaL_bufflen(bf) ((bf)->n) -#define luaL_buffaddr(bf) ((bf)->b) - - -#define luaL_addchar(B,c) \ - ((void)((B)->n < (B)->size || luaL_prepbuffsize((B), 1)), \ - ((B)->b[(B)->n++] = (c))) - -#define luaL_addsize(B,s) ((B)->n += (s)) - -#define luaL_buffsub(B,s) ((B)->n -= (s)) - -LUALIB_API void (luaL_buffinit) (lua_State *L, luaL_Buffer *B); -LUALIB_API char *(luaL_prepbuffsize) (luaL_Buffer *B, size_t sz); -LUALIB_API void (luaL_addlstring) (luaL_Buffer *B, const char *s, size_t l); -LUALIB_API void (luaL_addstring) (luaL_Buffer *B, const char *s); -LUALIB_API void (luaL_addvalue) (luaL_Buffer *B); -LUALIB_API void (luaL_pushresult) (luaL_Buffer *B); -LUALIB_API void (luaL_pushresultsize) (luaL_Buffer *B, size_t sz); -LUALIB_API char *(luaL_buffinitsize) (lua_State *L, luaL_Buffer *B, size_t sz); - -#define luaL_prepbuffer(B) luaL_prepbuffsize(B, LUAL_BUFFERSIZE) - - - - - - - - - -#define LUA_FILEHANDLE "FILE*" - - -typedef struct luaL_Stream { - FILE *f; - lua_CFunction closef; -} luaL_Stream; - - - - - - -#if !defined(lua_writestring) -#define lua_writestring(s,l) fwrite((s), sizeof(char), (l), stdout) -#endif - - -#if !defined(lua_writeline) -#define lua_writeline() (lua_writestring("\n", 1), fflush(stdout)) -#endif - - -#if !defined(lua_writestringerror) -#define lua_writestringerror(s,p) \ - (fprintf(stderr, (s), (p)), fflush(stderr)) -#endif - - - - - -#if defined(LUA_COMPAT_APIINTCASTS) - -#define luaL_checkunsigned(L,a) ((lua_Unsigned)luaL_checkinteger(L,a)) -#define luaL_optunsigned(L,a,d) \ - ((lua_Unsigned)luaL_optinteger(L,a,(lua_Integer)(d))) - -#define luaL_checkint(L,n) ((int)luaL_checkinteger(L, (n))) -#define luaL_optint(L,n,d) ((int)luaL_optinteger(L, (n), (d))) - -#define luaL_checklong(L,n) ((long)luaL_checkinteger(L, (n))) -#define luaL_optlong(L,n,d) ((long)luaL_optinteger(L, (n), (d))) - -#endif - - - - -#endif - - - - - - -#if !defined(MAX_SIZET) - -#define MAX_SIZET ((size_t)(~(size_t)0)) -#endif - - - - - -#define LEVELS1 10 -#define LEVELS2 11 - - - - -static int findfield (lua_State *L, int objidx, int level) { - if (level == 0 || !lua_istable(L, -1)) - return 0; - lua_pushnil(L); - while (lua_next(L, -2)) { - if (lua_type(L, -2) == LUA_TSTRING) { - if (lua_rawequal(L, objidx, -1)) { - lua_pop(L, 1); - return 1; - } - else if (findfield(L, objidx, level - 1)) { - - lua_pushliteral(L, "."); - lua_replace(L, -3); - lua_concat(L, 3); - return 1; - } - } - lua_pop(L, 1); - } - return 0; -} - - - -static int pushglobalfuncname (lua_State *L, lua_Debug *ar) { - int top = lua_gettop(L); - lua_getinfo(L, "f", ar); - lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - if (findfield(L, top + 1, 2)) { - const char *name = lua_tostring(L, -1); - if (strncmp(name, LUA_GNAME ".", 3) == 0) { - lua_pushstring(L, name + 3); - lua_remove(L, -2); - } - lua_copy(L, -1, top + 1); - lua_settop(L, top + 1); - return 1; - } - else { - lua_settop(L, top); - return 0; - } -} - - -static void pushfuncname (lua_State *L, lua_Debug *ar) { - if (pushglobalfuncname(L, ar)) { - lua_pushfstring(L, "function '%s'", lua_tostring(L, -1)); - lua_remove(L, -2); - } - else if (*ar->namewhat != '\0') - lua_pushfstring(L, "%s '%s'", ar->namewhat, ar->name); - else if (*ar->what == 'm') - lua_pushliteral(L, "main chunk"); - else if (*ar->what != 'C') - lua_pushfstring(L, "function <%s:%d>", ar->short_src, ar->linedefined); - else - lua_pushliteral(L, "?"); -} - - -static int lastlevel (lua_State *L) { - lua_Debug ar; - int li = 1, le = 1; - - while (lua_getstack(L, le, &ar)) { li = le; le *= 2; } - - while (li < le) { - int m = (li + le)/2; - if (lua_getstack(L, m, &ar)) li = m + 1; - else le = m; - } - return le - 1; -} - - -LUALIB_API void luaL_traceback (lua_State *L, lua_State *L1, - const char *msg, int level) { - luaL_Buffer b; - lua_Debug ar; - int last = lastlevel(L1); - int limit2show = (last - level > LEVELS1 + LEVELS2) ? LEVELS1 : -1; - luaL_buffinit(L, &b); - if (msg) { - luaL_addstring(&b, msg); - luaL_addchar(&b, '\n'); - } - luaL_addstring(&b, "stack traceback:"); - while (lua_getstack(L1, level++, &ar)) { - if (limit2show-- == 0) { - int n = last - level - LEVELS2 + 1; - lua_pushfstring(L, "\n\t...\t(skipping %d levels)", n); - luaL_addvalue(&b); - level += n; - } - else { - lua_getinfo(L1, "Slnt", &ar); - if (ar.currentline <= 0) - lua_pushfstring(L, "\n\t%s: in ", ar.short_src); - else - lua_pushfstring(L, "\n\t%s:%d: in ", ar.short_src, ar.currentline); - luaL_addvalue(&b); - pushfuncname(L, &ar); - luaL_addvalue(&b); - if (ar.istailcall) - luaL_addstring(&b, "\n\t(...tail calls...)"); - } - } - luaL_pushresult(&b); -} - - - - - - -LUALIB_API int luaL_argerror (lua_State *L, int arg, const char *extramsg) { - lua_Debug ar; - if (!lua_getstack(L, 0, &ar)) - return luaL_error(L, "bad argument #%d (%s)", arg, extramsg); - lua_getinfo(L, "n", &ar); - if (strcmp(ar.namewhat, "method") == 0) { - arg--; - if (arg == 0) - return luaL_error(L, "calling '%s' on bad self (%s)", - ar.name, extramsg); - } - if (ar.name == NULL) - ar.name = (pushglobalfuncname(L, &ar)) ? lua_tostring(L, -1) : "?"; - return luaL_error(L, "bad argument #%d to '%s' (%s)", - arg, ar.name, extramsg); -} - - -LUALIB_API int luaL_typeerror (lua_State *L, int arg, const char *tname) { - const char *msg; - const char *typearg; - if (luaL_getmetafield(L, arg, "__name") == LUA_TSTRING) - typearg = lua_tostring(L, -1); - else if (lua_type(L, arg) == LUA_TLIGHTUSERDATA) - typearg = "light userdata"; - else - typearg = luaL_typename(L, arg); - msg = lua_pushfstring(L, "%s expected, got %s", tname, typearg); - return luaL_argerror(L, arg, msg); -} - - -static void tag_error (lua_State *L, int arg, int tag) { - luaL_typeerror(L, arg, lua_typename(L, tag)); -} - - - -LUALIB_API void luaL_where (lua_State *L, int level) { - lua_Debug ar; - if (lua_getstack(L, level, &ar)) { - lua_getinfo(L, "Sl", &ar); - if (ar.currentline > 0) { - lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline); - return; - } - } - lua_pushfstring(L, ""); -} - - - -LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) { - va_list argp; - va_start(argp, fmt); - luaL_where(L, 1); - lua_pushvfstring(L, fmt, argp); - va_end(argp); - lua_concat(L, 2); - return lua_error(L); -} - - -LUALIB_API int luaL_fileresult (lua_State *L, int stat, const char *fname) { - int en = errno; - if (stat) { - lua_pushboolean(L, 1); - return 1; - } - else { - luaL_pushfail(L); - if (fname) - lua_pushfstring(L, "%s: %s", fname, strerror(en)); - else - lua_pushstring(L, strerror(en)); - lua_pushinteger(L, en); - return 3; - } -} - - -#if !defined(l_inspectstat) - -#if defined(LUA_USE_POSIX) - -#include - - -#define l_inspectstat(stat,what) \ - if (WIFEXITED(stat)) { stat = WEXITSTATUS(stat); } \ - else if (WIFSIGNALED(stat)) { stat = WTERMSIG(stat); what = "signal"; } - -#else - -#define l_inspectstat(stat,what) - -#endif - -#endif - - -LUALIB_API int luaL_execresult (lua_State *L, int stat) { - if (stat != 0 && errno != 0) - return luaL_fileresult(L, 0, NULL); - else { - const char *what = "exit"; - l_inspectstat(stat, what); - if (*what == 'e' && stat == 0) - lua_pushboolean(L, 1); - else - luaL_pushfail(L); - lua_pushstring(L, what); - lua_pushinteger(L, stat); - return 3; - } -} - - - - - - - -LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) { - if (luaL_getmetatable(L, tname) != LUA_TNIL) - return 0; - lua_pop(L, 1); - lua_createtable(L, 0, 2); - lua_pushstring(L, tname); - lua_setfield(L, -2, "__name"); - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, tname); - return 1; -} - - -LUALIB_API void luaL_setmetatable (lua_State *L, const char *tname) { - luaL_getmetatable(L, tname); - lua_setmetatable(L, -2); -} - - -LUALIB_API void *luaL_testudata (lua_State *L, int ud, const char *tname) { - void *p = lua_touserdata(L, ud); - if (p != NULL) { - if (lua_getmetatable(L, ud)) { - luaL_getmetatable(L, tname); - if (!lua_rawequal(L, -1, -2)) - p = NULL; - lua_pop(L, 2); - return p; - } - } - return NULL; -} - - -LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) { - void *p = luaL_testudata(L, ud, tname); - luaL_argexpected(L, p != NULL, ud, tname); - return p; -} - - - - - - -LUALIB_API int luaL_checkoption (lua_State *L, int arg, const char *def, - const char *const lst[]) { - const char *name = (def) ? luaL_optstring(L, arg, def) : - luaL_checkstring(L, arg); - int i; - for (i=0; lst[i]; i++) - if (strcmp(lst[i], name) == 0) - return i; - return luaL_argerror(L, arg, - lua_pushfstring(L, "invalid option '%s'", name)); -} - - - -LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *msg) { - if (l_unlikely(!lua_checkstack(L, space))) { - if (msg) - luaL_error(L, "stack overflow (%s)", msg); - else - luaL_error(L, "stack overflow"); - } -} - - -LUALIB_API void luaL_checktype (lua_State *L, int arg, int t) { - if (l_unlikely(lua_type(L, arg) != t)) - tag_error(L, arg, t); -} - - -LUALIB_API void luaL_checkany (lua_State *L, int arg) { - if (l_unlikely(lua_type(L, arg) == LUA_TNONE)) - luaL_argerror(L, arg, "value expected"); -} - - -LUALIB_API const char *luaL_checklstring (lua_State *L, int arg, size_t *len) { - const char *s = lua_tolstring(L, arg, len); - if (l_unlikely(!s)) tag_error(L, arg, LUA_TSTRING); - return s; -} - - -LUALIB_API const char *luaL_optlstring (lua_State *L, int arg, - const char *def, size_t *len) { - if (lua_isnoneornil(L, arg)) { - if (len) - *len = (def ? strlen(def) : 0); - return def; - } - else return luaL_checklstring(L, arg, len); -} - - -LUALIB_API lua_Number luaL_checknumber (lua_State *L, int arg) { - int isnum; - lua_Number d = lua_tonumberx(L, arg, &isnum); - if (l_unlikely(!isnum)) - tag_error(L, arg, LUA_TNUMBER); - return d; -} - - -LUALIB_API lua_Number luaL_optnumber (lua_State *L, int arg, lua_Number def) { - return luaL_opt(L, luaL_checknumber, arg, def); -} - - -static void interror (lua_State *L, int arg) { - if (lua_isnumber(L, arg)) - luaL_argerror(L, arg, "number has no integer representation"); - else - tag_error(L, arg, LUA_TNUMBER); -} - - -LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int arg) { - int isnum; - lua_Integer d = lua_tointegerx(L, arg, &isnum); - if (l_unlikely(!isnum)) { - interror(L, arg); - } - return d; -} - - -LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int arg, - lua_Integer def) { - return luaL_opt(L, luaL_checkinteger, arg, def); -} - - - - - - - -typedef struct UBox { - void *box; - size_t bsize; -} UBox; - - - -static void *resizebox (lua_State *L, int idx, size_t newsize) { - UBox *box = (UBox *)lua_touserdata(L, idx); - if (box->bsize == newsize) - return box->box; - else { - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); - void *temp = allocf(ud, box->box, box->bsize, newsize); - if (l_unlikely(temp == NULL && newsize > 0)) { - lua_pushliteral(L, "not enough memory"); - lua_error(L); - } - box->box = temp; - box->bsize = newsize; - return temp; - } -} - - -static int boxgc (lua_State *L) { - resizebox(L, 1, 0); - return 0; -} - - -static const luaL_Reg boxmt[] = { - {"__gc", boxgc}, - {"__close", boxgc}, - {NULL, NULL} -}; - - -static void newbox (lua_State *L) { - UBox *box = (UBox *)lua_newuserdatauv(L, sizeof(UBox), 0); - box->box = NULL; - box->bsize = 0; - if (luaL_newmetatable(L, "_UBOX*")) - luaL_setfuncs(L, boxmt, 0); - lua_setmetatable(L, -2); -} - - - -#define buffonstack(B) ((B)->b != (B)->init.b) - - - -#define checkbufferlevel(B,idx) \ - lua_assert(buffonstack(B) ? lua_touserdata(B->L, idx) != NULL \ - : lua_touserdata(B->L, idx) == (void*)B) - - - -static size_t newbuffsize (luaL_Buffer *B, size_t sz) { - size_t newsize = (B->size / 2) * 3; - if (l_unlikely(MAX_SIZET - sz - 1 < B->n)) - return luaL_error(B->L, "buffer too large"); - if (newsize < B->n + sz + 1) - newsize = B->n + sz + 1; - return newsize; -} - - - -static char *prepbuffsize (luaL_Buffer *B, size_t sz, int boxidx) { - checkbufferlevel(B, boxidx); - if (B->size - B->n >= sz) - return B->b + B->n; - else { - lua_State *L = B->L; - char *newbuff; - size_t newsize = newbuffsize(B, sz); - - if (buffonstack(B)) - newbuff = (char *)resizebox(L, boxidx, newsize); - else { - lua_remove(L, boxidx); - newbox(L); - lua_insert(L, boxidx); - lua_toclose(L, boxidx); - newbuff = (char *)resizebox(L, boxidx, newsize); - memcpy(newbuff, B->b, B->n * sizeof(char)); - } - B->b = newbuff; - B->size = newsize; - return newbuff + B->n; - } -} - - -LUALIB_API char *luaL_prepbuffsize (luaL_Buffer *B, size_t sz) { - return prepbuffsize(B, sz, -1); -} - - -LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) { - if (l > 0) { - char *b = prepbuffsize(B, l, -1); - memcpy(b, s, l * sizeof(char)); - luaL_addsize(B, l); - } -} - - -LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) { - luaL_addlstring(B, s, strlen(s)); -} - - -LUALIB_API void luaL_pushresult (luaL_Buffer *B) { - lua_State *L = B->L; - checkbufferlevel(B, -1); - if (!buffonstack(B)) - lua_pushlstring(L, B->b, B->n); - else { - UBox *box = (UBox *)lua_touserdata(L, -1); - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); - size_t len = B->n; - char *s; - resizebox(L, -1, len + 1); - s = (char*)box->box; - s[len] = '\0'; - - box->bsize = 0; box->box = NULL; - lua_pushextlstring(L, s, len, allocf, ud); - lua_closeslot(L, -2); - } - lua_remove(L, -2); -} - - -LUALIB_API void luaL_pushresultsize (luaL_Buffer *B, size_t sz) { - luaL_addsize(B, sz); - luaL_pushresult(B); -} - - - -LUALIB_API void luaL_addvalue (luaL_Buffer *B) { - lua_State *L = B->L; - size_t len; - const char *s = lua_tolstring(L, -1, &len); - char *b = prepbuffsize(B, len, -2); - memcpy(b, s, len * sizeof(char)); - luaL_addsize(B, len); - lua_pop(L, 1); -} - - -LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) { - B->L = L; - B->b = B->init.b; - B->n = 0; - B->size = LUAL_BUFFERSIZE; - lua_pushlightuserdata(L, (void*)B); -} - - -LUALIB_API char *luaL_buffinitsize (lua_State *L, luaL_Buffer *B, size_t sz) { - luaL_buffinit(L, B); - return prepbuffsize(B, sz, -1); -} - - - - - - - -LUALIB_API int luaL_ref (lua_State *L, int t) { - int ref; - if (lua_isnil(L, -1)) { - lua_pop(L, 1); - return LUA_REFNIL; - } - t = lua_absindex(L, t); - if (lua_rawgeti(L, t, 1) == LUA_TNUMBER) - ref = (int)lua_tointeger(L, -1); - else { - lua_assert(!lua_toboolean(L, -1)); - ref = 0; - lua_pushinteger(L, 0); - lua_rawseti(L, t, 1); - } - lua_pop(L, 1); - if (ref != 0) { - lua_rawgeti(L, t, ref); - lua_rawseti(L, t, 1); - } - else - ref = (int)lua_rawlen(L, t) + 1; - lua_rawseti(L, t, ref); - return ref; -} - - -LUALIB_API void luaL_unref (lua_State *L, int t, int ref) { - if (ref >= 0) { - t = lua_absindex(L, t); - lua_rawgeti(L, t, 1); - lua_assert(lua_isinteger(L, -1)); - lua_rawseti(L, t, ref); - lua_pushinteger(L, ref); - lua_rawseti(L, t, 1); - } -} - - - - - - -typedef struct LoadF { - int n; - FILE *f; - char buff[BUFSIZ]; -} LoadF; - - -static const char *getF (lua_State *L, void *ud, size_t *size) { - LoadF *lf = (LoadF *)ud; - (void)L; - if (lf->n > 0) { - *size = lf->n; - lf->n = 0; - } - else { - - if (feof(lf->f)) return NULL; - *size = fread(lf->buff, 1, sizeof(lf->buff), lf->f); - } - return lf->buff; -} - - -static int errfile (lua_State *L, const char *what, int fnameindex) { - const char *serr = strerror(errno); - const char *filename = lua_tostring(L, fnameindex) + 1; - lua_pushfstring(L, "cannot %s %s: %s", what, filename, serr); - lua_remove(L, fnameindex); - return LUA_ERRFILE; -} - - - -static int skipBOM (FILE *f) { - int c = getc(f); - if (c == 0xEF && getc(f) == 0xBB && getc(f) == 0xBF) - return getc(f); - else - return c; -} - - - -static int skipcomment (FILE *f, int *cp) { - int c = *cp = skipBOM(f); - if (c == '#') { - do { - c = getc(f); - } while (c != EOF && c != '\n'); - *cp = getc(f); - return 1; - } - else return 0; -} - - -LUALIB_API int luaL_loadfilex (lua_State *L, const char *filename, - const char *mode) { - LoadF lf; - int status, readstatus; - int c; - int fnameindex = lua_gettop(L) + 1; - if (filename == NULL) { - lua_pushliteral(L, "=stdin"); - lf.f = stdin; - } - else { - lua_pushfstring(L, "@%s", filename); - lf.f = fopen(filename, "r"); - if (lf.f == NULL) return errfile(L, "open", fnameindex); - } - lf.n = 0; - if (skipcomment(lf.f, &c)) - lf.buff[lf.n++] = '\n'; - if (c == LUA_SIGNATURE[0]) { - lf.n = 0; - if (filename) { - lf.f = freopen(filename, "rb", lf.f); - if (lf.f == NULL) return errfile(L, "reopen", fnameindex); - skipcomment(lf.f, &c); - } - } - if (c != EOF) - lf.buff[lf.n++] = c; - status = lua_load(L, getF, &lf, lua_tostring(L, -1), mode); - readstatus = ferror(lf.f); - if (filename) fclose(lf.f); - if (readstatus) { - lua_settop(L, fnameindex); - return errfile(L, "read", fnameindex); - } - lua_remove(L, fnameindex); - return status; -} - - -typedef struct LoadS { - const char *s; - size_t size; -} LoadS; - - -static const char *getS (lua_State *L, void *ud, size_t *size) { - LoadS *ls = (LoadS *)ud; - (void)L; - if (ls->size == 0) return NULL; - *size = ls->size; - ls->size = 0; - return ls->s; -} - - -LUALIB_API int luaL_loadbufferx (lua_State *L, const char *buff, size_t size, - const char *name, const char *mode) { - LoadS ls; - ls.s = buff; - ls.size = size; - return lua_load(L, getS, &ls, name, mode); -} - - -LUALIB_API int luaL_loadstring (lua_State *L, const char *s) { - return luaL_loadbuffer(L, s, strlen(s), s); -} - - - - - -LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) { - if (!lua_getmetatable(L, obj)) - return LUA_TNIL; - else { - int tt; - lua_pushstring(L, event); - tt = lua_rawget(L, -2); - if (tt == LUA_TNIL) - lua_pop(L, 2); - else - lua_remove(L, -2); - return tt; - } -} - - -LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) { - obj = lua_absindex(L, obj); - if (luaL_getmetafield(L, obj, event) == LUA_TNIL) - return 0; - lua_pushvalue(L, obj); - lua_call(L, 1, 1); - return 1; -} - - -LUALIB_API lua_Integer luaL_len (lua_State *L, int idx) { - lua_Integer l; - int isnum; - lua_len(L, idx); - l = lua_tointegerx(L, -1, &isnum); - if (l_unlikely(!isnum)) - luaL_error(L, "object length is not an integer"); - lua_pop(L, 1); - return l; -} - - -LUALIB_API const char *luaL_tolstring (lua_State *L, int idx, size_t *len) { - idx = lua_absindex(L,idx); - if (luaL_callmeta(L, idx, "__tostring")) { - if (!lua_isstring(L, -1)) - luaL_error(L, "'__tostring' must return a string"); - } - else { - switch (lua_type(L, idx)) { - case LUA_TNUMBER: { - if (lua_isinteger(L, idx)) - lua_pushfstring(L, "%I", (LUAI_UACINT)lua_tointeger(L, idx)); - else - lua_pushfstring(L, "%f", (LUAI_UACNUMBER)lua_tonumber(L, idx)); - break; - } - case LUA_TSTRING: - lua_pushvalue(L, idx); - break; - case LUA_TBOOLEAN: - lua_pushstring(L, (lua_toboolean(L, idx) ? "true" : "false")); - break; - case LUA_TNIL: - lua_pushliteral(L, "nil"); - break; - default: { - int tt = luaL_getmetafield(L, idx, "__name"); - const char *kind = (tt == LUA_TSTRING) ? lua_tostring(L, -1) : - luaL_typename(L, idx); - lua_pushfstring(L, "%s: %p", kind, lua_topointer(L, idx)); - if (tt != LUA_TNIL) - lua_remove(L, -2); - break; - } - } - } - return lua_tolstring(L, -1, len); -} - - - -LUALIB_API void luaL_setfuncs (lua_State *L, const luaL_Reg *l, int nup) { - luaL_checkstack(L, nup, "too many upvalues"); - for (; l->name != NULL; l++) { - if (l->func == NULL) - lua_pushboolean(L, 0); - else { - int i; - for (i = 0; i < nup; i++) - lua_pushvalue(L, -nup); - lua_pushcclosure(L, l->func, nup); - } - lua_setfield(L, -(nup + 2), l->name); - } - lua_pop(L, nup); -} - - - -LUALIB_API int luaL_getsubtable (lua_State *L, int idx, const char *fname) { - if (lua_getfield(L, idx, fname) == LUA_TTABLE) - return 1; - else { - lua_pop(L, 1); - idx = lua_absindex(L, idx); - lua_newtable(L); - lua_pushvalue(L, -1); - lua_setfield(L, idx, fname); - return 0; - } -} - - - -LUALIB_API void luaL_requiref (lua_State *L, const char *modname, - lua_CFunction openf, int glb) { - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_getfield(L, -1, modname); - if (!lua_toboolean(L, -1)) { - lua_pop(L, 1); - lua_pushcfunction(L, openf); - lua_pushstring(L, modname); - lua_call(L, 1, 1); - lua_pushvalue(L, -1); - lua_setfield(L, -3, modname); - } - lua_remove(L, -2); - if (glb) { - lua_pushvalue(L, -1); - lua_setglobal(L, modname); - } -} - - -LUALIB_API void luaL_addgsub (luaL_Buffer *b, const char *s, - const char *p, const char *r) { - const char *wild; - size_t l = strlen(p); - while ((wild = strstr(s, p)) != NULL) { - luaL_addlstring(b, s, wild - s); - luaL_addstring(b, r); - s = wild + l; - } - luaL_addstring(b, s); -} - - -LUALIB_API const char *luaL_gsub (lua_State *L, const char *s, - const char *p, const char *r) { - luaL_Buffer b; - luaL_buffinit(L, &b); - luaL_addgsub(&b, s, p, r); - luaL_pushresult(&b); - return lua_tostring(L, -1); -} - - -static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) { - (void)ud; (void)osize; - if (nsize == 0) { - free(ptr); - return NULL; - } - else - return realloc(ptr, nsize); -} - - - -static int panic (lua_State *L) { - const char *msg = (lua_type(L, -1) == LUA_TSTRING) - ? lua_tostring(L, -1) - : "private_lua_error object is not a string"; - lua_writestringerror("PANIC: unprotected private_lua_error in call to Lua API (%s)\n", - msg); - return 0; -} - - - -static void warnfoff (void *ud, const char *message, int tocont); -static void warnfon (void *ud, const char *message, int tocont); -static void warnfcont (void *ud, const char *message, int tocont); - - - -static int checkcontrol (lua_State *L, const char *message, int tocont) { - if (tocont || *(message++) != '@') - return 0; - else { - if (strcmp(message, "off") == 0) - lua_setwarnf(L, warnfoff, L); - else if (strcmp(message, "on") == 0) - lua_setwarnf(L, warnfon, L); - return 1; - } -} - - -static void warnfoff (void *ud, const char *message, int tocont) { - checkcontrol((lua_State *)ud, message, tocont); -} - - - -static void warnfcont (void *ud, const char *message, int tocont) { - lua_State *L = (lua_State *)ud; - lua_writestringerror("%s", message); - if (tocont) - lua_setwarnf(L, warnfcont, L); - else { - lua_writestringerror("%s", "\n"); - lua_setwarnf(L, warnfon, L); - } -} - - -static void warnfon (void *ud, const char *message, int tocont) { - if (checkcontrol((lua_State *)ud, message, tocont)) - return; - lua_writestringerror("%s", "Lua warning: "); - warnfcont(ud, message, tocont); -} - - - - -#if !defined(luai_makeseed) - -#include - - - -#define BUFSEEDB (sizeof(void*) + sizeof(time_t)) - - -#define BUFSEED ((BUFSEEDB + sizeof(int) - 1) / sizeof(int)) - - -#define addbuff(b,v) (memcpy(&b[0], &(v), sizeof(v)), b += sizeof(v)) - - -static unsigned int luai_makeseed (void) { - unsigned int buff[BUFSEED]; - unsigned int res; - unsigned int i; - time_t t = time(NULL); - char *b = (char*)buff; - addbuff(b, b); - addbuff(b, t); - - memset(b, 0, sizeof(buff) - BUFSEEDB); - res = buff[0]; - for (i = 1; i < BUFSEED; i++) - res ^= (res >> 3) + (res << 7) + buff[i]; - return res; -} - -#endif - - -LUALIB_API unsigned int luaL_makeseed (lua_State *L) { - (void)L; - return luai_makeseed(); -} - - -LUALIB_API lua_State *luaL_newstate (void) { - lua_State *L = lua_newstate(l_alloc, NULL, luai_makeseed()); - if (l_likely(L)) { - lua_atpanic(L, &panic); - lua_setwarnf(L, warnfoff, L); - } - return L; -} - - -LUALIB_API void luaL_checkversion_ (lua_State *L, lua_Number ver, size_t sz) { - lua_Number v = lua_version(L); - if (sz != LUAL_NUMSIZES) - luaL_error(L, "core and library have incompatible numeric types"); - else if (v != ver) - luaL_error(L, "version mismatch: app. needs %f, Lua core provides %f", - (LUAI_UACNUMBER)ver, (LUAI_UACNUMBER)v); -} - - - - - - - -#ifndef MAKE_LUAC -//path: src/imports/../dependencies/lua/lbaselib.c - - -#define lbaselib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include - - - - - - -//path: src/imports/../dependencies/lua/lualib.h - - - -#ifndef lualib_h -#define lualib_h - - - - - - -#define LUA_VERSUFFIX "_" LUA_VERSION_MAJOR "_" LUA_VERSION_MINOR - -#define LUA_GLIBK 1 -LUAMOD_API int (luaopen_base) (lua_State *L); - -#define LUA_LOADLIBNAME "package" -#define LUA_LOADLIBK (LUA_GLIBK << 1) -LUAMOD_API int (luaopen_package) (lua_State *L); - - -#define LUA_COLIBNAME "coroutine" -#define LUA_COLIBK (LUA_LOADLIBK << 1) -LUAMOD_API int (luaopen_coroutine) (lua_State *L); - -#define LUA_DBLIBNAME "debug" -#define LUA_DBLIBK (LUA_COLIBK << 1) -LUAMOD_API int (luaopen_debug) (lua_State *L); - -#define LUA_IOLIBNAME "io" -#define LUA_IOLIBK (LUA_DBLIBK << 1) -LUAMOD_API int (luaopen_io) (lua_State *L); - -#define LUA_MATHLIBNAME "math" -#define LUA_MATHLIBK (LUA_IOLIBK << 1) -LUAMOD_API int (luaopen_math) (lua_State *L); - -#define LUA_OSLIBNAME "os" -#define LUA_OSLIBK (LUA_MATHLIBK << 1) -LUAMOD_API int (luaopen_os) (lua_State *L); - -#define LUA_STRLIBNAME "string" -#define LUA_STRLIBK (LUA_OSLIBK << 1) -LUAMOD_API int (luaopen_string) (lua_State *L); - -#define LUA_TABLIBNAME "table" -#define LUA_TABLIBK (LUA_STRLIBK << 1) -LUAMOD_API int (luaopen_table) (lua_State *L); - -#define LUA_UTF8LIBNAME "utf8" -#define LUA_UTF8LIBK (LUA_TABLIBK << 1) -LUAMOD_API int (luaopen_utf8) (lua_State *L); - - - -LUALIB_API void (luaL_openselectedlibs) (lua_State *L, int load, int preload); - - -#define luaL_openlibs(L) luaL_openselectedlibs(L, ~0, 0) - - -#endif - - - - -static int luaB_print (lua_State *L) { - int n = lua_gettop(L); - int i; - for (i = 1; i <= n; i++) { - size_t l; - const char *s = luaL_tolstring(L, i, &l); - if (i > 1) - lua_writestring("\t", 1); - lua_writestring(s, l); - lua_pop(L, 1); - } - lua_writeline(); - return 0; -} - - - -static int luaB_warn (lua_State *L) { - int n = lua_gettop(L); - int i; - luaL_checkstring(L, 1); - for (i = 2; i <= n; i++) - luaL_checkstring(L, i); - for (i = 1; i < n; i++) - lua_warning(L, lua_tostring(L, i), 1); - lua_warning(L, lua_tostring(L, n), 0); - return 0; -} - - -#define SPACECHARS " \f\n\r\t\v" - -static const char *b_str2int (const char *s, int base, lua_Integer *pn) { - lua_Unsigned n = 0; - int neg = 0; - s += strspn(s, SPACECHARS); - if (*s == '-') { s++; neg = 1; } - else if (*s == '+') s++; - if (!isalnum((unsigned char)*s)) - return NULL; - do { - int digit = (isdigit((unsigned char)*s)) ? *s - '0' - : (toupper((unsigned char)*s) - 'A') + 10; - if (digit >= base) return NULL; - n = n * base + digit; - s++; - } while (isalnum((unsigned char)*s)); - s += strspn(s, SPACECHARS); - *pn = (lua_Integer)((neg) ? (0u - n) : n); - return s; -} - - -static int luaB_tonumber (lua_State *L) { - if (lua_isnoneornil(L, 2)) { - if (lua_type(L, 1) == LUA_TNUMBER) { - lua_settop(L, 1); - return 1; - } - else { - size_t l; - const char *s = lua_tolstring(L, 1, &l); - if (s != NULL && lua_stringtonumber(L, s) == l + 1) - return 1; - - luaL_checkany(L, 1); - } - } - else { - size_t l; - const char *s; - lua_Integer n = 0; - lua_Integer base = luaL_checkinteger(L, 2); - luaL_checktype(L, 1, LUA_TSTRING); - s = lua_tolstring(L, 1, &l); - luaL_argcheck(L, 2 <= base && base <= 36, 2, "base out of range"); - if (b_str2int(s, (int)base, &n) == s + l) { - lua_pushinteger(L, n); - return 1; - } - } - luaL_pushfail(L); - return 1; -} - - -static int luaB_error (lua_State *L) { - int level = (int)luaL_optinteger(L, 2, 1); - lua_settop(L, 1); - if (lua_type(L, 1) == LUA_TSTRING && level > 0) { - luaL_where(L, level); - lua_pushvalue(L, 1); - lua_concat(L, 2); - } - return lua_error(L); -} - - -static int luaB_getmetatable (lua_State *L) { - luaL_checkany(L, 1); - if (!lua_getmetatable(L, 1)) { - lua_pushnil(L); - return 1; - } - luaL_getmetafield(L, 1, "__metatable"); - return 1; -} - - -static int luaB_setmetatable (lua_State *L) { - int t = lua_type(L, 2); - luaL_checktype(L, 1, LUA_TTABLE); - luaL_argexpected(L, t == LUA_TNIL || t == LUA_TTABLE, 2, "nil or table"); - if (l_unlikely(luaL_getmetafield(L, 1, "__metatable") != LUA_TNIL)) - return luaL_error(L, "cannot change a protected metatable"); - lua_settop(L, 2); - lua_setmetatable(L, 1); - return 1; -} - - -static int luaB_rawequal (lua_State *L) { - luaL_checkany(L, 1); - luaL_checkany(L, 2); - lua_pushboolean(L, lua_rawequal(L, 1, 2)); - return 1; -} - - -static int luaB_rawlen (lua_State *L) { - int t = lua_type(L, 1); - luaL_argexpected(L, t == LUA_TTABLE || t == LUA_TSTRING, 1, - "table or string"); - lua_pushinteger(L, lua_rawlen(L, 1)); - return 1; -} - - -static int luaB_rawget (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - luaL_checkany(L, 2); - lua_settop(L, 2); - lua_rawget(L, 1); - return 1; -} - -static int luaB_rawset (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - luaL_checkany(L, 2); - luaL_checkany(L, 3); - lua_settop(L, 3); - lua_rawset(L, 1); - return 1; -} - - -static int pushmode (lua_State *L, int oldmode) { - if (oldmode == -1) - luaL_pushfail(L); - else - lua_pushstring(L, (oldmode == LUA_GCINC) ? "incremental" - : "generational"); - return 1; -} - - - -#define checkvalres(res) { if (res == -1) break; } - -static int luaB_collectgarbage (lua_State *L) { - static const char *const opts[] = {"stop", "restart", "collect", - "count", "step", "isrunning", "generational", "incremental", - "param", NULL}; - static const char optsnum[] = {LUA_GCSTOP, LUA_GCRESTART, LUA_GCCOLLECT, - LUA_GCCOUNT, LUA_GCSTEP, LUA_GCISRUNNING, LUA_GCGEN, LUA_GCINC, - LUA_GCPARAM}; - int o = optsnum[luaL_checkoption(L, 1, "collect", opts)]; - switch (o) { - case LUA_GCCOUNT: { - int k = lua_gc(L, o); - int b = lua_gc(L, LUA_GCCOUNTB); - checkvalres(k); - lua_pushnumber(L, (lua_Number)k + ((lua_Number)b/1024)); - return 1; - } - case LUA_GCSTEP: { - lua_Integer n = luaL_optinteger(L, 2, 0); - int res = lua_gc(L, o, (int)n); - checkvalres(res); - lua_pushboolean(L, res); - return 1; - } - case LUA_GCISRUNNING: { - int res = lua_gc(L, o); - checkvalres(res); - lua_pushboolean(L, res); - return 1; - } - case LUA_GCGEN: { - return pushmode(L, lua_gc(L, o)); - } - case LUA_GCINC: { - return pushmode(L, lua_gc(L, o)); - } - case LUA_GCPARAM: { - static const char *const params[] = { - "minormul", "majorminor", "minormajor", - "pause", "stepmul", "stepsize", NULL}; - static const char pnum[] = { - LUA_GCPMINORMUL, LUA_GCPMAJORMINOR, LUA_GCPMINORMAJOR, - LUA_GCPPAUSE, LUA_GCPSTEPMUL, LUA_GCPSTEPSIZE}; - int p = pnum[luaL_checkoption(L, 2, NULL, params)]; - lua_Integer value = luaL_optinteger(L, 3, -1); - lua_pushinteger(L, lua_gc(L, o, p, (int)value)); - return 1; - } - default: { - int res = lua_gc(L, o); - checkvalres(res); - lua_pushinteger(L, res); - return 1; - } - } - luaL_pushfail(L); - return 1; -} - - -static int luaB_type (lua_State *L) { - int t = lua_type(L, 1); - luaL_argcheck(L, t != LUA_TNONE, 1, "value expected"); - lua_pushstring(L, lua_typename(L, t)); - return 1; -} - - -static int luaB_next (lua_State *L) { - luaL_checktype(L, 1, LUA_TTABLE); - lua_settop(L, 2); - if (lua_next(L, 1)) - return 2; - else { - lua_pushnil(L); - return 1; - } -} - - -static int pairscont (lua_State *L, int status, lua_KContext k) { - (void)L; (void)status; (void)k; - return 3; -} - -static int luaB_pairs (lua_State *L) { - luaL_checkany(L, 1); - if (luaL_getmetafield(L, 1, "__pairs") == LUA_TNIL) { - lua_pushcfunction(L, luaB_next); - lua_pushvalue(L, 1); - lua_pushnil(L); - } - else { - lua_pushvalue(L, 1); - lua_callk(L, 1, 3, 0, pairscont); - } - return 3; -} - - - -static int ipairsaux (lua_State *L) { - lua_Integer i = luaL_checkinteger(L, 2); - i = luaL_intop(+, i, 1); - lua_pushinteger(L, i); - return (lua_geti(L, 1, i) == LUA_TNIL) ? 1 : 2; -} - - - -static int luaB_ipairs (lua_State *L) { - luaL_checkany(L, 1); - lua_pushcfunction(L, ipairsaux); - lua_pushvalue(L, 1); - lua_pushinteger(L, 0); - return 3; -} - - -static int load_aux (lua_State *L, int status, int envidx) { - if (l_likely(status == LUA_OK)) { - if (envidx != 0) { - lua_pushvalue(L, envidx); - if (!lua_setupvalue(L, -2, 1)) - lua_pop(L, 1); - } - return 1; - } - else { - luaL_pushfail(L); - lua_insert(L, -2); - return 2; - } -} - - -static const char *getmode (lua_State *L, int idx) { - const char *mode = luaL_optstring(L, idx, "bt"); - if (strchr(mode, 'B') != NULL) - luaL_argerror(L, idx, "invalid mode"); - return mode; -} - - -static int luaB_loadfile (lua_State *L) { - const char *fname = luaL_optstring(L, 1, NULL); - const char *mode = getmode(L, 2); - int env = (!lua_isnone(L, 3) ? 3 : 0); - int status = luaL_loadfilex(L, fname, mode); - return load_aux(L, status, env); -} - - - - - - -#define RESERVEDSLOT 5 - - - -static const char *generic_reader (lua_State *L, void *ud, size_t *size) { - (void)(ud); - luaL_checkstack(L, 2, "too many nested functions"); - lua_pushvalue(L, 1); - lua_call(L, 0, 1); - if (lua_isnil(L, -1)) { - lua_pop(L, 1); - *size = 0; - return NULL; - } - else if (l_unlikely(!lua_isstring(L, -1))) - luaL_error(L, "reader function must return a string"); - lua_replace(L, RESERVEDSLOT); - return lua_tolstring(L, RESERVEDSLOT, size); -} - - -static int luaB_load (lua_State *L) { - int status; - size_t l; - const char *s = lua_tolstring(L, 1, &l); - const char *mode = getmode(L, 3); - int env = (!lua_isnone(L, 4) ? 4 : 0); - if (s != NULL) { - const char *chunkname = luaL_optstring(L, 2, s); - status = luaL_loadbufferx(L, s, l, chunkname, mode); - } - else { - const char *chunkname = luaL_optstring(L, 2, "=(load)"); - luaL_checktype(L, 1, LUA_TFUNCTION); - lua_settop(L, RESERVEDSLOT); - status = lua_load(L, generic_reader, NULL, chunkname, mode); - } - return load_aux(L, status, env); -} - - - - -static int dofilecont (lua_State *L, int d1, lua_KContext d2) { - (void)d1; (void)d2; - return lua_gettop(L) - 1; -} - - -static int luaB_dofile (lua_State *L) { - const char *fname = luaL_optstring(L, 1, NULL); - lua_settop(L, 1); - if (l_unlikely(luaL_loadfile(L, fname) != LUA_OK)) - return lua_error(L); - lua_callk(L, 0, LUA_MULTRET, 0, dofilecont); - return dofilecont(L, 0, 0); -} - - -static int luaB_assert (lua_State *L) { - if (l_likely(lua_toboolean(L, 1))) - return lua_gettop(L); - else { - luaL_checkany(L, 1); - lua_remove(L, 1); - lua_pushliteral(L, "assertion failed!"); - lua_settop(L, 1); - return luaB_error(L); - } -} - - -static int luaB_select (lua_State *L) { - int n = lua_gettop(L); - if (lua_type(L, 1) == LUA_TSTRING && *lua_tostring(L, 1) == '#') { - lua_pushinteger(L, n-1); - return 1; - } - else { - lua_Integer i = luaL_checkinteger(L, 1); - if (i < 0) i = n + i; - else if (i > n) i = n; - luaL_argcheck(L, 1 <= i, 1, "index out of range"); - return n - (int)i; - } -} - - - -static int finishpcall (lua_State *L, int status, lua_KContext extra) { - if (l_unlikely(status != LUA_OK && status != LUA_YIELD)) { - lua_pushboolean(L, 0); - lua_pushvalue(L, -2); - return 2; - } - else - return lua_gettop(L) - (int)extra; -} - - -static int luaB_pcall (lua_State *L) { - int status; - luaL_checkany(L, 1); - lua_pushboolean(L, 1); - lua_insert(L, 1); - status = lua_pcallk(L, lua_gettop(L) - 2, LUA_MULTRET, 0, 0, finishpcall); - return finishpcall(L, status, 0); -} - - - -static int luaB_xpcall (lua_State *L) { - int status; - int n = lua_gettop(L); - luaL_checktype(L, 2, LUA_TFUNCTION); - lua_pushboolean(L, 1); - lua_pushvalue(L, 1); - lua_rotate(L, 3, 2); - status = lua_pcallk(L, n - 2, LUA_MULTRET, 2, 2, finishpcall); - return finishpcall(L, status, 2); -} - - -static int luaB_tostring (lua_State *L) { - luaL_checkany(L, 1); - luaL_tolstring(L, 1, NULL); - return 1; -} - - -static const luaL_Reg base_funcs[] = { - {"assert", luaB_assert}, - {"collectgarbage", luaB_collectgarbage}, - {"dofile", luaB_dofile}, - {"error", luaB_error}, - {"getmetatable", luaB_getmetatable}, - {"ipairs", luaB_ipairs}, - {"loadfile", luaB_loadfile}, - {"load", luaB_load}, - {"next", luaB_next}, - {"pairs", luaB_pairs}, - {"pcall", luaB_pcall}, - {"print", luaB_print}, - {"warn", luaB_warn}, - {"rawequal", luaB_rawequal}, - {"rawlen", luaB_rawlen}, - {"rawget", luaB_rawget}, - {"rawset", luaB_rawset}, - {"select", luaB_select}, - {"setmetatable", luaB_setmetatable}, - {"tonumber", luaB_tonumber}, - {"tostring", luaB_tostring}, - {"type", luaB_type}, - {"xpcall", luaB_xpcall}, - - {LUA_GNAME, NULL}, - {"_VERSION", NULL}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_base (lua_State *L) { - - lua_pushglobaltable(L); - luaL_setfuncs(L, base_funcs, 0); - - lua_pushvalue(L, -1); - lua_setfield(L, -2, LUA_GNAME); - - lua_pushliteral(L, LUA_VERSION); - lua_setfield(L, -2, "_VERSION"); - return 1; -} - - - -//path: src/imports/../dependencies/lua/lcorolib.c - - -#define lcorolib_c -#define LUA_LIB - - - - - -#include - - - - - - - - - - -static lua_State *getco (lua_State *L) { - lua_State *co = lua_tothread(L, 1); - luaL_argexpected(L, co, 1, "thread"); - return co; -} - - - -static int auxresume (lua_State *L, lua_State *co, int narg) { - int status, nres; - if (l_unlikely(!lua_checkstack(co, narg))) { - lua_pushliteral(L, "too many arguments to resume"); - return -1; - } - lua_xmove(L, co, narg); - status = lua_resume(co, L, narg, &nres); - if (l_likely(status == LUA_OK || status == LUA_YIELD)) { - if (l_unlikely(!lua_checkstack(L, nres + 1))) { - lua_pop(co, nres); - lua_pushliteral(L, "too many results to resume"); - return -1; - } - lua_xmove(co, L, nres); - return nres; - } - else { - lua_xmove(co, L, 1); - return -1; - } -} - - -static int luaB_coresume (lua_State *L) { - lua_State *co = getco(L); - int r; - r = auxresume(L, co, lua_gettop(L) - 1); - if (l_unlikely(r < 0)) { - lua_pushboolean(L, 0); - lua_insert(L, -2); - return 2; - } - else { - lua_pushboolean(L, 1); - lua_insert(L, -(r + 1)); - return r + 1; - } -} - - -static int luaB_auxwrap (lua_State *L) { - lua_State *co = lua_tothread(L, lua_upvalueindex(1)); - int r = auxresume(L, co, lua_gettop(L)); - if (l_unlikely(r < 0)) { - int stat = lua_status(co); - if (stat != LUA_OK && stat != LUA_YIELD) { - stat = lua_closethread(co, L); - lua_assert(stat != LUA_OK); - lua_xmove(co, L, 1); - } - if (stat != LUA_ERRMEM && - lua_type(L, -1) == LUA_TSTRING) { - luaL_where(L, 1); - lua_insert(L, -2); - lua_concat(L, 2); - } - return lua_error(L); - } - return r; -} - - -static int luaB_cocreate (lua_State *L) { - lua_State *NL; - luaL_checktype(L, 1, LUA_TFUNCTION); - NL = lua_newthread(L); - lua_pushvalue(L, 1); - lua_xmove(L, NL, 1); - return 1; -} - - -static int luaB_cowrap (lua_State *L) { - luaB_cocreate(L); - lua_pushcclosure(L, luaB_auxwrap, 1); - return 1; -} - - -static int luaB_yield (lua_State *L) { - return lua_yield(L, lua_gettop(L)); -} - - -#define COS_RUN 0 -#define COS_DEAD 1 -#define COS_YIELD 2 -#define COS_NORM 3 - - -static const char *const statname[] = - {"running", "dead", "suspended", "normal"}; - - -static int auxstatus (lua_State *L, lua_State *co) { - if (L == co) return COS_RUN; - else { - switch (lua_status(co)) { - case LUA_YIELD: - return COS_YIELD; - case LUA_OK: { - lua_Debug ar; - if (lua_getstack(co, 0, &ar)) - return COS_NORM; - else if (lua_gettop(co) == 0) - return COS_DEAD; - else - return COS_YIELD; - } - default: - return COS_DEAD; - } - } -} - - -static int luaB_costatus (lua_State *L) { - lua_State *co = getco(L); - lua_pushstring(L, statname[auxstatus(L, co)]); - return 1; -} - - -static int luaB_yieldable (lua_State *L) { - lua_State *co = lua_isnone(L, 1) ? L : getco(L); - lua_pushboolean(L, lua_isyieldable(co)); - return 1; -} - - -static int luaB_corunning (lua_State *L) { - int ismain = lua_pushthread(L); - lua_pushboolean(L, ismain); - return 2; -} - - -static int luaB_close (lua_State *L) { - lua_State *co = getco(L); - int status = auxstatus(L, co); - switch (status) { - case COS_DEAD: case COS_YIELD: { - status = lua_closethread(co, L); - if (status == LUA_OK) { - lua_pushboolean(L, 1); - return 1; - } - else { - lua_pushboolean(L, 0); - lua_xmove(co, L, 1); - return 2; - } - } - default: - return luaL_error(L, "cannot close a %s coroutine", statname[status]); - } -} - - -static const luaL_Reg co_funcs[] = { - {"create", luaB_cocreate}, - {"resume", luaB_coresume}, - {"running", luaB_corunning}, - {"status", luaB_costatus}, - {"wrap", luaB_cowrap}, - {"yield", luaB_yield}, - {"isyieldable", luaB_yieldable}, - {"close", luaB_close}, - {NULL, NULL} -}; - - - -LUAMOD_API int luaopen_coroutine (lua_State *L) { - luaL_newlib(L, co_funcs); - return 1; -} - - - -//path: src/imports/../dependencies/lua/ldblib.c - - -#define ldblib_c -#define LUA_LIB - - - - - -#include -#include -#include - - - - - - - - - - - -static const char *const HOOKKEY = "_HOOKKEY"; - - - -static void checkstack (lua_State *L, lua_State *L1, int n) { - if (l_unlikely(L != L1 && !lua_checkstack(L1, n))) - luaL_error(L, "stack overflow"); -} - - -static int db_getregistry (lua_State *L) { - lua_pushvalue(L, LUA_REGISTRYINDEX); - return 1; -} - - -static int db_getmetatable (lua_State *L) { - luaL_checkany(L, 1); - if (!lua_getmetatable(L, 1)) { - lua_pushnil(L); - } - return 1; -} - - -static int db_setmetatable (lua_State *L) { - int t = lua_type(L, 2); - luaL_argexpected(L, t == LUA_TNIL || t == LUA_TTABLE, 2, "nil or table"); - lua_settop(L, 2); - lua_setmetatable(L, 1); - return 1; -} - - -static int db_getuservalue (lua_State *L) { - int n = (int)luaL_optinteger(L, 2, 1); - if (lua_type(L, 1) != LUA_TUSERDATA) - luaL_pushfail(L); - else if (lua_getiuservalue(L, 1, n) != LUA_TNONE) { - lua_pushboolean(L, 1); - return 2; - } - return 1; -} - - -static int db_setuservalue (lua_State *L) { - int n = (int)luaL_optinteger(L, 3, 1); - luaL_checktype(L, 1, LUA_TUSERDATA); - luaL_checkany(L, 2); - lua_settop(L, 2); - if (!lua_setiuservalue(L, 1, n)) - luaL_pushfail(L); - return 1; -} - - - -static lua_State *getthread (lua_State *L, int *arg) { - if (lua_isthread(L, 1)) { - *arg = 1; - return lua_tothread(L, 1); - } - else { - *arg = 0; - return L; - } -} - - - -static void settabss (lua_State *L, const char *k, const char *v) { - lua_pushstring(L, v); - lua_setfield(L, -2, k); -} - -static void settabsi (lua_State *L, const char *k, int v) { - lua_pushinteger(L, v); - lua_setfield(L, -2, k); -} - -static void settabsb (lua_State *L, const char *k, int v) { - lua_pushboolean(L, v); - lua_setfield(L, -2, k); -} - - - -static void treatstackoption (lua_State *L, lua_State *L1, const char *fname) { - if (L == L1) - lua_rotate(L, -2, 1); - else - lua_xmove(L1, L, 1); - lua_setfield(L, -2, fname); -} - - - -static int db_getinfo (lua_State *L) { - lua_Debug ar; - int arg; - lua_State *L1 = getthread(L, &arg); - const char *options = luaL_optstring(L, arg+2, "flnSrtu"); - checkstack(L, L1, 3); - luaL_argcheck(L, options[0] != '>', arg + 2, "invalid option '>'"); - if (lua_isfunction(L, arg + 1)) { - options = lua_pushfstring(L, ">%s", options); - lua_pushvalue(L, arg + 1); - lua_xmove(L, L1, 1); - } - else { - if (!lua_getstack(L1, (int)luaL_checkinteger(L, arg + 1), &ar)) { - luaL_pushfail(L); - return 1; - } - } - if (!lua_getinfo(L1, options, &ar)) - return luaL_argerror(L, arg+2, "invalid option"); - lua_newtable(L); - if (strchr(options, 'S')) { - lua_pushlstring(L, ar.source, ar.srclen); - lua_setfield(L, -2, "source"); - settabss(L, "short_src", ar.short_src); - settabsi(L, "linedefined", ar.linedefined); - settabsi(L, "lastlinedefined", ar.lastlinedefined); - settabss(L, "what", ar.what); - } - if (strchr(options, 'l')) - settabsi(L, "currentline", ar.currentline); - if (strchr(options, 'u')) { - settabsi(L, "nups", ar.nups); - settabsi(L, "nparams", ar.nparams); - settabsb(L, "isvararg", ar.isvararg); - } - if (strchr(options, 'n')) { - settabss(L, "name", ar.name); - settabss(L, "namewhat", ar.namewhat); - } - if (strchr(options, 'r')) { - settabsi(L, "ftransfer", ar.ftransfer); - settabsi(L, "ntransfer", ar.ntransfer); - } - if (strchr(options, 't')) - settabsb(L, "istailcall", ar.istailcall); - if (strchr(options, 'L')) - treatstackoption(L, L1, "activelines"); - if (strchr(options, 'f')) - treatstackoption(L, L1, "func"); - return 1; -} - - -static int db_getlocal (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - int nvar = (int)luaL_checkinteger(L, arg + 2); - if (lua_isfunction(L, arg + 1)) { - lua_pushvalue(L, arg + 1); - lua_pushstring(L, lua_getlocal(L, NULL, nvar)); - return 1; - } - else { - lua_Debug ar; - const char *name; - int level = (int)luaL_checkinteger(L, arg + 1); - if (l_unlikely(!lua_getstack(L1, level, &ar))) - return luaL_argerror(L, arg+1, "level out of range"); - checkstack(L, L1, 1); - name = lua_getlocal(L1, &ar, nvar); - if (name) { - lua_xmove(L1, L, 1); - lua_pushstring(L, name); - lua_rotate(L, -2, 1); - return 2; - } - else { - luaL_pushfail(L); - return 1; - } - } -} - - -static int db_setlocal (lua_State *L) { - int arg; - const char *name; - lua_State *L1 = getthread(L, &arg); - lua_Debug ar; - int level = (int)luaL_checkinteger(L, arg + 1); - int nvar = (int)luaL_checkinteger(L, arg + 2); - if (l_unlikely(!lua_getstack(L1, level, &ar))) - return luaL_argerror(L, arg+1, "level out of range"); - luaL_checkany(L, arg+3); - lua_settop(L, arg+3); - checkstack(L, L1, 1); - lua_xmove(L, L1, 1); - name = lua_setlocal(L1, &ar, nvar); - if (name == NULL) - lua_pop(L1, 1); - lua_pushstring(L, name); - return 1; -} - - - -static int auxupvalue (lua_State *L, int get) { - const char *name; - int n = (int)luaL_checkinteger(L, 2); - luaL_checktype(L, 1, LUA_TFUNCTION); - name = get ? lua_getupvalue(L, 1, n) : lua_setupvalue(L, 1, n); - if (name == NULL) return 0; - lua_pushstring(L, name); - lua_insert(L, -(get+1)); - return get + 1; -} - - -static int db_getupvalue (lua_State *L) { - return auxupvalue(L, 1); -} - - -static int db_setupvalue (lua_State *L) { - luaL_checkany(L, 3); - return auxupvalue(L, 0); -} - - - -static void *checkupval (lua_State *L, int argf, int argnup, int *pnup) { - void *id; - int nup = (int)luaL_checkinteger(L, argnup); - luaL_checktype(L, argf, LUA_TFUNCTION); - id = lua_upvalueid(L, argf, nup); - if (pnup) { - luaL_argcheck(L, id != NULL, argnup, "invalid upvalue index"); - *pnup = nup; - } - return id; -} - - -static int db_upvalueid (lua_State *L) { - void *id = checkupval(L, 1, 2, NULL); - if (id != NULL) - lua_pushlightuserdata(L, id); - else - luaL_pushfail(L); - return 1; -} - - -static int db_upvaluejoin (lua_State *L) { - int n1, n2; - checkupval(L, 1, 2, &n1); - checkupval(L, 3, 4, &n2); - luaL_argcheck(L, !lua_iscfunction(L, 1), 1, "Lua function expected"); - luaL_argcheck(L, !lua_iscfunction(L, 3), 3, "Lua function expected"); - lua_upvaluejoin(L, 1, n1, 3, n2); - return 0; -} - - - -static void hookf (lua_State *L, lua_Debug *ar) { - static const char *const hooknames[] = - {"call", "return", "line", "count", "tail call"}; - lua_getfield(L, LUA_REGISTRYINDEX, HOOKKEY); - lua_pushthread(L); - if (lua_rawget(L, -2) == LUA_TFUNCTION) { - lua_pushstring(L, hooknames[(int)ar->event]); - if (ar->currentline >= 0) - lua_pushinteger(L, ar->currentline); - else lua_pushnil(L); - lua_assert(lua_getinfo(L, "lS", ar)); - lua_call(L, 2, 0); - } -} - - - -static int makemask (const char *smask, int count) { - int mask = 0; - if (strchr(smask, 'c')) mask |= LUA_MASKCALL; - if (strchr(smask, 'r')) mask |= LUA_MASKRET; - if (strchr(smask, 'l')) mask |= LUA_MASKLINE; - if (count > 0) mask |= LUA_MASKCOUNT; - return mask; -} - - - -static char *unmakemask (int mask, char *smask) { - int i = 0; - if (mask & LUA_MASKCALL) smask[i++] = 'c'; - if (mask & LUA_MASKRET) smask[i++] = 'r'; - if (mask & LUA_MASKLINE) smask[i++] = 'l'; - smask[i] = '\0'; - return smask; -} - - -static int db_sethook (lua_State *L) { - int arg, mask, count; - lua_Hook func; - lua_State *L1 = getthread(L, &arg); - if (lua_isnoneornil(L, arg+1)) { - lua_settop(L, arg+1); - func = NULL; mask = 0; count = 0; - } - else { - const char *smask = luaL_checkstring(L, arg+2); - luaL_checktype(L, arg+1, LUA_TFUNCTION); - count = (int)luaL_optinteger(L, arg + 3, 0); - func = hookf; mask = makemask(smask, count); - } - if (!luaL_getsubtable(L, LUA_REGISTRYINDEX, HOOKKEY)) { - - lua_pushliteral(L, "k"); - lua_setfield(L, -2, "__mode"); - lua_pushvalue(L, -1); - lua_setmetatable(L, -2); - } - checkstack(L, L1, 1); - lua_pushthread(L1); lua_xmove(L1, L, 1); - lua_pushvalue(L, arg + 1); - lua_rawset(L, -3); - lua_sethook(L1, func, mask, count); - return 0; -} - - -static int db_gethook (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - char buff[5]; - int mask = lua_gethookmask(L1); - lua_Hook hook = lua_gethook(L1); - if (hook == NULL) { - luaL_pushfail(L); - return 1; - } - else if (hook != hookf) - lua_pushliteral(L, "external hook"); - else { - lua_getfield(L, LUA_REGISTRYINDEX, HOOKKEY); - checkstack(L, L1, 1); - lua_pushthread(L1); lua_xmove(L1, L, 1); - lua_rawget(L, -2); - lua_remove(L, -2); - } - lua_pushstring(L, unmakemask(mask, buff)); - lua_pushinteger(L, lua_gethookcount(L1)); - return 3; -} - - -static int db_debug (lua_State *L) { - for (;;) { - char buffer[250]; - lua_writestringerror("%s", "lua_debug> "); - if (fgets(buffer, sizeof(buffer), stdin) == NULL || - strcmp(buffer, "cont\n") == 0) - return 0; - if (luaL_loadbuffer(L, buffer, strlen(buffer), "=(debug command)") || - lua_pcall(L, 0, 0, 0)) - lua_writestringerror("%s\n", luaL_tolstring(L, -1, NULL)); - lua_settop(L, 0); - } -} - - -static int db_traceback (lua_State *L) { - int arg; - lua_State *L1 = getthread(L, &arg); - const char *msg = lua_tostring(L, arg + 1); - if (msg == NULL && !lua_isnoneornil(L, arg + 1)) - lua_pushvalue(L, arg + 1); - else { - int level = (int)luaL_optinteger(L, arg + 2, (L == L1) ? 1 : 0); - luaL_traceback(L, L1, msg, level); - } - return 1; -} - - -static const luaL_Reg dblib[] = { - {"debug", db_debug}, - {"getuservalue", db_getuservalue}, - {"gethook", db_gethook}, - {"getinfo", db_getinfo}, - {"getlocal", db_getlocal}, - {"getregistry", db_getregistry}, - {"getmetatable", db_getmetatable}, - {"getupvalue", db_getupvalue}, - {"upvaluejoin", db_upvaluejoin}, - {"upvalueid", db_upvalueid}, - {"setuservalue", db_setuservalue}, - {"sethook", db_sethook}, - {"setlocal", db_setlocal}, - {"setmetatable", db_setmetatable}, - {"setupvalue", db_setupvalue}, - {"traceback", db_traceback}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_debug (lua_State *L) { - luaL_newlib(L, dblib); - return 1; -} - - - -//path: src/imports/../dependencies/lua/liolib.c - - -#define liolib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include -#include -#include - - - - - - - - - - - - - -#if !defined(l_checkmode) - - -#if !defined(L_MODEEXT) -#define L_MODEEXT "b" -#endif - - -static int l_checkmode (const char *mode) { - return (*mode != '\0' && strchr("rwa", *(mode++)) != NULL && - (*mode != '+' || ((void)(++mode), 1)) && - (strspn(mode, L_MODEEXT) == strlen(mode))); -} - -#endif - - - -#if !defined(l_popen) - -#if defined(LUA_USE_POSIX) - -#define l_popen(L,c,m) (fflush(NULL), popen(c,m)) -#define l_pclose(L,file) (pclose(file)) - -#elif defined(LUA_USE_WINDOWS) - -#define l_popen(L,c,m) (_popen(c,m)) -#define l_pclose(L,file) (_pclose(file)) - -#if !defined(l_checkmodep) - -#define l_checkmodep(m) ((m[0] == 'r' || m[0] == 'w') && \ - (m[1] == '\0' || ((m[1] == 'b' || m[1] == 't') && m[2] == '\0'))) -#endif - -#else - - -#define l_popen(L,c,m) \ - ((void)c, (void)m, \ - luaL_error(L, "'popen' not supported"), \ - (FILE*)0) -#define l_pclose(L,file) ((void)L, (void)file, -1) - -#endif - -#endif - - -#if !defined(l_checkmodep) - -#define l_checkmodep(m) ((m[0] == 'r' || m[0] == 'w') && m[1] == '\0') -#endif - - - - -#if !defined(l_getc) - -#if defined(LUA_USE_POSIX) -#define l_getc(f) getc_unlocked(f) -#define l_lockfile(f) flockfile(f) -#define l_unlockfile(f) funlockfile(f) -#else -#define l_getc(f) getc(f) -#define l_lockfile(f) ((void)0) -#define l_unlockfile(f) ((void)0) -#endif - -#endif - - - - -#if !defined(l_fseek) - -#if defined(LUA_USE_POSIX) - -#include - -#define l_fseek(f,o,w) fseeko(f,o,w) -#define l_ftell(f) ftello(f) -#define l_seeknum off_t - -#elif defined(LUA_USE_WINDOWS) && !defined(_CRTIMP_TYPEINFO) \ - && defined(_MSC_VER) && (_MSC_VER >= 1400) - - -#define l_fseek(f,o,w) _fseeki64(f,o,w) -#define l_ftell(f) _ftelli64(f) -#define l_seeknum __int64 - -#else - - -#define l_fseek(f,o,w) fseek(f,o,w) -#define l_ftell(f) ftell(f) -#define l_seeknum long - -#endif - -#endif - - - - - -#define IO_PREFIX "_IO_" -#define IOPREF_LEN (sizeof(IO_PREFIX)/sizeof(char) - 1) -#define IO_INPUT (IO_PREFIX "input") -#define IO_OUTPUT (IO_PREFIX "output") - - -typedef luaL_Stream LStream; - - -#define tolstream(L) ((LStream *)luaL_checkudata(L, 1, LUA_FILEHANDLE)) - -#define isclosed(p) ((p)->closef == NULL) - - -static int io_type (lua_State *L) { - LStream *p; - luaL_checkany(L, 1); - p = (LStream *)luaL_testudata(L, 1, LUA_FILEHANDLE); - if (p == NULL) - luaL_pushfail(L); - else if (isclosed(p)) - lua_pushliteral(L, "closed file"); - else - lua_pushliteral(L, "file"); - return 1; -} - - -static int f_tostring (lua_State *L) { - LStream *p = tolstream(L); - if (isclosed(p)) - lua_pushliteral(L, "file (closed)"); - else - lua_pushfstring(L, "file (%p)", p->f); - return 1; -} - - -static FILE *tofile (lua_State *L) { - LStream *p = tolstream(L); - if (l_unlikely(isclosed(p))) - luaL_error(L, "attempt to use a closed file"); - lua_assert(p->f); - return p->f; -} - - - -static LStream *newprefile (lua_State *L) { - LStream *p = (LStream *)lua_newuserdatauv(L, sizeof(LStream), 0); - p->closef = NULL; - luaL_setmetatable(L, LUA_FILEHANDLE); - return p; -} - - - -static int aux_close (lua_State *L) { - LStream *p = tolstream(L); - volatile lua_CFunction cf = p->closef; - p->closef = NULL; - return (*cf)(L); -} - - -static int f_close (lua_State *L) { - tofile(L); - return aux_close(L); -} - - -static int io_close (lua_State *L) { - if (lua_isnone(L, 1)) - lua_getfield(L, LUA_REGISTRYINDEX, IO_OUTPUT); - return f_close(L); -} - - -static int f_gc (lua_State *L) { - LStream *p = tolstream(L); - if (!isclosed(p) && p->f != NULL) - aux_close(L); - return 0; -} - - - -static int io_fclose (lua_State *L) { - LStream *p = tolstream(L); - int res = fclose(p->f); - return luaL_fileresult(L, (res == 0), NULL); -} - - -static LStream *newfile (lua_State *L) { - LStream *p = newprefile(L); - p->f = NULL; - p->closef = &io_fclose; - return p; -} - - -static void opencheck (lua_State *L, const char *fname, const char *mode) { - LStream *p = newfile(L); - p->f = fopen(fname, mode); - if (l_unlikely(p->f == NULL)) - luaL_error(L, "cannot open file '%s' (%s)", fname, strerror(errno)); -} - - -static int io_open (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - const char *mode = luaL_optstring(L, 2, "r"); - LStream *p = newfile(L); - const char *md = mode; - luaL_argcheck(L, l_checkmode(md), 2, "invalid mode"); - p->f = fopen(filename, mode); - return (p->f == NULL) ? luaL_fileresult(L, 0, filename) : 1; -} - - - -static int io_pclose (lua_State *L) { - LStream *p = tolstream(L); - errno = 0; - return luaL_execresult(L, l_pclose(L, p->f)); -} - - -static int io_popen (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - const char *mode = luaL_optstring(L, 2, "r"); - LStream *p = newprefile(L); - luaL_argcheck(L, l_checkmodep(mode), 2, "invalid mode"); - p->f = l_popen(L, filename, mode); - p->closef = &io_pclose; - return (p->f == NULL) ? luaL_fileresult(L, 0, filename) : 1; -} - - -static int io_tmpfile (lua_State *L) { - LStream *p = newfile(L); - p->f = tmpfile(); - return (p->f == NULL) ? luaL_fileresult(L, 0, NULL) : 1; -} - - -static FILE *getiofile (lua_State *L, const char *findex) { - LStream *p; - lua_getfield(L, LUA_REGISTRYINDEX, findex); - p = (LStream *)lua_touserdata(L, -1); - if (l_unlikely(isclosed(p))) - luaL_error(L, "default %s file is closed", findex + IOPREF_LEN); - return p->f; -} - - -static int g_iofile (lua_State *L, const char *f, const char *mode) { - if (!lua_isnoneornil(L, 1)) { - const char *filename = lua_tostring(L, 1); - if (filename) - opencheck(L, filename, mode); - else { - tofile(L); - lua_pushvalue(L, 1); - } - lua_setfield(L, LUA_REGISTRYINDEX, f); - } - - lua_getfield(L, LUA_REGISTRYINDEX, f); - return 1; -} - - -static int io_input (lua_State *L) { - return g_iofile(L, IO_INPUT, "r"); -} - - -static int io_output (lua_State *L) { - return g_iofile(L, IO_OUTPUT, "w"); -} - - -static int io_readline (lua_State *L); - - - -#define MAXARGLINE 250 - - -static void aux_lines (lua_State *L, int toclose) { - int n = lua_gettop(L) - 1; - luaL_argcheck(L, n <= MAXARGLINE, MAXARGLINE + 2, "too many arguments"); - lua_pushvalue(L, 1); - lua_pushinteger(L, n); - lua_pushboolean(L, toclose); - lua_rotate(L, 2, 3); - lua_pushcclosure(L, io_readline, 3 + n); -} - - -static int f_lines (lua_State *L) { - tofile(L); - aux_lines(L, 0); - return 1; -} - - - -static int io_lines (lua_State *L) { - int toclose; - if (lua_isnone(L, 1)) lua_pushnil(L); - if (lua_isnil(L, 1)) { - lua_getfield(L, LUA_REGISTRYINDEX, IO_INPUT); - lua_replace(L, 1); - tofile(L); - toclose = 0; - } - else { - const char *filename = luaL_checkstring(L, 1); - opencheck(L, filename, "r"); - lua_replace(L, 1); - toclose = 1; - } - aux_lines(L, toclose); - if (toclose) { - lua_pushnil(L); - lua_pushnil(L); - lua_pushvalue(L, 1); - return 4; - } - else - return 1; -} - - - - - - -#if !defined (L_MAXLENNUM) -#define L_MAXLENNUM 200 -#endif - - - -typedef struct { - FILE *f; - int c; - int n; - char buff[L_MAXLENNUM + 1]; -} RN; - - - -static int nextc (RN *rn) { - if (l_unlikely(rn->n >= L_MAXLENNUM)) { - rn->buff[0] = '\0'; - return 0; - } - else { - rn->buff[rn->n++] = rn->c; - rn->c = l_getc(rn->f); - return 1; - } -} - - - -static int test2 (RN *rn, const char *set) { - if (rn->c == set[0] || rn->c == set[1]) - return nextc(rn); - else return 0; -} - - - -static int readdigits (RN *rn, int hex) { - int count = 0; - while ((hex ? isxdigit(rn->c) : isdigit(rn->c)) && nextc(rn)) - count++; - return count; -} - - - -static int read_number (lua_State *L, FILE *f) { - RN rn; - int count = 0; - int hex = 0; - char decp[2]; - rn.f = f; rn.n = 0; - decp[0] = lua_getlocaledecpoint(); - decp[1] = '.'; - l_lockfile(rn.f); - do { rn.c = l_getc(rn.f); } while (isspace(rn.c)); - test2(&rn, "-+"); - if (test2(&rn, "00")) { - if (test2(&rn, "xX")) hex = 1; - else count = 1; - } - count += readdigits(&rn, hex); - if (test2(&rn, decp)) - count += readdigits(&rn, hex); - if (count > 0 && test2(&rn, (hex ? "pP" : "eE"))) { - test2(&rn, "-+"); - readdigits(&rn, 0); - } - ungetc(rn.c, rn.f); - l_unlockfile(rn.f); - rn.buff[rn.n] = '\0'; - if (l_likely(lua_stringtonumber(L, rn.buff))) - return 1; - else { - lua_pushnil(L); - return 0; - } -} - - -static int test_eof (lua_State *L, FILE *f) { - int c = getc(f); - ungetc(c, f); - lua_pushliteral(L, ""); - return (c != EOF); -} - - -static int read_line (lua_State *L, FILE *f, int chop) { - luaL_Buffer b; - int c; - luaL_buffinit(L, &b); - do { - char *buff = luaL_prepbuffer(&b); - int i = 0; - l_lockfile(f); - while (i < LUAL_BUFFERSIZE && (c = l_getc(f)) != EOF && c != '\n') - buff[i++] = c; - l_unlockfile(f); - luaL_addsize(&b, i); - } while (c != EOF && c != '\n'); - if (!chop && c == '\n') - luaL_addchar(&b, c); - luaL_pushresult(&b); - - return (c == '\n' || lua_rawlen(L, -1) > 0); -} - - -static void read_all (lua_State *L, FILE *f) { - size_t nr; - luaL_Buffer b; - luaL_buffinit(L, &b); - do { - char *p = luaL_prepbuffer(&b); - nr = fread(p, sizeof(char), LUAL_BUFFERSIZE, f); - luaL_addsize(&b, nr); - } while (nr == LUAL_BUFFERSIZE); - luaL_pushresult(&b); -} - - -static int read_chars (lua_State *L, FILE *f, size_t n) { - size_t nr; - char *p; - luaL_Buffer b; - luaL_buffinit(L, &b); - p = luaL_prepbuffsize(&b, n); - nr = fread(p, sizeof(char), n, f); - luaL_addsize(&b, nr); - luaL_pushresult(&b); - return (nr > 0); -} - - -static int g_read (lua_State *L, FILE *f, int first) { - int nargs = lua_gettop(L) - 1; - int n, success; - clearerr(f); - if (nargs == 0) { - success = read_line(L, f, 1); - n = first + 1; - } - else { - - luaL_checkstack(L, nargs+LUA_MINSTACK, "too many arguments"); - success = 1; - for (n = first; nargs-- && success; n++) { - if (lua_type(L, n) == LUA_TNUMBER) { - size_t l = (size_t)luaL_checkinteger(L, n); - success = (l == 0) ? test_eof(L, f) : read_chars(L, f, l); - } - else { - const char *p = luaL_checkstring(L, n); - if (*p == '*') p++; - switch (*p) { - case 'n': - success = read_number(L, f); - break; - case 'l': - success = read_line(L, f, 1); - break; - case 'L': - success = read_line(L, f, 0); - break; - case 'a': - read_all(L, f); - success = 1; - break; - default: - return luaL_argerror(L, n, "invalid format"); - } - } - } - } - if (ferror(f)) - return luaL_fileresult(L, 0, NULL); - if (!success) { - lua_pop(L, 1); - luaL_pushfail(L); - } - return n - first; -} - - -static int io_read (lua_State *L) { - return g_read(L, getiofile(L, IO_INPUT), 1); -} - - -static int f_read (lua_State *L) { - return g_read(L, tofile(L), 2); -} - - - -static int io_readline (lua_State *L) { - LStream *p = (LStream *)lua_touserdata(L, lua_upvalueindex(1)); - int i; - int n = (int)lua_tointeger(L, lua_upvalueindex(2)); - if (isclosed(p)) - return luaL_error(L, "file is already closed"); - lua_settop(L , 1); - luaL_checkstack(L, n, "too many arguments"); - for (i = 1; i <= n; i++) - lua_pushvalue(L, lua_upvalueindex(3 + i)); - n = g_read(L, p->f, 2); - lua_assert(n > 0); - if (lua_toboolean(L, -n)) - return n; - else { - if (n > 1) { - - return luaL_error(L, "%s", lua_tostring(L, -n + 1)); - } - if (lua_toboolean(L, lua_upvalueindex(3))) { - lua_settop(L, 0); - lua_pushvalue(L, lua_upvalueindex(1)); - aux_close(L); - } - return 0; - } -} - - - - -static int g_write (lua_State *L, FILE *f, int arg) { - int nargs = lua_gettop(L) - arg; - int status = 1; - for (; nargs--; arg++) { - if (lua_type(L, arg) == LUA_TNUMBER) { - - int len = lua_isinteger(L, arg) - ? fprintf(f, LUA_INTEGER_FMT, - (LUAI_UACINT)lua_tointeger(L, arg)) - : fprintf(f, LUA_NUMBER_FMT, - (LUAI_UACNUMBER)lua_tonumber(L, arg)); - status = status && (len > 0); - } - else { - size_t l; - const char *s = luaL_checklstring(L, arg, &l); - status = status && (fwrite(s, sizeof(char), l, f) == l); - } - } - if (l_likely(status)) - return 1; - else return luaL_fileresult(L, status, NULL); -} - - -static int io_write (lua_State *L) { - return g_write(L, getiofile(L, IO_OUTPUT), 1); -} - - -static int f_write (lua_State *L) { - FILE *f = tofile(L); - lua_pushvalue(L, 1); - return g_write(L, f, 2); -} - - -static int f_seek (lua_State *L) { - static const int mode[] = {SEEK_SET, SEEK_CUR, SEEK_END}; - static const char *const modenames[] = {"set", "cur", "end", NULL}; - FILE *f = tofile(L); - int op = luaL_checkoption(L, 2, "cur", modenames); - lua_Integer p3 = luaL_optinteger(L, 3, 0); - l_seeknum offset = (l_seeknum)p3; - luaL_argcheck(L, (lua_Integer)offset == p3, 3, - "not an integer in proper range"); - op = l_fseek(f, offset, mode[op]); - if (l_unlikely(op)) - return luaL_fileresult(L, 0, NULL); - else { - lua_pushinteger(L, (lua_Integer)l_ftell(f)); - return 1; - } -} - - -static int f_setvbuf (lua_State *L) { - static const int mode[] = {_IONBF, _IOFBF, _IOLBF}; - static const char *const modenames[] = {"no", "full", "line", NULL}; - FILE *f = tofile(L); - int op = luaL_checkoption(L, 2, NULL, modenames); - lua_Integer sz = luaL_optinteger(L, 3, LUAL_BUFFERSIZE); - int res = setvbuf(f, NULL, mode[op], (size_t)sz); - return luaL_fileresult(L, res == 0, NULL); -} - - - -static int io_flush (lua_State *L) { - return luaL_fileresult(L, fflush(getiofile(L, IO_OUTPUT)) == 0, NULL); -} - - -static int f_flush (lua_State *L) { - return luaL_fileresult(L, fflush(tofile(L)) == 0, NULL); -} - - - -static const luaL_Reg iolib[] = { - {"close", io_close}, - {"flush", io_flush}, - {"input", io_input}, - {"lines", io_lines}, - {"open", io_open}, - {"output", io_output}, - {"popen", io_popen}, - {"read", io_read}, - {"tmpfile", io_tmpfile}, - {"type", io_type}, - {"write", io_write}, - {NULL, NULL} -}; - - - -static const luaL_Reg meth[] = { - {"read", f_read}, - {"write", f_write}, - {"lines", f_lines}, - {"flush", f_flush}, - {"seek", f_seek}, - {"close", f_close}, - {"setvbuf", f_setvbuf}, - {NULL, NULL} -}; - - - -static const luaL_Reg metameth[] = { - {"__index", NULL}, - {"__gc", f_gc}, - {"__close", f_gc}, - {"__tostring", f_tostring}, - {NULL, NULL} -}; - - -static void createmeta (lua_State *L) { - luaL_newmetatable(L, LUA_FILEHANDLE); - luaL_setfuncs(L, metameth, 0); - luaL_newlibtable(L, meth); - luaL_setfuncs(L, meth, 0); - lua_setfield(L, -2, "__index"); - lua_pop(L, 1); -} - - - -static int io_noclose (lua_State *L) { - LStream *p = tolstream(L); - p->closef = &io_noclose; - luaL_pushfail(L); - lua_pushliteral(L, "cannot close standard file"); - return 2; -} - - -static void createstdfile (lua_State *L, FILE *f, const char *k, - const char *fname) { - LStream *p = newprefile(L); - p->f = f; - p->closef = &io_noclose; - if (k != NULL) { - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, k); - } - lua_setfield(L, -2, fname); -} - - -LUAMOD_API int luaopen_io (lua_State *L) { - luaL_newlib(L, iolib); - createmeta(L); - - createstdfile(L, stdin, IO_INPUT, "stdin"); - createstdfile(L, stdout, IO_OUTPUT, "stdout"); - createstdfile(L, stderr, NULL, "stderr"); - return 1; -} - - - -//path: src/imports/../dependencies/lua/lmathlib.c - -#define lmathlib_c -#define LUA_LIB - - - - -#include -#include -#include -#include - - - - - - - - - - -#undef PI -#define PI (l_mathop(3.141592653589793238462643383279502884)) - - -static int math_abs (lua_State *L) { - if (lua_isinteger(L, 1)) { - lua_Integer n = lua_tointeger(L, 1); - if (n < 0) n = (lua_Integer)(0u - (lua_Unsigned)n); - lua_pushinteger(L, n); - } - else - lua_pushnumber(L, l_mathop(private_lua_cembed_fabs)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_sin (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_sin)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_cos (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_cos)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_tan (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_tan)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_asin (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_asin)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_acos (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_acos)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_atan (lua_State *L) { - lua_Number y = luaL_checknumber(L, 1); - lua_Number x = luaL_optnumber(L, 2, 1); - lua_pushnumber(L, l_mathop(private_lua_cembed_atan2)(y, x)); - return 1; -} - - -static int math_toint (lua_State *L) { - int valid; - lua_Integer n = lua_tointegerx(L, 1, &valid); - if (l_likely(valid)) - lua_pushinteger(L, n); - else { - luaL_checkany(L, 1); - luaL_pushfail(L); - } - return 1; -} - - -static void pushnumint (lua_State *L, lua_Number d) { - lua_Integer n; - if (lua_numbertointeger(d, &n)) - lua_pushinteger(L, n); - else - lua_pushnumber(L, d); -} - - -static int math_floor (lua_State *L) { - if (lua_isinteger(L, 1)) - lua_settop(L, 1); - else { - lua_Number d = l_mathop(private_lua_embed_floor)(luaL_checknumber(L, 1)); - pushnumint(L, d); - } - return 1; -} - - -static int math_ceil (lua_State *L) { - if (lua_isinteger(L, 1)) - lua_settop(L, 1); - else { - lua_Number d = l_mathop(private_lua_cembed_ceil)(luaL_checknumber(L, 1)); - pushnumint(L, d); - } - return 1; -} - - -static int math_fmod (lua_State *L) { - if (lua_isinteger(L, 1) && lua_isinteger(L, 2)) { - lua_Integer d = lua_tointeger(L, 2); - if ((lua_Unsigned)d + 1u <= 1u) { - luaL_argcheck(L, d != 0, 2, "zero"); - lua_pushinteger(L, 0); - } - else - lua_pushinteger(L, lua_tointeger(L, 1) % d); - } - else - lua_pushnumber(L, l_mathop(private_lua_embed_fmod)(luaL_checknumber(L, 1), - luaL_checknumber(L, 2))); - return 1; -} - - - -static int math_modf (lua_State *L) { - if (lua_isinteger(L ,1)) { - lua_settop(L, 1); - lua_pushnumber(L, 0); - } - else { - lua_Number n = luaL_checknumber(L, 1); - - lua_Number ip = (n < 0) ? l_mathop(private_lua_cembed_ceil)(n) : l_mathop(private_lua_embed_floor)(n); - pushnumint(L, ip); - - lua_pushnumber(L, (n == ip) ? l_mathop(0.0) : (n - ip)); - } - return 2; -} - - -static int math_sqrt (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_sqrt)(luaL_checknumber(L, 1))); - return 1; -} - - -static int math_ult (lua_State *L) { - lua_Integer a = luaL_checkinteger(L, 1); - lua_Integer b = luaL_checkinteger(L, 2); - lua_pushboolean(L, (lua_Unsigned)a < (lua_Unsigned)b); - return 1; -} - -static int math_log (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - lua_Number res; - if (lua_isnoneornil(L, 2)) - res = l_mathop(private_lua_cembed_log)(x); - else { - lua_Number base = luaL_checknumber(L, 2); -#if !defined(LUA_USE_C89) - if (base == l_mathop(2.0)) - res = l_mathop(private_lua_cembed_log2)(x); - else -#endif - if (base == l_mathop(10.0)) - res = l_mathop(private_lua_embed_log10)(x); - else - res = l_mathop(private_lua_cembed_log)(x)/l_mathop(private_lua_cembed_log)(base); - } - lua_pushnumber(L, res); - return 1; -} - -static int math_exp (lua_State *L) { - lua_pushnumber(L, l_mathop(private_lua_cembed_exp)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_deg (lua_State *L) { - lua_pushnumber(L, luaL_checknumber(L, 1) * (l_mathop(180.0) / PI)); - return 1; -} - -static int math_rad (lua_State *L) { - lua_pushnumber(L, luaL_checknumber(L, 1) * (PI / l_mathop(180.0))); - return 1; -} - - -static int math_min (lua_State *L) { - int n = lua_gettop(L); - int imin = 1; - int i; - luaL_argcheck(L, n >= 1, 1, "value expected"); - for (i = 2; i <= n; i++) { - if (lua_compare(L, i, imin, LUA_OPLT)) - imin = i; - } - lua_pushvalue(L, imin); - return 1; -} - - -static int math_max (lua_State *L) { - int n = lua_gettop(L); - int imax = 1; - int i; - luaL_argcheck(L, n >= 1, 1, "value expected"); - for (i = 2; i <= n; i++) { - if (lua_compare(L, imax, i, LUA_OPLT)) - imax = i; - } - lua_pushvalue(L, imax); - return 1; -} - - -static int math_type (lua_State *L) { - if (lua_type(L, 1) == LUA_TNUMBER) - lua_pushstring(L, (lua_isinteger(L, 1)) ? "integer" : "float"); - else { - luaL_checkany(L, 1); - luaL_pushfail(L); - } - return 1; -} - - - - - - - - - -#define FIGS l_floatatt(MANT_DIG) - -#if FIGS > 64 - -#undef FIGS -#define FIGS 64 -#endif - - - -#if !defined(LUA_RAND32) && !defined(Rand64) - - - -#if ((ULONG_MAX >> 31) >> 31) >= 3 - - -#define Rand64 unsigned long -#define SRand64 long - -#elif !defined(LUA_USE_C89) && defined(LLONG_MAX) - - -#define Rand64 unsigned long long -#define SRand64 long long - -#elif ((LUA_MAXUNSIGNED >> 31) >> 31) >= 3 - - -#define Rand64 lua_Unsigned -#define SRand64 lua_Integer - -#endif - -#endif - - -#if defined(Rand64) - - - - -#define trim64(x) ((x) & 0xffffffffffffffffu) - - - -static Rand64 rotl (Rand64 x, int n) { - return (x << n) | (trim64(x) >> (64 - n)); -} - -static Rand64 nextrand (Rand64 *state) { - Rand64 state0 = state[0]; - Rand64 state1 = state[1]; - Rand64 state2 = state[2] ^ state0; - Rand64 state3 = state[3] ^ state1; - Rand64 res = rotl(state1 * 5, 7) * 9; - state[0] = state0 ^ state3; - state[1] = state1 ^ state2; - state[2] = state2 ^ (state1 << 17); - state[3] = rotl(state3, 45); - return res; -} - - - - - -#define shift64_FIG (64 - FIGS) - - -#define scaleFIG (l_mathop(0.5) / ((Rand64)1 << (FIGS - 1))) - -static lua_Number I2d (Rand64 x) { - SRand64 sx = (SRand64)(trim64(x) >> shift64_FIG); - lua_Number res = (lua_Number)(sx) * scaleFIG; - if (sx < 0) - res += l_mathop(1.0); - lua_assert(0 <= res && res < 1); - return res; -} - - -#define I2UInt(x) ((lua_Unsigned)trim64(x)) - - -#define Int2I(x) ((Rand64)(x)) - - -#else - - -#if LUAI_IS32INT -typedef unsigned int lu_int32; -#else -typedef unsigned long lu_int32; -#endif - - - -typedef struct Rand64 { - lu_int32 h; - lu_int32 l; -} Rand64; - - - - - -#define trim32(x) ((x) & 0xffffffffu) - - - - - -static Rand64 packI (lu_int32 h, lu_int32 l) { - Rand64 result; - result.h = h; - result.l = l; - return result; -} - - -static Rand64 Ishl (Rand64 i, int n) { - lua_assert(n > 0 && n < 32); - return packI((i.h << n) | (trim32(i.l) >> (32 - n)), i.l << n); -} - - -static void Ixor (Rand64 *i1, Rand64 i2) { - i1->h ^= i2.h; - i1->l ^= i2.l; -} - - -static Rand64 Iadd (Rand64 i1, Rand64 i2) { - Rand64 result = packI(i1.h + i2.h, i1.l + i2.l); - if (trim32(result.l) < trim32(i1.l)) - result.h++; - return result; -} - - -static Rand64 times5 (Rand64 i) { - return Iadd(Ishl(i, 2), i); -} - - -static Rand64 times9 (Rand64 i) { - return Iadd(Ishl(i, 3), i); -} - - -static Rand64 rotl (Rand64 i, int n) { - lua_assert(n > 0 && n < 32); - return packI((i.h << n) | (trim32(i.l) >> (32 - n)), - (trim32(i.h) >> (32 - n)) | (i.l << n)); -} - - -static Rand64 rotl1 (Rand64 i, int n) { - lua_assert(n > 32 && n < 64); - n = 64 - n; - return packI((trim32(i.h) >> n) | (i.l << (32 - n)), - (i.h << (32 - n)) | (trim32(i.l) >> n)); -} - - -static Rand64 nextrand (Rand64 *state) { - Rand64 res = times9(rotl(times5(state[1]), 7)); - Rand64 t = Ishl(state[1], 17); - Ixor(&state[2], state[0]); - Ixor(&state[3], state[1]); - Ixor(&state[1], state[2]); - Ixor(&state[0], state[3]); - Ixor(&state[2], t); - state[3] = rotl1(state[3], 45); - return res; -} - - - - - -#define UONE ((lu_int32)1) - - -#if FIGS <= 32 - - -#define scaleFIG (l_mathop(0.5) / (UONE << (FIGS - 1))) - - -static lua_Number I2d (Rand64 x) { - lua_Number h = (lua_Number)(trim32(x.h) >> (32 - FIGS)); - return h * scaleFIG; -} - -#else - - -#define scaleFIG \ - (l_mathop(1.0) / (UONE << 30) / l_mathop(8.0) / (UONE << (FIGS - 33))) - - -#define shiftLOW (64 - FIGS) - - -#define shiftHI ((lua_Number)(UONE << (FIGS - 33)) * l_mathop(2.0)) - - -static lua_Number I2d (Rand64 x) { - lua_Number h = (lua_Number)trim32(x.h) * shiftHI; - lua_Number l = (lua_Number)(trim32(x.l) >> shiftLOW); - return (h + l) * scaleFIG; -} - -#endif - - - -static lua_Unsigned I2UInt (Rand64 x) { - return (((lua_Unsigned)trim32(x.h) << 31) << 1) | (lua_Unsigned)trim32(x.l); -} - - -static Rand64 Int2I (lua_Unsigned n) { - return packI((lu_int32)((n >> 31) >> 1), (lu_int32)n); -} - -#endif - - - -typedef struct { - Rand64 s[4]; -} RanState; - - - -static lua_Unsigned project (lua_Unsigned ran, lua_Unsigned n, - RanState *state) { - if ((n & (n + 1)) == 0) - return ran & n; - else { - lua_Unsigned lim = n; - - lim |= (lim >> 1); - lim |= (lim >> 2); - lim |= (lim >> 4); - lim |= (lim >> 8); - lim |= (lim >> 16); -#if (LUA_MAXUNSIGNED >> 31) >= 3 - lim |= (lim >> 32); -#endif - lua_assert((lim & (lim + 1)) == 0 - && lim >= n - && (lim >> 1) < n); - while ((ran &= lim) > n) - ran = I2UInt(nextrand(state->s)); - return ran; - } -} - - -static int math_random (lua_State *L) { - lua_Integer low, up; - lua_Unsigned p; - RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1)); - Rand64 rv = nextrand(state->s); - switch (lua_gettop(L)) { - case 0: { - lua_pushnumber(L, I2d(rv)); - return 1; - } - case 1: { - low = 1; - up = luaL_checkinteger(L, 1); - if (up == 0) { - lua_pushinteger(L, I2UInt(rv)); - return 1; - } - break; - } - case 2: { - low = luaL_checkinteger(L, 1); - up = luaL_checkinteger(L, 2); - break; - } - default: return luaL_error(L, "wrong number of arguments"); - } - - luaL_argcheck(L, low <= up, 1, "interval is empty"); - - p = project(I2UInt(rv), (lua_Unsigned)up - (lua_Unsigned)low, state); - lua_pushinteger(L, p + (lua_Unsigned)low); - return 1; -} - - -static void setseed (lua_State *L, Rand64 *state, - lua_Unsigned n1, lua_Unsigned n2) { - int i; - state[0] = Int2I(n1); - state[1] = Int2I(0xff); - state[2] = Int2I(n2); - state[3] = Int2I(0); - for (i = 0; i < 16; i++) - nextrand(state); - lua_pushinteger(L, n1); - lua_pushinteger(L, n2); -} - - -static int math_randomseed (lua_State *L) { - RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1)); - lua_Unsigned n1, n2; - if (lua_isnone(L, 1)) { - n1 = luaL_makeseed(L); - n2 = I2UInt(nextrand(state->s)); - } - else { - n1 = luaL_checkinteger(L, 1); - n2 = luaL_optinteger(L, 2, 0); - } - setseed(L, state->s, n1, n2); - return 2; -} - - -static const luaL_Reg randfuncs[] = { - {"random", math_random}, - {"randomseed", math_randomseed}, - {NULL, NULL} -}; - - - -static void setrandfunc (lua_State *L) { - RanState *state = (RanState *)lua_newuserdatauv(L, sizeof(RanState), 0); - setseed(L, state->s, luaL_makeseed(L), 0); - lua_pop(L, 2); - luaL_setfuncs(L, randfuncs, 1); -} - - - - - -#if defined(LUA_COMPAT_MATHLIB) - -static int math_cosh (lua_State *L) { - lua_pushnumber(L, l_mathop(cosh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_sinh (lua_State *L) { - lua_pushnumber(L, l_mathop(sinh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_tanh (lua_State *L) { - lua_pushnumber(L, l_mathop(tanh)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_pow (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - lua_Number y = luaL_checknumber(L, 2); - lua_pushnumber(L, l_mathop(pow)(x, y)); - return 1; -} - -static int math_frexp (lua_State *L) { - int e; - lua_pushnumber(L, l_mathop(frexp)(luaL_checknumber(L, 1), &e)); - lua_pushinteger(L, e); - return 2; -} - -static int math_ldexp (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - int ep = (int)luaL_checkinteger(L, 2); - lua_pushnumber(L, l_mathop(ldexp)(x, ep)); - return 1; -} - -static int math_log10 (lua_State *L) { - lua_pushnumber(L, l_mathop(log10)(luaL_checknumber(L, 1))); - return 1; -} - -#endif - - - - -static const luaL_Reg mathlib[] = { - {"abs", math_abs}, - {"acos", math_acos}, - {"asin", math_asin}, - {"atan", math_atan}, - {"ceil", math_ceil}, - {"cos", math_cos}, - {"deg", math_deg}, - {"exp", math_exp}, - {"tointeger", math_toint}, - {"floor", math_floor}, - {"fmod", math_fmod}, - {"ult", math_ult}, - {"log", math_log}, - {"max", math_max}, - {"min", math_min}, - {"modf", math_modf}, - {"rad", math_rad}, - {"sin", math_sin}, - {"sqrt", math_sqrt}, - {"tan", math_tan}, - {"type", math_type}, -#if defined(LUA_COMPAT_MATHLIB) - {"atan2", math_atan}, - {"cosh", math_cosh}, - {"sinh", math_sinh}, - {"tanh", math_tanh}, - {"pow", math_pow}, - {"frexp", math_frexp}, - {"ldexp", math_ldexp}, - {"log10", math_log10}, -#endif - - {"random", NULL}, - {"randomseed", NULL}, - {"pi", NULL}, - {"huge", NULL}, - {"maxinteger", NULL}, - {"mininteger", NULL}, - {NULL, NULL} -}; - - - -LUAMOD_API int luaopen_math (lua_State *L) { - luaL_newlib(L, mathlib); - lua_pushnumber(L, PI); - lua_setfield(L, -2, "pi"); - lua_pushnumber(L, (lua_Number)HUGE_VAL); - lua_setfield(L, -2, "huge"); - lua_pushinteger(L, LUA_MAXINTEGER); - lua_setfield(L, -2, "maxinteger"); - lua_pushinteger(L, LUA_MININTEGER); - lua_setfield(L, -2, "mininteger"); - setrandfunc(L); - return 1; -} - - - -//path: src/imports/../dependencies/lua/loadlib.c - - -#define loadlib_c -#define LUA_LIB - - - - - -#include -#include -#include - - - - - - - - - - - -#if !defined(LUA_CSUBSEP) -#define LUA_CSUBSEP LUA_DIRSEP -#endif - -#if !defined(LUA_LSUBSEP) -#define LUA_LSUBSEP LUA_DIRSEP -#endif - - - -#define LUA_POF "luaopen_" - - -#define LUA_OFSEP "_" - - - -static const char *const CLIBS = "_CLIBS"; - -#define LIB_FAIL "open" - - -#define setprogdir(L) ((void)0) - - - -typedef void (*voidf)(void); - - - - - -static void lsys_unloadlib (void *lib); - - -static void *lsys_load (lua_State *L, const char *path, int seeglb); - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym); - - - - -#if defined(LUA_USE_DLOPEN) - - -#include - - -#if defined(__GNUC__) -#define cast_func(p) (__extension__ (lua_CFunction)(p)) -#else -#define cast_func(p) ((lua_CFunction)(p)) -#endif - - -static void lsys_unloadlib (void *lib) { - dlclose(lib); -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - void *lib = dlopen(path, RTLD_NOW | (seeglb ? RTLD_GLOBAL : RTLD_LOCAL)); - if (l_unlikely(lib == NULL)) - lua_pushstring(L, dlerror()); - return lib; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - lua_CFunction f = cast_func(dlsym(lib, sym)); - if (l_unlikely(f == NULL)) - lua_pushstring(L, dlerror()); - return f; -} - - - - - -#elif defined(LUA_DL_DLL) - - -#include - - - -#if !defined(LUA_LLE_FLAGS) -#define LUA_LLE_FLAGS 0 -#endif - - -#undef setprogdir - - - -static void setprogdir (lua_State *L) { - char buff[MAX_PATH + 1]; - char *lb; - DWORD nsize = sizeof(buff)/sizeof(char); - DWORD n = GetModuleFileNameA(NULL, buff, nsize); - if (n == 0 || n == nsize || (lb = strrchr(buff, '\\')) == NULL) - luaL_error(L, "unable to get ModuleFileName"); - else { - *lb = '\0'; - luaL_gsub(L, lua_tostring(L, -1), LUA_EXEC_DIR, buff); - lua_remove(L, -2); - } -} - - - - -static void pusherror (lua_State *L) { - int error = GetLastError(); - char buffer[128]; - if (FormatMessageA(FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM, - NULL, error, 0, buffer, sizeof(buffer)/sizeof(char), NULL)) - lua_pushstring(L, buffer); - else - lua_pushfstring(L, "system error %d\n", error); -} - -static void lsys_unloadlib (void *lib) { - FreeLibrary((HMODULE)lib); -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - HMODULE lib = LoadLibraryExA(path, NULL, LUA_LLE_FLAGS); - (void)(seeglb); - if (lib == NULL) pusherror(L); - return lib; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - lua_CFunction f = (lua_CFunction)(voidf)GetProcAddress((HMODULE)lib, sym); - if (f == NULL) pusherror(L); - return f; -} - - - - -#else - - -#undef LIB_FAIL -#define LIB_FAIL "absent" - - -#define DLMSG "dynamic libraries not enabled; check your Lua installation" - - -static void lsys_unloadlib (void *lib) { - (void)(lib); -} - - -static void *lsys_load (lua_State *L, const char *path, int seeglb) { - (void)(path); (void)(seeglb); - lua_pushliteral(L, DLMSG); - return NULL; -} - - -static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { - (void)(lib); (void)(sym); - lua_pushliteral(L, DLMSG); - return NULL; -} - - -#endif - - - - - -#if !defined(LUA_PATH_VAR) -#define LUA_PATH_VAR "LUA_PATH" -#endif - -#if !defined(LUA_CPATH_VAR) -#define LUA_CPATH_VAR "LUA_CPATH" -#endif - - - - -static int noenv (lua_State *L) { - int b; - lua_getfield(L, LUA_REGISTRYINDEX, "LUA_NOENV"); - b = lua_toboolean(L, -1); - lua_pop(L, 1); - return b; -} - - - -static void setpath (lua_State *L, const char *fieldname, - const char *envname, - const char *dft) { - const char *dftmark; - const char *nver = lua_pushfstring(L, "%s%s", envname, LUA_VERSUFFIX); - const char *path = getenv(nver); - if (path == NULL) - path = getenv(envname); - if (path == NULL || noenv(L)) - lua_pushextlstring(L, dft, strlen(dft), NULL, NULL); - else if ((dftmark = strstr(path, LUA_PATH_SEP LUA_PATH_SEP)) == NULL) - lua_pushstring(L, path); - else { - size_t len = strlen(path); - luaL_Buffer b; - luaL_buffinit(L, &b); - if (path < dftmark) { - luaL_addlstring(&b, path, dftmark - path); - luaL_addchar(&b, *LUA_PATH_SEP); - } - luaL_addstring(&b, dft); - if (dftmark < path + len - 2) { - luaL_addchar(&b, *LUA_PATH_SEP); - luaL_addlstring(&b, dftmark + 2, (path + len - 2) - dftmark); - } - luaL_pushresult(&b); - } - setprogdir(L); - lua_setfield(L, -3, fieldname); - lua_pop(L, 1); -} - - - - - -static void *checkclib (lua_State *L, const char *path) { - void *plib; - lua_getfield(L, LUA_REGISTRYINDEX, CLIBS); - lua_getfield(L, -1, path); - plib = lua_touserdata(L, -1); - lua_pop(L, 2); - return plib; -} - - - -static void addtoclib (lua_State *L, const char *path, void *plib) { - lua_getfield(L, LUA_REGISTRYINDEX, CLIBS); - lua_pushlightuserdata(L, plib); - lua_pushvalue(L, -1); - lua_setfield(L, -3, path); - lua_rawseti(L, -2, luaL_len(L, -2) + 1); - lua_pop(L, 1); -} - - - -static int gctm (lua_State *L) { - lua_Integer n = luaL_len(L, 1); - for (; n >= 1; n--) { - lua_rawgeti(L, 1, n); - lsys_unloadlib(lua_touserdata(L, -1)); - lua_pop(L, 1); - } - return 0; -} - - - - -#define ERRLIB 1 -#define ERRFUNC 2 - - -static int lookforfunc (lua_State *L, const char *path, const char *sym) { - void *reg = checkclib(L, path); - if (reg == NULL) { - reg = lsys_load(L, path, *sym == '*'); - if (reg == NULL) return ERRLIB; - addtoclib(L, path, reg); - } - if (*sym == '*') { - lua_pushboolean(L, 1); - return 0; - } - else { - lua_CFunction f = lsys_sym(L, reg, sym); - if (f == NULL) - return ERRFUNC; - lua_pushcfunction(L, f); - return 0; - } -} - - -static int ll_loadlib (lua_State *L) { - const char *path = luaL_checkstring(L, 1); - const char *init = luaL_checkstring(L, 2); - int stat = lookforfunc(L, path, init); - if (l_likely(stat == 0)) - return 1; - else { - luaL_pushfail(L); - lua_insert(L, -2); - lua_pushstring(L, (stat == ERRLIB) ? LIB_FAIL : "init"); - return 3; - } -} - - - - - - -static int readable (const char *filename) { - FILE *f = fopen(filename, "r"); - if (f == NULL) return 0; - fclose(f); - return 1; -} - - - -static const char *getnextfilename (char **path, char *end) { - char *sep; - char *name = *path; - if (name == end) - return NULL; - else if (*name == '\0') { - *name = *LUA_PATH_SEP; - name++; - } - sep = strchr(name, *LUA_PATH_SEP); - if (sep == NULL) - sep = end; - *sep = '\0'; - *path = sep; - return name; -} - - - -static void pusherrornotfound (lua_State *L, const char *path) { - luaL_Buffer b; - luaL_buffinit(L, &b); - luaL_addstring(&b, "no file '"); - luaL_addgsub(&b, path, LUA_PATH_SEP, "'\n\tno file '"); - luaL_addstring(&b, "'"); - luaL_pushresult(&b); -} - - -static const char *searchpath (lua_State *L, const char *name, - const char *path, - const char *sep, - const char *dirsep) { - luaL_Buffer buff; - char *pathname; - char *endpathname; - const char *filename; - - if (*sep != '\0' && strchr(name, *sep) != NULL) - name = luaL_gsub(L, name, sep, dirsep); - luaL_buffinit(L, &buff); - - luaL_addgsub(&buff, path, LUA_PATH_MARK, name); - luaL_addchar(&buff, '\0'); - pathname = luaL_buffaddr(&buff); - endpathname = pathname + luaL_bufflen(&buff) - 1; - while ((filename = getnextfilename(&pathname, endpathname)) != NULL) { - if (readable(filename)) - return lua_pushstring(L, filename); - } - luaL_pushresult(&buff); - pusherrornotfound(L, lua_tostring(L, -1)); - return NULL; -} - - -static int ll_searchpath (lua_State *L) { - const char *f = searchpath(L, luaL_checkstring(L, 1), - luaL_checkstring(L, 2), - luaL_optstring(L, 3, "."), - luaL_optstring(L, 4, LUA_DIRSEP)); - if (f != NULL) return 1; - else { - luaL_pushfail(L); - lua_insert(L, -2); - return 2; - } -} - - -static const char *findfile (lua_State *L, const char *name, - const char *pname, - const char *dirsep) { - const char *path; - lua_getfield(L, lua_upvalueindex(1), pname); - path = lua_tostring(L, -1); - if (l_unlikely(path == NULL)) - luaL_error(L, "'package.%s' must be a string", pname); - return searchpath(L, name, path, ".", dirsep); -} - - -static int checkload (lua_State *L, int stat, const char *filename) { - if (l_likely(stat)) { - lua_pushstring(L, filename); - return 2; - } - else - return luaL_error(L, "error loading module '%s' from file '%s':\n\t%s", - lua_tostring(L, 1), filename, lua_tostring(L, -1)); -} - - -static int searcher_Lua (lua_State *L) { - const char *filename; - const char *name = luaL_checkstring(L, 1); - filename = findfile(L, name, "path", LUA_LSUBSEP); - if (filename == NULL) return 1; - return checkload(L, (luaL_loadfile(L, filename) == LUA_OK), filename); -} - - - -static int loadfunc (lua_State *L, const char *filename, const char *modname) { - const char *openfunc; - const char *mark; - modname = luaL_gsub(L, modname, ".", LUA_OFSEP); - mark = strchr(modname, *LUA_IGMARK); - if (mark) { - int stat; - openfunc = lua_pushlstring(L, modname, mark - modname); - openfunc = lua_pushfstring(L, LUA_POF"%s", openfunc); - stat = lookforfunc(L, filename, openfunc); - if (stat != ERRFUNC) return stat; - modname = mark + 1; - } - openfunc = lua_pushfstring(L, LUA_POF"%s", modname); - return lookforfunc(L, filename, openfunc); -} - - -static int searcher_C (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - const char *filename = findfile(L, name, "cpath", LUA_CSUBSEP); - if (filename == NULL) return 1; - return checkload(L, (loadfunc(L, filename, name) == 0), filename); -} - - -static int searcher_Croot (lua_State *L) { - const char *filename; - const char *name = luaL_checkstring(L, 1); - const char *p = strchr(name, '.'); - int stat; - if (p == NULL) return 0; - lua_pushlstring(L, name, p - name); - filename = findfile(L, lua_tostring(L, -1), "cpath", LUA_CSUBSEP); - if (filename == NULL) return 1; - if ((stat = loadfunc(L, filename, name)) != 0) { - if (stat != ERRFUNC) - return checkload(L, 0, filename); - else { - lua_pushfstring(L, "no module '%s' in file '%s'", name, filename); - return 1; - } - } - lua_pushstring(L, filename); - return 2; -} - - -static int searcher_preload (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - lua_getfield(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - if (lua_getfield(L, -1, name) == LUA_TNIL) { - lua_pushfstring(L, "no field package.preload['%s']", name); - return 1; - } - else { - lua_pushliteral(L, ":preload:"); - return 2; - } -} - - -static void findloader (lua_State *L, const char *name) { - int i; - luaL_Buffer msg; - - if (l_unlikely(lua_getfield(L, lua_upvalueindex(1), "searchers") - != LUA_TTABLE)) - luaL_error(L, "'package.searchers' must be a table"); - luaL_buffinit(L, &msg); - - for (i = 1; ; i++) { - luaL_addstring(&msg, "\n\t"); - if (l_unlikely(lua_rawgeti(L, 3, i) == LUA_TNIL)) { - lua_pop(L, 1); - luaL_buffsub(&msg, 2); - luaL_pushresult(&msg); - luaL_error(L, "module '%s' not found:%s", name, lua_tostring(L, -1)); - } - lua_pushstring(L, name); - lua_call(L, 1, 2); - if (lua_isfunction(L, -2)) - return; - else if (lua_isstring(L, -2)) { - lua_pop(L, 1); - luaL_addvalue(&msg); - } - else { - lua_pop(L, 2); - luaL_buffsub(&msg, 2); - } - } -} - - -static int ll_require (lua_State *L) { - const char *name = luaL_checkstring(L, 1); - lua_settop(L, 1); - lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_getfield(L, 2, name); - if (lua_toboolean(L, -1)) - return 1; - - lua_pop(L, 1); - findloader(L, name); - lua_rotate(L, -2, 1); - lua_pushvalue(L, 1); - lua_pushvalue(L, -3); - - lua_call(L, 2, 1); - - if (!lua_isnil(L, -1)) - lua_setfield(L, 2, name); - else - lua_pop(L, 1); - if (lua_getfield(L, 2, name) == LUA_TNIL) { - lua_pushboolean(L, 1); - lua_copy(L, -1, -2); - lua_setfield(L, 2, name); - } - lua_rotate(L, -2, 1); - return 2; -} - - - - - - -static const luaL_Reg pk_funcs[] = { - {"loadlib", ll_loadlib}, - {"searchpath", ll_searchpath}, - - {"preload", NULL}, - {"cpath", NULL}, - {"path", NULL}, - {"searchers", NULL}, - {"loaded", NULL}, - {NULL, NULL} -}; - - -static const luaL_Reg ll_funcs[] = { - {"require", ll_require}, - {NULL, NULL} -}; - - -static void createsearcherstable (lua_State *L) { - static const lua_CFunction searchers[] = { - searcher_preload, - searcher_Lua, - searcher_C, - searcher_Croot, - NULL - }; - int i; - - lua_createtable(L, sizeof(searchers)/sizeof(searchers[0]) - 1, 0); - - for (i=0; searchers[i] != NULL; i++) { - lua_pushvalue(L, -2); - lua_pushcclosure(L, searchers[i], 1); - lua_rawseti(L, -2, i+1); - } - lua_setfield(L, -2, "searchers"); -} - - - -static void createclibstable (lua_State *L) { - luaL_getsubtable(L, LUA_REGISTRYINDEX, CLIBS); - lua_createtable(L, 0, 1); - lua_pushcfunction(L, gctm); - lua_setfield(L, -2, "__gc"); - lua_setmetatable(L, -2); -} - - -LUAMOD_API int luaopen_package (lua_State *L) { - createclibstable(L); - luaL_newlib(L, pk_funcs); - createsearcherstable(L); - - setpath(L, "path", LUA_PATH_VAR, LUA_PATH_DEFAULT); - setpath(L, "cpath", LUA_CPATH_VAR, LUA_CPATH_DEFAULT); - - lua_pushliteral(L, LUA_DIRSEP "\n" LUA_PATH_SEP "\n" LUA_PATH_MARK "\n" - LUA_EXEC_DIR "\n" LUA_IGMARK "\n"); - lua_setfield(L, -2, "config"); - - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - lua_setfield(L, -2, "loaded"); - - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - lua_setfield(L, -2, "preload"); - lua_pushglobaltable(L); - lua_pushvalue(L, -2); - luaL_setfuncs(L, ll_funcs, 1); - lua_pop(L, 1); - return 1; -} - - - -//path: src/imports/../dependencies/lua/loslib.c - - -#define loslib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include -#include - - - - - - - - - - - -#if !defined(LUA_STRFTIMEOPTIONS) - -#if defined(LUA_USE_WINDOWS) -#define LUA_STRFTIMEOPTIONS "aAbBcdHIjmMpSUwWxXyYzZ%" \ - "||" "#c#x#d#H#I#j#m#M#S#U#w#W#y#Y" -#elif defined(LUA_USE_C89) -#define LUA_STRFTIMEOPTIONS "aAbBcdHIjmMpSUwWxXyYZ%" -#else -#define LUA_STRFTIMEOPTIONS "aAbBcCdDeFgGhHIjmMnprRStTuUVwWxXyYzZ%" \ - "||" "EcECExEXEyEY" "OdOeOHOIOmOMOSOuOUOVOwOWOy" -#endif - -#endif - - - - - - -#if !defined(LUA_NUMTIME) - -#define l_timet lua_Integer -#define l_pushtime(L,t) lua_pushinteger(L,(lua_Integer)(t)) -#define l_gettime(L,arg) luaL_checkinteger(L, arg) - -#else - -#define l_timet lua_Number -#define l_pushtime(L,t) lua_pushnumber(L,(lua_Number)(t)) -#define l_gettime(L,arg) luaL_checknumber(L, arg) - -#endif - - -#if !defined(l_gmtime) - - -#if defined(LUA_USE_POSIX) - -#define l_gmtime(t,r) gmtime_r(t,r) -#define l_localtime(t,r) localtime_r(t,r) - -#else - - -#define l_gmtime(t,r) ((void)(r)->tm_sec, gmtime(t)) -#define l_localtime(t,r) ((void)(r)->tm_sec, localtime(t)) - -#endif - -#endif - - - - - -#if !defined(lua_tmpnam) - -#if defined(LUA_USE_POSIX) - -#include - -#define LUA_TMPNAMBUFSIZE 32 - -#if !defined(LUA_TMPNAMTEMPLATE) -#define LUA_TMPNAMTEMPLATE "/tmp/lua_XXXXXX" -#endif - -#define lua_tmpnam(b,e) { \ - strcpy(b, LUA_TMPNAMTEMPLATE); \ - e = mkstemp(b); \ - if (e != -1) close(e); \ - e = (e == -1); } - -#else - - -#define LUA_TMPNAMBUFSIZE L_tmpnam -#define lua_tmpnam(b,e) { e = (tmpnam(b) == NULL); } - -#endif - -#endif - - - -#if !defined(l_system) -#if defined(LUA_USE_IOS) - -#define l_system(cmd) ((cmd) == NULL ? 0 : -1) -#else -#define l_system(cmd) system(cmd) -#endif -#endif - - -static int os_execute (lua_State *L) { - const char *cmd = luaL_optstring(L, 1, NULL); - int stat; - errno = 0; - stat = l_system(cmd); - if (cmd != NULL) - return luaL_execresult(L, stat); - else { - lua_pushboolean(L, stat); - return 1; - } -} - - -static int os_remove (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - return luaL_fileresult(L, remove(filename) == 0, filename); -} - - -static int os_rename (lua_State *L) { - const char *fromname = luaL_checkstring(L, 1); - const char *toname = luaL_checkstring(L, 2); - return luaL_fileresult(L, rename(fromname, toname) == 0, NULL); -} -#ifdef __linux -static int os_tmpname(lua_State *L) { - char buff[100]; - const char *tmpdir = "/tmp/lua_XXXXXX"; - int fd = mkstemp(buff); - if (fd == -1) { - return luaL_error(L, "unable to generate a unique filename"); - } - - close(fd); - lua_pushstring(L, buff); - return 1; -} -#endif -#ifdef _WIN32 - -static int os_tmpname(lua_State *L) { - char buff[100] = {0}; - const char *template_file = "lua_XXXXXX"; - - GetTempPathA(sizeof(buff), buff); - - UINT fd = GetTempFileNameA(buff, template_file, 0, buff); - if (fd == -1) { - return luaL_error(L, "unable to generate a unique filename"); - } - lua_pushstring(L, buff); - return 1; -} -#endif -static int os_getenv (lua_State *L) { - lua_pushstring(L, getenv(luaL_checkstring(L, 1))); - return 1; -} - - -static int os_clock (lua_State *L) { - lua_pushnumber(L, ((lua_Number)clock())/(lua_Number)CLOCKS_PER_SEC); - return 1; -} - - - - - -static void setfield (lua_State *L, const char *key, int value, int delta) { - #if (defined(LUA_NUMTIME) && LUA_MAXINTEGER <= INT_MAX) - if (l_unlikely(value > LUA_MAXINTEGER - delta)) - luaL_error(L, "field '%s' is out-of-bound", key); - #endif - lua_pushinteger(L, (lua_Integer)value + delta); - lua_setfield(L, -2, key); -} - - -static void setboolfield (lua_State *L, const char *key, int value) { - if (value < 0) - return; - lua_pushboolean(L, value); - lua_setfield(L, -2, key); -} - - - -static void setallfields (lua_State *L, struct tm *stm) { - setfield(L, "year", stm->tm_year, 1900); - setfield(L, "month", stm->tm_mon, 1); - setfield(L, "day", stm->tm_mday, 0); - setfield(L, "hour", stm->tm_hour, 0); - setfield(L, "min", stm->tm_min, 0); - setfield(L, "sec", stm->tm_sec, 0); - setfield(L, "yday", stm->tm_yday, 1); - setfield(L, "wday", stm->tm_wday, 1); - setboolfield(L, "isdst", stm->tm_isdst); -} - - -static int getboolfield (lua_State *L, const char *key) { - int res; - res = (lua_getfield(L, -1, key) == LUA_TNIL) ? -1 : lua_toboolean(L, -1); - lua_pop(L, 1); - return res; -} - - -static int getfield (lua_State *L, const char *key, int d, int delta) { - int isnum; - int t = lua_getfield(L, -1, key); - lua_Integer res = lua_tointegerx(L, -1, &isnum); - if (!isnum) { - if (l_unlikely(t != LUA_TNIL)) - return luaL_error(L, "field '%s' is not an integer", key); - else if (l_unlikely(d < 0)) - return luaL_error(L, "field '%s' missing in date table", key); - res = d; - } - else { - if (!(res >= 0 ? res - delta <= INT_MAX : INT_MIN + delta <= res)) - return luaL_error(L, "field '%s' is out-of-bound", key); - res -= delta; - } - lua_pop(L, 1); - return (int)res; -} - - -static const char *checkoption (lua_State *L, const char *conv, - ptrdiff_t convlen, char *buff) { - const char *option = LUA_STRFTIMEOPTIONS; - int oplen = 1; - for (; *option != '\0' && oplen <= convlen; option += oplen) { - if (*option == '|') - oplen++; - else if (memcmp(conv, option, oplen) == 0) { - memcpy(buff, conv, oplen); - buff[oplen] = '\0'; - return conv + oplen; - } - } - luaL_argerror(L, 1, - lua_pushfstring(L, "invalid conversion specifier '%%%s'", conv)); - return conv; -} - - -static time_t l_checktime (lua_State *L, int arg) { - l_timet t = l_gettime(L, arg); - luaL_argcheck(L, (time_t)t == t, arg, "time out-of-bounds"); - return (time_t)t; -} - - - -#define SIZETIMEFMT 250 - - -static int os_date (lua_State *L) { - size_t slen; - const char *s = luaL_optlstring(L, 1, "%c", &slen); - time_t t = luaL_opt(L, l_checktime, 2, time(NULL)); - const char *se = s + slen; - struct tm tmr, *stm; - if (*s == '!') { - stm = l_gmtime(&t, &tmr); - s++; - } - else - stm = l_localtime(&t, &tmr); - if (stm == NULL) - return luaL_error(L, - "date result cannot be represented in this installation"); - if (strcmp(s, "*t") == 0) { - lua_createtable(L, 0, 9); - setallfields(L, stm); - } - else { - char cc[4]; - luaL_Buffer b; - cc[0] = '%'; - luaL_buffinit(L, &b); - while (s < se) { - if (*s != '%') - luaL_addchar(&b, *s++); - else { - size_t reslen; - char *buff = luaL_prepbuffsize(&b, SIZETIMEFMT); - s++; - s = checkoption(L, s, se - s, cc + 1); - reslen = strftime(buff, SIZETIMEFMT, cc, stm); - luaL_addsize(&b, reslen); - } - } - luaL_pushresult(&b); - } - return 1; -} - - -static int os_time (lua_State *L) { - time_t t; - if (lua_isnoneornil(L, 1)) - t = time(NULL); - else { - struct tm ts; - luaL_checktype(L, 1, LUA_TTABLE); - lua_settop(L, 1); - ts.tm_year = getfield(L, "year", -1, 1900); - ts.tm_mon = getfield(L, "month", -1, 1); - ts.tm_mday = getfield(L, "day", -1, 0); - ts.tm_hour = getfield(L, "hour", 12, 0); - ts.tm_min = getfield(L, "min", 0, 0); - ts.tm_sec = getfield(L, "sec", 0, 0); - ts.tm_isdst = getboolfield(L, "isdst"); - t = mktime(&ts); - setallfields(L, &ts); - } - if (t != (time_t)(l_timet)t || t == (time_t)(-1)) - return luaL_error(L, - "time result cannot be represented in this installation"); - l_pushtime(L, t); - return 1; -} - - -static int os_difftime (lua_State *L) { - time_t t1 = l_checktime(L, 1); - time_t t2 = l_checktime(L, 2); - lua_pushnumber(L, (lua_Number)difftime(t1, t2)); - return 1; -} - - - - -static int os_setlocale (lua_State *L) { - static const int cat[] = {LC_ALL, LC_COLLATE, LC_CTYPE, LC_MONETARY, - LC_NUMERIC, LC_TIME}; - static const char *const catnames[] = {"all", "collate", "ctype", "monetary", - "numeric", "time", NULL}; - const char *l = luaL_optstring(L, 1, NULL); - int op = luaL_checkoption(L, 2, "all", catnames); - lua_pushstring(L, setlocale(cat[op], l)); - return 1; -} - - -static int os_exit (lua_State *L) { - int status; - if (lua_isboolean(L, 1)) - status = (lua_toboolean(L, 1) ? EXIT_SUCCESS : EXIT_FAILURE); - else - status = (int)luaL_optinteger(L, 1, EXIT_SUCCESS); - if (lua_toboolean(L, 2)) - lua_close(L); - if (L) exit(status); - return 0; -} - - -static const luaL_Reg syslib[] = { - {"clock", os_clock}, - {"date", os_date}, - {"difftime", os_difftime}, - {"execute", os_execute}, - {"exit", os_exit}, - {"getenv", os_getenv}, - {"remove", os_remove}, - {"rename", os_rename}, - {"setlocale", os_setlocale}, - {"time", os_time}, - {"tmpname", os_tmpname}, - {NULL, NULL} -}; - - - - - -LUAMOD_API int luaopen_os (lua_State *L) { - luaL_newlib(L, syslib); - return 1; -} - - - -//path: src/imports/../dependencies/lua/lstrlib.c - - -#define lstrlib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include -#include -#include -#include -#include - - - - - - - - - - - -#if !defined(LUA_MAXCAPTURES) -#define LUA_MAXCAPTURES 32 -#endif - - - -#define uchar(c) ((unsigned char)(c)) - - - -#define MAX_SIZET ((size_t)(~(size_t)0)) - -#define MAXSIZE \ - (sizeof(size_t) < sizeof(int) ? MAX_SIZET : (size_t)(INT_MAX)) - - - - -static int str_len (lua_State *L) { - size_t l; - luaL_checklstring(L, 1, &l); - lua_pushinteger(L, (lua_Integer)l); - return 1; -} - - - -static size_t posrelatI (lua_Integer pos, size_t len) { - if (pos > 0) - return (size_t)pos; - else if (pos == 0) - return 1; - else if (pos < -(lua_Integer)len) - return 1; - else return len + (size_t)pos + 1; -} - - - -static size_t getendpos (lua_State *L, int arg, lua_Integer def, - size_t len) { - lua_Integer pos = luaL_optinteger(L, arg, def); - if (pos > (lua_Integer)len) - return len; - else if (pos >= 0) - return (size_t)pos; - else if (pos < -(lua_Integer)len) - return 0; - else return len + (size_t)pos + 1; -} - - -static int str_sub (lua_State *L) { - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - size_t start = posrelatI(luaL_checkinteger(L, 2), l); - size_t end = getendpos(L, 3, -1, l); - if (start <= end) - lua_pushlstring(L, s + start - 1, (end - start) + 1); - else lua_pushliteral(L, ""); - return 1; -} - - -static int str_reverse (lua_State *L) { - size_t l, i; - luaL_Buffer b; - const char *s = luaL_checklstring(L, 1, &l); - char *p = luaL_buffinitsize(L, &b, l); - for (i = 0; i < l; i++) - p[i] = s[l - i - 1]; - luaL_pushresultsize(&b, l); - return 1; -} - - -static int str_lower (lua_State *L) { - size_t l; - size_t i; - luaL_Buffer b; - const char *s = luaL_checklstring(L, 1, &l); - char *p = luaL_buffinitsize(L, &b, l); - for (i=0; i MAXSIZE / n)) - return luaL_error(L, "resulting string too large"); - else { - size_t totallen = (size_t)n * l + (size_t)(n - 1) * lsep; - luaL_Buffer b; - char *p = luaL_buffinitsize(L, &b, totallen); - while (n-- > 1) { - memcpy(p, s, l * sizeof(char)); p += l; - if (lsep > 0) { - memcpy(p, sep, lsep * sizeof(char)); - p += lsep; - } - } - memcpy(p, s, l * sizeof(char)); - luaL_pushresultsize(&b, totallen); - } - return 1; -} - - -static int str_byte (lua_State *L) { - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - lua_Integer pi = luaL_optinteger(L, 2, 1); - size_t posi = posrelatI(pi, l); - size_t pose = getendpos(L, 3, pi, l); - int n, i; - if (posi > pose) return 0; - if (l_unlikely(pose - posi >= (size_t)INT_MAX)) - return luaL_error(L, "string slice too long"); - n = (int)(pose - posi) + 1; - luaL_checkstack(L, n, "string slice too long"); - for (i=0; iinit) { - state->init = 1; - luaL_buffinit(L, &state->B); - } - if (b == NULL) { - luaL_pushresult(&state->B); - lua_replace(L, 1); - } - else - luaL_addlstring(&state->B, (const char *)b, size); - return 0; -} - - -static int str_dump (lua_State *L) { - struct str_Writer state; - int strip = lua_toboolean(L, 2); - luaL_argcheck(L, lua_type(L, 1) == LUA_TFUNCTION && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - - lua_pushvalue(L, 1); - state.init = 0; - lua_dump(L, writer, &state, strip); - lua_settop(L, 1); - return 1; -} - - - - - -#if defined(LUA_NOCVTS2N) - - - -static const luaL_Reg stringmetamethods[] = { - {"__index", NULL}, - {NULL, NULL} -}; - -#else - -static int tonum (lua_State *L, int arg) { - if (lua_type(L, arg) == LUA_TNUMBER) { - lua_pushvalue(L, arg); - return 1; - } - else { - size_t len; - const char *s = lua_tolstring(L, arg, &len); - return (s != NULL && lua_stringtonumber(L, s) == len + 1); - } -} - - -static void trymt (lua_State *L, const char *mtname) { - lua_settop(L, 2); - if (l_unlikely(lua_type(L, 2) == LUA_TSTRING || - !luaL_getmetafield(L, 2, mtname))) - luaL_error(L, "attempt to %s a '%s' with a '%s'", mtname + 2, - luaL_typename(L, -2), luaL_typename(L, -1)); - lua_insert(L, -3); - lua_call(L, 2, 1); -} - - -static int arith (lua_State *L, int op, const char *mtname) { - if (tonum(L, 1) && tonum(L, 2)) - lua_arith(L, op); - else - trymt(L, mtname); - return 1; -} - - -static int arith_add (lua_State *L) { - return arith(L, LUA_OPADD, "__add"); -} - -static int arith_sub (lua_State *L) { - return arith(L, LUA_OPSUB, "__sub"); -} - -static int arith_mul (lua_State *L) { - return arith(L, LUA_OPMUL, "__mul"); -} - -static int arith_mod (lua_State *L) { - return arith(L, LUA_OPMOD, "__mod"); -} - -static int arith_pow (lua_State *L) { - return arith(L, LUA_OPPOW, "__pow"); -} - -static int arith_div (lua_State *L) { - return arith(L, LUA_OPDIV, "__div"); -} - -static int arith_idiv (lua_State *L) { - return arith(L, LUA_OPIDIV, "__idiv"); -} - -static int arith_unm (lua_State *L) { - return arith(L, LUA_OPUNM, "__unm"); -} - - -static const luaL_Reg stringmetamethods[] = { - {"__add", arith_add}, - {"__sub", arith_sub}, - {"__mul", arith_mul}, - {"__mod", arith_mod}, - {"__pow", arith_pow}, - {"__div", arith_div}, - {"__idiv", arith_idiv}, - {"__unm", arith_unm}, - {"__index", NULL}, - {NULL, NULL} -}; - -#endif - - - - - - -#define CAP_UNFINISHED (-1) -#define CAP_POSITION (-2) - - -typedef struct MatchState { - const char *src_init; - const char *src_end; - const char *p_end; - lua_State *L; - int matchdepth; - unsigned char level; - struct { - const char *init; - ptrdiff_t len; - } capture[LUA_MAXCAPTURES]; -} MatchState; - - - -static const char *match (MatchState *ms, const char *s, const char *p); - - - -#if !defined(MAXCCALLS) -#define MAXCCALLS 200 -#endif - - -#define L_ESC '%' -#define SPECIALS "^$*+?.([%-" - - -static int check_capture (MatchState *ms, int l) { - l -= '1'; - if (l_unlikely(l < 0 || l >= ms->level || - ms->capture[l].len == CAP_UNFINISHED)) - return luaL_error(ms->L, "invalid capture index %%%d", l + 1); - return l; -} - - -static int capture_to_close (MatchState *ms) { - int level = ms->level; - for (level--; level>=0; level--) - if (ms->capture[level].len == CAP_UNFINISHED) return level; - return luaL_error(ms->L, "invalid pattern capture"); -} - - -static const char *classend (MatchState *ms, const char *p) { - switch (*p++) { - case L_ESC: { - if (l_unlikely(p == ms->p_end)) - luaL_error(ms->L, "malformed pattern (ends with '%%')"); - return p+1; - } - case '[': { - if (*p == '^') p++; - do { - if (l_unlikely(p == ms->p_end)) - luaL_error(ms->L, "malformed pattern (missing ']')"); - if (*(p++) == L_ESC && p < ms->p_end) - p++; - } while (*p != ']'); - return p+1; - } - default: { - return p; - } - } -} - - -static int match_class (int c, int cl) { - int res; - switch (tolower(cl)) { - case 'a' : res = isalpha(c); break; - case 'c' : res = iscntrl(c); break; - case 'd' : res = isdigit(c); break; - case 'g' : res = isgraph(c); break; - case 'l' : res = islower(c); break; - case 'p' : res = ispunct(c); break; - case 's' : res = isspace(c); break; - case 'u' : res = isupper(c); break; - case 'w' : res = isalnum(c); break; - case 'x' : res = isxdigit(c); break; - case 'z' : res = (c == 0); break; - default: return (cl == c); - } - return (islower(cl) ? res : !res); -} - - -static int matchbracketclass (int c, const char *p, const char *ec) { - int sig = 1; - if (*(p+1) == '^') { - sig = 0; - p++; - } - while (++p < ec) { - if (*p == L_ESC) { - p++; - if (match_class(c, uchar(*p))) - return sig; - } - else if ((*(p+1) == '-') && (p+2 < ec)) { - p+=2; - if (uchar(*(p-2)) <= c && c <= uchar(*p)) - return sig; - } - else if (uchar(*p) == c) return sig; - } - return !sig; -} - - -static int singlematch (MatchState *ms, const char *s, const char *p, - const char *ep) { - if (s >= ms->src_end) - return 0; - else { - int c = uchar(*s); - switch (*p) { - case '.': return 1; - case L_ESC: return match_class(c, uchar(*(p+1))); - case '[': return matchbracketclass(c, p, ep-1); - default: return (uchar(*p) == c); - } - } -} - - -static const char *matchbalance (MatchState *ms, const char *s, - const char *p) { - if (l_unlikely(p >= ms->p_end - 1)) - luaL_error(ms->L, "malformed pattern (missing arguments to '%%b')"); - if (*s != *p) return NULL; - else { - int b = *p; - int e = *(p+1); - int cont = 1; - while (++s < ms->src_end) { - if (*s == e) { - if (--cont == 0) return s+1; - } - else if (*s == b) cont++; - } - } - return NULL; -} - - -static const char *max_expand (MatchState *ms, const char *s, - const char *p, const char *ep) { - ptrdiff_t i = 0; - while (singlematch(ms, s + i, p, ep)) - i++; - - while (i>=0) { - const char *res = match(ms, (s+i), ep+1); - if (res) return res; - i--; - } - return NULL; -} - - -static const char *min_expand (MatchState *ms, const char *s, - const char *p, const char *ep) { - for (;;) { - const char *res = match(ms, s, ep+1); - if (res != NULL) - return res; - else if (singlematch(ms, s, p, ep)) - s++; - else return NULL; - } -} - - -static const char *start_capture (MatchState *ms, const char *s, - const char *p, int what) { - const char *res; - int level = ms->level; - if (level >= LUA_MAXCAPTURES) luaL_error(ms->L, "too many captures"); - ms->capture[level].init = s; - ms->capture[level].len = what; - ms->level = level+1; - if ((res=match(ms, s, p)) == NULL) - ms->level--; - return res; -} - - -static const char *end_capture (MatchState *ms, const char *s, - const char *p) { - int l = capture_to_close(ms); - const char *res; - ms->capture[l].len = s - ms->capture[l].init; - if ((res = match(ms, s, p)) == NULL) - ms->capture[l].len = CAP_UNFINISHED; - return res; -} - - -static const char *match_capture (MatchState *ms, const char *s, int l) { - size_t len; - l = check_capture(ms, l); - len = ms->capture[l].len; - if ((size_t)(ms->src_end-s) >= len && - memcmp(ms->capture[l].init, s, len) == 0) - return s+len; - else return NULL; -} - - -static const char *match (MatchState *ms, const char *s, const char *p) { - if (l_unlikely(ms->matchdepth-- == 0)) - luaL_error(ms->L, "pattern too complex"); - init: - if (p != ms->p_end) { - switch (*p) { - case '(': { - if (*(p + 1) == ')') - s = start_capture(ms, s, p + 2, CAP_POSITION); - else - s = start_capture(ms, s, p + 1, CAP_UNFINISHED); - break; - } - case ')': { - s = end_capture(ms, s, p + 1); - break; - } - case '$': { - if ((p + 1) != ms->p_end) - goto dflt; - s = (s == ms->src_end) ? s : NULL; - break; - } - case L_ESC: { - switch (*(p + 1)) { - case 'b': { - s = matchbalance(ms, s, p + 2); - if (s != NULL) { - p += 4; goto init; - } - break; - } - case 'f': { - const char *ep; char previous; - p += 2; - if (l_unlikely(*p != '[')) - luaL_error(ms->L, "missing '[' after '%%f' in pattern"); - ep = classend(ms, p); - previous = (s == ms->src_init) ? '\0' : *(s - 1); - if (!matchbracketclass(uchar(previous), p, ep - 1) && - matchbracketclass(uchar(*s), p, ep - 1)) { - p = ep; goto init; - } - s = NULL; - break; - } - case '0': case '1': case '2': case '3': - case '4': case '5': case '6': case '7': - case '8': case '9': { - s = match_capture(ms, s, uchar(*(p + 1))); - if (s != NULL) { - p += 2; goto init; - } - break; - } - default: goto dflt; - } - break; - } - default: dflt: { - const char *ep = classend(ms, p); - - if (!singlematch(ms, s, p, ep)) { - if (*ep == '*' || *ep == '?' || *ep == '-') { - p = ep + 1; goto init; - } - else - s = NULL; - } - else { - switch (*ep) { - case '?': { - const char *res; - if ((res = match(ms, s + 1, ep + 1)) != NULL) - s = res; - else { - p = ep + 1; goto init; - } - break; - } - case '+': - s++; - - case '*': - s = max_expand(ms, s, p, ep); - break; - case '-': - s = min_expand(ms, s, p, ep); - break; - default: - s++; p = ep; goto init; - } - } - break; - } - } - } - ms->matchdepth++; - return s; -} - - - -static const char *lmemfind (const char *s1, size_t l1, - const char *s2, size_t l2) { - if (l2 == 0) return s1; - else if (l2 > l1) return NULL; - else { - const char *init; - l2--; - l1 = l1-l2; - while (l1 > 0 && (init = (const char *)memchr(s1, *s2, l1)) != NULL) { - init++; - if (memcmp(init, s2+1, l2) == 0) - return init-1; - else { - l1 -= init-s1; - s1 = init; - } - } - return NULL; - } -} - - - -static size_t get_onecapture (MatchState *ms, int i, const char *s, - const char *e, const char **cap) { - if (i >= ms->level) { - if (l_unlikely(i != 0)) - luaL_error(ms->L, "invalid capture index %%%d", i + 1); - *cap = s; - return e - s; - } - else { - ptrdiff_t capl = ms->capture[i].len; - *cap = ms->capture[i].init; - if (l_unlikely(capl == CAP_UNFINISHED)) - luaL_error(ms->L, "unfinished capture"); - else if (capl == CAP_POSITION) - lua_pushinteger(ms->L, (ms->capture[i].init - ms->src_init) + 1); - return capl; - } -} - - - -static void push_onecapture (MatchState *ms, int i, const char *s, - const char *e) { - const char *cap; - ptrdiff_t l = get_onecapture(ms, i, s, e, &cap); - if (l != CAP_POSITION) - lua_pushlstring(ms->L, cap, l); - -} - - -static int push_captures (MatchState *ms, const char *s, const char *e) { - int i; - int nlevels = (ms->level == 0 && s) ? 1 : ms->level; - luaL_checkstack(ms->L, nlevels, "too many captures"); - for (i = 0; i < nlevels; i++) - push_onecapture(ms, i, s, e); - return nlevels; -} - - - -static int nospecials (const char *p, size_t l) { - size_t upto = 0; - do { - if (strpbrk(p + upto, SPECIALS)) - return 0; - upto += strlen(p + upto) + 1; - } while (upto <= l); - return 1; -} - - -static void prepstate (MatchState *ms, lua_State *L, - const char *s, size_t ls, const char *p, size_t lp) { - ms->L = L; - ms->matchdepth = MAXCCALLS; - ms->src_init = s; - ms->src_end = s + ls; - ms->p_end = p + lp; -} - - -static void reprepstate (MatchState *ms) { - ms->level = 0; - lua_assert(ms->matchdepth == MAXCCALLS); -} - - -static int str_find_aux (lua_State *L, int find) { - size_t ls, lp; - const char *s = luaL_checklstring(L, 1, &ls); - const char *p = luaL_checklstring(L, 2, &lp); - size_t init = posrelatI(luaL_optinteger(L, 3, 1), ls) - 1; - if (init > ls) { - luaL_pushfail(L); - return 1; - } - - if (find && (lua_toboolean(L, 4) || nospecials(p, lp))) { - - const char *s2 = lmemfind(s + init, ls - init, p, lp); - if (s2) { - lua_pushinteger(L, (s2 - s) + 1); - lua_pushinteger(L, (s2 - s) + lp); - return 2; - } - } - else { - MatchState ms; - const char *s1 = s + init; - int anchor = (*p == '^'); - if (anchor) { - p++; lp--; - } - prepstate(&ms, L, s, ls, p, lp); - do { - const char *res; - reprepstate(&ms); - if ((res=match(&ms, s1, p)) != NULL) { - if (find) { - lua_pushinteger(L, (s1 - s) + 1); - lua_pushinteger(L, res - s); - return push_captures(&ms, NULL, 0) + 2; - } - else - return push_captures(&ms, s1, res); - } - } while (s1++ < ms.src_end && !anchor); - } - luaL_pushfail(L); - return 1; -} - - -static int str_find (lua_State *L) { - return str_find_aux(L, 1); -} - - -static int str_match (lua_State *L) { - return str_find_aux(L, 0); -} - - - -typedef struct GMatchState { - const char *src; - const char *p; - const char *lastmatch; - MatchState ms; -} GMatchState; - - -static int gmatch_aux (lua_State *L) { - GMatchState *gm = (GMatchState *)lua_touserdata(L, lua_upvalueindex(3)); - const char *src; - gm->ms.L = L; - for (src = gm->src; src <= gm->ms.src_end; src++) { - const char *e; - reprepstate(&gm->ms); - if ((e = match(&gm->ms, src, gm->p)) != NULL && e != gm->lastmatch) { - gm->src = gm->lastmatch = e; - return push_captures(&gm->ms, src, e); - } - } - return 0; -} - - -static int gmatch (lua_State *L) { - size_t ls, lp; - const char *s = luaL_checklstring(L, 1, &ls); - const char *p = luaL_checklstring(L, 2, &lp); - size_t init = posrelatI(luaL_optinteger(L, 3, 1), ls) - 1; - GMatchState *gm; - lua_settop(L, 2); - gm = (GMatchState *)lua_newuserdatauv(L, sizeof(GMatchState), 0); - if (init > ls) - init = ls + 1; - prepstate(&gm->ms, L, s, ls, p, lp); - gm->src = s + init; gm->p = p; gm->lastmatch = NULL; - lua_pushcclosure(L, gmatch_aux, 3); - return 1; -} - - -static void add_s (MatchState *ms, luaL_Buffer *b, const char *s, - const char *e) { - size_t l; - lua_State *L = ms->L; - const char *news = lua_tolstring(L, 3, &l); - const char *p; - while ((p = (char *)memchr(news, L_ESC, l)) != NULL) { - luaL_addlstring(b, news, p - news); - p++; - if (*p == L_ESC) - luaL_addchar(b, *p); - else if (*p == '0') - luaL_addlstring(b, s, e - s); - else if (isdigit(uchar(*p))) { - const char *cap; - ptrdiff_t resl = get_onecapture(ms, *p - '1', s, e, &cap); - if (resl == CAP_POSITION) - luaL_addvalue(b); - else - luaL_addlstring(b, cap, resl); - } - else - luaL_error(L, "invalid use of '%c' in replacement string", L_ESC); - l -= p + 1 - news; - news = p + 1; - } - luaL_addlstring(b, news, l); -} - - - -static int add_value (MatchState *ms, luaL_Buffer *b, const char *s, - const char *e, int tr) { - lua_State *L = ms->L; - switch (tr) { - case LUA_TFUNCTION: { - int n; - lua_pushvalue(L, 3); - n = push_captures(ms, s, e); - lua_call(L, n, 1); - break; - } - case LUA_TTABLE: { - push_onecapture(ms, 0, s, e); - lua_gettable(L, 3); - break; - } - default: { - add_s(ms, b, s, e); - return 1; - } - } - if (!lua_toboolean(L, -1)) { - lua_pop(L, 1); - luaL_addlstring(b, s, e - s); - return 0; - } - else if (l_unlikely(!lua_isstring(L, -1))) - return luaL_error(L, "invalid replacement value (a %s)", - luaL_typename(L, -1)); - else { - luaL_addvalue(b); - return 1; - } -} - - -static int str_gsub (lua_State *L) { - size_t srcl, lp; - const char *src = luaL_checklstring(L, 1, &srcl); - const char *p = luaL_checklstring(L, 2, &lp); - const char *lastmatch = NULL; - int tr = lua_type(L, 3); - lua_Integer max_s = luaL_optinteger(L, 4, srcl + 1); - int anchor = (*p == '^'); - lua_Integer n = 0; - int changed = 0; - MatchState ms; - luaL_Buffer b; - luaL_argexpected(L, tr == LUA_TNUMBER || tr == LUA_TSTRING || - tr == LUA_TFUNCTION || tr == LUA_TTABLE, 3, - "string/function/table"); - luaL_buffinit(L, &b); - if (anchor) { - p++; lp--; - } - prepstate(&ms, L, src, srcl, p, lp); - while (n < max_s) { - const char *e; - reprepstate(&ms); - if ((e = match(&ms, src, p)) != NULL && e != lastmatch) { - n++; - changed = add_value(&ms, &b, src, e, tr) | changed; - src = lastmatch = e; - } - else if (src < ms.src_end) - luaL_addchar(&b, *src++); - else break; - if (anchor) break; - } - if (!changed) - lua_pushvalue(L, 1); - else { - luaL_addlstring(&b, src, ms.src_end-src); - luaL_pushresult(&b); - } - lua_pushinteger(L, n); - return 2; -} - - - - - - - -#if !defined(lua_number2strx) - - - -#define SIZELENMOD (sizeof(LUA_NUMBER_FRMLEN)/sizeof(char)) - - - -#define L_NBFD ((l_floatatt(MANT_DIG) - 1)%4 + 1) - - - -static lua_Number adddigit (char *buff, int n, lua_Number x) { - lua_Number dd = l_mathop(floor)(x); - int d = (int)dd; - buff[n] = (d < 10 ? d + '0' : d - 10 + 'a'); - return x - dd; -} - - -static int num2straux (char *buff, int sz, lua_Number x) { - - if (x != x || x == (lua_Number)HUGE_VAL || x == -(lua_Number)HUGE_VAL) - return l_sprintf(buff, sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)x); - else if (x == 0) { - - return l_sprintf(buff, sz, LUA_NUMBER_FMT "x0p+0", (LUAI_UACNUMBER)x); - } - else { - int e; - lua_Number m = l_mathop(frexp)(x, &e); - int n = 0; - if (m < 0) { - buff[n++] = '-'; - m = -m; - } - buff[n++] = '0'; buff[n++] = 'x'; - m = adddigit(buff, n++, m * (1 << L_NBFD)); - e -= L_NBFD; - if (m > 0) { - buff[n++] = lua_getlocaledecpoint(); - do { - m = adddigit(buff, n++, m * 16); - } while (m > 0); - } - n += l_sprintf(buff + n, sz - n, "p%+d", e); - lua_assert(n < sz); - return n; - } -} - - -static int lua_number2strx (lua_State *L, char *buff, int sz, - const char *fmt, lua_Number x) { - int n = num2straux(buff, sz, x); - if (fmt[SIZELENMOD] == 'A') { - int i; - for (i = 0; i < n; i++) - buff[i] = toupper(uchar(buff[i])); - } - else if (l_unlikely(fmt[SIZELENMOD] != 'a')) - return luaL_error(L, "modifiers for format '%%a'/'%%A' not implemented"); - return n; -} - -#endif - - - -#define MAX_ITEMF (110 + l_floatatt(MAX_10_EXP)) - - - -#define MAX_ITEM 120 - - - -#if !defined(L_FMTFLAGSF) - - -#define L_FMTFLAGSF "-+#0 " - - -#define L_FMTFLAGSX "-#0" - - -#define L_FMTFLAGSI "-+0 " - - -#define L_FMTFLAGSU "-0" - - -#define L_FMTFLAGSC "-" - -#endif - - - -#define MAX_FORMAT 32 - - -static void addquoted (luaL_Buffer *b, const char *s, size_t len) { - luaL_addchar(b, '"'); - while (len--) { - if (*s == '"' || *s == '\\' || *s == '\n') { - luaL_addchar(b, '\\'); - luaL_addchar(b, *s); - } - else if (iscntrl(uchar(*s))) { - char buff[10]; - if (!isdigit(uchar(*(s+1)))) - l_sprintf(buff, sizeof(buff), "\\%d", (int)uchar(*s)); - else - l_sprintf(buff, sizeof(buff), "\\%03d", (int)uchar(*s)); - luaL_addstring(b, buff); - } - else - luaL_addchar(b, *s); - s++; - } - luaL_addchar(b, '"'); -} - - - -static int quotefloat (lua_State *L, char *buff, lua_Number n) { - const char *s; - if (n == (lua_Number)HUGE_VAL) - s = "1e9999"; - else if (n == -(lua_Number)HUGE_VAL) - s = "-1e9999"; - else if (n != n) - s = "(0/0)"; - else { - int nb = lua_number2strx(L, buff, MAX_ITEM, - "%" LUA_NUMBER_FRMLEN "a", n); - - if (memchr(buff, '.', nb) == NULL) { - char point = lua_getlocaledecpoint(); - char *ppoint = (char *)memchr(buff, point, nb); - if (ppoint) *ppoint = '.'; - } - return nb; - } - - return l_sprintf(buff, MAX_ITEM, "%s", s); -} - - -static void addliteral (lua_State *L, luaL_Buffer *b, int arg) { - switch (lua_type(L, arg)) { - case LUA_TSTRING: { - size_t len; - const char *s = lua_tolstring(L, arg, &len); - addquoted(b, s, len); - break; - } - case LUA_TNUMBER: { - char *buff = luaL_prepbuffsize(b, MAX_ITEM); - int nb; - if (!lua_isinteger(L, arg)) - nb = quotefloat(L, buff, lua_tonumber(L, arg)); - else { - lua_Integer n = lua_tointeger(L, arg); - const char *format = (n == LUA_MININTEGER) - ? "0x%" LUA_INTEGER_FRMLEN "x" - : LUA_INTEGER_FMT; - nb = l_sprintf(buff, MAX_ITEM, format, (LUAI_UACINT)n); - } - luaL_addsize(b, nb); - break; - } - case LUA_TNIL: case LUA_TBOOLEAN: { - luaL_tolstring(L, arg, NULL); - luaL_addvalue(b); - break; - } - default: { - luaL_argerror(L, arg, "value has no literal form"); - } - } -} - - -static const char *get2digits (const char *s) { - if (isdigit(uchar(*s))) { - s++; - if (isdigit(uchar(*s))) s++; - } - return s; -} - - - -static void checkformat (lua_State *L, const char *form, const char *flags, - int precision) { - const char *spec = form + 1; - spec += strspn(spec, flags); - if (*spec != '0') { - spec = get2digits(spec); - if (*spec == '.' && precision) { - spec++; - spec = get2digits(spec); - } - } - if (!isalpha(uchar(*spec))) - luaL_error(L, "invalid conversion specification: '%s'", form); -} - - - -static const char *getformat (lua_State *L, const char *strfrmt, - char *form) { - - size_t len = strspn(strfrmt, L_FMTFLAGSF "123456789."); - len++; - - if (len >= MAX_FORMAT - 10) - luaL_error(L, "invalid format (too long)"); - *(form++) = '%'; - memcpy(form, strfrmt, len * sizeof(char)); - *(form + len) = '\0'; - return strfrmt + len - 1; -} - - - -static void addlenmod (char *form, const char *lenmod) { - size_t l = strlen(form); - size_t lm = strlen(lenmod); - char spec = form[l - 1]; - strcpy(form + l - 1, lenmod); - form[l + lm - 1] = spec; - form[l + lm] = '\0'; -} - - -static int str_format (lua_State *L) { - int top = lua_gettop(L); - int arg = 1; - size_t sfl; - const char *strfrmt = luaL_checklstring(L, arg, &sfl); - const char *strfrmt_end = strfrmt+sfl; - const char *flags; - luaL_Buffer b; - luaL_buffinit(L, &b); - while (strfrmt < strfrmt_end) { - if (*strfrmt != L_ESC) - luaL_addchar(&b, *strfrmt++); - else if (*++strfrmt == L_ESC) - luaL_addchar(&b, *strfrmt++); - else { - char form[MAX_FORMAT]; - int maxitem = MAX_ITEM; - char *buff = luaL_prepbuffsize(&b, maxitem); - int nb = 0; - if (++arg > top) - return luaL_argerror(L, arg, "no value"); - strfrmt = getformat(L, strfrmt, form); - switch (*strfrmt++) { - case 'c': { - checkformat(L, form, L_FMTFLAGSC, 0); - nb = l_sprintf(buff, maxitem, form, (int)luaL_checkinteger(L, arg)); - break; - } - case 'd': case 'i': - flags = L_FMTFLAGSI; - goto intcase; - case 'u': - flags = L_FMTFLAGSU; - goto intcase; - case 'o': case 'x': case 'X': - flags = L_FMTFLAGSX; - intcase: { - lua_Integer n = luaL_checkinteger(L, arg); - checkformat(L, form, flags, 1); - addlenmod(form, LUA_INTEGER_FRMLEN); - nb = l_sprintf(buff, maxitem, form, (LUAI_UACINT)n); - break; - } - case 'a': case 'A': - checkformat(L, form, L_FMTFLAGSF, 1); - addlenmod(form, LUA_NUMBER_FRMLEN); - nb = lua_number2strx(L, buff, maxitem, form, - luaL_checknumber(L, arg)); - break; - case 'f': - maxitem = MAX_ITEMF; - buff = luaL_prepbuffsize(&b, maxitem); - - case 'e': case 'E': case 'g': case 'G': { - lua_Number n = luaL_checknumber(L, arg); - checkformat(L, form, L_FMTFLAGSF, 1); - addlenmod(form, LUA_NUMBER_FRMLEN); - nb = l_sprintf(buff, maxitem, form, (LUAI_UACNUMBER)n); - break; - } - case 'p': { - const void *p = lua_topointer(L, arg); - checkformat(L, form, L_FMTFLAGSC, 0); - if (p == NULL) { - p = "(null)"; - form[strlen(form) - 1] = 's'; - } - nb = l_sprintf(buff, maxitem, form, p); - break; - } - case 'q': { - if (form[2] != '\0') - return luaL_error(L, "specifier '%%q' cannot have modifiers"); - addliteral(L, &b, arg); - break; - } - case 's': { - size_t l; - const char *s = luaL_tolstring(L, arg, &l); - if (form[2] == '\0') - luaL_addvalue(&b); - else { - luaL_argcheck(L, l == strlen(s), arg, "string contains zeros"); - checkformat(L, form, L_FMTFLAGSC, 1); - if (strchr(form, '.') == NULL && l >= 100) { - - luaL_addvalue(&b); - } - else { - nb = l_sprintf(buff, maxitem, form, s); - lua_pop(L, 1); - } - } - break; - } - default: { - return luaL_error(L, "invalid conversion '%s' to 'format'", form); - } - } - lua_assert(nb < maxitem); - luaL_addsize(&b, nb); - } - } - luaL_pushresult(&b); - return 1; -} - - - - - - - - -#if !defined(LUAL_PACKPADBYTE) -#define LUAL_PACKPADBYTE 0x00 -#endif - - -#define MAXINTSIZE 16 - - -#define NB CHAR_BIT - - -#define MC ((1 << NB) - 1) - - -#define SZINT ((int)sizeof(lua_Integer)) - - - -static const union { - int dummy; - char little; -} nativeendian = {1}; - - - -typedef struct Header { - lua_State *L; - int islittle; - int maxalign; -} Header; - - - -typedef enum KOption { - Kint, - Kuint, - Kfloat, - Knumber, - Kdouble, - Kchar, - Kstring, - Kzstr, - Kpadding, - Kpaddalign, - Knop -} KOption; - - - -static int digit (int c) { return '0' <= c && c <= '9'; } - -static int getnum (const char **fmt, int df) { - if (!digit(**fmt)) - return df; - else { - int a = 0; - do { - a = a*10 + (*((*fmt)++) - '0'); - } while (digit(**fmt) && a <= ((int)MAXSIZE - 9)/10); - return a; - } -} - - - -static int getnumlimit (Header *h, const char **fmt, int df) { - int sz = getnum(fmt, df); - if (l_unlikely(sz > MAXINTSIZE || sz <= 0)) - return luaL_error(h->L, "integral size (%d) out of limits [1,%d]", - sz, MAXINTSIZE); - return sz; -} - - - -static void initheader (lua_State *L, Header *h) { - h->L = L; - h->islittle = nativeendian.little; - h->maxalign = 1; -} - - - -static KOption getoption (Header *h, const char **fmt, int *size) { - - struct cD { char c; union { LUAI_MAXALIGN; } u; }; - int opt = *((*fmt)++); - *size = 0; - switch (opt) { - case 'b': *size = sizeof(char); return Kint; - case 'B': *size = sizeof(char); return Kuint; - case 'h': *size = sizeof(short); return Kint; - case 'H': *size = sizeof(short); return Kuint; - case 'l': *size = sizeof(long); return Kint; - case 'L': *size = sizeof(long); return Kuint; - case 'j': *size = sizeof(lua_Integer); return Kint; - case 'J': *size = sizeof(lua_Integer); return Kuint; - case 'T': *size = sizeof(size_t); return Kuint; - case 'f': *size = sizeof(float); return Kfloat; - case 'n': *size = sizeof(lua_Number); return Knumber; - case 'd': *size = sizeof(double); return Kdouble; - case 'i': *size = getnumlimit(h, fmt, sizeof(int)); return Kint; - case 'I': *size = getnumlimit(h, fmt, sizeof(int)); return Kuint; - case 's': *size = getnumlimit(h, fmt, sizeof(size_t)); return Kstring; - case 'c': - *size = getnum(fmt, -1); - if (l_unlikely(*size == -1)) - luaL_error(h->L, "missing size for format option 'c'"); - return Kchar; - case 'z': return Kzstr; - case 'x': *size = 1; return Kpadding; - case 'X': return Kpaddalign; - case ' ': break; - case '<': h->islittle = 1; break; - case '>': h->islittle = 0; break; - case '=': h->islittle = nativeendian.little; break; - case '!': { - const int maxalign = offsetof(struct cD, u); - h->maxalign = getnumlimit(h, fmt, maxalign); - break; - } - default: luaL_error(h->L, "invalid format option '%c'", opt); - } - return Knop; -} - - - -static KOption getdetails (Header *h, size_t totalsize, - const char **fmt, int *psize, int *ntoalign) { - KOption opt = getoption(h, fmt, psize); - int align = *psize; - if (opt == Kpaddalign) { - if (**fmt == '\0' || getoption(h, fmt, &align) == Kchar || align == 0) - luaL_argerror(h->L, 1, "invalid next option for option 'X'"); - } - if (align <= 1 || opt == Kchar) - *ntoalign = 0; - else { - if (align > h->maxalign) - align = h->maxalign; - if (l_unlikely((align & (align - 1)) != 0)) - luaL_argerror(h->L, 1, "format asks for alignment not power of 2"); - *ntoalign = (align - (int)(totalsize & (align - 1))) & (align - 1); - } - return opt; -} - - - -static void packint (luaL_Buffer *b, lua_Unsigned n, - int islittle, int size, int neg) { - char *buff = luaL_prepbuffsize(b, size); - int i; - buff[islittle ? 0 : size - 1] = (char)(n & MC); - for (i = 1; i < size; i++) { - n >>= NB; - buff[islittle ? i : size - 1 - i] = (char)(n & MC); - } - if (neg && size > SZINT) { - for (i = SZINT; i < size; i++) - buff[islittle ? i : size - 1 - i] = (char)MC; - } - luaL_addsize(b, size); -} - - - -static void copywithendian (char *dest, const char *src, - int size, int islittle) { - if (islittle == nativeendian.little) - memcpy(dest, src, size); - else { - dest += size - 1; - while (size-- != 0) - *(dest--) = *(src++); - } -} - - -static int str_pack (lua_State *L) { - luaL_Buffer b; - Header h; - const char *fmt = luaL_checkstring(L, 1); - int arg = 1; - size_t totalsize = 0; - initheader(L, &h); - lua_pushnil(L); - luaL_buffinit(L, &b); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, totalsize, &fmt, &size, &ntoalign); - totalsize += ntoalign + size; - while (ntoalign-- > 0) - luaL_addchar(&b, LUAL_PACKPADBYTE); - arg++; - switch (opt) { - case Kint: { - lua_Integer n = luaL_checkinteger(L, arg); - if (size < SZINT) { - lua_Integer lim = (lua_Integer)1 << ((size * NB) - 1); - luaL_argcheck(L, -lim <= n && n < lim, arg, "integer overflow"); - } - packint(&b, (lua_Unsigned)n, h.islittle, size, (n < 0)); - break; - } - case Kuint: { - lua_Integer n = luaL_checkinteger(L, arg); - if (size < SZINT) - luaL_argcheck(L, (lua_Unsigned)n < ((lua_Unsigned)1 << (size * NB)), - arg, "unsigned overflow"); - packint(&b, (lua_Unsigned)n, h.islittle, size, 0); - break; - } - case Kfloat: { - float f = (float)luaL_checknumber(L, arg); - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Knumber: { - lua_Number f = luaL_checknumber(L, arg); - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Kdouble: { - double f = (double)luaL_checknumber(L, arg); - char *buff = luaL_prepbuffsize(&b, sizeof(f)); - - copywithendian(buff, (char *)&f, sizeof(f), h.islittle); - luaL_addsize(&b, size); - break; - } - case Kchar: { - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, len <= (size_t)size, arg, - "string longer than given size"); - luaL_addlstring(&b, s, len); - while (len++ < (size_t)size) - luaL_addchar(&b, LUAL_PACKPADBYTE); - break; - } - case Kstring: { - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, size >= (int)sizeof(size_t) || - len < ((size_t)1 << (size * NB)), - arg, "string length does not fit in given size"); - packint(&b, (lua_Unsigned)len, h.islittle, size, 0); - luaL_addlstring(&b, s, len); - totalsize += len; - break; - } - case Kzstr: { - size_t len; - const char *s = luaL_checklstring(L, arg, &len); - luaL_argcheck(L, strlen(s) == len, arg, "string contains zeros"); - luaL_addlstring(&b, s, len); - luaL_addchar(&b, '\0'); - totalsize += len + 1; - break; - } - case Kpadding: luaL_addchar(&b, LUAL_PACKPADBYTE); - case Kpaddalign: case Knop: - arg--; - break; - } - } - luaL_pushresult(&b); - return 1; -} - - -static int str_packsize (lua_State *L) { - Header h; - const char *fmt = luaL_checkstring(L, 1); - size_t totalsize = 0; - initheader(L, &h); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, totalsize, &fmt, &size, &ntoalign); - luaL_argcheck(L, opt != Kstring && opt != Kzstr, 1, - "variable-length format"); - size += ntoalign; - luaL_argcheck(L, totalsize <= MAXSIZE - size, 1, - "format result too large"); - totalsize += size; - } - lua_pushinteger(L, (lua_Integer)totalsize); - return 1; -} - - - -static lua_Integer unpackint (lua_State *L, const char *str, - int islittle, int size, int issigned) { - lua_Unsigned res = 0; - int i; - int limit = (size <= SZINT) ? size : SZINT; - for (i = limit - 1; i >= 0; i--) { - res <<= NB; - res |= (lua_Unsigned)(unsigned char)str[islittle ? i : size - 1 - i]; - } - if (size < SZINT) { - if (issigned) { - lua_Unsigned mask = (lua_Unsigned)1 << (size*NB - 1); - res = ((res ^ mask) - mask); - } - } - else if (size > SZINT) { - int mask = (!issigned || (lua_Integer)res >= 0) ? 0 : MC; - for (i = limit; i < size; i++) { - if (l_unlikely((unsigned char)str[islittle ? i : size - 1 - i] != mask)) - luaL_error(L, "%d-byte integer does not fit into Lua Integer", size); - } - } - return (lua_Integer)res; -} - - -static int str_unpack (lua_State *L) { - Header h; - const char *fmt = luaL_checkstring(L, 1); - size_t ld; - const char *data = luaL_checklstring(L, 2, &ld); - size_t pos = posrelatI(luaL_optinteger(L, 3, 1), ld) - 1; - int n = 0; - luaL_argcheck(L, pos <= ld, 3, "initial position out of string"); - initheader(L, &h); - while (*fmt != '\0') { - int size, ntoalign; - KOption opt = getdetails(&h, pos, &fmt, &size, &ntoalign); - luaL_argcheck(L, (size_t)ntoalign + size <= ld - pos, 2, - "data string too short"); - pos += ntoalign; - - luaL_checkstack(L, 2, "too many results"); - n++; - switch (opt) { - case Kint: - case Kuint: { - lua_Integer res = unpackint(L, data + pos, h.islittle, size, - (opt == Kint)); - lua_pushinteger(L, res); - break; - } - case Kfloat: { - float f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, (lua_Number)f); - break; - } - case Knumber: { - lua_Number f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, f); - break; - } - case Kdouble: { - double f; - copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); - lua_pushnumber(L, (lua_Number)f); - break; - } - case Kchar: { - lua_pushlstring(L, data + pos, size); - break; - } - case Kstring: { - size_t len = (size_t)unpackint(L, data + pos, h.islittle, size, 0); - luaL_argcheck(L, len <= ld - pos - size, 2, "data string too short"); - lua_pushlstring(L, data + pos + size, len); - pos += len; - break; - } - case Kzstr: { - size_t len = strlen(data + pos); - luaL_argcheck(L, pos + len < ld, 2, - "unfinished string for format 'z'"); - lua_pushlstring(L, data + pos, len); - pos += len + 1; - break; - } - case Kpaddalign: case Kpadding: case Knop: - n--; - break; - } - pos += size; - } - lua_pushinteger(L, pos + 1); - return n + 1; -} - - - - -static const luaL_Reg strlib[] = { - {"byte", str_byte}, - {"char", str_char}, - {"dump", str_dump}, - {"find", str_find}, - {"format", str_format}, - {"gmatch", gmatch}, - {"gsub", str_gsub}, - {"len", str_len}, - {"lower", str_lower}, - {"match", str_match}, - {"rep", str_rep}, - {"reverse", str_reverse}, - {"sub", str_sub}, - {"upper", str_upper}, - {"pack", str_pack}, - {"packsize", str_packsize}, - {"unpack", str_unpack}, - {NULL, NULL} -}; - - -static void createmetatable (lua_State *L) { - - luaL_newlibtable(L, stringmetamethods); - luaL_setfuncs(L, stringmetamethods, 0); - lua_pushliteral(L, ""); - lua_pushvalue(L, -2); - lua_setmetatable(L, -2); - lua_pop(L, 1); - lua_pushvalue(L, -2); - lua_setfield(L, -2, "__index"); - lua_pop(L, 1); -} - - - -LUAMOD_API int luaopen_string (lua_State *L) { - luaL_newlib(L, strlib); - createmetatable(L); - return 1; -} - - - -//path: src/imports/../dependencies/lua/ltablib.c - - -#define ltablib_c -#define LUA_LIB - - - - - -#include -#include -#include - - - - - - - - - - - -#define TAB_R 1 -#define TAB_W 2 -#define TAB_L 4 -#define TAB_RW (TAB_R | TAB_W) - - -#define aux_getn(L,n,w) (checktab(L, n, (w) | TAB_L), luaL_len(L, n)) - - -static int checkfield (lua_State *L, const char *key, int n) { - lua_pushstring(L, key); - return (lua_rawget(L, -n) != LUA_TNIL); -} - - - -static void checktab (lua_State *L, int arg, int what) { - if (lua_type(L, arg) != LUA_TTABLE) { - int n = 1; - if (lua_getmetatable(L, arg) && - (!(what & TAB_R) || checkfield(L, "__index", ++n)) && - (!(what & TAB_W) || checkfield(L, "__newindex", ++n)) && - (!(what & TAB_L) || checkfield(L, "__len", ++n))) { - lua_pop(L, n); - } - else - luaL_checktype(L, arg, LUA_TTABLE); - } -} - - -static int tcreate (lua_State *L) { - lua_Unsigned sizeseq = (lua_Unsigned)luaL_checkinteger(L, 1); - lua_Unsigned sizerest = (lua_Unsigned)luaL_optinteger(L, 2, 0); - luaL_argcheck(L, sizeseq <= UINT_MAX, 1, "out of range"); - luaL_argcheck(L, sizerest <= UINT_MAX, 2, "out of range"); - lua_createtable(L, (unsigned)sizeseq, (unsigned)sizerest); - return 1; -} - - -static int tinsert (lua_State *L) { - lua_Integer pos; - lua_Integer e = aux_getn(L, 1, TAB_RW); - e = luaL_intop(+, e, 1); - switch (lua_gettop(L)) { - case 2: { - pos = e; - break; - } - case 3: { - lua_Integer i; - pos = luaL_checkinteger(L, 2); - - luaL_argcheck(L, (lua_Unsigned)pos - 1u < (lua_Unsigned)e, 2, - "position out of bounds"); - for (i = e; i > pos; i--) { - lua_geti(L, 1, i - 1); - lua_seti(L, 1, i); - } - break; - } - default: { - return luaL_error(L, "wrong number of arguments to 'insert'"); - } - } - lua_seti(L, 1, pos); - return 0; -} - - -static int tremove (lua_State *L) { - lua_Integer size = aux_getn(L, 1, TAB_RW); - lua_Integer pos = luaL_optinteger(L, 2, size); - if (pos != size) - - luaL_argcheck(L, (lua_Unsigned)pos - 1u <= (lua_Unsigned)size, 2, - "position out of bounds"); - lua_geti(L, 1, pos); - for ( ; pos < size; pos++) { - lua_geti(L, 1, pos + 1); - lua_seti(L, 1, pos); - } - lua_pushnil(L); - lua_seti(L, 1, pos); - return 1; -} - - - -static int tmove (lua_State *L) { - lua_Integer f = luaL_checkinteger(L, 2); - lua_Integer e = luaL_checkinteger(L, 3); - lua_Integer t = luaL_checkinteger(L, 4); - int tt = !lua_isnoneornil(L, 5) ? 5 : 1; - checktab(L, 1, TAB_R); - checktab(L, tt, TAB_W); - if (e >= f) { - lua_Integer n, i; - luaL_argcheck(L, f > 0 || e < LUA_MAXINTEGER + f, 3, - "too many elements to move"); - n = e - f + 1; - luaL_argcheck(L, t <= LUA_MAXINTEGER - n + 1, 4, - "destination wrap around"); - if (t > e || t <= f || (tt != 1 && !lua_compare(L, 1, tt, LUA_OPEQ))) { - for (i = 0; i < n; i++) { - lua_geti(L, 1, f + i); - lua_seti(L, tt, t + i); - } - } - else { - for (i = n - 1; i >= 0; i--) { - lua_geti(L, 1, f + i); - lua_seti(L, tt, t + i); - } - } - } - lua_pushvalue(L, tt); - return 1; -} - - -static void addfield (lua_State *L, luaL_Buffer *b, lua_Integer i) { - lua_geti(L, 1, i); - if (l_unlikely(!lua_isstring(L, -1))) - luaL_error(L, "invalid value (%s) at index %I in table for 'concat'", - luaL_typename(L, -1), (LUAI_UACINT)i); - luaL_addvalue(b); -} - - -static int tconcat (lua_State *L) { - luaL_Buffer b; - lua_Integer last = aux_getn(L, 1, TAB_R); - size_t lsep; - const char *sep = luaL_optlstring(L, 2, "", &lsep); - lua_Integer i = luaL_optinteger(L, 3, 1); - last = luaL_optinteger(L, 4, last); - luaL_buffinit(L, &b); - for (; i < last; i++) { - addfield(L, &b, i); - luaL_addlstring(&b, sep, lsep); - } - if (i == last) - addfield(L, &b, i); - luaL_pushresult(&b); - return 1; -} - - - - -static int tpack (lua_State *L) { - int i; - int n = lua_gettop(L); - lua_createtable(L, n, 1); - lua_insert(L, 1); - for (i = n; i >= 1; i--) - lua_seti(L, 1, i); - lua_pushinteger(L, n); - lua_setfield(L, 1, "n"); - return 1; -} - - -static int tunpack (lua_State *L) { - lua_Unsigned n; - lua_Integer i = luaL_optinteger(L, 2, 1); - lua_Integer e = luaL_opt(L, luaL_checkinteger, 3, luaL_len(L, 1)); - if (i > e) return 0; - n = (lua_Unsigned)e - i; - if (l_unlikely(n >= (unsigned int)INT_MAX || - !lua_checkstack(L, (int)(++n)))) - return luaL_error(L, "too many results to unpack"); - for (; i < e; i++) { - lua_geti(L, 1, i); - } - lua_geti(L, 1, e); - return (int)n; -} - - - - - - - - - -typedef unsigned int IdxT; - - - -#if !defined(l_randomizePivot) -#define l_randomizePivot(L) luaL_makeseed(L) -#endif - - - -#define RANLIMIT 100u - - -static void set2 (lua_State *L, IdxT i, IdxT j) { - lua_seti(L, 1, i); - lua_seti(L, 1, j); -} - - - -static int sort_comp (lua_State *L, int a, int b) { - if (lua_isnil(L, 2)) - return lua_compare(L, a, b, LUA_OPLT); - else { - int res; - lua_pushvalue(L, 2); - lua_pushvalue(L, a-1); - lua_pushvalue(L, b-2); - lua_call(L, 2, 1); - res = lua_toboolean(L, -1); - lua_pop(L, 1); - return res; - } -} - - - -static IdxT partition (lua_State *L, IdxT lo, IdxT up) { - IdxT i = lo; - IdxT j = up - 1; - - for (;;) { - - while ((void)lua_geti(L, 1, ++i), sort_comp(L, -1, -2)) { - if (l_unlikely(i == up - 1)) - luaL_error(L, "invalid order function for sorting"); - lua_pop(L, 1); - } - - - while ((void)lua_geti(L, 1, --j), sort_comp(L, -3, -1)) { - if (l_unlikely(j < i)) - luaL_error(L, "invalid order function for sorting"); - lua_pop(L, 1); - } - - if (j < i) { - - lua_pop(L, 1); - - set2(L, up - 1, i); - return i; - } - - set2(L, i, j); - } -} - - - -static IdxT choosePivot (IdxT lo, IdxT up, unsigned int rnd) { - IdxT r4 = (up - lo) / 4; - IdxT p = (rnd ^ lo ^ up) % (r4 * 2) + (lo + r4); - lua_assert(lo + r4 <= p && p <= up - r4); - return p; -} - - - -static void auxsort (lua_State *L, IdxT lo, IdxT up, unsigned rnd) { - while (lo < up) { - IdxT p; - IdxT n; - - lua_geti(L, 1, lo); - lua_geti(L, 1, up); - if (sort_comp(L, -1, -2)) - set2(L, lo, up); - else - lua_pop(L, 2); - if (up - lo == 1) - return; - if (up - lo < RANLIMIT || rnd == 0) - p = (lo + up)/2; - else - p = choosePivot(lo, up, rnd); - lua_geti(L, 1, p); - lua_geti(L, 1, lo); - if (sort_comp(L, -2, -1)) - set2(L, p, lo); - else { - lua_pop(L, 1); - lua_geti(L, 1, up); - if (sort_comp(L, -1, -2)) - set2(L, p, up); - else - lua_pop(L, 2); - } - if (up - lo == 2) - return; - lua_geti(L, 1, p); - lua_pushvalue(L, -1); - lua_geti(L, 1, up - 1); - set2(L, p, up - 1); - p = partition(L, lo, up); - - if (p - lo < up - p) { - auxsort(L, lo, p - 1, rnd); - n = p - lo; - lo = p + 1; - } - else { - auxsort(L, p + 1, up, rnd); - n = up - p; - up = p - 1; - } - if ((up - lo) / 128 > n) - rnd = l_randomizePivot(L); - } -} - - -static int sort (lua_State *L) { - lua_Integer n = aux_getn(L, 1, TAB_RW); - if (n > 1) { - luaL_argcheck(L, n < INT_MAX, 1, "array too big"); - if (!lua_isnoneornil(L, 2)) - luaL_checktype(L, 2, LUA_TFUNCTION); - lua_settop(L, 2); - auxsort(L, 1, (IdxT)n, 0); - } - return 0; -} - - - - -static const luaL_Reg tab_funcs[] = { - {"concat", tconcat}, - {"create", tcreate}, - {"insert", tinsert}, - {"pack", tpack}, - {"unpack", tunpack}, - {"remove", tremove}, - {"move", tmove}, - {"sort", sort}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_table (lua_State *L) { - luaL_newlib(L, tab_funcs); - return 1; -} - - - -//path: src/imports/../dependencies/lua/lutf8lib.c - - -#define lutf8lib_c -#define LUA_LIB - - - - - -#include -#include -#include -#include - - - - - - - - - - -#define MAXUNICODE 0x10FFFFu - -#define MAXUTF 0x7FFFFFFFu - - -#define MSGInvalid "invalid UTF-8 code" - - -#if (UINT_MAX >> 30) >= 1 -typedef unsigned int utfint; -#else -typedef unsigned long utfint; -#endif - - -#define iscont(c) (((c) & 0xC0) == 0x80) -#define iscontp(p) iscont(*(p)) - - - - -static lua_Integer u_posrelat (lua_Integer pos, size_t len) { - if (pos >= 0) return pos; - else if (0u - (size_t)pos > len) return 0; - else return (lua_Integer)len + pos + 1; -} - - - -static const char *utf8_decode (const char *s, utfint *val, int strict) { - static const utfint limits[] = - {~(utfint)0, 0x80, 0x800, 0x10000u, 0x200000u, 0x4000000u}; - unsigned int c = (unsigned char)s[0]; - utfint res = 0; - if (c < 0x80) - res = c; - else { - int count = 0; - for (; c & 0x40; c <<= 1) { - unsigned int cc = (unsigned char)s[++count]; - if (!iscont(cc)) - return NULL; - res = (res << 6) | (cc & 0x3F); - } - res |= ((utfint)(c & 0x7F) << (count * 5)); - if (count > 5 || res > MAXUTF || res < limits[count]) - return NULL; - s += count; - } - if (strict) { - - if (res > MAXUNICODE || (0xD800u <= res && res <= 0xDFFFu)) - return NULL; - } - if (val) *val = res; - return s + 1; -} - - - -static int utflen (lua_State *L) { - lua_Integer n = 0; - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer posi = u_posrelat(luaL_optinteger(L, 2, 1), len); - lua_Integer posj = u_posrelat(luaL_optinteger(L, 3, -1), len); - int lax = lua_toboolean(L, 4); - luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 2, - "initial position out of bounds"); - luaL_argcheck(L, --posj < (lua_Integer)len, 3, - "final position out of bounds"); - while (posi <= posj) { - const char *s1 = utf8_decode(s + posi, NULL, !lax); - if (s1 == NULL) { - luaL_pushfail(L); - lua_pushinteger(L, posi + 1); - return 2; - } - posi = s1 - s; - n++; - } - lua_pushinteger(L, n); - return 1; -} - - - -static int codepoint (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer posi = u_posrelat(luaL_optinteger(L, 2, 1), len); - lua_Integer pose = u_posrelat(luaL_optinteger(L, 3, posi), len); - int lax = lua_toboolean(L, 4); - int n; - const char *se; - luaL_argcheck(L, posi >= 1, 2, "out of bounds"); - luaL_argcheck(L, pose <= (lua_Integer)len, 3, "out of bounds"); - if (posi > pose) return 0; - if (pose - posi >= INT_MAX) - return luaL_error(L, "string slice too long"); - n = (int)(pose - posi) + 1; - luaL_checkstack(L, n, "string slice too long"); - n = 0; - se = s + pose; - for (s += posi - 1; s < se;) { - utfint code; - s = utf8_decode(s, &code, !lax); - if (s == NULL) - return luaL_error(L, MSGInvalid); - lua_pushinteger(L, code); - n++; - } - return n; -} - - -static void pushutfchar (lua_State *L, int arg) { - lua_Unsigned code = (lua_Unsigned)luaL_checkinteger(L, arg); - luaL_argcheck(L, code <= MAXUTF, arg, "value out of range"); - lua_pushfstring(L, "%U", (long)code); -} - - - -static int utfchar (lua_State *L) { - int n = lua_gettop(L); - if (n == 1) - pushutfchar(L, 1); - else { - int i; - luaL_Buffer b; - luaL_buffinit(L, &b); - for (i = 1; i <= n; i++) { - pushutfchar(L, i); - luaL_addvalue(&b); - } - luaL_pushresult(&b); - } - return 1; -} - - - -static int byteoffset (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer n = luaL_checkinteger(L, 2); - lua_Integer posi = (n >= 0) ? 1 : len + 1; - posi = u_posrelat(luaL_optinteger(L, 3, posi), len); - luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 3, - "position out of bounds"); - if (n == 0) { - - while (posi > 0 && iscontp(s + posi)) posi--; - } - else { - if (iscontp(s + posi)) - return luaL_error(L, "initial position is a continuation byte"); - if (n < 0) { - while (n < 0 && posi > 0) { - do { - posi--; - } while (posi > 0 && iscontp(s + posi)); - n++; - } - } - else { - n--; - while (n > 0 && posi < (lua_Integer)len) { - do { - posi++; - } while (iscontp(s + posi)); - n--; - } - } - } - if (n == 0) - lua_pushinteger(L, posi + 1); - else - luaL_pushfail(L); - return 1; -} - - -static int iter_aux (lua_State *L, int strict) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Unsigned n = (lua_Unsigned)lua_tointeger(L, 2); - if (n < len) { - while (iscontp(s + n)) n++; - } - if (n >= len) - return 0; - else { - utfint code; - const char *next = utf8_decode(s + n, &code, strict); - if (next == NULL || iscontp(next)) - return luaL_error(L, MSGInvalid); - lua_pushinteger(L, n + 1); - lua_pushinteger(L, code); - return 2; - } -} - - -static int iter_auxstrict (lua_State *L) { - return iter_aux(L, 1); -} - -static int iter_auxlax (lua_State *L) { - return iter_aux(L, 0); -} - - -static int iter_codes (lua_State *L) { - int lax = lua_toboolean(L, 2); - const char *s = luaL_checkstring(L, 1); - luaL_argcheck(L, !iscontp(s), 1, MSGInvalid); - lua_pushcfunction(L, lax ? iter_auxlax : iter_auxstrict); - lua_pushvalue(L, 1); - lua_pushinteger(L, 0); - return 3; -} - - - -#define UTF8PATT "[\0-\x7F\xC2-\xFD][\x80-\xBF]*" - - -static const luaL_Reg funcs[] = { - {"offset", byteoffset}, - {"codepoint", codepoint}, - {"char", utfchar}, - {"len", utflen}, - {"codes", iter_codes}, - - {"charpattern", NULL}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_utf8 (lua_State *L) { - luaL_newlib(L, funcs); - lua_pushlstring(L, UTF8PATT, sizeof(UTF8PATT)/sizeof(char) - 1); - lua_setfield(L, -2, "charpattern"); - return 1; -} - - - -//path: src/imports/../dependencies/lua/linit.c - - - -#define linit_c -#define LUA_LIB - - - - - - -#include - - - - - - - - - - - -static const luaL_Reg stdlibs[] = { - {LUA_GNAME, luaopen_base}, - {LUA_LOADLIBNAME, luaopen_package}, - {LUA_COLIBNAME, luaopen_coroutine}, - {LUA_DBLIBNAME, luaopen_debug}, - {LUA_IOLIBNAME, luaopen_io}, - {LUA_MATHLIBNAME, luaopen_math}, - {LUA_OSLIBNAME, luaopen_os}, - {LUA_STRLIBNAME, luaopen_string}, - {LUA_TABLIBNAME, luaopen_table}, - {LUA_UTF8LIBNAME, luaopen_utf8}, - {NULL, NULL} -}; - - - -LUALIB_API void luaL_openselectedlibs (lua_State *L, int load, int preload) { - int mask; - const luaL_Reg *lib; - luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - for (lib = stdlibs, mask = 1; lib->name != NULL; lib++, mask <<= 1) { - if (load & mask) { - luaL_requiref(L, lib->name, lib->func, 1); - lua_pop(L, 1); - } - else if (preload & mask) { - lua_pushcfunction(L, lib->func); - lua_setfield(L, -2, lib->name); - } - } - lua_assert((mask >> 1) == LUA_UTF8LIBK); - lua_pop(L, 1); -} - - - -#endif - - -#ifdef MAKE_LUA -//path: src/imports/../dependencies/lua/lua.c - - -#define lua_c - - - - - -#include -#include -#include - -#include - - - - - - - - - - -#if !defined(LUA_PROGNAME) -#define LUA_PROGNAME "lua" -#endif - -#if !defined(LUA_INIT_VAR) -#define LUA_INIT_VAR "LUA_INIT" -#endif - -#define LUA_INITVARVERSION LUA_INIT_VAR LUA_VERSUFFIX - - -static lua_State *globalL = NULL; - -static const char *progname = LUA_PROGNAME; - - -#if defined(LUA_USE_POSIX) - - -static void setsignal (int sig, void (*handler)(int)) { - struct sigaction sa; - sa.sa_handler = handler; - sa.sa_flags = 0; - sigemptyset(&sa.sa_mask); - sigaction(sig, &sa, NULL); -} - -#else - -#define setsignal signal - -#endif - - - -static void lstop (lua_State *L, lua_Debug *ar) { - (void)ar; - lua_sethook(L, NULL, 0, 0); - luaL_error(L, "interrupted!"); -} - - - -static void laction (int i) { - int flag = LUA_MASKCALL | LUA_MASKRET | LUA_MASKLINE | LUA_MASKCOUNT; - setsignal(i, SIG_DFL); - lua_sethook(globalL, lstop, flag, 1); -} - - -static void print_usage (const char *badoption) { - lua_writestringerror("%s: ", progname); - if (badoption[1] == 'e' || badoption[1] == 'l') - lua_writestringerror("'%s' needs argument\n", badoption); - else - lua_writestringerror("unrecognized option '%s'\n", badoption); - lua_writestringerror( - "usage: %s [options] [script [args]]\n" - "Available options are:\n" - " -e stat execute string 'stat'\n" - " -i enter interactive mode after executing 'script'\n" - " -l mod require library 'mod' into global 'mod'\n" - " -l g=mod require library 'mod' into global 'g'\n" - " -v show version information\n" - " -E ignore environment variables\n" - " -W turn warnings on\n" - " -- stop handling options\n" - " - stop handling options and execute stdin\n" - , - progname); -} - - - -static void l_message (const char *pname, const char *msg) { - if (pname) lua_writestringerror("%s: ", pname); - lua_writestringerror("%s\n", msg); -} - - - -static int report (lua_State *L, int status) { - if (status != LUA_OK) { - const char *msg = lua_tostring(L, -1); - l_message(progname, msg); - lua_pop(L, 1); - } - return status; -} - - - -static int msghandler (lua_State *L) { - const char *msg = lua_tostring(L, 1); - if (msg == NULL) { - if (luaL_callmeta(L, 1, "__tostring") && - lua_type(L, -1) == LUA_TSTRING) - return 1; - else - msg = lua_pushfstring(L, "(error object is a %s value)", - luaL_typename(L, 1)); - } - luaL_traceback(L, L, msg, 1); - return 1; -} - - - -static int docall (lua_State *L, int narg, int nres) { - int status; - int base = lua_gettop(L) - narg; - lua_pushcfunction(L, msghandler); - lua_insert(L, base); - globalL = L; - setsignal(SIGINT, laction); - status = lua_pcall(L, narg, nres, base); - setsignal(SIGINT, SIG_DFL); - lua_remove(L, base); - return status; -} - - -static void print_version (void) { - lua_writestring(LUA_COPYRIGHT, strlen(LUA_COPYRIGHT)); - lua_writeline(); -} - - - -static void createargtable (lua_State *L, char **argv, int argc, int script) { - int i, narg; - narg = argc - (script + 1); - lua_createtable(L, narg, script + 1); - for (i = 0; i < argc; i++) { - lua_pushstring(L, argv[i]); - lua_rawseti(L, -2, i - script); - } - lua_setglobal(L, "arg"); -} - - -static int dochunk (lua_State *L, int status) { - if (status == LUA_OK) status = docall(L, 0, 0); - return report(L, status); -} - - -static int dofile (lua_State *L, const char *name) { - return dochunk(L, luaL_loadfile(L, name)); -} - - -static int dostring (lua_State *L, const char *s, const char *name) { - return dochunk(L, luaL_loadbuffer(L, s, strlen(s), name)); -} - - - -static int dolibrary (lua_State *L, char *globname) { - int status; - char *suffix = NULL; - char *modname = strchr(globname, '='); - if (modname == NULL) { - modname = globname; - suffix = strchr(modname, *LUA_IGMARK); - } - else { - *modname = '\0'; - modname++; - } - lua_getglobal(L, "require"); - lua_pushstring(L, modname); - status = docall(L, 1, 1); - if (status == LUA_OK) { - if (suffix != NULL) - *suffix = '\0'; - lua_setglobal(L, globname); - } - return report(L, status); -} - - - -static int pushargs (lua_State *L) { - int i, n; - if (lua_getglobal(L, "arg") != LUA_TTABLE) - luaL_error(L, "'arg' is not a table"); - n = (int)luaL_len(L, -1); - luaL_checkstack(L, n + 3, "too many arguments to script"); - for (i = 1; i <= n; i++) - lua_rawgeti(L, -i, i); - lua_remove(L, -i); - return n; -} - - -static int handle_script (lua_State *L, char **argv) { - int status; - const char *fname = argv[0]; - if (strcmp(fname, "-") == 0 && strcmp(argv[-1], "--") != 0) - fname = NULL; - status = luaL_loadfile(L, fname); - if (status == LUA_OK) { - int n = pushargs(L); - status = docall(L, n, LUA_MULTRET); - } - return report(L, status); -} - - - -#define has_error 1 -#define has_i 2 -#define has_v 4 -#define has_e 8 -#define has_E 16 - - - -static int collectargs (char **argv, int *first) { - int args = 0; - int i; - if (argv[0] != NULL) { - if (argv[0][0]) - progname = argv[0]; - } - else { - *first = -1; - return 0; - } - for (i = 1; argv[i] != NULL; i++) { - *first = i; - if (argv[i][0] != '-') - return args; - switch (argv[i][1]) { - case '-': - if (argv[i][2] != '\0') - return has_error; - *first = i + 1; - return args; - case '\0': - return args; - case 'E': - if (argv[i][2] != '\0') - return has_error; - args |= has_E; - break; - case 'W': - if (argv[i][2] != '\0') - return has_error; - break; - case 'i': - args |= has_i; /* FALLTHROUGH */ - case 'v': - if (argv[i][2] != '\0') - return has_error; - args |= has_v; - break; - case 'e': - args |= has_e; - case 'l': - if (argv[i][2] == '\0') { - i++; - if (argv[i] == NULL || argv[i][0] == '-') - return has_error; - } - break; - default: - return has_error; - } - } - *first = 0; - return args; -} - - - -static int runargs (lua_State *L, char **argv, int n) { - int i; - for (i = 1; i < n; i++) { - int option = argv[i][1]; - lua_assert(argv[i][0] == '-'); - switch (option) { - case 'e': case 'l': { - int status; - char *extra = argv[i] + 2; - if (*extra == '\0') extra = argv[++i]; - lua_assert(extra != NULL); - status = (option == 'e') - ? dostring(L, extra, "=(command line)") - : dolibrary(L, extra); - if (status != LUA_OK) return 0; - break; - } - case 'W': - lua_warning(L, "@on", 0); - break; - } - } - return 1; -} - - -static int handle_luainit (lua_State *L) { - const char *name = "=" LUA_INITVARVERSION; - const char *init = getenv(name + 1); - if (init == NULL) { - name = "=" LUA_INIT_VAR; - init = getenv(name + 1); - } - if (init == NULL) return LUA_OK; - else if (init[0] == '@') - return dofile(L, init+1); - else - return dostring(L, init, name); -} - - - - -#if !defined(LUA_PROMPT) -#define LUA_PROMPT "> " -#define LUA_PROMPT2 ">> " -#endif - -#if !defined(LUA_MAXINPUT) -#define LUA_MAXINPUT 512 -#endif - - - -#if !defined(lua_stdin_is_tty) - -#if defined(LUA_USE_POSIX) - -#include -#define lua_stdin_is_tty() isatty(0) - -#elif defined(LUA_USE_WINDOWS) - -#include -#include - -#define lua_stdin_is_tty() _isatty(_fileno(stdin)) - -#else - - -#define lua_stdin_is_tty() 1 - -#endif - -#endif - - - -#if !defined(lua_readline) - -#if defined(LUA_USE_READLINE) - -#include -#include -#define lua_initreadline(L) ((void)L, rl_readline_name="lua") -#define lua_readline(L,b,p) ((void)L, ((b)=readline(p)) != NULL) -#define lua_saveline(L,line) ((void)L, add_history(line)) -#define lua_freeline(L,b) ((void)L, free(b)) - -#else - -#define lua_initreadline(L) ((void)L) -#define lua_readline(L,b,p) \ - ((void)L, fputs(p, stdout), fflush(stdout), \ - fgets(b, LUA_MAXINPUT, stdin) != NULL) -#define lua_saveline(L,line) { (void)L; (void)line; } -#define lua_freeline(L,b) { (void)L; (void)b; } - -#endif - -#endif - - - -static const char *get_prompt (lua_State *L, int firstline) { - if (lua_getglobal(L, firstline ? "_PROMPT" : "_PROMPT2") == LUA_TNIL) - return (firstline ? LUA_PROMPT : LUA_PROMPT2); - else { - const char *p = luaL_tolstring(L, -1, NULL); - lua_remove(L, -2); - return p; - } -} - - -#define EOFMARK "" -#define marklen (sizeof(EOFMARK)/sizeof(char) - 1) - - - -static int incomplete (lua_State *L, int status) { - if (status == LUA_ERRSYNTAX) { - size_t lmsg; - const char *msg = lua_tolstring(L, -1, &lmsg); - if (lmsg >= marklen && strcmp(msg + lmsg - marklen, EOFMARK) == 0) { - lua_pop(L, 1); - return 1; - } - } - return 0; -} - - - -static int pushline (lua_State *L, int firstline) { - char buffer[LUA_MAXINPUT]; - char *b = buffer; - size_t l; - const char *prmt = get_prompt(L, firstline); - int readstatus = lua_readline(L, b, prmt); - if (readstatus == 0) - return 0; - lua_pop(L, 1); - l = strlen(b); - if (l > 0 && b[l-1] == '\n') - b[--l] = '\0'; - if (firstline && b[0] == '=') - lua_pushfstring(L, "return %s", b + 1); - else - lua_pushlstring(L, b, l); - lua_freeline(L, b); - return 1; -} - - - -static int addreturn (lua_State *L) { - const char *line = lua_tostring(L, -1); - const char *retline = lua_pushfstring(L, "return %s;", line); - int status = luaL_loadbuffer(L, retline, strlen(retline), "=stdin"); - if (status == LUA_OK) { - lua_remove(L, -2); - if (line[0] != '\0') - lua_saveline(L, line); - } - else - lua_pop(L, 2); - return status; -} - - - -static int multiline (lua_State *L) { - for (;;) { - size_t len; - const char *line = lua_tolstring(L, 1, &len); - int status = luaL_loadbuffer(L, line, len, "=stdin"); - if (!incomplete(L, status) || !pushline(L, 0)) { - lua_saveline(L, line); - return status; - } - lua_pushliteral(L, "\n"); - lua_insert(L, -2); - lua_concat(L, 3); - } -} - - - -static int loadline (lua_State *L) { - int status; - lua_settop(L, 0); - if (!pushline(L, 1)) - return -1; - if ((status = addreturn(L)) != LUA_OK) - status = multiline(L); - lua_remove(L, 1); - lua_assert(lua_gettop(L) == 1); - return status; -} - - - -static void l_print (lua_State *L) { - int n = lua_gettop(L); - if (n > 0) { - luaL_checkstack(L, LUA_MINSTACK, "too many results to print"); - lua_getglobal(L, "print"); - lua_insert(L, 1); - if (lua_pcall(L, n, 0, 0) != LUA_OK) - l_message(progname, lua_pushfstring(L, "error calling 'print' (%s)", - lua_tostring(L, -1))); - } -} - - - -static void doREPL (lua_State *L) { - int status; - const char *oldprogname = progname; - progname = NULL; - lua_initreadline(L); - while ((status = loadline(L)) != -1) { - if (status == LUA_OK) - status = docall(L, 0, LUA_MULTRET); - if (status == LUA_OK) l_print(L); - else report(L, status); - } - lua_settop(L, 0); - lua_writeline(); - progname = oldprogname; -} - - - -#if !defined(luai_openlibs) -#define luai_openlibs(L) luaL_openselectedlibs(L, ~0, 0) -#endif - - - -static int pmain (lua_State *L) { - int argc = (int)lua_tointeger(L, 1); - char **argv = (char **)lua_touserdata(L, 2); - int script; - int args = collectargs(argv, &script); - int optlim = (script > 0) ? script : argc; - luaL_checkversion(L); - if (args == has_error) { - print_usage(argv[script]); - return 0; - } - if (args & has_v) - print_version(); - if (args & has_E) { - lua_pushboolean(L, 1); - lua_setfield(L, LUA_REGISTRYINDEX, "LUA_NOENV"); - } - luai_openlibs(L); - createargtable(L, argv, argc, script); - lua_gc(L, LUA_GCRESTART); - lua_gc(L, LUA_GCGEN); - if (!(args & has_E)) { - if (handle_luainit(L) != LUA_OK) - return 0; - } - if (!runargs(L, argv, optlim)) - return 0; - if (script > 0) { - if (handle_script(L, argv + script) != LUA_OK) - return 0; - } - if (args & has_i) - doREPL(L); - else if (script < 1 && !(args & (has_e | has_v))) { - if (lua_stdin_is_tty()) { - print_version(); - doREPL(L); - } - else dofile(L, NULL); - } - lua_pushboolean(L, 1); - return 1; -} - - - - -#endif - - -#ifdef MAKE_LUAC -//path: src/imports/../dependencies/lua/luac.c - - - -#define luac_c -#define LUA_CORE - - - - -#include -#include -#include -#include -#include - - - - - - - - - - - - -//path: src/imports/../dependencies/lua/lopnames.h - - -#if !defined(lopnames_h) -#define lopnames_h - -#include - - - - -static const char *const opnames[] = { - "MOVE", - "LOADI", - "LOADF", - "LOADK", - "LOADKX", - "LOADFALSE", - "LFALSESKIP", - "LOADTRUE", - "LOADNIL", - "GETUPVAL", - "SETUPVAL", - "GETTABUP", - "GETTABLE", - "GETI", - "GETFIELD", - "SETTABUP", - "SETTABLE", - "SETI", - "SETFIELD", - "NEWTABLE", - "SELF", - "ADDI", - "ADDK", - "SUBK", - "MULK", - "MODK", - "POWK", - "DIVK", - "IDIVK", - "BANDK", - "BORK", - "BXORK", - "SHRI", - "SHLI", - "ADD", - "SUB", - "MUL", - "MOD", - "POW", - "DIV", - "IDIV", - "BAND", - "BOR", - "BXOR", - "SHL", - "SHR", - "MMBIN", - "MMBINI", - "MMBINK", - "UNM", - "BNOT", - "NOT", - "LEN", - "CONCAT", - "CLOSE", - "TBC", - "JMP", - "EQ", - "LT", - "LE", - "EQK", - "EQI", - "LTI", - "LEI", - "GTI", - "GEI", - "TEST", - "TESTSET", - "CALL", - "TAILCALL", - "RETURN", - "RETURN0", - "RETURN1", - "FORLOOP", - "FORPREP", - "TFORPREP", - "TFORCALL", - "TFORLOOP", - "SETLIST", - "CLOSURE", - "VARARG", - "VARARGPREP", - "EXTRAARG", - NULL -}; - -#endif - - - - - - - - -static void PrintFunction(const Proto* f, int full); -#define luaU_print PrintFunction - -#define PROGNAME "luac" -#define OUTPUT PROGNAME ".out" - -static int listing=0; -static int dumping=1; -static int stripping=0; -static char Output[]={ OUTPUT }; -static const char* output=Output; -static const char* progname=PROGNAME; -static TString **tmname; - -static void fatal(const char* message) -{ - fprintf(stderr,"%s: %s\n",progname,message); - exit(EXIT_FAILURE); -} - -static void cannot(const char* what) -{ - fprintf(stderr,"%s: cannot %s %s: %s\n",progname,what,output,strerror(errno)); - exit(EXIT_FAILURE); -} - -static void usage(const char* message) -{ - if (*message=='-') - fprintf(stderr,"%s: unrecognized option '%s'\n",progname,message); - else - fprintf(stderr,"%s: %s\n",progname,message); - fprintf(stderr, - "usage: %s [options] [filenames]\n" - "Available options are:\n" - " -l list (use -l -l for full listing)\n" - " -o name output to file 'name' (default is \"%s\")\n" - " -p parse only\n" - " -s strip debug information\n" - " -v show version information\n" - " -- stop handling options\n" - " - stop handling options and process stdin\n" - ,progname,Output); - exit(EXIT_FAILURE); -} - -#define IS(s) (strcmp(argv[i],s)==0) - -static int doargs(int argc, char* argv[]) -{ - int i; - int version=0; - if (argv[0]!=NULL && *argv[0]!=0) progname=argv[0]; - for (i=1; itop.p+(i))) - -static const Proto* combine(lua_State* L, int n) -{ - if (n==1) - return toproto(L,-1); - else - { - Proto* f; - int i=n; - if (lua_load(L,reader,&i,"=(" PROGNAME ")",NULL)!=LUA_OK) fatal(lua_tostring(L,-1)); - f=toproto(L,-1); - for (i=0; ip[i]=toproto(L,i-n-1); - if (f->p[i]->sizeupvalues>0) f->p[i]->upvalues[0].instack=0; - } - return f; - } -} - -static int writer(lua_State* L, const void* p, size_t size, void* u) -{ - UNUSED(L); - return (fwrite(p,size,1,(FILE*)u)!=1) && (size!=0); -} - -static int pmain(lua_State* L) -{ - int argc=(int)lua_tointeger(L,1); - char** argv=(char**)lua_touserdata(L,2); - const Proto* f; - int i; - tmname=G(L)->tmname; - if (!lua_checkstack(L,argc)) fatal("too many input files"); - for (i=0; i1); - if (dumping) - { - FILE* D= (output==NULL) ? stdout : fopen(output,"wb"); - if (D==NULL) cannot("open"); - lua_lock(L); - luaU_dump(L,f,writer,D,stripping); - lua_unlock(L); - if (ferror(D)) cannot("write"); - if (fclose(D)) cannot("close"); - } - return 0; -} - -int main(int argc, char* argv[]) -{ - lua_State* L; - int i=doargs(argc,argv); - argc-=i; argv+=i; - if (argc<=0) usage("no input files given"); - L=luaL_newstate(); - if (L==NULL) fatal("cannot create state: not enough memory"); - lua_pushcfunction(L,&pmain); - lua_pushinteger(L,argc); - lua_pushlightuserdata(L,argv); - if (lua_pcall(L,2,0,0)!=LUA_OK) fatal(lua_tostring(L,-1)); - lua_close(L); - return EXIT_SUCCESS; -} - - - -#define UPVALNAME(x) ((f->upvalues[x].name) ? getstr(f->upvalues[x].name) : "-") -#define VOID(p) ((const void*)(p)) -#define eventname(i) (getstr(tmname[i])) - -static void PrintString(const TString* ts) -{ - const char* s=getstr(ts); - size_t i,n=tsslen(ts); - printf("\""); - for (i=0; ik[i]; - switch (ttypetag(o)) - { - case LUA_VNIL: - printf("N"); - break; - case LUA_VFALSE: - case LUA_VTRUE: - printf("B"); - break; - case LUA_VNUMFLT: - printf("F"); - break; - case LUA_VNUMINT: - printf("I"); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - printf("S"); - break; - default: - printf("?%d",ttypetag(o)); - break; - } - printf("\t"); -} - -static void PrintConstant(const Proto* f, int i) -{ - const TValue* o=&f->k[i]; - switch (ttypetag(o)) - { - case LUA_VNIL: - printf("nil"); - break; - case LUA_VFALSE: - printf("false"); - break; - case LUA_VTRUE: - printf("true"); - break; - case LUA_VNUMFLT: - { - char buff[100]; - sprintf(buff,LUA_NUMBER_FMT,fltvalue(o)); - printf("%s",buff); - if (buff[strspn(buff,"-0123456789")]=='\0') printf(".0"); - break; - } - case LUA_VNUMINT: - printf(LUA_INTEGER_FMT,ivalue(o)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - PrintString(tsvalue(o)); - break; - default: - printf("?%d",ttypetag(o)); - break; - } -} - -#define COMMENT "\t; " -#define EXTRAARG GETARG_Ax(code[pc+1]) -#define EXTRAARGC (EXTRAARG*(MAXARG_C+1)) -#define ISK (isk ? "k" : "") - -static void PrintCode(const Proto* f) -{ - const Instruction* code=f->code; - int pc,n=f->sizecode; - for (pc=0; pc0) printf("[%d]\t",line); else printf("[-]\t"); - printf("%-9s\t",opnames[o]); - switch (o) - { - case OP_MOVE: - printf("%d %d",a,b); - break; - case OP_LOADI: - printf("%d %d",a,sbx); - break; - case OP_LOADF: - printf("%d %d",a,sbx); - break; - case OP_LOADK: - printf("%d %d",a,bx); - printf(COMMENT); PrintConstant(f,bx); - break; - case OP_LOADKX: - printf("%d",a); - printf(COMMENT); PrintConstant(f,EXTRAARG); - break; - case OP_LOADFALSE: - printf("%d",a); - break; - case OP_LFALSESKIP: - printf("%d",a); - break; - case OP_LOADTRUE: - printf("%d",a); - break; - case OP_LOADNIL: - printf("%d %d",a,b); - printf(COMMENT "%d out",b+1); - break; - case OP_GETUPVAL: - printf("%d %d",a,b); - printf(COMMENT "%s",UPVALNAME(b)); - break; - case OP_SETUPVAL: - printf("%d %d",a,b); - printf(COMMENT "%s",UPVALNAME(b)); - break; - case OP_GETTABUP: - printf("%d %d %d",a,b,c); - printf(COMMENT "%s",UPVALNAME(b)); - printf(" "); PrintConstant(f,c); - break; - case OP_GETTABLE: - printf("%d %d %d",a,b,c); - break; - case OP_GETI: - printf("%d %d %d",a,b,c); - break; - case OP_GETFIELD: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_SETTABUP: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT "%s",UPVALNAME(a)); - printf(" "); PrintConstant(f,b); - if (isk) { printf(" "); PrintConstant(f,c); } - break; - case OP_SETTABLE: - printf("%d %d %d%s",a,b,c,ISK); - if (isk) { printf(COMMENT); PrintConstant(f,c); } - break; - case OP_SETI: - printf("%d %d %d%s",a,b,c,ISK); - if (isk) { printf(COMMENT); PrintConstant(f,c); } - break; - case OP_SETFIELD: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT); PrintConstant(f,b); - if (isk) { printf(" "); PrintConstant(f,c); } - break; - case OP_NEWTABLE: - printf("%d %d %d",a,b,c); - printf(COMMENT "%d",c+EXTRAARGC); - break; - case OP_SELF: - printf("%d %d %d%s",a,b,c,ISK); - if (isk) { printf(COMMENT); PrintConstant(f,c); } - break; - case OP_ADDI: - printf("%d %d %d",a,b,sc); - break; - case OP_ADDK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_SUBK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_MULK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_MODK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_POWK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_DIVK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_IDIVK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_BANDK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_BORK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_BXORK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_SHRI: - printf("%d %d %d",a,b,sc); - break; - case OP_SHLI: - printf("%d %d %d",a,b,sc); - break; - case OP_ADD: - printf("%d %d %d",a,b,c); - break; - case OP_SUB: - printf("%d %d %d",a,b,c); - break; - case OP_MUL: - printf("%d %d %d",a,b,c); - break; - case OP_MOD: - printf("%d %d %d",a,b,c); - break; - case OP_POW: - printf("%d %d %d",a,b,c); - break; - case OP_DIV: - printf("%d %d %d",a,b,c); - break; - case OP_IDIV: - printf("%d %d %d",a,b,c); - break; - case OP_BAND: - printf("%d %d %d",a,b,c); - break; - case OP_BOR: - printf("%d %d %d",a,b,c); - break; - case OP_BXOR: - printf("%d %d %d",a,b,c); - break; - case OP_SHL: - printf("%d %d %d",a,b,c); - break; - case OP_SHR: - printf("%d %d %d",a,b,c); - break; - case OP_MMBIN: - printf("%d %d %d",a,b,c); - printf(COMMENT "%s",eventname(c)); - break; - case OP_MMBINI: - printf("%d %d %d %d",a,sb,c,isk); - printf(COMMENT "%s",eventname(c)); - if (isk) printf(" flip"); - break; - case OP_MMBINK: - printf("%d %d %d %d",a,b,c,isk); - printf(COMMENT "%s ",eventname(c)); PrintConstant(f,b); - if (isk) printf(" flip"); - break; - case OP_UNM: - printf("%d %d",a,b); - break; - case OP_BNOT: - printf("%d %d",a,b); - break; - case OP_NOT: - printf("%d %d",a,b); - break; - case OP_LEN: - printf("%d %d",a,b); - break; - case OP_CONCAT: - printf("%d %d",a,b); - break; - case OP_CLOSE: - printf("%d",a); - break; - case OP_TBC: - printf("%d",a); - break; - case OP_JMP: - printf("%d",GETARG_sJ(i)); - printf(COMMENT "to %d",GETARG_sJ(i)+pc+2); - break; - case OP_EQ: - printf("%d %d %d",a,b,isk); - break; - case OP_LT: - printf("%d %d %d",a,b,isk); - break; - case OP_LE: - printf("%d %d %d",a,b,isk); - break; - case OP_EQK: - printf("%d %d %d",a,b,isk); - printf(COMMENT); PrintConstant(f,b); - break; - case OP_EQI: - printf("%d %d %d",a,sb,isk); - break; - case OP_LTI: - printf("%d %d %d",a,sb,isk); - break; - case OP_LEI: - printf("%d %d %d",a,sb,isk); - break; - case OP_GTI: - printf("%d %d %d",a,sb,isk); - break; - case OP_GEI: - printf("%d %d %d",a,sb,isk); - break; - case OP_TEST: - printf("%d %d",a,isk); - break; - case OP_TESTSET: - printf("%d %d %d",a,b,isk); - break; - case OP_CALL: - printf("%d %d %d",a,b,c); - printf(COMMENT); - if (b==0) printf("all in "); else printf("%d in ",b-1); - if (c==0) printf("all out"); else printf("%d out",c-1); - break; - case OP_TAILCALL: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT "%d in",b-1); - break; - case OP_RETURN: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT); - if (b==0) printf("all out"); else printf("%d out",b-1); - break; - case OP_RETURN0: - break; - case OP_RETURN1: - printf("%d",a); - break; - case OP_FORLOOP: - printf("%d %d",a,bx); - printf(COMMENT "to %d",pc-bx+2); - break; - case OP_FORPREP: - printf("%d %d",a,bx); - printf(COMMENT "exit to %d",pc+bx+3); - break; - case OP_TFORPREP: - printf("%d %d",a,bx); - printf(COMMENT "to %d",pc+bx+2); - break; - case OP_TFORCALL: - printf("%d %d",a,c); - break; - case OP_TFORLOOP: - printf("%d %d",a,bx); - printf(COMMENT "to %d",pc-bx+2); - break; - case OP_SETLIST: - printf("%d %d %d",a,b,c); - if (isk) printf(COMMENT "%d",c+EXTRAARGC); - break; - case OP_CLOSURE: - printf("%d %d",a,bx); - printf(COMMENT "%p",VOID(f->p[bx])); - break; - case OP_VARARG: - printf("%d %d",a,c); - printf(COMMENT); - if (c==0) printf("all out"); else printf("%d out",c-1); - break; - case OP_VARARGPREP: - printf("%d",a); - break; - case OP_EXTRAARG: - printf("%d",ax); - break; -#if 0 - default: - printf("%d %d %d",a,b,c); - printf(COMMENT "not handled"); - break; -#endif - } - printf("\n"); - } -} - - -#define SS(x) ((x==1)?"":"s") -#define S(x) (int)(x),SS(x) - -static void PrintHeader(const Proto* f) -{ - const char* s=f->source ? getstr(f->source) : "=?"; - if (*s=='@' || *s=='=') - s++; - else if (*s==LUA_SIGNATURE[0]) - s="(bstring)"; - else - s="(string)"; - printf("\n%s <%s:%d,%d> (%d instruction%s at %p)\n", - (f->linedefined==0)?"main":"function",s, - f->linedefined,f->lastlinedefined, - S(f->sizecode),VOID(f)); - printf("%d%s param%s, %d slot%s, %d upvalue%s, ", - (int)(f->numparams),f->is_vararg?"+":"",SS(f->numparams), - S(f->maxstacksize),S(f->sizeupvalues)); - printf("%d local%s, %d constant%s, %d function%s\n", - S(f->sizelocvars),S(f->sizek),S(f->sizep)); -} - -static void PrintDebug(const Proto* f) -{ - int i,n; - n=f->sizek; - printf("constants (%d) for %p:\n",n,VOID(f)); - for (i=0; isizelocvars; - printf("locals (%d) for %p:\n",n,VOID(f)); - for (i=0; ilocvars[i].varname),f->locvars[i].startpc+1,f->locvars[i].endpc+1); - } - n=f->sizeupvalues; - printf("upvalues (%d) for %p:\n",n,VOID(f)); - for (i=0; iupvalues[i].instack,f->upvalues[i].idx); - } -} - -static void PrintFunction(const Proto* f, int full) -{ - int i,n=f->sizep; - PrintHeader(f); - PrintCode(f); - if (full) PrintDebug(f); - for (i=0; ip[i],full); -} - -#endif - - - - -#endif - - -#ifndef privateluacembed_consts -#define privateluacembed_consts -//path: src/imports/../constants/consts.aplication.h -//mannaged by silver chain - -#ifndef LUA_CEMBED_INDEX_DIF -#define LUA_CEMBED_INDEX_DIF 1 -#endif - -#define PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE 1 -#define PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE 2 -#define LUA_CEMBED_DEFAULT_TIMEOUT 10 -#define LUA_CEMBED_DEFAULT_MEMORY_LIMIT 100 - -#define PRIVATE_LUA_CEMBED_ONE_MB (1024 * 1024) - - -//path: src/imports/../constants/consts.errors.h -//mannaged by silver chain - - - -#define PRIVATE_LUA_CEMBED_TIMEOUT_ERROR "timeout error" -#define PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED "arg %ld at function:%s not provided" -#define PRIVATE_LUA_CEMBED_ARG_WRONG_TYPE "arg %d at function:%s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_GLOBAL_WRONG_TYPE "global variable:%s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_RESULT_EVALUATION_WRONG_TYPE "result evaluation its:%s instead of %s" -#define PRIVATE_LUA_CEMBED_RESULT_EVALUATION_ARG_WRONG_TYPE "result evaluation of function %s at index %d its:%s instead of %s" - -#define PRIVATE_LUA_CEMBED_CODE_ITS_NOT_A_FUNCTION "value %s its not a function" -#define PRIVATE_LUA_CEMBED_WRONG_TYPE_PROPETY "propety %s at object %s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX "index %d at object %s its %s instead of %s" -#define PRIVATE_LUA_CEMBED_ELEMENT_DOES_NOT_HAVE_KEY "index %d at object %s not have a key" -#define PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR "timeout error" -#define PRIVATE_LUA_CEMBED_LIB_PROP_WRONG_TYPE "lib prop %s its %s insteadd of %s" - -//path: src/imports/../constants/consts.lua_code.h -//mannaged by silver chain - - -#define PRIVATE_LUA_CEMBED_TOTAL_LIBS "private_lua_c_embed_total_running_libs" -#define PRIVATE_LUA_CEMBED_STACK_LEVEL "private_lua_c_embed_stack_level" - -#define PRIVATE_LUA_CEMBED_EVALUATION_NAME "private_lua_c_embed_evaluation" -#define PRIVATE_LUA_CEMBED_DEL_PREFIX "__gc" -#define PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE "%s = %s\n" - - - - -#define PRIVATE_LUA_CEMBED_SELFNAME "private_lua_c_embed_self" -#define PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE "private_lua_c_embed_stage_area_table" -#define PRIVATE_LUA_CEMBED_TABLE_RETURN "private_lua_embed_table_return" - -#define PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__ "private_lua_c_embed_main_lib_table_%d" -#define PRIVATE_LUA_CEMBED_MAIN_LIB_SUB_TABLE "private_lua_c_embed_main_lib_table_%d_%s" - -#define PRIVATE_LUA_CEMBED_MAIN_META_TABLE__ "private_lua_c_embed_main_meta_table_%d" -#define PRIVATE_LUA_CEMBED_ANONYMOUS_TABLE_ "private_lua_c_embed_anononymous_table_%d_%d" -#define PRIVATE_LUA_CEMBED_ANONYMOUS_FUNC_TABLE_ "private_lua_c_embed_anononymous_func_table_%d_%d" -#define PRIVATE_LUA_CEMBED_ARGS_ "private_lua_c_embed_args_%d_%d" -#define PRIVATE_LUA_CEMBED_MULTIRETURN_ "private_lua_c_embed_multi_return_%d_%d" - -//path: src/imports/../constants/consts.main_callback.h -//mannaged by silver chain - - -#define PRIVATE_LUACEMBED_NO_RETURN 0 -#define PRIVATE_LUACEMBED_ONE_RETURN 1 - - - -//path: src/imports/../constants/consts.responses.h -//mannaged by silver chain - -#define PRIVATE_LUA_CEMBED_STRING_RESPONSE 1 -#define PRIVATE_LUA_CEMBED_LONG_RESPONSE 2 -#define PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE 3 -#define PRIVATE_LUA_CEMBED_BOOL_RESPONSE 4 -#define PRIVATE_LUA_CEMBED_TABLE_RESPONSE 5 - -#define PRIVATE_LUA_CEMBED_EVALUATION 6 -#define PRIVATE_LUA_CEMBED_ERROR_RESPONSE 7 -#define PRIVATE_LUA_CEMBED_MULTI_RESPONSE 8 - -#define LUA_CEMBED_OK 0 -#define LUA_CEMBED_GENERIC_ERROR (-1) - -//path: src/imports/../constants/consts.types.h -//mannaged by silver chain - -#define LUA_CEMBED_NOT_FOUND LUA_TNONE -#define LUA_CEMBED_STRING LUA_TSTRING -#define LUA_CEMBED_NUMBER LUA_TNUMBER -#define LUA_CEMBED_BOOL LUA_TBOOLEAN -#define LUA_CEMBED_NIL LUA_TNIL -#define LUA_CEMBED_FUNCTION LUA_TFUNCTION -#define LUA_CEMBED_TABLE LUA_TTABLE - -#define PRIVATE_LUA_CEMBED_NOT_FOUND_STRING "not Found" -#define PRIVATE_LUA_CEMBED_STRING_STRING "string" -#define PRIVATE_LUA_CEMBED_NUMBER_STRING "number" -#define PRIVATE_LUA_CEMBED_BOOL_STRING "boolean" -#define PRIVATE_LUA_CEMBED_NIL_STRING "nil" -#define PRIVATE_LUA_CEMBED_TABLE_STRING "table" -#define PRIVATE_LUA_CEMBED_FUNCTION_STRING "function" - -#define PRIVATE_LUA_CEMBED_UNKNOW_STRING "unknow" - -#endif - - -#ifndef privateluacembed_macros -#define privateluacembed_macros -//path: src/imports/../LuaCEmbed/macros.protection_macros.h -//mannaged by silver chain - -#define PRIVATE_LUA_CEMBED_PROTECT_VOID \ - if(!self){ \ - return; \ - } - - -#define PRIVATE_LUA_CEMBED_PROTECT_NUM \ - if(!self){ \ - return LUA_CEMBED_GENERIC_ERROR; \ - } - -#define PRIVATE_LUA_CEMBED_PROTECT_BOOL \ - if(!self){ \ - return false; \ - } - -#define PRIVATE_LUA_CEMBED_PROTECT_NULL \ - if(!self){ \ - return NULL; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK if(lua_gettop(self->main_object->state)){lua_settop(self->main_object->state,0);} - -#define PRIVATE_LUA_CEMBED_CLEAR_STACK if(lua_gettop(self->state)){lua_settop(self->state,0);} - - -//path: src/imports/../LuaCEmbed/table/macros.protection_macros.h -//mannaged by silver chain - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID \ - if(!self){ \ - return; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM \ - if(!self){ \ - return LUA_CEMBED_GENERIC_ERROR; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL \ - if(!self){ \ - return false; \ - } - -#define PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL \ - if(!self){ \ - return NULL; \ - } - - -#endif - - -#ifndef privateluacembed_types -#define privateluacembed_types -//path: src/imports/../LuaCEmbed/types.LuaCEmbed.h -//mannaged by silver chain - - -typedef struct LuaCEmbed{ - lua_State *state; - const char *current_function; - bool is_lib; - int total_args; - char *error_msg; - void (*delete_function)(struct LuaCEmbed *self); - void *global_tables; - void *func_tables; - int lib_identifier; - int stack_leve; - char *main_lib_table; - bool field_protection; -}LuaCEmbed; - -int lua_cembed_timeout = -1; -LuaCEmbed *global_current_lua_embed_object; - - -//path: src/imports/../LuaCEmbedResponse/types.LuaCembedResponse.h -//mannaged by silver chain - - -typedef struct { - - int type; - double num_val; - bool its_string_ref; - long string_size; - char *string_val; - -}LuaCEmbedResponse; - - -//path: src/imports/../types.typedefs.h -//mannaged by silver chain - -typedef long private_lua_cembed_incremented_arg ; - - -#endif - - -#ifndef privateluacembed_typesB -#define privateluacembed_typesB -//path: src/imports/../LuaCEmbed/table/table/typesB.table.h -//mannaged by silver chain - - - -typedef struct { - LuaCEmbed *main_object; - char *prop_name; - char *global_name; - void *sub_tables; - long index; - -}LuaCEmbedTable; - - -#endif - - -#ifndef privateluacembed_typesC -#define privateluacembed_typesC -//path: src/imports/../namespace/args/typesC.args.h -//mannaged by silver chain - - -typedef struct { - - - int (*size)(LuaCEmbed *self); - int (*get_type)(LuaCEmbed *self,int index); - long long (*get_long)(LuaCEmbed *self, int index); - double (*get_double)(LuaCEmbed *self, int index); - bool (*get_bool)(LuaCEmbed *self, int index); - char * (*get_raw_str)(LuaCEmbed *self, long *size, int index); - char * (*get_str)(LuaCEmbed *self, int index); - LuaCEmbedTable * (*get_table)(LuaCEmbed *self,int index); - int (*generate_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - int (*get_type_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - long long (*get_long_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - double (*get_double_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - bool (*get_bool_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - char* (*get_string_arg_clojure_evalation)(LuaCEmbed *self,int index,const char *code,...); - LuaCEmbedTable* (*run_lambda)(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call,int total_returns); - - - - -} LuaCembedArgsModule; - - -//path: src/imports/../namespace/globals/typesC.globals.h -//mannaged by silver chain - - - -typedef struct { - - int (*ensure_type)(LuaCEmbed *self, const char *name,int expected_type); - int (*get_type)(LuaCEmbed *self,const char *name); - long long (*get_long)(LuaCEmbed *self,const char *name); - double (*get_double)(LuaCEmbed *self,const char *name); - bool (*get_bool)(LuaCEmbed *self,const char *name); - char * (*get_string)(LuaCEmbed *self,const char *name); - LuaCEmbedTable* (*run_global_lambda)(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns); - void (*set_table)(LuaCEmbed *self, const char *name, LuaCEmbedTable *table); - void (*set_raw_string)(LuaCEmbed *self, const char *name, const char *value, long size); - char * (*get_raw_string)(LuaCEmbed *self, const char *name, long *size); - - - void (*set_string)(LuaCEmbed *self,const char *name,const char *value); - void (*set_long)(LuaCEmbed *self,const char *name,long long value); - void (*set_double)(LuaCEmbed *self,const char *name,double value); - void (*set_bool)(LuaCEmbed *self,const char *name,bool value); - - LuaCEmbedTable * (*get_table)(LuaCEmbed *self, const char *name); - LuaCEmbedTable * (*new_table)(LuaCEmbed *self, const char *name); - - -}LuaCEmbedGlobalModule; - - -//path: src/imports/../namespace/response/typesC.response.h -//mannaged by silver chain - - -typedef struct { - LuaCEmbedResponse * (*send_multi_return)(LuaCEmbedTable *table); - LuaCEmbedResponse * (*send_str)(const char *text); - LuaCEmbedResponse * (*send_raw_string)(const char *text,long size); - LuaCEmbedResponse * (*send_str_reference)( const char *text); - LuaCEmbedResponse * (*send_raw_string_reference)(const char *text,long size); - LuaCEmbedResponse * (*send_table)(LuaCEmbedTable *table); - LuaCEmbedResponse * (*send_evaluation_function)(const char *function); - LuaCEmbedResponse * (*send_double)(double value); - LuaCEmbedResponse * (*send_bool)(bool value); - LuaCEmbedResponse * (*send_long)(long value); - LuaCEmbedResponse * (*send_error)(const char *format,...); - -}LuaCEmbedResponseModule; - - -//path: src/imports/../namespace/table/typesC.table.h -//mannaged by silver chain - -typedef struct { - - void (*append_string)(LuaCEmbedTable *self, const char *value); - void (*append_long)(LuaCEmbedTable *self, long long value); - void (*append_double)(LuaCEmbedTable *self, double value); - void (*append_bool)(LuaCEmbedTable *self, bool value); - void (*append_table)(LuaCEmbedTable *self, LuaCEmbedTable *table); - void (*set_evaluation_prop)(LuaCEmbedTable *self, const char *name, const char *code, ...); - void (*append_evaluation)(LuaCEmbedTable *self, const char *code, ...); - - void (*insert_string_at_index)(LuaCEmbedTable *self, long index, const char *value); - void (*insert_bool_at_index)(LuaCEmbedTable *self, long index,bool value); - void (*insert_long_at_index)(LuaCEmbedTable *self, long long index,long value); - void (*insert_double_at_index)(LuaCEmbedTable *self, long index,double value); - void (*insert_table_at_index)(LuaCEmbedTable *self, long index,LuaCEmbedTable *table); - - - - void (*set_sub_table_by_index)(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table); - void (*set_string_by_index)(LuaCEmbedTable *self, long index, const char *value); - void (*set_long_by_index)(LuaCEmbedTable *self, long long index, long value); - void (*set_double_by_index)(LuaCEmbedTable *self, long index, double value); - void (*set_bool_by_index)(LuaCEmbedTable *self, long index, bool value); - void (*set_evaluation_by_index)(LuaCEmbedTable *self, long index, const char *code, ...); - long (*get_listable_size)(LuaCEmbedTable *self); - LuaCEmbedTable *(*get_sub_table_by_index)(LuaCEmbedTable *self, long index); - - LuaCEmbedTable *(*new_sub_table_appending)(LuaCEmbedTable *self); - - void (*set_method)(LuaCEmbedTable *self , const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)); - void (*set_string_prop)(LuaCEmbedTable *self , const char *name, const char *value); - void (*set_long_prop)(LuaCEmbedTable *self , const char *name, long long value); - void (*set_double_prop)(LuaCEmbedTable *self , const char *name, double value); - void (*set_bool_prop)(LuaCEmbedTable *self , const char *name, bool value); - int (*get_type_prop)(LuaCEmbedTable *self, const char *name); - char* (*get_string_prop)(LuaCEmbedTable *self , const char *name); - long long (*get_long_prop)(LuaCEmbedTable *self , const char *name); - double (*get_double_prop)(LuaCEmbedTable *self , const char *name); - bool (*get_bool_prop)(LuaCEmbedTable *self , const char *name); - LuaCEmbedTable * (*new_anonymous_table)(LuaCEmbed *self); - void (*destroy_prop)(LuaCEmbedTable *self, const char *name); - - LuaCEmbedTable *(*get_sub_table_prop)(LuaCEmbedTable *self, const char *name); - LuaCEmbedTable *(*new_sub_table_prop)(LuaCEmbedTable *self, const char *name); - void (*set_sub_table_prop)(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table); - char *(*get_key_by_index)(LuaCEmbedTable *self, long index); - bool (*has_key)(LuaCEmbedTable *self,long index); - - long (*get_size)(LuaCEmbedTable *self); - int (*get_type_by_index)(LuaCEmbedTable *self, int index); - long long (*get_long_by_index)(LuaCEmbedTable *self, int index); - double (*get_double_by_index)(LuaCEmbedTable *self, int index); - char * (*get_string_by_index)(LuaCEmbedTable *self, int index); - bool (*get_bool_by_index)(LuaCEmbedTable *self, int index); - -}LuaCembedTableModule; - - -//path: src/imports/../namespace/types/typesC.types.h -//mannaged by silver chain - - - -typedef struct { - int NOT_FOUND; - int STRING; - int NUMBER; - int BOOL; - int NILL; - int TABLE; - int FUNCTION; - - -}LuaCEmbedTypeModule; - - -#endif - - -#ifndef privateluacembed_typesD -#define privateluacembed_typesD -//path: src/imports/../namespace/LuaCEmbedNamespace/typesD.LuaCEmbedNamespace.h -//mannaged by silver chain - - -typedef struct{ - LuaCEmbedTypeModule types; - LuaCEmbedResponseModule response; - LuaCembedArgsModule args; - LuaCEmbedGlobalModule globals; - LuaCembedTableModule tables; - void (*clear_errors)(LuaCEmbed *self); - LuaCEmbed * (*newLuaLib)(lua_State *state); - void (*set_delete_function)(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)); - LuaCEmbed * (*newLuaEvaluation)(); - void (*load_native_libs)(LuaCEmbed *self); - void (*load_lib_from_c)(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name); - int (*perform)(LuaCEmbed *self); - const char * (*convert_arg_code)(int arg_code); - void (*set_memory_limit)(LuaCEmbed *self, double limit); - - char * (*get_error_message)(LuaCEmbed *self); - bool (*has_errors)(LuaCEmbed *self); - void (*set_timeout)(int seconds); - int (*evaluate)(LuaCEmbed *self, const char *code, ...); - char * (*get_string_evaluation)(LuaCEmbed *self,const char *code, ...); - int (*get_evaluation_type)(LuaCEmbed *self,const char *code,...); - long (*get_evaluation_size)(LuaCEmbed *self,const char *code,...); - long long (*get_evaluation_long)(LuaCEmbed *self,const char *code,...); - double (*get_evaluation_double)(LuaCEmbed *self,const char *code,...); - bool (*get_evaluation_bool)(LuaCEmbed *self, const char *code,...); - - void (*set_long_lib_prop)(LuaCEmbed *self,const char *name,long long value); - - void (*set_double_lib_prop)(LuaCEmbed *self,const char *name,double value); - void (*set_bool_lib_prop)(LuaCEmbed *self,const char *name,bool value); - void (*set_string_lib_prop)(LuaCEmbed *self,const char *name,const char * value); - void (*set_table_lib_prop)(LuaCEmbed *self,const char *name,LuaCEmbedTable *value); - - long long (*get_long_lib_prop)(LuaCEmbed *self,const char *name); - double (*get_double_lib_prop)(LuaCEmbed *self,const char *name); - bool (*get_bool_lib_prop)(LuaCEmbed *self,const char *name); - char * (*get_string_lib_prop)(LuaCEmbed *self,const char *name); - LuaCEmbedTable *(*get_table_lib_prop)(LuaCEmbed *self,const char *name); - - int (*evaluete_file)(LuaCEmbed *self, const char *file); - void (*add_callback)(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - void (*add_global_callback)(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - - void (*free)(LuaCEmbed *self); - -} LuaCEmbedNamespace; - - -#endif - - -#ifndef privateluacembed_fdeclare -#define privateluacembed_fdeclare -//path: src/imports/../LuaCEmbed/args/args_error/fdeclare.args_error.h -//mannaged by silver chain - - - -int LuaCEmbed_ensure_arg_exist(LuaCEmbed *self, private_lua_cembed_incremented_arg index); - -int private_LuaCEmbed_ensure_top_stack_arg_type(LuaCEmbed *self, int index,int arg_type); - - -//path: src/imports/../LuaCEmbed/args/basic/fdeclare.basic.h -//mannaged by silver chain - - -int privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, int index); - -int LuaCEmbed_get_total_args(LuaCEmbed *self); - -int LuaCEmbed_get_arg_type(LuaCEmbed *self,int index); - - - -long long LuaCEmbed_get_long_arg(LuaCEmbed *self, int index); - -double LuaCEmbed_get_double_arg(LuaCEmbed *self, int index); - -bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, int index); - -char * LuaCEmbed_get_str_arg(LuaCEmbed *self, int index); - -char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,long *size, int index); - -LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,int index); - -LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call, int total_returns); - - - -//path: src/imports/../LuaCEmbed/args/evaluation/fdeclare.evaluation.h -//mannaged by silver chain - - - -int private_LuaCembed_run_code_with_args(LuaCEmbed *self,int index,const char *code,va_list args); - -int privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,int index,int expected_type); - -int LuaCEmbed_get_type_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -int LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -long long LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - - -double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - -char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...); - - - -//path: src/imports/../LuaCEmbed/basic/fdeclare.basic.h -//mannaged by silver chain - - - - -LuaCEmbed * newLuaCEmbedEvaluation(); - - -int private_LuaCemb_internal_free(lua_State *L); - -void LuaCEmbed_load_lib_from_c(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name); - -void LuaCEmbed_load_native_libs(LuaCEmbed *self); - -void LuaCembed_set_delete_function(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)); - -char * LuaCEmbed_get_error_message(LuaCEmbed *self); - - -bool LuaCEmbed_has_errors(LuaCEmbed *self); - -void LuaCEmbed_clear_errors(LuaCEmbed *self); - -void privateLuaCEmbd_get_field_protected(LuaCEmbed *self,const char *name); - -void privateLuaCEmbed_raise_error_not_jumping(LuaCEmbed *self, const char *error, ...); - -void * privateLuaCEmbed_get_current_table_array(LuaCEmbed *self); - - -void LuaCEmbed_set_timeout(int seconds); - - - -void privata_LuaCEmbed_increment_stack_(LuaCEmbed *self); - - -void privata_LuaCEmbed_decrement_stack(LuaCEmbed *self); - -void LuaCEmbed_free(LuaCEmbed *self); - - - - -//path: src/imports/../LuaCEmbed/callback_handle/fdeclare.callback_handle.h -//mannaged by silver chain - - - -int privateLuaCEmbed_main_callback_handler(lua_State *L); - -void private_LuaCEmbed_add_lib_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args),bool global_functions ); - -void private_LuaCEmbed_add_evaluation_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - -void LuaCEmbed_add_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ); - - -void LuaCEmbed_add_global_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args)); - - - -//path: src/imports/../LuaCEmbed/evaluation/fdeclare.evaluation.h -//mannaged by silver chain - - - -#ifdef _WIN32 -VOID CALLBACK TimerHandler(HWND hwnd, UINT uMsg, UINT_PTR idEvent, DWORD dwTime); -#else - -void private_LuaCembed_handle_timeout(int signum); - -#endif - -int privateLuaCEmbed_start_func_evaluation(lua_State *state); - -int LuaCEmbed_evaluate(LuaCEmbed *self, const char *code, ...); - -int LuaCEmbed_evaluete_file(LuaCEmbed *self, const char *file); - - -int private_LuaCEmbed_ensure_evaluation_type(LuaCEmbed *self,int type); - -int private_LuaCEmbed_evaluate_puting_on_top_of_stack(LuaCEmbed *self,const char *code, va_list args); - -char * LuaCEmbed_get_evaluation_string(LuaCEmbed *self,const char *code, ...); - - -int LuaCEmbed_get_evaluation_type(LuaCEmbed *self,const char *code, ...); - - -long LuaCEmbed_get_evaluation_table_size(LuaCEmbed *self,const char *code, ...); - -long long LuaCEmbed_get_evaluation_long(LuaCEmbed *self,const char *code, ...); - -double LuaCEmbed_get_evaluation_double(LuaCEmbed *self,const char *code, ...); - -bool LuaCEmbed_get_evaluation_bool(LuaCEmbed *self,const char *code, ...); - - - - -//path: src/imports/../LuaCEmbed/globals/errors/fdeclare.errors.h -//mannaged by silver chain - - - - -int LuaCEmbed_ensure_global_type(LuaCEmbed *self, const char *name,int expected_type); - - -//path: src/imports/../LuaCEmbed/globals/getters/fdeclare.getters.h -//mannaged by silver chain - - - -int LuaCEmbed_get_global_type(LuaCEmbed *self,const char *name); - -long long LuaCEmbed_get_global_long(LuaCEmbed *self,const char *name); - -double LuaCEmbed_get_global_double(LuaCEmbed *self,const char *name); - -bool LuaCEmbed_get_global_bool(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_global_string(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_global_raw_string(LuaCEmbed *self,const char *name,long *size); - - -LuaCEmbedTable * LuaCembed_new_anonymous_table(LuaCEmbed *self); - -LuaCEmbedTable* LuaCEmbed_run_global_lambda(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns); - -LuaCEmbedTable * LuaCembed_get_global_table(LuaCEmbed *self, const char *name); - -LuaCEmbedTable * LuaCembed_new_global_table(LuaCEmbed *self, const char *name); - - -//path: src/imports/../LuaCEmbed/globals/setters/fdeclare.setters.h -//mannaged by silver chain - - -void LuaCEmbed_set_global_string(LuaCEmbed *self, const char *name, const char *value); - -void LuaCEmbed_set_global_raw_string(LuaCEmbed *self, const char *name, const char *value,long size); - -void LuaCEmbed_set_global_long(LuaCEmbed *self, const char *name, long long value); - -void LuaCEmbed_set_global_double(LuaCEmbed *self, const char *name, double value); - -void LuaCEmbed_set_global_bool(LuaCEmbed *self, const char *name, bool value); - -void LuaCEmbed_set_global_table(LuaCEmbed *self, const char *name, LuaCEmbedTable *table); - - -//path: src/imports/../LuaCEmbed/lib_props/fdeclare.lib_props.h -//mannaged by silver chain - - - -void LuaCEmbed_set_long_lib_prop(LuaCEmbed *self,const char *name,long long value); - -void LuaCEmbed_set_double_lib_prop(LuaCEmbed *self,const char *name,double value); - -void LuaCEmbed_set_bool_lib_prop(LuaCEmbed *self,const char *name,bool value); - -void LuaCEmbed_set_string_lib_prop(LuaCEmbed *self,const char *name,const char * value); - -void LuaCEmbed_set_table_lib_prop(LuaCEmbed *self,const char *name,LuaCEmbedTable *value); - -int private_LuaCEmbed_ensure_lib_prop_type(LuaCEmbed *self,const char *name,int expected_type);; - - -long long LuaCEmbed_get_long_lib_prop(LuaCEmbed *self,const char *name); - -double LuaCEmbed_get_double_lib_prop(LuaCEmbed *self,const char *name); - -bool LuaCEmbed_get_bool_lib_prop(LuaCEmbed *self,const char *name); - -char * LuaCEmbed_get_string_lib_prop(LuaCEmbed *self,const char *name); - -LuaCEmbedTable *LuaCEmbed_get_table_lib_prop(LuaCEmbed *self,const char *name); - - - -//path: src/imports/../LuaCEmbed/lib_start/fdeclare.lib_start.h -//mannaged by silver chain - - -int private_LuaCemb_internal_free(lua_State *L); - -LuaCEmbed * newLuaCEmbedLib(lua_State *state); - -int LuaCembed_perform(LuaCEmbed *self); - - -//path: src/imports/../LuaCEmbed/memory/fdeclare.memory.h -//mannaged by silver chain - - - -long lua_cembed_used_memory = 0; -long lua_cembed_memory_limit = -1; - -void LuaCEmbed_set_memory_limit(LuaCEmbed *self, double limit); - - -static void *private_LuaCembed_custom_allocator(void *ud, void *ptr, size_t osize, size_t nsize) ; - - - -//path: src/imports/../LuaCEmbed/table/table/append/fdeclare.append.h -//mannaged by silver chain - - - -void LuaCEmbedTable_append_table(LuaCEmbedTable *self, LuaCEmbedTable *table); - - -void LuaCEmbedTable_append_evaluation(LuaCEmbedTable *self, const char *code, ...); - -void LuaCEmbedTable_append_string(LuaCEmbedTable *self, const char *value); - -void LuaCEmbedTable_append_long(LuaCEmbedTable *self, long long value); - -void LuaCEmbedTable_append_double(LuaCEmbedTable *self, double value); - -void LuaCEmbedTable_append_bool(LuaCEmbedTable *self, bool value); - -//path: src/imports/../LuaCEmbed/table/table/basic/fdeclare.basic.h -//mannaged by silver chain - - - -LuaCEmbedTable * private_newLuaCembedTable(LuaCEmbed *main_embed, const char *format, ...); - -int private_lua_cEmbed_unpack(LuaCEmbedTable *self,const char * previews_function); - -void privateLuaCEmbedTable_free(LuaCEmbedTable *self); - -void privateLuaCEmbedTable_free_setting_nill(LuaCEmbedTable *self); - -//path: src/imports/../LuaCEmbed/table/table/destroy/fdeclare.destroy.h -//mannaged by silver chain - - - -void LuaCembedTable_destroy_prop(LuaCEmbedTable *self, const char *name); - -void LuaCEmbedTable_destroy_by_index(LuaCEmbedTable *self, long index); - -//path: src/imports/../LuaCEmbed/table/table/errors/fdeclare.errors.h -//mannaged by silver chain - - -int privateLuaCEmbedTable_ensure_type_with_key(LuaCEmbedTable *self, const char *name, int expected_type); - -int privateLuaCEmbedTable_ensure_type_with_index(LuaCEmbedTable *self, long index, int expected_type); - - -//path: src/imports/../LuaCEmbed/table/table/getters/index/fdeclare.index.h -//mannaged by silver chain - - - -char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, long index); - -bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, long index); - -long LuaCEmbedTable_get_full_size(LuaCEmbedTable *self); - -long LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self); - - -long privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cembed_incremented_arg index); - -int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, int index); - -long long LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, int index); - -double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, int index); - -char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, int index); - -bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, int index); - - - - -//path: src/imports/../LuaCEmbed/table/table/getters/keys/fdeclare.keys.h -//mannaged by silver chain - - - - -char* LuaCembedTable_get_string_prop(LuaCEmbedTable *self, const char *name); - -long long LuaCembedTable_get_long_prop(LuaCEmbedTable *self, const char *name); - -double LuaCembedTable_get_double_prop(LuaCEmbedTable *self, const char *name); - -bool LuaCembedTable_get_bool_prop(LuaCEmbedTable *self, const char *name); - -int LuaCEmbedTable_get_type_prop(LuaCEmbedTable *self, const char *name); - - -//path: src/imports/../LuaCEmbed/table/table/setters/index/fdeclare.index.h -//mannaged by silver chain - - -void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, long index, const char *value); - -void LuaCEmbedTable_set_long_by_index(LuaCEmbedTable *self, long long index, long value); - -void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, long index, double value); - -void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, long index, bool value); - - -void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, long index, const char *code, ...); - - -//path: src/imports/../LuaCEmbed/table/table/setters/insert/fdeclare.insert.h -//mannaged by silver chain - - - -void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, long formatted_index); - -void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, long index, const char *value); - -void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, long index,bool value); - -void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, long long index,long value); - -void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, long index,double value); - -void LuaCEmbedTable_insert_table_at_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *table); - - - -//path: src/imports/../LuaCEmbed/table/table/setters/keys/fdeclare.keys.h -//mannaged by silver chain - - - - - - -void LuaCEmbedTable_set_method(LuaCEmbedTable *self, const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)); - -void LuaCEmbedTable_set_string_prop(LuaCEmbedTable *self, const char *name, const char *value); - -void LuaCEmbedTable_set_long_prop(LuaCEmbedTable *self, const char *name, long long value); - -void LuaCEmbedTable_set_double_prop(LuaCEmbedTable *self, const char *name, double value); - -void LuaCEmbedTable_set_bool_prop(LuaCEmbedTable *self, const char *name, bool value); - - -void LuaCEmbedTable_set_evaluation_prop(LuaCEmbedTable *self, const char *name, const char *code, ...); - - - -//path: src/imports/../LuaCEmbed/table/table/sub_tables/index/fdeclare.index.h -//mannaged by silver chain - - - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_appending(LuaCEmbedTable *self); - - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, long index); - - -void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table); - - - - - -//path: src/imports/../LuaCEmbed/table/table/sub_tables/key/fdeclare.key.h -//mannaged by silver chain - - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_by_key(LuaCEmbedTable *self, const char *name); - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_key(LuaCEmbedTable *self, const char *name); - -void LuaCEmbedTable_set_sub_table_prop(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table); - -//path: src/imports/../LuaCEmbed/table/table_array/fdeclare.table_array.h -//mannaged by silver chain - - - -typedef struct { - - LuaCEmbedTable **tables; - long size; - -}privateLuaCEmbedTableArray; - -privateLuaCEmbedTableArray *newprivateLuaCEmbedTableArray(); - -void privateLuaCEmbedTableArray_append(privateLuaCEmbedTableArray *self,LuaCEmbedTable *element); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_global_name(privateLuaCEmbedTableArray *self, const char *name); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_prop_name(privateLuaCEmbedTableArray *self, const char *name); - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_internal_index(privateLuaCEmbedTableArray *self, long internal_index); - -void privateLuaCEmbedTableArray_free(privateLuaCEmbedTableArray *self); - - -//path: src/imports/../LuaCEmbedResponse/fdeclare.LuaCEmbedResponse.h -//mannaged by silver chain - - -LuaCEmbedResponse *private_LuaCEmbedReturn_raw(); - - -LuaCEmbedResponse * LuaCEmbed_send_str(const char *text); - -LuaCEmbedResponse * LuaCEmbed_send_raw_string(const char *text,long size); - -LuaCEmbedResponse * LuaCEmbed_send_str_reference( const char *text); - -LuaCEmbedResponse * LuaCEmbed_send_raw_string_reference(const char *text,long size); - -LuaCEmbedResponse * LuaCEmbed_send_error(const char *format,...); - - -LuaCEmbedResponse * LuaCEmbed_send_evaluation(const char *code); - - - - - -LuaCEmbedResponse * LuaCEmbed_send_double(double value); - -LuaCEmbedResponse * LuaCEmbed_send_bool(bool value); - - -LuaCEmbedResponse * LuaCEmbed_send_long(long value); - - -void private_LuaCEmbedResponse_free(LuaCEmbedResponse *self); - - -LuaCEmbedResponse * LuaCEmbed_send_table(LuaCEmbedTable *table); - - -LuaCEmbedResponse * LuaCEmbed_send_multi_return(LuaCEmbedTable *table); - - -//path: src/imports/../extra/fdeclare.extra.h -//mannaged by silver chain - - - -const char * LuaCembed_convert_arg_code(int arg_code); - - -char * private_LuaCembed_format_vaarg(const char *expresion, va_list args); - -char * private_LuaCembed_format(const char *expresion, ...); - - - - -//path: src/imports/../namespace/LuaCEmbedNamespace/fdeclare.LuaCEmbedNamespace.h -//mannaged by silver chain - - - -LuaCEmbedNamespace newLuaCEmbedNamespace(); - - -//path: src/imports/../namespace/args/fdeclare.args.h -//mannaged by silver chain - - -LuaCembedArgsModule newLuaCembedArgsModule(); - - -//path: src/imports/../namespace/globals/fdeclare.globals.h -//mannaged by silver chain - - -LuaCEmbedGlobalModule newLuaCEmbedGlobalModule(); - - -//path: src/imports/../namespace/response/fdeclare.response.h -//mannaged by silver chain - - - -LuaCEmbedResponseModule newLuaCEmbedResponseModule(); - - -//path: src/imports/../namespace/table/fdeclare.table.h -//mannaged by silver chain - - - -LuaCembedTableModule newLuaCembedTableModule(); - - -//path: src/imports/../namespace/types/fdeclare.types.h -//mannaged by silver chain - - - - -LuaCEmbedTypeModule newLuaCEmbedTypeModule(); - - -#endif - - -#ifndef privateluacembed_fdefine -#define privateluacembed_fdefine -//path: src/imports/../LuaCEmbed/args/args_error/fdefine.args_error.c -//mannaged by silver chain - - - -int LuaCEmbed_ensure_arg_exist(LuaCEmbed *self, private_lua_cembed_incremented_arg index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(index > self->total_args){ - - privateLuaCEmbed_raise_error_not_jumping(self, PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,index,self->current_function); - return LUA_CEMBED_GENERIC_ERROR; - } - return LUA_CEMBED_OK; - -} - -int private_LuaCEmbed_ensure_top_stack_arg_type(LuaCEmbed *self, int index,int arg_type) { - PRIVATE_LUA_CEMBED_PROTECT_NUM - int type = lua_type(self->state, -1); - if (type != arg_type) { - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_ARG_WRONG_TYPE, - index + LUA_CEMBED_INDEX_DIF, - self->current_function, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(arg_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - - return LUA_CEMBED_OK; - -} - - - -//path: src/imports/../LuaCEmbed/args/basic/fdefine.basic.c -//mannaged by silver chain - - -int privateLuaCEmbed_put_arg_on_top(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(formatted_index > self->total_args){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,formatted_index,self->current_function); - return LUA_CEMBED_GENERIC_ERROR; - } - - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - lua_getglobal(self->state,formated_arg); - int type = lua_type(self->state,-1); - if(type == LUA_CEMBED_NOT_FOUND || type == LUA_CEMBED_NIL){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_ARG_NOT_PROVIDED,formatted_index,self->current_function); - free(formated_arg); - return LUA_CEMBED_GENERIC_ERROR; - } - - free(formated_arg); - return LUA_OK; -} - -int LuaCEmbed_get_total_args(LuaCEmbed *self){ - return self->total_args; -} - - - -int LuaCEmbed_get_arg_type(LuaCEmbed *self,int index){ - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(formatted_index > self->total_args){ - return LUA_CEMBED_NIL; - } - - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - lua_getglobal(self->state,formated_arg); - int type = lua_type(self->state, -1); - free(formated_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return type; -} - - -long long LuaCEmbed_get_long_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_NUMBER)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - - long long result = (long long)lua_tonumber(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - - -double LuaCEmbed_get_double_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_NUMBER)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - double result = lua_tonumber(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - -bool LuaCEmbed_get_bool_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_BOOL)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return (long )LUA_CEMBED_NOT_FOUND; - } - bool result = lua_toboolean(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - - -char * LuaCEmbed_get_str_arg(LuaCEmbed *self, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - PRIVATE_LUA_CEMBED_CLEAR_STACK - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_STRING)){ - return NULL; - } - char *result = (char*)lua_tostring(self->state,-1); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} -char * LuaCEmbed_get_raw_str_arg(LuaCEmbed *self,long *size, int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - PRIVATE_LUA_CEMBED_CLEAR_STACK - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_STRING)){ - return NULL; - } - char *result = (char*)lua_tolstring(self->state,-1,(size_t*)size); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; -} - -LuaCEmbedTable * LuaCEmbed_get_arg_table(LuaCEmbed *self,int index){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_TABLE)){ - return NULL; - } - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - LuaCEmbedTable *created = LuaCembed_get_global_table(self,formated_arg); - free(formated_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return created; - -} - -LuaCEmbedTable* LuaCEmbed_run_args_lambda(LuaCEmbed *self, int index, LuaCEmbedTable *args_to_call, int total_returns){ - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - char *formatted_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,formatted_index-1); - - if(privateLuaCEmbed_put_arg_on_top(self,index)){ - PRIVATE_LUA_CEMBED_CLEAR_STACK - free(formatted_arg); - return NULL; - } - - if(private_LuaCEmbed_ensure_top_stack_arg_type(self,index,LUA_CEMBED_FUNCTION)){ - free(formatted_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - int total_args = private_lua_cEmbed_unpack(args_to_call,formatted_arg); - if(lua_pcall(self->state,total_args,total_returns,0)){ - - privateLuaCEmbed_raise_error_not_jumping(self, lua_tostring(self->state,-1)); - free(formatted_arg); - - PRIVATE_LUA_CEMBED_CLEAR_STACK - return NULL; - } - - - for(int i = 0; i < total_returns; i++){ - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - int position = (i +1) * -1; - lua_pushvalue(self->state,position); - lua_setglobal(self->state,formatted); - free(formatted); - } - - - - LuaCEmbedTable *result = LuaCembed_new_anonymous_table(self); - for(int i = 0; i < total_returns; i++){ - lua_getglobal(self->state,result->global_name); - lua_pushinteger(self->state,i+1); - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - lua_getglobal(self->state,formatted); - lua_settable(self->state,-3); - free(formatted); - } - free(formatted_arg); - PRIVATE_LUA_CEMBED_CLEAR_STACK - return result; - -} - - - -//path: src/imports/../LuaCEmbed/args/evaluation/fdefine.evaluation.c -//mannaged by silver chain - - - -int private_LuaCembed_run_code_with_args(LuaCEmbed *self,int index,const char *code,va_list args){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(LuaCEmbed_ensure_arg_exist(self,formatted_index)){ - return LUA_CEMBED_GENERIC_ERROR; - } - - char *formated_expresion = private_LuaCembed_format_vaarg(code,args); - - char *buffer = private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - formated_expresion - ); - - if(LuaCEmbed_evaluate(self, buffer)){ - free(formated_expresion); - free(buffer); - return LUA_CEMBED_GENERIC_ERROR; - } - free(buffer); - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - - int type = lua_type(self->state,-1); - - if(type != LUA_CEMBED_FUNCTION){ - privateLuaCEmbed_raise_error_not_jumping(self,PRIVATE_LUA_CEMBED_CODE_ITS_NOT_A_FUNCTION,formated_expresion); - free(formated_expresion); - return LUA_CEMBED_GENERIC_ERROR; - } - - free(formated_expresion); - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - privateLuaCEmbed_put_arg_on_top(self,index); - - if(lua_pcall(self->state,1,1,0)){ - const char *generated_error = lua_tostring(self->state,-1); - privateLuaCEmbed_raise_error_not_jumping(self, generated_error); - } - return LUA_CEMBED_OK; -} - -int privateLuaCembed_ensure_arg_evaluation_type(LuaCEmbed *self,int index,int expected_type){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - int actual_type = lua_type(self->state,-1); - if(actual_type== expected_type){ - return LUA_CEMBED_OK; - } - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_RESULT_EVALUATION_ARG_WRONG_TYPE, - self->current_function, - index, - LuaCembed_convert_arg_code(actual_type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} -int LuaCEmbed_get_type_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - return lua_type(self->state,-1); -} -int LuaCEmbed_generate_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - return LUA_CEMBED_OK; -} -long long LuaCEmbed_get_long_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (long long) lua_tonumber(self->state,-1); - -} - - -double LuaCEmbed_get_double_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (double ) lua_tonumber(self->state,-1); - -} - -bool LuaCEmbed_get_bool_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return possible_error; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return false; - } - return lua_toboolean(self->state,-1); - -} - -char* LuaCEmbed_get_string_arg_clojure_evalation(LuaCEmbed *self,int index,const char *code,...){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - va_list args; - va_start(args,code); - int possible_error = private_LuaCembed_run_code_with_args(self,index,code,args); - va_end(args); - if(possible_error){ - return NULL; - } - if(privateLuaCembed_ensure_arg_evaluation_type(self,index,LUA_CEMBED_NUMBER)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); - -} - - - -//path: src/imports/../LuaCEmbed/basic/fdefine.basic.c -//mannaged by silver chain - - - -LuaCEmbed * newLuaCEmbedEvaluation(){ - LuaCEmbed *self = (LuaCEmbed*) malloc(sizeof (LuaCEmbed)); - *self = (LuaCEmbed){0}; - self->state = luaL_newstate(); - - self->global_tables = (void*)newprivateLuaCEmbedTableArray(); - - return self; -} -void LuaCEmbed_load_lib_from_c(LuaCEmbed *self,int (*callback)(lua_State *l),const char *name){ - int result = callback(self->state); - if(result > 0){ - lua_setglobal(self->state,name); - } -} -void LuaCEmbed_load_native_libs(LuaCEmbed *self) { - luaL_openlibs(self->state); -} - - - - -void LuaCembed_set_delete_function(LuaCEmbed *self,void (*delelte_function)(struct LuaCEmbed *self)){ - self->delete_function = delelte_function; -} - - - - -void LuaCEmbed_set_timeout(int seconds){ - lua_cembed_timeout = seconds; -} - -char * LuaCEmbed_get_error_message(LuaCEmbed *self){ - if(!self){ - return NULL; - } - - return self->error_msg; -} -void LuaCEmbed_clear_errors(LuaCEmbed *self){ - if(!self){ - return; - } - - if(self->error_msg){ - free(self->error_msg); - self->error_msg = NULL; - } -} -void * privateLuaCEmbed_get_current_table_array(LuaCEmbed *self){ - if(self->current_function){ - return self->func_tables; - } - return self->global_tables; -} -void privateLuaCEmbed_raise_error_not_jumping(LuaCEmbed *self, const char *error_msg, ...){ - - if(LuaCEmbed_has_errors(self)){ - return; - } - - va_list args; - va_start(args,error_msg); - self->error_msg = private_LuaCembed_format_vaarg(error_msg, args); - va_end(args); - -} - - - -bool LuaCEmbed_has_errors(LuaCEmbed *self){ - if(!self){ - return true; - } - - if(self->error_msg){ - return true; - } - - return false; -} - - - - - - -void privata_LuaCEmbed_increment_stack_(LuaCEmbed *self){ - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - int value = 0; - if(lua_type(self->state,-1) == LUA_CEMBED_NUMBER){ - value = lua_tonumber(self->state,-1); - } - int new_value = value+1; - lua_pushinteger(self->state,new_value); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve =new_value; -} - - -void privata_LuaCEmbed_decrement_stack(LuaCEmbed *self){ - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - int value = 0; - if(lua_type(self->state,-1) == LUA_CEMBED_NUMBER){ - value = lua_tointeger(self->state,-1); - } - if(value> 0){ - int new_value = value -1; - lua_pushinteger(self->state,new_value); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve = new_value; - } - -} - -void privateLuaCEmbd_get_field_protected(LuaCEmbed *self,const char *name){ - bool old_field_proection = self->field_protection; - self->field_protection = true; - lua_getfield(self->state,-1,name); - self->field_protection = old_field_proection; -} - -void LuaCEmbed_free(LuaCEmbed *self){ - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->global_tables); - if(!self->is_lib){ //se for do próprio lua, o lua cuidará de limpar - lua_close(self->state); // Fecha o estado Lua - } - if(self->error_msg){ - free(self->error_msg); - } - if(self->main_lib_table){ - free(self->main_lib_table); - } - free(self); -} - - -//path: src/imports/../LuaCEmbed/callback_handle/fdefine.callback_handle.c -//mannaged by silver chain - - - -int privateLuaCEmbed_main_callback_handler(lua_State *L){ - - bool is_a_method = lua_toboolean(L, lua_upvalueindex(1)); - bool is_a_function = !is_a_method; - LuaCEmbedResponse *possible_return = NULL; - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(L,lua_upvalueindex(2)); - int old_total_args = self->total_args; - self->total_args = lua_gettop(self->state); - privata_LuaCEmbed_increment_stack_(self); - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_STACK_LEVEL); - self->stack_leve = (int)lua_tonumber(self->state,-1); - - for(int i = 0; i < self->total_args; i++){ - char *formated_arg = private_LuaCembed_format(PRIVATE_LUA_CEMBED_ARGS_,self->stack_leve,i); - lua_pushvalue(L,i+1); - lua_setglobal(L,formated_arg); - free(formated_arg); - } - - const char *func_name = lua_tostring(L,lua_upvalueindex(3)); - self->current_function = func_name; - void *old_funct_tables = self->func_tables; - self->func_tables = (void*)newprivateLuaCEmbedTableArray(); - if(is_a_method){ - LuaCEmbedResponse *(*method_callback)(LuaCEmbedTable *tb, LuaCEmbed *self); - - //equivalent of PRIVATE_LUA_CEMBED_SELFNAME = index[4] - lua_pushvalue(L, lua_upvalueindex(4)); - lua_setglobal(L,PRIVATE_LUA_CEMBED_SELFNAME); - - LuaCEmbedTable *table = private_newLuaCembedTable(self, PRIVATE_LUA_CEMBED_SELFNAME); - method_callback = (LuaCEmbedResponse *(*)(LuaCEmbedTable *tb, LuaCEmbed *self))lua_touserdata(L, lua_upvalueindex(5)); - possible_return = method_callback(table,self); - privateLuaCEmbedTable_free(table); - } - - if(is_a_function){ - LuaCEmbedResponse *(*function_callback)(LuaCEmbed *self); - function_callback = (LuaCEmbedResponse *(*)(LuaCEmbed *self))lua_touserdata(L, lua_upvalueindex(4)); - possible_return = function_callback(self); - } - - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->func_tables); - self->func_tables = old_funct_tables; - self->total_args = old_total_args; - privata_LuaCEmbed_decrement_stack(self); - PRIVATE_LUA_CEMBED_CLEAR_STACK - self->current_function = NULL; - - if(possible_return==NULL){ - return PRIVATE_LUACEMBED_NO_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_ERROR_RESPONSE){ - - if(self->field_protection){ - private_LuaCEmbedResponse_free(possible_return); - if(self->error_msg){ - free(self->error_msg); - self->error_msg = NULL; - } - - return PRIVATE_LUACEMBED_NO_RETURN; - } - - lua_pushstring(L, possible_return->string_val); - privateLuaCEmbed_raise_error_not_jumping(self,possible_return->string_val); - private_LuaCEmbedResponse_free(possible_return); - lua_error(L); - return PRIVATE_LUACEMBED_NO_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_LONG_RESPONSE){ - lua_pushinteger(L, (int)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_BOOL_RESPONSE){ - lua_pushboolean(L, (bool)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE){ - lua_pushnumber(L, possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_STRING_RESPONSE){ - lua_pushlstring(self->state,possible_return->string_val,possible_return->string_size); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE){ - lua_pushboolean(L, (bool)possible_return->num_val); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_TABLE_RESPONSE){ - lua_getglobal(self->state, PRIVATE_LUA_CEMBED_TABLE_RETURN); - lua_pushvalue(self->state,-1); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - } - - if(possible_return->type == PRIVATE_LUA_CEMBED_MULTI_RESPONSE){ - LuaCEmbedTable *table = private_newLuaCembedTable(self, PRIVATE_LUA_CEMBED_TABLE_RETURN); - int size =private_lua_cEmbed_unpack(table,NULL); - private_LuaCEmbedResponse_free(possible_return); - privateLuaCEmbedTable_free(table); - - return size; - } - - - if(possible_return->type == PRIVATE_LUA_CEMBED_EVALUATION){ - char *formated_function =private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - possible_return->string_val - ); - - int error_code = LuaCEmbed_evaluate(self, formated_function); - free(formated_function); - - if(error_code){ - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - } - - lua_getglobal(self->state, PRIVATE_LUA_CEMBED_EVALUATION_NAME); - int v_type = lua_type(self->state,-1); - if(v_type == LUA_CEMBED_FUNCTION){ - const int TOTAL_ARGS =0; - const int TOTAL_RETURNS =1; - if(lua_pcall(self->state,TOTAL_ARGS,TOTAL_RETURNS,0)){ - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - } - } - - lua_pushvalue(self->state,-1); - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_ONE_RETURN; - - } - - private_LuaCEmbedResponse_free(possible_return); - return PRIVATE_LUACEMBED_NO_RETURN; - -} - - -void private_LuaCEmbed_add_lib_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args),bool global_functions ){ - - char *main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - //get the table - lua_getglobal(self->state,main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,callback_name); - - //creating the clojure - - //creating the clojure - lua_pushboolean(self->state,false);//is a method - lua_pushlightuserdata(self->state,(void*)self); //self - lua_pushstring(self->state,callback_name);//calback name - lua_pushlightuserdata(self->state,(void*)callback);//calback - - lua_pushcclosure(self->state,privateLuaCEmbed_main_callback_handler,4); - - - lua_settable(self->state,-3); - if(global_functions){ - //it points the function to a global function - //like: callback = private_lua_c_embed_main_lib_table.callback - lua_getglobal(self->state, main_lib_table); - lua_getfield(self->state,-1,callback_name); - lua_setglobal(self->state, callback_name); - } - - lua_settop(self->state, 0); - free(main_lib_table); - -} - -void private_LuaCEmbed_add_evaluation_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - //creating the clojure - lua_pushboolean(self->state,false);//is a method - lua_pushlightuserdata(self->state,(void*)self); //self - lua_pushstring(self->state,callback_name);//calback name - lua_pushlightuserdata(self->state,(void*)callback);//calback - - lua_pushcclosure(self->state,privateLuaCEmbed_main_callback_handler,4); - lua_setglobal(self->state, callback_name); - lua_settop(self->state, 0); - -} - - -void LuaCEmbed_add_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args) ){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - if(self->is_lib){ - private_LuaCEmbed_add_lib_callback(self,callback_name,callback,false); - return; - } - private_LuaCEmbed_add_evaluation_callback(self,callback_name,callback); - -} - -void LuaCEmbed_add_global_callback(LuaCEmbed *self, const char *callback_name, LuaCEmbedResponse* (*callback)(LuaCEmbed *args)){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - if(self->is_lib){ - private_LuaCEmbed_add_lib_callback(self,callback_name,callback,true); - return; - } - private_LuaCEmbed_add_evaluation_callback(self,callback_name,callback); -} - -//path: src/imports/../LuaCEmbed/evaluation/fdefine.evaluation.c -//mannaged by silver chain - - - -#ifdef _WIN32 -VOID CALLBACK TimerHandler(HWND hwnd, UINT uMsg, UINT_PTR idEvent, DWORD dwTime) { - - privateLuaCEmbed_raise_error_not_jumping(global_current_lua_embed_object, PRIVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_pushstring(global_current_lua_embed_object->state,PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_error(global_current_lua_embed_object->state); -} - -#else - -void private_LuaCembed_handle_timeout(int signum) { - - privateLuaCEmbed_raise_error_not_jumping(global_current_lua_embed_object, PRIVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_pushstring(global_current_lua_embed_object->state,PRIVVATE_LUA_CEMBED_TIMEOUT_ERROR); - lua_error(global_current_lua_embed_object->state); -} - -#endif - - - -int privateLuaCEmbed_start_func_evaluation(lua_State *state){ - - int evaluation_type = lua_tointeger(state, lua_upvalueindex(1)); - char *text_value = (char*)lua_touserdata(state,lua_upvalueindex(2)); - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(state,lua_upvalueindex(3)); - global_current_lua_embed_object = self; - #ifdef _WIN32 - if (lua_cembed_timeout > 0) { - SetTimer(NULL, 0,lua_cembed_timeout > 0 * 1000, TimerHandler); - } - #else - if (lua_cembed_timeout > 0) { - signal(SIGALRM, private_LuaCembed_handle_timeout); - alarm(lua_cembed_timeout); - } - #endif - - int error = 0; - if(evaluation_type == PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE){ - error =luaL_dofile(self->state,text_value); - } - if(evaluation_type == PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE){ - error = luaL_dostring(self->state,text_value); - } - if(error){ - privateLuaCEmbed_raise_error_not_jumping(self,lua_tostring(self->state,-1)); - } - lua_pushinteger(self->state,error); - - return 1; - -} -int LuaCEmbed_evaluate(LuaCEmbed *self, const char *code, ...){ - - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - char * formated_expresion = private_LuaCembed_format_vaarg(code,args); - va_end(args); - lua_pushinteger(self->state,PRIVATE_LUA_EMBED_STRING_EVALUATION_TYPE); - lua_pushlightuserdata(self->state,(void*)formated_expresion); //code - lua_pushlightuserdata(self->state,(void*)self); //code - lua_pushcclosure(self->state,privateLuaCEmbed_start_func_evaluation,3); - lua_pcall(self->state,0,1,0); - int error = lua_tointeger(self->state,-1); - free(formated_expresion); - - return error; - -} - -int LuaCEmbed_evaluete_file(LuaCEmbed *self, const char *file){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - - lua_pushinteger(self->state,PRIVATE_LUA_EMBED_FILE_EVALUATION_TYPE); - lua_pushlightuserdata(self->state,(void*)file); //code - lua_pushlightuserdata(self->state,(void*)self); //code - lua_pushcclosure(self->state,privateLuaCEmbed_start_func_evaluation,3); - lua_pcall(self->state,0,1,0); - int error = lua_tointeger(self->state,-1); - return error; - -} - -int private_LuaCEmbed_evaluate_puting_on_top_of_stack(LuaCEmbed *self,const char *code, va_list args){ - - char * formated_expresion =private_LuaCembed_format_vaarg(code,args); - - char * buffer =private_LuaCembed_format( - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - formated_expresion - ); - - if(LuaCEmbed_evaluate(self, buffer)){ - free(formated_expresion); - free(buffer); - return LUA_CEMBED_GENERIC_ERROR; - } - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - - int type = lua_type(self->state,-1); - - if(type == LUA_CEMBED_FUNCTION){ - if(lua_pcall(self->state,0,1,0)){ - const char *generated_error = lua_tostring(self->state,-1); - privateLuaCEmbed_raise_error_not_jumping(self, generated_error); - } - } - free(formated_expresion); - free(buffer); - return LUA_CEMBED_OK; - -} -int private_LuaCEmbed_ensure_evaluation_type(LuaCEmbed *self,int type){ - - int actual_type = lua_type(self->state,-1); - if(actual_type== type){ - return LUA_CEMBED_OK; - } - - - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_RESULT_EVALUATION_WRONG_TYPE, - LuaCembed_convert_arg_code(actual_type), - LuaCembed_convert_arg_code(type) - ); - - return LUA_CEMBED_GENERIC_ERROR; -} - -char * LuaCEmbed_get_evaluation_string(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return NULL; - } - - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_STRING)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); - -} - - -int LuaCEmbed_get_evaluation_type(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - - return lua_type(self->state,-1); -} - - -long LuaCEmbed_get_evaluation_table_size(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_TABLE)){ - return LUA_CEMBED_GENERIC_ERROR; - } - - - return (long)lua_rawlen(self->state,-1); -} - - - -long long LuaCEmbed_get_evaluation_long(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (long)lua_tonumber(self->state,-1); - -} - -double LuaCEmbed_get_evaluation_double(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (double)lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_evaluation_bool(LuaCEmbed *self,const char *code, ...){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - - va_list args; - va_start(args,code); - int possible_error = private_LuaCEmbed_evaluate_puting_on_top_of_stack(self,code,args); - va_end(args); - if(possible_error){ - return LUA_CEMBED_GENERIC_ERROR; - } - if(private_LuaCEmbed_ensure_evaluation_type(self,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return (bool)lua_toboolean(self->state,-1); -} - - - -//path: src/imports/../LuaCEmbed/globals/errors/fdefine.errors.c -//mannaged by silver chain - - - - - -int LuaCEmbed_ensure_global_type(LuaCEmbed *self, const char *name,int expected_type){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - lua_getglobal(self->state,name); - int type = lua_type(self->state,-1); - - if(type != expected_type){ - privateLuaCEmbed_raise_error_not_jumping(self, - PRIVATE_LUA_CEMBED_GLOBAL_WRONG_TYPE, - name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - - return LUA_CEMBED_OK; - -} - -//path: src/imports/../LuaCEmbed/globals/getters/fdefine.getters.c -//mannaged by silver chain - - - -int LuaCEmbed_get_global_type(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - lua_getglobal(self->state, name); - return lua_type(self->state,-1); -} - -long long LuaCEmbed_get_global_long(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return (long )lua_tonumber(self->state,-1); -} - -double LuaCEmbed_get_global_double(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return (double )lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_global_bool(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_BOOL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - lua_getglobal(self->state, name); - return lua_toboolean(self->state,-1); -} - -char * LuaCEmbed_get_global_raw_string(LuaCEmbed *self,const char *name,long *size){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - lua_getglobal(self->state, name); - return (char*)lua_tolstring(self->state,-1,(size_t*)size); -} - -char * LuaCEmbed_get_global_string(LuaCEmbed *self,const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - lua_getglobal(self->state, name); - return (char*)lua_tostring(self->state,-1); -} - -LuaCEmbedTable * LuaCembed_new_anonymous_table(LuaCEmbed *self){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - - const char *format_raw = PRIVATE_LUA_CEMBED_ANONYMOUS_TABLE_; - if(self->current_function){ - format_raw =PRIVATE_LUA_CEMBED_ANONYMOUS_FUNC_TABLE_; - } - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - char *buffer= private_LuaCembed_format(format_raw, self->stack_leve, target->size); - LuaCEmbedTable *created_table =LuaCembed_new_global_table(self,buffer); - - free(buffer); - return created_table; -} - - - -LuaCEmbedTable * LuaCembed_get_global_table(LuaCEmbed *self, const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_TABLE)){ - return NULL; - } - - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,name); - if(possible){ - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s", name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} - -LuaCEmbedTable * LuaCembed_new_global_table(LuaCEmbed *self, const char *name){ - PRIVATE_LUA_CEMBED_PROTECT_NULL - - lua_newtable(self->state); - lua_setglobal(self->state,name); - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,name); - if(possible){ - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s", name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} - -LuaCEmbedTable* LuaCEmbed_run_global_lambda(LuaCEmbed *self, const char *name, LuaCEmbedTable *args_to_call, int total_returns){ - - PRIVATE_LUA_CEMBED_PROTECT_NULL - - if(LuaCEmbed_ensure_global_type(self,name,LUA_CEMBED_FUNCTION)){ - return NULL; - } - - int total_args = private_lua_cEmbed_unpack(args_to_call,name); - if(lua_pcall(self->state,total_args,total_returns,0)){ - privateLuaCEmbed_raise_error_not_jumping(self, lua_tostring(self->state,-1)); - return NULL; - } - - for(int i = 0; i < total_returns; i++){ - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_, self->stack_leve, i); - int position = (i +1) * -1; - lua_pushvalue(self->state,position); - lua_setglobal(self->state,formatted); - free(formatted); - } - - LuaCEmbedTable *result = LuaCembed_new_anonymous_table(self); - for(int i = 0; i < total_returns; i++){ - lua_getglobal(self->state,result->global_name); - lua_pushinteger(self->state,i+1); - char *formatted = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->stack_leve,i); - lua_getglobal(self->state,formatted); - lua_settable(self->state,-3); - free(formatted); - } - - return result; -} - - - -//path: src/imports/../LuaCEmbed/globals/setters/fdefine.setters.c -//mannaged by silver chain - - - -void LuaCEmbed_set_global_string(LuaCEmbed *self, const char *name, const char *value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushstring(self->state,value); - lua_setglobal(self->state,name); -} -void LuaCEmbed_set_global_raw_string(LuaCEmbed *self, const char *name, const char *value,long size){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushlstring(self->state,value,size); - lua_setglobal(self->state,name); -} - - -void LuaCEmbed_set_global_long(LuaCEmbed *self, const char *name, long long value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushnumber(self->state,(double )value); - lua_setglobal(self->state,name); -} - -void LuaCEmbed_set_global_double(LuaCEmbed *self, const char *name, double value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_pushnumber(self->state,(double )value); - lua_setglobal(self->state,name); -} - -void LuaCEmbed_set_global_bool(LuaCEmbed *self, const char *name, bool value){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - lua_pushboolean(self->state,value); - lua_setglobal(self->state,name); -} - - -void LuaCEmbed_set_global_table(LuaCEmbed *self, const char *name, LuaCEmbedTable *table){ - PRIVATE_LUA_CEMBED_PROTECT_VOID - - lua_getglobal(self->state,table->global_name); - lua_setglobal(self->state,name); -} - -//path: src/imports/../LuaCEmbed/lib_props/fdefine.lib_props.c -//mannaged by silver chain - - - -void LuaCEmbed_set_long_lib_prop(LuaCEmbed *self,const char *name,long long value){ - char *main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - lua_getglobal(self->state,main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushinteger(self->state,value); - lua_settable(self->state,-3); - free(main_lib_table); -} - -void LuaCEmbed_set_double_lib_prop(LuaCEmbed *self,const char *name,double value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushnumber(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_bool_lib_prop(LuaCEmbed *self,const char *name,bool value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushboolean(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_string_lib_prop(LuaCEmbed *self,const char *name,const char * value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - //set the function name - lua_pushstring(self->state,name); - lua_pushstring(self->state,value); - lua_settable(self->state,-3); - -} - -void LuaCEmbed_set_table_lib_prop(LuaCEmbed *self,const char *name,LuaCEmbedTable *value){ - - lua_getglobal(self->state,self->main_lib_table); - lua_pushvalue(self->state,-1); - lua_pushstring(self->state,name); - lua_getglobal(self->state,value->global_name); - lua_settable(self->state,-3); - -} - -int private_LuaCEmbed_ensure_lib_prop_type(LuaCEmbed *self,const char *name,int expected_type){ - int type = lua_type(self->state,-1); - if(type!= expected_type){ - privateLuaCEmbed_raise_error_not_jumping( - self, - PRIVATE_LUA_CEMBED_LIB_PROP_WRONG_TYPE, - name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; - } - return LUA_CEMBED_OK; -} - -long long LuaCEmbed_get_long_lib_prop(LuaCEmbed *self,const char *name){ - lua_getglobal(self->state,self->main_lib_table); - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_tointeger(self->state,-1); - -} - -double LuaCEmbed_get_double_lib_prop(LuaCEmbed *self,const char *name){ - - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_tonumber(self->state,-1); -} - -bool LuaCEmbed_get_bool_lib_prop(LuaCEmbed *self,const char *name){ - - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - return lua_toboolean(self->state,-1); -} - -char * LuaCEmbed_get_string_lib_prop(LuaCEmbed *self,const char *name){ - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_STRING)){ - return NULL; - } - return (char*)lua_tostring(self->state,-1); -} - -LuaCEmbedTable *LuaCEmbed_get_table_lib_prop(LuaCEmbed *self,const char *name){ -; - lua_getglobal(self->state,self->main_lib_table); - - lua_getfield(self->state, -1,name); - if(private_LuaCEmbed_ensure_lib_prop_type(self,name,LUA_CEMBED_TABLE)){ - return NULL; - } - - char *global_sub_table_name = private_LuaCembed_format( - PRIVATE_LUA_CEMBED_MAIN_LIB_SUB_TABLE, - self->lib_identifier, - name - ); - lua_setglobal(self->state,global_sub_table_name); - - privateLuaCEmbedTableArray *target = (privateLuaCEmbedTableArray*)privateLuaCEmbed_get_current_table_array(self); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_global_name(target,global_sub_table_name); - if(possible){ - free(global_sub_table_name); - return possible; - } - - LuaCEmbedTable *creaeted = private_newLuaCembedTable(self, "%s",global_sub_table_name); - free(global_sub_table_name); - - privateLuaCEmbedTableArray_append( - target, - creaeted - ); - return creaeted; -} - - -//path: src/imports/../LuaCEmbed/lib_start/fdefine.lib_start.c -//mannaged by silver chain - - -int private_LuaCemb_internal_free(lua_State *L){ - LuaCEmbed *self = (LuaCEmbed*)lua_touserdata(L, lua_upvalueindex(1)); - if(self->delete_function){ - self->delete_function(self); - } - LuaCEmbed_free(self); - return 0; -} -LuaCEmbed * newLuaCEmbedLib(lua_State *state){ - LuaCEmbed *self = (LuaCEmbed*) malloc(sizeof (LuaCEmbed)); - *self = (LuaCEmbed){0}; - - self->state = state; - - self->lib_identifier = 0; - - lua_getglobal(self->state,PRIVATE_LUA_CEMBED_TOTAL_LIBS); - if(lua_type(self->state,-1) == LUA_CEMBED_NIL){ - self->lib_identifier = lua_tointeger(self->state,-1); - } - - self->lib_identifier +=1; - - self->main_lib_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - - lua_pushinteger(self->state,self->lib_identifier); - lua_setglobal(self->state,PRIVATE_LUA_CEMBED_TOTAL_LIBS); - - - self->is_lib = true; - self->global_tables = (void*)newprivateLuaCEmbedTableArray(); - - - UniversalGarbage *garbage = newUniversalGarbage(); - char *lib_meta_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_META_TABLE__,self->lib_identifier); - UniversalGarbage_add_simple(garbage,lib_meta_table); - //creating the metatable - luaL_newmetatable(self->state, lib_meta_table); - //seting the clojure key - lua_pushstring(self->state,PRIVATE_LUA_CEMBED_DEL_PREFIX); - //set self as first clojure argument - lua_pushlightuserdata(self->state,(void*)self); - lua_pushcclosure(self->state,private_LuaCemb_internal_free,1); - lua_settable(self->state, -3); - - - char *lib_main_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - UniversalGarbage_add_simple(garbage,lib_main_table); - //creating the global table to store the elements - lua_newtable(self->state); - lua_setglobal(self->state,lib_main_table); - luaL_setmetatable(self->state, lib_meta_table); - - UniversalGarbage_free(garbage); - return self; -} - -int LuaCembed_perform(LuaCEmbed *self){ - PRIVATE_LUA_CEMBED_PROTECT_NUM - - char *lib_main_table = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MAIN_LIB_TABLE_NAME__,self->lib_identifier); - lua_getglobal(self->state,lib_main_table); - free(lib_main_table); - return 1; -} - - -//path: src/imports/../LuaCEmbed/memory/fdefine.memory.c -//mannaged by silver chain - - - -void LuaCEmbed_set_memory_limit(LuaCEmbed *self, double limit){ - lua_setallocf(self->state, private_LuaCembed_custom_allocator, &lua_cembed_used_memory); - lua_cembed_memory_limit = limit; -} -static void *private_LuaCembed_custom_allocator(void *ud, void *ptr, size_t osize, size_t nsize) { - int *used = (int *)ud; - - if (ptr == NULL) { - osize = 0; - } - - if (nsize == 0) { - free(ptr); - *used -= osize; - return NULL; - } else { - long custom_limit = (long)(lua_cembed_memory_limit * PRIVATE_LUA_CEMBED_ONE_MB); - if (*used + (nsize - osize) > custom_limit) - return NULL; - ptr = realloc(ptr, nsize); - if (ptr) - *used += (nsize - osize); - return ptr; - } -} - - - -//path: src/imports/../LuaCEmbed/table/table/append/fdefine.append.c -//mannaged by silver chain - -void LuaCEmbedTable_append_table(LuaCEmbedTable *self, LuaCEmbedTable *table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_getglobal(self->main_object->state,table->global_name); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_string(LuaCEmbedTable *self, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushstring(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_long(LuaCEmbedTable *self, long long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushnumber(self->main_object->state,(double)value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_double(LuaCEmbedTable *self, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushnumber(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_bool(LuaCEmbedTable *self, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_pushboolean(self->main_object->state,value); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_append_evaluation(LuaCEmbedTable *self, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - va_list args; - va_start(args,code); - char *buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate( - self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - long size = LuaCEmbedTable_get_listable_size(self); - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,size+1); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_rawset(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); -} - -//path: src/imports/../LuaCEmbed/table/table/basic/fdefine.basic.c -//mannaged by silver chain - - - - - -LuaCEmbedTable * private_newLuaCembedTable(LuaCEmbed *main_embed, const char *format, ...){ - - LuaCEmbedTable *self = (LuaCEmbedTable*)malloc(sizeof (LuaCEmbedTable)); - *self = (LuaCEmbedTable){0}; - self->main_object =main_embed; - - va_list args; - va_start(args,format); - self->global_name = private_LuaCembed_format_vaarg(format,args); - va_end(args); - - self->sub_tables = (void*)newprivateLuaCEmbedTableArray(); - - return self; -} - - int private_lua_cEmbed_unpack(LuaCEmbedTable *self,const char * previews_function){ - - long size = LuaCEmbedTable_get_listable_size(self); - lua_settop(self->main_object->state, 0); - - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - int total = 0; - - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - - lua_pushvalue(self->main_object->state,-1); - char *formated = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->main_object->stack_leve,total); - - lua_setglobal(self->main_object->state,formated); - free(formated); - lua_pop(self->main_object->state,1); - total+=1; - } - if(previews_function){ - lua_getglobal(self->main_object->state,previews_function); - } - for(int i = 0; i < size; i++){ - char *formated = private_LuaCembed_format(PRIVATE_LUA_CEMBED_MULTIRETURN_,self->main_object->stack_leve,i); - lua_getglobal(self->main_object->state,formated); - free(formated); - } - - return (int)size; -} -void privateLuaCEmbedTable_free(LuaCEmbedTable *self){ - - free(self->global_name); - - if(self->prop_name){ - free(self->prop_name); - } - - privateLuaCEmbedTableArray_free((privateLuaCEmbedTableArray*)self->sub_tables); - free(self); -} - - - -//path: src/imports/../LuaCEmbed/table/table/destroy/fdefine.destroy.c -//mannaged by silver chain - - - -void LuaCembedTable_destroy_prop(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnil(self->main_object->state); - lua_settable(self->main_object->state,-3); -} -void LuaCEmbedTable_destroy_by_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - if(LuaCembedTable_has_key_at_index(self,index)){ - char *key = LuaCembedTable_get_key_by_index(self,index); - LuaCembedTable_destroy_prop(self,key); - return; - } - - lua_getglobal(self->main_object->state,self->global_name); - - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int table_index = lua_gettop(self->main_object->state); - int total = 0; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total >= converted_index){ - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)(total)); - lua_pushvalue(self->main_object->state,-3); - lua_settable(self->main_object->state,-3); - lua_pop(self->main_object->state,1); - - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,total); - lua_pushnil(self->main_object->state); - lua_settable(self->main_object->state,-3); - - - -} - -//path: src/imports/../LuaCEmbed/table/table/errors/fdefine.errors.c -//mannaged by silver chain - - - - -int privateLuaCEmbedTable_ensure_type_with_key(LuaCEmbedTable *self, const char *name, int expected_type){ - if(!self){ - return LUA_CEMBED_GENERIC_ERROR; - } - - int type = lua_type(self->main_object->state,-1); - if(type == expected_type){ - return LUA_CEMBED_OK; - } - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_PROPETY, - name, - self->global_name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} - -int privateLuaCEmbedTable_ensure_type_with_index(LuaCEmbedTable *self, long index, int expected_type){ - if(!self){ - return LUA_CEMBED_GENERIC_ERROR; - } - - int type = lua_type(self->main_object->state,-1); - if(type == expected_type){ - return LUA_CEMBED_OK; - } - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(type), - LuaCembed_convert_arg_code(expected_type) - ); - return LUA_CEMBED_GENERIC_ERROR; -} - -//path: src/imports/../LuaCEmbed/table/table/getters/index/fdefine.index.c -//mannaged by silver chain - - - -long LuaCEmbedTable_get_full_size(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - - - lua_getglobal(self->main_object->state,self->global_name); - int index = lua_gettop(self->main_object->state); - long total = 0; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,index)){ - total+=1; - lua_pop(self->main_object->state,1); - } - - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return total; -} - -long LuaCEmbedTable_get_listable_size(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - lua_getglobal(self->main_object->state,self->global_name); - return (long)lua_rawlen(self->main_object->state,-1); -} - - -long privateLuaCEmbedTable_convert_index(LuaCEmbedTable *self, private_lua_cembed_incremented_arg index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - if(index >= 0){ - return index; - } - - return LuaCEmbedTable_get_full_size(self) + index; -} - -int LuaCEmbedTable_get_type_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - int type = lua_type(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return type; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_NOT_FOUND; -} -char *LuaCembedTable_get_key_by_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - - if(total == converted_index){ - if(lua_type(self->main_object->state,-2) != LUA_CEMBED_STRING ){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - char* result = (char*)lua_tostring(self->main_object->state,-2); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - - lua_pop(self->main_object->state,1); - total+=1; - - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} -bool LuaCembedTable_has_key_at_index(LuaCEmbedTable *self, long index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - lua_settop(self->main_object->state,0); - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - bool has_key =lua_type(self->main_object->state,-2) == LUA_CEMBED_STRING; - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return has_key; - } - - lua_pop(self->main_object->state,1); - total+=1; - } - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return false; -} - -long long LuaCEmbedTable_get_long_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - lua_settop(self->main_object->state,0); - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_NUMBER)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - long result = (long)lua_tonumber(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_NUMBER) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} - -double LuaCEmbedTable_get_double_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_NUMBER)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - double result = (double )lua_tonumber(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_NUMBER) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} - -char * LuaCEmbedTable_get_string_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_STRING)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - char * result = (char*)lua_tostring(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_STRING) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} - -bool LuaCEmbedTable_get_bool_by_index(LuaCEmbedTable *self, int index){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - - int formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_BOOL)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; - } - bool result = lua_toboolean(self->main_object->state,-1); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return result; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - converted_index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_BOOL) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return LUA_CEMBED_GENERIC_ERROR; -} - -//path: src/imports/../LuaCEmbed/table/table/getters/keys/fdefine.keys.c -//mannaged by silver chain - - -int LuaCEmbedTable_get_type_prop(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - return lua_type(self->main_object->state,-1); - -} - -char* LuaCembedTable_get_string_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_STRING)){ - return NULL; - } - - char *value = (char*)lua_tostring(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - - -long long LuaCembedTable_get_long_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - long long value = (long long)lua_tonumber(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - -double LuaCembedTable_get_double_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NUM - - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_NUMBER)){ - return LUA_CEMBED_GENERIC_ERROR; - } - double value = (double )lua_tonumber(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - -bool LuaCembedTable_get_bool_prop(LuaCEmbedTable *self , const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_BOOL - - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_BOOL)){ - return LUA_CEMBED_GENERIC_ERROR; - } - bool value = lua_toboolean(self->main_object->state,-1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return value; -} - - -//path: src/imports/../LuaCEmbed/table/table/setters/index/fdefine.index.c -//mannaged by silver chain - - - -void LuaCEmbedTable_set_string_by_index(LuaCEmbedTable *self, long index, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_string_prop(self,possible_key,value); - return; - } - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushstring(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_long_by_index(LuaCEmbedTable *self, long long index, long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_long_prop(self,possible_key,value); - return; - } - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushnumber(self->main_object->state,(double )value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_double_by_index(LuaCEmbedTable *self, long index, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_double_prop(self,possible_key,value); - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushnumber(self->main_object->state,(double )value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_bool_by_index(LuaCEmbedTable *self, long index, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_bool_prop(self,possible_key,value); - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_pushboolean(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - - -void LuaCEmbedTable_set_evaluation_by_index(LuaCEmbedTable *self, long index, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - va_list args; - va_start(args,code); - char * buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate(self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - lua_getglobal(self->main_object->state,self->global_name); - lua_pushnumber(self->main_object->state,(double)formatted_index); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - - -//path: src/imports/../LuaCEmbed/table/table/setters/insert/fdefine.insert.c -//mannaged by silver chain - - -void private_LuaCEmbedTable_add_space(LuaCEmbedTable *self, long formatted_index){ - - - lua_newtable(self->main_object->state); - lua_setglobal(self->main_object->state,PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - - lua_getglobal(self->main_object->state, self->global_name); - int table_index = lua_gettop(self->main_object->state); - int total = 1; - lua_pushnil(self->main_object->state); // Empilhando o primeiro par chave-valor - while (lua_next(self->main_object->state, table_index)) { - - if (total >= formatted_index) { - lua_getglobal(self->main_object->state, PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - lua_pushinteger(self->main_object->state, total + 1); - lua_pushvalue(self->main_object->state, -3); - lua_settable(self->main_object->state, -3); - lua_pop(self->main_object->state, 1); - } - lua_pop(self->main_object->state, 1); // Removendo o valor atual - total+=1; - } - - lua_getglobal(self->main_object->state, PRIVATE_LUA_CEMBED_STAGE_AREA_TABLE); - table_index = lua_gettop(self->main_object->state); - lua_pushnil(self->main_object->state); - - while (lua_next(self->main_object->state, table_index)) { - lua_getglobal(self->main_object->state,self->global_name); - lua_pushvalue(self->main_object->state,-3); //table[index] = stage_area[index] - lua_pushvalue(self->main_object->state,-3); //table[index] = stage_area[index] - lua_settable(self->main_object->state,-3); - lua_pop(self->main_object->state, 2); // Removendo o valor atual - } - - lua_getglobal(self->main_object->state, "stage_arrea"); - lua_pushnil(self->main_object->state); -} - -void LuaCEmbedTable_insert_string_at_index(LuaCEmbedTable *self, long index, const char *value) { - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushstring(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - - -void LuaCEmbedTable_insert_bool_at_index(LuaCEmbedTable *self, long index,bool value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushboolean(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_long_at_index(LuaCEmbedTable *self, long long index,long value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushinteger(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_double_at_index(LuaCEmbedTable *self, long index,double value){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_pushnumber(self->main_object->state, value); - lua_settable(self->main_object->state, -3); - - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -void LuaCEmbedTable_insert_table_at_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *table){ - - // Movendo os elementos existentes para frente - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - private_LuaCEmbedTable_add_space(self,formatted_index); - // Inserindo o novo valor na posição especificada - lua_getglobal(self->main_object->state, self->global_name); - lua_pushnumber(self->main_object->state, (double)formatted_index); - lua_getglobal(self->main_object->state,table->global_name); - lua_settable(self->main_object->state, -3); - // Limpando a pilha - lua_settop(self->main_object->state, 0); -} - -//path: src/imports/../LuaCEmbed/table/table/setters/keys/fdefine.keys.c -//mannaged by silver chain - - - - - -void LuaCEmbedTable_set_method(LuaCEmbedTable *self , const char *name, LuaCEmbedResponse *(*callback)(LuaCEmbedTable *self, LuaCEmbed *args)){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - bool is_meta = false; - - if(strlen(name) > 3){ - if(name[0] == '_' && name[1] == '_' ){ - is_meta = true; - } - } - lua_getglobal(self->main_object->state,self->global_name); - - if(is_meta){ - - - int found =lua_getmetatable(self->main_object->state,-1); - if(!found){ - - //equivalent of meta ={} ;setmetatable(table,meta) - lua_getglobal(self->main_object->state,self->global_name); - lua_newtable(self->main_object->state); - lua_setmetatable(self->main_object->state,-2); - - lua_getglobal(self->main_object->state,self->global_name); - lua_getmetatable(self->main_object->state,-1); - } - } - - - lua_pushstring(self->main_object->state,name); - //creating the clojure - - lua_pushboolean(self->main_object->state,true);//is a method - - lua_pushlightuserdata(self->main_object->state,(void*)self->main_object); //self - lua_pushstring(self->main_object->state,name);//calback name - lua_getglobal(self->main_object->state,self->global_name);//table - lua_pushlightuserdata(self->main_object->state,(void*)callback); - - //add these clojure to be handled by the callbacks - lua_pushcclosure(self->main_object->state,privateLuaCEmbed_main_callback_handler,5); - lua_settable(self->main_object->state,-3); - - if(is_meta){ - //equivalent of meta ={} ;setmetatable(table,meta) - lua_getglobal(self->main_object->state,self->global_name); - lua_getmetatable(self->main_object->state,-1); - lua_setmetatable(self->main_object->state,-2); - } - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_string_prop(LuaCEmbedTable *self , const char *name, const char *value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushstring(self->main_object->state,value); - - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_long_prop(LuaCEmbedTable *self , const char *name, long long value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnumber(self->main_object->state,(double)value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_double_prop(LuaCEmbedTable *self , const char *name, double value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushnumber(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_bool_prop(LuaCEmbedTable *self , const char *name, bool value){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_pushboolean(self->main_object->state,value); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -void LuaCEmbedTable_set_evaluation_prop(LuaCEmbedTable *self, const char *name, const char *code, ...){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - va_list args; - va_start(args,code); - char *buffer = private_LuaCembed_format_vaarg(code,args); - va_end(args); - - LuaCEmbed_evaluate(self->main_object, - PRIVATE_LUA_CEMBED_GLOBAL_EVALUATION_CODE, - PRIVATE_LUA_CEMBED_EVALUATION_NAME, - buffer - ); - free(buffer); - if(LuaCEmbed_has_errors(self->main_object)){ - return; - } - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_getglobal(self->main_object->state,PRIVATE_LUA_CEMBED_EVALUATION_NAME); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - -} - -//path: src/imports/../LuaCEmbed/table/table/sub_tables/index/fdefine.index.c -//mannaged by silver chain - - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_appending(LuaCEmbedTable *self){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - - //equivalent of: full_sub_table_name = {} - long index= LuaCEmbedTable_get_listable_size(self) +1; - char *full_sub_table_name = private_LuaCembed_format("%s_%d", self->global_name, index); - lua_newtable(self->main_object->state); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - //equivalent of: table[index] = full_sub_table_name - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,index); - lua_getglobal(self->main_object->state,full_sub_table_name); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_internal_index( - (privateLuaCEmbedTableArray *) self->sub_tables, - index - ); - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->index = index; - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; -} - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_index(LuaCEmbedTable *self, long index){ - - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - - lua_getglobal(self->main_object->state,self->global_name); - int table_index = lua_gettop(self->main_object->state); - long converted_index = privateLuaCEmbedTable_convert_index(self,formatted_index); - int total = 1; - - lua_pushnil(self->main_object->state); - while(lua_next(self->main_object->state,table_index)){ - if(total == converted_index){ - - if(privateLuaCEmbedTable_ensure_type_with_index(self,converted_index,LUA_CEMBED_TABLE)){ - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - - //equivalent of full_sub_table_name = table[index] - char *full_sub_table_name = private_LuaCembed_format("%s_%d", self->global_name, index); - lua_setglobal(self->main_object->state,full_sub_table_name); - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_internal_index( - (privateLuaCEmbedTableArray *) self->sub_tables, - index - ); - - if(possible){ - free(full_sub_table_name); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->index = index; - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - lua_pop(self->main_object->state,1); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; - } - lua_pop(self->main_object->state,1); - total+=1; - - } - - privateLuaCEmbed_raise_error_not_jumping( - self->main_object, - PRIVATE_LUA_CEMBED_WRONG_TYPE_INDEX, - index, - self->global_name, - LuaCembed_convert_arg_code(LUA_CEMBED_NIL), - LuaCembed_convert_arg_code(LUA_CEMBED_TABLE) - ); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; -} - -void LuaCEmbedTable_set_sub_table_by_index(LuaCEmbedTable *self, long index,LuaCEmbedTable *sub_table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - - char *possible_key = LuaCembedTable_get_key_by_index(self,index); - if(possible_key){ - LuaCEmbedTable_set_sub_table_prop(self,possible_key,sub_table); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return; - } - - long formatted_index = index + LUA_CEMBED_INDEX_DIF; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushinteger(self->main_object->state,formatted_index); - lua_getglobal(self->main_object->state,sub_table->global_name); - lua_settable(self->main_object->state,-3); - lua_settop(self->main_object->state, 0); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK -} - - -//path: src/imports/../LuaCEmbed/table/table/sub_tables/key/fdefine.key.c -//mannaged by silver chain - - -LuaCEmbedTable *LuaCEmbedTable_new_sub_table_by_key(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - //equivalent of: table.sub_table = {} - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_newtable(self->main_object->state); - lua_settable(self->main_object->state,-3); - - - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state, name); - lua_gettable(self->main_object->state, -2); - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_prop_name( - (privateLuaCEmbedTableArray *) self->sub_tables, - name - ); - - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->prop_name = strdup(name); - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; -} - - -LuaCEmbedTable *LuaCEmbedTable_get_sub_table_by_key(LuaCEmbedTable *self, const char *name){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_NULL - - - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - if(privateLuaCEmbedTable_ensure_type_with_key(self, name, LUA_CEMBED_TABLE)){ - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return NULL; - } - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - - - LuaCEmbedTable *possible = privateLuaCEmbedTableArray_find_by_prop_name( - (privateLuaCEmbedTableArray *) self->sub_tables, - name - ); - - - if(possible){ - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return possible; - } - - LuaCEmbedTable *created = private_newLuaCembedTable(self->main_object, full_sub_table_name); - created->prop_name = strdup(name); - - privateLuaCEmbedTableArray_append( - (privateLuaCEmbedTableArray*)self->sub_tables, - created - ); - - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK - return created; - -} - - - -void LuaCEmbedTable_set_sub_table_prop(LuaCEmbedTable *self, const char *name, LuaCEmbedTable *sub_table){ - PRIVATE_LUA_CEMBED_TABLE_PROTECT_VOID - - //equivalent of table.name = sub_table; - lua_getglobal(self->main_object->state,self->global_name); - lua_pushstring(self->main_object->state,name); - lua_getglobal(self->main_object->state,sub_table->global_name); - lua_settable(self->main_object->state,-3); - - - //equivalent of full_sub_table_name = table.sub_table - lua_getglobal(self->main_object->state,self->global_name); - privateLuaCEmbd_get_field_protected(self->main_object,name); - - char *full_sub_table_name = private_LuaCembed_format("%s_%s", self->global_name, name); - lua_setglobal(self->main_object->state,full_sub_table_name); - free(full_sub_table_name); - PRIVATE_LUA_CEMBED_TABLE_CLEAR_STACK -} - -//path: src/imports/../LuaCEmbed/table/table_array/fdefine.table_array.c -//mannaged by silver chain - - - -privateLuaCEmbedTableArray *newprivateLuaCEmbedTableArray(){ - privateLuaCEmbedTableArray *self = (privateLuaCEmbedTableArray*) malloc(sizeof (privateLuaCEmbedTableArray)); - *self = (privateLuaCEmbedTableArray){0}; - self->tables = (LuaCEmbedTable**)malloc(0); - return self; -} - -void privateLuaCEmbedTableArray_append(privateLuaCEmbedTableArray *self,LuaCEmbedTable *element){ - - self->tables = (LuaCEmbedTable **)realloc( - self->tables, - (self->size+1)* sizeof (LuaCEmbedTable**) - ); - self->tables[self->size] = element; - self->size+=1; -} - - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_prop_name(privateLuaCEmbedTableArray *self, const char *name){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(current_table->prop_name){ - if(strcmp(current_table->prop_name,name) ==0){ - return current_table; - } - } - } - return NULL; -} - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_global_name(privateLuaCEmbedTableArray *self, const char *name){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(strcmp(current_table->global_name,name) ==0){ - return current_table; - } - } - return NULL; -} - -LuaCEmbedTable *privateLuaCEmbedTableArray_find_by_internal_index(privateLuaCEmbedTableArray *self, long internal_index){ - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - if(current_table->index == internal_index){ - return current_table; - } - } - return NULL; -} - -void privateLuaCEmbedTableArray_free(privateLuaCEmbedTableArray *self){ - - for(int i = 0; i < self->size;i++){ - LuaCEmbedTable *current_table = self->tables[i]; - privateLuaCEmbedTable_free(current_table); - } - - free(self->tables); - free(self); -} - - -//path: src/imports/../LuaCEmbedResponse/fdefine.LuaCEmbedResponse.c -//mannaged by silver chain - - - - -LuaCEmbedResponse *private_LuaCEmbedReturn_raw(){ - LuaCEmbedResponse *self = (LuaCEmbedResponse*)malloc(sizeof(LuaCEmbedResponse)); - *self = (LuaCEmbedResponse){0}; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_bool(bool value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_BOOL_RESPONSE; - self->num_val = (double)value; - return self; -} - - -LuaCEmbedResponse * LuaCEmbed_send_str(const char *text){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = (long)strlen(text); - self->string_val = (char*)malloc(sizeof(char) * self->string_size +1); - memcpy(self->string_val,text,self->string_size); - self->string_val[self->string_size] = '\0'; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_raw_string(const char *text,long size){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = size; - self->string_val = (char*)malloc(sizeof(char) * self->string_size +1); - memcpy(self->string_val,text,self->string_size); - self->string_val[self->string_size] = '\0'; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_str_reference(const char *text){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = (long)strlen(text); - self->string_val = (char*)text; - self->its_string_ref = true; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_raw_string_reference(const char *text,long size){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_STRING_RESPONSE; - self->string_size = size; - self->string_val = (char*)text; - self->its_string_ref = true; - return self; -} - - - -LuaCEmbedResponse * LuaCEmbed_send_error(const char *format,...){ - - va_list args; - va_start(args,format); - char *error = private_LuaCembed_format_vaarg(format,args); - va_end(args); - - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_ERROR_RESPONSE; - self->string_val = error; - return self; -} - - -LuaCEmbedResponse * LuaCEmbed_send_multi_return(LuaCEmbedTable *table){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_MULTI_RESPONSE; - lua_getglobal(table->main_object->state,table->global_name); - lua_setglobal(table->main_object->state,PRIVATE_LUA_CEMBED_TABLE_RETURN); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_table(LuaCEmbedTable *table){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_TABLE_RESPONSE; - lua_getglobal(table->main_object->state,table->global_name); - lua_setglobal(table->main_object->state,PRIVATE_LUA_CEMBED_TABLE_RETURN); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_evaluation(const char *code){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_EVALUATION; - self->string_val = strdup(code); - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_double(double value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_DOUBLE_RESPONSE; - self->num_val = value; - return self; -} - -LuaCEmbedResponse * LuaCEmbed_send_long(long value){ - LuaCEmbedResponse * self= private_LuaCEmbedReturn_raw(); - self->type = PRIVATE_LUA_CEMBED_LONG_RESPONSE; - self->num_val = (double)value; - return self; -} - - - -void private_LuaCEmbedResponse_free(LuaCEmbedResponse *self){ - - if(self->string_val && self->its_string_ref == false){ - free(self->string_val); - } - free(self); -} - - -//path: src/imports/../extra/fdefine.extra.c -//mannaged by silver chain - - - -const char * LuaCembed_convert_arg_code(int arg_code){ - if(arg_code == LUA_CEMBED_NOT_FOUND){ - return PRIVATE_LUA_CEMBED_NOT_FOUND_STRING; - } - - if(arg_code == LUA_CEMBED_STRING){ - return PRIVATE_LUA_CEMBED_STRING_STRING; - - } - if(arg_code == LUA_CEMBED_NUMBER){ - return PRIVATE_LUA_CEMBED_NUMBER_STRING; - } - if(arg_code == LUA_CEMBED_BOOL){ - return PRIVATE_LUA_CEMBED_BOOL_STRING; - } - if(arg_code == LUA_CEMBED_NIL){ - return PRIVATE_LUA_CEMBED_NIL_STRING; - } - if(arg_code == LUA_CEMBED_TABLE){ - return PRIVATE_LUA_CEMBED_TABLE_STRING; - } - if(arg_code == LUA_CEMBED_FUNCTION){ - return PRIVATE_LUA_CEMBED_FUNCTION_STRING; - } - - return PRIVATE_LUA_CEMBED_UNKNOW_STRING; -} - -char * private_LuaCembed_format_vaarg(const char *expresion, va_list args){ - - va_list args_copy; - va_copy(args_copy, args); - long required_size = vsnprintf(NULL, 0,expresion,args_copy); - va_end(args_copy); - char *buffer = (char*)malloc(sizeof(char) * required_size + 2); - vsnprintf(buffer,sizeof (char) * required_size+1,expresion,args); - return buffer; -} -char * private_LuaCembed_format(const char *expresion, ...){ - va_list args; - va_start(args,expresion); - char *result = private_LuaCembed_format_vaarg(expresion,args); - va_end(args); - return result; -} - -//path: src/imports/../namespace/LuaCEmbedNamespace/fdefine.LuaCEmbedNamespace.c -//mannaged by silver chain - - - - -LuaCEmbedNamespace newLuaCEmbedNamespace(){ - LuaCEmbedNamespace self = {0}; - self.newLuaLib = newLuaCEmbedLib; - self.load_lib_from_c = LuaCEmbed_load_lib_from_c; - self.newLuaEvaluation = newLuaCEmbedEvaluation; - self.set_delete_function = LuaCembed_set_delete_function; - self.perform = LuaCembed_perform; - self.load_native_libs = LuaCEmbed_load_native_libs; - self.set_memory_limit = LuaCEmbed_set_memory_limit; - self.clear_errors = LuaCEmbed_clear_errors; - self.convert_arg_code = LuaCembed_convert_arg_code; - self.tables = newLuaCembedTableModule(); - self.args = newLuaCembedArgsModule(); - self.types = newLuaCEmbedTypeModule(); - self.globals = newLuaCEmbedGlobalModule(); - self.response = newLuaCEmbedResponseModule(); - self.get_error_message = LuaCEmbed_get_error_message; - self.has_errors = LuaCEmbed_has_errors; - self.set_timeout = LuaCEmbed_set_timeout; - self.evaluate = LuaCEmbed_evaluate; - self.get_string_evaluation = LuaCEmbed_get_evaluation_string; - self.get_evaluation_type = LuaCEmbed_get_evaluation_type; - self.get_evaluation_size = LuaCEmbed_get_evaluation_table_size; - self.get_evaluation_long = LuaCEmbed_get_evaluation_long; - self.get_evaluation_double = LuaCEmbed_get_evaluation_double; - self.get_evaluation_bool = LuaCEmbed_get_evaluation_bool; - self.evaluete_file = LuaCEmbed_evaluete_file; - self.add_callback = LuaCEmbed_add_callback; - self.add_global_callback = LuaCEmbed_add_global_callback; - self.set_bool_lib_prop = LuaCEmbed_set_bool_lib_prop; - self.set_long_lib_prop = LuaCEmbed_set_long_lib_prop; - self.set_double_lib_prop = LuaCEmbed_set_double_lib_prop; - self.set_string_lib_prop = LuaCEmbed_set_string_lib_prop; - self.set_table_lib_prop = LuaCEmbed_set_table_lib_prop; - self.get_long_lib_prop = LuaCEmbed_get_long_lib_prop; - self.get_double_lib_prop = LuaCEmbed_get_double_lib_prop; - self.get_bool_lib_prop = LuaCEmbed_get_bool_lib_prop; - self.get_string_lib_prop = LuaCEmbed_get_string_lib_prop; - self.get_table_lib_prop = LuaCEmbed_get_table_lib_prop; - - self.free = LuaCEmbed_free; - return self; -} - - -//path: src/imports/../namespace/args/fdefine.args.c -//mannaged by silver chain - - - -LuaCembedArgsModule newLuaCembedArgsModule(){ - LuaCembedArgsModule self = {0}; - self.get_bool = LuaCEmbed_get_bool_arg; - self.get_long = LuaCEmbed_get_long_arg; - self.get_double = LuaCEmbed_get_double_arg; - self.get_str = LuaCEmbed_get_str_arg; - self.get_raw_str = LuaCEmbed_get_raw_str_arg; - self.get_type = LuaCEmbed_get_arg_type; - self.get_table = LuaCEmbed_get_arg_table; - self.size = LuaCEmbed_get_total_args; - self.get_type_clojure_evalation = LuaCEmbed_get_type_clojure_evalation; - self.generate_arg_clojure_evalation = LuaCEmbed_generate_arg_clojure_evalation; - self.get_bool_arg_clojure_evalation = LuaCEmbed_get_bool_arg_clojure_evalation; - self.get_long_arg_clojure_evalation = LuaCEmbed_get_long_arg_clojure_evalation; - self.get_double_arg_clojure_evalation = LuaCEmbed_get_double_arg_clojure_evalation; - self.get_string_arg_clojure_evalation = LuaCEmbed_get_string_arg_clojure_evalation; - self.run_lambda = LuaCEmbed_run_args_lambda; - return self; -} - -//path: src/imports/../namespace/globals/fdefine.globals.c -//mannaged by silver chain - - - -LuaCEmbedGlobalModule newLuaCEmbedGlobalModule(){ - LuaCEmbedGlobalModule self = {0}; - self.ensure_type = LuaCEmbed_ensure_global_type; - self.get_double = LuaCEmbed_get_global_double; - self.get_string = LuaCEmbed_get_global_string; - self.get_long = LuaCEmbed_get_global_long; - self.get_raw_string = LuaCEmbed_get_global_raw_string; - self.set_raw_string = LuaCEmbed_set_global_raw_string; - self.get_bool = LuaCEmbed_get_global_bool; - self.get_type = LuaCEmbed_get_global_type; - self.run_global_lambda = LuaCEmbed_run_global_lambda; - self.set_table = LuaCEmbed_set_global_table; - self.set_string = LuaCEmbed_set_global_string; - self.set_bool = LuaCEmbed_set_global_bool; - self.set_double = LuaCEmbed_set_global_double; - self.set_long = LuaCEmbed_set_global_long; - self.new_table = LuaCembed_new_global_table; - self.get_table = LuaCembed_get_global_table; - - return self; -} - -//path: src/imports/../namespace/response/fdefine.response.c -//mannaged by silver chain - - - -LuaCEmbedResponseModule newLuaCEmbedResponseModule(){ - LuaCEmbedResponseModule self = {0}; - self.send_multi_return = LuaCEmbed_send_multi_return; - self.send_str = LuaCEmbed_send_str; - self.send_str_reference = LuaCEmbed_send_str_reference; - self.send_raw_string = LuaCEmbed_send_raw_string; - self.send_raw_string_reference = LuaCEmbed_send_raw_string_reference; - self.send_bool = LuaCEmbed_send_bool; - self.send_double = LuaCEmbed_send_double; - self.send_evaluation_function = LuaCEmbed_send_evaluation; - self.send_long = LuaCEmbed_send_long; - self.send_table = LuaCEmbed_send_table; - self.send_error = LuaCEmbed_send_error; - return self; -} - - -//path: src/imports/../namespace/table/fdefine.table.c -//mannaged by silver chain - - - -LuaCembedTableModule newLuaCembedTableModule(){ - LuaCembedTableModule self ={0}; - - self.append_string = LuaCEmbedTable_append_string; - self.append_bool = LuaCEmbedTable_append_bool; - self.append_double = LuaCEmbedTable_append_double; - self.append_long = LuaCEmbedTable_append_long; - self.append_table = LuaCEmbedTable_append_table; - self.append_evaluation = LuaCEmbedTable_append_evaluation; - - self.insert_string_at_index = LuaCEmbedTable_insert_string_at_index; - self.insert_double_at_index = LuaCEmbedTable_insert_double_at_index; - self.insert_long_at_index = LuaCEmbedTable_insert_long_at_index; - self.insert_table_at_index = LuaCEmbedTable_insert_table_at_index; - - self.set_evaluation_prop = LuaCEmbedTable_set_evaluation_prop; - self.set_method = LuaCEmbedTable_set_method; - self.set_method = LuaCEmbedTable_set_method; - self.set_bool_prop = LuaCEmbedTable_set_bool_prop; - self.set_double_prop = LuaCEmbedTable_set_double_prop; - self.set_long_prop = LuaCEmbedTable_set_long_prop; - self.set_string_prop = LuaCEmbedTable_set_string_prop; - - self.get_sub_table_prop = LuaCEmbedTable_get_sub_table_by_key; - self.new_sub_table_prop = LuaCEmbedTable_new_sub_table_by_key; - self.set_sub_table_prop = LuaCEmbedTable_set_sub_table_prop; - self.new_anonymous_table = LuaCembed_new_anonymous_table; - - self.set_sub_table_by_index = LuaCEmbedTable_set_sub_table_by_index; - self.get_bool_prop = LuaCembedTable_get_bool_prop; - self.get_double_prop = LuaCembedTable_get_double_prop; - self.get_long_prop = LuaCembedTable_get_long_prop; - self.get_string_prop = LuaCembedTable_get_string_prop; - self.get_type_prop = LuaCEmbedTable_get_type_prop; - self.destroy_prop = LuaCembedTable_destroy_prop; - - self.set_long_by_index = LuaCEmbedTable_set_long_by_index; - self.set_bool_by_index= LuaCEmbedTable_set_bool_by_index; - self.set_double_by_index =LuaCEmbedTable_set_double_by_index; - self.set_string_by_index = LuaCEmbedTable_set_string_by_index; - self.set_evaluation_by_index = LuaCEmbedTable_set_evaluation_by_index; - - self.get_listable_size = LuaCEmbedTable_get_listable_size; - - self.new_sub_table_appending = LuaCEmbedTable_new_sub_table_appending; - self.has_key = LuaCembedTable_has_key_at_index; - self.get_key_by_index = LuaCembedTable_get_key_by_index; - self.get_size = LuaCEmbedTable_get_full_size; - self.get_type_by_index = LuaCEmbedTable_get_type_by_index; - self.get_long_by_index = LuaCEmbedTable_get_long_by_index; - self.get_double_by_index = LuaCEmbedTable_get_double_by_index; - self.get_bool_by_index = LuaCEmbedTable_get_bool_by_index; - self.get_string_by_index= LuaCEmbedTable_get_string_by_index; - self.get_sub_table_by_index = LuaCEmbedTable_get_sub_table_by_index; - return self; -} - - -//path: src/imports/../namespace/types/fdefine.types.c -//mannaged by silver chain - - -LuaCEmbedTypeModule newLuaCEmbedTypeModule(){ - LuaCEmbedTypeModule self = {0}; - self.NOT_FOUND = LUA_CEMBED_NOT_FOUND; - self.STRING = LUA_CEMBED_STRING; - self.NUMBER = LUA_CEMBED_NUMBER; - self.BOOL = LUA_CEMBED_BOOL; - self.NILL = LUA_CEMBED_NIL; - self.TABLE = LUA_CEMBED_TABLE; - self.FUNCTION = LUA_CEMBED_FUNCTION; - return self; -} - -#endif - - - - -#define LUACEMBED_H -#endif diff --git a/tests/main_test/calbacks/T_add_func/exec.c b/tests/main_test/calbacks/T_add_func/exec.c deleted file mode 100644 index 7f4a941..0000000 --- a/tests/main_test/calbacks/T_add_func/exec.c +++ /dev/null @@ -1,36 +0,0 @@ - -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * add_func(LuaCEmbed *args){ - - double num1 = lua_n.args.get_double(args,0); - double num2 = lua_n.args.get_double(args,1); - - if(lua_n.has_errors(args)){ - char *error_message = lua_n.get_error_message(args); - return lua_n.response.send_error(error_message); - } - return lua_n.response.send_double(num1+num2); - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"add",add_func); - - - double result = lua_n.get_evaluation_double(l,"add(10,20)"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - printf("resullt :%lf\n",result); - - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/calbacks/T_add_func/expected.txt b/tests/main_test/calbacks/T_add_func/expected.txt deleted file mode 100644 index 8aed732..0000000 --- a/tests/main_test/calbacks/T_add_func/expected.txt +++ /dev/null @@ -1 +0,0 @@ -resullt :30.000000 diff --git a/tests/main_test/calbacks/T_args_lambda/exec.c b/tests/main_test/calbacks/T_args_lambda/exec.c deleted file mode 100644 index 7a2f02a..0000000 --- a/tests/main_test/calbacks/T_args_lambda/exec.c +++ /dev/null @@ -1,36 +0,0 @@ - -#include "../../../LuaCEmbed.h" - - -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - - LuaCEmbedTable *created = lua_n.tables.new_anonymous_table(args); - lua_n.tables.append_long(created,10); - lua_n.tables.append_long(created,20); - LuaCEmbedTable *response = lua_n.args.run_lambda(args,0,created,3); - double result = lua_n.tables.get_double_by_index(response,0); - - printf("result %lf\n",result); - - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - lua_n.evaluate(l,"test(function (a,b) return a + b end )"); - - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/calbacks/T_args_lambda/expected.txt b/tests/main_test/calbacks/T_args_lambda/expected.txt deleted file mode 100644 index 7165a9f..0000000 --- a/tests/main_test/calbacks/T_args_lambda/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result 30.000000 diff --git a/tests/main_test/calbacks/T_args_retriving/exec.c b/tests/main_test/calbacks/T_args_retriving/exec.c deleted file mode 100644 index d6ef48f..0000000 --- a/tests/main_test/calbacks/T_args_retriving/exec.c +++ /dev/null @@ -1,53 +0,0 @@ - -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - long size = lua_n.args.size(args); - if(size == 0){ - printf("no argument providided\n"); - return NULL; - } - int index = 0; - int arg_type = lua_n.args.get_type(args,index); - - if(arg_type == lua_n.types.NUMBER){ - printf("number: %lf\n",lua_n.args.get_double(args,index)); - } - - else if(arg_type == lua_n.types.STRING){ - printf("str: %s\n",lua_n.args.get_str(args,index)); - } - - else if(arg_type == lua_n.types.BOOL){ - printf("bool: %d\n", lua_n.args.get_bool(args,index)); - } - else{ - const char *converted_to_str = lua_n.convert_arg_code(arg_type); - printf("type: %s\n",converted_to_str); - } - - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - lua_n.evaluate(l,"test()"); - lua_n.evaluate(l,"test(10)"); - lua_n.evaluate(l,"test('hello')"); - lua_n.evaluate(l,"test(true)"); - lua_n.evaluate(l,"test({a=30})"); - - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/calbacks/T_args_retriving/expected.txt b/tests/main_test/calbacks/T_args_retriving/expected.txt deleted file mode 100644 index 581cc5d..0000000 --- a/tests/main_test/calbacks/T_args_retriving/expected.txt +++ /dev/null @@ -1,5 +0,0 @@ -no argument providided -number: 10.000000 -str: hello -bool: 1 -type: table diff --git a/tests/main_test/calbacks/T_args_retriving_balanced/exec.c b/tests/main_test/calbacks/T_args_retriving_balanced/exec.c deleted file mode 100644 index a420a8b..0000000 --- a/tests/main_test/calbacks/T_args_retriving_balanced/exec.c +++ /dev/null @@ -1,55 +0,0 @@ - -#define LUA_CEMBED_INDEX_DIF 0 -#include "../../../LuaCEmbed.h" - -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - long size = lua_n.args.size(args); - if(size == 0){ - printf("no argument providided\n"); - return NULL; - } - int index = 1; - int arg_type = lua_n.args.get_type(args,index); - - if(arg_type == lua_n.types.NUMBER){ - printf("number: %lf\n",lua_n.args.get_double(args,index)); - } - - else if(arg_type == lua_n.types.STRING){ - printf("str: %s\n",lua_n.args.get_str(args,index)); - } - - else if(arg_type == lua_n.types.BOOL){ - printf("bool: %d\n", lua_n.args.get_bool(args,index)); - } - else{ - const char *converted_to_str = lua_n.convert_arg_code(arg_type); - printf("type: %s\n",converted_to_str); - } - - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - lua_n.evaluate(l,"test()"); - lua_n.evaluate(l,"test(10)"); - lua_n.evaluate(l,"test('hello')"); - lua_n.evaluate(l,"test(true)"); - lua_n.evaluate(l,"test({a=30})"); - - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/calbacks/T_args_retriving_balanced/expected.txt b/tests/main_test/calbacks/T_args_retriving_balanced/expected.txt deleted file mode 100644 index 581cc5d..0000000 --- a/tests/main_test/calbacks/T_args_retriving_balanced/expected.txt +++ /dev/null @@ -1,5 +0,0 @@ -no argument providided -number: 10.000000 -str: hello -bool: 1 -type: table diff --git a/tests/main_test/calbacks/T_basic_callback/exec.c b/tests/main_test/calbacks/T_basic_callback/exec.c deleted file mode 100644 index 62cc228..0000000 --- a/tests/main_test/calbacks/T_basic_callback/exec.c +++ /dev/null @@ -1,25 +0,0 @@ - -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * hello(LuaCEmbed *args){ - printf("my first callback\n"); - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"hello",hello); - - lua_n.evaluate(l,"hello()"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/calbacks/T_basic_callback/expected.txt b/tests/main_test/calbacks/T_basic_callback/expected.txt deleted file mode 100644 index ca7b434..0000000 --- a/tests/main_test/calbacks/T_basic_callback/expected.txt +++ /dev/null @@ -1 +0,0 @@ -my first callback diff --git a/tests/main_test/calbacks/T_evaluating_args/exec.c b/tests/main_test/calbacks/T_evaluating_args/exec.c deleted file mode 100644 index 9d65c47..0000000 --- a/tests/main_test/calbacks/T_evaluating_args/exec.c +++ /dev/null @@ -1,37 +0,0 @@ - -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * add_func(LuaCEmbed *args){ - - - double num1 = lua_n.args.get_long_arg_clojure_evalation(args,0,"function(t) return t.num1 end "); - double num2 = lua_n.args.get_long_arg_clojure_evalation(args,0,"function(t) return t.num2 end "); - - if(lua_n.has_errors(args)){ - char *error_message = lua_n.get_error_message(args); - return lua_n.response.send_error(error_message); - } - return lua_n.response.send_double(num1+num2); - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"add",add_func); - - - double result = lua_n.get_evaluation_double(l,"add({num1=10, num2=30})"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - printf("resullt :%lf\n",result); - - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/calbacks/T_evaluating_args/expected.txt b/tests/main_test/calbacks/T_evaluating_args/expected.txt deleted file mode 100644 index 45dc129..0000000 --- a/tests/main_test/calbacks/T_evaluating_args/expected.txt +++ /dev/null @@ -1 +0,0 @@ -resullt :40.000000 diff --git a/tests/main_test/calbacks/T_getting_table_args/exec.c b/tests/main_test/calbacks/T_getting_table_args/exec.c deleted file mode 100644 index cdbe701..0000000 --- a/tests/main_test/calbacks/T_getting_table_args/exec.c +++ /dev/null @@ -1,43 +0,0 @@ - -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * add_func(LuaCEmbed *args){ - - LuaCEmbedTable *t0 = lua_n.args.get_table(args,0); - - if(lua_n.has_errors(args)){ - char *error_message = lua_n.get_error_message(args); - return lua_n.response.send_error(error_message); - } - - double num1 = lua_n.tables.get_double_prop(t0,"num1"); - double num2 = lua_n.tables.get_double_prop(t0,"num2"); - - - if(lua_n.has_errors(args)){ - char *error_message = lua_n.get_error_message(args); - return lua_n.response.send_error(error_message); - } - return lua_n.response.send_double(num1+num2); - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"add",add_func); - - - double result = lua_n.get_evaluation_double(l,"add({num1=10, num2=30})"); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - printf("resullt :%lf\n",result); - - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/calbacks/T_getting_table_args/expected.txt b/tests/main_test/calbacks/T_getting_table_args/expected.txt deleted file mode 100644 index 45dc129..0000000 --- a/tests/main_test/calbacks/T_getting_table_args/expected.txt +++ /dev/null @@ -1 +0,0 @@ -resullt :40.000000 diff --git a/tests/main_test/calbacks/T_print_func/exec.c b/tests/main_test/calbacks/T_print_func/exec.c deleted file mode 100644 index bc87d3d..0000000 --- a/tests/main_test/calbacks/T_print_func/exec.c +++ /dev/null @@ -1,51 +0,0 @@ - -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * print_func(LuaCEmbed *args){ - long size = lua_n.args.size(args); - for(int index =0;index < size;index++ ){ - int arg_type = lua_n.args.get_type(args,index); - - if(arg_type == lua_n.types.NUMBER){ - printf("%lf\n",lua_n.args.get_double(args,index)); - } - - else if(arg_type == lua_n.types.STRING){ - printf("%s\n",lua_n.args.get_str(args,index)); - } - - else if(arg_type == lua_n.types.BOOL){ - bool result = lua_n.args.get_bool(args,index); - const char *converted_bool = result? "true":"false"; - printf("%s\n", converted_bool); - } - else{ - const char *converted_to_str = lua_n.convert_arg_code(arg_type); - printf("%s\n",converted_to_str); - } - - } - - - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"print",print_func); - - - lua_n.evaluate(l,"print(10,30,'aa',true,{a=30})"); - - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/calbacks/T_print_func/expected.txt b/tests/main_test/calbacks/T_print_func/expected.txt deleted file mode 100644 index 97b5c40..0000000 --- a/tests/main_test/calbacks/T_print_func/expected.txt +++ /dev/null @@ -1,5 +0,0 @@ -10.000000 -30.000000 -aa -true -table diff --git a/tests/main_test/calbacks/T_return_bool/exec.c b/tests/main_test/calbacks/T_return_bool/exec.c deleted file mode 100644 index cca425e..0000000 --- a/tests/main_test/calbacks/T_return_bool/exec.c +++ /dev/null @@ -1,26 +0,0 @@ - -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - return lua_n.response.send_bool(true); -} -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - - bool result = lua_n.get_evaluation_bool (l,"test()"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - printf("resullt :%d\n",result); - - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/calbacks/T_return_bool/expected.txt b/tests/main_test/calbacks/T_return_bool/expected.txt deleted file mode 100644 index cc6aaf3..0000000 --- a/tests/main_test/calbacks/T_return_bool/expected.txt +++ /dev/null @@ -1 +0,0 @@ -resullt :1 diff --git a/tests/main_test/calbacks/T_return_double/exec.c b/tests/main_test/calbacks/T_return_double/exec.c deleted file mode 100644 index 33e152e..0000000 --- a/tests/main_test/calbacks/T_return_double/exec.c +++ /dev/null @@ -1,26 +0,0 @@ - -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - return lua_n.response.send_double(30); -} -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - - double result = lua_n.get_evaluation_double(l,"test()"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - printf("resullt :%lf\n",result); - - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/calbacks/T_return_double/expected.txt b/tests/main_test/calbacks/T_return_double/expected.txt deleted file mode 100644 index 8aed732..0000000 --- a/tests/main_test/calbacks/T_return_double/expected.txt +++ /dev/null @@ -1 +0,0 @@ -resullt :30.000000 diff --git a/tests/main_test/calbacks/T_return_error/exec.c b/tests/main_test/calbacks/T_return_error/exec.c deleted file mode 100644 index 4103341..0000000 --- a/tests/main_test/calbacks/T_return_error/exec.c +++ /dev/null @@ -1,25 +0,0 @@ - -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - return lua_n.response.send_error("my custom error menssage"); -} -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - - lua_n.evaluate(l,"test()"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/calbacks/T_return_error/expected.txt b/tests/main_test/calbacks/T_return_error/expected.txt deleted file mode 100644 index f3661c4..0000000 --- a/tests/main_test/calbacks/T_return_error/expected.txt +++ /dev/null @@ -1 +0,0 @@ -error: my custom error menssage diff --git a/tests/main_test/calbacks/T_return_evaluation/exec.c b/tests/main_test/calbacks/T_return_evaluation/exec.c deleted file mode 100644 index 675f9b5..0000000 --- a/tests/main_test/calbacks/T_return_evaluation/exec.c +++ /dev/null @@ -1,26 +0,0 @@ - -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - return lua_n.response.send_evaluation_function("function() return 'func result' end"); -} -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - - char * result = lua_n.get_string_evaluation(l,"test()"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - printf("resullt :%s\n",result); - - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/calbacks/T_return_evaluation/expected.txt b/tests/main_test/calbacks/T_return_evaluation/expected.txt deleted file mode 100644 index 0a866d3..0000000 --- a/tests/main_test/calbacks/T_return_evaluation/expected.txt +++ /dev/null @@ -1 +0,0 @@ -resullt :func result diff --git a/tests/main_test/calbacks/T_return_long/exec.c b/tests/main_test/calbacks/T_return_long/exec.c deleted file mode 100644 index 8f57088..0000000 --- a/tests/main_test/calbacks/T_return_long/exec.c +++ /dev/null @@ -1,26 +0,0 @@ - -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - return lua_n.response.send_long(30); -} -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - - long result = lua_n.get_evaluation_long(l,"test()"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - printf("resullt :%ld\n",result); - - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/calbacks/T_return_long/expected.txt b/tests/main_test/calbacks/T_return_long/expected.txt deleted file mode 100644 index ce6dc51..0000000 --- a/tests/main_test/calbacks/T_return_long/expected.txt +++ /dev/null @@ -1 +0,0 @@ -resullt :30 diff --git a/tests/main_test/calbacks/T_return_multi_return/exec.c b/tests/main_test/calbacks/T_return_multi_return/exec.c deleted file mode 100644 index 8c14909..0000000 --- a/tests/main_test/calbacks/T_return_multi_return/exec.c +++ /dev/null @@ -1,35 +0,0 @@ - -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - - LuaCEmbedTable * multi_response = lua_n.tables.new_anonymous_table(args); - lua_n.tables.append_string(multi_response,"first"); - lua_n.tables.append_long(multi_response,10); - return lua_n.response.send_multi_return(multi_response); -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - - lua_n.evaluate(l,"a,b =test()"); - char *a = lua_n.get_string_evaluation(l,"a"); - long b = lua_n.get_evaluation_long(l,"b"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - printf("a = %s\n",a); - printf("b = %ld\n",b); - - - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/calbacks/T_return_multi_return/expected.txt b/tests/main_test/calbacks/T_return_multi_return/expected.txt deleted file mode 100644 index 27d86c6..0000000 --- a/tests/main_test/calbacks/T_return_multi_return/expected.txt +++ /dev/null @@ -1,2 +0,0 @@ -a = first -b = 10 diff --git a/tests/main_test/calbacks/T_return_string/exec.c b/tests/main_test/calbacks/T_return_string/exec.c deleted file mode 100644 index 2ab852a..0000000 --- a/tests/main_test/calbacks/T_return_string/exec.c +++ /dev/null @@ -1,26 +0,0 @@ - -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - return lua_n.response.send_str("str return"); -} -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - - char * result = lua_n.get_string_evaluation(l,"test()"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - printf("resullt :%s\n",result); - - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/calbacks/T_return_string/expected.txt b/tests/main_test/calbacks/T_return_string/expected.txt deleted file mode 100644 index 05fb736..0000000 --- a/tests/main_test/calbacks/T_return_string/expected.txt +++ /dev/null @@ -1 +0,0 @@ -resullt :str return diff --git a/tests/main_test/calbacks/T_return_table/exec.c b/tests/main_test/calbacks/T_return_table/exec.c deleted file mode 100644 index 344ace2..0000000 --- a/tests/main_test/calbacks/T_return_table/exec.c +++ /dev/null @@ -1,30 +0,0 @@ - -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * test_func(LuaCEmbed *args){ - LuaCEmbedTable *created = lua_n.tables.new_anonymous_table(args); - lua_n.tables.set_string_prop(created,"a","test message"); - return lua_n.response.send_table(created); -} -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"test",test_func); - - - lua_n.evaluate(l,"created_table = test()"); - LuaCEmbedTable *created = lua_n.globals.get_table(l,"created_table"); - char *a = lua_n.tables.get_string_prop(created,"a"); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - - printf("value of created.a = %s\n",a); - - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/calbacks/T_return_table/expected.txt b/tests/main_test/calbacks/T_return_table/expected.txt deleted file mode 100644 index 85634ba..0000000 --- a/tests/main_test/calbacks/T_return_table/expected.txt +++ /dev/null @@ -1 +0,0 @@ -value of created.a = test message diff --git a/tests/main_test/evaluation/T_basic_evaluation/exec.c b/tests/main_test/evaluation/T_basic_evaluation/exec.c deleted file mode 100644 index 916c4f9..0000000 --- a/tests/main_test/evaluation/T_basic_evaluation/exec.c +++ /dev/null @@ -1,24 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * hello(LuaCEmbed *args){ - printf("hello world"); - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"hello",hello); - - lua_n.evaluate(l,"hello()"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/evaluation/T_basic_evaluation/expected.txt b/tests/main_test/evaluation/T_basic_evaluation/expected.txt deleted file mode 100644 index 95d09f2..0000000 --- a/tests/main_test/evaluation/T_basic_evaluation/expected.txt +++ /dev/null @@ -1 +0,0 @@ -hello world \ No newline at end of file diff --git a/tests/main_test/evaluation/T_basic_evaluation_with_loaded_libs/expected.txt b/tests/main_test/evaluation/T_basic_evaluation_with_loaded_libs/expected.txt deleted file mode 100644 index a955e3b..0000000 --- a/tests/main_test/evaluation/T_basic_evaluation_with_loaded_libs/expected.txt +++ /dev/null @@ -1 +0,0 @@ -hello from lua diff --git a/tests/main_test/evaluation/T_bool_evaluation/exec.c b/tests/main_test/evaluation/T_bool_evaluation/exec.c deleted file mode 100644 index fc97a75..0000000 --- a/tests/main_test/evaluation/T_bool_evaluation/exec.c +++ /dev/null @@ -1,20 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.evaluate(l,"r = true"); - - bool result = lua_n.get_evaluation_bool(l,"r"); - printf("result: %d\n",result); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/evaluation/T_bool_evaluation/expected.txt b/tests/main_test/evaluation/T_bool_evaluation/expected.txt deleted file mode 100644 index 0c20405..0000000 --- a/tests/main_test/evaluation/T_bool_evaluation/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result: 1 diff --git a/tests/main_test/evaluation/T_double_evaluation/exec.c b/tests/main_test/evaluation/T_double_evaluation/exec.c deleted file mode 100644 index 1650b2e..0000000 --- a/tests/main_test/evaluation/T_double_evaluation/exec.c +++ /dev/null @@ -1,20 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.evaluate(l,"r = 20 + 30"); - - double result = lua_n.get_evaluation_double(l,"r"); - printf("result: %lf\n",result); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/evaluation/T_double_evaluation/expected.txt b/tests/main_test/evaluation/T_double_evaluation/expected.txt deleted file mode 100644 index fe35624..0000000 --- a/tests/main_test/evaluation/T_double_evaluation/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result: 50.000000 diff --git a/tests/main_test/evaluation/T_file_evaluation/exec.c b/tests/main_test/evaluation/T_file_evaluation/exec.c deleted file mode 100644 index 4befcc3..0000000 --- a/tests/main_test/evaluation/T_file_evaluation/exec.c +++ /dev/null @@ -1,24 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -LuaCEmbedResponse * hello(LuaCEmbed *args){ - printf("hello world"); - return NULL; -} - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.add_callback(l,"hello",hello); - - lua_n.evaluete_file(l,"tests/target/hello.lua"); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/evaluation/T_file_evaluation/expected.txt b/tests/main_test/evaluation/T_file_evaluation/expected.txt deleted file mode 100644 index 95d09f2..0000000 --- a/tests/main_test/evaluation/T_file_evaluation/expected.txt +++ /dev/null @@ -1 +0,0 @@ -hello world \ No newline at end of file diff --git a/tests/main_test/evaluation/T_hello_world/exec.c b/tests/main_test/evaluation/T_hello_world/exec.c deleted file mode 100644 index 63612d0..0000000 --- a/tests/main_test/evaluation/T_hello_world/exec.c +++ /dev/null @@ -1,18 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.evaluate(l,"r = 30"); - long calc = lua_n.get_evaluation_long(l,"r + 20"); - printf("result %ld",calc); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/evaluation/T_hello_world/expected.txt b/tests/main_test/evaluation/T_hello_world/expected.txt deleted file mode 100644 index 8fc6578..0000000 --- a/tests/main_test/evaluation/T_hello_world/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result 50 \ No newline at end of file diff --git a/tests/main_test/evaluation/T_long_return/exec.c b/tests/main_test/evaluation/T_long_return/exec.c deleted file mode 100644 index 34b27e1..0000000 --- a/tests/main_test/evaluation/T_long_return/exec.c +++ /dev/null @@ -1,20 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.evaluate(l,"r = 20 + 30"); - - long result = lua_n.get_evaluation_long(l,"r"); - printf("result: %ld\n",result); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/evaluation/T_long_return/expected.txt b/tests/main_test/evaluation/T_long_return/expected.txt deleted file mode 100644 index a603832..0000000 --- a/tests/main_test/evaluation/T_long_return/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result: 50 diff --git a/tests/main_test/evaluation/T_memory_usage/expected.txt b/tests/main_test/evaluation/T_memory_usage/expected.txt deleted file mode 100644 index 0da1288..0000000 --- a/tests/main_test/evaluation/T_memory_usage/expected.txt +++ /dev/null @@ -1 +0,0 @@ -error: not enough memory diff --git a/tests/main_test/evaluation/T_string_evalation/exec.c b/tests/main_test/evaluation/T_string_evalation/exec.c deleted file mode 100644 index 5f90e8a..0000000 --- a/tests/main_test/evaluation/T_string_evalation/exec.c +++ /dev/null @@ -1,20 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.evaluate(l,"r = 'hello world'"); - - char * result = lua_n.get_string_evaluation(l,"r"); - printf("result: %s\n",result); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/evaluation/T_string_evalation/expected.txt b/tests/main_test/evaluation/T_string_evalation/expected.txt deleted file mode 100644 index 0776db0..0000000 --- a/tests/main_test/evaluation/T_string_evalation/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result: hello world diff --git a/tests/main_test/evaluation/T_table_size/exec.c b/tests/main_test/evaluation/T_table_size/exec.c deleted file mode 100644 index 533c14b..0000000 --- a/tests/main_test/evaluation/T_table_size/exec.c +++ /dev/null @@ -1,20 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.evaluate(l,"r = {1,2,3}"); - - long result = lua_n.get_evaluation_size(l,"r"); - printf("size: %ld\n",result); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/evaluation/T_table_size/expected.txt b/tests/main_test/evaluation/T_table_size/expected.txt deleted file mode 100644 index b07d4f8..0000000 --- a/tests/main_test/evaluation/T_table_size/expected.txt +++ /dev/null @@ -1 +0,0 @@ -size: 3 diff --git a/tests/main_test/evaluation/T_timeout/expected.txt b/tests/main_test/evaluation/T_timeout/expected.txt deleted file mode 100644 index 0254d46..0000000 --- a/tests/main_test/evaluation/T_timeout/expected.txt +++ /dev/null @@ -1,2 +0,0 @@ -error: timeout error - executed after timeout error diff --git a/tests/main_test/evaluation/T_type_evaluation/exec.c b/tests/main_test/evaluation/T_type_evaluation/exec.c deleted file mode 100644 index cf599dd..0000000 --- a/tests/main_test/evaluation/T_type_evaluation/exec.c +++ /dev/null @@ -1,21 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - lua_n.evaluate(l,"r = 'hello world'"); - - int r_type = lua_n.get_evaluation_type(l,"r"); - const char*converted = lua_n.convert_arg_code(r_type); - printf("result: %s\n",converted); - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/evaluation/T_type_evaluation/expected.txt b/tests/main_test/evaluation/T_type_evaluation/expected.txt deleted file mode 100644 index 78ae4ac..0000000 --- a/tests/main_test/evaluation/T_type_evaluation/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result: string diff --git a/tests/main_test/globals/T_get_bool_global/exec.c b/tests/main_test/globals/T_get_bool_global/exec.c deleted file mode 100644 index d4005cf..0000000 --- a/tests/main_test/globals/T_get_bool_global/exec.c +++ /dev/null @@ -1,20 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - - lua_n.evaluate(l,"r = true"); - bool result = lua_n.globals.get_bool(l,"r"); - printf("result %d\n",result); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/globals/T_get_bool_global/expected.txt b/tests/main_test/globals/T_get_bool_global/expected.txt deleted file mode 100644 index a2e5e15..0000000 --- a/tests/main_test/globals/T_get_bool_global/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result 1 diff --git a/tests/main_test/globals/T_get_double_global/exec.c b/tests/main_test/globals/T_get_double_global/exec.c deleted file mode 100644 index e82d5e0..0000000 --- a/tests/main_test/globals/T_get_double_global/exec.c +++ /dev/null @@ -1,20 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - - lua_n.evaluate(l,"r = 30.5"); - double result = lua_n.globals.get_double(l,"r"); - printf("result %lf\n",result); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/globals/T_get_double_global/expected.txt b/tests/main_test/globals/T_get_double_global/expected.txt deleted file mode 100644 index 0f8f087..0000000 --- a/tests/main_test/globals/T_get_double_global/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result 30.500000 diff --git a/tests/main_test/globals/T_get_long_global/exec.c b/tests/main_test/globals/T_get_long_global/exec.c deleted file mode 100644 index 9b8effd..0000000 --- a/tests/main_test/globals/T_get_long_global/exec.c +++ /dev/null @@ -1,20 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - - lua_n.evaluate(l,"r = 30"); - long result = lua_n.globals.get_long(l,"r"); - printf("result %ld\n",result); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/globals/T_get_long_global/expected.txt b/tests/main_test/globals/T_get_long_global/expected.txt deleted file mode 100644 index 6eb3fc3..0000000 --- a/tests/main_test/globals/T_get_long_global/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result 30 diff --git a/tests/main_test/globals/T_get_not_existing/exec.c b/tests/main_test/globals/T_get_not_existing/exec.c deleted file mode 100644 index b8f4467..0000000 --- a/tests/main_test/globals/T_get_not_existing/exec.c +++ /dev/null @@ -1,20 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - - int type_code = lua_n.globals.get_type(l,"r"); - const char *converted_type = lua_n.convert_arg_code(type_code); - printf("result %s\n",converted_type); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/globals/T_get_not_existing/expected.txt b/tests/main_test/globals/T_get_not_existing/expected.txt deleted file mode 100644 index 964d3c5..0000000 --- a/tests/main_test/globals/T_get_not_existing/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result nil diff --git a/tests/main_test/globals/T_get_string_global/exec.c b/tests/main_test/globals/T_get_string_global/exec.c deleted file mode 100644 index b764739..0000000 --- a/tests/main_test/globals/T_get_string_global/exec.c +++ /dev/null @@ -1,20 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - - lua_n.evaluate(l,"r = 'hello world'"); - char * result = lua_n.globals.get_string(l,"r"); - printf("result %s\n",result); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/globals/T_get_string_global/expected.txt b/tests/main_test/globals/T_get_string_global/expected.txt deleted file mode 100644 index 3fe74ae..0000000 --- a/tests/main_test/globals/T_get_string_global/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result hello world diff --git a/tests/main_test/globals/T_get_table_global/exec.c b/tests/main_test/globals/T_get_table_global/exec.c deleted file mode 100644 index d5ba5f8..0000000 --- a/tests/main_test/globals/T_get_table_global/exec.c +++ /dev/null @@ -1,21 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - - lua_n.evaluate(l,"r = {a='internal text'}"); - LuaCEmbedTable *r_table = lua_n.globals.get_table(l,"r"); - char *a = lua_n.tables.get_string_prop(r_table,"a"); - printf("value of r.a = %s\n",a); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/globals/T_get_table_global/expected.txt b/tests/main_test/globals/T_get_table_global/expected.txt deleted file mode 100644 index 5cf090a..0000000 --- a/tests/main_test/globals/T_get_table_global/expected.txt +++ /dev/null @@ -1 +0,0 @@ -value of r.a = internal text diff --git a/tests/main_test/globals/T_get_type/exec.c b/tests/main_test/globals/T_get_type/exec.c deleted file mode 100644 index 66864d3..0000000 --- a/tests/main_test/globals/T_get_type/exec.c +++ /dev/null @@ -1,21 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - - lua_n.evaluate(l,"r = 'hello world'"); - int type_code = lua_n.globals.get_type(l,"r"); - const char *converted_type = lua_n.convert_arg_code(type_code); - printf("result %s\n",converted_type); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/globals/T_get_type/expected.txt b/tests/main_test/globals/T_get_type/expected.txt deleted file mode 100644 index 905d115..0000000 --- a/tests/main_test/globals/T_get_type/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result string diff --git a/tests/main_test/globals/T_run_global_function/exec.c b/tests/main_test/globals/T_run_global_function/exec.c deleted file mode 100644 index ad7f0ba..0000000 --- a/tests/main_test/globals/T_run_global_function/exec.c +++ /dev/null @@ -1,34 +0,0 @@ -#include "../../../LuaCEmbed.h" - - -LuaCEmbedNamespace lua_n; - - - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - - lua_n.evaluate(l,"function test_func(a,b) return a + b end "); - - LuaCEmbedTable * args = lua_n.tables.new_anonymous_table(l); - lua_n.tables.append_long(args,20); - lua_n.tables.append_long(args,30); - LuaCEmbedTable *result = lua_n.globals.run_global_lambda(l,"test_func",args,1); - - double result_0 = lua_n.tables.get_double_by_index(result,0); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - else{ - printf("result 0: %lf\n",result_0); - - } - - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/globals/T_run_global_function/expected.txt b/tests/main_test/globals/T_run_global_function/expected.txt deleted file mode 100644 index 0938517..0000000 --- a/tests/main_test/globals/T_run_global_function/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result 0: 50.000000 diff --git a/tests/main_test/globals/T_set_bool/exec.c b/tests/main_test/globals/T_set_bool/exec.c deleted file mode 100644 index 17ee104..0000000 --- a/tests/main_test/globals/T_set_bool/exec.c +++ /dev/null @@ -1,20 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - - lua_n.globals.set_bool(l,"r",true); - bool result = lua_n.globals.get_bool(l,"r"); - printf("result %d\n",result); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/globals/T_set_bool/expected.txt b/tests/main_test/globals/T_set_bool/expected.txt deleted file mode 100644 index a2e5e15..0000000 --- a/tests/main_test/globals/T_set_bool/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result 1 diff --git a/tests/main_test/globals/T_set_double/exec.c b/tests/main_test/globals/T_set_double/exec.c deleted file mode 100644 index d03b8c0..0000000 --- a/tests/main_test/globals/T_set_double/exec.c +++ /dev/null @@ -1,20 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - - lua_n.globals.set_double(l,"r",30); - double result = lua_n.globals.get_double(l,"r"); - printf("result %lf\n",result); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/globals/T_set_double/expected.txt b/tests/main_test/globals/T_set_double/expected.txt deleted file mode 100644 index 7165a9f..0000000 --- a/tests/main_test/globals/T_set_double/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result 30.000000 diff --git a/tests/main_test/globals/T_set_long/exec.c b/tests/main_test/globals/T_set_long/exec.c deleted file mode 100644 index 9d505f7..0000000 --- a/tests/main_test/globals/T_set_long/exec.c +++ /dev/null @@ -1,20 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - - lua_n.globals.set_long(l,"r",30); - double result = lua_n.globals.get_long(l,"r"); - printf("result %lf\n",result); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/globals/T_set_long/expected.txt b/tests/main_test/globals/T_set_long/expected.txt deleted file mode 100644 index 7165a9f..0000000 --- a/tests/main_test/globals/T_set_long/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result 30.000000 diff --git a/tests/main_test/globals/T_set_string/exec.c b/tests/main_test/globals/T_set_string/exec.c deleted file mode 100644 index dc10939..0000000 --- a/tests/main_test/globals/T_set_string/exec.c +++ /dev/null @@ -1,20 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - - lua_n.globals.set_string(l,"r","hello world"); - char * result = lua_n.globals.get_string(l,"r"); - printf("result %s\n",result); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/globals/T_set_string/expected.txt b/tests/main_test/globals/T_set_string/expected.txt deleted file mode 100644 index 3fe74ae..0000000 --- a/tests/main_test/globals/T_set_string/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result hello world diff --git a/tests/main_test/globals/T_set_table/exec.c b/tests/main_test/globals/T_set_table/exec.c deleted file mode 100644 index e4ca63b..0000000 --- a/tests/main_test/globals/T_set_table/exec.c +++ /dev/null @@ -1,22 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - -int main(int argc, char *argv[]){ - - lua_n = newLuaCEmbedNamespace(); - LuaCEmbed * l = lua_n.newLuaEvaluation(); - - LuaCEmbedTable *created = lua_n.globals.new_table(l,"r"); - lua_n.tables.set_string_prop(created,"a","internal text"); - - char *a = lua_n.tables.get_string_prop(created,"a"); - printf("result of r.a %s\n",a); - - if(lua_n.has_errors(l)){ - printf("error: %s\n",lua_n.get_error_message(l)); - } - lua_n.free(l); - - return 0; -} \ No newline at end of file diff --git a/tests/main_test/globals/T_set_table/expected.txt b/tests/main_test/globals/T_set_table/expected.txt deleted file mode 100644 index fdb0a1a..0000000 --- a/tests/main_test/globals/T_set_table/expected.txt +++ /dev/null @@ -1 +0,0 @@ -result of r.a internal text diff --git a/tests/main_test/table_handle/S_iterating_over_table/exec.c b/tests/main_test/table_handle/S_iterating_over_table/exec.c deleted file mode 100644 index bdcb753..0000000 --- a/tests/main_test/table_handle/S_iterating_over_table/exec.c +++ /dev/null @@ -1,56 +0,0 @@ -#include "../../../LuaCEmbed.h" -LuaCEmbedNamespace lua_n; - - - -LuaCEmbedResponse * show_table(LuaCEmbed *args){ - - LuaCEmbedTable * t1 = lua_n.args.get_table(args,0); - if(lua_n.has_errors(args)){ - char *menssage = lua_n.get_error_message(args); - return lua_n.response.send_error(menssage); - } - long size = lua_n.tables.get_size(t1); - for(int i = 0; i