初始化提交
This commit is contained in:
		
							
								
								
									
										2
									
								
								Plugins/slua_unreal/.gitignore
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										2
									
								
								Plugins/slua_unreal/.gitignore
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,2 @@ | ||||
| build_* | ||||
| Makefile | ||||
							
								
								
									
										123
									
								
								Plugins/slua_unreal/CMakeLists.txt
									
									
									
									
									
										Normal file
									
								
							
							
						
						
									
										123
									
								
								Plugins/slua_unreal/CMakeLists.txt
									
									
									
									
									
										Normal file
									
								
							| @ -0,0 +1,123 @@ | ||||
| cmake_minimum_required(VERSION 2.8) | ||||
|  | ||||
| set(CMAKE_BUILD_TYPE Debug) | ||||
|  | ||||
| project(lua) | ||||
|  | ||||
| set(EXT_SRC_ROOT External) | ||||
| set(LUA_INC_PATH ${EXT_SRC_ROOT}/lua) | ||||
| set(LUA_SRC_PATH ${EXT_SRC_ROOT}/lua) | ||||
|  | ||||
| set(LUA_SRC_FILES  | ||||
|     ${LUA_SRC_PATH}/lapi.cpp | ||||
|     ${LUA_SRC_PATH}/lauxlib.cpp | ||||
|     ${LUA_SRC_PATH}/lbaselib.cpp | ||||
|     ${LUA_SRC_PATH}/lbitlib.cpp | ||||
|     ${LUA_SRC_PATH}/lcode.cpp | ||||
|     ${LUA_SRC_PATH}/lcorolib.cpp | ||||
|     ${LUA_SRC_PATH}/lctype.cpp | ||||
|     ${LUA_SRC_PATH}/ldblib.cpp | ||||
|     ${LUA_SRC_PATH}/ldebug.cpp | ||||
|     ${LUA_SRC_PATH}/ldo.cpp | ||||
|     ${LUA_SRC_PATH}/ldump.cpp | ||||
|     ${LUA_SRC_PATH}/lfunc.cpp | ||||
|     ${LUA_SRC_PATH}/lgc.cpp | ||||
|     ${LUA_SRC_PATH}/linit.cpp | ||||
|     ${LUA_SRC_PATH}/liolib.cpp | ||||
|     ${LUA_SRC_PATH}/llex.cpp | ||||
|     ${LUA_SRC_PATH}/lmathlib.cpp | ||||
|     ${LUA_SRC_PATH}/lmem.cpp | ||||
|     ${LUA_SRC_PATH}/loadlib.cpp | ||||
|     ${LUA_SRC_PATH}/lobject.cpp | ||||
|     ${LUA_SRC_PATH}/lopcodes.cpp | ||||
|     ${LUA_SRC_PATH}/loslib.cpp | ||||
|     ${LUA_SRC_PATH}/lparser.cpp | ||||
|     ${LUA_SRC_PATH}/lstate.cpp | ||||
|     ${LUA_SRC_PATH}/lstring.cpp | ||||
|     ${LUA_SRC_PATH}/lstrlib.cpp | ||||
|     ${LUA_SRC_PATH}/ltable.cpp | ||||
|     ${LUA_SRC_PATH}/ltablib.cpp | ||||
|     ${LUA_SRC_PATH}/ltm.cpp | ||||
|     ${LUA_SRC_PATH}/lundump.cpp | ||||
|     ${LUA_SRC_PATH}/lutf8lib.cpp | ||||
|     ${LUA_SRC_PATH}/lvm.cpp | ||||
|     ${LUA_SRC_PATH}/lzio.cpp | ||||
| ) | ||||
|  | ||||
| set(THIRDPART_INC_PATH "") | ||||
| set(THIRDPART_SRC_FILES "") | ||||
|  | ||||
| #being third-party | ||||
|  | ||||
| #being lua socket | ||||
| set(LUA_SOCKET_INC_PATH ${EXT_SRC_ROOT}/luasocket) | ||||
| set(LUA_SOCKET_SRC_PATH ${EXT_SRC_ROOT}/luasocket) | ||||
| set (LUA_SOCKET_SRC_FILES | ||||
|     ${LUA_SOCKET_SRC_PATH}/auxiliar.cpp | ||||
|     ${LUA_SOCKET_SRC_PATH}/auxiliar.h | ||||
|     ${LUA_SOCKET_SRC_PATH}/buffer.cpp | ||||
|     ${LUA_SOCKET_SRC_PATH}/buffer.h | ||||
|     ${LUA_SOCKET_SRC_PATH}/except.cpp | ||||
|     ${LUA_SOCKET_SRC_PATH}/except.h | ||||
|     ${LUA_SOCKET_SRC_PATH}/ftp.lua.inc | ||||
|     ${LUA_SOCKET_SRC_PATH}/headers.lua.inc | ||||
|     ${LUA_SOCKET_SRC_PATH}/http.lua.inc | ||||
|     ${LUA_SOCKET_SRC_PATH}/inet.cpp | ||||
|     ${LUA_SOCKET_SRC_PATH}/inet.h | ||||
|     ${LUA_SOCKET_SRC_PATH}/io.cpp | ||||
|     ${LUA_SOCKET_SRC_PATH}/io.h | ||||
|     ${LUA_SOCKET_SRC_PATH}/ltn12.lua.inc | ||||
|     ${LUA_SOCKET_SRC_PATH}/luasocket.cpp | ||||
|     ${LUA_SOCKET_SRC_PATH}/luasocket.h | ||||
|     ${LUA_SOCKET_SRC_PATH}/mbox.lua.inc | ||||
|     ${LUA_SOCKET_SRC_PATH}/mime.cpp | ||||
|     ${LUA_SOCKET_SRC_PATH}/mime.h | ||||
|     ${LUA_SOCKET_SRC_PATH}/mime.lua.inc | ||||
|     ${LUA_SOCKET_SRC_PATH}/options.cpp | ||||
|     ${LUA_SOCKET_SRC_PATH}/options.h | ||||
|     ${LUA_SOCKET_SRC_PATH}/select.cpp | ||||
|     ${LUA_SOCKET_SRC_PATH}/select.h | ||||
|     ${LUA_SOCKET_SRC_PATH}/serial.cpp | ||||
|     ${LUA_SOCKET_SRC_PATH}/smtp.lua.inc | ||||
|     ${LUA_SOCKET_SRC_PATH}/socket.h | ||||
|     ${LUA_SOCKET_SRC_PATH}/socket.lua.inc | ||||
|     ${LUA_SOCKET_SRC_PATH}/tcp.cpp | ||||
|     ${LUA_SOCKET_SRC_PATH}/tcp.h | ||||
|     ${LUA_SOCKET_SRC_PATH}/timeout.cpp | ||||
|     ${LUA_SOCKET_SRC_PATH}/timeout.h | ||||
|     ${LUA_SOCKET_SRC_PATH}/tp.lua.inc | ||||
|     ${LUA_SOCKET_SRC_PATH}/udp.cpp | ||||
|     ${LUA_SOCKET_SRC_PATH}/udp.h | ||||
|     ${LUA_SOCKET_SRC_PATH}/unix.cpp | ||||
|     ${LUA_SOCKET_SRC_PATH}/unix.h | ||||
|     ${LUA_SOCKET_SRC_PATH}/url.lua.inc | ||||
|     ${LUA_SOCKET_SRC_PATH}/usocket.cpp | ||||
|     ${LUA_SOCKET_SRC_PATH}/usocket.h | ||||
|     ${LUA_SOCKET_SRC_PATH}/wsocket.cpp | ||||
|     ${LUA_SOCKET_SRC_PATH}/wsocket.h | ||||
| ) | ||||
| #end lua socket | ||||
|  | ||||
| set(THIRDPART_INC_PATH ${THIRDPART_INC_PATH} ${LUA_SOCKET_INC_PATH}) | ||||
| set(THIRDPART_SRC_FILES ${THIRDPART_SRC_FILES} ${LUA_SOCKET_SRC_FILES}) | ||||
| #end third-party | ||||
|  | ||||
| include_directories( | ||||
|     ${LUA_INC_PATH} | ||||
|     ${THIRDPART_INC_PATH} | ||||
| ) | ||||
|  | ||||
| # add_definitions("-DLUA_USE_C89") | ||||
|  | ||||
| if(APPLE) | ||||
|     if(IOS) | ||||
|         set(CMAKE_OSX_ARCHITECTURES "$(ARCHS_STANDARD)") | ||||
|     else() | ||||
|         set(CMAKE_OSX_ARCHITECTURES "$(ARCHS_STANDARD_64_BIT)") | ||||
|     endif() | ||||
| endif() | ||||
|  | ||||
| add_library(lua STATIC | ||||
|     ${LUA_SRC_FILES} | ||||
|     ${THIRDPART_SRC_FILES} | ||||
| ) | ||||
							
								
								
									
										8
									
								
								Plugins/slua_unreal/Config/FilterPlugin.ini
									
									
									
									
									
										Normal file
									
								
							
							
						
						
									
										8
									
								
								Plugins/slua_unreal/Config/FilterPlugin.ini
									
									
									
									
									
										Normal file
									
								
							| @ -0,0 +1,8 @@ | ||||
| [FilterPlugin] | ||||
| ; This section lists additional files which will be packaged along with your plugin. Paths should be listed relative to the root plugin directory, and | ||||
| ; may include "...", "*", and "?" wildcards to match directories, files, and individual characters respectively. | ||||
| ; | ||||
| ; Examples: | ||||
| ;    /README.txt | ||||
| ;    /Extras/... | ||||
| ;    /Binaries/ThirdParty/*.dll | ||||
							
								
								
									
										1298
									
								
								Plugins/slua_unreal/External/lua/lapi.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										1298
									
								
								Plugins/slua_unreal/External/lua/lapi.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
										
											
												File diff suppressed because it is too large
												Load Diff
											
										
									
								
							
							
								
								
									
										23
									
								
								Plugins/slua_unreal/External/lua/lapi.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										23
									
								
								Plugins/slua_unreal/External/lua/lapi.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,23 @@ | ||||
| /* | ||||
| ** $Id: lapi.h,v 2.9 2015/03/06 19:49:50 roberto Exp $ | ||||
| ** Auxiliary functions from Lua API | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #ifndef lapi_h | ||||
| #define lapi_h | ||||
|  | ||||
| #include "llimits.h" | ||||
| #include "lstate.h" | ||||
|  | ||||
| #define api_incr_top(L)   {L->top++; api_check(L, L->top <= L->ci->top, \ | ||||
| 				"stack overflow");} | ||||
|  | ||||
| #define adjustresults(L,nres) \ | ||||
|     { if ((nres) == LUA_MULTRET && L->ci->top < L->top) L->ci->top = L->top; } | ||||
|  | ||||
| #define api_checknelems(L,n)	api_check(L, (n) < (L->top - L->ci->func), \ | ||||
| 				  "not enough elements in the stack") | ||||
|  | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										1031
									
								
								Plugins/slua_unreal/External/lua/lauxlib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										1031
									
								
								Plugins/slua_unreal/External/lua/lauxlib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
										
											
												File diff suppressed because it is too large
												Load Diff
											
										
									
								
							
							
								
								
									
										262
									
								
								Plugins/slua_unreal/External/lua/lauxlib.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										262
									
								
								Plugins/slua_unreal/External/lua/lauxlib.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,262 @@ | ||||
| /* | ||||
| ** $Id: lauxlib.h,v 1.131 2016/12/06 14:54:31 roberto Exp $ | ||||
| ** Auxiliary functions for building Lua libraries | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
|  | ||||
| #ifndef lauxlib_h | ||||
| #define lauxlib_h | ||||
|  | ||||
| #include <stddef.h> | ||||
| #include <stdio.h> | ||||
|  | ||||
| #include "lua.h" | ||||
|  | ||||
| /* 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" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| 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 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 lua_Integer (luaL_len) (lua_State *L, int idx); | ||||
|  | ||||
| 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)((cond) || luaL_argerror(L, (arg), (extramsg)))) | ||||
| #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) | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** {====================================================== | ||||
| ** Generic Buffer manipulation | ||||
| ** ======================================================= | ||||
| */ | ||||
|  | ||||
| typedef struct luaL_Buffer { | ||||
|   char *b;  /* buffer address */ | ||||
|   size_t size;  /* buffer size */ | ||||
|   size_t n;  /* number of characters in buffer */ | ||||
|   lua_State *L; | ||||
|   char initb[LUAL_BUFFERSIZE];  /* initial buffer */ | ||||
| } luaL_Buffer; | ||||
|  | ||||
|  | ||||
| #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)) | ||||
|  | ||||
| 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; | ||||
|  | ||||
| /* }====================================================== */ | ||||
|  | ||||
|  | ||||
|  | ||||
| /* compatibility with old module system */ | ||||
| #if defined(LUA_COMPAT_MODULE) | ||||
|  | ||||
| LUALIB_API void (luaL_pushmodule) (lua_State *L, const char *modname, | ||||
|                                    int sizehint); | ||||
| LUALIB_API void (luaL_openlib) (lua_State *L, const char *libname, | ||||
|                                 const luaL_Reg *l, int nup); | ||||
|  | ||||
| #define luaL_register(L,n,l)	(luaL_openlib(L,(n),(l),0)) | ||||
|  | ||||
| #endif | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** {================================================================== | ||||
| ** "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 | ||||
| /* }============================================================ */ | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
|  | ||||
|  | ||||
							
								
								
									
										498
									
								
								Plugins/slua_unreal/External/lua/lbaselib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										498
									
								
								Plugins/slua_unreal/External/lua/lbaselib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,498 @@ | ||||
| /* | ||||
| ** $Id: lbaselib.c,v 1.314 2016/09/05 19:06:34 roberto Exp $ | ||||
| ** Basic library | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define lbaselib_c | ||||
| #define LUA_LIB | ||||
|  | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <ctype.h> | ||||
| #include <stdio.h> | ||||
| #include <stdlib.h> | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
| #include "lualib.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| static int luaB_print (lua_State *L) { | ||||
|   int n = lua_gettop(L);  /* number of arguments */ | ||||
|   int i; | ||||
|   lua_getglobal(L, "tostring"); | ||||
|   for (i=1; i<=n; i++) { | ||||
|     const char *s; | ||||
|     size_t l; | ||||
|     lua_pushvalue(L, -1);  /* function to be called */ | ||||
|     lua_pushvalue(L, i);   /* value to print */ | ||||
|     lua_call(L, 1, 1); | ||||
|     s = lua_tolstring(L, -1, &l);  /* get result */ | ||||
|     if (s == NULL) | ||||
|       return luaL_error(L, "'tostring' must return a string to 'print'"); | ||||
|     if (i>1) lua_writestring("\t", 1); | ||||
|     lua_writestring(s, l); | ||||
|     lua_pop(L, 1);  /* pop result */ | ||||
|   } | ||||
|   lua_writeline(); | ||||
|   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 signal */ | ||||
|   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? */ | ||||
|     luaL_checkany(L, 1); | ||||
|     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 */ | ||||
|     } | ||||
|   } | ||||
|   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 */ | ||||
|   lua_pushnil(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_argcheck(L, t == LUA_TNIL || t == LUA_TTABLE, 2, | ||||
|                     "nil or table expected"); | ||||
|   if (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_argcheck(L, t == LUA_TTABLE || t == LUA_TSTRING, 1, | ||||
|                    "table or string expected"); | ||||
|   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 luaB_collectgarbage (lua_State *L) { | ||||
|   static const char *const opts[] = {"stop", "restart", "collect", | ||||
|     "count", "step", "setpause", "setstepmul", | ||||
|     "isrunning", NULL}; | ||||
|   static const int optsnum[] = {LUA_GCSTOP, LUA_GCRESTART, LUA_GCCOLLECT, | ||||
|     LUA_GCCOUNT, LUA_GCSTEP, LUA_GCSETPAUSE, LUA_GCSETSTEPMUL, | ||||
|     LUA_GCISRUNNING}; | ||||
|   int o = optsnum[luaL_checkoption(L, 1, "collect", opts)]; | ||||
|   int ex = (int)luaL_optinteger(L, 2, 0); | ||||
|   int res = lua_gc(L, o, ex); | ||||
|   switch (o) { | ||||
|     case LUA_GCCOUNT: { | ||||
|       int b = lua_gc(L, LUA_GCCOUNTB, 0); | ||||
|       lua_pushnumber(L, (lua_Number)res + ((lua_Number)b/1024)); | ||||
|       return 1; | ||||
|     } | ||||
|     case LUA_GCSTEP: case LUA_GCISRUNNING: { | ||||
|       lua_pushboolean(L, res); | ||||
|       return 1; | ||||
|     } | ||||
|     default: { | ||||
|       lua_pushinteger(L, res); | ||||
|       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 pairsmeta (lua_State *L, const char *method, int iszero, | ||||
|                       lua_CFunction iter) { | ||||
|   luaL_checkany(L, 1); | ||||
|   if (luaL_getmetafield(L, 1, method) == LUA_TNIL) {  /* no metamethod? */ | ||||
|     lua_pushcfunction(L, iter);  /* will return generator, */ | ||||
|     lua_pushvalue(L, 1);  /* state, */ | ||||
|     if (iszero) lua_pushinteger(L, 0);  /* and initial value */ | ||||
|     else lua_pushnil(L); | ||||
|   } | ||||
|   else { | ||||
|     lua_pushvalue(L, 1);  /* argument 'self' to metamethod */ | ||||
|     lua_call(L, 1, 3);  /* get 3 values from metamethod */ | ||||
|   } | ||||
|   return 3; | ||||
| } | ||||
|  | ||||
|  | ||||
| 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 luaB_pairs (lua_State *L) { | ||||
|   return pairsmeta(L, "__pairs", 0, luaB_next); | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Traversal function for 'ipairs' | ||||
| */ | ||||
| static int ipairsaux (lua_State *L) { | ||||
|   lua_Integer i = luaL_checkinteger(L, 2) + 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) { | ||||
| #if defined(LUA_COMPAT_IPAIRS) | ||||
|   return pairsmeta(L, "__ipairs", 1, ipairsaux); | ||||
| #else | ||||
|   luaL_checkany(L, 1); | ||||
|   lua_pushcfunction(L, ipairsaux);  /* iteration function */ | ||||
|   lua_pushvalue(L, 1);  /* state */ | ||||
|   lua_pushinteger(L, 0);  /* initial value */ | ||||
|   return 3; | ||||
| #endif | ||||
| } | ||||
|  | ||||
|  | ||||
| static int load_aux (lua_State *L, int status, int envidx) { | ||||
|   if (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) */ | ||||
|     lua_pushnil(L); | ||||
|     lua_insert(L, -2);  /* put before error message */ | ||||
|     return 2;  /* return nil plus error message */ | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| static int luaB_loadfile (lua_State *L) { | ||||
|   const char *fname = luaL_optstring(L, 1, NULL); | ||||
|   const char *mode = luaL_optstring(L, 2, NULL); | ||||
|   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 (!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 = luaL_optstring(L, 3, "bt"); | ||||
|   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 (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 (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 (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 <f, err, true, f, [args...]>; 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}, | ||||
| #if defined(LUA_COMPAT_LOADSTRING) | ||||
|   {"loadstring", luaB_load}, | ||||
| #endif | ||||
|   {"next", luaB_next}, | ||||
|   {"pairs", luaB_pairs}, | ||||
|   {"pcall", luaB_pcall}, | ||||
|   {"print", luaB_print}, | ||||
|   {"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 */ | ||||
|   {"_G", 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, "_G"); | ||||
|   /* set global _VERSION */ | ||||
|   lua_pushliteral(L, LUA_VERSION); | ||||
|   lua_setfield(L, -2, "_VERSION"); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										232
									
								
								Plugins/slua_unreal/External/lua/lbitlib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										232
									
								
								Plugins/slua_unreal/External/lua/lbitlib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,232 @@ | ||||
| /* | ||||
| ** $Id: lbitlib.c,v 1.30 2015/11/11 19:08:09 roberto Exp $ | ||||
| ** Standard library for bitwise operations | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define lbitlib_c | ||||
| #define LUA_LIB | ||||
|  | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
| #include "lualib.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| #if defined(LUA_COMPAT_BITLIB)		/* { */ | ||||
|  | ||||
|  | ||||
| #define pushunsigned(L,n)	lua_pushinteger(L, (lua_Integer)(n)) | ||||
| #define checkunsigned(L,i)	((lua_Unsigned)luaL_checkinteger(L,i)) | ||||
|  | ||||
|  | ||||
| /* number of bits to consider in a number */ | ||||
| #if !defined(LUA_NBITS) | ||||
| #define LUA_NBITS	32 | ||||
| #endif | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** a lua_Unsigned with its first LUA_NBITS bits equal to 1. (Shift must | ||||
| ** be made in two parts to avoid problems when LUA_NBITS is equal to the | ||||
| ** number of bits in a lua_Unsigned.) | ||||
| */ | ||||
| #define ALLONES		(~(((~(lua_Unsigned)0) << (LUA_NBITS - 1)) << 1)) | ||||
|  | ||||
|  | ||||
| /* macro to trim extra bits */ | ||||
| #define trim(x)		((x) & ALLONES) | ||||
|  | ||||
|  | ||||
| /* builds a number with 'n' ones (1 <= n <= LUA_NBITS) */ | ||||
| #define mask(n)		(~((ALLONES << 1) << ((n) - 1))) | ||||
|  | ||||
| static lua_Unsigned andaux (lua_State *L) { | ||||
|   int i, n = lua_gettop(L); | ||||
|   lua_Unsigned r = ~(lua_Unsigned)0; | ||||
|   for (i = 1; i <= n; i++) | ||||
|     r &= checkunsigned(L, i); | ||||
|   return trim(r); | ||||
| } | ||||
|  | ||||
|  | ||||
| static int b_and (lua_State *L) { | ||||
|   lua_Unsigned r = andaux(L); | ||||
|   pushunsigned(L, r); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int b_test (lua_State *L) { | ||||
|   lua_Unsigned r = andaux(L); | ||||
|   lua_pushboolean(L, r != 0); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int b_or (lua_State *L) { | ||||
|   int i, n = lua_gettop(L); | ||||
|   lua_Unsigned r = 0; | ||||
|   for (i = 1; i <= n; i++) | ||||
|     r |= checkunsigned(L, i); | ||||
|   pushunsigned(L, trim(r)); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int b_xor (lua_State *L) { | ||||
|   int i, n = lua_gettop(L); | ||||
|   lua_Unsigned r = 0; | ||||
|   for (i = 1; i <= n; i++) | ||||
|     r ^= checkunsigned(L, i); | ||||
|   pushunsigned(L, trim(r)); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int b_not (lua_State *L) { | ||||
|   lua_Unsigned r = ~checkunsigned(L, 1); | ||||
|   pushunsigned(L, trim(r)); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int b_shift (lua_State *L, lua_Unsigned r, lua_Integer i) { | ||||
|   if (i < 0) {  /* shift right? */ | ||||
|     i = -i; | ||||
|     r = trim(r); | ||||
|     if (i >= LUA_NBITS) r = 0; | ||||
|     else r >>= i; | ||||
|   } | ||||
|   else {  /* shift left */ | ||||
|     if (i >= LUA_NBITS) r = 0; | ||||
|     else r <<= i; | ||||
|     r = trim(r); | ||||
|   } | ||||
|   pushunsigned(L, r); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int b_lshift (lua_State *L) { | ||||
|   return b_shift(L, checkunsigned(L, 1), luaL_checkinteger(L, 2)); | ||||
| } | ||||
|  | ||||
|  | ||||
| static int b_rshift (lua_State *L) { | ||||
|   return b_shift(L, checkunsigned(L, 1), -luaL_checkinteger(L, 2)); | ||||
| } | ||||
|  | ||||
|  | ||||
| static int b_arshift (lua_State *L) { | ||||
|   lua_Unsigned r = checkunsigned(L, 1); | ||||
|   lua_Integer i = luaL_checkinteger(L, 2); | ||||
|   if (i < 0 || !(r & ((lua_Unsigned)1 << (LUA_NBITS - 1)))) | ||||
|     return b_shift(L, r, -i); | ||||
|   else {  /* arithmetic shift for 'negative' number */ | ||||
|     if (i >= LUA_NBITS) r = ALLONES; | ||||
|     else | ||||
|       r = trim((r >> i) | ~(trim(~(lua_Unsigned)0) >> i));  /* add signal bit */ | ||||
|     pushunsigned(L, r); | ||||
|     return 1; | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| static int b_rot (lua_State *L, lua_Integer d) { | ||||
|   lua_Unsigned r = checkunsigned(L, 1); | ||||
|   int i = d & (LUA_NBITS - 1);  /* i = d % NBITS */ | ||||
|   r = trim(r); | ||||
|   if (i != 0)  /* avoid undefined shift of LUA_NBITS when i == 0 */ | ||||
|     r = (r << i) | (r >> (LUA_NBITS - i)); | ||||
|   pushunsigned(L, trim(r)); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int b_lrot (lua_State *L) { | ||||
|   return b_rot(L, luaL_checkinteger(L, 2)); | ||||
| } | ||||
|  | ||||
|  | ||||
| static int b_rrot (lua_State *L) { | ||||
|   return b_rot(L, -luaL_checkinteger(L, 2)); | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** get field and width arguments for field-manipulation functions, | ||||
| ** checking whether they are valid. | ||||
| ** ('luaL_error' called without 'return' to avoid later warnings about | ||||
| ** 'width' being used uninitialized.) | ||||
| */ | ||||
| static int fieldargs (lua_State *L, int farg, int *width) { | ||||
|   lua_Integer f = luaL_checkinteger(L, farg); | ||||
|   lua_Integer w = luaL_optinteger(L, farg + 1, 1); | ||||
|   luaL_argcheck(L, 0 <= f, farg, "field cannot be negative"); | ||||
|   luaL_argcheck(L, 0 < w, farg + 1, "width must be positive"); | ||||
|   if (f + w > LUA_NBITS) | ||||
|     luaL_error(L, "trying to access non-existent bits"); | ||||
|   *width = (int)w; | ||||
|   return (int)f; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int b_extract (lua_State *L) { | ||||
|   int w; | ||||
|   lua_Unsigned r = trim(checkunsigned(L, 1)); | ||||
|   int f = fieldargs(L, 2, &w); | ||||
|   r = (r >> f) & mask(w); | ||||
|   pushunsigned(L, r); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int b_replace (lua_State *L) { | ||||
|   int w; | ||||
|   lua_Unsigned r = trim(checkunsigned(L, 1)); | ||||
|   lua_Unsigned v = trim(checkunsigned(L, 2)); | ||||
|   int f = fieldargs(L, 3, &w); | ||||
|   lua_Unsigned m = mask(w); | ||||
|   r = (r & ~(m << f)) | ((v & m) << f); | ||||
|   pushunsigned(L, r); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static const luaL_Reg bitlib[] = { | ||||
|   {"arshift", b_arshift}, | ||||
|   {"band", b_and}, | ||||
|   {"bnot", b_not}, | ||||
|   {"bor", b_or}, | ||||
|   {"bxor", b_xor}, | ||||
|   {"btest", b_test}, | ||||
|   {"extract", b_extract}, | ||||
|   {"lrotate", b_lrot}, | ||||
|   {"lshift", b_lshift}, | ||||
|   {"replace", b_replace}, | ||||
|   {"rrotate", b_rrot}, | ||||
|   {"rshift", b_rshift}, | ||||
|   {NULL, NULL} | ||||
| }; | ||||
|  | ||||
|  | ||||
|  | ||||
| LUAMOD_API int luaopen_bit32 (lua_State *L) { | ||||
|   luaL_newlib(L, bitlib); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| #else					/* }{ */ | ||||
|  | ||||
|  | ||||
| LUAMOD_API int luaopen_bit32 (lua_State *L) { | ||||
|   return luaL_error(L, "library 'bit32' has been deprecated"); | ||||
| } | ||||
|  | ||||
| #endif					/* } */ | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										1202
									
								
								Plugins/slua_unreal/External/lua/lcode.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										1202
									
								
								Plugins/slua_unreal/External/lua/lcode.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
										
											
												File diff suppressed because it is too large
												Load Diff
											
										
									
								
							
							
								
								
									
										89
									
								
								Plugins/slua_unreal/External/lua/lcode.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										89
									
								
								Plugins/slua_unreal/External/lua/lcode.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,89 @@ | ||||
| /* | ||||
| ** $Id: lcode.h,v 1.64 2016/01/05 16:22:37 roberto Exp $ | ||||
| ** 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) | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* | ||||
| ** grep "ORDER OPR" if you change these enums  (ORDER OP) | ||||
| */ | ||||
| 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; | ||||
|  | ||||
|  | ||||
| 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_codeAsBx(fs,o,A,sBx)	luaK_codeABx(fs,o,A,(sBx)+MAXARG_sBx) | ||||
|  | ||||
| #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_codeABx (FuncState *fs, OpCode o, int A, unsigned int Bx); | ||||
| LUAI_FUNC int luaK_codeABC (FuncState *fs, OpCode o, int A, int B, int C); | ||||
| LUAI_FUNC int luaK_codek (FuncState *fs, int reg, int k); | ||||
| 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 int luaK_stringK (FuncState *fs, TString *s); | ||||
| LUAI_FUNC int luaK_intK (FuncState *fs, 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 int luaK_exp2RK (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_patchclose (FuncState *fs, int list, int level); | ||||
| 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_setlist (FuncState *fs, int base, int nelems, int tostore); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										168
									
								
								Plugins/slua_unreal/External/lua/lcorolib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										168
									
								
								Plugins/slua_unreal/External/lua/lcorolib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,168 @@ | ||||
| /* | ||||
| ** $Id: lcorolib.c,v 1.10 2016/04/11 19:19:55 roberto Exp $ | ||||
| ** Coroutine Library | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define lcorolib_c | ||||
| #define LUA_LIB | ||||
|  | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <stdlib.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
| #include "lualib.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| static lua_State *getco (lua_State *L) { | ||||
|   lua_State *co = lua_tothread(L, 1); | ||||
|   luaL_argcheck(L, co, 1, "thread expected"); | ||||
|   return co; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int auxresume (lua_State *L, lua_State *co, int narg) { | ||||
|   int status; | ||||
|   if (!lua_checkstack(co, narg)) { | ||||
|     lua_pushliteral(L, "too many arguments to resume"); | ||||
|     return -1;  /* error flag */ | ||||
|   } | ||||
|   if (lua_status(co) == LUA_OK && lua_gettop(co) == 0) { | ||||
|     lua_pushliteral(L, "cannot resume dead coroutine"); | ||||
|     return -1;  /* error flag */ | ||||
|   } | ||||
|   lua_xmove(L, co, narg); | ||||
|   status = lua_resume(co, L, narg); | ||||
|   if (status == LUA_OK || status == LUA_YIELD) { | ||||
|     int nres = lua_gettop(co); | ||||
|     if (!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 (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 (r < 0) { | ||||
|     if (lua_type(L, -1) == LUA_TSTRING) {  /* error object is a string? */ | ||||
|       luaL_where(L, 1);  /* add extra info */ | ||||
|       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)); | ||||
| } | ||||
|  | ||||
|  | ||||
| static int luaB_costatus (lua_State *L) { | ||||
|   lua_State *co = getco(L); | ||||
|   if (L == co) lua_pushliteral(L, "running"); | ||||
|   else { | ||||
|     switch (lua_status(co)) { | ||||
|       case LUA_YIELD: | ||||
|         lua_pushliteral(L, "suspended"); | ||||
|         break; | ||||
|       case LUA_OK: { | ||||
|         lua_Debug ar; | ||||
|         if (lua_getstack(co, 0, &ar) > 0)  /* does it have frames? */ | ||||
|           lua_pushliteral(L, "normal");  /* it is running */ | ||||
|         else if (lua_gettop(co) == 0) | ||||
|             lua_pushliteral(L, "dead"); | ||||
|         else | ||||
|           lua_pushliteral(L, "suspended");  /* initial state */ | ||||
|         break; | ||||
|       } | ||||
|       default:  /* some error occurred */ | ||||
|         lua_pushliteral(L, "dead"); | ||||
|         break; | ||||
|     } | ||||
|   } | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int luaB_yieldable (lua_State *L) { | ||||
|   lua_pushboolean(L, lua_isyieldable(L)); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int luaB_corunning (lua_State *L) { | ||||
|   int ismain = lua_pushthread(L); | ||||
|   lua_pushboolean(L, ismain); | ||||
|   return 2; | ||||
| } | ||||
|  | ||||
|  | ||||
| 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}, | ||||
|   {NULL, NULL} | ||||
| }; | ||||
|  | ||||
|  | ||||
|  | ||||
| LUAMOD_API int luaopen_coroutine (lua_State *L) { | ||||
|   luaL_newlib(L, co_funcs); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										57
									
								
								Plugins/slua_unreal/External/lua/lctype.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										57
									
								
								Plugins/slua_unreal/External/lua/lctype.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,57 @@ | ||||
| /* | ||||
| ** $Id: lctype.c,v 1.12 2014/11/02 19:19:04 roberto Exp $ | ||||
| ** 'ctype' functions for Lua | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define lctype_c | ||||
| #define LUA_CORE | ||||
|  | ||||
| #include "lctype.h" | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #if !LUA_USE_CTYPE	/* { */ | ||||
|  | ||||
| #include <limits.h> | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| 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, | ||||
|   0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,	/* 8. */ | ||||
|   0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00, | ||||
|   0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,	/* 9. */ | ||||
|   0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00, | ||||
|   0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,	/* a. */ | ||||
|   0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00, | ||||
|   0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,	/* b. */ | ||||
|   0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00, | ||||
|   0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,	/* c. */ | ||||
|   0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00, | ||||
|   0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,	/* d. */ | ||||
|   0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00, | ||||
|   0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,	/* e. */ | ||||
|   0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00, | ||||
|   0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,	/* f. */ | ||||
|   0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00,  0x00, | ||||
| }; | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif			/* } */ | ||||
							
								
								
									
										96
									
								
								Plugins/slua_unreal/External/lua/lctype.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										96
									
								
								Plugins/slua_unreal/External/lua/lctype.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,96 @@ | ||||
| /* | ||||
| ** $Id: lctype.h,v 1.12 2011/07/15 12:50:29 roberto Exp $ | ||||
| ** '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 <limits.h> | ||||
|  | ||||
| #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)) | ||||
|  | ||||
| /* | ||||
| ** this 'ltolower' only works for alphabetic characters | ||||
| */ | ||||
| #define ltolower(c)	((c) | ('A' ^ 'a')) | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* two more entries for 0 and -1 (EOZ) */ | ||||
| LUAI_DDEC const lu_byte luai_ctype_[UCHAR_MAX + 2]; | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #else			/* }{ */ | ||||
|  | ||||
| /* | ||||
| ** use standard C ctypes | ||||
| */ | ||||
|  | ||||
| #include <ctype.h> | ||||
|  | ||||
|  | ||||
| #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 | ||||
|  | ||||
							
								
								
									
										456
									
								
								Plugins/slua_unreal/External/lua/ldblib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										456
									
								
								Plugins/slua_unreal/External/lua/ldblib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,456 @@ | ||||
| /* | ||||
| ** $Id: ldblib.c,v 1.151 2015/11/23 11:29:43 roberto Exp $ | ||||
| ** Interface from Lua to its debug API | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define ldblib_c | ||||
| #define LUA_LIB | ||||
|  | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <stdio.h> | ||||
| #include <stdlib.h> | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
| #include "lualib.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* | ||||
| ** The hook table at registry[&HOOKKEY] maps threads to their current | ||||
| ** hook function. (We only need the unique address of 'HOOKKEY'.) | ||||
| */ | ||||
| static const int HOOKKEY = 0; | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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 != 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_argcheck(L, t == LUA_TNIL || t == LUA_TTABLE, 2, | ||||
|                     "nil or table expected"); | ||||
|   lua_settop(L, 2); | ||||
|   lua_setmetatable(L, 1); | ||||
|   return 1;  /* return 1st argument */ | ||||
| } | ||||
|  | ||||
|  | ||||
| static int db_getuservalue (lua_State *L) { | ||||
|   if (lua_type(L, 1) != LUA_TUSERDATA) | ||||
|     lua_pushnil(L); | ||||
|   else | ||||
|     lua_getuservalue(L, 1); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int db_setuservalue (lua_State *L) { | ||||
|   luaL_checktype(L, 1, LUA_TUSERDATA); | ||||
|   luaL_checkany(L, 2); | ||||
|   lua_settop(L, 2); | ||||
|   lua_setuservalue(L, 1); | ||||
|   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, "flnStu"); | ||||
|   checkstack(L, L1, 3); | ||||
|   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)) { | ||||
|       lua_pushnil(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')) { | ||||
|     settabss(L, "source", ar.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, '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); | ||||
|   lua_Debug ar; | ||||
|   const char *name; | ||||
|   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 */ | ||||
|     int level = (int)luaL_checkinteger(L, arg + 1); | ||||
|     if (!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 { | ||||
|       lua_pushnil(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 (!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 int checkupval (lua_State *L, int argf, int argnup) { | ||||
|   int nup = (int)luaL_checkinteger(L, argnup);  /* upvalue index */ | ||||
|   luaL_checktype(L, argf, LUA_TFUNCTION);  /* closure */ | ||||
|   luaL_argcheck(L, (lua_getupvalue(L, argf, nup) != NULL), argnup, | ||||
|                    "invalid upvalue index"); | ||||
|   return nup; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int db_upvalueid (lua_State *L) { | ||||
|   int n = checkupval(L, 1, 2); | ||||
|   lua_pushlightuserdata(L, lua_upvalueid(L, 1, n)); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int db_upvaluejoin (lua_State *L) { | ||||
|   int n1 = checkupval(L, 1, 2); | ||||
|   int n2 = checkupval(L, 3, 4); | ||||
|   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_rawgetp(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 (lua_rawgetp(L, LUA_REGISTRYINDEX, &HOOKKEY) == LUA_TNIL) { | ||||
|     lua_createtable(L, 0, 2);  /* create a hook table */ | ||||
|     lua_pushvalue(L, -1); | ||||
|     lua_rawsetp(L, LUA_REGISTRYINDEX, &HOOKKEY);  /* set it in position */ | ||||
|     lua_pushstring(L, "k"); | ||||
|     lua_setfield(L, -2, "__mode");  /** hooktable.__mode = "k" */ | ||||
|     lua_pushvalue(L, -1); | ||||
|     lua_setmetatable(L, -2);  /* setmetatable(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? */ | ||||
|     lua_pushnil(L); | ||||
|   else if (hook != hookf)  /* external hook? */ | ||||
|     lua_pushliteral(L, "external hook"); | ||||
|   else {  /* hook table must exist */ | ||||
|     lua_rawgetp(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) == 0 || | ||||
|         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", lua_tostring(L, -1)); | ||||
|     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; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										697
									
								
								Plugins/slua_unreal/External/lua/ldebug.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										697
									
								
								Plugins/slua_unreal/External/lua/ldebug.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,697 @@ | ||||
| /* | ||||
| ** $Id: ldebug.c,v 2.121 2016/10/19 12:32:10 roberto Exp $ | ||||
| ** Debug Interface | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define ldebug_c | ||||
| #define LUA_CORE | ||||
|  | ||||
| #include "ldebug.h" | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <stdarg.h> | ||||
| #include <stddef.h> | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lapi.h" | ||||
| #include "lcode.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" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| #define noLuaClosure(f)		((f) == NULL || (f)->c.tt == LUA_TCCL) | ||||
|  | ||||
|  | ||||
| /* Active Lua function (given call info) */ | ||||
| #define ci_func(ci)		(clLvalue((ci)->func)) | ||||
|  | ||||
|  | ||||
| static const char *funcnamefromcode (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 currentline (CallInfo *ci) { | ||||
|   return getfuncline(ci_func(ci)->p, currentpc(ci)); | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** If function yielded, its 'func' can be in the 'extra' field. The | ||||
| ** next function restores 'func' to its correct value for debugging | ||||
| ** purposes. (It exchanges 'func' and 'extra'; so, when called again, | ||||
| ** after debugging, it also "re-restores" ** 'func' to its altered value. | ||||
| */ | ||||
| static void swapextra (lua_State *L) { | ||||
|   if (L->status == LUA_YIELD) { | ||||
|     CallInfo *ci = L->ci;  /* get function that yielded */ | ||||
|     StkId temp = ci->func;  /* exchange its 'func' and 'extra' values */ | ||||
|     ci->func = restorestack(L, ci->extra); | ||||
|     ci->extra = savestack(L, temp); | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** This function can be called asynchronously (e.g. during a signal). | ||||
| ** Fields 'oldpc', '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; | ||||
|   } | ||||
|   if (isLua(L->ci)) | ||||
|     L->oldpc = L->ci->u.l.savedpc; | ||||
|   L->hook = func; | ||||
|   L->basehookcount = count; | ||||
|   resethookcount(L); | ||||
|   L->hookmask = cast_byte(mask); | ||||
| } | ||||
|  | ||||
|  | ||||
| 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 (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) { | ||||
|   int nparams = clLvalue(ci->func)->p->numparams; | ||||
|   if (n >= cast_int(ci->u.l.base - ci->func) - nparams) | ||||
|     return NULL;  /* no such vararg */ | ||||
|   else { | ||||
|     *pos = ci->func + nparams + n; | ||||
|     return "(*vararg)";  /* generic name for any vararg */ | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| static const char *findlocal (lua_State *L, CallInfo *ci, int n, | ||||
|                               StkId *pos) { | ||||
|   const char *name = NULL; | ||||
|   StkId base; | ||||
|   if (isLua(ci)) { | ||||
|     if (n < 0)  /* access to vararg values? */ | ||||
|       return findvararg(ci, -n, pos); | ||||
|     else { | ||||
|       base = ci->u.l.base; | ||||
|       name = luaF_getlocalname(ci_func(ci)->p, n, currentpc(ci)); | ||||
|     } | ||||
|   } | ||||
|   else | ||||
|     base = ci->func + 1; | ||||
|   if (name == NULL) {  /* no 'standard' name? */ | ||||
|     StkId limit = (ci == L->ci) ? L->top : ci->next->func; | ||||
|     if (limit - base >= n && n > 0)  /* is 'n' inside 'ci' stack? */ | ||||
|       name = "(*temporary)";  /* generic name for any valid slot */ | ||||
|     else | ||||
|       return NULL;  /* no name */ | ||||
|   } | ||||
|   *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); | ||||
|   swapextra(L); | ||||
|   if (ar == NULL) {  /* information about non-active function? */ | ||||
|     if (!isLfunction(L->top - 1))  /* not a Lua function? */ | ||||
|       name = NULL; | ||||
|     else  /* consider live variables at function start (parameters) */ | ||||
|       name = luaF_getlocalname(clLvalue(L->top - 1)->p, n, 0); | ||||
|   } | ||||
|   else {  /* active function; get information through 'ar' */ | ||||
|     StkId pos = NULL;  /* to avoid warnings */ | ||||
|     name = findlocal(L, ar->i_ci, n, &pos); | ||||
|     if (name) { | ||||
|       setobj2s(L, L->top, pos); | ||||
|       api_incr_top(L); | ||||
|     } | ||||
|   } | ||||
|   swapextra(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); | ||||
|   swapextra(L); | ||||
|   name = findlocal(L, ar->i_ci, n, &pos); | ||||
|   if (name) { | ||||
|     setobjs2s(L, pos, L->top - 1); | ||||
|     L->top--;  /* pop value */ | ||||
|   } | ||||
|   swapextra(L); | ||||
|   lua_unlock(L); | ||||
|   return name; | ||||
| } | ||||
|  | ||||
|  | ||||
| static void funcinfo (lua_Debug *ar, Closure *cl) { | ||||
|   if (noLuaClosure(cl)) { | ||||
|     ar->source = "=[C]"; | ||||
|     ar->linedefined = -1; | ||||
|     ar->lastlinedefined = -1; | ||||
|     ar->what = "C"; | ||||
|   } | ||||
|   else { | ||||
|     Proto *p = cl->l.p; | ||||
|     ar->source = p->source ? getstr(p->source) : "=?"; | ||||
|     ar->linedefined = p->linedefined; | ||||
|     ar->lastlinedefined = p->lastlinedefined; | ||||
|     ar->what = (ar->linedefined == 0) ? "main" : "Lua"; | ||||
|   } | ||||
|   luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE); | ||||
| } | ||||
|  | ||||
|  | ||||
| static void collectvalidlines (lua_State *L, Closure *f) { | ||||
|   if (noLuaClosure(f)) { | ||||
|     setnilvalue(L->top); | ||||
|     api_incr_top(L); | ||||
|   } | ||||
|   else { | ||||
|     int i; | ||||
|     TValue v; | ||||
|     int *lineinfo = f->l.p->lineinfo; | ||||
|     Table *t = luaH_new(L);  /* new table to store active lines */ | ||||
|     sethvalue(L, L->top, t);  /* push it on stack */ | ||||
|     api_incr_top(L); | ||||
|     setbvalue(&v, 1);  /* boolean 'true' to be the value of all indices */ | ||||
|     for (i = 0; i < f->l.p->sizelineinfo; i++)  /* for all lines with code */ | ||||
|       luaH_setint(L, t, lineinfo[i], &v);  /* table[line] = true */ | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name) { | ||||
|   if (ci == NULL)  /* no 'ci'? */ | ||||
|     return NULL;  /* no info */ | ||||
|   else if (ci->callstatus & CIST_FIN) {  /* is this a finalizer? */ | ||||
|     *name = "__gc"; | ||||
|     return "metamethod";  /* report it as such */ | ||||
|   } | ||||
|   /* calling function is a known Lua function? */ | ||||
|   else if (!(ci->callstatus & CIST_TAIL) && isLua(ci->previous)) | ||||
|     return funcnamefromcode(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)) ? currentline(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->is_vararg; | ||||
|           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 '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; | ||||
|   StkId func; | ||||
|   lua_lock(L); | ||||
|   swapextra(L); | ||||
|   if (*what == '>') { | ||||
|     ci = NULL; | ||||
|     func = L->top - 1; | ||||
|     api_check(L, ttisfunction(func), "function expected"); | ||||
|     what++;  /* skip the '>' */ | ||||
|     L->top--;  /* pop function */ | ||||
|   } | ||||
|   else { | ||||
|     ci = ar->i_ci; | ||||
|     func = ci->func; | ||||
|     lua_assert(ttisfunction(ci->func)); | ||||
|   } | ||||
|   cl = ttisclosure(func) ? clvalue(func) : NULL; | ||||
|   status = auxgetinfo(L, what, ar, cl, ci); | ||||
|   if (strchr(what, 'f')) { | ||||
|     setobjs2s(L, L->top, func); | ||||
|     api_incr_top(L); | ||||
|   } | ||||
|   swapextra(L);  /* correct before option 'L', which can raise a mem. error */ | ||||
|   if (strchr(what, 'L')) | ||||
|     collectvalidlines(L, cl); | ||||
|   lua_unlock(L); | ||||
|   return status; | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** {====================================================== | ||||
| ** Symbolic Execution | ||||
| ** ======================================================= | ||||
| */ | ||||
|  | ||||
| static const char *getobjname (Proto *p, int lastpc, int reg, | ||||
|                                const char **name); | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** find a "name" for the RK value 'c' | ||||
| */ | ||||
| static void kname (Proto *p, int pc, int c, const char **name) { | ||||
|   if (ISK(c)) {  /* is 'c' a constant? */ | ||||
|     TValue *kvalue = &p->k[INDEXK(c)]; | ||||
|     if (ttisstring(kvalue)) {  /* literal constant? */ | ||||
|       *name = svalue(kvalue);  /* it is its own name */ | ||||
|       return; | ||||
|     } | ||||
|     /* else no reasonable name found */ | ||||
|   } | ||||
|   else {  /* 'c' is a register */ | ||||
|     const char *what = getobjname(p, pc, c, name); /* search for 'c' */ | ||||
|     if (what && *what == 'c') {  /* found a constant name? */ | ||||
|       return;  /* 'name' already filled */ | ||||
|     } | ||||
|     /* else no reasonable name found */ | ||||
|   } | ||||
|   *name = "?";  /* no reasonable name found */ | ||||
| } | ||||
|  | ||||
|  | ||||
| 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 (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 */ | ||||
|   for (pc = 0; pc < lastpc; pc++) { | ||||
|     Instruction i = p->code[pc]; | ||||
|     OpCode op = GET_OPCODE(i); | ||||
|     int a = GETARG_A(i); | ||||
|     switch (op) { | ||||
|       case OP_LOADNIL: { | ||||
|         int b = GETARG_B(i); | ||||
|         if (a <= reg && reg <= a + b)  /* set registers from 'a' to 'a+b' */ | ||||
|           setreg = filterpc(pc, jmptarget); | ||||
|         break; | ||||
|       } | ||||
|       case OP_TFORCALL: { | ||||
|         if (reg >= a + 2)  /* affect all regs above its base */ | ||||
|           setreg = filterpc(pc, jmptarget); | ||||
|         break; | ||||
|       } | ||||
|       case OP_CALL: | ||||
|       case OP_TAILCALL: { | ||||
|         if (reg >= a)  /* affect all registers above base */ | ||||
|           setreg = filterpc(pc, jmptarget); | ||||
|         break; | ||||
|       } | ||||
|       case OP_JMP: { | ||||
|         int b = GETARG_sBx(i); | ||||
|         int dest = pc + 1 + b; | ||||
|         /* jump is forward and do not skip 'lastpc'? */ | ||||
|         if (pc < dest && dest <= lastpc) { | ||||
|           if (dest > jmptarget) | ||||
|             jmptarget = dest;  /* update 'jmptarget' */ | ||||
|         } | ||||
|         break; | ||||
|       } | ||||
|       default: | ||||
|         if (testAMode(op) && reg == a)  /* any instruction that set A */ | ||||
|           setreg = filterpc(pc, jmptarget); | ||||
|         break; | ||||
|     } | ||||
|   } | ||||
|   return setreg; | ||||
| } | ||||
|  | ||||
|  | ||||
| static const char *getobjname (Proto *p, int lastpc, int reg, | ||||
|                                const char **name) { | ||||
|   int pc; | ||||
|   *name = luaF_getlocalname(p, reg + 1, lastpc); | ||||
|   if (*name)  /* is a local? */ | ||||
|     return "local"; | ||||
|   /* else try symbolic execution */ | ||||
|   pc = findsetreg(p, lastpc, 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 getobjname(p, pc, b, name);  /* get name for 'b' */ | ||||
|         break; | ||||
|       } | ||||
|       case OP_GETTABUP: | ||||
|       case OP_GETTABLE: { | ||||
|         int k = GETARG_C(i);  /* key index */ | ||||
|         int t = GETARG_B(i);  /* table index */ | ||||
|         const char *vn = (op == OP_GETTABLE)  /* name of indexed variable */ | ||||
|                          ? luaF_getlocalname(p, t + 1, pc) | ||||
|                          : upvalname(p, t); | ||||
|         kname(p, pc, k, name); | ||||
|         return (vn && strcmp(vn, LUA_ENV) == 0) ? "global" : "field"; | ||||
|       } | ||||
|       case OP_GETUPVAL: { | ||||
|         *name = upvalname(p, GETARG_B(i)); | ||||
|         return "upvalue"; | ||||
|       } | ||||
|       case OP_LOADK: | ||||
|       case OP_LOADKX: { | ||||
|         int b = (op == OP_LOADK) ? GETARG_Bx(i) | ||||
|                                  : GETARG_Ax(p->code[pc + 1]); | ||||
|         if (ttisstring(&p->k[b])) { | ||||
|           *name = svalue(&p->k[b]); | ||||
|           return "constant"; | ||||
|         } | ||||
|         break; | ||||
|       } | ||||
|       case OP_SELF: { | ||||
|         int k = GETARG_C(i);  /* key index */ | ||||
|         kname(p, pc, k, 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, CallInfo *ci, | ||||
|                                      const char **name) { | ||||
|   TMS tm = (TMS)0;  /* (initial value avoids warnings) */ | ||||
|   Proto *p = ci_func(ci)->p;  /* calling function */ | ||||
|   int pc = currentpc(ci);  /* calling instruction index */ | ||||
|   Instruction i = p->code[pc];  /* calling instruction */ | ||||
|   if (ci->callstatus & CIST_HOOKED) {  /* was it called inside a hook? */ | ||||
|     *name = "?"; | ||||
|     return "hook"; | ||||
|   } | ||||
|   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: | ||||
|       tm = TM_INDEX; | ||||
|       break; | ||||
|     case OP_SETTABUP: case OP_SETTABLE: | ||||
|       tm = TM_NEWINDEX; | ||||
|       break; | ||||
|     case OP_ADD: case OP_SUB: case OP_MUL: case OP_MOD: | ||||
|     case OP_POW: case OP_DIV: case OP_IDIV: case OP_BAND: | ||||
|     case OP_BOR: case OP_BXOR: case OP_SHL: case OP_SHR: { | ||||
|       int offset = cast_int(GET_OPCODE(i)) - cast_int(OP_ADD);  /* ORDER OP */ | ||||
|       tm = cast(TMS, offset + cast_int(TM_ADD));  /* ORDER TM */ | ||||
|       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: tm = TM_LT; break; | ||||
|     case OP_LE: tm = TM_LE; break; | ||||
|     default: | ||||
|       return NULL;  /* cannot find a reasonable name */ | ||||
|   } | ||||
|   *name = getstr(G(L)->tmname[tm]); | ||||
|   return "metamethod"; | ||||
| } | ||||
|  | ||||
| /* }====================================================== */ | ||||
|  | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** The subtraction of two potentially unrelated pointers is | ||||
| ** not ISO C, but it should not crash a program; the subsequent | ||||
| ** checks are ISO C and ensure a correct result. | ||||
| */ | ||||
| static int isinstack (CallInfo *ci, const TValue *o) { | ||||
|   ptrdiff_t i = o - ci->u.l.base; | ||||
|   return (0 <= i && i < (ci->top - ci->u.l.base) && ci->u.l.base + i == o); | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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 == o) { | ||||
|       *name = upvalname(c->p, i); | ||||
|       return "upvalue"; | ||||
|     } | ||||
|   } | ||||
|   return NULL; | ||||
| } | ||||
|  | ||||
|  | ||||
| static const char *varinfo (lua_State *L, const TValue *o) { | ||||
|   const char *name = NULL;  /* to avoid warnings */ | ||||
|   CallInfo *ci = L->ci; | ||||
|   const char *kind = NULL; | ||||
|   if (isLua(ci)) { | ||||
|     kind = getupvalname(ci, o, &name);  /* check whether 'o' is an upvalue */ | ||||
|     if (!kind && isinstack(ci, o))  /* no? try a register */ | ||||
|       kind = getobjname(ci_func(ci)->p, currentpc(ci), | ||||
|                         cast_int(o - ci->u.l.base), &name); | ||||
|   } | ||||
|   return (kind) ? luaO_pushfstring(L, " (%s '%s')", kind, name) : ""; | ||||
| } | ||||
|  | ||||
|  | ||||
| l_noret luaG_typeerror (lua_State *L, const TValue *o, const char *op) { | ||||
|   const char *t = luaT_objtypename(L, o); | ||||
|   luaG_runerror(L, "attempt to %s a %s value%s", op, t, varinfo(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) { | ||||
|   lua_Number temp; | ||||
|   if (!tonumber(p1, &temp))  /* 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 (!tointeger(p1, &temp)) | ||||
|     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) | ||||
|     luaO_chunkid(buff, getstr(src), LUA_IDSIZE); | ||||
|   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); | ||||
|     setobjs2s(L, L->top, L->top - 1);  /* move argument */ | ||||
|     setobjs2s(L, L->top - 1, errfunc);  /* push function */ | ||||
|     L->top++;  /* assume EXTRA_STACK */ | ||||
|     luaD_callnoyield(L, L->top - 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; | ||||
|   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, currentline(ci)); | ||||
|   luaG_errormsg(L); | ||||
| } | ||||
|  | ||||
|  | ||||
| void luaG_traceexec (lua_State *L) { | ||||
|   CallInfo *ci = L->ci; | ||||
|   lu_byte mask = L->hookmask; | ||||
|   int counthook = (--L->hookcount == 0 && (mask & LUA_MASKCOUNT)); | ||||
|   if (counthook) | ||||
|     resethookcount(L);  /* reset count */ | ||||
|   else if (!(mask & LUA_MASKLINE)) | ||||
|     return;  /* no line hook and count != 0; nothing to be done */ | ||||
|   if (ci->callstatus & CIST_HOOKYIELD) {  /* called hook last time? */ | ||||
|     ci->callstatus &= ~CIST_HOOKYIELD;  /* erase mark */ | ||||
|     return;  /* do not call hook again (VM yielded, so it did not move) */ | ||||
|   } | ||||
|   if (counthook) | ||||
|     luaD_hook(L, LUA_HOOKCOUNT, -1);  /* call count hook */ | ||||
|   if (mask & LUA_MASKLINE) { | ||||
|     Proto *p = ci_func(ci)->p; | ||||
|     int npc = pcRel(ci->u.l.savedpc, p); | ||||
|     int newline = getfuncline(p, npc); | ||||
|     if (npc == 0 ||  /* call linehook when enter a new function, */ | ||||
|         ci->u.l.savedpc <= L->oldpc ||  /* when jump back (loop), or when */ | ||||
|         newline != getfuncline(p, pcRel(L->oldpc, p)))  /* enter a new line */ | ||||
|       luaD_hook(L, LUA_HOOKLINE, newline);  /* call line hook */ | ||||
|   } | ||||
|   L->oldpc = ci->u.l.savedpc; | ||||
|   if (L->status == LUA_YIELD) {  /* did hook yield? */ | ||||
|     if (counthook) | ||||
|       L->hookcount = 1;  /* undo decrement to zero */ | ||||
|     ci->u.l.savedpc--;  /* undo increment (resume will increment it again) */ | ||||
|     ci->callstatus |= CIST_HOOKYIELD;  /* mark that it yielded */ | ||||
|     ci->func = L->top - 1;  /* protect stack below results */ | ||||
|     luaD_throw(L, LUA_YIELD); | ||||
|   } | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										40
									
								
								Plugins/slua_unreal/External/lua/ldebug.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										40
									
								
								Plugins/slua_unreal/External/lua/ldebug.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,40 @@ | ||||
| /* | ||||
| ** $Id: ldebug.h,v 2.14 2015/05/22 17:45:56 roberto Exp $ | ||||
| ** Auxiliary functions from Debug Interface module | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #ifndef ldebug_h | ||||
| #define ldebug_h | ||||
|  | ||||
| #include "lstate.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| #define pcRel(pc, p)	(cast(int, (pc) - (p)->code) - 1) | ||||
|  | ||||
| #define getfuncline(f,pc)	(((f)->lineinfo) ? (f)->lineinfo[pc] : -1) | ||||
|  | ||||
| #define resethookcount(L)	(L->hookcount = L->basehookcount) | ||||
|  | ||||
|  | ||||
| LUAI_FUNC l_noret luaG_typeerror (lua_State *L, const TValue *o, | ||||
|                                                 const char *opname); | ||||
| 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 void luaG_traceexec (lua_State *L); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										800
									
								
								Plugins/slua_unreal/External/lua/ldo.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										800
									
								
								Plugins/slua_unreal/External/lua/ldo.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,800 @@ | ||||
| /* | ||||
| ** $Id: ldo.c,v 2.157 2016/12/13 15:52:21 roberto Exp $ | ||||
| ** Stack and Call structure of Lua | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define ldo_c | ||||
| #define LUA_CORE | ||||
|  | ||||
| #include "ldo.h" | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <setjmp.h> | ||||
| #include <stdlib.h> | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lapi.h" | ||||
| #include "ldebug.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							/* } */ | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* chain list of long jump buffers */ | ||||
| struct lua_longjmp { | ||||
|   struct lua_longjmp *previous; | ||||
|   luai_jmpbuf b; | ||||
|   volatile int status;  /* error code */ | ||||
| }; | ||||
|  | ||||
|  | ||||
| static void 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 error handling")); | ||||
|       break; | ||||
|     } | ||||
|     default: { | ||||
|       setobjs2s(L, oldtop, L->top - 1);  /* error message on current top */ | ||||
|       break; | ||||
|     } | ||||
|   } | ||||
|   L->top = 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); | ||||
|     L->status = cast_byte(errcode);  /* mark it as dead */ | ||||
|     if (g->mainthread->errorJmp) {  /* main thread has a handler? */ | ||||
|       setobjs2s(L, g->mainthread->top++, L->top - 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? */ | ||||
|         seterrorobj(L, errcode, L->top);  /* assume EXTRA_STACK */ | ||||
|         if (L->ci->top < L->top) | ||||
|           L->ci->top = L->top;  /* pushing msg. can break this invariant */ | ||||
|         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) { | ||||
|   unsigned short 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 | ||||
| ** =================================================================== | ||||
| */ | ||||
| static void correctstack (lua_State *L, TValue *oldstack) { | ||||
|   CallInfo *ci; | ||||
|   UpVal *up; | ||||
|   L->top = (L->top - oldstack) + L->stack; | ||||
|   for (up = L->openupval; up != NULL; up = up->u.open.next) | ||||
|     up->v = (up->v - oldstack) + L->stack; | ||||
|   for (ci = L->ci; ci != NULL; ci = ci->previous) { | ||||
|     ci->top = (ci->top - oldstack) + L->stack; | ||||
|     ci->func = (ci->func - oldstack) + L->stack; | ||||
|     if (isLua(ci)) | ||||
|       ci->u.l.base = (ci->u.l.base - oldstack) + L->stack; | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| /* some space for error handling */ | ||||
| #define ERRORSTACKSIZE	(LUAI_MAXSTACK + 200) | ||||
|  | ||||
|  | ||||
| void luaD_reallocstack (lua_State *L, int newsize) { | ||||
|   TValue *oldstack = L->stack; | ||||
|   int lim = L->stacksize; | ||||
|   lua_assert(newsize <= LUAI_MAXSTACK || newsize == ERRORSTACKSIZE); | ||||
|   lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK); | ||||
|   luaM_reallocvector(L, L->stack, L->stacksize, newsize, TValue); | ||||
|   for (; lim < newsize; lim++) | ||||
|     setnilvalue(L->stack + lim); /* erase new segment */ | ||||
|   L->stacksize = newsize; | ||||
|   L->stack_last = L->stack + newsize - EXTRA_STACK; | ||||
|   correctstack(L, oldstack); | ||||
| } | ||||
|  | ||||
|  | ||||
| void luaD_growstack (lua_State *L, int n) { | ||||
|   int size = L->stacksize; | ||||
|   if (size > LUAI_MAXSTACK)  /* error after extra size? */ | ||||
|     luaD_throw(L, LUA_ERRERR); | ||||
|   else { | ||||
|     int needed = cast_int(L->top - L->stack) + n + EXTRA_STACK; | ||||
|     int newsize = 2 * size; | ||||
|     if (newsize > LUAI_MAXSTACK) newsize = LUAI_MAXSTACK; | ||||
|     if (newsize < needed) newsize = needed; | ||||
|     if (newsize > LUAI_MAXSTACK) {  /* stack overflow? */ | ||||
|       luaD_reallocstack(L, ERRORSTACKSIZE); | ||||
|       luaG_runerror(L, "stack overflow"); | ||||
|     } | ||||
|     else | ||||
|       luaD_reallocstack(L, newsize); | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| static int stackinuse (lua_State *L) { | ||||
|   CallInfo *ci; | ||||
|   StkId lim = L->top; | ||||
|   for (ci = L->ci; ci != NULL; ci = ci->previous) { | ||||
|     if (lim < ci->top) lim = ci->top; | ||||
|   } | ||||
|   lua_assert(lim <= L->stack_last); | ||||
|   return cast_int(lim - L->stack) + 1;  /* part of stack in use */ | ||||
| } | ||||
|  | ||||
|  | ||||
| void luaD_shrinkstack (lua_State *L) { | ||||
|   int inuse = stackinuse(L); | ||||
|   int goodsize = inuse + (inuse / 8) + 2*EXTRA_STACK; | ||||
|   if (goodsize > LUAI_MAXSTACK) | ||||
|     goodsize = LUAI_MAXSTACK;  /* respect stack limit */ | ||||
|   if (L->stacksize > LUAI_MAXSTACK)  /* had been handling stack overflow? */ | ||||
|     luaE_freeCI(L);  /* free all CIs (list grew because of an error) */ | ||||
|   else | ||||
|     luaE_shrinkCI(L);  /* shrink list */ | ||||
|   /* if thread is currently not handling a stack overflow and its | ||||
|      good size is smaller than current size, shrink its stack */ | ||||
|   if (inuse <= (LUAI_MAXSTACK - EXTRA_STACK) && | ||||
|       goodsize < L->stacksize) | ||||
|     luaD_reallocstack(L, goodsize); | ||||
|   else  /* don't change stack */ | ||||
|     condmovestack(L,{},{});  /* (change only for debugging) */ | ||||
| } | ||||
|  | ||||
|  | ||||
| void luaD_inctop (lua_State *L) { | ||||
|   luaD_checkstack(L, 1); | ||||
|   L->top++; | ||||
| } | ||||
|  | ||||
| /* }================================================================== */ | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Call a hook for the given event. Make sure there is a hook to be | ||||
| ** called. (Both 'L->hook' and 'L->hookmask', which triggers this | ||||
| ** function, can be changed asynchronously by signals.) | ||||
| */ | ||||
| void luaD_hook (lua_State *L, int event, int line) { | ||||
|   lua_Hook hook = L->hook; | ||||
|   if (hook && L->allowhook) {  /* make sure there is a hook */ | ||||
|     CallInfo *ci = L->ci; | ||||
|     ptrdiff_t top = savestack(L, L->top); | ||||
|     ptrdiff_t ci_top = savestack(L, ci->top); | ||||
|     lua_Debug ar; | ||||
|     ar.event = event; | ||||
|     ar.currentline = line; | ||||
|     ar.i_ci = ci; | ||||
|     luaD_checkstack(L, LUA_MINSTACK);  /* ensure minimum stack size */ | ||||
|     ci->top = L->top + LUA_MINSTACK; | ||||
|     lua_assert(ci->top <= L->stack_last); | ||||
|     L->allowhook = 0;  /* cannot call hooks inside a hook */ | ||||
|     ci->callstatus |= CIST_HOOKED; | ||||
|     lua_unlock(L); | ||||
|     (*hook)(L, &ar); | ||||
|     lua_lock(L); | ||||
|     lua_assert(!L->allowhook); | ||||
|     L->allowhook = 1; | ||||
|     ci->top = restorestack(L, ci_top); | ||||
|     L->top = restorestack(L, top); | ||||
|     ci->callstatus &= ~CIST_HOOKED; | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| static void callhook (lua_State *L, CallInfo *ci) { | ||||
|   int hook = LUA_HOOKCALL; | ||||
|   ci->u.l.savedpc++;  /* hooks assume 'pc' is already incremented */ | ||||
|   if (isLua(ci->previous) && | ||||
|       GET_OPCODE(*(ci->previous->u.l.savedpc - 1)) == OP_TAILCALL) { | ||||
|     ci->callstatus |= CIST_TAIL; | ||||
|     hook = LUA_HOOKTAILCALL; | ||||
|   } | ||||
|   luaD_hook(L, hook, -1); | ||||
|   ci->u.l.savedpc--;  /* correct 'pc' */ | ||||
| } | ||||
|  | ||||
|  | ||||
| static StkId adjust_varargs (lua_State *L, Proto *p, int actual) { | ||||
|   int i; | ||||
|   int nfixargs = p->numparams; | ||||
|   StkId base, fixed; | ||||
|   /* move fixed parameters to final position */ | ||||
|   fixed = L->top - actual;  /* first fixed argument */ | ||||
|   base = L->top;  /* final position of first argument */ | ||||
|   for (i = 0; i < nfixargs && i < actual; i++) { | ||||
|     setobjs2s(L, L->top++, fixed + i); | ||||
|     setnilvalue(fixed + i);  /* erase original copy (for GC) */ | ||||
|   } | ||||
|   for (; i < nfixargs; i++) | ||||
|     setnilvalue(L->top++);  /* complete missing arguments */ | ||||
|   return base; | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Check whether __call metafield of 'func' is a function. If so, put | ||||
| ** it in stack below original 'func' so that 'luaD_precall' can call | ||||
| ** it. Raise an error if __call metafield is not a function. | ||||
| */ | ||||
| static void tryfuncTM (lua_State *L, StkId func) { | ||||
|   const TValue *tm = luaT_gettmbyobj(L, func, TM_CALL); | ||||
|   StkId p; | ||||
|   if (!ttisfunction(tm)) | ||||
|     luaG_typeerror(L, func, "call"); | ||||
|   /* Open a hole inside the stack at 'func' */ | ||||
|   for (p = L->top; p > func; p--) | ||||
|     setobjs2s(L, p, p-1); | ||||
|   L->top++;  /* slot ensured by caller */ | ||||
|   setobj2s(L, func, tm);  /* tag method is the new function to be called */ | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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. | ||||
| */ | ||||
| static int moveresults (lua_State *L, const TValue *firstResult, StkId res, | ||||
|                                       int nres, int wanted) { | ||||
|   switch (wanted) {  /* handle typical cases separately */ | ||||
|     case 0: break;  /* nothing to move */ | ||||
|     case 1: {  /* one result needed */ | ||||
|       if (nres == 0)   /* no results? */ | ||||
|         firstResult = luaO_nilobject;  /* adjust with nil */ | ||||
|       setobjs2s(L, res, firstResult);  /* move it to proper place */ | ||||
|       break; | ||||
|     } | ||||
|     case LUA_MULTRET: { | ||||
|       int i; | ||||
|       for (i = 0; i < nres; i++)  /* move all results to correct place */ | ||||
|         setobjs2s(L, res + i, firstResult + i); | ||||
|       L->top = res + nres; | ||||
|       return 0;  /* wanted == LUA_MULTRET */ | ||||
|     } | ||||
|     default: { | ||||
|       int i; | ||||
|       if (wanted <= nres) {  /* enough results? */ | ||||
|         for (i = 0; i < wanted; i++)  /* move wanted results to correct place */ | ||||
|           setobjs2s(L, res + i, firstResult + i); | ||||
|       } | ||||
|       else {  /* not enough results; use all of them plus nils */ | ||||
|         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(res + i); | ||||
|       } | ||||
|       break; | ||||
|     } | ||||
|   } | ||||
|   L->top = res + wanted;  /* top points after the last result */ | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Finishes a function call: calls hook if necessary, removes CallInfo, | ||||
| ** moves current number of results to proper place; returns 0 iff call | ||||
| ** wanted multiple (variable number of) results. | ||||
| */ | ||||
| int luaD_poscall (lua_State *L, CallInfo *ci, StkId firstResult, int nres) { | ||||
|   StkId res; | ||||
|   int wanted = ci->nresults; | ||||
|   if (L->hookmask & (LUA_MASKRET | LUA_MASKLINE)) { | ||||
|     if (L->hookmask & LUA_MASKRET) { | ||||
|       ptrdiff_t fr = savestack(L, firstResult);  /* hook may change stack */ | ||||
|       luaD_hook(L, LUA_HOOKRET, -1); | ||||
|       firstResult = restorestack(L, fr); | ||||
|     } | ||||
|     L->oldpc = ci->previous->u.l.savedpc;  /* 'oldpc' for caller function */ | ||||
|   } | ||||
|   res = ci->func;  /* res == final position of 1st result */ | ||||
|   L->ci = ci->previous;  /* back to caller */ | ||||
|   /* move results to proper place */ | ||||
|   return moveresults(L, firstResult, res, nres, wanted); | ||||
| } | ||||
|  | ||||
|  | ||||
|  | ||||
| #define next_ci(L) (L->ci = (L->ci->next ? L->ci->next : luaE_extendCI(L))) | ||||
|  | ||||
|  | ||||
| /* macro to check stack size, preserving 'p' */ | ||||
| #define checkstackp(L,n,p)  \ | ||||
|   luaD_checkstackaux(L, n, \ | ||||
|     ptrdiff_t t__ = savestack(L, p);  /* save 'p' */ \ | ||||
|     luaC_checkGC(L),  /* stack grow uses memory */ \ | ||||
|     p = restorestack(L, t__))  /* 'pos' part: restore 'p' */ | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Prepares a function call: checks the stack, creates a new CallInfo | ||||
| ** entry, fills in the relevant information, calls hook if needed. | ||||
| ** If function is a C function, does the call, too. (Otherwise, leave | ||||
| ** the execution ('luaV_execute') to the caller, to allow stackless | ||||
| ** calls.) Returns true iff function has been executed (C function). | ||||
| */ | ||||
| int luaD_precall (lua_State *L, StkId func, int nresults) { | ||||
|   lua_CFunction f; | ||||
|   CallInfo *ci; | ||||
|   switch (ttype(func)) { | ||||
|     case LUA_TCCL:  /* C closure */ | ||||
|       f = clCvalue(func)->f; | ||||
|       goto Cfunc; | ||||
|     case LUA_TLCF:  /* light C function */ | ||||
|       f = fvalue(func); | ||||
|      Cfunc: { | ||||
|       int n;  /* number of returns */ | ||||
|       checkstackp(L, LUA_MINSTACK, func);  /* ensure minimum stack size */ | ||||
|       ci = next_ci(L);  /* now 'enter' new function */ | ||||
|       ci->nresults = nresults; | ||||
|       ci->func = func; | ||||
|       ci->top = L->top + LUA_MINSTACK; | ||||
|       lua_assert(ci->top <= L->stack_last); | ||||
|       ci->callstatus = 0; | ||||
|       if (L->hookmask & LUA_MASKCALL) | ||||
|         luaD_hook(L, LUA_HOOKCALL, -1); | ||||
|       lua_unlock(L); | ||||
|       n = (*f)(L);  /* do the actual call */ | ||||
|       lua_lock(L); | ||||
|       api_checknelems(L, n); | ||||
|       luaD_poscall(L, ci, L->top - n, n); | ||||
|       return 1; | ||||
|     } | ||||
|     case LUA_TLCL: {  /* Lua function: prepare its call */ | ||||
|       StkId base; | ||||
|       Proto *p = clLvalue(func)->p; | ||||
|       int n = cast_int(L->top - func) - 1;  /* number of real arguments */ | ||||
|       int fsize = p->maxstacksize;  /* frame size */ | ||||
|       checkstackp(L, fsize, func); | ||||
|       if (p->is_vararg) | ||||
|         base = adjust_varargs(L, p, n); | ||||
|       else {  /* non vararg function */ | ||||
|         for (; n < p->numparams; n++) | ||||
|           setnilvalue(L->top++);  /* complete missing arguments */ | ||||
|         base = func + 1; | ||||
|       } | ||||
|       ci = next_ci(L);  /* now 'enter' new function */ | ||||
|       ci->nresults = nresults; | ||||
|       ci->func = func; | ||||
|       ci->u.l.base = base; | ||||
|       L->top = ci->top = base + fsize; | ||||
|       lua_assert(ci->top <= L->stack_last); | ||||
|       ci->u.l.savedpc = p->code;  /* starting point */ | ||||
|       ci->callstatus = CIST_LUA; | ||||
|       if (L->hookmask & LUA_MASKCALL) | ||||
|         callhook(L, ci); | ||||
|       return 0; | ||||
|     } | ||||
|     default: {  /* not a function */ | ||||
|       checkstackp(L, 1, func);  /* ensure space for metamethod */ | ||||
|       tryfuncTM(L, func);  /* try to get '__call' metamethod */ | ||||
|       return luaD_precall(L, func, nresults);  /* now it must be a function */ | ||||
|     } | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Check appropriate error for stack overflow ("regular" overflow or | ||||
| ** overflow while handling stack overflow). If 'nCalls' is larger than | ||||
| ** LUAI_MAXCCALLS (which means it is handling a "regular" overflow) but | ||||
| ** smaller than 9/8 of LUAI_MAXCCALLS, does not report an error (to | ||||
| ** allow overflow handling to work) | ||||
| */ | ||||
| static void stackerror (lua_State *L) { | ||||
|   if (L->nCcalls == LUAI_MAXCCALLS) | ||||
|     luaG_runerror(L, "C stack overflow"); | ||||
|   else if (L->nCcalls >= (LUAI_MAXCCALLS + (LUAI_MAXCCALLS>>3))) | ||||
|     luaD_throw(L, LUA_ERRERR);  /* error while handing stack error */ | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Call a function (C or Lua). The function to be called is at *func. | ||||
| ** The arguments are on the stack, right after the function. | ||||
| ** When returns, all the results are on the stack, starting at the original | ||||
| ** function position. | ||||
| */ | ||||
| void luaD_call (lua_State *L, StkId func, int nResults) { | ||||
|   if (++L->nCcalls >= LUAI_MAXCCALLS) | ||||
|     stackerror(L); | ||||
|   if (!luaD_precall(L, func, nResults))  /* is a Lua function? */ | ||||
|     luaV_execute(L);  /* call it */ | ||||
|   L->nCcalls--; | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Similar to 'luaD_call', but does not allow yields during the call | ||||
| */ | ||||
| void luaD_callnoyield (lua_State *L, StkId func, int nResults) { | ||||
|   L->nny++; | ||||
|   luaD_call(L, func, nResults); | ||||
|   L->nny--; | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Completes the execution of an interrupted C function, calling its | ||||
| ** continuation function. | ||||
| */ | ||||
| static void finishCcall (lua_State *L, int status) { | ||||
|   CallInfo *ci = L->ci; | ||||
|   int n; | ||||
|   /* must have a continuation and must be able to call it */ | ||||
|   lua_assert(ci->u.c.k != NULL && L->nny == 0); | ||||
|   /* error status can only happen in a protected call */ | ||||
|   lua_assert((ci->callstatus & CIST_YPCALL) || status == LUA_YIELD); | ||||
|   if (ci->callstatus & CIST_YPCALL) {  /* was inside a pcall? */ | ||||
|     ci->callstatus &= ~CIST_YPCALL;  /* continuation is also inside it */ | ||||
|     L->errfunc = ci->u.c.old_errfunc;  /* with the same error function */ | ||||
|   } | ||||
|   /* finish 'lua_callk'/'lua_pcall'; CIST_YPCALL and 'errfunc' already | ||||
|      handled */ | ||||
|   adjustresults(L, ci->nresults); | ||||
|   lua_unlock(L); | ||||
|   n = (*ci->u.c.k)(L, status, ci->u.c.ctx);  /* call continuation function */ | ||||
|   lua_lock(L); | ||||
|   api_checknelems(L, n); | ||||
|   luaD_poscall(L, ci, L->top - n, n);  /* finish 'luaD_precall' */ | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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). If the coroutine is | ||||
| ** recovering from an error, 'ud' points to the error status, which must | ||||
| ** be passed to the first continuation function (otherwise the default | ||||
| ** status is LUA_YIELD). | ||||
| */ | ||||
| static void unroll (lua_State *L, void *ud) { | ||||
|   if (ud != NULL)  /* error status? */ | ||||
|     finishCcall(L, *(int *)ud);  /* finish 'lua_pcallk' callee */ | ||||
|   while (L->ci != &L->base_ci) {  /* something in the stack */ | ||||
|     if (!isLua(L->ci))  /* C function? */ | ||||
|       finishCcall(L, LUA_YIELD);  /* complete its execution */ | ||||
|     else {  /* Lua function */ | ||||
|       luaV_finishOp(L);  /* finish interrupted instruction */ | ||||
|       luaV_execute(L);  /* 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 */ | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Recovers from an error in a coroutine. Finds a recover point (if | ||||
| ** there is one) and completes the execution of the interrupted | ||||
| ** 'luaD_pcall'. If there is no recover point, returns zero. | ||||
| */ | ||||
| static int recover (lua_State *L, int status) { | ||||
|   StkId oldtop; | ||||
|   CallInfo *ci = findpcall(L); | ||||
|   if (ci == NULL) return 0;  /* no recovery point */ | ||||
|   /* "finish" luaD_pcall */ | ||||
|   oldtop = restorestack(L, ci->extra); | ||||
|   luaF_close(L, oldtop); | ||||
|   seterrorobj(L, status, oldtop); | ||||
|   L->ci = ci; | ||||
|   L->allowhook = getoah(ci->callstatus);  /* restore original 'allowhook' */ | ||||
|   L->nny = 0;  /* should be zero to be yieldable */ | ||||
|   luaD_shrinkstack(L); | ||||
|   L->errfunc = ci->u.c.old_errfunc; | ||||
|   return 1;  /* continue running the coroutine */ | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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) { | ||||
|   L->top -= narg;  /* remove args from the stack */ | ||||
|   setsvalue2s(L, L->top, 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 - n;  /* first argument */ | ||||
|   CallInfo *ci = L->ci; | ||||
|   if (L->status == LUA_OK) {  /* starting a coroutine? */ | ||||
|     if (!luaD_precall(L, firstArg - 1, LUA_MULTRET))  /* Lua function? */ | ||||
|       luaV_execute(L);  /* call it */ | ||||
|   } | ||||
|   else {  /* resuming from previous yield */ | ||||
|     lua_assert(L->status == LUA_YIELD); | ||||
|     L->status = LUA_OK;  /* mark that it is running (again) */ | ||||
|     ci->func = restorestack(L, ci->extra); | ||||
|     if (isLua(ci))  /* yielded inside a hook? */ | ||||
|       luaV_execute(L);  /* 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); | ||||
|         firstArg = L->top - n;  /* yield results come from continuation */ | ||||
|       } | ||||
|       luaD_poscall(L, ci, firstArg, n);  /* finish 'luaD_precall' */ | ||||
|     } | ||||
|     unroll(L, NULL);  /* run continuation */ | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| LUA_API int lua_resume (lua_State *L, lua_State *from, int nargs) { | ||||
|   int status; | ||||
|   unsigned short oldnny = L->nny;  /* save "number of non-yieldable" calls */ | ||||
|   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->status != LUA_YIELD) | ||||
|     return resume_error(L, "cannot resume dead coroutine", nargs); | ||||
|   L->nCcalls = (from) ? from->nCcalls + 1 : 1; | ||||
|   if (L->nCcalls >= LUAI_MAXCCALLS) | ||||
|     return resume_error(L, "C stack overflow", nargs); | ||||
|   luai_userstateresume(L, nargs); | ||||
|   L->nny = 0;  /* allow yields */ | ||||
|   api_checknelems(L, (L->status == LUA_OK) ? nargs + 1 : nargs); | ||||
|   status = luaD_rawrunprotected(L, resume, &nargs); | ||||
|   if (status == -1)  /* error calling 'lua_resume'? */ | ||||
|     status = LUA_ERRRUN; | ||||
|   else {  /* continue running after recoverable errors */ | ||||
|     while (errorstatus(status) && recover(L, status)) { | ||||
|       /* unroll continuation */ | ||||
|       status = luaD_rawrunprotected(L, unroll, &status); | ||||
|     } | ||||
|     if (errorstatus(status)) {  /* unrecoverable error? */ | ||||
|       L->status = cast_byte(status);  /* mark thread as 'dead' */ | ||||
|       seterrorobj(L, status, L->top);  /* push error message */ | ||||
|       L->ci->top = L->top; | ||||
|     } | ||||
|     else lua_assert(status == L->status);  /* normal end or yield */ | ||||
|   } | ||||
|   L->nny = oldnny;  /* restore 'nny' */ | ||||
|   L->nCcalls--; | ||||
|   lua_assert(L->nCcalls == ((from) ? from->nCcalls : 0)); | ||||
|   lua_unlock(L); | ||||
|   return status; | ||||
| } | ||||
|  | ||||
|  | ||||
| LUA_API int lua_isyieldable (lua_State *L) { | ||||
|   return (L->nny == 0); | ||||
| } | ||||
|  | ||||
|  | ||||
| LUA_API int lua_yieldk (lua_State *L, int nresults, lua_KContext ctx, | ||||
|                         lua_KFunction k) { | ||||
|   CallInfo *ci = L->ci; | ||||
|   luai_userstateyield(L, nresults); | ||||
|   lua_lock(L); | ||||
|   api_checknelems(L, nresults); | ||||
|   if (L->nny > 0) { | ||||
|     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->extra = savestack(L, ci->func);  /* save current 'func' */ | ||||
|   if (isLua(ci)) {  /* inside a hook? */ | ||||
|     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 */ | ||||
|     ci->func = L->top - nresults - 1;  /* protect stack below results */ | ||||
|     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' */ | ||||
| } | ||||
|  | ||||
|  | ||||
| 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; | ||||
|   unsigned short old_nny = L->nny; | ||||
|   ptrdiff_t old_errfunc = L->errfunc; | ||||
|   L->errfunc = ef; | ||||
|   status = luaD_rawrunprotected(L, func, u); | ||||
|   if (status != LUA_OK) {  /* an error occurred? */ | ||||
|     StkId oldtop = restorestack(L, old_top); | ||||
|     luaF_close(L, oldtop);  /* close possible pending closures */ | ||||
|     seterrorobj(L, status, oldtop); | ||||
|     L->ci = old_ci; | ||||
|     L->allowhook = old_allowhooks; | ||||
|     L->nny = old_nny; | ||||
|     luaD_shrinkstack(L); | ||||
|   } | ||||
|   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 (mode && 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); | ||||
|   if (L->onlyluac == 0) { | ||||
|     int c = zgetc(p->z); /* read first character */ | ||||
|     if (c == LUA_SIGNATURE[0]) { | ||||
|       checkmode(L, p->mode, "binary"); | ||||
|       cl = luaU_undump(L, p->z, p->name); | ||||
|     } else { | ||||
|       checkmode(L, p->mode, "text"); | ||||
|       cl = luaY_parser(L, p->z, &p->buff, &p->dyd, p->name, c); | ||||
|     } | ||||
|   } else { | ||||
|     checkmode(L, p->mode, "binary"); | ||||
|     cl = luaU_undump(L, p->z, p->name); | ||||
|   } | ||||
|   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; | ||||
|   L->nny++;  /* 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), 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); | ||||
|   L->nny--; | ||||
|   return status; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										60
									
								
								Plugins/slua_unreal/External/lua/ldo.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										60
									
								
								Plugins/slua_unreal/External/lua/ldo.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,60 @@ | ||||
| /* | ||||
| ** $Id: ldo.h,v 2.29 2015/12/21 13:02:14 roberto Exp $ | ||||
| ** Stack and Call structure of Lua | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #ifndef ldo_h | ||||
| #define ldo_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. | ||||
| ** 'condmovestack' is used in heavy tests to force a stack reallocation | ||||
| ** at every check. | ||||
| */ | ||||
| #define luaD_checkstackaux(L,n,pre,pos)  \ | ||||
| 	if (L->stack_last - L->top <= (n)) \ | ||||
| 	  { pre; luaD_growstack(L, n); 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,p)		((char *)(p) - (char *)L->stack) | ||||
| #define restorestack(L,n)	((TValue *)((char *)L->stack + (n))) | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* type of protected functions, to be ran by 'runprotected' */ | ||||
| typedef void (*Pfunc) (lua_State *L, void *ud); | ||||
|  | ||||
| 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); | ||||
| LUAI_FUNC int 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_pcall (lua_State *L, Pfunc func, void *u, | ||||
|                                         ptrdiff_t oldtop, ptrdiff_t ef); | ||||
| LUAI_FUNC int luaD_poscall (lua_State *L, CallInfo *ci, StkId firstResult, | ||||
|                                           int nres); | ||||
| LUAI_FUNC void luaD_reallocstack (lua_State *L, int newsize); | ||||
| LUAI_FUNC void luaD_growstack (lua_State *L, int n); | ||||
| 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); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
|  | ||||
							
								
								
									
										218
									
								
								Plugins/slua_unreal/External/lua/ldump.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										218
									
								
								Plugins/slua_unreal/External/lua/ldump.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,218 @@ | ||||
| /* | ||||
| ** $Id: ldump.c,v 2.37 2015/10/08 15:53:49 roberto Exp $ | ||||
| ** save precompiled Lua chunks | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define ldump_c | ||||
| #define LUA_CORE | ||||
|  | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <stddef.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lobject.h" | ||||
| #include "lstate.h" | ||||
| #include "lundump.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| #ifdef _LUAC | ||||
|  | ||||
| typedef struct { | ||||
|   lua_State *L; | ||||
|   lua_Writer writer; | ||||
|   void *data; | ||||
|   int strip; | ||||
|   int status; | ||||
| } DumpState; | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** All high-level dumps go through DumpVector; you can change it to | ||||
| ** change the endianness of the result | ||||
| */ | ||||
| #define DumpVector(v,n,D)	DumpBlock(v,(n)*sizeof((v)[0]),D) | ||||
|  | ||||
| #define DumpLiteral(s,D)	DumpBlock(s, sizeof(s) - sizeof(char), D) | ||||
|  | ||||
|  | ||||
| static void DumpBlock (const void *b, size_t size, DumpState *D) { | ||||
|   if (D->status == 0 && size > 0) { | ||||
|     lua_unlock(D->L); | ||||
|     D->status = (*D->writer)(D->L, b, size, D->data); | ||||
|     lua_lock(D->L); | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| #define DumpVar(x,D)		DumpVector(&x,1,D) | ||||
|  | ||||
|  | ||||
| static void DumpByte (int y, DumpState *D) { | ||||
|   lu_byte x = (lu_byte)y; | ||||
|   DumpVar(x, D); | ||||
| } | ||||
|  | ||||
|  | ||||
| static void DumpInt (int x, DumpState *D) { | ||||
|   DumpVar(x, D); | ||||
| } | ||||
|  | ||||
|  | ||||
| static void DumpNumber (lua_Number x, DumpState *D) { | ||||
|   DumpVar(x, D); | ||||
| } | ||||
|  | ||||
|  | ||||
| static void DumpInteger (lua_Integer x, DumpState *D) { | ||||
|   DumpVar(x, D); | ||||
| } | ||||
|  | ||||
|  | ||||
| static void DumpString (const TString *s, DumpState *D) { | ||||
|   if (s == NULL) | ||||
|     DumpByte(0, D); | ||||
|   else { | ||||
|     int size = tsslen(s) + 1;  /* include trailing '\0' */ | ||||
|     const char *str = getstr(s); | ||||
|     if (size < 0xFF) | ||||
|       DumpByte(cast_int(size), D); | ||||
|     else { | ||||
|       DumpByte(0xFF, D); | ||||
|       DumpVar(size, D); | ||||
|     } | ||||
|     DumpVector(str, size - 1, D);  /* no need to save '\0' */ | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| static void DumpCode (const Proto *f, DumpState *D) { | ||||
|   DumpInt(f->sizecode, D); | ||||
|   DumpVector(f->code, f->sizecode, D); | ||||
| } | ||||
|  | ||||
|  | ||||
| static void DumpFunction(const Proto *f, TString *psource, DumpState *D); | ||||
|  | ||||
| static void DumpConstants (const Proto *f, DumpState *D) { | ||||
|   int i; | ||||
|   int n = f->sizek; | ||||
|   DumpInt(n, D); | ||||
|   for (i = 0; i < n; i++) { | ||||
|     const TValue *o = &f->k[i]; | ||||
|     DumpByte(ttype(o), D); | ||||
|     switch (ttype(o)) { | ||||
|     case LUA_TNIL: | ||||
|       break; | ||||
|     case LUA_TBOOLEAN: | ||||
|       DumpByte(bvalue(o), D); | ||||
|       break; | ||||
|     case LUA_TNUMFLT: | ||||
|       DumpNumber(fltvalue(o), D); | ||||
|       break; | ||||
|     case LUA_TNUMINT: | ||||
|       DumpInteger(ivalue(o), D); | ||||
|       break; | ||||
|     case LUA_TSHRSTR: | ||||
|     case LUA_TLNGSTR: | ||||
|       DumpString(tsvalue(o), D); | ||||
|       break; | ||||
|     default: | ||||
|       lua_assert(0); | ||||
|     } | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| static void DumpProtos (const Proto *f, DumpState *D) { | ||||
|   int i; | ||||
|   int n = f->sizep; | ||||
|   DumpInt(n, D); | ||||
|   for (i = 0; i < n; i++) | ||||
|     DumpFunction(f->p[i], f->source, D); | ||||
| } | ||||
|  | ||||
|  | ||||
| static void DumpUpvalues (const Proto *f, DumpState *D) { | ||||
|   int i, n = f->sizeupvalues; | ||||
|   DumpInt(n, D); | ||||
|   for (i = 0; i < n; i++) { | ||||
|     DumpByte(f->upvalues[i].instack, D); | ||||
|     DumpByte(f->upvalues[i].idx, D); | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| static void DumpDebug (const Proto *f, DumpState *D) { | ||||
|   int i, n; | ||||
|   n = (D->strip) ? 0 : f->sizelineinfo; | ||||
|   DumpInt(n, D); | ||||
|   DumpVector(f->lineinfo, n, D); | ||||
|   n = (D->strip) ? 0 : f->sizelocvars; | ||||
|   DumpInt(n, D); | ||||
|   for (i = 0; i < n; i++) { | ||||
|     DumpString(f->locvars[i].varname, D); | ||||
|     DumpInt(f->locvars[i].startpc, D); | ||||
|     DumpInt(f->locvars[i].endpc, D); | ||||
|   } | ||||
|   n = (D->strip) ? 0 : f->sizeupvalues; | ||||
|   DumpInt(n, D); | ||||
|   for (i = 0; i < n; i++) | ||||
|     DumpString(f->upvalues[i].name, D); | ||||
| } | ||||
|  | ||||
|  | ||||
| static void DumpFunction (const Proto *f, TString *psource, DumpState *D) { | ||||
|   if (D->strip || f->source == psource) | ||||
|     DumpString(NULL, D);  /* no debug info or same source as its parent */ | ||||
|   else | ||||
|     DumpString(f->source, D); | ||||
|   DumpInt(f->linedefined, D); | ||||
|   DumpInt(f->lastlinedefined, D); | ||||
|   DumpByte(f->numparams, D); | ||||
|   DumpByte(f->is_vararg, D); | ||||
|   DumpByte(f->maxstacksize, D); | ||||
|   DumpCode(f, D); | ||||
|   DumpConstants(f, D); | ||||
|   DumpUpvalues(f, D); | ||||
|   DumpProtos(f, D); | ||||
|   DumpDebug(f, D); | ||||
| } | ||||
|  | ||||
|  | ||||
| static void DumpHeader (DumpState *D) { | ||||
|   DumpLiteral(LUA_SIGNATURE, D); | ||||
|   DumpByte(LUAC_VERSION, D); | ||||
|   DumpByte(LUAC_FORMAT, D); | ||||
|   DumpLiteral(LUAC_DATA, D); | ||||
|   DumpByte(sizeof(int), D); | ||||
|   DumpByte(sizeof(int), D); | ||||
|   DumpByte(sizeof(Instruction), D); | ||||
|   DumpByte(sizeof(lua_Integer), D); | ||||
|   DumpByte(sizeof(lua_Number), D); | ||||
|   DumpInteger(LUAC_INT, D); | ||||
|   DumpNumber(LUAC_NUM, D); | ||||
| } | ||||
|  | ||||
| /* | ||||
| ** 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.L = L; | ||||
|   D.writer = w; | ||||
|   D.data = data; | ||||
|   D.strip = strip; | ||||
|   D.status = 0; | ||||
|   DumpHeader(&D); | ||||
|   DumpByte(f->sizeupvalues, &D); | ||||
|   DumpFunction(f, NULL, &D); | ||||
|   return D.status; | ||||
| } | ||||
|  | ||||
| #endif // end _LUAC | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										150
									
								
								Plugins/slua_unreal/External/lua/lfunc.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										150
									
								
								Plugins/slua_unreal/External/lua/lfunc.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,150 @@ | ||||
| /* | ||||
| ** $Id: lfunc.c,v 2.45 2014/11/02 19:19:04 roberto Exp $ | ||||
| ** Auxiliary functions to manipulate prototypes and closures | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define lfunc_c | ||||
| #define LUA_CORE | ||||
|  | ||||
| #include "lfunc.h" | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <stddef.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lgc.h" | ||||
| #include "lmem.h" | ||||
| #include "lobject.h" | ||||
| #include "lstate.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| CClosure *luaF_newCclosure (lua_State *L, int n) { | ||||
|   GCObject *o = luaC_newobj(L, LUA_TCCL, sizeCclosure(n)); | ||||
|   CClosure *c = gco2ccl(o); | ||||
|   c->nupvalues = cast_byte(n); | ||||
|   return c; | ||||
| } | ||||
|  | ||||
|  | ||||
| LClosure *luaF_newLclosure (lua_State *L, int n) { | ||||
|   GCObject *o = luaC_newobj(L, LUA_TLCL, sizeLclosure(n)); | ||||
|   LClosure *c = gco2lcl(o); | ||||
|   c->p = NULL; | ||||
|   c->nupvalues = cast_byte(n); | ||||
|   while (n--) c->upvals[n] = 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++) { | ||||
|     UpVal *uv = luaM_new(L, UpVal); | ||||
|     uv->refcount = 1; | ||||
|     uv->v = &uv->u.value;  /* make it closed */ | ||||
|     setnilvalue(uv->v); | ||||
|     cl->upvals[i] = uv; | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| UpVal *luaF_findupval (lua_State *L, StkId level) { | ||||
|   UpVal **pp = &L->openupval; | ||||
|   UpVal *p; | ||||
|   UpVal *uv; | ||||
|   lua_assert(isintwups(L) || L->openupval == NULL); | ||||
|   while (*pp != NULL && (p = *pp)->v >= level) { | ||||
|     lua_assert(upisopen(p)); | ||||
|     if (p->v == level)  /* found a corresponding upvalue? */ | ||||
|       return p;  /* return it */ | ||||
|     pp = &p->u.open.next; | ||||
|   } | ||||
|   /* not found: create a new upvalue */ | ||||
|   uv = luaM_new(L, UpVal); | ||||
|   uv->refcount = 0; | ||||
|   uv->u.open.next = *pp;  /* link it to list of open upvalues */ | ||||
|   uv->u.open.touched = 1; | ||||
|   *pp = uv; | ||||
|   uv->v = level;  /* current value lives in the stack */ | ||||
|   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; | ||||
| } | ||||
|  | ||||
|  | ||||
| void luaF_close (lua_State *L, StkId level) { | ||||
|   UpVal *uv; | ||||
|   while (L->openupval != NULL && (uv = L->openupval)->v >= level) { | ||||
|     lua_assert(upisopen(uv)); | ||||
|     L->openupval = uv->u.open.next;  /* remove from 'open' list */ | ||||
|     if (uv->refcount == 0)  /* no references? */ | ||||
|       luaM_free(L, uv);  /* free upvalue */ | ||||
|     else { | ||||
|       setobj(L, &uv->u.value, uv->v);  /* move value to upvalue slot */ | ||||
|       uv->v = &uv->u.value;  /* now current value lives here */ | ||||
|       luaC_upvalbarrier(L, uv); | ||||
|     } | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| Proto *luaF_newproto (lua_State *L) { | ||||
|   GCObject *o = luaC_newobj(L, LUA_TPROTO, sizeof(Proto)); | ||||
|   Proto *f = gco2p(o); | ||||
|   f->k = NULL; | ||||
|   f->sizek = 0; | ||||
|   f->p = NULL; | ||||
|   f->sizep = 0; | ||||
|   f->code = NULL; | ||||
|   f->cache = NULL; | ||||
|   f->sizecode = 0; | ||||
|   f->lineinfo = NULL; | ||||
|   f->sizelineinfo = 0; | ||||
|   f->upvalues = NULL; | ||||
|   f->sizeupvalues = 0; | ||||
|   f->numparams = 0; | ||||
|   f->is_vararg = 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) { | ||||
|   luaM_freearray(L, f->code, f->sizecode); | ||||
|   luaM_freearray(L, f->p, f->sizep); | ||||
|   luaM_freearray(L, f->k, f->sizek); | ||||
|   luaM_freearray(L, f->lineinfo, f->sizelineinfo); | ||||
|   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; i<f->sizelocvars && 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 */ | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										61
									
								
								Plugins/slua_unreal/External/lua/lfunc.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										61
									
								
								Plugins/slua_unreal/External/lua/lfunc.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,61 @@ | ||||
| /* | ||||
| ** $Id: lfunc.h,v 2.15 2015/01/13 15:49:11 roberto Exp $ | ||||
| ** 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, sizeof(CClosure)) + \ | ||||
|                          cast(int, sizeof(TValue)*((n)-1))) | ||||
|  | ||||
| #define sizeLclosure(n)	(cast(int, sizeof(LClosure)) + \ | ||||
|                          cast(int, sizeof(TValue *)*((n)-1))) | ||||
|  | ||||
|  | ||||
| /* 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 | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* | ||||
| ** Upvalues for Lua closures | ||||
| */ | ||||
| struct UpVal { | ||||
|   TValue *v;  /* points to stack or to its own value */ | ||||
|   lu_mem refcount;  /* reference counter */ | ||||
|   union { | ||||
|     struct {  /* (when open) */ | ||||
|       UpVal *next;  /* linked list */ | ||||
|       int touched;  /* mark to avoid cycles with dead threads */ | ||||
|     } open; | ||||
|     TValue value;  /* the value (when closed) */ | ||||
|   } u; | ||||
| }; | ||||
|  | ||||
| #define upisopen(up)	((up)->v != &(up)->u.value) | ||||
|  | ||||
|  | ||||
| LUAI_FUNC Proto *luaF_newproto (lua_State *L); | ||||
| LUAI_FUNC CClosure *luaF_newCclosure (lua_State *L, int nelems); | ||||
| LUAI_FUNC LClosure *luaF_newLclosure (lua_State *L, int nelems); | ||||
| LUAI_FUNC void luaF_initupvals (lua_State *L, LClosure *cl); | ||||
| LUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level); | ||||
| LUAI_FUNC void luaF_close (lua_State *L, StkId level); | ||||
| LUAI_FUNC void luaF_freeproto (lua_State *L, Proto *f); | ||||
| LUAI_FUNC const char *luaF_getlocalname (const Proto *func, int local_number, | ||||
|                                          int pc); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										1177
									
								
								Plugins/slua_unreal/External/lua/lgc.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										1177
									
								
								Plugins/slua_unreal/External/lua/lgc.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
										
											
												File diff suppressed because it is too large
												Load Diff
											
										
									
								
							
							
								
								
									
										150
									
								
								Plugins/slua_unreal/External/lua/lgc.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										150
									
								
								Plugins/slua_unreal/External/lua/lgc.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,150 @@ | ||||
| /* | ||||
| ** $Id: lgc.h,v 2.91 2015/12/21 13:02:14 roberto Exp $ | ||||
| ** Garbage Collector | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #ifndef lgc_h | ||||
| #define lgc_h | ||||
|  | ||||
|  | ||||
| #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. These lists have no meaning when the invariant | ||||
| ** is not being enforced (e.g., sweep phase). | ||||
| */ | ||||
|  | ||||
|  | ||||
|  | ||||
| /* how much to allocate before next GC step */ | ||||
| #if !defined(GCSTEPSIZE) | ||||
| /* ~100 small strings */ | ||||
| #define GCSTEPSIZE	(cast_int(100 * sizeof(TString))) | ||||
| #endif | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Possible states of the Garbage Collector | ||||
| */ | ||||
| #define GCSpropagate	0 | ||||
| #define GCSatomic	1 | ||||
| #define GCSswpallgc	2 | ||||
| #define GCSswpfinobj	3 | ||||
| #define GCSswptobefnz	4 | ||||
| #define GCSswpend	5 | ||||
| #define GCScallfin	6 | ||||
| #define GCSpause	7 | ||||
|  | ||||
|  | ||||
| #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(lu_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: */ | ||||
| #define WHITE0BIT	0  /* object is white (type 0) */ | ||||
| #define WHITE1BIT	1  /* object is white (type 1) */ | ||||
| #define BLACKBIT	2  /* object is black */ | ||||
| #define FINALIZEDBIT	3  /* object has been marked for finalization */ | ||||
| /* bit 7 is currently used by tests (luaL_checkmemory) */ | ||||
|  | ||||
| #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) ^ WHITEBITS) & (ow))) | ||||
| #define isdead(g,v)	isdeadm(otherwhite(g), (v)->marked) | ||||
|  | ||||
| #define changewhite(x)	((x)->marked ^= WHITEBITS) | ||||
| #define gray2black(x)	l_setbit((x)->marked, BLACKBIT) | ||||
|  | ||||
| #define luaC_white(g)	cast(lu_byte, (g)->currentwhite & WHITEBITS) | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Does one step of collection when debt becomes positive. '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_barrier(L,p,v) (  \ | ||||
| 	(iscollectable(v) && isblack(p) && iswhite(gcvalue(v))) ?  \ | ||||
| 	luaC_barrier_(L,obj2gco(p),gcvalue(v)) : cast_void(0)) | ||||
|  | ||||
| #define luaC_barrierback(L,p,v) (  \ | ||||
| 	(iscollectable(v) && isblack(p) && iswhite(gcvalue(v))) ? \ | ||||
| 	luaC_barrierback_(L,p) : cast_void(0)) | ||||
|  | ||||
| #define luaC_objbarrier(L,p,o) (  \ | ||||
| 	(isblack(p) && iswhite(o)) ? \ | ||||
| 	luaC_barrier_(L,obj2gco(p),obj2gco(o)) : cast_void(0)) | ||||
|  | ||||
| #define luaC_upvalbarrier(L,uv) ( \ | ||||
| 	(iscollectable((uv)->v) && !upisopen(uv)) ? \ | ||||
|          luaC_upvalbarrier_(L,uv) : cast_void(0)) | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| 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 statesmask); | ||||
| 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 void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v); | ||||
| LUAI_FUNC void luaC_barrierback_ (lua_State *L, Table *o); | ||||
| LUAI_FUNC void luaC_upvalbarrier_ (lua_State *L, UpVal *uv); | ||||
| LUAI_FUNC void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt); | ||||
| LUAI_FUNC void luaC_upvdeccount (lua_State *L, UpVal *uv); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										68
									
								
								Plugins/slua_unreal/External/lua/linit.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										68
									
								
								Plugins/slua_unreal/External/lua/linit.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,68 @@ | ||||
| /* | ||||
| ** $Id: linit.c,v 1.39 2016/12/04 20:17:24 roberto Exp $ | ||||
| ** Initialization of libraries for lua.c and other clients | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
|  | ||||
| #define linit_c | ||||
| #define LUA_LIB | ||||
|  | ||||
| /* | ||||
| ** If you embed Lua in your program and need to open the standard | ||||
| ** libraries, call luaL_openlibs in your program. If you need a | ||||
| ** different set of libraries, copy this file to your project and edit | ||||
| ** it to suit your needs. | ||||
| ** | ||||
| ** You can also *preload* libraries, so that a later 'require' can | ||||
| ** open the library, which is already linked to the application. | ||||
| ** For that, do the following code: | ||||
| ** | ||||
| **  luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); | ||||
| **  lua_pushcfunction(L, luaopen_modname); | ||||
| **  lua_setfield(L, -2, modname); | ||||
| **  lua_pop(L, 1);  // remove PRELOAD table | ||||
| */ | ||||
|  | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <stddef.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lualib.h" | ||||
| #include "lauxlib.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* | ||||
| ** these libs are loaded by lua.c and are readily available to any Lua | ||||
| ** program | ||||
| */ | ||||
| static const luaL_Reg loadedlibs[] = { | ||||
|   {"_G", luaopen_base}, | ||||
|   {LUA_LOADLIBNAME, luaopen_package}, | ||||
|   {LUA_COLIBNAME, luaopen_coroutine}, | ||||
|   {LUA_TABLIBNAME, luaopen_table}, | ||||
|   {LUA_IOLIBNAME, luaopen_io}, | ||||
|   {LUA_OSLIBNAME, luaopen_os}, | ||||
|   {LUA_STRLIBNAME, luaopen_string}, | ||||
|   {LUA_MATHLIBNAME, luaopen_math}, | ||||
|   {LUA_UTF8LIBNAME, luaopen_utf8}, | ||||
|   {LUA_DBLIBNAME, luaopen_debug}, | ||||
| #if defined(LUA_COMPAT_BITLIB) | ||||
|   {LUA_BITLIBNAME, luaopen_bit32}, | ||||
| #endif | ||||
|   {NULL, NULL} | ||||
| }; | ||||
|  | ||||
|  | ||||
| LUALIB_API void luaL_openlibs (lua_State *L) { | ||||
|   const luaL_Reg *lib; | ||||
|   /* "require" functions from 'loadedlibs' and set results to global table */ | ||||
|   for (lib = loadedlibs; lib->func; lib++) { | ||||
|     luaL_requiref(L, lib->name, lib->func, 1); | ||||
|     lua_pop(L, 1);  /* remove lib */ | ||||
|   } | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										768
									
								
								Plugins/slua_unreal/External/lua/liolib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										768
									
								
								Plugins/slua_unreal/External/lua/liolib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,768 @@ | ||||
| /* | ||||
| ** $Id: liolib.c,v 2.151 2016/12/20 18:37:00 roberto Exp $ | ||||
| ** Standard I/O (and system) library | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define liolib_c | ||||
| #define LUA_LIB | ||||
|  | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <ctype.h> | ||||
| #include <errno.h> | ||||
| #include <locale.h> | ||||
| #include <stdio.h> | ||||
| #include <stdlib.h> | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
| #include "lualib.h" | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** {====================================================== | ||||
| ** l_fseek: configuration for longer offsets | ||||
| ** ======================================================= | ||||
| */ | ||||
|  | ||||
| #if !defined(l_fseek)		/* { */ | ||||
|  | ||||
| #if defined(LUA_USE_POSIX)	/* { */ | ||||
|  | ||||
| #include <sys/types.h> | ||||
|  | ||||
| #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				/* } */ | ||||
|  | ||||
| /* }====================================================== */ | ||||
|  | ||||
|  | ||||
| namespace NS_SLUA { | ||||
| /* | ||||
| ** 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 != '+' || (++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)) | ||||
|  | ||||
| #else				/* }{ */ | ||||
|  | ||||
| /* ISO C definitions */ | ||||
| #define l_popen(L,c,m)  \ | ||||
| 	  ((void)((void)c, m), \ | ||||
| 	  luaL_error(L, "'popen' not supported"), \ | ||||
| 	  (FILE*)0) | ||||
| #define l_pclose(L,file)		((void)L, (void)file, -1) | ||||
|  | ||||
| #endif				/* } */ | ||||
|  | ||||
| #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				/* } */ | ||||
|  | ||||
| #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) | ||||
|     lua_pushnil(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 (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_newuserdata(L, sizeof(LStream)); | ||||
|   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 io_close (lua_State *L) { | ||||
|   if (lua_isnone(L, 1))  /* no argument? */ | ||||
|     lua_getfield(L, LUA_REGISTRYINDEX, IO_OUTPUT);  /* use standard output */ | ||||
|   tofile(L);  /* make sure argument is an open stream */ | ||||
|   return aux_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 (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); | ||||
|   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); | ||||
|   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 (isclosed(p)) | ||||
|     luaL_error(L, "standard %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 | ||||
|  | ||||
| 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_pushinteger(L, n);  /* number of arguments to read */ | ||||
|   lua_pushboolean(L, toclose);  /* close/not close file when finished */ | ||||
|   lua_rotate(L, 2, 2);  /* move 'n' and 'toclose' 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; | ||||
| } | ||||
|  | ||||
|  | ||||
| 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); | ||||
|   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 (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 signal */ | ||||
|   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 signal */ | ||||
|     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 (lua_stringtonumber(L, rn.buff))  /* is this a valid number? */ | ||||
|     return 1;  /* ok */ | ||||
|   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 = '\0'; | ||||
|   luaL_buffinit(L, &b); | ||||
|   while (c != EOF && c != '\n') {  /* repeat until end of line */ | ||||
|     char *buff = luaL_prepbuffer(&b);  /* preallocate buffer */ | ||||
|     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; | ||||
|     l_unlockfile(f); | ||||
|     luaL_addsize(&b, i); | ||||
|   } | ||||
|   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 success; | ||||
|   int n; | ||||
|   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 */ | ||||
|     lua_pushnil(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); | ||||
| } | ||||
|  | ||||
|  | ||||
| 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 nil: 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); | ||||
|       lua_pushvalue(L, lua_upvalueindex(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 (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 (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 flib[] = { | ||||
|   {"close", io_close}, | ||||
|   {"flush", f_flush}, | ||||
|   {"lines", f_lines}, | ||||
|   {"read", f_read}, | ||||
|   {"seek", f_seek}, | ||||
|   {"setvbuf", f_setvbuf}, | ||||
|   {"write", f_write}, | ||||
|   {"__gc", f_gc}, | ||||
|   {"__tostring", f_tostring}, | ||||
|   {NULL, NULL} | ||||
| }; | ||||
|  | ||||
|  | ||||
| static void createmeta (lua_State *L) { | ||||
|   luaL_newmetatable(L, LUA_FILEHANDLE);  /* create metatable for file handles */ | ||||
|   lua_pushvalue(L, -1);  /* push metatable */ | ||||
|   lua_setfield(L, -2, "__index");  /* metatable.__index = metatable */ | ||||
|   luaL_setfuncs(L, flib, 0);  /* add file methods to new metatable */ | ||||
|   lua_pop(L, 1);  /* pop new 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 */ | ||||
|   lua_pushnil(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; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										563
									
								
								Plugins/slua_unreal/External/lua/llex.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										563
									
								
								Plugins/slua_unreal/External/lua/llex.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,563 @@ | ||||
| /* | ||||
| ** $Id: llex.c,v 2.96 2016/05/02 14:02:12 roberto Exp $ | ||||
| ** Lexical Analyzer | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define llex_c | ||||
| #define LUA_CORE | ||||
|  | ||||
| #include "llex.h" | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <locale.h> | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lctype.h" | ||||
| #include "ldebug.h" | ||||
| #include "ldo.h" | ||||
| #include "lgc.h" | ||||
| #include "lobject.h" | ||||
| #include "lparser.h" | ||||
| #include "lstate.h" | ||||
| #include "lstring.h" | ||||
| #include "ltable.h" | ||||
| #include "lzio.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| #define next_tk(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", | ||||
|     "//", "..", "...", "==", ">=", "<=", "~=", | ||||
|     "<<", ">>", "::", "<eof>", | ||||
|     "<number>", "<integer>", "<name>", "<string>" | ||||
| }; | ||||
|  | ||||
|  | ||||
| #define save_and_next(ls) (save(ls, ls->current), next_tk(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; i<NUM_RESERVED; i++) { | ||||
|     TString *ts = luaS_new(L, luaX_tokens[i]); | ||||
|     luaC_fix(L, obj2gco(ts));  /* reserved words are never collected */ | ||||
|     ts->extra = cast_byte(i+1);  /* reserved word */ | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| const char *luaX_token2str (LexState *ls, int token) { | ||||
|   if (token < FIRST_RESERVED) {  /* single-byte symbols? */ | ||||
|     lua_assert(token == cast_uchar(token)); | ||||
|     return luaO_pushfstring(ls->L, "'%c'", 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) | ||||
| */ | ||||
| TString *luaX_newstring (LexState *ls, const char *str, size_t l) { | ||||
|   lua_State *L = ls->L; | ||||
|   TValue *o;  /* entry for 'str' */ | ||||
|   TString *ts = luaS_newlstr(L, str, l);  /* create new string */ | ||||
|   setsvalue2s(L, L->top++, ts);  /* temporarily anchor it in stack */ | ||||
|   o = luaH_set(L, ls->h, L->top - 1); | ||||
|   if (ttisnil(o)) {  /* not in use yet? */ | ||||
|     /* boolean value does not need GC barrier; | ||||
|        table has no metatable, so it does not need to invalidate cache */ | ||||
|     setbvalue(o, 1);  /* t[string] = true */ | ||||
|     luaC_checkGC(L); | ||||
|   } | ||||
|   else {  /* string already present */ | ||||
|     ts = tsvalue(keyfromval(o));  /* re-use value previously stored */ | ||||
|   } | ||||
|   L->top--;  /* 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_tk(ls);  /* skip '\n' or '\r' */ | ||||
|   if (currIsNewline(ls) && ls->current != old) | ||||
|     next_tk(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_tk(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. | ||||
| */ | ||||
| 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 part? */ | ||||
|       check_next2(ls, "-+");  /* optional exponent sign */ | ||||
|     if (lisxdigit(ls->current)) | ||||
|       save_and_next(ls); | ||||
|     else if (ls->current == '.') | ||||
|       save_and_next(ls); | ||||
|     else break; | ||||
|   } | ||||
|   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; | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** skip a sequence '[=*[' or ']=*]'; if sequence is well formed, return | ||||
| ** its number of '='s; otherwise, return a negative number (-1 iff there | ||||
| ** are no '='s after initial bracket) | ||||
| */ | ||||
| static int skip_sep (LexState *ls) { | ||||
|   int 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 : (-count) - 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static void read_long_string (LexState *ls, SemInfo *seminfo, int 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_tk(ls); | ||||
|       } | ||||
|     } | ||||
|   } endloop: | ||||
|   if (seminfo) | ||||
|     seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + (2 + sep), | ||||
|                                      luaZ_bufflen(ls->buff) - 2*(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 ((save_and_next(ls), lisxdigit(ls->current))) { | ||||
|     i++; | ||||
|     r = (r << 4) + luaO_hexavalue(ls->current); | ||||
|     esccheck(ls, r <= 0x10FFFF, "UTF-8 value too large"); | ||||
|   } | ||||
|   esccheck(ls, ls->current == '}', "missing '}'"); | ||||
|   next_tk(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_tk(ls);  /* skip the 'z' */ | ||||
|             while (lisspace(ls->current)) { | ||||
|               if (currIsNewline(ls)) inclinenumber(ls); | ||||
|               else next_tk(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_tk(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_tk(ls); | ||||
|         break; | ||||
|       } | ||||
|       case '-': {  /* '-' or '--' (comment) */ | ||||
|         next_tk(ls); | ||||
|         if (ls->current != '-') return '-'; | ||||
|         /* else is a comment */ | ||||
|         next_tk(ls); | ||||
|         if (ls->current == '[') {  /* long comment? */ | ||||
|           int sep = skip_sep(ls); | ||||
|           luaZ_resetbuffer(ls->buff);  /* 'skip_sep' may dirty the buffer */ | ||||
|           if (sep >= 0) { | ||||
|             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_tk(ls);  /* skip until end of line (or end of file) */ | ||||
|         break; | ||||
|       } | ||||
|       case '[': {  /* long string or simply '[' */ | ||||
|         int sep = skip_sep(ls); | ||||
|         if (sep >= 0) { | ||||
|           read_long_string(ls, seminfo, sep); | ||||
|           return TK_STRING; | ||||
|         } | ||||
|         else if (sep != -1)  /* '[=...' missing second bracket */ | ||||
|           lexerror(ls, "invalid long string delimiter", TK_STRING); | ||||
|         return '['; | ||||
|       } | ||||
|       case '=': { | ||||
|         next_tk(ls); | ||||
|         if (check_next1(ls, '=')) return TK_EQ; | ||||
|         else return '='; | ||||
|       } | ||||
|       case '<': { | ||||
|         next_tk(ls); | ||||
|         if (check_next1(ls, '=')) return TK_LE; | ||||
|         else if (check_next1(ls, '<')) return TK_SHL; | ||||
|         else return '<'; | ||||
|       } | ||||
|       case '>': { | ||||
|         next_tk(ls); | ||||
|         if (check_next1(ls, '=')) return TK_GE; | ||||
|         else if (check_next1(ls, '>')) return TK_SHR; | ||||
|         else return '>'; | ||||
|       } | ||||
|       case '/': { | ||||
|         next_tk(ls); | ||||
|         if (check_next1(ls, '/')) return TK_IDIV; | ||||
|         else return '/'; | ||||
|       } | ||||
|       case '~': { | ||||
|         next_tk(ls); | ||||
|         if (check_next1(ls, '=')) return TK_NE; | ||||
|         else return '~'; | ||||
|       } | ||||
|       case ':': { | ||||
|         next_tk(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_tk(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; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										87
									
								
								Plugins/slua_unreal/External/lua/llex.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										87
									
								
								Plugins/slua_unreal/External/lua/llex.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,87 @@ | ||||
| /* | ||||
| ** $Id: llex.h,v 1.79 2016/05/02 14:02:12 roberto Exp $ | ||||
| ** Lexical Analyzer | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #ifndef llex_h | ||||
| #define llex_h | ||||
|  | ||||
| #include "lobject.h" | ||||
| #include "lzio.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| #define FIRST_RESERVED	257 | ||||
|  | ||||
|  | ||||
| #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); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										325
									
								
								Plugins/slua_unreal/External/lua/llimits.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										325
									
								
								Plugins/slua_unreal/External/lua/llimits.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,325 @@ | ||||
| /* | ||||
| ** $Id: llimits.h,v 1.141 2015/11/19 19:16:22 roberto Exp $ | ||||
| ** Limits, basic types, and some other 'installation-dependent' definitions | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #ifndef llimits_h | ||||
| #define llimits_h | ||||
|  | ||||
| #include <limits.h> | ||||
| #include <stddef.h> | ||||
|  | ||||
| #include "lua.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* | ||||
| ** 'lu_mem' and 'l_mem' are unsigned/signed integers big enough to count | ||||
| ** the total memory used by Lua (in bytes). 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_mem; | ||||
| #elif LUAI_BITSINT >= 32	/* }{ */ | ||||
| typedef size_t lu_mem; | ||||
| typedef ptrdiff_t l_mem; | ||||
| #else  /* 16-bit ints */	/* }{ */ | ||||
| typedef unsigned long lu_mem; | ||||
| typedef long l_mem; | ||||
| #endif				/* } */ | ||||
|  | ||||
|  | ||||
| /* chars used as small naturals (so that 'char' is reserved for characters) */ | ||||
| typedef unsigned char lu_byte; | ||||
|  | ||||
|  | ||||
| /* maximum value for size_t */ | ||||
| #define MAX_SIZET	((size_t)(~(size_t)0)) | ||||
|  | ||||
| /* maximum size visible for Lua (must be representable in a lua_Integer */ | ||||
| #define MAX_SIZE	(sizeof(size_t) < sizeof(lua_Integer) ? MAX_SIZET \ | ||||
|                           : (size_t)(LUA_MAXINTEGER)) | ||||
|  | ||||
|  | ||||
| #define MAX_LUMEM	((lu_mem)(~(lu_mem)0)) | ||||
|  | ||||
| #define MAX_LMEM	((l_mem)(MAX_LUMEM >> 1)) | ||||
|  | ||||
|  | ||||
| #define MAX_INT		INT_MAX  /* maximum value of an int */ | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** conversion of pointer to unsigned integer: | ||||
| ** this is for hashing only; there is no problem if the integer | ||||
| ** cannot hold the whole pointer value | ||||
| */ | ||||
| #define point2uint(p)	((unsigned int)((size_t)(p) & UINT_MAX)) | ||||
|  | ||||
|  | ||||
|  | ||||
| /* type to ensure maximum alignment */ | ||||
| #if defined(LUAI_USER_ALIGNMENT_T) | ||||
| typedef LUAI_USER_ALIGNMENT_T L_Umaxalign; | ||||
| #else | ||||
| typedef union { | ||||
|   lua_Number n; | ||||
|   double u; | ||||
|   void *s; | ||||
|   lua_Integer i; | ||||
|   long l; | ||||
| } L_Umaxalign; | ||||
| #endif | ||||
|  | ||||
|  | ||||
|  | ||||
| /* 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(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)	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_byte(i)	cast(lu_byte, (i)) | ||||
| #define cast_num(i)	cast(lua_Number, (i)) | ||||
| #define cast_int(i)	cast(int, (i)) | ||||
| #define cast_uchar(i)	cast(unsigned char, (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(__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 | ||||
|  | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** maximum depth for nested C calls and syntactical nested non-terminals | ||||
| ** in a program. (Value must fit in an unsigned short int.) | ||||
| */ | ||||
| #if !defined(LUAI_MAXCCALLS) | ||||
| #define LUAI_MAXCCALLS		200 | ||||
| #endif | ||||
|  | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** type for virtual-machine instructions; | ||||
| ** must be an unsigned with (at least) 4 bytes (see details in lopcodes.h) | ||||
| */ | ||||
| #if LUAI_BITSINT >= 32 | ||||
| typedef unsigned int Instruction; | ||||
| #else | ||||
| typedef unsigned long Instruction; | ||||
| #endif | ||||
|  | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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 | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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 on threads when you defined | ||||
| ** LUAI_EXTRASPACE and need to do something extra 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'; this definition gives NaN when | ||||
| ** 'b' is huge, but the result should be 'a'. '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, which is equivalent to the test below. | ||||
| */ | ||||
| #if !defined(luai_nummod) | ||||
| #define luai_nummod(L,a,b,m)  \ | ||||
|   { (m) = l_mathop(fmod)(a,b); if ((m)*(b) < 0) (m) += (b); } | ||||
| #endif | ||||
|  | ||||
| /* exponentiation */ | ||||
| #if !defined(luai_numpow) | ||||
| #define luai_numpow(L,a,b)      ((void)L, l_mathop(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_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_ = (L)->stacksize; pre; luaD_reallocstack((L), sz_); pos; } | ||||
| #endif | ||||
|  | ||||
| #if !defined(HARDMEMTESTS) | ||||
| #define condchangemem(L,pre,pos)	((void)0) | ||||
| #else | ||||
| #define condchangemem(L,pre,pos)  \ | ||||
| 	{ if (G(L)->gcrunning) { pre; luaC_fullgc(L, 0); pos; } } | ||||
| #endif | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										406
									
								
								Plugins/slua_unreal/External/lua/lmathlib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										406
									
								
								Plugins/slua_unreal/External/lua/lmathlib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,406 @@ | ||||
| /* | ||||
| ** $Id: lmathlib.c,v 1.119 2016/12/22 13:08:50 roberto Exp $ | ||||
| ** Standard mathematical library | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define lmathlib_c | ||||
| #define LUA_LIB | ||||
|  | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <stdlib.h> | ||||
| #include <math.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
| #include "lualib.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| #undef PI | ||||
| #define PI	(l_mathop(3.141592653589793238462643383279502884)) | ||||
|  | ||||
|  | ||||
| #if !defined(l_rand)		/* { */ | ||||
| #if defined(LUA_USE_POSIX) | ||||
| #define l_rand()	random() | ||||
| #define l_srand(x)	srandom(x) | ||||
| #define L_RANDMAX	2147483647	/* (2^31 - 1), following POSIX */ | ||||
| #else | ||||
| #define l_rand()	rand() | ||||
| #define l_srand(x)	srand(x) | ||||
| #define L_RANDMAX	RAND_MAX | ||||
| #endif | ||||
| #endif				/* } */ | ||||
|  | ||||
|  | ||||
| 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 (valid) | ||||
|     lua_pushinteger(L, n); | ||||
|   else { | ||||
|     luaL_checkany(L, 1); | ||||
|     lua_pushnil(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(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 (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; | ||||
| } | ||||
|  | ||||
| /* | ||||
| ** This function uses 'double' (instead of 'lua_Number') to ensure that | ||||
| ** all bits from 'l_rand' can be represented, and that 'RANDMAX + 1.0' | ||||
| ** will keep full precision (ensuring that 'r' is always less than 1.0.) | ||||
| */ | ||||
| static int math_random (lua_State *L) { | ||||
|   lua_Integer low, up; | ||||
|   double r = (double)l_rand() * (1.0 / ((double)L_RANDMAX + 1.0)); | ||||
|   switch (lua_gettop(L)) {  /* check number of arguments */ | ||||
|     case 0: {  /* no arguments */ | ||||
|       lua_pushnumber(L, (lua_Number)r);  /* Number between 0 and 1 */ | ||||
|       return 1; | ||||
|     } | ||||
|     case 1: {  /* only upper limit */ | ||||
|       low = 1; | ||||
|       up = luaL_checkinteger(L, 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"); | ||||
|   luaL_argcheck(L, low >= 0 || up <= LUA_MAXINTEGER + low, 1, | ||||
|                    "interval too large"); | ||||
|   r *= (double)(up - low) + 1.0; | ||||
|   lua_pushinteger(L, (lua_Integer)r + low); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int math_randomseed (lua_State *L) { | ||||
|   l_srand((unsigned int)(lua_Integer)luaL_checknumber(L, 1)); | ||||
|   (void)l_rand(); /* discard first value to avoid undesirable correlations */ | ||||
|   return 0; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int math_type (lua_State *L) { | ||||
|   if (lua_type(L, 1) == LUA_TNUMBER) { | ||||
|       if (lua_isinteger(L, 1)) | ||||
|         lua_pushliteral(L, "integer"); | ||||
|       else | ||||
|         lua_pushliteral(L, "float"); | ||||
|   } | ||||
|   else { | ||||
|     luaL_checkany(L, 1); | ||||
|     lua_pushnil(L); | ||||
|   } | ||||
|   return 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}, | ||||
|   {"random",     math_random}, | ||||
|   {"randomseed", math_randomseed}, | ||||
|   {"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 */ | ||||
|   {"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"); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										99
									
								
								Plugins/slua_unreal/External/lua/lmem.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										99
									
								
								Plugins/slua_unreal/External/lua/lmem.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,99 @@ | ||||
| /* | ||||
| ** $Id: lmem.c,v 1.91 2015/03/06 19:45:54 roberto Exp $ | ||||
| ** Interface to Memory Manager | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define lmem_c | ||||
| #define LUA_CORE | ||||
|  | ||||
| #include "lmem.h" | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <stddef.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "ldebug.h" | ||||
| #include "ldo.h" | ||||
| #include "lgc.h" | ||||
| #include "lobject.h" | ||||
| #include "lstate.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* | ||||
| ** 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, NULL, x, s) creates a new block of size 's' (no | ||||
| ** matter 'x'). | ||||
| ** | ||||
| ** * frealloc(ud, p, x, 0) frees the block 'p' | ||||
| ** (in this specific case, frealloc must return NULL); | ||||
| ** particularly, frealloc(ud, NULL, 0, 0) does nothing | ||||
| ** (which is equivalent to free(NULL) in ISO C) | ||||
| ** | ||||
| ** frealloc returns NULL if it cannot create or reallocate the area | ||||
| ** (any reallocation to an equal or smaller size cannot fail!) | ||||
| */ | ||||
|  | ||||
|  | ||||
|  | ||||
| #define MINSIZEARRAY	4 | ||||
|  | ||||
|  | ||||
| void *luaM_growaux_ (lua_State *L, void *block, int *size, size_t size_elems, | ||||
|                      int limit, const char *what) { | ||||
|   void *newblock; | ||||
|   int newsize; | ||||
|   if (*size >= limit/2) {  /* cannot double it? */ | ||||
|     if (*size >= limit)  /* cannot grow even a little? */ | ||||
|       luaG_runerror(L, "too many %s (limit is %d)", what, limit); | ||||
|     newsize = limit;  /* still have at least one free place */ | ||||
|   } | ||||
|   else { | ||||
|     newsize = (*size)*2; | ||||
|     if (newsize < MINSIZEARRAY) | ||||
|       newsize = MINSIZEARRAY;  /* minimum size */ | ||||
|   } | ||||
|   newblock = luaM_reallocv(L, block, *size, newsize, size_elems); | ||||
|   *size = newsize;  /* update only when everything else is OK */ | ||||
|   return newblock; | ||||
| } | ||||
|  | ||||
|  | ||||
| l_noret luaM_toobig (lua_State *L) { | ||||
|   luaG_runerror(L, "memory allocation error: block too big"); | ||||
| } | ||||
|  | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** generic allocation routine. | ||||
| */ | ||||
| void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) { | ||||
|   void *newblock; | ||||
|   global_State *g = G(L); | ||||
|   size_t realosize = (block) ? osize : 0; | ||||
|   lua_assert((realosize == 0) == (block == NULL)); | ||||
| #if defined(HARDMEMTESTS) | ||||
|   if (nsize > realosize && g->gcrunning) | ||||
|     luaC_fullgc(L, 1);  /* force a GC whenever possible */ | ||||
| #endif | ||||
|   newblock = (*g->frealloc)(g->ud, block, osize, nsize); | ||||
|   if (newblock == NULL && nsize > 0) { | ||||
|     lua_assert(nsize > realosize);  /* cannot fail when shrinking a block */ | ||||
|     if (g->version) {  /* is state fully built? */ | ||||
|       luaC_fullgc(L, 1);  /* try to free some memory... */ | ||||
|       newblock = (*g->frealloc)(g->ud, block, osize, nsize);  /* try again */ | ||||
|     } | ||||
|     if (newblock == NULL) | ||||
|       luaD_throw(L, LUA_ERRMEM); | ||||
|   } | ||||
|   lua_assert((nsize == 0) == (newblock == NULL)); | ||||
|   g->GCdebt = (g->GCdebt + nsize) - realosize; | ||||
|   return newblock; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										72
									
								
								Plugins/slua_unreal/External/lua/lmem.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										72
									
								
								Plugins/slua_unreal/External/lua/lmem.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,72 @@ | ||||
| /* | ||||
| ** $Id: lmem.h,v 1.43 2014/12/19 17:26:14 roberto Exp $ | ||||
| ** Interface to Memory Manager | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #ifndef lmem_h | ||||
| #define lmem_h | ||||
|  | ||||
|  | ||||
| #include <stddef.h> | ||||
|  | ||||
| #include "llimits.h" | ||||
| #include "lua.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* | ||||
| ** This macro reallocs a vector 'b' from 'on' to 'n' elements, where | ||||
| ** each element has size 'e'. In case of arithmetic overflow of the | ||||
| ** product 'n'*'e', it raises an error (calling 'luaM_toobig'). 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_reallocv(L,b,on,n,e) \ | ||||
|   (((sizeof(n) >= sizeof(size_t) && cast(size_t, (n)) + 1 > MAX_SIZET/(e)) \ | ||||
|       ? luaM_toobig(L) : cast_void(0)) , \ | ||||
|    luaM_realloc_(L, (b), (on)*(e), (n)*(e))) | ||||
|  | ||||
| /* | ||||
| ** Arrays of chars do not need any test | ||||
| */ | ||||
| #define luaM_reallocvchar(L,b,on,n)  \ | ||||
|     cast(char *, luaM_realloc_(L, (b), (on)*sizeof(char), (n)*sizeof(char))) | ||||
|  | ||||
| #define luaM_freemem(L, b, s)	luaM_realloc_(L, (b), (s), 0) | ||||
| #define luaM_free(L, b)		luaM_realloc_(L, (b), sizeof(*(b)), 0) | ||||
| #define luaM_freearray(L, b, n)   luaM_realloc_(L, (b), (n)*sizeof(*(b)), 0) | ||||
|  | ||||
| #define luaM_malloc(L,s)	luaM_realloc_(L, NULL, 0, (s)) | ||||
| #define luaM_new(L,t)		cast(t *, luaM_malloc(L, sizeof(t))) | ||||
| #define luaM_newvector(L,n,t) \ | ||||
| 		cast(t *, luaM_reallocv(L, NULL, 0, n, sizeof(t))) | ||||
|  | ||||
| #define luaM_newobject(L,tag,s)	luaM_realloc_(L, NULL, tag, (s)) | ||||
|  | ||||
| #define luaM_growvector(L,v,nelems,size,t,limit,e) \ | ||||
|           if ((nelems)+1 > (size)) \ | ||||
|             ((v)=cast(t *, luaM_growaux_(L,v,&(size),sizeof(t),limit,e))) | ||||
|  | ||||
| #define luaM_reallocvector(L, v,oldn,n,t) \ | ||||
|    ((v)=cast(t *, luaM_reallocv(L, v, oldn, n, 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_growaux_ (lua_State *L, void *block, int *size, | ||||
|                                size_t size_elem, int limit, | ||||
|                                const char *what); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
|  | ||||
							
								
								
									
										789
									
								
								Plugins/slua_unreal/External/lua/loadlib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										789
									
								
								Plugins/slua_unreal/External/lua/loadlib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,789 @@ | ||||
| /* | ||||
| ** $Id: loadlib.c,v 1.130 2017/01/12 17:14:26 roberto Exp $ | ||||
| ** 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 <stdio.h> | ||||
| #include <stdlib.h> | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
| #include "lualib.h" | ||||
|  | ||||
| #if defined(LUA_USE_DLOPEN) | ||||
| #include <dlfcn.h> | ||||
| #elif defined(LUA_DL_DLL) | ||||
| #include <windows.h> | ||||
| #endif | ||||
|  | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* | ||||
| ** LUA_IGMARK is a mark to ignore all before it when building the | ||||
| ** luaopen_ function name. | ||||
| */ | ||||
| #if !defined (LUA_IGMARK) | ||||
| #define LUA_IGMARK		"-" | ||||
| #endif | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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	"_" | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** unique key for table in the registry that keeps handles | ||||
| ** for all loaded C libraries | ||||
| */ | ||||
| static const int CLIBS = 0; | ||||
|  | ||||
| #define LIB_FAIL	"open" | ||||
|  | ||||
|  | ||||
| #define setprogdir(L)           ((void)0) | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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. | ||||
| ** ========================================================================= | ||||
| */ | ||||
|  | ||||
| /* | ||||
| ** 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 (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 (f == NULL) lua_pushstring(L, dlerror()); | ||||
|   return f; | ||||
| } | ||||
|  | ||||
| /* }====================================================== */ | ||||
|  | ||||
|  | ||||
|  | ||||
| #elif defined(LUA_DL_DLL)	/* }{ */ | ||||
| /* | ||||
| ** {====================================================================== | ||||
| ** This is an implementation of loadlib for Windows using native functions. | ||||
| ** ======================================================================= | ||||
| */ | ||||
|  | ||||
| /* | ||||
| ** 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)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 | ||||
|  | ||||
|  | ||||
| #define AUXMARK         "\1"	/* auxiliary mark */ | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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 | ||||
| */ | ||||
| static void setpath (lua_State *L, const char *fieldname, | ||||
|                                    const char *envname, | ||||
|                                    const char *dft) { | ||||
|   const char *nver = lua_pushfstring(L, "%s%s", envname, LUA_VERSUFFIX); | ||||
|   const char *path = getenv(nver);  /* use versioned name */ | ||||
|   if (path == NULL)  /* no environment variable? */ | ||||
|     path = getenv(envname);  /* try unversioned name */ | ||||
|   if (path == NULL || noenv(L))  /* no environment variable? */ | ||||
|     lua_pushstring(L, dft);  /* use default */ | ||||
|   else { | ||||
|     /* replace ";;" by ";AUXMARK;" and then AUXMARK by default path */ | ||||
|     path = luaL_gsub(L, path, LUA_PATH_SEP LUA_PATH_SEP, | ||||
|                               LUA_PATH_SEP AUXMARK LUA_PATH_SEP); | ||||
|     luaL_gsub(L, path, AUXMARK, dft); | ||||
|     lua_remove(L, -2); /* remove result from 1st 'gsub' */ | ||||
|   } | ||||
|   setprogdir(L); | ||||
|   lua_setfield(L, -3, fieldname);  /* package[fieldname] = path value */ | ||||
|   lua_pop(L, 1);  /* pop versioned variable name */ | ||||
| } | ||||
|  | ||||
| /* }================================================================== */ | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** return registry.CLIBS[path] | ||||
| */ | ||||
| static void *checkclib (lua_State *L, const char *path) { | ||||
|   void *plib; | ||||
|   lua_rawgetp(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_rawgetp(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 (stat == 0)  /* no errors? */ | ||||
|     return 1;  /* return the loaded function */ | ||||
|   else {  /* error; error message is on stack top */ | ||||
|     lua_pushnil(L); | ||||
|     lua_insert(L, -2); | ||||
|     lua_pushstring(L, (stat == ERRLIB) ?  LIB_FAIL : "init"); | ||||
|     return 3;  /* return nil, 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; | ||||
| } | ||||
|  | ||||
|  | ||||
| static const char *pushnexttemplate (lua_State *L, const char *path) { | ||||
|   const char *l; | ||||
|   while (*path == *LUA_PATH_SEP) path++;  /* skip separators */ | ||||
|   if (*path == '\0') return NULL;  /* no more templates */ | ||||
|   l = strchr(path, *LUA_PATH_SEP);  /* find next separator */ | ||||
|   if (l == NULL) l = path + strlen(path); | ||||
|   lua_pushlstring(L, path, l - path);  /* template */ | ||||
|   return l; | ||||
| } | ||||
|  | ||||
|  | ||||
| static const char *searchpath (lua_State *L, const char *name, | ||||
|                                              const char *path, | ||||
|                                              const char *sep, | ||||
|                                              const char *dirsep) { | ||||
|   luaL_Buffer msg;  /* to build error message */ | ||||
|   luaL_buffinit(L, &msg); | ||||
|   if (*sep != '\0')  /* non-empty separator? */ | ||||
|     name = luaL_gsub(L, name, sep, dirsep);  /* replace it by 'dirsep' */ | ||||
|   while ((path = pushnexttemplate(L, path)) != NULL) { | ||||
|     const char *filename = luaL_gsub(L, lua_tostring(L, -1), | ||||
|                                      LUA_PATH_MARK, name); | ||||
|     lua_remove(L, -2);  /* remove path template */ | ||||
|     if (readable(filename))  /* does file exist and is readable? */ | ||||
|       return filename;  /* return that file name */ | ||||
|     lua_pushfstring(L, "\n\tno file '%s'", filename); | ||||
|     lua_remove(L, -2);  /* remove file name */ | ||||
|     luaL_addvalue(&msg);  /* concatenate error msg. entry */ | ||||
|   } | ||||
|   luaL_pushresult(&msg);  /* 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 */ | ||||
|     lua_pushnil(L); | ||||
|     lua_insert(L, -2); | ||||
|     return 2;  /* return nil + 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 (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 (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, "\n\tno 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, "\n\tno field package.preload['%s']", name); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static void findloader (lua_State *L, const char *name) { | ||||
|   int i; | ||||
|   luaL_Buffer msg;  /* to build error message */ | ||||
|   luaL_buffinit(L, &msg); | ||||
|   /* push 'package.searchers' to index 3 in the stack */ | ||||
|   if (lua_getfield(L, lua_upvalueindex(1), "searchers") != LUA_TTABLE) | ||||
|     luaL_error(L, "'package.searchers' must be a table"); | ||||
|   /*  iterate over available searchers to find a loader */ | ||||
|   for (i = 1; ; i++) { | ||||
|     if (lua_rawgeti(L, 3, i) == LUA_TNIL) {  /* no more searchers? */ | ||||
|       lua_pop(L, 1);  /* remove nil */ | ||||
|       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 | ||||
|       lua_pop(L, 2);  /* remove both returns */ | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| 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_pushstring(L, name);  /* pass name as argument to module loader */ | ||||
|   lua_insert(L, -2);  /* name is 1st argument (before search data) */ | ||||
|   lua_call(L, 2, 1);  /* run loader to load module */ | ||||
|   if (!lua_isnil(L, -1))  /* non-nil return? */ | ||||
|     lua_setfield(L, 2, name);  /* LOADED[name] = returned value */ | ||||
|   if (lua_getfield(L, 2, name) == LUA_TNIL) {   /* module set no value? */ | ||||
|     lua_pushboolean(L, 1);  /* use true as result */ | ||||
|     lua_pushvalue(L, -1);  /* extra copy to be returned */ | ||||
|     lua_setfield(L, 2, name);  /* LOADED[name] = true */ | ||||
|   } | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
| /* }====================================================== */ | ||||
|  | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** {====================================================== | ||||
| ** 'module' function | ||||
| ** ======================================================= | ||||
| */ | ||||
| #if defined(LUA_COMPAT_MODULE) | ||||
|  | ||||
| /* | ||||
| ** changes the environment variable of calling function | ||||
| */ | ||||
| static void set_env (lua_State *L) { | ||||
|   lua_Debug ar; | ||||
|   if (lua_getstack(L, 1, &ar) == 0 || | ||||
|       lua_getinfo(L, "f", &ar) == 0 ||  /* get calling function */ | ||||
|       lua_iscfunction(L, -1)) | ||||
|     luaL_error(L, "'module' not called from a Lua function"); | ||||
|   lua_pushvalue(L, -2);  /* copy new environment table to top */ | ||||
|   lua_setupvalue(L, -2, 1); | ||||
|   lua_pop(L, 1);  /* remove function */ | ||||
| } | ||||
|  | ||||
|  | ||||
| static void dooptions (lua_State *L, int n) { | ||||
|   int i; | ||||
|   for (i = 2; i <= n; i++) { | ||||
|     if (lua_isfunction(L, i)) {  /* avoid 'calling' extra info. */ | ||||
|       lua_pushvalue(L, i);  /* get option (a function) */ | ||||
|       lua_pushvalue(L, -2);  /* module */ | ||||
|       lua_call(L, 1, 0); | ||||
|     } | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| static void modinit (lua_State *L, const char *modname) { | ||||
|   const char *dot; | ||||
|   lua_pushvalue(L, -1); | ||||
|   lua_setfield(L, -2, "_M");  /* module._M = module */ | ||||
|   lua_pushstring(L, modname); | ||||
|   lua_setfield(L, -2, "_NAME"); | ||||
|   dot = strrchr(modname, '.');  /* look for last dot in module name */ | ||||
|   if (dot == NULL) dot = modname; | ||||
|   else dot++; | ||||
|   /* set _PACKAGE as package name (full module name minus last part) */ | ||||
|   lua_pushlstring(L, modname, dot - modname); | ||||
|   lua_setfield(L, -2, "_PACKAGE"); | ||||
| } | ||||
|  | ||||
|  | ||||
| static int ll_module (lua_State *L) { | ||||
|   const char *modname = luaL_checkstring(L, 1); | ||||
|   int lastarg = lua_gettop(L);  /* last parameter */ | ||||
|   luaL_pushmodule(L, modname, 1);  /* get/create module table */ | ||||
|   /* check whether table already has a _NAME field */ | ||||
|   if (lua_getfield(L, -1, "_NAME") != LUA_TNIL) | ||||
|     lua_pop(L, 1);  /* table is an initialized module */ | ||||
|   else {  /* no; initialize it */ | ||||
|     lua_pop(L, 1); | ||||
|     modinit(L, modname); | ||||
|   } | ||||
|   lua_pushvalue(L, -1); | ||||
|   set_env(L); | ||||
|   dooptions(L, lastarg); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int ll_seeall (lua_State *L) { | ||||
|   luaL_checktype(L, 1, LUA_TTABLE); | ||||
|   if (!lua_getmetatable(L, 1)) { | ||||
|     lua_createtable(L, 0, 1); /* create new metatable */ | ||||
|     lua_pushvalue(L, -1); | ||||
|     lua_setmetatable(L, 1); | ||||
|   } | ||||
|   lua_pushglobaltable(L); | ||||
|   lua_setfield(L, -2, "__index");  /* mt.__index = _G */ | ||||
|   return 0; | ||||
| } | ||||
|  | ||||
| #endif | ||||
| /* }====================================================== */ | ||||
|  | ||||
|  | ||||
|  | ||||
| static const luaL_Reg pk_funcs[] = { | ||||
|   {"loadlib", ll_loadlib}, | ||||
|   {"searchpath", ll_searchpath}, | ||||
| #if defined(LUA_COMPAT_MODULE) | ||||
|   {"seeall", ll_seeall}, | ||||
| #endif | ||||
|   /* placeholders */ | ||||
|   {"preload", NULL}, | ||||
|   {"cpath", NULL}, | ||||
|   {"path", NULL}, | ||||
|   {"searchers", NULL}, | ||||
|   {"loaded", NULL}, | ||||
|   {NULL, NULL} | ||||
| }; | ||||
|  | ||||
|  | ||||
| static const luaL_Reg ll_funcs[] = { | ||||
| #if defined(LUA_COMPAT_MODULE) | ||||
|   {"module", ll_module}, | ||||
| #endif | ||||
|   {"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); | ||||
|   } | ||||
| #if defined(LUA_COMPAT_LOADERS) | ||||
|   lua_pushvalue(L, -1);  /* make a copy of 'searchers' table */ | ||||
|   lua_setfield(L, -3, "loaders");  /* put it in field 'loaders' */ | ||||
| #endif | ||||
|   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) { | ||||
|   lua_newtable(L);  /* 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); | ||||
|   lua_rawsetp(L, LUA_REGISTRYINDEX, &CLIBS);  /* set CLIBS table in registry */ | ||||
| } | ||||
|  | ||||
|  | ||||
| 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 */ | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										520
									
								
								Plugins/slua_unreal/External/lua/lobject.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										520
									
								
								Plugins/slua_unreal/External/lua/lobject.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,520 @@ | ||||
| /* | ||||
| ** $Id: lobject.c,v 2.113 2016/12/22 13:08:50 roberto Exp $ | ||||
| ** Some generic functions over Lua objects | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define lobject_c | ||||
| #define LUA_CORE | ||||
|  | ||||
| #include "lobject.h" | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <locale.h> | ||||
| #include <math.h> | ||||
| #include <stdarg.h> | ||||
| #include <stdio.h> | ||||
| #include <stdlib.h> | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lctype.h" | ||||
| #include "ldebug.h" | ||||
| #include "ldo.h" | ||||
| #include "lmem.h" | ||||
| #include "lstate.h" | ||||
| #include "lstring.h" | ||||
| #include "lvm.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| LUAI_DDEF const TValue luaO_nilobject_ = {NILCONSTANT}; | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** converts an integer to a "floating point byte", represented as | ||||
| ** (eeeeexxx), where the real value is (1xxx) * 2^(eeeee - 1) if | ||||
| ** eeeee != 0 and (xxx) otherwise. | ||||
| */ | ||||
| int luaO_int2fb (unsigned int x) { | ||||
|   int e = 0;  /* exponent */ | ||||
|   if (x < 8) return x; | ||||
|   while (x >= (8 << 4)) {  /* coarse steps */ | ||||
|     x = (x + 0xf) >> 4;  /* x = ceil(x / 16) */ | ||||
|     e += 4; | ||||
|   } | ||||
|   while (x >= (8 << 1)) {  /* fine steps */ | ||||
|     x = (x + 1) >> 1;  /* x = ceil(x / 2) */ | ||||
|     e++; | ||||
|   } | ||||
|   return ((e+1) << 3) | (cast_int(x) - 8); | ||||
| } | ||||
|  | ||||
|  | ||||
| /* converts back */ | ||||
| int luaO_fb2int (int x) { | ||||
|   return (x < 8) ? x : ((x & 7) + 8) << ((x >> 3) - 1); | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Computes ceil(log2(x)) | ||||
| */ | ||||
| int luaO_ceillog2 (unsigned int x) { | ||||
|   static const lu_byte log_2[256] = {  /* log_2[i] = ceil(log2(i - 1)) */ | ||||
|     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]; | ||||
| } | ||||
|  | ||||
|  | ||||
| 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_div(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_shiftl(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: { | ||||
|       lua_Number m; | ||||
|       luai_nummod(L, v1, v2, m); | ||||
|       return m; | ||||
|     } | ||||
|     default: lua_assert(0); return 0; | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| void luaO_arith (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 (tointeger(p1, &i1) && tointeger(p2, &i2)) { | ||||
|         setivalue(res, intarith(L, op, i1, i2)); | ||||
|         return; | ||||
|       } | ||||
|       else break;  /* go to the end */ | ||||
|     } | ||||
|     case LUA_OPDIV: case LUA_OPPOW: {  /* operate only on floats */ | ||||
|       lua_Number n1; lua_Number n2; | ||||
|       if (tonumber(p1, &n1) && tonumber(p2, &n2)) { | ||||
|         setfltvalue(res, numarith(L, op, n1, n2)); | ||||
|         return; | ||||
|       } | ||||
|       else break;  /* go to the end */ | ||||
|     } | ||||
|     default: {  /* other operations */ | ||||
|       lua_Number n1; lua_Number n2; | ||||
|       if (ttisinteger(p1) && ttisinteger(p2)) { | ||||
|         setivalue(res, intarith(L, op, ivalue(p1), ivalue(p2))); | ||||
|         return; | ||||
|       } | ||||
|       else if (tonumber(p1, &n1) && tonumber(p2, &n2)) { | ||||
|         setfltvalue(res, numarith(L, op, n1, n2)); | ||||
|         return; | ||||
|       } | ||||
|       else break;  /* go to the end */ | ||||
|     } | ||||
|   } | ||||
|   /* could not perform raw operation; try metamethod */ | ||||
|   lua_assert(L != NULL);  /* should not fail when folding (compile time) */ | ||||
|   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 an 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 = 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(char *, s);  /* nothing is valid yet */ | ||||
|   while (lisspace(cast_uchar(*s))) s++;  /* skip initial spaces */ | ||||
|   neg = isneg(&s);  /* check signal */ | ||||
|   if (!(*s == '0' && (*(s + 1) == 'x' || *(s + 1) == 'X')))  /* check '0x' */ | ||||
|     return 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 * cast_num(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 0.0;  /* invalid format */ | ||||
|   *endptr = cast(char *, 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 signal */ | ||||
|     s++;  /* skip 'p' */ | ||||
|     neg1 = isneg(&s);  /* signal */ | ||||
|     if (!lisdigit(cast_uchar(*s))) | ||||
|       return 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(char *, s);  /* valid up to here */ | ||||
|   } | ||||
|   if (neg) r = -r; | ||||
|   return l_mathop(ldexp)(r, e); | ||||
| } | ||||
|  | ||||
| #endif | ||||
| /* }====================================================== */ | ||||
|  | ||||
|  | ||||
| /* maximum length of a numeral */ | ||||
| #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)  /* 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 if no trailing characters */ | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Convert string 's' to a Lua number (put in 'result'). Return NULL | ||||
| ** on fail or the address of the ending '\0' on success. | ||||
| ** 'pmode' points to (and 'mode' contains) special things in the string: | ||||
| ** - 'x'/'X' means an hexadecimal numeral | ||||
| ** - 'n'/'N' means 'inf' or 'nan' (which should be rejected) | ||||
| ** - '.' just optimizes the search for the common case (nothing special) | ||||
| ** This function accepts both the current locale or a dot as the radix | ||||
| ** mark. If the convertion 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. | ||||
| */ | ||||
| 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')  /* 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 (strlen(s) > L_MAXLENNUM || pdot == NULL) | ||||
|       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 <= 0x10FFFF); | ||||
|   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 */ | ||||
| #define MAXNUMBER2STR	50 | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Convert a number object to a string | ||||
| */ | ||||
| void luaO_tostring (lua_State *L, StkId obj) { | ||||
|   char buff[MAXNUMBER2STR]; | ||||
|   size_t len; | ||||
|   lua_assert(ttisnumber(obj)); | ||||
|   if (ttisinteger(obj)) | ||||
|     len = lua_integer2str(buff, sizeof(buff), ivalue(obj)); | ||||
|   else { | ||||
|     len = lua_number2str(buff, sizeof(buff), fltvalue(obj)); | ||||
| #if !defined(LUA_COMPAT_FLOATSTRING) | ||||
|     if (buff[strspn(buff, "-0123456789")] == '\0') {  /* looks like an int? */ | ||||
|       buff[len++] = lua_getlocaledecpoint(); | ||||
|       buff[len++] = '0';  /* adds '.0' to result */ | ||||
|     } | ||||
| #endif | ||||
|   } | ||||
|   setsvalue2s(L, obj, luaS_newlstr(L, buff, len)); | ||||
| } | ||||
|  | ||||
|  | ||||
| static void pushstr (lua_State *L, const char *str, size_t l) { | ||||
|   setsvalue2s(L, L->top, luaS_newlstr(L, str, l)); | ||||
|   luaD_inctop(L); | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** this function handles only '%d', '%c', '%f', '%p', and '%s' | ||||
|    conventional formats, plus Lua-specific '%I' and '%U' | ||||
| */ | ||||
| const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) { | ||||
|   int n = 0; | ||||
|   for (;;) { | ||||
|     const char *e = strchr(fmt, '%'); | ||||
|     if (e == NULL) break; | ||||
|     pushstr(L, fmt, e - fmt); | ||||
|     switch (*(e+1)) { | ||||
|       case 's': {  /* zero-terminated string */ | ||||
|         const char *s = va_arg(argp, char *); | ||||
|         if (s == NULL) s = "(null)"; | ||||
|         pushstr(L, s, strlen(s)); | ||||
|         break; | ||||
|       } | ||||
|       case 'c': {  /* an 'int' as a character */ | ||||
|         char buff = cast(char, va_arg(argp, int)); | ||||
|         if (lisprint(cast_uchar(buff))) | ||||
|           pushstr(L, &buff, 1); | ||||
|         else  /* non-printable character; print its code */ | ||||
|           luaO_pushfstring(L, "<\\%d>", cast_uchar(buff)); | ||||
|         break; | ||||
|       } | ||||
|       case 'd': {  /* an 'int' */ | ||||
|         setivalue(L->top, va_arg(argp, int)); | ||||
|         goto top2str; | ||||
|       } | ||||
|       case 'I': {  /* a 'lua_Integer' */ | ||||
|         setivalue(L->top, cast(lua_Integer, va_arg(argp, l_uacInt))); | ||||
|         goto top2str; | ||||
|       } | ||||
|       case 'f': {  /* a 'lua_Number' */ | ||||
|         setfltvalue(L->top, cast_num(va_arg(argp, l_uacNumber))); | ||||
|       top2str:  /* convert the top element to a string */ | ||||
|         luaD_inctop(L); | ||||
|         luaO_tostring(L, L->top - 1); | ||||
|         break; | ||||
|       } | ||||
|       case 'p': {  /* a pointer */ | ||||
|         char buff[4*sizeof(void *) + 8]; /* should be enough space for a '%p' */ | ||||
|         int l = l_sprintf(buff, sizeof(buff), "%p", va_arg(argp, void *)); | ||||
|         pushstr(L, buff, l); | ||||
|         break; | ||||
|       } | ||||
|       case 'U': {  /* an 'int' as a UTF-8 sequence */ | ||||
|         char buff[UTF8BUFFSZ]; | ||||
|         int l = luaO_utf8esc(buff, cast(long, va_arg(argp, long))); | ||||
|         pushstr(L, buff + UTF8BUFFSZ - l, l); | ||||
|         break; | ||||
|       } | ||||
|       case '%': { | ||||
|         pushstr(L, "%", 1); | ||||
|         break; | ||||
|       } | ||||
|       default: { | ||||
|         luaG_runerror(L, "invalid option '%%%c' to 'lua_pushfstring'", | ||||
|                          *(e + 1)); | ||||
|       } | ||||
|     } | ||||
|     n += 2; | ||||
|     fmt = e+2; | ||||
|   } | ||||
|   luaD_checkstack(L, 1); | ||||
|   pushstr(L, fmt, strlen(fmt)); | ||||
|   if (n > 0) luaV_concat(L, n + 1); | ||||
|   return svalue(L->top - 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; | ||||
| } | ||||
|  | ||||
|  | ||||
| /* number of chars of a literal string without the ending \0 */ | ||||
| #define LL(x)	(sizeof(x)/sizeof(char) - 1) | ||||
|  | ||||
| #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 bufflen) { | ||||
|   size_t l = strlen(source); | ||||
|   if (*source == '=') {  /* 'literal' source */ | ||||
|     if (l <= bufflen)  /* small enough? */ | ||||
|       memcpy(out, source + 1, l * sizeof(char)); | ||||
|     else {  /* truncate it */ | ||||
|       addstr(out, source + 1, bufflen - 1); | ||||
|       *out = '\0'; | ||||
|     } | ||||
|   } | ||||
|   else if (*source == '@') {  /* file name */ | ||||
|     if (l <= bufflen)  /* small enough? */ | ||||
|       memcpy(out, source + 1, l * sizeof(char)); | ||||
|     else {  /* add '...' before rest of name */ | ||||
|       addstr(out, RETS, LL(RETS)); | ||||
|       bufflen -= LL(RETS); | ||||
|       memcpy(out, source + 1 + l - 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 (l < bufflen && nl == NULL) {  /* small one-line source? */ | ||||
|       addstr(out, source, l);  /* keep it */ | ||||
|     } | ||||
|     else { | ||||
|       if (nl != NULL) l = nl - source;  /* stop at first newline */ | ||||
|       if (l > bufflen) l = bufflen; | ||||
|       addstr(out, source, l); | ||||
|       addstr(out, RETS, LL(RETS)); | ||||
|     } | ||||
|     memcpy(out, POS, (LL(POS) + 1) * sizeof(char)); | ||||
|   } | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										549
									
								
								Plugins/slua_unreal/External/lua/lobject.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										549
									
								
								Plugins/slua_unreal/External/lua/lobject.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,549 @@ | ||||
| /* | ||||
| ** $Id: lobject.h,v 2.117 2016/08/01 19:51:24 roberto Exp $ | ||||
| ** Type definitions for Lua objects | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
|  | ||||
| #ifndef lobject_h | ||||
| #define lobject_h | ||||
|  | ||||
| #include <stdarg.h> | ||||
|  | ||||
| #include "llimits.h" | ||||
| #include "lua.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* | ||||
| ** Extra tags for non-values | ||||
| */ | ||||
| #define LUA_TPROTO	LUA_NUMTAGS		/* function prototypes */ | ||||
| #define LUA_TDEADKEY	(LUA_NUMTAGS+1)		/* removed keys in tables */ | ||||
|  | ||||
| /* | ||||
| ** number of all possible tags (including LUA_TNONE but excluding DEADKEY) | ||||
| */ | ||||
| #define LUA_TOTALTAGS	(LUA_TPROTO + 2) | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** tags for Tagged Values have the following use of bits: | ||||
| ** bits 0-3: actual tag (a LUA_T* value) | ||||
| ** bits 4-5: variant bits | ||||
| ** bit 6: whether value is collectable | ||||
| */ | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** LUA_TFUNCTION variants: | ||||
| ** 0 - Lua function | ||||
| ** 1 - light C function | ||||
| ** 2 - regular C function (closure) | ||||
| */ | ||||
|  | ||||
| /* Variant tags for functions */ | ||||
| #define LUA_TLCL	(LUA_TFUNCTION | (0 << 4))  /* Lua closure */ | ||||
| #define LUA_TLCF	(LUA_TFUNCTION | (1 << 4))  /* light C function */ | ||||
| #define LUA_TCCL	(LUA_TFUNCTION | (2 << 4))  /* C closure */ | ||||
|  | ||||
|  | ||||
| /* Variant tags for strings */ | ||||
| #define LUA_TSHRSTR	(LUA_TSTRING | (0 << 4))  /* short strings */ | ||||
| #define LUA_TLNGSTR	(LUA_TSTRING | (1 << 4))  /* long strings */ | ||||
|  | ||||
|  | ||||
| /* Variant tags for numbers */ | ||||
| #define LUA_TNUMFLT	(LUA_TNUMBER | (0 << 4))  /* float numbers */ | ||||
| #define LUA_TNUMINT	(LUA_TNUMBER | (1 << 4))  /* integer numbers */ | ||||
|  | ||||
|  | ||||
| /* Bit mark for collectable types */ | ||||
| #define BIT_ISCOLLECTABLE	(1 << 6) | ||||
|  | ||||
| /* mark a tag as collectable */ | ||||
| #define ctb(t)			((t) | BIT_ISCOLLECTABLE) | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Common type for all collectable objects | ||||
| */ | ||||
| typedef struct GCObject GCObject; | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Common Header for all collectable objects (in macro form, to be | ||||
| ** included in other objects) | ||||
| */ | ||||
| #define CommonHeader	GCObject *next; lu_byte tt; lu_byte marked | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Common type has only the common header | ||||
| */ | ||||
| struct GCObject { | ||||
|   CommonHeader; | ||||
| }; | ||||
|  | ||||
|  | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Tagged Values. This is the basic representation of values in Lua, | ||||
| ** an actual value plus a tag with its type. | ||||
| */ | ||||
|  | ||||
| /* | ||||
| ** Union of all Lua values | ||||
| */ | ||||
| typedef union Value { | ||||
|   GCObject *gc;    /* collectable objects */ | ||||
|   void *p;         /* light userdata */ | ||||
|   int b;           /* booleans */ | ||||
|   lua_CFunction f; /* light C functions */ | ||||
|   lua_Integer i;   /* integer numbers */ | ||||
|   lua_Number n;    /* float numbers */ | ||||
| } Value; | ||||
|  | ||||
|  | ||||
| #define TValuefields	Value value_; int tt_ | ||||
|  | ||||
|  | ||||
| typedef struct lua_TValue { | ||||
|   TValuefields; | ||||
| } TValue; | ||||
|  | ||||
|  | ||||
|  | ||||
| /* macro defining a nil value */ | ||||
| #define NILCONSTANT	{NULL}, LUA_TNIL | ||||
|  | ||||
|  | ||||
| #define val_(o)		((o)->value_) | ||||
|  | ||||
|  | ||||
| /* raw type tag of a TValue */ | ||||
| #define rttype(o)	((o)->tt_) | ||||
|  | ||||
| /* tag with no variants (bits 0-3) */ | ||||
| #define novariant(x)	((x) & 0x0F) | ||||
|  | ||||
| /* type tag of a TValue (bits 0-3 for tags + variant bits 4-5) */ | ||||
| #define ttype(o)	(rttype(o) & 0x3F) | ||||
|  | ||||
| /* type tag of a TValue with no variants (bits 0-3) */ | ||||
| #define ttnov(o)	(novariant(rttype(o))) | ||||
|  | ||||
|  | ||||
| /* Macros to test type */ | ||||
| #define checktag(o,t)		(rttype(o) == (t)) | ||||
| #define checktype(o,t)		(ttnov(o) == (t)) | ||||
| #define ttisnumber(o)		checktype((o), LUA_TNUMBER) | ||||
| #define ttisfloat(o)		checktag((o), LUA_TNUMFLT) | ||||
| #define ttisinteger(o)		checktag((o), LUA_TNUMINT) | ||||
| #define ttisnil(o)		checktag((o), LUA_TNIL) | ||||
| #define ttisboolean(o)		checktag((o), LUA_TBOOLEAN) | ||||
| #define ttislightuserdata(o)	checktag((o), LUA_TLIGHTUSERDATA) | ||||
| #define ttisstring(o)		checktype((o), LUA_TSTRING) | ||||
| #define ttisshrstring(o)	checktag((o), ctb(LUA_TSHRSTR)) | ||||
| #define ttislngstring(o)	checktag((o), ctb(LUA_TLNGSTR)) | ||||
| #define ttistable(o)		checktag((o), ctb(LUA_TTABLE)) | ||||
| #define ttisfunction(o)		checktype(o, LUA_TFUNCTION) | ||||
| #define ttisclosure(o)		((rttype(o) & 0x1F) == LUA_TFUNCTION) | ||||
| #define ttisCclosure(o)		checktag((o), ctb(LUA_TCCL)) | ||||
| #define ttisLclosure(o)		checktag((o), ctb(LUA_TLCL)) | ||||
| #define ttislcf(o)		checktag((o), LUA_TLCF) | ||||
| #define ttisfulluserdata(o)	checktag((o), ctb(LUA_TUSERDATA)) | ||||
| #define ttisthread(o)		checktag((o), ctb(LUA_TTHREAD)) | ||||
| #define ttisdeadkey(o)		checktag((o), LUA_TDEADKEY) | ||||
|  | ||||
|  | ||||
| /* Macros to access values */ | ||||
| #define ivalue(o)	check_exp(ttisinteger(o), val_(o).i) | ||||
| #define fltvalue(o)	check_exp(ttisfloat(o), val_(o).n) | ||||
| #define nvalue(o)	check_exp(ttisnumber(o), \ | ||||
| 	(ttisinteger(o) ? cast_num(ivalue(o)) : fltvalue(o))) | ||||
| #define gcvalue(o)	check_exp(iscollectable(o), val_(o).gc) | ||||
| #define pvalue(o)	check_exp(ttislightuserdata(o), val_(o).p) | ||||
| #define tsvalue(o)	check_exp(ttisstring(o), gco2ts(val_(o).gc)) | ||||
| #define uvalue(o)	check_exp(ttisfulluserdata(o), gco2u(val_(o).gc)) | ||||
| #define clvalue(o)	check_exp(ttisclosure(o), gco2cl(val_(o).gc)) | ||||
| #define clLvalue(o)	check_exp(ttisLclosure(o), gco2lcl(val_(o).gc)) | ||||
| #define clCvalue(o)	check_exp(ttisCclosure(o), gco2ccl(val_(o).gc)) | ||||
| #define fvalue(o)	check_exp(ttislcf(o), val_(o).f) | ||||
| #define hvalue(o)	check_exp(ttistable(o), gco2t(val_(o).gc)) | ||||
| #define bvalue(o)	check_exp(ttisboolean(o), val_(o).b) | ||||
| #define thvalue(o)	check_exp(ttisthread(o), gco2th(val_(o).gc)) | ||||
| /* a dead value may get the 'gc' field, but cannot access its contents */ | ||||
| #define deadvalue(o)	check_exp(ttisdeadkey(o), cast(void *, val_(o).gc)) | ||||
|  | ||||
| #define l_isfalse(o)	(ttisnil(o) || (ttisboolean(o) && bvalue(o) == 0)) | ||||
|  | ||||
|  | ||||
| #define iscollectable(o)	(rttype(o) & BIT_ISCOLLECTABLE) | ||||
|  | ||||
|  | ||||
| /* Macros for internal tests */ | ||||
| #define righttt(obj)		(ttype(obj) == gcvalue(obj)->tt) | ||||
|  | ||||
| #define checkliveness(L,obj) \ | ||||
| 	lua_longassert(!iscollectable(obj) || \ | ||||
| 		(righttt(obj) && (L == NULL || !isdead(G(L),gcvalue(obj))))) | ||||
|  | ||||
|  | ||||
| /* Macros to set values */ | ||||
| #define settt_(o,t)	((o)->tt_=(t)) | ||||
|  | ||||
| #define setfltvalue(obj,x) \ | ||||
|   { TValue *io=(obj); val_(io).n=(x); settt_(io, LUA_TNUMFLT); } | ||||
|  | ||||
| #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_TNUMINT); } | ||||
|  | ||||
| #define chgivalue(obj,x) \ | ||||
|   { TValue *io=(obj); lua_assert(ttisinteger(io)); val_(io).i=(x); } | ||||
|  | ||||
| #define setnilvalue(obj) settt_(obj, LUA_TNIL) | ||||
|  | ||||
| #define setfvalue(obj,x) \ | ||||
|   { TValue *io=(obj); val_(io).f=(x); settt_(io, LUA_TLCF); } | ||||
|  | ||||
| #define setpvalue(obj,x) \ | ||||
|   { TValue *io=(obj); val_(io).p=(x); settt_(io, LUA_TLIGHTUSERDATA); } | ||||
|  | ||||
| #define setbvalue(obj,x) \ | ||||
|   { TValue *io=(obj); val_(io).b=(x); settt_(io, LUA_TBOOLEAN); } | ||||
|  | ||||
| #define setgcovalue(L,obj,x) \ | ||||
|   { TValue *io = (obj); GCObject *i_g=(x); \ | ||||
|     val_(io).gc = i_g; settt_(io, ctb(i_g->tt)); } | ||||
|  | ||||
| #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 setuvalue(L,obj,x) \ | ||||
|   { TValue *io = (obj); Udata *x_ = (x); \ | ||||
|     val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_TUSERDATA)); \ | ||||
|     checkliveness(L,io); } | ||||
|  | ||||
| #define setthvalue(L,obj,x) \ | ||||
|   { TValue *io = (obj); lua_State *x_ = (x); \ | ||||
|     val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_TTHREAD)); \ | ||||
|     checkliveness(L,io); } | ||||
|  | ||||
| #define setclLvalue(L,obj,x) \ | ||||
|   { TValue *io = (obj); LClosure *x_ = (x); \ | ||||
|     val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_TLCL)); \ | ||||
|     checkliveness(L,io); } | ||||
|  | ||||
| #define setclCvalue(L,obj,x) \ | ||||
|   { TValue *io = (obj); CClosure *x_ = (x); \ | ||||
|     val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_TCCL)); \ | ||||
|     checkliveness(L,io); } | ||||
|  | ||||
| #define sethvalue(L,obj,x) \ | ||||
|   { TValue *io = (obj); Table *x_ = (x); \ | ||||
|     val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_TTABLE)); \ | ||||
|     checkliveness(L,io); } | ||||
|  | ||||
| #define setdeadvalue(obj)	settt_(obj, LUA_TDEADKEY) | ||||
|  | ||||
|  | ||||
|  | ||||
| #define setobj(L,obj1,obj2) \ | ||||
| 	{ TValue *io1=(obj1); *io1 = *(obj2); \ | ||||
| 	  (void)L; checkliveness(L,io1); } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** different types of assignments, according to destination | ||||
| */ | ||||
|  | ||||
| /* from stack to (same) stack */ | ||||
| #define setobjs2s	setobj | ||||
| /* to stack (not from same stack) */ | ||||
| #define setobj2s	setobj | ||||
| #define setsvalue2s	setsvalue | ||||
| #define sethvalue2s	sethvalue | ||||
| #define setptvalue2s	setptvalue | ||||
| /* from table to same table */ | ||||
| #define setobjt2t	setobj | ||||
| /* to new object */ | ||||
| #define setobj2n	setobj | ||||
| #define setsvalue2n	setsvalue | ||||
|  | ||||
| /* to table (define it as an expression to be used in macros) */ | ||||
| #define setobj2t(L,o1,o2)  ((void)L, *(o1)=*(o2), checkliveness(L,(o1))) | ||||
|  | ||||
|  | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** {====================================================== | ||||
| ** types and prototypes | ||||
| ** ======================================================= | ||||
| */ | ||||
|  | ||||
|  | ||||
| typedef TValue *StkId;  /* index to stack elements */ | ||||
|  | ||||
|  | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Header for string value; string bytes follow the end of this structure | ||||
| ** (aligned according to 'UTString'; see next). | ||||
| */ | ||||
| typedef struct TString { | ||||
|   CommonHeader; | ||||
|   lu_byte extra;  /* reserved words for short strings; "has hash" for longs */ | ||||
|   lu_byte shrlen;  /* length for short strings */ | ||||
|   unsigned int hash; | ||||
|   union { | ||||
|     size_t lnglen;  /* length for long strings */ | ||||
|     struct TString *hnext;  /* linked list for hash table */ | ||||
|   } u; | ||||
| } TString; | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Ensures that address after this type is always fully aligned. | ||||
| */ | ||||
| typedef union UTString { | ||||
|   L_Umaxalign dummy;  /* ensures maximum alignment for strings */ | ||||
|   TString tsv; | ||||
| } UTString; | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Get the actual string (array of bytes) from a 'TString'. | ||||
| ** (Access to 'extra' ensures that value is really a 'TString'.) | ||||
| */ | ||||
| #define getstr(ts)  \ | ||||
|   check_exp(sizeof((ts)->extra), cast(char *, (ts)) + sizeof(UTString)) | ||||
|  | ||||
|  | ||||
| /* get the actual string (array of bytes) from a Lua value */ | ||||
| #define svalue(o)       getstr(tsvalue(o)) | ||||
|  | ||||
| /* get string length from 'TString *s' */ | ||||
| #define tsslen(s)	((s)->tt == LUA_TSHRSTR ? (s)->shrlen : (s)->u.lnglen) | ||||
|  | ||||
| /* get string length from 'TValue *o' */ | ||||
| #define vslen(o)	tsslen(tsvalue(o)) | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Header for userdata; memory area follows the end of this structure | ||||
| ** (aligned according to 'UUdata'; see next). | ||||
| */ | ||||
| typedef struct Udata { | ||||
|   CommonHeader; | ||||
|   lu_byte ttuv_;  /* user value's tag */ | ||||
|   struct Table *metatable; | ||||
|   size_t len;  /* number of bytes */ | ||||
|   union Value user_;  /* user value */ | ||||
| } Udata; | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Ensures that address after this type is always fully aligned. | ||||
| */ | ||||
| typedef union UUdata { | ||||
|   L_Umaxalign dummy;  /* ensures maximum alignment for 'local' udata */ | ||||
|   Udata uv; | ||||
| } UUdata; | ||||
|  | ||||
|  | ||||
| /* | ||||
| **  Get the address of memory block inside 'Udata'. | ||||
| ** (Access to 'ttuv_' ensures that value is really a 'Udata'.) | ||||
| */ | ||||
| #define getudatamem(u)  \ | ||||
|   check_exp(sizeof((u)->ttuv_), (cast(char*, (u)) + sizeof(UUdata))) | ||||
|  | ||||
| #define setuservalue(L,u,o) \ | ||||
| 	{ const TValue *io=(o); Udata *iu = (u); \ | ||||
| 	  iu->user_ = io->value_; iu->ttuv_ = rttype(io); \ | ||||
| 	  checkliveness(L,io); } | ||||
|  | ||||
|  | ||||
| #define getuservalue(L,u,o) \ | ||||
| 	{ TValue *io=(o); const Udata *iu = (u); \ | ||||
| 	  io->value_ = iu->user_; settt_(io, iu->ttuv_); \ | ||||
| 	  checkliveness(L,io); } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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) */ | ||||
| } 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; | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Function Prototypes | ||||
| */ | ||||
| typedef struct Proto { | ||||
|   CommonHeader; | ||||
|   lu_byte numparams;  /* number of fixed parameters */ | ||||
|   lu_byte is_vararg; | ||||
|   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 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 */ | ||||
|   int *lineinfo;  /* map from opcodes to source lines (debug information) */ | ||||
|   LocVar *locvars;  /* information about local variables (debug information) */ | ||||
|   Upvaldesc *upvalues;  /* upvalue information */ | ||||
|   struct LClosure *cache;  /* last-created closure with this prototype */ | ||||
|   TString  *source;  /* used for debug information */ | ||||
|   GCObject *gclist; | ||||
| } Proto; | ||||
|  | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Lua Upvalues | ||||
| */ | ||||
| typedef struct UpVal UpVal; | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Closures | ||||
| */ | ||||
|  | ||||
| #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 isLfunction(o)	ttisLclosure(o) | ||||
|  | ||||
| #define getproto(o)	(clLvalue(o)->p) | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Tables | ||||
| */ | ||||
|  | ||||
| typedef union TKey { | ||||
|   struct { | ||||
|     TValuefields; | ||||
|     int next;  /* for chaining (offset for next node) */ | ||||
|   } nk; | ||||
|   TValue tvk; | ||||
| } TKey; | ||||
|  | ||||
|  | ||||
| /* copy a value into a key without messing up field 'next' */ | ||||
| #define setnodekey(L,key,obj) \ | ||||
| 	{ TKey *k_=(key); const TValue *io_=(obj); \ | ||||
| 	  k_->nk.value_ = io_->value_; k_->nk.tt_ = io_->tt_; \ | ||||
| 	  (void)L; checkliveness(L,io_); } | ||||
|  | ||||
|  | ||||
| typedef struct Node { | ||||
|   TValue i_val; | ||||
|   TKey i_key; | ||||
| } Node; | ||||
|  | ||||
|  | ||||
| typedef struct Table { | ||||
|   CommonHeader; | ||||
|   lu_byte flags;  /* 1<<p means tagmethod(p) is not present */ | ||||
|   lu_byte lsizenode;  /* log2 of size of 'node' array */ | ||||
|   unsigned int sizearray;  /* size of 'array' array */ | ||||
|   TValue *array;  /* array part */ | ||||
|   Node *node; | ||||
|   Node *lastfree;  /* any free position is before this position */ | ||||
|   struct Table *metatable; | ||||
|   GCObject *gclist; | ||||
| } Table; | ||||
|  | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** '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)	(1LL<<(x)) | ||||
| #define sizenode(t)	(twoto((t)->lsizenode)) | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** (address of) a fixed nil value | ||||
| */ | ||||
| #define luaO_nilobject		(&luaO_nilobject_) | ||||
|  | ||||
|  | ||||
| LUAI_DDEC const TValue luaO_nilobject_; | ||||
|  | ||||
| /* size of buffer for 'luaO_utf8esc' function */ | ||||
| #define UTF8BUFFSZ	8 | ||||
|  | ||||
| LUAI_FUNC int luaO_int2fb (unsigned int x); | ||||
| LUAI_FUNC int luaO_fb2int (int x); | ||||
| LUAI_FUNC int luaO_utf8esc (char *buff, unsigned long x); | ||||
| LUAI_FUNC int luaO_ceillog2 (unsigned int x); | ||||
| LUAI_FUNC void luaO_arith (lua_State *L, int op, const TValue *p1, | ||||
|                            const TValue *p2, TValue *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, StkId 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 len); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
|  | ||||
							
								
								
									
										71
									
								
								Plugins/slua_unreal/External/lua/lopcodes.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										71
									
								
								Plugins/slua_unreal/External/lua/lopcodes.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,71 @@ | ||||
| /* | ||||
| ** $Id: lopcodes.c,v 1.55 2015/01/05 13:48:33 roberto Exp $ | ||||
| ** Opcodes for Lua virtual machine | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define lopcodes_c | ||||
| #define LUA_CORE | ||||
|  | ||||
| #include "lopcodes.h" | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <stddef.h> | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* ORDER OP */ | ||||
| #define opmode(t,a,b,c,m) (((t)<<7) | ((a)<<6) | ((b)<<4) | ((c)<<2) | (m)) | ||||
|  | ||||
| LUAI_DDEF const lu_byte luaP_opmodes[NUM_OPCODES] = { | ||||
| /*       T  A    B       C     mode		   opcode	*/ | ||||
|   opmode(0, 1, OpArgR, OpArgN, iABC)		/* OP_MOVE */ | ||||
|  ,opmode(0, 1, OpArgR, OpArgK, iABC)		/* OP_SELF */ | ||||
|  ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_ADD */ | ||||
|  ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_SUB */ | ||||
|  ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_MUL */ | ||||
|  ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_MOD */ | ||||
|  ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_POW */ | ||||
|  ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_DIV */ | ||||
|  ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_IDIV */ | ||||
|  ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_BAND */ | ||||
|  ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_BOR */ | ||||
|  ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_BXOR */ | ||||
|  ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_SHL */ | ||||
|  ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_SHR */ | ||||
|  ,opmode(0, 1, OpArgR, OpArgN, iABC)		/* OP_UNM */ | ||||
|  ,opmode(0, 1, OpArgR, OpArgN, iABC)		/* OP_BNOT */ | ||||
|  ,opmode(0, 1, OpArgR, OpArgN, iABC)		/* OP_NOT */ | ||||
|  ,opmode(0, 1, OpArgR, OpArgN, iABC)		/* OP_LEN */ | ||||
|  ,opmode(0, 1, OpArgR, OpArgR, iABC)		/* OP_CONCAT */ | ||||
|  ,opmode(0, 0, OpArgR, OpArgN, iAsBx)		/* OP_JMP */ | ||||
|  ,opmode(1, 0, OpArgK, OpArgK, iABC)		/* OP_EQ */ | ||||
|  ,opmode(1, 0, OpArgK, OpArgK, iABC)		/* OP_LT */ | ||||
|  ,opmode(1, 0, OpArgK, OpArgK, iABC)		/* OP_LE */ | ||||
|  ,opmode(1, 0, OpArgN, OpArgU, iABC)		/* OP_TEST */ | ||||
|  ,opmode(1, 1, OpArgR, OpArgU, iABC)		/* OP_TESTSET */ | ||||
|  ,opmode(0, 1, OpArgU, OpArgU, iABC)		/* OP_CALL */ | ||||
|  ,opmode(0, 1, OpArgU, OpArgU, iABC)		/* OP_TAILCALL */ | ||||
|  ,opmode(0, 0, OpArgU, OpArgN, iABC)		/* OP_RETURN */ | ||||
|  ,opmode(0, 1, OpArgR, OpArgN, iAsBx)		/* OP_FORLOOP */ | ||||
|  ,opmode(0, 1, OpArgR, OpArgN, iAsBx)		/* OP_FORPREP */ | ||||
|  ,opmode(0, 0, OpArgN, OpArgU, iABC)		/* OP_TFORCALL */ | ||||
|  ,opmode(0, 1, OpArgR, OpArgN, iAsBx)		/* OP_TFORLOOP */ | ||||
|  ,opmode(0, 0, OpArgU, OpArgU, iABC)		/* OP_SETLIST */ | ||||
|  ,opmode(0, 1, OpArgU, OpArgN, iABx)		/* OP_CLOSURE */ | ||||
|  ,opmode(0, 1, OpArgU, OpArgN, iABC)		/* OP_VARARG */ | ||||
|  ,opmode(0, 1, OpArgK, OpArgN, iABx)		/* OP_LOADK */ | ||||
|  ,opmode(0, 1, OpArgN, OpArgN, iABx)		/* OP_LOADKX */ | ||||
|  ,opmode(0, 1, OpArgU, OpArgU, iABC)		/* OP_LOADBOOL */ | ||||
|  ,opmode(0, 1, OpArgU, OpArgN, iABC)		/* OP_LOADNIL */ | ||||
|  ,opmode(0, 1, OpArgU, OpArgN, iABC)		/* OP_GETUPVAL */ | ||||
|  ,opmode(0, 1, OpArgU, OpArgK, iABC)		/* OP_GETTABUP */ | ||||
|  ,opmode(0, 1, OpArgR, OpArgK, iABC)		/* OP_GETTABLE */ | ||||
|  ,opmode(0, 0, OpArgK, OpArgK, iABC)		/* OP_SETTABUP */ | ||||
|  ,opmode(0, 0, OpArgU, OpArgN, iABC)		/* OP_SETUPVAL */ | ||||
|  ,opmode(0, 0, OpArgK, OpArgK, iABC)		/* OP_SETTABLE */ | ||||
|  ,opmode(0, 1, OpArgU, OpArgU, iABC)		/* OP_NEWTABLE */ | ||||
|  ,opmode(0, 0, OpArgU, OpArgU, iAx)		/* OP_EXTRAARG */ | ||||
| }; | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										295
									
								
								Plugins/slua_unreal/External/lua/lopcodes.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										295
									
								
								Plugins/slua_unreal/External/lua/lopcodes.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,295 @@ | ||||
| /* | ||||
| ** $Id: lopcodes.h,v 1.149 2016/07/19 17:12:21 roberto Exp $ | ||||
| ** Opcodes for Lua virtual machine | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #ifndef lopcodes_h | ||||
| #define lopcodes_h | ||||
|  | ||||
| #include "llimits.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /*=========================================================================== | ||||
|   We assume that instructions are unsigned numbers. | ||||
|   All instructions have an opcode in the first 6 bits. | ||||
|   Instructions can have the following fields: | ||||
| 	'A' : 8 bits | ||||
| 	'B' : 9 bits | ||||
| 	'C' : 9 bits | ||||
| 	'Ax' : 26 bits ('A', 'B', and 'C' together) | ||||
| 	'Bx' : 18 bits ('B' and 'C' together) | ||||
| 	'sBx' : signed Bx | ||||
|  | ||||
|   A signed argument is represented in excess K; that is, the number | ||||
|   value is the unsigned value minus K. K is exactly the maximum value | ||||
|   for that argument (so that -max is represented by 0, and +max is | ||||
|   represented by 2*max), which is half the maximum for the corresponding | ||||
|   unsigned argument. | ||||
| ===========================================================================*/ | ||||
|  | ||||
|  | ||||
| enum OpMode {iABC, iABx, iAsBx, iAx};  /* basic instruction format */ | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** size and position of opcode arguments. | ||||
| */ | ||||
| #define SIZE_C		9 | ||||
| #define SIZE_B		9 | ||||
| #define SIZE_Bx		(SIZE_C + SIZE_B) | ||||
| #define SIZE_A		8 | ||||
| #define SIZE_Ax		(SIZE_C + SIZE_B + SIZE_A) | ||||
|  | ||||
| #define SIZE_OP		6 | ||||
|  | ||||
| #define POS_OP		0 | ||||
| #define POS_A		(POS_OP + SIZE_OP) | ||||
| #define POS_C		(POS_A + SIZE_A) | ||||
| #define POS_B		(POS_C + SIZE_C) | ||||
| #define POS_Bx		POS_C | ||||
| #define POS_Ax		POS_A | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** limits for opcode arguments. | ||||
| ** we use (signed) int to manipulate most arguments, | ||||
| ** so they must fit in LUAI_BITSINT-1 bits (-1 for sign) | ||||
| */ | ||||
| #if SIZE_Bx < LUAI_BITSINT-1 | ||||
| #define MAXARG_Bx        ((1<<SIZE_Bx)-1) | ||||
| #define MAXARG_sBx        (MAXARG_Bx>>1)         /* 'sBx' is signed */ | ||||
| #else | ||||
| #define MAXARG_Bx        MAX_INT | ||||
| #define MAXARG_sBx        MAX_INT | ||||
| #endif | ||||
|  | ||||
| #if SIZE_Ax < LUAI_BITSINT-1 | ||||
| #define MAXARG_Ax	((1<<SIZE_Ax)-1) | ||||
| #else | ||||
| #define MAXARG_Ax	MAX_INT | ||||
| #endif | ||||
|  | ||||
|  | ||||
| #define MAXARG_A        ((1<<SIZE_A)-1) | ||||
| #define MAXARG_B        ((1<<SIZE_B)-1) | ||||
| #define MAXARG_C        ((1<<SIZE_C)-1) | ||||
|  | ||||
|  | ||||
| /* 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_OP)&MASK1(SIZE_OP,POS_OP)))) | ||||
|  | ||||
| #define getarg(i,pos,size)	(cast(int, ((i)>>pos) & MASK1(size,0))) | ||||
| #define setarg(i,v,pos,size)	((i) = (((i)&MASK0(size,pos)) | \ | ||||
|                 ((cast(Instruction, v)<<pos)&MASK1(size,pos)))) | ||||
|  | ||||
| #define GETARG_A(i)	getarg(i, POS_A, SIZE_A) | ||||
| #define SETARG_A(i,v)	setarg(i, v, POS_A, SIZE_A) | ||||
|  | ||||
| #define GETARG_B(i)	getarg(i, POS_B, SIZE_B) | ||||
| #define SETARG_B(i,v)	setarg(i, v, POS_B, SIZE_B) | ||||
|  | ||||
| #define GETARG_C(i)	getarg(i, POS_C, SIZE_C) | ||||
| #define SETARG_C(i,v)	setarg(i, v, POS_C, SIZE_C) | ||||
|  | ||||
| #define GETARG_Bx(i)	getarg(i, POS_Bx, SIZE_Bx) | ||||
| #define SETARG_Bx(i,v)	setarg(i, v, POS_Bx, SIZE_Bx) | ||||
|  | ||||
| #define GETARG_Ax(i)	getarg(i, POS_Ax, SIZE_Ax) | ||||
| #define SETARG_Ax(i,v)	setarg(i, v, POS_Ax, SIZE_Ax) | ||||
|  | ||||
| #define GETARG_sBx(i)	(GETARG_Bx(i)-MAXARG_sBx) | ||||
| #define SETARG_sBx(i,b)	SETARG_Bx((i),cast(unsigned int, (b)+MAXARG_sBx)) | ||||
|  | ||||
|  | ||||
| #define CREATE_ABC(o,a,b,c)	((cast(Instruction, o)<<POS_OP) \ | ||||
| 			| (cast(Instruction, a)<<POS_A) \ | ||||
| 			| (cast(Instruction, b)<<POS_B) \ | ||||
| 			| (cast(Instruction, c)<<POS_C)) | ||||
|  | ||||
| #define CREATE_ABx(o,a,bc)	((cast(Instruction, o)<<POS_OP) \ | ||||
| 			| (cast(Instruction, a)<<POS_A) \ | ||||
| 			| (cast(Instruction, bc)<<POS_Bx)) | ||||
|  | ||||
| #define CREATE_Ax(o,a)		((cast(Instruction, o)<<POS_OP) \ | ||||
| 			| (cast(Instruction, a)<<POS_Ax)) | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Macros to operate RK indices | ||||
| */ | ||||
|  | ||||
| /* this bit 1 means constant (0 means register) */ | ||||
| #define BITRK		(1 << (SIZE_B - 1)) | ||||
|  | ||||
| /* test whether value is a constant */ | ||||
| #define ISK(x)		((x) & BITRK) | ||||
|  | ||||
| /* gets the index of the constant */ | ||||
| #define INDEXK(r)	((int)(r) & ~BITRK) | ||||
|  | ||||
| #if !defined(MAXINDEXRK)  /* (for debugging only) */ | ||||
| #define MAXINDEXRK	(BITRK - 1) | ||||
| #endif | ||||
|  | ||||
| /* code a constant index as a RK value */ | ||||
| #define RKASK(x)	((x) | BITRK) | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** invalid register that fits in 8 bits | ||||
| */ | ||||
| #define NO_REG		MAXARG_A | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** R(x) - register | ||||
| ** Kst(x) - constant (in constant table) | ||||
| ** RK(x) == if ISK(x) then Kst(INDEXK(x)) else R(x) | ||||
| */ | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** grep "ORDER OP" if you change these enums | ||||
| */ | ||||
|  | ||||
| typedef enum { | ||||
| /*---------------------------------------------------------------------- | ||||
| name		args	description | ||||
| ------------------------------------------------------------------------*/ | ||||
| OP_MOVE,/*	A B	R(A) := R(B)					*/ | ||||
|  | ||||
| OP_SELF,/*	A B C	R(A+1) := R(B); R(A) := R(B)[RK(C)]		*/ | ||||
|  | ||||
| OP_ADD,/*	A B C	R(A) := RK(B) + RK(C)				*/ | ||||
| OP_SUB,/*	A B C	R(A) := RK(B) - RK(C)				*/ | ||||
| OP_MUL,/*	A B C	R(A) := RK(B) * RK(C)				*/ | ||||
| OP_MOD,/*	A B C	R(A) := RK(B) % RK(C)				*/ | ||||
| OP_POW,/*	A B C	R(A) := RK(B) ^ RK(C)				*/ | ||||
| OP_DIV,/*	A B C	R(A) := RK(B) / RK(C)				*/ | ||||
| OP_IDIV,/*	A B C	R(A) := RK(B) // RK(C)				*/ | ||||
| OP_BAND,/*	A B C	R(A) := RK(B) & RK(C)				*/ | ||||
| OP_BOR,/*	A B C	R(A) := RK(B) | RK(C)				*/ | ||||
| OP_BXOR,/*	A B C	R(A) := RK(B) ~ RK(C)				*/ | ||||
| OP_SHL,/*	A B C	R(A) := RK(B) << RK(C)				*/ | ||||
| OP_SHR,/*	A B C	R(A) := RK(B) >> RK(C)				*/ | ||||
| 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) := length of R(B)				*/ | ||||
|  | ||||
| OP_CONCAT,/*	A B C	R(A) := R(B).. ... ..R(C)			*/ | ||||
|  | ||||
| OP_JMP,/*	A sBx	pc+=sBx; if (A) close all upvalues >= R(A - 1)	*/ | ||||
| OP_EQ,/*	A B C	if ((RK(B) == RK(C)) ~= A) then pc++		*/ | ||||
| OP_LT,/*	A B C	if ((RK(B) <  RK(C)) ~= A) then pc++		*/ | ||||
| OP_LE,/*	A B C	if ((RK(B) <= RK(C)) ~= A) then pc++		*/ | ||||
|  | ||||
| OP_TEST,/*	A C	if not (R(A) <=> C) then pc++			*/ | ||||
| OP_TESTSET,/*	A B C	if (R(B) <=> C) then R(A) := R(B) else pc++	*/ | ||||
|  | ||||
| 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	return R(A)(R(A+1), ... ,R(A+B-1))		*/ | ||||
| OP_RETURN,/*	A B	return R(A), ... ,R(A+B-2)	(see note)	*/ | ||||
|  | ||||
| OP_FORLOOP,/*	A sBx	R(A)+=R(A+2); | ||||
| 			if R(A) <?= R(A+1) then { pc+=sBx; R(A+3)=R(A) }*/ | ||||
| OP_FORPREP,/*	A sBx	R(A)-=R(A+2); pc+=sBx				*/ | ||||
|  | ||||
| OP_TFORCALL,/*	A C	R(A+3), ... ,R(A+2+C) := R(A)(R(A+1), R(A+2));	*/ | ||||
| OP_TFORLOOP,/*	A sBx	if R(A+1) ~= nil then { R(A)=R(A+1); pc += sBx }*/ | ||||
|  | ||||
| OP_SETLIST,/*	A B C	R(A)[(C-1)*FPF+i] := R(A+i), 1 <= i <= B	*/ | ||||
|  | ||||
| OP_CLOSURE,/*	A Bx	R(A) := closure(KPROTO[Bx])			*/ | ||||
|  | ||||
| OP_VARARG,/*	A B	R(A), R(A+1), ..., R(A+B-2) = vararg		*/ | ||||
| OP_LOADK,/*	A Bx	R(A) := Kst(Bx)					*/ | ||||
| OP_LOADKX,/*	A 	R(A) := Kst(extra arg)				*/ | ||||
| OP_LOADBOOL,/*	A B C	R(A) := (Bool)B; if (C) pc++			*/ | ||||
| OP_LOADNIL,/*	A B	R(A), R(A+1), ..., R(A+B) := nil		*/ | ||||
| OP_GETUPVAL,/*	A B	R(A) := UpValue[B]				*/ | ||||
|  | ||||
| OP_GETTABUP,/*	A B C	R(A) := UpValue[B][RK(C)]			*/ | ||||
| OP_GETTABLE,/*	A B C	R(A) := R(B)[RK(C)]				*/ | ||||
|  | ||||
| OP_SETTABUP,/*	A B C	UpValue[A][RK(B)] := RK(C)			*/ | ||||
| OP_SETUPVAL,/*	A B	UpValue[B] := R(A)				*/ | ||||
| OP_SETTABLE,/*	A B C	R(A)[RK(B)] := RK(C)				*/ | ||||
|  | ||||
| OP_NEWTABLE,/*	A B C	R(A) := {} (size = B,C)				*/ | ||||
|  | ||||
| OP_EXTRAARG/*	Ax	extra (larger) argument for previous opcode	*/ | ||||
| } OpCode; | ||||
|  | ||||
|  | ||||
| #define NUM_OPCODES	(cast(int, OP_EXTRAARG) + 1) | ||||
|  | ||||
|  | ||||
|  | ||||
| /*=========================================================================== | ||||
|   Notes: | ||||
|   (*) In OP_CALL, if (B == 0) then B = top. 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 (B == 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_SETLIST, if (B == 0) then B = 'top'; if (C == 0) then next | ||||
|   'instruction' is EXTRAARG(real C). | ||||
|  | ||||
|   (*) In OP_LOADKX, the next 'instruction' is always EXTRAARG. | ||||
|  | ||||
|   (*) For comparisons, A specifies what condition the test should accept | ||||
|   (true or false). | ||||
|  | ||||
|   (*) All 'skips' (pc++) assume that next instruction is a jump. | ||||
|  | ||||
| ===========================================================================*/ | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** masks for instruction properties. The format is: | ||||
| ** bits 0-1: op mode | ||||
| ** bits 2-3: C arg mode | ||||
| ** bits 4-5: B arg mode | ||||
| ** bit 6: instruction set register A | ||||
| ** bit 7: operator is a test (next instruction must be a jump) | ||||
| */ | ||||
|  | ||||
| enum OpArgMask { | ||||
|   OpArgN,  /* argument is not used */ | ||||
|   OpArgU,  /* argument is used */ | ||||
|   OpArgR,  /* argument is a register or a jump offset */ | ||||
|   OpArgK   /* argument is a constant or register/constant */ | ||||
| }; | ||||
|  | ||||
| LUAI_DDEC const lu_byte luaP_opmodes[NUM_OPCODES]; | ||||
|  | ||||
| #define getOpMode(m)	(cast(enum OpMode, luaP_opmodes[m] & 3)) | ||||
| #define getBMode(m)	(cast(enum OpArgMask, (luaP_opmodes[m] >> 4) & 3)) | ||||
| #define getCMode(m)	(cast(enum OpArgMask, (luaP_opmodes[m] >> 2) & 3)) | ||||
| #define testAMode(m)	(luaP_opmodes[m] & (1 << 6)) | ||||
| #define testTMode(m)	(luaP_opmodes[m] & (1 << 7)) | ||||
|  | ||||
| /* number of list items to accumulate before a SETLIST instruction */ | ||||
| #define LFIELDS_PER_FLUSH	50 | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										408
									
								
								Plugins/slua_unreal/External/lua/loslib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										408
									
								
								Plugins/slua_unreal/External/lua/loslib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,408 @@ | ||||
| /* | ||||
| ** $Id: loslib.c,v 1.65 2016/07/18 17:58:58 roberto Exp $ | ||||
| ** Standard Operating System library | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define loslib_c | ||||
| #define LUA_LIB | ||||
|  | ||||
| #include "lprefix.h" | ||||
|  | ||||
|  | ||||
| #include <errno.h> | ||||
| #include <locale.h> | ||||
| #include <stdlib.h> | ||||
| #include <string.h> | ||||
| #include <time.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
| #include "lualib.h" | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** {================================================================== | ||||
| ** 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 <unistd.h> | ||||
|  | ||||
| #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				/* } */ | ||||
| /* }================================================================== */ | ||||
|  | ||||
| /* | ||||
| ** {================================================================== | ||||
| ** List of valid conversion specifiers for the 'strftime' function; | ||||
| ** options are grouped by length; group of length 2 start with '||'. | ||||
| ** =================================================================== | ||||
| */ | ||||
| #if !defined(LUA_STRFTIMEOPTIONS)	/* { */ | ||||
|  | ||||
| /* options for ANSI C 89 (only 1-char options) */ | ||||
| #define L_STRFTIMEC89		"aAbBcdHIjmMpSUwWxXyYZ%" | ||||
|  | ||||
| /* options for ISO C 99 and POSIX */ | ||||
| #define L_STRFTIMEC99 "aAbBcCdDeFgGhHIjmMnprRStTuUVwWxXyYzZ%" \ | ||||
|     "||" "EcECExEXEyEY" "OdOeOHOIOmOMOSOuOUOVOwOWOy"  /* two-char options */ | ||||
|  | ||||
| /* options for Windows */ | ||||
| #define L_STRFTIMEWIN "aAbBcdHIjmMpSUwWxXyYzZ%" \ | ||||
|     "||" "#c#x#d#H#I#j#m#M#S#U#w#W#y#Y"  /* two-char options */ | ||||
|  | ||||
| #if defined(LUA_USE_WINDOWS) | ||||
| #define LUA_STRFTIMEOPTIONS	L_STRFTIMEWIN | ||||
| #elif defined(LUA_USE_C89) | ||||
| #define LUA_STRFTIMEOPTIONS	L_STRFTIMEC89 | ||||
| #else  /* C99 specification */ | ||||
| #define LUA_STRFTIMEOPTIONS	L_STRFTIMEC99 | ||||
| #endif | ||||
|  | ||||
| #endif					/* } */ | ||||
| /* }================================================================== */ | ||||
|  | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** {================================================================== | ||||
| ** Configuration for time-related stuff | ||||
| ** =================================================================== | ||||
| */ | ||||
|  | ||||
| #if !defined(l_time_t)		/* { */ | ||||
| /* | ||||
| ** type to represent time_t in Lua | ||||
| */ | ||||
| #define l_timet			lua_Integer | ||||
| #define l_pushtime(L,t)		lua_pushinteger(L,(lua_Integer)(t)) | ||||
|  | ||||
| static time_t l_checktime (lua_State *L, int arg) { | ||||
|   lua_Integer t = luaL_checkinteger(L, arg); | ||||
|   luaL_argcheck(L, (time_t)t == t, arg, "time out-of-bounds"); | ||||
|   return (time_t)t; | ||||
| } | ||||
|  | ||||
| #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				/* } */ | ||||
|  | ||||
| /* }================================================================== */ | ||||
|  | ||||
| static int os_execute (lua_State *L) { | ||||
|   // const char *cmd = luaL_optstring(L, 1, NULL); | ||||
|   // int stat = system(cmd); | ||||
|   // if (cmd != NULL) | ||||
|   //   return luaL_execresult(L, stat); | ||||
|   // else { | ||||
|   //   lua_pushboolean(L, stat);  /* true if there is a shell */ | ||||
|   //   return 1; | ||||
|   // } | ||||
|   return 0; | ||||
| } | ||||
|  | ||||
|  | ||||
| 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 (err) | ||||
|   //   return luaL_error(L, "unable to generate a unique filename"); | ||||
|   // lua_pushstring(L, buff); | ||||
|   // return 1; | ||||
|   return 0; | ||||
| } | ||||
|  | ||||
|  | ||||
| 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=? } | ||||
| ** ======================================================= | ||||
| */ | ||||
|  | ||||
| static void setfield (lua_State *L, const char *key, int value) { | ||||
|   lua_pushinteger(L, value); | ||||
|   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, "sec", stm->tm_sec); | ||||
|   setfield(L, "min", stm->tm_min); | ||||
|   setfield(L, "hour", stm->tm_hour); | ||||
|   setfield(L, "day", stm->tm_mday); | ||||
|   setfield(L, "month", stm->tm_mon + 1); | ||||
|   setfield(L, "year", stm->tm_year + 1900); | ||||
|   setfield(L, "wday", stm->tm_wday + 1); | ||||
|   setfield(L, "yday", stm->tm_yday + 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; | ||||
| } | ||||
|  | ||||
|  | ||||
| /* maximum value for date fields (to avoid arithmetic overflows with 'int') */ | ||||
| #if !defined(L_MAXDATEFIELD) | ||||
| #define L_MAXDATEFIELD	(INT_MAX / 2) | ||||
| #endif | ||||
|  | ||||
| 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 (t != LUA_TNIL)  /* some other value? */ | ||||
|       return luaL_error(L, "field '%s' is not an integer", key); | ||||
|     else if (d < 0)  /* absent field; no default? */ | ||||
|       return luaL_error(L, "field '%s' missing in date table", key); | ||||
|     res = d; | ||||
|   } | ||||
|   else { | ||||
|     if (!(-L_MAXDATEFIELD <= res && res <= L_MAXDATEFIELD)) | ||||
|       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 */ | ||||
| } | ||||
|  | ||||
|  | ||||
| /* 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? */ | ||||
|     luaL_error(L, "time 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_sec = getfield(L, "sec", 0, 0); | ||||
|     ts.tm_min = getfield(L, "min", 0, 0); | ||||
|     ts.tm_hour = getfield(L, "hour", 12, 0); | ||||
|     ts.tm_mday = getfield(L, "day", -1, 0); | ||||
|     ts.tm_mon = getfield(L, "month", -1, 1); | ||||
|     ts.tm_year = getfield(L, "year", -1, 1900); | ||||
|     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)) | ||||
|     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; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										1649
									
								
								Plugins/slua_unreal/External/lua/lparser.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										1649
									
								
								Plugins/slua_unreal/External/lua/lparser.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
										
											
												File diff suppressed because it is too large
												Load Diff
											
										
									
								
							
							
								
								
									
										135
									
								
								Plugins/slua_unreal/External/lua/lparser.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										135
									
								
								Plugins/slua_unreal/External/lua/lparser.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,135 @@ | ||||
| /* | ||||
| ** $Id: lparser.h,v 1.76 2015/12/30 18:16:13 roberto Exp $ | ||||
| ** Lua Parser | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #ifndef lparser_h | ||||
| #define lparser_h | ||||
|  | ||||
| #include "llimits.h" | ||||
| #include "lobject.h" | ||||
| #include "lzio.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* | ||||
| ** 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 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; nval = numerical integer value */ | ||||
|   VNONRELOC,  /* expression has its value in a fixed register; | ||||
|                  info = result register */ | ||||
|   VLOCAL,  /* local variable; info = local register */ | ||||
|   VUPVAL,  /* upvalue variable; info = index of upvalue in 'upvalues' */ | ||||
|   VINDEXED,  /* indexed variable; | ||||
|                 ind.vt = whether 't' is register or upvalue; | ||||
|                 ind.t = table register or upvalue; | ||||
|                 ind.idx = key's R/K index */ | ||||
|   VJMP,  /* expression is a test/comparison; | ||||
|             info = pc of corresponding jump instruction */ | ||||
|   VRELOCABLE,  /* 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) <= VINDEXED) | ||||
| #define vkisinreg(k)	((k) == VNONRELOC || (k) == VLOCAL) | ||||
|  | ||||
| typedef struct expdesc { | ||||
|   expkind k; | ||||
|   union { | ||||
|     lua_Integer ival;    /* for VKINT */ | ||||
|     lua_Number nval;  /* for VKFLT */ | ||||
|     int info;  /* for generic use */ | ||||
|     struct {  /* for indexed variables (VINDEXED) */ | ||||
|       short idx;  /* index (R/K) */ | ||||
|       lu_byte t;  /* table (register or upvalue) */ | ||||
|       lu_byte vt;  /* whether 't' is register (VLOCAL) or upvalue (VUPVAL) */ | ||||
|     } ind; | ||||
|   } u; | ||||
|   int t;  /* patch list of 'exit when true' */ | ||||
|   int f;  /* patch list of 'exit when false' */ | ||||
| } expdesc; | ||||
|  | ||||
|  | ||||
| /* description of active local variable */ | ||||
| typedef struct Vardesc { | ||||
|   short idx;  /* variable index in stack */ | ||||
| } 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;  /* local level where it appears in current block */ | ||||
| } 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 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 jpc;  /* list of pending jumps to 'pc' */ | ||||
|   int nk;  /* number of elements in 'k' */ | ||||
|   int np;  /* number of elements in 'p' */ | ||||
|   int firstlocal;  /* index of first local var (in Dyndata array) */ | ||||
|   short nlocvars;  /* 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 */ | ||||
| } FuncState; | ||||
|  | ||||
|  | ||||
| LUAI_FUNC LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, | ||||
|                                  Dyndata *dyd, const char *name, int firstchar); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										45
									
								
								Plugins/slua_unreal/External/lua/lprefix.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										45
									
								
								Plugins/slua_unreal/External/lua/lprefix.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,45 @@ | ||||
| /* | ||||
| ** $Id: lprefix.h,v 1.2 2014/12/29 16:54:13 roberto Exp $ | ||||
| ** 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 | ||||
|  | ||||
							
								
								
									
										349
									
								
								Plugins/slua_unreal/External/lua/lstate.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										349
									
								
								Plugins/slua_unreal/External/lua/lstate.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,349 @@ | ||||
| /* | ||||
| ** $Id: lstate.c,v 2.133 2015/11/13 12:16:51 roberto Exp $ | ||||
| ** Global State | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define lstate_c | ||||
| #define LUA_CORE | ||||
|  | ||||
| #include "lstate.h" | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <stddef.h> | ||||
| #include <string.h> | ||||
|  | ||||
| #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 "lstring.h" | ||||
| #include "ltable.h" | ||||
| #include "ltm.h" | ||||
|  | ||||
| #if !defined(LUAI_GCPAUSE) | ||||
| #define LUAI_GCPAUSE	200  /* 200% */ | ||||
| #endif | ||||
|  | ||||
| #if !defined(LUAI_GCMUL) | ||||
| #define LUAI_GCMUL	200 /* GC runs 'twice the speed' of memory allocation */ | ||||
| #endif | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** a macro to help the creation of a unique random seed when a state is | ||||
| ** created; the seed is used to randomize hashes. | ||||
| */ | ||||
| #if !defined(luai_makeseed) | ||||
| #include <time.h> | ||||
| #define luai_makeseed()		cast(unsigned int, time(NULL)) | ||||
| #endif | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* | ||||
| ** 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))) | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Compute an initial seed as random as possible. Rely on Address Space | ||||
| ** Layout Randomization (if present) to increase randomness.. | ||||
| */ | ||||
| #define addbuff(b,p,e) \ | ||||
|   { size_t t = cast(size_t, e); \ | ||||
|     memcpy(b + p, &t, sizeof(t)); p += sizeof(t); } | ||||
|  | ||||
| static unsigned int makeseed (lua_State *L) { | ||||
|   char buff[4 * sizeof(size_t)]; | ||||
|   unsigned int h = luai_makeseed(); | ||||
|   int p = 0; | ||||
|   addbuff(buff, p, L);  /* heap variable */ | ||||
|   addbuff(buff, p, &h);  /* local variable */ | ||||
|   addbuff(buff, p, luaO_nilobject);  /* global variable */ | ||||
|   addbuff(buff, p, &lua_newstate);  /* public function */ | ||||
|   lua_assert(p == sizeof(buff)); | ||||
|   return luaS_hash(buff, p, h); | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** set GCdebt to a new value keeping the value (totalbytes + GCdebt) | ||||
| ** invariant (and avoiding underflows in 'totalbytes') | ||||
| */ | ||||
| void luaE_setdebt (global_State *g, l_mem debt) { | ||||
|   l_mem tb = gettotalbytes(g); | ||||
|   lua_assert(tb > 0); | ||||
|   if (debt < tb - MAX_LMEM) | ||||
|     debt = tb - MAX_LMEM;  /* will make 'totalbytes == MAX_LMEM' */ | ||||
|   g->totalbytes = tb - debt; | ||||
|   g->GCdebt = debt; | ||||
| } | ||||
|  | ||||
|  | ||||
| CallInfo *luaE_extendCI (lua_State *L) { | ||||
|   CallInfo *ci = luaM_new(L, CallInfo); | ||||
|   lua_assert(L->ci->next == NULL); | ||||
|   L->ci->next = ci; | ||||
|   ci->previous = L->ci; | ||||
|   ci->next = NULL; | ||||
|   L->nci++; | ||||
|   return ci; | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** free all CallInfo structures not in use by a thread | ||||
| */ | ||||
| void luaE_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 | ||||
| */ | ||||
| void luaE_shrinkCI (lua_State *L) { | ||||
|   CallInfo *ci = L->ci; | ||||
|   CallInfo *next2;  /* next's next */ | ||||
|   /* while there are two nexts */ | ||||
|   while (ci->next != NULL && (next2 = ci->next->next) != NULL) { | ||||
|     luaM_free(L, ci->next);  /* free next */ | ||||
|     L->nci--; | ||||
|     ci->next = next2;  /* remove 'next' from the list */ | ||||
|     next2->previous = ci; | ||||
|     ci = next2;  /* keep next's next */ | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| static void stack_init (lua_State *L1, lua_State *L) { | ||||
|   int i; CallInfo *ci; | ||||
|   /* initialize stack array */ | ||||
|   L1->stack = luaM_newvector(L, BASIC_STACK_SIZE, TValue); | ||||
|   L1->stacksize = BASIC_STACK_SIZE; | ||||
|   for (i = 0; i < BASIC_STACK_SIZE; i++) | ||||
|     setnilvalue(L1->stack + i);  /* erase new stack */ | ||||
|   L1->top = L1->stack; | ||||
|   L1->stack_last = L1->stack + L1->stacksize - EXTRA_STACK; | ||||
|   /* initialize first ci */ | ||||
|   ci = &L1->base_ci; | ||||
|   ci->next = ci->previous = NULL; | ||||
|   ci->callstatus = 0; | ||||
|   ci->func = L1->top; | ||||
|   setnilvalue(L1->top++);  /* 'function' entry for this 'ci' */ | ||||
|   ci->top = L1->top + LUA_MINSTACK; | ||||
|   L1->ci = ci; | ||||
| } | ||||
|  | ||||
|  | ||||
| static void freestack (lua_State *L) { | ||||
|   if (L->stack == NULL) | ||||
|     return;  /* stack not completely built yet */ | ||||
|   L->ci = &L->base_ci;  /* free the entire 'ci' list */ | ||||
|   luaE_freeCI(L); | ||||
|   lua_assert(L->nci == 0); | ||||
|   luaM_freearray(L, L->stack, L->stacksize);  /* free stack array */ | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Create registry table and its predefined values | ||||
| */ | ||||
| static void init_registry (lua_State *L, global_State *g) { | ||||
|   TValue temp; | ||||
|   /* create registry */ | ||||
|   Table *registry = luaH_new(L); | ||||
|   sethvalue(L, &g->l_registry, registry); | ||||
|   luaH_resize(L, registry, LUA_RIDX_LAST, 0); | ||||
|   /* registry[LUA_RIDX_MAINTHREAD] = L */ | ||||
|   setthvalue(L, &temp, L);  /* temp = L */ | ||||
|   luaH_setint(L, registry, LUA_RIDX_MAINTHREAD, &temp); | ||||
|   /* registry[LUA_RIDX_GLOBALS] = table of globals */ | ||||
|   sethvalue(L, &temp, luaH_new(L));  /* temp = new table (global table) */ | ||||
|   luaH_setint(L, registry, LUA_RIDX_GLOBALS, &temp); | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** open parts of the state that may cause memory-allocation errors. | ||||
| ** ('g->version' != NULL flags that the state was completely build) | ||||
| */ | ||||
| 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->gcrunning = 1;  /* allow gc */ | ||||
|   g->version = lua_version(NULL); | ||||
|   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) { | ||||
|   L->l_G = g; | ||||
|   L->stack = NULL; | ||||
|   L->ci = NULL; | ||||
|   L->nci = 0; | ||||
|   L->stacksize = 0; | ||||
|   L->twups = L;  /* thread has no upvalues */ | ||||
|   L->errorJmp = NULL; | ||||
|   L->nCcalls = 0; | ||||
|   L->hook = NULL; | ||||
|   L->hookmask = 0; | ||||
|   L->basehookcount = 0; | ||||
|   L->allowhook = 1; | ||||
|   resethookcount(L); | ||||
|   L->openupval = NULL; | ||||
|   L->nny = 1; | ||||
|   L->status = LUA_OK; | ||||
|   L->errfunc = 0; | ||||
|   L->onlyluac = 0; | ||||
| } | ||||
|  | ||||
| LUA_API void lua_setonlyluac(lua_State *L, int v) { | ||||
| 	L->onlyluac = v; | ||||
| } | ||||
|  | ||||
|  | ||||
| static void close_state (lua_State *L) { | ||||
|   global_State *g = G(L); | ||||
|   luaF_close(L, L->stack);  /* close all upvalues for this thread */ | ||||
|   luaC_freeallobjects(L);  /* collect all objects */ | ||||
|   if (g->version)  /* closing a fully built state? */ | ||||
|     luai_userstateclose(L); | ||||
|   luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size); | ||||
|   freestack(L); | ||||
|   lua_assert(gettotalbytes(g) == sizeof(LG)); | ||||
|   (*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); | ||||
|   lua_State *L1; | ||||
|   lua_lock(L); | ||||
|   luaC_checkGC(L); | ||||
|   /* create new thread */ | ||||
|   L1 = &cast(LX *, luaM_newobject(L, LUA_TTHREAD, sizeof(LX)))->l; | ||||
|   L1->marked = luaC_white(g); | ||||
|   L1->tt = LUA_TTHREAD; | ||||
|   /* link it on list 'allgc' */ | ||||
|   L1->next = g->allgc; | ||||
|   g->allgc = obj2gco(L1); | ||||
|   /* anchor it on L stack */ | ||||
|   setthvalue(L, L->top, 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_close(L1, L1->stack);  /* close all upvalues for this thread */ | ||||
|   lua_assert(L1->openupval == NULL); | ||||
|   luai_userstatefree(L, L1); | ||||
|   freestack(L1); | ||||
|   luaM_free(L, l); | ||||
| } | ||||
|  | ||||
|  | ||||
| LUA_API lua_State *lua_newstate (lua_Alloc f, void *ud) { | ||||
|   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->next = NULL; | ||||
|   L->tt = LUA_TTHREAD; | ||||
|   g->currentwhite = bitmask(WHITE0BIT); | ||||
|   L->marked = luaC_white(g); | ||||
|   preinit_thread(L, g); | ||||
|   g->frealloc = f; | ||||
|   g->ud = ud; | ||||
|   g->mainthread = L; | ||||
|   g->seed = makeseed(L); | ||||
|   g->gcrunning = 0;  /* no GC while building state */ | ||||
|   g->GCestimate = 0; | ||||
|   g->strt.size = g->strt.nuse = 0; | ||||
|   g->strt.hash = NULL; | ||||
|   setnilvalue(&g->l_registry); | ||||
|   g->panic = NULL; | ||||
|   g->version = NULL; | ||||
|   g->gcstate = GCSpause; | ||||
|   g->gckind = KGC_NORMAL; | ||||
|   g->allgc = g->finobj = g->tobefnz = g->fixedgc = NULL; | ||||
|   g->sweepgc = NULL; | ||||
|   g->gray = g->grayagain = NULL; | ||||
|   g->weak = g->ephemeron = g->allweak = NULL; | ||||
|   g->twups = NULL; | ||||
|   g->totalbytes = sizeof(LG); | ||||
|   g->GCdebt = 0; | ||||
|   g->gcfinnum = 0; | ||||
|   g->gcpause = LUAI_GCPAUSE; | ||||
|   g->gcstepmul = LUAI_GCMUL; | ||||
|   for (i=0; i < LUA_NUMTAGS; 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) { | ||||
|   L = G(L)->mainthread;  /* only the main thread can be closed */ | ||||
|   lua_lock(L); | ||||
|   close_state(L); | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										235
									
								
								Plugins/slua_unreal/External/lua/lstate.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										235
									
								
								Plugins/slua_unreal/External/lua/lstate.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,235 @@ | ||||
| /* | ||||
| ** $Id: lstate.h,v 2.133 2016/12/22 13:08:50 roberto Exp $ | ||||
| ** Global State | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #ifndef lstate_h | ||||
| #define lstate_h | ||||
|  | ||||
| #include "lua.h" | ||||
| #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). | ||||
|  | ||||
| */ | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Atomic type (relative to signals) to better ensure that 'lua_sethook' | ||||
| ** is thread safe | ||||
| */ | ||||
| #if !defined(l_signalT) | ||||
| #include <signal.h> | ||||
| #define l_signalT	sig_atomic_t | ||||
| #endif | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| struct lua_longjmp; /* defined in ldo.c */ | ||||
|  | ||||
| /* extra stack space to handle TM calls and some other extras */ | ||||
| #define EXTRA_STACK   5 | ||||
|  | ||||
|  | ||||
| #define BASIC_STACK_SIZE        (2*LUA_MINSTACK) | ||||
|  | ||||
|  | ||||
| /* kinds of Garbage Collection */ | ||||
| #define KGC_NORMAL	0 | ||||
| #define KGC_EMERGENCY	1	/* gc was forced by an allocation failure */ | ||||
|  | ||||
| typedef struct stringtable { | ||||
|   TString **hash; | ||||
|   int nuse;  /* number of elements */ | ||||
|   int size; | ||||
| } stringtable; | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Information about a call. | ||||
| ** When a thread yields, 'func' is adjusted to pretend that the | ||||
| ** top function has only the yielded values in its stack; in that | ||||
| ** case, the actual 'func' value is saved in field 'extra'. | ||||
| ** When a function calls another with a continuation, 'extra' keeps | ||||
| ** the function index so that, in case of errors, the continuation | ||||
| ** function can be called with the correct top. | ||||
| */ | ||||
| typedef struct CallInfo { | ||||
|   StkId func;  /* function index in the stack */ | ||||
|   StkId	top;  /* top for this function */ | ||||
|   struct CallInfo *previous, *next;  /* dynamic call link */ | ||||
|   union { | ||||
|     struct {  /* only for Lua functions */ | ||||
|       StkId base;  /* base for this function */ | ||||
|       const Instruction *savedpc; | ||||
|     } 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; | ||||
|   ptrdiff_t extra; | ||||
|   short nresults;  /* expected number of results from this function */ | ||||
|   unsigned short callstatus; | ||||
| } CallInfo; | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Bits in CallInfo status | ||||
| */ | ||||
| #define CIST_OAH	(1<<0)	/* original value of 'allowhook' */ | ||||
| #define CIST_LUA	(1<<1)	/* call is running a Lua function */ | ||||
| #define CIST_HOOKED	(1<<2)	/* call is running a debug hook */ | ||||
| #define CIST_FRESH	(1<<3)	/* call is running on a fresh invocation | ||||
|                                    of luaV_execute */ | ||||
| #define CIST_YPCALL	(1<<4)	/* call is a yieldable protected call */ | ||||
| #define CIST_TAIL	(1<<5)	/* call was tail called */ | ||||
| #define CIST_HOOKYIELD	(1<<6)	/* last hook called yielded */ | ||||
| #define CIST_LEQ	(1<<7)  /* using __lt for __le */ | ||||
| #define CIST_FIN	(1<<8)  /* call is running a finalizer */ | ||||
|  | ||||
| #define isLua(ci)	((ci)->callstatus & CIST_LUA) | ||||
|  | ||||
| /* 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' */ | ||||
|   l_mem totalbytes;  /* number of bytes currently allocated - GCdebt */ | ||||
|   l_mem GCdebt;  /* bytes allocated not yet compensated by the collector */ | ||||
|   lu_mem GCmemtrav;  /* memory traversed by the GC */ | ||||
|   lu_mem GCestimate;  /* an estimate of the non-garbage memory in use */ | ||||
|   stringtable strt;  /* hash table for strings */ | ||||
|   TValue l_registry; | ||||
|   unsigned int seed;  /* randomized seed for hashes */ | ||||
|   lu_byte currentwhite; | ||||
|   lu_byte gcstate;  /* state of garbage collector */ | ||||
|   lu_byte gckind;  /* kind of GC running */ | ||||
|   lu_byte gcrunning;  /* true if GC is running */ | ||||
|   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 */ | ||||
|   struct lua_State *twups;  /* list of threads with open upvalues */ | ||||
|   unsigned int gcfinnum;  /* number of finalizers to call in each GC step */ | ||||
|   int gcpause;  /* size of pause between successive GCs */ | ||||
|   int gcstepmul;  /* GC 'granularity' */ | ||||
|   lua_CFunction panic;  /* to be called in unprotected errors */ | ||||
|   struct lua_State *mainthread; | ||||
|   const lua_Number *version;  /* pointer to version number */ | ||||
|   TString *memerrmsg;  /* memory-error message */ | ||||
|   TString *tmname[TM_N];  /* array with tag-method names */ | ||||
|   struct Table *mt[LUA_NUMTAGS];  /* metatables for basic types */ | ||||
|   TString *strcache[STRCACHE_N][STRCACHE_M];  /* cache for strings in API */ | ||||
| } global_State; | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 'per thread' state | ||||
| */ | ||||
| struct lua_State { | ||||
|   CommonHeader; | ||||
|   unsigned short nci;  /* number of items in 'ci' list */ | ||||
|   lu_byte status; | ||||
|   StkId top;  /* first free slot in the stack */ | ||||
|   global_State *l_G; | ||||
|   CallInfo *ci;  /* call info for current function */ | ||||
|   const Instruction *oldpc;  /* last pc traced */ | ||||
|   StkId stack_last;  /* last free slot in the stack */ | ||||
|   StkId stack;  /* stack base */ | ||||
|   UpVal *openupval;  /* list of open upvalues in this stack */ | ||||
|   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) */ | ||||
|   int stacksize; | ||||
|   int basehookcount; | ||||
|   int hookcount; | ||||
|   unsigned short nny;  /* number of non-yieldable calls in stack */ | ||||
|   unsigned short nCcalls;  /* number of nested C calls */ | ||||
|   l_signalT hookmask; | ||||
|   lu_byte allowhook; | ||||
|   int onlyluac; | ||||
| }; | ||||
|  | ||||
| // #define G(L)	(L->l_G) | ||||
| inline global_State* G(lua_State* L) { | ||||
|   return L->l_G; | ||||
| } | ||||
|  | ||||
|     /* | ||||
| ** Union of all collectable objects (only for conversions) | ||||
| */ | ||||
| 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 */ | ||||
| }; | ||||
|  | ||||
|  | ||||
| #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_TUSERDATA, &((cast_u(o))->u)) | ||||
| #define gco2lcl(o)  check_exp((o)->tt == LUA_TLCL, &((cast_u(o))->cl.l)) | ||||
| #define gco2ccl(o)  check_exp((o)->tt == LUA_TCCL, &((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_TTABLE, &((cast_u(o))->h)) | ||||
| #define gco2p(o)  check_exp((o)->tt == LUA_TPROTO, &((cast_u(o))->p)) | ||||
| #define gco2th(o)  check_exp((o)->tt == LUA_TTHREAD, &((cast_u(o))->th)) | ||||
|  | ||||
|  | ||||
| /* macro to convert a Lua object into a GCObject */ | ||||
| #define obj2gco(v) \ | ||||
| 	check_exp(novariant((v)->tt) < LUA_TDEADKEY, (&(cast_u(v)->gc))) | ||||
|  | ||||
|  | ||||
| /* actual number of total bytes allocated */ | ||||
| #define gettotalbytes(g)	cast(lu_mem, (g)->totalbytes + (g)->GCdebt) | ||||
|  | ||||
| LUAI_FUNC void luaE_setdebt (global_State *g, l_mem debt); | ||||
| LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1); | ||||
| LUAI_FUNC CallInfo *luaE_extendCI (lua_State *L); | ||||
| LUAI_FUNC void luaE_freeCI (lua_State *L); | ||||
| LUAI_FUNC void luaE_shrinkCI (lua_State *L); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
|  | ||||
							
								
								
									
										248
									
								
								Plugins/slua_unreal/External/lua/lstring.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										248
									
								
								Plugins/slua_unreal/External/lua/lstring.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,248 @@ | ||||
| /* | ||||
| ** $Id: lstring.c,v 2.56 2015/11/23 11:32:51 roberto Exp $ | ||||
| ** String table (keeps all strings handled by Lua) | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define lstring_c | ||||
| #define LUA_CORE | ||||
|  | ||||
| #include "lstring.h" | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "ldebug.h" | ||||
| #include "ldo.h" | ||||
| #include "lmem.h" | ||||
| #include "lobject.h" | ||||
| #include "lstate.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| #define MEMERRMSG       "not enough memory" | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Lua will use at most ~(2^LUAI_HASHLIMIT) bytes from a string to | ||||
| ** compute its hash | ||||
| */ | ||||
| #if !defined(LUAI_HASHLIMIT) | ||||
| #define LUAI_HASHLIMIT		5 | ||||
| #endif | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** equality for long strings | ||||
| */ | ||||
| int luaS_eqlngstr (TString *a, TString *b) { | ||||
|   size_t len = a->u.lnglen; | ||||
|   lua_assert(a->tt == LUA_TLNGSTR && b->tt == LUA_TLNGSTR); | ||||
|   return (a == b) ||  /* same instance or... */ | ||||
|     ((len == b->u.lnglen) &&  /* equal length and ... */ | ||||
|      (memcmp(getstr(a), getstr(b), len) == 0));  /* equal contents */ | ||||
| } | ||||
|  | ||||
|  | ||||
| unsigned int luaS_hash (const char *str, size_t l, unsigned int seed) { | ||||
|   unsigned int h = seed ^ cast(unsigned int, l); | ||||
|   size_t step = (l >> LUAI_HASHLIMIT) + 1; | ||||
|   for (; l >= step; l -= step) | ||||
|     h ^= ((h<<5) + (h>>2) + cast_byte(str[l - 1])); | ||||
|   return h; | ||||
| } | ||||
|  | ||||
|  | ||||
| unsigned int luaS_hashlongstr (TString *ts) { | ||||
|   lua_assert(ts->tt == LUA_TLNGSTR); | ||||
|   if (ts->extra == 0) {  /* no hash? */ | ||||
|     ts->hash = luaS_hash(getstr(ts), ts->u.lnglen, ts->hash); | ||||
|     ts->extra = 1;  /* now it has its hash */ | ||||
|   } | ||||
|   return ts->hash; | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** resizes the string table | ||||
| */ | ||||
| void luaS_resize (lua_State *L, int newsize) { | ||||
|   int i; | ||||
|   stringtable *tb = &G(L)->strt; | ||||
|   if (newsize > tb->size) {  /* grow table if needed */ | ||||
|     luaM_reallocvector(L, tb->hash, tb->size, newsize, TString *); | ||||
|     for (i = tb->size; i < newsize; i++) | ||||
|       tb->hash[i] = NULL; | ||||
|   } | ||||
|   for (i = 0; i < tb->size; i++) {  /* rehash */ | ||||
|     TString *p = tb->hash[i]; | ||||
|     tb->hash[i] = NULL; | ||||
|     while (p) {  /* for each node in the list */ | ||||
|       TString *hnext = p->u.hnext;  /* save next */ | ||||
|       unsigned int h = lmod(p->hash, newsize);  /* new position */ | ||||
|       p->u.hnext = tb->hash[h];  /* chain it */ | ||||
|       tb->hash[h] = p; | ||||
|       p = hnext; | ||||
|     } | ||||
|   } | ||||
|   if (newsize < tb->size) {  /* shrink table if needed */ | ||||
|     /* vanishing slice should be empty */ | ||||
|     lua_assert(tb->hash[newsize] == NULL && tb->hash[tb->size - 1] == NULL); | ||||
|     luaM_reallocvector(L, tb->hash, tb->size, newsize, TString *); | ||||
|   } | ||||
|   tb->size = newsize; | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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; | ||||
|   luaS_resize(L, MINSTRTABSIZE);  /* initial size of string table */ | ||||
|   /* 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; | ||||
| } | ||||
|  | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** creates a new string object | ||||
| */ | ||||
| static TString *createstrobj (lua_State *L, size_t l, int tag, unsigned int h) { | ||||
|   TString *ts; | ||||
|   GCObject *o; | ||||
|   size_t totalsize;  /* total size of TString object */ | ||||
|   totalsize = sizelstring(l); | ||||
|   o = luaC_newobj(L, tag, totalsize); | ||||
|   ts = gco2ts(o); | ||||
|   ts->hash = h; | ||||
|   ts->extra = 0; | ||||
|   getstr(ts)[l] = '\0';  /* ending 0 */ | ||||
|   return ts; | ||||
| } | ||||
|  | ||||
|  | ||||
| TString *luaS_createlngstrobj (lua_State *L, size_t l) { | ||||
|   TString *ts = createstrobj(L, l, LUA_TLNGSTR, G(L)->seed); | ||||
|   ts->u.lnglen = l; | ||||
|   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--; | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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); | ||||
|   unsigned int h = luaS_hash(str, l, g->seed); | ||||
|   TString **list = &g->strt.hash[lmod(h, g->strt.size)]; | ||||
|   lua_assert(str != NULL);  /* otherwise 'memcmp'/'memcpy' are undefined */ | ||||
|   for (ts = *list; ts != NULL; ts = ts->u.hnext) { | ||||
|     if (l == ts->shrlen && | ||||
|         (memcmp(str, getstr(ts), l * sizeof(char)) == 0)) { | ||||
|       /* found! */ | ||||
|       if (isdead(g, ts))  /* dead (but not collected yet)? */ | ||||
|         changewhite(ts);  /* resurrect it */ | ||||
|       return ts; | ||||
|     } | ||||
|   } | ||||
|   if (g->strt.nuse >= g->strt.size && g->strt.size <= MAX_INT/2) { | ||||
|     luaS_resize(L, g->strt.size * 2); | ||||
|     list = &g->strt.hash[lmod(h, g->strt.size)];  /* recompute with new size */ | ||||
|   } | ||||
|   ts = createstrobj(L, l, LUA_TSHRSTR, h); | ||||
|   memcpy(getstr(ts), str, l * sizeof(char)); | ||||
|   ts->shrlen = cast_byte(l); | ||||
|   ts->u.hnext = *list; | ||||
|   *list = ts; | ||||
|   g->strt.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 >= (MAX_SIZE - sizeof(TString))/sizeof(char)) | ||||
|       luaM_toobig(L); | ||||
|     ts = luaS_createlngstrobj(L, l); | ||||
|     memcpy(getstr(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) { | ||||
|   Udata *u; | ||||
|   GCObject *o; | ||||
|   if (s > MAX_SIZE - sizeof(Udata)) | ||||
|     luaM_toobig(L); | ||||
|   o = luaC_newobj(L, LUA_TUSERDATA, sizeludata(s)); | ||||
|   u = gco2u(o); | ||||
|   u->len = s; | ||||
|   u->metatable = NULL; | ||||
|   setuservalue(L, u, luaO_nilobject); | ||||
|   return u; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										50
									
								
								Plugins/slua_unreal/External/lua/lstring.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										50
									
								
								Plugins/slua_unreal/External/lua/lstring.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,50 @@ | ||||
| /* | ||||
| ** $Id: lstring.h,v 1.61 2015/11/03 15:36:01 roberto Exp $ | ||||
| ** 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" | ||||
|  | ||||
| #define sizelstring(l)  (sizeof(union UTString) + ((l) + 1) * sizeof(char)) | ||||
|  | ||||
| #define sizeludata(l)	(sizeof(union UUdata) + (l)) | ||||
| #define sizeudata(u)	sizeludata((u)->len) | ||||
|  | ||||
| #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_TSHRSTR && (s)->extra > 0) | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** equality for short strings, which are always internalized | ||||
| */ | ||||
| #define eqshrstr(a,b)	check_exp((a)->tt == LUA_TSHRSTR, (a) == (b)) | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| LUAI_FUNC unsigned int luaS_hash (const char *str, size_t l, unsigned int seed); | ||||
| LUAI_FUNC unsigned int 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); | ||||
| 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); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										1584
									
								
								Plugins/slua_unreal/External/lua/lstrlib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										1584
									
								
								Plugins/slua_unreal/External/lua/lstrlib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
										
											
												File diff suppressed because it is too large
												Load Diff
											
										
									
								
							
							
								
								
									
										670
									
								
								Plugins/slua_unreal/External/lua/ltable.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										670
									
								
								Plugins/slua_unreal/External/lua/ltable.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,670 @@ | ||||
| /* | ||||
| ** $Id: ltable.c,v 2.118 2016/11/07 12:38:35 roberto Exp $ | ||||
| ** Lua tables (hash) | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define ltable_c | ||||
| #define LUA_CORE | ||||
|  | ||||
| #include "ltable.h" | ||||
| #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 <math.h> | ||||
| #include <limits.h> | ||||
|  | ||||
| #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 "lvm.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* | ||||
| ** Maximum size of array part (MAXASIZE) is 2^MAXABITS. MAXABITS is | ||||
| ** the largest integer such that MAXASIZE fits in an unsigned int. | ||||
| */ | ||||
| #define MAXABITS	cast_int(sizeof(int) * CHAR_BIT - 1) | ||||
| #define MAXASIZE	(1u << MAXABITS) | ||||
|  | ||||
| /* | ||||
| ** Maximum size of hash part is 2^MAXHBITS. MAXHBITS is the largest | ||||
| ** integer such that 2^MAXHBITS fits in a signed int. (Note that the | ||||
| ** maximum number of elements in a table, 2^MAXABITS + 2^MAXHBITS, still | ||||
| ** fits comfortably in an unsigned int.) | ||||
| */ | ||||
| #define MAXHBITS	(MAXABITS - 1) | ||||
|  | ||||
|  | ||||
| #define hashpow2(t,n)		(gnode(t, lmod((n), sizenode(t)))) | ||||
|  | ||||
| #define hashstr(t,str)		hashpow2(t, (str)->hash) | ||||
| #define hashboolean(t,p)	hashpow2(t, p) | ||||
| #define hashint(t,i)		hashpow2(t, i) | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** for some types, it is better to avoid modulus by power of 2, as | ||||
| ** they tend to have many 2 factors. | ||||
| */ | ||||
| #define hashmod(t,n)	(gnode(t, ((n) % ((sizenode(t)-1)|1)))) | ||||
|  | ||||
|  | ||||
| #define hashpointer(t,p)	hashmod(t, point2uint(p)) | ||||
|  | ||||
|  | ||||
| #define dummynode		(&dummynode_) | ||||
|  | ||||
| static const Node dummynode_ = { | ||||
|   {NILCONSTANT},  /* value */ | ||||
|   {{NILCONSTANT, 0}}  /* key */ | ||||
| }; | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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(unsigned int, i) + cast(unsigned int, ni); | ||||
|     return cast_int(u <= cast(unsigned int, 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 *mainposition (const Table *t, const TValue *key) { | ||||
|   switch (ttype(key)) { | ||||
|     case LUA_TNUMINT: | ||||
|       return hashint(t, ivalue(key)); | ||||
|     case LUA_TNUMFLT: | ||||
|       return hashmod(t, l_hashfloat(fltvalue(key))); | ||||
|     case LUA_TSHRSTR: | ||||
|       return hashstr(t, tsvalue(key)); | ||||
|     case LUA_TLNGSTR: | ||||
|       return hashpow2(t, luaS_hashlongstr(tsvalue(key))); | ||||
|     case LUA_TBOOLEAN: | ||||
|       return hashboolean(t, bvalue(key)); | ||||
|     case LUA_TLIGHTUSERDATA: | ||||
|       return hashpointer(t, pvalue(key)); | ||||
|     case LUA_TLCF: | ||||
|       return hashpointer(t, fvalue(key)); | ||||
|     default: | ||||
|       lua_assert(!ttisdeadkey(key)); | ||||
|       return hashpointer(t, gcvalue(key)); | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** returns the index for 'key' if 'key' is an appropriate key to live in | ||||
| ** the array part of the table, 0 otherwise. | ||||
| */ | ||||
| static unsigned int arrayindex (const TValue *key) { | ||||
|   if (ttisinteger(key)) { | ||||
|     lua_Integer k = ivalue(key); | ||||
|     if (0 < k && (lua_Unsigned)k <= MAXASIZE) | ||||
|       return cast(unsigned int, k);  /* 'key' is an appropriate array index */ | ||||
|   } | ||||
|   return 0;  /* 'key' did not match some condition */ | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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 int findindex (lua_State *L, Table *t, StkId key) { | ||||
|   unsigned int i; | ||||
|   if (ttisnil(key)) return 0;  /* first iteration */ | ||||
|   i = arrayindex(key); | ||||
|   if (i != 0 && i <= t->sizearray)  /* is 'key' inside array part? */ | ||||
|     return i;  /* yes; that's the index */ | ||||
|   else { | ||||
|     int nx; | ||||
|     Node *n = mainposition(t, key); | ||||
|     for (;;) {  /* check whether 'key' is somewhere in the chain */ | ||||
|       /* key may be dead already, but it is ok to use it in 'next' */ | ||||
|       if (luaV_rawequalobj(gkey(n), key) || | ||||
|             (ttisdeadkey(gkey(n)) && iscollectable(key) && | ||||
|              deadvalue(gkey(n)) == gcvalue(key))) { | ||||
|         i = cast_int(n - gnode(t, 0));  /* key index in hash table */ | ||||
|         /* hash elements are numbered after array ones */ | ||||
|         return (i + 1) + t->sizearray; | ||||
|       } | ||||
|       nx = gnext(n); | ||||
|       if (nx == 0) | ||||
|         luaG_runerror(L, "invalid key to 'next'");  /* key not found */ | ||||
|       else n += nx; | ||||
|     } | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| int luaH_next (lua_State *L, Table *t, StkId key) { | ||||
|   unsigned int i = findindex(L, t, key);  /* find original element */ | ||||
|   for (; i < t->sizearray; i++) {  /* try first array part */ | ||||
|     if (!ttisnil(&t->array[i])) {  /* a non-nil value? */ | ||||
|       setivalue(key, i + 1); | ||||
|       setobj2s(L, key+1, &t->array[i]); | ||||
|       return 1; | ||||
|     } | ||||
|   } | ||||
|   for (i -= t->sizearray; cast_int(i) < sizenode(t); i++) {  /* hash part */ | ||||
|     if (!ttisnil(gval(gnode(t, i)))) {  /* a non-nil value? */ | ||||
|       setobj2s(L, key, gkey(gnode(t, i))); | ||||
|       setobj2s(L, key+1, gval(gnode(t, i))); | ||||
|       return 1; | ||||
|     } | ||||
|   } | ||||
|   return 0;  /* no more elements */ | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** {============================================================= | ||||
| ** 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. | ||||
| */ | ||||
| static unsigned int computesizes (unsigned int nums[], unsigned int *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; *pna > twotoi / 2; i++, twotoi *= 2) { | ||||
|     if (nums[i] > 0) { | ||||
|       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 (const TValue *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; | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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 int numusearray (const Table *t, unsigned int *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 */ | ||||
|   /* traverse each slice */ | ||||
|   for (lg = 0, ttlg = 1; lg <= MAXABITS; lg++, ttlg *= 2) { | ||||
|     unsigned int lc = 0;  /* counter */ | ||||
|     unsigned int lim = ttlg; | ||||
|     if (lim > t->sizearray) { | ||||
|       lim = t->sizearray;  /* 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 (!ttisnil(&t->array[i-1])) | ||||
|         lc++; | ||||
|     } | ||||
|     nums[lg] += lc; | ||||
|     ause += lc; | ||||
|   } | ||||
|   return ause; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int numusehash (const Table *t, unsigned int *nums, unsigned int *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 (!ttisnil(gval(n))) { | ||||
|       ause += countint(gkey(n), nums); | ||||
|       totaluse++; | ||||
|     } | ||||
|   } | ||||
|   *pna += ause; | ||||
|   return totaluse; | ||||
| } | ||||
|  | ||||
|  | ||||
| static void setarrayvector (lua_State *L, Table *t, unsigned int size) { | ||||
|   unsigned int i; | ||||
|   luaM_reallocvector(L, t->array, t->sizearray, size, TValue); | ||||
|   for (i=t->sizearray; i<size; i++) | ||||
|      setnilvalue(&t->array[i]); | ||||
|   t->sizearray = size; | ||||
| } | ||||
|  | ||||
|  | ||||
| static void setnodevector (lua_State *L, Table *t, unsigned int size) { | ||||
|   if (size == 0) {  /* no elements to hash part? */ | ||||
|     t->node = cast(Node *, dummynode);  /* use common 'dummynode' */ | ||||
|     t->lsizenode = 0; | ||||
|     t->lastfree = NULL;  /* signal that it is using dummy node */ | ||||
|   } | ||||
|   else { | ||||
|     int i; | ||||
|     int lsize = luaO_ceillog2(size); | ||||
|     if (lsize > MAXHBITS) | ||||
|       luaG_runerror(L, "table overflow"); | ||||
|     size = twoto(lsize); | ||||
|     t->node = luaM_newvector(L, size, Node); | ||||
|     for (i = 0; i < (int)size; i++) { | ||||
|       Node *n = gnode(t, i); | ||||
|       gnext(n) = 0; | ||||
|       setnilvalue(wgkey(n)); | ||||
|       setnilvalue(gval(n)); | ||||
|     } | ||||
|     t->lsizenode = cast_byte(lsize); | ||||
|     t->lastfree = gnode(t, size);  /* all positions are free */ | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| void luaH_resize (lua_State *L, Table *t, unsigned int nasize, | ||||
|                                           unsigned int nhsize) { | ||||
|   unsigned int i; | ||||
|   int j; | ||||
|   unsigned int oldasize = t->sizearray; | ||||
|   int oldhsize = allocsizenode(t); | ||||
|   Node *nold = t->node;  /* save old hash ... */ | ||||
|   if (nasize > oldasize)  /* array part must grow? */ | ||||
|     setarrayvector(L, t, nasize); | ||||
|   /* create new hash part with appropriate size */ | ||||
|   setnodevector(L, t, nhsize); | ||||
|   if (nasize < oldasize) {  /* array part must shrink? */ | ||||
|     t->sizearray = nasize; | ||||
|     /* re-insert elements from vanishing slice */ | ||||
|     for (i=nasize; i<oldasize; i++) { | ||||
|       if (!ttisnil(&t->array[i])) | ||||
|         luaH_setint(L, t, i + 1, &t->array[i]); | ||||
|     } | ||||
|     /* shrink array */ | ||||
|     luaM_reallocvector(L, t->array, oldasize, nasize, TValue); | ||||
|   } | ||||
|   /* re-insert elements from hash part */ | ||||
|   for (j = oldhsize - 1; j >= 0; j--) { | ||||
|     Node *old = nold + j; | ||||
|     if (!ttisnil(gval(old))) { | ||||
|       /* doesn't need barrier/invalidate cache, as entry was | ||||
|          already present in the table */ | ||||
|       setobjt2t(L, luaH_set(L, t, gkey(old)), gval(old)); | ||||
|     } | ||||
|   } | ||||
|   if (oldhsize > 0)  /* not the dummy node? */ | ||||
|     luaM_freearray(L, nold, cast(size_t, oldhsize)); /* free old hash */ | ||||
| } | ||||
|  | ||||
|  | ||||
| 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 */ | ||||
|   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 */ | ||||
|   na += countint(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_TTABLE, sizeof(Table)); | ||||
|   Table *t = gco2t(o); | ||||
|   t->metatable = NULL; | ||||
|   t->flags = cast_byte(~0); | ||||
|   t->array = NULL; | ||||
|   t->sizearray = 0; | ||||
|   setnodevector(L, t, 0); | ||||
|   return t; | ||||
| } | ||||
|  | ||||
|  | ||||
| void luaH_free (lua_State *L, Table *t) { | ||||
|   if (!isdummy(t)) | ||||
|     luaM_freearray(L, t->node, cast(size_t, sizenode(t))); | ||||
|   luaM_freearray(L, t->array, t->sizearray); | ||||
|   luaM_free(L, t); | ||||
| } | ||||
|  | ||||
|  | ||||
| static Node *getfreepos (Table *t) { | ||||
|   if (!isdummy(t)) { | ||||
|     while (t->lastfree > t->node) { | ||||
|       t->lastfree--; | ||||
|       if (ttisnil(gkey(t->lastfree))) | ||||
|         return t->lastfree; | ||||
|     } | ||||
|   } | ||||
|   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. | ||||
| */ | ||||
| TValue *luaH_newkey (lua_State *L, Table *t, const TValue *key) { | ||||
|   Node *mp; | ||||
|   TValue aux; | ||||
|   if (ttisnil(key)) luaG_runerror(L, "table index is nil"); | ||||
|   else if (ttisfloat(key)) { | ||||
|     lua_Integer k; | ||||
|     if (luaV_tointeger(key, &k, 0)) {  /* does index fit in an integer? */ | ||||
|       setivalue(&aux, k); | ||||
|       key = &aux;  /* insert it as an integer */ | ||||
|     } | ||||
|     else if (luai_numisnan(fltvalue(key))) | ||||
|       luaG_runerror(L, "table index is NaN"); | ||||
|   } | ||||
|   mp = mainposition(t, key); | ||||
|   if (!ttisnil(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 */ | ||||
|       return luaH_set(L, t, key);  /* insert key into grown table */ | ||||
|     } | ||||
|     lua_assert(!isdummy(t)); | ||||
|     othern = mainposition(t, gkey(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 */ | ||||
|       } | ||||
|       setnilvalue(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->i_key, key); | ||||
|   luaC_barrierback(L, t, key); | ||||
|   lua_assert(ttisnil(gval(mp))); | ||||
|   return gval(mp); | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** search function for integers | ||||
| */ | ||||
| const TValue *luaH_getint (Table *t, lua_Integer key) { | ||||
|   /* (1 <= key && key <= t->sizearray) */ | ||||
|   if (l_castS2U(key) - 1 < t->sizearray) | ||||
|     return &t->array[key - 1]; | ||||
|   else { | ||||
|     Node *n = hashint(t, key); | ||||
|     for (;;) {  /* check whether 'key' is somewhere in the chain */ | ||||
|       if (ttisinteger(gkey(n)) && ivalue(gkey(n)) == key) | ||||
|         return gval(n);  /* that's it */ | ||||
|       else { | ||||
|         int nx = gnext(n); | ||||
|         if (nx == 0) break; | ||||
|         n += nx; | ||||
|       } | ||||
|     } | ||||
|     return luaO_nilobject; | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** search function for short strings | ||||
| */ | ||||
| const TValue *luaH_getshortstr (Table *t, TString *key) { | ||||
|   Node *n = hashstr(t, key); | ||||
|   lua_assert(key->tt == LUA_TSHRSTR); | ||||
|   for (;;) {  /* check whether 'key' is somewhere in the chain */ | ||||
|     const TValue *k = gkey(n); | ||||
|     if (ttisshrstring(k) && eqshrstr(tsvalue(k), key)) | ||||
|       return gval(n);  /* that's it */ | ||||
|     else { | ||||
|       int nx = gnext(n); | ||||
|       if (nx == 0) | ||||
|         return luaO_nilobject;  /* not found */ | ||||
|       n += nx; | ||||
|     } | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** "Generic" get version. (Not that generic: not valid for integers, | ||||
| ** which may be in array part, nor for floats with integral values.) | ||||
| */ | ||||
| static const TValue *getgeneric (Table *t, const TValue *key) { | ||||
|   Node *n = mainposition(t, key); | ||||
|   for (;;) {  /* check whether 'key' is somewhere in the chain */ | ||||
|     if (luaV_rawequalobj(gkey(n), key)) | ||||
|       return gval(n);  /* that's it */ | ||||
|     else { | ||||
|       int nx = gnext(n); | ||||
|       if (nx == 0) | ||||
|         return luaO_nilobject;  /* not found */ | ||||
|       n += nx; | ||||
|     } | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| const TValue *luaH_getstr (Table *t, TString *key) { | ||||
|   if (key->tt == LUA_TSHRSTR) | ||||
|     return luaH_getshortstr(t, key); | ||||
|   else {  /* for long strings, use generic case */ | ||||
|     TValue ko; | ||||
|     setsvalue(cast(lua_State *, NULL), &ko, key); | ||||
|     return getgeneric(t, &ko); | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** main search function | ||||
| */ | ||||
| const TValue *luaH_get (Table *t, const TValue *key) { | ||||
|   switch (ttype(key)) { | ||||
|     case LUA_TSHRSTR: return luaH_getshortstr(t, tsvalue(key)); | ||||
|     case LUA_TNUMINT: return luaH_getint(t, ivalue(key)); | ||||
|     case LUA_TNIL: return luaO_nilobject; | ||||
|     case LUA_TNUMFLT: { | ||||
|       lua_Integer k; | ||||
|       if (luaV_tointeger(key, &k, 0)) /* index is int? */ | ||||
|         return luaH_getint(t, k);  /* use specialized version */ | ||||
|       /* else... */ | ||||
|     }  /* FALLTHROUGH */ | ||||
|     default: | ||||
|       return getgeneric(t, key); | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** beware: when using this function you probably need to check a GC | ||||
| ** barrier and invalidate the TM cache. | ||||
| */ | ||||
| TValue *luaH_set (lua_State *L, Table *t, const TValue *key) { | ||||
|   const TValue *p = luaH_get(t, key); | ||||
|   if (p != luaO_nilobject) | ||||
|     return cast(TValue *, p); | ||||
|   else return luaH_newkey(L, t, key); | ||||
| } | ||||
|  | ||||
|  | ||||
| void luaH_setint (lua_State *L, Table *t, lua_Integer key, TValue *value) { | ||||
|   const TValue *p = luaH_getint(t, key); | ||||
|   TValue *cell; | ||||
|   if (p != luaO_nilobject) | ||||
|     cell = cast(TValue *, p); | ||||
|   else { | ||||
|     TValue k; | ||||
|     setivalue(&k, key); | ||||
|     cell = luaH_newkey(L, t, &k); | ||||
|   } | ||||
|   setobj2t(L, cell, value); | ||||
| } | ||||
|  | ||||
|  | ||||
| static int unbound_search (Table *t, unsigned int j) { | ||||
|   unsigned int i = j;  /* i is zero or a present index */ | ||||
|   j++; | ||||
|   /* find 'i' and 'j' such that i is present and j is not */ | ||||
|   while (!ttisnil(luaH_getint(t, j))) { | ||||
|     i = j; | ||||
|     if (j > cast(unsigned int, MAX_INT)/2) {  /* overflow? */ | ||||
|       /* table was built with bad purposes: resort to linear search */ | ||||
|       i = 1; | ||||
|       while (!ttisnil(luaH_getint(t, i))) i++; | ||||
|       return i - 1; | ||||
|     } | ||||
|     j *= 2; | ||||
|   } | ||||
|   /* now do a binary search between them */ | ||||
|   while (j - i > 1) { | ||||
|     unsigned int m = (i+j)/2; | ||||
|     if (ttisnil(luaH_getint(t, 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 non-nil and t[i+1] is nil (and 0 if t[1] is nil). | ||||
| */ | ||||
| int luaH_getn (Table *t) { | ||||
|   unsigned int j = t->sizearray; | ||||
|   if (j > 0 && ttisnil(&t->array[j - 1])) { | ||||
|     /* there is a boundary in the array part: (binary) search for it */ | ||||
|     unsigned int i = 0; | ||||
|     while (j - i > 1) { | ||||
|       unsigned int m = (i+j)/2; | ||||
|       if (ttisnil(&t->array[m - 1])) j = m; | ||||
|       else i = m; | ||||
|     } | ||||
|     return i; | ||||
|   } | ||||
|   /* else must find a boundary in hash part */ | ||||
|   else if (isdummy(t))  /* hash part is empty? */ | ||||
|     return j;  /* that is easy... */ | ||||
|   else return unbound_search(t, j); | ||||
| } | ||||
|  | ||||
|  | ||||
|  | ||||
| #if defined(LUA_DEBUG) | ||||
|  | ||||
| Node *luaH_mainposition (const Table *t, const TValue *key) { | ||||
|   return mainposition(t, key); | ||||
| } | ||||
|  | ||||
| int luaH_isdummy (const Table *t) { return isdummy(t); } | ||||
|  | ||||
| #endif | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										68
									
								
								Plugins/slua_unreal/External/lua/ltable.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										68
									
								
								Plugins/slua_unreal/External/lua/ltable.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,68 @@ | ||||
| /* | ||||
| ** $Id: ltable.h,v 2.23 2016/12/22 13:08:50 roberto Exp $ | ||||
| ** Lua tables (hash) | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #ifndef ltable_h | ||||
| #define ltable_h | ||||
|  | ||||
| #include "lobject.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| #define gnode(t,i)	(&(t)->node[i]) | ||||
| #define gval(n)		(&(n)->i_val) | ||||
| #define gnext(n)	((n)->i_key.nk.next) | ||||
|  | ||||
|  | ||||
| /* 'const' to avoid wrong writings that can mess up field 'next' */ | ||||
| #define gkey(n)		cast(const TValue*, (&(n)->i_key.tvk)) | ||||
|  | ||||
| /* | ||||
| ** writable version of 'gkey'; allows updates to individual fields, | ||||
| ** but not to the whole (which has incompatible type) | ||||
| */ | ||||
| #define wgkey(n)		(&(n)->i_key.nk) | ||||
|  | ||||
| #define invalidateTMcache(t)	((t)->flags = 0) | ||||
|  | ||||
|  | ||||
| /* true when 't' is using 'dummynode' as its hash part */ | ||||
| #define isdummy(t)		((t)->lastfree == NULL) | ||||
|  | ||||
|  | ||||
| /* allocated size for hash nodes */ | ||||
| #define allocsizenode(t)	(isdummy(t) ? 0 : sizenode(t)) | ||||
|  | ||||
|  | ||||
| /* returns the key, given the value of a table entry */ | ||||
| #define keyfromval(v) \ | ||||
|   (gkey(cast(Node *, cast(char *, (v)) - offsetof(Node, i_val)))) | ||||
|  | ||||
|  | ||||
| LUAI_FUNC const TValue *luaH_getint (Table *t, lua_Integer key); | ||||
| LUAI_FUNC void luaH_setint (lua_State *L, Table *t, lua_Integer key, | ||||
|                                                     TValue *value); | ||||
| LUAI_FUNC const TValue *luaH_getshortstr (Table *t, TString *key); | ||||
| LUAI_FUNC const TValue *luaH_getstr (Table *t, TString *key); | ||||
| LUAI_FUNC const TValue *luaH_get (Table *t, const TValue *key); | ||||
| LUAI_FUNC TValue *luaH_newkey (lua_State *L, Table *t, const TValue *key); | ||||
| LUAI_FUNC TValue *luaH_set (lua_State *L, Table *t, const TValue *key); | ||||
| LUAI_FUNC Table *luaH_new (lua_State *L); | ||||
| LUAI_FUNC void luaH_resize (lua_State *L, Table *t, unsigned int nasize, | ||||
|                                                     unsigned int nhsize); | ||||
| LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, unsigned int 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 int luaH_getn (Table *t); | ||||
|  | ||||
|  | ||||
| #if defined(LUA_DEBUG) | ||||
| LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key); | ||||
| LUAI_FUNC int luaH_isdummy (const Table *t); | ||||
| #endif | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										454
									
								
								Plugins/slua_unreal/External/lua/ltablib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										454
									
								
								Plugins/slua_unreal/External/lua/ltablib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,454 @@ | ||||
| /* | ||||
| ** $Id: ltablib.c,v 1.93 2016/02/25 19:41:54 roberto Exp $ | ||||
| ** Library for Table Manipulation | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define ltablib_c | ||||
| #define LUA_LIB | ||||
|  | ||||
| #include "lprefix.h" | ||||
|  | ||||
|  | ||||
| #include <limits.h> | ||||
| #include <stddef.h> | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
| #include "lualib.h" | ||||
|  | ||||
|  | ||||
| #if !defined(l_randomizePivot) | ||||
| #include <time.h> | ||||
| #endif | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* | ||||
| ** 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 */ | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| #if defined(LUA_COMPAT_MAXN) | ||||
| static int maxn (lua_State *L) { | ||||
|   lua_Number max = 0; | ||||
|   luaL_checktype(L, 1, LUA_TTABLE); | ||||
|   lua_pushnil(L);  /* first key */ | ||||
|   while (lua_next(L, 1)) { | ||||
|     lua_pop(L, 1);  /* remove value */ | ||||
|     if (lua_type(L, -1) == LUA_TNUMBER) { | ||||
|       lua_Number v = lua_tonumber(L, -1); | ||||
|       if (v > max) max = v; | ||||
|     } | ||||
|   } | ||||
|   lua_pushnumber(L, max); | ||||
|   return 1; | ||||
| } | ||||
| #endif | ||||
|  | ||||
|  | ||||
| static int tinsert (lua_State *L) { | ||||
|   lua_Integer e = aux_getn(L, 1, TAB_RW) + 1;  /* first empty element */ | ||||
|   lua_Integer pos;  /* where to insert new 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 */ | ||||
|       luaL_argcheck(L, 1 <= pos && pos <= 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 */ | ||||
|     luaL_argcheck(L, 1 <= pos && pos <= size + 1, 1, "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);  /* t[pos] = nil */ | ||||
|   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 (!lua_isstring(L, -1)) | ||||
|     luaL_error(L, "invalid value (%s) at index %d in table for 'concat'", | ||||
|                   luaL_typename(L, -1), 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 pack (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 unpack (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 (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)		/* { */ | ||||
|  | ||||
| /* size of 'e' measured in number of 'unsigned int's */ | ||||
| #define sof(e)		(sizeof(e) / sizeof(unsigned int)) | ||||
|  | ||||
| /* | ||||
| ** Use 'time' and 'clock' as sources of "randomness". Because we don't | ||||
| ** know the types 'clock_t' and 'time_t', we cannot cast them to | ||||
| ** anything without risking overflows. A safe way to use their values | ||||
| ** is to copy them to an array of a known type and use the array values. | ||||
| */ | ||||
| static unsigned int l_randomizePivot (void) { | ||||
|   clock_t c = clock(); | ||||
|   time_t t = time(NULL); | ||||
|   unsigned int buff[sof(c) + sof(t)]; | ||||
|   unsigned int i, rnd = 0; | ||||
|   memcpy(buff, &c, sof(c) * sizeof(unsigned int)); | ||||
|   memcpy(buff + sof(c), &t, sof(t) * sizeof(unsigned int)); | ||||
|   for (i = 0; i < sof(buff); i++) | ||||
|     rnd += buff[i]; | ||||
|   return rnd; | ||||
| } | ||||
|  | ||||
| #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 (lua_geti(L, 1, ++i), sort_comp(L, -1, -2)) { | ||||
|       if (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 (lua_geti(L, 1, --j), sort_comp(L, -3, -1)) { | ||||
|       if (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 % (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 int 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();  /* 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}, | ||||
| #if defined(LUA_COMPAT_MAXN) | ||||
|   {"maxn", maxn}, | ||||
| #endif | ||||
|   {"insert", tinsert}, | ||||
|   {"pack", pack}, | ||||
|   {"unpack", unpack}, | ||||
|   {"remove", tremove}, | ||||
|   {"move", tmove}, | ||||
|   {"sort", sort}, | ||||
|   {NULL, NULL} | ||||
| }; | ||||
|  | ||||
|  | ||||
| LUAMOD_API int luaopen_table (lua_State *L) { | ||||
|   luaL_newlib(L, tab_funcs); | ||||
| #if defined(LUA_COMPAT_UNPACK) | ||||
|   /* _G.unpack = table.unpack */ | ||||
|   lua_getfield(L, -1, "unpack"); | ||||
|   lua_setglobal(L, "unpack"); | ||||
| #endif | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										165
									
								
								Plugins/slua_unreal/External/lua/ltm.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										165
									
								
								Plugins/slua_unreal/External/lua/ltm.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,165 @@ | ||||
| /* | ||||
| ** $Id: ltm.c,v 2.38 2016/12/22 13:08:50 roberto Exp $ | ||||
| ** Tag methods | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define ltm_c | ||||
| #define LUA_CORE | ||||
|  | ||||
| #include "ltm.h" | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "ldebug.h" | ||||
| #include "ldo.h" | ||||
| #include "lobject.h" | ||||
| #include "lstate.h" | ||||
| #include "lstring.h" | ||||
| #include "ltable.h" | ||||
| #include "lvm.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| static const char udatatypename[] = "userdata"; | ||||
|  | ||||
| LUAI_DDEF const char *const luaT_typenames_[LUA_TOTALTAGS] = { | ||||
|   "no value", | ||||
|   "nil", "boolean", udatatypename, "number", | ||||
|   "string", "table", "function", udatatypename, "thread", | ||||
|   "proto" /* this last case is 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" | ||||
|   }; | ||||
|   int i; | ||||
|   for (i=0; i<TM_N; i++) { | ||||
|     G(L)->tmname[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_getshortstr(events, ename); | ||||
|   lua_assert(event <= TM_EQ); | ||||
|   if (ttisnil(tm)) {  /* no tag method? */ | ||||
|     events->flags |= cast_byte(1u<<event);  /* cache this fact */ | ||||
|     return NULL; | ||||
|   } | ||||
|   else return tm; | ||||
| } | ||||
|  | ||||
|  | ||||
| const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, TMS event) { | ||||
|   Table *mt; | ||||
|   switch (ttnov(o)) { | ||||
|     case LUA_TTABLE: | ||||
|       mt = hvalue(o)->metatable; | ||||
|       break; | ||||
|     case LUA_TUSERDATA: | ||||
|       mt = uvalue(o)->metatable; | ||||
|       break; | ||||
|     default: | ||||
|       mt = G(L)->mt[ttnov(o)]; | ||||
|   } | ||||
|   return (mt ? luaH_getshortstr(mt, G(L)->tmname[event]) : luaO_nilobject); | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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_getshortstr(mt, luaS_new(L, "__name")); | ||||
|     if (ttisstring(name))  /* is '__name' a string? */ | ||||
|       return getstr(tsvalue(name));  /* use it as type name */ | ||||
|   } | ||||
|   return ttypename(ttnov(o));  /* else use standard type name */ | ||||
| } | ||||
|  | ||||
|  | ||||
| void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, | ||||
|                   const TValue *p2, TValue *p3, int hasres) { | ||||
|   ptrdiff_t result = savestack(L, p3); | ||||
|   StkId func = L->top; | ||||
|   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 += 3; | ||||
|   if (!hasres)  /* no result? 'p3' is third argument */ | ||||
|     setobj2s(L, L->top++, p3);  /* 3rd argument */ | ||||
|   /* metamethod may yield only when called from Lua code */ | ||||
|   if (isLua(L->ci)) | ||||
|     luaD_call(L, func, hasres); | ||||
|   else | ||||
|     luaD_callnoyield(L, func, hasres); | ||||
|   if (hasres) {  /* if has result, move it to its place */ | ||||
|     p3 = restorestack(L, result); | ||||
|     setobjs2s(L, p3, --L->top); | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| int luaT_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 (ttisnil(tm)) | ||||
|     tm = luaT_gettmbyobj(L, p2, event);  /* try second operand */ | ||||
|   if (ttisnil(tm)) return 0; | ||||
|   luaT_callTM(L, tm, p1, p2, res, 1); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, | ||||
|                     StkId res, TMS event) { | ||||
|   if (!luaT_callbinTM(L, p1, p2, res, event)) { | ||||
|     switch (event) { | ||||
|       case TM_CONCAT: | ||||
|         luaG_concaterror(L, p1, p2); | ||||
|       /* call never returns, but to avoid warnings: *//* FALLTHROUGH */ | ||||
|       case TM_BAND: case TM_BOR: case TM_BXOR: | ||||
|       case TM_SHL: case TM_SHR: case TM_BNOT: { | ||||
|         lua_Number dummy; | ||||
|         if (tonumber(p1, &dummy) && tonumber(p2, &dummy)) | ||||
|           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"); | ||||
|     } | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| int luaT_callorderTM (lua_State *L, const TValue *p1, const TValue *p2, | ||||
|                       TMS event) { | ||||
|   if (!luaT_callbinTM(L, p1, p2, L->top, event)) | ||||
|     return -1;  /* no metamethod */ | ||||
|   else | ||||
|     return !l_isfalse(L->top); | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										77
									
								
								Plugins/slua_unreal/External/lua/ltm.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										77
									
								
								Plugins/slua_unreal/External/lua/ltm.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,77 @@ | ||||
| /* | ||||
| ** $Id: ltm.h,v 2.22 2016/02/26 19:20:15 roberto Exp $ | ||||
| ** Tag methods | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #ifndef ltm_h | ||||
| #define ltm_h | ||||
|  | ||||
|  | ||||
| #include "lobject.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* | ||||
| * 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_N		/* number of elements in the enum */ | ||||
| } TMS; | ||||
|  | ||||
|  | ||||
|  | ||||
| #define gfasttm(g,et,e) ((et) == NULL ? NULL : \ | ||||
|   ((et)->flags & (1u<<(e))) ? NULL : luaT_gettm(et, e, (g)->tmname[e])) | ||||
|  | ||||
| #define fasttm(l,et,e)	gfasttm(G(l), et, e) | ||||
|  | ||||
| #define ttypename(x)	luaT_typenames_[(x) + 1] | ||||
|  | ||||
| LUAI_DDEC const char *const luaT_typenames_[LUA_TOTALTAGS]; | ||||
|  | ||||
|  | ||||
| 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, TValue *p3, int hasres); | ||||
| LUAI_FUNC int luaT_callbinTM (lua_State *L, const TValue *p1, const TValue *p2, | ||||
|                               StkId res, TMS event); | ||||
| LUAI_FUNC void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, | ||||
|                               StkId res, TMS event); | ||||
| LUAI_FUNC int luaT_callorderTM (lua_State *L, const TValue *p1, | ||||
|                                 const TValue *p2, TMS event); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										488
									
								
								Plugins/slua_unreal/External/lua/lua.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										488
									
								
								Plugins/slua_unreal/External/lua/lua.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,488 @@ | ||||
| /* | ||||
| ** $Id: lua.h,v 1.332 2016/12/22 15:51:20 roberto Exp $ | ||||
| ** Lua - A Scripting Language | ||||
| ** Lua.org, PUC-Rio, Brazil (http://www.lua.org) | ||||
| ** See Copyright Notice at the end of this file | ||||
| */ | ||||
|  | ||||
|  | ||||
| #ifndef lua_h | ||||
| #define lua_h | ||||
|  | ||||
| #include <stdarg.h> | ||||
| #include <stddef.h> | ||||
|  | ||||
| #include "luaconf.h" | ||||
|  | ||||
| #define LUA_VERSION_MAJOR	"5" | ||||
| #define LUA_VERSION_MINOR	"3" | ||||
| #define LUA_VERSION_NUM		503 | ||||
| #define LUA_VERSION_RELEASE	"4" | ||||
|  | ||||
| #define LUA_VERSION	"Lua " LUA_VERSION_MAJOR "." LUA_VERSION_MINOR | ||||
| #define LUA_RELEASE	LUA_VERSION "." LUA_VERSION_RELEASE | ||||
| #define LUA_COPYRIGHT	LUA_RELEASE "  Copyright (C) 1994-2017 Lua.org, PUC-Rio" | ||||
| #define LUA_AUTHORS	"R. Ierusalimschy, L. H. de Figueiredo, W. Celes" | ||||
|  | ||||
|  | ||||
| /* mark for precompiled code ('<esc>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_ERRGCMM	5 | ||||
| #define LUA_ERRERR	6 | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| 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_NUMTAGS		9 | ||||
|  | ||||
|  | ||||
|  | ||||
| /* minimum Lua stack available to a C function */ | ||||
| #define LUA_MINSTACK	20 | ||||
|  | ||||
|  | ||||
| /* predefined values in the registry */ | ||||
| #define LUA_RIDX_MAINTHREAD	1 | ||||
| #define LUA_RIDX_GLOBALS	2 | ||||
| #define LUA_RIDX_LAST		LUA_RIDX_GLOBALS | ||||
|  | ||||
|  | ||||
| /* 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); | ||||
|  | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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); | ||||
| LUA_API void       (lua_close) (lua_State *L); | ||||
| LUA_API lua_State *(lua_newthread) (lua_State *L); | ||||
|  | ||||
| LUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf); | ||||
|  | ||||
| LUA_API const lua_Number *(lua_version) (lua_State *L); | ||||
|  | ||||
| LUA_API void (lua_setonlyluac)(lua_State *L, int v); | ||||
|  | ||||
| /* | ||||
| ** 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 size_t          (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_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, int narr, int nrec); | ||||
| LUA_API void *(lua_newuserdata) (lua_State *L, size_t sz); | ||||
| LUA_API int   (lua_getmetatable) (lua_State *L, int objindex); | ||||
| LUA_API int  (lua_getuservalue) (lua_State *L, int idx); | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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 void  (lua_setuservalue) (lua_State *L, int idx); | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** '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); | ||||
|  | ||||
| #ifdef _LUAC | ||||
| LUA_API int (lua_dump) (lua_State *L, lua_Writer writer, void *data, int strip); | ||||
| #endif // end _LUAC | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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); | ||||
| 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) | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** garbage-collection function and 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_GCSETPAUSE		6 | ||||
| #define LUA_GCSETSTEPMUL	7 | ||||
| #define LUA_GCISRUNNING		9 | ||||
|  | ||||
| LUA_API int (lua_gc) (lua_State *L, int what, int data); | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** 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); | ||||
|  | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** {============================================================== | ||||
| ** 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 for unsigned conversions | ||||
| ** =============================================================== | ||||
| */ | ||||
| #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 | ||||
| /* }============================================================== */ | ||||
|  | ||||
| /* | ||||
| ** {====================================================================== | ||||
| ** 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) | ||||
|  | ||||
| typedef struct lua_Debug lua_Debug;  /* activation record */ | ||||
|  | ||||
|  | ||||
| /* Functions to be called by the debugger in specific events */ | ||||
| typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar); | ||||
|  | ||||
|  | ||||
| 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) */ | ||||
|   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) */ | ||||
|   char short_src[LUA_IDSIZE]; /* (S) */ | ||||
|   /* private part */ | ||||
|   struct CallInfo *i_ci;  /* active function */ | ||||
| }; | ||||
|  | ||||
| /* }====================================================================== */ | ||||
|  | ||||
|  | ||||
| /****************************************************************************** | ||||
| * Copyright (C) 1994-2017 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. | ||||
| ******************************************************************************/ | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										11
									
								
								Plugins/slua_unreal/External/lua/lua.hpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										11
									
								
								Plugins/slua_unreal/External/lua/lua.hpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,11 @@ | ||||
| // lua.hpp | ||||
| // Lua header files for C++ | ||||
| // <<extern "C">> not supplied automatically because Lua also compiles as C++ | ||||
| #ifndef lua_hpp | ||||
| #define lua_hpp | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lualib.h" | ||||
| #include "lauxlib.h" | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										449
									
								
								Plugins/slua_unreal/External/lua/luac.c
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										449
									
								
								Plugins/slua_unreal/External/lua/luac.c
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,449 @@ | ||||
| /* | ||||
| ** $Id: luac.c,v 1.75 2015/03/12 01:58:27 lhf Exp $ | ||||
| ** 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 <ctype.h> | ||||
| #include <errno.h> | ||||
| #include <stdio.h> | ||||
| #include <stdlib.h> | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
|  | ||||
| #include "lobject.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 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; i<argc; i++) | ||||
|  { | ||||
|   if (*argv[i]!='-')			/* end of options; keep it */ | ||||
|    break; | ||||
|   else if (IS("--"))			/* end of options; skip it */ | ||||
|   { | ||||
|    ++i; | ||||
|    if (version) ++version; | ||||
|    break; | ||||
|   } | ||||
|   else if (IS("-"))			/* end of options; use stdin */ | ||||
|    break; | ||||
|   else if (IS("-l"))			/* list */ | ||||
|    ++listing; | ||||
|   else if (IS("-o"))			/* output file */ | ||||
|   { | ||||
|    output=argv[++i]; | ||||
|    if (output==NULL || *output==0 || (*output=='-' && output[1]!=0)) | ||||
|     usage("'-o' needs argument"); | ||||
|    if (IS("-")) output=NULL; | ||||
|   } | ||||
|   else if (IS("-p"))			/* parse only */ | ||||
|    dumping=0; | ||||
|   else if (IS("-s"))			/* strip debug information */ | ||||
|    stripping=1; | ||||
|   else if (IS("-v"))			/* show version */ | ||||
|    ++version; | ||||
|   else					/* unknown option */ | ||||
|    usage(argv[i]); | ||||
|  } | ||||
|  if (i==argc && (listing || !dumping)) | ||||
|  { | ||||
|   dumping=0; | ||||
|   argv[--i]=Output; | ||||
|  } | ||||
|  if (version) | ||||
|  { | ||||
|   printf("%s\n",LUA_COPYRIGHT); | ||||
|   if (version==argc-1) exit(EXIT_SUCCESS); | ||||
|  } | ||||
|  return i; | ||||
| } | ||||
|  | ||||
| #define FUNCTION "(function()end)();" | ||||
|  | ||||
| static const char* reader(lua_State *L, void *ud, size_t *size) | ||||
| { | ||||
|  UNUSED(L); | ||||
|  if ((*(int*)ud)--) | ||||
|  { | ||||
|   *size=sizeof(FUNCTION)-1; | ||||
|   return FUNCTION; | ||||
|  } | ||||
|  else | ||||
|  { | ||||
|   *size=0; | ||||
|   return NULL; | ||||
|  } | ||||
| } | ||||
|  | ||||
| #define toproto(L,i) getproto(L->top+(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; i<n; i++) | ||||
|   { | ||||
|    f->p[i]=toproto(L,i-n-1); | ||||
|    if (f->p[i]->sizeupvalues>0) f->p[i]->upvalues[0].instack=0; | ||||
|   } | ||||
|   f->sizelineinfo=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; | ||||
|  if (!lua_checkstack(L,argc)) fatal("too many input files"); | ||||
|  for (i=0; i<argc; i++) | ||||
|  { | ||||
|   const char* filename=IS("-") ? NULL : argv[i]; | ||||
|   if (luaL_loadfile(L,filename)!=LUA_OK) fatal(lua_tostring(L,-1)); | ||||
|  } | ||||
|  f=combine(L,argc); | ||||
|  if (listing) luaU_print(f,listing>1); | ||||
|  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; | ||||
| } | ||||
|  | ||||
| /* | ||||
| ** $Id: luac.c,v 1.75 2015/03/12 01:58:27 lhf Exp $ | ||||
| ** print bytecodes | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #include <ctype.h> | ||||
| #include <stdio.h> | ||||
|  | ||||
| #define luac_c | ||||
| #define LUA_CORE | ||||
|  | ||||
| #include "ldebug.h" | ||||
| #include "lobject.h" | ||||
| #include "lopcodes.h" | ||||
|  | ||||
| #define VOID(p)		((const void*)(p)) | ||||
|  | ||||
| static void PrintString(const TString* ts) | ||||
| { | ||||
|  const char* s=getstr(ts); | ||||
|  size_t i,n=tsslen(ts); | ||||
|  printf("%c",'"'); | ||||
|  for (i=0; i<n; i++) | ||||
|  { | ||||
|   int c=(int)(unsigned char)s[i]; | ||||
|   switch (c) | ||||
|   { | ||||
|    case '"':  printf("\\\""); break; | ||||
|    case '\\': printf("\\\\"); break; | ||||
|    case '\a': printf("\\a"); break; | ||||
|    case '\b': printf("\\b"); break; | ||||
|    case '\f': printf("\\f"); break; | ||||
|    case '\n': printf("\\n"); break; | ||||
|    case '\r': printf("\\r"); break; | ||||
|    case '\t': printf("\\t"); break; | ||||
|    case '\v': printf("\\v"); break; | ||||
|    default:	if (isprint(c)) | ||||
|    			printf("%c",c); | ||||
| 		else | ||||
| 			printf("\\%03d",c); | ||||
|   } | ||||
|  } | ||||
|  printf("%c",'"'); | ||||
| } | ||||
|  | ||||
| static void PrintConstant(const Proto* f, int i) | ||||
| { | ||||
|  const TValue* o=&f->k[i]; | ||||
|  switch (ttype(o)) | ||||
|  { | ||||
|   case LUA_TNIL: | ||||
| 	printf("nil"); | ||||
| 	break; | ||||
|   case LUA_TBOOLEAN: | ||||
| 	printf(bvalue(o) ? "true" : "false"); | ||||
| 	break; | ||||
|   case LUA_TNUMFLT: | ||||
| 	{ | ||||
| 	char buff[100]; | ||||
| 	sprintf(buff,LUA_NUMBER_FMT,fltvalue(o)); | ||||
| 	printf("%s",buff); | ||||
| 	if (buff[strspn(buff,"-0123456789")]=='\0') printf(".0"); | ||||
| 	break; | ||||
| 	} | ||||
|   case LUA_TNUMINT: | ||||
| 	printf(LUA_INTEGER_FMT,ivalue(o)); | ||||
| 	break; | ||||
|   case LUA_TSHRSTR: case LUA_TLNGSTR: | ||||
| 	PrintString(tsvalue(o)); | ||||
| 	break; | ||||
|   default:				/* cannot happen */ | ||||
| 	printf("? type=%d",ttype(o)); | ||||
| 	break; | ||||
|  } | ||||
| } | ||||
|  | ||||
| #define UPVALNAME(x) ((f->upvalues[x].name) ? getstr(f->upvalues[x].name) : "-") | ||||
| #define MYK(x)		(-1-(x)) | ||||
|  | ||||
| static void PrintCode(const Proto* f) | ||||
| { | ||||
|  const Instruction* code=f->code; | ||||
|  int pc,n=f->sizecode; | ||||
|  for (pc=0; pc<n; pc++) | ||||
|  { | ||||
|   Instruction i=code[pc]; | ||||
|   OpCode o=GET_OPCODE(i); | ||||
|   int a=GETARG_A(i); | ||||
|   int b=GETARG_B(i); | ||||
|   int c=GETARG_C(i); | ||||
|   int ax=GETARG_Ax(i); | ||||
|   int bx=GETARG_Bx(i); | ||||
|   int sbx=GETARG_sBx(i); | ||||
|   int line=getfuncline(f,pc); | ||||
|   printf("\t%d\t",pc+1); | ||||
|   if (line>0) printf("[%d]\t",line); else printf("[-]\t"); | ||||
|   printf("%-9s\t",luaP_opnames[o]); | ||||
|   switch (getOpMode(o)) | ||||
|   { | ||||
|    case iABC: | ||||
|     printf("%d",a); | ||||
|     if (getBMode(o)!=OpArgN) printf(" %d",ISK(b) ? (MYK(INDEXK(b))) : b); | ||||
|     if (getCMode(o)!=OpArgN) printf(" %d",ISK(c) ? (MYK(INDEXK(c))) : c); | ||||
|     break; | ||||
|    case iABx: | ||||
|     printf("%d",a); | ||||
|     if (getBMode(o)==OpArgK) printf(" %d",MYK(bx)); | ||||
|     if (getBMode(o)==OpArgU) printf(" %d",bx); | ||||
|     break; | ||||
|    case iAsBx: | ||||
|     printf("%d %d",a,sbx); | ||||
|     break; | ||||
|    case iAx: | ||||
|     printf("%d",MYK(ax)); | ||||
|     break; | ||||
|   } | ||||
|   switch (o) | ||||
|   { | ||||
|    case OP_LOADK: | ||||
|     printf("\t; "); PrintConstant(f,bx); | ||||
|     break; | ||||
|    case OP_GETUPVAL: | ||||
|    case OP_SETUPVAL: | ||||
|     printf("\t; %s",UPVALNAME(b)); | ||||
|     break; | ||||
|    case OP_GETTABUP: | ||||
|     printf("\t; %s",UPVALNAME(b)); | ||||
|     if (ISK(c)) { printf(" "); PrintConstant(f,INDEXK(c)); } | ||||
|     break; | ||||
|    case OP_SETTABUP: | ||||
|     printf("\t; %s",UPVALNAME(a)); | ||||
|     if (ISK(b)) { printf(" "); PrintConstant(f,INDEXK(b)); } | ||||
|     if (ISK(c)) { printf(" "); PrintConstant(f,INDEXK(c)); } | ||||
|     break; | ||||
|    case OP_GETTABLE: | ||||
|    case OP_SELF: | ||||
|     if (ISK(c)) { printf("\t; "); PrintConstant(f,INDEXK(c)); } | ||||
|     break; | ||||
|    case OP_SETTABLE: | ||||
|    case OP_ADD: | ||||
|    case OP_SUB: | ||||
|    case OP_MUL: | ||||
|    case OP_POW: | ||||
|    case OP_DIV: | ||||
|    case OP_IDIV: | ||||
|    case OP_BAND: | ||||
|    case OP_BOR: | ||||
|    case OP_BXOR: | ||||
|    case OP_SHL: | ||||
|    case OP_SHR: | ||||
|    case OP_EQ: | ||||
|    case OP_LT: | ||||
|    case OP_LE: | ||||
|     if (ISK(b) || ISK(c)) | ||||
|     { | ||||
|      printf("\t; "); | ||||
|      if (ISK(b)) PrintConstant(f,INDEXK(b)); else printf("-"); | ||||
|      printf(" "); | ||||
|      if (ISK(c)) PrintConstant(f,INDEXK(c)); else printf("-"); | ||||
|     } | ||||
|     break; | ||||
|    case OP_JMP: | ||||
|    case OP_FORLOOP: | ||||
|    case OP_FORPREP: | ||||
|    case OP_TFORLOOP: | ||||
|     printf("\t; to %d",sbx+pc+2); | ||||
|     break; | ||||
|    case OP_CLOSURE: | ||||
|     printf("\t; %p",VOID(f->p[bx])); | ||||
|     break; | ||||
|    case OP_SETLIST: | ||||
|     if (c==0) printf("\t; %d",(int)code[++pc]); else printf("\t; %d",c); | ||||
|     break; | ||||
|    case OP_EXTRAARG: | ||||
|     printf("\t; "); PrintConstant(f,ax); | ||||
|     break; | ||||
|    default: | ||||
|     break; | ||||
|   } | ||||
|   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; i<n; i++) | ||||
|  { | ||||
|   printf("\t%d\t",i+1); | ||||
|   PrintConstant(f,i); | ||||
|   printf("\n"); | ||||
|  } | ||||
|  n=f->sizelocvars; | ||||
|  printf("locals (%d) for %p:\n",n,VOID(f)); | ||||
|  for (i=0; i<n; i++) | ||||
|  { | ||||
|   printf("\t%d\t%s\t%d\t%d\n", | ||||
|   i,getstr(f->locvars[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; i<n; i++) | ||||
|  { | ||||
|   printf("\t%d\t%s\t%d\t%d\n", | ||||
|   i,UPVALNAME(i),f->upvalues[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; i<n; i++) PrintFunction(f->p[i],full); | ||||
| } | ||||
							
								
								
									
										786
									
								
								Plugins/slua_unreal/External/lua/luaconf.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										786
									
								
								Plugins/slua_unreal/External/lua/luaconf.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,786 @@ | ||||
| /* | ||||
| ** $Id: luaconf.h,v 1.259 2016/12/22 13:08:50 roberto Exp $ | ||||
| ** Configuration file for Lua | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
|  | ||||
| #ifndef luaconf_h | ||||
| #define luaconf_h | ||||
|  | ||||
| #include <limits.h> | ||||
| #include <stddef.h> | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** =================================================================== | ||||
| ** Search for "@@" to find all configurable definitions. | ||||
| ** =================================================================== | ||||
| */ | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** {==================================================================== | ||||
| ** System Configuration: macros to adapt (if needed) Lua to some | ||||
| ** particular platform, for instance compiling it with 32-bit numbers or | ||||
| ** restricting it to C89. | ||||
| ** ===================================================================== | ||||
| */ | ||||
|  | ||||
| /* | ||||
| @@ LUA_32BITS enables Lua with 32-bit integers and 32-bit floats. You | ||||
| ** can also define LUA_32BITS in the make file, but changing here you | ||||
| ** ensure that all software connected to Lua will be compiled with the | ||||
| ** same configuration. | ||||
| */ | ||||
| /* #define LUA_32BITS */ | ||||
|  | ||||
|  | ||||
| /* | ||||
| @@ 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 */ | ||||
| #define LUA_USE_READLINE	/* needs some extra libraries */ | ||||
| #endif | ||||
|  | ||||
|  | ||||
| #if defined(LUA_USE_MACOSX) | ||||
| #define LUA_USE_POSIX | ||||
| #define LUA_USE_DLOPEN		/* MacOS does not need -ldl */ | ||||
| #define LUA_USE_READLINE	/* needs an extra library: -lreadline */ | ||||
| #endif | ||||
|  | ||||
|  | ||||
| /* | ||||
| @@ 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 | ||||
| #endif | ||||
|  | ||||
|  | ||||
|  | ||||
| /* | ||||
| @@ LUAI_BITSINT defines the (minimum) number of bits in an 'int'. | ||||
| */ | ||||
| /* avoid undefined shifts */ | ||||
| #if ((INT_MAX >> 15) >> 15) >= 1 | ||||
| #define LUAI_BITSINT	32 | ||||
| #else | ||||
| /* 'int' always must have at least 16 bits */ | ||||
| #define LUAI_BITSINT	16 | ||||
| #endif | ||||
|  | ||||
|  | ||||
| /* | ||||
| @@ 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 (if 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 | ||||
|  | ||||
| #if defined(LUA_32BITS)		/* { */ | ||||
| /* | ||||
| ** 32-bit integers and 'float' | ||||
| */ | ||||
| #if LUAI_BITSINT >= 32  /* 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 defined(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 | ||||
|  | ||||
| #endif				/* } */ | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** default configuration for 64-bit Lua ('long long' and 'double') | ||||
| */ | ||||
| #if !defined(LUA_INT_TYPE) | ||||
| #define LUA_INT_TYPE	LUA_INT_LONGLONG | ||||
| #endif | ||||
|  | ||||
| #if !defined(LUA_FLOAT_TYPE) | ||||
| #define LUA_FLOAT_TYPE	LUA_FLOAT_DOUBLE | ||||
| #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 "\\" | ||||
| #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" | ||||
| #define LUA_CPATH_DEFAULT \ | ||||
| 		LUA_CDIR"?.dll;" \ | ||||
| 		LUA_CDIR"..\\lib\\lua\\" LUA_VDIR "\\?.dll;" \ | ||||
| 		LUA_CDIR"loadall.dll;" ".\\?.dll" | ||||
|  | ||||
| #else			/* }{ */ | ||||
|  | ||||
| #define LUA_ROOT	"/usr/local/" | ||||
| #define LUA_LDIR	LUA_ROOT "share/lua/" LUA_VDIR "/" | ||||
| #define LUA_CDIR	LUA_ROOT "lib/lua/" LUA_VDIR "/" | ||||
| #define LUA_PATH_DEFAULT  \ | ||||
| 		LUA_LDIR"?.lua;"  LUA_LDIR"?/init.lua;" \ | ||||
| 		LUA_CDIR"?.lua;"  LUA_CDIR"?/init.lua;" \ | ||||
| 		"./?.lua;" "./?/init.lua" | ||||
| #define LUA_CPATH_DEFAULT \ | ||||
| 		LUA_CDIR"?.so;" LUA_CDIR"loadall.so;" "./?.so" | ||||
| #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(_WIN32) | ||||
| #define LUA_DIRSEP	"\\" | ||||
| #else | ||||
| #define LUA_DIRSEP	"/" | ||||
| #endif | ||||
|  | ||||
| /* }================================================================== */ | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** {================================================================== | ||||
| ** 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				/* } */ | ||||
|  | ||||
| #if defined(_WIN32) | ||||
| #undef LUA_API | ||||
| #define LUA_API extern "C" __declspec(dllexport) | ||||
| #endif | ||||
|  | ||||
| /* more often than not the libs go together with the core */ | ||||
| #define LUALIB_API	LUA_API | ||||
| #define LUAMOD_API	LUALIB_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 | ||||
| ** that are not 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("hidden"))) extern | ||||
| #else				/* }{ */ | ||||
| #define LUAI_FUNC	extern | ||||
| #endif				/* } */ | ||||
|  | ||||
| #define LUAI_DDEC	LUAI_FUNC | ||||
| #define LUAI_DDEF	/* empty */ | ||||
|  | ||||
| /* }================================================================== */ | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** {================================================================== | ||||
| ** Compatibility with previous versions | ||||
| ** =================================================================== | ||||
| */ | ||||
|  | ||||
| /* | ||||
| @@ LUA_COMPAT_5_2 controls other macros for compatibility with Lua 5.2. | ||||
| @@ LUA_COMPAT_5_1 controls other macros for compatibility with Lua 5.1. | ||||
| ** You can define it to get all options, or change specific options | ||||
| ** to fit your specific needs. | ||||
| */ | ||||
| #if defined(LUA_COMPAT_5_2)	/* { */ | ||||
|  | ||||
| /* | ||||
| @@ LUA_COMPAT_MATHLIB controls the presence of several deprecated | ||||
| ** functions in the mathematical library. | ||||
| */ | ||||
| #define LUA_COMPAT_MATHLIB | ||||
|  | ||||
| /* | ||||
| @@ LUA_COMPAT_BITLIB controls the presence of library 'bit32'. | ||||
| */ | ||||
| #define LUA_COMPAT_BITLIB | ||||
|  | ||||
| /* | ||||
| @@ LUA_COMPAT_IPAIRS controls the effectiveness of the __ipairs metamethod. | ||||
| */ | ||||
| #define LUA_COMPAT_IPAIRS | ||||
|  | ||||
| /* | ||||
| @@ LUA_COMPAT_APIINTCASTS controls the presence of macros for | ||||
| ** manipulating other integer types (lua_pushunsigned, lua_tounsigned, | ||||
| ** luaL_checkint, luaL_checklong, etc.) | ||||
| */ | ||||
| #define LUA_COMPAT_APIINTCASTS | ||||
|  | ||||
| #endif				/* } */ | ||||
|  | ||||
|  | ||||
| #if defined(LUA_COMPAT_5_1)	/* { */ | ||||
|  | ||||
| /* Incompatibilities from 5.2 -> 5.3 */ | ||||
| #define LUA_COMPAT_MATHLIB | ||||
| #define LUA_COMPAT_APIINTCASTS | ||||
|  | ||||
| /* | ||||
| @@ LUA_COMPAT_UNPACK controls the presence of global 'unpack'. | ||||
| ** You can replace it with 'table.unpack'. | ||||
| */ | ||||
| #define LUA_COMPAT_UNPACK | ||||
|  | ||||
| /* | ||||
| @@ LUA_COMPAT_LOADERS controls the presence of table 'package.loaders'. | ||||
| ** You can replace it with 'package.searchers'. | ||||
| */ | ||||
| #define LUA_COMPAT_LOADERS | ||||
|  | ||||
| /* | ||||
| @@ macro 'lua_cpcall' emulates deprecated function lua_cpcall. | ||||
| ** You can call your C function directly (with light C functions). | ||||
| */ | ||||
| #define lua_cpcall(L,f,u)  \ | ||||
| 	(lua_pushcfunction(L, (f)), \ | ||||
| 	 lua_pushlightuserdata(L,(u)), \ | ||||
| 	 lua_pcall(L,1,0,0)) | ||||
|  | ||||
|  | ||||
| /* | ||||
| @@ LUA_COMPAT_LOG10 defines the function 'log10' in the math library. | ||||
| ** You can rewrite 'log10(x)' as 'log(x, 10)'. | ||||
| */ | ||||
| #define LUA_COMPAT_LOG10 | ||||
|  | ||||
| /* | ||||
| @@ LUA_COMPAT_LOADSTRING defines the function 'loadstring' in the base | ||||
| ** library. You can rewrite 'loadstring(s)' as 'load(s)'. | ||||
| */ | ||||
| #define LUA_COMPAT_LOADSTRING | ||||
|  | ||||
| /* | ||||
| @@ LUA_COMPAT_MAXN defines the function 'maxn' in the table library. | ||||
| */ | ||||
| #define LUA_COMPAT_MAXN | ||||
|  | ||||
| /* | ||||
| @@ 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. | ||||
| */ | ||||
| #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) | ||||
|  | ||||
| /* | ||||
| @@ LUA_COMPAT_MODULE controls compatibility with previous | ||||
| ** module functions 'module' (Lua) and 'luaL_register' (C). | ||||
| */ | ||||
| #define LUA_COMPAT_MODULE | ||||
|  | ||||
| #endif				/* } */ | ||||
|  | ||||
|  | ||||
| /* | ||||
| @@ LUA_COMPAT_FLOATSTRING makes Lua format integral floats without a | ||||
| @@ a float mark ('.0'). | ||||
| ** This macro is not on by default even in compatibility mode, | ||||
| ** because this is not really an incompatibility. | ||||
| */ | ||||
| /* #define LUA_COMPAT_FLOATSTRING */ | ||||
|  | ||||
| /* }================================================================== */ | ||||
|  | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** {================================================================== | ||||
| ** Configuration for Numbers. | ||||
| ** Change these definitions if no predefined LUA_FLOAT_* / LUA_INT_* | ||||
| ** satisfy your needs. | ||||
| ** =================================================================== | ||||
| */ | ||||
|  | ||||
| /* | ||||
| @@ LUA_NUMBER is the floating-point type used by Lua. | ||||
| @@ LUAI_UACNUMBER is the result of a 'default argument promotion' | ||||
| @@ over a floating number. | ||||
| @@ l_mathlim(x) corrects limit name '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 numeric string to a number. | ||||
| */ | ||||
|  | ||||
|  | ||||
| /* The following definitions are good for most cases here */ | ||||
|  | ||||
| #define l_floor(x)		(l_mathop(floor)(x)) | ||||
|  | ||||
| #define lua_number2str(s,sz,n)  \ | ||||
| 	l_sprintf((s), sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)(n)) | ||||
|  | ||||
| /* | ||||
| @@ lua_numbertointeger converts a float number 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_mathlim(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_mathlim(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_mathlim(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_INTEGER is the integer type used by Lua. | ||||
| ** | ||||
| @@ 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_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 | ||||
|  | ||||
| #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 | ||||
|  | ||||
| #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 | ||||
|  | ||||
| #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 | ||||
|  | ||||
| #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), snprintf(s,sz,f,i)) | ||||
| #endif | ||||
|  | ||||
|  | ||||
| /* | ||||
| @@ lua_strx2number converts an hexadecimal numeric string 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_number2strx converts a float to an hexadecimal numeric string. | ||||
| ** 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 <stdint.h> | ||||
| #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 header 'locale.h'.) | ||||
| */ | ||||
| #if !defined(lua_getlocaledecpoint) | ||||
| //#define lua_getlocaledecpoint()		(localeconv()->decimal_point[0]) | ||||
| #define lua_getlocaledecpoint() ('.') | ||||
| #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 <assert.h> | ||||
| #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). You probably do not want/need to change them. | ||||
| ** ===================================================================== | ||||
| */ | ||||
|  | ||||
| /* | ||||
| @@ 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). | ||||
| */ | ||||
| #if LUAI_BITSINT >= 32 | ||||
| #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 buffer size used by the lauxlib buffer system. | ||||
| ** CHANGE it if it uses too much C-stack space. (For long double, | ||||
| ** 'string.format("%.99f", -1e4932)' needs 5034 bytes, so a | ||||
| ** smaller buffer would force a memory allocation for each call to | ||||
| ** 'string.format'.) | ||||
| */ | ||||
| #if LUA_FLOAT_TYPE == LUA_FLOAT_LONGDOUBLE | ||||
| #define LUAL_BUFFERSIZE		8192 | ||||
| #else | ||||
| #define LUAL_BUFFERSIZE   ((int)(0x80 * sizeof(void*) * sizeof(lua_Integer))) | ||||
| #endif | ||||
|  | ||||
| /* }================================================================== */ | ||||
|  | ||||
|  | ||||
| /* | ||||
| @@ LUA_QL describes how error messages quote program elements. | ||||
| ** Lua does not use these macros anymore; they are here for | ||||
| ** compatibility only. | ||||
| */ | ||||
| #define LUA_QL(x)	"'" x "'" | ||||
| #define LUA_QS		LUA_QL("%s") | ||||
|  | ||||
|  | ||||
| #define NS_SLUA slua | ||||
|  | ||||
| /* =================================================================== */ | ||||
|  | ||||
| /* | ||||
| ** Local configuration. You can use this space to add your redefinitions | ||||
| ** without modifying the main part of the file. | ||||
| */ | ||||
|  | ||||
| #endif | ||||
|  | ||||
|  | ||||
|  | ||||
|  | ||||
							
								
								
									
										63
									
								
								Plugins/slua_unreal/External/lua/lualib.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										63
									
								
								Plugins/slua_unreal/External/lua/lualib.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,63 @@ | ||||
| /* | ||||
| ** $Id: lualib.h,v 1.45 2017/01/12 17:14:26 roberto Exp $ | ||||
| ** Lua standard libraries | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
|  | ||||
| #ifndef lualib_h | ||||
| #define lualib_h | ||||
|  | ||||
| #include "lua.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* version suffix for environment variable names */ | ||||
| #define LUA_VERSUFFIX          "_" LUA_VERSION_MAJOR "_" LUA_VERSION_MINOR | ||||
|  | ||||
|  | ||||
| LUAMOD_API int (luaopen_base) (lua_State *L); | ||||
|  | ||||
| #define LUA_COLIBNAME	"coroutine" | ||||
| LUAMOD_API int (luaopen_coroutine) (lua_State *L); | ||||
|  | ||||
| #define LUA_TABLIBNAME	"table" | ||||
| LUAMOD_API int (luaopen_table) (lua_State *L); | ||||
|  | ||||
| #define LUA_IOLIBNAME	"io" | ||||
| LUAMOD_API int (luaopen_io) (lua_State *L); | ||||
|  | ||||
| #define LUA_OSLIBNAME	"os" | ||||
| LUAMOD_API int (luaopen_os) (lua_State *L); | ||||
|  | ||||
| #define LUA_STRLIBNAME	"string" | ||||
| LUAMOD_API int (luaopen_string) (lua_State *L); | ||||
|  | ||||
| #define LUA_UTF8LIBNAME	"utf8" | ||||
| LUAMOD_API int (luaopen_utf8) (lua_State *L); | ||||
|  | ||||
| #define LUA_BITLIBNAME	"bit32" | ||||
| LUAMOD_API int (luaopen_bit32) (lua_State *L); | ||||
|  | ||||
| #define LUA_MATHLIBNAME	"math" | ||||
| LUAMOD_API int (luaopen_math) (lua_State *L); | ||||
|  | ||||
| #define LUA_DBLIBNAME	"debug" | ||||
| LUAMOD_API int (luaopen_debug) (lua_State *L); | ||||
|  | ||||
| #define LUA_LOADLIBNAME	"package" | ||||
| LUAMOD_API int (luaopen_package) (lua_State *L); | ||||
|  | ||||
|  | ||||
| /* open all previous libraries */ | ||||
| LUALIB_API void (luaL_openlibs) (lua_State *L); | ||||
|  | ||||
|  | ||||
|  | ||||
| #if !defined(lua_assert) | ||||
| #define lua_assert(x)	((void)0) | ||||
| #endif | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										279
									
								
								Plugins/slua_unreal/External/lua/lundump.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										279
									
								
								Plugins/slua_unreal/External/lua/lundump.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,279 @@ | ||||
| /* | ||||
| ** $Id: lundump.c,v 2.44 2015/11/02 16:09:30 roberto Exp $ | ||||
| ** load precompiled Lua chunks | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define lundump_c | ||||
| #define LUA_CORE | ||||
|  | ||||
| #include "lundump.h" | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "ldebug.h" | ||||
| #include "ldo.h" | ||||
| #include "lfunc.h" | ||||
| #include "lmem.h" | ||||
| #include "lobject.h" | ||||
| #include "lstring.h" | ||||
| #include "lzio.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| #if !defined(luai_verifycode) | ||||
| #define luai_verifycode(L,b,f)  /* empty */ | ||||
| #endif | ||||
|  | ||||
|  | ||||
| typedef struct { | ||||
|   lua_State *L; | ||||
|   ZIO *Z; | ||||
|   const char *name; | ||||
| } LoadState; | ||||
|  | ||||
|  | ||||
| static l_noret error(LoadState *S, const char *why) { | ||||
|   luaO_pushfstring(S->L, "%s: %s precompiled chunk", 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) | ||||
|     error(S, "truncated"); | ||||
| } | ||||
|  | ||||
|  | ||||
| #define LoadVar(S,x)		LoadVector(S,&x,1) | ||||
|  | ||||
|  | ||||
| static lu_byte LoadByte (LoadState *S) { | ||||
|   lu_byte x; | ||||
|   LoadVar(S, x); | ||||
|   return x; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int LoadInt (LoadState *S) { | ||||
|   int x; | ||||
|   LoadVar(S, x); | ||||
|   return x; | ||||
| } | ||||
|  | ||||
|  | ||||
| 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 TString *LoadString (LoadState *S) { | ||||
|   int size = LoadByte(S); | ||||
|   if (size == 0xFF) | ||||
|     LoadVar(S, size); | ||||
|   if (size == 0) | ||||
|     return NULL; | ||||
|   else if (--size <= LUAI_MAXSHORTLEN) {  /* short string? */ | ||||
|     char buff[LUAI_MAXSHORTLEN]; | ||||
|     LoadVector(S, buff, size); | ||||
|     return luaS_newlstr(S->L, buff, size); | ||||
|   } | ||||
|   else {  /* long string */ | ||||
|     TString *ts = luaS_createlngstrobj(S->L, size); | ||||
|     LoadVector(S, getstr(ts), size);  /* load directly in final place */ | ||||
|     return ts; | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| static void LoadCode (LoadState *S, Proto *f) { | ||||
|   int n = LoadInt(S); | ||||
|   f->code = luaM_newvector(S->L, n, Instruction); | ||||
|   f->sizecode = n; | ||||
|   LoadVector(S, f->code, n); | ||||
| } | ||||
|  | ||||
|  | ||||
| static void LoadFunction(LoadState *S, Proto *f, TString *psource); | ||||
|  | ||||
|  | ||||
| static void LoadConstants (LoadState *S, Proto *f) { | ||||
|   int i; | ||||
|   int n = LoadInt(S); | ||||
|   f->k = luaM_newvector(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_TNIL: | ||||
|       setnilvalue(o); | ||||
|       break; | ||||
|     case LUA_TBOOLEAN: | ||||
|       setbvalue(o, LoadByte(S)); | ||||
|       break; | ||||
|     case LUA_TNUMFLT: | ||||
|       setfltvalue(o, LoadNumber(S)); | ||||
|       break; | ||||
|     case LUA_TNUMINT: | ||||
|       setivalue(o, LoadInteger(S)); | ||||
|       break; | ||||
|     case LUA_TSHRSTR: | ||||
|     case LUA_TLNGSTR: | ||||
|       setsvalue2n(S->L, o, LoadString(S)); | ||||
|       break; | ||||
|     default: | ||||
|       lua_assert(0); | ||||
|     } | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| static void LoadProtos (LoadState *S, Proto *f) { | ||||
|   int i; | ||||
|   int n = LoadInt(S); | ||||
|   f->p = luaM_newvector(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); | ||||
|     LoadFunction(S, f->p[i], f->source); | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| static void LoadUpvalues (LoadState *S, Proto *f) { | ||||
|   int i, n; | ||||
|   n = LoadInt(S); | ||||
|   f->upvalues = luaM_newvector(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); | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| static void LoadDebug (LoadState *S, Proto *f) { | ||||
|   int i, n; | ||||
|   n = LoadInt(S); | ||||
|   f->lineinfo = luaM_newvector(S->L, n, int); | ||||
|   f->sizelineinfo = n; | ||||
|   LoadVector(S, f->lineinfo, n); | ||||
|   n = LoadInt(S); | ||||
|   f->locvars = luaM_newvector(S->L, n, LocVar); | ||||
|   f->sizelocvars = n; | ||||
|   for (i = 0; i < n; i++) | ||||
|     f->locvars[i].varname = NULL; | ||||
|   for (i = 0; i < n; i++) { | ||||
|     f->locvars[i].varname = LoadString(S); | ||||
|     f->locvars[i].startpc = LoadInt(S); | ||||
|     f->locvars[i].endpc = LoadInt(S); | ||||
|   } | ||||
|   n = LoadInt(S); | ||||
|   for (i = 0; i < n; i++) | ||||
|     f->upvalues[i].name = LoadString(S); | ||||
| } | ||||
|  | ||||
|  | ||||
| static void LoadFunction (LoadState *S, Proto *f, TString *psource) { | ||||
|   f->source = LoadString(S); | ||||
|   if (f->source == NULL)  /* no source in dump? */ | ||||
|     f->source = psource;  /* reuse parent's source */ | ||||
|   f->linedefined = LoadInt(S); | ||||
|   f->lastlinedefined = LoadInt(S); | ||||
|   f->numparams = LoadByte(S); | ||||
|   f->is_vararg = LoadByte(S); | ||||
|   f->maxstacksize = LoadByte(S); | ||||
|   LoadCode(S, f); | ||||
|   LoadConstants(S, f); | ||||
|   LoadUpvalues(S, f); | ||||
|   LoadProtos(S, f); | ||||
|   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) | ||||
|     error(S, msg); | ||||
| } | ||||
|  | ||||
|  | ||||
| static void fchecksize (LoadState *S, size_t size, const char *tname) { | ||||
|   if (LoadByte(S) != size) | ||||
|     error(S, luaO_pushfstring(S->L, "%s size mismatch in", tname)); | ||||
| } | ||||
|  | ||||
|  | ||||
| #define checksize(S,t)	fchecksize(S,sizeof(t),#t) | ||||
|  | ||||
| static void checkHeader (LoadState *S) { | ||||
|   checkliteral(S, LUA_SIGNATURE + 1, "not a");  /* 1st char already checked */ | ||||
|   if (LoadByte(S) != LUAC_VERSION) | ||||
|     error(S, "version mismatch in"); | ||||
|   if (LoadByte(S) != LUAC_FORMAT) | ||||
|     error(S, "format mismatch in"); | ||||
|   checkliteral(S, LUAC_DATA, "corrupted"); | ||||
|   checksize(S, int); | ||||
|   checksize(S, int); | ||||
|   checksize(S, Instruction); | ||||
|   checksize(S, lua_Integer); | ||||
|   checksize(S, lua_Number); | ||||
|   if (LoadInteger(S) != LUAC_INT) | ||||
|     error(S, "endianness mismatch in"); | ||||
|   if (LoadNumber(S) != LUAC_NUM) | ||||
|     error(S, "float format mismatch in"); | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** load precompiled chunk | ||||
| */ | ||||
| LClosure *luaU_undump(lua_State *L, ZIO *Z, const char *name) { | ||||
|   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; | ||||
|   checkHeader(&S); | ||||
|   cl = luaF_newLclosure(L, LoadByte(&S)); | ||||
|   setclLvalue(L, L->top, cl); | ||||
|   luaD_inctop(L); | ||||
|   cl->p = luaF_newproto(L); | ||||
|   LoadFunction(&S, cl->p, NULL); | ||||
|   lua_assert(cl->nupvalues == cl->p->sizeupvalues); | ||||
|   luai_verifycode(L, buff, cl->p); | ||||
|   return cl; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										36
									
								
								Plugins/slua_unreal/External/lua/lundump.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										36
									
								
								Plugins/slua_unreal/External/lua/lundump.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,36 @@ | ||||
| /* | ||||
| ** $Id: lundump.h,v 1.45 2015/09/08 15:41:05 roberto Exp $ | ||||
| ** load precompiled Lua chunks | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #ifndef lundump_h | ||||
| #define lundump_h | ||||
|  | ||||
| #include "llimits.h" | ||||
| #include "lobject.h" | ||||
| #include "lzio.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* 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) | ||||
|  | ||||
| #define MYINT(s)	(s[0]-'0') | ||||
| #define LUAC_VERSION	(MYINT(LUA_VERSION_MAJOR)*16+MYINT(LUA_VERSION_MINOR)) | ||||
| #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); | ||||
|  | ||||
| #ifdef _LUAC | ||||
| /* 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 // end _LUAC | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										257
									
								
								Plugins/slua_unreal/External/lua/lutf8lib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										257
									
								
								Plugins/slua_unreal/External/lua/lutf8lib.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,257 @@ | ||||
| /* | ||||
| ** $Id: lutf8lib.c,v 1.16 2016/12/22 13:08:50 roberto Exp $ | ||||
| ** Standard library for UTF-8 manipulation | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define lutf8lib_c | ||||
| #define LUA_LIB | ||||
|  | ||||
| #include "lprefix.h" | ||||
|  | ||||
|  | ||||
| #include <assert.h> | ||||
| #include <limits.h> | ||||
| #include <stdlib.h> | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
| #include "lualib.h" | ||||
|  | ||||
| #define MAXUNICODE	0x10FFFF | ||||
|  | ||||
| #define iscont(p)	((*(p) & 0xC0) == 0x80) | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* 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. | ||||
| */ | ||||
| static const char *utf8_decode (const char *o, int *val) { | ||||
|   static const unsigned int limits[] = {0xFF, 0x7F, 0x7FF, 0xFFFF}; | ||||
|   const unsigned char *s = (const unsigned char *)o; | ||||
|   unsigned int c = s[0]; | ||||
|   unsigned int res = 0;  /* final result */ | ||||
|   if (c < 0x80)  /* ascii? */ | ||||
|     res = c; | ||||
|   else { | ||||
|     int count = 0;  /* to count number of continuation bytes */ | ||||
|     while (c & 0x40) {  /* still have continuation bytes? */ | ||||
|       int cc = s[++count];  /* read next byte */ | ||||
|       if ((cc & 0xC0) != 0x80)  /* not a continuation byte? */ | ||||
|         return NULL;  /* invalid byte sequence */ | ||||
|       res = (res << 6) | (cc & 0x3F);  /* add lower 6 bits from cont. byte */ | ||||
|       c <<= 1;  /* to test next bit */ | ||||
|     } | ||||
|     res |= ((c & 0x7F) << (count * 5));  /* add first byte */ | ||||
|     if (count > 3 || res > MAXUNICODE || res <= limits[count]) | ||||
|       return NULL;  /* invalid byte sequence */ | ||||
|     s += count;  /* skip continuation bytes read */ | ||||
|   } | ||||
|   if (val) *val = res; | ||||
|   return (const char *)s + 1;  /* +1 to include first byte */ | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** utf8len(s [, i [, j]]) --> 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) { | ||||
|   int 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); | ||||
|   luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 2, | ||||
|                    "initial position out of string"); | ||||
|   luaL_argcheck(L, --posj < (lua_Integer)len, 3, | ||||
|                    "final position out of string"); | ||||
|   while (posi <= posj) { | ||||
|     const char *s1 = utf8_decode(s + posi, NULL); | ||||
|     if (s1 == NULL) {  /* conversion error? */ | ||||
|       lua_pushnil(L);  /* return nil ... */ | ||||
|       lua_pushinteger(L, posi + 1);  /* ... and current position */ | ||||
|       return 2; | ||||
|     } | ||||
|     posi = s1 - s; | ||||
|     n++; | ||||
|   } | ||||
|   lua_pushinteger(L, n); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** codepoint(s, [i, [j]])  -> 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 n; | ||||
|   const char *se; | ||||
|   luaL_argcheck(L, posi >= 1, 2, "out of range"); | ||||
|   luaL_argcheck(L, pose <= (lua_Integer)len, 3, "out of range"); | ||||
|   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; | ||||
|   luaL_checkstack(L, n, "string slice too long"); | ||||
|   n = 0; | ||||
|   se = s + pose; | ||||
|   for (s += posi - 1; s < se;) { | ||||
|     int code; | ||||
|     s = utf8_decode(s, &code); | ||||
|     if (s == NULL) | ||||
|       return luaL_error(L, "invalid UTF-8 code"); | ||||
|     lua_pushinteger(L, code); | ||||
|     n++; | ||||
|   } | ||||
|   return n; | ||||
| } | ||||
|  | ||||
|  | ||||
| static void pushutfchar (lua_State *L, int arg) { | ||||
|   lua_Integer code = luaL_checkinteger(L, arg); | ||||
|   luaL_argcheck(L, 0 <= code && code <= MAXUNICODE, 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 range"); | ||||
|   if (n == 0) { | ||||
|     /* find beginning of current byte sequence */ | ||||
|     while (posi > 0 && iscont(s + posi)) posi--; | ||||
|   } | ||||
|   else { | ||||
|     if (iscont(s + posi)) | ||||
|       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 && iscont(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 (iscont(s + posi));  /* (cannot pass final '\0') */ | ||||
|          n--; | ||||
|        } | ||||
|      } | ||||
|   } | ||||
|   if (n == 0)  /* did it find given character? */ | ||||
|     lua_pushinteger(L, posi + 1); | ||||
|   else  /* no such character */ | ||||
|     lua_pushnil(L); | ||||
|   return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| static int iter_aux (lua_State *L) { | ||||
|   size_t len; | ||||
|   const char *s = luaL_checklstring(L, 1, &len); | ||||
|   lua_Integer n = lua_tointeger(L, 2) - 1; | ||||
|   if (n < 0)  /* first iteration? */ | ||||
|     n = 0;  /* start from here */ | ||||
|   else if (n < (lua_Integer)len) { | ||||
|     n++;  /* skip current byte */ | ||||
|     while (iscont(s + n)) n++;  /* and its continuations */ | ||||
|   } | ||||
|   if (n >= (lua_Integer)len) | ||||
|     return 0;  /* no more codepoints */ | ||||
|   else { | ||||
|     int code; | ||||
|     const char *next = utf8_decode(s + n, &code); | ||||
|     if (next == NULL || iscont(next)) | ||||
|       return luaL_error(L, "invalid UTF-8 code"); | ||||
|     lua_pushinteger(L, n + 1); | ||||
|     lua_pushinteger(L, code); | ||||
|     return 2; | ||||
|   } | ||||
| } | ||||
|  | ||||
|  | ||||
| static int iter_codes (lua_State *L) { | ||||
|   luaL_checkstring(L, 1); | ||||
|   lua_pushcfunction(L, iter_aux); | ||||
|   lua_pushvalue(L, 1); | ||||
|   lua_pushinteger(L, 0); | ||||
|   return 3; | ||||
| } | ||||
|  | ||||
|  | ||||
| /* pattern to match a single UTF-8 character */ | ||||
| #define UTF8PATT	"[\0-\x7F\xC2-\xF4][\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; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										1325
									
								
								Plugins/slua_unreal/External/lua/lvm.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										1325
									
								
								Plugins/slua_unreal/External/lua/lvm.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
										
											
												File diff suppressed because it is too large
												Load Diff
											
										
									
								
							
							
								
								
									
										114
									
								
								Plugins/slua_unreal/External/lua/lvm.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										114
									
								
								Plugins/slua_unreal/External/lua/lvm.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,114 @@ | ||||
| /* | ||||
| ** $Id: lvm.h,v 2.41 2016/12/22 13:08:50 roberto Exp $ | ||||
| ** 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		0 | ||||
| #endif | ||||
|  | ||||
|  | ||||
| #define tonumber(o,n) \ | ||||
| 	(ttisfloat(o) ? (*(n) = fltvalue(o), 1) : luaV_tonumber_(o,n)) | ||||
|  | ||||
| #define tointeger(o,i) \ | ||||
|     (ttisinteger(o) ? (*(i) = ivalue(o), 1) : luaV_tointeger(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': if 't' is a table and 't[k]' is not nil, | ||||
| ** return 1 with 'slot' pointing to 't[k]' (final result).  Otherwise, | ||||
| ** return 0 (meaning it will have to check metamethod) with 'slot' | ||||
| ** pointing to a nil 't[k]' (if 't' is a table) or NULL (otherwise). | ||||
| ** 'f' is the raw get function to use. | ||||
| */ | ||||
| #define luaV_fastget(L,t,k,slot,f) \ | ||||
|   (!ttistable(t)  \ | ||||
|    ? (slot = NULL, 0)  /* not a table; 'slot' is NULL and result is 0 */  \ | ||||
|    : (slot = f(hvalue(t), k),  /* else, do raw access */  \ | ||||
|       !ttisnil(slot)))  /* result not nil? */ | ||||
|  | ||||
| /* | ||||
| ** standard implementation for 'gettable' | ||||
| */ | ||||
| #define luaV_gettable(L,t,k,v) { const TValue *slot; \ | ||||
|   if (luaV_fastget(L,t,k,slot,luaH_get)) { setobj2s(L, v, slot); } \ | ||||
|   else luaV_finishget(L,t,k,v,slot); } | ||||
|  | ||||
|  | ||||
| /* | ||||
| ** Fast track for set table. If 't' is a table and 't[k]' is not nil, | ||||
| ** call GC barrier, do a raw 't[k]=v', and return true; otherwise, | ||||
| ** return false with 'slot' equal to NULL (if 't' is not a table) or | ||||
| ** 'nil'. (This is needed by 'luaV_finishget'.) Note that, if the macro | ||||
| ** returns true, there is no need to 'invalidateTMcache', because the | ||||
| ** call is not creating a new entry. | ||||
| */ | ||||
| #define luaV_fastset(L,t,k,slot,f,v) \ | ||||
|   (!ttistable(t) \ | ||||
|    ? (slot = NULL, 0) \ | ||||
|    : (slot = f(hvalue(t), k), \ | ||||
|      ttisnil(slot) ? 0 \ | ||||
|      : (luaC_barrierback(L, hvalue(t), v), \ | ||||
|         setobj2t(L, cast(TValue *,slot), v), \ | ||||
|         1))) | ||||
|  | ||||
|  | ||||
| #define luaV_settable(L,t,k,v) { const TValue *slot; \ | ||||
|   if (!luaV_fastset(L,t,k,slot,luaH_get,v)) \ | ||||
|     luaV_finishset(L,t,k,v,slot); } | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| 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, int mode); | ||||
| LUAI_FUNC void luaV_finishget (lua_State *L, const TValue *t, TValue *key, | ||||
|                                StkId val, const TValue *slot); | ||||
| LUAI_FUNC void luaV_finishset (lua_State *L, const TValue *t, TValue *key, | ||||
|                                StkId val, const TValue *slot); | ||||
| LUAI_FUNC void luaV_finishOp (lua_State *L); | ||||
| LUAI_FUNC void luaV_execute (lua_State *L); | ||||
| LUAI_FUNC void luaV_concat (lua_State *L, int total); | ||||
| LUAI_FUNC lua_Integer luaV_div (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_Integer luaV_shiftl (lua_Integer x, lua_Integer y); | ||||
| LUAI_FUNC void luaV_objlen (lua_State *L, StkId ra, const TValue *rb); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										68
									
								
								Plugins/slua_unreal/External/lua/lzio.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										68
									
								
								Plugins/slua_unreal/External/lua/lzio.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,68 @@ | ||||
| /* | ||||
| ** $Id: lzio.c,v 1.37 2015/09/08 15:41:05 roberto Exp $ | ||||
| ** Buffered streams | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
| #define lzio_c | ||||
| #define LUA_CORE | ||||
|  | ||||
| #include "lzio.h" | ||||
| #include "lprefix.h" | ||||
|  | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "llimits.h" | ||||
| #include "lmem.h" | ||||
| #include "lstate.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| 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 --- */ | ||||
| size_t luaZ_read (ZIO *z, void *b, size_t n) { | ||||
|   while (n) { | ||||
|     size_t m; | ||||
|     if (z->n == 0) {  /* no bytes in buffer? */ | ||||
|       if (luaZ_fill(z) == EOZ)  /* try to read more */ | ||||
|         return n;  /* no more input; return number of missing bytes */ | ||||
|       else { | ||||
|         z->n++;  /* luaZ_fill consumed first byte; put it back */ | ||||
|         z->p--; | ||||
|       } | ||||
|     } | ||||
|     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; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										68
									
								
								Plugins/slua_unreal/External/lua/lzio.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										68
									
								
								Plugins/slua_unreal/External/lua/lzio.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,68 @@ | ||||
| /* | ||||
| ** $Id: lzio.h,v 1.31 2015/09/08 15:41:05 roberto Exp $ | ||||
| ** Buffered streams | ||||
| ** See Copyright Notice in lua.h | ||||
| */ | ||||
|  | ||||
|  | ||||
| #ifndef lzio_h | ||||
| #define lzio_h | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lmem.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| #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 */ | ||||
|  | ||||
|  | ||||
|  | ||||
| /* --------- 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); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										162
									
								
								Plugins/slua_unreal/External/luasocket/auxiliar.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										162
									
								
								Plugins/slua_unreal/External/luasocket/auxiliar.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,162 @@ | ||||
| /*=========================================================================*\ | ||||
| * Auxiliar routines for class hierarchy manipulation | ||||
| * LuaSocket toolkit | ||||
| \*=========================================================================*/ | ||||
| #include <string.h> | ||||
| #include <stdio.h> | ||||
|  | ||||
| #include "auxiliar.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Exported functions | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Initializes the module | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int auxiliar_open(lua_State *L) { | ||||
|     (void) L; | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Creates a new class with given methods | ||||
| * Methods whose names start with __ are passed directly to the metatable. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| void auxiliar_newclass(lua_State *L, const char *classname, luaL_Reg *func) { | ||||
|     luaL_newmetatable(L, classname); /* mt */ | ||||
|     /* create __index table to place methods */ | ||||
|     lua_pushstring(L, "__index");    /* mt,"__index" */ | ||||
|     lua_newtable(L);                 /* mt,"__index",it */  | ||||
|     /* put class name into class metatable */ | ||||
|     lua_pushstring(L, "class");      /* mt,"__index",it,"class" */ | ||||
|     lua_pushstring(L, classname);    /* mt,"__index",it,"class",classname */ | ||||
|     lua_rawset(L, -3);               /* mt,"__index",it */ | ||||
|     /* pass all methods that start with _ to the metatable, and all others | ||||
|      * to the index table */ | ||||
|     for (; func->name; func++) {     /* mt,"__index",it */ | ||||
|         lua_pushstring(L, func->name); | ||||
|         lua_pushcfunction(L, func->func); | ||||
|         lua_rawset(L, func->name[0] == '_' ? -5: -3); | ||||
|     } | ||||
|     lua_rawset(L, -3);               /* mt */ | ||||
|     lua_pop(L, 1); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Prints the value of a class in a nice way | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int auxiliar_tostring(lua_State *L) { | ||||
|     char buf[32]; | ||||
|     if (!lua_getmetatable(L, 1)) goto error; | ||||
|     lua_pushstring(L, "__index"); | ||||
|     lua_gettable(L, -2); | ||||
|     if (!lua_istable(L, -1)) goto error; | ||||
|     lua_pushstring(L, "class"); | ||||
|     lua_gettable(L, -2); | ||||
|     if (!lua_isstring(L, -1)) goto error; | ||||
|     sprintf(buf, "%p", lua_touserdata(L, 1)); | ||||
|     lua_pushfstring(L, "%s: %s", lua_tostring(L, -1), buf); | ||||
|     return 1; | ||||
| error: | ||||
|     lua_pushstring(L, "invalid object passed to 'auxiliar.c:__tostring'"); | ||||
|     lua_error(L); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Insert class into group | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| void auxiliar_add2group(lua_State *L, const char *classname, const char *groupname) { | ||||
|     luaL_getmetatable(L, classname); | ||||
|     lua_pushstring(L, groupname); | ||||
|     lua_pushboolean(L, 1); | ||||
|     lua_rawset(L, -3); | ||||
|     lua_pop(L, 1); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Make sure argument is a boolean | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int auxiliar_checkboolean(lua_State *L, int objidx) { | ||||
|     if (!lua_isboolean(L, objidx)) | ||||
|         auxiliar_typeerror(L, objidx, lua_typename(L, LUA_TBOOLEAN)); | ||||
|     return lua_toboolean(L, objidx); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Return userdata pointer if object belongs to a given class, abort with  | ||||
| * error otherwise | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| void *auxiliar_checkclass(lua_State *L, const char *classname, int objidx) { | ||||
|     void *data = auxiliar_getclassudata(L, classname, objidx); | ||||
|     if (!data) { | ||||
|         char msg[45]; | ||||
|         sprintf(msg, "%.35s expected", classname); | ||||
|         luaL_argerror(L, objidx, msg); | ||||
|     } | ||||
|     return data; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Return userdata pointer if object belongs to a given group, abort with  | ||||
| * error otherwise | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| void *auxiliar_checkgroup(lua_State *L, const char *groupname, int objidx) { | ||||
|     void *data = auxiliar_getgroupudata(L, groupname, objidx); | ||||
|     if (!data) { | ||||
|         char msg[45]; | ||||
|         sprintf(msg, "%.35s expected", groupname); | ||||
|         luaL_argerror(L, objidx, msg); | ||||
|     } | ||||
|     return data; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Set object class | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| void auxiliar_setclass(lua_State *L, const char *classname, int objidx) { | ||||
|     luaL_getmetatable(L, classname); | ||||
|     if (objidx < 0) objidx--; | ||||
|     lua_setmetatable(L, objidx); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Get a userdata pointer if object belongs to a given group. Return NULL  | ||||
| * otherwise | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| void *auxiliar_getgroupudata(lua_State *L, const char *groupname, int objidx) { | ||||
|     if (!lua_getmetatable(L, objidx)) | ||||
|         return NULL; | ||||
|     lua_pushstring(L, groupname); | ||||
|     lua_rawget(L, -2); | ||||
|     if (lua_isnil(L, -1)) { | ||||
|         lua_pop(L, 2); | ||||
|         return NULL; | ||||
|     } else { | ||||
|         lua_pop(L, 2); | ||||
|         return lua_touserdata(L, objidx); | ||||
|     } | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Get a userdata pointer if object belongs to a given class. Return NULL  | ||||
| * otherwise | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| void *auxiliar_getclassudata(lua_State *L, const char *classname, int objidx) { | ||||
|     return luaL_checkudata(L, objidx, classname); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Throws error when argument does not have correct type. | ||||
| * Used to be part of lauxlib in Lua 5.1, was dropped from 5.2. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int auxiliar_typeerror (lua_State *L, int narg, const char *tname) { | ||||
|   const char *msg = lua_pushfstring(L, "%s expected, got %s", tname,  | ||||
|       luaL_typename(L, narg)); | ||||
|   return luaL_argerror(L, narg, msg); | ||||
| } | ||||
|  | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										51
									
								
								Plugins/slua_unreal/External/luasocket/auxiliar.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										51
									
								
								Plugins/slua_unreal/External/luasocket/auxiliar.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,51 @@ | ||||
| #ifndef AUXILIAR_H | ||||
| #define AUXILIAR_H | ||||
| /*=========================================================================*\ | ||||
| * Auxiliar routines for class hierarchy manipulation | ||||
| * LuaSocket toolkit (but completely independent of other LuaSocket modules) | ||||
| * | ||||
| * A LuaSocket class is a name associated with Lua metatables. A LuaSocket  | ||||
| * group is a name associated with a class. A class can belong to any number  | ||||
| * of groups. This module provides the functionality to: | ||||
| * | ||||
| *   - create new classes  | ||||
| *   - add classes to groups  | ||||
| *   - set the class of objects | ||||
| *   - check if an object belongs to a given class or group | ||||
| *   - get the userdata associated to objects | ||||
| *   - print objects in a pretty way | ||||
| * | ||||
| * LuaSocket class names follow the convention <module>{<class>}. Modules | ||||
| * can define any number of classes and groups. The module tcp.c, for | ||||
| * example, defines the classes tcp{master}, tcp{client} and tcp{server} and | ||||
| * the groups tcp{client,server} and tcp{any}. Module functions can then | ||||
| * perform type-checking on their arguments by either class or group. | ||||
| * | ||||
| * LuaSocket metatables define the __index metamethod as being a table. This | ||||
| * table has one field for each method supported by the class, and a field | ||||
| * "class" with the class name. | ||||
| * | ||||
| * The mapping from class name to the corresponding metatable and the | ||||
| * reverse mapping are done using lauxlib.  | ||||
| \*=========================================================================*/ | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| int auxiliar_open(lua_State *L); | ||||
| void auxiliar_newclass(lua_State *L, const char *classname, luaL_Reg *func); | ||||
| void auxiliar_add2group(lua_State *L, const char *classname, const char *group); | ||||
| void auxiliar_setclass(lua_State *L, const char *classname, int objidx); | ||||
| void *auxiliar_checkclass(lua_State *L, const char *classname, int objidx); | ||||
| void *auxiliar_checkgroup(lua_State *L, const char *groupname, int objidx); | ||||
| void *auxiliar_getclassudata(lua_State *L, const char *groupname, int objidx); | ||||
| void *auxiliar_getgroupudata(lua_State *L, const char *groupname, int objidx); | ||||
| int auxiliar_checkboolean(lua_State *L, int objidx); | ||||
| int auxiliar_tostring(lua_State *L); | ||||
| int auxiliar_typeerror(lua_State *L, int narg, const char *tname); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif /* AUXILIAR_H */ | ||||
							
								
								
									
										280
									
								
								Plugins/slua_unreal/External/luasocket/buffer.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										280
									
								
								Plugins/slua_unreal/External/luasocket/buffer.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,280 @@ | ||||
| /*=========================================================================*\ | ||||
| * Input/Output interface for Lua programs | ||||
| * LuaSocket toolkit | ||||
| \*=========================================================================*/ | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
|  | ||||
| #include "buffer.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Internal function prototypes | ||||
| \*=========================================================================*/ | ||||
| static int recvraw(p_buffer buf, size_t wanted, luaL_Buffer *b); | ||||
| static int recvline(p_buffer buf, luaL_Buffer *b); | ||||
| static int recvall(p_buffer buf, luaL_Buffer *b); | ||||
| static int buffer_get(p_buffer buf, const char **data, size_t *count); | ||||
| static void buffer_skip(p_buffer buf, size_t count); | ||||
| static int sendraw(p_buffer buf, const char *data, size_t count, size_t *sent); | ||||
|  | ||||
| /* min and max macros */ | ||||
| #ifndef MIN | ||||
| #define MIN(x, y) ((x) < (y) ? x : y) | ||||
| #endif | ||||
| #ifndef MAX | ||||
| #define MAX(x, y) ((x) > (y) ? x : y) | ||||
| #endif | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Exported functions | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Initializes module | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int buffer_open(lua_State *L) { | ||||
|     (void) L; | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Initializes C structure  | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| void buffer_init(p_buffer buf, p_io io, p_timeout tm) { | ||||
|     buf->first = buf->last = 0; | ||||
|     buf->io = io; | ||||
|     buf->tm = tm; | ||||
|     buf->received = buf->sent = 0; | ||||
|     buf->birthday = timeout_gettime(); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * object:getstats() interface | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int buffer_meth_getstats(lua_State *L, p_buffer buf) { | ||||
|     lua_pushnumber(L, (lua_Number) buf->received); | ||||
|     lua_pushnumber(L, (lua_Number) buf->sent); | ||||
|     lua_pushnumber(L, timeout_gettime() - buf->birthday); | ||||
|     return 3; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * object:setstats() interface | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int buffer_meth_setstats(lua_State *L, p_buffer buf) { | ||||
|     buf->received = (long) luaL_optnumber(L, 2, (lua_Number) buf->received);  | ||||
|     buf->sent = (long) luaL_optnumber(L, 3, (lua_Number) buf->sent);  | ||||
|     if (lua_isnumber(L, 4)) buf->birthday = timeout_gettime() - lua_tonumber(L, 4); | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * object:send() interface | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int buffer_meth_send(lua_State *L, p_buffer buf) { | ||||
|     int top = lua_gettop(L); | ||||
|     int err = IO_DONE; | ||||
|     size_t size = 0, sent = 0; | ||||
|     const char *data = luaL_checklstring(L, 2, &size); | ||||
|     long start = (long) luaL_optnumber(L, 3, 1); | ||||
|     long end = (long) luaL_optnumber(L, 4, -1); | ||||
| #ifdef LUASOCKET_DEBUG | ||||
|     p_timeout tm = timeout_markstart(buf->tm); | ||||
| #endif | ||||
|     if (start < 0) start = (long) (size+start+1); | ||||
|     if (end < 0) end = (long) (size+end+1); | ||||
|     if (start < 1) start = (long) 1; | ||||
|     if (end > (long) size) end = (long) size; | ||||
|     if (start <= end) err = sendraw(buf, data+start-1, end-start+1, &sent); | ||||
|     /* check if there was an error */ | ||||
|     if (err != IO_DONE) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, buf->io->error(buf->io->ctx, err));  | ||||
|         lua_pushnumber(L, (lua_Number) (sent+start-1)); | ||||
|     } else { | ||||
|         lua_pushnumber(L, (lua_Number) (sent+start-1)); | ||||
|         lua_pushnil(L); | ||||
|         lua_pushnil(L); | ||||
|     } | ||||
| #ifdef LUASOCKET_DEBUG | ||||
|     /* push time elapsed during operation as the last return value */ | ||||
|     lua_pushnumber(L, timeout_gettime() - timeout_getstart(tm)); | ||||
| #endif | ||||
|     return lua_gettop(L) - top; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * object:receive() interface | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int buffer_meth_receive(lua_State *L, p_buffer buf) { | ||||
|     int err = IO_DONE, top = lua_gettop(L); | ||||
|     luaL_Buffer b; | ||||
|     size_t size; | ||||
|     const char *part = luaL_optlstring(L, 3, "", &size); | ||||
| #ifdef LUASOCKET_DEBUG | ||||
|     p_timeout tm = timeout_markstart(buf->tm); | ||||
| #endif | ||||
|     /* initialize buffer with optional extra prefix  | ||||
|      * (useful for concatenating previous partial results) */ | ||||
|     luaL_buffinit(L, &b); | ||||
|     luaL_addlstring(&b, part, size); | ||||
|     /* receive new patterns */ | ||||
|     if (!lua_isnumber(L, 2)) { | ||||
|         const char *p= luaL_optstring(L, 2, "*l"); | ||||
|         if (p[0] == '*' && p[1] == 'l') err = recvline(buf, &b); | ||||
|         else if (p[0] == '*' && p[1] == 'a') err = recvall(buf, &b);  | ||||
|         else luaL_argcheck(L, 0, 2, "invalid receive pattern"); | ||||
|     /* get a fixed number of bytes (minus what was already partially  | ||||
|      * received) */ | ||||
|     } else { | ||||
|         double n = lua_tonumber(L, 2);  | ||||
|         size_t wanted = (size_t) n; | ||||
|         luaL_argcheck(L, n >= 0, 2, "invalid receive pattern"); | ||||
|         if (size == 0 || wanted > size) | ||||
|             err = recvraw(buf, wanted-size, &b); | ||||
|     } | ||||
|     /* check if there was an error */ | ||||
|     if (err != IO_DONE) { | ||||
|         /* we can't push anyting in the stack before pushing the | ||||
|          * contents of the buffer. this is the reason for the complication */ | ||||
|         luaL_pushresult(&b); | ||||
|         lua_pushstring(L, buf->io->error(buf->io->ctx, err));  | ||||
|         lua_pushvalue(L, -2);  | ||||
|         lua_pushnil(L); | ||||
|         lua_replace(L, -4); | ||||
|     } else { | ||||
|         luaL_pushresult(&b); | ||||
|         lua_pushnil(L); | ||||
|         lua_pushnil(L); | ||||
|     } | ||||
| #ifdef LUASOCKET_DEBUG | ||||
|     /* push time elapsed during operation as the last return value */ | ||||
|     lua_pushnumber(L, timeout_gettime() - timeout_getstart(tm)); | ||||
| #endif | ||||
|     return lua_gettop(L) - top; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Determines if there is any data in the read buffer | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int buffer_isempty(p_buffer buf) { | ||||
|     return buf->first >= buf->last; | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Internal functions | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Sends a block of data (unbuffered) | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| #define STEPSIZE 8192 | ||||
| static int sendraw(p_buffer buf, const char *data, size_t count, size_t *sent) { | ||||
|     p_io io = buf->io; | ||||
|     p_timeout tm = buf->tm; | ||||
|     size_t total = 0; | ||||
|     int err = IO_DONE; | ||||
|     while (total < count && err == IO_DONE) { | ||||
|         size_t done = 0; | ||||
|         size_t step = (count-total <= STEPSIZE)? count-total: STEPSIZE; | ||||
|         err = io->send(io->ctx, data+total, step, &done, tm); | ||||
|         total += done; | ||||
|     } | ||||
|     *sent = total; | ||||
|     buf->sent += total; | ||||
|     return err; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Reads a fixed number of bytes (buffered) | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int recvraw(p_buffer buf, size_t wanted, luaL_Buffer *b) { | ||||
|     int err = IO_DONE; | ||||
|     size_t total = 0; | ||||
|     while (err == IO_DONE) { | ||||
|         size_t count; const char *data; | ||||
|         err = buffer_get(buf, &data, &count); | ||||
|         count = MIN(count, wanted - total); | ||||
|         luaL_addlstring(b, data, count); | ||||
|         buffer_skip(buf, count); | ||||
|         total += count; | ||||
|         if (total >= wanted) break; | ||||
|     } | ||||
|     return err; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Reads everything until the connection is closed (buffered) | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int recvall(p_buffer buf, luaL_Buffer *b) { | ||||
|     int err = IO_DONE; | ||||
|     size_t total = 0; | ||||
|     while (err == IO_DONE) { | ||||
|         const char *data; size_t count; | ||||
|         err = buffer_get(buf, &data, &count); | ||||
|         total += count; | ||||
|         luaL_addlstring(b, data, count); | ||||
|         buffer_skip(buf, count); | ||||
|     } | ||||
|     if (err == IO_CLOSED) { | ||||
|         if (total > 0) return IO_DONE; | ||||
|         else return IO_CLOSED; | ||||
|     } else return err; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Reads a line terminated by a CR LF pair or just by a LF. The CR and LF  | ||||
| * are not returned by the function and are discarded from the buffer | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int recvline(p_buffer buf, luaL_Buffer *b) { | ||||
|     int err = IO_DONE; | ||||
|     while (err == IO_DONE) { | ||||
|         size_t count, pos; const char *data; | ||||
|         err = buffer_get(buf, &data, &count); | ||||
|         pos = 0; | ||||
|         while (pos < count && data[pos] != '\n') { | ||||
|             /* we ignore all \r's */ | ||||
|             if (data[pos] != '\r') luaL_addchar(b, data[pos]); | ||||
|             pos++; | ||||
|         } | ||||
|         if (pos < count) { /* found '\n' */ | ||||
|             buffer_skip(buf, pos+1); /* skip '\n' too */ | ||||
|             break; /* we are done */ | ||||
|         } else /* reached the end of the buffer */ | ||||
|             buffer_skip(buf, pos); | ||||
|     } | ||||
|     return err; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Skips a given number of bytes from read buffer. No data is read from the | ||||
| * transport layer | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static void buffer_skip(p_buffer buf, size_t count) { | ||||
|     buf->received += count; | ||||
|     buf->first += count; | ||||
|     if (buffer_isempty(buf))  | ||||
|         buf->first = buf->last = 0; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Return any data available in buffer, or get more data from transport layer | ||||
| * if buffer is empty | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int buffer_get(p_buffer buf, const char **data, size_t *count) { | ||||
|     int err = IO_DONE; | ||||
|     p_io io = buf->io; | ||||
|     p_timeout tm = buf->tm; | ||||
|     if (buffer_isempty(buf)) { | ||||
|         size_t got; | ||||
|         err = io->recv(io->ctx, buf->data, BUF_SIZE, &got, tm); | ||||
|         buf->first = 0; | ||||
|         buf->last = got; | ||||
|     } | ||||
|     *count = buf->last - buf->first; | ||||
|     *data = buf->data + buf->first; | ||||
|     return err; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										49
									
								
								Plugins/slua_unreal/External/luasocket/buffer.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										49
									
								
								Plugins/slua_unreal/External/luasocket/buffer.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,49 @@ | ||||
| #ifndef BUF_H | ||||
| #define BUF_H  | ||||
| /*=========================================================================*\ | ||||
| * Input/Output interface for Lua programs | ||||
| * LuaSocket toolkit | ||||
| * | ||||
| * Line patterns require buffering. Reading one character at a time involves | ||||
| * too many system calls and is very slow. This module implements the | ||||
| * LuaSocket interface for input/output on connected objects, as seen by  | ||||
| * Lua programs.  | ||||
| * | ||||
| * Input is buffered. Output is *not* buffered because there was no simple | ||||
| * way of making sure the buffered output data would ever be sent. | ||||
| * | ||||
| * The module is built on top of the I/O abstraction defined in io.h and the | ||||
| * timeout management is done with the timeout.h interface. | ||||
| \*=========================================================================*/ | ||||
| #include "lua.h" | ||||
|  | ||||
| #include "io.h" | ||||
| #include "timeout.h" | ||||
|  | ||||
| /* buffer size in bytes */ | ||||
| #define BUF_SIZE 8192 | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /* buffer control structure */ | ||||
| typedef struct t_buffer_ { | ||||
|     double birthday;        /* throttle support info: creation time, */ | ||||
|     size_t sent, received;  /* bytes sent, and bytes received */ | ||||
|     p_io io;                /* IO driver used for this buffer */ | ||||
|     p_timeout tm;           /* timeout management for this buffer */ | ||||
|     size_t first, last;     /* index of first and last bytes of stored data */ | ||||
|     char data[BUF_SIZE];    /* storage space for buffer data */ | ||||
| } t_buffer; | ||||
| typedef t_buffer *p_buffer; | ||||
|  | ||||
| int buffer_open(lua_State *L); | ||||
| void buffer_init(p_buffer buf, p_io io, p_timeout tm); | ||||
| int buffer_meth_send(lua_State *L, p_buffer buf); | ||||
| int buffer_meth_receive(lua_State *L, p_buffer buf); | ||||
| int buffer_meth_getstats(lua_State *L, p_buffer buf); | ||||
| int buffer_meth_setstats(lua_State *L, p_buffer buf); | ||||
| int buffer_isempty(p_buffer buf); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif /* BUF_H */ | ||||
							
								
								
									
										105
									
								
								Plugins/slua_unreal/External/luasocket/except.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										105
									
								
								Plugins/slua_unreal/External/luasocket/except.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,105 @@ | ||||
| /*=========================================================================*\ | ||||
| * Simple exception support | ||||
| * LuaSocket toolkit | ||||
| \*=========================================================================*/ | ||||
| #include <stdio.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
|  | ||||
| #include "except.h" | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Internal function prototypes. | ||||
| \*=========================================================================*/ | ||||
| static int global_protect(lua_State *L); | ||||
| static int global_newtry(lua_State *L); | ||||
| static int protected_(lua_State *L); | ||||
| static int finalize(lua_State *L); | ||||
| static int do_nothing(lua_State *L); | ||||
|  | ||||
| /* except functions */ | ||||
| static luaL_Reg except_func[] = { | ||||
|     {"newtry",    global_newtry}, | ||||
|     {"protect",   global_protect}, | ||||
|     {NULL,        NULL} | ||||
| }; | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Try factory | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static void wrap(lua_State *L) { | ||||
|     lua_newtable(L); | ||||
|     lua_pushnumber(L, 1); | ||||
|     lua_pushvalue(L, -3); | ||||
|     lua_settable(L, -3); | ||||
|     lua_insert(L, -2); | ||||
|     lua_pop(L, 1); | ||||
| } | ||||
|  | ||||
| static int finalize(lua_State *L) { | ||||
|     if (!lua_toboolean(L, 1)) { | ||||
|         lua_pushvalue(L, lua_upvalueindex(1)); | ||||
|         lua_pcall(L, 0, 0, 0); | ||||
|         lua_settop(L, 2); | ||||
|         wrap(L); | ||||
|         lua_error(L); | ||||
|         return 0; | ||||
|     } else return lua_gettop(L); | ||||
| } | ||||
|  | ||||
| static int do_nothing(lua_State *L) {  | ||||
|     (void) L; | ||||
|     return 0;  | ||||
| } | ||||
|  | ||||
| static int global_newtry(lua_State *L) { | ||||
|     lua_settop(L, 1); | ||||
|     if (lua_isnil(L, 1)) lua_pushcfunction(L, do_nothing); | ||||
|     lua_pushcclosure(L, finalize, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Protect factory | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int unwrap(lua_State *L) { | ||||
|     if (lua_istable(L, -1)) { | ||||
|         lua_pushnumber(L, 1); | ||||
|         lua_gettable(L, -2); | ||||
|         lua_pushnil(L); | ||||
|         lua_insert(L, -2); | ||||
|         return 1; | ||||
|     } else return 0; | ||||
| } | ||||
|  | ||||
| static int protected_(lua_State *L) { | ||||
|     lua_pushvalue(L, lua_upvalueindex(1)); | ||||
|     lua_insert(L, 1); | ||||
|     if (lua_pcall(L, lua_gettop(L) - 1, LUA_MULTRET, 0) != 0) { | ||||
|         if (unwrap(L)) return 2; | ||||
|         else lua_error(L); | ||||
|         return 0; | ||||
|     } else return lua_gettop(L); | ||||
| } | ||||
|  | ||||
| static int global_protect(lua_State *L) { | ||||
|     lua_pushcclosure(L, protected_, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Init module | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int except_open(lua_State *L) { | ||||
| #if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE) | ||||
|     luaL_setfuncs(L, except_func, 0); | ||||
| #else | ||||
|     luaL_openlib(L, NULL, except_func, 0); | ||||
| #endif | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										37
									
								
								Plugins/slua_unreal/External/luasocket/except.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										37
									
								
								Plugins/slua_unreal/External/luasocket/except.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,37 @@ | ||||
| #ifndef EXCEPT_H | ||||
| #define EXCEPT_H | ||||
| /*=========================================================================*\ | ||||
| * Exception control | ||||
| * LuaSocket toolkit (but completely independent from other modules) | ||||
| * | ||||
| * This provides support for simple exceptions in Lua. During the | ||||
| * development of the HTTP/FTP/SMTP support, it became aparent that | ||||
| * error checking was taking a substantial amount of the coding. These | ||||
| * function greatly simplify the task of checking errors. | ||||
| * | ||||
| * The main idea is that functions should return nil as its first return | ||||
| * value when it finds an error, and return an error message (or value) | ||||
| * following nil. In case of success, as long as the first value is not nil, | ||||
| * the other values don't matter. | ||||
| * | ||||
| * The idea is to nest function calls with the "try" function. This function | ||||
| * checks the first value, and calls "error" on the second if the first is | ||||
| * nil. Otherwise, it returns all values it received.  | ||||
| * | ||||
| * The protect function returns a new function that behaves exactly like the | ||||
| * function it receives, but the new function doesn't throw exceptions: it | ||||
| * returns nil followed by the error message instead. | ||||
| * | ||||
| * With these two function, it's easy to write functions that throw | ||||
| * exceptions on error, but that don't interrupt the user script.  | ||||
| \*=========================================================================*/ | ||||
|  | ||||
| #include "lua.h" | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| int except_open(lua_State *L); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										287
									
								
								Plugins/slua_unreal/External/luasocket/ftp.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										287
									
								
								Plugins/slua_unreal/External/luasocket/ftp.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,287 @@ | ||||
| R"-++**++-( | ||||
| ------------------------------------------------------------------- | ||||
| -- FTP support for the Lua language | ||||
| -- LuaSocket toolkit. | ||||
| -- Author: Diego Nehab | ||||
| ----------------------------------------------------------------------------- | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Declare module and import dependencies | ||||
| ----------------------------------------------------------------------------- | ||||
| local base = _G | ||||
| local table = require("table") | ||||
| local string = require("string") | ||||
| local math = require("math") | ||||
| local socket = require("socket") | ||||
| local url = require("socket.url") | ||||
| local tp = require("socket.tp") | ||||
| local ltn12 = require("ltn12") | ||||
| socket.ftp = {} | ||||
| local _M = socket.ftp | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Program constants | ||||
| ----------------------------------------------------------------------------- | ||||
| -- timeout in seconds before the program gives up on a connection | ||||
| _M.TIMEOUT = 60 | ||||
| -- default port for ftp service | ||||
| _M.PORT = 21 | ||||
| -- this is the default anonymous password. used when no password is | ||||
| -- provided in url. should be changed to your e-mail. | ||||
| _M.USER = "ftp" | ||||
| _M.PASSWORD = "anonymous@anonymous.org" | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Low level FTP API | ||||
| ----------------------------------------------------------------------------- | ||||
| local metat = { __index = {} } | ||||
|  | ||||
| function _M.open(server, port, create) | ||||
|     local tp = socket.try(tp.connect(server, port or _M.PORT, _M.TIMEOUT, create)) | ||||
|     local f = base.setmetatable({ tp = tp }, metat) | ||||
|     -- make sure everything gets closed in an exception | ||||
|     f.try = socket.newtry(function() f:close() end) | ||||
|     return f | ||||
| end | ||||
|  | ||||
| function metat.__index:portconnect() | ||||
|     self.try(self.server:settimeout(_M.TIMEOUT)) | ||||
|     self.data = self.try(self.server:accept()) | ||||
|     self.try(self.data:settimeout(_M.TIMEOUT)) | ||||
| end | ||||
|  | ||||
| function metat.__index:pasvconnect() | ||||
|     self.data = self.try(socket.tcp()) | ||||
|     self.try(self.data:settimeout(_M.TIMEOUT)) | ||||
|     self.try(self.data:connect(self.pasvt.ip, self.pasvt.port)) | ||||
| end | ||||
|  | ||||
| function metat.__index:login(user, password) | ||||
|     self.try(self.tp:command("user", user or _M.USER)) | ||||
|     local code, reply = self.try(self.tp:check{"2..", 331}) | ||||
|     if code == 331 then | ||||
|         self.try(self.tp:command("pass", password or _M.PASSWORD)) | ||||
|         self.try(self.tp:check("2..")) | ||||
|     end | ||||
|     return 1 | ||||
| end | ||||
|  | ||||
| function metat.__index:pasv() | ||||
|     self.try(self.tp:command("pasv")) | ||||
|     local code, reply = self.try(self.tp:check("2..")) | ||||
|     local pattern = "(%d+)%D(%d+)%D(%d+)%D(%d+)%D(%d+)%D(%d+)" | ||||
|     local a, b, c, d, p1, p2 = socket.skip(2, string.find(reply, pattern)) | ||||
|     self.try(a and b and c and d and p1 and p2, reply) | ||||
|     self.pasvt = { | ||||
|         ip = string.format("%d.%d.%d.%d", a, b, c, d), | ||||
|         port = p1*256 + p2 | ||||
|     } | ||||
|     if self.server then | ||||
|         self.server:close() | ||||
|         self.server = nil | ||||
|     end | ||||
|     return self.pasvt.ip, self.pasvt.port | ||||
| end | ||||
|  | ||||
| function metat.__index:port(ip, port) | ||||
|     self.pasvt = nil | ||||
|     if not ip then | ||||
|         ip, port = self.try(self.tp:getcontrol():getsockname()) | ||||
|         self.server = self.try(socket.bind(ip, 0)) | ||||
|         ip, port = self.try(self.server:getsockname()) | ||||
|         self.try(self.server:settimeout(_M.TIMEOUT)) | ||||
|     end | ||||
|     local pl = math.mod(port, 256) | ||||
|     local ph = (port - pl)/256 | ||||
|     local arg = string.gsub(string.format("%s,%d,%d", ip, ph, pl), "%.", ",") | ||||
|     self.try(self.tp:command("port", arg)) | ||||
|     self.try(self.tp:check("2..")) | ||||
|     return 1 | ||||
| end | ||||
|  | ||||
| function metat.__index:send(sendt) | ||||
|     self.try(self.pasvt or self.server, "need port or pasv first") | ||||
|     -- if there is a pasvt table, we already sent a PASV command | ||||
|     -- we just get the data connection into self.data | ||||
|     if self.pasvt then self:pasvconnect() end | ||||
|     -- get the transfer argument and command | ||||
|     local argument = sendt.argument or | ||||
|         url.unescape(string.gsub(sendt.path or "", "^[/\\]", "")) | ||||
|     if argument == "" then argument = nil end | ||||
|     local command = sendt.command or "stor" | ||||
|     -- send the transfer command and check the reply | ||||
|     self.try(self.tp:command(command, argument)) | ||||
|     local code, reply = self.try(self.tp:check{"2..", "1.."}) | ||||
|     -- if there is not a a pasvt table, then there is a server | ||||
|     -- and we already sent a PORT command | ||||
|     if not self.pasvt then self:portconnect() end | ||||
|     -- get the sink, source and step for the transfer | ||||
|     local step = sendt.step or ltn12.pump.step | ||||
|     local readt = {self.tp.c} | ||||
|     local checkstep = function(src, snk) | ||||
|         -- check status in control connection while downloading | ||||
|         local readyt = socket.select(readt, nil, 0) | ||||
|         if readyt[tp] then code = self.try(self.tp:check("2..")) end | ||||
|         return step(src, snk) | ||||
|     end | ||||
|     local sink = socket.sink("close-when-done", self.data) | ||||
|     -- transfer all data and check error | ||||
|     self.try(ltn12.pump.all(sendt.source, sink, checkstep)) | ||||
|     if string.find(code, "1..") then self.try(self.tp:check("2..")) end | ||||
|     -- done with data connection | ||||
|     self.data:close() | ||||
|     -- find out how many bytes were sent | ||||
|     local sent = socket.skip(1, self.data:getstats()) | ||||
|     self.data = nil | ||||
|     return sent | ||||
| end | ||||
|  | ||||
| function metat.__index:receive(recvt) | ||||
|     self.try(self.pasvt or self.server, "need port or pasv first") | ||||
|     if self.pasvt then self:pasvconnect() end | ||||
|     local argument = recvt.argument or | ||||
|         url.unescape(string.gsub(recvt.path or "", "^[/\\]", "")) | ||||
|     if argument == "" then argument = nil end | ||||
|     local command = recvt.command or "retr" | ||||
|     self.try(self.tp:command(command, argument)) | ||||
|     local code,reply = self.try(self.tp:check{"1..", "2.."}) | ||||
|     if (code >= 200) and (code <= 299) then | ||||
|         recvt.sink(reply) | ||||
|         return 1 | ||||
|     end | ||||
|     if not self.pasvt then self:portconnect() end | ||||
|     local source = socket.source("until-closed", self.data) | ||||
|     local step = recvt.step or ltn12.pump.step | ||||
|     self.try(ltn12.pump.all(source, recvt.sink, step)) | ||||
|     if string.find(code, "1..") then self.try(self.tp:check("2..")) end | ||||
|     self.data:close() | ||||
|     self.data = nil | ||||
|     return 1 | ||||
| end | ||||
|  | ||||
| function metat.__index:cwd(dir) | ||||
|     self.try(self.tp:command("cwd", dir)) | ||||
|     self.try(self.tp:check(250)) | ||||
|     return 1 | ||||
| end | ||||
|  | ||||
| function metat.__index:type(type) | ||||
|     self.try(self.tp:command("type", type)) | ||||
|     self.try(self.tp:check(200)) | ||||
|     return 1 | ||||
| end | ||||
|  | ||||
| function metat.__index:greet() | ||||
|     local code = self.try(self.tp:check{"1..", "2.."}) | ||||
|     if string.find(code, "1..") then self.try(self.tp:check("2..")) end | ||||
|     return 1 | ||||
| end | ||||
|  | ||||
| function metat.__index:quit() | ||||
|     self.try(self.tp:command("quit")) | ||||
|     self.try(self.tp:check("2..")) | ||||
|     return 1 | ||||
| end | ||||
|  | ||||
| function metat.__index:close() | ||||
|     if self.data then self.data:close() end | ||||
|     if self.server then self.server:close() end | ||||
|     return self.tp:close() | ||||
| end | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- High level FTP API | ||||
| ----------------------------------------------------------------------------- | ||||
| local function override(t) | ||||
|     if t.url then | ||||
|         local u = url.parse(t.url) | ||||
|         for i,v in base.pairs(t) do | ||||
|             u[i] = v | ||||
|         end | ||||
|         return u | ||||
|     else return t end | ||||
| end | ||||
|  | ||||
| local function tput(putt) | ||||
|     putt = override(putt) | ||||
|     socket.try(putt.host, "missing hostname") | ||||
|     local f = _M.open(putt.host, putt.port, putt.create) | ||||
|     f:greet() | ||||
|     f:login(putt.user, putt.password) | ||||
|     if putt.type then f:type(putt.type) end | ||||
|     f:pasv() | ||||
|     local sent = f:send(putt) | ||||
|     f:quit() | ||||
|     f:close() | ||||
|     return sent | ||||
| end | ||||
|  | ||||
| local default = { | ||||
|     path = "/", | ||||
|     scheme = "ftp" | ||||
| } | ||||
|  | ||||
| local function parse(u) | ||||
|     local t = socket.try(url.parse(u, default)) | ||||
|     socket.try(t.scheme == "ftp", "wrong scheme '" .. t.scheme .. "'") | ||||
|     socket.try(t.host, "missing hostname") | ||||
|     local pat = "^type=(.)$" | ||||
|     if t.params then | ||||
|         t.type = socket.skip(2, string.find(t.params, pat)) | ||||
|         socket.try(t.type == "a" or t.type == "i", | ||||
|             "invalid type '" .. t.type .. "'") | ||||
|     end | ||||
|     return t | ||||
| end | ||||
|  | ||||
| local function sput(u, body) | ||||
|     local putt = parse(u) | ||||
|     putt.source = ltn12.source.string(body) | ||||
|     return tput(putt) | ||||
| end | ||||
|  | ||||
| _M.put = socket.protect(function(putt, body) | ||||
|     if base.type(putt) == "string" then return sput(putt, body) | ||||
|     else return tput(putt) end | ||||
| end) | ||||
|  | ||||
| local function tget(gett) | ||||
|     gett = override(gett) | ||||
|     socket.try(gett.host, "missing hostname") | ||||
|     local f = _M.open(gett.host, gett.port, gett.create) | ||||
|     f:greet() | ||||
|     f:login(gett.user, gett.password) | ||||
|     if gett.type then f:type(gett.type) end | ||||
|     f:pasv() | ||||
|     f:receive(gett) | ||||
|     f:quit() | ||||
|     return f:close() | ||||
| end | ||||
|  | ||||
| local function sget(u) | ||||
|     local gett = parse(u) | ||||
|     local t = {} | ||||
|     gett.sink = ltn12.sink.table(t) | ||||
|     tget(gett) | ||||
|     return table.concat(t) | ||||
| end | ||||
|  | ||||
| _M.command = socket.protect(function(cmdt) | ||||
|     cmdt = override(cmdt) | ||||
|     socket.try(cmdt.host, "missing hostname") | ||||
|     socket.try(cmdt.command, "missing command") | ||||
|     local f = open(cmdt.host, cmdt.port, cmdt.create) | ||||
|     f:greet() | ||||
|     f:login(cmdt.user, cmdt.password) | ||||
|     f.try(f.tp:command(cmdt.command, cmdt.argument)) | ||||
|     if cmdt.check then f.try(f.tp:check(cmdt.check)) end | ||||
|     f:quit() | ||||
|     return f:close() | ||||
| end) | ||||
|  | ||||
| _M.get = socket.protect(function(gett) | ||||
|     if base.type(gett) == "string" then return sget(gett) | ||||
|     else return tget(gett) end | ||||
| end) | ||||
|  | ||||
| return _M | ||||
| )-++**++-"; | ||||
							
								
								
									
										106
									
								
								Plugins/slua_unreal/External/luasocket/headers.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										106
									
								
								Plugins/slua_unreal/External/luasocket/headers.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,106 @@ | ||||
| R"-++**++-( | ||||
| --------------------------------------------------- | ||||
| -- Canonic header field capitalization | ||||
| -- LuaSocket toolkit. | ||||
| -- Author: Diego Nehab | ||||
| ----------------------------------------------------------------------------- | ||||
| local socket = require("socket") | ||||
| socket.headers = {} | ||||
| local _M = socket.headers | ||||
|  | ||||
| _M.canonic = { | ||||
|     ["accept"] = "Accept", | ||||
|     ["accept-charset"] = "Accept-Charset", | ||||
|     ["accept-encoding"] = "Accept-Encoding", | ||||
|     ["accept-language"] = "Accept-Language", | ||||
|     ["accept-ranges"] = "Accept-Ranges", | ||||
|     ["action"] = "Action", | ||||
|     ["alternate-recipient"] = "Alternate-Recipient", | ||||
|     ["age"] = "Age", | ||||
|     ["allow"] = "Allow", | ||||
|     ["arrival-date"] = "Arrival-Date", | ||||
|     ["authorization"] = "Authorization", | ||||
|     ["bcc"] = "Bcc", | ||||
|     ["cache-control"] = "Cache-Control", | ||||
|     ["cc"] = "Cc", | ||||
|     ["comments"] = "Comments", | ||||
|     ["connection"] = "Connection", | ||||
|     ["content-description"] = "Content-Description", | ||||
|     ["content-disposition"] = "Content-Disposition", | ||||
|     ["content-encoding"] = "Content-Encoding", | ||||
|     ["content-id"] = "Content-ID", | ||||
|     ["content-language"] = "Content-Language", | ||||
|     ["content-length"] = "Content-Length", | ||||
|     ["content-location"] = "Content-Location", | ||||
|     ["content-md5"] = "Content-MD5", | ||||
|     ["content-range"] = "Content-Range", | ||||
|     ["content-transfer-encoding"] = "Content-Transfer-Encoding", | ||||
|     ["content-type"] = "Content-Type", | ||||
|     ["cookie"] = "Cookie", | ||||
|     ["date"] = "Date", | ||||
|     ["diagnostic-code"] = "Diagnostic-Code", | ||||
|     ["dsn-gateway"] = "DSN-Gateway", | ||||
|     ["etag"] = "ETag", | ||||
|     ["expect"] = "Expect", | ||||
|     ["expires"] = "Expires", | ||||
|     ["final-log-id"] = "Final-Log-ID", | ||||
|     ["final-recipient"] = "Final-Recipient", | ||||
|     ["from"] = "From", | ||||
|     ["host"] = "Host", | ||||
|     ["if-match"] = "If-Match", | ||||
|     ["if-modified-since"] = "If-Modified-Since", | ||||
|     ["if-none-match"] = "If-None-Match", | ||||
|     ["if-range"] = "If-Range", | ||||
|     ["if-unmodified-since"] = "If-Unmodified-Since", | ||||
|     ["in-reply-to"] = "In-Reply-To", | ||||
|     ["keywords"] = "Keywords", | ||||
|     ["last-attempt-date"] = "Last-Attempt-Date", | ||||
|     ["last-modified"] = "Last-Modified", | ||||
|     ["location"] = "Location", | ||||
|     ["max-forwards"] = "Max-Forwards", | ||||
|     ["message-id"] = "Message-ID", | ||||
|     ["mime-version"] = "MIME-Version", | ||||
|     ["original-envelope-id"] = "Original-Envelope-ID", | ||||
|     ["original-recipient"] = "Original-Recipient", | ||||
|     ["pragma"] = "Pragma", | ||||
|     ["proxy-authenticate"] = "Proxy-Authenticate", | ||||
|     ["proxy-authorization"] = "Proxy-Authorization", | ||||
|     ["range"] = "Range", | ||||
|     ["received"] = "Received", | ||||
|     ["received-from-mta"] = "Received-From-MTA", | ||||
|     ["references"] = "References", | ||||
|     ["referer"] = "Referer", | ||||
|     ["remote-mta"] = "Remote-MTA", | ||||
|     ["reply-to"] = "Reply-To", | ||||
|     ["reporting-mta"] = "Reporting-MTA", | ||||
|     ["resent-bcc"] = "Resent-Bcc", | ||||
|     ["resent-cc"] = "Resent-Cc", | ||||
|     ["resent-date"] = "Resent-Date", | ||||
|     ["resent-from"] = "Resent-From", | ||||
|     ["resent-message-id"] = "Resent-Message-ID", | ||||
|     ["resent-reply-to"] = "Resent-Reply-To", | ||||
|     ["resent-sender"] = "Resent-Sender", | ||||
|     ["resent-to"] = "Resent-To", | ||||
|     ["retry-after"] = "Retry-After", | ||||
|     ["return-path"] = "Return-Path", | ||||
|     ["sender"] = "Sender", | ||||
|     ["server"] = "Server", | ||||
|     ["smtp-remote-recipient"] = "SMTP-Remote-Recipient", | ||||
|     ["status"] = "Status", | ||||
|     ["subject"] = "Subject", | ||||
|     ["te"] = "TE", | ||||
|     ["to"] = "To", | ||||
|     ["trailer"] = "Trailer", | ||||
|     ["transfer-encoding"] = "Transfer-Encoding", | ||||
|     ["upgrade"] = "Upgrade", | ||||
|     ["user-agent"] = "User-Agent", | ||||
|     ["vary"] = "Vary", | ||||
|     ["via"] = "Via", | ||||
|     ["warning"] = "Warning", | ||||
|     ["will-retry-until"] = "Will-Retry-Until", | ||||
|     ["www-authenticate"] = "WWW-Authenticate", | ||||
|     ["x-mailer"] = "X-Mailer", | ||||
| } | ||||
|  | ||||
| return _M | ||||
| )-++**++-"; | ||||
							
								
								
									
										356
									
								
								Plugins/slua_unreal/External/luasocket/http.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										356
									
								
								Plugins/slua_unreal/External/luasocket/http.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,356 @@ | ||||
| R"-++**++-( | ||||
| ----------------------------------------------------------------------------- | ||||
| -- HTTP/1.1 client support for the Lua language. | ||||
| -- LuaSocket toolkit. | ||||
| -- Author: Diego Nehab | ||||
| ----------------------------------------------------------------------------- | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Declare module and import dependencies | ||||
| ------------------------------------------------------------------------------- | ||||
| local socket = require("socket") | ||||
| local url = require("socket.url") | ||||
| local ltn12 = require("ltn12") | ||||
| local mime = require("mime") | ||||
| local string = require("string") | ||||
| local headers = require("socket.headers") | ||||
| local base = _G | ||||
| local table = require("table") | ||||
| socket.http = {} | ||||
| local _M = socket.http | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Program constants | ||||
| ----------------------------------------------------------------------------- | ||||
| -- connection timeout in seconds | ||||
| TIMEOUT = 60 | ||||
| -- default port for document retrieval | ||||
| _M.PORT = 80 | ||||
| -- user agent field sent in request | ||||
| _M.USERAGENT = socket._VERSION | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Reads MIME headers from a connection, unfolding where needed | ||||
| ----------------------------------------------------------------------------- | ||||
| local function receiveheaders(sock, headers) | ||||
|     local line, name, value, err | ||||
|     headers = headers or {} | ||||
|     -- get first line | ||||
|     line, err = sock:receive() | ||||
|     if err then return nil, err end | ||||
|     -- headers go until a blank line is found | ||||
|     while line ~= "" do | ||||
|         -- get field-name and value | ||||
|         name, value = socket.skip(2, string.find(line, "^(.-):%s*(.*)")) | ||||
|         if not (name and value) then return nil, "malformed reponse headers" end | ||||
|         name = string.lower(name) | ||||
|         -- get next line (value might be folded) | ||||
|         line, err  = sock:receive() | ||||
|         if err then return nil, err end | ||||
|         -- unfold any folded values | ||||
|         while string.find(line, "^%s") do | ||||
|             value = value .. line | ||||
|             line = sock:receive() | ||||
|             if err then return nil, err end | ||||
|         end | ||||
|         -- save pair in table | ||||
|         if headers[name] then headers[name] = headers[name] .. ", " .. value | ||||
|         else headers[name] = value end | ||||
|     end | ||||
|     return headers | ||||
| end | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Extra sources and sinks | ||||
| ----------------------------------------------------------------------------- | ||||
| socket.sourcet["http-chunked"] = function(sock, headers) | ||||
|     return base.setmetatable({ | ||||
|         getfd = function() return sock:getfd() end, | ||||
|         dirty = function() return sock:dirty() end | ||||
|     }, { | ||||
|         __call = function() | ||||
|             -- get chunk size, skip extention | ||||
|             local line, err = sock:receive() | ||||
|             if err then return nil, err end | ||||
|             local size = base.tonumber(string.gsub(line, ";.*", ""), 16) | ||||
|             if not size then return nil, "invalid chunk size" end | ||||
|             -- was it the last chunk? | ||||
|             if size > 0 then | ||||
|                 -- if not, get chunk and skip terminating CRLF | ||||
|                 local chunk, err, part = sock:receive(size) | ||||
|                 if chunk then sock:receive() end | ||||
|                 return chunk, err | ||||
|             else | ||||
|                 -- if it was, read trailers into headers table | ||||
|                 headers, err = receiveheaders(sock, headers) | ||||
|                 if not headers then return nil, err end | ||||
|             end | ||||
|         end | ||||
|     }) | ||||
| end | ||||
|  | ||||
| socket.sinkt["http-chunked"] = function(sock) | ||||
|     return base.setmetatable({ | ||||
|         getfd = function() return sock:getfd() end, | ||||
|         dirty = function() return sock:dirty() end | ||||
|     }, { | ||||
|         __call = function(self, chunk, err) | ||||
|             if not chunk then return sock:send("0\r\n\r\n") end | ||||
|             local size = string.format("%X\r\n", string.len(chunk)) | ||||
|             return sock:send(size ..  chunk .. "\r\n") | ||||
|         end | ||||
|     }) | ||||
| end | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Low level HTTP API | ||||
| ----------------------------------------------------------------------------- | ||||
| local metat = { __index = {} } | ||||
|  | ||||
| function _M.open(host, port, create) | ||||
|     -- create socket with user connect function, or with default | ||||
|     local c = socket.try((create or socket.tcp)()) | ||||
|     local h = base.setmetatable({ c = c }, metat) | ||||
|     -- create finalized try | ||||
|     h.try = socket.newtry(function() h:close() end) | ||||
|     -- set timeout before connecting | ||||
|     h.try(c:settimeout(_M.TIMEOUT)) | ||||
|     h.try(c:connect(host, port or _M.PORT)) | ||||
|     -- here everything worked | ||||
|     return h | ||||
| end | ||||
|  | ||||
| function metat.__index:sendrequestline(method, uri) | ||||
|     local reqline = string.format("%s %s HTTP/1.1\r\n", method or "GET", uri) | ||||
|     return self.try(self.c:send(reqline)) | ||||
| end | ||||
|  | ||||
| function metat.__index:sendheaders(tosend) | ||||
|     local canonic = headers.canonic | ||||
|     local h = "\r\n" | ||||
|     for f, v in base.pairs(tosend) do | ||||
|         h = (canonic[f] or f) .. ": " .. v .. "\r\n" .. h | ||||
|     end | ||||
|     self.try(self.c:send(h)) | ||||
|     return 1 | ||||
| end | ||||
|  | ||||
| function metat.__index:sendbody(headers, source, step) | ||||
|     source = source or ltn12.source.empty() | ||||
|     step = step or ltn12.pump.step | ||||
|     -- if we don't know the size in advance, send chunked and hope for the best | ||||
|     local mode = "http-chunked" | ||||
|     if headers["content-length"] then mode = "keep-open" end | ||||
|     return self.try(ltn12.pump.all(source, socket.sink(mode, self.c), step)) | ||||
| end | ||||
|  | ||||
| function metat.__index:receivestatusline() | ||||
|     local status = self.try(self.c:receive(5)) | ||||
|     -- identify HTTP/0.9 responses, which do not contain a status line | ||||
|     -- this is just a heuristic, but is what the RFC recommends | ||||
|     if status ~= "HTTP/" then return nil, status end | ||||
|     -- otherwise proceed reading a status line | ||||
|     status = self.try(self.c:receive("*l", status)) | ||||
|     local code = socket.skip(2, string.find(status, "HTTP/%d*%.%d* (%d%d%d)")) | ||||
|     return self.try(base.tonumber(code), status) | ||||
| end | ||||
|  | ||||
| function metat.__index:receiveheaders() | ||||
|     return self.try(receiveheaders(self.c)) | ||||
| end | ||||
|  | ||||
| function metat.__index:receivebody(headers, sink, step) | ||||
|     sink = sink or ltn12.sink.null() | ||||
|     step = step or ltn12.pump.step | ||||
|     local length = base.tonumber(headers["content-length"]) | ||||
|     local t = headers["transfer-encoding"] -- shortcut | ||||
|     local mode = "default" -- connection close | ||||
|     if t and t ~= "identity" then mode = "http-chunked" | ||||
|     elseif base.tonumber(headers["content-length"]) then mode = "by-length" end | ||||
|     return self.try(ltn12.pump.all(socket.source(mode, self.c, length), | ||||
|         sink, step)) | ||||
| end | ||||
|  | ||||
| function metat.__index:receive09body(status, sink, step) | ||||
|     local source = ltn12.source.rewind(socket.source("until-closed", self.c)) | ||||
|     source(status) | ||||
|     return self.try(ltn12.pump.all(source, sink, step)) | ||||
| end | ||||
|  | ||||
| function metat.__index:close() | ||||
|     return self.c:close() | ||||
| end | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- High level HTTP API | ||||
| ----------------------------------------------------------------------------- | ||||
| local function adjusturi(reqt) | ||||
|     local u = reqt | ||||
|     -- if there is a proxy, we need the full url. otherwise, just a part. | ||||
|     if not reqt.proxy and not PROXY then | ||||
|         u = { | ||||
|            path = socket.try(reqt.path, "invalid path 'nil'"), | ||||
|            params = reqt.params, | ||||
|            query = reqt.query, | ||||
|            fragment = reqt.fragment | ||||
|         } | ||||
|     end | ||||
|     return url.build(u) | ||||
| end | ||||
|  | ||||
| local function adjustproxy(reqt) | ||||
|     local proxy = reqt.proxy or PROXY | ||||
|     if proxy then | ||||
|         proxy = url.parse(proxy) | ||||
|         return proxy.host, proxy.port or 3128 | ||||
|     else | ||||
|         return reqt.host, reqt.port | ||||
|     end | ||||
| end | ||||
|  | ||||
| local function adjustheaders(reqt) | ||||
|     -- default headers | ||||
|     local lower = { | ||||
|         ["user-agent"] = _M.USERAGENT, | ||||
|         ["host"] = reqt.host, | ||||
|         ["connection"] = "close, TE", | ||||
|         ["te"] = "trailers" | ||||
|     } | ||||
|     -- if we have authentication information, pass it along | ||||
|     if reqt.user and reqt.password then | ||||
|         lower["authorization"] =  | ||||
|             "Basic " ..  (mime.b64(reqt.user .. ":" .. reqt.password)) | ||||
|     end | ||||
|     -- override with user headers | ||||
|     for i,v in base.pairs(reqt.headers or lower) do | ||||
|         lower[string.lower(i)] = v | ||||
|     end | ||||
|     return lower | ||||
| end | ||||
|  | ||||
| -- default url parts | ||||
| local default = { | ||||
|     host = "", | ||||
|     port = _M.PORT, | ||||
|     path ="/", | ||||
|     scheme = "http" | ||||
| } | ||||
|  | ||||
| local function adjustrequest(reqt) | ||||
|     -- parse url if provided | ||||
|     local nreqt = reqt.url and url.parse(reqt.url, default) or {} | ||||
|     -- explicit components override url | ||||
|     for i,v in base.pairs(reqt) do nreqt[i] = v end | ||||
|     if nreqt.port == "" then nreqt.port = 80 end | ||||
|     socket.try(nreqt.host and nreqt.host ~= "",  | ||||
|         "invalid host '" .. base.tostring(nreqt.host) .. "'") | ||||
|     -- compute uri if user hasn't overriden | ||||
|     nreqt.uri = reqt.uri or adjusturi(nreqt) | ||||
|     -- ajust host and port if there is a proxy | ||||
|     nreqt.host, nreqt.port = adjustproxy(nreqt) | ||||
|     -- adjust headers in request | ||||
|     nreqt.headers = adjustheaders(nreqt) | ||||
|     return nreqt | ||||
| end | ||||
|  | ||||
| local function shouldredirect(reqt, code, headers) | ||||
|     return headers.location and | ||||
|            string.gsub(headers.location, "%s", "") ~= "" and | ||||
|            (reqt.redirect ~= false) and | ||||
|            (code == 301 or code == 302 or code == 303 or code == 307) and | ||||
|            (not reqt.method or reqt.method == "GET" or reqt.method == "HEAD") | ||||
|            and (not reqt.nredirects or reqt.nredirects < 5) | ||||
| end | ||||
|  | ||||
| local function shouldreceivebody(reqt, code) | ||||
|     if reqt.method == "HEAD" then return nil end | ||||
|     if code == 204 or code == 304 then return nil end | ||||
|     if code >= 100 and code < 200 then return nil end | ||||
|     return 1 | ||||
| end | ||||
|  | ||||
| -- forward declarations | ||||
| local trequest, tredirect | ||||
|  | ||||
| --[[local]] function tredirect(reqt, location) | ||||
|     local result, code, headers, status = trequest { | ||||
|         -- the RFC says the redirect URL has to be absolute, but some | ||||
|         -- servers do not respect that | ||||
|         url = url.absolute(reqt.url, location), | ||||
|         source = reqt.source, | ||||
|         sink = reqt.sink, | ||||
|         headers = reqt.headers, | ||||
|         proxy = reqt.proxy,  | ||||
|         nredirects = (reqt.nredirects or 0) + 1, | ||||
|         create = reqt.create | ||||
|     }    | ||||
|     -- pass location header back as a hint we redirected | ||||
|     headers = headers or {} | ||||
|     headers.location = headers.location or location | ||||
|     return result, code, headers, status | ||||
| end | ||||
|  | ||||
| --[[local]] function trequest(reqt) | ||||
|     -- we loop until we get what we want, or | ||||
|     -- until we are sure there is no way to get it | ||||
|     local nreqt = adjustrequest(reqt) | ||||
|     local h = _M.open(nreqt.host, nreqt.port, nreqt.create) | ||||
|     -- send request line and headers | ||||
|     h:sendrequestline(nreqt.method, nreqt.uri) | ||||
|     h:sendheaders(nreqt.headers) | ||||
|     -- if there is a body, send it | ||||
|     if nreqt.source then | ||||
|         h:sendbody(nreqt.headers, nreqt.source, nreqt.step)  | ||||
|     end | ||||
|     local code, status = h:receivestatusline() | ||||
|     -- if it is an HTTP/0.9 server, simply get the body and we are done | ||||
|     if not code then | ||||
|         h:receive09body(status, nreqt.sink, nreqt.step) | ||||
|         return 1, 200 | ||||
|     end | ||||
|     local headers | ||||
|     -- ignore any 100-continue messages | ||||
|     while code == 100 do  | ||||
|         headers = h:receiveheaders() | ||||
|         code, status = h:receivestatusline() | ||||
|     end | ||||
|     headers = h:receiveheaders() | ||||
|     -- at this point we should have a honest reply from the server | ||||
|     -- we can't redirect if we already used the source, so we report the error  | ||||
|     if shouldredirect(nreqt, code, headers) and not nreqt.source then | ||||
|         h:close() | ||||
|         return tredirect(reqt, headers.location) | ||||
|     end | ||||
|     -- here we are finally done | ||||
|     if shouldreceivebody(nreqt, code) then | ||||
|         h:receivebody(headers, nreqt.sink, nreqt.step) | ||||
|     end | ||||
|     h:close() | ||||
|     return 1, code, headers, status | ||||
| end | ||||
|  | ||||
| local function srequest(u, b) | ||||
|     local t = {} | ||||
|     local reqt = { | ||||
|         url = u, | ||||
|         sink = ltn12.sink.table(t) | ||||
|     } | ||||
|     if b then | ||||
|         reqt.source = ltn12.source.string(b) | ||||
|         reqt.headers = { | ||||
|             ["content-length"] = string.len(b), | ||||
|             ["content-type"] = "application/x-www-form-urlencoded" | ||||
|         } | ||||
|         reqt.method = "POST" | ||||
|     end | ||||
|     local code, headers, status = socket.skip(1, trequest(reqt)) | ||||
|     return table.concat(t), code, headers, status | ||||
| end | ||||
|  | ||||
| _M.request = socket.protect(function(reqt, body) | ||||
|     if base.type(reqt) == "string" then return srequest(reqt, body) | ||||
|     else return trequest(reqt) end | ||||
| end) | ||||
|  | ||||
| return _M | ||||
| )-++**++-"; | ||||
							
								
								
									
										544
									
								
								Plugins/slua_unreal/External/luasocket/inet.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										544
									
								
								Plugins/slua_unreal/External/luasocket/inet.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,544 @@ | ||||
| /*=========================================================================*\ | ||||
| * Internet domain functions | ||||
| * LuaSocket toolkit | ||||
| \*=========================================================================*/ | ||||
| #include <stdio.h> | ||||
| #include <stdlib.h> | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
|  | ||||
| #include "inet.h" | ||||
|  | ||||
|  #ifdef _WIN32 | ||||
| #define gai_strerror gai_strerrorA | ||||
| #endif | ||||
|  | ||||
| namespace NS_SLUA { | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Internal function prototypes. | ||||
| \*=========================================================================*/ | ||||
| static int inet_global_toip(lua_State *L); | ||||
| static int inet_global_getaddrinfo(lua_State *L); | ||||
| static int inet_global_tohostname(lua_State *L); | ||||
| static int inet_global_getnameinfo(lua_State *L); | ||||
| static void inet_pushresolved(lua_State *L, struct hostent *hp); | ||||
| static int inet_global_gethostname(lua_State *L); | ||||
|  | ||||
| /* DNS functions */ | ||||
| static luaL_Reg inet_func[] = { | ||||
|     { "toip", inet_global_toip}, | ||||
|     { "getaddrinfo", inet_global_getaddrinfo}, | ||||
|     { "tohostname", inet_global_tohostname}, | ||||
|     { "getnameinfo", inet_global_getnameinfo}, | ||||
|     { "gethostname", inet_global_gethostname}, | ||||
|     { NULL, NULL} | ||||
| }; | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Exported functions | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Initializes module | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int inet_open(lua_State *L) | ||||
| { | ||||
|     lua_pushstring(L, "dns"); | ||||
|     lua_newtable(L); | ||||
| #if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE) | ||||
|     luaL_setfuncs(L, inet_func, 0); | ||||
| #else | ||||
|     luaL_openlib(L, NULL, inet_func, 0); | ||||
| #endif | ||||
|     lua_settable(L, -3); | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Global Lua functions | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Returns all information provided by the resolver given a host name | ||||
| * or ip address | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int inet_gethost(const char *address, struct hostent **hp) { | ||||
|     struct in_addr addr; | ||||
|     if (inet_aton(address, &addr)) | ||||
|         return socket_gethostbyaddr((char *) &addr, sizeof(addr), hp); | ||||
|     else | ||||
|         return socket_gethostbyname(address, hp); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Returns all information provided by the resolver given a host name | ||||
| * or ip address | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int inet_global_tohostname(lua_State *L) { | ||||
|     const char *address = luaL_checkstring(L, 1); | ||||
|     struct hostent *hp = NULL; | ||||
|     int err = inet_gethost(address, &hp); | ||||
|     if (err != IO_DONE) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, socket_hoststrerror(err)); | ||||
|         return 2; | ||||
|     } | ||||
|     lua_pushstring(L, hp->h_name); | ||||
|     inet_pushresolved(L, hp); | ||||
|     return 2; | ||||
| } | ||||
|  | ||||
| static int inet_global_getnameinfo(lua_State *L) { | ||||
|     char hbuf[NI_MAXHOST]; | ||||
|     char sbuf[NI_MAXSERV]; | ||||
|     int i, ret; | ||||
|     struct addrinfo hints; | ||||
|     struct addrinfo *resolved, *iter; | ||||
|     const char *host = luaL_optstring(L, 1, NULL); | ||||
|     const char *serv = luaL_optstring(L, 2, NULL); | ||||
|  | ||||
|     if (!(host || serv)) | ||||
|         luaL_error(L, "host and serv cannot be both nil"); | ||||
|  | ||||
|     memset(&hints, 0, sizeof(hints)); | ||||
|     hints.ai_socktype = SOCK_STREAM; | ||||
|     hints.ai_family = PF_UNSPEC; | ||||
|  | ||||
|     ret = getaddrinfo(host, serv, &hints, &resolved); | ||||
|     if (ret != 0) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, socket_gaistrerror(ret)); | ||||
|         return 2; | ||||
|     } | ||||
|  | ||||
|     lua_newtable(L); | ||||
|     for (i = 1, iter = resolved; iter; i++, iter = iter->ai_next) { | ||||
|         getnameinfo(iter->ai_addr, (socklen_t) iter->ai_addrlen,  | ||||
|             hbuf, host? (socklen_t) sizeof(hbuf): 0,  | ||||
|             sbuf, serv? (socklen_t) sizeof(sbuf): 0, 0); | ||||
|         if (host) { | ||||
|             lua_pushnumber(L, i); | ||||
|             lua_pushstring(L, hbuf); | ||||
|             lua_settable(L, -3); | ||||
|         } | ||||
|     } | ||||
|     freeaddrinfo(resolved); | ||||
|  | ||||
|     if (serv) { | ||||
|         lua_pushstring(L, sbuf); | ||||
|         return 2; | ||||
|     } else { | ||||
|         return 1; | ||||
|     } | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Returns all information provided by the resolver given a host name | ||||
| * or ip address | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int inet_global_toip(lua_State *L) | ||||
| { | ||||
|     const char *address = luaL_checkstring(L, 1); | ||||
|     struct hostent *hp = NULL; | ||||
|     int err = inet_gethost(address, &hp); | ||||
|     if (err != IO_DONE) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, socket_hoststrerror(err)); | ||||
|         return 2; | ||||
|     } | ||||
|     lua_pushstring(L, inet_ntoa(*((struct in_addr *) hp->h_addr))); | ||||
|     inet_pushresolved(L, hp); | ||||
|     return 2; | ||||
| } | ||||
|  | ||||
| int inet_optfamily(lua_State* L, int narg, const char* def) | ||||
| { | ||||
|     static const char* optname[] = { "unspec", "inet", "inet6", NULL }; | ||||
|     static int optvalue[] = { PF_UNSPEC, PF_INET, PF_INET6, 0 }; | ||||
|  | ||||
|     return optvalue[luaL_checkoption(L, narg, def, optname)]; | ||||
| } | ||||
|  | ||||
| int inet_optsocktype(lua_State* L, int narg, const char* def) | ||||
| { | ||||
|     static const char* optname[] = { "stream", "dgram", NULL }; | ||||
|     static int optvalue[] = { SOCK_STREAM, SOCK_DGRAM, 0 }; | ||||
|  | ||||
|     return optvalue[luaL_checkoption(L, narg, def, optname)]; | ||||
| } | ||||
|  | ||||
| static int inet_global_getaddrinfo(lua_State *L) | ||||
| { | ||||
|     const char *hostname = luaL_checkstring(L, 1); | ||||
|     struct addrinfo *iterator = NULL, *resolved = NULL; | ||||
|     struct addrinfo hints; | ||||
|     int i = 1, ret = 0; | ||||
|     memset(&hints, 0, sizeof(hints)); | ||||
|     hints.ai_socktype = SOCK_STREAM; | ||||
|     hints.ai_family = PF_UNSPEC; | ||||
|     ret = getaddrinfo(hostname, NULL, &hints, &resolved); | ||||
|     if (ret != 0) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, socket_gaistrerror(ret)); | ||||
|         return 2; | ||||
|     } | ||||
|     lua_newtable(L); | ||||
|     for (iterator = resolved; iterator; iterator = iterator->ai_next) { | ||||
|         char hbuf[NI_MAXHOST]; | ||||
|         ret = getnameinfo(iterator->ai_addr, (socklen_t) iterator->ai_addrlen,  | ||||
|             hbuf, (socklen_t) sizeof(hbuf), NULL, 0, NI_NUMERICHOST); | ||||
|         if (ret){ | ||||
|           lua_pushnil(L); | ||||
|           lua_pushstring(L, socket_gaistrerror(ret)); | ||||
|           return 2; | ||||
|         } | ||||
|         lua_pushnumber(L, i); | ||||
|         lua_newtable(L); | ||||
|         switch (iterator->ai_family) { | ||||
|             case AF_INET: | ||||
|                 lua_pushliteral(L, "family"); | ||||
|                 lua_pushliteral(L, "inet"); | ||||
|                 lua_settable(L, -3); | ||||
|                 break; | ||||
|             case AF_INET6: | ||||
|                 lua_pushliteral(L, "family"); | ||||
|                 lua_pushliteral(L, "inet6"); | ||||
|                 lua_settable(L, -3); | ||||
|                 break; | ||||
|         } | ||||
|         lua_pushliteral(L, "addr"); | ||||
|         lua_pushstring(L, hbuf); | ||||
|         lua_settable(L, -3); | ||||
|         lua_settable(L, -3); | ||||
|         i++; | ||||
|     } | ||||
|     freeaddrinfo(resolved); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Gets the host name | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int inet_global_gethostname(lua_State *L) | ||||
| { | ||||
|     char name[257]; | ||||
|     name[256] = '\0'; | ||||
|     if (gethostname(name, 256) < 0) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, socket_strerror(errno)); | ||||
|         return 2; | ||||
|     } else { | ||||
|         lua_pushstring(L, name); | ||||
|         return 1; | ||||
|     } | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Lua methods | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Retrieves socket peer name | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int inet_meth_getpeername(lua_State *L, p_socket ps, int family) | ||||
| { | ||||
|     int err; | ||||
|     struct sockaddr_storage peer; | ||||
|     socklen_t peer_len = sizeof(peer); | ||||
|     char name[INET6_ADDRSTRLEN]; | ||||
|     char port[6]; /* 65535 = 5 bytes + 0 to terminate it */ | ||||
|     if (getpeername(*ps, (SA *) &peer, &peer_len) < 0) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, socket_strerror(errno)); | ||||
|         return 2; | ||||
|     } | ||||
| 	err = getnameinfo((struct sockaddr *) &peer, peer_len, | ||||
|         name, INET6_ADDRSTRLEN, | ||||
|         port, sizeof(port), NI_NUMERICHOST | NI_NUMERICSERV); | ||||
|     if (err) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, gai_strerror(err)); | ||||
|         return 2; | ||||
|     } | ||||
|     lua_pushstring(L, name); | ||||
|     lua_pushinteger(L, (int) strtol(port, (char **) NULL, 10)); | ||||
|     if (family == PF_INET) { | ||||
|         lua_pushliteral(L, "inet"); | ||||
|     } else if (family == PF_INET6) { | ||||
|         lua_pushliteral(L, "inet6"); | ||||
|     } else { | ||||
|         lua_pushliteral(L, "uknown family"); | ||||
|     } | ||||
|     return 3; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Retrieves socket local name | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int inet_meth_getsockname(lua_State *L, p_socket ps, int family) | ||||
| { | ||||
|     int err; | ||||
|     struct sockaddr_storage peer; | ||||
|     socklen_t peer_len = sizeof(peer); | ||||
|     char name[INET6_ADDRSTRLEN]; | ||||
|     char port[6]; /* 65535 = 5 bytes + 0 to terminate it */ | ||||
|     if (getsockname(*ps, (SA *) &peer, &peer_len) < 0) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, socket_strerror(errno)); | ||||
|         return 2; | ||||
|     } | ||||
| 	err=getnameinfo((struct sockaddr *)&peer, peer_len,  | ||||
| 		name, INET6_ADDRSTRLEN, port, 6, NI_NUMERICHOST | NI_NUMERICSERV); | ||||
|     if (err) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, gai_strerror(err)); | ||||
|         return 2; | ||||
|     } | ||||
|     lua_pushstring(L, name); | ||||
|     lua_pushstring(L, port); | ||||
|     if (family == PF_INET) { | ||||
|         lua_pushliteral(L, "inet"); | ||||
|     } else if (family == PF_INET6) { | ||||
|         lua_pushliteral(L, "inet6"); | ||||
|     } else { | ||||
|         lua_pushliteral(L, "uknown family"); | ||||
|     } | ||||
|     return 3; | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Internal functions | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Passes all resolver information to Lua as a table | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static void inet_pushresolved(lua_State *L, struct hostent *hp) | ||||
| { | ||||
|     char **alias; | ||||
|     struct in_addr **addr; | ||||
|     int i, resolved; | ||||
|     lua_newtable(L); resolved = lua_gettop(L); | ||||
|     lua_pushstring(L, "name"); | ||||
|     lua_pushstring(L, hp->h_name); | ||||
|     lua_settable(L, resolved); | ||||
|     lua_pushstring(L, "ip"); | ||||
|     lua_pushstring(L, "alias"); | ||||
|     i = 1; | ||||
|     alias = hp->h_aliases; | ||||
|     lua_newtable(L); | ||||
|     if (alias) { | ||||
|         while (*alias) { | ||||
|             lua_pushnumber(L, i); | ||||
|             lua_pushstring(L, *alias); | ||||
|             lua_settable(L, -3); | ||||
|             i++; alias++; | ||||
|         } | ||||
|     } | ||||
|     lua_settable(L, resolved); | ||||
|     i = 1; | ||||
|     lua_newtable(L); | ||||
|     addr = (struct in_addr **) hp->h_addr_list; | ||||
|     if (addr) { | ||||
|         while (*addr) { | ||||
|             lua_pushnumber(L, i); | ||||
|             lua_pushstring(L, inet_ntoa(**addr)); | ||||
|             lua_settable(L, -3); | ||||
|             i++; addr++; | ||||
|         } | ||||
|     } | ||||
|     lua_settable(L, resolved); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Tries to create a new inet socket | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| const char *inet_trycreate(p_socket ps, int family, int type) { | ||||
|     return socket_strerror(socket_create(ps, family, type, 0)); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * "Disconnects" a DGRAM socket | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| const char *inet_trydisconnect(p_socket ps, int family, p_timeout tm) | ||||
| { | ||||
|     switch (family) { | ||||
|         case PF_INET: { | ||||
|             struct sockaddr_in sin; | ||||
|             memset((char *) &sin, 0, sizeof(sin)); | ||||
|             sin.sin_family = AF_UNSPEC; | ||||
|             sin.sin_addr.s_addr = INADDR_ANY; | ||||
|             return socket_strerror(socket_connect(ps, (SA *) &sin,  | ||||
|                 sizeof(sin), tm)); | ||||
|         } | ||||
|         case PF_INET6: { | ||||
|             struct sockaddr_in6 sin6; | ||||
|             struct in6_addr addrany = IN6ADDR_ANY_INIT;  | ||||
|             memset((char *) &sin6, 0, sizeof(sin6)); | ||||
|             sin6.sin6_family = AF_UNSPEC; | ||||
|             sin6.sin6_addr = addrany; | ||||
|             return socket_strerror(socket_connect(ps, (SA *) &sin6,  | ||||
|                 sizeof(sin6), tm)); | ||||
|         } | ||||
|     } | ||||
|     return NULL; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Tries to connect to remote address (address, port) | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| const char *inet_tryconnect(p_socket ps, int *family, const char *address, | ||||
|         const char *serv, p_timeout tm, struct addrinfo *connecthints) | ||||
| { | ||||
|     struct addrinfo *iterator = NULL, *resolved = NULL; | ||||
|     const char *err = NULL; | ||||
|     /* try resolving */ | ||||
|     err = socket_gaistrerror(getaddrinfo(address, serv, | ||||
|                 connecthints, &resolved)); | ||||
|     if (err != NULL) { | ||||
|         if (resolved) freeaddrinfo(resolved); | ||||
|         return err; | ||||
|     } | ||||
|     for (iterator = resolved; iterator; iterator = iterator->ai_next) { | ||||
|         timeout_markstart(tm); | ||||
|         /* create new socket if necessary. if there was no | ||||
|          * bind, we need to create one for every new family | ||||
|          * that shows up while iterating. if there was a | ||||
|          * bind, all families will be the same and we will | ||||
|          * not enter this branch. */ | ||||
|         if (*family != iterator->ai_family) { | ||||
|             socket_destroy(ps); | ||||
|             err = socket_strerror(socket_create(ps, iterator->ai_family,  | ||||
|                 iterator->ai_socktype, iterator->ai_protocol)); | ||||
|             if (err != NULL) { | ||||
|                 freeaddrinfo(resolved); | ||||
|                 return err; | ||||
|             } | ||||
|             *family = iterator->ai_family; | ||||
|             /* all sockets initially non-blocking */ | ||||
|             socket_setnonblocking(ps); | ||||
|         } | ||||
|         /* try connecting to remote address */ | ||||
|         err = socket_strerror(socket_connect(ps, (SA *) iterator->ai_addr,  | ||||
|             (socklen_t) iterator->ai_addrlen, tm)); | ||||
|         /* if success, break out of loop */ | ||||
|         if (err == NULL) break; | ||||
|     } | ||||
|     freeaddrinfo(resolved); | ||||
|     /* here, if err is set, we failed */ | ||||
|     return err; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Tries to accept a socket | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| const char *inet_tryaccept(p_socket server, int family, p_socket client,  | ||||
|     p_timeout tm) | ||||
| { | ||||
| 	socklen_t len; | ||||
| 	t_sockaddr_storage addr; | ||||
| 	if (family == PF_INET6) { | ||||
| 		len = sizeof(struct sockaddr_in6); | ||||
| 	} else { | ||||
| 		len = sizeof(struct sockaddr_in); | ||||
| 	} | ||||
| 	return socket_strerror(socket_accept(server, client, (SA *) &addr,  | ||||
|         &len, tm)); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Tries to bind socket to (address, port) | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| const char *inet_trybind(p_socket ps, const char *address, const char *serv, | ||||
|         struct addrinfo *bindhints) | ||||
| { | ||||
|     struct addrinfo *iterator = NULL, *resolved = NULL; | ||||
|     const char *err = NULL; | ||||
|     t_socket sock = *ps; | ||||
|     /* translate luasocket special values to C */ | ||||
|     if (strcmp(address, "*") == 0) address = NULL; | ||||
|     if (!serv) serv = "0"; | ||||
|     /* try resolving */ | ||||
|     err = socket_gaistrerror(getaddrinfo(address, serv, bindhints, &resolved)); | ||||
|     if (err) { | ||||
|         if (resolved) freeaddrinfo(resolved); | ||||
|         return err; | ||||
|     } | ||||
|     /* iterate over resolved addresses until one is good */ | ||||
|     for (iterator = resolved; iterator; iterator = iterator->ai_next) { | ||||
|         if(sock == SOCKET_INVALID) { | ||||
|             err = socket_strerror(socket_create(&sock, iterator->ai_family, | ||||
|                         iterator->ai_socktype, iterator->ai_protocol)); | ||||
|             if(err) | ||||
|                 continue; | ||||
|         } | ||||
|         /* try binding to local address */ | ||||
|         err = socket_strerror(socket_bind(&sock, | ||||
|             (SA *) iterator->ai_addr, | ||||
|             (socklen_t) iterator->ai_addrlen)); | ||||
|  | ||||
|         /* keep trying unless bind succeeded */ | ||||
|         if (err) { | ||||
|             if(sock != *ps) | ||||
|                 socket_destroy(&sock); | ||||
|         } else { | ||||
|             /* remember what we connected to, particularly the family */ | ||||
|             *bindhints = *iterator; | ||||
|             break; | ||||
|         } | ||||
|     } | ||||
|     /* cleanup and return error */ | ||||
|     freeaddrinfo(resolved); | ||||
|     *ps = sock; | ||||
|     return err; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Some systems do not provide these so that we provide our own.  | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| #ifdef LUASOCKET_INET_ATON | ||||
| int inet_aton(const char *cp, struct in_addr *inp) | ||||
| { | ||||
|     unsigned int a = 0, b = 0, c = 0, d = 0; | ||||
|     int n = 0, r; | ||||
|     unsigned long int addr = 0; | ||||
|     r = sscanf(cp, "%u.%u.%u.%u%n", &a, &b, &c, &d, &n); | ||||
|     if (r == 0 || n == 0) return 0; | ||||
|     cp += n; | ||||
|     if (*cp) return 0; | ||||
|     if (a > 255 || b > 255 || c > 255 || d > 255) return 0; | ||||
|     if (inp) { | ||||
|         addr += a; addr <<= 8; | ||||
|         addr += b; addr <<= 8; | ||||
|         addr += c; addr <<= 8; | ||||
|         addr += d; | ||||
|         inp->s_addr = htonl(addr); | ||||
|     } | ||||
|     return 1; | ||||
| } | ||||
| #endif | ||||
|  | ||||
| #ifdef LUASOCKET_INET_PTON | ||||
| int inet_pton(int af, const char *src, void *dst)  | ||||
| { | ||||
|     struct addrinfo hints, *res; | ||||
|     int ret = 1; | ||||
|     memset(&hints, 0, sizeof(struct addrinfo)); | ||||
|     hints.ai_family = af; | ||||
|     hints.ai_flags = AI_NUMERICHOST; | ||||
|     if (getaddrinfo(src, NULL, &hints, &res) != 0) return -1; | ||||
|     if (af == AF_INET) { | ||||
|         struct sockaddr_in *in = (struct sockaddr_in *) res->ai_addr; | ||||
|         memcpy(dst, &in->sin_addr, sizeof(in->sin_addr)); | ||||
|     } else if (af == AF_INET6) { | ||||
|         struct sockaddr_in6 *in = (struct sockaddr_in6 *) res->ai_addr; | ||||
|         memcpy(dst, &in->sin6_addr, sizeof(in->sin6_addr)); | ||||
|     } else { | ||||
|         ret = -1; | ||||
|     } | ||||
|     freeaddrinfo(res);  | ||||
|     return ret; | ||||
| } | ||||
|  | ||||
| #endif | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										54
									
								
								Plugins/slua_unreal/External/luasocket/inet.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										54
									
								
								Plugins/slua_unreal/External/luasocket/inet.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,54 @@ | ||||
| #ifndef INET_H  | ||||
| #define INET_H  | ||||
| /*=========================================================================*\ | ||||
| * Internet domain functions | ||||
| * LuaSocket toolkit | ||||
| * | ||||
| * This module implements the creation and connection of internet domain | ||||
| * sockets, on top of the socket.h interface, and the interface of with the | ||||
| * resolver.  | ||||
| * | ||||
| * The function inet_aton is provided for the platforms where it is not | ||||
| * available. The module also implements the interface of the internet | ||||
| * getpeername and getsockname functions as seen by Lua programs. | ||||
| * | ||||
| * The Lua functions toip and tohostname are also implemented here. | ||||
| \*=========================================================================*/ | ||||
| #include "lua.h" | ||||
| #include "socket.h" | ||||
| #include "timeout.h" | ||||
|  | ||||
| #ifdef _WIN32 | ||||
| #define LUASOCKET_INET_ATON | ||||
| #endif | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| int inet_open(lua_State *L); | ||||
|  | ||||
| const char *inet_trycreate(p_socket ps, int family, int type); | ||||
| const char *inet_tryconnect(p_socket ps, int *family, const char *address, | ||||
|         const char *serv, p_timeout tm, struct addrinfo *connecthints); | ||||
| const char *inet_trybind(p_socket ps, const char *address, const char *serv, | ||||
|         struct addrinfo *bindhints); | ||||
| const char *inet_trydisconnect(p_socket ps, int family, p_timeout tm); | ||||
| const char *inet_tryaccept(p_socket server, int family, p_socket client, p_timeout tm); | ||||
|  | ||||
| int inet_meth_getpeername(lua_State *L, p_socket ps, int family); | ||||
| int inet_meth_getsockname(lua_State *L, p_socket ps, int family); | ||||
|  | ||||
| int inet_optfamily(lua_State* L, int narg, const char* def); | ||||
| int inet_optsocktype(lua_State* L, int narg, const char* def); | ||||
|  | ||||
| #ifdef LUASOCKET_INET_ATON | ||||
| int inet_aton(const char *cp, struct in_addr *inp); | ||||
| #endif | ||||
|  | ||||
| #ifdef LUASOCKET_INET_PTON | ||||
| const char *inet_ntop(int af, const void *src, char *dst, socklen_t cnt); | ||||
| int inet_pton(int af, const char *src, void *dst); | ||||
| #endif | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif /* INET_H */ | ||||
							
								
								
									
										34
									
								
								Plugins/slua_unreal/External/luasocket/io.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										34
									
								
								Plugins/slua_unreal/External/luasocket/io.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,34 @@ | ||||
| /*=========================================================================*\ | ||||
| * Input/Output abstraction | ||||
| * LuaSocket toolkit | ||||
| \*=========================================================================*/ | ||||
| #include "io.h" | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Exported functions | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Initializes C structure | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| void io_init(p_io io, p_send send, p_recv recv, p_error error, void *ctx) { | ||||
|     io->send = send; | ||||
|     io->recv = recv; | ||||
|     io->error = error; | ||||
|     io->ctx = ctx; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * I/O error strings | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| const char *io_strerror(int err) { | ||||
|     switch (err) { | ||||
|         case IO_DONE: return NULL; | ||||
|         case IO_CLOSED: return "closed"; | ||||
|         case IO_TIMEOUT: return "timeout"; | ||||
|         default: return "unknown error";  | ||||
|     } | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										69
									
								
								Plugins/slua_unreal/External/luasocket/io.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										69
									
								
								Plugins/slua_unreal/External/luasocket/io.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,69 @@ | ||||
| #ifndef IO_H | ||||
| #define IO_H | ||||
| /*=========================================================================*\ | ||||
| * Input/Output abstraction | ||||
| * LuaSocket toolkit | ||||
| * | ||||
| * This module defines the interface that LuaSocket expects from the | ||||
| * transport layer for streamed input/output. The idea is that if any | ||||
| * transport implements this interface, then the buffer.c functions | ||||
| * automatically work on it. | ||||
| * | ||||
| * The module socket.h implements this interface, and thus the module tcp.h | ||||
| * is very simple. | ||||
| \*=========================================================================*/ | ||||
| #include <stdio.h> | ||||
| #include "lua.h" | ||||
|  | ||||
| #include "timeout.h" | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| /* IO error codes */ | ||||
| enum { | ||||
|     IO_DONE = 0,        /* operation completed successfully */ | ||||
|     IO_TIMEOUT = -1,    /* operation timed out */ | ||||
|     IO_CLOSED = -2,     /* the connection has been closed */ | ||||
| 	IO_UNKNOWN = -3      | ||||
| }; | ||||
|  | ||||
| /* interface to error message function */ | ||||
| typedef const char *(*p_error) ( | ||||
|     void *ctx,          /* context needed by send */ | ||||
|     int err             /* error code */ | ||||
| ); | ||||
|  | ||||
| /* interface to send function */ | ||||
| typedef int (*p_send) ( | ||||
|     void *ctx,          /* context needed by send */ | ||||
|     const char *data,   /* pointer to buffer with data to send */ | ||||
|     size_t count,       /* number of bytes to send from buffer */ | ||||
|     size_t *sent,       /* number of bytes sent uppon return */ | ||||
|     p_timeout tm        /* timeout control */ | ||||
| ); | ||||
|  | ||||
| /* interface to recv function */ | ||||
| typedef int (*p_recv) ( | ||||
|     void *ctx,          /* context needed by recv */ | ||||
|     char *data,         /* pointer to buffer where data will be writen */ | ||||
|     size_t count,       /* number of bytes to receive into buffer */ | ||||
|     size_t *got,        /* number of bytes received uppon return */ | ||||
|     p_timeout tm        /* timeout control */ | ||||
| ); | ||||
|  | ||||
| /* IO driver definition */ | ||||
| typedef struct t_io_ { | ||||
|     void *ctx;          /* context needed by send/recv */ | ||||
|     p_send send;        /* send function pointer */ | ||||
|     p_recv recv;        /* receive function pointer */ | ||||
|     p_error error;      /* strerror function */ | ||||
| } t_io; | ||||
| typedef t_io *p_io; | ||||
|  | ||||
| void io_init(p_io io, p_send send, p_recv recv, p_error error, void *ctx); | ||||
| const char *io_strerror(int err); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif /* IO_H */ | ||||
|  | ||||
							
								
								
									
										300
									
								
								Plugins/slua_unreal/External/luasocket/ltn12.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										300
									
								
								Plugins/slua_unreal/External/luasocket/ltn12.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,300 @@ | ||||
| R"-++**++-( | ||||
| ----------------------------------------------------------------------------- | ||||
| -- LTN12 - Filters, sources, sinks and pumps. | ||||
| -- LuaSocket toolkit. | ||||
| -- Author: Diego Nehab | ||||
| ----------------------------------------------------------------------------- | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Declare module | ||||
| ----------------------------------------------------------------------------- | ||||
| local string = require("string") | ||||
| local table = require("table") | ||||
| local base = _G | ||||
| local _M = {} | ||||
| if module then -- heuristic for exporting a global package table | ||||
|     ltn12 = _M | ||||
| end | ||||
| local filter,source,sink,pump = {},{},{},{} | ||||
|  | ||||
| _M.filter = filter | ||||
| _M.source = source | ||||
| _M.sink = sink | ||||
| _M.pump = pump | ||||
|  | ||||
| -- 2048 seems to be better in windows... | ||||
| _M.BLOCKSIZE = 2048 | ||||
| _M._VERSION = "LTN12 1.0.3" | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Filter stuff | ||||
| ----------------------------------------------------------------------------- | ||||
| -- returns a high level filter that cycles a low-level filter | ||||
| function filter.cycle(low, ctx, extra) | ||||
|     base.assert(low) | ||||
|     return function(chunk) | ||||
|         local ret | ||||
|         ret, ctx = low(ctx, chunk, extra) | ||||
|         return ret | ||||
|     end | ||||
| end | ||||
|  | ||||
| -- chains a bunch of filters together | ||||
| -- (thanks to Wim Couwenberg) | ||||
| function filter.chain(...) | ||||
|     local arg = {...} | ||||
|     local n = select('#',...) | ||||
|     local top, index = 1, 1 | ||||
|     local retry = "" | ||||
|     return function(chunk) | ||||
|         retry = chunk and retry | ||||
|         while true do | ||||
|             if index == top then | ||||
|                 chunk = arg[index](chunk) | ||||
|                 if chunk == "" or top == n then return chunk | ||||
|                 elseif chunk then index = index + 1 | ||||
|                 else | ||||
|                     top = top+1 | ||||
|                     index = top | ||||
|                 end | ||||
|             else | ||||
|                 chunk = arg[index](chunk or "") | ||||
|                 if chunk == "" then | ||||
|                     index = index - 1 | ||||
|                     chunk = retry | ||||
|                 elseif chunk then | ||||
|                     if index == n then return chunk | ||||
|                     else index = index + 1 end | ||||
|                 else base.error("filter returned inappropriate nil") end | ||||
|             end | ||||
|         end | ||||
|     end | ||||
| end | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Source stuff | ||||
| ----------------------------------------------------------------------------- | ||||
| -- create an empty source | ||||
| local function empty() | ||||
|     return nil | ||||
| end | ||||
|  | ||||
| function source.empty() | ||||
|     return empty | ||||
| end | ||||
|  | ||||
| -- returns a source that just outputs an error | ||||
| function source.error(err) | ||||
|     return function() | ||||
|         return nil, err | ||||
|     end | ||||
| end | ||||
|  | ||||
| -- creates a file source | ||||
| function source.file(handle, io_err) | ||||
|     if handle then | ||||
|         return function() | ||||
|             local chunk = handle:read(_M.BLOCKSIZE) | ||||
|             if not chunk then handle:close() end | ||||
|             return chunk | ||||
|         end | ||||
|     else return source.error(io_err or "unable to open file") end | ||||
| end | ||||
|  | ||||
| -- turns a fancy source into a simple source | ||||
| function source.simplify(src) | ||||
|     base.assert(src) | ||||
|     return function() | ||||
|         local chunk, err_or_new = src() | ||||
|         src = err_or_new or src | ||||
|         if not chunk then return nil, err_or_new | ||||
|         else return chunk end | ||||
|     end | ||||
| end | ||||
|  | ||||
| -- creates string source | ||||
| function source.string(s) | ||||
|     if s then | ||||
|         local i = 1 | ||||
|         return function() | ||||
|             local chunk = string.sub(s, i, i+_M.BLOCKSIZE-1) | ||||
|             i = i + _M.BLOCKSIZE | ||||
|             if chunk ~= "" then return chunk | ||||
|             else return nil end | ||||
|         end | ||||
|     else return source.empty() end | ||||
| end | ||||
|  | ||||
| -- creates rewindable source | ||||
| function source.rewind(src) | ||||
|     base.assert(src) | ||||
|     local t = {} | ||||
|     return function(chunk) | ||||
|         if not chunk then | ||||
|             chunk = table.remove(t) | ||||
|             if not chunk then return src() | ||||
|             else return chunk end | ||||
|         else | ||||
|             table.insert(t, chunk) | ||||
|         end | ||||
|     end | ||||
| end | ||||
|  | ||||
| function source.chain(src, f) | ||||
|     base.assert(src and f) | ||||
|     local last_in, last_out = "", "" | ||||
|     local state = "feeding" | ||||
|     local err | ||||
|     return function() | ||||
|         if not last_out then | ||||
|             base.error('source is empty!', 2) | ||||
|         end | ||||
|         while true do | ||||
|             if state == "feeding" then | ||||
|                 last_in, err = src() | ||||
|                 if err then return nil, err end | ||||
|                 last_out = f(last_in) | ||||
|                 if not last_out then | ||||
|                     if last_in then | ||||
|                         base.error('filter returned inappropriate nil') | ||||
|                     else | ||||
|                         return nil | ||||
|                     end | ||||
|                 elseif last_out ~= "" then | ||||
|                     state = "eating" | ||||
|                     if last_in then last_in = "" end | ||||
|                     return last_out | ||||
|                 end | ||||
|             else | ||||
|                 last_out = f(last_in) | ||||
|                 if last_out == "" then | ||||
|                     if last_in == "" then | ||||
|                         state = "feeding" | ||||
|                     else | ||||
|                         base.error('filter returned ""') | ||||
|                     end | ||||
|                 elseif not last_out then | ||||
|                     if last_in then | ||||
|                         base.error('filter returned inappropriate nil') | ||||
|                     else | ||||
|                         return nil | ||||
|                     end | ||||
|                 else | ||||
|                     return last_out | ||||
|                 end | ||||
|             end | ||||
|         end | ||||
|     end | ||||
| end | ||||
|  | ||||
| -- creates a source that produces contents of several sources, one after the | ||||
| -- other, as if they were concatenated | ||||
| -- (thanks to Wim Couwenberg) | ||||
| function source.cat(...) | ||||
|     local arg = {...} | ||||
|     local src = table.remove(arg, 1) | ||||
|     return function() | ||||
|         while src do | ||||
|             local chunk, err = src() | ||||
|             if chunk then return chunk end | ||||
|             if err then return nil, err end | ||||
|             src = table.remove(arg, 1) | ||||
|         end | ||||
|     end | ||||
| end | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Sink stuff | ||||
| ----------------------------------------------------------------------------- | ||||
| -- creates a sink that stores into a table | ||||
| function sink.table(t) | ||||
|     t = t or {} | ||||
|     local f = function(chunk, err) | ||||
|         if chunk then table.insert(t, chunk) end | ||||
|         return 1 | ||||
|     end | ||||
|     return f, t | ||||
| end | ||||
|  | ||||
| -- turns a fancy sink into a simple sink | ||||
| function sink.simplify(snk) | ||||
|     base.assert(snk) | ||||
|     return function(chunk, err) | ||||
|         local ret, err_or_new = snk(chunk, err) | ||||
|         if not ret then return nil, err_or_new end | ||||
|         snk = err_or_new or snk | ||||
|         return 1 | ||||
|     end | ||||
| end | ||||
|  | ||||
| -- creates a file sink | ||||
| function sink.file(handle, io_err) | ||||
|     if handle then | ||||
|         return function(chunk, err) | ||||
|             if not chunk then | ||||
|                 handle:close() | ||||
|                 return 1 | ||||
|             else return handle:write(chunk) end | ||||
|         end | ||||
|     else return sink.error(io_err or "unable to open file") end | ||||
| end | ||||
|  | ||||
| -- creates a sink that discards data | ||||
| local function null() | ||||
|     return 1 | ||||
| end | ||||
|  | ||||
| function sink.null() | ||||
|     return null | ||||
| end | ||||
|  | ||||
| -- creates a sink that just returns an error | ||||
| function sink.error(err) | ||||
|     return function() | ||||
|         return nil, err | ||||
|     end | ||||
| end | ||||
|  | ||||
| -- chains a sink with a filter | ||||
| function sink.chain(f, snk) | ||||
|     base.assert(f and snk) | ||||
|     return function(chunk, err) | ||||
|         if chunk ~= "" then | ||||
|             local filtered = f(chunk) | ||||
|             local done = chunk and "" | ||||
|             while true do | ||||
|                 local ret, snkerr = snk(filtered, err) | ||||
|                 if not ret then return nil, snkerr end | ||||
|                 if filtered == done then return 1 end | ||||
|                 filtered = f(done) | ||||
|             end | ||||
|         else return 1 end | ||||
|     end | ||||
| end | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Pump stuff | ||||
| ----------------------------------------------------------------------------- | ||||
| -- pumps one chunk from the source to the sink | ||||
| function pump.step(src, snk) | ||||
|     local chunk, src_err = src() | ||||
|     local ret, snk_err = snk(chunk, src_err) | ||||
|     if chunk and ret then return 1 | ||||
|     else return nil, src_err or snk_err end | ||||
| end | ||||
|  | ||||
| -- pumps all data from a source to a sink, using a step function | ||||
| function pump.all(src, snk, step) | ||||
|     base.assert(src and snk) | ||||
|     step = step or pump.step | ||||
|     while true do | ||||
|         local ret, err = step(src, snk) | ||||
|         if not ret then | ||||
|             if err then return nil, err | ||||
|             else return 1 end | ||||
|         end | ||||
|     end | ||||
| end | ||||
|  | ||||
| return _M | ||||
| )-++**++-"; | ||||
							
								
								
									
										130
									
								
								Plugins/slua_unreal/External/luasocket/luasocket.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										130
									
								
								Plugins/slua_unreal/External/luasocket/luasocket.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,130 @@ | ||||
| /*=========================================================================*\ | ||||
| * LuaSocket toolkit | ||||
| * Networking support for the Lua language | ||||
| * Diego Nehab | ||||
| * 26/11/1999 | ||||
| * | ||||
| * This library is part of an  effort to progressively increase the network | ||||
| * connectivity  of  the Lua  language.  The  Lua interface  to  networking | ||||
| * functions follows the Sockets API  closely, trying to simplify all tasks | ||||
| * involved in setting up both  client and server connections. The provided | ||||
| * IO routines, however, follow the Lua  style, being very similar  to the | ||||
| * standard Lua read and write functions. | ||||
| \*=========================================================================*/ | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Standard include files | ||||
| \*=========================================================================*/ | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
|  | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * LuaSocket includes | ||||
| \*=========================================================================*/ | ||||
| #include "luasocket.h" | ||||
| #include "auxiliar.h" | ||||
| #include "except.h" | ||||
| #include "timeout.h" | ||||
| #include "buffer.h" | ||||
| #include "inet.h" | ||||
| #include "tcp.h" | ||||
| #include "udp.h" | ||||
| #include "select.h" | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Internal function prototypes | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int global_skip(lua_State *L); | ||||
| static int global_unload(lua_State *L); | ||||
| static int base_open(lua_State *L); | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Modules and functions | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static const luaL_Reg luasocket_mod[] = { | ||||
|     {"auxiliar", auxiliar_open}, | ||||
|     {"except", except_open}, | ||||
|     {"timeout", timeout_open}, | ||||
|     {"buffer", buffer_open}, | ||||
|     {"inet", inet_open}, | ||||
|     {"tcp", tcp_open}, | ||||
|     {"udp", udp_open}, | ||||
|     {"select", select_open}, | ||||
|     {NULL, NULL} | ||||
| }; | ||||
|  | ||||
| static luaL_Reg luasocket_func[] = { | ||||
|     {"skip",      global_skip}, | ||||
|     {"__unload",  global_unload}, | ||||
|     {NULL,        NULL} | ||||
| }; | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Skip a few arguments | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int global_skip(lua_State *L) { | ||||
|     int amount = luaL_checkinteger(L, 1); | ||||
|     int ret = lua_gettop(L) - amount - 1; | ||||
|     return ret >= 0 ? ret : 0; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Unloads the library | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int global_unload(lua_State *L) { | ||||
|     (void) L; | ||||
|     socket_close(); | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| #if LUA_VERSION_NUM > 501 | ||||
| int luaL_typerror (lua_State *L, int narg, const char *tname) { | ||||
|   const char *msg = lua_pushfstring(L, "%s expected, got %s", | ||||
|                                     tname, luaL_typename(L, narg)); | ||||
|   return luaL_argerror(L, narg, msg); | ||||
| } | ||||
| #endif | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Setup basic stuff. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int base_open(lua_State *L) { | ||||
|     if (socket_open()) { | ||||
|         /* export functions (and leave namespace table on top of stack) */ | ||||
| #if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE) | ||||
|         lua_newtable(L); | ||||
|         luaL_setfuncs(L, luasocket_func, 0); | ||||
| #else | ||||
|         luaL_openlib(L, "socket", luasocket_func, 0); | ||||
| #endif | ||||
| #ifdef LUASOCKET_DEBUG | ||||
|         lua_pushstring(L, "_DEBUG"); | ||||
|         lua_pushboolean(L, 1); | ||||
|         lua_rawset(L, -3); | ||||
| #endif | ||||
|         /* make version string available to scripts */ | ||||
|         lua_pushstring(L, "_VERSION"); | ||||
|         lua_pushstring(L, LUASOCKET_VERSION); | ||||
|         lua_rawset(L, -3); | ||||
|         return 1; | ||||
|     } else { | ||||
|         lua_pushstring(L, "unable to initialize library"); | ||||
|         lua_error(L); | ||||
|         return 0; | ||||
|     } | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Initializes all library modules. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| LUASOCKET_API int luaopen_socket_core(lua_State *L) { | ||||
|     int i; | ||||
|     base_open(L); | ||||
|     for (i = 0; luasocket_mod[i].name; i++) luasocket_mod[i].func(L); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										33
									
								
								Plugins/slua_unreal/External/luasocket/luasocket.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										33
									
								
								Plugins/slua_unreal/External/luasocket/luasocket.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,33 @@ | ||||
| #ifndef LUASOCKET_H | ||||
| #define LUASOCKET_H | ||||
| /*=========================================================================*\ | ||||
| * LuaSocket toolkit | ||||
| * Networking support for the Lua language | ||||
| * Diego Nehab | ||||
| * 9/11/1999 | ||||
| \*=========================================================================*/ | ||||
| #include "lua.h" | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Current socket library version | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| #define LUASOCKET_VERSION    "LuaSocket 3.0-rc1" | ||||
| #define LUASOCKET_COPYRIGHT  "Copyright (C) 1999-2013 Diego Nehab" | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * This macro prefixes all exported API functions | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| #ifndef LUASOCKET_API | ||||
| #define LUASOCKET_API extern | ||||
| #endif | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Initializes the library. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| LUASOCKET_API int luaopen_socket_core(lua_State *L); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif /* LUASOCKET_H */ | ||||
							
								
								
									
										94
									
								
								Plugins/slua_unreal/External/luasocket/mbox.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										94
									
								
								Plugins/slua_unreal/External/luasocket/mbox.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,94 @@ | ||||
| R"-++**++-( | ||||
| local _M = {} | ||||
|  | ||||
| if module then | ||||
|     mbox = _M | ||||
| end  | ||||
|  | ||||
| function _M.split_message(message_s) | ||||
|     local message = {} | ||||
|     message_s = string.gsub(message_s, "\r\n", "\n") | ||||
|     string.gsub(message_s, "^(.-\n)\n", function (h) message.headers = h end) | ||||
|     string.gsub(message_s, "^.-\n\n(.*)", function (b) message.body = b end) | ||||
|     if not message.body then | ||||
|         string.gsub(message_s, "^\n(.*)", function (b) message.body = b end) | ||||
|     end | ||||
|     if not message.headers and not message.body then | ||||
|         message.headers = message_s | ||||
|     end | ||||
|     return message.headers or "", message.body or "" | ||||
| end | ||||
|  | ||||
| function _M.split_headers(headers_s) | ||||
|     local headers = {} | ||||
|     headers_s = string.gsub(headers_s, "\r\n", "\n") | ||||
|     headers_s = string.gsub(headers_s, "\n[ ]+", " ") | ||||
|     string.gsub("\n" .. headers_s, "\n([^\n]+)", function (h) table.insert(headers, h) end) | ||||
|     return headers | ||||
| end | ||||
|  | ||||
| function _M.parse_header(header_s) | ||||
|     header_s = string.gsub(header_s, "\n[ ]+", " ") | ||||
|     header_s = string.gsub(header_s, "\n+", "") | ||||
|     local _, __, name, value = string.find(header_s, "([^%s:]-):%s*(.*)") | ||||
|     return name, value | ||||
| end | ||||
|  | ||||
| function _M.parse_headers(headers_s) | ||||
|     local headers_t = _M.split_headers(headers_s) | ||||
|     local headers = {} | ||||
|     for i = 1, #headers_t do | ||||
|         local name, value = _M.parse_header(headers_t[i]) | ||||
|         if name then | ||||
|             name = string.lower(name) | ||||
|             if headers[name] then | ||||
|                 headers[name] = headers[name] .. ", " .. value | ||||
|             else headers[name] = value end | ||||
|         end | ||||
|     end | ||||
|     return headers | ||||
| end | ||||
|  | ||||
| function _M.parse_from(from) | ||||
|     local _, __, name, address = string.find(from, "^%s*(.-)%s*%<(.-)%>") | ||||
|     if not address then | ||||
|         _, __, address = string.find(from, "%s*(.+)%s*") | ||||
|     end | ||||
|     name = name or "" | ||||
|     address = address or "" | ||||
|     if name == "" then name = address end | ||||
|     name = string.gsub(name, '"', "") | ||||
|     return name, address | ||||
| end | ||||
|  | ||||
| function _M.split_mbox(mbox_s) | ||||
|     mbox = {} | ||||
|     mbox_s = string.gsub(mbox_s, "\r\n", "\n") .."\n\nFrom \n" | ||||
|     local nj, i, j = 1, 1, 1 | ||||
|     while 1 do | ||||
|         i, nj = string.find(mbox_s, "\n\nFrom .-\n", j) | ||||
|         if not i then break end | ||||
|         local message = string.sub(mbox_s, j, i-1) | ||||
|         table.insert(mbox, message) | ||||
|         j = nj+1 | ||||
|     end | ||||
|     return mbox | ||||
| end | ||||
|  | ||||
| function _M.parse(mbox_s) | ||||
|     local mbox = _M.split_mbox(mbox_s) | ||||
|     for i = 1, #mbox do | ||||
|         mbox[i] = _M.parse_message(mbox[i]) | ||||
|     end | ||||
|     return mbox | ||||
| end | ||||
|  | ||||
| function _M.parse_message(message_s) | ||||
|     local message = {} | ||||
|     message.headers, message.body = _M.split_message(message_s) | ||||
|     message.headers = _M.parse_headers(message.headers) | ||||
|     return message | ||||
| end | ||||
|  | ||||
| return _M | ||||
| )-++**++-"; | ||||
							
								
								
									
										742
									
								
								Plugins/slua_unreal/External/luasocket/mime.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										742
									
								
								Plugins/slua_unreal/External/luasocket/mime.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,742 @@ | ||||
| /*=========================================================================*\ | ||||
| * MIME support functions | ||||
| * LuaSocket toolkit | ||||
| \*=========================================================================*/ | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
|  | ||||
| #if !defined(LUA_VERSION_NUM) || (LUA_VERSION_NUM < 501) | ||||
| #include "compat-5.1.h" | ||||
| #endif | ||||
|  | ||||
| #include "mime.h" | ||||
|  | ||||
| #ifndef _WIN32 | ||||
| #pragma clang diagnostic push | ||||
| #pragma clang diagnostic ignored "-Wchar-subscripts" | ||||
| #endif | ||||
|  | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Don't want to trust escape character constants | ||||
| \*=========================================================================*/ | ||||
| typedef unsigned char UC; | ||||
| static const char CRLF[] = "\r\n"; | ||||
| static const char EQCRLF[] = "=\r\n"; | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Internal function prototypes. | ||||
| \*=========================================================================*/ | ||||
| static int mime_global_wrp(lua_State *L); | ||||
| static int mime_global_b64(lua_State *L); | ||||
| static int mime_global_unb64(lua_State *L); | ||||
| static int mime_global_qp(lua_State *L); | ||||
| static int mime_global_unqp(lua_State *L); | ||||
| static int mime_global_qpwrp(lua_State *L); | ||||
| static int mime_global_eol(lua_State *L); | ||||
| static int mime_global_dot(lua_State *L); | ||||
|  | ||||
| static size_t dot(int c, size_t state, luaL_Buffer *buffer); | ||||
| static void b64setup(UC *base); | ||||
| static size_t b64encode(UC c, UC *input, size_t size, luaL_Buffer *buffer); | ||||
| static size_t b64pad(const UC *input, size_t size, luaL_Buffer *buffer); | ||||
| static size_t b64decode(UC c, UC *input, size_t size, luaL_Buffer *buffer); | ||||
|  | ||||
| static void qpsetup(UC *cl, UC *unbase); | ||||
| static void qpquote(UC c, luaL_Buffer *buffer); | ||||
| static size_t qpdecode(UC c, UC *input, size_t size, luaL_Buffer *buffer); | ||||
| static size_t qpencode(UC c, UC *input, size_t size,  | ||||
|         const char *marker, luaL_Buffer *buffer); | ||||
| static size_t qppad(UC *input, size_t size, luaL_Buffer *buffer); | ||||
|  | ||||
| /* code support functions */ | ||||
| static luaL_Reg mine_func[] = { | ||||
|     { "dot", mime_global_dot }, | ||||
|     { "b64", mime_global_b64 }, | ||||
|     { "eol", mime_global_eol }, | ||||
|     { "qp", mime_global_qp }, | ||||
|     { "qpwrp", mime_global_qpwrp }, | ||||
|     { "unb64", mime_global_unb64 }, | ||||
|     { "unqp", mime_global_unqp }, | ||||
|     { "wrp", mime_global_wrp }, | ||||
|     { NULL, NULL } | ||||
| }; | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Quoted-printable globals | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static UC qpclass[256]; | ||||
| static UC qpbase[] = "0123456789ABCDEF"; | ||||
| static UC qpunbase[256]; | ||||
| enum {QP_PLAIN, QP_QUOTED, QP_CR, QP_IF_LAST}; | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Base64 globals | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static const UC b64base[] = | ||||
|         "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; | ||||
| static UC b64unbase[256]; | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Exported functions | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Initializes module | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| MIME_API int luaopen_mime_core(lua_State *L) | ||||
| { | ||||
| #if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE) | ||||
|     lua_newtable(L); | ||||
|     luaL_setfuncs(L, mine_func, 0); | ||||
| #else | ||||
|     luaL_openlib(L, "mime", mine_func, 0); | ||||
| #endif | ||||
|     /* make version string available to scripts */ | ||||
|     lua_pushstring(L, "_VERSION"); | ||||
|     lua_pushstring(L, MIME_VERSION); | ||||
|     lua_rawset(L, -3); | ||||
|     /* initialize lookup tables */ | ||||
|     qpsetup(qpclass, qpunbase); | ||||
|     b64setup(b64unbase); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Global Lua functions | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Incrementaly breaks a string into lines. The string can have CRLF breaks. | ||||
| * A, n = wrp(l, B, length) | ||||
| * A is a copy of B, broken into lines of at most 'length' bytes.  | ||||
| * 'l' is how many bytes are left for the first line of B.  | ||||
| * 'n' is the number of bytes left in the last line of A.  | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int mime_global_wrp(lua_State *L) | ||||
| { | ||||
|     size_t size = 0; | ||||
|     int left = (int) luaL_checknumber(L, 1); | ||||
|     const UC *input = (UC *) luaL_optlstring(L, 2, NULL, &size); | ||||
|     const UC *last = input + size; | ||||
|     int length = (int) luaL_optnumber(L, 3, 76); | ||||
|     luaL_Buffer buffer; | ||||
|     /* end of input black-hole */ | ||||
|     if (!input) { | ||||
|         /* if last line has not been terminated, add a line break */ | ||||
|         if (left < length) lua_pushstring(L, CRLF); | ||||
|         /* otherwise, we are done */ | ||||
|         else lua_pushnil(L); | ||||
|         lua_pushnumber(L, length); | ||||
|         return 2; | ||||
|     }  | ||||
|     luaL_buffinit(L, &buffer); | ||||
|     while (input < last) { | ||||
|         switch (*input) { | ||||
|             case '\r': | ||||
|                 break; | ||||
|             case '\n': | ||||
|                 luaL_addstring(&buffer, CRLF); | ||||
|                 left = length; | ||||
|                 break; | ||||
|             default: | ||||
|                 if (left <= 0) { | ||||
|                     left = length; | ||||
|                     luaL_addstring(&buffer, CRLF); | ||||
|                 } | ||||
|                 luaL_addchar(&buffer, *input); | ||||
|                 left--; | ||||
|                 break; | ||||
|         } | ||||
|         input++; | ||||
|     } | ||||
|     luaL_pushresult(&buffer); | ||||
|     lua_pushnumber(L, left); | ||||
|     return 2; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Fill base64 decode map.  | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static void b64setup(UC *unbase)  | ||||
| { | ||||
|     int i; | ||||
|     for (i = 0; i <= 255; i++) unbase[i] = (UC) 255; | ||||
|     for (i = 0; i < 64; i++) unbase[b64base[i]] = (UC) i; | ||||
|     unbase['='] = 0; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Acumulates bytes in input buffer until 3 bytes are available.  | ||||
| * Translate the 3 bytes into Base64 form and append to buffer. | ||||
| * Returns new number of bytes in buffer. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static size_t b64encode(UC c, UC *input, size_t size,  | ||||
|         luaL_Buffer *buffer) | ||||
| { | ||||
|     input[size++] = c; | ||||
|     if (size == 3) { | ||||
|         UC code[4]; | ||||
|         unsigned long value = 0; | ||||
|         value += input[0]; value <<= 8; | ||||
|         value += input[1]; value <<= 8; | ||||
|         value += input[2];  | ||||
|         code[3] = b64base[value & 0x3f]; value >>= 6; | ||||
|         code[2] = b64base[value & 0x3f]; value >>= 6; | ||||
|         code[1] = b64base[value & 0x3f]; value >>= 6; | ||||
|         code[0] = b64base[value]; | ||||
|         luaL_addlstring(buffer, (char *) code, 4); | ||||
|         size = 0; | ||||
|     } | ||||
|     return size; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Encodes the Base64 last 1 or 2 bytes and adds padding '='  | ||||
| * Result, if any, is appended to buffer. | ||||
| * Returns 0. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static size_t b64pad(const UC *input, size_t size,  | ||||
|         luaL_Buffer *buffer) | ||||
| { | ||||
|     unsigned long value = 0; | ||||
|     UC code[4] = {'=', '=', '=', '='}; | ||||
|     switch (size) { | ||||
|         case 1: | ||||
|             value = input[0] << 4; | ||||
|             code[1] = b64base[value & 0x3f]; value >>= 6; | ||||
|             code[0] = b64base[value]; | ||||
|             luaL_addlstring(buffer, (char *) code, 4); | ||||
|             break; | ||||
|         case 2: | ||||
|             value = input[0]; value <<= 8;  | ||||
|             value |= input[1]; value <<= 2; | ||||
|             code[2] = b64base[value & 0x3f]; value >>= 6; | ||||
|             code[1] = b64base[value & 0x3f]; value >>= 6; | ||||
|             code[0] = b64base[value]; | ||||
|             luaL_addlstring(buffer, (char *) code, 4); | ||||
|             break; | ||||
|         default: | ||||
|             break; | ||||
|     } | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Acumulates bytes in input buffer until 4 bytes are available.  | ||||
| * Translate the 4 bytes from Base64 form and append to buffer. | ||||
| * Returns new number of bytes in buffer. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static size_t b64decode(UC c, UC *input, size_t size,  | ||||
|         luaL_Buffer *buffer) | ||||
| { | ||||
|     /* ignore invalid characters */ | ||||
|     if (b64unbase[c] > 64) return size; | ||||
|     input[size++] = c; | ||||
|     /* decode atom */ | ||||
|     if (size == 4) { | ||||
|         UC decoded[3]; | ||||
|         int valid, value = 0; | ||||
|         value =  b64unbase[input[0]]; value <<= 6; | ||||
|         value |= b64unbase[input[1]]; value <<= 6; | ||||
|         value |= b64unbase[input[2]]; value <<= 6; | ||||
|         value |= b64unbase[input[3]]; | ||||
|         decoded[2] = (UC) (value & 0xff); value >>= 8; | ||||
|         decoded[1] = (UC) (value & 0xff); value >>= 8; | ||||
|         decoded[0] = (UC) value; | ||||
|         /* take care of paddding */ | ||||
|         valid = (input[2] == '=') ? 1 : (input[3] == '=') ? 2 : 3;  | ||||
|         luaL_addlstring(buffer, (char *) decoded, valid); | ||||
|         return 0; | ||||
|     /* need more data */ | ||||
|     } else return size; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Incrementally applies the Base64 transfer content encoding to a string | ||||
| * A, B = b64(C, D) | ||||
| * A is the encoded version of the largest prefix of C .. D that is | ||||
| * divisible by 3. B has the remaining bytes of C .. D, *without* encoding. | ||||
| * The easiest thing would be to concatenate the two strings and  | ||||
| * encode the result, but we can't afford that or Lua would dupplicate | ||||
| * every chunk we received. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int mime_global_b64(lua_State *L) | ||||
| { | ||||
|     UC atom[3]; | ||||
|     size_t isize = 0, asize = 0; | ||||
|     const UC *input = (UC *) luaL_optlstring(L, 1, NULL, &isize); | ||||
|     const UC *last = input + isize; | ||||
|     luaL_Buffer buffer; | ||||
|     /* end-of-input blackhole */ | ||||
|     if (!input) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushnil(L); | ||||
|         return 2; | ||||
|     } | ||||
|     /* make sure we don't confuse buffer stuff with arguments */ | ||||
|     lua_settop(L, 2); | ||||
|     /* process first part of the input */ | ||||
|     luaL_buffinit(L, &buffer); | ||||
|     while (input < last)  | ||||
|         asize = b64encode(*input++, atom, asize, &buffer); | ||||
|     input = (UC *) luaL_optlstring(L, 2, NULL, &isize); | ||||
|     /* if second part is nil, we are done */ | ||||
|     if (!input) { | ||||
|         size_t osize = 0; | ||||
|         asize = b64pad(atom, asize, &buffer); | ||||
|         luaL_pushresult(&buffer); | ||||
|         /* if the output is empty  and the input is nil, return nil */ | ||||
|         lua_tolstring(L, -1, &osize); | ||||
|         if (osize == 0) lua_pushnil(L); | ||||
|         lua_pushnil(L); | ||||
|         return 2; | ||||
|     } | ||||
|     /* otherwise process the second part */ | ||||
|     last = input + isize; | ||||
|     while (input < last)  | ||||
|         asize = b64encode(*input++, atom, asize, &buffer); | ||||
|     luaL_pushresult(&buffer); | ||||
|     lua_pushlstring(L, (char *) atom, asize); | ||||
|     return 2; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Incrementally removes the Base64 transfer content encoding from a string | ||||
| * A, B = b64(C, D) | ||||
| * A is the encoded version of the largest prefix of C .. D that is | ||||
| * divisible by 4. B has the remaining bytes of C .. D, *without* encoding. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int mime_global_unb64(lua_State *L) | ||||
| { | ||||
|     UC atom[4]; | ||||
|     size_t isize = 0, asize = 0; | ||||
|     const UC *input = (UC *) luaL_optlstring(L, 1, NULL, &isize); | ||||
|     const UC *last = input + isize; | ||||
|     luaL_Buffer buffer; | ||||
|     /* end-of-input blackhole */ | ||||
|     if (!input) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushnil(L); | ||||
|         return 2; | ||||
|     } | ||||
|     /* make sure we don't confuse buffer stuff with arguments */ | ||||
|     lua_settop(L, 2); | ||||
|     /* process first part of the input */ | ||||
|     luaL_buffinit(L, &buffer); | ||||
|     while (input < last)  | ||||
|         asize = b64decode(*input++, atom, asize, &buffer); | ||||
|     input = (UC *) luaL_optlstring(L, 2, NULL, &isize); | ||||
|     /* if second is nil, we are done */ | ||||
|     if (!input) { | ||||
|         size_t osize = 0; | ||||
|         luaL_pushresult(&buffer); | ||||
|         /* if the output is empty  and the input is nil, return nil */ | ||||
|         lua_tolstring(L, -1, &osize); | ||||
|         if (osize == 0) lua_pushnil(L); | ||||
|         lua_pushnil(L); | ||||
|         return 2; | ||||
|     } | ||||
|     /* otherwise, process the rest of the input */ | ||||
|     last = input + isize; | ||||
|     while (input < last)  | ||||
|         asize = b64decode(*input++, atom, asize, &buffer); | ||||
|     luaL_pushresult(&buffer); | ||||
|     lua_pushlstring(L, (char *) atom, asize); | ||||
|     return 2; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Quoted-printable encoding scheme | ||||
| * all (except CRLF in text) can be =XX | ||||
| * CLRL in not text must be =XX=XX | ||||
| * 33 through 60 inclusive can be plain | ||||
| * 62 through 126 inclusive can be plain | ||||
| * 9 and 32 can be plain, unless in the end of a line, where must be =XX | ||||
| * encoded lines must be no longer than 76 not counting CRLF | ||||
| * soft line-break are =CRLF | ||||
| * To encode one byte, we need to see the next two.  | ||||
| * Worst case is when we see a space, and wonder if a CRLF is comming | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Split quoted-printable characters into classes | ||||
| * Precompute reverse map for encoding | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static void qpsetup(UC *cl, UC *unbase) | ||||
| { | ||||
|     int i; | ||||
|     for (i = 0; i < 256; i++) cl[i] = QP_QUOTED; | ||||
|     for (i = 33; i <= 60; i++) cl[i] = QP_PLAIN; | ||||
|     for (i = 62; i <= 126; i++) cl[i] = QP_PLAIN; | ||||
|     cl['\t'] = QP_IF_LAST;  | ||||
|     cl[' '] = QP_IF_LAST; | ||||
|     cl['\r'] = QP_CR; | ||||
|     for (i = 0; i < 256; i++) unbase[i] = 255; | ||||
|     unbase['0'] = 0; unbase['1'] = 1; unbase['2'] = 2; | ||||
|     unbase['3'] = 3; unbase['4'] = 4; unbase['5'] = 5; | ||||
|     unbase['6'] = 6; unbase['7'] = 7; unbase['8'] = 8; | ||||
|     unbase['9'] = 9; unbase['A'] = 10; unbase['a'] = 10; | ||||
|     unbase['B'] = 11; unbase['b'] = 11; unbase['C'] = 12; | ||||
|     unbase['c'] = 12; unbase['D'] = 13; unbase['d'] = 13; | ||||
|     unbase['E'] = 14; unbase['e'] = 14; unbase['F'] = 15; | ||||
|     unbase['f'] = 15; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Output one character in form =XX | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static void qpquote(UC c, luaL_Buffer *buffer) | ||||
| { | ||||
|     luaL_addchar(buffer, '='); | ||||
|     luaL_addchar(buffer, qpbase[c >> 4]); | ||||
|     luaL_addchar(buffer, qpbase[c & 0x0F]); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Accumulate characters until we are sure about how to deal with them. | ||||
| * Once we are sure, output to the buffer, in the correct form.  | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static size_t qpencode(UC c, UC *input, size_t size,  | ||||
|         const char *marker, luaL_Buffer *buffer) | ||||
| { | ||||
|     input[size++] = c; | ||||
|     /* deal with all characters we can have */ | ||||
|     while (size > 0) { | ||||
|         switch (qpclass[input[0]]) { | ||||
|             /* might be the CR of a CRLF sequence */ | ||||
|             case QP_CR: | ||||
|                 if (size < 2) return size; | ||||
|                 if (input[1] == '\n') { | ||||
|                     luaL_addstring(buffer, marker); | ||||
|                     return 0; | ||||
|                 } else qpquote(input[0], buffer); | ||||
|                 break; | ||||
|             /* might be a space and that has to be quoted if last in line */ | ||||
|             case QP_IF_LAST: | ||||
|                 if (size < 3) return size; | ||||
|                 /* if it is the last, quote it and we are done */ | ||||
|                 if (input[1] == '\r' && input[2] == '\n') { | ||||
|                     qpquote(input[0], buffer); | ||||
|                     luaL_addstring(buffer, marker); | ||||
|                     return 0; | ||||
|                 } else luaL_addchar(buffer, input[0]); | ||||
|                 break; | ||||
|                 /* might have to be quoted always */ | ||||
|             case QP_QUOTED: | ||||
|                 qpquote(input[0], buffer); | ||||
|                 break; | ||||
|                 /* might never have to be quoted */ | ||||
|             default: | ||||
|                 luaL_addchar(buffer, input[0]); | ||||
|                 break; | ||||
|         } | ||||
|         input[0] = input[1]; input[1] = input[2]; | ||||
|         size--; | ||||
|     } | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Deal with the final characters  | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static size_t qppad(UC *input, size_t size, luaL_Buffer *buffer) | ||||
| { | ||||
|     size_t i; | ||||
|     for (i = 0; i < size; i++) { | ||||
|         if (qpclass[input[i]] == QP_PLAIN) luaL_addchar(buffer, input[i]); | ||||
|         else qpquote(input[i], buffer); | ||||
|     } | ||||
|     if (size > 0) luaL_addstring(buffer, EQCRLF); | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Incrementally converts a string to quoted-printable | ||||
| * A, B = qp(C, D, marker) | ||||
| * Marker is the text to be used to replace CRLF sequences found in A. | ||||
| * A is the encoded version of the largest prefix of C .. D that  | ||||
| * can be encoded without doubts.  | ||||
| * B has the remaining bytes of C .. D, *without* encoding. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int mime_global_qp(lua_State *L) | ||||
| { | ||||
|  | ||||
|     size_t asize = 0, isize = 0; | ||||
|     UC atom[3]; | ||||
|     const UC *input = (UC *) luaL_optlstring(L, 1, NULL, &isize); | ||||
|     const UC *last = input + isize; | ||||
|     const char *marker = luaL_optstring(L, 3, CRLF); | ||||
|     luaL_Buffer buffer; | ||||
|     /* end-of-input blackhole */ | ||||
|     if (!input) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushnil(L); | ||||
|         return 2; | ||||
|     } | ||||
|     /* make sure we don't confuse buffer stuff with arguments */ | ||||
|     lua_settop(L, 3); | ||||
|     /* process first part of input */ | ||||
|     luaL_buffinit(L, &buffer); | ||||
|     while (input < last) | ||||
|         asize = qpencode(*input++, atom, asize, marker, &buffer); | ||||
|     input = (UC *) luaL_optlstring(L, 2, NULL, &isize); | ||||
|     /* if second part is nil, we are done */ | ||||
|     if (!input) { | ||||
|         asize = qppad(atom, asize, &buffer); | ||||
|         luaL_pushresult(&buffer); | ||||
|         if (!(*lua_tostring(L, -1))) lua_pushnil(L); | ||||
|         lua_pushnil(L); | ||||
|         return 2; | ||||
|     } | ||||
|     /* otherwise process rest of input */ | ||||
|     last = input + isize; | ||||
|     while (input < last) | ||||
|         asize = qpencode(*input++, atom, asize, marker, &buffer); | ||||
|     luaL_pushresult(&buffer); | ||||
|     lua_pushlstring(L, (char *) atom, asize); | ||||
|     return 2; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Accumulate characters until we are sure about how to deal with them. | ||||
| * Once we are sure, output the to the buffer, in the correct form.  | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static size_t qpdecode(UC c, UC *input, size_t size, luaL_Buffer *buffer) { | ||||
|     int d; | ||||
|     input[size++] = c; | ||||
|     /* deal with all characters we can deal */ | ||||
|     switch (input[0]) { | ||||
|         /* if we have an escape character */ | ||||
|         case '=':  | ||||
|             if (size < 3) return size;  | ||||
|             /* eliminate soft line break */ | ||||
|             if (input[1] == '\r' && input[2] == '\n') return 0; | ||||
|             /* decode quoted representation */ | ||||
|             c = qpunbase[input[1]]; d = qpunbase[input[2]]; | ||||
|             /* if it is an invalid, do not decode */ | ||||
|             if (c > 15 || d > 15) luaL_addlstring(buffer, (char *)input, 3); | ||||
|             else luaL_addchar(buffer, (char) ((c << 4) + d)); | ||||
|             return 0; | ||||
|         case '\r': | ||||
|             if (size < 2) return size;  | ||||
|             if (input[1] == '\n') luaL_addlstring(buffer, (char *)input, 2); | ||||
|             return 0; | ||||
|         default: | ||||
|             if (input[0] == '\t' || (input[0] > 31 && input[0] < 127)) | ||||
|                 luaL_addchar(buffer, input[0]); | ||||
|             return 0; | ||||
|     } | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Incrementally decodes a string in quoted-printable | ||||
| * A, B = qp(C, D) | ||||
| * A is the decoded version of the largest prefix of C .. D that  | ||||
| * can be decoded without doubts.  | ||||
| * B has the remaining bytes of C .. D, *without* decoding. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int mime_global_unqp(lua_State *L) | ||||
| { | ||||
|     size_t asize = 0, isize = 0; | ||||
|     UC atom[3]; | ||||
|     const UC *input = (UC *) luaL_optlstring(L, 1, NULL, &isize); | ||||
|     const UC *last = input + isize; | ||||
|     luaL_Buffer buffer; | ||||
|     /* end-of-input blackhole */ | ||||
|     if (!input) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushnil(L); | ||||
|         return 2; | ||||
|     } | ||||
|     /* make sure we don't confuse buffer stuff with arguments */ | ||||
|     lua_settop(L, 2); | ||||
|     /* process first part of input */ | ||||
|     luaL_buffinit(L, &buffer); | ||||
|     while (input < last) | ||||
|         asize = qpdecode(*input++, atom, asize, &buffer); | ||||
|     input = (UC *) luaL_optlstring(L, 2, NULL, &isize); | ||||
|     /* if second part is nil, we are done */ | ||||
|     if (!input) { | ||||
|         luaL_pushresult(&buffer); | ||||
|         if (!(*lua_tostring(L, -1))) lua_pushnil(L); | ||||
|         lua_pushnil(L); | ||||
|         return 2; | ||||
|     }  | ||||
|     /* otherwise process rest of input */ | ||||
|     last = input + isize; | ||||
|     while (input < last) | ||||
|         asize = qpdecode(*input++, atom, asize, &buffer); | ||||
|     luaL_pushresult(&buffer); | ||||
|     lua_pushlstring(L, (char *) atom, asize); | ||||
|     return 2; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Incrementally breaks a quoted-printed string into lines | ||||
| * A, n = qpwrp(l, B, length) | ||||
| * A is a copy of B, broken into lines of at most 'length' bytes.  | ||||
| * 'l' is how many bytes are left for the first line of B.  | ||||
| * 'n' is the number of bytes left in the last line of A.  | ||||
| * There are two complications: lines can't be broken in the middle | ||||
| * of an encoded =XX, and there might be line breaks already | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int mime_global_qpwrp(lua_State *L) | ||||
| { | ||||
|     size_t size = 0; | ||||
|     int left = (int) luaL_checknumber(L, 1); | ||||
|     const UC *input = (UC *) luaL_optlstring(L, 2, NULL, &size); | ||||
|     const UC *last = input + size; | ||||
|     int length = (int) luaL_optnumber(L, 3, 76); | ||||
|     luaL_Buffer buffer; | ||||
|     /* end-of-input blackhole */ | ||||
|     if (!input) { | ||||
|         if (left < length) lua_pushstring(L, EQCRLF); | ||||
|         else lua_pushnil(L); | ||||
|         lua_pushnumber(L, length); | ||||
|         return 2; | ||||
|     } | ||||
|     /* process all input */ | ||||
|     luaL_buffinit(L, &buffer); | ||||
|     while (input < last) { | ||||
|         switch (*input) { | ||||
|             case '\r': | ||||
|                 break; | ||||
|             case '\n': | ||||
|                 left = length; | ||||
|                 luaL_addstring(&buffer, CRLF); | ||||
|                 break; | ||||
|             case '=': | ||||
|                 if (left <= 3) { | ||||
|                     left = length; | ||||
|                     luaL_addstring(&buffer, EQCRLF); | ||||
|                 }  | ||||
|                 luaL_addchar(&buffer, *input); | ||||
|                 left--; | ||||
|                 break; | ||||
|             default:  | ||||
|                 if (left <= 1) { | ||||
|                     left = length; | ||||
|                     luaL_addstring(&buffer, EQCRLF); | ||||
|                 } | ||||
|                 luaL_addchar(&buffer, *input); | ||||
|                 left--; | ||||
|                 break; | ||||
|         } | ||||
|         input++; | ||||
|     } | ||||
|     luaL_pushresult(&buffer); | ||||
|     lua_pushnumber(L, left); | ||||
|     return 2; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Here is what we do: \n, and \r are considered candidates for line | ||||
| * break. We issue *one* new line marker if any of them is seen alone, or | ||||
| * followed by a different one. That is, \n\n and \r\r will issue two | ||||
| * end of line markers each, but \r\n, \n\r etc will only issue *one* | ||||
| * marker.  This covers Mac OS, Mac OS X, VMS, Unix and DOS, as well as | ||||
| * probably other more obscure conventions. | ||||
| * | ||||
| * c is the current character being processed | ||||
| * last is the previous character | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| #define eolcandidate(c) (c == '\r' || c == '\n') | ||||
| static int eolprocess(int c, int last, const char *marker,  | ||||
|         luaL_Buffer *buffer) | ||||
| { | ||||
|     if (eolcandidate(c)) { | ||||
|         if (eolcandidate(last)) { | ||||
|             if (c == last) luaL_addstring(buffer, marker); | ||||
|             return 0; | ||||
|         } else { | ||||
|             luaL_addstring(buffer, marker); | ||||
|             return c; | ||||
|         } | ||||
|     } else { | ||||
|         luaL_addchar(buffer, (char) c); | ||||
|         return 0; | ||||
|     } | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Converts a string to uniform EOL convention.  | ||||
| * A, n = eol(o, B, marker) | ||||
| * A is the converted version of the largest prefix of B that can be | ||||
| * converted unambiguously. 'o' is the context returned by the previous  | ||||
| * call. 'n' is the new context. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int mime_global_eol(lua_State *L) | ||||
| { | ||||
|     int ctx = luaL_checkinteger(L, 1); | ||||
|     size_t isize = 0; | ||||
|     const char *input = luaL_optlstring(L, 2, NULL, &isize); | ||||
|     const char *last = input + isize; | ||||
|     const char *marker = luaL_optstring(L, 3, CRLF); | ||||
|     luaL_Buffer buffer; | ||||
|     luaL_buffinit(L, &buffer); | ||||
|     /* end of input blackhole */ | ||||
|     if (!input) { | ||||
|        lua_pushnil(L); | ||||
|        lua_pushnumber(L, 0); | ||||
|        return 2; | ||||
|     } | ||||
|     /* process all input */ | ||||
|     while (input < last) | ||||
|         ctx = eolprocess(*input++, ctx, marker, &buffer); | ||||
|     luaL_pushresult(&buffer); | ||||
|     lua_pushnumber(L, ctx); | ||||
|     return 2; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Takes one byte and stuff it if needed.  | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static size_t dot(int c, size_t state, luaL_Buffer *buffer) | ||||
| { | ||||
|     luaL_addchar(buffer, (char) c); | ||||
|     switch (c) { | ||||
|         case '\r':  | ||||
|             return 1; | ||||
|         case '\n':  | ||||
|             return (state == 1)? 2: 0;  | ||||
|         case '.':   | ||||
|             if (state == 2)  | ||||
|                 luaL_addchar(buffer, '.'); | ||||
|         default: | ||||
|             return 0; | ||||
|     } | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Incrementally applies smtp stuffing to a string | ||||
| * A, n = dot(l, D) | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int mime_global_dot(lua_State *L) | ||||
| { | ||||
|     size_t isize = 0, state = (size_t) luaL_checknumber(L, 1); | ||||
|     const char *input = luaL_optlstring(L, 2, NULL, &isize); | ||||
|     const char *last = input + isize; | ||||
|     luaL_Buffer buffer; | ||||
|     /* end-of-input blackhole */ | ||||
|     if (!input) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushnumber(L, 2); | ||||
|         return 2; | ||||
|     } | ||||
|     /* process all input */ | ||||
|     luaL_buffinit(L, &buffer); | ||||
|     while (input < last)  | ||||
|         state = dot(*input++, state, &buffer); | ||||
|     luaL_pushresult(&buffer); | ||||
|     lua_pushnumber(L, (lua_Number) state); | ||||
|     return 2; | ||||
| } | ||||
|  | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #ifndef _WIN32 | ||||
| #pragma clang diagnostic pop | ||||
| #endif | ||||
							
								
								
									
										33
									
								
								Plugins/slua_unreal/External/luasocket/mime.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										33
									
								
								Plugins/slua_unreal/External/luasocket/mime.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,33 @@ | ||||
| #ifndef MIME_H  | ||||
| #define MIME_H  | ||||
| /*=========================================================================*\ | ||||
| * Core MIME support | ||||
| * LuaSocket toolkit | ||||
| * | ||||
| * This module provides functions to implement transfer content encodings | ||||
| * and formatting conforming to RFC 2045. It is used by mime.lua, which | ||||
| * provide a higher level interface to this functionality.  | ||||
| \*=========================================================================*/ | ||||
| #include "lua.h" | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Current MIME library version | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| #define MIME_VERSION    "MIME 1.0.3" | ||||
| #define MIME_COPYRIGHT  "Copyright (C) 2004-2013 Diego Nehab" | ||||
| #define MIME_AUTHORS    "Diego Nehab" | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * This macro prefixes all exported API functions | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| #ifndef MIME_API | ||||
| #define MIME_API extern | ||||
| #endif | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| MIME_API int luaopen_mime_core(lua_State *L); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif /* MIME_H */ | ||||
							
								
								
									
										92
									
								
								Plugins/slua_unreal/External/luasocket/mime.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										92
									
								
								Plugins/slua_unreal/External/luasocket/mime.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,92 @@ | ||||
| R"-++**++-( | ||||
| ------------------------------------------------------------------- | ||||
| -- MIME support for the Lua language. | ||||
| -- Author: Diego Nehab | ||||
| -- Conforming to RFCs 2045-2049 | ||||
| ----------------------------------------------------------------------------- | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Declare module and import dependencies | ||||
| ----------------------------------------------------------------------------- | ||||
| local base = _G | ||||
| local ltn12 = require("ltn12") | ||||
| local mime = require("mime.core") | ||||
| local io = require("io") | ||||
| local string = require("string") | ||||
| local _M = mime | ||||
|  | ||||
| -- encode, decode and wrap algorithm tables | ||||
| local encodet, decodet, wrapt = {},{},{} | ||||
|  | ||||
| _M.encodet = encodet | ||||
| _M.decodet = decodet | ||||
| _M.wrapt   = wrapt   | ||||
|  | ||||
| -- creates a function that chooses a filter by name from a given table | ||||
| local function choose(table) | ||||
|     return function(name, opt1, opt2) | ||||
|         if base.type(name) ~= "string" then | ||||
|             name, opt1, opt2 = "default", name, opt1 | ||||
|         end | ||||
|         local f = table[name or "nil"] | ||||
|         if not f then  | ||||
|             base.error("unknown key (" .. base.tostring(name) .. ")", 3) | ||||
|         else return f(opt1, opt2) end | ||||
|     end | ||||
| end | ||||
|  | ||||
| -- define the encoding filters | ||||
| encodet['base64'] = function() | ||||
|     return ltn12.filter.cycle(_M.b64, "") | ||||
| end | ||||
|  | ||||
| encodet['quoted-printable'] = function(mode) | ||||
|     return ltn12.filter.cycle(_M.qp, "", | ||||
|         (mode == "binary") and "=0D=0A" or "\r\n") | ||||
| end | ||||
|  | ||||
| -- define the decoding filters | ||||
| decodet['base64'] = function() | ||||
|     return ltn12.filter.cycle(_M.unb64, "") | ||||
| end | ||||
|  | ||||
| decodet['quoted-printable'] = function() | ||||
|     return ltn12.filter.cycle(_M.unqp, "") | ||||
| end | ||||
|  | ||||
| local function format(chunk) | ||||
|     if chunk then | ||||
|         if chunk == "" then return "''" | ||||
|         else return string.len(chunk) end | ||||
|     else return "nil" end | ||||
| end | ||||
|  | ||||
| -- define the line-wrap filters | ||||
| wrapt['text'] = function(length) | ||||
|     length = length or 76 | ||||
|     return ltn12.filter.cycle(_M.wrp, length, length) | ||||
| end | ||||
| wrapt['base64'] = wrapt['text'] | ||||
| wrapt['default'] = wrapt['text'] | ||||
|  | ||||
| wrapt['quoted-printable'] = function() | ||||
|     return ltn12.filter.cycle(_M.qpwrp, 76, 76) | ||||
| end | ||||
|  | ||||
| -- function that choose the encoding, decoding or wrap algorithm | ||||
| _M.encode = choose(encodet) | ||||
| _M.decode = choose(decodet) | ||||
| _M.wrap = choose(wrapt) | ||||
|  | ||||
| -- define the end-of-line normalization filter | ||||
| function _M.normalize(marker) | ||||
|     return ltn12.filter.cycle(_M.eol, 0, marker) | ||||
| end | ||||
|  | ||||
| -- high level stuffing filter | ||||
| function _M.stuff() | ||||
|     return ltn12.filter.cycle(_M.dot, 2) | ||||
| end | ||||
|  | ||||
| return _M | ||||
| )-++**++-"; | ||||
							
								
								
									
										367
									
								
								Plugins/slua_unreal/External/luasocket/options.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										367
									
								
								Plugins/slua_unreal/External/luasocket/options.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,367 @@ | ||||
| /*=========================================================================*\ | ||||
| * Common option interface  | ||||
| * LuaSocket toolkit | ||||
| \*=========================================================================*/ | ||||
| #include <string.h>  | ||||
|  | ||||
| #include "lauxlib.h" | ||||
|  | ||||
| #include "auxiliar.h" | ||||
| #include "options.h" | ||||
| #include "inet.h" | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Internal functions prototypes | ||||
| \*=========================================================================*/ | ||||
| static int opt_setmembership(lua_State *L, p_socket ps, int level, int name); | ||||
| static int opt_ip6_setmembership(lua_State *L, p_socket ps, int level, int name); | ||||
| static int opt_setboolean(lua_State *L, p_socket ps, int level, int name); | ||||
| static int opt_getboolean(lua_State *L, p_socket ps, int level, int name); | ||||
| static int opt_setint(lua_State *L, p_socket ps, int level, int name); | ||||
| static int opt_getint(lua_State *L, p_socket ps, int level, int name); | ||||
| static int opt_set(lua_State *L, p_socket ps, int level, int name,  | ||||
|         void *val, int len); | ||||
| static int opt_get(lua_State *L, p_socket ps, int level, int name,  | ||||
|         void *val, int* len); | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Exported functions | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Calls appropriate option handler | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int opt_meth_setoption(lua_State *L, p_opt opt, p_socket ps) | ||||
| { | ||||
|     const char *name = luaL_checkstring(L, 2);      /* obj, name, ... */ | ||||
|     while (opt->name && strcmp(name, opt->name)) | ||||
|         opt++; | ||||
|     if (!opt->func) { | ||||
|         char msg[45]; | ||||
|         sprintf(msg, "unsupported option `%.35s'", name); | ||||
|         luaL_argerror(L, 2, msg); | ||||
|     } | ||||
|     return opt->func(L, ps); | ||||
| } | ||||
|  | ||||
| int opt_meth_getoption(lua_State *L, p_opt opt, p_socket ps) | ||||
| { | ||||
|     const char *name = luaL_checkstring(L, 2);      /* obj, name, ... */ | ||||
|     while (opt->name && strcmp(name, opt->name)) | ||||
|         opt++; | ||||
|     if (!opt->func) { | ||||
|         char msg[45]; | ||||
|         sprintf(msg, "unsupported option `%.35s'", name); | ||||
|         luaL_argerror(L, 2, msg); | ||||
|     } | ||||
|     return opt->func(L, ps); | ||||
| } | ||||
|  | ||||
| /* enables reuse of local address */ | ||||
| int opt_set_reuseaddr(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_setboolean(L, ps, SOL_SOCKET, SO_REUSEADDR);  | ||||
| } | ||||
|  | ||||
| int opt_get_reuseaddr(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_getboolean(L, ps, SOL_SOCKET, SO_REUSEADDR);  | ||||
| } | ||||
|  | ||||
| /* enables reuse of local port */ | ||||
| int opt_set_reuseport(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_setboolean(L, ps, SOL_SOCKET, SO_REUSEPORT);  | ||||
| } | ||||
|  | ||||
| int opt_get_reuseport(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_getboolean(L, ps, SOL_SOCKET, SO_REUSEPORT);  | ||||
| } | ||||
|  | ||||
| /* disables the Naggle algorithm */ | ||||
| int opt_set_tcp_nodelay(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_setboolean(L, ps, IPPROTO_TCP, TCP_NODELAY);  | ||||
| } | ||||
|  | ||||
| int opt_get_tcp_nodelay(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_getboolean(L, ps, IPPROTO_TCP, TCP_NODELAY); | ||||
| } | ||||
|  | ||||
| int opt_set_keepalive(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_setboolean(L, ps, SOL_SOCKET, SO_KEEPALIVE);  | ||||
| } | ||||
|  | ||||
| int opt_get_keepalive(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_getboolean(L, ps, SOL_SOCKET, SO_KEEPALIVE);  | ||||
| } | ||||
|  | ||||
| int opt_set_dontroute(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_setboolean(L, ps, SOL_SOCKET, SO_DONTROUTE); | ||||
| } | ||||
|  | ||||
| int opt_set_broadcast(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_setboolean(L, ps, SOL_SOCKET, SO_BROADCAST); | ||||
| } | ||||
|  | ||||
| int opt_set_ip6_unicast_hops(lua_State *L, p_socket ps) | ||||
| { | ||||
|   return opt_setint(L, ps, IPPROTO_IPV6, IPV6_UNICAST_HOPS); | ||||
| } | ||||
|  | ||||
| int opt_get_ip6_unicast_hops(lua_State *L, p_socket ps) | ||||
| { | ||||
|   return opt_getint(L, ps, IPPROTO_IPV6, IPV6_UNICAST_HOPS); | ||||
| } | ||||
|  | ||||
| int opt_set_ip6_multicast_hops(lua_State *L, p_socket ps) | ||||
| { | ||||
|   return opt_setint(L, ps, IPPROTO_IPV6, IPV6_MULTICAST_HOPS); | ||||
| } | ||||
|  | ||||
| int opt_get_ip6_multicast_hops(lua_State *L, p_socket ps) | ||||
| { | ||||
|   return opt_getint(L, ps, IPPROTO_IPV6, IPV6_MULTICAST_HOPS); | ||||
| } | ||||
|  | ||||
| int opt_set_ip_multicast_loop(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_setboolean(L, ps, IPPROTO_IP, IP_MULTICAST_LOOP); | ||||
| } | ||||
|  | ||||
| int opt_get_ip_multicast_loop(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_getboolean(L, ps, IPPROTO_IP, IP_MULTICAST_LOOP); | ||||
| } | ||||
|  | ||||
| int opt_set_ip6_multicast_loop(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_setboolean(L, ps, IPPROTO_IPV6, IPV6_MULTICAST_LOOP); | ||||
| } | ||||
|  | ||||
| int opt_get_ip6_multicast_loop(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_getboolean(L, ps, IPPROTO_IPV6, IPV6_MULTICAST_LOOP); | ||||
| } | ||||
|  | ||||
| int opt_set_linger(lua_State *L, p_socket ps) | ||||
| { | ||||
|     struct linger li;                      /* obj, name, table */ | ||||
|     if (!lua_istable(L, 3)) auxiliar_typeerror(L,3,lua_typename(L, LUA_TTABLE)); | ||||
|     lua_pushstring(L, "on"); | ||||
|     lua_gettable(L, 3); | ||||
|     if (!lua_isboolean(L, -1))  | ||||
|         luaL_argerror(L, 3, "boolean 'on' field expected"); | ||||
|     li.l_onoff = (u_short) lua_toboolean(L, -1); | ||||
|     lua_pushstring(L, "timeout"); | ||||
|     lua_gettable(L, 3); | ||||
|     if (!lua_isnumber(L, -1))  | ||||
|         luaL_argerror(L, 3, "number 'timeout' field expected"); | ||||
|     li.l_linger = (u_short) lua_tonumber(L, -1); | ||||
|     return opt_set(L, ps, SOL_SOCKET, SO_LINGER, (char *) &li, sizeof(li)); | ||||
| } | ||||
|  | ||||
| int opt_get_linger(lua_State *L, p_socket ps) | ||||
| { | ||||
|     struct linger li;                      /* obj, name */ | ||||
|     int len = sizeof(li); | ||||
|     int err = opt_get(L, ps, SOL_SOCKET, SO_LINGER, (char *) &li, &len); | ||||
|     if (err) | ||||
|         return err; | ||||
|     lua_newtable(L); | ||||
|     lua_pushboolean(L, li.l_onoff); | ||||
|     lua_setfield(L, -2, "on"); | ||||
|     lua_pushinteger(L, li.l_linger); | ||||
|     lua_setfield(L, -2, "timeout"); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| int opt_set_ip_multicast_ttl(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_setint(L, ps, IPPROTO_IP, IP_MULTICAST_TTL); | ||||
| } | ||||
|  | ||||
| int opt_set_ip_multicast_if(lua_State *L, p_socket ps) | ||||
| { | ||||
|     const char *address = luaL_checkstring(L, 3);    /* obj, name, ip */ | ||||
|     struct in_addr val; | ||||
|     val.s_addr = htonl(INADDR_ANY); | ||||
|     if (strcmp(address, "*") && !inet_aton(address, &val)) | ||||
|         luaL_argerror(L, 3, "ip expected"); | ||||
|     return opt_set(L, ps, IPPROTO_IP, IP_MULTICAST_IF,  | ||||
|         (char *) &val, sizeof(val)); | ||||
| } | ||||
|  | ||||
| int opt_get_ip_multicast_if(lua_State *L, p_socket ps) | ||||
| { | ||||
|     struct in_addr val; | ||||
|     socklen_t len = sizeof(val); | ||||
|     if (getsockopt(*ps, IPPROTO_IP, IP_MULTICAST_IF, (char *) &val, &len) < 0) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, "getsockopt failed"); | ||||
|         return 2; | ||||
|     } | ||||
|     lua_pushstring(L, inet_ntoa(val)); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| int opt_set_ip_add_membership(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_setmembership(L, ps, IPPROTO_IP, IP_ADD_MEMBERSHIP); | ||||
| } | ||||
|  | ||||
| int opt_set_ip_drop_membersip(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_setmembership(L, ps, IPPROTO_IP, IP_DROP_MEMBERSHIP); | ||||
| } | ||||
|  | ||||
| int opt_set_ip6_add_membership(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_ip6_setmembership(L, ps, IPPROTO_IPV6, IPV6_ADD_MEMBERSHIP); | ||||
| } | ||||
|  | ||||
| int opt_set_ip6_drop_membersip(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_ip6_setmembership(L, ps, IPPROTO_IPV6, IPV6_DROP_MEMBERSHIP); | ||||
| } | ||||
|  | ||||
| int opt_get_ip6_v6only(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_getboolean(L, ps, IPPROTO_IPV6, IPV6_V6ONLY); | ||||
| } | ||||
|  | ||||
| int opt_set_ip6_v6only(lua_State *L, p_socket ps) | ||||
| { | ||||
|     return opt_setboolean(L, ps, IPPROTO_IPV6, IPV6_V6ONLY); | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Auxiliar functions | ||||
| \*=========================================================================*/ | ||||
| static int opt_setmembership(lua_State *L, p_socket ps, int level, int name) | ||||
| { | ||||
|     struct ip_mreq val;                   /* obj, name, table */ | ||||
|     if (!lua_istable(L, 3)) auxiliar_typeerror(L,3,lua_typename(L, LUA_TTABLE)); | ||||
|     lua_pushstring(L, "multiaddr"); | ||||
|     lua_gettable(L, 3); | ||||
|     if (!lua_isstring(L, -1))  | ||||
|         luaL_argerror(L, 3, "string 'multiaddr' field expected"); | ||||
|     if (!inet_aton(lua_tostring(L, -1), &val.imr_multiaddr))  | ||||
|         luaL_argerror(L, 3, "invalid 'multiaddr' ip address"); | ||||
|     lua_pushstring(L, "interface"); | ||||
|     lua_gettable(L, 3); | ||||
|     if (!lua_isstring(L, -1))  | ||||
|         luaL_argerror(L, 3, "string 'interface' field expected"); | ||||
|     val.imr_interface.s_addr = htonl(INADDR_ANY); | ||||
|     if (strcmp(lua_tostring(L, -1), "*") && | ||||
|             !inet_aton(lua_tostring(L, -1), &val.imr_interface))  | ||||
|         luaL_argerror(L, 3, "invalid 'interface' ip address"); | ||||
|     return opt_set(L, ps, level, name, (char *) &val, sizeof(val)); | ||||
| } | ||||
|  | ||||
| static int opt_ip6_setmembership(lua_State *L, p_socket ps, int level, int name) | ||||
| { | ||||
|     struct ipv6_mreq val;                   /* obj, opt-name, table */ | ||||
|     memset(&val, 0, sizeof(val)); | ||||
|     if (!lua_istable(L, 3)) auxiliar_typeerror(L,3,lua_typename(L, LUA_TTABLE)); | ||||
|     lua_pushstring(L, "multiaddr"); | ||||
|     lua_gettable(L, 3); | ||||
|     if (!lua_isstring(L, -1))  | ||||
|         luaL_argerror(L, 3, "string 'multiaddr' field expected"); | ||||
|     if (!inet_pton(AF_INET6, lua_tostring(L, -1), &val.ipv6mr_multiaddr))  | ||||
|         luaL_argerror(L, 3, "invalid 'multiaddr' ip address"); | ||||
|     lua_pushstring(L, "interface"); | ||||
|     lua_gettable(L, 3); | ||||
|     /* By default we listen to interface on default route | ||||
|      * (sigh). However, interface= can override it. We should  | ||||
|      * support either number, or name for it. Waiting for | ||||
|      * windows port of if_nametoindex */ | ||||
|     if (!lua_isnil(L, -1)) { | ||||
|         if (lua_isnumber(L, -1)) { | ||||
|             val.ipv6mr_interface = (unsigned int) lua_tonumber(L, -1); | ||||
|         } else | ||||
|           luaL_argerror(L, -1, "number 'interface' field expected"); | ||||
|     } | ||||
|     return opt_set(L, ps, level, name, (char *) &val, sizeof(val)); | ||||
| } | ||||
|  | ||||
| static  | ||||
| int opt_get(lua_State *L, p_socket ps, int level, int name, void *val, int* len) | ||||
| { | ||||
|     socklen_t socklen = *len; | ||||
|     if (getsockopt(*ps, level, name, (char *) val, &socklen) < 0) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, "getsockopt failed"); | ||||
|         return 2; | ||||
|     } | ||||
|     *len = socklen; | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| static  | ||||
| int opt_set(lua_State *L, p_socket ps, int level, int name, void *val, int len) | ||||
| { | ||||
|     if (setsockopt(*ps, level, name, (char *) val, len) < 0) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, "setsockopt failed"); | ||||
|         return 2; | ||||
|     } | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| static int opt_getboolean(lua_State *L, p_socket ps, int level, int name) | ||||
| { | ||||
|     int val = 0; | ||||
|     int len = sizeof(val); | ||||
|     int err = opt_get(L, ps, level, name, (char *) &val, &len); | ||||
|     if (err) | ||||
|         return err; | ||||
|     lua_pushboolean(L, val); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| int opt_get_error(lua_State *L, p_socket ps) | ||||
| { | ||||
|     int val = 0; | ||||
|     socklen_t len = sizeof(val); | ||||
|     if (getsockopt(*ps, SOL_SOCKET, SO_ERROR, (char *) &val, &len) < 0) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, "getsockopt failed"); | ||||
|         return 2; | ||||
|     } | ||||
|     lua_pushstring(L, socket_strerror(val)); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| static int opt_setboolean(lua_State *L, p_socket ps, int level, int name) | ||||
| { | ||||
|     int val = auxiliar_checkboolean(L, 3);             /* obj, name, bool */ | ||||
|     return opt_set(L, ps, level, name, (char *) &val, sizeof(val)); | ||||
| } | ||||
|  | ||||
| static int opt_getint(lua_State *L, p_socket ps, int level, int name) | ||||
| { | ||||
|     int val = 0; | ||||
|     int len = sizeof(val); | ||||
|     int err = opt_get(L, ps, level, name, (char *) &val, &len); | ||||
|     if (err) | ||||
|         return err; | ||||
|     lua_pushnumber(L, val); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| static int opt_setint(lua_State *L, p_socket ps, int level, int name) | ||||
| { | ||||
|     int val = (int) lua_tonumber(L, 3);             /* obj, name, int */ | ||||
|     return opt_set(L, ps, level, name, (char *) &val, sizeof(val)); | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										64
									
								
								Plugins/slua_unreal/External/luasocket/options.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										64
									
								
								Plugins/slua_unreal/External/luasocket/options.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,64 @@ | ||||
| #ifndef OPTIONS_H | ||||
| #define OPTIONS_H | ||||
| /*=========================================================================*\ | ||||
| * Common option interface  | ||||
| * LuaSocket toolkit | ||||
| * | ||||
| * This module provides a common interface to socket options, used mainly by | ||||
| * modules UDP and TCP.  | ||||
| \*=========================================================================*/ | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "socket.h" | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| /* option registry */ | ||||
| typedef struct t_opt { | ||||
|   const char *name; | ||||
|   int (*func)(lua_State *L, p_socket ps); | ||||
| } t_opt; | ||||
| typedef t_opt *p_opt; | ||||
|  | ||||
| /* supported options for setoption */ | ||||
| int opt_set_dontroute(lua_State *L, p_socket ps); | ||||
| int opt_set_broadcast(lua_State *L, p_socket ps); | ||||
| int opt_set_reuseaddr(lua_State *L, p_socket ps); | ||||
| int opt_set_tcp_nodelay(lua_State *L, p_socket ps); | ||||
| int opt_set_keepalive(lua_State *L, p_socket ps); | ||||
| int opt_set_linger(lua_State *L, p_socket ps); | ||||
| int opt_set_reuseaddr(lua_State *L, p_socket ps); | ||||
| int opt_set_reuseport(lua_State *L, p_socket ps); | ||||
| int opt_set_ip_multicast_if(lua_State *L, p_socket ps); | ||||
| int opt_set_ip_multicast_ttl(lua_State *L, p_socket ps); | ||||
| int opt_set_ip_multicast_loop(lua_State *L, p_socket ps); | ||||
| int opt_set_ip_add_membership(lua_State *L, p_socket ps); | ||||
| int opt_set_ip_drop_membersip(lua_State *L, p_socket ps); | ||||
| int opt_set_ip6_unicast_hops(lua_State *L, p_socket ps); | ||||
| int opt_set_ip6_multicast_hops(lua_State *L, p_socket ps); | ||||
| int opt_set_ip6_multicast_loop(lua_State *L, p_socket ps); | ||||
| int opt_set_ip6_add_membership(lua_State *L, p_socket ps); | ||||
| int opt_set_ip6_drop_membersip(lua_State *L, p_socket ps); | ||||
| int opt_set_ip6_v6only(lua_State *L, p_socket ps); | ||||
|  | ||||
| /* supported options for getoption */ | ||||
| int opt_get_reuseaddr(lua_State *L, p_socket ps); | ||||
| int opt_get_tcp_nodelay(lua_State *L, p_socket ps); | ||||
| int opt_get_keepalive(lua_State *L, p_socket ps); | ||||
| int opt_get_linger(lua_State *L, p_socket ps); | ||||
| int opt_get_reuseaddr(lua_State *L, p_socket ps); | ||||
| int opt_get_ip_multicast_loop(lua_State *L, p_socket ps); | ||||
| int opt_get_ip_multicast_if(lua_State *L, p_socket ps); | ||||
| int opt_get_error(lua_State *L, p_socket ps); | ||||
| int opt_get_ip6_multicast_loop(lua_State *L, p_socket ps); | ||||
| int opt_get_ip6_multicast_hops(lua_State *L, p_socket ps); | ||||
| int opt_get_ip6_unicast_hops(lua_State *L, p_socket ps); | ||||
| int opt_get_ip6_v6only(lua_State *L, p_socket ps);  | ||||
|  | ||||
| /* invokes the appropriate option handler */ | ||||
| int opt_meth_setoption(lua_State *L, p_opt opt, p_socket ps); | ||||
| int opt_meth_getoption(lua_State *L, p_opt opt, p_socket ps); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif | ||||
							
								
								
									
										224
									
								
								Plugins/slua_unreal/External/luasocket/select.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										224
									
								
								Plugins/slua_unreal/External/luasocket/select.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,224 @@ | ||||
| /*=========================================================================*\ | ||||
| * Select implementation | ||||
| * LuaSocket toolkit | ||||
| \*=========================================================================*/ | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
|  | ||||
| #include "socket.h" | ||||
| #include "timeout.h" | ||||
| #include "select.h" | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Internal function prototypes. | ||||
| \*=========================================================================*/ | ||||
| static t_socket getfd(lua_State *L); | ||||
| static int dirty(lua_State *L); | ||||
| static void collect_fd(lua_State *L, int tab, int itab,  | ||||
|         fd_set *set, t_socket *max_fd); | ||||
| static int check_dirty(lua_State *L, int tab, int dtab, fd_set *set); | ||||
| static void return_fd(lua_State *L, fd_set *set, t_socket max_fd,  | ||||
|         int itab, int tab, int start); | ||||
| static void make_assoc(lua_State *L, int tab); | ||||
| static int global_select(lua_State *L); | ||||
|  | ||||
| /* functions in library namespace */ | ||||
| static luaL_Reg select_func[] = { | ||||
|     {"select", global_select}, | ||||
|     {NULL,     NULL} | ||||
| }; | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Exported functions | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Initializes module | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int select_open(lua_State *L) { | ||||
|     lua_pushstring(L, "_SETSIZE"); | ||||
|     lua_pushnumber(L, FD_SETSIZE); | ||||
|     lua_rawset(L, -3); | ||||
| #if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE) | ||||
|     luaL_setfuncs(L, select_func, 0); | ||||
| #else | ||||
|     luaL_openlib(L, NULL, select_func, 0); | ||||
| #endif | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Global Lua functions | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Waits for a set of sockets until a condition is met or timeout. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int global_select(lua_State *L) { | ||||
|     int rtab, wtab, itab, ret, ndirty; | ||||
|     t_socket max_fd = SOCKET_INVALID; | ||||
|     fd_set rset, wset; | ||||
|     t_timeout tm; | ||||
|     double t = luaL_optnumber(L, 3, -1); | ||||
|     FD_ZERO(&rset); FD_ZERO(&wset); | ||||
|     lua_settop(L, 3); | ||||
|     lua_newtable(L); itab = lua_gettop(L); | ||||
|     lua_newtable(L); rtab = lua_gettop(L); | ||||
|     lua_newtable(L); wtab = lua_gettop(L); | ||||
|     collect_fd(L, 1, itab, &rset, &max_fd); | ||||
|     collect_fd(L, 2, itab, &wset, &max_fd); | ||||
|     ndirty = check_dirty(L, 1, rtab, &rset); | ||||
|     t = ndirty > 0? 0.0: t; | ||||
|     timeout_init(&tm, t, -1); | ||||
|     timeout_markstart(&tm); | ||||
|     ret = socket_select(max_fd+1, &rset, &wset, NULL, &tm); | ||||
|     if (ret > 0 || ndirty > 0) { | ||||
|         return_fd(L, &rset, max_fd+1, itab, rtab, ndirty); | ||||
|         return_fd(L, &wset, max_fd+1, itab, wtab, 0); | ||||
|         make_assoc(L, rtab); | ||||
|         make_assoc(L, wtab); | ||||
|         return 2; | ||||
|     } else if (ret == 0) { | ||||
|         lua_pushstring(L, "timeout"); | ||||
|         return 3; | ||||
|     } else { | ||||
|         luaL_error(L, "select failed"); | ||||
|         return 3; | ||||
|     } | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Internal functions | ||||
| \*=========================================================================*/ | ||||
| static t_socket getfd(lua_State *L) { | ||||
|     t_socket fd = SOCKET_INVALID; | ||||
|     lua_pushstring(L, "getfd"); | ||||
|     lua_gettable(L, -2); | ||||
|     if (!lua_isnil(L, -1)) { | ||||
|         lua_pushvalue(L, -2); | ||||
|         lua_call(L, 1, 1); | ||||
|         if (lua_isnumber(L, -1)) { | ||||
|             double numfd = lua_tonumber(L, -1);  | ||||
|             fd = (numfd >= 0.0)? (t_socket) numfd: SOCKET_INVALID; | ||||
|         } | ||||
|     }  | ||||
|     lua_pop(L, 1); | ||||
|     return fd; | ||||
| } | ||||
|  | ||||
| static int dirty(lua_State *L) { | ||||
|     int is = 0; | ||||
|     lua_pushstring(L, "dirty"); | ||||
|     lua_gettable(L, -2); | ||||
|     if (!lua_isnil(L, -1)) { | ||||
|         lua_pushvalue(L, -2); | ||||
|         lua_call(L, 1, 1); | ||||
|         is = lua_toboolean(L, -1); | ||||
|     }  | ||||
|     lua_pop(L, 1); | ||||
|     return is; | ||||
| } | ||||
|  | ||||
| static void collect_fd(lua_State *L, int tab, int itab,  | ||||
|         fd_set *set, t_socket *max_fd) { | ||||
|     int i = 1, n = 0; | ||||
|     /* nil is the same as an empty table */ | ||||
|     if (lua_isnil(L, tab)) return; | ||||
|     /* otherwise we need it to be a table */ | ||||
|     luaL_checktype(L, tab, LUA_TTABLE); | ||||
|     for ( ;; ) { | ||||
|         t_socket fd; | ||||
|         lua_pushnumber(L, i); | ||||
|         lua_gettable(L, tab); | ||||
|         if (lua_isnil(L, -1)) { | ||||
|             lua_pop(L, 1); | ||||
|             break; | ||||
|         } | ||||
|         /* getfd figures out if this is a socket */ | ||||
|         fd = getfd(L); | ||||
|         if (fd != SOCKET_INVALID) { | ||||
|             /* make sure we don't overflow the fd_set */ | ||||
| #ifdef _WIN32 | ||||
|             if (n >= FD_SETSIZE)  | ||||
|                 luaL_argerror(L, tab, "too many sockets"); | ||||
| #else | ||||
|             if (fd >= FD_SETSIZE)  | ||||
|                 luaL_argerror(L, tab, "descriptor too large for set size"); | ||||
| #endif | ||||
|             FD_SET(fd, set); | ||||
|             n++; | ||||
|             /* keep track of the largest descriptor so far */ | ||||
|             if (*max_fd == SOCKET_INVALID || *max_fd < fd)  | ||||
|                 *max_fd = fd; | ||||
|             /* make sure we can map back from descriptor to the object */ | ||||
|             lua_pushnumber(L, (lua_Number) fd); | ||||
|             lua_pushvalue(L, -2); | ||||
|             lua_settable(L, itab); | ||||
|         } | ||||
|         lua_pop(L, 1); | ||||
|         i = i + 1; | ||||
|     } | ||||
| } | ||||
|  | ||||
| static int check_dirty(lua_State *L, int tab, int dtab, fd_set *set) { | ||||
|     int ndirty = 0, i = 1; | ||||
|     if (lua_isnil(L, tab))  | ||||
|         return 0; | ||||
|     for ( ;; ) {  | ||||
|         t_socket fd; | ||||
|         lua_pushnumber(L, i); | ||||
|         lua_gettable(L, tab); | ||||
|         if (lua_isnil(L, -1)) { | ||||
|             lua_pop(L, 1); | ||||
|             break; | ||||
|         } | ||||
|         fd = getfd(L); | ||||
|         if (fd != SOCKET_INVALID && dirty(L)) { | ||||
|             lua_pushnumber(L, ++ndirty); | ||||
|             lua_pushvalue(L, -2); | ||||
|             lua_settable(L, dtab); | ||||
|             FD_CLR(fd, set); | ||||
|         } | ||||
|         lua_pop(L, 1); | ||||
|         i = i + 1; | ||||
|     } | ||||
|     return ndirty; | ||||
| } | ||||
|  | ||||
| static void return_fd(lua_State *L, fd_set *set, t_socket max_fd,  | ||||
|         int itab, int tab, int start) { | ||||
|     t_socket fd; | ||||
|     for (fd = 0; fd < max_fd; fd++) { | ||||
|         if (FD_ISSET(fd, set)) { | ||||
|             lua_pushnumber(L, ++start); | ||||
|             lua_pushnumber(L, (lua_Number) fd); | ||||
|             lua_gettable(L, itab); | ||||
|             lua_settable(L, tab); | ||||
|         } | ||||
|     } | ||||
| } | ||||
|  | ||||
| static void make_assoc(lua_State *L, int tab) { | ||||
|     int i = 1, atab; | ||||
|     lua_newtable(L); atab = lua_gettop(L); | ||||
|     for ( ;; ) { | ||||
|         lua_pushnumber(L, i); | ||||
|         lua_gettable(L, tab); | ||||
|         if (!lua_isnil(L, -1)) { | ||||
|             lua_pushnumber(L, i); | ||||
|             lua_pushvalue(L, -2); | ||||
|             lua_settable(L, atab); | ||||
|             lua_pushnumber(L, i); | ||||
|             lua_settable(L, atab); | ||||
|         } else { | ||||
|             lua_pop(L, 1); | ||||
|             break; | ||||
|         } | ||||
|         i = i+1; | ||||
|     } | ||||
| } | ||||
|  | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										19
									
								
								Plugins/slua_unreal/External/luasocket/select.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										19
									
								
								Plugins/slua_unreal/External/luasocket/select.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,19 @@ | ||||
| #ifndef SELECT_H | ||||
| #define SELECT_H | ||||
| /*=========================================================================*\ | ||||
| * Select implementation | ||||
| * LuaSocket toolkit | ||||
| * | ||||
| * Each object that can be passed to the select function has to export  | ||||
| * method getfd() which returns the descriptor to be passed to the | ||||
| * underlying select function. Another method, dirty(), should return  | ||||
| * true if there is data ready for reading (required for buffered input). | ||||
| \*=========================================================================*/ | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| int select_open(lua_State *L); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif /* SELECT_H */ | ||||
							
								
								
									
										200
									
								
								Plugins/slua_unreal/External/luasocket/serial.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										200
									
								
								Plugins/slua_unreal/External/luasocket/serial.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,200 @@ | ||||
| /*=========================================================================*\ | ||||
| * Serial stream | ||||
| * LuaSocket toolkit | ||||
| \*=========================================================================*/ | ||||
| #include <string.h>  | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
| #include "luasocket.h" | ||||
|  | ||||
| #include "auxiliar.h" | ||||
| #include "socket.h" | ||||
| #include "options.h" | ||||
| #include "unix.h" | ||||
|  | ||||
| #ifndef _WIN32 | ||||
| #include <sys/un.h>  | ||||
| #endif | ||||
|  | ||||
| /* | ||||
| Reuses userdata definition from unix.h, since it is useful for all | ||||
| stream-like objects. | ||||
|  | ||||
| If we stored the serial path for use in error messages or userdata | ||||
| printing, we might need our own userdata definition. | ||||
|  | ||||
| Group usage is semi-inherited from unix.c, but unnecessary since we | ||||
| have only one object type. | ||||
| */ | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Internal function prototypes | ||||
| \*=========================================================================*/ | ||||
| static int serial_global_create(lua_State *L); | ||||
| static int serial_meth_send(lua_State *L); | ||||
| static int serial_meth_receive(lua_State *L); | ||||
| static int serial_meth_close(lua_State *L); | ||||
| static int serial_meth_settimeout(lua_State *L); | ||||
| static int serial_meth_getfd(lua_State *L); | ||||
| static int serial_meth_setfd(lua_State *L); | ||||
| static int serial_meth_dirty(lua_State *L); | ||||
| static int serial_meth_getstats(lua_State *L); | ||||
| static int serial_meth_setstats(lua_State *L); | ||||
|  | ||||
| /* serial object methods */ | ||||
| static luaL_Reg serial_methods[] = { | ||||
|     {"__gc",        serial_meth_close}, | ||||
|     {"__tostring",  auxiliar_tostring}, | ||||
|     {"close",       serial_meth_close}, | ||||
|     {"dirty",       serial_meth_dirty}, | ||||
|     {"getfd",       serial_meth_getfd}, | ||||
|     {"getstats",    serial_meth_getstats}, | ||||
|     {"setstats",    serial_meth_setstats}, | ||||
|     {"receive",     serial_meth_receive}, | ||||
|     {"send",        serial_meth_send}, | ||||
|     {"setfd",       serial_meth_setfd}, | ||||
|     {"settimeout",  serial_meth_settimeout}, | ||||
|     {NULL,          NULL} | ||||
| }; | ||||
|  | ||||
| /* our socket creation function */ | ||||
| /* this is an ad-hoc module that returns a single function  | ||||
|  * as such, do not include other functions in this array. */ | ||||
| static luaL_Reg serial_func[] = { | ||||
|     {"serial", serial_global_create}, | ||||
|     {NULL,          NULL} | ||||
| }; | ||||
|  | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Initializes module | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| LUASOCKET_API int luaopen_socket_serial(lua_State *L) { | ||||
|     /* create classes */ | ||||
|     auxiliar_newclass(L, "serial{client}", serial_methods); | ||||
|     /* create class groups */ | ||||
|     auxiliar_add2group(L, "serial{client}", "serial{any}"); | ||||
| #if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE) | ||||
|     lua_pushcfunction(L, serial_global_create); | ||||
|     (void)serial_func; | ||||
| #else | ||||
|     /* set function into socket namespace */ | ||||
|     luaL_openlib(L, "socket", serial_func, 0); | ||||
|     lua_pushcfunction(L, serial_global_create); | ||||
| #endif | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Lua methods | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Just call buffered IO methods | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int serial_meth_send(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkclass(L, "serial{client}", 1); | ||||
|     return buffer_meth_send(L, &un->buf); | ||||
| } | ||||
|  | ||||
| static int serial_meth_receive(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkclass(L, "serial{client}", 1); | ||||
|     return buffer_meth_receive(L, &un->buf); | ||||
| } | ||||
|  | ||||
| static int serial_meth_getstats(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkclass(L, "serial{client}", 1); | ||||
|     return buffer_meth_getstats(L, &un->buf); | ||||
| } | ||||
|  | ||||
| static int serial_meth_setstats(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkclass(L, "serial{client}", 1); | ||||
|     return buffer_meth_setstats(L, &un->buf); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Select support methods | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int serial_meth_getfd(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkgroup(L, "serial{any}", 1); | ||||
|     lua_pushnumber(L, (int) un->sock); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /* this is very dangerous, but can be handy for those that are brave enough */ | ||||
| static int serial_meth_setfd(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkgroup(L, "serial{any}", 1); | ||||
|     un->sock = (t_socket) luaL_checknumber(L, 2);  | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| static int serial_meth_dirty(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkgroup(L, "serial{any}", 1); | ||||
|     lua_pushboolean(L, !buffer_isempty(&un->buf)); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Closes socket used by object  | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int serial_meth_close(lua_State *L) | ||||
| { | ||||
|     p_unix un = (p_unix) auxiliar_checkgroup(L, "serial{any}", 1); | ||||
|     socket_destroy(&un->sock); | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Just call tm methods | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int serial_meth_settimeout(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkgroup(L, "serial{any}", 1); | ||||
|     return timeout_meth_settimeout(L, &un->tm); | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Library functions | ||||
| \*=========================================================================*/ | ||||
|  | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Creates a serial object  | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int serial_global_create(lua_State *L) { | ||||
| #ifndef _WIN32 | ||||
|     const char* path = luaL_checkstring(L, 1); | ||||
|  | ||||
|     /* allocate unix object */ | ||||
|     p_unix un = (p_unix) lua_newuserdata(L, sizeof(t_unix)); | ||||
|  | ||||
|     /* open serial device */ | ||||
|     t_socket sock = open(path, O_NOCTTY|O_RDWR); | ||||
|  | ||||
|     /*printf("open %s on %d\n", path, sock);*/ | ||||
|  | ||||
|     if (sock < 0)  { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, socket_strerror(errno)); | ||||
|         lua_pushnumber(L, errno); | ||||
|         return 3; | ||||
|     } | ||||
|     /* set its type as client object */ | ||||
|     auxiliar_setclass(L, "serial{client}", -1); | ||||
|     /* initialize remaining structure fields */ | ||||
|     socket_setnonblocking(&sock); | ||||
|     un->sock = sock; | ||||
|     io_init(&un->io, (p_send) socket_write, (p_recv) socket_read,  | ||||
|             (p_error) socket_ioerror, &un->sock); | ||||
|     timeout_init(&un->tm, -1, -1); | ||||
|     buffer_init(&un->buf, &un->io, &un->tm); | ||||
|     return 1; | ||||
| #else | ||||
| 	return -1; | ||||
| #endif | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										258
									
								
								Plugins/slua_unreal/External/luasocket/smtp.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										258
									
								
								Plugins/slua_unreal/External/luasocket/smtp.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,258 @@ | ||||
| R"-++**++-( | ||||
| ----------------------------------------------------------------------------- | ||||
| -- SMTP client support for the Lua language. | ||||
| -- LuaSocket toolkit. | ||||
| -- Author: Diego Nehab | ||||
| ----------------------------------------------------------------------------- | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Declare module and import dependencies | ||||
| ----------------------------------------------------------------------------- | ||||
| local base = _G | ||||
| local coroutine = require("coroutine") | ||||
| local string = require("string") | ||||
| local math = require("math") | ||||
| local os = require("os") | ||||
| local socket = require("socket") | ||||
| local tp = require("socket.tp") | ||||
| local ltn12 = require("ltn12") | ||||
| local headers = require("socket.headers") | ||||
| local mime = require("mime") | ||||
|  | ||||
| socket.smtp = {} | ||||
| local _M = socket.smtp | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Program constants | ||||
| ----------------------------------------------------------------------------- | ||||
| -- timeout for connection | ||||
| _M.TIMEOUT = 60 | ||||
| -- default server used to send e-mails | ||||
| _M.SERVER = "localhost" | ||||
| -- default port | ||||
| _M.PORT = 25 | ||||
| -- domain used in HELO command and default sendmail | ||||
| -- If we are under a CGI, try to get from environment | ||||
| _M.DOMAIN = os.getenv("SERVER_NAME") or "localhost" | ||||
| -- default time zone (means we don't know) | ||||
| _M.ZONE = "-0000" | ||||
|  | ||||
| --------------------------------------------------------------------------- | ||||
| -- Low level SMTP API | ||||
| ----------------------------------------------------------------------------- | ||||
| local metat = { __index = {} } | ||||
|  | ||||
| function metat.__index:greet(domain) | ||||
|     self.try(self.tp:check("2..")) | ||||
|     self.try(self.tp:command("EHLO", domain or _M.DOMAIN)) | ||||
|     return socket.skip(1, self.try(self.tp:check("2.."))) | ||||
| end | ||||
|  | ||||
| function metat.__index:mail(from) | ||||
|     self.try(self.tp:command("MAIL", "FROM:" .. from)) | ||||
|     return self.try(self.tp:check("2..")) | ||||
| end | ||||
|  | ||||
| function metat.__index:rcpt(to) | ||||
|     self.try(self.tp:command("RCPT", "TO:" .. to)) | ||||
|     return self.try(self.tp:check("2..")) | ||||
| end | ||||
|  | ||||
| function metat.__index:data(src, step) | ||||
|     self.try(self.tp:command("DATA")) | ||||
|     self.try(self.tp:check("3..")) | ||||
|     self.try(self.tp:source(src, step)) | ||||
|     self.try(self.tp:send("\r\n.\r\n")) | ||||
|     return self.try(self.tp:check("2..")) | ||||
| end | ||||
|  | ||||
| function metat.__index:quit() | ||||
|     self.try(self.tp:command("QUIT")) | ||||
|     return self.try(self.tp:check("2..")) | ||||
| end | ||||
|  | ||||
| function metat.__index:close() | ||||
|     return self.tp:close() | ||||
| end | ||||
|  | ||||
| function metat.__index:login(user, password) | ||||
|     self.try(self.tp:command("AUTH", "LOGIN")) | ||||
|     self.try(self.tp:check("3..")) | ||||
|     self.try(self.tp:send(mime.b64(user) .. "\r\n")) | ||||
|     self.try(self.tp:check("3..")) | ||||
|     self.try(self.tp:send(mime.b64(password) .. "\r\n")) | ||||
|     return self.try(self.tp:check("2..")) | ||||
| end | ||||
|  | ||||
| function metat.__index:plain(user, password) | ||||
|     local auth = "PLAIN " .. mime.b64("\0" .. user .. "\0" .. password) | ||||
|     self.try(self.tp:command("AUTH", auth)) | ||||
|     return self.try(self.tp:check("2..")) | ||||
| end | ||||
|  | ||||
| function metat.__index:auth(user, password, ext) | ||||
|     if not user or not password then return 1 end | ||||
|     if string.find(ext, "AUTH[^\n]+LOGIN") then | ||||
|         return self:login(user, password) | ||||
|     elseif string.find(ext, "AUTH[^\n]+PLAIN") then | ||||
|         return self:plain(user, password) | ||||
|     else | ||||
|         self.try(nil, "authentication not supported") | ||||
|     end | ||||
| end | ||||
|  | ||||
| -- send message or throw an exception | ||||
| function metat.__index:send(mailt) | ||||
|     self:mail(mailt.from) | ||||
|     if base.type(mailt.rcpt) == "table" then | ||||
|         for i,v in base.ipairs(mailt.rcpt) do | ||||
|             self:rcpt(v) | ||||
|         end | ||||
|     else | ||||
|         self:rcpt(mailt.rcpt) | ||||
|     end | ||||
|     self:data(ltn12.source.chain(mailt.source, mime.stuff()), mailt.step) | ||||
| end | ||||
|  | ||||
| function _M.open(server, port, create) | ||||
|     local tp = socket.try(tp.connect(server or _M.SERVER, port or _M.PORT, | ||||
|         _M.TIMEOUT, create)) | ||||
|     local s = base.setmetatable({tp = tp}, metat) | ||||
|     -- make sure tp is closed if we get an exception | ||||
|     s.try = socket.newtry(function() | ||||
|         s:close() | ||||
|     end) | ||||
|     return s | ||||
| end | ||||
|  | ||||
| -- convert headers to lowercase | ||||
| local function lower_headers(headers) | ||||
|     local lower = {} | ||||
|     for i,v in base.pairs(headers or lower) do | ||||
|         lower[string.lower(i)] = v | ||||
|     end | ||||
|     return lower | ||||
| end | ||||
|  | ||||
| --------------------------------------------------------------------------- | ||||
| -- Multipart message source | ||||
| ----------------------------------------------------------------------------- | ||||
| -- returns a hopefully unique mime boundary | ||||
| local seqno = 0 | ||||
| local function newboundary() | ||||
|     seqno = seqno + 1 | ||||
|     return string.format('%s%05d==%05u', os.date('%d%m%Y%H%M%S'), | ||||
|         math.random(0, 99999), seqno) | ||||
| end | ||||
|  | ||||
| -- send_message forward declaration | ||||
| local send_message | ||||
|  | ||||
| -- yield the headers all at once, it's faster | ||||
| local function send_headers(tosend) | ||||
|     local canonic = headers.canonic | ||||
|     local h = "\r\n" | ||||
|     for f,v in base.pairs(tosend) do | ||||
|         h = (canonic[f] or f) .. ': ' .. v .. "\r\n" .. h | ||||
|     end | ||||
|     coroutine.yield(h) | ||||
| end | ||||
|  | ||||
| -- yield multipart message body from a multipart message table | ||||
| local function send_multipart(mesgt) | ||||
|     -- make sure we have our boundary and send headers | ||||
|     local bd = newboundary() | ||||
|     local headers = lower_headers(mesgt.headers or {}) | ||||
|     headers['content-type'] = headers['content-type'] or 'multipart/mixed' | ||||
|     headers['content-type'] = headers['content-type'] .. | ||||
|         '; boundary="' ..  bd .. '"' | ||||
|     send_headers(headers) | ||||
|     -- send preamble | ||||
|     if mesgt.body.preamble then | ||||
|         coroutine.yield(mesgt.body.preamble) | ||||
|         coroutine.yield("\r\n") | ||||
|     end | ||||
|     -- send each part separated by a boundary | ||||
|     for i, m in base.ipairs(mesgt.body) do | ||||
|         coroutine.yield("\r\n--" .. bd .. "\r\n") | ||||
|         send_message(m) | ||||
|     end | ||||
|     -- send last boundary | ||||
|     coroutine.yield("\r\n--" .. bd .. "--\r\n\r\n") | ||||
|     -- send epilogue | ||||
|     if mesgt.body.epilogue then | ||||
|         coroutine.yield(mesgt.body.epilogue) | ||||
|         coroutine.yield("\r\n") | ||||
|     end | ||||
| end | ||||
|  | ||||
| -- yield message body from a source | ||||
| local function send_source(mesgt) | ||||
|     -- make sure we have a content-type | ||||
|     local headers = lower_headers(mesgt.headers or {}) | ||||
|     headers['content-type'] = headers['content-type'] or | ||||
|         'text/plain; charset="iso-8859-1"' | ||||
|     send_headers(headers) | ||||
|     -- send body from source | ||||
|     while true do | ||||
|         local chunk, err = mesgt.body() | ||||
|         if err then coroutine.yield(nil, err) | ||||
|         elseif chunk then coroutine.yield(chunk) | ||||
|         else break end | ||||
|     end | ||||
| end | ||||
|  | ||||
| -- yield message body from a string | ||||
| local function send_string(mesgt) | ||||
|     -- make sure we have a content-type | ||||
|     local headers = lower_headers(mesgt.headers or {}) | ||||
|     headers['content-type'] = headers['content-type'] or | ||||
|         'text/plain; charset="iso-8859-1"' | ||||
|     send_headers(headers) | ||||
|     -- send body from string | ||||
|     coroutine.yield(mesgt.body) | ||||
| end | ||||
|  | ||||
| -- message source | ||||
| function send_message(mesgt) | ||||
|     if base.type(mesgt.body) == "table" then send_multipart(mesgt) | ||||
|     elseif base.type(mesgt.body) == "function" then send_source(mesgt) | ||||
|     else send_string(mesgt) end | ||||
| end | ||||
|  | ||||
| -- set defaul headers | ||||
| local function adjust_headers(mesgt) | ||||
|     local lower = lower_headers(mesgt.headers) | ||||
|     lower["date"] = lower["date"] or | ||||
|         os.date("!%a, %d %b %Y %H:%M:%S ") .. (mesgt.zone or _M.ZONE) | ||||
|     lower["x-mailer"] = lower["x-mailer"] or socket._VERSION | ||||
|     -- this can't be overriden | ||||
|     lower["mime-version"] = "1.0" | ||||
|     return lower | ||||
| end | ||||
|  | ||||
| function _M.message(mesgt) | ||||
|     mesgt.headers = adjust_headers(mesgt) | ||||
|     -- create and return message source | ||||
|     local co = coroutine.create(function() send_message(mesgt) end) | ||||
|     return function() | ||||
|         local ret, a, b = coroutine.resume(co) | ||||
|         if ret then return a, b | ||||
|         else return nil, a end | ||||
|     end | ||||
| end | ||||
|  | ||||
| --------------------------------------------------------------------------- | ||||
| -- High level SMTP API | ||||
| ----------------------------------------------------------------------------- | ||||
| _M.send = socket.protect(function(mailt) | ||||
|     local s = _M.open(mailt.server, mailt.port, mailt.create) | ||||
|     local ext = s:greet(mailt.domain) | ||||
|     s:auth(mailt.user, mailt.password, ext) | ||||
|     s:send(mailt) | ||||
|     s:quit() | ||||
|     return s:close() | ||||
| end) | ||||
|  | ||||
| return _M | ||||
| )-++**++-"; | ||||
							
								
								
									
										82
									
								
								Plugins/slua_unreal/External/luasocket/socket.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										82
									
								
								Plugins/slua_unreal/External/luasocket/socket.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,82 @@ | ||||
| #ifndef SOCKET_H | ||||
| #define SOCKET_H | ||||
| /*=========================================================================*\ | ||||
| * Socket compatibilization module | ||||
| * LuaSocket toolkit | ||||
| * | ||||
| * BSD Sockets and WinSock are similar, but there are a few irritating | ||||
| * differences. Also, not all *nix platforms behave the same. This module | ||||
| * (and the associated usocket.h and wsocket.h) factor these differences and | ||||
| * creates a interface compatible with the io.h module. | ||||
| \*=========================================================================*/ | ||||
| #include "io.h" | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Platform specific compatibilization | ||||
| \*=========================================================================*/ | ||||
| #ifdef _WIN32 | ||||
| #include "wsocket.h" | ||||
| #else | ||||
| #include "usocket.h" | ||||
| #endif | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * The connect and accept functions accept a timeout and their | ||||
| * implementations are somewhat complicated. We chose to move | ||||
| * the timeout control into this module for these functions in | ||||
| * order to simplify the modules that use them.  | ||||
| \*=========================================================================*/ | ||||
| #include "timeout.h" | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| /* we are lazy... */ | ||||
| typedef struct sockaddr SA; | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Functions bellow implement a comfortable platform independent  | ||||
| * interface to sockets | ||||
| \*=========================================================================*/ | ||||
| int socket_open(void); | ||||
| int socket_close(void); | ||||
| void socket_destroy(p_socket ps); | ||||
| void socket_shutdown(p_socket ps, int how);  | ||||
| int socket_sendto(p_socket ps, const char *data, size_t count,  | ||||
|         size_t *sent, SA *addr, socklen_t addr_len, p_timeout tm); | ||||
| int socket_recvfrom(p_socket ps, char *data, size_t count,  | ||||
|         size_t *got, SA *addr, socklen_t *addr_len, p_timeout tm); | ||||
|  | ||||
| void socket_setnonblocking(p_socket ps); | ||||
| void socket_setblocking(p_socket ps); | ||||
|  | ||||
| int socket_waitfd(p_socket ps, int sw, p_timeout tm); | ||||
| int socket_select(t_socket n, fd_set *rfds, fd_set *wfds, fd_set *efds,  | ||||
|         p_timeout tm); | ||||
|  | ||||
| int socket_connect(p_socket ps, SA *addr, socklen_t addr_len, p_timeout tm);  | ||||
| int socket_create(p_socket ps, int domain, int type, int protocol); | ||||
| int socket_bind(p_socket ps, SA *addr, socklen_t addr_len);  | ||||
| int socket_listen(p_socket ps, int backlog); | ||||
| int socket_accept(p_socket ps, p_socket pa, SA *addr,  | ||||
|         socklen_t *addr_len, p_timeout tm); | ||||
|  | ||||
| const char *socket_hoststrerror(int err); | ||||
| const char *socket_gaistrerror(int err); | ||||
| const char *socket_strerror(int err); | ||||
|  | ||||
| /* these are perfect to use with the io abstraction module  | ||||
|    and the buffered input module */ | ||||
| int socket_send(p_socket ps, const char *data, size_t count,  | ||||
|         size_t *sent, p_timeout tm); | ||||
| int socket_recv(p_socket ps, char *data, size_t count, size_t *got, p_timeout tm); | ||||
| int socket_write(p_socket ps, const char *data, size_t count,  | ||||
|         size_t *sent, p_timeout tm); | ||||
| int socket_read(p_socket ps, char *data, size_t count, size_t *got, p_timeout tm); | ||||
| const char *socket_ioerror(p_socket ps, int err); | ||||
|  | ||||
| int socket_gethostbyaddr(const char *addr, socklen_t len, struct hostent **hp); | ||||
| int socket_gethostbyname(const char *addr, struct hostent **hp); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif /* SOCKET_H */ | ||||
							
								
								
									
										151
									
								
								Plugins/slua_unreal/External/luasocket/socket.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										151
									
								
								Plugins/slua_unreal/External/luasocket/socket.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,151 @@ | ||||
| R"-++**++-( | ||||
| ----------------------------------------------------------------------------- | ||||
| -- LuaSocket helper module | ||||
| -- Author: Diego Nehab | ||||
| ----------------------------------------------------------------------------- | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Declare module and import dependencies | ||||
| ----------------------------------------------------------------------------- | ||||
| local base = _G | ||||
| local string = require("string") | ||||
| local math = require("math") | ||||
| local socket = require("socket.core") | ||||
|  | ||||
| local _M = socket | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Exported auxiliar functions | ||||
| ----------------------------------------------------------------------------- | ||||
| function _M.connect4(address, port, laddress, lport) | ||||
|     return socket.connect(address, port, laddress, lport, "inet") | ||||
| end | ||||
|  | ||||
| function _M.connect6(address, port, laddress, lport) | ||||
|     return socket.connect(address, port, laddress, lport, "inet6") | ||||
| end | ||||
|  | ||||
| function _M.bind(host, port, backlog) | ||||
|     if host == "*" then host = "0.0.0.0" end | ||||
|     local addrinfo, err = socket.dns.getaddrinfo(host); | ||||
|     if not addrinfo then return nil, err end | ||||
|     local sock, res | ||||
|     err = "no info on address" | ||||
|     for i, alt in base.ipairs(addrinfo) do | ||||
|         if alt.family == "inet" then | ||||
|             sock, err = socket.tcp() | ||||
|         else | ||||
|             sock, err = socket.tcp6() | ||||
|         end | ||||
|         if not sock then return nil, err end | ||||
|         sock:setoption("reuseaddr", true) | ||||
|         res, err = sock:bind(alt.addr, port) | ||||
|         if not res then  | ||||
|             sock:close() | ||||
|         else  | ||||
|             res, err = sock:listen(backlog) | ||||
|             if not res then  | ||||
|                 sock:close() | ||||
|             else | ||||
|                 return sock | ||||
|             end | ||||
|         end  | ||||
|     end | ||||
|     return nil, err | ||||
| end | ||||
|  | ||||
| _M.try = _M.newtry() | ||||
|  | ||||
| function _M.choose(table) | ||||
|     return function(name, opt1, opt2) | ||||
|         if base.type(name) ~= "string" then | ||||
|             name, opt1, opt2 = "default", name, opt1 | ||||
|         end | ||||
|         local f = table[name or "nil"] | ||||
|         if not f then base.error("unknown key (".. base.tostring(name) ..")", 3) | ||||
|         else return f(opt1, opt2) end | ||||
|     end | ||||
| end | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Socket sources and sinks, conforming to LTN12 | ||||
| ----------------------------------------------------------------------------- | ||||
| -- create namespaces inside LuaSocket namespace | ||||
| local sourcet, sinkt = {}, {} | ||||
| _M.sourcet = sourcet | ||||
| _M.sinkt = sinkt | ||||
|  | ||||
| _M.BLOCKSIZE = 2048 | ||||
|  | ||||
| sinkt["close-when-done"] = function(sock) | ||||
|     return base.setmetatable({ | ||||
|         getfd = function() return sock:getfd() end, | ||||
|         dirty = function() return sock:dirty() end | ||||
|     }, { | ||||
|         __call = function(self, chunk, err) | ||||
|             if not chunk then | ||||
|                 sock:close() | ||||
|                 return 1 | ||||
|             else return sock:send(chunk) end | ||||
|         end | ||||
|     }) | ||||
| end | ||||
|  | ||||
| sinkt["keep-open"] = function(sock) | ||||
|     return base.setmetatable({ | ||||
|         getfd = function() return sock:getfd() end, | ||||
|         dirty = function() return sock:dirty() end | ||||
|     }, { | ||||
|         __call = function(self, chunk, err) | ||||
|             if chunk then return sock:send(chunk) | ||||
|             else return 1 end | ||||
|         end | ||||
|     }) | ||||
| end | ||||
|  | ||||
| sinkt["default"] = sinkt["keep-open"] | ||||
|  | ||||
| _M.sink = _M.choose(sinkt) | ||||
|  | ||||
| sourcet["by-length"] = function(sock, length) | ||||
|     return base.setmetatable({ | ||||
|         getfd = function() return sock:getfd() end, | ||||
|         dirty = function() return sock:dirty() end | ||||
|     }, { | ||||
|         __call = function() | ||||
|             if length <= 0 then return nil end | ||||
|             local size = math.min(socket.BLOCKSIZE, length) | ||||
|             local chunk, err = sock:receive(size) | ||||
|             if err then return nil, err end | ||||
|             length = length - string.len(chunk) | ||||
|             return chunk | ||||
|         end | ||||
|     }) | ||||
| end | ||||
|  | ||||
| sourcet["until-closed"] = function(sock) | ||||
|     local done | ||||
|     return base.setmetatable({ | ||||
|         getfd = function() return sock:getfd() end, | ||||
|         dirty = function() return sock:dirty() end | ||||
|     }, { | ||||
|         __call = function() | ||||
|             if done then return nil end | ||||
|             local chunk, err, partial = sock:receive(socket.BLOCKSIZE) | ||||
|             if not err then return chunk | ||||
|             elseif err == "closed" then | ||||
|                 sock:close() | ||||
|                 done = 1 | ||||
|                 return partial | ||||
|             else return nil, err end | ||||
|         end | ||||
|     }) | ||||
| end | ||||
|  | ||||
|  | ||||
| sourcet["default"] = sourcet["until-closed"] | ||||
|  | ||||
| _M.source = _M.choose(sourcet) | ||||
|  | ||||
| return _M | ||||
| )-++**++-"; | ||||
							
								
								
									
										493
									
								
								Plugins/slua_unreal/External/luasocket/tcp.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										493
									
								
								Plugins/slua_unreal/External/luasocket/tcp.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,493 @@ | ||||
| /*=========================================================================*\ | ||||
| * TCP object | ||||
| * LuaSocket toolkit | ||||
| \*=========================================================================*/ | ||||
| #include <string.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
|  | ||||
| #include "auxiliar.h" | ||||
| #include "socket.h" | ||||
| #include "inet.h" | ||||
| #include "options.h" | ||||
| #include "tcp.h" | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Internal function prototypes | ||||
| \*=========================================================================*/ | ||||
| static int tcp_global_create(lua_State *L); | ||||
| static int tcp_global_create6(lua_State *L); | ||||
| static int tcp_global_connect(lua_State *L); | ||||
| static int tcp_meth_connect(lua_State *L); | ||||
| static int tcp_meth_listen(lua_State *L); | ||||
| static int tcp_meth_getfamily(lua_State *L); | ||||
| static int tcp_meth_bind(lua_State *L); | ||||
| static int tcp_meth_send(lua_State *L); | ||||
| static int tcp_meth_getstats(lua_State *L); | ||||
| static int tcp_meth_setstats(lua_State *L); | ||||
| static int tcp_meth_getsockname(lua_State *L); | ||||
| static int tcp_meth_getpeername(lua_State *L); | ||||
| static int tcp_meth_shutdown(lua_State *L); | ||||
| static int tcp_meth_receive(lua_State *L); | ||||
| static int tcp_meth_accept(lua_State *L); | ||||
| static int tcp_meth_close(lua_State *L); | ||||
| static int tcp_meth_getoption(lua_State *L); | ||||
| static int tcp_meth_setoption(lua_State *L); | ||||
| static int tcp_meth_settimeout(lua_State *L); | ||||
| static int tcp_meth_getfd(lua_State *L); | ||||
| static int tcp_meth_setfd(lua_State *L); | ||||
| static int tcp_meth_dirty(lua_State *L); | ||||
|  | ||||
| /* tcp object methods */ | ||||
| static luaL_Reg tcp_methods[] = { | ||||
|     {"__gc",        tcp_meth_close}, | ||||
|     {"__tostring",  auxiliar_tostring}, | ||||
|     {"accept",      tcp_meth_accept}, | ||||
|     {"bind",        tcp_meth_bind}, | ||||
|     {"close",       tcp_meth_close}, | ||||
|     {"connect",     tcp_meth_connect}, | ||||
|     {"dirty",       tcp_meth_dirty}, | ||||
|     {"getfamily",   tcp_meth_getfamily}, | ||||
|     {"getfd",       tcp_meth_getfd}, | ||||
|     {"getoption",   tcp_meth_getoption}, | ||||
|     {"getpeername", tcp_meth_getpeername}, | ||||
|     {"getsockname", tcp_meth_getsockname}, | ||||
|     {"getstats",    tcp_meth_getstats}, | ||||
|     {"setstats",    tcp_meth_setstats}, | ||||
|     {"listen",      tcp_meth_listen}, | ||||
|     {"receive",     tcp_meth_receive}, | ||||
|     {"send",        tcp_meth_send}, | ||||
|     {"setfd",       tcp_meth_setfd}, | ||||
|     {"setoption",   tcp_meth_setoption}, | ||||
|     {"setpeername", tcp_meth_connect}, | ||||
|     {"setsockname", tcp_meth_bind}, | ||||
|     {"settimeout",  tcp_meth_settimeout}, | ||||
|     {"shutdown",    tcp_meth_shutdown}, | ||||
|     {NULL,          NULL} | ||||
| }; | ||||
|  | ||||
| /* socket option handlers */ | ||||
| static t_opt tcp_optget[] = { | ||||
|     {"keepalive",   opt_get_keepalive}, | ||||
|     {"reuseaddr",   opt_get_reuseaddr}, | ||||
|     {"tcp-nodelay", opt_get_tcp_nodelay}, | ||||
|     {"linger",      opt_get_linger}, | ||||
|     {"error",       opt_get_error}, | ||||
|     {NULL,          NULL} | ||||
| }; | ||||
|  | ||||
| static t_opt tcp_optset[] = { | ||||
|     {"keepalive",   opt_set_keepalive}, | ||||
|     {"reuseaddr",   opt_set_reuseaddr}, | ||||
|     {"tcp-nodelay", opt_set_tcp_nodelay}, | ||||
|     {"ipv6-v6only", opt_set_ip6_v6only}, | ||||
|     {"linger",      opt_set_linger}, | ||||
|     {NULL,          NULL} | ||||
| }; | ||||
|  | ||||
| /* functions in library namespace */ | ||||
| static luaL_Reg tcp_func[] = { | ||||
|     {"tcp", tcp_global_create}, | ||||
|     {"tcp6", tcp_global_create6}, | ||||
|     {"connect", tcp_global_connect}, | ||||
|     {NULL, NULL} | ||||
| }; | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Initializes module | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int tcp_open(lua_State *L) | ||||
| { | ||||
|     /* create classes */ | ||||
|     auxiliar_newclass(L, "tcp{master}", tcp_methods); | ||||
|     auxiliar_newclass(L, "tcp{client}", tcp_methods); | ||||
|     auxiliar_newclass(L, "tcp{server}", tcp_methods); | ||||
|     /* create class groups */ | ||||
|     auxiliar_add2group(L, "tcp{master}", "tcp{any}"); | ||||
|     auxiliar_add2group(L, "tcp{client}", "tcp{any}"); | ||||
|     auxiliar_add2group(L, "tcp{server}", "tcp{any}"); | ||||
|     /* define library functions */ | ||||
| #if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE) | ||||
|     luaL_setfuncs(L, tcp_func, 0); | ||||
| #else | ||||
|     luaL_openlib(L, NULL, tcp_func, 0); | ||||
| #endif | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Lua methods | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Just call buffered IO methods | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int tcp_meth_send(lua_State *L) { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkclass(L, "tcp{client}", 1); | ||||
|     return buffer_meth_send(L, &tcp->buf); | ||||
| } | ||||
|  | ||||
| static int tcp_meth_receive(lua_State *L) { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkclass(L, "tcp{client}", 1); | ||||
|     return buffer_meth_receive(L, &tcp->buf); | ||||
| } | ||||
|  | ||||
| static int tcp_meth_getstats(lua_State *L) { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkclass(L, "tcp{client}", 1); | ||||
|     return buffer_meth_getstats(L, &tcp->buf); | ||||
| } | ||||
|  | ||||
| static int tcp_meth_setstats(lua_State *L) { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkclass(L, "tcp{client}", 1); | ||||
|     return buffer_meth_setstats(L, &tcp->buf); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Just call option handler | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int tcp_meth_getoption(lua_State *L) | ||||
| { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1); | ||||
|     return opt_meth_getoption(L, tcp_optget, &tcp->sock); | ||||
| } | ||||
|  | ||||
| static int tcp_meth_setoption(lua_State *L) | ||||
| { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1); | ||||
|     return opt_meth_setoption(L, tcp_optset, &tcp->sock); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Select support methods | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int tcp_meth_getfd(lua_State *L) | ||||
| { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1); | ||||
|     lua_pushnumber(L, (int) tcp->sock); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /* this is very dangerous, but can be handy for those that are brave enough */ | ||||
| static int tcp_meth_setfd(lua_State *L) | ||||
| { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1); | ||||
|     tcp->sock = (t_socket) luaL_checknumber(L, 2); | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| static int tcp_meth_dirty(lua_State *L) | ||||
| { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1); | ||||
|     lua_pushboolean(L, !buffer_isempty(&tcp->buf)); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Waits for and returns a client object attempting connection to the | ||||
| * server object | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int tcp_meth_accept(lua_State *L) | ||||
| { | ||||
|     p_tcp server = (p_tcp) auxiliar_checkclass(L, "tcp{server}", 1); | ||||
|     p_timeout tm = timeout_markstart(&server->tm); | ||||
|     t_socket sock; | ||||
|     const char *err = inet_tryaccept(&server->sock, server->family, &sock, tm); | ||||
|     /* if successful, push client socket */ | ||||
|     if (err == NULL) { | ||||
|         p_tcp clnt = (p_tcp) lua_newuserdata(L, sizeof(t_tcp)); | ||||
|         auxiliar_setclass(L, "tcp{client}", -1); | ||||
|         /* initialize structure fields */ | ||||
|         memset(clnt, 0, sizeof(t_tcp)); | ||||
|         socket_setnonblocking(&sock); | ||||
|         clnt->sock = sock; | ||||
|         io_init(&clnt->io, (p_send) socket_send, (p_recv) socket_recv, | ||||
|                 (p_error) socket_ioerror, &clnt->sock); | ||||
|         timeout_init(&clnt->tm, -1, -1); | ||||
|         buffer_init(&clnt->buf, &clnt->io, &clnt->tm); | ||||
|         clnt->family = server->family; | ||||
|         return 1; | ||||
|     } else { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, err); | ||||
|         return 2; | ||||
|     } | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Binds an object to an address | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int tcp_meth_bind(lua_State *L) | ||||
| { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkclass(L, "tcp{master}", 1); | ||||
|     const char *address =  luaL_checkstring(L, 2); | ||||
|     const char *port = luaL_checkstring(L, 3); | ||||
|     const char *err; | ||||
|     struct addrinfo bindhints; | ||||
|     memset(&bindhints, 0, sizeof(bindhints)); | ||||
|     bindhints.ai_socktype = SOCK_STREAM; | ||||
|     bindhints.ai_family = tcp->family; | ||||
|     bindhints.ai_flags = AI_PASSIVE; | ||||
|     err = inet_trybind(&tcp->sock, address, port, &bindhints); | ||||
|     if (err) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, err); | ||||
|         return 2; | ||||
|     } | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Turns a master tcp object into a client object. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int tcp_meth_connect(lua_State *L) | ||||
| { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1); | ||||
|     const char *address =  luaL_checkstring(L, 2); | ||||
|     const char *port = luaL_checkstring(L, 3); | ||||
|     struct addrinfo connecthints; | ||||
|     const char *err; | ||||
|     memset(&connecthints, 0, sizeof(connecthints)); | ||||
|     connecthints.ai_socktype = SOCK_STREAM; | ||||
|     /* make sure we try to connect only to the same family */ | ||||
|     connecthints.ai_family = tcp->family; | ||||
|     timeout_markstart(&tcp->tm); | ||||
|     err = inet_tryconnect(&tcp->sock, &tcp->family, address, port,  | ||||
|         &tcp->tm, &connecthints); | ||||
|     /* have to set the class even if it failed due to non-blocking connects */ | ||||
|     auxiliar_setclass(L, "tcp{client}", 1); | ||||
|     if (err) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, err); | ||||
|         return 2; | ||||
|     } | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Closes socket used by object | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int tcp_meth_close(lua_State *L) | ||||
| { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1); | ||||
|     socket_destroy(&tcp->sock); | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Returns family as string | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int tcp_meth_getfamily(lua_State *L) | ||||
| { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1); | ||||
|     if (tcp->family == PF_INET6) { | ||||
|         lua_pushliteral(L, "inet6"); | ||||
|         return 1; | ||||
|     } else { | ||||
|         lua_pushliteral(L, "inet4"); | ||||
|         return 1; | ||||
|     } | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Puts the sockt in listen mode | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int tcp_meth_listen(lua_State *L) | ||||
| { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkclass(L, "tcp{master}", 1); | ||||
|     int backlog = (int) luaL_optnumber(L, 2, 32); | ||||
|     int err = socket_listen(&tcp->sock, backlog); | ||||
|     if (err != IO_DONE) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, socket_strerror(err)); | ||||
|         return 2; | ||||
|     } | ||||
|     /* turn master object into a server object */ | ||||
|     auxiliar_setclass(L, "tcp{server}", 1); | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Shuts the connection down partially | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int tcp_meth_shutdown(lua_State *L) | ||||
| { | ||||
|     /* SHUT_RD,  SHUT_WR,  SHUT_RDWR  have  the value 0, 1, 2, so we can use method index directly */ | ||||
|     static const char* methods[] = { "receive", "send", "both", NULL }; | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkclass(L, "tcp{client}", 1); | ||||
|     int how = luaL_checkoption(L, 2, "both", methods); | ||||
|     socket_shutdown(&tcp->sock, how); | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Just call inet methods | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int tcp_meth_getpeername(lua_State *L) | ||||
| { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1); | ||||
|     return inet_meth_getpeername(L, &tcp->sock, tcp->family); | ||||
| } | ||||
|  | ||||
| static int tcp_meth_getsockname(lua_State *L) | ||||
| { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1); | ||||
|     return inet_meth_getsockname(L, &tcp->sock, tcp->family); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Just call tm methods | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int tcp_meth_settimeout(lua_State *L) | ||||
| { | ||||
|     p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1); | ||||
|     return timeout_meth_settimeout(L, &tcp->tm); | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Library functions | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Creates a master tcp object | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int tcp_create(lua_State *L, int family) { | ||||
|     t_socket sock; | ||||
|     const char *err = inet_trycreate(&sock, family, SOCK_STREAM); | ||||
|     /* try to allocate a system socket */ | ||||
|     if (!err) { | ||||
|         /* allocate tcp object */ | ||||
|         p_tcp tcp = (p_tcp) lua_newuserdata(L, sizeof(t_tcp)); | ||||
|         memset(tcp, 0, sizeof(t_tcp)); | ||||
|         /* set its type as master object */ | ||||
|         auxiliar_setclass(L, "tcp{master}", -1); | ||||
|         /* initialize remaining structure fields */ | ||||
|         socket_setnonblocking(&sock); | ||||
|         if (family == PF_INET6) { | ||||
|             int yes = 1; | ||||
|             setsockopt(sock, IPPROTO_IPV6, IPV6_V6ONLY, | ||||
|                 reinterpret_cast<const char *>(&yes), sizeof(yes)); | ||||
|         } | ||||
|         tcp->sock = sock; | ||||
|         io_init(&tcp->io, (p_send) socket_send, (p_recv) socket_recv, | ||||
|                 (p_error) socket_ioerror, &tcp->sock); | ||||
|         timeout_init(&tcp->tm, -1, -1); | ||||
|         buffer_init(&tcp->buf, &tcp->io, &tcp->tm); | ||||
|         tcp->family = family; | ||||
|         return 1; | ||||
|     } else { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, err); | ||||
|         return 2; | ||||
|     } | ||||
| } | ||||
|  | ||||
| static int tcp_global_create(lua_State *L) { | ||||
|     return tcp_create(L, AF_INET); | ||||
| } | ||||
|  | ||||
| static int tcp_global_create6(lua_State *L) { | ||||
|     return tcp_create(L, AF_INET6); | ||||
| } | ||||
|  | ||||
| #if 0 | ||||
| static const char *tryconnect6(const char *remoteaddr, const char *remoteserv, | ||||
|     struct addrinfo *connecthints, p_tcp tcp) { | ||||
|     struct addrinfo *iterator = NULL, *resolved = NULL; | ||||
|     const char *err = NULL; | ||||
|     /* try resolving */ | ||||
|     err = socket_gaistrerror(getaddrinfo(remoteaddr, remoteserv, | ||||
|                 connecthints, &resolved)); | ||||
|     if (err != NULL) { | ||||
|         if (resolved) freeaddrinfo(resolved); | ||||
|         return err; | ||||
|     } | ||||
|     /* iterate over all returned addresses trying to connect */ | ||||
|     for (iterator = resolved; iterator; iterator = iterator->ai_next) { | ||||
|         p_timeout tm = timeout_markstart(&tcp->tm); | ||||
|         /* create new socket if necessary. if there was no | ||||
|          * bind, we need to create one for every new family | ||||
|          * that shows up while iterating. if there was a | ||||
|          * bind, all families will be the same and we will | ||||
|          * not enter this branch. */ | ||||
|         if (tcp->family != iterator->ai_family) { | ||||
|             socket_destroy(&tcp->sock); | ||||
|             err = socket_strerror(socket_create(&tcp->sock, | ||||
|                 iterator->ai_family, iterator->ai_socktype, | ||||
|                 iterator->ai_protocol)); | ||||
|             if (err != NULL) { | ||||
|                 freeaddrinfo(resolved); | ||||
|                 return err; | ||||
|             } | ||||
|             tcp->family = iterator->ai_family; | ||||
|             /* all sockets initially non-blocking */ | ||||
|             socket_setnonblocking(&tcp->sock); | ||||
|         } | ||||
|         /* finally try connecting to remote address */ | ||||
|         err = socket_strerror(socket_connect(&tcp->sock, | ||||
|             (SA *) iterator->ai_addr, | ||||
|             (socklen_t) iterator->ai_addrlen, tm)); | ||||
|         /* if success, break out of loop */ | ||||
|         if (err == NULL) break; | ||||
|     } | ||||
|  | ||||
|     freeaddrinfo(resolved); | ||||
|     /* here, if err is set, we failed */ | ||||
|     return err; | ||||
| } | ||||
| #endif | ||||
|  | ||||
| static int tcp_global_connect(lua_State *L) { | ||||
|     const char *remoteaddr = luaL_checkstring(L, 1); | ||||
|     const char *remoteserv = luaL_checkstring(L, 2); | ||||
|     const char *localaddr  = luaL_optstring(L, 3, NULL); | ||||
|     const char *localserv  = luaL_optstring(L, 4, "0"); | ||||
|     int family = inet_optfamily(L, 5, "unspec"); | ||||
|     p_tcp tcp = (p_tcp) lua_newuserdata(L, sizeof(t_tcp)); | ||||
|     struct addrinfo bindhints, connecthints; | ||||
|     const char *err = NULL; | ||||
|     /* initialize tcp structure */ | ||||
|     memset(tcp, 0, sizeof(t_tcp)); | ||||
|     io_init(&tcp->io, (p_send) socket_send, (p_recv) socket_recv, | ||||
|             (p_error) socket_ioerror, &tcp->sock); | ||||
|     timeout_init(&tcp->tm, -1, -1); | ||||
|     buffer_init(&tcp->buf, &tcp->io, &tcp->tm); | ||||
|     tcp->sock = SOCKET_INVALID; | ||||
|     tcp->family = PF_UNSPEC; | ||||
|     /* allow user to pick local address and port */ | ||||
|     memset(&bindhints, 0, sizeof(bindhints)); | ||||
|     bindhints.ai_socktype = SOCK_STREAM; | ||||
|     bindhints.ai_family = family; | ||||
|     bindhints.ai_flags = AI_PASSIVE; | ||||
|     if (localaddr) { | ||||
|         err = inet_trybind(&tcp->sock, localaddr, localserv, &bindhints); | ||||
|         if (err) { | ||||
|             lua_pushnil(L); | ||||
|             lua_pushstring(L, err); | ||||
|             return 2; | ||||
|         } | ||||
|         tcp->family = bindhints.ai_family; | ||||
|     } | ||||
|     /* try to connect to remote address and port */ | ||||
|     memset(&connecthints, 0, sizeof(connecthints)); | ||||
|     connecthints.ai_socktype = SOCK_STREAM; | ||||
|     /* make sure we try to connect only to the same family */ | ||||
|     connecthints.ai_family = bindhints.ai_family; | ||||
|     err = inet_tryconnect(&tcp->sock, &tcp->family, remoteaddr, remoteserv, | ||||
|          &tcp->tm, &connecthints); | ||||
|     if (err) { | ||||
|         socket_destroy(&tcp->sock); | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, err); | ||||
|         return 2; | ||||
|     } | ||||
|     auxiliar_setclass(L, "tcp{client}", -1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										39
									
								
								Plugins/slua_unreal/External/luasocket/tcp.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										39
									
								
								Plugins/slua_unreal/External/luasocket/tcp.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,39 @@ | ||||
| #ifndef TCP_H | ||||
| #define TCP_H | ||||
| /*=========================================================================*\ | ||||
| * TCP object | ||||
| * LuaSocket toolkit | ||||
| * | ||||
| * The tcp.h module is basicly a glue that puts together modules buffer.h, | ||||
| * timeout.h socket.h and inet.h to provide the LuaSocket TCP (AF_INET, | ||||
| * SOCK_STREAM) support. | ||||
| * | ||||
| * Three classes are defined: master, client and server. The master class is | ||||
| * a newly created tcp object, that has not been bound or connected. Server | ||||
| * objects are tcp objects bound to some local address. Client objects are | ||||
| * tcp objects either connected to some address or returned by the accept | ||||
| * method of a server object. | ||||
| \*=========================================================================*/ | ||||
| #include "lua.h" | ||||
|  | ||||
| #include "buffer.h" | ||||
| #include "timeout.h" | ||||
| #include "socket.h" | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| typedef struct t_tcp_ { | ||||
|     t_socket sock; | ||||
|     t_io io; | ||||
|     t_buffer buf; | ||||
|     t_timeout tm; | ||||
|     int family; | ||||
| } t_tcp; | ||||
|  | ||||
| typedef t_tcp *p_tcp; | ||||
|  | ||||
| int tcp_open(lua_State *L); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif /* TCP_H */ | ||||
							
								
								
									
										225
									
								
								Plugins/slua_unreal/External/luasocket/timeout.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										225
									
								
								Plugins/slua_unreal/External/luasocket/timeout.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,225 @@ | ||||
| /*=========================================================================*\ | ||||
| * Timeout management functions | ||||
| * LuaSocket toolkit | ||||
| \*=========================================================================*/ | ||||
| #include <stdio.h> | ||||
| #include <limits.h> | ||||
| #include <float.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
|  | ||||
| #include "auxiliar.h" | ||||
| #include "timeout.h" | ||||
|  | ||||
| #ifdef _WIN32 | ||||
| #include <windows.h> | ||||
| #else | ||||
| #include <time.h> | ||||
| #include <sys/time.h> | ||||
| #endif | ||||
|  | ||||
| /* min and max macros */ | ||||
| #ifndef MIN | ||||
| #define MIN(x, y) ((x) < (y) ? x : y) | ||||
| #endif | ||||
| #ifndef MAX | ||||
| #define MAX(x, y) ((x) > (y) ? x : y) | ||||
| #endif | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Internal function prototypes | ||||
| \*=========================================================================*/ | ||||
| static int timeout_lua_gettime(lua_State *L); | ||||
| static int timeout_lua_sleep(lua_State *L); | ||||
|  | ||||
| static luaL_Reg timeout_func[] = { | ||||
|     { "gettime", timeout_lua_gettime }, | ||||
|     { "sleep", timeout_lua_sleep }, | ||||
|     { NULL, NULL } | ||||
| }; | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Exported functions. | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Initialize structure | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| void timeout_init(p_timeout tm, double block, double total) { | ||||
|     tm->block = block; | ||||
|     tm->total = total; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Determines how much time we have left for the next system call, | ||||
| * if the previous call was successful  | ||||
| * Input | ||||
| *   tm: timeout control structure | ||||
| * Returns | ||||
| *   the number of ms left or -1 if there is no time limit | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| double timeout_get(p_timeout tm) { | ||||
|     if (tm->block < 0.0 && tm->total < 0.0) { | ||||
|         return -1; | ||||
|     } else if (tm->block < 0.0) { | ||||
|         double t = tm->total - timeout_gettime() + tm->start; | ||||
|         return MAX(t, 0.0); | ||||
|     } else if (tm->total < 0.0) { | ||||
|         return tm->block; | ||||
|     } else { | ||||
|         double t = tm->total - timeout_gettime() + tm->start; | ||||
|         return MIN(tm->block, MAX(t, 0.0)); | ||||
|     } | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Returns time since start of operation | ||||
| * Input | ||||
| *   tm: timeout control structure | ||||
| * Returns | ||||
| *   start field of structure | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| double timeout_getstart(p_timeout tm) { | ||||
|     return tm->start; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Determines how much time we have left for the next system call, | ||||
| * if the previous call was a failure | ||||
| * Input | ||||
| *   tm: timeout control structure | ||||
| * Returns | ||||
| *   the number of ms left or -1 if there is no time limit | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| double timeout_getretry(p_timeout tm) { | ||||
|     if (tm->block < 0.0 && tm->total < 0.0) { | ||||
|         return -1; | ||||
|     } else if (tm->block < 0.0) { | ||||
|         double t = tm->total - timeout_gettime() + tm->start; | ||||
|         return MAX(t, 0.0); | ||||
|     } else if (tm->total < 0.0) { | ||||
|         double t = tm->block - timeout_gettime() + tm->start; | ||||
|         return MAX(t, 0.0); | ||||
|     } else { | ||||
|         double t = tm->total - timeout_gettime() + tm->start; | ||||
|         return MIN(tm->block, MAX(t, 0.0)); | ||||
|     } | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Marks the operation start time in structure  | ||||
| * Input | ||||
| *   tm: timeout control structure | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| p_timeout timeout_markstart(p_timeout tm) { | ||||
|     tm->start = timeout_gettime(); | ||||
|     return tm; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Gets time in s, relative to January 1, 1970 (UTC)  | ||||
| * Returns | ||||
| *   time in s. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| #ifdef _WIN32 | ||||
| double timeout_gettime(void) { | ||||
|     FILETIME ft; | ||||
|     double t; | ||||
|     GetSystemTimeAsFileTime(&ft); | ||||
|     /* Windows file time (time since January 1, 1601 (UTC)) */ | ||||
|     t  = ft.dwLowDateTime/1.0e7 + ft.dwHighDateTime*(4294967296.0/1.0e7); | ||||
|     /* convert to Unix Epoch time (time since January 1, 1970 (UTC)) */ | ||||
|     return (t - 11644473600.0); | ||||
| } | ||||
| #else | ||||
| double timeout_gettime(void) { | ||||
|     struct timeval v; | ||||
|     gettimeofday(&v, (struct timezone *) NULL); | ||||
|     /* Unix Epoch time (time since January 1, 1970 (UTC)) */ | ||||
|     return v.tv_sec + v.tv_usec/1.0e6; | ||||
| } | ||||
| #endif | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Initializes module | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int timeout_open(lua_State *L) { | ||||
| #if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE) | ||||
|     luaL_setfuncs(L, timeout_func, 0); | ||||
| #else | ||||
|     luaL_openlib(L, NULL, timeout_func, 0); | ||||
| #endif | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Sets timeout values for IO operations | ||||
| * Lua Input: base, time [, mode] | ||||
| *   time: time out value in seconds | ||||
| *   mode: "b" for block timeout, "t" for total timeout. (default: b) | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int timeout_meth_settimeout(lua_State *L, p_timeout tm) { | ||||
|     double t = luaL_optnumber(L, 2, -1); | ||||
|     const char *mode = luaL_optstring(L, 3, "b"); | ||||
|     switch (*mode) { | ||||
|         case 'b': | ||||
|             tm->block = t;  | ||||
|             break; | ||||
|         case 'r': case 't': | ||||
|             tm->total = t; | ||||
|             break; | ||||
|         default: | ||||
|             luaL_argcheck(L, 0, 3, "invalid timeout mode"); | ||||
|             break; | ||||
|     } | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Test support functions | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Returns the time the system has been up, in secconds. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int timeout_lua_gettime(lua_State *L) | ||||
| { | ||||
|     lua_pushnumber(L, timeout_gettime()); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Sleep for n seconds. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| #ifdef _WIN32 | ||||
| int timeout_lua_sleep(lua_State *L) | ||||
| { | ||||
|     double n = luaL_checknumber(L, 1); | ||||
|     if (n < 0.0) n = 0.0; | ||||
|     if (n < DBL_MAX/1000.0) n *= 1000.0; | ||||
|     if (n > INT_MAX) n = INT_MAX; | ||||
|     Sleep((int)n); | ||||
|     return 0; | ||||
| } | ||||
| #else | ||||
| int timeout_lua_sleep(lua_State *L) | ||||
| { | ||||
|     double n = luaL_checknumber(L, 1); | ||||
|     struct timespec t, r; | ||||
|     if (n < 0.0) n = 0.0; | ||||
|     if (n > INT_MAX) n = INT_MAX; | ||||
|     t.tv_sec = (int) n; | ||||
|     n -= t.tv_sec; | ||||
|     t.tv_nsec = (int) (n * 1000000000); | ||||
|     if (t.tv_nsec >= 1000000000) t.tv_nsec = 999999999; | ||||
|     while (nanosleep(&t, &r) != 0) { | ||||
|         t.tv_sec = r.tv_sec; | ||||
|         t.tv_nsec = r.tv_nsec; | ||||
|     } | ||||
|     return 0; | ||||
| } | ||||
| #endif | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										32
									
								
								Plugins/slua_unreal/External/luasocket/timeout.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										32
									
								
								Plugins/slua_unreal/External/luasocket/timeout.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,32 @@ | ||||
| #ifndef TIMEOUT_H | ||||
| #define TIMEOUT_H | ||||
| /*=========================================================================*\ | ||||
| * Timeout management functions | ||||
| * LuaSocket toolkit | ||||
| \*=========================================================================*/ | ||||
| #include "lua.h" | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| /* timeout control structure */ | ||||
| typedef struct t_timeout_ { | ||||
|     double block;          /* maximum time for blocking calls */ | ||||
|     double total;          /* total number of miliseconds for operation */ | ||||
|     double start;          /* time of start of operation */ | ||||
| } t_timeout; | ||||
| typedef t_timeout *p_timeout; | ||||
|  | ||||
| int timeout_open(lua_State *L); | ||||
| void timeout_init(p_timeout tm, double block, double total); | ||||
| double timeout_get(p_timeout tm); | ||||
| double timeout_getretry(p_timeout tm); | ||||
| p_timeout timeout_markstart(p_timeout tm); | ||||
| double timeout_getstart(p_timeout tm); | ||||
| double timeout_gettime(void); | ||||
| int timeout_meth_settimeout(lua_State *L, p_timeout tm); | ||||
|  | ||||
| #define timeout_iszero(tm)   ((tm)->block == 0.0) | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif /* TIMEOUT_H */ | ||||
							
								
								
									
										128
									
								
								Plugins/slua_unreal/External/luasocket/tp.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										128
									
								
								Plugins/slua_unreal/External/luasocket/tp.lua.inc
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,128 @@ | ||||
| R"-++**++-( | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Unified SMTP/FTP subsystem | ||||
| -- LuaSocket toolkit. | ||||
| -- Author: Diego Nehab | ||||
| ----------------------------------------------------------------------------- | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Declare module and import dependencies | ||||
| ----------------------------------------------------------------------------- | ||||
| local base = _G | ||||
| local string = require("string") | ||||
| local socket = require("socket") | ||||
| local ltn12 = require("ltn12") | ||||
|  | ||||
| socket.tp = {} | ||||
| local _M = socket.tp | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Program constants | ||||
| ----------------------------------------------------------------------------- | ||||
| _M.TIMEOUT = 60 | ||||
|  | ||||
| ----------------------------------------------------------------------------- | ||||
| -- Implementation | ||||
| ----------------------------------------------------------------------------- | ||||
| -- gets server reply (works for SMTP and FTP) | ||||
| local function get_reply(c) | ||||
|     local code, current, sep | ||||
|     local line, err = c:receive() | ||||
|     local reply = line | ||||
|     if err then return nil, err end | ||||
|     code, sep = socket.skip(2, string.find(line, "^(%d%d%d)(.?)")) | ||||
|     if not code then return nil, "invalid server reply" end | ||||
|     if sep == "-" then -- reply is multiline | ||||
|         repeat | ||||
|             line, err = c:receive() | ||||
|             if err then return nil, err end | ||||
|             current, sep = socket.skip(2, string.find(line, "^(%d%d%d)(.?)")) | ||||
|             reply = reply .. "\n" .. line | ||||
|         -- reply ends with same code | ||||
|         until code == current and sep == " " | ||||
|     end | ||||
|     return code, reply | ||||
| end | ||||
|  | ||||
| -- metatable for sock object | ||||
| local metat = { __index = {} } | ||||
|  | ||||
| function metat.__index:check(ok) | ||||
|     local code, reply = get_reply(self.c) | ||||
|     if not code then return nil, reply end | ||||
|     if base.type(ok) ~= "function" then | ||||
|         if base.type(ok) == "table" then | ||||
|             for i, v in base.ipairs(ok) do | ||||
|                 if string.find(code, v) then | ||||
|                     return base.tonumber(code), reply | ||||
|                 end | ||||
|             end | ||||
|             return nil, reply | ||||
|         else | ||||
|             if string.find(code, ok) then return base.tonumber(code), reply | ||||
|             else return nil, reply end | ||||
|         end | ||||
|     else return ok(base.tonumber(code), reply) end | ||||
| end | ||||
|  | ||||
| function metat.__index:command(cmd, arg) | ||||
|     cmd = string.upper(cmd) | ||||
|     if arg then | ||||
|         return self.c:send(cmd .. " " .. arg.. "\r\n") | ||||
|     else | ||||
|         return self.c:send(cmd .. "\r\n") | ||||
|     end | ||||
| end | ||||
|  | ||||
| function metat.__index:sink(snk, pat) | ||||
|     local chunk, err = c:receive(pat) | ||||
|     return snk(chunk, err) | ||||
| end | ||||
|  | ||||
| function metat.__index:send(data) | ||||
|     return self.c:send(data) | ||||
| end | ||||
|  | ||||
| function metat.__index:receive(pat) | ||||
|     return self.c:receive(pat) | ||||
| end | ||||
|  | ||||
| function metat.__index:getfd() | ||||
|     return self.c:getfd() | ||||
| end | ||||
|  | ||||
| function metat.__index:dirty() | ||||
|     return self.c:dirty() | ||||
| end | ||||
|  | ||||
| function metat.__index:getcontrol() | ||||
|     return self.c | ||||
| end | ||||
|  | ||||
| function metat.__index:source(source, step) | ||||
|     local sink = socket.sink("keep-open", self.c) | ||||
|     local ret, err = ltn12.pump.all(source, sink, step or ltn12.pump.step) | ||||
|     return ret, err | ||||
| end | ||||
|  | ||||
| -- closes the underlying c | ||||
| function metat.__index:close() | ||||
|     self.c:close() | ||||
|     return 1 | ||||
| end | ||||
|  | ||||
| -- connect with server and return c object | ||||
| function _M.connect(host, port, timeout, create) | ||||
|     local c, e = (create or socket.tcp)() | ||||
|     if not c then return nil, e end | ||||
|     c:settimeout(timeout or _M.TIMEOUT) | ||||
|     local r, e = c:connect(host, port) | ||||
|     if not r then | ||||
|         c:close() | ||||
|         return nil, e | ||||
|     end | ||||
|     return base.setmetatable({c = c}, metat) | ||||
| end | ||||
|  | ||||
| return _M | ||||
| )-++**++-"; | ||||
							
								
								
									
										449
									
								
								Plugins/slua_unreal/External/luasocket/udp.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										449
									
								
								Plugins/slua_unreal/External/luasocket/udp.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,449 @@ | ||||
| /*=========================================================================*\ | ||||
| * UDP object | ||||
| * LuaSocket toolkit | ||||
| \*=========================================================================*/ | ||||
| #include <string.h> | ||||
| #include <stdlib.h> | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
|  | ||||
| #include "auxiliar.h" | ||||
| #include "socket.h" | ||||
| #include "inet.h" | ||||
| #include "options.h" | ||||
| #include "udp.h" | ||||
|  | ||||
| /* min and max macros */ | ||||
| #ifndef MIN | ||||
| #define MIN(x, y) ((x) < (y) ? x : y) | ||||
| #endif | ||||
| #ifndef MAX | ||||
| #define MAX(x, y) ((x) > (y) ? x : y) | ||||
| #endif | ||||
|  | ||||
| #ifdef _WIN32 | ||||
| #define gai_strerror gai_strerrorA | ||||
| #endif | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Internal function prototypes | ||||
| \*=========================================================================*/ | ||||
| static int udp_global_create(lua_State *L); | ||||
| static int udp_global_create6(lua_State *L); | ||||
| static int udp_meth_send(lua_State *L); | ||||
| static int udp_meth_sendto(lua_State *L); | ||||
| static int udp_meth_receive(lua_State *L); | ||||
| static int udp_meth_receivefrom(lua_State *L); | ||||
| static int udp_meth_getfamily(lua_State *L); | ||||
| static int udp_meth_getsockname(lua_State *L); | ||||
| static int udp_meth_getpeername(lua_State *L); | ||||
| static int udp_meth_setsockname(lua_State *L); | ||||
| static int udp_meth_setpeername(lua_State *L); | ||||
| static int udp_meth_close(lua_State *L); | ||||
| static int udp_meth_setoption(lua_State *L); | ||||
| static int udp_meth_getoption(lua_State *L); | ||||
| static int udp_meth_settimeout(lua_State *L); | ||||
| static int udp_meth_getfd(lua_State *L); | ||||
| static int udp_meth_setfd(lua_State *L); | ||||
| static int udp_meth_dirty(lua_State *L); | ||||
|  | ||||
| /* udp object methods */ | ||||
| static luaL_Reg udp_methods[] = { | ||||
|     {"__gc",        udp_meth_close}, | ||||
|     {"__tostring",  auxiliar_tostring}, | ||||
|     {"close",       udp_meth_close}, | ||||
|     {"dirty",       udp_meth_dirty}, | ||||
|     {"getfamily",   udp_meth_getfamily}, | ||||
|     {"getfd",       udp_meth_getfd}, | ||||
|     {"getpeername", udp_meth_getpeername}, | ||||
|     {"getsockname", udp_meth_getsockname}, | ||||
|     {"receive",     udp_meth_receive}, | ||||
|     {"receivefrom", udp_meth_receivefrom}, | ||||
|     {"send",        udp_meth_send}, | ||||
|     {"sendto",      udp_meth_sendto}, | ||||
|     {"setfd",       udp_meth_setfd}, | ||||
|     {"setoption",   udp_meth_setoption}, | ||||
|     {"getoption",   udp_meth_getoption}, | ||||
|     {"setpeername", udp_meth_setpeername}, | ||||
|     {"setsockname", udp_meth_setsockname}, | ||||
|     {"settimeout",  udp_meth_settimeout}, | ||||
|     {NULL,          NULL} | ||||
| }; | ||||
|  | ||||
| /* socket options for setoption */ | ||||
| static t_opt udp_optset[] = { | ||||
|     {"dontroute",            opt_set_dontroute}, | ||||
|     {"broadcast",            opt_set_broadcast}, | ||||
|     {"reuseaddr",            opt_set_reuseaddr}, | ||||
|     {"reuseport",            opt_set_reuseport}, | ||||
|     {"ip-multicast-if",      opt_set_ip_multicast_if}, | ||||
|     {"ip-multicast-ttl",     opt_set_ip_multicast_ttl}, | ||||
|     {"ip-multicast-loop",    opt_set_ip_multicast_loop}, | ||||
|     {"ip-add-membership",    opt_set_ip_add_membership}, | ||||
|     {"ip-drop-membership",   opt_set_ip_drop_membersip}, | ||||
|     {"ipv6-unicast-hops",    opt_set_ip6_unicast_hops}, | ||||
|     {"ipv6-multicast-hops",  opt_set_ip6_unicast_hops}, | ||||
|     {"ipv6-multicast-loop",  opt_set_ip6_multicast_loop}, | ||||
|     {"ipv6-add-membership",  opt_set_ip6_add_membership}, | ||||
|     {"ipv6-drop-membership", opt_set_ip6_drop_membersip}, | ||||
|     {"ipv6-v6only",          opt_set_ip6_v6only}, | ||||
|     {NULL,                   NULL} | ||||
| }; | ||||
|  | ||||
| /* socket options for getoption */ | ||||
| static t_opt udp_optget[] = { | ||||
|     {"ip-multicast-if",      opt_get_ip_multicast_if}, | ||||
|     {"ip-multicast-loop",    opt_get_ip_multicast_loop}, | ||||
|     {"error",                opt_get_error}, | ||||
|     {"ipv6-unicast-hops",    opt_get_ip6_unicast_hops}, | ||||
|     {"ipv6-multicast-hops",  opt_get_ip6_unicast_hops}, | ||||
|     {"ipv6-multicast-loop",  opt_get_ip6_multicast_loop}, | ||||
|     {"ipv6-v6only",          opt_get_ip6_v6only}, | ||||
|     {NULL,                   NULL} | ||||
| }; | ||||
|  | ||||
| /* functions in library namespace */ | ||||
| static luaL_Reg udp_func[] = { | ||||
|     {"udp", udp_global_create}, | ||||
|     {"udp6", udp_global_create6}, | ||||
|     {NULL, NULL} | ||||
| }; | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Initializes module | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int udp_open(lua_State *L) | ||||
| { | ||||
|     /* create classes */ | ||||
|     auxiliar_newclass(L, "udp{connected}", udp_methods); | ||||
|     auxiliar_newclass(L, "udp{unconnected}", udp_methods); | ||||
|     /* create class groups */ | ||||
|     auxiliar_add2group(L, "udp{connected}",   "udp{any}"); | ||||
|     auxiliar_add2group(L, "udp{unconnected}", "udp{any}"); | ||||
|     auxiliar_add2group(L, "udp{connected}",   "select{able}"); | ||||
|     auxiliar_add2group(L, "udp{unconnected}", "select{able}"); | ||||
|     /* define library functions */ | ||||
| #if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE) | ||||
|     luaL_setfuncs(L, udp_func, 0); | ||||
| #else | ||||
|     luaL_openlib(L, NULL, udp_func, 0); | ||||
| #endif | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Lua methods | ||||
| \*=========================================================================*/ | ||||
| const char *udp_strerror(int err) { | ||||
|     /* a 'closed' error on an unconnected means the target address was not | ||||
|      * accepted by the transport layer */ | ||||
|     if (err == IO_CLOSED) return "refused"; | ||||
|     else return socket_strerror(err); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Send data through connected udp socket | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int udp_meth_send(lua_State *L) { | ||||
|     p_udp udp = (p_udp) auxiliar_checkclass(L, "udp{connected}", 1); | ||||
|     p_timeout tm = &udp->tm; | ||||
|     size_t count, sent = 0; | ||||
|     int err; | ||||
|     const char *data = luaL_checklstring(L, 2, &count); | ||||
|     timeout_markstart(tm); | ||||
|     err = socket_send(&udp->sock, data, count, &sent, tm); | ||||
|     if (err != IO_DONE) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, udp_strerror(err)); | ||||
|         return 2; | ||||
|     } | ||||
|     lua_pushnumber(L, (lua_Number) sent); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Send data through unconnected udp socket | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int udp_meth_sendto(lua_State *L) { | ||||
|     p_udp udp = (p_udp) auxiliar_checkclass(L, "udp{unconnected}", 1); | ||||
|     size_t count, sent = 0; | ||||
|     const char *data = luaL_checklstring(L, 2, &count); | ||||
|     const char *ip = luaL_checkstring(L, 3); | ||||
|     const char *port = luaL_checkstring(L, 4); | ||||
|     p_timeout tm = &udp->tm; | ||||
|     int err; | ||||
|     struct addrinfo aihint; | ||||
|     struct addrinfo *ai; | ||||
|     memset(&aihint, 0, sizeof(aihint)); | ||||
|     aihint.ai_family = udp->family; | ||||
|     aihint.ai_socktype = SOCK_DGRAM; | ||||
|     aihint.ai_flags = AI_NUMERICHOST | AI_NUMERICSERV; | ||||
|     err = getaddrinfo(ip, port, &aihint, &ai); | ||||
| 	if (err) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, gai_strerror(err)); | ||||
|         return 2; | ||||
|     } | ||||
|     timeout_markstart(tm); | ||||
|     err = socket_sendto(&udp->sock, data, count, &sent, ai->ai_addr,  | ||||
|         (socklen_t) ai->ai_addrlen, tm); | ||||
|     freeaddrinfo(ai); | ||||
|     if (err != IO_DONE) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, udp_strerror(err)); | ||||
|         return 2; | ||||
|     } | ||||
|     lua_pushnumber(L, (lua_Number) sent); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Receives data from a UDP socket | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int udp_meth_receive(lua_State *L) { | ||||
|     p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1); | ||||
|     char buffer[UDP_DATAGRAMSIZE]; | ||||
|     size_t got, count = (size_t) luaL_optnumber(L, 2, sizeof(buffer)); | ||||
|     int err; | ||||
|     p_timeout tm = &udp->tm; | ||||
|     count = MIN(count, sizeof(buffer)); | ||||
|     timeout_markstart(tm); | ||||
|     err = socket_recv(&udp->sock, buffer, count, &got, tm); | ||||
|     /* Unlike TCP, recv() of zero is not closed, but a zero-length packet. */ | ||||
|     if (err == IO_CLOSED) | ||||
|         err = IO_DONE; | ||||
|     if (err != IO_DONE) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, udp_strerror(err)); | ||||
|         return 2; | ||||
|     } | ||||
|     lua_pushlstring(L, buffer, got); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Receives data and sender from a UDP socket | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int udp_meth_receivefrom(lua_State *L) | ||||
| { | ||||
|     p_udp udp = (p_udp) auxiliar_checkclass(L, "udp{unconnected}", 1); | ||||
|     char buffer[UDP_DATAGRAMSIZE]; | ||||
|     size_t got, count = (size_t) luaL_optnumber(L, 2, sizeof(buffer)); | ||||
|     int err; | ||||
|     p_timeout tm = &udp->tm; | ||||
|     struct sockaddr_storage addr; | ||||
|     socklen_t addr_len = sizeof(addr); | ||||
|     char addrstr[INET6_ADDRSTRLEN]; | ||||
|     char portstr[6]; | ||||
|     timeout_markstart(tm); | ||||
|     count = MIN(count, sizeof(buffer)); | ||||
|     err = socket_recvfrom(&udp->sock, buffer, count, &got, (SA *) &addr,  | ||||
|             &addr_len, tm); | ||||
|     /* Unlike TCP, recv() of zero is not closed, but a zero-length packet. */ | ||||
|     if (err == IO_CLOSED) | ||||
|         err = IO_DONE; | ||||
|     if (err != IO_DONE) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, udp_strerror(err)); | ||||
|         return 2; | ||||
|     } | ||||
|     err = getnameinfo((struct sockaddr *)&addr, addr_len, addrstr,  | ||||
|         INET6_ADDRSTRLEN, portstr, 6, NI_NUMERICHOST | NI_NUMERICSERV); | ||||
| 	if (err) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, gai_strerror(err)); | ||||
|         return 2; | ||||
|     } | ||||
|     lua_pushlstring(L, buffer, got); | ||||
|     lua_pushstring(L, addrstr); | ||||
|     lua_pushinteger(L, (int) strtol(portstr, (char **) NULL, 10)); | ||||
|     return 3; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Returns family as string | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int udp_meth_getfamily(lua_State *L) | ||||
| { | ||||
|     p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1); | ||||
|     if (udp->family == PF_INET6) { | ||||
|         lua_pushliteral(L, "inet6"); | ||||
|         return 1; | ||||
|     } else { | ||||
|         lua_pushliteral(L, "inet4"); | ||||
|         return 1; | ||||
|     } | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Select support methods | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int udp_meth_getfd(lua_State *L) { | ||||
|     p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1); | ||||
|     lua_pushnumber(L, (int) udp->sock); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /* this is very dangerous, but can be handy for those that are brave enough */ | ||||
| static int udp_meth_setfd(lua_State *L) { | ||||
|     p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1); | ||||
|     udp->sock = (t_socket) luaL_checknumber(L, 2); | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| static int udp_meth_dirty(lua_State *L) { | ||||
|     p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1); | ||||
|     (void) udp; | ||||
|     lua_pushboolean(L, 0); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Just call inet methods | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int udp_meth_getpeername(lua_State *L) { | ||||
|     p_udp udp = (p_udp) auxiliar_checkclass(L, "udp{connected}", 1); | ||||
|     return inet_meth_getpeername(L, &udp->sock, udp->family); | ||||
| } | ||||
|  | ||||
| static int udp_meth_getsockname(lua_State *L) { | ||||
|     p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1); | ||||
|     return inet_meth_getsockname(L, &udp->sock, udp->family); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Just call option handler | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int udp_meth_setoption(lua_State *L) { | ||||
|     p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1); | ||||
|     return opt_meth_setoption(L, udp_optset, &udp->sock); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Just call option handler | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int udp_meth_getoption(lua_State *L) { | ||||
|     p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1); | ||||
|     return opt_meth_getoption(L, udp_optget, &udp->sock); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Just call tm methods | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int udp_meth_settimeout(lua_State *L) { | ||||
|     p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1); | ||||
|     return timeout_meth_settimeout(L, &udp->tm); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Turns a master udp object into a client object. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int udp_meth_setpeername(lua_State *L) { | ||||
|     p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1); | ||||
|     p_timeout tm = &udp->tm; | ||||
|     const char *address = luaL_checkstring(L, 2); | ||||
|     int connecting = strcmp(address, "*"); | ||||
|     const char *port = connecting? luaL_checkstring(L, 3): "0"; | ||||
|     struct addrinfo connecthints; | ||||
|     const char *err; | ||||
|     memset(&connecthints, 0, sizeof(connecthints)); | ||||
|     connecthints.ai_socktype = SOCK_DGRAM; | ||||
|     /* make sure we try to connect only to the same family */ | ||||
|     connecthints.ai_family = udp->family; | ||||
|     if (connecting) { | ||||
|         err = inet_tryconnect(&udp->sock, &udp->family, address,  | ||||
|             port, tm, &connecthints); | ||||
|         if (err) { | ||||
|             lua_pushnil(L); | ||||
|             lua_pushstring(L, err); | ||||
|             return 2; | ||||
|         } | ||||
|         auxiliar_setclass(L, "udp{connected}", 1); | ||||
|     } else { | ||||
|         /* we ignore possible errors because Mac OS X always | ||||
|          * returns EAFNOSUPPORT */ | ||||
|         inet_trydisconnect(&udp->sock, udp->family, tm); | ||||
|         auxiliar_setclass(L, "udp{unconnected}", 1); | ||||
|     } | ||||
|     /* change class to connected or unconnected depending on address */ | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Closes socket used by object | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int udp_meth_close(lua_State *L) { | ||||
|     p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1); | ||||
|     socket_destroy(&udp->sock); | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Turns a master object into a server object | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int udp_meth_setsockname(lua_State *L) { | ||||
|     p_udp udp = (p_udp) auxiliar_checkclass(L, "udp{unconnected}", 1); | ||||
|     const char *address =  luaL_checkstring(L, 2); | ||||
|     const char *port = luaL_checkstring(L, 3); | ||||
|     const char *err; | ||||
|     struct addrinfo bindhints; | ||||
|     memset(&bindhints, 0, sizeof(bindhints)); | ||||
|     bindhints.ai_socktype = SOCK_DGRAM; | ||||
|     bindhints.ai_family = udp->family; | ||||
|     bindhints.ai_flags = AI_PASSIVE; | ||||
|     err = inet_trybind(&udp->sock, address, port, &bindhints); | ||||
|     if (err) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, err); | ||||
|         return 2; | ||||
|     } | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Library functions | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Creates a master udp object | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int udp_create(lua_State *L, int family) { | ||||
|     t_socket sock; | ||||
|     const char *err = inet_trycreate(&sock, family, SOCK_DGRAM); | ||||
|     /* try to allocate a system socket */ | ||||
|     if (!err) { | ||||
|         /* allocate udp object */ | ||||
|         p_udp udp = (p_udp) lua_newuserdata(L, sizeof(t_udp)); | ||||
|         auxiliar_setclass(L, "udp{unconnected}", -1); | ||||
|         /* initialize remaining structure fields */ | ||||
|         socket_setnonblocking(&sock); | ||||
|         if (family == PF_INET6) { | ||||
|             int yes = 1; | ||||
|             setsockopt(sock, IPPROTO_IPV6, IPV6_V6ONLY, | ||||
|                 reinterpret_cast<const char*>(&yes), sizeof(yes)); | ||||
|         } | ||||
|         udp->sock = sock; | ||||
|         timeout_init(&udp->tm, -1, -1); | ||||
|         udp->family = family; | ||||
|         return 1; | ||||
|     } else { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, err); | ||||
|         return 2; | ||||
|     } | ||||
| } | ||||
|  | ||||
| static int udp_global_create(lua_State *L) { | ||||
|     return udp_create(L, AF_INET); | ||||
| } | ||||
|  | ||||
| static int udp_global_create6(lua_State *L) { | ||||
|     return udp_create(L, AF_INET6); | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										36
									
								
								Plugins/slua_unreal/External/luasocket/udp.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										36
									
								
								Plugins/slua_unreal/External/luasocket/udp.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,36 @@ | ||||
| #ifndef UDP_H | ||||
| #define UDP_H | ||||
| /*=========================================================================*\ | ||||
| * UDP object | ||||
| * LuaSocket toolkit | ||||
| * | ||||
| * The udp.h module provides LuaSocket with support for UDP protocol | ||||
| * (AF_INET, SOCK_DGRAM). | ||||
| * | ||||
| * Two classes are defined: connected and unconnected. UDP objects are | ||||
| * originally unconnected. They can be "connected" to a given address  | ||||
| * with a call to the setpeername function. The same function can be used to | ||||
| * break the connection. | ||||
| \*=========================================================================*/ | ||||
| #include "lua.h" | ||||
|  | ||||
| #include "timeout.h" | ||||
| #include "socket.h" | ||||
|  | ||||
| /* can't be larger than wsocket.c MAXCHUNK!!! */ | ||||
| #define UDP_DATAGRAMSIZE 8192 | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| typedef struct t_udp_ { | ||||
|     t_socket sock; | ||||
|     t_timeout tm; | ||||
|     int family; | ||||
| } t_udp; | ||||
| typedef t_udp *p_udp; | ||||
|  | ||||
| int udp_open(lua_State *L); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif /* UDP_H */ | ||||
							
								
								
									
										363
									
								
								Plugins/slua_unreal/External/luasocket/unix.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										363
									
								
								Plugins/slua_unreal/External/luasocket/unix.cpp
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,363 @@ | ||||
| /*=========================================================================*\ | ||||
| * Unix domain socket  | ||||
| * LuaSocket toolkit | ||||
| \*=========================================================================*/ | ||||
|  | ||||
|  | ||||
| #include <string.h>  | ||||
|  | ||||
| #include "lua.h" | ||||
| #include "lauxlib.h" | ||||
|  | ||||
| #include "auxiliar.h" | ||||
| #include "socket.h" | ||||
| #include "options.h" | ||||
| #include "unix.h" | ||||
|  | ||||
| #ifndef _WIN32 | ||||
| #include <sys/un.h>  | ||||
| #endif // _WIN32 | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Internal function prototypes | ||||
| \*=========================================================================*/ | ||||
| static int unix_global_create(lua_State *L); | ||||
| static int unix_meth_connect(lua_State *L); | ||||
| static int unix_meth_listen(lua_State *L); | ||||
| static int unix_meth_bind(lua_State *L); | ||||
| static int unix_meth_send(lua_State *L); | ||||
| static int unix_meth_shutdown(lua_State *L); | ||||
| static int unix_meth_receive(lua_State *L); | ||||
| static int unix_meth_accept(lua_State *L); | ||||
| static int unix_meth_close(lua_State *L); | ||||
| static int unix_meth_setoption(lua_State *L); | ||||
| static int unix_meth_settimeout(lua_State *L); | ||||
| static int unix_meth_getfd(lua_State *L); | ||||
| static int unix_meth_setfd(lua_State *L); | ||||
| static int unix_meth_dirty(lua_State *L); | ||||
| static int unix_meth_getstats(lua_State *L); | ||||
| static int unix_meth_setstats(lua_State *L); | ||||
|  | ||||
| static const char *unix_tryconnect(p_unix un, const char *path); | ||||
| static const char *unix_trybind(p_unix un, const char *path); | ||||
|  | ||||
| /* unix object methods */ | ||||
| static luaL_Reg unix_methods[] = { | ||||
|     {"__gc",        unix_meth_close}, | ||||
|     {"__tostring",  auxiliar_tostring}, | ||||
|     {"accept",      unix_meth_accept}, | ||||
|     {"bind",        unix_meth_bind}, | ||||
|     {"close",       unix_meth_close}, | ||||
|     {"connect",     unix_meth_connect}, | ||||
|     {"dirty",       unix_meth_dirty}, | ||||
|     {"getfd",       unix_meth_getfd}, | ||||
|     {"getstats",    unix_meth_getstats}, | ||||
|     {"setstats",    unix_meth_setstats}, | ||||
|     {"listen",      unix_meth_listen}, | ||||
|     {"receive",     unix_meth_receive}, | ||||
|     {"send",        unix_meth_send}, | ||||
|     {"setfd",       unix_meth_setfd}, | ||||
|     {"setoption",   unix_meth_setoption}, | ||||
|     {"setpeername", unix_meth_connect}, | ||||
|     {"setsockname", unix_meth_bind}, | ||||
|     {"settimeout",  unix_meth_settimeout}, | ||||
|     {"shutdown",    unix_meth_shutdown}, | ||||
|     {NULL,          NULL} | ||||
| }; | ||||
|  | ||||
| /* socket option handlers */ | ||||
| static t_opt unix_optset[] = { | ||||
|     {"keepalive",   opt_set_keepalive}, | ||||
|     {"reuseaddr",   opt_set_reuseaddr}, | ||||
|     {"linger",      opt_set_linger}, | ||||
|     {NULL,          NULL} | ||||
| }; | ||||
|  | ||||
| /* our socket creation function */ | ||||
| /* this is an ad-hoc module that returns a single function  | ||||
|  * as such, do not include other functions in this array. */ | ||||
| static luaL_Reg unix_func[] = { | ||||
|     {"unix", unix_global_create}, | ||||
|     {NULL,          NULL} | ||||
| }; | ||||
|  | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Initializes module | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| int luaopen_socket_unix(lua_State *L) { | ||||
|     /* create classes */ | ||||
|     auxiliar_newclass(L, "unix{master}", unix_methods); | ||||
|     auxiliar_newclass(L, "unix{client}", unix_methods); | ||||
|     auxiliar_newclass(L, "unix{server}", unix_methods); | ||||
|     /* create class groups */ | ||||
|     auxiliar_add2group(L, "unix{master}", "unix{any}"); | ||||
|     auxiliar_add2group(L, "unix{client}", "unix{any}"); | ||||
|     auxiliar_add2group(L, "unix{server}", "unix{any}"); | ||||
| #if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE) | ||||
|     lua_pushcfunction(L, unix_global_create); | ||||
|     (void)unix_func; | ||||
| #else | ||||
|     /* set function into socket namespace */ | ||||
|     luaL_openlib(L, "socket", unix_func, 0); | ||||
|     lua_pushcfunction(L, unix_global_create); | ||||
| #endif | ||||
|     /* return the function instead of the 'socket' table */ | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Lua methods | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Just call buffered IO methods | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int unix_meth_send(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkclass(L, "unix{client}", 1); | ||||
|     return buffer_meth_send(L, &un->buf); | ||||
| } | ||||
|  | ||||
| static int unix_meth_receive(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkclass(L, "unix{client}", 1); | ||||
|     return buffer_meth_receive(L, &un->buf); | ||||
| } | ||||
|  | ||||
| static int unix_meth_getstats(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkclass(L, "unix{client}", 1); | ||||
|     return buffer_meth_getstats(L, &un->buf); | ||||
| } | ||||
|  | ||||
| static int unix_meth_setstats(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkclass(L, "unix{client}", 1); | ||||
|     return buffer_meth_setstats(L, &un->buf); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Just call option handler | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int unix_meth_setoption(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkgroup(L, "unix{any}", 1); | ||||
|     return opt_meth_setoption(L, unix_optset, &un->sock); | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Select support methods | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int unix_meth_getfd(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkgroup(L, "unix{any}", 1); | ||||
|     lua_pushnumber(L, (int) un->sock); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /* this is very dangerous, but can be handy for those that are brave enough */ | ||||
| static int unix_meth_setfd(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkgroup(L, "unix{any}", 1); | ||||
|     un->sock = (t_socket) luaL_checknumber(L, 2);  | ||||
|     return 0; | ||||
| } | ||||
|  | ||||
| static int unix_meth_dirty(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkgroup(L, "unix{any}", 1); | ||||
|     lua_pushboolean(L, !buffer_isempty(&un->buf)); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Waits for and returns a client object attempting connection to the  | ||||
| * server object  | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int unix_meth_accept(lua_State *L) { | ||||
|     p_unix server = (p_unix) auxiliar_checkclass(L, "unix{server}", 1); | ||||
|     p_timeout tm = timeout_markstart(&server->tm); | ||||
|     t_socket sock; | ||||
|     int err = socket_accept(&server->sock, &sock, NULL, NULL, tm); | ||||
|     /* if successful, push client socket */ | ||||
|     if (err == IO_DONE) { | ||||
|         p_unix clnt = (p_unix) lua_newuserdata(L, sizeof(t_unix)); | ||||
|         auxiliar_setclass(L, "unix{client}", -1); | ||||
|         /* initialize structure fields */ | ||||
|         socket_setnonblocking(&sock); | ||||
|         clnt->sock = sock; | ||||
|         io_init(&clnt->io, (p_send)socket_send, (p_recv)socket_recv,  | ||||
|                 (p_error) socket_ioerror, &clnt->sock); | ||||
|         timeout_init(&clnt->tm, -1, -1); | ||||
|         buffer_init(&clnt->buf, &clnt->io, &clnt->tm); | ||||
|         return 1; | ||||
|     } else { | ||||
|         lua_pushnil(L);  | ||||
|         lua_pushstring(L, socket_strerror(err)); | ||||
|         return 2; | ||||
|     } | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Binds an object to an address  | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static const char *unix_trybind(p_unix un, const char *path) { | ||||
| #ifndef _WIN32 | ||||
|     struct sockaddr_un local; | ||||
|     size_t len = strlen(path); | ||||
|     int err; | ||||
|     if (len >= sizeof(local.sun_path)) return "path too long"; | ||||
|     memset(&local, 0, sizeof(local)); | ||||
|     strcpy(local.sun_path, path); | ||||
|     local.sun_family = AF_UNIX; | ||||
| #ifdef UNIX_HAS_SUN_LEN | ||||
|     local.sun_len = sizeof(local.sun_family) + sizeof(local.sun_len)  | ||||
|         + len + 1; | ||||
|     err = socket_bind(&un->sock, (SA *) &local, local.sun_len); | ||||
|  | ||||
| #else  | ||||
|     err = socket_bind(&un->sock, (SA *) &local,  | ||||
|             sizeof(local.sun_family) + len); | ||||
| #endif | ||||
|     if (err != IO_DONE) socket_destroy(&un->sock); | ||||
|     return socket_strerror(err);  | ||||
| #else | ||||
| 	return NULL; | ||||
| #endif | ||||
| } | ||||
|  | ||||
| static int unix_meth_bind(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkclass(L, "unix{master}", 1); | ||||
|     const char *path =  luaL_checkstring(L, 2); | ||||
|     const char *err = unix_trybind(un, path); | ||||
|     if (err) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, err); | ||||
|         return 2; | ||||
|     } | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Turns a master unix object into a client object. | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static const char *unix_tryconnect(p_unix un, const char *path) | ||||
| { | ||||
| #ifndef _WIN32 | ||||
|     struct sockaddr_un remote; | ||||
|     int err; | ||||
|     size_t len = strlen(path); | ||||
|     if (len >= sizeof(remote.sun_path)) return "path too long"; | ||||
|     memset(&remote, 0, sizeof(remote)); | ||||
|     strcpy(remote.sun_path, path); | ||||
|     remote.sun_family = AF_UNIX; | ||||
|     timeout_markstart(&un->tm); | ||||
| #ifdef UNIX_HAS_SUN_LEN | ||||
|     remote.sun_len = sizeof(remote.sun_family) + sizeof(remote.sun_len)  | ||||
|         + len + 1; | ||||
|     err = socket_connect(&un->sock, (SA *) &remote, remote.sun_len, &un->tm); | ||||
| #else | ||||
|     err = socket_connect(&un->sock, (SA *) &remote,  | ||||
|             sizeof(remote.sun_family) + len, &un->tm); | ||||
| #endif | ||||
|     if (err != IO_DONE) socket_destroy(&un->sock); | ||||
|     return socket_strerror(err); | ||||
| #else | ||||
| 	return NULL; | ||||
| #endif | ||||
| } | ||||
|  | ||||
| static int unix_meth_connect(lua_State *L) | ||||
| { | ||||
|     p_unix un = (p_unix) auxiliar_checkclass(L, "unix{master}", 1); | ||||
|     const char *path =  luaL_checkstring(L, 2); | ||||
|     const char *err = unix_tryconnect(un, path); | ||||
|     if (err) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, err); | ||||
|         return 2; | ||||
|     } | ||||
|     /* turn master object into a client object */ | ||||
|     auxiliar_setclass(L, "unix{client}", 1); | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Closes socket used by object  | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int unix_meth_close(lua_State *L) | ||||
| { | ||||
|     p_unix un = (p_unix) auxiliar_checkgroup(L, "unix{any}", 1); | ||||
|     socket_destroy(&un->sock); | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Puts the sockt in listen mode | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int unix_meth_listen(lua_State *L) | ||||
| { | ||||
|     p_unix un = (p_unix) auxiliar_checkclass(L, "unix{master}", 1); | ||||
|     int backlog = (int) luaL_optnumber(L, 2, 32); | ||||
|     int err = socket_listen(&un->sock, backlog); | ||||
|     if (err != IO_DONE) { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, socket_strerror(err)); | ||||
|         return 2; | ||||
|     } | ||||
|     /* turn master object into a server object */ | ||||
|     auxiliar_setclass(L, "unix{server}", 1); | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Shuts the connection down partially | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int unix_meth_shutdown(lua_State *L) | ||||
| { | ||||
|     /* SHUT_RD,  SHUT_WR,  SHUT_RDWR  have  the value 0, 1, 2, so we can use method index directly */ | ||||
|     static const char* methods[] = { "receive", "send", "both", NULL }; | ||||
|     p_unix tcp = (p_unix) auxiliar_checkclass(L, "unix{client}", 1); | ||||
|     int how = luaL_checkoption(L, 2, "both", methods); | ||||
|     socket_shutdown(&tcp->sock, how); | ||||
|     lua_pushnumber(L, 1); | ||||
|     return 1; | ||||
| } | ||||
|  | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Just call tm methods | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int unix_meth_settimeout(lua_State *L) { | ||||
|     p_unix un = (p_unix) auxiliar_checkgroup(L, "unix{any}", 1); | ||||
|     return timeout_meth_settimeout(L, &un->tm); | ||||
| } | ||||
|  | ||||
| /*=========================================================================*\ | ||||
| * Library functions | ||||
| \*=========================================================================*/ | ||||
| /*-------------------------------------------------------------------------*\ | ||||
| * Creates a master unix object  | ||||
| \*-------------------------------------------------------------------------*/ | ||||
| static int unix_global_create(lua_State *L) { | ||||
|     t_socket sock; | ||||
|     int err = socket_create(&sock, AF_UNIX, SOCK_STREAM, 0); | ||||
|     /* try to allocate a system socket */ | ||||
|     if (err == IO_DONE) {  | ||||
|         /* allocate unix object */ | ||||
|         p_unix un = (p_unix) lua_newuserdata(L, sizeof(t_unix)); | ||||
|         /* set its type as master object */ | ||||
|         auxiliar_setclass(L, "unix{master}", -1); | ||||
|         /* initialize remaining structure fields */ | ||||
|         socket_setnonblocking(&sock); | ||||
|         un->sock = sock; | ||||
|         io_init(&un->io, (p_send) socket_send, (p_recv) socket_recv,  | ||||
|                 (p_error) socket_ioerror, &un->sock); | ||||
|         timeout_init(&un->tm, -1, -1); | ||||
|         buffer_init(&un->buf, &un->io, &un->tm); | ||||
|         return 1; | ||||
|     } else { | ||||
|         lua_pushnil(L); | ||||
|         lua_pushstring(L, socket_strerror(err)); | ||||
|         return 2; | ||||
|     } | ||||
| } | ||||
|  | ||||
| } // end NS_SLUA | ||||
							
								
								
									
										34
									
								
								Plugins/slua_unreal/External/luasocket/unix.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										34
									
								
								Plugins/slua_unreal/External/luasocket/unix.h
									
									
									
									
										vendored
									
									
										Normal file
									
								
							| @ -0,0 +1,34 @@ | ||||
| #ifndef UNIX_H | ||||
| #define UNIX_H | ||||
| /*=========================================================================*\ | ||||
| * Unix domain object | ||||
| * LuaSocket toolkit | ||||
| * | ||||
| * This module is just an example of how to extend LuaSocket with a new  | ||||
| * domain. | ||||
| \*=========================================================================*/ | ||||
| #include "lua.h" | ||||
|  | ||||
| #include "buffer.h" | ||||
| #include "timeout.h" | ||||
| #include "socket.h" | ||||
|  | ||||
| #ifndef UNIX_API | ||||
| #define UNIX_API extern | ||||
| #endif | ||||
|  | ||||
| namespace NS_SLUA {     | ||||
|  | ||||
| typedef struct t_unix_ { | ||||
|     t_socket sock; | ||||
|     t_io io; | ||||
|     t_buffer buf; | ||||
|     t_timeout tm; | ||||
| } t_unix; | ||||
| typedef t_unix *p_unix; | ||||
|  | ||||
| UNIX_API int luaopen_socket_unix(lua_State *L); | ||||
|  | ||||
| } // end NS_SLUA | ||||
|  | ||||
| #endif /* UNIX_H */ | ||||
Some files were not shown because too many files have changed in this diff Show More
		Reference in New Issue
	
	Block a user