003 File Manager
Current Path:
/usr/src/contrib/lua/src
usr
/
src
/
contrib
/
lua
/
src
/
📁
..
📄
Makefile
(7.34 KB)
📄
lapi.c
(34.08 KB)
📄
lapi.h
(1.27 KB)
📄
lauxlib.c
(30.94 KB)
📄
lauxlib.h
(8.64 KB)
📄
lbaselib.c
(14.44 KB)
📄
lcode.c
(49.85 KB)
📄
lcode.h
(3.71 KB)
📄
lcorolib.c
(4.57 KB)
📄
lctype.c
(2.4 KB)
📄
lctype.h
(2.07 KB)
📄
ldblib.c
(12.94 KB)
📄
ldebug.c
(24.61 KB)
📄
ldebug.h
(1.87 KB)
📄
ldo.c
(27.19 KB)
📄
ldo.h
(2.77 KB)
📄
ldump.c
(4.66 KB)
📄
lfunc.c
(8.95 KB)
📄
lfunc.h
(1.72 KB)
📄
lgc.c
(54.47 KB)
📄
lgc.h
(5.87 KB)
📄
linit.c
(1.58 KB)
📄
liolib.c
(21.25 KB)
📄
ljumptab.h
(1.62 KB)
📄
llex.c
(16.38 KB)
📄
llex.h
(2.35 KB)
📄
llimits.h
(8.72 KB)
📄
lmathlib.c
(18.43 KB)
📄
lmem.c
(5.83 KB)
📄
lmem.h
(3.29 KB)
📄
loadlib.c
(22.39 KB)
📄
lobject.c
(18.45 KB)
📄
lobject.h
(21.49 KB)
📄
lopcodes.c
(4.03 KB)
📄
lopcodes.h
(12.38 KB)
📄
lopnames.h
(1.12 KB)
📄
loslib.c
(11.53 KB)
📄
lparser.c
(54.72 KB)
📄
lparser.h
(5.8 KB)
📄
lprefix.h
(828 B)
📄
lstate.c
(10.73 KB)
📄
lstate.h
(13.24 KB)
📄
lstring.c
(7.32 KB)
📄
lstring.h
(1.57 KB)
📄
lstrlib.c
(52.83 KB)
📄
ltable.c
(29.89 KB)
📄
ltable.h
(1.92 KB)
📄
ltablib.c
(12.82 KB)
📄
ltm.c
(7.97 KB)
📄
ltm.h
(2.84 KB)
📄
lua.c
(18.46 KB)
📄
lua.h
(15.4 KB)
📄
lua.hpp
(191 B)
📄
luac.c
(14.79 KB)
📄
luaconf.h.dist
(20.27 KB)
📄
lualib.h
(1.16 KB)
📄
lundump.c
(7.68 KB)
📄
lundump.h
(863 B)
📄
lutf8lib.c
(7.9 KB)
📄
lvm.c
(55.76 KB)
📄
lvm.h
(4.25 KB)
📄
lzio.c
(1.29 KB)
📄
lzio.h
(1.4 KB)
Editing: lapi.h
/* ** $Id: lapi.h $ ** Auxiliary functions from Lua API ** See Copyright Notice in lua.h */ #ifndef lapi_h #define lapi_h #include "llimits.h" #include "lstate.h" /* Increments 'L->top', checking for stack overflows */ #define api_incr_top(L) {L->top++; api_check(L, L->top <= L->ci->top, \ "stack overflow");} /* ** If a call returns too many multiple returns, the callee may not have ** stack space to accommodate all results. In this case, this macro ** increases its stack space ('L->ci->top'). */ #define adjustresults(L,nres) \ { if ((nres) <= LUA_MULTRET && L->ci->top < L->top) L->ci->top = L->top; } /* Ensure the stack has at least 'n' elements */ #define api_checknelems(L,n) api_check(L, (n) < (L->top - L->ci->func), \ "not enough elements in the stack") /* ** To reduce the overhead of returning from C functions, the presence of ** to-be-closed variables in these functions is coded in the CallInfo's ** field 'nresults', in a way that functions with no to-be-closed variables ** with zero, one, or "all" wanted results have no overhead. Functions ** with other number of wanted results, as well as functions with ** variables to be closed, have an extra check. */ #define hastocloseCfunc(n) ((n) < LUA_MULTRET) #define codeNresults(n) (-(n) - 3) #endif
Upload File
Create Folder